MIPS: Fix BlockTrampolinePoolFor() to emit trampoline before blocking, if needed.

test/cctest/test-assembler-mips.cc

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 2969 matching lines @@
   const int kNumCases = 512;
   int values[kNumCases];
   isolate->random_number_generator()->NextBytes(values, sizeof(values));
   Label labels[kNumCases];
 
   __ addiu(sp, sp, -4);
   __ sw(ra, MemOperand(sp));
 
   Label done;
   {
+    __ BlockTrampolinePoolFor(kNumCases + 7);
     PredictableCodeSizeScope predictable(
         &assm, (kNumCases + 7) * Assembler::kInstrSize);
     Label here;
 
     __ bal(&here);
     __ nop();
     __ bind(&here);
     __ sll(at, a0, 2);
     __ addu(at, at, ra);
     __ lw(at, MemOperand(at, 5 * Assembler::kInstrSize));
@@ skipping 56 matching lines @@
   for (int i = 0; i < kNumCases; ++i) {
     __ bind(&labels[i]);
     __ lui(v0, (values[i] >> 16) & 0xffff);
     __ ori(v0, v0, values[i] & 0xffff);
     __ b(&done);
     __ nop();
   }
 
   __ bind(&dispatch);
   {
+    __ BlockTrampolinePoolFor(kNumCases + 7);
     PredictableCodeSizeScope predictable(
         &assm, (kNumCases + 7) * Assembler::kInstrSize);
     Label here;
 
     __ bal(&here);
     __ nop();
     __ bind(&here);
     __ sll(at, a0, 2);
     __ addu(at, at, ra);
     __ lw(at, MemOperand(at, 5 * Assembler::kInstrSize));
@@ skipping 55 matching lines @@
     obj = *values[i];
     imm32 = reinterpret_cast<intptr_t>(obj);
     __ lui(v0, (imm32 >> 16) & 0xffff);
     __ ori(v0, v0, imm32 & 0xffff);
     __ b(&done);
     __ nop();
   }
 
   __ bind(&dispatch);
   {
+    __ BlockTrampolinePoolFor(kNumCases + 7);
     PredictableCodeSizeScope predictable(
         &assm, (kNumCases + 7) * Assembler::kInstrSize);
     Label here;
 
     __ bal(&here);
     __ nop();
     __ bind(&here);
     __ sll(at, a0, 2);
     __ addu(at, at, ra);
     __ lw(at, MemOperand(at, 5 * Assembler::kInstrSize));
@@ skipping 1899 matching lines @@
     size_t nr_test_cases = sizeof(tc) / sizeof(TestCaseBalc);
     for (size_t i = 0; i < nr_test_cases; ++i) {
       int32_t res = run_balc(tc[i].offset);
       CHECK_EQ(tc[i].expected_res, res);
     }
   }
 }
 
 
 #undef __