Introduce subclass wrappers for STL containers that make them a lot easier

src/compiler/scheduler.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/compiler/scheduler.h"
 
 #include "src/compiler/graph.h"
 #include "src/compiler/graph-inl.h"
 #include "src/compiler/node.h"
 #include "src/compiler/node-properties.h"
@@ skipping 189 matching lines @@
             IrOpcode::Mnemonic(node->opcode()), block->id(), succ->id());
     }
   }
 };
 
 
 Scheduler::Scheduler(Zone* zone, Graph* graph, Schedule* schedule)
     : zone_(zone),
       graph_(graph),
       schedule_(schedule),
-      unscheduled_uses_(IntVector::allocator_type(zone)),
-      scheduled_nodes_(NodeVectorVector::allocator_type(zone)),
-      schedule_root_nodes_(NodeVector::allocator_type(zone)),
-      schedule_early_rpo_index_(IntVector::allocator_type(zone)) {}
+      unscheduled_uses_(zone),
+      scheduled_nodes_(zone),
+      schedule_root_nodes_(zone),
+      schedule_early_rpo_index_(zone) {}
 
 
 Schedule* Scheduler::ComputeSchedule(Graph* graph) {
   Zone tmp_zone(graph->zone()->isolate());
   Schedule* schedule = new (graph->zone()) Schedule(graph->zone());
 
   Scheduler::ComputeCFG(graph, schedule);
 
   Scheduler scheduler(&tmp_zone, graph, schedule);
 
@@ skipping 42 matching lines @@
 
 
 void Scheduler::PrepareAuxiliaryNodeData() {
   unscheduled_uses_.resize(graph_->NodeCount(), 0);
   schedule_early_rpo_index_.resize(graph_->NodeCount(), 0);
 }
 
 
 void Scheduler::PrepareAuxiliaryBlockData() {
   Zone* zone = schedule_->zone();
-  scheduled_nodes_.resize(schedule_->BasicBlockCount(),
-                          NodeVector(NodeVector::allocator_type(zone)));
+  scheduled_nodes_.resize(schedule_->BasicBlockCount(), NodeVector(zone));
   schedule_->immediate_dominator_.resize(schedule_->BasicBlockCount(), NULL);
 }
 
 
 BasicBlock* Scheduler::GetCommonDominator(BasicBlock* b1, BasicBlock* b2) {
   while (b1 != b2) {
     int b1_rpo = GetRPONumber(b1);
     int b2_rpo = GetRPONumber(b2);
     DCHECK(b1_rpo != b2_rpo);
     if (b1_rpo < b2_rpo) {
@@ skipping 689 matching lines @@
 
 #if DEBUG
   if (FLAG_trace_turbo_scheduler) PrintRPO(num_loops, loops, final_order);
   VerifySpecialRPO(num_loops, loops, final_order);
 #endif
   return final_order;
 }
 }
 }
 }  // namespace v8::internal::compiler