Searched refs:rbt_root (Results 1 – 3 of 3) sorted by relevance
44 a_type *rbt_root; \121 (a_rbt)->rbt_root = NULL; \345 return (rbtree->rbt_root == NULL); \350 rbtn_first(a_type, a_field, rbtree, rbtree->rbt_root, ret); \356 rbtn_last(a_type, a_field, rbtree, rbtree->rbt_root, ret); \366 a_type *tnode = rbtree->rbt_root; \391 a_type *tnode = rbtree->rbt_root; \413 ret = rbtree->rbt_root; \427 a_type *tnode = rbtree->rbt_root; \446 a_type *tnode = rbtree->rbt_root; \[all …]
71 #define RB_ROOT_P(rbt, rb) ((rbt)->rbt_root == (rb))99 *((struct archive_rb_node **)&rbt->rbt_root) = RB_SENTINEL_NODE; in __archive_rb_tree_init()106 struct archive_rb_node *parent = rbt->rbt_root; in __archive_rb_tree_find_node()122 struct archive_rb_node *parent = rbt->rbt_root; in __archive_rb_tree_find_node_geq()141 struct archive_rb_node *parent = rbt->rbt_root; in __archive_rb_tree_find_node_leq()165 tmp = rbt->rbt_root; in __archive_rb_tree_insert_node()174 parent = (struct archive_rb_node *)(void *)&rbt->rbt_root; in __archive_rb_tree_insert_node()198 if (parent == (struct archive_rb_node *)(void *)&rbt->rbt_root) { in __archive_rb_tree_insert_node()344 RB_MARK_BLACK(rbt->rbt_root); in __archive_rb_tree_insert_rebalance()681 self = rbt->rbt_root; in __archive_rb_tree_iterate()
94 struct archive_rb_node *rbt_root; member