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
|
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
using System;
using System.Collections.Generic;
using System.IO;
using ILCompiler.DependencyAnalysisFramework;
using Xunit;
namespace ILCompiler.DependencyAnalysisFramework.Tests
{
public class DependencyTests
{
public DependencyTests()
{
}
/// <summary>
/// Test on every graph type. Used to ensure that the behavior of the various markers is consistent
/// </summary>
/// <param name="testGraph"></param>
private void TestOnGraphTypes(Action<TestGraph, DependencyAnalyzerBase<TestGraph>> testGraph)
{
// Test using the full logging strategy
TestGraph testGraphFull = new TestGraph();
DependencyAnalyzerBase<TestGraph> analyzerFull = new DependencyAnalyzer<FullGraphLogStrategy<TestGraph>, TestGraph>(testGraphFull, null);
testGraphFull.AttachToDependencyAnalyzer(analyzerFull);
testGraph(testGraphFull, analyzerFull);
TestGraph testGraphFirstMark = new TestGraph();
DependencyAnalyzerBase<TestGraph> analyzerFirstMark = new DependencyAnalyzer<FirstMarkLogStrategy<TestGraph>, TestGraph>(testGraphFirstMark, null);
testGraphFirstMark.AttachToDependencyAnalyzer(analyzerFirstMark);
testGraph(testGraphFirstMark, analyzerFirstMark);
TestGraph testGraphNoLog = new TestGraph();
DependencyAnalyzerBase<TestGraph> analyzerNoLog = new DependencyAnalyzer<NoLogStrategy<TestGraph>, TestGraph>(testGraphNoLog, null);
testGraphNoLog.AttachToDependencyAnalyzer(analyzerNoLog);
testGraph(testGraphNoLog, analyzerNoLog);
}
[Fact]
public void TestADependsOnB()
{
TestOnGraphTypes((TestGraph testGraph, DependencyAnalyzerBase<TestGraph> analyzer) =>
{
testGraph.AddStaticRule("A", "B", "A depends on B");
testGraph.AddRoot("A", "A is root");
List<string> results = testGraph.AnalysisResults;
Assert.Contains("A", results);
Assert.Contains("B", results);
});
}
[Fact]
public void TestADependsOnBIfC_NoC()
{
TestOnGraphTypes((TestGraph testGraph, DependencyAnalyzerBase<TestGraph> analyzer) =>
{
testGraph.AddConditionalRule("A", "C", "B", "A depends on B if C");
testGraph.AddRoot("A", "A is root");
List<string> results = testGraph.AnalysisResults;
Assert.Contains("A", results);
Assert.DoesNotContain("B", results);
Assert.DoesNotContain("C", results);
Assert.True(results.Count == 1);
});
}
[Fact]
public void TestADependsOnBIfC_HasC()
{
TestOnGraphTypes((TestGraph testGraph, DependencyAnalyzerBase<TestGraph> analyzer) =>
{
testGraph.AddConditionalRule("A", "C", "B", "A depends on B if C");
testGraph.AddRoot("A", "A is root");
testGraph.AddRoot("C", "C is root");
List<string> results = testGraph.AnalysisResults;
Assert.Contains("A", results);
Assert.Contains("B", results);
Assert.Contains("C", results);
Assert.True(results.Count == 3);
});
}
[Fact]
public void TestSimpleDynamicRule()
{
TestOnGraphTypes((TestGraph testGraph, DependencyAnalyzerBase<TestGraph> analyzer) =>
{
testGraph.SetDynamicDependencyRule((string nodeA, string nodeB) =>
{
if (nodeA.EndsWith("*") && nodeB.StartsWith("*"))
{
return new Tuple<string, string>(nodeA + nodeB, "DynamicRule");
}
return null;
});
testGraph.AddRoot("A*", "A* is root");
testGraph.AddRoot("B*", "B* is root");
testGraph.AddRoot("*C", "*C is root");
testGraph.AddRoot("*D", "*D is root");
testGraph.AddRoot("A*B", "A*B is root");
List<string> results = testGraph.AnalysisResults;
Assert.Contains("A*", results);
Assert.Contains("B*", results);
Assert.Contains("*C", results);
Assert.Contains("*D", results);
Assert.Contains("A*B", results);
Assert.Contains("A**C", results);
Assert.Contains("A**D", results);
Assert.Contains("B**C", results);
Assert.Contains("B**D", results);
Assert.True(results.Count == 9);
});
}
private void BuildGraphUsingAllTypesOfRules(TestGraph testGraph, DependencyAnalyzerBase<TestGraph> analyzer)
{
testGraph.SetDynamicDependencyRule((string nodeA, string nodeB) =>
{
if (nodeA.EndsWith("*") && nodeB.StartsWith("*"))
{
return new Tuple<string, string>(nodeA + nodeB, "DynamicRule");
}
return null;
});
testGraph.AddConditionalRule("A**C", "B**D", "D", "A**C depends on D if B**D");
testGraph.AddStaticRule("D", "E", "D depends on E");
// Rules to ensure that there are some nodes that have multiple reasons to exist
testGraph.AddStaticRule("A*", "E", "A* depends on E");
testGraph.AddStaticRule("*C", "E", "*C depends on E");
testGraph.AddRoot("A*", "A* is root");
testGraph.AddRoot("B*", "B* is root");
testGraph.AddRoot("*C", "*C is root");
testGraph.AddRoot("*D", "*D is root");
testGraph.AddRoot("A*B", "A*B is root");
List<string> results = testGraph.AnalysisResults;
Assert.Contains("A*", results);
Assert.Contains("B*", results);
Assert.Contains("*C", results);
Assert.Contains("*D", results);
Assert.Contains("A*B", results);
Assert.Contains("A**C", results);
Assert.Contains("A**D", results);
Assert.Contains("B**C", results);
Assert.Contains("B**D", results);
Assert.Contains("D", results);
Assert.Contains("E", results);
Assert.True(results.Count == 11);
}
[Fact]
public void TestDGMLOutput()
{
Dictionary<string, string> dgmlOutputs = new Dictionary<string, string>();
TestOnGraphTypes((TestGraph testGraph, DependencyAnalyzerBase<TestGraph> analyzer) =>
{
BuildGraphUsingAllTypesOfRules(testGraph, analyzer);
MemoryStream dgmlOutput = new MemoryStream();
DgmlWriter.WriteDependencyGraphToStream(dgmlOutput, analyzer, testGraph);
dgmlOutput.Seek(0, SeekOrigin.Begin);
TextReader tr = new StreamReader(dgmlOutput);
dgmlOutputs[analyzer.GetType().FullName] = tr.ReadToEnd();
});
foreach (var pair in dgmlOutputs)
{
int nodeCount = pair.Value.Split(new string[] { "<Node " }, StringSplitOptions.None).Length - 1;
int edgeCount = pair.Value.Split(new string[] { "<Link " }, StringSplitOptions.None).Length - 1;
if (pair.Key.Contains("FullGraph"))
{
Assert.Equal(21, nodeCount);
Assert.Equal(23, edgeCount);
}
else if (pair.Key.Contains("FirstMark"))
{
// There are 2 edges in the all types of rules graph that are duplicates. Note that the edge count is
// 2 less than the full graph edge count
Assert.Equal(21, nodeCount);
Assert.Equal(21, edgeCount);
}
else
{
Assert.Contains("NoLog", pair.Key);
Assert.Equal(11, nodeCount);
Assert.Equal(0, edgeCount);
}
}
}
}
}
|
