| OLD | NEW |
| (Empty) |
| 1 // Copyright 2008 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 | |
| 29 // Get the Debug object exposed from the debug context global object. | |
| 30 Debug = debug.Debug | |
| 31 | |
| 32 // Simple debug event handler which first time hit will perform 1000 steps and | |
| 33 // second time hit will evaluate and store the value of "i". If requires that | |
| 34 // the global property "state" is initially zero. | |
| 35 | |
| 36 var bp1, bp2; | |
| 37 | |
| 38 function listener(event, exec_state, event_data, data) { | |
| 39 if (event == Debug.DebugEvent.Break) { | |
| 40 if (step_count > 0) { | |
| 41 exec_state.prepareStep(Debug.StepAction.StepIn); | |
| 42 step_count--; | |
| 43 } else { | |
| 44 result = exec_state.frame().evaluate("i").value(); | |
| 45 // Clear the break point on line 2 if set. | |
| 46 if (bp2) { | |
| 47 Debug.clearBreakPoint(bp2); | |
| 48 } | |
| 49 } | |
| 50 } | |
| 51 }; | |
| 52 | |
| 53 // Add the debug event listener. | |
| 54 Debug.setListener(listener); | |
| 55 | |
| 56 // Test debug event for break point. | |
| 57 function f() { | |
| 58 var i; // Line 1. | |
| 59 for (i = 0; i < 1000; i++) { // Line 2. | |
| 60 x = 1; // Line 3. | |
| 61 } | |
| 62 }; | |
| 63 | |
| 64 // Set a breakpoint on the for statement (line 1). | |
| 65 bp1 = Debug.setBreakPoint(f, 1); | |
| 66 | |
| 67 // Check that performing 1000 steps will make i 333. | |
| 68 var step_count = 1000; | |
| 69 result = -1; | |
| 70 f(); | |
| 71 assertEquals(333, result); | |
| 72 Debug.setListener(null); | |
| OLD | NEW |