5 Commits

Author	SHA1	Message	Date
Dave Watson	b8823ab026	Use linear scan for small bitmaps ... 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.	2016-02-26 14:21:10 -08:00
Jason Evans	01ecdf32d6	Miscellaneous bitmap refactoring.	2016-02-26 14:21:10 -08:00
Jason Evans	f97e5ac4ec	Implement compile-time bitmap size computation.	2014-09-28 14:43:11 -07:00
Jason Evans	a4f124f59f	Normalize #define whitespace. ... Consistently use a tab rather than a space following #define.	2013-12-08 22:28:27 -08:00
Jason Evans	7427525c28	Move repo contents in jemalloc/ to top level.	2011-03-31 20:36:17 -07:00