158     struct archive_rb_node *self)  in __archive_rb_tree_insert_node()  argument
181 		const signed int diff = (*compare_nodes)(tmp, self);  in __archive_rb_tree_insert_node()
196 	RB_SET_FATHER(self, parent);  in __archive_rb_tree_insert_node()
197 	RB_SET_POSITION(self, position);  in __archive_rb_tree_insert_node()
199 		RB_MARK_BLACK(self);		/* root is always black */  in __archive_rb_tree_insert_node()
206 		RB_MARK_RED(self);  in __archive_rb_tree_insert_node()
209 	self->rb_left = parent->rb_nodes[position];  in __archive_rb_tree_insert_node()
210 	self->rb_right = parent->rb_nodes[position];  in __archive_rb_tree_insert_node()
211 	parent->rb_nodes[position] = self;  in __archive_rb_tree_insert_node()
217 		__archive_rb_tree_insert_rebalance(rbt, self);  in __archive_rb_tree_insert_node()
274     struct archive_rb_node *self)  in __archive_rb_tree_insert_rebalance()  argument
276 	struct archive_rb_node * father = RB_FATHER(self);  in __archive_rb_tree_insert_rebalance()
311 		self = grandpa;  in __archive_rb_tree_insert_rebalance()
312 		father = RB_FATHER(self);  in __archive_rb_tree_insert_rebalance()
324 	if (self == father->rb_nodes[other]) {  in __archive_rb_tree_insert_rebalance()
349     struct archive_rb_node *self, int rebalance)  in __archive_rb_tree_prune_node()  argument
351 	const unsigned int which = RB_POSITION(self);  in __archive_rb_tree_prune_node()
352 	struct archive_rb_node *father = RB_FATHER(self);  in __archive_rb_tree_prune_node()
358 	father->rb_nodes[which] = self->rb_left;  in __archive_rb_tree_prune_node()
372     struct archive_rb_node *self, struct archive_rb_node *standin)  in __archive_rb_tree_swap_prune_and_rebalance()  argument
380 	if (standin_father == self) {  in __archive_rb_tree_swap_prune_and_rebalance()
402 		if (standin_father != self) {  in __archive_rb_tree_swap_prune_and_rebalance()
411 	if (standin_father == self) {  in __archive_rb_tree_swap_prune_and_rebalance()
438 		standin->rb_nodes[standin_other] = self->rb_nodes[standin_other];  in __archive_rb_tree_swap_prune_and_rebalance()
451 	standin->rb_nodes[standin_other] = self->rb_nodes[standin_other];  in __archive_rb_tree_swap_prune_and_rebalance()
458 	RB_COPY_PROPERTIES(standin, self);  in __archive_rb_tree_swap_prune_and_rebalance()
459 	RB_SET_FATHER(standin, RB_FATHER(self));  in __archive_rb_tree_swap_prune_and_rebalance()
475     struct archive_rb_node *self, unsigned int which)  in __archive_rb_tree_prune_blackred_branch()  argument
477 	struct archive_rb_node *father = RB_FATHER(self);  in __archive_rb_tree_prune_blackred_branch()
478 	struct archive_rb_node *son = self->rb_nodes[which];  in __archive_rb_tree_prune_blackred_branch()
484 	RB_COPY_PROPERTIES(son, self);  in __archive_rb_tree_prune_blackred_branch()
493     struct archive_rb_node *self)  in __archive_rb_tree_remove_node()  argument
515 	if (RB_CHILDLESS_P(self)) {  in __archive_rb_tree_remove_node()
516 		const int rebalance = RB_BLACK_P(self) && !RB_ROOT_P(rbt, self);  in __archive_rb_tree_remove_node()
517 		__archive_rb_tree_prune_node(rbt, self, rebalance);  in __archive_rb_tree_remove_node()
520 	if (!RB_TWOCHILDREN_P(self)) {  in __archive_rb_tree_remove_node()
529 		which = RB_LEFT_SENTINEL_P(self) ? RB_DIR_RIGHT : RB_DIR_LEFT;  in __archive_rb_tree_remove_node()
530 		__archive_rb_tree_prune_blackred_branch(self, which);  in __archive_rb_tree_remove_node()
538 	which = RB_POSITION(self) ^ RB_DIR_OTHER;  in __archive_rb_tree_remove_node()
544 	standin = __archive_rb_tree_iterate(rbt, self, which);  in __archive_rb_tree_remove_node()
545 	__archive_rb_tree_swap_prune_and_rebalance(rbt, self, standin);  in __archive_rb_tree_remove_node()
676     struct archive_rb_node *self, const unsigned int direction)  in __archive_rb_tree_iterate()  argument
680 	if (self == NULL) {  in __archive_rb_tree_iterate()
681 		self = rbt->rbt_root;  in __archive_rb_tree_iterate()
682 		if (RB_SENTINEL_P(self))  in __archive_rb_tree_iterate()
684 		while (!RB_SENTINEL_P(self->rb_nodes[direction]))  in __archive_rb_tree_iterate()
685 			self = self->rb_nodes[direction];  in __archive_rb_tree_iterate()
686 		return self;  in __archive_rb_tree_iterate()
692 	if (RB_SENTINEL_P(self->rb_nodes[direction])) {  in __archive_rb_tree_iterate()
693 		while (!RB_ROOT_P(rbt, self)) {  in __archive_rb_tree_iterate()
694 			if (other == (unsigned int)RB_POSITION(self))  in __archive_rb_tree_iterate()
695 				return RB_FATHER(self);  in __archive_rb_tree_iterate()
696 			self = RB_FATHER(self);  in __archive_rb_tree_iterate()
705 	self = self->rb_nodes[direction];  in __archive_rb_tree_iterate()
706 	while (!RB_SENTINEL_P(self->rb_nodes[other]))  in __archive_rb_tree_iterate()
707 		self = self->rb_nodes[other];  in __archive_rb_tree_iterate()
708 	return self;  in __archive_rb_tree_iterate()