Rename ASSERT* to DCHECK*.

src/compiler/generic-algorithm.h

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef V8_COMPILER_GENERIC_ALGORITHM_H_
 #define V8_COMPILER_GENERIC_ALGORITHM_H_
 
 #include <deque>
 #include <stack>
 
@@ skipping 34 matching lines @@
     typedef typename Traits::Node Node;
     typedef typename Traits::Iterator Iterator;
     typedef std::pair<Iterator, Iterator> NodeState;
     typedef zone_allocator<NodeState> ZoneNodeStateAllocator;
     typedef std::deque<NodeState, ZoneNodeStateAllocator> NodeStateDeque;
     typedef std::stack<NodeState, NodeStateDeque> NodeStateStack;
     NodeStateStack stack((NodeStateDeque(ZoneNodeStateAllocator(zone))));
     BoolVector visited(Traits::max_id(graph), false, ZoneBoolAllocator(zone));
     Node* current = *root_begin;
     while (true) {
-      ASSERT(current != NULL);
+      DCHECK(current != NULL);
       const int id = current->id();
-      ASSERT(id >= 0);
-      ASSERT(id < Traits::max_id(graph));  // Must be a valid id.
+      DCHECK(id >= 0);
+      DCHECK(id < Traits::max_id(graph));  // Must be a valid id.
       bool visit = !GetVisited(&visited, id);
       if (visit) {
         Control control = visitor->Pre(current);
         visit = !IsSkip(control);
         if (!IsReenter(control)) SetVisited(&visited, id, true);
       }
       Iterator begin(visit ? Traits::begin(current) : Traits::end(current));
       Iterator end(Traits::end(current));
       stack.push(NodeState(begin, end));
       Node* post_order_node = current;
       while (true) {
         NodeState top = stack.top();
         if (top.first == top.second) {
           if (visit) {
             Control control = visitor->Post(post_order_node);
-            ASSERT(!IsSkip(control));
+            DCHECK(!IsSkip(control));
             SetVisited(&visited, post_order_node->id(), !IsReenter(control));
           }
           stack.pop();
           if (stack.empty()) {
             if (++root_begin == root_end) return;
             current = *root_begin;
             break;
           }
           post_order_node = Traits::from(stack.top().first);
           visit = true;
@@ skipping 42 matching lines @@
   static bool GetVisited(BoolVector* visited, int id) {
     if (id >= static_cast<int>(visited->size())) return false;
     return visited->at(id);
   }
 };
 }
 }
 }  // namespace v8::internal::compiler
 
 #endif  // V8_COMPILER_GENERIC_ALGORITHM_H_