OLD | NEW |
1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008 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 11 matching lines...) Expand all Loading... |
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: --expose-debug-as debug | 28 // Flags: --expose-debug-as debug |
29 // Get the Debug object exposed from the debug context global object. | 29 // Get the Debug object exposed from the debug context global object. |
30 Debug = debug.Debug | 30 Debug = debug.Debug |
31 | 31 |
| 32 Debug.setListener(function() {}); |
| 33 |
32 function f() {a=1;b=2} | 34 function f() {a=1;b=2} |
33 function g() { | 35 function g() { |
34 a=1; | 36 a=1; |
35 b=2; | 37 b=2; |
36 } | 38 } |
37 | 39 |
38 bp = Debug.setBreakPoint(f, 0, 0); | 40 bp = Debug.setBreakPoint(f, 0, 0); |
39 assertEquals("() {[B0]a=1;b=2}", Debug.showBreakPoints(f)); | 41 assertEquals("() {[B0]a=1;b=2}", Debug.showBreakPoints(f)); |
40 Debug.clearBreakPoint(bp); | 42 Debug.clearBreakPoint(bp); |
41 assertEquals("() {a=1;b=2}", Debug.showBreakPoints(f)); | 43 assertEquals("() {a=1;b=2}", Debug.showBreakPoints(f)); |
(...skipping 173 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
215 [16, "f2(1,2),[B0]f3()"], | 217 [16, "f2(1,2),[B0]f3()"], |
216 [22, "+[B0]f3()"] | 218 [22, "+[B0]f3()"] |
217 ]; | 219 ]; |
218 for(var i = 0; i < scenario.length; i++) { | 220 for(var i = 0; i < scenario.length; i++) { |
219 bp1 = setBreakpointByPosition(h, scenario[i][0], | 221 bp1 = setBreakpointByPosition(h, scenario[i][0], |
220 Debug.BreakPositionAlignment.BreakPosition); | 222 Debug.BreakPositionAlignment.BreakPosition); |
221 assertTrue(Debug.showBreakPoints(h, undefined, | 223 assertTrue(Debug.showBreakPoints(h, undefined, |
222 Debug.BreakPositionAlignment.BreakPosition).indexOf(scenario[i][1]) > 0); | 224 Debug.BreakPositionAlignment.BreakPosition).indexOf(scenario[i][1]) > 0); |
223 Debug.clearBreakPoint(bp1); | 225 Debug.clearBreakPoint(bp1); |
224 } | 226 } |
OLD | NEW |