Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 77) sorted by relevance

1234

/unit/src/
H A Dnxt_queue.h15 nxt_queue_link_t *next; member
27 (queue)->head.next = &(queue)->head; \
34 (link)->next = (link); \
73 (queue)->head.next
89 (link)->next
98 (link)->next = (queue)->head.next; \
99 (link)->next->prev = (link); \
116 (link)->next = (target)->next; \
137 (link)->prev->next = (link)->next; \
147 (link)->prev->next = (link)->next; \
[all …]
H A Dnxt_list.c22 list->part.next = NULL; in nxt_list_create()
49 last->next = NULL; in nxt_list_add()
52 list->last->next = last; in nxt_list_add()
81 if (next->part != NULL) { in nxt_list_next()
82 next->elt++; in nxt_list_next()
84 if (next->elt < next->part->nelts) { in nxt_list_next()
88 next->part = next->part->next; in nxt_list_next()
90 if (next->part != NULL) { in nxt_list_next()
91 next->elt = 0; in nxt_list_next()
96 next->part = nxt_list_part(list); in nxt_list_next()
[all …]
H A Dnxt_queue.c19 nxt_queue_link_t *middle, *next; in nxt_queue_middle() local
27 next = middle; in nxt_queue_middle()
32 next = nxt_queue_next(next); in nxt_queue_middle()
34 if (next == nxt_queue_last(queue)) { in nxt_queue_middle()
38 next = nxt_queue_next(next); in nxt_queue_middle()
40 if (next == nxt_queue_last(queue)) { in nxt_queue_middle()
57 nxt_queue_link_t *link, *prev, *next; in nxt_queue_sort() local
67 link = next) in nxt_queue_sort()
70 next = nxt_queue_next(link); in nxt_queue_sort()
H A Dnxt_rbtree.c199 next = next->left; in nxt_rbtree_find()
202 next = next->right; in nxt_rbtree_find()
205 return next; in nxt_rbtree_find()
234 next = next->left; in nxt_rbtree_find_less_or_equal()
237 retval = next; in nxt_rbtree_find_less_or_equal()
238 next = next->right; in nxt_rbtree_find_less_or_equal()
242 return next; in nxt_rbtree_find_less_or_equal()
272 next = next->left; in nxt_rbtree_find_greater_or_equal()
275 next = next->right; in nxt_rbtree_find_greater_or_equal()
279 return next; in nxt_rbtree_find_greater_or_equal()
[all …]
H A Dnxt_work_queue.c112 next = chunk->next; in nxt_work_queue_cache_destroy()
141 work[i].next = NULL; in nxt_work_queue_allocate()
152 cache->next = cache->spare; in nxt_work_queue_allocate()
168 work = wq->cache->next; in nxt_work_queue_add()
171 wq->cache->next = work->next; in nxt_work_queue_add()
172 work->next = NULL; in nxt_work_queue_add()
206 wq->head = work->next; in nxt_work_queue_pop()
208 if (work->next == NULL) { in nxt_work_queue_pop()
220 work->next = wq->cache->next; in nxt_work_queue_pop()
221 wq->cache->next = work; in nxt_work_queue_pop()
[all …]
H A Dnxt_http_chunk_parse.c43 next = NULL; in nxt_http_chunk_parse()
49 for (b = in; b != NULL; b = next) { in nxt_http_chunk_parse()
62 goto next; in nxt_http_chunk_parse()
73 goto next; in nxt_http_chunk_parse()
180 next: in nxt_http_chunk_parse()
182 next = b->next; in nxt_http_chunk_parse()
183 b->next = NULL; in nxt_http_chunk_parse()
215 *tail = &b->next; in nxt_http_chunk_buffer()
252 nxt_buf_t *b, *next, *parent; in nxt_http_chunk_buf_completion() local
261 next = b->next; in nxt_http_chunk_buf_completion()
[all …]
H A Dnxt_list.h14 nxt_list_part_t *next; member
66 part = part->next; in nxt_list_elt()
88 _part = _part->next; \
99 NXT_EXPORT void *nxt_list_next(nxt_list_t *list, nxt_list_next_t *next);
102 #define nxt_list_next_value(list, next) \ argument
103 (nxt_pointer_to(nxt_list_data((next)->part), (next)->elt * (list)->size))
119 part = part->next; in nxt_list_nelts()
H A Dnxt_source.h25 #define nxt_source_filter(thr, wq, task, next, out) \ argument
29 task, next, out); \
32 (next)->filter(task, (next)->context, out); \
H A Dnxt_sendbuf.c31 nxt_prefetch(b->next); in nxt_sendbuf_mem_coalesce0()
101 nxt_prefetch(b->next); in nxt_sendbuf_mem_coalesce()
190 b = b->next; in nxt_sendbuf_file_coalesce()
322 b = b->next; in nxt_sendbuf_copy()
373 b = b->next; in nxt_sendbuf_update()
414 last = &start->next; in nxt_sendbuf_coalesce_completion()
419 next = b->next; in nxt_sendbuf_coalesce_completion()
420 if (next == NULL) { in nxt_sendbuf_coalesce_completion()
424 b->next = NULL; in nxt_sendbuf_coalesce_completion()
425 b = next; in nxt_sendbuf_coalesce_completion()
[all …]
H A Dnxt_buf_pool.c25 bp->free = b->next; in nxt_buf_pool_mem_alloc()
26 b->next = NULL; in nxt_buf_pool_mem_alloc()
65 bp->free = b->next; in nxt_buf_pool_file_alloc()
66 b->next = NULL; in nxt_buf_pool_file_alloc()
105 bp->free = b->next; in nxt_buf_pool_mmap_alloc()
106 b->next = NULL; in nxt_buf_pool_mmap_alloc()
166 b->next = bp->free; in nxt_buf_pool_free()
180 n = b->next; in nxt_buf_pool_destroy()
H A Dnxt_buf.c170 for (b = *head; b != NULL; b = b->next) { in nxt_buf_chain_add()
171 prev = &b->next; in nxt_buf_chain_add()
190 b = b->next; in nxt_buf_chain_length()
201 nxt_buf_t *b, *next, *parent; in nxt_buf_completion() local
210 next = b->next; in nxt_buf_completion()
218 b = next; in nxt_buf_completion()
274 nxt_buf_t *b, *next, *parent; in nxt_buf_ts_completion() local
287 next = b->next; in nxt_buf_ts_completion()
296 b = next; in nxt_buf_ts_completion()
307 for (i = src; i != NULL; i = i->next) { in nxt_buf_make_plain()
[all …]
H A Dnxt_http_websocket.c33 nxt_buf_t *out, *buf, **out_tail, *b, *next; in nxt_http_websocket_client() local
74 out_tail = &buf->next; in nxt_http_websocket_client()
88 next = b->next; in nxt_http_websocket_client()
89 b->next = NULL; in nxt_http_websocket_client()
95 r->ws_frame = next; in nxt_http_websocket_client()
98 b = next; in nxt_http_websocket_client()
H A Dnxt_recvbuf.c22 for (b = rb->buf; b != NULL; b = b->next) { in nxt_recvbuf_mem_coalesce()
24 nxt_prefetch(b->next); in nxt_recvbuf_mem_coalesce()
65 nxt_prefetch(b->next); in nxt_recvbuf_update()
80 b = b->next; in nxt_recvbuf_update()
H A Dnxt_conn_accept.c111 lev->next = c; in nxt_conn_accept_alloc()
145 c = lev->next; in nxt_conn_io_accept()
190 nxt_conn_t *next; in nxt_conn_accept() local
207 lev->next = NULL; in nxt_conn_accept()
225 next = nxt_conn_accept_next(task, lev); in nxt_conn_accept()
227 if (next != NULL && lev->socket.read_ready) { in nxt_conn_accept()
229 lev->accept, task, lev, next); in nxt_conn_accept()
239 c = lev->next; in nxt_conn_accept_next()
277 nxt_queue_link_t *link, *next; in nxt_conn_accept_close_idle_handler() local
290 link = next) in nxt_conn_accept_close_idle_handler()
[all …]
H A Dnxt_var.c314 u_char *p, *end, *next, *src; in nxt_var_compile() local
357 next = nxt_var_next_part(p, end, &part); in nxt_var_compile()
366 subs[n].length = next - p; in nxt_var_compile()
372 p = next; in nxt_var_compile()
382 u_char *p, *end, *next; in nxt_var_test() local
392 if (next == NULL) { in nxt_var_test()
410 p = next; in nxt_var_test()
493 size_t length, last, next; in nxt_var_interpreter() local
540 next = subs[i].position; in nxt_var_interpreter()
542 if (next != last) { in nxt_var_interpreter()
[all …]
H A Dnxt_port_rpc.c230 reg->stream, reg->peer, reg->link.next); in nxt_port_rpc_ex_set_peer()
239 reg->stream, reg->peer, reg->link.next); in nxt_port_rpc_ex_set_peer()
268 if (reg->link.next == &reg->link) { in nxt_port_rpc_remove_from_peers()
272 "registration (%p)", stream, reg->peer, reg->link.next); in nxt_port_rpc_remove_from_peers()
278 "registration (%p)", stream, reg->peer, reg->link.next); in nxt_port_rpc_remove_from_peers()
281 lhq.value = reg->link.next; in nxt_port_rpc_remove_from_peers()
293 "registration (%p)", stream, reg->peer, reg->link.next); in nxt_port_rpc_remove_from_peers()
416 if (peer_link == peer_link->next) { in nxt_port_rpc_remove_peer()
422 nxt_assert(peer_link->next->prev == peer_link); in nxt_port_rpc_remove_peer()
423 nxt_assert(peer_link->prev->next == peer_link); in nxt_port_rpc_remove_peer()
[all …]
H A Dnxt_vector.c142 u_char *next, *last, *end; in nxt_vector_remove() local
150 next = nxt_pointer_to(item, item_size); in nxt_vector_remove()
152 nxt_memmove(item, next, end - next); in nxt_vector_remove()
H A Dnxt_service.c103 goto next; in nxt_service_add()
107 goto next; in nxt_service_add()
114 next: in nxt_service_add()
H A Dnxt_work_queue.h39 nxt_work_t *next; member
50 nxt_work_queue_chunk_t *next; member
56 nxt_work_t *next; member
H A Dnxt_port_socket.c173 msg.link.next = NULL; in nxt_port_socket_write2()
259 if (b->next != NULL) { in nxt_port_can_enqueue_buf()
622 nxt_buf_t *next; in nxt_port_buf_completion() local
672 next = b->next; in nxt_port_buf_completion()
673 b->next = NULL; in nxt_port_buf_completion()
674 b = next; in nxt_port_buf_completion()
1292 next = b->next; in nxt_port_read_msg_process()
1294 b = next; in nxt_port_read_msg_process()
1315 b->next = NULL; in nxt_port_buf_alloc()
1364 next = b->next; in nxt_port_error_handler()
[all …]
H A Dnxt_upstream_round_robin.c48 uint32_t i, n, next, wt; in nxt_upstream_round_robin_create() local
64 next = 0; in nxt_upstream_round_robin_create()
67 srvcf = nxt_conf_next_object_member(servers_conf, &name, &next); in nxt_upstream_round_robin_create()
92 next = 0; in nxt_upstream_round_robin_create()
95 srvcf = nxt_conf_next_object_member(servers_conf, &name, &next); in nxt_upstream_round_robin_create()
H A Dnxt_fiber.h33 nxt_fiber_t *next; member
53 void nxt_fiber_exit(nxt_task_t *task, nxt_fiber_t *next, void *data);
/unit/src/java/nginx/unit/websocket/
H A DPerMessageDeflate.java57 private volatile Transformation next; field in PerMessageDeflate
248 if (next == null) { in validateRsv()
251 return next.validateRsv(rsv, opCode); in validateRsv()
259 if (next == null) { in validateRsv()
262 return next.validateRsv(rsvNext, opCode); in validateRsv()
295 if (next == null) { in setNext()
296 this.next = t; in setNext()
298 next.setNext(t); in setNext()
308 if (next == null) { in validateRsvBits()
442 if (next == null) { in sendMessagePart()
[all …]
/unit/src/test/
H A Dnxt_rbtree1_test.c229 nxt_rbtree1_node_t *next, *sentinel; in nxt_rbtree1_test_find() local
231 next = tree->root; in nxt_rbtree1_test_find()
234 while (next != sentinel) { in nxt_rbtree1_test_find()
235 nxt_prefetch(next->left); in nxt_rbtree1_test_find()
236 nxt_prefetch(next->right); in nxt_rbtree1_test_find()
238 n = nxt_rbtree1_test_compare(node, next); in nxt_rbtree1_test_find()
241 next = next->left; in nxt_rbtree1_test_find()
244 next = next->right; in nxt_rbtree1_test_find()
247 return next; in nxt_rbtree1_test_find()
/unit/go/
H A Dunit.go101 next uintptr member
112 handler_registry_.next = 1
115 h := handler_registry_.next
116 handler_registry_.next += 1

1234