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

123456

/httpd/modules/http/
H A Dhttp_etag.c34 static char *etag_uint64_to_hex(char *next, apr_uint64_t u) argument
42 *next++ = HEX_DIGITS[next_digit];
46 *next++ = HEX_DIGITS[next_digit];
50 *next++ = HEX_DIGITS[u & (apr_uint64_t)0xf];
51 return next;
68 char *next; local
118 next = etag;
121 *next++ = *weak++;
124 *next++ = '"';
127 next
[all...]
H A Dhttp_request.c72 f = f->next;
87 ap_filter_t *next; local
95 next = r->output_filters;
96 while (next && (next->frec != ap_http_header_filter_handle)) {
97 next = next->next;
101 * If next != NULL then we left the while above because of
102 * next
629 ap_filter_t *next; local
[all...]
/httpd/modules/slotmem/
H A Dmod_slotmem_plain.c33 struct ap_slotmem_instance_t *next; /* location of next allocated segment */ member in struct:ap_slotmem_instance_t
69 ap_slotmem_instance_t *next = globallistmem; local
81 if (next) {
83 if (strcmp(next->name, fname) == 0) {
85 *new = next;
88 if (!next->next) {
91 next = next
122 ap_slotmem_instance_t *next = globallistmem; local
[all...]
H A Dmod_slotmem_shm.c70 struct ap_slotmem_instance_t *next; /* location of next allocated segment */ member in struct:ap_slotmem_instance_t
244 ap_slotmem_instance_t *next = *mem; local
245 while (next) {
246 if (AP_SLOTMEM_IS_PERSIST(next)) {
247 store_slotmem(next);
249 if (next->fbased) {
251 apr_shm_remove(next->name, next->gpool);
252 name = slotmem_filename(next
304 ap_slotmem_instance_t *next = globallistmem; local
451 ap_slotmem_instance_t *next = globallistmem; local
[all...]
/httpd/server/
H A Dutil_filter.c321 f->next = NULL;
324 f->next = *outf;
336 while (first && (first->next != (*outf))) {
337 first = first->next;
342 first->next = f;
349 while (!INSERT_BEFORE(f, fscan->next))
350 fscan = fscan->next;
352 f->next = fscan->next;
353 fscan->next
[all...]
H A Dlisten.c350 rec->next = 0;
385 while (last && last->next) {
386 last = last->next;
398 last->next = new;
432 *walk = new->next;
433 new->next = ap_listeners;
440 walk = &(*walk)->next;
461 while (last && last->next) {
462 last = last->next;
471 new->next
527 ap_listen_rec *next; local
[all...]
H A Dapreq_parser.c57 apreq_hook_t *next,
62 h->next = next;
75 while (last->next)
76 last = last->next;
78 last->next = p->hook;
198 if (hook->next)
199 s = apreq_hook_run(hook->next, param, bb);
308 if (hook->next)
309 s = apreq_hook_run(hook->next, para
55 apreq_hook_make(apr_pool_t *pool, apreq_hook_function_t hook, apreq_hook_t *next, void *ctx) argument
[all...]
H A Dutil_cfgtree.c36 current->next = toadd;
/httpd/include/
H A Dutil_cfgtree.h52 /** The next directive node in the tree */
53 struct ap_directive_t *next; member in struct:ap_directive_t
H A Dmod_auth.h101 authn_provider_list *next; member in struct:authn_provider_list
H A Dutil_filter.h81 * filter), operates on it, and passes the result to the next filter in the
207 * At the moment, these are simply linked in a chain, so a ->next pointer
232 /** The next filter_rec in the list */
233 struct ap_filter_rec_t *next; member in struct:ap_filter_rec_t
268 /** The next filter in the chain */
269 ap_filter_t *next; member in struct:ap_filter_t
284 * Get the current bucket brigade from the next filter on the filter
288 * @param filter The next filter in the chain
294 * @param readbytes How many bytes to read from the next filter.
303 * Pass the current bucket brigade down to the next filte
[all...]
H A Dapreq_parser.h85 apreq_hook_t *next; /**< next item in the linked list */ member in struct:apreq_hook_t
211 * @param next List of other hooks for this hook to call on.
217 apreq_hook_t *next,
/httpd/modules/filters/
H A Dmod_filter.c45 /** The next provider in the list */
46 ap_filter_provider_t *next; member in struct:ap_filter_provider_t
54 provider_ctx *next; member in struct:provider_ctx
64 struct mod_filter_chain *next; member in struct:mod_filter_chain
108 for (p = filter->providers; p; p = p->next) {
126 pctx->next = fctx->init_ctx;
150 for (provider = filter->providers; provider; provider = provider->next) {
216 /* can't use this provider; try next */
225 /* can't use this provider; try next */
260 for (pctx = ctx->init_ctx; pctx; pctx = pctx->next) {
[all...]
H A Dmod_data.c85 return ap_pass_brigade(f->next, bb);
126 return ap_pass_brigade(f->next, bb);
157 rv = ap_pass_brigade(f->next, ctx->bb);
161 rv = ap_pass_brigade(f->next, bb);
174 rv = ap_pass_brigade(f->next, ctx->bb);
226 rv = ap_pass_brigade(f->next, ctx->bb);
H A Dmod_buffer.c71 return ap_pass_brigade(f->next, bb);
82 return ap_pass_brigade(f->next, bb);
107 rv = ap_pass_brigade(f->next, ctx->bb);
119 rv = ap_pass_brigade(f->next, ctx->bb);
142 rv = ap_pass_brigade(f->next, ctx->bb);
198 return ap_get_brigade(f->next, bb, mode, block, readbytes);
211 return ap_get_brigade(f->next, bb, mode, block, readbytes);
225 rv = ap_get_brigade(f->next, ctx->tmp, mode, block,
/httpd/modules/generators/
H A Dmod_cgi.h43 ap_filter_t *next; member in struct:__anon182
/httpd/modules/dav/lock/
H A Dlocks.c119 struct dav_lock_discovery *next; member in struct:dav_lock_discovery
132 struct dav_lock_indirect *next; member in struct:dav_lock_indirect
470 dp = dp->next;
474 ip = ip->next;
505 dp = dp->next;
524 ip = ip->next;
627 dp->next = *direct;
650 ip->next = *indirect;
711 for (; dir != NULL; dir = dir->next) {
813 for (; dp != NULL; dp = dp->next) {
[all...]
/httpd/server/mpm/worker/
H A Dfdqueue.c22 struct recycled_pool *next; member in struct:recycled_pool
46 if (apr_atomic_casptr((void*)&(qi->recycled_pools), first_pool->next,
96 /* Save queue_info->recycled_pool in local variable next because
97 * new_recycle->next can be changed after apr_atomic_casptr
100 struct recycled_pool *next = queue_info->recycled_pools; local
101 new_recycle->next = next;
103 new_recycle, next) == next) {
191 * it reaches into the queue and accesses "next" whic
[all...]
/httpd/modules/aaa/
H A Dmod_authn_anon.c61 struct anon_auth_user *next; member in struct:anon_auth_user
107 conf->users->next = first;
165 p = p->next;
/httpd/modules/cache/
H A Dmod_cache.c91 ap_filter_t *next; local
325 next = r->output_filters;
326 while (next && (next->frec != cache_out_handle)) {
327 ap_remove_output_filter(next);
328 next = next->next;
350 static int cache_replace_filter(ap_filter_t *next, ap_filter_rec_t *from, argument
353 while (next
377 cache_get_filter(ap_filter_t *next, ap_filter_rec_t *rec) argument
400 ap_filter_t *next; local
[all...]
/httpd/modules/core/
H A Dmod_macro.c542 This structure holds pointers (next, upper) to the current "file" which was
560 ap_configfile_t *next; /* next config once this one is processed */ member in struct:__anon96
565 Get next config if any.
570 if (ml->next) {
572 *(ml->upper) = ml->next;
579 returns next char if possible
590 if (ml->next && ml->next->getch && next_one(ml)) {
591 apr_status_t rc = ml->next
617 char next = '\\0'; local
[all...]
/httpd/modules/arch/netware/
H A Dmod_nw_ssl.c109 seclisten_rec *next; member in struct:seclisten_rec
120 seclistenup_rec *next; member in struct:seclistenup_rec
223 for (sl = ap_seclisteners; sl; sl = sl->next) {
236 for (sl = ap_seclistenersup; sl; sl = sl->next) {
532 *walk = new->next;
533 new->next = ap_listeners;
540 walk = &(*walk)->next;
554 new->next = ap_seclisteners;
604 new->next = ap_seclistenersup;
619 for (lr = ap_listeners; lr; lr = lr->next) {
[all...]
/httpd/modules/dav/fs/
H A Dlock.c130 struct dav_lock_discovery *next; member in struct:dav_lock_discovery
143 struct dav_lock_indirect *next; member in struct:dav_lock_indirect
449 dp = dp->next;
453 ip = ip->next;
483 dp = dp->next;
496 ip = ip->next;
585 dp->next = *direct;
623 ip->next = *indirect;
685 for (; dir != NULL; dir = dir->next) {
1021 for (; dp != NULL; dp = dp->next) {
[all...]
/httpd/modules/ldap/
H A Dutil_ldap_cache_mgr.c250 q = p->next;
258 pp = &(p->next);
411 q = p->next;
435 p = p->next) ;
534 node->next = cache->nodes[hashval];
559 p = p->next) {
569 cache->nodes[hashval] = p->next;
573 q->next = p->next;
598 n != NULL && n != n->next;
[all...]
/httpd/server/mpm/event/
H A Dfdqueue.c25 struct recycled_pool *next; member in struct:recycled_pool
57 ((void*) &(qi->recycled_pools), first_pool->next,
237 * Save queue_info->recycled_pool in local variable next because
238 * new_recycle->next can be changed after apr_atomic_casptr
241 struct recycled_pool *next = queue_info->recycled_pools; local
242 new_recycle->next = next;
244 new_recycle, next) == next)
254 * it reaches into the queue and accesses "next" whic
[all...]

Completed in 7373 milliseconds

123456