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=100 | |
30 | |
31 if (!%IsConcurrentRecompilationSupported()) { | |
32 print("Concurrent recompilation is disabled. Skipping this test."); | |
33 quit(); | |
34 } | |
35 | |
36 function f1(a, i) { | |
37 return a[i] + 0.5; | |
38 } | |
39 | |
40 var arr = [0.0,,2.5]; | |
41 assertEquals(0.5, f1(arr, 0)); | |
42 assertEquals(0.5, f1(arr, 0)); | |
43 | |
44 // Optimized code of f1 depends on initial object and array maps. | |
45 %OptimizeFunctionOnNextCall(f1, "concurrent"); | |
46 // Trigger optimization in the background thread | |
47 assertEquals(0.5, f1(arr, 0)); | |
48 Object.prototype[1] = 1.5; // Invalidate current initial object map. | |
49 assertEquals(2, f1(arr, 1)); | |
50 // Not yet optimized while background thread is running. | |
51 assertUnoptimized(f1, "no sync"); | |
52 // Sync with background thread to conclude optimization, which bails out | |
53 // due to map dependency. | |
54 assertUnoptimized(f1, "sync"); | |
OLD | NEW |