Searched refs:rbt_root (Results 1 – 3 of 3) sorted by relevance
48 a_type *rbt_root; \125 (a_rbt)->rbt_root = NULL; \370 a_type *tnode = rbtree->rbt_root; \417 ret = rbtree->rbt_root; \606 rbtree->rbt_root = left; \619 rbtree->rbt_root = NULL; \706 rbtree->rbt_root = tnode; \779 rbtree->rbt_root = tnode; \848 rbtree->rbt_root = tnode; \976 rbtree->rbt_root, cb, arg); \[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