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: --expose-debug-as debug --allow-natives-syntax | |
29 // Flags: --concurrent-recompilation --block-concurrent-recompilation | |
30 | |
31 if (!%IsConcurrentRecompilationSupported()) { | |
32 print("Concurrent recompilation is disabled. Skipping this test."); | |
33 quit(); | |
34 } | |
35 | |
36 Debug = debug.Debug; | |
37 | |
38 function listener(event, exec_state, event_data, data) { | |
39 if (event != Debug.DebugEvent.Break) return; | |
40 try { | |
41 assertEquals("foo", exec_state.frame(0).evaluate("a").value()); | |
42 } catch (e) { | |
43 exception = e; | |
44 }; | |
45 listened++; | |
46 }; | |
47 | |
48 var exception = null; | |
49 var listened = 0; | |
50 | |
51 var f = function() { | |
52 var a = "foo"; | |
53 var b = a.substring("1"); | |
54 [a, b].sort(); | |
55 return a; | |
56 } | |
57 | |
58 f(); | |
59 f(); | |
60 %OptimizeFunctionOnNextCall(f, "concurrent"); // Mark with builtin. | |
61 f(); // Kick off concurrent recompilation. | |
62 | |
63 // After compile graph has been created... | |
64 Debug.setListener(listener); // Activate debugger. | |
65 Debug.setBreakPoint(f, 2, 0); // Force deopt. | |
66 | |
67 // At this point, concurrent recompilation is still being blocked. | |
68 assertUnoptimized(f, "no sync"); | |
69 // Let concurrent recompilation proceed. | |
70 %UnblockConcurrentRecompilation(); | |
71 // Sync with optimization thread. But no optimized code is installed. | |
72 assertUnoptimized(f, "sync"); | |
73 | |
74 f(); // Trigger break point. | |
75 assertEquals(1, listened); | |
76 assertNull(exception); | |
OLD | NEW |