OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2009 Apple Inc. All rights reserved. | 2 * Copyright (C) 2009 Apple Inc. All rights reserved. |
3 * Copyright (C) 2011 Google Inc. All rights reserved. | 3 * Copyright (C) 2011 Google Inc. All rights reserved. |
4 * | 4 * |
5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
7 * are met: | 7 * are met: |
8 * | 8 * |
9 * 1. Redistributions of source code must retain the above copyright | 9 * 1. Redistributions of source code must retain the above copyright |
10 * notice, this list of conditions and the following disclaimer. | 10 * notice, this list of conditions and the following disclaimer. |
(...skipping 106 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
117 HeapVector<Member<Document>> documents(); | 117 HeapVector<Member<Document>> documents(); |
118 void reset(); | 118 void reset(); |
119 | 119 |
120 // Methods called from the frontend for DOM nodes inspection. | 120 // Methods called from the frontend for DOM nodes inspection. |
121 void enable(ErrorString*) override; | 121 void enable(ErrorString*) override; |
122 void disable(ErrorString*) override; | 122 void disable(ErrorString*) override; |
123 void getDocument(ErrorString*, | 123 void getDocument(ErrorString*, |
124 const Maybe<int>& depth, | 124 const Maybe<int>& depth, |
125 const Maybe<bool>& traverseFrames, | 125 const Maybe<bool>& traverseFrames, |
126 std::unique_ptr<protocol::DOM::Node>* root) override; | 126 std::unique_ptr<protocol::DOM::Node>* root) override; |
127 void getLayoutTreeNodes( | |
128 ErrorString*, | |
129 std::unique_ptr<protocol::Array<protocol::DOM::LayoutTreeNode>>* | |
130 layoutTreeNodes) override; | |
131 void collectClassNamesFromSubtree( | 127 void collectClassNamesFromSubtree( |
132 ErrorString*, | 128 ErrorString*, |
133 int nodeId, | 129 int nodeId, |
134 std::unique_ptr<protocol::Array<String>>* classNames) override; | 130 std::unique_ptr<protocol::Array<String>>* classNames) override; |
135 void requestChildNodes(ErrorString*, | 131 void requestChildNodes(ErrorString*, |
136 int nodeId, | 132 int nodeId, |
137 const Maybe<int>& depth, | 133 const Maybe<int>& depth, |
138 const Maybe<bool>& traverseFrames) override; | 134 const Maybe<bool>& traverseFrames) override; |
139 void querySelector(ErrorString*, | 135 void querySelector(ErrorString*, |
140 int nodeId, | 136 int nodeId, |
(...skipping 153 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
294 static Node* innerFirstChild(Node*); | 290 static Node* innerFirstChild(Node*); |
295 static Node* innerNextSibling(Node*); | 291 static Node* innerNextSibling(Node*); |
296 static Node* innerPreviousSibling(Node*); | 292 static Node* innerPreviousSibling(Node*); |
297 static unsigned innerChildNodeCount(Node*); | 293 static unsigned innerChildNodeCount(Node*); |
298 static Node* innerParentNode(Node*); | 294 static Node* innerParentNode(Node*); |
299 static bool isWhitespace(Node*); | 295 static bool isWhitespace(Node*); |
300 | 296 |
301 Node* assertNode(ErrorString*, int nodeId); | 297 Node* assertNode(ErrorString*, int nodeId); |
302 Element* assertElement(ErrorString*, int nodeId); | 298 Element* assertElement(ErrorString*, int nodeId); |
303 Document* assertDocument(ErrorString*, int nodeId); | 299 Document* assertDocument(ErrorString*, int nodeId); |
| 300 Document* document() const { return m_document.get(); } |
304 | 301 |
305 private: | 302 private: |
306 void setDocument(Document*); | 303 void setDocument(Document*); |
307 void innerEnable(); | 304 void innerEnable(); |
308 | 305 |
309 void setSearchingForNode(ErrorString*, | 306 void setSearchingForNode(ErrorString*, |
310 SearchMode, | 307 SearchMode, |
311 const Maybe<protocol::DOM::HighlightConfig>&); | 308 const Maybe<protocol::DOM::HighlightConfig>&); |
312 std::unique_ptr<InspectorHighlightConfig> highlightConfigFromInspectorObject( | 309 std::unique_ptr<InspectorHighlightConfig> highlightConfigFromInspectorObject( |
313 ErrorString*, | 310 ErrorString*, |
(...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
355 void discardFrontendBindings(); | 352 void discardFrontendBindings(); |
356 | 353 |
357 void innerHighlightQuad(std::unique_ptr<FloatQuad>, | 354 void innerHighlightQuad(std::unique_ptr<FloatQuad>, |
358 const Maybe<protocol::DOM::RGBA>& color, | 355 const Maybe<protocol::DOM::RGBA>& color, |
359 const Maybe<protocol::DOM::RGBA>& outlineColor); | 356 const Maybe<protocol::DOM::RGBA>& outlineColor); |
360 | 357 |
361 bool pushDocumentUponHandlelessOperation(ErrorString*); | 358 bool pushDocumentUponHandlelessOperation(ErrorString*); |
362 | 359 |
363 Member<InspectorRevalidateDOMTask> revalidateTask(); | 360 Member<InspectorRevalidateDOMTask> revalidateTask(); |
364 | 361 |
365 void visitLayoutTreeNodes(Node*, | |
366 protocol::Array<protocol::DOM::LayoutTreeNode>&); | |
367 | |
368 v8::Isolate* m_isolate; | 362 v8::Isolate* m_isolate; |
369 Member<InspectedFrames> m_inspectedFrames; | 363 Member<InspectedFrames> m_inspectedFrames; |
370 v8_inspector::V8InspectorSession* m_v8Session; | 364 v8_inspector::V8InspectorSession* m_v8Session; |
371 Client* m_client; | 365 Client* m_client; |
372 Member<DOMListener> m_domListener; | 366 Member<DOMListener> m_domListener; |
373 Member<NodeToIdMap> m_documentNodeToIdMap; | 367 Member<NodeToIdMap> m_documentNodeToIdMap; |
374 // Owns node mappings for dangling nodes. | 368 // Owns node mappings for dangling nodes. |
375 HeapVector<Member<NodeToIdMap>> m_danglingNodeToIdMaps; | 369 HeapVector<Member<NodeToIdMap>> m_danglingNodeToIdMaps; |
376 HeapHashMap<int, Member<Node>> m_idToNode; | 370 HeapHashMap<int, Member<Node>> m_idToNode; |
377 HeapHashMap<int, Member<NodeToIdMap>> m_idToNodesMap; | 371 HeapHashMap<int, Member<NodeToIdMap>> m_idToNodesMap; |
378 HashSet<int> m_childrenRequested; | 372 HashSet<int> m_childrenRequested; |
379 HashSet<int> m_distributedNodesRequested; | 373 HashSet<int> m_distributedNodesRequested; |
380 HashMap<int, int> m_cachedChildCount; | 374 HashMap<int, int> m_cachedChildCount; |
381 int m_lastNodeId; | 375 int m_lastNodeId; |
382 Member<Document> m_document; | 376 Member<Document> m_document; |
383 typedef HeapHashMap<String, HeapVector<Member<Node>>> SearchResults; | 377 typedef HeapHashMap<String, HeapVector<Member<Node>>> SearchResults; |
384 SearchResults m_searchResults; | 378 SearchResults m_searchResults; |
385 Member<InspectorRevalidateDOMTask> m_revalidateTask; | 379 Member<InspectorRevalidateDOMTask> m_revalidateTask; |
386 Member<InspectorHistory> m_history; | 380 Member<InspectorHistory> m_history; |
387 Member<DOMEditor> m_domEditor; | 381 Member<DOMEditor> m_domEditor; |
388 bool m_suppressAttributeModifiedEvent; | 382 bool m_suppressAttributeModifiedEvent; |
389 int m_backendNodeIdToInspect; | 383 int m_backendNodeIdToInspect; |
390 }; | 384 }; |
391 | 385 |
392 } // namespace blink | 386 } // namespace blink |
393 | 387 |
394 #endif // !defined(InspectorDOMAgent_h) | 388 #endif // !defined(InspectorDOMAgent_h) |
OLD | NEW |