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: --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 --concurrent-recompilation-delay=600 | 30 // Flags: --concurrent-recompilation --block-concurrent-recompilation |
31 | 31 |
32 if (!%IsConcurrentRecompilationSupported()) { | 32 if (!%IsConcurrentRecompilationSupported()) { |
33 print("Concurrent recompilation is disabled. Skipping this test."); | 33 print("Concurrent recompilation is disabled. Skipping this test."); |
34 quit(); | 34 quit(); |
35 } | 35 } |
36 | 36 |
37 function test(fun) { | 37 function test(fun) { |
38 fun(); | 38 fun(); |
39 fun(); | 39 fun(); |
40 // Mark for concurrent optimization. | 40 // Mark for concurrent optimization. |
41 %OptimizeFunctionOnNextCall(fun, "concurrent"); | 41 %OptimizeFunctionOnNextCall(fun, "concurrent"); |
42 //Trigger optimization in the background. | 42 // Kick off recompilation. |
43 fun(); | 43 fun(); |
44 //Tenure cons string. | 44 // Tenure cons string after compile graph has been created. |
45 gc(); | 45 gc(); |
46 // In the mean time, concurrent recompiling is not complete yet. | 46 // In the mean time, concurrent recompiling is still blocked. |
47 assertUnoptimized(fun, "no sync"); | 47 assertUnoptimized(fun, "no sync"); |
| 48 // Let concurrent recompilation proceed. |
| 49 %UnblockConcurrentRecompilation(); |
48 // Concurrent recompilation eventually finishes, embeds tenured cons string. | 50 // Concurrent recompilation eventually finishes, embeds tenured cons string. |
49 assertOptimized(fun, "sync"); | 51 assertOptimized(fun, "sync"); |
50 // Visit embedded cons string during mark compact. | 52 // Visit embedded cons string during mark compact. |
51 gc(); | 53 gc(); |
52 } | 54 } |
53 | 55 |
54 function f() { | 56 function f() { |
55 return "abcdefghijklmn" + "123456789"; | 57 return "abcdefghijklmn" + "123456789"; |
56 } | 58 } |
57 | 59 |
58 function g() { | 60 function g() { |
59 return "abcdefghijklmn\u2603" + "123456789"; | 61 return "abcdefghijklmn\u2603" + "123456789"; |
60 } | 62 } |
61 | 63 |
62 function h() { | 64 function h() { |
63 return "abcdefghijklmn\u2603" + "123456789\u2604"; | 65 return "abcdefghijklmn\u2603" + "123456789\u2604"; |
64 } | 66 } |
65 | 67 |
66 test(f); | 68 test(f); |
67 test(g); | 69 test(g); |
68 test(h); | 70 test(h); |
OLD | NEW |