mirror of
https://github.com/RGBCube/serenity
synced 2025-05-31 19:38:12 +00:00
![]() HeapBlock now implements the same lazy freelist as LibC malloc() does, where new blocks start out in a "bump allocator" mode that gets used until we've bump-allocated all the way to the end of the block. Then we fall back to the old freelist style as before. This means we don't have to pre-initialize the freelist on HeapBlock construction. This defers page faults and reduces memory usage for blocks where all cells don't get used. :^) |
||
---|---|---|
.. | ||
Allocator.cpp | ||
Allocator.h | ||
DeferGC.h | ||
Handle.cpp | ||
Handle.h | ||
Heap.cpp | ||
Heap.h | ||
HeapBlock.cpp | ||
HeapBlock.h |