Cross Reference: /src/common/lib/libc/gen/rbtree.c

Lines Matching defs:other
17  *    documentation and/or other materials provided with the distribution.
340 	const unsigned int other = which ^ RB_DIR_OTHER;
360 	new_child->rb_nodes[which] = old_child->rb_nodes[other];
361 	new_father->rb_nodes[other] = new_child;
371 	 * change is that new_child's position is now on the other side.
384 	RB_SET_POSITION(new_child, other);
407 	unsigned int other;
427 		other = which ^ RB_DIR_OTHER;
428 		uncle = grandpa->rb_nodes[other];
471 	if (self == father->rb_nodes[other]) {
478 		rb_tree_reparent_nodes(rbt, father, other);
774 	 * Thus removing a red leaf doesn't require any other changes to a
831 		unsigned int other = which ^ RB_DIR_OTHER;
832 		struct rb_node *brother = parent->rb_nodes[other];
857 				rb_tree_reparent_nodes(rbt, parent, other);
858 				brother = parent->rb_nodes[other];
919 				RB_RED_P(brother->rb_nodes[other]));
920 			if (RB_BLACK_P(brother->rb_nodes[other])) {
934 				KASSERT(RB_FATHER(brother) == parent->rb_nodes[other]);
935 				brother = parent->rb_nodes[other];
936 				KASSERT(RB_RED_P(brother->rb_nodes[other]));
963 			KASSERT(RB_RED_P(brother->rb_nodes[other]));
964 			RB_MARK_BLACK(brother->rb_nodes[other]);
965 			rb_tree_reparent_nodes(rbt, parent, other);
976 	const unsigned int other = direction ^ RB_DIR_OTHER;
1003 			if (other == RB_POSITION(self))
1016 	while (!RB_SENTINEL_P(self->rb_nodes[other]))
1017 		self = self->rb_nodes[other];
1026 	const unsigned int other = direction ^ RB_DIR_OTHER;
1050 			if (other == RB_POSITION(self))
1063 	while (!RB_SENTINEL_P(self->rb_nodes[other]))
1064 		self = self->rb_nodes[other];
1197 				const unsigned int other = which ^ RB_DIR_OTHER;
1201 				    self, other);
1204 				    relative0, other);
OpenGrok
