OLD | NEW |
| (Empty) |
1 // Copyright 2013 the V8 project authors. All rights reserved. | |
2 // Redistribution and use in source and binary forms, with or without | |
3 // modification, are permitted provided that the following conditions are | |
4 // met: | |
5 // | |
6 // * Redistributions of source code must retain the above copyright | |
7 // notice, this list of conditions and the following disclaimer. | |
8 // * Redistributions in binary form must reproduce the above | |
9 // copyright notice, this list of conditions and the following | |
10 // disclaimer in the documentation and/or other materials provided | |
11 // with the distribution. | |
12 // * Neither the name of Google Inc. nor the names of its | |
13 // contributors may be used to endorse or promote products derived | |
14 // from this software without specific prior written permission. | |
15 // | |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
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. | |
27 | |
28 // Flags: --fold-constants --nodead-code-elimination | |
29 // Flags: --expose-gc --allow-natives-syntax | |
30 // Flags: --parallel-recompilation --parallel-recompilation-delay=300 | |
31 | |
32 if (!%IsParallelRecompilationSupported()) { | |
33 print("Parallel recompilation is disabled. Skipping this test."); | |
34 quit(); | |
35 } | |
36 | |
37 function assertUnoptimized(fun) { | |
38 assertTrue(%GetOptimizationStatus(fun) != 1); | |
39 } | |
40 | |
41 function test(fun) { | |
42 fun(); | |
43 fun(); | |
44 %OptimizeFunctionOnNextCall(fun, "parallel"); | |
45 fun(); // Trigger optimization in the background. | |
46 gc(); // Tenure cons string. | |
47 assertUnoptimized(fun); // Compilation not complete yet. | |
48 %CompleteOptimization(fun); // Compilation embeds tenured cons string. | |
49 gc(); // Visit embedded cons string during mark compact. | |
50 } | |
51 | |
52 function f() { | |
53 return "abcdefghijklmn" + "123456789"; | |
54 } | |
55 | |
56 function g() { | |
57 return "abcdefghijklmn\u2603" + "123456789"; | |
58 } | |
59 | |
60 function h() { | |
61 return "abcdefghijklmn\u2603" + "123456789\u2604"; | |
62 } | |
63 | |
64 test(f); | |
65 test(g); | |
66 test(h); | |
OLD | NEW |