-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathCycleFinderTests.cs
330 lines (249 loc) · 13.2 KB
/
CycleFinderTests.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
using CodeParser.Analysis.Cycles;
using Contracts.Graph;
namespace CodeParserTests;
[TestFixture]
public partial class CycleFinderTests
{
[Test]
public void FindClassCycle()
{
var codeGraph = new TestCodeGraph();
var classA = codeGraph.CreateClass("ClassA");
var classB = codeGraph.CreateClass("ClassB");
classA.Relationships.Add(new Relationship(classA.Id, classB.Id, RelationshipType.Uses));
classB.Relationships.Add(new Relationship(classB.Id, classA.Id, RelationshipType.Uses));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(1, groups.Count);
}
[Test]
public void PinSignalViewRegression()
{
var codeGraph = new TestCodeGraph();
var view = codeGraph.CreateClass("View");
var peer = codeGraph.CreateClass("AutomationPeer");
var createPeer = codeGraph.CreateMethod("View.OnCreatePeer", view);
var owner = codeGraph.CreateField("AutomationPeer._owner", peer);
var ctor = codeGraph.CreateMethod("AutomationPeer.ctor", peer);
createPeer.Relationships.Add(new Relationship(createPeer.Id, peer.Id, RelationshipType.Creates));
ctor.Relationships.Add(new Relationship(ctor.Id, view.Id, RelationshipType.Uses));
owner.Relationships.Add(new Relationship(owner.Id, view.Id, RelationshipType.Uses));
var groups = CycleFinder.FindCycleGroups(codeGraph);
//var export = new DgmlExport();
//export.Export("d:\\out.dgml", codeGraph);
Assert.AreEqual(1, groups.Count);
Assert.AreEqual(5, groups.First().CodeGraph.Nodes.Count);
}
[Test]
public void Regression_NestedClasses()
{
// Actually after thinking about this constellation I think it is not a cycle.
// Enum is a type like class and they should be treated equally.
var codeGraph = new TestCodeGraph();
// 10 elements, 7 used in SCC.
var classParent = codeGraph.CreateClass("Class_Parent");
var methodInParent = codeGraph.CreateMethod("Method", classParent);
var classChild1 = codeGraph.CreateClass("Class_Child1", classParent);
var classChild2 = codeGraph.CreateClass("Class_Child2", classParent);
// Directly in parent
var enumInParent = codeGraph.CreateEnum("EnumInParent", classParent);
var field1 = codeGraph.CreateField("_field1", classChild1);
var field2 = codeGraph.CreateField("_field2", classChild2);
field1.Relationships.Add(new Relationship(field1.Id, enumInParent.Id, RelationshipType.Uses));
field2.Relationships.Add(new Relationship(field2.Id, enumInParent.Id, RelationshipType.Uses));
methodInParent.Relationships.Add(new Relationship(methodInParent.Id, classChild1.Id, RelationshipType.Uses));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(0, groups.Count);
//var export = new DgmlExport();
//export.Export("d:\\out.dgml", codeGraph);
}
[Test]
public void Regression_NestedNamespaces()
{
var codeGraph = new TestCodeGraph();
// 10 elements, 7 used in SCC.
var nsParent = codeGraph.CreateNamespace("NS_Parent");
var nsChild = codeGraph.CreateNamespace("NS_Child", nsParent);
// Directly in parent
var classNsParent = codeGraph.CreateClass("ClassInParent", nsParent);
var field1 = codeGraph.CreateField("_delegate1", classNsParent);
var classNsChild = codeGraph.CreateClass("ClassInChild", nsChild);
var delegateNsChild = codeGraph.CreateClass("DelegateInChild", nsChild);
var method = codeGraph.CreateMethod("Method", classNsChild);
// Just a reference from a cycle irrelevant namespace to the delegate in NS_Child
var nsIrrelevant = codeGraph.CreateNamespace("NS_Irrelevant", nsParent);
var classNsIrrelevant = codeGraph.CreateClass("ClassNsIrrelevant", nsIrrelevant);
var field2 = codeGraph.CreateField("_delegate2", classNsIrrelevant);
field1.Relationships.Add(new Relationship(field1.Id, delegateNsChild.Id, RelationshipType.Uses));
field2.Relationships.Add(new Relationship(field2.Id, delegateNsChild.Id, RelationshipType.Uses));
method.Relationships.Add(new Relationship(method.Id, classNsParent.Id, RelationshipType.Uses));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(1, groups.Count);
Assert.AreEqual(7, groups.First().CodeGraph.Nodes.Count);
//var export = new DgmlExport();
//export.Export("d:\\nested_namespaces.dgml", codeGraph);
}
[Test]
public void FindClassCycleViaField()
{
var codeGraph = new TestCodeGraph();
var classA = codeGraph.CreateClass("ClassA");
var classB = codeGraph.CreateClass("ClassB");
var fieldA = codeGraph.CreateField("ClassA.FieldA", classA);
var fieldB = codeGraph.CreateField("ClassA.FieldB", classB);
classA.Relationships.Add(new Relationship(fieldA.Id, classB.Id, RelationshipType.Uses));
classB.Relationships.Add(new Relationship(fieldB.Id, classA.Id, RelationshipType.Uses));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(1, groups.Count);
Assert.AreEqual(4, groups.First().CodeGraph.Nodes.Count);
}
[Test]
public void FindMethodCrossNamespaceCycle()
{
var codeGraph = new TestCodeGraph();
var ns1 = codeGraph.CreateNamespace("NS1");
var ns2 = codeGraph.CreateNamespace("NS2");
var classA = codeGraph.CreateClass("ClassA", ns1);
var classB = codeGraph.CreateClass("ClassB", ns2);
var methodAA = codeGraph.CreateMethod("ClassA.MethodA", classA);
var methodAB = codeGraph.CreateMethod("ClassA.MethodB", classA);
var methodBA = codeGraph.CreateMethod("ClassB.MethodA", classB);
var methodBB = codeGraph.CreateMethod("ClassB.MethodB", classB);
methodAA.Relationships.Add(new Relationship(methodAA.Id, methodBA.Id, RelationshipType.Calls));
methodBB.Relationships.Add(new Relationship(methodBB.Id, methodAB.Id, RelationshipType.Calls));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(1, groups.Count);
Assert.AreEqual(8, groups.First().CodeGraph.Nodes.Count);
}
[Test]
public void FindMethodCycle()
{
var codeGraph = new TestCodeGraph();
var classA = codeGraph.CreateClass("ClassA");
var classB = codeGraph.CreateClass("ClassB");
var methodA = codeGraph.CreateMethod("ClassA.MethodA", classA);
var methodB = codeGraph.CreateMethod("ClassB.MethodB", classB);
methodA.Relationships.Add(new Relationship(methodA.Id, methodB.Id, RelationshipType.Calls));
methodB.Relationships.Add(new Relationship(methodB.Id, methodA.Id, RelationshipType.Calls));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(1, groups.Count);
Assert.AreEqual(4, groups.First().CodeGraph.Nodes.Count);
}
[Test]
public void FindCycleInNestedNamespaces()
{
// Tests cycle detection between classes in nested namespaces.
var codeGraph = new TestCodeGraph();
var ns1 = codeGraph.CreateNamespace("NS1");
var ns2 = codeGraph.CreateNamespace("NS1.NS2", ns1);
var classA = codeGraph.CreateClass("ClassA", ns1);
var classB = codeGraph.CreateClass("ClassB", ns2);
classA.Relationships.Add(new Relationship(classA.Id, classB.Id, RelationshipType.Uses));
classB.Relationships.Add(new Relationship(classB.Id, classA.Id, RelationshipType.Uses));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(1, groups.Count);
Assert.AreEqual(4, groups.First().CodeGraph.Nodes.Count);
}
[Test]
public void FindCycleBetweenNestedClasses()
{
// Checks for cycles between nested classes within an outer class.
var codeGraph = new TestCodeGraph();
var outerClass = codeGraph.CreateClass("OuterClass");
var innerClassA = codeGraph.CreateClass("InnerClassA", outerClass);
var innerClassB = codeGraph.CreateClass("InnerClassB", outerClass);
innerClassA.Relationships.Add(new Relationship(innerClassA.Id, innerClassB.Id, RelationshipType.Uses));
innerClassB.Relationships.Add(new Relationship(innerClassB.Id, innerClassA.Id, RelationshipType.Uses));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(1, groups.Count);
Assert.AreEqual(2, groups.First().CodeGraph.Nodes.Count);
}
[Test]
public void FindCycleBetweenMethodAndNestedClass()
{
// Tests cycle detection between a method and a nested class.
var codeGraph = new TestCodeGraph();
var outerClass = codeGraph.CreateClass("OuterClass");
var innerClass = codeGraph.CreateClass("InnerClass", outerClass);
var method = codeGraph.CreateMethod("OuterClass.Method", outerClass);
method.Relationships.Add(new Relationship(method.Id, innerClass.Id, RelationshipType.Uses));
innerClass.Relationships.Add(new Relationship(innerClass.Id, method.Id, RelationshipType.Calls));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(1, groups.Count);
Assert.AreEqual(3, groups.First().CodeGraph.Nodes.Count);
}
[Test]
public void FindCycleBetweenNamespaceAndClass()
{
// Verifies cycle detection between a namespace and a class in another namespace.
// Not a realistic scenario, but useful for testing.
var codeGraph = new TestCodeGraph();
var ns1 = codeGraph.CreateNamespace("NS1");
var ns2 = codeGraph.CreateNamespace("NS2");
var classA = codeGraph.CreateClass("ClassA", ns1);
var classB = codeGraph.CreateClass("ClassB", ns2);
ns1.Relationships.Add(new Relationship(ns1.Id, classB.Id, RelationshipType.Uses));
classB.Relationships.Add(new Relationship(classB.Id, ns1.Id, RelationshipType.Uses));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(1, groups.Count);
// Note: ClassA is missing because there is no dependency in the original graph
// to or from ClassA
Assert.AreEqual(3, groups.First().CodeGraph.Nodes.Count);
}
[Test]
public void NoCycleBetweenContainedElements()
{
// Ensures that containment relationships don't create cycles.
var codeGraph = new TestCodeGraph();
var ns = codeGraph.CreateNamespace("NS");
var classA = codeGraph.CreateClass("ClassA", ns);
var methodA = codeGraph.CreateMethod("ClassA.MethodA", classA);
ns.Relationships.Add(new Relationship(ns.Id, classA.Id, RelationshipType.Containment));
classA.Relationships.Add(new Relationship(classA.Id, methodA.Id, RelationshipType.Containment));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(0, groups.Count);
}
[Test]
public void FindCycleBetweenInterfaceAndImplementingClass()
{
// Tests cycle detection between an interface and its implementing class.
var codeGraph = new TestCodeGraph();
var interfaceA = codeGraph.CreateInterface("InterfaceA");
var classA = codeGraph.CreateClass("ClassA");
classA.Relationships.Add(new Relationship(classA.Id, interfaceA.Id, RelationshipType.Implements));
interfaceA.Relationships.Add(new Relationship(interfaceA.Id, classA.Id, RelationshipType.Uses));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(1, groups.Count);
Assert.AreEqual(2, groups.First().CodeGraph.Nodes.Count);
}
[Test]
public void FindCycleBetweenEnumAndClass()
{
// Checks for cycles between an enum and a class.
var codeGraph = new TestCodeGraph();
var enumA = codeGraph.CreateEnum("EnumA");
var classA = codeGraph.CreateClass("ClassA");
classA.Relationships.Add(new Relationship(classA.Id, enumA.Id, RelationshipType.Uses));
enumA.Relationships.Add(new Relationship(enumA.Id, classA.Id, RelationshipType.Uses));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(1, groups.Count);
Assert.AreEqual(2, groups.First().CodeGraph.Nodes.Count);
}
[Test]
public void FindMultipleCyclesInGraph()
{
// Verifies that multiple distinct cycles in the graph are detected correctly.
var codeGraph = new TestCodeGraph();
var classA = codeGraph.CreateClass("ClassA");
var classB = codeGraph.CreateClass("ClassB");
var classC = codeGraph.CreateClass("ClassC");
var classD = codeGraph.CreateClass("ClassD");
classA.Relationships.Add(new Relationship(classA.Id, classB.Id, RelationshipType.Uses));
classB.Relationships.Add(new Relationship(classB.Id, classA.Id, RelationshipType.Uses));
classC.Relationships.Add(new Relationship(classC.Id, classD.Id, RelationshipType.Uses));
classD.Relationships.Add(new Relationship(classD.Id, classC.Id, RelationshipType.Uses));
var groups = CycleFinder.FindCycleGroups(codeGraph);
Assert.AreEqual(2, groups.Count);
Assert.AreEqual(2, groups[0].CodeGraph.Nodes.Count);
Assert.AreEqual(2, groups[1].CodeGraph.Nodes.Count);
}
}