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