mirror of
https://github.com/mozilla/gecko-dev.git
synced 2024-10-08 10:44:56 +00:00
763f464a09
This code path would choose from several ways about how to divide numbers. By calculating the inverse of the divisor early we can elude all the branches along this code path we can make it faster than the previous code or naive division. Differential Revision: https://phabricator.services.mozilla.com/D132322 |
||
---|---|---|
.. | ||
fallback.cpp | ||
Makefile.in | ||
malloc_decls.h | ||
moz.build | ||
mozjemalloc_types.h | ||
mozjemalloc.cpp | ||
mozjemalloc.h | ||
mozmemory_wrap.cpp | ||
mozmemory_wrap.h | ||
mozmemory.h | ||
Mutex.cpp | ||
Mutex.h | ||
rb.h | ||
replace_malloc_bridge.h | ||
replace_malloc.h | ||
Utils.h | ||
zone.c |