-
Notifications
You must be signed in to change notification settings - Fork 1.1k
/
PhaseOptimizerTest.java
227 lines (203 loc) · 7.16 KB
/
PhaseOptimizerTest.java
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
/*
* Copyright 2009 The Closure Compiler Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.google.javascript.jscomp;
import static com.google.common.truth.Truth.assertThat;
import com.google.common.collect.ImmutableList;
import com.google.javascript.jscomp.CompilerOptions.TracerMode;
import com.google.javascript.jscomp.PhaseOptimizer.Loop;
import com.google.javascript.rhino.Node;
import com.google.javascript.rhino.Token;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import junit.framework.TestCase;
/**
* Tests for {@link PhaseOptimizer}.
* @author nicksantos@google.com (Nick Santos)
*/
public final class PhaseOptimizerTest extends TestCase {
private final List<String> passesRun = new ArrayList<>();
private Node dummyExternsRoot;
private Node dummyRoot;
private PhaseOptimizer optimizer;
private Compiler compiler;
private PerformanceTracker tracker;
@Override
public void setUp() {
passesRun.clear();
dummyExternsRoot = new Node(Token.ROOT);
dummyRoot = new Node(Token.ROOT);
compiler = new Compiler();
compiler.initCompilerOptionsIfTesting();
tracker = new PerformanceTracker(dummyExternsRoot, dummyRoot, TracerMode.TIMING_ONLY, null);
optimizer = new PhaseOptimizer(compiler, tracker, null);
}
public void testOneRun() {
addOneTimePass("x");
assertPasses("x");
}
public void testLoop1() {
Loop loop = optimizer.addFixedPointLoop();
addLoopedPass(loop, "x", 0);
assertPasses("x");
}
public void testLoop2() {
Loop loop = optimizer.addFixedPointLoop();
addLoopedPass(loop, "x", 3);
assertPasses("x", "x", "x", "x");
}
public void testSchedulingOfLoopablePasses() {
Loop loop = optimizer.addFixedPointLoop();
addLoopedPass(loop, "x", 3);
addLoopedPass(loop, "y", 1);
// The pass iterations can be grouped as: [x y] [x y] [x] [x] [y]
assertPasses("x", "y", "x", "y", "x", "x", "y");
}
public void testNotInfiniteLoop() {
Loop loop = optimizer.addFixedPointLoop();
addLoopedPass(loop, "x", PhaseOptimizer.MAX_LOOPS - 1);
optimizer.process(null, dummyRoot);
assertEquals("There should be no errors.", 0, compiler.getErrorCount());
}
public void testInfiniteLoop() {
Loop loop = optimizer.addFixedPointLoop();
addLoopedPass(loop, "x", PhaseOptimizer.MAX_LOOPS + 1);
try {
optimizer.process(null, dummyRoot);
fail("Expected RuntimeException");
} catch (RuntimeException e) {
assertTrue(e.getMessage(),
e.getMessage().contains(PhaseOptimizer.OPTIMIZE_LOOP_ERROR));
}
}
public void testSchedulingOfAnyKindOfPasses1() {
addOneTimePass("a");
Loop loop = optimizer.addFixedPointLoop();
addLoopedPass(loop, "x", 3);
addLoopedPass(loop, "y", 1);
addOneTimePass("z");
assertPasses("a", "x", "y", "x", "y", "x", "x", "y", "z");
}
public void testSchedulingOfAnyKindOfPasses2() {
optimizer.consume(
ImmutableList.of(
createPassFactory("a", 0, true),
createPassFactory("b", 1, false),
createPassFactory("c", 2, false),
createPassFactory("d", 1, false),
createPassFactory("e", 1, true),
createPassFactory("f", 0, true)));
// The pass iterations can be grouped as:
// [a] [b c d] [b c d] [c] [b d] [e] [f]
assertPasses("a", "b", "c", "d", "b", "c", "d", "c", "b", "d", "e", "f");
}
public void testSchedulingOfAnyKindOfPasses3() {
optimizer.consume(
ImmutableList.of(
createPassFactory("a", 2, false),
createPassFactory("b", 1, true),
createPassFactory("c", 1, false)));
assertPasses("a", "a", "a", "b", "c", "c");
}
public void testSchedulingOfAnyKindOfPasses4() {
optimizer.consume(
ImmutableList.of(
createPassFactory("a", 2, true),
createPassFactory("b", 0, false),
createPassFactory("c", 0, false)));
assertPasses("a", "b", "c");
}
public void testDuplicateLoop() {
Loop loop = optimizer.addFixedPointLoop();
addLoopedPass(loop, "x", 1);
try {
addLoopedPass(loop, "x", 1);
fail("Expected exception");
} catch (IllegalArgumentException e) {
return;
}
}
public void testPassOrdering() {
Loop loop = optimizer.addFixedPointLoop();
List<String> optimalOrder = new ArrayList<>(
PhaseOptimizer.OPTIMAL_ORDER);
Random random = new Random();
while (!optimalOrder.isEmpty()) {
addLoopedPass(
loop, optimalOrder.remove(random.nextInt(optimalOrder.size())), 0);
}
optimizer.process(null, dummyRoot);
assertEquals(PhaseOptimizer.OPTIMAL_ORDER, passesRun);
}
public void testProgress() {
final List<Double> progressList = new ArrayList<>();
compiler = new Compiler() {
@Override void setProgress(double p, String name) {
progressList.add(p);
}
};
compiler.initCompilerOptionsIfTesting();
optimizer = new PhaseOptimizer(compiler, null,
new PhaseOptimizer.ProgressRange(0, 100));
addOneTimePass("x1");
addOneTimePass("x2");
addOneTimePass("x3");
addOneTimePass("x4");
optimizer.process(null, dummyRoot);
assertThat(progressList).hasSize(4);
assertEquals(25, Math.round(progressList.get(0)));
assertEquals(50, Math.round(progressList.get(1)));
assertEquals(75, Math.round(progressList.get(2)));
assertEquals(100, Math.round(progressList.get(3)));
}
public void assertPasses(String ... names) {
optimizer.process(null, dummyRoot);
assertEquals(ImmutableList.copyOf(names), passesRun);
}
private void addOneTimePass(String name) {
optimizer.addOneTimePass(
createPassFactory(name, 0, true));
}
private void addLoopedPass(Loop loop, String name, int numChanges) {
loop.addLoopedPass(
createPassFactory(name, numChanges, false));
}
private PassFactory createPassFactory(
String name, int numChanges, boolean isOneTime) {
return createPassFactory(name, createPass(name, numChanges), isOneTime);
}
private PassFactory createPassFactory(
String name, final CompilerPass pass, boolean isOneTime) {
return new PassFactory(name, isOneTime) {
@Override
protected CompilerPass create(AbstractCompiler compiler) {
return pass;
}
};
}
private CompilerPass createPass(final String name, int numChanges) {
final int[] numChangesClosure = new int[] {numChanges};
return new CompilerPass() {
@Override public void process(Node externs, Node root) {
passesRun.add(name);
if (numChangesClosure[0] > 0) {
compiler.reportCodeChange();
numChangesClosure[0] = numChangesClosure[0] - 1;
}
}
};
}
}