| 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 91 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 102 | 102 |
| 103 void restore() override; | 103 void restore() override; |
| 104 | 104 |
| 105 HeapVector<Member<Document>> documents(); | 105 HeapVector<Member<Document>> documents(); |
| 106 void reset(); | 106 void reset(); |
| 107 | 107 |
| 108 // Methods called from the frontend for DOM nodes inspection. | 108 // Methods called from the frontend for DOM nodes inspection. |
| 109 void enable(ErrorString*) override; | 109 void enable(ErrorString*) override; |
| 110 void disable(ErrorString*) override; | 110 void disable(ErrorString*) override; |
| 111 void getDocument(ErrorString*, std::unique_ptr<protocol::DOM::Node>* root) o
verride; | 111 void getDocument(ErrorString*, std::unique_ptr<protocol::DOM::Node>* root) o
verride; |
| 112 void getLayoutTreeNodes(ErrorString*, std::unique_ptr<protocol::Array<protoc
ol::DOM::LayoutTreeNode>>* layoutTreeNodes) override; |
| 112 void collectClassNamesFromSubtree(ErrorString*, int nodeId, std::unique_ptr<
protocol::Array<String>>* classNames) override; | 113 void collectClassNamesFromSubtree(ErrorString*, int nodeId, std::unique_ptr<
protocol::Array<String>>* classNames) override; |
| 113 void requestChildNodes(ErrorString*, int nodeId, const Maybe<int>& depth) ov
erride; | 114 void requestChildNodes(ErrorString*, int nodeId, const Maybe<int>& depth) ov
erride; |
| 114 void querySelector(ErrorString*, int nodeId, const String& selector, int* ou
tNodeId) override; | 115 void querySelector(ErrorString*, int nodeId, const String& selector, int* ou
tNodeId) override; |
| 115 void querySelectorAll(ErrorString*, int nodeId, const String& selector, std:
:unique_ptr<protocol::Array<int>>* nodeIds) override; | 116 void querySelectorAll(ErrorString*, int nodeId, const String& selector, std:
:unique_ptr<protocol::Array<int>>* nodeIds) override; |
| 116 void setNodeName(ErrorString*, int nodeId, const String& name, int* outNodeI
d) override; | 117 void setNodeName(ErrorString*, int nodeId, const String& name, int* outNodeI
d) override; |
| 117 void setNodeValue(ErrorString*, int nodeId, const String& value) override; | 118 void setNodeValue(ErrorString*, int nodeId, const String& value) override; |
| 118 void removeNode(ErrorString*, int nodeId) override; | 119 void removeNode(ErrorString*, int nodeId) override; |
| 119 void setAttributeValue(ErrorString*, int nodeId, const String& name, const S
tring& value) override; | 120 void setAttributeValue(ErrorString*, int nodeId, const String& name, const S
tring& value) override; |
| 120 void setAttributesAsText(ErrorString*, int nodeId, const String& text, const
Maybe<String>& name) override; | 121 void setAttributesAsText(ErrorString*, int nodeId, const String& text, const
Maybe<String>& name) override; |
| 121 void removeAttribute(ErrorString*, int nodeId, const String& name) override; | 122 void removeAttribute(ErrorString*, int nodeId, const String& name) override; |
| (...skipping 106 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 228 Node* nodeForRemoteId(ErrorString*, const String& id); | 229 Node* nodeForRemoteId(ErrorString*, const String& id); |
| 229 | 230 |
| 230 void discardFrontendBindings(); | 231 void discardFrontendBindings(); |
| 231 | 232 |
| 232 void innerHighlightQuad(std::unique_ptr<FloatQuad>, const Maybe<protocol::DO
M::RGBA>& color, const Maybe<protocol::DOM::RGBA>& outlineColor); | 233 void innerHighlightQuad(std::unique_ptr<FloatQuad>, const Maybe<protocol::DO
M::RGBA>& color, const Maybe<protocol::DOM::RGBA>& outlineColor); |
| 233 | 234 |
| 234 bool pushDocumentUponHandlelessOperation(ErrorString*); | 235 bool pushDocumentUponHandlelessOperation(ErrorString*); |
| 235 | 236 |
| 236 Member<InspectorRevalidateDOMTask> revalidateTask(); | 237 Member<InspectorRevalidateDOMTask> revalidateTask(); |
| 237 | 238 |
| 239 void visitLayoutTreeNodes(Node*, protocol::Array<protocol::DOM::LayoutTreeNo
de>&); |
| 240 |
| 238 v8::Isolate* m_isolate; | 241 v8::Isolate* m_isolate; |
| 239 Member<InspectedFrames> m_inspectedFrames; | 242 Member<InspectedFrames> m_inspectedFrames; |
| 240 v8_inspector::V8InspectorSession* m_v8Session; | 243 v8_inspector::V8InspectorSession* m_v8Session; |
| 241 Client* m_client; | 244 Client* m_client; |
| 242 Member<DOMListener> m_domListener; | 245 Member<DOMListener> m_domListener; |
| 243 Member<NodeToIdMap> m_documentNodeToIdMap; | 246 Member<NodeToIdMap> m_documentNodeToIdMap; |
| 244 // Owns node mappings for dangling nodes. | 247 // Owns node mappings for dangling nodes. |
| 245 HeapVector<Member<NodeToIdMap>> m_danglingNodeToIdMaps; | 248 HeapVector<Member<NodeToIdMap>> m_danglingNodeToIdMaps; |
| 246 HeapHashMap<int, Member<Node>> m_idToNode; | 249 HeapHashMap<int, Member<Node>> m_idToNode; |
| 247 HeapHashMap<int, Member<NodeToIdMap>> m_idToNodesMap; | 250 HeapHashMap<int, Member<NodeToIdMap>> m_idToNodesMap; |
| 248 HashSet<int> m_childrenRequested; | 251 HashSet<int> m_childrenRequested; |
| 249 HashSet<int> m_distributedNodesRequested; | 252 HashSet<int> m_distributedNodesRequested; |
| 250 HashMap<int, int> m_cachedChildCount; | 253 HashMap<int, int> m_cachedChildCount; |
| 251 int m_lastNodeId; | 254 int m_lastNodeId; |
| 252 Member<Document> m_document; | 255 Member<Document> m_document; |
| 253 typedef HeapHashMap<String, HeapVector<Member<Node>>> SearchResults; | 256 typedef HeapHashMap<String, HeapVector<Member<Node>>> SearchResults; |
| 254 SearchResults m_searchResults; | 257 SearchResults m_searchResults; |
| 255 Member<InspectorRevalidateDOMTask> m_revalidateTask; | 258 Member<InspectorRevalidateDOMTask> m_revalidateTask; |
| 256 Member<InspectorHistory> m_history; | 259 Member<InspectorHistory> m_history; |
| 257 Member<DOMEditor> m_domEditor; | 260 Member<DOMEditor> m_domEditor; |
| 258 bool m_suppressAttributeModifiedEvent; | 261 bool m_suppressAttributeModifiedEvent; |
| 259 int m_backendNodeIdToInspect; | 262 int m_backendNodeIdToInspect; |
| 260 }; | 263 }; |
| 261 | 264 |
| 262 | 265 |
| 263 } // namespace blink | 266 } // namespace blink |
| 264 | 267 |
| 265 #endif // !defined(InspectorDOMAgent_h) | 268 #endif // !defined(InspectorDOMAgent_h) |
| OLD | NEW |