mirror of
				https://github.com/c64scene-ar/llvm-6502.git
				synced 2025-10-31 08:16:47 +00:00 
			
		
		
		
	a new ilist_node class, and remove them. Unlike alist_node, ilist_node doesn't attempt to manage storage itself, so it avoids the associated problems, including being opaque in gdb. Adjust the Recycler class so that it doesn't depend on alist_node. Also, change it to use explicit Size and Align parameters, allowing it to work when the largest-sized node doesn't have the greatest alignment requirement. Change MachineInstr's MachineMemOperand list from a pool-backed alist to a std::list for now. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@54146 91177308-0d34-0410-b5e6-96231b3b80d8
		
			
				
	
	
		
			60 lines
		
	
	
		
			1.7 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			60 lines
		
	
	
		
			1.7 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| //==- llvm/Support/RecyclingAllocator.h - Recycling Allocator ----*- C++ -*-==//
 | |
| //
 | |
| //                     The LLVM Compiler Infrastructure
 | |
| //
 | |
| // This file is distributed under the University of Illinois Open Source
 | |
| // License. See LICENSE.TXT for details.
 | |
| //
 | |
| //===----------------------------------------------------------------------===//
 | |
| //
 | |
| // This file defines the RecyclingAllocator class.  See the doxygen comment for
 | |
| // RecyclingAllocator for more details on the implementation.
 | |
| //
 | |
| //===----------------------------------------------------------------------===//
 | |
| 
 | |
| #ifndef LLVM_SUPPORT_RECYCLINGALLOCATOR_H
 | |
| #define LLVM_SUPPORT_RECYCLINGALLOCATOR_H
 | |
| 
 | |
| #include "llvm/Support/Recycler.h"
 | |
| 
 | |
| namespace llvm {
 | |
| 
 | |
| /// RecyclingAllocator - This class wraps an Allocator, adding the
 | |
| /// functionality of recycling deleted objects.
 | |
| ///
 | |
| template<class AllocatorType, class T,
 | |
|          size_t Size = sizeof(T), size_t Align = AlignOf<T>::Alignment>
 | |
| class RecyclingAllocator {
 | |
| private:
 | |
|   /// Base - Implementation details.
 | |
|   ///
 | |
|   Recycler<T, Size, Align> Base;
 | |
| 
 | |
|   /// Allocator - The wrapped allocator.
 | |
|   ///
 | |
|   AllocatorType Allocator;
 | |
| 
 | |
| public:
 | |
|   ~RecyclingAllocator() { Base.clear(Allocator); }
 | |
| 
 | |
|   /// Allocate - Return a pointer to storage for an object of type
 | |
|   /// SubClass. The storage may be either newly allocated or recycled.
 | |
|   ///
 | |
|   template<class SubClass>
 | |
|   SubClass *Allocate() { return Base.Allocate<SubClass>(Allocator); }
 | |
| 
 | |
|   T *Allocate() { return Base.Allocate(Allocator); }
 | |
| 
 | |
|   /// Deallocate - Release storage for the pointed-to object. The
 | |
|   /// storage will be kept track of and may be recycled.
 | |
|   ///
 | |
|   template<class SubClass>
 | |
|   void Deallocate(SubClass* E) { return Base.Deallocate(Allocator, E); }
 | |
| 
 | |
|   void PrintStats() { Base.PrintStats(); }
 | |
| };
 | |
| 
 | |
| }
 | |
| 
 | |
| #endif
 |