Searched refs:nextChild (Results 1 – 12 of 12) sorted by relevance
66 RefPtr<Node> nextChild; member251 ASSERT(!nextChild || nextChild == newNextChild);252 nextChild = newNextChild;261 nextChild.swap(other.nextChild);275 ASSERT(!stringBuilder.isEmpty() || !nextChild);281 RefPtr<Node> nextChild;
104 if (task.nextChild) in insert()105 task.parent->parserInsertBefore(task.child.get(), *task.nextChild); in insert()130 …Node* previousChild = task.nextChild ? task.nextChild->previousSibling() : task.parent->lastChild(… in executeInsertTextTask()254 task.nextChild = pendingText.nextChild; in flushPendingText()676 …) && (m_pendingText.parent != dummyTask.parent || m_pendingText.nextChild != dummyTask.nextChild)) in insertTextNode()678 m_pendingText.append(dummyTask.parent, dummyTask.nextChild, string, whitespaceMode); in insertTextNode()833 task.nextChild = lastTableElement; in findFosterSite()
235 void ContainerNode::insertBeforeCommon(Node& nextChild, Node& newChild) in insertBeforeCommon() argument244 Node* prev = nextChild.previousSibling(); in insertBeforeCommon()246 nextChild.setPreviousSibling(&newChild); in insertBeforeCommon()248 ASSERT(m_firstChild != nextChild); in insertBeforeCommon()249 ASSERT(prev->nextSibling() == nextChild); in insertBeforeCommon()252 ASSERT(m_firstChild == nextChild); in insertBeforeCommon()257 newChild.setNextSibling(&nextChild); in insertBeforeCommon()260 void ContainerNode::parserInsertBefore(PassRefPtr<Node> newChild, Node& nextChild) in parserInsertBefore() argument263 ASSERT(nextChild.parentNode() == this); in parserInsertBefore()267 if (nextChild.previousSibling() == newChild || nextChild == newChild) // nothing to do in parserInsertBefore()[all …]
149 void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild);150 void insertBeforeCommon(Node& nextChild, Node& oldChild);
77 CounterNode* nextChild = child->m_nextSibling; in ~CounterNode() local88 child = nextChild; in ~CounterNode()
358 RefPtr<Node> nextChild = child->nextSibling(); in removeNode() local361 if (nextChild && nextChild->parentNode() != node) in removeNode()363 child = nextChild; in removeNode()
989 RefPtr<Node> nextChild; in removeElementPreservingChildren() local990 for (RefPtr<Node> child = element->firstChild(); child; child = nextChild) { in removeElementPreservingChildren()991 nextChild = child->nextSibling(); in removeElementPreservingChildren()
1321 Node* nextChild = nextElement->firstChild(); in mergeEndWithNextIfIdentical() local1326 int endOffset = nextChild ? nextChild->nodeIndex() : nextElement->childNodes()->length(); in mergeEndWithNextIfIdentical()
117 var nextChild = this.children[index];118 if (nextChild) {119 nextChild.previousSibling = child;120 child.nextSibling = nextChild;
1503 var nextChild = this.parent.children[myIndex + 1];1505 if (nextChild) {1506 nextChild.previousSibling = this;1507 this.nextSibling = nextChild;
363 DomTreeNode *nextChild() { in nextChild() function in __anonde2cc2b70311::EarlyCSE::StackNode609 DomTreeNode *child = NodeToProcess->nextChild(); in runOnFunction()
238 nextChild = self.contents[position]239 newChild.nextSibling = nextChild242 newChildsLastElement.next = nextChild