Refactor allocation policies.

src/frames.cc

 // Copyright 2011 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 942 matching lines @@
 
       accumulator->Add("] ");
     }
   }
 
   accumulator->Add("(this=%o", receiver);
 
   // Get scope information for nicer output, if possible. If code is
   // NULL, or doesn't contain scope info, info will return 0 for the
   // number of parameters, stack slots, or context slots.
-  ScopeInfo<PreallocatedStorage> info(*scope_info);
+  ScopeInfo<PreallocatedStorageAllocator> info(*scope_info);
 
   // Print the parameters.
   int parameters_count = ComputeParametersCount();
   for (int i = 0; i < parameters_count; i++) {
     accumulator->Add(",");
     // If we have a name for the parameter we print it. Nameless
     // parameters are either because we have more actual parameters
     // than formal parameters or because we have no scope information.
     if (i < info.number_of_parameters()) {
       accumulator->PrintName(*info.parameter_name(i));
@@ skipping 287 matching lines @@
 
   switch (frame->type()) {
     STACK_FRAME_TYPE_LIST(FRAME_TYPE_CASE)
     default: UNREACHABLE();
   }
 #undef FRAME_TYPE_CASE
   return NULL;
 }
 
 Vector<StackFrame*> CreateStackMap() {
-  ZoneList<StackFrame*> list(10);
+  ZoneList<StackFrame*> list(ZONE, 10);
   for (StackFrameIterator it; !it.done(); it.Advance()) {
     StackFrame* frame = AllocateFrameCopy(it.frame());
     list.Add(frame);
   }
   return list.ToVector();
 }
 
 
 } }  // namespace v8::internal