| 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 24 matching lines...) Expand all Loading... |
| 35 { | 35 { |
| 36 var x = 1; | 36 var x = 1; |
| 37 var y; | 37 var y; |
| 38 } | 38 } |
| 39 assertEquals(1, x) | 39 assertEquals(1, x) |
| 40 assertEquals(undefined, y) | 40 assertEquals(undefined, y) |
| 41 } | 41 } |
| 42 for (var j = 0; j < 5; ++j) f1(); | 42 for (var j = 0; j < 5; ++j) f1(); |
| 43 %OptimizeFunctionOnNextCall(f1); | 43 %OptimizeFunctionOnNextCall(f1); |
| 44 f1(); | 44 f1(); |
| 45 assertTrue(%GetOptimizationStatus(f1) != 2); | 45 assertOptimized(f1); |
| 46 | 46 |
| 47 // Dynamic lookup in and through block contexts. | 47 // Dynamic lookup in and through block contexts. |
| 48 function f2(one) { | 48 function f2(one) { |
| 49 var x = one + 1; | 49 var x = one + 1; |
| 50 let y = one + 2; | 50 let y = one + 2; |
| 51 const u = one + 4; | 51 const u = one + 4; |
| 52 class a { static foo() { return one + 6; } } | 52 class a { static foo() { return one + 6; } } |
| 53 { | 53 { |
| 54 let z = one + 3; | 54 let z = one + 3; |
| 55 const v = one + 5; | 55 const v = one + 5; |
| (...skipping 246 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 302 } | 302 } |
| 303 for (var j = 0; j < 10; j++) { | 303 for (var j = 0; j < 10; j++) { |
| 304 y = j + 10; | 304 y = j + 10; |
| 305 assertEquals(j, let_accessors[j]()); | 305 assertEquals(j, let_accessors[j]()); |
| 306 assertEquals(y, var_accessors[j]()); | 306 assertEquals(y, var_accessors[j]()); |
| 307 assertEquals(j, const_accessors[j]()); | 307 assertEquals(j, const_accessors[j]()); |
| 308 assertEquals(j, class_accessors[j]().foo()); | 308 assertEquals(j, class_accessors[j]().foo()); |
| 309 } | 309 } |
| 310 } | 310 } |
| 311 f8(); | 311 f8(); |
| OLD | NEW |