blob: f239a8faf28f510e1c1a2518acf61c2635007fec (
plain)
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
|
function expensive() {
with({}) {}
}
function phi_merge_0(i) {
// These computations can overflow, if the output is not truncated.
i = i | 0;
var a0 = i + i;
var a1 = i + i;
if ((a1 | 0) - ((2 * i) | 0)) {
// Good candidate for branch pruning, which marks only a1 as having
// removed uses.
expensive();
expensive();
expensive();
expensive();
expensive();
}
// Simple branch made to let GVN merge the Phi instructions.
if (a1 % 3 == 1) {
a1 = 2 * i;
a0 = 2 * i;
}
// a0 is never used, but a1 is truncated.
return a1 | 0;
}
function phi_merge_1(i) {
// These computations can overflow, if the output is not truncated.
i = i | 0;
var a1 = i + i;
var a0 = i + i;
if ((a1 | 0) - ((2 * i) | 0)) {
// Good candidate for branch pruning, which marks only a1 as having
// removed uses.
expensive();
expensive();
expensive();
expensive();
expensive();
}
// Simple branch made to let GVN merge the Phi instructions.
if (a1 % 3 == 1) {
a1 = 2 * i;
a0 = 2 * i;
}
// a0 is never used, but a1 is truncated.
return a1 | 0;
}
for (var j = 0; j < 300; j++) {
for (var i = 1; i == (i | 0); i = 2 * i + 1) {
assertEq(phi_merge_0(i) < 0x80000000, true);
assertEq(phi_merge_1(i) < 0x80000000, true);
}
}
|
