134 	CL_ASSERT(p_item->p_right != &p_map->nil);  in __cl_map_rot_left()
146 	 * Set B's parent to A.  We trap for B being NIL since the  in __cl_map_rot_left()
147 	 * caller may depend on NIL not changing.  in __cl_map_rot_left()
149 	if ((*pp_root)->p_left != &p_map->nil)  in __cl_map_rot_left()
180 	CL_ASSERT(p_item->p_left != &p_map->nil);  in __cl_map_rot_right()
191 	 * Set B's parent to C.  We trap for B being NIL since the  in __cl_map_rot_right()
192 	 * caller may depend on NIL not changing.  in __cl_map_rot_right()
194 	if ((*pp_root)->p_right != &p_map->nil)  in __cl_map_rot_right()
211 	p_map->root.p_left = &p_map->nil;  in cl_qmap_init()
212 	p_map->root.p_right = &p_map->nil;  in cl_qmap_init()
216 	p_map->nil.p_up = &p_map->nil;  in cl_qmap_init()
217 	p_map->nil.p_left = &p_map->nil;  in cl_qmap_init()
218 	p_map->nil.p_right = &p_map->nil;  in cl_qmap_init()
219 	p_map->nil.color = CL_MAP_BLACK;  in cl_qmap_init()
236 	while (p_item != &p_map->nil) {  in cl_qmap_get()
259 	p_item_found = (cl_map_item_t *) & p_map->nil;  in cl_qmap_get_next()
261 	while (p_item != &p_map->nil) {  in cl_qmap_get_next()
355 	CL_ASSERT(p_map->nil.color != CL_MAP_RED);  in cl_qmap_insert()
357 	p_item->p_left = &p_map->nil;  in cl_qmap_insert()
358 	p_item->p_right = &p_map->nil;  in cl_qmap_insert()
366 	while (p_comp_item != &p_map->nil) {  in cl_qmap_insert()
379 	CL_ASSERT(p_insert_at != &p_map->nil);  in cl_qmap_insert()
380 	CL_ASSERT(p_comp_item == &p_map->nil);  in cl_qmap_insert()
388 		__cl_primitive_insert(&p_map->nil.pool_item.list_item,  in cl_qmap_insert()
422 	 * Note that it is not necessary to re-color the nil node black because all  in cl_qmap_insert()
423 	 * red color assignments are made via the p_up pointer, and nil is never  in cl_qmap_insert()
516 	if ((p_item->p_right == &p_map->nil) || (p_item->p_left == &p_map->nil)) {  in cl_qmap_remove_item()
528 		CL_ASSERT(p_del_item != &p_map->nil);  in cl_qmap_remove_item()
537 	if (p_del_item->p_left != &p_map->nil)  in cl_qmap_remove_item()
543 	 * This assignment may modify the parent pointer of the nil node.  in cl_qmap_remove_item()
572 	CL_ASSERT(p_map->nil.color != CL_MAP_RED);  in cl_qmap_remove_item()
1052 	CL_ASSERT(p_item->p_right != &p_map->nil);  in __cl_fmap_rot_left()
1064 	 * Set B's parent to A.  We trap for B being NIL since the  in __cl_fmap_rot_left()
1065 	 * caller may depend on NIL not changing.  in __cl_fmap_rot_left()
1067 	if ((*pp_root)->p_left != &p_map->nil)  in __cl_fmap_rot_left()
1098 	CL_ASSERT(p_item->p_left != &p_map->nil);  in __cl_fmap_rot_right()
1109 	 * Set B's parent to C.  We trap for B being NIL since the  in __cl_fmap_rot_right()
1110 	 * caller may depend on NIL not changing.  in __cl_fmap_rot_right()
1112 	if ((*pp_root)->p_right != &p_map->nil)  in __cl_fmap_rot_right()
1130 	p_map->root.p_left = &p_map->nil;  in cl_fmap_init()
1131 	p_map->root.p_right = &p_map->nil;  in cl_fmap_init()
1135 	p_map->nil.p_up = &p_map->nil;  in cl_fmap_init()
1136 	p_map->nil.p_left = &p_map->nil;  in cl_fmap_init()
1137 	p_map->nil.p_right = &p_map->nil;  in cl_fmap_init()
1138 	p_map->nil.color = CL_MAP_BLACK;  in cl_fmap_init()
1160 	while (p_item != &p_map->nil) {  in cl_fmap_match()
1193 	p_item_found = (cl_fmap_item_t *) & p_map->nil;  in cl_fmap_get_next()
1195 	while (p_item != &p_map->nil) {  in cl_fmap_get_next()
1292 	CL_ASSERT(p_map->nil.color != CL_MAP_RED);  in cl_fmap_insert()
1294 	p_item->p_left = &p_map->nil;  in cl_fmap_insert()
1295 	p_item->p_right = &p_map->nil;  in cl_fmap_insert()
1303 	while (p_comp_item != &p_map->nil) {  in cl_fmap_insert()
1318 	CL_ASSERT(p_insert_at != &p_map->nil);  in cl_fmap_insert()
1319 	CL_ASSERT(p_comp_item == &p_map->nil);  in cl_fmap_insert()
1327 		__cl_primitive_insert(&p_map->nil.pool_item.list_item,  in cl_fmap_insert()
1361 	 * Note that it is not necessary to re-color the nil node black because all  in cl_fmap_insert()
1362 	 * red color assignments are made via the p_up pointer, and nil is never  in cl_fmap_insert()
1452 	if ((p_item->p_right == &p_map->nil) || (p_item->p_left == &p_map->nil)) {  in cl_fmap_remove_item()
1464 		CL_ASSERT(p_del_item != &p_map->nil);  in cl_fmap_remove_item()
1473 	if (p_del_item->p_left != &p_map->nil)  in cl_fmap_remove_item()
1479 	 * This assignment may modify the parent pointer of the nil node.  in cl_fmap_remove_item()
1508 	CL_ASSERT(p_map->nil.color != CL_MAP_RED);  in cl_fmap_remove_item()