Rename ASSERT* to DCHECK*.

src/compiler/schedule.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_SCHEDULE_H_
 #define V8_COMPILER_SCHEDULE_H_
 
 #include <vector>
 
 #include "src/v8.h"
@@ skipping 50 matching lines @@
         code_start_(-1),
         code_end_(-1),
         deferred_(false),
         control_(kNone),
         control_input_(NULL),
         nodes_(NodeVector::allocator_type(zone)) {}
 
   inline bool IsLoopHeader() const { return loop_end_ >= 0; }
   inline bool LoopContains(BasicBlockData* block) const {
     // RPO numbers must be initialized.
-    ASSERT(rpo_number_ >= 0);
-    ASSERT(block->rpo_number_ >= 0);
+    DCHECK(rpo_number_ >= 0);
+    DCHECK(block->rpo_number_ >= 0);
     if (loop_end_ < 0) return false;  // This is not a loop.
     return block->rpo_number_ >= rpo_number_ && block->rpo_number_ < loop_end_;
   }
   int first_instruction_index() {
-    ASSERT(code_start_ >= 0);
-    ASSERT(code_end_ > 0);
-    ASSERT(code_end_ >= code_start_);
+    DCHECK(code_start_ >= 0);
+    DCHECK(code_end_ > 0);
+    DCHECK(code_end_ >= code_start_);
     return code_start_;
   }
   int last_instruction_index() {
-    ASSERT(code_start_ >= 0);
-    ASSERT(code_end_ > 0);
-    ASSERT(code_end_ >= code_start_);
+    DCHECK(code_start_ >= 0);
+    DCHECK(code_end_ > 0);
+    DCHECK(code_end_ >= code_start_);
     return code_end_ - 1;
   }
 };
 
 OStream& operator<<(OStream& os, const BasicBlockData::Control& c);
 
 // A basic block contains an ordered list of nodes and ends with a control
 // node. Note that if a basic block has phis, then all phis must appear as the
 // first nodes in the block.
 class BasicBlock V8_FINAL : public GenericNode<BasicBlockData, BasicBlock> {
@@ skipping 119 matching lines @@
     return block;
   }
 
   // BasicBlock building: records that a node will later be added to a block but
   // doesn't actually add the node to the block.
   inline void PlanNode(BasicBlock* block, Node* node) {
     if (FLAG_trace_turbo_scheduler) {
       PrintF("Planning node %d for future add to block %d\n", node->id(),
              block->id());
     }
-    ASSERT(this->block(node) == NULL);
+    DCHECK(this->block(node) == NULL);
     SetBlockForNode(block, node);
   }
 
   // BasicBlock building: add a node to the end of the block.
   inline void AddNode(BasicBlock* block, Node* node) {
     if (FLAG_trace_turbo_scheduler) {
       PrintF("Adding node %d to block %d\n", node->id(), block->id());
     }
-    ASSERT(this->block(node) == NULL || this->block(node) == block);
+    DCHECK(this->block(node) == NULL || this->block(node) == block);
     block->nodes_.push_back(node);
     SetBlockForNode(block, node);
   }
 
   // BasicBlock building: add a goto to the end of {block}.
   void AddGoto(BasicBlock* block, BasicBlock* succ) {
-    ASSERT(block->control_ == BasicBlock::kNone);
+    DCHECK(block->control_ == BasicBlock::kNone);
     block->control_ = BasicBlock::kGoto;
     AddSuccessor(block, succ);
   }
 
   // BasicBlock building: add a (branching) call at the end of {block}.
   void AddCall(BasicBlock* block, Node* call, BasicBlock* cont_block,
                BasicBlock* deopt_block) {
-    ASSERT(block->control_ == BasicBlock::kNone);
-    ASSERT(call->opcode() == IrOpcode::kCall);
+    DCHECK(block->control_ == BasicBlock::kNone);
+    DCHECK(call->opcode() == IrOpcode::kCall);
     block->control_ = BasicBlock::kCall;
     // Insert the deopt block first so that the RPO order builder picks
     // it first (and thus it ends up late in the RPO order).
     AddSuccessor(block, deopt_block);
     AddSuccessor(block, cont_block);
     SetControlInput(block, call);
   }
 
   // BasicBlock building: add a branch at the end of {block}.
   void AddBranch(BasicBlock* block, Node* branch, BasicBlock* tblock,
                  BasicBlock* fblock) {
-    ASSERT(block->control_ == BasicBlock::kNone);
-    ASSERT(branch->opcode() == IrOpcode::kBranch);
+    DCHECK(block->control_ == BasicBlock::kNone);
+    DCHECK(branch->opcode() == IrOpcode::kBranch);
     block->control_ = BasicBlock::kBranch;
     AddSuccessor(block, tblock);
     AddSuccessor(block, fblock);
     SetControlInput(block, branch);
   }
 
   // BasicBlock building: add a return at the end of {block}.
   void AddReturn(BasicBlock* block, Node* input) {
     // TODO(titzer): require a Return node here.
-    ASSERT(block->control_ == BasicBlock::kNone);
+    DCHECK(block->control_ == BasicBlock::kNone);
     block->control_ = BasicBlock::kReturn;
     SetControlInput(block, input);
     if (block != exit()) AddSuccessor(block, exit());
   }
 
   // BasicBlock building: add a throw at the end of {block}.
   void AddThrow(BasicBlock* block, Node* input) {
-    ASSERT(block->control_ == BasicBlock::kNone);
+    DCHECK(block->control_ == BasicBlock::kNone);
     block->control_ = BasicBlock::kThrow;
     SetControlInput(block, input);
     if (block != exit()) AddSuccessor(block, exit());
   }
 
   // BasicBlock building: add a deopt at the end of {block}.
   void AddDeoptimize(BasicBlock* block, Node* state) {
-    ASSERT(block->control_ == BasicBlock::kNone);
+    DCHECK(block->control_ == BasicBlock::kNone);
     block->control_ = BasicBlock::kDeoptimize;
     SetControlInput(block, state);
     block->deferred_ = true;  // By default, consider deopts the slow path.
     if (block != exit()) AddSuccessor(block, exit());
   }
 
   friend class Scheduler;
   friend class CodeGenerator;
 
   void AddSuccessor(BasicBlock* block, BasicBlock* succ) {
@@ skipping 26 matching lines @@
                                           // dominator, indexed by block
                                           // id.
 };
 
 OStream& operator<<(OStream& os, const Schedule& s);
 }
 }
 }  // namespace v8::internal::compiler
 
 #endif  // V8_COMPILER_SCHEDULE_H_