| 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 |
| 11 // with the distribution. | 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
| 15 // | 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 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 | |
| 29 // Get the Debug object exposed from the debug context global object. | |
| 30 Debug = debug.Debug | 28 Debug = debug.Debug |
| 31 | 29 |
| 32 // Simple debug event handler which just counts the number of break points hit. | 30 // Simple debug event handler which just counts the number of break points hit. |
| 33 var break_point_hit_count; | 31 var break_point_hit_count; |
| 34 | 32 |
| 35 function listener(event, exec_state, event_data, data) { | 33 function listener(event, exec_state, event_data, data) { |
| 36 if (event == Debug.DebugEvent.Break) { | 34 if (event == Debug.DebugEvent.Break) { |
| 37 break_point_hit_count++; | 35 break_point_hit_count++; |
| 38 } | 36 } |
| 39 }; | 37 }; |
| (...skipping 11 matching lines...) Expand all Loading... |
| 51 // and that when the last break point is removed no more debug break events | 49 // and that when the last break point is removed no more debug break events |
| 52 // occours. | 50 // occours. |
| 53 break_point_hit_count = 0; | 51 break_point_hit_count = 0; |
| 54 | 52 |
| 55 // Set a breakpoint in f. | 53 // Set a breakpoint in f. |
| 56 bp1 = Debug.setBreakPoint(f); | 54 bp1 = Debug.setBreakPoint(f); |
| 57 f(); | 55 f(); |
| 58 assertEquals(1, break_point_hit_count); | 56 assertEquals(1, break_point_hit_count); |
| 59 | 57 |
| 60 // Set another breakpoint in f at the same place. | 58 // Set another breakpoint in f at the same place. |
| 61 bp2 = Debug.setBreakPoint(f); | 59 assertThrows(() => Debug.setBreakPoint(f)); |
| 62 f(); | 60 f(); |
| 63 assertEquals(2, break_point_hit_count); | 61 assertEquals(2, break_point_hit_count); |
| 64 | 62 |
| 65 // Remove one of the break points. | 63 // Remove the break points. |
| 66 Debug.clearBreakPoint(bp1); | 64 Debug.clearBreakPoint(bp1); |
| 67 f(); | 65 f(); |
| 68 assertEquals(3, break_point_hit_count); | 66 assertEquals(2, break_point_hit_count); |
| 69 | |
| 70 // Remove the second break point. | |
| 71 Debug.clearBreakPoint(bp2); | |
| 72 f(); | |
| 73 assertEquals(3, break_point_hit_count); | |
| 74 | 67 |
| 75 // Perform the same test using function g (this time removing the break points | 68 // Perform the same test using function g (this time removing the break points |
| 76 // in the another order). | 69 // in the another order). |
| 77 break_point_hit_count = 0; | 70 break_point_hit_count = 0; |
| 78 bp1 = Debug.setBreakPoint(g); | 71 bp1 = Debug.setBreakPoint(g); |
| 79 g(); | 72 g(); |
| 80 assertEquals(1, break_point_hit_count); | 73 assertEquals(1, break_point_hit_count); |
| 81 bp2 = Debug.setBreakPoint(g); | 74 assertThrows(() => Debug.setBreakPoint(g)); |
| 82 g(); | 75 g(); |
| 83 assertEquals(2, break_point_hit_count); | 76 assertEquals(2, break_point_hit_count); |
| 84 Debug.clearBreakPoint(bp2); | |
| 85 g(); | |
| 86 assertEquals(3, break_point_hit_count); | |
| 87 Debug.clearBreakPoint(bp1); | 77 Debug.clearBreakPoint(bp1); |
| 88 g(); | 78 g(); |
| 89 assertEquals(3, break_point_hit_count); | 79 assertEquals(2, break_point_hit_count); |
| 90 | 80 |
| 91 // Finally test with many break points. | 81 // Finally test with many break points. |
| 92 test_count = 10; | 82 test_count = 10; |
| 93 bps = new Array(test_count); | |
| 94 break_point_hit_count = 0; | 83 break_point_hit_count = 0; |
| 95 for (var i = 0; i < test_count; i++) { | 84 for (var i = 0; i < test_count; i++) { |
| 96 bps[i] = Debug.setBreakPoint(h); | 85 if (i == 0) { |
| 86 Debug.setBreakPoint(h); |
| 87 } else { |
| 88 assertThrows(() => Debug.setBreakPoint(h)); |
| 89 } |
| 97 h(); | 90 h(); |
| 98 } | 91 } |
| 99 for (var i = 0; i < test_count; i++) { | 92 assertEquals(test_count, break_point_hit_count); |
| 100 h(); | |
| 101 Debug.clearBreakPoint(bps[i]); | |
| 102 } | |
| 103 assertEquals(test_count * 2, break_point_hit_count); | |
| 104 h(); | |
| 105 assertEquals(test_count * 2, break_point_hit_count); | |
| OLD | NEW |