Remove the dependency of Zone on Isolate

test/cctest/compiler/test-loop-analysis.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/v8.h"
 
 #include "src/compiler/access-builder.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/graph-visualizer.h"
@@ skipping 21 matching lines @@
 
 static const int kNumLeafs = 4;
 
 // A helper for all tests dealing with LoopFinder.
 class LoopFinderTester : HandleAndZoneScope {
  public:
   LoopFinderTester()
       : isolate(main_isolate()),
         common(main_zone()),
         graph(main_zone()),
-        jsgraph(&graph, &common, NULL, NULL),
+        jsgraph(main_isolate(), &graph, &common, NULL, NULL),
         start(graph.NewNode(common.Start(1))),
         end(graph.NewNode(common.End(), start)),
         p0(graph.NewNode(common.Parameter(0), start)),
         zero(jsgraph.Int32Constant(0)),
         one(jsgraph.OneConstant()),
         half(jsgraph.Constant(0.5)),
         self(graph.NewNode(common.Int32Constant(0xaabbccdd))),
         dead(graph.NewNode(common.Dead())),
         loop_tree(NULL) {
     graph.SetEnd(end);
@@ skipping 67 matching lines @@
     end->ReplaceInput(0, ret);
     return ret;
   }
 
   LoopTree* GetLoopTree() {
     if (loop_tree == NULL) {
       if (FLAG_trace_turbo_graph) {
         OFStream os(stdout);
         os << AsRPO(graph);
       }
-      Zone zone(isolate);
+      Zone zone;
       loop_tree = LoopFinder::BuildLoopTree(&graph, &zone);
     }
     return loop_tree;
   }
 
   void CheckLoop(Node** header, int header_count, Node** body, int body_count) {
     LoopTree* tree = GetLoopTree();
     LoopTree::Loop* loop = tree->ContainingLoop(header[0]);
     CHECK_NE(NULL, loop);
 
@@ skipping 827 matching lines @@
 TEST(LaManyChained_64) { RunManyChainedLoops_i(64); }
 
 TEST(LaManyNested_30) { RunManyNestedLoops_i(30); }
 TEST(LaManyNested_31) { RunManyNestedLoops_i(31); }
 TEST(LaManyNested_32) { RunManyNestedLoops_i(32); }
 TEST(LaManyNested_33) { RunManyNestedLoops_i(33); }
 TEST(LaManyNested_34) { RunManyNestedLoops_i(34); }
 TEST(LaManyNested_62) { RunManyNestedLoops_i(62); }
 TEST(LaManyNested_63) { RunManyNestedLoops_i(63); }
 TEST(LaManyNested_64) { RunManyNestedLoops_i(64); }