Go to the source code of this file.
|
| | llvm |
| | Compute iterated dominance frontiers using a linear time algorithm.
|
| |
|
| template<class AllocatorType , class T , size_t Size, size_t Align> |
| void * | operator new (size_t size, llvm::RecyclingAllocator< AllocatorType, T, Size, Align > &Allocator) |
| |
| template<class AllocatorType , class T , size_t Size, size_t Align> |
| void | operator delete (void *E, llvm::RecyclingAllocator< AllocatorType, T, Size, Align > &A) |
| |
template<class AllocatorType , class T , size_t Size, size_t Align>
template<class AllocatorType , class T , size_t Size, size_t Align>