Rename {Author,UserAgent}ShadowRoot to {Open,Closed}ShadowRoot.

Source/core/dom/SelectorQuery.cpp

 /*
  * Copyright (C) 2011, 2013 Apple Inc. All rights reserved.
  * Copyright (C) 2014 Samsung Electronics. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1.  Redistributions of source code must retain the above copyright
  *     notice, this list of conditions and the following disclaimer.
@@ skipping 335 matching lines @@
 // FIXME: Move the following helper functions, authorShadowRootOf, firstWithinTraversingShadowTree,
 // nextTraversingShadowTree to the best place, e.g. NodeTraversal.
 static ShadowRoot* authorShadowRootOf(const ContainerNode& node)
 {
     if (!node.isElementNode() || !isShadowHost(&node))
         return 0;
 
     ElementShadow* shadow = toElement(node).shadow();
     ASSERT(shadow);
     for (ShadowRoot* shadowRoot = shadow->oldestShadowRoot(); shadowRoot; shadowRoot = shadowRoot->youngerShadowRoot()) {
-        if (shadowRoot->type() == ShadowRoot::AuthorShadowRoot)
+        if (shadowRoot->type() == ShadowRoot::OpenShadowRoot)
             return shadowRoot;
     }
     return 0;
 }
 
 static ContainerNode* firstWithinTraversingShadowTree(const ContainerNode& rootNode)
 {
     if (ShadowRoot* shadowRoot = authorShadowRootOf(rootNode))
         return shadowRoot;
     return ElementTraversal::firstWithin(rootNode);
@@ skipping 10 matching lines @@
             return next;
 
         if (!current->isInShadowTree())
             return 0;
 
         ShadowRoot* shadowRoot = current->containingShadowRoot();
         if (shadowRoot == rootNode)
             return 0;
         if (ShadowRoot* youngerShadowRoot = shadowRoot->youngerShadowRoot()) {
             // Should not obtain any elements in user-agent shadow root.
-            ASSERT(youngerShadowRoot->type() == ShadowRoot::AuthorShadowRoot);
+            ASSERT(youngerShadowRoot->type() == ShadowRoot::OpenShadowRoot);
             return youngerShadowRoot;
         }
 
         current = shadowRoot->host();
     }
     return 0;
 }
 
 template <typename SelectorQueryTrait>
 void SelectorDataList::executeSlowTraversingShadowTree(ContainerNode& rootNode, typename SelectorQueryTrait::OutputType& output) const
@@ skipping 137 matching lines @@
 
     return m_entries.add(selectors, SelectorQuery::adopt(selectorList)).storedValue->value.get();
 }
 
 void SelectorQueryCache::invalidate()
 {
     m_entries.clear();
 }
 
 }