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: --allow-natives-syntax | 28 // Flags: --allow-natives-syntax |
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 f1(a, i) { | 40 function f1(a, i) { |
36 return a[i] + 0.5; | 41 return a[i] + 0.5; |
37 } | 42 } |
38 | 43 |
39 var arr = [0.0,,2.5]; | 44 var arr = [0.0,,2.5]; |
40 assertEquals(0.5, f1(arr, 0)); | 45 assertEquals(0.5, f1(arr, 0)); |
41 assertEquals(0.5, f1(arr, 0)); | 46 assertEquals(0.5, f1(arr, 0)); |
42 | 47 |
43 // Optimized code of f1 depends on initial object and array maps. | 48 // Optimized code of f1 depends on initial object and array maps. |
44 %OptimizeFunctionOnNextCall(f1, "parallel"); | 49 %OptimizeFunctionOnNextCall(f1, "parallel"); |
45 assertEquals(0.5, f1(arr, 0)); | 50 assertEquals(0.5, f1(arr, 0)); |
46 assertUnoptimized(f1); // Not yet optimized. | 51 assertUnoptimized(f1); // Not yet optimized. |
47 Object.prototype[1] = 1.5; // Invalidate current initial object map. | 52 Object.prototype[1] = 1.5; // Invalidate current initial object map. |
48 assertEquals(2, f1(arr, 1)); | 53 assertEquals(2, f1(arr, 1)); |
49 %CompleteOptimization(f1); // Conclude optimization with... | 54 %CompleteOptimization(f1); // Conclude optimization with... |
50 assertUnoptimized(f1); // ... bailing out due to map dependency. | 55 assertUnoptimized(f1); // ... bailing out due to map dependency. |
OLD | NEW |