rootNode          164 Source/bindings/v8/V8GCController.cpp     bool traverseTree(Node* rootNode, Vector<Node*, initialNodeVectorSize>* partiallyDependentNodes)
rootNode          169 Source/bindings/v8/V8GCController.cpp         for (Node* node = rootNode; node; node = NodeTraversal::next(*node)) {
rootNode           49 Source/core/dom/ChildNodeList.cpp     return LIKELY(!!previous) ? previous->previousSibling() : rootNode().lastChild();
rootNode           36 Source/core/dom/ChildNodeList.h     static PassRefPtr<ChildNodeList> create(ContainerNode& rootNode)
rootNode           38 Source/core/dom/ChildNodeList.h         return adoptRef(new ChildNodeList(rootNode));
rootNode           52 Source/core/dom/ChildNodeList.h     ContainerNode& rootNode() const { return ownerNode(); }
rootNode           55 Source/core/dom/ChildNodeList.h     Node* traverseToFirstElement() const { return rootNode().firstChild(); }
rootNode           59 Source/core/dom/ChildNodeList.h     explicit ChildNodeList(ContainerNode& rootNode);
rootNode           38 Source/core/dom/ClassCollection.cpp ClassCollection::ClassCollection(ContainerNode& rootNode, const AtomicString& classNames)
rootNode           39 Source/core/dom/ClassCollection.cpp     : HTMLCollection(rootNode, ClassCollectionType, DoesNotOverrideItemAfter)
rootNode           43 Source/core/dom/ClassCollection.h     static PassRefPtr<ClassCollection> create(ContainerNode& rootNode, CollectionType type, const AtomicString& classNames)
rootNode           46 Source/core/dom/ClassCollection.h         return adoptRef(new ClassCollection(rootNode, classNames));
rootNode           54 Source/core/dom/ClassCollection.h     ClassCollection(ContainerNode& rootNode, const AtomicString& classNames);
rootNode          119 Source/core/dom/DocumentOrderedMap.cpp     for (Element* element = ElementTraversal::firstWithin(scope->rootNode()); element; element = ElementTraversal::next(*element)) {
rootNode          149 Source/core/dom/DocumentOrderedMap.cpp         for (Element* element = entry->element ? entry->element : ElementTraversal::firstWithin(scope->rootNode()); entry->orderedList.size() < entry->count; element = ElementTraversal::next(*element)) {
rootNode           54 Source/core/dom/DocumentStyleSheetCollection.cpp     ASSERT(treeScope.rootNode() == treeScope.rootNode().document());
rootNode          839 Source/core/dom/Element.h     if (isInShadowTree() && !treeScope().rootNode().isShadowRoot())
rootNode           42 Source/core/dom/EmptyNodeList.h     static PassRefPtr<EmptyNodeList> create(Node& rootNode)
rootNode           44 Source/core/dom/EmptyNodeList.h         return adoptRef(new EmptyNodeList(rootNode));
rootNode           51 Source/core/dom/EmptyNodeList.h     explicit EmptyNodeList(Node& rootNode) : m_owner(rootNode) { }
rootNode           63 Source/core/dom/LiveNodeListBase.h     ContainerNode& rootNode() const;
rootNode          147 Source/core/dom/LiveNodeListBase.h inline Node* LiveNodeListBase::lastNode(const ContainerNode& rootNode, bool onlyIncludeDirectChildren)
rootNode          149 Source/core/dom/LiveNodeListBase.h     return onlyIncludeDirectChildren ? rootNode.lastChild() : lastDescendant(rootNode);
rootNode          156 Source/core/dom/LiveNodeListBase.h     ContainerNode& rootNode = collection.rootNode();
rootNode          157 Source/core/dom/LiveNodeListBase.h     for (; current; current = previousNode(rootNode, *current, onlyIncludeDirectChildren)) {
rootNode          169 Source/core/dom/LiveNodeListBase.h         current = previousNode(collection.rootNode(), *previous, collection.shouldOnlyIncludeDirectChildren());
rootNode          171 Source/core/dom/LiveNodeListBase.h         current = lastNode(collection.rootNode(), collection.shouldOnlyIncludeDirectChildren());
rootNode          179 Source/core/dom/LiveNodeListBase.h     ContainerNode& root = nodeList.rootNode();
rootNode          189 Source/core/dom/LiveNodeListBase.h     ContainerNode& root = nodeList.rootNode();
rootNode           34 Source/core/dom/NameNodeList.cpp NameNodeList::NameNodeList(ContainerNode& rootNode, const AtomicString& name)
rootNode           35 Source/core/dom/NameNodeList.cpp     : LiveNodeList(rootNode, NameNodeListType, InvalidateOnNameAttrChange)
rootNode           36 Source/core/dom/NameNodeList.h     static PassRefPtr<NameNodeList> create(ContainerNode& rootNode, CollectionType type, const AtomicString& name)
rootNode           39 Source/core/dom/NameNodeList.h         return adoptRef(new NameNodeList(rootNode, name));
rootNode           45 Source/core/dom/NameNodeList.h     NameNodeList(ContainerNode& rootNode, const AtomicString& name);
rootNode          668 Source/core/dom/Node.cpp unsigned styledSubtreeSizeIgnoringSelfAndShadowRoots(const Node* rootNode)
rootNode          671 Source/core/dom/Node.cpp     for (Node* child = rootNode->firstChild(); child; child = child->nextSibling())
rootNode          676 Source/core/dom/Node.cpp unsigned styledSubtreeSize(const Node* rootNode)
rootNode          678 Source/core/dom/Node.cpp     if (rootNode->isTextNode())
rootNode          680 Source/core/dom/Node.cpp     if (!rootNode->isElementNode())
rootNode          684 Source/core/dom/Node.cpp     unsigned nodeCount = 1 + styledSubtreeSizeIgnoringSelfAndShadowRoots(rootNode);
rootNode          687 Source/core/dom/Node.cpp     for (ShadowRoot* shadowRoot = rootNode->youngestShadowRoot(); shadowRoot; shadowRoot = shadowRoot->olderShadowRoot())
rootNode          704 Source/core/dom/Node.cpp PassRefPtr<JSONObject> jsonObjectForStyleInvalidation(unsigned nodeCount, const Node* rootNode)
rootNode          708 Source/core/dom/Node.cpp     jsonObject->setString("root_node", rootNode->debugName());
rootNode         1127 Source/core/dom/Node.cpp     Node& root = treeScope().rootNode();
rootNode         1793 Source/core/dom/Node.cpp static void traverseTreeAndMark(const String& baseIndent, const Node* rootNode, const Node* markedNode1, const char* markedLabel1, const Node* markedNode2, const char* markedLabel2)
rootNode         1795 Source/core/dom/Node.cpp     for (const Node* node = rootNode; node; node = NodeTraversal::next(*node)) {
rootNode         1803 Source/core/dom/Node.cpp         for (const Node* tmpNode = node; tmpNode && tmpNode != rootNode; tmpNode = tmpNode->parentOrShadowHostNode())
rootNode         1818 Source/core/dom/Node.cpp     const Node* rootNode;
rootNode         1822 Source/core/dom/Node.cpp     rootNode = node;
rootNode         1825 Source/core/dom/Node.cpp     traverseTreeAndMark(startingIndent, rootNode, markedNode1, markedLabel1, markedNode2, markedLabel2);
rootNode         1871 Source/core/dom/Node.cpp     Node* rootNode = const_cast<Node*>(this);
rootNode         1872 Source/core/dom/Node.cpp     while (parentOrShadowHostOrFrameOwner(rootNode))
rootNode         1873 Source/core/dom/Node.cpp         rootNode = parentOrShadowHostOrFrameOwner(rootNode);
rootNode         1874 Source/core/dom/Node.cpp     showSubTreeAcrossFrame(rootNode, this, "");
rootNode         2337 Source/core/dom/Node.cpp         rootNode().m_inRemovedLastRefFunction = false;
rootNode         2342 Source/core/dom/Node.cpp         rootNode().m_inRemovedLastRefFunction = false;
rootNode          255 Source/core/dom/Node.h     bool isTreeScope() const { return &treeScope().rootNode() == this; }
rootNode           74 Source/core/dom/NodeIterator.cpp NodeIterator::NodeIterator(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter)
rootNode           75 Source/core/dom/NodeIterator.cpp     : NodeIteratorBase(rootNode, whatToShow, filter)
rootNode           40 Source/core/dom/NodeIterator.h     static PassRefPtr<NodeIterator> create(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter)
rootNode           42 Source/core/dom/NodeIterator.h         return adoptRef(new NodeIterator(rootNode, whatToShow, filter));
rootNode           34 Source/core/dom/NodeIteratorBase.cpp NodeIteratorBase::NodeIteratorBase(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> nodeFilter)
rootNode           35 Source/core/dom/NodeIteratorBase.cpp     : m_root(rootNode)
rootNode           67 Source/core/dom/SelectorQuery.cpp     ClassElementList(ContainerNode& rootNode, const AtomicString& className)
rootNode           69 Source/core/dom/SelectorQuery.cpp         , m_rootNode(rootNode)
rootNode           70 Source/core/dom/SelectorQuery.cpp         , m_currentElement(nextInternal(ElementTraversal::firstWithin(rootNode))) { }
rootNode          117 Source/core/dom/SelectorQuery.cpp inline bool SelectorDataList::selectorMatches(const CSSSelector& selector, Element& element, const ContainerNode& rootNode) const
rootNode          122 Source/core/dom/SelectorQuery.cpp     selectorCheckingContext.scope = !rootNode.isDocumentNode() ? &rootNode : 0;
rootNode          137 Source/core/dom/SelectorQuery.cpp PassRefPtr<NodeList> SelectorDataList::queryAll(ContainerNode& rootNode) const
rootNode          140 Source/core/dom/SelectorQuery.cpp     execute<AllElementsSelectorQueryTrait>(rootNode, result);
rootNode          144 Source/core/dom/SelectorQuery.cpp PassRefPtr<Element> SelectorDataList::queryFirst(ContainerNode& rootNode) const
rootNode          147 Source/core/dom/SelectorQuery.cpp     execute<SingleElementSelectorQueryTrait>(rootNode, matchedElement);
rootNode          152 Source/core/dom/SelectorQuery.cpp void SelectorDataList::collectElementsByClassName(ContainerNode& rootNode, const AtomicString& className,  typename SelectorQueryTrait::OutputType& output) const
rootNode          154 Source/core/dom/SelectorQuery.cpp     for (Element* element = ElementTraversal::firstWithin(rootNode); element; element = ElementTraversal::next(*element, &rootNode)) {
rootNode          164 Source/core/dom/SelectorQuery.cpp void SelectorDataList::collectElementsByTagName(ContainerNode& rootNode, const QualifiedName& tagName,  typename SelectorQueryTrait::OutputType& output) const
rootNode          166 Source/core/dom/SelectorQuery.cpp     for (Element* element = ElementTraversal::firstWithin(rootNode); element; element = ElementTraversal::next(*element, &rootNode)) {
rootNode          175 Source/core/dom/SelectorQuery.cpp inline bool SelectorDataList::canUseFastQuery(const ContainerNode& rootNode) const
rootNode          177 Source/core/dom/SelectorQuery.cpp     return m_selectors.size() == 1 && !m_crossesTreeBoundary && rootNode.inDocument() && !rootNode.document().inQuirksMode();
rootNode          180 Source/core/dom/SelectorQuery.cpp inline bool ancestorHasClassName(ContainerNode& rootNode, const AtomicString& className)
rootNode          182 Source/core/dom/SelectorQuery.cpp     if (!rootNode.isElementNode())
rootNode          185 Source/core/dom/SelectorQuery.cpp     for (Element* element = &toElement(rootNode); element; element = element->parentElement()) {
rootNode          201 Source/core/dom/SelectorQuery.cpp void SelectorDataList::findTraverseRootsAndExecute(ContainerNode& rootNode, typename SelectorQueryTrait::OutputType& output) const
rootNode          211 Source/core/dom/SelectorQuery.cpp         if (selector->m_match == CSSSelector::Id && !rootNode.document().containsMultipleElementsWithId(selector->value())) {
rootNode          212 Source/core/dom/SelectorQuery.cpp             Element* element = rootNode.treeScope().getElementById(selector->value());
rootNode          213 Source/core/dom/SelectorQuery.cpp             ContainerNode* adjustedNode = &rootNode;
rootNode          214 Source/core/dom/SelectorQuery.cpp             if (element && (isTreeScopeRoot(rootNode) || element->isDescendantOf(&rootNode)))
rootNode          219 Source/core/dom/SelectorQuery.cpp                 executeForTraverseRoot<SelectorQueryTrait>(*m_selectors[0], adjustedNode, MatchesTraverseRoots, rootNode, output);
rootNode          226 Source/core/dom/SelectorQuery.cpp             executeForTraverseRoot<SelectorQueryTrait>(*m_selectors[0], adjustedNode, DoesNotMatchTraverseRoots, rootNode, output);
rootNode          234 Source/core/dom/SelectorQuery.cpp                 ClassElementList<AllElements> traverseRoots(rootNode, selector->value());
rootNode          235 Source/core/dom/SelectorQuery.cpp                 executeForTraverseRoots<SelectorQueryTrait>(*m_selectors[0], traverseRoots, MatchesTraverseRoots, rootNode, output);
rootNode          239 Source/core/dom/SelectorQuery.cpp             if (ancestorHasClassName(rootNode, selector->value())) {
rootNode          240 Source/core/dom/SelectorQuery.cpp                 executeForTraverseRoot<SelectorQueryTrait>(*m_selectors[0], &rootNode, DoesNotMatchTraverseRoots, rootNode, output);
rootNode          244 Source/core/dom/SelectorQuery.cpp             ClassElementList<OnlyRoots> traverseRoots(rootNode, selector->value());
rootNode          245 Source/core/dom/SelectorQuery.cpp             executeForTraverseRoots<SelectorQueryTrait>(*m_selectors[0], traverseRoots, DoesNotMatchTraverseRoots, rootNode, output);
rootNode          258 Source/core/dom/SelectorQuery.cpp     executeForTraverseRoot<SelectorQueryTrait>(*m_selectors[0], &rootNode, DoesNotMatchTraverseRoots, rootNode, output);
rootNode          262 Source/core/dom/SelectorQuery.cpp void SelectorDataList::executeForTraverseRoot(const CSSSelector& selector, ContainerNode* traverseRoot, MatchTraverseRootState matchTraverseRoot, ContainerNode& rootNode, typename SelectorQueryTrait::OutputType& output) const
rootNode          268 Source/core/dom/SelectorQuery.cpp         if (selectorMatches(selector, toElement(*traverseRoot), rootNode))
rootNode          274 Source/core/dom/SelectorQuery.cpp         if (selectorMatches(selector, *element, rootNode)) {
rootNode          283 Source/core/dom/SelectorQuery.cpp void SelectorDataList::executeForTraverseRoots(const CSSSelector& selector, SimpleElementListType& traverseRoots, MatchTraverseRootState matchTraverseRoots, ContainerNode& rootNode, typename SelectorQueryTrait::OutputType& output) const
rootNode          291 Source/core/dom/SelectorQuery.cpp             if (selectorMatches(selector, element, rootNode)) {
rootNode          303 Source/core/dom/SelectorQuery.cpp             if (selectorMatches(selector, *element, rootNode)) {
rootNode          313 Source/core/dom/SelectorQuery.cpp bool SelectorDataList::selectorListMatches(ContainerNode& rootNode, Element& element, typename SelectorQueryTrait::OutputType& output) const
rootNode          316 Source/core/dom/SelectorQuery.cpp         if (selectorMatches(*m_selectors[i], element, rootNode)) {
rootNode          325 Source/core/dom/SelectorQuery.cpp void SelectorDataList::executeSlow(ContainerNode& rootNode, typename SelectorQueryTrait::OutputType& output) const
rootNode          327 Source/core/dom/SelectorQuery.cpp     for (Element* element = ElementTraversal::firstWithin(rootNode); element; element = ElementTraversal::next(*element, &rootNode)) {
rootNode          328 Source/core/dom/SelectorQuery.cpp         if (selectorListMatches<SelectorQueryTrait>(rootNode, *element, output) && SelectorQueryTrait::shouldOnlyMatchFirstElement)
rootNode          349 Source/core/dom/SelectorQuery.cpp static ContainerNode* firstWithinTraversingShadowTree(const ContainerNode& rootNode)
rootNode          351 Source/core/dom/SelectorQuery.cpp     if (ShadowRoot* shadowRoot = authorShadowRootOf(rootNode))
rootNode          353 Source/core/dom/SelectorQuery.cpp     return ElementTraversal::firstWithin(rootNode);
rootNode          356 Source/core/dom/SelectorQuery.cpp static ContainerNode* nextTraversingShadowTree(const ContainerNode& node, const ContainerNode* rootNode)
rootNode          361 Source/core/dom/SelectorQuery.cpp     if (Element* next = ElementTraversal::next(node, rootNode))
rootNode          368 Source/core/dom/SelectorQuery.cpp     if (shadowRoot == rootNode)
rootNode          376 Source/core/dom/SelectorQuery.cpp     return ElementTraversal::next(*shadowHost, rootNode);
rootNode          380 Source/core/dom/SelectorQuery.cpp void SelectorDataList::executeSlowTraversingShadowTree(ContainerNode& rootNode, typename SelectorQueryTrait::OutputType& output) const
rootNode          382 Source/core/dom/SelectorQuery.cpp     for (ContainerNode* node = firstWithinTraversingShadowTree(rootNode); node; node = nextTraversingShadowTree(*node, &rootNode)) {
rootNode          386 Source/core/dom/SelectorQuery.cpp         if (selectorListMatches<SelectorQueryTrait>(rootNode, *element, output) && SelectorQueryTrait::shouldOnlyMatchFirstElement)
rootNode          403 Source/core/dom/SelectorQuery.cpp void SelectorDataList::execute(ContainerNode& rootNode, typename SelectorQueryTrait::OutputType& output) const
rootNode          405 Source/core/dom/SelectorQuery.cpp     if (!canUseFastQuery(rootNode)) {
rootNode          407 Source/core/dom/SelectorQuery.cpp             executeSlowTraversingShadowTree<SelectorQueryTrait>(rootNode, output);
rootNode          409 Source/core/dom/SelectorQuery.cpp             executeSlow<SelectorQueryTrait>(rootNode, output);
rootNode          421 Source/core/dom/SelectorQuery.cpp         if (rootNode.treeScope().containsMultipleElementsWithId(idToMatch)) {
rootNode          422 Source/core/dom/SelectorQuery.cpp             const Vector<Element*>& elements = rootNode.treeScope().getAllElementsById(idToMatch);
rootNode          426 Source/core/dom/SelectorQuery.cpp                 if (!(isTreeScopeRoot(rootNode) || element.isDescendantOf(&rootNode)))
rootNode          428 Source/core/dom/SelectorQuery.cpp                 if (selectorMatches(selector, element, rootNode)) {
rootNode          436 Source/core/dom/SelectorQuery.cpp         Element* element = rootNode.treeScope().getElementById(idToMatch);
rootNode          437 Source/core/dom/SelectorQuery.cpp         if (!element || !(isTreeScopeRoot(rootNode) || element->isDescendantOf(&rootNode)))
rootNode          439 Source/core/dom/SelectorQuery.cpp         if (selectorMatches(selector, *element, rootNode))
rootNode          448 Source/core/dom/SelectorQuery.cpp             collectElementsByClassName<SelectorQueryTrait>(rootNode, firstSelector.value(), output);
rootNode          451 Source/core/dom/SelectorQuery.cpp             collectElementsByTagName<SelectorQueryTrait>(rootNode, firstSelector.tagQName(), output);
rootNode          458 Source/core/dom/SelectorQuery.cpp     findTraverseRootsAndExecute<SelectorQueryTrait>(rootNode, output);
rootNode          472 Source/core/dom/SelectorQuery.cpp PassRefPtr<NodeList> SelectorQuery::queryAll(ContainerNode& rootNode) const
rootNode          474 Source/core/dom/SelectorQuery.cpp     return m_selectors.queryAll(rootNode);
rootNode          477 Source/core/dom/SelectorQuery.cpp PassRefPtr<Element> SelectorQuery::queryFirst(ContainerNode& rootNode) const
rootNode          479 Source/core/dom/SelectorQuery.cpp     return m_selectors.queryFirst(rootNode);
rootNode           51 Source/core/dom/SelectorQuery.h     PassRefPtr<NodeList> queryAll(ContainerNode& rootNode) const;
rootNode           52 Source/core/dom/SelectorQuery.h     PassRefPtr<Element> queryFirst(ContainerNode& rootNode) const;
rootNode           55 Source/core/dom/SelectorQuery.h     bool canUseFastQuery(const ContainerNode& rootNode) const;
rootNode           59 Source/core/dom/SelectorQuery.h     void collectElementsByClassName(ContainerNode& rootNode, const AtomicString& className, typename SelectorQueryTrait::OutputType&) const;
rootNode           61 Source/core/dom/SelectorQuery.h     void collectElementsByTagName(ContainerNode& rootNode, const QualifiedName& tagName, typename SelectorQueryTrait::OutputType&) const;
rootNode           64 Source/core/dom/SelectorQuery.h     void findTraverseRootsAndExecute(ContainerNode& rootNode, typename SelectorQueryTrait::OutputType&) const;
rootNode           68 Source/core/dom/SelectorQuery.h     void executeForTraverseRoot(const CSSSelector&, ContainerNode* traverseRoot, MatchTraverseRootState, ContainerNode& rootNode, typename SelectorQueryTrait::OutputType&) const;
rootNode           70 Source/core/dom/SelectorQuery.h     void executeForTraverseRoots(const CSSSelector&, SimpleElementListType& traverseRoots, MatchTraverseRootState, ContainerNode& rootNode, typename SelectorQueryTrait::OutputType&) const;
rootNode           73 Source/core/dom/SelectorQuery.h     bool selectorListMatches(ContainerNode& rootNode, Element&, typename SelectorQueryTrait::OutputType&) const;
rootNode           75 Source/core/dom/SelectorQuery.h     void executeSlow(ContainerNode& rootNode, typename SelectorQueryTrait::OutputType&) const;
rootNode           77 Source/core/dom/SelectorQuery.h     void executeSlowTraversingShadowTree(ContainerNode& rootNode, typename SelectorQueryTrait::OutputType&) const;
rootNode           79 Source/core/dom/SelectorQuery.h     void execute(ContainerNode& rootNode, typename SelectorQueryTrait::OutputType&) const;
rootNode           92 Source/core/dom/SelectorQuery.h     PassRefPtr<NodeList> queryAll(ContainerNode& rootNode) const;
rootNode           93 Source/core/dom/SelectorQuery.h     PassRefPtr<Element> queryFirst(ContainerNode& rootNode) const;
rootNode          113 Source/core/dom/ShadowTreeStyleSheetCollection.cpp         toShadowRoot(m_treeScope.rootNode()).host()->setNeedsStyleRecalc(SubtreeStyleChange);
rootNode           32 Source/core/dom/TagCollection.cpp TagCollection::TagCollection(ContainerNode& rootNode, CollectionType type, const AtomicString& namespaceURI, const AtomicString& localName)
rootNode           33 Source/core/dom/TagCollection.cpp     : HTMLCollection(rootNode, type, DoesNotOverrideItemAfter)
rootNode           57 Source/core/dom/TagCollection.cpp HTMLTagCollection::HTMLTagCollection(ContainerNode& rootNode, const AtomicString& localName)
rootNode           58 Source/core/dom/TagCollection.cpp     : TagCollection(rootNode, HTMLTagCollectionType, starAtom, localName)
rootNode           36 Source/core/dom/TagCollection.h     static PassRefPtr<TagCollection> create(ContainerNode& rootNode, const AtomicString& namespaceURI, const AtomicString& localName)
rootNode           39 Source/core/dom/TagCollection.h         return adoptRef(new TagCollection(rootNode, TagCollectionType, namespaceURI, localName));
rootNode           42 Source/core/dom/TagCollection.h     static PassRefPtr<TagCollection> create(ContainerNode& rootNode, CollectionType type, const AtomicString& localName)
rootNode           45 Source/core/dom/TagCollection.h         return adoptRef(new TagCollection(rootNode, TagCollectionType, starAtom, localName));
rootNode           53 Source/core/dom/TagCollection.h     TagCollection(ContainerNode& rootNode, CollectionType, const AtomicString& namespaceURI, const AtomicString& localName);
rootNode           61 Source/core/dom/TagCollection.h     static PassRefPtr<HTMLTagCollection> create(ContainerNode& rootNode, CollectionType type, const AtomicString& localName)
rootNode           64 Source/core/dom/TagCollection.h         return adoptRef(new HTMLTagCollection(rootNode, localName));
rootNode           70 Source/core/dom/TagCollection.h     HTMLTagCollection(ContainerNode& rootNode, const AtomicString& localName);
rootNode           58 Source/core/dom/TreeScope.cpp TreeScope::TreeScope(ContainerNode& rootNode, Document& document)
rootNode           59 Source/core/dom/TreeScope.cpp     : m_rootNode(rootNode)
rootNode           65 Source/core/dom/TreeScope.cpp     ASSERT(rootNode != document);
rootNode           96 Source/core/dom/TreeScope.cpp     if (rootNode().isShadowRoot()) {
rootNode           97 Source/core/dom/TreeScope.cpp         if (ShadowRoot* olderShadowRoot = toShadowRoot(rootNode()).olderShadowRoot())
rootNode          114 Source/core/dom/TreeScope.cpp     return rootNode().hasTreeSharedParent();
rootNode          127 Source/core/dom/TreeScope.cpp     ASSERT(!rootNode().isDocumentNode());
rootNode          213 Source/core/dom/TreeScope.cpp     if (rootNode().document().isHTMLDocument())
rootNode          242 Source/core/dom/TreeScope.cpp     HitTestResult result = hitTestInDocument(&rootNode().document(), x, y);
rootNode          275 Source/core/dom/TreeScope.cpp         for (HTMLLabelElement* label = Traversal<HTMLLabelElement>::firstWithin(rootNode()); label; label = Traversal<HTMLLabelElement>::next(*label)) {
rootNode          287 Source/core/dom/TreeScope.cpp     if (!rootNode().document().frame())
rootNode          306 Source/core/dom/TreeScope.cpp     for (HTMLAnchorElement* anchor = Traversal<HTMLAnchorElement>::firstWithin(rootNode()); anchor; anchor = Traversal<HTMLAnchorElement>::next(*anchor)) {
rootNode          307 Source/core/dom/TreeScope.cpp         if (rootNode().document().inQuirksMode()) {
rootNode          322 Source/core/dom/TreeScope.cpp     return !rootNode().isShadowRoot() || toShadowRoot(rootNode()).applyAuthorStyles();
rootNode          346 Source/core/dom/TreeScope.cpp     Document& document = rootNode().document();
rootNode          357 Source/core/dom/TreeScope.cpp         if (eventPath[i].node() == rootNode()) {
rootNode          391 Source/core/dom/TreeScope.cpp             Node* shadowHost1 = child1->rootNode().parentOrShadowHostNode();
rootNode          392 Source/core/dom/TreeScope.cpp             Node* shadowHost2 = child2->rootNode().parentOrShadowHostNode();
rootNode          396 Source/core/dom/TreeScope.cpp             for (const ShadowRoot* child = toShadowRoot(child2->rootNode()).olderShadowRoot(); child; child = child->olderShadowRoot())
rootNode          447 Source/core/dom/TreeScope.cpp     return rootNode().m_deletionHasBegun;
rootNode          452 Source/core/dom/TreeScope.cpp     rootNode().m_deletionHasBegun = true;
rootNode          458 Source/core/dom/TreeScope.cpp     return rootNode().refCount();
rootNode          475 Source/core/dom/TreeScope.cpp     Node& root = rootNode();
rootNode          489 Source/core/dom/TreeScope.cpp     for (Element* element = ElementTraversal::firstWithin(rootNode()); element; element = ElementTraversal::nextIncludingPseudo(*element)) {
rootNode          101 Source/core/dom/TreeScope.h     Node& rootNode() const { return m_rootNode; }
rootNode          204 Source/core/dom/TreeScopeStyleSheetCollection.cpp     styleResolver->resetAuthorStyle(toContainerNode(&m_treeScope.rootNode()));
rootNode           36 Source/core/dom/TreeWalker.cpp TreeWalker::TreeWalker(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter)
rootNode           37 Source/core/dom/TreeWalker.cpp     : NodeIteratorBase(rootNode, whatToShow, filter)
rootNode           40 Source/core/dom/TreeWalker.h     static PassRefPtr<TreeWalker> create(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter)
rootNode           42 Source/core/dom/TreeWalker.h         return adoptRef(new TreeWalker(rootNode, whatToShow, filter));
rootNode          206 Source/core/dom/shadow/InsertionPoint.cpp             if (canBeActive() && !m_registeredWithShadowRoot && insertionPoint->treeScope().rootNode() == root) {
rootNode          236 Source/core/dom/shadow/InsertionPoint.cpp     if (m_registeredWithShadowRoot && insertionPoint->treeScope().rootNode() == root) {
rootNode          162 Source/core/dom/shadow/ShadowRoot.h DEFINE_TYPE_CASTS(ShadowRoot, TreeScope, treeScope, treeScope->rootNode().isShadowRoot(), treeScope.rootNode().isShadowRoot());
rootNode          754 Source/core/editing/DeleteSelectionCommand.cpp     Node* rootNode = node->rootEditableElement();
rootNode          756 Source/core/editing/DeleteSelectionCommand.cpp     while (node != rootNode) {
rootNode          126 Source/core/editing/FrameSelection.cpp     return node ? &node->treeScope().rootNode() : 0;
rootNode           44 Source/core/editing/SimplifyMarkupCommand.cpp     Node* rootNode = m_firstNode->parentNode();
rootNode           63 Source/core/editing/SimplifyMarkupCommand.cpp         while (currentNode != rootNode) {
rootNode           64 Source/core/editing/SimplifyMarkupCommand.cpp             if (currentNode->parentNode() != rootNode && isRemovableBlock(currentNode))
rootNode          107 Source/core/editing/SpellChecker.cpp         for (Node* node = &frame->document()->rootNode(); node; node = NodeTraversal::next(*node)) {
rootNode          541 Source/core/editing/VisibleSelection.cpp     if (Node* lastChild = treeScope.rootNode().lastChild())
rootNode          559 Source/core/editing/VisibleSelection.cpp     if (Node* firstChild = treeScope.rootNode().firstChild())
rootNode           59 Source/core/events/EventPath.cpp     Node& rootNode = referenceNode->treeScope().rootNode();
rootNode           60 Source/core/events/EventPath.cpp     Element* shadowHostElement = rootNode.isShadowRoot() ? toShadowRoot(rootNode).host() : 0;
rootNode           73 Source/core/events/EventPath.cpp     return target->toNode() && target->toNode()->treeScope().rootNode() == shadowRoot;
rootNode          304 Source/core/events/EventPath.cpp             if (target->treeScope().rootNode() == at(i).node()) {
rootNode          181 Source/core/frame/SmartClip.cpp Node* SmartClip::findBestOverlappingNode(Node* rootNode, const IntRect& cropRect)
rootNode          183 Source/core/frame/SmartClip.cpp     if (!rootNode)
rootNode          186 Source/core/frame/SmartClip.cpp     IntRect resizedCropRect = rootNode->document().view()->windowToContents(cropRect);
rootNode          188 Source/core/frame/SmartClip.cpp     Node* node = rootNode;
rootNode          195 Source/core/frame/SmartClip.cpp             node = NodeTraversal::nextSkippingChildren(*node, rootNode);
rootNode          208 Source/core/frame/SmartClip.cpp                     node = NodeTraversal::nextSkippingChildren(*node, rootNode);
rootNode          213 Source/core/frame/SmartClip.cpp         node = NodeTraversal::next(*node, rootNode);
rootNode          311 Source/core/html/HTMLCollection.cpp     Element* element = ElementTraversal::firstChild(nodeList.rootNode());
rootNode          567 Source/core/html/HTMLFormElement.cpp         scope = &treeScope().rootNode();
rootNode           40 Source/core/html/RadioNodeList.cpp RadioNodeList::RadioNodeList(ContainerNode& rootNode, const AtomicString& name, CollectionType type)
rootNode           41 Source/core/html/RadioNodeList.cpp     : LiveNodeList(rootNode, type, InvalidateForFormControls, isHTMLFormElement(rootNode) ? NodeListIsRootedAtDocument : NodeListIsRootedAtNode)
rootNode          577 Source/core/html/parser/HTMLConstructionSite.cpp     ContainerNode* parent = m_openElements.rootNode();
rootNode          834 Source/core/html/parser/HTMLConstructionSite.cpp         if (parent && (parent->isElementNode() || (m_isParsingFragment && parent == m_openElements.rootNode()))) {
rootNode          843 Source/core/html/parser/HTMLConstructionSite.cpp     task.parent = m_openElements.rootNode(); // DocumentFragment
rootNode          175 Source/core/html/parser/HTMLConstructionSite.h     bool currentIsRootNode() { return m_openElements.topNode() == m_openElements.rootNode(); }
rootNode          160 Source/core/html/parser/HTMLElementStack.h     ContainerNode* rootNode() const;
rootNode         1563 Source/core/html/parser/HTMLTreeBuilder.cpp         if (item->node() == m_tree.openElements()->rootNode()) {
rootNode         1572 Source/core/html/parser/HTMLTreeBuilder.cpp                 while (item->node() != m_tree.openElements()->rootNode() && !item->hasTagName(templateTag)) {
rootNode         2460 Source/core/html/parser/HTMLTreeBuilder.cpp         if (m_tree.currentNode() != m_tree.openElements()->rootNode())
rootNode           63 Source/core/page/DOMSelection.cpp     : DOMWindowProperty(treeScope->rootNode().document().frame())
rootNode           80 Source/core/page/FocusController.cpp     return &m_rootTreeScope->rootNode();
rootNode           85 Source/core/page/FocusController.cpp     Node* root = rootNode();
rootNode          545 Source/core/page/FocusController.cpp     if (Node* winner = nextNodeWithGreaterTabIndex(scope.rootNode(), start ? adjustedTabIndex(start) : 0))
rootNode          550 Source/core/page/FocusController.cpp     return findNodeWithExactTabIndex(scope.rootNode(), 0, FocusTypeForward);
rootNode          556 Source/core/page/FocusController.cpp     for (Node* node = scope.rootNode(); node; node = node->lastChild())
rootNode           51 Source/core/page/FocusController.h     Node* rootNode() const;
rootNode          238 Source/core/svg/SVGElement.cpp         Element* shadowHostElement = toShadowRoot(treeScope().rootNode()).host();
rootNode          392 Source/core/testing/Internals.cpp     return &node->treeScope().rootNode();
rootNode          402 Source/core/testing/Internals.cpp     return parentTreeScope ? &parentTreeScope->rootNode() : 0;