diff options
| author | Jakob Stoklund Olesen <stoklund@2pi.dk> | 2013-01-04 22:35:45 +0000 |
|---|---|---|
| committer | Jakob Stoklund Olesen <stoklund@2pi.dk> | 2013-01-04 22:35:45 +0000 |
| commit | b2e01b3707e23276a087f0f67edfc86082acdaa2 (patch) | |
| tree | 9a7ecb400c6e432658aad0d36c4d184a4e59551a /include | |
| parent | 7c5c12bd4d60070c90161df9f6ae078c1f7b1ce5 (diff) | |
| download | llvm-b2e01b3707e23276a087f0f67edfc86082acdaa2.tar.gz llvm-b2e01b3707e23276a087f0f67edfc86082acdaa2.tar.bz2 llvm-b2e01b3707e23276a087f0f67edfc86082acdaa2.tar.xz | |
Special case Recycler::clear(BumpPtrAllocator).
A BumpPtrAllocator has an empty Deallocate() method, but
Recycler::clear() would still call it for every single object ever
allocated, bringing all those objects into cache. As a bonus,
iplist::remove() will also write to the Prev/Next pointers on all the
objects, so all those cache lines have to be written back to RAM before
the pages are given back to the OS.
Stop wasting time and memory bandwith by using the new
clearAndLeakUnsafely() function to jettison all the recycled objects.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@171541 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include')
| -rw-r--r-- | include/llvm/Support/Recycler.h | 11 |
1 files changed, 11 insertions, 0 deletions
diff --git a/include/llvm/Support/Recycler.h b/include/llvm/Support/Recycler.h index fa6e189e97..bcc561db2d 100644 --- a/include/llvm/Support/Recycler.h +++ b/include/llvm/Support/Recycler.h @@ -22,6 +22,8 @@ namespace llvm { +class BumpPtrAllocator; + /// PrintRecyclingAllocatorStats - Helper for RecyclingAllocator for /// printing statistics. /// @@ -87,6 +89,15 @@ public: } } + /// Special case for BumpPtrAllocator which has an empty Deallocate() + /// function. + /// + /// There is no need to traverse the free list, pulling all the objects into + /// cache. + void clear(BumpPtrAllocator&) { + FreeList.clearAndLeakNodesUnsafely(); + } + template<class SubClass, class AllocatorType> SubClass *Allocate(AllocatorType &Allocator) { assert(sizeof(SubClass) <= Size && |