151         node = node->parentNode();  in highestEditableRoot()
168         node = node->parentNode();  in lowestEditableAncestor()
181         node = node->parentNode();  in isEditablePosition()
200         node = node->parentNode();  in isRichlyEditablePosition()
212         node = node->parentNode();  in editableRootForPosition()
348         if (node->parentNode() && (editingIgnoresContent(node) || isTableElement(node)))  in rangeCompliantEquivalent()
358         if (node->parentNode())  in rangeCompliantEquivalent()
369         return node->parentNode() ? positionInParentBeforeNode(node) : Position(node, 0);  in rangeCompliantEquivalent()
504 …r (Node* n = pos.node(); n && n->rootEditableElement() == rootEditableElement; n = n->parentNode())  in firstInSpecialElement()
520 …r (Node* n = pos.node(); n && n->rootEditableElement() == rootEditableElement; n = n->parentNode())  in lastInSpecialElement()
601     ASSERT(node->parentNode());  in visiblePositionBeforeNode()
611     ASSERT(node->parentNode());  in visiblePositionAfterNode()
644         ancestor = ancestor->parentNode();  in extendRangeToWrappingNodes()
672     for (Node* n = p.node(); n; n = n->parentNode()) {  in enclosingNodeWithTag()
690     for (Node* n = p.node(); n; n = n->parentNode()) {  in enclosingNodeOfType()
708     for (Node* n = p.node(); n; n = n->parentNode()) {  in highestEnclosingNodeOfType()
730         node = node->parentNode();  in enclosingAnchorElement()
741     for (Node* n = node->parentNode(); n; n = n->parentNode()) {  in enclosingList()
760     for (Node* n = node; n && n->parentNode(); n = n->parentNode()) {  in enclosingListChild()
761         if (n->hasTagName(liTag) || isListElement(n->parentNode()))  in enclosingListChild()
840     while ((node = node->parentNode()))  in highestAncestor()
866 …->isTableCell() || (node->renderer()->isBR() && node->parentNode()->renderer() && node->parentNode…  in isEmptyTableCell()
911     return node && node->isTextNode() && node->parentNode() && isTabSpanNode(node->parentNode());  in isTabSpanTextNode()
916     return isTabSpanTextNode(node) ? node->parentNode() : 0;  in tabSpanNode()
982     for (Node *n = const_cast<Node *>(node); n; n = n->parentNode()) {  in nearestMailBlockquote()
992     for (Node* n = p.node(); n; n = n->parentNode())  in numEnclosingMailBlockquotes()
1133         ASSERT(node->parentNode());  in avoidIntersectionWithNode()
1134         startContainer = node->parentNode();  in avoidIntersectionWithNode()
1138         ASSERT(node->parentNode());  in avoidIntersectionWithNode()
1139         endContainer = node->parentNode();  in avoidIntersectionWithNode()
1158         ASSERT(node->parentNode());  in avoidIntersectionWithNode()
1159         updatedSelection.setBase(Position(node->parentNode(), node->nodeIndex()));  in avoidIntersectionWithNode()
1163         ASSERT(node->parentNode());  in avoidIntersectionWithNode()
1164         updatedSelection.setExtent(Position(node->parentNode(), node->nodeIndex()));  in avoidIntersectionWithNode()