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 f(foo) { return foo.bar(); } | 40 function f(foo) { return foo.bar(); } |
36 | 41 |
37 var o = {}; | 42 var o = {}; |
38 o.__proto__ = { __proto__: { bar: function() { return 1; } } }; | 43 o.__proto__ = { __proto__: { bar: function() { return 1; } } }; |
39 | 44 |
40 assertEquals(1, f(o)); | 45 assertEquals(1, f(o)); |
41 assertEquals(1, f(o)); | 46 assertEquals(1, f(o)); |
42 | 47 |
43 %OptimizeFunctionOnNextCall(f, "parallel"); | 48 %OptimizeFunctionOnNextCall(f, "parallel"); |
44 assertEquals(1, f(o)); // Trigger optimization. | 49 assertEquals(1, f(o)); // Trigger optimization. |
45 assertUnoptimized(f); // Optimization not yet done. | 50 assertUnoptimized(f); // Optimization not yet done. |
46 // Change the prototype chain during optimization to trigger map invalidation. | 51 // Change the prototype chain during optimization to trigger map invalidation. |
47 o.__proto__.__proto__ = { bar: function() { return 2; } }; | 52 o.__proto__.__proto__ = { bar: function() { return 2; } }; |
48 %CompleteOptimization(f); // Conclude optimization with... | 53 %CompleteOptimization(f); // Conclude optimization with... |
49 assertUnoptimized(f); // ... bailing out due to map dependency. | 54 assertUnoptimized(f); // ... bailing out due to map dependency. |
50 assertEquals(2, f(o)); | 55 assertEquals(2, f(o)); |
OLD | NEW |