Make whether or not a Code object should be created by masm explicit

test/cctest/test-macro-assembler-mips.cc

 // Copyright 2013 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 67 matching lines @@
   CHECK(act_size >= static_cast<size_t>(data_size));
   byte* dest_buffer =
       static_cast<byte*>(v8::base::OS::Allocate(data_size, &act_size, 0));
   CHECK(dest_buffer);
   CHECK(act_size >= static_cast<size_t>(data_size));
 
   // Storage for a0 and a1.
   byte* a0_;
   byte* a1_;
 
-  MacroAssembler assembler(isolate, NULL, 0);
+  MacroAssembler assembler(isolate, NULL, 0, true);
   MacroAssembler* masm = &assembler;
 
   // Code to be generated: The stuff in CopyBytes followed by a store of a0 and
   // a1, respectively.
   __ CopyBytes(a0, a1, a2, a3);
   __ li(a2, Operand(reinterpret_cast<int>(&a0_)));
   __ li(a3, Operand(reinterpret_cast<int>(&a1_)));
   __ sw(a0, MemOperand(a2));
   __ jr(ra);
   __ sw(a1, MemOperand(a3));
@@ skipping 81 matching lines @@
 
 
 TEST(jump_tables4) {
   // Similar to test-assembler-mips jump_tables1, with extra test for branch
   // trampoline required before emission of the dd table (where trampolines are
   // blocked), and proper transition to long-branch mode.
   // Regression test for v8:4294.
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
   HandleScope scope(isolate);
-  MacroAssembler assembler(isolate, NULL, 0);
+  MacroAssembler assembler(isolate, NULL, 0, true);
   MacroAssembler* masm = &assembler;
 
   const int kNumCases = 512;
   int values[kNumCases];
   isolate->random_number_generator()->NextBytes(values, sizeof(values));
   Label labels[kNumCases];
   Label near_start, end;
 
   __ addiu(sp, sp, -4);
   __ sw(ra, MemOperand(sp));
@@ skipping 55 matching lines @@
   for (int i = 0; i < kNumCases; ++i) {
     int res =
         reinterpret_cast<int>(CALL_GENERATED_CODE(isolate, f, i, 0, 0, 0, 0));
     ::printf("f(%d) = %d\n", i, res);
     CHECK_EQ(values[i], res);
   }
 }
 
 
 #undef __