8 #define smaller(root, a, b) (root->cmp((a)->value, (b)->value) == -1)
9 #define equal(root, a, b) (root->cmp((a)->value, (b)->value) == 0)
10 #define greater(root, a, b) (root->cmp((a)->value, (b)->value) == 1)
20 … *bt_create_tree(struct bt_node_t *node, int (*cmp)(void *a, void *b), int (*release)(void *value))  in bt_create_tree()  argument
43 …create_node(struct bt_node_t *left, struct bt_node_t *right, struct bt_node_t *parent, void *value)  in bt_create_node()  argument
51     node->value = value;  in bt_create_node()
65 int bt_insert(struct bt_root_t *root, void *value)  in bt_insert()  argument
72     struct bt_node_t *insert_node = bt_create_node(NULL, NULL, NULL, value);  in bt_insert()
108 int bt_query(struct bt_root_t *root, void *value, uint64_t *ret_addr)  in bt_query()  argument
112     tmp_node.value = value;  in bt_query()
153 int bt_delete(struct bt_root_t *root, void *value)  in bt_delete()  argument
159     retval = bt_query(root, value, &tmp_addr);  in bt_delete()
171         root->release(this_node->value);  in bt_delete()
172         this_node->value = to_delete->value;  in bt_delete()
227         root->release(nd->value);  in bt_destroy_tree()