Rename ASSERT* to DCHECK*.

src/compiler/raw-machine-assembler.cc

 // Copyright 2014 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/compiler/pipeline.h"
 #include "src/compiler/raw-machine-assembler.h"
 #include "src/compiler/scheduler.h"
 
 namespace v8 {
 namespace internal {
@@ skipping 13 matching lines @@
   if (parameter_count() == 0) return;
   parameters_ = zone()->NewArray<Node*>(parameter_count());
   for (int i = 0; i < parameter_count(); ++i) {
     parameters_[i] = NewNode(common()->Parameter(i));
   }
 }
 
 
 Schedule* RawMachineAssembler::Export() {
   // Compute the correct codegen order.
-  ASSERT(schedule_->rpo_order()->empty());
+  DCHECK(schedule_->rpo_order()->empty());
   Scheduler scheduler(zone(), graph(), schedule_);
   scheduler.ComputeSpecialRPO();
   // Invalidate MachineAssembler.
   Schedule* schedule = schedule_;
   schedule_ = NULL;
   return schedule;
 }
 
 
 Node* RawMachineAssembler::Parameter(int index) {
-  ASSERT(0 <= index && index < parameter_count());
+  DCHECK(0 <= index && index < parameter_count());
   return parameters_[index];
 }
 
 
 RawMachineAssembler::Label* RawMachineAssembler::Exit() {
   exit_label_.used_ = true;
   return &exit_label_;
 }
 
 
 void RawMachineAssembler::Goto(Label* label) {
-  ASSERT(current_block_ != schedule()->exit());
+  DCHECK(current_block_ != schedule()->exit());
   schedule()->AddGoto(CurrentBlock(), Use(label));
   current_block_ = NULL;
 }
 
 
 void RawMachineAssembler::Branch(Node* condition, Label* true_val,
                                  Label* false_val) {
-  ASSERT(current_block_ != schedule()->exit());
+  DCHECK(current_block_ != schedule()->exit());
   Node* branch = NewNode(common()->Branch(), condition);
   schedule()->AddBranch(CurrentBlock(), branch, Use(true_val), Use(false_val));
   current_block_ = NULL;
 }
 
 
 void RawMachineAssembler::Return(Node* value) {
   schedule()->AddReturn(CurrentBlock(), value);
   current_block_ = NULL;
 }
@@ skipping 33 matching lines @@
   Node* call = graph()->NewNode(common()->Call(descriptor), centry, arg0, ref,
                                 arity, context);
   schedule()->AddCall(CurrentBlock(), call, Use(continuation),
                       Use(deoptimization));
   current_block_ = NULL;
   return call;
 }
 
 
 void RawMachineAssembler::Bind(Label* label) {
-  ASSERT(current_block_ == NULL);
-  ASSERT(!label->bound_);
+  DCHECK(current_block_ == NULL);
+  DCHECK(!label->bound_);
   label->bound_ = true;
   current_block_ = EnsureBlock(label);
 }
 
 
 BasicBlock* RawMachineAssembler::Use(Label* label) {
   label->used_ = true;
   return EnsureBlock(label);
 }
 
 
 BasicBlock* RawMachineAssembler::EnsureBlock(Label* label) {
   if (label->block_ == NULL) label->block_ = schedule()->NewBasicBlock();
   return label->block_;
 }
 
 
 BasicBlock* RawMachineAssembler::CurrentBlock() {
-  ASSERT(current_block_);
+  DCHECK(current_block_);
   return current_block_;
 }
 
 
 Node* RawMachineAssembler::MakeNode(Operator* op, int input_count,
                                     Node** inputs) {
-  ASSERT(ScheduleValid());
-  ASSERT(current_block_ != NULL);
+  DCHECK(ScheduleValid());
+  DCHECK(current_block_ != NULL);
   Node* node = graph()->NewNode(op, input_count, inputs);
   BasicBlock* block = op->opcode() == IrOpcode::kParameter ? schedule()->start()
                                                            : CurrentBlock();
   schedule()->AddNode(block, node);
   return node;
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8