OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 13 matching lines...) Expand all Loading... |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 // Flags: --allow-natives-syntax | 28 // Flags: --allow-natives-syntax |
29 | 29 |
30 var S1 = "string1"; | 30 var S1 = "string1"; |
31 var S2 = "@@string2"; | 31 var S2 = "@@string2"; |
32 | 32 |
33 function dead1(a, b) { | 33 function dead1(a, b) { |
34 var x = %StringCharCodeAt(a, 4); | 34 var x = %_StringCharCodeAt(a, 4); |
35 return a; // x is dead code | 35 return a; // x is dead code |
36 } | 36 } |
37 | 37 |
38 function dead2(a, b) { | 38 function dead2(a, b) { |
39 var x = %StringCharCodeAt(a, 3); | 39 var x = %_StringCharCodeAt(a, 3); |
40 var y = %StringCharCodeAt(b, 1); | 40 var y = %_StringCharCodeAt(b, 1); |
41 return a; // x and y are both dead | 41 return a; // x and y are both dead |
42 } | 42 } |
43 | 43 |
44 function dead3(a, b) { | 44 function dead3(a, b) { |
45 a = a ? "11" : "12"; | 45 a = a ? "11" : "12"; |
46 b = b ? "13" : "14"; | 46 b = b ? "13" : "14"; |
47 var x = %StringCharCodeAt(a, 2); | 47 var x = %_StringCharCodeAt(a, 2); |
48 var y = %StringCharCodeAt(b, 0); | 48 var y = %_StringCharCodeAt(b, 0); |
49 return a; // x and y are both dead | 49 return a; // x and y are both dead |
50 } | 50 } |
51 | 51 |
52 function test() { | 52 function test() { |
53 var S3 = S1 + S2; | 53 var S3 = S1 + S2; |
54 | 54 |
55 assertEquals(S1, dead1(S1, S2)); | 55 assertEquals(S1, dead1(S1, S2)); |
56 assertEquals(S1, dead2(S1, S2)); | 56 assertEquals(S1, dead2(S1, S2)); |
57 assertEquals("11", dead3(S1, S2)); | 57 assertEquals("11", dead3(S1, S2)); |
58 | 58 |
(...skipping 13 matching lines...) Expand all Loading... |
72 assertEquals("true", dead2("true", S3)); | 72 assertEquals("true", dead2("true", S3)); |
73 assertEquals("11", dead3("true", 0)); | 73 assertEquals("11", dead3("true", 0)); |
74 } | 74 } |
75 | 75 |
76 test(); | 76 test(); |
77 test(); | 77 test(); |
78 %OptimizeFunctionOnNextCall(dead1); | 78 %OptimizeFunctionOnNextCall(dead1); |
79 %OptimizeFunctionOnNextCall(dead2); | 79 %OptimizeFunctionOnNextCall(dead2); |
80 %OptimizeFunctionOnNextCall(dead3); | 80 %OptimizeFunctionOnNextCall(dead3); |
81 test(); | 81 test(); |
OLD | NEW |