Fold the useful features of alist and alist_node into ilist, and

[oota-llvm.git] / include / llvm / Support / Allocator.h

diff --git a/include/llvm/Support/Allocator.h b/include/llvm/Support/Allocator.h
index 14211488a5953fa2a813e784c5d000b7a3abb4ab..bc3653503caf8715ccc7fce2f0f136e789151f84 100644 (file)
--- a/include/llvm/Support/Allocator.h
+++ b/include/llvm/Support/Allocator.h
@@ -26,7 +26,7 @@ public:
   
   void Reset() {}
 
-  void *Allocate(size_t Size, size_t Alignment) { return malloc(Size); }
+  void *Allocate(size_t Size, size_t /*Alignment*/) { return malloc(Size); }
   
   template <typename T>
   T *Allocate() { return static_cast<T*>(malloc(sizeof(T))); }
@@ -41,6 +41,9 @@ public:
 /// allocating memory, and never deletes it until the entire block is dead. This
 /// makes allocation speedy, but must only be used when the trade-off is ok.
 class BumpPtrAllocator {
+  BumpPtrAllocator(const BumpPtrAllocator &); // do not implement
+  void operator=(const BumpPtrAllocator &);   // do not implement
+
   void *TheMemory;
 public:
   BumpPtrAllocator();
@@ -55,7 +58,12 @@ public:
     return static_cast<T*>(Allocate(sizeof(T),AlignOf<T>::Alignment));
   }
   
-  void Deallocate(void *Ptr) {}
+  template <typename T>
+  T *Allocate(size_t Num) { 
+    return static_cast<T*>(Allocate(Num * sizeof(T), AlignOf<T>::Alignment));
+  }
+  
+  void Deallocate(void * /*Ptr*/) {}
 
   void PrintStats() const;
 };