Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 26) sorted by relevance

12

/unit/src/test/
H A Dnxt_rbtree1.c50 if (node->parent == node->parent->parent->left) { in nxt_rbtree1_insert()
57 node = node->parent->parent; in nxt_rbtree1_insert()
60 if (node == node->parent->right) { in nxt_rbtree1_insert()
61 node = node->parent; in nxt_rbtree1_insert()
77 node = node->parent->parent; in nxt_rbtree1_insert()
80 if (node == node->parent->left) { in nxt_rbtree1_insert()
81 node = node->parent; in nxt_rbtree1_insert()
113 *p = node; in nxt_rbtree1_insert_value()
229 if (node == node->parent->left) { in nxt_rbtree1_delete()
343 } else if (node == node->parent->left) { in nxt_rbtree1_left_rotate()
[all …]
H A Dnxt_rbtree1.h27 nxt_rbtree1_node_t *node, nxt_rbtree1_node_t *sentinel);
44 nxt_rbtree1_node_t *node);
46 nxt_rbtree1_node_t *node);
53 #define nxt_rbtree1_red(node) ((node)->color = 1) argument
54 #define nxt_rbtree1_black(node) ((node)->color = 0) argument
55 #define nxt_rbtree1_is_red(node) ((node)->color) argument
56 #define nxt_rbtree1_is_black(node) (!nxt_rbtree1_is_red(node)) argument
62 #define nxt_rbtree1_sentinel_init(node) nxt_rbtree1_black(node) argument
68 while (node->left != sentinel) { in nxt_rbtree1_min()
69 node = node->left; in nxt_rbtree1_min()
[all …]
H A Dnxt_rbtree1_test.c17 ((node) != (tree)->sentinel)
30 parent = node->parent; in nxt_rbtree1_node_successor()
36 if (node == parent->left) { in nxt_rbtree1_node_successor()
40 node = parent; in nxt_rbtree1_node_successor()
52 nxt_rbtree1_node_t *node);
119 node = nxt_rbtree1_node_successor(&tree, node); in nxt_rbtree1_test()
176 *p = node; in nxt_rbtree1_test_insert_value()
177 node->parent = temp; 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()
[all …]
H A Dnxt_rbtree_test.c12 NXT_RBTREE_NODE (node);
31 nxt_rbtree_node_t *node; in nxt_rbtree_test() local
68 nxt_rbtree_insert(&tree, &items[i].node); in nxt_rbtree_test()
72 node = nxt_rbtree_find(&tree, &items[i].node); in nxt_rbtree_test()
74 if (node != (nxt_rbtree_node_t *) &items[i].node) { in nxt_rbtree_test()
82 node = nxt_rbtree_min(&tree); in nxt_rbtree_test()
86 item = (nxt_rbtree_test_t *) node; in nxt_rbtree_test()
95 node = nxt_rbtree_node_successor(&tree, node); in nxt_rbtree_test()
104 nxt_rbtree_delete(&tree, &items[i].node); in nxt_rbtree_test()
232 nxt_rbtree_insert(&mb_tree, &mb_nodes[n].node); in nxt_rbtree_mb_start()
[all …]
/unit/src/
H A Dnxt_rbtree.c18 nxt_rbtree_node_t *node);
22 nxt_rbtree_node_t *node);
78 node = *child; in nxt_rbtree_insert()
83 child = (compare(new_node, node) < 0) ? &node->left : &node->right; in nxt_rbtree_insert()
295 subst = node; in nxt_rbtree_delete()
328 node->left = NULL; in nxt_rbtree_delete()
329 node->right = NULL; in nxt_rbtree_delete()
456 child->left = node; in nxt_rbtree_left_rotate()
469 child = node->left; in nxt_rbtree_right_rotate()
510 for (node = *next; node->left != sentinel; node = node->left); in nxt_rbtree_destroy_next()
[all …]
H A Dnxt_rbtree.h31 uint8_t node##_color
71 node = node->left; in nxt_rbtree_branch_min()
74 return node; in nxt_rbtree_branch_min()
79 ((node) != nxt_rbtree_sentinel(tree))
87 if (node->right != nxt_rbtree_sentinel(tree)) { in nxt_rbtree_node_successor()
92 parent = node->parent; in nxt_rbtree_node_successor()
98 if (node == parent->left) { in nxt_rbtree_node_successor()
102 node = parent; in nxt_rbtree_node_successor()
111 nxt_rbtree_part_t *node);
113 nxt_rbtree_part_t *node);
[all …]
H A Dnxt_file_cache.c57 node = data; in nxt_file_cache_lvlhsh_test()
59 if (nxt_strmem_eq(&hkey->key, node->key_data, node->key_len)) { in nxt_file_cache_lvlhsh_test()
139 node->count++; in nxt_file_cache_query_locked()
140 q->node = node; in nxt_file_cache_query_locked()
189 node = q->node; in nxt_cache_node_test()
321 return node; in nxt_cache_node_alloc()
330 return node; in nxt_cache_node_alloc()
410 hkey.key_hash = nxt_murmur_hash2(node->key_data, node->key_len);
414 node->count = 1;
461 node->count--; in nxt_cache_node_release_locked()
[all …]
H A Dnxt_cache.c101 node = data; in nxt_cache_lvlhsh_test()
103 if (nxt_str_eq(&lhq->key, node->key_data, node->key_len)) { in nxt_cache_lvlhsh_test()
185 node->count++; in nxt_cache_query_locked()
186 q->node = node; in nxt_cache_query_locked()
245 node->count++; in nxt_cache_node_hold()
246 q->node = node; in nxt_cache_node_hold()
294 node = q->node; in nxt_cache_node_test()
416 node = q->node; in nxt_cache_update()
518 node = q->node; in nxt_cache_release_locked()
519 node->count--; in nxt_cache_release_locked()
[all …]
H A Dnxt_job_file_cache.c12 nxt_cache_node_t node; member
20 nxt_file_cache_node_t *node; in nxt_job_file_cache_read() local
22 node = nxt_cache_find(cache); in nxt_job_file_cache_read()
24 if (node != NULL) { in nxt_job_file_cache_read()
26 if (node->fd != -1) { in nxt_job_file_cache_read()
31 if (node->error != 0) { in nxt_job_file_cache_read()
36 if (node->accessed + 60 > nxt_thread_time()) { in nxt_job_file_cache_read()
H A Dnxt_timer.c236 nxt_rbtree_node_t *node, *next; in nxt_timer_find() local
246 for (node = nxt_rbtree_min(tree); in nxt_timer_find()
247 nxt_rbtree_is_there_successor(tree, node); in nxt_timer_find()
248 node = next) in nxt_timer_find()
252 timer = (nxt_timer_t *) node; in nxt_timer_find()
286 nxt_rbtree_node_t *node, *next; in nxt_timer_expire() local
301 for (node = nxt_rbtree_min(tree); in nxt_timer_expire()
302 nxt_rbtree_is_there_successor(tree, node); in nxt_timer_expire()
303 node = next) in nxt_timer_expire()
305 timer = (nxt_timer_t *) node; in nxt_timer_expire()
[all …]
H A Dnxt_timer.h26 NXT_RBTREE_NODE (node);
86 ((timer)->node.parent != NULL)
92 (timer)->node.parent = NULL
H A Dnxt_mem_zone.c67 NXT_RBTREE_NODE (node);
203 nxt_rbtree_insert(&zone->free_pages, &block->node); in nxt_mem_zone_init()
667 nxt_rbtree_delete(&zone->free_pages, &block->node); in nxt_mem_zone_alloc_pages()
679 nxt_rbtree_insert(&zone->free_pages, &block->node); in nxt_mem_zone_alloc_pages()
692 nxt_rbtree_insert(&zone->free_pages, &next_block->node); in nxt_mem_zone_alloc_pages()
733 if (node == nxt_rbtree_sentinel(&zone->free_pages)) { in nxt_mem_zone_find_free_block()
737 block = (nxt_mem_zone_free_block_t *) node; in nxt_mem_zone_find_free_block()
765 return nxt_mem_zone_find_free_block(zone, block->node.right, in nxt_mem_zone_find_free_block()
924 nxt_rbtree_delete(&zone->free_pages, &next_block->node); in nxt_mem_zone_free_pages()
937 nxt_rbtree_delete(&zone->free_pages, &prev_block->node); in nxt_mem_zone_free_pages()
[all …]
H A Dnxt_mp.c90 NXT_RBTREE_NODE (node);
314 nxt_rbtree_node_t *node, *next; in nxt_mp_destroy() local
334 block = (nxt_mp_block_t *) node; in nxt_mp_destroy()
702 nxt_rbtree_insert(&mp->blocks, &cluster->node); in nxt_mp_alloc_cluster()
757 nxt_rbtree_insert(&mp->blocks, &block->node); in nxt_mp_alloc_large()
836 nxt_rbtree_node_t *node, *sentinel; in nxt_mp_find_block() local
838 node = nxt_rbtree_root(tree); in nxt_mp_find_block()
841 while (node != sentinel) { in nxt_mp_find_block()
843 block = (nxt_mp_block_t *) node; in nxt_mp_find_block()
846 node = node->left; in nxt_mp_find_block()
[all …]
H A Dnxt_cache.h105 nxt_cache_node_t *node; member
H A Dnxt_conf.c816 nxt_conf_value_t *node; in nxt_conf_op_compile() local
843 node = nxt_conf_get_object_member(root, &token, &op->index); in nxt_conf_op_compile()
855 node = nxt_conf_get_array_element(root, index); in nxt_conf_op_compile()
859 node = NULL; in nxt_conf_op_compile()
866 if (node == NULL) { in nxt_conf_op_compile()
871 root = node; in nxt_conf_op_compile()
876 if (node == NULL) { in nxt_conf_op_compile()
886 if (node == NULL) { in nxt_conf_op_compile()
890 if (node->type != NXT_CONF_VALUE_ARRAY) { in nxt_conf_op_compile()
903 op->index = node->u.array->count; in nxt_conf_op_compile()
[all …]
/unit/src/java/nginx/unit/
H A DJspPropertyGroup.java31 Node node = nodes.item(i); in JspPropertyGroup() local
32 String tag_name = node.getNodeName(); in JspPropertyGroup()
35 url_patterns_.add(node.getTextContent().trim()); in JspPropertyGroup()
40 el_ignored_ = node.getTextContent().trim(); in JspPropertyGroup()
45 page_encoding_ = node.getTextContent().trim(); in JspPropertyGroup()
50 scripting_invalid_ = node.getTextContent().trim(); in JspPropertyGroup()
55 is_xml_ = node.getTextContent().trim(); in JspPropertyGroup()
60 include_preludes_.add(node.getTextContent().trim()); in JspPropertyGroup()
65 include_codas_.add(node.getTextContent().trim()); in JspPropertyGroup()
80 default_content_type_ = node.getTextContent().trim(); in JspPropertyGroup()
[all …]
H A DTaglib.java16 Node node = nodes.item(i); in Taglib() local
17 String tag_name = node.getNodeName(); in Taglib()
20 uri_ = node.getTextContent().trim(); in Taglib()
25 location_ = node.getTextContent().trim(); in Taglib()
H A DContext.java1159 Node node = files.item(j); in processWebXml() local
1160 String wf = node.getTextContent().trim(); in processWebXml()
/unit/auto/modules/
H A Dnodejs23 --node=FILE set node executable
25 --node-gyp=FILE set node-gyp executable
54 NXT_NODE=${NXT_NODE=node}
56 NXT_NODE_GYP=${NXT_NODE_GYP=node-gyp}
63 $echo -n "checking for node ..."
64 $echo "checking for node ..." >> $NXT_AUTOCONF_ERR
70 $echo " + node version ${NXT_NODE_VERSION}"
99 $echo -n "checking for node-gyp ..."
100 $echo "checking for node-gyp ..." >> $NXT_AUTOCONF_ERR
106 $echo " + node-gyp version ${NXT_NODE_GYP_VERSION}"
[all …]
/unit/pkg/docker/
H A DDockerfile.node161 FROM node:16 as BUILDER
35 && ./configure nodejs --node-gyp=/usr/local/lib/node_modules/npm/bin/node-gyp-bin/node-gyp \
36 && make -j $NCPU node node-install libunit-install \
39 && ./configure nodejs --node-gyp=/usr/local/lib/node_modules/npm/bin/node-gyp-bin/node-gyp \
40 && make -j $NCPU node node-install libunit-install \
43 FROM node:16
H A DMakefile12 MODULES ?= go jsc node perl php python ruby minimal
38 CONTAINER_node ?= node:$(VERSION_node)
39 CONFIGURE_node ?= nodejs --node-gyp=/usr/local/lib/node_modules/npm/bin/node-gyp-bin/node-gyp
40 INSTALL_node ?= node node-install libunit-install
/unit/test/
H A Dtest_node_es_modules.py2 from unit.applications.lang.node import TestApplicationNode
H A Dtest_node_application.py4 from unit.applications.lang.node import TestApplicationNode
H A Dconftest.py21 from unit.check.node import check_node
351 if hasattr(request.node, 'rep_call') and request.node.rep_call.failed:
/unit/test/unit/check/
H A Disolation.py6 from unit.applications.lang.node import TestApplicationNode

12