Refactor allocation policies.

test/cctest/test-list.cc

 // Copyright 2009 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 17 matching lines @@
 #include <stdlib.h>
 #include <string.h>
 #include "v8.h"
 #include "cctest.h"
 
 using namespace v8::internal;
 
 // Use a testing allocator that clears memory before deletion.
 class ZeroingAllocationPolicy {
  public:
-  static void* New(size_t size) {
+  void* New(size_t size) {
     // Stash the size in the first word to use for Delete.
     size_t true_size = size + sizeof(size_t);
     size_t* result = reinterpret_cast<size_t*>(malloc(true_size));
     if (result == NULL) return result;
     *result = true_size;
     return result + 1;
   }
 
-  static void Delete(void* ptr) {
+  void Delete(void* ptr) {
     size_t* true_ptr = reinterpret_cast<size_t*>(ptr) - 1;
     memset(true_ptr, 0, *true_ptr);
     free(true_ptr);
   }
 };
 
 // Check that we can add (a reference to) an element of the list
 // itself.
 TEST(ListAdd) {
   // Add elements to the list to grow it to its capacity.
@@ skipping 73 matching lines @@
 
 
 TEST(Clear) {
   List<int> list(4);
   CHECK_EQ(0, list.length());
   for (int i = 0; i < 4; ++i) list.Add(i);
   CHECK_EQ(4, list.length());
   list.Clear();
   CHECK_EQ(0, list.length());
 }