OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 228 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
239 if (inheritableTypesMask) | 239 if (inheritableTypesMask) |
240 updateSubtreeBreakpoints(node, inheritableTypesMask, true); | 240 updateSubtreeBreakpoints(node, inheritableTypesMask, true); |
241 } | 241 } |
242 } | 242 } |
243 | 243 |
244 void InspectorDOMDebuggerAgent::didRemoveDOMNode(Node* node) | 244 void InspectorDOMDebuggerAgent::didRemoveDOMNode(Node* node) |
245 { | 245 { |
246 if (m_domBreakpoints.size()) { | 246 if (m_domBreakpoints.size()) { |
247 // Remove subtree breakpoints. | 247 // Remove subtree breakpoints. |
248 m_domBreakpoints.remove(node); | 248 m_domBreakpoints.remove(node); |
249 WillBeHeapVector<RawPtrWillBeMember<Node> > stack(1, InspectorDOMAgent::
innerFirstChild(node)); | 249 WillBeHeapVector<RawPtrWillBeMember<Node>> stack(1, InspectorDOMAgent::i
nnerFirstChild(node)); |
250 do { | 250 do { |
251 Node* node = stack.last(); | 251 Node* node = stack.last(); |
252 stack.removeLast(); | 252 stack.removeLast(); |
253 if (!node) | 253 if (!node) |
254 continue; | 254 continue; |
255 m_domBreakpoints.remove(node); | 255 m_domBreakpoints.remove(node); |
256 stack.append(InspectorDOMAgent::innerFirstChild(node)); | 256 stack.append(InspectorDOMAgent::innerFirstChild(node)); |
257 stack.append(InspectorDOMAgent::innerNextSibling(node)); | 257 stack.append(InspectorDOMAgent::innerNextSibling(node)); |
258 } while (!stack.isEmpty()); | 258 } while (!stack.isEmpty()); |
259 } | 259 } |
(...skipping 325 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
585 eventData->setString("url", url); | 585 eventData->setString("url", url); |
586 m_debuggerAgent->breakProgram(InspectorFrontend::Debugger::Reason::XHR, even
tData.release()); | 586 m_debuggerAgent->breakProgram(InspectorFrontend::Debugger::Reason::XHR, even
tData.release()); |
587 } | 587 } |
588 | 588 |
589 void InspectorDOMDebuggerAgent::clear() | 589 void InspectorDOMDebuggerAgent::clear() |
590 { | 590 { |
591 m_domBreakpoints.clear(); | 591 m_domBreakpoints.clear(); |
592 } | 592 } |
593 | 593 |
594 } // namespace blink | 594 } // namespace blink |
OLD | NEW |