mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-01-23 17:52:26 -05:00
e79d4f3462
This change adds a check to discard pointers that are lower than the minimum address of all allocated blocks or higher than the maximum address of all blocks. By doing this we avoid executing plenty of set() operations on the HashMap in the add_possible_value(). With this change gather_conservative_roots() run 10x times faster in Speedometer React-Redux-TodoMVC test. |
||
---|---|---|
.. | ||
BlockAllocator.cpp | ||
BlockAllocator.h | ||
Cell.cpp | ||
Cell.h | ||
CellAllocator.cpp | ||
CellAllocator.h | ||
DeferGC.h | ||
GCPtr.h | ||
Handle.cpp | ||
Handle.h | ||
Heap.cpp | ||
Heap.h | ||
HeapBlock.cpp | ||
HeapBlock.h | ||
HeapFunction.h | ||
HeapRoot.h | ||
Internals.h | ||
MarkedVector.cpp | ||
MarkedVector.h |