dist/util/rbtree.c

54 	RBTREE_NULL,		/* Parent.  */
55 	RBTREE_NULL,		/* Left.  */
56 	RBTREE_NULL,		/* Right.  */
98 	rbtree->root = RBTREE_NULL;
112 	if (right->left != RBTREE_NULL)
117 	if (node->parent != RBTREE_NULL) {
139 	if (left->right != RBTREE_NULL)
144 	if (node->parent != RBTREE_NULL) {
235 	rbnode_type	*parent = RBTREE_NULL;
239 	while (node != RBTREE_NULL) {
255 	data->left = data->right = RBTREE_NULL;
260 	if (parent != RBTREE_NULL) {
308 	if(parent == RBTREE_NULL)
323 	if(child == RBTREE_NULL) return;
337 	if(to_delete->left != RBTREE_NULL && to_delete->right != RBTREE_NULL)
341 		while(smright->left != RBTREE_NULL)
378 	log_assert(to_delete->left == RBTREE_NULL || to_delete->right == RBTREE_NULL);
380 	if(to_delete->left != RBTREE_NULL) child = to_delete->left;
394 		if(child!=RBTREE_NULL) child->color = BLACK;
399 	to_delete->parent = RBTREE_NULL;
400 	to_delete->left = RBTREE_NULL;
401 	to_delete->right = RBTREE_NULL;
418 		if(child_parent == RBTREE_NULL)
441 			if(sibling != RBTREE_NULL)
459 		if(sibling != RBTREE_NULL)
464 	log_assert(sibling != RBTREE_NULL);
526 	while (node != RBTREE_NULL) {
553 	for (node = rbtree->root; node->left != RBTREE_NULL; node = node->left);
562 	for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right);
575 	if (node->right != RBTREE_NULL) {
577 		for (node = node->right; node->left != RBTREE_NULL; node = node->left);
580 		while (parent != RBTREE_NULL && node == parent->right) {
594 	if (node->left != RBTREE_NULL) {
596 		for (node = node->left; node->right != RBTREE_NULL; node = node->right);
599 		while (parent != RBTREE_NULL && node == parent->left) {
612 	if(!node || node == RBTREE_NULL)