Home
last modified time | relevance | path

Searched refs:bt_node_t (Results 1 – 3 of 3) sorted by relevance

/DragonOS-0.1.2/kernel/src/common/
Dbitree.h4 struct bt_node_t struct
6 struct bt_node_t *left; argument
7 struct bt_node_t *right; argument
8 struct bt_node_t *parent; argument
15 struct bt_node_t *bt_node; argument
33 struct bt_root_t *bt_create_tree(struct bt_node_t *node, int (*cmp)(void *a, void *b), int (*releas…
43 struct bt_node_t *bt_create_node(struct bt_node_t *left, struct bt_node_t *right, struct bt_node_t
/DragonOS-0.1.2/kernel/src/libs/
Dbitree.c20 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()
[all …]
/DragonOS-0.1.2/kernel/src/ktest/
Dtest-bitree.c42 struct bt_node_t *rn = bt_create_node(NULL, NULL, NULL, tv1); in ktest_bitree_case1()
81 struct bt_node_t *node2; in ktest_bitree_case1()
100 struct bt_node_t *node_not_exists; in ktest_bitree_case1()