Rename ASSERT* to DCHECK*.

src/hydrogen-bch.cc

 // 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.
 
 #include "src/hydrogen-bch.h"
 
 namespace v8 {
 namespace internal {
 
 /*
@@ skipping 26 matching lines @@
     void set_has_check() { has_check_ = true; }
     InductionVariableLimitUpdate* additional_limit() {
       return &additional_limit_;
     }
 
     /*
      * Initializes the table element for a given loop (identified by its
      * induction variable).
      */
     void InitializeLoop(InductionVariableData* data) {
-      ASSERT(data->limit() != NULL);
+      DCHECK(data->limit() != NULL);
       HLoopInformation* loop = data->phi()->block()->current_loop();
       is_start_ = (block() == loop->loop_header());
       is_proper_exit_ = (block() == data->induction_exit_target());
       is_in_loop_ = loop->IsNestedInThisLoop(block()->current_loop());
       has_check_ = false;
     }
 
     // Utility methods to iterate over dominated blocks.
     void ResetCurrentDominatedBlock() { current_dominated_block_ = kNoBlock; }
     HBasicBlock* CurrentDominatedBlock() {
-      ASSERT(current_dominated_block_ != kNoBlock);
+      DCHECK(current_dominated_block_ != kNoBlock);
       return current_dominated_block_ < block()->dominated_blocks()->length() ?
           block()->dominated_blocks()->at(current_dominated_block_) : NULL;
     }
     HBasicBlock* NextDominatedBlock() {
       current_dominated_block_++;
       return CurrentDominatedBlock();
     }
 
     Element()
         : block_(NULL), is_start_(false), is_proper_exit_(false),
@@ skipping 105 matching lines @@
     return unsafe ? OPTIMISTICALLY_HOISTABLE : HOISTABLE;
   }
 
   explicit InductionVariableBlocksTable(HGraph* graph)
     : graph_(graph), loop_header_(NULL),
       elements_(graph->blocks()->length(), graph->zone()) {
     for (int i = 0; i < graph->blocks()->length(); i++) {
       Element element;
       element.set_block(graph->blocks()->at(i));
       elements_.Add(element, graph->zone());
-      ASSERT(at(i)->block()->block_id() == i);
+      DCHECK(at(i)->block()->block_id() == i);
     }
   }
 
   // Tries to hoist a check out of its induction loop.
   void ProcessRelatedChecks(
       InductionVariableData::InductionVariableCheck* check,
       InductionVariableData* data) {
     HValue* length = check->check()->length();
     check->set_processed();
     HBasicBlock* header =
@@ skipping 175 matching lines @@
 
 void HBoundsCheckHoistingPhase::HoistRedundantBoundsChecks() {
   InductionVariableBlocksTable table(graph());
   table.CollectInductionVariableData(graph()->entry_block());
   for (int i = 0; i < graph()->blocks()->length(); i++) {
     table.EliminateRedundantBoundsChecks(graph()->blocks()->at(i));
   }
 }
 
 } }  // namespace v8::internal