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 | |
32 "use strict"; | 31 "use strict"; |
33 | 32 |
34 // Hoisting of var declarations. | 33 // Hoisting of var declarations. |
35 function f1() { | 34 function f1() { |
36 { | 35 { |
37 var x = 1; | 36 var x = 1; |
38 var y; | 37 var y; |
39 } | 38 } |
40 assertEquals(1, x) | 39 assertEquals(1, x) |
41 assertEquals(undefined, y) | 40 assertEquals(undefined, y) |
42 } | 41 } |
| 42 for (var j = 0; j < 5; ++j) f1(); |
| 43 %OptimizeFunctionOnNextCall(f1); |
43 f1(); | 44 f1(); |
44 | 45 assertTrue(%GetOptimizationStatus(f1) != 2); |
45 | 46 |
46 // Dynamic lookup in and through block contexts. | 47 // Dynamic lookup in and through block contexts. |
47 function f2(one) { | 48 function f2(one) { |
48 var x = one + 1; | 49 var x = one + 1; |
49 let y = one + 2; | 50 let y = one + 2; |
50 const u = one + 4; | 51 const u = one + 4; |
51 { | 52 { |
52 let z = one + 3; | 53 let z = one + 3; |
53 const v = one + 5; | 54 const v = one + 5; |
54 assertEquals(1, eval('one')); | 55 assertEquals(1, eval('one')); |
55 assertEquals(2, eval('x')); | 56 assertEquals(2, eval('x')); |
56 assertEquals(3, eval('y')); | 57 assertEquals(3, eval('y')); |
57 assertEquals(4, eval('z')); | 58 assertEquals(4, eval('z')); |
58 assertEquals(5, eval('u')); | 59 assertEquals(5, eval('u')); |
59 assertEquals(6, eval('v')); | 60 assertEquals(6, eval('v')); |
60 } | 61 } |
61 } | 62 } |
| 63 |
62 f2(1); | 64 f2(1); |
63 | 65 |
64 | |
65 // Lookup in and through block contexts. | 66 // Lookup in and through block contexts. |
66 function f3(one) { | 67 function f3(one) { |
67 var x = one + 1; | 68 var x = one + 1; |
68 let y = one + 2; | 69 let y = one + 2; |
69 const u = one + 4; | 70 const u = one + 4; |
70 { | 71 { |
71 let z = one + 3; | 72 let z = one + 3; |
72 const v = one + 5; | 73 const v = one + 5; |
73 assertEquals(1, one); | 74 assertEquals(1, one); |
74 assertEquals(2, x); | 75 assertEquals(2, x); |
75 assertEquals(3, y); | 76 assertEquals(3, y); |
76 assertEquals(4, z); | 77 assertEquals(4, z); |
77 assertEquals(5, u); | 78 assertEquals(5, u); |
78 assertEquals(6, v); | 79 assertEquals(6, v); |
79 | |
80 } | 80 } |
81 } | 81 } |
| 82 for (var j = 0; j < 5; ++j) f3(1); |
| 83 %OptimizeFunctionOnNextCall(f3); |
82 f3(1); | 84 f3(1); |
| 85 assertTrue(%GetOptimizationStatus(f3) != 2); |
| 86 |
83 | 87 |
84 | 88 |
85 // Dynamic lookup from closure. | 89 // Dynamic lookup from closure. |
86 function f4(one) { | 90 function f4(one) { |
87 var x = one + 1; | 91 var x = one + 1; |
88 let y = one + 2; | 92 let y = one + 2; |
89 const u = one + 4; | 93 const u = one + 4; |
90 { | 94 { |
91 let z = one + 3; | 95 let z = one + 3; |
92 const v = one + 5; | 96 const v = one + 5; |
(...skipping 163 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
256 const_accessors[i] = function() { return z; } | 260 const_accessors[i] = function() { return z; } |
257 } | 261 } |
258 for (var j = 0; j < 10; j++) { | 262 for (var j = 0; j < 10; j++) { |
259 y = j + 10; | 263 y = j + 10; |
260 assertEquals(j, let_accessors[j]()); | 264 assertEquals(j, let_accessors[j]()); |
261 assertEquals(y, var_accessors[j]()); | 265 assertEquals(y, var_accessors[j]()); |
262 assertEquals(j, const_accessors[j]()); | 266 assertEquals(j, const_accessors[j]()); |
263 } | 267 } |
264 } | 268 } |
265 f8(); | 269 f8(); |
OLD | NEW |