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: --allow-natives-syntax | |
29 // Flags: --concurrent-recompilation --concurrent-recompilation-delay=50 | |
30 | |
31 if (!%IsConcurrentRecompilationSupported()) { | |
32 print("Concurrent recompilation is disabled. Skipping this test."); | |
33 quit(); | |
34 } | |
35 | |
36 function f(foo) { return foo.bar(); } | |
37 | |
38 var o = {}; | |
39 o.__proto__ = { __proto__: { bar: function() { return 1; } } }; | |
40 | |
41 assertEquals(1, f(o)); | |
42 assertEquals(1, f(o)); | |
43 | |
44 // Mark for concurrent optimization. | |
45 %OptimizeFunctionOnNextCall(f, "concurrent"); | |
46 // Trigger optimization in the background thread. | |
47 assertEquals(1, f(o)); | |
48 // While concurrent recompilation is running, optimization not yet done. | |
49 assertUnoptimized(f, "no sync"); | |
50 // Change the prototype chain during optimization to trigger map invalidation. | |
51 o.__proto__.__proto__ = { bar: function() { return 2; } }; | |
52 // Optimization eventually bails out due to map dependency. | |
53 assertUnoptimized(f, "sync"); | |
54 assertEquals(2, f(o)); | |
OLD | NEW |