118 	ldns_rbnode_t *right = node->right;  in ldns_rbtree_rotate_left()  local
119 	node->right = right->left;  in ldns_rbtree_rotate_left()
120 	if (right->left != LDNS_RBTREE_NULL)  in ldns_rbtree_rotate_left()
121 		right->left->parent = node;  in ldns_rbtree_rotate_left()
123 	right->parent = node->parent;  in ldns_rbtree_rotate_left()
127 			node->parent->left = right;  in ldns_rbtree_rotate_left()
129 			node->parent->right = right;  in ldns_rbtree_rotate_left()
132 		rbtree->root = right;  in ldns_rbtree_rotate_left()
134 	right->left = node;  in ldns_rbtree_rotate_left()
135 	node->parent = right;  in ldns_rbtree_rotate_left()
146 	node->left = left->right;  in ldns_rbtree_rotate_right()
147 	if (left->right != LDNS_RBTREE_NULL)  in ldns_rbtree_rotate_right()
148 		left->right->parent = node;  in ldns_rbtree_rotate_right()
153 		if (node == node->parent->right) {  in ldns_rbtree_rotate_right()
154 			node->parent->right = left;  in ldns_rbtree_rotate_right()
161 	left->right = node;  in ldns_rbtree_rotate_right()
174 			uncle = node->parent->parent->right;  in ldns_rbtree_insert_fixup()
189 				if (node == node->parent->right) {  in ldns_rbtree_insert_fixup()
262 			node = node->right;  in ldns_rbtree_insert()
268 	data->left = data->right = LDNS_RBTREE_NULL;  in ldns_rbtree_insert()
277 			parent->right = data;  in ldns_rbtree_insert()
326 	if(parent->right == old) parent->right = new;  in change_parent_ptr()
345 	   to_delete->right != LDNS_RBTREE_NULL)  in ldns_rbtree_delete()
348 		ldns_rbnode_t *smright = to_delete->right;  in ldns_rbtree_delete()
361 		if(to_delete->right != smright)  in ldns_rbtree_delete()
367 		change_child_ptr(smright->right, smright, to_delete);  in ldns_rbtree_delete()
368 		change_child_ptr(smright->right, smright, to_delete);  in ldns_rbtree_delete()
370 		if(to_delete->right != smright)  in ldns_rbtree_delete()
371 			change_child_ptr(to_delete->right, to_delete, smright);  in ldns_rbtree_delete()
372 		if(to_delete->right == smright)  in ldns_rbtree_delete()
375 			to_delete->right = to_delete;  in ldns_rbtree_delete()
382 		swap_np(&to_delete->right, &smright->right);  in ldns_rbtree_delete()
388 	else child = to_delete->right;  in ldns_rbtree_delete()
408 	to_delete->right = LDNS_RBTREE_NULL;  in ldns_rbtree_delete()
419 	if(child_parent->right == child) sibling = child_parent->left;  in ldns_rbtree_delete_fixup()
420 	else sibling = child_parent->right;  in ldns_rbtree_delete_fixup()
434 			if(child_parent->right == child)  in ldns_rbtree_delete_fixup()
438 			if(child_parent->right == child) sibling = child_parent->left;  in ldns_rbtree_delete_fixup()
439 			else sibling = child_parent->right;  in ldns_rbtree_delete_fixup()
445 			&& sibling->right->color == BLACK)  in ldns_rbtree_delete_fixup()
453 			if(child_parent->right == child) sibling = child_parent->left;  in ldns_rbtree_delete_fixup()
454 			else sibling = child_parent->right;  in ldns_rbtree_delete_fixup()
462 		&& sibling->right->color == BLACK)   in ldns_rbtree_delete_fixup()
473 	if(child_parent->right == child  in ldns_rbtree_delete_fixup()
475 		&& sibling->right->color == RED  in ldns_rbtree_delete_fixup()
479 		sibling->right->color = BLACK;  in ldns_rbtree_delete_fixup()
482 		if(child_parent->right == child) sibling = child_parent->left;  in ldns_rbtree_delete_fixup()
483 		else sibling = child_parent->right;  in ldns_rbtree_delete_fixup()
488 		&& sibling->right->color == BLACK)  in ldns_rbtree_delete_fixup()
494 		if(child_parent->right == child) sibling = child_parent->left;  in ldns_rbtree_delete_fixup()
495 		else sibling = child_parent->right;  in ldns_rbtree_delete_fixup()
501 	if(child_parent->right == child)  in ldns_rbtree_delete_fixup()
508 		sibling->right->color = BLACK;  in ldns_rbtree_delete_fixup()
537 			node = node->right;  in ldns_rbtree_find_less_equal()
564 		for (node = rbtree->root; node->right != LDNS_RBTREE_NULL; node = node->right);  in ldns_rbtree_last()
578 	if (node->right != LDNS_RBTREE_NULL) {  in ldns_rbtree_next()
580 		for (node = node->right;  in ldns_rbtree_next()
585 		while (parent != LDNS_RBTREE_NULL && node == parent->right) {  in ldns_rbtree_next()
602 			node->right != LDNS_RBTREE_NULL;  in ldns_rbtree_previous()
603 			node = node->right);  in ldns_rbtree_previous()
660 	traverse_post(func, arg, node->right);  in traverse_post()