b8823ab026
For small bitmaps, a linear scan of the bitmap is slightly faster than a tree search - bitmap_t is more compact, and there are fewer writes since we don't have to propogate state transitions up the tree. On x86_64 with the current settings, I'm seeing ~.5%-1% CPU improvement in production canaries with this change. The old tree code is left since 32bit sizes are much larger (and ffsl smaller), and maybe the run sizes will change in the future. This resolves #339. |
||
|---|---|---|
| .. | ||
| internal | ||
| jemalloc_defs.h.in | ||
| jemalloc_macros.h.in | ||
| jemalloc_mangle.sh | ||
| jemalloc_protos.h.in | ||
| jemalloc_rename.sh | ||
| jemalloc_typedefs.h.in | ||
| jemalloc.sh | ||