| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Use linear scan for small bitmaps | Dave Watson | 2016-02-26 | 1 | -1/+40 |
| | | | | | | | | | | | | | | 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. | ||||
| * | Miscellaneous bitmap refactoring. | Jason Evans | 2016-02-26 | 1 | -18/+15 |
| | | |||||
| * | Implement compile-time bitmap size computation. | Jason Evans | 2014-09-28 | 1 | -15/+3 |
| | | |||||
| * | Normalize #define whitespace. | Jason Evans | 2013-12-09 | 1 | -1/+1 |
| | | | | | Consistently use a tab rather than a space following #define. | ||||
| * | Move repo contents in jemalloc/ to top level. | Jason Evans | 2011-04-01 | 1 | -0/+90 |
 |
index : jemalloc.git | |
| jemalloc is a general purpose malloc(3) implementation that emphasizes fragmentation avoidance and scalable concurrency support. |
| summaryrefslogtreecommitdiffstats |