| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 --expose-gc | 28 // Flags: --allow-natives-syntax --expose-gc --parallel-recompilation |
| 29 // Flags: --parallel-recompilation --manual-parallel-recompilation | |
| 30 | |
| 31 function assertOptimized(fun) { | |
| 32 // This assertion takes --always-opt and --nocrankshaft flags into account. | |
| 33 assertTrue(%GetOptimizationStatus(fun) != 2); | |
| 34 } | |
| 35 | 29 |
| 36 function assertUnoptimized(fun) { | 30 function assertUnoptimized(fun) { |
| 37 assertTrue(%GetOptimizationStatus(fun) != 1); | 31 assertTrue(%GetOptimizationStatus(fun) != 1); |
| 38 } | 32 } |
| 39 | 33 |
| 40 function f(x) { | 34 function f(x) { |
| 41 var xx = x * x; | 35 var xx = x * x; |
| 42 var xxstr = xx.toString(); | 36 var xxstr = xx.toString(); |
| 43 return xxstr.length; | 37 return xxstr.length; |
| 44 } | 38 } |
| 45 | 39 |
| 46 function g(x) { | 40 function g(x) { |
| 47 var xxx = Math.sqrt(x) | 0; | 41 var xxx = Math.sqrt(x) | 0; |
| 48 var xxxstr = xxx.toString(); | 42 var xxxstr = xxx.toString(); |
| 49 return xxxstr.length; | 43 return xxxstr.length; |
| 50 } | 44 } |
| 51 | 45 |
| 52 function k(x) { | 46 function k(x) { |
| 53 return x * x; | 47 return x * x; |
| 54 } | 48 } |
| 55 | 49 |
| 56 f(g(1)); | 50 f(g(1)); |
| 57 f(g(2)); | |
| 58 assertUnoptimized(f); | 51 assertUnoptimized(f); |
| 59 assertUnoptimized(g); | 52 assertUnoptimized(g); |
| 60 | 53 |
| 61 %ForceParallelRecompile(f); | 54 %OptimizeFunctionOnNextCall(f, "parallel"); |
| 62 %ForceParallelRecompile(g); | 55 %OptimizeFunctionOnNextCall(g, "parallel"); |
| 56 f(g(2)); |
| 57 |
| 63 assertUnoptimized(f); | 58 assertUnoptimized(f); |
| 64 assertUnoptimized(g); | 59 assertUnoptimized(g); |
| 65 | 60 |
| 66 var sum = 0; | 61 %WaitUntilOptimized(f); |
| 67 for (var i = 0; i < 10000; i++) sum += f(i) + g(i); | 62 %WaitUntilOptimized(g); |
| 68 gc(); | |
| 69 | |
| 70 assertEquals(95274, sum); | |
| 71 assertUnoptimized(f); | |
| 72 assertUnoptimized(g); | |
| 73 | |
| 74 %InstallRecompiledCode(f); | |
| 75 assertOptimized(f); | |
| 76 assertUnoptimized(g); | |
| 77 | |
| 78 %InstallRecompiledCode(g); | |
| 79 assertOptimized(g); | |
| OLD | NEW |