mirror of
https://github.com/mozilla/gecko-dev.git
synced 2024-11-23 04:41:11 +00:00
542d0e564f
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 |
||
---|---|---|
.. | ||
build | ||
gtest | ||
mozalloc | ||
mozjemalloc_info | ||
replace | ||
volatile | ||
app.mozbuild | ||
moz.build | ||
moz.configure |