Remove the dependency of Zone on Isolate

src/hydrogen-escape-analysis.cc

 // Copyright 2013 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/hydrogen-escape-analysis.h"
 
 namespace v8 {
 namespace internal {
 
 
@@ skipping 113 matching lines @@
 }
 
 
 // Insert a newly created value check as a replacement for map checks.
 HValue* HEscapeAnalysisPhase::NewMapCheckAndInsert(HCapturedObject* state,
                                                    HCheckMaps* mapcheck) {
   Zone* zone = graph()->zone();
   HValue* value = state->map_value();
   // TODO(mstarzinger): This will narrow a map check against a set of maps
   // down to the first element in the set. Revisit and fix this.
-  HCheckValue* check = HCheckValue::New(
-      zone, NULL, value, mapcheck->maps()->at(0), false);
+  HCheckValue* check = HCheckValue::New(graph()->isolate(), zone, NULL, value,
+                                        mapcheck->maps()->at(0), false);
   check->InsertBefore(mapcheck);
   return check;
 }
 
 
 // Replace a field load with a given value, forcing Smi representation if
 // necessary.
 HValue* HEscapeAnalysisPhase::NewLoadReplacement(
     HLoadNamedField* load, HValue* load_value) {
   HValue* replacement = load_value;
   Representation representation = load->representation();
   if (representation.IsSmiOrInteger32() || representation.IsDouble()) {
     Zone* zone = graph()->zone();
-    HInstruction* new_instr =
-        HForceRepresentation::New(zone, NULL, load_value, representation);
+    HInstruction* new_instr = HForceRepresentation::New(
+        graph()->isolate(), zone, NULL, load_value, representation);
     new_instr->InsertAfter(load);
     replacement = new_instr;
   }
   return replacement;
 }
 
 
 // Performs a forward data-flow analysis of all loads and stores on the
 // given captured allocation. This uses a reverse post-order iteration
 // over affected basic blocks. All non-escaping instructions are handled
@@ skipping 158 matching lines @@
   for (int i = 0; i < max_fixpoint_iteration_count; i++) {
     CollectCapturedValues();
     if (captured_.is_empty()) break;
     PerformScalarReplacement();
     captured_.Rewind(0);
   }
 }
 
 
 } }  // namespace v8::internal