Lines Matching refs:highestRoot
141 Node* highestRoot = editableRootForPosition(position);
142 if (!highestRoot)
145 node = highestRoot;
148 highestRoot = node;
154 return highestRoot;
277 VisiblePosition firstEditablePositionAfterPositionInRoot(const Position& position, Node* highestRoot)
279 // position falls before highestRoot.
280 if (comparePositions(position, firstDeepEditingPositionForNode(highestRoot)) == -1 && highestRoot->isContentEditable())
281 return firstDeepEditingPositionForNode(highestRoot);
289 while (p.node() && !isEditablePosition(p) && p.node()->isDescendantOf(highestRoot))
292 if (p.node() && p.node() != highestRoot && !p.node()->isDescendantOf(highestRoot))
298 VisiblePosition lastEditablePositionBeforePositionInRoot(const Position& position, Node* highestRoot)
300 // When position falls after highestRoot, the result is easy to compute.
301 if (comparePositions(position, lastDeepEditingPositionForNode(highestRoot)) == 1)
302 return lastDeepEditingPositionForNode(highestRoot);
310 while (p.node() && !isEditablePosition(p) && p.node()->isDescendantOf(highestRoot))
313 if (p.node() && p.node() != highestRoot && !p.node()->isDescendantOf(highestRoot))
