-
Notifications
You must be signed in to change notification settings - Fork 1.1k
/
FunctionToBlockMutatorTest.java
309 lines (266 loc) · 9.04 KB
/
FunctionToBlockMutatorTest.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
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
/*
* 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.base.Preconditions.checkState;
import com.google.javascript.jscomp.AbstractCompiler.LifeCycleStage;
import com.google.javascript.jscomp.NodeTraversal.Callback;
import com.google.javascript.rhino.IR;
import com.google.javascript.rhino.Node;
import com.google.javascript.rhino.Token;
import junit.framework.TestCase;
/**
* @author johnlenz@google.com (John Lenz)
*/
public final class FunctionToBlockMutatorTest extends TestCase {
public void testMutateNoReturnWithoutResultAssignment() {
helperMutate(
"function foo(){}; foo();",
"{}",
"foo");
}
public void testMutateNoReturnWithResultAssignment() {
helperMutate(
"function foo(){}; var result = foo();",
"{result = void 0}",
"foo", true, false);
}
public void testMutateNoValueReturnWithoutResultAssignment() {
helperMutate(
"function foo(){return;}; foo();",
"{}",
"foo", null);
}
public void testMutateNoValueReturnWithResultAssignment() {
helperMutate(
"function foo(){return;}; var result = foo();",
"{result = void 0}",
"foo");
}
public void testMutateValueReturnWithoutResultAssignment() {
helperMutate(
"function foo(){return true;}; foo();",
"{true;}",
"foo", null);
}
public void testMutateValueReturnWithResultAssignment() {
helperMutate(
"function foo(){return true;}; var x=foo();",
"{x=true}",
"foo", "x", true, false);
}
public void testMutateWithMultipleReturns() {
helperMutate(
"function foo(){ if (0) {return 0} else {return 1} };" +
"var result=foo();",
"{" +
"JSCompiler_inline_label_foo_0:{" +
"if(0) {" +
"result=0; break JSCompiler_inline_label_foo_0" +
"} else {" +
"result=1; break JSCompiler_inline_label_foo_0" +
"} result=void 0" +
"}" +
"}",
"foo", true, false);
}
public void testMutateWithParameters1() {
// Simple call with useless parameter
helperMutate(
"function foo(a){return true;}; foo(x);",
"{true}",
"foo", null);
}
public void testMutateWithParameters2() {
// Simple call with parameter
helperMutate(
"function foo(a){return x;}; foo(x);",
"{x}",
"foo", null);
}
public void testMutateWithParameters3() {
// Parameter has side-effects.
helperMutate(
"function foo(a){return a;}; " +
"function x() { foo(x++); }",
"{x++;}",
"foo", null);
}
public void testMutate8() {
// Parameter has side-effects.
helperMutate(
"function foo(a){return a+a;}; foo(x++);",
"{var a$jscomp$inline_0 = x++;" +
"a$jscomp$inline_0 + a$jscomp$inline_0;}",
"foo", null);
}
public void testMutateInitializeUninitializedVars1() {
helperMutate(
"function foo(a){var b;return a;}; foo(1);",
"{var b$jscomp$inline_1=void 0;1}",
"foo", null, false, true);
}
public void testMutateInitializeUninitializedVars2() {
helperMutate(
"function foo(a){for(var b in c)return a;}; foo(1);",
"{JSCompiler_inline_label_foo_2:" +
"{" +
"for(var b$jscomp$inline_1 in c){" +
"1;break JSCompiler_inline_label_foo_2" +
"}" +
"}" +
"}",
"foo", null);
}
public void testMutateCallInLoopVars1() {
// baseline: outside a loop, the constant remains constant.
boolean callInLoop = false;
helperMutate(
"function foo(a){var B = bar(); a;}; foo(1);",
"{var B$jscomp$inline_1=bar(); 1;}",
"foo", null, false, callInLoop);
// ... in a loop, the constant-ness is removed.
// TODO(johnlenz): update this test to look for the const annotation.
callInLoop = true;
helperMutate(
"function foo(a){var B = bar(); a;}; foo(1);",
"{var B$jscomp$inline_1 = bar(); 1;}",
"foo", null, false, callInLoop);
}
public void testMutateFunctionDefinition() {
// function declarations are rewritten as function
// expressions
helperMutate(
"function foo(a){function g(){}}; foo(1);",
"{var g$jscomp$inline_1=function(){};}",
"foo", null);
}
public void helperMutate(
String code, final String expectedResult, final String fnName) {
helperMutate(code, expectedResult, fnName, false, false);
}
public void helperMutate(
String code, final String expectedResult, final String fnName,
final boolean needsDefaultResult,
final boolean isCallInLoop) {
helperMutate(code, expectedResult, fnName,
"result", needsDefaultResult, isCallInLoop);
}
public void helperMutate(
String code, final String expectedResult, final String fnName,
final String resultName) {
helperMutate(code, expectedResult, fnName, resultName, false, false);
}
private void validateSourceInfo(Compiler compiler, Node subtree) {
(new LineNumberCheck(compiler)).setCheckSubTree(subtree);
// Source information problems are reported as compiler errors.
if (compiler.getErrorCount() != 0) {
String msg = "Error encountered: ";
for (JSError err : compiler.getErrors()) {
msg += err + "\n";
}
assertEquals(msg, 0, compiler.getErrorCount());
}
}
public void helperMutate(
String code, final String expectedResult, final String fnName,
final String resultName,
final boolean needsDefaultResult,
final boolean isCallInLoop) {
final Compiler compiler = new Compiler();
final FunctionToBlockMutator mutator = new FunctionToBlockMutator(
compiler, compiler.getUniqueNameIdSupplier());
Node expectedRoot = parse(compiler, expectedResult);
checkState(compiler.getErrorCount() == 0);
final Node expected = expectedRoot.getFirstChild();
final Node script = parse(compiler, code);
checkState(compiler.getErrorCount() == 0);
compiler.externsRoot = new Node(Token.ROOT);
compiler.jsRoot = IR.root(script);
compiler.externAndJsRoot = IR.root(compiler.externsRoot, compiler.jsRoot);
MarkNoSideEffectCalls mark = new MarkNoSideEffectCalls(compiler);
mark.process(compiler.externsRoot, compiler.jsRoot);
final Node fnNode = findFunction(script, fnName);
// Fake precondition.
compiler.setLifeCycleStage(LifeCycleStage.NORMALIZED);
// inline tester
Method tester = new Method() {
@Override
public boolean call(NodeTraversal t, Node n, Node parent) {
Node result = mutator.mutate(
fnName, fnNode, n, resultName,
needsDefaultResult, isCallInLoop);
validateSourceInfo(compiler, result);
String explanation = expected.checkTreeEquals(result);
assertNull("\nExpected: " + compiler.toSource(expected) +
"\nResult: " + compiler.toSource(result) +
"\n" + explanation, explanation);
return true;
}
};
compiler.resetUniqueNameId();
TestCallback test = new TestCallback(fnName, tester);
NodeTraversal.traverseEs6(compiler, script, test);
}
interface Method {
boolean call(NodeTraversal t, Node n, Node parent);
}
static class TestCallback implements Callback {
private final String callname;
private final Method method;
private boolean complete = false;
TestCallback(String callname, Method method) {
this.callname = callname;
this.method = method;
}
@Override
public boolean shouldTraverse(
NodeTraversal nodeTraversal, Node n, Node parent) {
return !complete;
}
@Override
public void visit(NodeTraversal t, Node n, Node parent) {
if (n.isCall()) {
Node first = n.getFirstChild();
if (first.isName() &&
first.getString().equals(callname)) {
complete = method.call(t, n, parent);
}
}
if (parent == null) {
assertTrue(complete);
}
}
}
private static Node findFunction(Node n, String name) {
if (n.isFunction()) {
if (n.getFirstChild().getString().equals(name)) {
return n;
}
}
for (Node c : n.children()) {
Node result = findFunction(c, name);
if (result != null) {
return result;
}
}
return null;
}
private static Node parse(Compiler compiler, String js) {
Node n = compiler.parseTestCode(js);
assertEquals(0, compiler.getErrorCount());
return n;
}
}