rb_parent          46 lib/util/rbtree.c #define RB_EMPTY_NODE(node)	(rb_parent(node) == node)
rb_parent          52 lib/util/rbtree.c 	struct rb_node *parent = rb_parent(node);
rb_parent          75 lib/util/rbtree.c 	struct rb_node *parent = rb_parent(node);
rb_parent          99 lib/util/rbtree.c 	while ((parent = rb_parent(node)) && rb_is_red(parent))
rb_parent         101 lib/util/rbtree.c 		gparent = rb_parent(parent);
rb_parent         182 lib/util/rbtree.c 				parent = rb_parent(node);
rb_parent         219 lib/util/rbtree.c 				parent = rb_parent(node);
rb_parent         263 lib/util/rbtree.c 		parent = rb_parent(node);
rb_parent         278 lib/util/rbtree.c 		if (rb_parent(old))
rb_parent         280 lib/util/rbtree.c 			if (rb_parent(old)->rb_left == old)
rb_parent         281 lib/util/rbtree.c 				rb_parent(old)->rb_left = node;
rb_parent         283 lib/util/rbtree.c 				rb_parent(old)->rb_right = node;
rb_parent         293 lib/util/rbtree.c 	parent = rb_parent(node);
rb_parent         344 lib/util/rbtree.c 	if (rb_parent(node) == node)
rb_parent         362 lib/util/rbtree.c 	while ((parent = rb_parent(node)) && node == parent->rb_right)
rb_parent         372 lib/util/rbtree.c 	if (rb_parent(node) == node)
rb_parent         386 lib/util/rbtree.c 	while ((parent = rb_parent(node)) && node == parent->rb_left)
rb_parent         395 lib/util/rbtree.c 	struct rb_node *parent = rb_parent(victim);