Index: src/mips64/deoptimizer-mips64.cc |
diff --git a/src/mips64/deoptimizer-mips64.cc b/src/mips64/deoptimizer-mips64.cc |
index 2b55695af84d00d8f9d639ca0047b42be4dbd065..d9743bfb2bcea879352c455f100af06ced34ad67 100644 |
--- a/src/mips64/deoptimizer-mips64.cc |
+++ b/src/mips64/deoptimizer-mips64.cc |
@@ -272,12 +272,12 @@ void Deoptimizer::TableEntryGenerator::Generate() { |
__ ld(a4, MemOperand(a0, Deoptimizer::output_offset())); // a4 is output_. |
__ dsll(a1, a1, kPointerSizeLog2); // Count to offset. |
__ daddu(a1, a4, a1); // a1 = one past the last FrameDescription**. |
- __ jmp(&outer_loop_header); |
+ __ BranchShort(&outer_loop_header); |
__ bind(&outer_push_loop); |
// Inner loop state: a2 = current FrameDescription*, a3 = loop index. |
__ ld(a2, MemOperand(a4, 0)); // output_[ix] |
__ ld(a3, MemOperand(a2, FrameDescription::frame_size_offset())); |
- __ jmp(&inner_loop_header); |
+ __ BranchShort(&inner_loop_header); |
__ bind(&inner_push_loop); |
__ Dsubu(a3, a3, Operand(sizeof(uint64_t))); |
__ Daddu(a6, a2, Operand(a3)); |
@@ -347,7 +347,7 @@ void Deoptimizer::TableEntryGenerator::GeneratePrologue() { |
Label start; |
__ bind(&start); |
DCHECK(is_int16(i)); |
- __ Branch(USE_DELAY_SLOT, &done); // Expose delay slot. |
+ __ BranchShort(USE_DELAY_SLOT, &done); // Expose delay slot. |
__ li(at, i); // In the delay slot. |
DCHECK_EQ(table_entry_size_, masm()->SizeOfCodeGeneratedSince(&start)); |
@@ -365,13 +365,13 @@ void Deoptimizer::TableEntryGenerator::GeneratePrologue() { |
Label start; |
__ bind(&start); |
DCHECK(is_int16(i)); |
- __ Branch(USE_DELAY_SLOT, &trampoline_jump); // Expose delay slot. |
+ __ BranchShort(USE_DELAY_SLOT, &trampoline_jump); // Expose delay slot. |
__ li(at, -i); // In the delay slot. |
DCHECK_EQ(table_entry_size_, masm()->SizeOfCodeGeneratedSince(&start)); |
} |
// Entry with id == kMaxEntriesBranchReach - 1. |
__ bind(&trampoline_jump); |
- __ Branch(USE_DELAY_SLOT, &done_special); |
+ __ BranchShort(USE_DELAY_SLOT, &done_special); |
__ li(at, -1); |
for (int i = kMaxEntriesBranchReach; i < count(); i++) { |