Index: src/mips/deoptimizer-mips.cc |
diff --git a/src/mips/deoptimizer-mips.cc b/src/mips/deoptimizer-mips.cc |
index d6ebfac363bab2f4435cf14e0341d72bec79de1b..1e88e62b213fdde4af6cabe0d4e9ca8429809cc1 100644 |
--- a/src/mips/deoptimizer-mips.cc |
+++ b/src/mips/deoptimizer-mips.cc |
@@ -60,13 +60,13 @@ void Deoptimizer::PatchCodeForDeoptimization(Isolate* isolate, Code* code) { |
int call_size_in_bytes = MacroAssembler::CallSize(deopt_entry, |
RelocInfo::NONE32); |
int call_size_in_words = call_size_in_bytes / Assembler::kInstrSize; |
- ASSERT(call_size_in_bytes % Assembler::kInstrSize == 0); |
- ASSERT(call_size_in_bytes <= patch_size()); |
+ DCHECK(call_size_in_bytes % Assembler::kInstrSize == 0); |
+ DCHECK(call_size_in_bytes <= patch_size()); |
CodePatcher patcher(call_address, call_size_in_words); |
patcher.masm()->Call(deopt_entry, RelocInfo::NONE32); |
- ASSERT(prev_call_address == NULL || |
+ DCHECK(prev_call_address == NULL || |
call_address >= prev_call_address + patch_size()); |
- ASSERT(call_address + patch_size() <= code->instruction_end()); |
+ DCHECK(call_address + patch_size() <= code->instruction_end()); |
#ifdef DEBUG |
prev_call_address = call_address; |
@@ -195,7 +195,7 @@ void Deoptimizer::EntryGenerator::Generate() { |
__ lw(a1, MemOperand(v0, Deoptimizer::input_offset())); |
// Copy core registers into FrameDescription::registers_[kNumRegisters]. |
- ASSERT(Register::kNumRegisters == kNumberOfRegisters); |
+ DCHECK(Register::kNumRegisters == kNumberOfRegisters); |
for (int i = 0; i < kNumberOfRegisters; i++) { |
int offset = (i * kPointerSize) + FrameDescription::registers_offset(); |
if ((saved_regs & (1 << i)) != 0) { |
@@ -297,7 +297,7 @@ void Deoptimizer::EntryGenerator::Generate() { |
// Technically restoring 'at' should work unless zero_reg is also restored |
// but it's safer to check for this. |
- ASSERT(!(at.bit() & restored_regs)); |
+ DCHECK(!(at.bit() & restored_regs)); |
// Restore the registers from the last output frame. |
__ mov(at, a2); |
for (int i = kNumberOfRegisters - 1; i >= 0; i--) { |
@@ -329,14 +329,14 @@ void Deoptimizer::TableEntryGenerator::GeneratePrologue() { |
for (int i = 0; i < count(); i++) { |
Label start; |
__ bind(&start); |
- ASSERT(is_int16(i)); |
+ DCHECK(is_int16(i)); |
__ Branch(USE_DELAY_SLOT, &done); // Expose delay slot. |
__ li(at, i); // In the delay slot. |
- ASSERT_EQ(table_entry_size_, masm()->SizeOfCodeGeneratedSince(&start)); |
+ DCHECK_EQ(table_entry_size_, masm()->SizeOfCodeGeneratedSince(&start)); |
} |
- ASSERT_EQ(masm()->SizeOfCodeGeneratedSince(&table_start), |
+ DCHECK_EQ(masm()->SizeOfCodeGeneratedSince(&table_start), |
count() * table_entry_size_); |
__ bind(&done); |
__ Push(at); |