| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 |
| 11 // with the distribution. | 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
| 15 // | 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 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 | 28 // Flags: --allow-natives-syntax |
| 29 | 29 |
| 30 function f(i, b) { | 30 function o1() { |
| 31 var a = 0; | |
| 32 if (b) { | |
| 33 var c = 1 << i; | |
| 34 a = c + c; | |
| 35 } | |
| 36 var x = a >> 3; | |
| 37 return a; | |
| 38 } | 31 } |
| 39 | 32 |
| 40 f(1, false); | 33 if (%GetOptimizationStatus(o1) != 4) { |
| 41 f(1, true); | 34 // 4 == optimization disabled. |
| 42 %OptimizeFunctionOnNextCall(f); | 35 o1(); o1(); |
| 43 assertEquals((1 << 30) * 2, f(30, true)); | 36 %OptimizeFunctionOnNextCall(o1); |
| 37 o1(); |
| 44 | 38 |
| 39 // check that the given function was optimized. |
| 40 var o1_status = %GetOptimizationStatus(o1); |
| 41 assertTrue(o1_status == 1 // optimized |
| 42 || o1_status == 3 // optimized (always opt) |
| 43 || o1_status == 5); // lazy recompile requested |
| 45 | 44 |
| 46 var global = 1; | 45 // Test the %NeverOptimize runtime call. |
| 46 function u1() { |
| 47 %NeverOptimize(); |
| 48 } |
| 47 | 49 |
| 48 function f2(b) { | 50 function u2() { |
| 49 var a = 0; | |
| 50 if (b) { | |
| 51 a = global; | |
| 52 } | 51 } |
| 53 var x = a >> 3; | |
| 54 return a; | |
| 55 } | |
| 56 | 52 |
| 57 f2(false); | 53 u1(); u1(); |
| 58 f2(true); | 54 u2(); u2(); |
| 59 %OptimizeFunctionOnNextCall(f2); | 55 |
| 60 global = 2.5; | 56 %NeverOptimize(u2); |
| 61 assertEquals(global, f2(true)); | 57 |
| 58 %OptimizeFunctionOnNextCall(u1); |
| 59 %OptimizeFunctionOnNextCall(u2); |
| 60 |
| 61 u1(); u1(); |
| 62 u2(); u2(); |
| 63 |
| 64 // 2 => not optimized. |
| 65 assertEquals(2, %GetOptimizationStatus(u1)); |
| 66 assertEquals(2, %GetOptimizationStatus(u2)); |
| 67 |
| 68 } |
| OLD | NEW |