Lines Matching refs:node
43 * node to the root of the tree and partly rebalances it.
53 * A red-black tree is a binary search tree with the node color as an
57 * - each red node (except for the root) has a black parent,
58 * - each leaf node is black.
112 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
115 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
116 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
127 /* Finds the node with the same key as elm */ \
161 * Moves node close to the key of elm to top
317 int rbe_color; /* node color */ \
400 * Moves node close to the key of elm to top
597 /* Inserts a node into the RB tree */ \
628 /* Finds the node with the same key as elm */ \
646 /* Finds the first node greater than or equal to the search key */ \