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

third_party/WebKit/Source/core/dom/LayoutTreeBuilderTraversal.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 36 matching lines @@
 void ParentDetails::didTraverseInsertionPoint(const InsertionPoint* insertionPoint)
 {
     if (!m_insertionPoint) {
         m_insertionPoint = insertionPoint;
     }
 }
 
 ContainerNode* parent(const Node& node, ParentDetails* details)
 {
     // TODO(hayato): Uncomment this once we can be sure LayoutTreeBuilderTraversal::parent() is used only for a node in a document.
-    // ASSERT(node.inShadowIncludingDocument());
+    // DCHECK(node.inShadowIncludingDocument());
     return FlatTreeTraversal::parent(node, details);
 }
 
 Node* nextSibling(const Node& node)
 {
     if (node.isBeforePseudoElement()) {
         if (Node* next = FlatTreeTraversal::firstChild(*FlatTreeTraversal::parent(node)))
             return next;
     } else {
         if (Node* next = FlatTreeTraversal::nextSibling(node))
@@ skipping 111 matching lines @@
         if (!first)
             first = currentElement.pseudoElement(PseudoIdAfter);
         return first;
     }
 
     return firstChild(node);
 }
 
 static Node* nextAncestorSibling(const Node& node, const Node* stayWithin)
 {
-    ASSERT(!pseudoAwareNextSibling(node));
-    ASSERT(node != stayWithin);
+    DCHECK(!pseudoAwareNextSibling(node));
+    DCHECK_NE(node, stayWithin);
     for (Node* parentNode = parent(node); parentNode; parentNode = parent(*parentNode)) {
         if (parentNode == stayWithin)
             return 0;
         if (Node* nextNode = pseudoAwareNextSibling(*parentNode))
             return nextNode;
     }
     return 0;
 }
 
 Node* nextSkippingChildren(const Node& node, const Node* stayWithin)
@@ skipping 31 matching lines @@
     }
     return 0;
 }
 
 LayoutObject* nextInTopLayer(const Element& element)
 {
     if (!element.isInTopLayer())
         return 0;
     const HeapVector<Member<Element>>& topLayerElements = element.document().topLayerElements();
     size_t position = topLayerElements.find(&element);
-    ASSERT(position != kNotFound);
+    DCHECK_NE(position, kNotFound);
     for (size_t i = position + 1; i < topLayerElements.size(); ++i) {
         if (LayoutObject* layoutObject = topLayerElements[i]->layoutObject())
             return layoutObject;
     }
     return 0;
 }
 
 } // namespace LayoutTreeBuilderTraversal
 
 } // namespace blink