65     const ib_rbt_t *tree) /*!< in: tree to verfify */  in rbt_check_ordering()
97     const ib_rbt_t *tree,      /*!< in: tree to verify */  in rbt_count_black_nodes()
196 static ib_rbt_node_t *rbt_tree_add_child(const ib_rbt_t *tree,  in rbt_tree_add_child()
217 static ib_rbt_node_t *rbt_tree_insert(ib_rbt_t *tree, const void *key,  in rbt_tree_insert()
252     const ib_rbt_t *tree, /*!< in: tree to balance */  in rbt_balance_tree()
335     const ib_rbt_t *tree,         /*!< in: rb tree */  in rbt_find_successor()
370     const ib_rbt_t *tree,         /*!< in: rb tree */  in rbt_find_predecessor()
447     const ib_rbt_t *tree, /*!< in: rb tree */  in rbt_detach_node()
591     ib_rbt_t *tree,      /*!< in: rb tree */  in rbt_remove_node_and_rebalance()
646 void rbt_free(ib_rbt_t *tree) /*!< in: rb tree to free */  in rbt_free()
661   ib_rbt_t *tree;  in rbt_create_arg_cmp()  local
677   ib_rbt_t *tree;  in rbt_create()  local
705     ib_rbt_t *tree,    /*!< in: rb tree */  in rbt_insert()
729 const ib_rbt_node_t *rbt_add_node(ib_rbt_t *tree,         /*!< in: rb tree */  in rbt_add_node()
763     const ib_rbt_t *tree, /*!< in: rb tree */  in rbt_lookup()
792 ibool rbt_delete(ib_rbt_t *tree,  /*!< in: rb tree */  in rbt_delete()
812     ib_rbt_t *tree,                  /*!< in: rb tree */  in rbt_remove_node()
833     const ib_rbt_t *tree, /*!< in: rb tree */  in rbt_lower_bound()
869     const ib_rbt_t *tree, /*!< in: rb tree */  in rbt_upper_bound()
902 int rbt_search(const ib_rbt_t *tree,   /*!< in: rb tree */  in rbt_search()
937 int rbt_search_cmp(const ib_rbt_t *tree,   /*!< in: rb tree */  in rbt_search_cmp()
975     const ib_rbt_t *tree) /* in: rb tree */  in rbt_first()
990 const ib_rbt_node_t *rbt_last(const ib_rbt_t *tree) /*!< in: rb tree */  in rbt_last()
1006     const ib_rbt_t *tree,         /*!< in: rb tree */  in rbt_next()
1015     const ib_rbt_t *tree,         /*!< in: rb tree */  in rbt_prev()
1048 ibool rbt_validate(const ib_rbt_t *tree) /*!< in: RB tree to validate */  in rbt_validate()