| /external/webkit/WebCore/editing/ |
| D | htmlediting.h | 39 class Node; variable
55 Node* highestAncestor(Node*);
56 Node* highestEditableRoot(const Position&);
57 Node* highestEnclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Node*));
58 Node* lowestEditableAncestor(Node*);
60 Node* enclosingBlock(Node*);
61 Node* enclosingTableCell(const Position&);
62 Node* enclosingEmptyListItem(const VisiblePosition&);
63 Node* enclosingAnchorElement(const Position&);
64 Node* enclosingNodeWithTag(const Position&, const QualifiedName&);
[all …]
|
| D | ModifySelectionListLevel.cpp | 49 static bool getStartEndListChildren(const VisibleSelection& selection, Node*& start, Node*& end) in getStartEndListChildren()
55 Node* startListChild = enclosingListChild(selection.start().node()); in getStartEndListChildren()
60 …Node* endListChild = selection.isRange() ? enclosingListChild(selection.end().node()) : startListC… in getStartEndListChildren()
91 …fySelectionListLevelCommand::insertSiblingNodeRangeBefore(Node* startNode, Node* endNode, Node* re… in insertSiblingNodeRangeBefore()
93 Node* node = startNode; in insertSiblingNodeRangeBefore()
95 Node* next = node->nextSibling(); in insertSiblingNodeRangeBefore()
106 …ifySelectionListLevelCommand::insertSiblingNodeRangeAfter(Node* startNode, Node* endNode, Node* re… in insertSiblingNodeRangeAfter()
108 Node* node = startNode; in insertSiblingNodeRangeAfter()
110 Node* next = node->nextSibling(); in insertSiblingNodeRangeAfter()
122 void ModifySelectionListLevelCommand::appendSiblingNodeRange(Node* startNode, Node* endNode, Elemen… in appendSiblingNodeRange()
[all …]
|
| D | htmlediting.cpp | 62 bool isAtomicNode(const Node *node) in isAtomicNode()
69 bool editingIgnoresContent(const Node* node) in editingIgnoresContent()
74 bool canHaveChildrenForEditing(const Node* node) in canHaveChildrenForEditing()
98 Node* nodeA = a.node(); in comparePositions()
100 Node* nodeB = b.node(); in comparePositions()
105 Node* shadowAncestorA = nodeA->shadowAncestorNode(); in comparePositions()
108 Node* shadowAncestorB = nodeB->shadowAncestorNode(); in comparePositions()
135 Node* highestEditableRoot(const Position& position) in highestEditableRoot()
137 Node* node = position.node(); in highestEditableRoot()
141 Node* highestRoot = editableRootForPosition(position); in highestEditableRoot()
[all …]
|
| D | CompositeEditCommand.h | 49 void appendNode(PassRefPtr<Node>, PassRefPtr<Element> parent);
59 void insertNodeAfter(PassRefPtr<Node>, PassRefPtr<Node> refChild);
60 void insertNodeAt(PassRefPtr<Node>, const Position&);
61 void insertNodeAtTabSpanPosition(PassRefPtr<Node>, const Position&);
62 void insertNodeBefore(PassRefPtr<Node>, PassRefPtr<Node> refChild);
73 void removeChildrenInRange(PassRefPtr<Node>, unsigned from, unsigned to);
74 virtual void removeNode(PassRefPtr<Node>);
75 HTMLElement* replaceNodeWithSpanPreservingChildrenAndAttributes(PassRefPtr<Node>);
76 void removeNodePreservingChildren(PassRefPtr<Node>);
77 void removeNodeAndPruneAncestors(PassRefPtr<Node>);
[all …]
|
| D | ReplaceSelectionCommand.cpp | 67 Node* firstChild() const;
68 Node* lastChild() const;
75 void removeNode(PassRefPtr<Node>);
76 void removeNodePreservingChildren(Node*);
79 PassRefPtr<Node> insertFragmentForTestRendering(Node* context);
80 void removeUnrenderedNodes(Node*);
81 void restoreTestRenderingNodesToFragment(Node*);
82 void removeInterchangeNodes(Node*);
84 void insertNodeBefore(PassRefPtr<Node> node, Node* refNode);
93 static bool isInterchangeNewlineNode(const Node *node) in isInterchangeNewlineNode()
[all …]
|
| /external/skia/include/xml/ |
| D | SkDOM.h | 33 typedef SkDOMNode Node; typedef
38 const Node* build(const char doc[], size_t len);
39 const Node* copy(const SkDOM& dom, const Node* node);
41 const Node* getRootNode() const;
47 Type getType(const Node*) const;
49 const char* getName(const Node*) const;
50 const Node* getFirstChild(const Node*, const char elem[] = NULL) const;
51 const Node* getNextSibling(const Node*, const char elem[] = NULL) const;
53 const char* findAttr(const Node*, const char attrName[]) const;
54 const Attr* getFirstAttr(const Node*) const;
[all …]
|
| /external/webkit/WebCore/dom/ |
| D | Node.cpp | 118 static HashSet<Node*>* gNodesDispatchingSimulatedClicks = 0;
120 bool Node::isSupported(const String& feature, const String& version) in isSupported()
126 static HashSet<Node*> liveNodeSet;
129 void Node::dumpStatistics() in dumpStatistics()
157 for (HashSet<Node*>::iterator it = liveNodeSet.begin(); it != liveNodeSet.end(); ++it) { in dumpStatistics()
158 Node* node = *it; in dumpStatistics()
280 static HashSet<Node*> ignoreSet;
283 void Node::startIgnoringLeaks() in startIgnoringLeaks()
290 void Node::stopIgnoringLeaks() in stopIgnoringLeaks()
297 Node::StyleChange Node::diff(const RenderStyle* s1, const RenderStyle* s2) in diff()
[all …]
|
| D | Range.cpp | 70 …e(PassRefPtr<Document> ownerDocument, PassRefPtr<Node> startContainer, int startOffset, PassRefPtr… in Range()
90 …e(PassRefPtr<Document> ownerDocument, PassRefPtr<Node> startContainer, int startOffset, PassRefPtr… in create()
111 Node* Range::startContainer(ExceptionCode& ec) const in startContainer()
131 Node* Range::endContainer(ExceptionCode& ec) const in endContainer()
151 Node* Range::commonAncestorContainer(ExceptionCode& ec) const in commonAncestorContainer()
161 Node* Range::commonAncestorContainer(Node* containerA, Node* containerB) in commonAncestorContainer()
163 for (Node* parentA = containerA; parentA; parentA = parentA->parentNode()) { in commonAncestorContainer()
164 for (Node* parentB = containerB; parentB; parentB = parentB->parentNode()) { in commonAncestorContainer()
182 void Range::setStart(PassRefPtr<Node> refNode, int offset, ExceptionCode& ec) in setStart()
200 Node* childNode = checkNodeWOffset(refNode.get(), offset, ec); in setStart()
[all …]
|
| D | Range.h | 44 …r<Range> create(PassRefPtr<Document>, PassRefPtr<Node> startContainer, int startOffset, PassRefPtr…
49 Node* startContainer() const { return m_start.container(); } in startContainer()
51 Node* endContainer() const { return m_end.container(); } in endContainer()
54 Node* startContainer(ExceptionCode&) const;
56 Node* endContainer(ExceptionCode&) const;
60 Node* commonAncestorContainer(ExceptionCode&) const;
61 static Node* commonAncestorContainer(Node* containerA, Node* containerB);
62 void setStart(PassRefPtr<Node> container, int offset, ExceptionCode&);
63 void setEnd(PassRefPtr<Node> container, int offset, ExceptionCode&);
65 bool isPointInRange(Node* refNode, int offset, ExceptionCode&);
[all …]
|
| D | Node.h | 80 class Node : public EventTarget, public TreeShared<Node>, public ScriptWrappable {
109 virtual ~Node();
118 Node* parentNode() const { return parent(); } in parentNode()
120 Node* previousSibling() const { return m_previous; } in previousSibling()
121 Node* nextSibling() const { return m_next; } in nextSibling()
123 Node* firstChild() const { return isContainerNode() ? containerFirstChild() : 0; } in firstChild()
124 Node* lastChild() const { return isContainerNode() ? containerLastChild() : 0; } in lastChild()
135 …virtual bool insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionCode&, bool shouldLa…
136 …virtual bool replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionCode&, bool shouldLa…
137 virtual bool removeChild(Node* child, ExceptionCode&);
[all …]
|
| D | ContainerNode.h | 32 typedef void (*NodeCallback)(Node*);
39 class ContainerNode : public Node {
43 Node* firstChild() const { return m_firstChild; } in firstChild()
44 Node* lastChild() const { return m_lastChild; } in lastChild()
46 …virtual bool insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionCode&, bool shouldLa…
47 …virtual bool replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionCode&, bool shouldLa…
48 virtual bool removeChild(Node* child, ExceptionCode&);
49 …virtual bool appendChild(PassRefPtr<Node> newChild, ExceptionCode&, bool shouldLazyAttach = false);
51 virtual ContainerNode* addChild(PassRefPtr<Node>);
61 Node* childNode(unsigned index) const;
[all …]
|
| D | TreeWalker.h | 39 …static PassRefPtr<TreeWalker> create(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<No… in create()
44 Node* currentNode() const { return m_current.get(); } in currentNode()
45 void setCurrentNode(PassRefPtr<Node>, ExceptionCode&);
47 Node* parentNode(ScriptState*);
48 Node* firstChild(ScriptState*);
49 Node* lastChild(ScriptState*);
50 Node* previousSibling(ScriptState*);
51 Node* nextSibling(ScriptState*);
52 Node* previousNode(ScriptState*);
53 Node* nextNode(ScriptState*);
[all …]
|
| D | ContainerNode.cpp | 46 static void dispatchChildInsertionEvents(Node*);
47 static void dispatchChildRemovalEvents(Node*);
49 typedef Vector<std::pair<NodeCallback, RefPtr<Node> > > NodeCallbackQueue;
57 removeAllChildrenInContainer<Node, ContainerNode>(this); in removeAllChildren()
65 bool ContainerNode::insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionCode& ec, bool… in insertBefore()
99 RefPtr<Node> next = refChild; in insertBefore()
100 RefPtr<Node> refChildPreviousSibling = refChild->previousSibling(); in insertBefore()
102 RefPtr<Node> child = isFragment ? newChild->firstChild() : newChild; in insertBefore()
104 RefPtr<Node> nextChild = isFragment ? child->nextSibling() : 0; in insertBefore()
107 if (Node* oldParent = child->parentNode()) in insertBefore()
[all …]
|
| D | Position.h | 41 class Node; variable
72 Position(PassRefPtr<Node> anchorNode, int offset);
75 Position(PassRefPtr<Node> anchorNode, AnchorType);
77 Position(PassRefPtr<Node> anchorNode, int offset, AnchorType);
85 … Node* containerNode() const; // NULL for a before/after position anchored to a node with no parent
103 Node* computeNodeBeforePosition() const;
104 Node* computeNodeAfterPosition() const;
106 Node* anchorNode() const { return m_anchorNode.get(); } in anchorNode()
111 Node* node() const { return m_anchorNode.get(); } in node()
115 void moveToPosition(PassRefPtr<Node> anchorNode, int offset);
[all …]
|
| D | TreeWalker.cpp | 36 TreeWalker::TreeWalker(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filte… in TreeWalker()
42 void TreeWalker::setCurrentNode(PassRefPtr<Node> node, ExceptionCode& ec) in setCurrentNode()
51 inline Node* TreeWalker::setCurrent(PassRefPtr<Node> node) in setCurrent()
57 Node* TreeWalker::parentNode(ScriptState* state) in parentNode()
59 RefPtr<Node> node = m_current; in parentNode()
73 Node* TreeWalker::firstChild(ScriptState* state) in firstChild()
75 for (RefPtr<Node> node = m_current->firstChild(); node; ) { in firstChild()
97 Node* parent = node->parentNode(); in firstChild()
106 Node* TreeWalker::lastChild(ScriptState* state) in lastChild()
108 for (RefPtr<Node> node = m_current->lastChild(); node; ) { in lastChild()
[all …]
|
| /external/webkit/WebCore/html/ |
| D | HTMLParser.h | 44 class Node; variable
62 PassRefPtr<Node> parseToken(Token*);
81 void setCurrent(Node*);
85 PassRefPtr<Node> getNode(Token*);
86 bool bodyCreateErrorCheck(Token*, RefPtr<Node>&);
87 bool canvasCreateErrorCheck(Token*, RefPtr<Node>&);
88 bool commentCreateErrorCheck(Token*, RefPtr<Node>&);
89 bool ddCreateErrorCheck(Token*, RefPtr<Node>&);
90 bool dtCreateErrorCheck(Token*, RefPtr<Node>&);
91 bool formCreateErrorCheck(Token*, RefPtr<Node>&);
[all …]
|
| /external/webkit/WebCore/xml/ |
| D | XPathUtil.cpp | 37 bool isRootDomNode(Node* node) in isRootDomNode()
42 String stringValue(Node* node) in stringValue()
45 case Node::ATTRIBUTE_NODE: in stringValue()
46 case Node::PROCESSING_INSTRUCTION_NODE: in stringValue()
47 case Node::COMMENT_NODE: in stringValue()
48 case Node::TEXT_NODE: in stringValue()
49 case Node::CDATA_SECTION_NODE: in stringValue()
50 case Node::XPATH_NAMESPACE_NODE: in stringValue()
53 if (isRootDomNode(node) || node->nodeType() == Node::ELEMENT_NODE) { in stringValue()
57 for (Node* n = node->firstChild(); n; n = n->traverseNextNode(node)) { in stringValue()
[all …]
|
| /external/v8/src/ |
| D | global-handles.cc | 36 class GlobalHandles::Node : public Malloced { class in v8::internal::GlobalHandles
47 Node() { in Node() function in v8::internal::GlobalHandles::Node
51 explicit Node(Object* object) { in Node() function in v8::internal::GlobalHandles::Node
57 ~Node() { in ~Node()
78 Node* next() { return next_; } in next()
79 void set_next(Node* value) { next_ = value; } in set_next()
80 Node** next_addr() { return &next_; } in next_addr()
83 Node* next_free() { in next_free()
87 void set_next_free(Node* value) { in set_next_free()
93 static Node* FromLocation(Object** location) { in FromLocation()
[all …]
|
| /external/webkit/WebCore/inspector/ |
| D | InspectorDOMAgent.h | 53 class Node; variable
57 …EventListenerInfo(Node* node, const AtomicString& eventType, const EventListenerVector& eventListe… in EventListenerInfo()
64 Node* node;
101 void didInsertDOMNode(Node*);
102 void didRemoveDOMNode(Node*);
105 Node* nodeForId(long nodeId);
106 Node* nodeForPath(const String& path);
107 long pushNodePathToFrontend(Node* node);
116 typedef HashMap<RefPtr<Node>, long> NodeToIdMap;
117 long bind(Node* node, NodeToIdMap* nodesMap);
[all …]
|
| D | InspectorDOMAgent.cpp | 130 Node* node = event->target()->toNode(); in handleEvent()
149 Node* previousSibling = innerPreviousSibling(node); in handleEvent()
158 long InspectorDOMAgent::bind(Node* node, NodeToIdMap* nodesMap) in bind()
170 void InspectorDOMAgent::unbind(Node* node, NodeToIdMap* nodesMap) in unbind()
186 Node* child = innerFirstChild(node); in unbind()
206 Node* node = nodeForId(nodeId); in pushChildNodesToFrontend()
207 … (!node || (node->nodeType() != Node::ELEMENT_NODE && node->nodeType() != Node::DOCUMENT_NODE && n… in pushChildNodesToFrontend()
226 Node* InspectorDOMAgent::nodeForId(long id) in nodeForId()
231 HashMap<long, Node*>::iterator it = m_idToNode.find(id); in nodeForId()
237 Node* InspectorDOMAgent::nodeForPath(const String& path) in nodeForPath()
[all …]
|
| /external/skia/src/xml/ |
| D | SkDOM.cpp | 84 const SkDOM::Node* SkDOM::getRootNode() const in getRootNode()
89 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) const in getFirstChild()
92 const Node* child = node->fFirstChild; in getFirstChild()
103 const SkDOM::Node* SkDOM::getNextSibling(const Node* node, const char name[]) const in getNextSibling()
106 const Node* sibling = node->fNextSibling; in getNextSibling()
116 SkDOM::Type SkDOM::getType(const Node* node) const in getType()
122 const char* SkDOM::getName(const Node* node) const in getName()
128 const char* SkDOM::findAttr(const Node* node, const char name[]) const in findAttr()
145 const SkDOM::Attr* SkDOM::getFirstAttr(const Node* node) const in getFirstAttr()
150 const SkDOM::Attr* SkDOM::getNextAttr(const Node* node, const Attr* attr) const in getNextAttr()
[all …]
|
| /external/webkit/JavaScriptCore/wtf/ |
| D | ListHashSet.h | 56 typedef ListHashSetNode<ValueArg> Node; typedef
59 typedef HashTraits<Node*> NodeTraits;
62 …typedef HashTable<Node*, Node*, IdentityExtractor<Node*>, NodeHash, NodeTraits, NodeTraits> ImplTy…
63 …typedef HashTableIterator<Node*, Node*, IdentityExtractor<Node*>, NodeHash, NodeTraits, NodeTraits…
64 …typedef HashTableConstIterator<Node*, Node*, IdentityExtractor<Node*>, NodeHash, NodeTraits, NodeT…
107 void unlinkAndDelete(Node*);
108 void appendNode(Node*);
109 void insertNodeBefore(Node* beforeNode, Node* newNode);
111 iterator makeIterator(Node*);
112 const_iterator makeConstIterator(Node*) const;
[all …]
|
| /external/chromium/base/ |
| D | linked_list_unittest.cc | 12 class Node : public LinkNode<Node> { class
14 explicit Node(int id) : id_(id) {} in Node() function in base::__anon3b4e741d0111::Node
37 void ExpectListContentsForDirection(const LinkedList<Node>& list, in ExpectListContentsForDirection()
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); in ExpectListContentsForDirection()
51 void ExpectListContents(const LinkedList<Node>& list, in ExpectListContents()
65 LinkedList<Node> list; in TEST()
72 LinkedList<Node> list; in TEST()
75 Node n1(1); in TEST()
85 Node n2(2); in TEST()
95 Node n3(3); in TEST()
[all …]
|
| /external/webkit/WebCore/bindings/v8/custom/ |
| D | V8NodeCustom.cpp | 62 Node* node = V8Node::toNative(args.Holder()); in addEventListenerCallback()
77 Node* node = V8Node::toNative(args.Holder()); in removeEventListenerCallback()
98 Node* imp = V8Node::toNative(holder); in insertBeforeCallback()
100 …Node* newChild = V8Node::HasInstance(args[0]) ? V8Node::toNative(v8::Handle<v8::Object>::Cast(args… in insertBeforeCallback()
101 …Node* refChild = V8Node::HasInstance(args[1]) ? V8Node::toNative(v8::Handle<v8::Object>::Cast(args… in insertBeforeCallback()
117 Node* imp = V8Node::toNative(holder); in replaceChildCallback()
119 …Node* newChild = V8Node::HasInstance(args[0]) ? V8Node::toNative(v8::Handle<v8::Object>::Cast(args… in replaceChildCallback()
120 …Node* oldChild = V8Node::HasInstance(args[1]) ? V8Node::toNative(v8::Handle<v8::Object>::Cast(args… in replaceChildCallback()
135 Node* imp = V8Node::toNative(holder); in removeChildCallback()
137 …Node* oldChild = V8Node::HasInstance(args[0]) ? V8Node::toNative(v8::Handle<v8::Object>::Cast(args… in removeChildCallback()
[all …]
|
| /external/webkit/JavaScriptCore/API/tests/ |
| D | Node.h | 29 typedef struct __Node Node; typedef
33 Node* node;
43 extern Node* Node_new(void);
44 extern void Node_ref(Node* node);
45 extern void Node_deref(Node* node);
46 extern void Node_appendChild(Node* node, Node* child);
47 extern void Node_removeChild(Node* node, Node* child);
48 extern void Node_replaceChild(Node* node, Node* newChild, Node* oldChild);
|