Replace ASSERT with DCHECK in core/svg/

third_party/WebKit/Source/core/svg/SVGElement.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 2007, 2008 Nikolas Zimmermann
  * <zimmermann@kde.org>
  * Copyright (C) 2004, 2005, 2006, 2008 Rob Buis <buis@kde.org>
  * Copyright (C) 2008 Apple Inc. All rights reserved.
  * Copyright (C) 2008 Alp Toker <alp@atoker.com>
  * Copyright (C) 2009 Cameron McCormack <cam@mcc.id.au>
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
@@ skipping 53 matching lines @@
                        Document& document,
                        ConstructionType constructionType)
     : Element(tagName, &document, constructionType),
       m_SVGRareData(nullptr),
       m_className(SVGAnimatedString::create(this, HTMLNames::classAttr)) {
   addToPropertyMap(m_className);
   setHasCustomStyleCallbacks();
 }
 
 SVGElement::~SVGElement() {
-  ASSERT(isConnected() || !hasRelativeLengths());
+  DCHECK(isConnected() || !hasRelativeLengths());
 }
 
 void SVGElement::detachLayoutTree(const AttachContext& context) {
   Element::detachLayoutTree(context);
   if (SVGElement* element = correspondingElement())
     element->removeInstanceMapping(this);
 }
 
 void SVGElement::attachLayoutTree(const AttachContext& context) {
   Element::attachLayoutTree(context);
@@ skipping 302 matching lines @@
 
 void SVGElement::removedFrom(ContainerNode* rootParent) {
   bool wasInDocument = rootParent->isConnected();
 
   if (wasInDocument && hasRelativeLengths()) {
     // The root of the subtree being removed should take itself out from its
     // parent's relative length set. For the other nodes in the subtree we don't
     // need to do anything: they will get their own removedFrom() notification
     // and just clear their sets.
     if (rootParent->isSVGElement() && !parentNode()) {
-      ASSERT(toSVGElement(rootParent)
+      DCHECK(toSVGElement(rootParent)
                  ->m_elementsWithRelativeLengths.contains(this));
       toSVGElement(rootParent)->updateRelativeLengthsInformation(false, this);
     }
 
     m_elementsWithRelativeLengths.clear();
   }
 
   SECURITY_DCHECK(
       !rootParent->isSVGElement() ||
       !toSVGElement(rootParent)->m_elementsWithRelativeLengths.contains(this));
@@ skipping 81 matching lines @@
         &text_renderingAttr,
         &transform_originAttr,
         &unicode_bidiAttr,
         &vector_effectAttr,
         &visibilityAttr,
         &word_spacingAttr,
         &writing_modeAttr,
     };
     for (size_t i = 0; i < WTF_ARRAY_LENGTH(attrNames); i++) {
       CSSPropertyID propertyId = cssPropertyID(attrNames[i]->localName());
-      ASSERT(propertyId > 0);
+      DCHECK_GT(propertyId, 0);
       propertyNameToIdMap->set(attrNames[i]->localName().impl(), propertyId);
     }
   }
 
   return propertyNameToIdMap->at(attrName.localName().impl());
 }
 
 void SVGElement::updateRelativeLengthsInformation(bool clientHasRelativeLengths,
                                                   SVGElement* clientElement) {
-  ASSERT(clientElement);
+  DCHECK(clientElement);
 
   // If we're not yet in a document, this function will be called again from
   // insertedInto(). Do nothing now.
   if (!isConnected())
     return;
 
   // An element wants to notify us that its own relative lengths state changed.
   // Register it in the relative length map, and register us in the parent
   // relative length map.  Register the parent in the grandparents map, etc.
   // Repeat procedure until the root of the SVG tree.
   for (Node& currentNode : NodeTraversal::inclusiveAncestorsOf(*this)) {
     if (!currentNode.isSVGElement())
       break;
     SVGElement& currentElement = toSVGElement(currentNode);
-    ASSERT(!currentElement.m_inRelativeLengthClientsInvalidation);
+#if DCHECK_IS_ON()
+    DCHECK(!currentElement.m_inRelativeLengthClientsInvalidation);
+#endif
 
     bool hadRelativeLengths = currentElement.hasRelativeLengths();
     if (clientHasRelativeLengths)
       currentElement.m_elementsWithRelativeLengths.insert(clientElement);
     else
       currentElement.m_elementsWithRelativeLengths.erase(clientElement);
 
     // If the relative length state hasn't changed, we can stop propagating the
     // notification.
     if (hadRelativeLengths == currentElement.hasRelativeLengths())
@@ skipping 13 matching lines @@
       svgExtensions.removeSVGRootWithRelativeLengthDescendents(
           toSVGSVGElement(clientElement));
   }
 }
 
 void SVGElement::invalidateRelativeLengthClients(
     SubtreeLayoutScope* layoutScope) {
   if (!isConnected())
     return;
 
-  ASSERT(!m_inRelativeLengthClientsInvalidation);
 #if DCHECK_IS_ON()
+  DCHECK(!m_inRelativeLengthClientsInvalidation);
   AutoReset<bool> inRelativeLengthClientsInvalidationChange(
       &m_inRelativeLengthClientsInvalidation, true);
 #endif
 
   if (LayoutObject* layoutObject = this->layoutObject()) {
     if (hasRelativeLengths() && layoutObject->isSVGResourceContainer())
       toLayoutSVGResourceContainer(layoutObject)
           ->invalidateCacheAndMarkForLayout(layoutScope);
     else if (selfHasRelativeLengths())
       layoutObject->setNeedsLayoutAndFullPaintInvalidation(
@@ skipping 27 matching lines @@
     if (isSVGSVGElement(*n) || isSVGImageElement(*n) || isSVGSymbolElement(*n))
       return toSVGElement(n);
 
     n = n->parentOrShadowHostNode();
   }
 
   return nullptr;
 }
 
 void SVGElement::mapInstanceToElement(SVGElement* instance) {
-  ASSERT(instance);
-  ASSERT(instance->inUseShadowTree());
+  DCHECK(instance);
+  DCHECK(instance->inUseShadowTree());
 
   HeapHashSet<WeakMember<SVGElement>>& instances =
       ensureSVGRareData()->elementInstances();
-  ASSERT(!instances.contains(instance));
+  DCHECK(!instances.contains(instance));
 
   instances.insert(instance);
 }
 
 void SVGElement::removeInstanceMapping(SVGElement* instance) {
-  ASSERT(instance);
-  ASSERT(instance->inUseShadowTree());
+  DCHECK(instance);
+  DCHECK(instance->inUseShadowTree());
 
   if (!hasSVGRareData())
     return;
 
   HeapHashSet<WeakMember<SVGElement>>& instances =
       svgRareData()->elementInstances();
 
   instances.erase(instance);
 }
 
 static HeapHashSet<WeakMember<SVGElement>>& emptyInstances() {
   DEFINE_STATIC_LOCAL(HeapHashSet<WeakMember<SVGElement>>, emptyInstances,
                       (new HeapHashSet<WeakMember<SVGElement>>));
   return emptyInstances;
 }
 
 const HeapHashSet<WeakMember<SVGElement>>& SVGElement::instancesForElement()
     const {
   if (!hasSVGRareData())
     return emptyInstances();
   return svgRareData()->elementInstances();
 }
 
 SVGElement* SVGElement::correspondingElement() const {
-  ASSERT(!hasSVGRareData() || !svgRareData()->correspondingElement() ||
+  DCHECK(!hasSVGRareData() || !svgRareData()->correspondingElement() ||
          containingShadowRoot());
   return hasSVGRareData() ? svgRareData()->correspondingElement() : 0;
 }
 
 SVGUseElement* SVGElement::correspondingUseElement() const {
   if (ShadowRoot* root = containingShadowRoot()) {
     if (isSVGUseElement(root->host()) &&
         (root->type() == ShadowRootType::UserAgent))
       return &toSVGUseElement(root->host());
   }
@@ skipping 160 matching lines @@
        child = Traversal<SVGElement>::nextSibling(*child)) {
     if (!child->haveLoadedRequiredResources())
       return false;
   }
   return true;
 }
 
 static inline void collectInstancesForSVGElement(
     SVGElement* element,
     HeapHashSet<WeakMember<SVGElement>>& instances) {
-  ASSERT(element);
+  DCHECK(element);
   if (element->containingShadowRoot())
     return;
 
-  ASSERT(!element->instanceUpdatesBlocked());
+  DCHECK(!element->instanceUpdatesBlocked());
 
   instances = element->instancesForElement();
 }
 
 void SVGElement::addedEventListener(
     const AtomicString& eventType,
     RegisteredEventListener& registeredListener) {
   // Add event listener to regular DOM element
   Node::addedEventListener(eventType, registeredListener);
 
@@ skipping 13 matching lines @@
     const AtomicString& eventType,
     const RegisteredEventListener& registeredListener) {
   Node::removedEventListener(eventType, registeredListener);
 
   // Remove event listener from all shadow tree DOM element instances
   HeapHashSet<WeakMember<SVGElement>> instances;
   collectInstancesForSVGElement(this, instances);
   EventListenerOptions options = registeredListener.options();
   const EventListener* listener = registeredListener.listener();
   for (SVGElement* shadowTreeElement : instances) {
-    ASSERT(shadowTreeElement);
+    DCHECK(shadowTreeElement);
 
     shadowTreeElement->Node::removeEventListenerInternal(eventType, listener,
                                                          options);
   }
 }
 
 static bool hasLoadListener(Element* element) {
   if (element->hasEventListeners(EventTypeNames::load))
     return true;
 
@@ skipping 193 matching lines @@
 
 bool SVGElement::hasFocusEventListeners() const {
   return hasEventListeners(EventTypeNames::focusin) ||
          hasEventListeners(EventTypeNames::focusout) ||
          hasEventListeners(EventTypeNames::focus) ||
          hasEventListeners(EventTypeNames::blur);
 }
 
 void SVGElement::markForLayoutAndParentResourceInvalidation(
     LayoutObject* layoutObject) {
-  ASSERT(layoutObject);
+  DCHECK(layoutObject);
   LayoutSVGResourceContainer::markForLayoutAndParentResourceInvalidation(
       layoutObject, true);
 }
 
 void SVGElement::invalidateInstances() {
   if (instanceUpdatesBlocked())
     return;
 
   const HeapHashSet<WeakMember<SVGElement>>& set = instancesForElement();
   if (set.isEmpty())
@@ skipping 148 matching lines @@
   return &ensureSVGRareData()->ensureElementProxySet();
 }
 
 SVGElementSet* SVGElement::setOfIncomingReferences() const {
   if (!hasSVGRareData())
     return nullptr;
   return &svgRareData()->incomingReferences();
 }
 
 void SVGElement::addReferenceTo(SVGElement* targetElement) {
-  ASSERT(targetElement);
+  DCHECK(targetElement);
 
   ensureSVGRareData()->outgoingReferences().insert(targetElement);
   targetElement->ensureSVGRareData()->incomingReferences().insert(this);
 }
 
 void SVGElement::rebuildAllIncomingReferences() {
   if (!hasSVGRareData())
     return;
 
   const SVGElementSet& incomingReferences = svgRareData()->incomingReferences();
@@ skipping 10 matching lines @@
       sourceElement->svgAttributeChanged(SVGNames::hrefAttr);
   }
 }
 
 void SVGElement::removeAllIncomingReferences() {
   if (!hasSVGRareData())
     return;
 
   SVGElementSet& incomingReferences = svgRareData()->incomingReferences();
   for (SVGElement* sourceElement : incomingReferences) {
-    ASSERT(sourceElement->hasSVGRareData());
+    DCHECK(sourceElement->hasSVGRareData());
     sourceElement->ensureSVGRareData()->outgoingReferences().erase(this);
   }
   incomingReferences.clear();
 }
 
 void SVGElement::removeAllOutgoingReferences() {
   if (!hasSVGRareData())
     return;
 
   SVGElementSet& outgoingReferences = svgRareData()->outgoingReferences();
   for (SVGElement* targetElement : outgoingReferences) {
-    ASSERT(targetElement->hasSVGRareData());
+    DCHECK(targetElement->hasSVGRareData());
     targetElement->ensureSVGRareData()->incomingReferences().erase(this);
   }
   outgoingReferences.clear();
 }
 
 DEFINE_TRACE(SVGElement) {
   visitor->trace(m_elementsWithRelativeLengths);
   visitor->trace(m_attributeToPropertyMap);
   visitor->trace(m_SVGRareData);
   visitor->trace(m_className);
   Element::trace(visitor);
 }
 
 const AtomicString& SVGElement::eventParameterName() {
   DEFINE_STATIC_LOCAL(const AtomicString, evtString, ("evt"));
   return evtString;
 }
 
 }  // namespace blink