Remove a bunch of Isolate::Current() callsites from simulators

test/cctest/test-macro-assembler-mips64.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 99 matching lines @@
     src_buffer[i] = to_non_zero(i);
   }
 
   const int fuzz = 11;
 
   for (int size = 0; size < 600; size++) {
     for (const byte* src = src_buffer; src < src_buffer + fuzz; src++) {
       for (byte* dest = dest_buffer; dest < dest_buffer + fuzz; dest++) {
         memset(dest_buffer, 0, data_size);
         CHECK(dest + size < dest_buffer + data_size);
-        (void) CALL_GENERATED_CODE(f, reinterpret_cast<int64_t>(src),
-                                      reinterpret_cast<int64_t>(dest),
-                                      size, 0, 0);
+        (void)CALL_GENERATED_CODE(isolate, f, reinterpret_cast<int64_t>(src),
+                                  reinterpret_cast<int64_t>(dest), size, 0, 0);
         // a0 and a1 should point at the first byte after the copied data.
         CHECK_EQ(src + size, a0_);
         CHECK_EQ(dest + size, a1_);
         // Check that we haven't written outside the target area.
         CHECK(all_zeroes(dest_buffer, dest));
         CHECK(all_zeroes(dest + size, dest_buffer + data_size));
         // Check the target area.
         CHECK_EQ(0, memcmp(src, dest, size));
       }
     }
@@ skipping 32 matching lines @@
 
   __ jr(ra);
   __ nop();
 
   CodeDesc desc;
   masm->GetCode(&desc);
   Handle<Code> code = isolate->factory()->NewCode(
       desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
 
   ::F f = FUNCTION_CAST< ::F>(code->entry());
-     (void) CALL_GENERATED_CODE(f, reinterpret_cast<int64_t>(result),
-                                0, 0, 0, 0);
+  (void)CALL_GENERATED_CODE(isolate, f, reinterpret_cast<int64_t>(result), 0, 0,
+                            0, 0);
   // Check results.
   for (int i = 0; i < 64; i++) {
     CHECK(refConstants[i] == result[i]);
   }
 }
 
 
 TEST(LoadAddress) {
   CcTest::InitializeVM();
   Isolate* isolate = Isolate::Current();
@@ skipping 22 matching lines @@
   __ stop("invalid");
   __ stop("invalid");
 
 
   CodeDesc desc;
   masm->GetCode(&desc);
   Handle<Code> code = isolate->factory()->NewCode(
       desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
 
   ::F f = FUNCTION_CAST< ::F>(code->entry());
-     (void) CALL_GENERATED_CODE(f, 0, 0, 0, 0, 0);
+  (void)CALL_GENERATED_CODE(isolate, f, 0, 0, 0, 0, 0);
   // Check results.
 }
 
 
 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();
@@ skipping 62 matching lines @@
 
   CodeDesc desc;
   masm->GetCode(&desc);
   Handle<Code> code = isolate->factory()->NewCode(
       desc, Code::ComputeFlags(Code::STUB), Handle<Code>());
 #ifdef OBJECT_PRINT
   code->Print(std::cout);
 #endif
   F1 f = FUNCTION_CAST<F1>(code->entry());
   for (int i = 0; i < kNumCases; ++i) {
-    int64_t res =
-        reinterpret_cast<int64_t>(CALL_GENERATED_CODE(f, i, 0, 0, 0, 0));
+    int64_t res = reinterpret_cast<int64_t>(
+        CALL_GENERATED_CODE(isolate, f, i, 0, 0, 0, 0));
     ::printf("f(%d) = %" PRId64 "\n", i, res);
     CHECK_EQ(values[i], res);
   }
 }
 
 #undef __