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 // Test const initialization and assignments. | |
| 29 function f() { | |
| 30 var x = 42; | |
| 31 while (true) { | |
| 32 const y = x; | |
| 33 if (--x == 0) return y; | |
| 34 } | |
| 35 } | |
| 36 | |
| 37 function g() { | |
| 38 const x = 42; | |
| 39 x += 1; | |
| 40 return x; | |
| 41 } | |
| 42 | |
| 43 for (var i = 0; i < 1000000; i++) { | |
| 44 f(); | |
|
Rico
2011/05/31 07:29:47
Could we use %OptimizeFunctionOnNextCall(f) instea
| |
| 45 g(); | |
| 46 } | |
| 47 | |
| 48 assertEquals(42, f()); | |
| 49 assertEquals(42, g()); | |
| 50 | |
| 51 | |
| 52 function h(a, b) { | |
| 53 var r = a + b; | |
| 54 const X = 42; | |
| 55 return r + X; | |
| 56 } | |
| 57 | |
| 58 for (var i=0; i<10000000; i++) f(1,2); | |
| 59 assertEquals(45, h(1,2)); | |
| 60 assertEquals("foo742", h("foo", 7)); | |
| OLD | NEW |