Lines Matching defs:parentNode
134 for (Node* parentA = containerA; parentA; parentA = parentA->parentNode()) {
135 for (Node* parentB = containerB; parentB; parentB = parentB->parentNode()) {
146 while (endRootContainer->parentNode())
147 endRootContainer = endRootContainer->parentNode();
149 while (startRootContainer->parentNode())
150 startRootContainer = startRootContainer->parentNode();
296 ContainerNode* parentNode = refNode->parentNode();
299 if (!parentNode) {
306 if (comparePoint(parentNode, nodeIndex, exceptionState) < 0) { // starts before
307 if (comparePoint(parentNode, nodeIndex + 1, exceptionState) > 0) // ends after the range
312 if (comparePoint(parentNode, nodeIndex + 1, exceptionState) > 0) // ends after the range
333 while (thisTop->parentNode())
334 thisTop = thisTop->parentNode();
335 while (sourceTop->parentNode())
336 sourceTop = sourceTop->parentNode();
381 while (c && c->parentNode() != containerA)
382 c = c->parentNode();
399 while (c && c->parentNode() != containerB)
400 c = c->parentNode();
423 while (childA && childA->parentNode() != commonAncestor)
424 childA = childA->parentNode();
428 while (childB && childB->parentNode() != commonAncestor)
429 childB = childB->parentNode();
493 ContainerNode* parentNode = refNode->parentNode();
496 if (!parentNode) {
503 if (comparePoint(parentNode, nodeIndex, exceptionState) < 0 // starts before start
504 && comparePoint(parentNode, nodeIndex + 1, exceptionState) < 0) { // ends before start
508 if (comparePoint(parentNode, nodeIndex, exceptionState) > 0 // starts after end
509 && comparePoint(parentNode, nodeIndex + 1, exceptionState) > 0) { // ends after end
523 ContainerNode* parentNode = refNode->parentNode();
526 if (!parentNode) {
536 if (compareBoundaryPoints(parentNode, nodeIndex, startContainerNode, startOffset, exceptionState) < 0 // starts before start
537 && compareBoundaryPoints(parentNode, nodeIndex + 1, startContainerNode, startOffset, exceptionState) < 0) { // ends before start
545 if (compareBoundaryPoints(parentNode, nodeIndex, endContainerNode, endOffset, exceptionState) > 0 // starts after end
546 && compareBoundaryPoints(parentNode, nodeIndex + 1, endContainerNode, endOffset, exceptionState) > 0) { // ends after end
561 while (node->parentNode() != commonRoot)
562 node = node->parentNode();
580 while (container->parentNode() != commonRoot)
581 container = container->parentNode();
657 setStart(partialStart->parentNode(), partialStart->nodeIndex() + 1, exceptionState);
661 setStart(partialEnd->parentNode(), partialEnd->nodeIndex(), exceptionState);
791 for (ContainerNode* n = container->parentNode(); n && n != commonRoot; n = n->parentNode())
807 ASSERT(!firstChildInAncestorToProcess || firstChildInAncestorToProcess->parentNode() == ancestor);
820 if (ancestor == child->parentNode())
871 if (startIsText && !m_start.container()->parentNode()) {
880 checkAgainst = m_start.container()->parentNode();
904 for (Node* n = m_start.container(); n; n = n->parentNode()) {
935 container->parentNode()->insertBefore(newNode.release(), newText.get(), exceptionState);
942 // Given circumstance may mutate the tree so newText->parentNode() may become null
943 if (!newText->parentNode()) {
1094 if (!n->parentNode()) {
1115 while (ContainerNode* parent = root->parentNode())
1145 setStart(refNode->parentNode(), refNode->nodeIndex() + 1, exceptionState);
1154 setEnd(refNode->parentNode(), refNode->nodeIndex(), exceptionState);
1163 setEnd(refNode->parentNode(), refNode->nodeIndex() + 1, exceptionState);
1173 if (!refNode->parentNode()) {
1181 for (ContainerNode* anc = refNode->parentNode(); anc; anc = anc->parentNode()) {
1229 for (Node* n = refNode; n; n = n->parentNode()) {
1259 for (Node* n = refNode; n; n = n->parentNode()) {
1295 startNonTextContainer = startNonTextContainer->parentNode();
1298 endNonTextContainer = endNonTextContainer->parentNode();
1328 parentOfNewParent = parentOfNewParent->parentNode();
1371 setStart(refNode->parentNode(), refNode->nodeIndex(), exceptionState);
1546 for (Node* n = boundary.container(); n; n = n->parentNode()) {
1569 for (Node* n = boundary.container(); n; n = n->parentNode()) {
1583 // should change following if-statement to ASSERT(!node->parentNode).
1584 if (!node.parentNode())
1633 else if (boundary.container() == oldNode.node().parentNode() && boundary.offset() == oldNode.index())
1640 ASSERT(oldNode.node().parentNode());
1674 ASSERT(oldNode.parentNode());
1733 if (!nodeSet.contains(node->parentNode())) {