Home
last modified time | relevance | path

Searched refs:sentinel (Results 1 – 9 of 9) sorted by relevance

/unit/src/test/
H A Dnxt_rbtree1.c32 sentinel = tree->sentinel; in nxt_rbtree1_insert()
34 if (*root == sentinel) { in nxt_rbtree1_insert()
36 node->left = sentinel; in nxt_rbtree1_insert()
37 node->right = sentinel; in nxt_rbtree1_insert()
106 if (*p == sentinel) { in nxt_rbtree1_insert_value()
115 node->left = sentinel; in nxt_rbtree1_insert_value()
116 node->right = sentinel; in nxt_rbtree1_insert_value()
141 if (*p == sentinel) { in nxt_rbtree1_insert_timer_value()
150 node->left = sentinel; in nxt_rbtree1_insert_timer_value()
151 node->right = sentinel; in nxt_rbtree1_insert_timer_value()
[all …]
H A Dnxt_rbtree1.h27 nxt_rbtree1_node_t *node, nxt_rbtree1_node_t *sentinel);
31 nxt_rbtree1_node_t *sentinel; member
39 (tree)->sentinel = s; \
48 nxt_rbtree1_node_t *node, nxt_rbtree1_node_t *sentinel);
50 nxt_rbtree1_node_t *node, nxt_rbtree1_node_t *sentinel);
66 nxt_rbtree1_min(nxt_rbtree1_node_t *node, nxt_rbtree1_node_t *sentinel) in nxt_rbtree1_min() argument
68 while (node->left != sentinel) { in nxt_rbtree1_min()
H A Dnxt_rbtree1_test.c13 (((tree)->root) == (tree)->sentinel)
17 ((node) != (tree)->sentinel)
25 if (node->right != tree->sentinel) { in nxt_rbtree1_node_successor()
33 return tree->sentinel; in nxt_rbtree1_node_successor()
62 nxt_rbtree1_node_t *node, *nodes, sentinel; in nxt_rbtree1_test() local
169 if (*p == sentinel) { in nxt_rbtree1_test_insert_value()
178 node->left = sentinel; in nxt_rbtree1_test_insert_value()
179 node->right = sentinel; in nxt_rbtree1_test_insert_value()
229 nxt_rbtree1_node_t *next, *sentinel; in nxt_rbtree1_test_find() local
232 sentinel = tree->sentinel; in nxt_rbtree1_test_find()
[all …]
H A Dnxt_rbtree_test.c40 mark = tree.sentinel.right; in nxt_rbtree_test()
118 if (mark != tree.sentinel.right) { in nxt_rbtree_test()
/unit/src/
H A Dnxt_rbtree.c46 tree->sentinel.left = &tree->sentinel; in nxt_rbtree_init()
68 sentinel = nxt_rbtree_sentinel(tree); in nxt_rbtree_insert()
70 new_node->left = sentinel; in nxt_rbtree_insert()
71 new_node->right = sentinel; in nxt_rbtree_insert()
77 while (*child != sentinel) { in nxt_rbtree_insert()
189 sentinel = nxt_rbtree_sentinel(tree); in nxt_rbtree_find()
192 while (next != sentinel) { in nxt_rbtree_find()
227 while (next != sentinel) { in nxt_rbtree_find_less_or_equal()
264 while (next != sentinel) { in nxt_rbtree_find_greater_or_equal()
298 if (node->left == sentinel) { in nxt_rbtree_delete()
[all …]
H A Dnxt_rbtree.h38 nxt_rbtree_node_t sentinel; member
52 ((tree)->sentinel.left)
56 (&(tree)->sentinel)
64 nxt_rbtree_branch_min(tree, &(tree)->sentinel)
H A Dnxt_file_cache.c100 nxt_file_cache_node_t *node, *sentinel; in nxt_file_cache_query_locked() local
105 sentinel = nxt_file_cache_node_alloc(cache); in nxt_file_cache_query_locked()
107 if (nxt_slow_path(sentinel == NULL)) { in nxt_file_cache_query_locked()
111 sentinel->key_data = q->key_data; in nxt_file_cache_query_locked()
112 sentinel->key_len = q->key_len; in nxt_file_cache_query_locked()
113 hkey->value = sentinel; in nxt_file_cache_query_locked()
125 q->node = sentinel; in nxt_file_cache_query_locked()
126 sentinel->updating = 1; in nxt_file_cache_query_locked()
130 nxt_cache_node_free(cache, sentinel, 1); in nxt_file_cache_query_locked()
H A Dnxt_cache.c206 nxt_cache_node_t *node, *sentinel; in nxt_cache_node_hold() local
212 sentinel = nxt_cache_node_alloc(cache); in nxt_cache_node_hold()
214 if (nxt_slow_path(sentinel == NULL)) { in nxt_cache_node_hold()
218 sentinel->key_data = q->key_data; in nxt_cache_node_hold()
219 sentinel->key_len = q->key_len; in nxt_cache_node_hold()
220 lhq->value = sentinel; in nxt_cache_node_hold()
231 q->node = sentinel; in nxt_cache_node_hold()
232 sentinel->updating = 1; in nxt_cache_node_hold()
236 nxt_cache_node_free(cache, sentinel, 1); in nxt_cache_node_hold()
H A Dnxt_mp.c836 nxt_rbtree_node_t *node, *sentinel; in nxt_mp_find_block() local
839 sentinel = nxt_rbtree_sentinel(tree); in nxt_mp_find_block()
841 while (node != sentinel) { in nxt_mp_find_block()