llvm-6502/include/llvm/Support/RecyclingAllocator.h
Joey Gouly 9dc1842b3f Add an assertion to the fixed-size allocator to ensure that we don't request
an allocation that is greater than what we will actually allocate.

Patch by Artyom Skrobov!


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@189340 91177308-0d34-0410-b5e6-96231b3b80d8
2013-08-27 11:20:13 +00:00

78 lines
2.4 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.template 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() {
Allocator.PrintStats();
Base.PrintStats();
}
};
}
template<class AllocatorType, class T, size_t Size, size_t Align>
inline void *operator new(size_t size,
llvm::RecyclingAllocator<AllocatorType,
T, Size, Align> &Allocator) {
assert(size <= Size && "allocation size exceeded");
return Allocator.Allocate();
}
template<class AllocatorType, class T, size_t Size, size_t Align>
inline void operator delete(void *E,
llvm::RecyclingAllocator<AllocatorType,
T, Size, Align> &A) {
A.Deallocate(E);
}
#endif