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
|
/*
* 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 com.google.javascript.rhino.Node;
/**
* Tests for {@link CreateSyntheticBlocks}
*
*/
public class CreateSyntheticBlocksTest extends CompilerTestCase {
private static final String START_MARKER = "startMarker";
private static final String END_MARKER = "endMarker";
public CreateSyntheticBlocksTest() {
// Can't use compare as a tree because of the added synthetic blocks.
super("", false);
}
@Override
public void setUp() {
super.enableLineNumberCheck(false);
}
@Override
protected CompilerPass getProcessor(final Compiler compiler) {
return new CompilerPass() {
@Override
public void process(Node externs, Node js) {
new CreateSyntheticBlocks(compiler, START_MARKER, END_MARKER).process(
externs, js);
NodeTraversal.traverse(compiler, js, new MinimizeExitPoints(compiler));
new PeepholeOptimizationsPass(compiler,
new PeepholeRemoveDeadCode(),
new PeepholeSubstituteAlternateSyntax(true),
new PeepholeFoldConstants(true))
.process(externs, js);
new MinimizeExitPoints(compiler).process(externs, js);
new Denormalize(compiler).process(externs, js);
}
};
}
@Override
protected int getNumRepetitions() {
return 1;
}
// TODO(johnlenz): Add tests to the IntegrationTest.
public void testFold1() {
test("function f() { if (x) return; y(); }",
"function f(){x||y()}");
}
public void testFoldWithMarkers1() {
testSame("function f(){startMarker();if(x)return;endMarker();y()}");
}
public void testFoldWithMarkers1a() {
testSame("function f(){startMarker();if(x)return;endMarker()}");
}
public void testFold2() {
test("function f() { if (x) return; y(); if (a) return; b(); }",
"function f(){if(!x){y();a||b()}}");
}
public void testFoldWithMarkers2() {
testSame("function f(){startMarker(\"FOO\");startMarker(\"BAR\");" +
"if(x)return;endMarker(\"BAR\");y();if(a)return;" +
"endMarker(\"FOO\");b()}");
}
public void testUnmatchedStartMarker() {
testSame("startMarker()", CreateSyntheticBlocks.UNMATCHED_START_MARKER);
}
public void testUnmatchedEndMarker1() {
testSame("endMarker()", CreateSyntheticBlocks.UNMATCHED_END_MARKER);
}
public void testUnmatchedEndMarker2() {
test("if(y){startMarker();x()}endMarker()",
"if(y){startMarker();x()}endMarker()", null,
CreateSyntheticBlocks.UNMATCHED_END_MARKER);
}
public void testInvalid1() {
test("startMarker() && true",
"startMarker()", null,
CreateSyntheticBlocks.INVALID_MARKER_USAGE);
}
public void testInvalid2() {
test("false && endMarker()",
"", null,
CreateSyntheticBlocks.INVALID_MARKER_USAGE);
}
public void testDenormalize() {
testSame("startMarker();for(;;);endMarker()");
}
public void testNonMarkingUse() {
testSame("function foo(endMarker){}");
testSame("function foo(){startMarker:foo()}");
}
public void testContainingBlockPreservation() {
testSame("if(y){startMarker();x();endMarker()}");
}
}
|
