Lines Matching refs:tree
12 #define nxt_rbtree1_is_empty(tree) \ argument
13 (((tree)->root) == (tree)->sentinel)
16 #define nxt_rbtree1_is_there_successor(tree, node) \ argument
17 ((node) != (tree)->sentinel)
21 nxt_rbtree1_node_successor(nxt_rbtree1_t *tree, nxt_rbtree1_node_t *node) in nxt_rbtree1_node_successor() argument
25 if (node->right != tree->sentinel) { in nxt_rbtree1_node_successor()
26 return nxt_rbtree1_min(node->right, tree->sentinel); in nxt_rbtree1_node_successor()
33 return tree->sentinel; in nxt_rbtree1_node_successor()
51 static nxt_rbtree1_node_t *nxt_rbtree1_test_find(nxt_rbtree1_t *tree,
61 nxt_rbtree1_t tree; in nxt_rbtree1_test() local
68 nxt_rbtree1_init(&tree, &sentinel, nxt_rbtree1_test_insert_value); in nxt_rbtree1_test()
96 nxt_rbtree1_insert(&tree, &nodes[i]); in nxt_rbtree1_test()
100 if (nxt_rbtree1_test_find(&tree, &nodes[i]) != &nodes[i]) { in nxt_rbtree1_test()
108 node = nxt_rbtree1_min(tree.root, tree.sentinel); in nxt_rbtree1_test()
110 while (nxt_rbtree1_is_there_successor(&tree, node)) { in nxt_rbtree1_test()
119 node = nxt_rbtree1_node_successor(&tree, node); in nxt_rbtree1_test()
128 nxt_rbtree1_delete(&tree, &nodes[i]); in nxt_rbtree1_test()
135 if (!nxt_rbtree1_is_empty(&tree)) { in nxt_rbtree1_test()
226 nxt_rbtree1_test_find(nxt_rbtree1_t *tree, nxt_rbtree1_node_t *node) in nxt_rbtree1_test_find() argument
231 next = tree->root; in nxt_rbtree1_test_find()
232 sentinel = tree->sentinel; in nxt_rbtree1_test_find()