Jens Stutte 542d0e564f Bug 1924444 - Use a linked list with LIFO policy for a bin's mNotFullRuns to reduce overhead and foster locality. r=smaug,pbone ...

The current order of re-using regions from non-full runs relies on the
run's position in memory via a RedBlackTree. This leads to O(log(n))
complexity for the tree book-keeping and walking while providing a
somewhat arbitrary order when doing GetNonFullBinRun.

We can reduce the complexity here by using a DoublyLinkedList for
mNonFullRuns. The resulting LIFO order seems to have beneficial effects
for common gecko use cases, too.

Differential Revision: https://phabricator.services.mozilla.com/D225533

2024-11-13 07:48:38 +00:00

..

test

…

fallback.cpp

…

FdPrintf.cpp

…

FdPrintf.h

…

Makefile.in

…

malloc_decls.h

Bug 1925181 - Properly set small alloc randomization on Android content processes as well r=jld

2024-10-21 06:05:44 +00:00

moz.build

…

mozjemalloc_types.h

Bug 1917844 - Assert correct jemalloc randomization state on Content and non Content processes r=jld,glandium

2024-10-21 06:05:43 +00:00

mozjemalloc.cpp

Bug 1924444 - Use a linked list with LIFO policy for a bin's mNotFullRuns to reduce overhead and foster locality. r=smaug,pbone

2024-11-13 07:48:38 +00:00

mozjemalloc.h

…

mozmemory_utils.h

Bug 1786451 - Part 1: Export MozVirtualAlloc as part of the jemalloc API r=glandium

2024-10-31 09:52:34 +00:00

mozmemory_wrap.cpp

…

mozmemory_wrap.h

Bug 1786451 - Part 1: Export MozVirtualAlloc as part of the jemalloc API r=glandium

2024-10-31 09:52:34 +00:00

mozmemory.h

…

Mutex.cpp

…

Mutex.h

…

PHC.cpp

Bug 1929263 - Use std::clamp instead of min/max chain in memory/build/PHC.cpp r=glandium

2024-11-06 10:13:48 +00:00

PHC.h

…

rb.h

…

replace_malloc_bridge.h

…

replace_malloc.h

…

Utils.h

…

zone.c

…