Searched refs:next (Results 1 - 25 of 120) sorted by relevance

12345

/tldk/app/nginx/src/core/
H A Dngx_queue.h20 ngx_queue_t *next; member in struct:ngx_queue_s
26 (q)->next = q
34 (x)->next = (h)->next; \
35 (x)->next->prev = x; \
37 (h)->next = x
45 (x)->prev->next = x; \
46 (x)->next = h; \
51 (h)->next
63 (q)->next
[all...]
H A Dngx_queue.c20 ngx_queue_t *middle, *next; local
28 next = ngx_queue_head(queue);
33 next = ngx_queue_next(next);
35 if (next == ngx_queue_last(queue)) {
39 next = ngx_queue_next(next);
41 if (next == ngx_queue_last(queue)) {
54 ngx_queue_t *q, *prev, *next; local
62 for (q = ngx_queue_next(q); q != ngx_queue_sentinel(queue); q = next) {
[all...]
H A Dngx_radix_tree.c113 ngx_radix_node_t *node, *next; local
118 next = tree->root;
122 next = node->right;
125 next = node->left;
128 if (next == NULL) {
133 node = next;
136 if (next) {
146 next = ngx_radix_alloc(tree);
147 if (next == NULL) {
151 next
274 ngx_radix_node_t *node, *next; local
[all...]
H A Dngx_buf.c55 pool->chain = cl->next;
117 ll = &cl->next;
133 for (cl = *chain; cl; cl = cl->next) {
134 ll = &cl->next;
145 ll = &cl->next;
146 in = in->next;
162 *free = cl->next;
163 cl->next = NULL;
177 cl->next = NULL;
194 for (cl = *busy; cl->next; c
[all...]
H A Dngx_slab.c116 /* only "next" is used in list head */
118 slots[i].next = &slots[i];
138 /* only "next" is used in list head */
140 pool->free.next = page;
144 page->next = &pool->free;
221 page = slots[slot].next;
223 if (page->next != page) {
256 prev->next = page->next;
257 page->next
[all...]
H A Dngx_palloc.c30 p->d.next = NULL;
53 for (c = pool->cleanup; c; c = c->next) {
68 for (l = pool->large; l; l = l->next) {
72 for (p = pool, n = pool->d.next; /* void */; p = n, n = n->d.next) {
83 for (l = pool->large; l; l = l->next) {
89 for (p = pool, n = pool->d.next; /* void */; p = n, n = n->d.next) {
105 for (l = pool->large; l; l = l->next) {
111 for (p = pool; p; p = p->d.next) {
[all...]
H A Dngx_list.h21 ngx_list_part_t *next; member in struct:ngx_list_part_s
45 list->part.next = NULL;
65 * if (part->next == NULL) {
69 * part = part->next;
H A Dngx_palloc.h37 ngx_pool_cleanup_t *next; member in struct:ngx_pool_cleanup_s
44 ngx_pool_large_t *next; member in struct:ngx_pool_large_s
52 ngx_pool_t *next; member in struct:__anon44
H A Dngx_thread_pool.h18 ngx_thread_task_t *next; member in struct:ngx_thread_task_s
H A Dngx_list.c53 last->next = NULL;
55 l->last->next = last;
H A Dngx_output_chain.c68 if (in->next == NULL
124 ctx->in = ctx->in->next;
134 ctx->in = cl->next;
137 last_out = &cl->next;
138 cl->next = NULL;
159 ctx->free = cl->next;
190 ctx->in = ctx->in->next;
199 cl->next = NULL;
201 last_out = &cl->next;
317 for (cl = *chain; cl; cl = cl->next) {
[all...]
H A Dngx_times.c332 * last February days to next year, but we catch the case when "yday"
395 time_t now, next; local
407 next = mktime(&tm);
409 if (next == -1) {
413 if (next - now > 0) {
414 return next;
421 next = mktime(&tm);
423 if (next != -1) {
424 return next;
H A Dngx_module.c85 ngx_uint_t i, next, max; local
88 next = 0;
108 if (module->ctx_index == next) {
109 next++;
117 module->ctx_index = ngx_module_ctx_index(cycle, type, next);
123 next = module->ctx_index + 1;
H A Dngx_resolver.c341 ngx_resolver_ctx_t *ctx, *next; local
350 for (ctx = rn->waiting; ctx; ctx = next) {
351 next = ctx->next;
540 *p = w->next;
545 p = &w->next;
546 w = w->next;
591 ngx_resolver_ctx_t *next, *last; local
617 for (last = ctx; last->next; last = last->next);
1914 ngx_resolver_ctx_t *ctx, *next; local
2565 ngx_resolver_ctx_t *ctx, *next; local
3087 ngx_resolver_ctx_t *ctx, *next; local
[all...]
/tldk/lib/libtle_dring/
H A Dtle_dring.h62 struct tle_drb *next; member in struct:tle_drb
146 pb->next = drbs[j];
154 pb->next = NULL;
191 uint32_t head, next; local
199 next = head + nb_obj;
200 } while (rte_atomic32_cmpset(&dr->prod.head, head, next) == 0);
217 dr->prod.tail = next;
246 uint32_t head, next; local
252 next = head + nb_obj;
255 dr->prod.head = next;
373 uint32_t head, next, num, tail; local
438 uint32_t head, next, num, tail; local
[all...]
/tldk/app/nginx/src/http/
H A Dngx_http_postpone_filter_module.c101 r->postponed = pr->next;
122 r->postponed = pr->next;
136 for (pr = r->postponed; pr->next; pr = pr->next) { /* void */ }
142 ppr = &pr->next;
157 pr->next = NULL;
H A Dngx_http_write_filter_module.c71 for (cl = r->out; cl; cl = cl->next) {
72 ll = &cl->next;
120 for (ln = in; ln; ln = ln->next) {
128 ll = &cl->next;
203 cl = cl->next;
300 cl = cl->next;
/tldk/app/nginx/src/event/
H A Dngx_event_pipe.c222 p->free_raw_bufs = p->free_raw_bufs->next;
223 chain->next = NULL;
245 chain->next = NULL;
288 p->free_raw_bufs = p->free_raw_bufs->next;
289 chain->next = NULL;
310 chain->next = p->free_raw_bufs;
358 cl = cl->next;
368 for (ln = cl; ln->next; ln = ln->next) { /* void */ }
370 ln->next
739 ngx_chain_t *cl, *tl, *next, *out, **ll, **last_out, **last_free; local
995 ngx_buf_t *b, *next; local
[all...]
/tldk/lib/libtle_l4p/
H A Dmisc.h179 ms = ms->next;
443 struct rte_mbuf *m, *next; local
462 next = m->next;
464 m = next;
533 struct rte_mbuf *next; local
544 while (remain >= m->data_len && m->next) {
545 next = m->next;
549 m = next;
579 struct rte_mbuf *last, *next, *tmp; local
[all...]
H A Dtcp_tx_seg.h66 out_seg_prev->next = out_seg;
88 in_seg = in_seg->next;
/tldk/app/nginx/src/http/modules/perl/
H A Dngx_http_perl_module.h28 SV *next; member in struct:__anon260
/tldk/app/nginx/src/http/modules/
H A Dngx_http_charset_filter_module.c502 * use this charset instead of the next page charset
565 for (cl = in; cl; cl = cl->next) {
576 (*ll)->next = NULL;
578 ll = &(*ll)->next;
595 ll = &(*ll)->next;
606 for (cl = ctx->busy; cl->next; cl = cl->next) { /* void */ }
607 cl->next = out;
620 ctx->busy = cl->next;
631 cl->next
[all...]
H A Dngx_http_upstream_ip_hash_module.c190 peer = peer->next;
198 goto next;
205 goto next;
212 goto next;
216 goto next;
221 next:
/tldk/app/nginx/src/stream/
H A Dngx_stream_upstream_round_robin.h50 ngx_stream_upstream_rr_peer_t *next; member in struct:ngx_stream_upstream_rr_peer_s
75 ngx_stream_upstream_rr_peers_t *next; member in struct:ngx_stream_upstream_rr_peers_s
H A Dngx_stream_write_filter_module.c95 for (cl = *out; cl; cl = cl->next) {
96 ll = &cl->next;
144 for (ln = in; ln; ln = ln->next) {
152 ll = &cl->next;
210 cl = cl->next;
240 cl = cl->next;

Completed in 18 milliseconds

12345