-
Notifications
You must be signed in to change notification settings - Fork 1.1k
/
CombinedCompilerPassTest.java
261 lines (216 loc) · 7.5 KB
/
CombinedCompilerPassTest.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
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
/*
* Copyright 2008 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.javascript.jscomp.NodeTraversal.Callback;
import com.google.javascript.jscomp.NodeTraversal.ScopedCallback;
import com.google.javascript.rhino.Node;
import com.google.javascript.rhino.Token;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import junit.framework.TestCase;
/**
*/
public final class CombinedCompilerPassTest extends TestCase {
private Compiler compiler;
/**
* Returns a Node tree with the post-order traversal a b c d e f g h i j k l m
* and the in-order traversal m d a b c h e f g l i j k:
*
* m
* ,---------|---------.
* d h l
* ,--|--. ,--|--. ,--|--.
* a b c e f g i j k
*
*/
private static Node createPostOrderAlphabet() {
Node a = Node.newString("a");
Node b = Node.newString("b");
Node c = Node.newString("c");
Node d = Node.newString("d");
Node e = Node.newString("e");
Node f = Node.newString("f");
Node g = Node.newString("g");
Node h = Node.newString("h");
Node i = Node.newString("i");
Node j = Node.newString("j");
Node k = Node.newString("k");
Node l = Node.newString("l");
Node m = Node.newString("m");
d.addChildToBack(a);
d.addChildToBack(b);
d.addChildToBack(c);
h.addChildToBack(e);
h.addChildToBack(f);
h.addChildToBack(g);
l.addChildToBack(i);
l.addChildToBack(j);
l.addChildToBack(k);
m.addChildToBack(d);
m.addChildToBack(h);
m.addChildToBack(l);
return m;
}
@Override
public void setUp() throws Exception {
super.setUp();
compiler = new Compiler();
compiler.initOptions(new CompilerOptions());
}
/**
* Concatenates contents of string nodes encountered in pre-order
* and post-order traversals. Abbreviates traversals by ignoring subtrees
* rooted with specified strings.
*/
private static class ConcatTraversal implements Callback {
private final StringBuilder visited = new StringBuilder();
private final StringBuilder shouldTraversed = new StringBuilder();
private final Set<String> ignoring = new HashSet<>();
ConcatTraversal ignore(String s) {
ignoring.add(s);
return this;
}
@Override
public void visit(NodeTraversal t, Node n, Node parent) {
assertEquals(Token.STRING, n.getToken());
visited.append(n.getString());
}
@Override
public boolean shouldTraverse(NodeTraversal t, Node n, Node parent) {
assertEquals(Token.STRING, n.getToken());
shouldTraversed.append(n.getString());
return !ignoring.contains(n.getString());
}
/** Returns strings concatenated during post-order traversal. */
String getVisited() {
return visited.toString();
}
/** Returns strings concatenated during pre-order traversal. */
String getShouldTraversed() {
return shouldTraversed.toString();
}
Collection<String> getIgnoring() {
return ignoring;
}
}
/**
* Collection of data for a traversal test. Contains the traversal callback
* and the expected pre- and post-order traversal results.
*/
private static class TestHelper {
private final ConcatTraversal traversal;
private final String expectedVisited;
private final String shouldTraverseExpected;
TestHelper(ConcatTraversal traversal, String expectedVisited,
String shouldTraverseExpected) {
this.traversal = traversal;
this.expectedVisited = expectedVisited;
this.shouldTraverseExpected = shouldTraverseExpected;
}
ConcatTraversal getTraversal() {
return traversal;
}
void checkResults() {
assertEquals(
"ConcatTraversal ignoring " + traversal.getIgnoring()
+ " has unexpected visiting order",
expectedVisited, traversal.getVisited());
assertEquals(
"ConcatTraversal ignoring " + traversal.getIgnoring()
+ " has unexpected traversal order",
shouldTraverseExpected, traversal.getShouldTraversed());
}
}
private static List<TestHelper> createStringTests() {
List<TestHelper> tests = new ArrayList<>();
tests.add(new TestHelper(
new ConcatTraversal(), "abcdefghijklm", "mdabchefglijk"));
tests.add(new TestHelper(
new ConcatTraversal().ignore("d"), "efghijklm", "mdhefglijk"));
tests.add(new TestHelper(
new ConcatTraversal().ignore("f"), "abcdeghijklm", "mdabchefglijk"));
tests.add(new TestHelper(new ConcatTraversal().ignore("m"), "", "m"));
return tests;
}
public void testIndividualPasses() {
for (TestHelper test : createStringTests()) {
CombinedCompilerPass pass =
new CombinedCompilerPass(compiler, test.getTraversal());
pass.process(null, createPostOrderAlphabet());
test.checkResults();
}
}
public void testCombinedPasses() {
List<TestHelper> tests = createStringTests();
Callback[] callbacks = new Callback[tests.size()];
int i = 0;
for (TestHelper test : tests) {
callbacks[i++] = test.getTraversal();
}
CombinedCompilerPass pass =
new CombinedCompilerPass(compiler, callbacks);
pass.process(null, createPostOrderAlphabet());
for (TestHelper test : tests) {
test.checkResults();
}
}
/**
* Records the scopes visited during an AST traversal. Abbreviates traversals
* by ignoring subtrees rooted with specified NAME nodes.
*/
private static class ScopeRecordingCallback implements ScopedCallback {
Set<Node> visitedScopes = new HashSet<>();
Set<String> ignoring = new HashSet<>();
void ignore(String name) {
ignoring.add(name);
}
@Override
public void enterScope(NodeTraversal t) {
visitedScopes.add(t.getScopeRoot());
}
@Override
public boolean shouldTraverse(NodeTraversal t, Node n, Node parent) {
return !n.isName() || !ignoring.contains(n.getString());
}
Set<Node> getVisitedScopes() {
return visitedScopes;
}
@Override
public void exitScope(NodeTraversal t) {
}
@Override
public void visit(NodeTraversal t, Node n, Node parent) {
}
}
public void testScopes() {
Node root =
compiler.parseTestCode("var y = function() { var x = function() { };}");
ScopeRecordingCallback c1 = new ScopeRecordingCallback();
c1.ignore("y");
ScopeRecordingCallback c2 = new ScopeRecordingCallback();
c2.ignore("x");
ScopeRecordingCallback c3 = new ScopeRecordingCallback();
CombinedCompilerPass pass = new CombinedCompilerPass(compiler, c1, c2, c3);
pass.process(null, root);
assertThat(c1.getVisitedScopes()).hasSize(1);
assertThat(c2.getVisitedScopes()).hasSize(3);
assertThat(c3.getVisitedScopes()).hasSize(5);
}
}