ASSERT -> {DCHECK|DCHECK_XX}, ENABLE(ASSERT) -> DCHECK_IS_ON() in dom

third_party/WebKit/Source/core/dom/shadow/InsertionPoint.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.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 127 matching lines @@
     if (shadowRoot->isV1())
         return false;
     return !Traversal<InsertionPoint>::firstAncestor(*this);
 }
 
 bool InsertionPoint::isActive() const
 {
     if (!canBeActive())
         return false;
     ShadowRoot* shadowRoot = containingShadowRoot();
-    ASSERT(shadowRoot);
+    DCHECK(shadowRoot);
     if (!isHTMLShadowElement(*this) || shadowRoot->descendantShadowElementCount() <= 1)
         return true;
 
     // Slow path only when there are more than one shadow elements in a shadow tree. That should be a rare case.
     const HeapVector<Member<InsertionPoint>>& insertionPoints = shadowRoot->descendantInsertionPoints();
     for (size_t i = 0; i < insertionPoints.size(); ++i) {
         InsertionPoint* point = insertionPoints[i].get();
         if (isHTMLShadowElement(*point))
             return point == this;
     }
@@ skipping 69 matching lines @@
             rootOwner->setNeedsDistributionRecalc();
     }
 
     // host can be null when removedFrom() is called from ElementShadow destructor.
     ElementShadow* rootOwner = root ? root->owner() : 0;
 
     // Since this insertion point is no longer visible from the shadow subtree, it need to clean itself up.
     clearDistribution();
 
     if (m_registeredWithShadowRoot && insertionPoint->treeScope().rootNode() == root) {
-        ASSERT(root);
+        DCHECK(root);
         m_registeredWithShadowRoot = false;
         root->didRemoveInsertionPoint(this);
         if (rootOwner) {
             if (canAffectSelector())
                 rootOwner->willAffectSelector();
         }
     }
 
     HTMLElement::removedFrom(insertionPoint);
 }
 
 DEFINE_TRACE(InsertionPoint)
 {
     visitor->trace(m_distributedNodes);
     HTMLElement::trace(visitor);
 }
 
 const InsertionPoint* resolveReprojection(const Node* projectedNode)
 {
-    ASSERT(projectedNode);
+    DCHECK(projectedNode);
     const InsertionPoint* insertionPoint = 0;
     const Node* current = projectedNode;
     ElementShadow* lastElementShadow = 0;
     while (true) {
         ElementShadow* shadow = shadowWhereNodeCanBeDistributed(*current);
         if (!shadow || shadow == lastElementShadow)
             break;
         lastElementShadow = shadow;
         const InsertionPoint* insertedTo = shadow->finalDestinationInsertionPointFor(projectedNode);
         if (!insertedTo)
             break;
-        ASSERT(current != insertedTo);
+        DCHECK_NE(current, insertedTo);
         current = insertedTo;
         insertionPoint = insertedTo;
     }
     return insertionPoint;
 }
 
 void collectDestinationInsertionPoints(const Node& node, HeapVector<Member<InsertionPoint>, 8>& results)
 {
     const Node* current = &node;
     ElementShadow* lastElementShadow = 0;
     while (true) {
         ElementShadow* shadow = shadowWhereNodeCanBeDistributed(*current);
         if (!shadow || shadow == lastElementShadow)
             return;
         lastElementShadow = shadow;
         const DestinationInsertionPoints* insertionPoints = shadow->destinationInsertionPointsFor(&node);
         if (!insertionPoints)
             return;
         for (size_t i = 0; i < insertionPoints->size(); ++i)
             results.append(insertionPoints->at(i).get());
-        ASSERT(current != insertionPoints->last().get());
+        DCHECK_NE(current, insertionPoints->last().get());
         current = insertionPoints->last().get();
     }
 }
 
 } // namespace blink