Remove UserAgent ShadowRoot + Author ShadowRoot code.

third_party/WebKit/Source/core/dom/shadow/ElementShadow.cpp

 /*
  * Copyright (C) 2012 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Neither the name of Google Inc. nor the names of its
@@ skipping 131 matching lines @@
 
 ElementShadow::~ElementShadow()
 {
 }
 
 ShadowRoot& ElementShadow::addShadowRoot(Element& shadowHost, ShadowRootType type)
 {
     EventDispatchForbiddenScope assertNoEventDispatch;
     ScriptForbiddenScope forbidScript;
 
-    if (type == ShadowRootType::V0) {
-        if (m_shadowRoots.isEmpty()) {
-            shadowHost.willAddFirstAuthorShadowRoot();
-        } else if (m_shadowRoots.head()->type() == ShadowRootType::UserAgent) {
-            shadowHost.willAddFirstAuthorShadowRoot();
-            Deprecation::countDeprecation(shadowHost.document(), UseCounter::ElementCreateShadowRootMultipleWithUserAgentShadowRoot);
-        } else {
-            Deprecation::countDeprecation(shadowHost.document(), UseCounter::ElementCreateShadowRootMultiple);
-        }
-    } else if (type == ShadowRootType::Open || type == ShadowRootType::Closed) {
-        shadowHost.willAddFirstAuthorShadowRoot();
+    if (type == ShadowRootType::V0 && !m_shadowRoots.isEmpty()) {
+        DCHECK_NE(ShadowRootType::UserAgent, m_shadowRoots.head()->type());
+        Deprecation::countDeprecation(shadowHost.document(), UseCounter::ElementCreateShadowRootMultiple);
     }
 
     for (ShadowRoot* root = m_shadowRoots.head(); root; root = root->olderShadowRoot())
         root->lazyReattachIfAttached();
 
     ShadowRoot* shadowRoot = ShadowRoot::create(shadowHost.document(), type);
     shadowRoot->setParentOrShadowHostNode(&shadowHost);
     shadowRoot->setParentTreeScope(shadowHost.treeScope());
     m_shadowRoots.push(shadowRoot);
     setNeedsDistributionRecalc();
@@ skipping 189 matching lines @@
 {
     visitor->trace(m_nodeToInsertionPoints);
     visitor->trace(m_selectFeatures);
     // Shadow roots are linked with previous and next pointers which are traced.
     // It is therefore enough to trace one of the shadow roots here and the
     // rest will be traced from there.
     visitor->trace(m_shadowRoots.head());
 }
 
 } // namespace blink