/httpd/server/ |
H A D | util_time.c | 46 * when hashing items into a cache of size 56 struct exploded_time_cache_element *cache, 61 &(cache[seconds & TIME_CACHE_MASK]); 64 /* The cache is implemented as a ring buffer. Each second, 71 * cache element. Note that the timestamp in the cache 73 * if two threads hit this cache element simultaneously 95 * Step 1: Take a "snapshot" of the cache element by 105 * just give up on the cache and explode the 55 cached_explode(apr_time_exp_t *xt, apr_time_t t, struct exploded_time_cache_element *cache, int use_gmt) argument
|
H A D | request.c | 344 struct walk_cache_t *prev; /* Prev cache of same call in this (sub)req */ 351 walk_cache_t *cache, *prev_cache, *copy_cache; local 354 /* Find the most relevant, recent walk cache to work from and provide 356 * or internal redirect, this is the cache corresponding to the equivalent 358 * a cache exists. Otherwise it is the walk cache of the previous 360 * that exists; if not, then create a new walk cache. 385 cache = apr_pmemdup(r->pool, copy_cache, sizeof(*cache)); 386 cache 566 walk_cache_t *cache; local 1355 walk_cache_t *cache; local 1556 walk_cache_t *cache; local 1752 walk_cache_t *cache; local [all...] |
H A D | config.c | 244 * in better cache usage). 1380 * Therefore we cache a pointer to the last node. 2099 const struct htaccess_result *cache; local 2104 /* firstly, search cache */ 2105 for (cache = r->htaccess; cache != NULL; cache = cache->next) { 2106 if (cache->override == override && strcmp(cache [all...] |
H A D | util.c | 3084 struct pw_cache *cache; local 3087 cache = (struct pw_cache *)apr_table_get(r->connection->notes, pw_cache_note_name); 3088 if (cache != NULL) { 3089 if (strncmp(passwd, cache->vb.buf, cache->pwlen) == 0 3090 && strcmp(hash, cache->vb.buf + cache->pwlen) == 0) { 3091 return cache->result; 3094 cache->vb.strlen = 0; 3097 cache [all...] |
/httpd/support/ |
H A D | logresolve.c | 50 * internal hash-table cache. This means that each IP number will only 77 static apr_hash_t *cache; variable 202 cache = apr_hash_make(pool); 236 /* See if we have it in our cache */ 237 hostname = (char *) apr_hash_get(cache, line, APR_HASH_KEY_STRING); 260 /* From here on our we cache each result, even if it was not 273 /* Add to cache */ 275 apr_hash_set(cache, line, APR_HASH_KEY_STRING, 276 apr_pstrdup(apr_hash_pool_get(cache), line)); 294 /* Add to cache */ [all...] |
/httpd/modules/cache/ |
H A D | cache_storage.c | 22 APLOG_USE_MODULE(cache); variable 31 * delete all URL entities from the cache 34 int cache_remove_url(cache_request_rec *cache, request_rec *r) argument 39 list = cache->providers; 41 /* Remove the stale cache entry if present. If not, we're 45 h = cache->stale_handle ? cache->stale_handle : cache->handle; 50 "cache: Removing url %s from the cache", 72 cache_create_entity(cache_request_rec *cache, request_rec *r, apr_off_t size, apr_bucket_brigade *in) argument 214 cache_select(cache_request_rec *cache, request_rec *r) argument 684 cache_invalidate(cache_request_rec *cache, request_rec *r) argument [all...] |
H A D | cache_util.c | 22 APLOG_USE_MODULE(cache); variable 177 /* per directory cache disable */ 182 /* global cache disable */ 240 * Try obtain a cache wide lock on the given cache key. 256 * or when a request arrives containing a Cache-Control: no-cache. At 260 apr_status_t cache_try_lock(cache_server_conf *conf, cache_request_rec *cache, argument 286 if (!cache->key) { 289 * Try to use the key of a possible open but stale cache 292 if (cache 371 cache_remove_lock(cache_server_conf *conf, cache_request_rec *cache, request_rec *r, apr_bucket_brigade *bb) argument 431 ap_cache_check_no_cache(cache_request_rec *cache, request_rec *r) argument 474 ap_cache_check_no_store(cache_request_rec *cache, request_rec *r) argument 514 cache_check_freshness(cache_handle_t *h, cache_request_rec *cache, request_rec *r) argument [all...] |
H A D | mod_cache.c | 28 /* Handles for cache filters, resolved at startup to eliminate 59 * Can we deliver this request from the cache? 63 * check whether we're allowed to try cache it 69 * By default, the cache handler runs in the quick handler, bypassing 70 * virtually all server processing and offering the cache its optimal 71 * performance. In this mode, the cache bolts onto the front of the 75 * Under certain circumstances, an admin might want to run the cache as 76 * a normal handler instead of a quick handler, allowing the cache to 78 * the placement of the cache in the filter chain. This option comes at 88 cache_request_rec *cache; local 397 cache_request_rec *cache; local 644 cache_request_rec *cache = (cache_request_rec *)f->ctx; local 702 cache_save_store(ap_filter_t *f, apr_bucket_brigade *in, cache_server_conf *conf, cache_request_rec *cache) argument 813 cache_request_rec *cache = (cache_request_rec *)f->ctx; local 1618 cache_request_rec *cache; local 1663 cache_request_rec *cache; local 1859 cache_request_rec *cache = (cache_request_rec *) dummy; local 2683 AP_DECLARE_MODULE(cache) = variable [all...] |
/httpd/modules/ldap/ |
H A D | util_ldap_cache.c | 18 * util_ldap_cache.c: LDAP cache things 48 void *util_ldap_url_node_copy(util_ald_cache_t *cache, void *c) argument 51 util_url_node_t *node = util_ald_alloc(cache, sizeof *node); 54 if (!(node->url = util_ald_strdup(cache, n->url))) { 55 util_ald_free(cache, node); 68 void util_ldap_url_node_free(util_ald_cache_t *cache, void *n) argument 72 util_ald_free(cache, node->url); 76 util_ald_free(cache, node); 79 void util_ldap_url_node_display(request_rec *r, util_ald_cache_t *cache, void *n) argument 147 void *util_ldap_search_node_copy(util_ald_cache_t *cache, voi argument 198 util_ldap_search_node_free(util_ald_cache_t *cache, void *n) argument 218 util_ldap_search_node_display(request_rec *r, util_ald_cache_t *cache, void *n) argument 254 util_ldap_compare_node_copy(util_ald_cache_t *cache, void *c) argument 277 util_ldap_compare_node_free(util_ald_cache_t *cache, void *n) argument 288 util_ldap_compare_node_display(request_rec *r, util_ald_cache_t *cache, void *n) argument 357 util_ldap_dn_compare_node_copy(util_ald_cache_t *cache, void *c) argument 375 util_ldap_dn_compare_node_free(util_ald_cache_t *cache, void *n) argument 383 util_ldap_dn_compare_node_display(request_rec *r, util_ald_cache_t *cache, void *n) argument [all...] |
H A D | util_ldap_cache_mgr.c | 18 * util_ldap_cache_mgr.c: LDAP cache manager things 79 void util_ald_free(util_ald_cache_t *cache, const void *ptr) argument 82 if (cache->rmm_addr) { 85 apr_rmm_free(cache->rmm_addr, apr_rmm_offset_get(cache->rmm_addr, (void *)ptr)); 98 void *util_ald_alloc(util_ald_cache_t *cache, unsigned long size) argument 103 if (cache->rmm_addr) { 105 apr_rmm_off_t block = apr_rmm_calloc(cache->rmm_addr, size); 106 return block ? (void *)apr_rmm_addr_get(cache->rmm_addr, block) : NULL; 117 const char *util_ald_strdup(util_ald_cache_t *cache, cons argument 145 util_ald_sgl_dup(util_ald_cache_t *cache, util_compare_subgroup_t *sgl_in) argument 184 util_ald_sgl_free(util_ald_cache_t *cache, util_compare_subgroup_t **sgl) argument 232 util_ald_cache_purge(util_ald_cache_t *cache) argument 324 util_ald_create_cache(util_ldap_state_t *st, long cache_size, unsigned long (*hashfunc)(void *), int (*comparefunc)(void *, void *), void * (*copyfunc)(util_ald_cache_t *cache, void *), void (*freefunc)(util_ald_cache_t *cache, void *), void (*displayfunc)(request_rec *r, util_ald_cache_t *cache, void *)) argument 332 util_ald_cache_t *cache; local 399 util_ald_destroy_cache(util_ald_cache_t *cache) argument 421 util_ald_cache_fetch(util_ald_cache_t *cache, void *payload) argument 450 util_ald_cache_insert(util_ald_cache_t *cache, void *payload) argument 547 util_ald_cache_remove(util_ald_cache_t *cache, void *payload) argument 580 util_ald_cache_display_stats(request_rec *r, util_ald_cache_t *cache, char *name, char *id) argument [all...] |
/httpd/modules/mappers/ |
H A D | mod_rewrite.c | 352 /* the (per-child) cache structures. 354 typedef struct cache { struct 360 } cache; typedef in typeref:struct:cache 414 /* the cache */ 415 static cache *cachep; 1083 cachep = apr_palloc(p, sizeof(cache)); 1085 cachep = NULL; /* turns off cache */ 1614 "cache lookup FAILED, forcing new map lookup")); 1629 rewritelog((r,5,NULL,"cache lookup OK: map=%s[txt] key=%s -> val=%s", 1670 "cache looku [all...] |