| 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 |
| (...skipping 10 matching lines...) Expand all Loading... |
| 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 |
| 29 // Flags: --parallel-recompilation --parallel-recompilation-delay=50 | 29 // Flags: --parallel-recompilation --parallel-recompilation-delay=50 |
| 30 | 30 |
| 31 if (!%IsParallelRecompilationSupported()) { |
| 32 print("Parallel recompilation is disabled. Skipping this test."); |
| 33 quit(); |
| 34 } |
| 35 |
| 31 function assertUnoptimized(fun) { | 36 function assertUnoptimized(fun) { |
| 32 assertTrue(%GetOptimizationStatus(fun) != 1); | 37 assertTrue(%GetOptimizationStatus(fun) != 1); |
| 33 } | 38 } |
| 34 | 39 |
| 35 function assertOptimized(fun) { | 40 function assertOptimized(fun) { |
| 36 assertTrue(%GetOptimizationStatus(fun) != 2); | 41 assertTrue(%GetOptimizationStatus(fun) != 2); |
| 37 } | 42 } |
| 38 | 43 |
| 39 function f(x) { | 44 function f(x) { |
| 40 var xx = x * x; | 45 var xx = x * x; |
| (...skipping 12 matching lines...) Expand all Loading... |
| 53 } | 58 } |
| 54 | 59 |
| 55 f(g(1)); | 60 f(g(1)); |
| 56 assertUnoptimized(f); | 61 assertUnoptimized(f); |
| 57 assertUnoptimized(g); | 62 assertUnoptimized(g); |
| 58 | 63 |
| 59 %OptimizeFunctionOnNextCall(f, "parallel"); | 64 %OptimizeFunctionOnNextCall(f, "parallel"); |
| 60 %OptimizeFunctionOnNextCall(g, "parallel"); | 65 %OptimizeFunctionOnNextCall(g, "parallel"); |
| 61 f(g(2)); // Trigger optimization. | 66 f(g(2)); // Trigger optimization. |
| 62 | 67 |
| 63 if (%IsParallelRecompilationSupported()) { | 68 assertUnoptimized(f); // Not yet optimized. |
| 64 assertUnoptimized(f); // Not yet optimized. | 69 assertUnoptimized(g); |
| 65 assertUnoptimized(g); | |
| 66 } | |
| 67 | 70 |
| 68 %CompleteOptimization(f); // Wait till optimized code is installed. | 71 %CompleteOptimization(f); // Wait till optimized code is installed. |
| 69 %CompleteOptimization(g); | 72 %CompleteOptimization(g); |
| 70 | 73 |
| 71 assertOptimized(f); // Optimized now. | 74 assertOptimized(f); // Optimized now. |
| 72 assertOptimized(g); | 75 assertOptimized(g); |
| OLD | NEW |