Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | |
| 2 // Redistribution and use in source and binary forms, with or without | |
| 3 // modification, are permitted provided that the following conditions are | |
| 4 // met: | |
| 5 // | |
| 6 // * Redistributions of source code must retain the above copyright | |
| 7 // notice, this list of conditions and the following disclaimer. | |
| 8 // * Redistributions in binary form must reproduce the above | |
| 9 // copyright notice, this list of conditions and the following | |
| 10 // disclaimer in the documentation and/or other materials provided | |
| 11 // with the distribution. | |
| 12 // * Neither the name of Google Inc. nor the names of its | |
| 13 // contributors may be used to endorse or promote products derived | |
| 14 // from this software without specific prior written permission. | |
| 15 // | |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 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. | |
| 27 | |
| 28 // Flags: --harmony-block-scoping --allow-natives-syntax | |
| 29 | |
| 30 // Test that temporal dead zone semantics for function and block scoped | |
| 31 // ket bindings are handled by the optimizing compiler. | |
| 32 | |
| 33 function f(x, b) { | |
| 34 let y = (b ? y : x) + 42; | |
| 35 return y; | |
| 36 } | |
| 37 | |
| 38 function g(x, b) { | |
| 39 { | |
| 40 let y = (b ? y : x) + 42; | |
| 41 return y; | |
| 42 } | |
| 43 } | |
| 44 | |
| 45 for (var i=0; i<10; i++) { | |
| 46 f(i, false); | |
| 47 g(i, false); | |
| 48 } | |
| 49 | |
| 50 %OptimizeFunctionOnNextCall(f); | |
| 51 %OptimizeFunctionOnNextCall(g); | |
| 52 | |
| 53 try { | |
| 54 f(42, true); | |
| 55 } catch (e) { | |
|
fschneider
2011/08/30 06:58:40
Use assertThrows to test if there actually was an
| |
| 56 assertInstanceof(e, ReferenceError); | |
| 57 } | |
| 58 | |
| 59 try { | |
| 60 g(42, true); | |
|
fschneider
2011/08/30 06:58:40
Also assertThrows here.
| |
| 61 } catch (e) { | |
| 62 assertInstanceof(e, ReferenceError); | |
| 63 } | |
| OLD | NEW |