OLD | NEW |
---|---|
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 10 matching lines...) Expand all Loading... | |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
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 --harmony-scoping | 28 // Flags: --allow-natives-syntax --harmony-scoping |
29 // Test functionality of block scopes. | 29 // Test functionality of block scopes. |
30 | 30 |
31 // TODO(ES6): properly activate extended mode | 31 // TODO(ES6): properly activate extended mode |
rossberg
2014/06/04 12:54:53
Btw, we can remove this TODO now.
ulan
2014/06/04 14:02:05
Done.
| |
32 "use strict"; | 32 "use strict"; |
33 | 33 |
34 // Hoisting of var declarations. | 34 // Hoisting of var declarations. |
35 function f1() { | 35 function f1() { |
36 { | 36 { |
37 var x = 1; | 37 var x = 1; |
38 var y; | 38 var y; |
39 } | 39 } |
40 assertEquals(1, x) | 40 assertEquals(1, x) |
41 assertEquals(undefined, y) | 41 assertEquals(undefined, y) |
42 } | 42 } |
43 for (var j = 0; j < 5; ++j) f1(); | |
44 %OptimizeFunctionOnNextCall(f1); | |
43 f1(); | 45 f1(); |
44 | 46 assertTrue(%GetOptimizationStatus(f1) != 2); |
45 | 47 |
46 // Dynamic lookup in and through block contexts. | 48 // Dynamic lookup in and through block contexts. |
47 function f2(one) { | 49 function f2(one) { |
48 var x = one + 1; | 50 var x = one + 1; |
49 let y = one + 2; | 51 let y = one + 2; |
50 const u = one + 4; | 52 const u = one + 4; |
51 { | 53 { |
52 let z = one + 3; | 54 let z = one + 3; |
53 const v = one + 5; | 55 const v = one + 5; |
54 assertEquals(1, eval('one')); | 56 assertEquals(1, eval('one')); |
55 assertEquals(2, eval('x')); | 57 assertEquals(2, eval('x')); |
56 assertEquals(3, eval('y')); | 58 assertEquals(3, eval('y')); |
57 assertEquals(4, eval('z')); | 59 assertEquals(4, eval('z')); |
58 assertEquals(5, eval('u')); | 60 assertEquals(5, eval('u')); |
59 assertEquals(6, eval('v')); | 61 assertEquals(6, eval('v')); |
60 } | 62 } |
61 } | 63 } |
64 for (var j = 0; j < 5; ++j) f2(1); | |
65 %OptimizeFunctionOnNextCall(f2); | |
62 f2(1); | 66 f2(1); |
63 | 67 |
rossberg
2014/06/04 12:54:53
Why not assert optimization status here as well (a
ulan
2014/06/04 14:02:05
Did it for the function below. This function doesn
| |
64 | 68 |
65 // Lookup in and through block contexts. | 69 // Lookup in and through block contexts. |
66 function f3(one) { | 70 function f3(one) { |
67 var x = one + 1; | 71 var x = one + 1; |
68 let y = one + 2; | 72 let y = one + 2; |
69 const u = one + 4; | 73 const u = one + 4; |
70 { | 74 { |
71 let z = one + 3; | 75 let z = one + 3; |
72 const v = one + 5; | 76 const v = one + 5; |
73 assertEquals(1, one); | 77 assertEquals(1, one); |
74 assertEquals(2, x); | 78 assertEquals(2, x); |
75 assertEquals(3, y); | 79 assertEquals(3, y); |
76 assertEquals(4, z); | 80 assertEquals(4, z); |
77 assertEquals(5, u); | 81 assertEquals(5, u); |
78 assertEquals(6, v); | 82 assertEquals(6, v); |
79 | |
80 } | 83 } |
81 } | 84 } |
85 for (var j = 0; j < 5; ++j) f3(1); | |
86 %OptimizeFunctionOnNextCall(f3); | |
82 f3(1); | 87 f3(1); |
83 | 88 |
84 | 89 |
85 // Dynamic lookup from closure. | 90 // Dynamic lookup from closure. |
86 function f4(one) { | 91 function f4(one) { |
87 var x = one + 1; | 92 var x = one + 1; |
88 let y = one + 2; | 93 let y = one + 2; |
89 const u = one + 4; | 94 const u = one + 4; |
90 { | 95 { |
91 let z = one + 3; | 96 let z = one + 3; |
(...skipping 164 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
256 const_accessors[i] = function() { return z; } | 261 const_accessors[i] = function() { return z; } |
257 } | 262 } |
258 for (var j = 0; j < 10; j++) { | 263 for (var j = 0; j < 10; j++) { |
259 y = j + 10; | 264 y = j + 10; |
260 assertEquals(j, let_accessors[j]()); | 265 assertEquals(j, let_accessors[j]()); |
261 assertEquals(y, var_accessors[j]()); | 266 assertEquals(y, var_accessors[j]()); |
262 assertEquals(j, const_accessors[j]()); | 267 assertEquals(j, const_accessors[j]()); |
263 } | 268 } |
264 } | 269 } |
265 f8(); | 270 f8(); |
OLD | NEW |