[turbofan] use ZonePool in most places in the compiler pipeline a temp zone is used.

src/compiler/control-reducer.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/compiler/common-operator.h"
 #include "src/compiler/control-reducer.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/node-properties-inl.h"
 #include "src/zone-containers.h"
 
 namespace v8 {
 namespace internal {
 namespace compiler {
 
 enum VisitState { kUnvisited, kOnStack, kRevisit, kVisited };
 
 #define TRACE(x) \
   if (FLAG_trace_turbo) PrintF x
 
 class ControlReducerImpl {
  public:
-  ControlReducerImpl(JSGraph* jsgraph, CommonOperatorBuilder* common)
-      : zone_(jsgraph->zone()->isolate()),
+  ControlReducerImpl(Zone* zone, JSGraph* jsgraph,
+                     CommonOperatorBuilder* common)
+      : zone_(zone),
         jsgraph_(jsgraph),
         common_(common),
-        state_(jsgraph->graph()->NodeCount(), kUnvisited, &zone_),
-        stack_(&zone_),
-        revisit_(&zone_),
+        state_(jsgraph->graph()->NodeCount(), kUnvisited, zone_),
+        stack_(zone_),
+        revisit_(zone_),
         dead_(NULL) {}
 
-  Zone zone_;
+  Zone* zone_;
   JSGraph* jsgraph_;
   CommonOperatorBuilder* common_;
   ZoneVector<VisitState> state_;
   ZoneDeque<Node*> stack_;
   ZoneDeque<Node*> revisit_;
   Node* dead_;
 
   void Trim() {
     //  Mark all nodes reachable from end.
-    NodeVector nodes(&zone_);
+    NodeVector nodes(zone_);
     state_.assign(jsgraph_->graph()->NodeCount(), kUnvisited);
     Push(jsgraph_->graph()->end());
     while (!stack_.empty()) {
       Node* node = stack_[stack_.size() - 1];
       stack_.pop_back();
       state_[node->id()] = kVisited;
       nodes.push_back(node);
       for (InputIter i = node->inputs().begin(); i != node->inputs().end();
            ++i) {
         Recurse(*i);  // pushes node onto the stack if necessary.
@@ skipping 43 matching lines @@
     Push(node);
     return true;
   }
 
   void Push(Node* node) {
     state_[node->id()] = kOnStack;
     stack_.push_back(node);
   }
 };
 
-void ControlReducer::ReduceGraph(JSGraph* jsgraph,
+void ControlReducer::ReduceGraph(Zone* zone, JSGraph* jsgraph,
                                  CommonOperatorBuilder* common) {
-  ControlReducerImpl impl(jsgraph, NULL);
+  ControlReducerImpl impl(zone, jsgraph, NULL);
   // Only trim the graph for now. Control reduction can reduce non-terminating
   // loops to graphs that are unschedulable at the moment.
   impl.Trim();
 }
 
 
-void ControlReducer::TrimGraph(JSGraph* jsgraph) {
-  ControlReducerImpl impl(jsgraph, NULL);
+void ControlReducer::TrimGraph(Zone* zone, JSGraph* jsgraph) {
+  ControlReducerImpl impl(zone, jsgraph, NULL);
   impl.Trim();
 }
 }
 }
 }  // namespace v8::internal::compiler