| 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 |
| (...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: --fold-constants --nodead-code-elimination | 28 // Flags: --fold-constants --nodead-code-elimination |
| 29 // Flags: --expose-gc --allow-natives-syntax | 29 // Flags: --expose-gc --allow-natives-syntax |
| 30 // Flags: --concurrent-recompilation --block-concurrent-recompilation | 30 // Flags: --concurrent-recompilation --block-concurrent-recompilation |
| 31 // Flags: --no-always-opt | |
| 32 | 31 |
| 33 if (!%IsConcurrentRecompilationSupported()) { | 32 if (!%IsConcurrentRecompilationSupported()) { |
| 34 print("Concurrent recompilation is disabled. Skipping this test."); | 33 print("Concurrent recompilation is disabled. Skipping this test."); |
| 35 quit(); | 34 quit(); |
| 36 } | 35 } |
| 37 | 36 |
| 38 assertFalse(isAlwaysOptimize()); | |
| 39 | |
| 40 function test(fun) { | 37 function test(fun) { |
| 41 fun(); | 38 fun(); |
| 42 %BaselineFunctionOnNextCall(fun); | 39 %BaselineFunctionOnNextCall(fun); |
| 43 fun(); | 40 fun(); |
| 44 // Mark for concurrent optimization. | 41 // Mark for concurrent optimization. |
| 45 %OptimizeFunctionOnNextCall(fun, "concurrent"); | 42 %OptimizeFunctionOnNextCall(fun, "concurrent"); |
| 46 // Kick off recompilation. | 43 // Kick off recompilation. |
| 47 fun(); | 44 fun(); |
| 48 // Tenure cons string after compile graph has been created. | 45 // Tenure cons string after compile graph has been created. |
| 49 gc(); | 46 gc(); |
| (...skipping 15 matching lines...) Expand all Loading... |
| 65 return "abcdefghijklmn\u2603" + "123456789"; | 62 return "abcdefghijklmn\u2603" + "123456789"; |
| 66 } | 63 } |
| 67 | 64 |
| 68 function h() { | 65 function h() { |
| 69 return "abcdefghijklmn\u2603" + "123456789\u2604"; | 66 return "abcdefghijklmn\u2603" + "123456789\u2604"; |
| 70 } | 67 } |
| 71 | 68 |
| 72 test(f); | 69 test(f); |
| 73 test(g); | 70 test(g); |
| 74 test(h); | 71 test(h); |
| OLD | NEW |