|
LLVM
3.7.0
|
#include "llvm/ADT/ilist.h"#include "llvm/Support/AlignOf.h"#include "llvm/Support/Allocator.h"#include "llvm/Support/ErrorHandling.h"#include <cassert>Go to the source code of this file.
Classes | |
| struct | llvm::RecyclerStruct |
| RecyclerStruct - Implementation detail for Recycler. More... | |
| struct | llvm::ilist_traits< RecyclerStruct > |
| class | llvm::Recycler< T, Size, Align > |
| Recycler - This class manages a linked-list of deallocated nodes and facilitates reusing deallocated memory in place of allocating new memory. More... | |
Namespaces | |
| llvm | |
| Compute iterated dominance frontiers using a linear time algorithm. | |
Functions | |
| void | llvm::PrintRecyclerStats (size_t Size, size_t Align, size_t FreeListSize) |
| PrintRecyclingAllocatorStats - Helper for RecyclingAllocator for printing statistics. More... | |
1.8.6