revert thread isolate in PreallocatedStorageAllocationPolicy

src/list.h

 // 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 30 matching lines @@
 // and Rob Pike.
 //
 // The list is parameterized by the type of its elements (T) and by an
 // allocation policy (P). The policy is used for allocating lists in
 // the C free store or the zone; see zone.h.
 
 // Forward defined as
 // template <typename T,
 //           class AllocationPolicy = FreeStoreAllocationPolicy> class List;
 template <typename T, class AllocationPolicy>
-class List : private AllocationPolicy::Deleter {
+class List {
  public:
-  explicit List(AllocationPolicy allocator = AllocationPolicy())
-    : AllocationPolicy::Deleter(allocator) {
+  explicit List(AllocationPolicy allocator = AllocationPolicy()) {
     Initialize(0, allocator);
   }
   INLINE(explicit List(int capacity,
-                       AllocationPolicy allocator = AllocationPolicy()))
-    : AllocationPolicy::Deleter(allocator) {
+                       AllocationPolicy allocator = AllocationPolicy())) {
     Initialize(capacity, allocator);
   }
   INLINE(~List()) { DeleteData(data_); }
 
   // Deallocates memory used by the list and leaves the list in a consistent
   // empty state.
   void Free() {
     DeleteData(data_);
     Initialize(0);
   }
 
   INLINE(void* operator new(size_t size,
                             AllocationPolicy allocator = AllocationPolicy())) {
     return allocator.New(static_cast<int>(size));
   }
   INLINE(void operator delete(void* p)) {
-    AllocationPolicy::Deleter::Delete(p);
+    AllocationPolicy::Delete(p);
   }
 
   // Please the MSVC compiler.  We should never have to execute this.
   INLINE(void operator delete(void* p, AllocationPolicy allocator)) {
     UNREACHABLE();
   }
 
-  // Delete via the instance Deleter
-  static void Delete(List* p) {
-    if (p == NULL) return;
-    p->~List();
-    p->AllocationPolicy::Deleter::Delete(p);
-  }
-
   // Returns a reference to the element at index i.  This reference is
   // not safe to use after operations that can change the list's
   // backing store (e.g. Add).
   inline T& operator[](int i) const {
     ASSERT(0 <= i);
     ASSERT(i < length_);
     return data_[i];
   }
   inline T& at(int i) const { return operator[](i); }
   inline T& last() const { return at(length_ - 1); }
@@ skipping 80 matching lines @@
 
  private:
   T* data_;
   int capacity_;
   int length_;
 
   INLINE(T* NewData(int n, AllocationPolicy allocator))  {
     return static_cast<T*>(allocator.New(n * sizeof(T)));
   }
   INLINE(void DeleteData(T* data))  {
-    this->AllocationPolicy::Deleter::Delete(data);
+    AllocationPolicy::Delete(data);
   }
 
   // Increase the capacity of a full list, and add an element.
   // List must be full already.
   void ResizeAdd(const T& element, AllocationPolicy allocator);
 
   // Inlined implementation of ResizeAdd, shared by inlined and
   // non-inlined versions of ResizeAdd.
   void ResizeAddInternal(const T& element, AllocationPolicy allocator);
 
@@ skipping 19 matching lines @@
 template <typename T, class P>
 int SortedListBSearch(const List<T>& list, P cmp);
 template <typename T>
 int SortedListBSearch(const List<T>& list, T elem);
 
 
 } }  // namespace v8::internal
 
 
 #endif  // V8_LIST_H_