Home
last modified time | relevance | path

Searched defs:tree (Results 1 – 9 of 9) sorted by relevance

/unit/src/
H A Dnxt_rbtree.h51 #define nxt_rbtree_root(tree) \ argument
55 #define nxt_rbtree_sentinel(tree) \ argument
59 #define nxt_rbtree_is_empty(tree) \ argument
63 #define nxt_rbtree_min(tree) \ argument
68 nxt_rbtree_branch_min(nxt_rbtree_t *tree, nxt_rbtree_node_t *node) in nxt_rbtree_branch_min()
78 #define nxt_rbtree_is_there_successor(tree, node) \ argument
83 nxt_rbtree_node_successor(nxt_rbtree_t *tree, nxt_rbtree_node_t *node) in nxt_rbtree_node_successor()
H A Dnxt_rbtree.c29 #define nxt_rbtree_comparison_callback(tree) \ argument
34 nxt_rbtree_init(nxt_rbtree_t *tree, nxt_rbtree_compare_t compare) in nxt_rbtree_init()
60 nxt_rbtree_insert(nxt_rbtree_t *tree, nxt_rbtree_part_t *part) in nxt_rbtree_insert()
180 nxt_rbtree_find(nxt_rbtree_t *tree, nxt_rbtree_part_t *part) in nxt_rbtree_find()
214 nxt_rbtree_find_less_or_equal(nxt_rbtree_t *tree, nxt_rbtree_part_t *part) in nxt_rbtree_find_less_or_equal()
251 nxt_rbtree_find_greater_or_equal(nxt_rbtree_t *tree, nxt_rbtree_part_t *part) in nxt_rbtree_find_greater_or_equal()
288 nxt_rbtree_delete(nxt_rbtree_t *tree, nxt_rbtree_part_t *part) in nxt_rbtree_delete()
340 nxt_rbtree_delete_fixup(nxt_rbtree_t *tree, nxt_rbtree_node_t *node) in nxt_rbtree_delete_fixup()
503 nxt_rbtree_destroy_next(nxt_rbtree_t *tree, nxt_rbtree_node_t **next) in nxt_rbtree_destroy_next()
H A Dnxt_timer.c235 nxt_rbtree_t *tree; in nxt_timer_find() local
285 nxt_rbtree_t *tree; in nxt_timer_expire() local
H A Dnxt_timer.h63 nxt_rbtree_t tree; member
H A Dnxt_mp.c833 nxt_mp_find_block(nxt_rbtree_t *tree, const u_char *p) in nxt_mp_find_block()
/unit/src/test/
H A Dnxt_rbtree1_test.c12 #define nxt_rbtree1_is_empty(tree) \ argument
16 #define nxt_rbtree1_is_there_successor(tree, node) \ argument
21 nxt_rbtree1_node_successor(nxt_rbtree1_t *tree, nxt_rbtree1_node_t *node) in nxt_rbtree1_node_successor()
61 nxt_rbtree1_t tree; in nxt_rbtree1_test() local
226 nxt_rbtree1_test_find(nxt_rbtree1_t *tree, nxt_rbtree1_node_t *node) in nxt_rbtree1_test_find()
H A Dnxt_rbtree1.c25 nxt_rbtree1_insert(nxt_rbtree1_t *tree, nxt_rbtree1_node_t *node) in nxt_rbtree1_insert()
157 nxt_rbtree1_delete(nxt_rbtree1_t *tree, nxt_rbtree1_node_t *node) in nxt_rbtree1_delete()
H A Dnxt_rbtree1.h36 #define nxt_rbtree1_init(tree, s, i) \ argument
H A Dnxt_rbtree_test.c30 nxt_rbtree_t tree; in nxt_rbtree_test() local