aboutsummaryrefslogtreecommitdiff
path: root/common/memorypool.cpp
AgeCommit message (Collapse)Author
2009-12-07COMMON: Document class MemoryPool; make MemoryPool::_chunkSize constMax Horn
svn-id: r46282
2009-09-06COMMON: (Inactive) code to debug memory leaks in memory pools + typo fixBertrand Augereau
svn-id: r43990
2009-05-03COMMON: Optimized MemoryPool::freeUnusedPages (if many pages are phased out ↵Max Horn
at once, don't copy everything multiple times around) svn-id: r40292
2008-12-22Fixed indentation and removed whitespaces at the end of lineJordi Vilalta Prat
svn-id: r35481
2008-10-30Reset _chunksPerPage after MemoryPool::freeUnusedPages, to avoid enormous ↵Max Horn
memory consumption in various easy to trigger situations; out of paranoia, prohibit for now memory chunks bigger than 16MB svn-id: r34868
2008-10-12COMMON: Added a new ObjectPool class, with matching operator new/delete ↵Max Horn
overloads svn-id: r34785
2008-09-02Revised HashMap implementationMax Horn
svn-id: r34273
2008-04-04cleanupMax Horn
svn-id: r31391
2008-03-30Some minor whitespace changes, and the customary "end of namespace" comment.Torbjörn Andersson
svn-id: r31338
2008-03-30Whitespacing fixesBertrand Augereau
svn-id: r31330
2008-03-30std::max => utils.h MAXBertrand Augereau
Added GPL headers svn-id: r31324
2008-03-30Fixed signed/unsigned warning.Torbjörn Andersson
svn-id: r31322
2008-03-30The hashmap uses the memorypool for allocating/deallocating its NodesBertrand Augereau
(It is faster and it saves approximately 70kB the DS or other small devices will appreciate having) svn-id: r31321
2008-03-30Introduction of a fixed size memory pool with a typical free list implementationBertrand Augereau
+ : amortized O(1) allocation, O(1) deallocation, less overhead per allocation - : unused memory is not reclaimed until death or manual invocation of a function svn-id: r31320