rb_node            29 lib/util/rbtree.c #define rb_parent(r)   ((struct rb_node *)((r)->rb_parent_color & ~3))
rb_node            45 lib/util/rbtree.c #define RB_EMPTY_ROOT(root)	((root)->rb_node == NULL)
rb_node            51 lib/util/rbtree.c 	struct rb_node *right = node->rb_right;
rb_node            52 lib/util/rbtree.c 	struct rb_node *parent = rb_parent(node);
rb_node            68 lib/util/rbtree.c 		root->rb_node = right;
rb_node            74 lib/util/rbtree.c 	struct rb_node *left = node->rb_left;
rb_node            75 lib/util/rbtree.c 	struct rb_node *parent = rb_parent(node);
rb_node            91 lib/util/rbtree.c 		root->rb_node = left;
rb_node            97 lib/util/rbtree.c 	struct rb_node *parent, *gparent;
rb_node           106 lib/util/rbtree.c 				register struct rb_node *uncle = gparent->rb_right;
rb_node           119 lib/util/rbtree.c 				register struct rb_node *tmp;
rb_node           131 lib/util/rbtree.c 				register struct rb_node *uncle = gparent->rb_left;
rb_node           144 lib/util/rbtree.c 				register struct rb_node *tmp;
rb_node           157 lib/util/rbtree.c 	rb_set_black(root->rb_node);
rb_node           163 lib/util/rbtree.c 	struct rb_node *other;
rb_node           165 lib/util/rbtree.c 	while ((!node || rb_is_black(node)) && node != root->rb_node)
rb_node           188 lib/util/rbtree.c 					struct rb_node *o_left;
rb_node           200 lib/util/rbtree.c 				node = root->rb_node;
rb_node           225 lib/util/rbtree.c 					register struct rb_node *o_right;
rb_node           237 lib/util/rbtree.c 				node = root->rb_node;
rb_node           248 lib/util/rbtree.c 	struct rb_node *child, *parent;
rb_node           257 lib/util/rbtree.c 		struct rb_node *old = node, *left;
rb_node           285 lib/util/rbtree.c 			root->rb_node = node;
rb_node           306 lib/util/rbtree.c 		root->rb_node = child;
rb_node           316 lib/util/rbtree.c struct rb_node *rb_first(struct rb_root *root)
rb_node           318 lib/util/rbtree.c 	struct rb_node	*n;
rb_node           320 lib/util/rbtree.c 	n = root->rb_node;
rb_node           328 lib/util/rbtree.c struct rb_node *rb_last(struct rb_root *root)
rb_node           330 lib/util/rbtree.c 	struct rb_node	*n;
rb_node           332 lib/util/rbtree.c 	n = root->rb_node;
rb_node           340 lib/util/rbtree.c struct rb_node *rb_next(struct rb_node *node)
rb_node           342 lib/util/rbtree.c 	struct rb_node *parent;
rb_node           368 lib/util/rbtree.c struct rb_node *rb_prev(struct rb_node *node)
rb_node           370 lib/util/rbtree.c 	struct rb_node *parent;
rb_node           395 lib/util/rbtree.c 	struct rb_node *parent = rb_parent(victim);
rb_node           404 lib/util/rbtree.c 		root->rb_node = new_node;
rb_node           100 lib/util/rbtree.h 	struct rb_node *rb_right;
rb_node           101 lib/util/rbtree.h 	struct rb_node *rb_left;
rb_node           106 lib/util/rbtree.h 	struct rb_node *rb_node;
rb_node           120 lib/util/rbtree.h struct rb_node *rb_next(struct rb_node *);
rb_node           121 lib/util/rbtree.h struct rb_node *rb_prev(struct rb_node *);
rb_node           122 lib/util/rbtree.h struct rb_node *rb_first(struct rb_root *);
rb_node           123 lib/util/rbtree.h struct rb_node *rb_last(struct rb_root *);
rb_node            37 source3/lib/dbwrap_rbt.c 	struct rb_node rb_node;
rb_node            55 source3/lib/dbwrap_rbt.c 		((char *)node - offsetof(struct db_rbt_node, rb_node));
rb_node            95 source3/lib/dbwrap_rbt.c 	struct rb_node ** p;
rb_node            96 source3/lib/dbwrap_rbt.c 	struct rb_node * parent;
rb_node           126 source3/lib/dbwrap_rbt.c 		rb_erase(&rec_priv->node->rb_node, &rec_priv->db_ctx->tree);
rb_node           143 source3/lib/dbwrap_rbt.c 	ZERO_STRUCT(node->rb_node);
rb_node           156 source3/lib/dbwrap_rbt.c 	p = &rec_priv->db_ctx->tree.rb_node;
rb_node           182 source3/lib/dbwrap_rbt.c 	rb_link_node(&node->rb_node, parent, p);
rb_node           183 source3/lib/dbwrap_rbt.c 	rb_insert_color(&node->rb_node, &rec_priv->db_ctx->tree);
rb_node           196 source3/lib/dbwrap_rbt.c 	rb_erase(&rec_priv->node->rb_node, &rec_priv->db_ctx->tree);
rb_node           211 source3/lib/dbwrap_rbt.c 	struct rb_node *n;
rb_node           217 source3/lib/dbwrap_rbt.c 	n = ctx->tree.rb_node;
rb_node           293 source3/lib/dbwrap_rbt.c 	struct rb_node *n;
rb_node           299 source3/lib/dbwrap_rbt.c 	n = ctx->tree.rb_node;
rb_node            26 source3/lib/memcache.c 	struct rb_node rb_node;
rb_node            93 source3/lib/memcache.c 		((char *)node - offsetof(struct memcache_element, rb_node));
rb_node           128 source3/lib/memcache.c 	struct rb_node *node;
rb_node           130 source3/lib/memcache.c 	node = cache->tree.rb_node;
rb_node           202 source3/lib/memcache.c 	rb_erase(&e->rb_node, &cache->tree);
rb_node           259 source3/lib/memcache.c 	struct rb_node **p;
rb_node           260 source3/lib/memcache.c 	struct rb_node *parent;
rb_node           317 source3/lib/memcache.c 	p = &cache->tree.rb_node;
rb_node           330 source3/lib/memcache.c 	rb_link_node(&e->rb_node, parent, p);
rb_node           331 source3/lib/memcache.c 	rb_insert_color(&e->rb_node, &cache->tree);
rb_node           361 source3/lib/memcache.c 	struct rb_node *node;
rb_node           374 source3/lib/memcache.c 	node = cache->tree.rb_node;
rb_node           385 source3/lib/memcache.c 		struct rb_node *next;
rb_node           412 source3/lib/memcache.c 		struct rb_node *prev = rb_prev(node);
rb_node           427 source3/lib/memcache.c 		struct rb_node *next = rb_next(node);