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

Lines Matching defs:other
17  *    documentation and/or other materials provided with the distribution.
331 	const unsigned int other = which ^ RB_DIR_OTHER;
351 	new_child->rb_nodes[which] = old_child->rb_nodes[other];
352 	new_father->rb_nodes[other] = new_child;
362 	 * change is that new_child's position is now on the other side.
375 	RB_SET_POSITION(new_child, other);
398 	unsigned int other;
418 		other = which ^ RB_DIR_OTHER;
419 		uncle = grandpa->rb_nodes[other];
462 	if (self == father->rb_nodes[other]) {
469 		rb_tree_reparent_nodes(rbt, father, other);
765 	 * Thus removing a red leaf doesn't require any other changes to a
822 		unsigned int other = which ^ RB_DIR_OTHER;
823 		struct rb_node *brother = parent->rb_nodes[other];
848 				rb_tree_reparent_nodes(rbt, parent, other);
849 				brother = parent->rb_nodes[other];
910 				RB_RED_P(brother->rb_nodes[other]));
911 			if (RB_BLACK_P(brother->rb_nodes[other])) {
925 				KASSERT(RB_FATHER(brother) == parent->rb_nodes[other]);
926 				brother = parent->rb_nodes[other];
927 				KASSERT(RB_RED_P(brother->rb_nodes[other]));
954 			KASSERT(RB_RED_P(brother->rb_nodes[other]));
955 			RB_MARK_BLACK(brother->rb_nodes[other]);
956 			rb_tree_reparent_nodes(rbt, parent, other);
967 	const unsigned int other = direction ^ RB_DIR_OTHER;
994 			if (other == RB_POSITION(self))
1007 	while (!RB_SENTINEL_P(self->rb_nodes[other]))
1008 		self = self->rb_nodes[other];
1017 	const unsigned int other = direction ^ RB_DIR_OTHER;
1041 			if (other == RB_POSITION(self))
1054 	while (!RB_SENTINEL_P(self->rb_nodes[other]))
1055 		self = self->rb_nodes[other];
1188 				const unsigned int other = which ^ RB_DIR_OTHER;
1192 				    self, other);
1195 				    relative0, other);
OpenGrok
