K 10
svn:author
V 6
jasone
K 8
svn:date
V 27
2008-04-23T16:09:18.000000Z
K 7
svn:log
V 360
Implement red-black trees without using parent pointers, and store the
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.

END