summaryrefslogtreecommitdiffstats
path: root/lib/libc/stdlib/rb.h
Commit message (Collapse)AuthorAgeFilesLines
* Import jemalloc 9ef7f5dc34ff02f50d401e41c8d9a4a928e7c2aa (dev branch,jasone2012-04-171-1002/+0
| | | | | | | | prior to 3.0.0 release) as contrib/jemalloc, and integrate it into libc. The code being imported by this commit diverged from lib/libc/stdlib/malloc.c in March 2010, which means that a portion of the jemalloc 1.0.0 ChangeLog entries are relevant, as are the entries for all subsequent releases.
* Rewrite red-black trees to do lazy balance fixup. This improvesjasone2010-02-281-762/+817
| | | | insert/remove speed by ~30%.
* Clean up cpp logic and comments.jasone2008-05-141-8/+21
|
* Fix a comment.jasone2008-05-031-1/+1
|
* Add rb_wrap(), which creates C function wrappers for most rb_*()jasone2008-05-011-36/+194
| | | | | | | | | | macros. Add rb_foreach_next() and rb_foreach_reverse_prev(), which make it possible to re-synchronize tree iteration after the tree has been modified. Rename rb_tree_new() to rb_new().
* Implement red-black trees without using parent pointers, and store thejasone2008-04-231-0/+776
color bit in the least significant bit of the right child pointer, in order to reduce red-black tree linkage overhead by ~2X as compared to sys/tree.h. Use the new red-black tree implementation in malloc, which drops memory usage by ~0.5 or ~1%, for 32- and 64-bit systems, respectively.
OpenPOWER on IntegriCloud