Lines Matching refs:root
75 * Get the root.
80 return (p_map->root.p_left);
209 /* special setup for the root node */
210 p_map->root.p_up = &p_map->root;
211 p_map->root.p_left = &p_map->nil;
212 p_map->root.p_right = &p_map->nil;
213 p_map->root.color = CL_MAP_BLACK;
292 * Balance a tree starting at a given item back to the root.
301 CL_ASSERT(p_item != &p_map->root);
353 CL_ASSERT(p_map->root.p_up == &p_map->root);
354 CL_ASSERT(p_map->root.color != CL_MAP_RED);
363 p_insert_at = &p_map->root;
382 if (p_insert_at == &p_map->root) {
440 while ((p_item->color != CL_MAP_RED) && (p_item->p_up != &p_map->root)) {
536 /* Get the pointer to the new root's child, if any. */
993 * Get the root.
998 return (p_map->root.p_left);
1128 /* special setup for the root node */
1129 p_map->root.p_up = &p_map->root;
1130 p_map->root.p_left = &p_map->nil;
1131 p_map->root.p_right = &p_map->nil;
1132 p_map->root.color = CL_MAP_BLACK;
1228 * Balance a tree starting at a given item back to the root.
1237 CL_ASSERT(p_item != &p_map->root);
1290 CL_ASSERT(p_map->root.p_up == &p_map->root);
1291 CL_ASSERT(p_map->root.color != CL_MAP_RED);
1300 p_insert_at = &p_map->root;
1321 if (p_insert_at == &p_map->root) {
1379 while ((p_item->color != CL_MAP_RED) && (p_item->p_up != &p_map->root)) {
1472 /* Get the pointer to the new root's child, if any. */