Rename Node::shadowHost() to Node::ownerShadowHost()

third_party/WebKit/Source/core/dom/Node.cpp

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
  * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies)
  * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
@@ skipping 572 matching lines @@
         return shadow->oldestShadowRoot();
     return nullptr;
 }
 #endif
 
 Node& Node::shadowIncludingRoot() const
 {
     if (isConnected())
         return document();
     Node* root = const_cast<Node*>(this);
-    while (Node* host = root->shadowHost())
+    while (Node* host = root->ownerShadowHost())
         root = host;
     while (Node* ancestor = root->parentNode())
         root = ancestor;
-    DCHECK(!root->shadowHost());
+    DCHECK(!root->ownerShadowHost());
     return *root;
 }
 
 bool Node::isClosedShadowHiddenFrom(const Node& other) const
 {
     if (!isInShadowTree() || treeScope() == other.treeScope())
         return false;
 
     const TreeScope* scope = &treeScope();
     for (; scope->parentTreeScope(); scope = scope->parentTreeScope()) {
@@ skipping 204 matching lines @@
         return false;
 
     if (isConnected() != node->isConnected())
         return false;
 
     bool hasChildren = isContainerNode() && toContainerNode(this)->hasChildren();
     bool hasShadow = isElementNode() && toElement(this)->shadow();
     if (!hasChildren && !hasShadow)
         return false;
 
-    for (; node; node = node->shadowHost()) {
+    for (; node; node = node->ownerShadowHost()) {
         if (treeScope() == node->treeScope())
             return contains(node);
     }
 
     return false;
 }
 
 bool Node::containsIncludingHostElements(const Node& node) const
 {
     const Node* current = &node;
@@ skipping 193 matching lines @@
     return parentShadow && !parentShadow->isV1();
 }
 
 ShadowRoot* Node::v1ShadowRootOfParent() const
 {
     if (Element* parent = parentElement())
         return parent->shadowRootIfV1();
     return nullptr;
 }
 
-Element* Node::shadowHost() const
+Element* Node::ownerShadowHost() const
 {
     if (ShadowRoot* root = containingShadowRoot())
         return &root->host();
     return nullptr;
 }
 
 ShadowRoot* Node::containingShadowRoot() const
 {
     Node& root = treeScope().rootNode();
     return root.isShadowRoot() ? toShadowRoot(&root) : nullptr;
@@ skipping 1364 matching lines @@
     if (node) {
         std::stringstream stream;
         node->printNodePathTo(stream);
         LOG(INFO) << stream.str();
     } else {
         LOG(INFO) << "Cannot showNodePath for <null>";
     }
 }
 
 #endif