20 struct bt_root_t *bt_create_tree(struct bt_node_t *node, int (*cmp)(void *a, void *b), int (*releas…  in bt_create_tree()
43 struct bt_node_t *bt_create_node(struct bt_node_t *left, struct bt_node_t *right, struct bt_node_t …  in bt_create_node()
45     struct bt_node_t *node = (struct bt_node_t *)kmalloc(sizeof(struct bt_node_t), 0);  in bt_create_node()
47     memset((void *)node, 0, sizeof(struct bt_node_t));  in bt_create_node()
70     struct bt_node_t *this_node = root->bt_node;  in bt_insert()
71     struct bt_node_t *last_node = NULL;  in bt_insert()
72     struct bt_node_t *insert_node = bt_create_node(NULL, NULL, NULL, value);  in bt_insert()
110     struct bt_node_t *this_node = root->bt_node;  in bt_query()
111     struct bt_node_t tmp_node = {0};  in bt_query()
139 static struct bt_node_t *bt_get_minimum(struct bt_node_t *this_node)  in bt_get_minimum()
163     struct bt_node_t *this_node = (struct bt_node_t *)tmp_addr;  in bt_delete()
164     struct bt_node_t *to_delete = NULL, *to_delete_son = NULL;  in bt_delete()
209     kfifo_alloc(&fifo, ((root->size + 1) / 2) * sizeof(struct bt_node_t *), 0);  in bt_destroy_tree()
210     kfifo_in(&fifo, (void *)&(root->bt_node), sizeof(struct bt_node_t *));  in bt_destroy_tree()
216         struct bt_node_t *nd;  in bt_destroy_tree()
221             kfifo_in(&fifo, (void *)&(nd->left), sizeof(struct bt_node_t *));  in bt_destroy_tree()
224             kfifo_in(&fifo, (void *)&(nd->right), sizeof(struct bt_node_t *));  in bt_destroy_tree()