Make fast_exp take an Isolate* paramter

src/runtime/runtime-maths.cc

 // Copyright 2014 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/runtime/runtime-utils.h"
 
 #include "src/arguments.h"
 #include "src/assembler.h"
 #include "src/base/utils/random-number-generator.h"
 #include "src/codegen.h"
@@ skipping 88 matching lines @@
   return *isolate->factory()->NewNumber(result);
 }
 
 
 RUNTIME_FUNCTION(Runtime_MathExpRT) {
   HandleScope scope(isolate);
   DCHECK(args.length() == 1);
   isolate->counters()->math_exp()->Increment();
 
   CONVERT_DOUBLE_ARG_CHECKED(x, 0);
-  lazily_initialize_fast_exp();
-  return *isolate->factory()->NewNumber(fast_exp(x));
+  lazily_initialize_fast_exp(isolate);
+  return *isolate->factory()->NewNumber(fast_exp(x, isolate));
 }
 
 
 RUNTIME_FUNCTION(Runtime_MathClz32) {
   HandleScope scope(isolate);
   DCHECK(args.length() == 1);
   isolate->counters()->math_clz32()->Increment();
 
   CONVERT_NUMBER_CHECKED(uint32_t, x, Uint32, args[0]);
   return *isolate->factory()->NewNumberFromUint(
@@ skipping 134 matching lines @@
   uint16_t seeds[kSize];
   do {
     isolate->random_number_generator()->NextBytes(seeds,
                                                   kSize * sizeof(*seeds));
   } while (!(seeds[0] && seeds[1] && seeds[2] && seeds[3]));
   for (int i = 0; i < kSize; i++) array->set(i, Smi::FromInt(seeds[i]));
   return *isolate->factory()->NewJSArrayWithElements(array);
 }
 }  // namespace internal
 }  // namespace v8