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
|
function finall(x) {
x = +x;
var a = +5;
a = +x;
a = 17;
a = +44;
a = +44.0;
a = +44.9;
a = +12.78e5;
a = +12e10;
a = -x;
a = -17;
a = -44;
a = -44.0;
a = -44.9;
a = -12.78e5;
a = -12e10;
a = +-x;
a = +-17;
a = +-44;
a = +-44.0;
a = +-44.9;
a = +-12.78e5;
a = +-12e10;
a = +0x8000000000000000;
a = +-0x8000000000000000;
a = -+0x8000000000000000;
a = -0x8000000000000000;
a = +0xffffffffffff;
a = +0xde0b6b000000000;
a = +-0xde0b6b000000000;
a = -+0xde0b6b000000000;
a = -0xde0b6b000000000;
a = +0x3ce7184d470dd60000;
f(g() & -1);
x = 1.7976931348623157e+308;
a = 9007199254740992; // 2^53, the largest integer that can be represented in a double such that all smaller integers are also representable.
a = 9007199254740993; // 2^53 + 1 cannot be represented as double.
a = 9007199254740994; // This is again representable as double.
return +12e10;
}
function looop() {
while (1) {
do_it();
if (condition()) {
break;
}
}
while (1) {
do_it();
if (a > b) {
break;
}
}
while (1) {
do_it();
if (!x()) {
break;
}
}
while (1) {
do_it();
if (a()) continue; // we cannot move to do-while, continue will hit the while check
if (!x()) {
break;
}
}
while (1) {
do_it();
do {
if (a()) continue; // ok to optimize, continue is not for us
} while (b());
if (!x()) {
break;
}
}
while (1) {
do_it();
while (b()) {
if (a()) continue; // also ok to optimize, continue is not for us
}
if (!x()) {
break;
}
}
X: while (1) {
do_it();
while (b()) {
if (a()) continue X; // not ok to optimize
}
if (!x()) {
break;
}
}
while (1) {
blah();
if (shah()) {
a = b;
break;
}
}
LABELED: while (1) {
blah();
if (shah()) {
c = d;
break;
}
}
while (1) {
blah();
if (check) break; // prevents optimization
if (shah()) {
e = f;
break;
}
}
while (1) {
blah();
while (1) {
if (check) break; // safe to optimize
}
if (shah()) {
g = h;
break;
}
}
if (a) { waka(); }
if (a) { waka(); } else { wala(); }
if (a) { if (a) { waka(); } else { wala(); } }
if (a) { if (a) { waka(); } } else { other(); }
if (a) { if (a) { waka(); } else { wala(); } } else { other(); }
}
function conditions() {
if (!((HEAP32[$incdec_ptr71_i + 8 >> 2] | 0) == 0)) {
shoo();
}
if (x == 0) y();
if ((x | 0) == 0) y();
if (0 == (y | 0)) z();
if (x != 0) y();
if ((x | 0) != 0) y();
if (0 != (y | 0)) z();
if (!((x | 0) == 0)) y();
if (!(0 != (x | 0))) y();
if (!(s() | 0)) z();
if ((x + 4 | 0) != 0) y();
if ((x & 4 | 0) != 0) y();
}
// EMSCRIPTEN_GENERATED_FUNCTIONS: ["finall", "looop", "conditions"]
|
