Home
last modified time | relevance | path

Searched refs:ndx (Results 1 – 11 of 11) sorted by relevance

/lighttpd1.4/src/
H A Dmod_vhostdb.c100 const int ndx = splaytree_djbhash(BUF_PTR_LEN(&r->uri.authority)); in mod_vhostdb_cache_query() local
102 *sptree = splaytree_splay(*sptree, ndx); in mod_vhostdb_cache_query()
104 (*sptree && (*sptree)->key == ndx) ? (*sptree)->data : NULL; in mod_vhostdb_cache_query()
115 const int ndx = splaytree_djbhash(BUF_PTR_LEN(&r->uri.authority)); in mod_vhostdb_cache_insert() local
120 if (NULL == *sptree || (*sptree)->key != ndx) in mod_vhostdb_cache_insert()
121 *sptree = splaytree_insert(*sptree, ndx, ve); in mod_vhostdb_cache_insert()
332 keys[(*ndx)++] = t->key; in mod_vhostdb_tag_old_entries()
347 int ndx = keys[i]; in mod_vhostdb_periodic_cleanup() local
348 sptree = splaytree_splay(sptree, ndx); in mod_vhostdb_periodic_cleanup()
349 if (sptree && sptree->key == ndx) { in mod_vhostdb_periodic_cleanup()
[all …]
H A Dstat_cache.c64 const int ndx = splaytree_djbhash(name, len); in stat_cache_sptree_find() local
65 *sptree = splaytree_splay(*sptree, ndx); in stat_cache_sptree_find()
292 keys[(*ndx)++] = t->key; in fam_dir_tag_refcnt()
309 const int ndx = keys[i]; in fam_dir_periodic_cleanup() local
311 if (node && node->key == ndx) { in fam_dir_periodic_cleanup()
459 ndx = (int)(intptr_t)fe.userdata; in stat_cache_handle_fdevent_in()
1206 keys[(*ndx)++] = t->key; in stat_cache_tag_dir_tree()
1220 const int ndx = keys[i]; in stat_cache_prune_dir_tree() local
1222 if (node && node->key == ndx) { in stat_cache_prune_dir_tree()
1495 keys[(*ndx)++] = t->key; in stat_cache_tag_old_entries()
[all …]
H A Dalgo_md5.c142 unsigned int i, ndx, partLen; in li_MD5_Update() local
146 ndx = (unsigned int)((context->count[0] >> 3) & 0x3F); in li_MD5_Update()
155 partLen = 64 - ndx; in li_MD5_Update()
161 ((POINTER)&context->buffer[ndx], (POINTER)input, partLen); in li_MD5_Update()
167 ndx = 0; in li_MD5_Update()
174 ((POINTER)&context->buffer[ndx], (POINTER)&input[i], in li_MD5_Update()
184 unsigned int ndx, padLen; in li_MD5_Final() local
191 ndx = (unsigned int)((context->count[0] >> 3) & 0x3f); in li_MD5_Final()
192 padLen = (ndx < 56) ? (56 - ndx) : (120 - ndx); in li_MD5_Final()
H A Dbuffer.c592 size_t d_len, ndx; in buffer_append_string_encoded() local
611 for (ds = (unsigned char *)s, d_len = 0, ndx = 0; ndx < s_len; ds++, ndx++) { in buffer_append_string_encoded()
635 for (ds = (unsigned char *)s, d_len = 0, ndx = 0; ndx < s_len; ds++, ndx++) { in buffer_append_string_encoded()
662 size_t d_len, ndx; in buffer_append_string_c_escaped() local
665 for (ds = (unsigned char *)s, d_len = 0, ndx = 0; ndx < s_len; ds++, ndx++) { in buffer_append_string_c_escaped()
689 for (ds = (unsigned char *)s, d_len = 0, ndx = 0; ndx < s_len; ds++, ndx++) { in buffer_append_string_c_escaped()
H A Dmod_auth.c133 *sptree = splaytree_splay(*sptree, ndx); in http_auth_cache_query()
143 if (NULL == *sptree || (*sptree)->key != ndx) in http_auth_cache_insert()
144 *sptree = splaytree_insert(*sptree, ndx, data); in http_auth_cache_insert()
164 keys[(*ndx)++] = t->key; in mod_auth_tag_old_entries()
179 int ndx = keys[i]; in mod_auth_periodic_cleanup() local
180 sptree = splaytree_splay(sptree, ndx); in mod_auth_periodic_cleanup()
181 if (sptree && sptree->key == ndx) { in mod_auth_periodic_cleanup()
818 int ndx = -1; in mod_auth_check_basic() local
821 ae = http_auth_cache_query(sptree, ndx); in mod_auth_check_basic()
1129 int ndx = -1; in mod_auth_digest_get() local
[all …]
H A Darray.c310 uint32_t ndx = 0; in array_extract_element_klen() local
311 while (entry != a->data[ndx]) ++ndx; in array_extract_element_klen()
312 a->data[ndx] = a->data[last_ndx]; /* swap with last element */ in array_extract_element_klen()
358 uint_fast32_t ndx = a->used++; in array_insert_data_at_pos() local
359 a->data[ndx] = entry; in array_insert_data_at_pos()
362 ndx -= pos; in array_insert_data_at_pos()
364 if (__builtin_expect( (ndx), 1)) in array_insert_data_at_pos()
365 memmove(d+1, d, ndx * sizeof(*a->sorted)); in array_insert_data_at_pos()
H A Dgw_backend.c813 int ndx = -1; in gw_host_get() local
818 ndx = 0; in gw_host_get()
843 ndx = k; in gw_host_get()
856 ndx = k; in gw_host_get()
869 if (ndx < 0) ndx = 0; in gw_host_get()
872 while (ndx < ext_used in gw_host_get()
873 && 0 == (host = extension->hosts[ndx])->active_procs) ++ndx; in gw_host_get()
875 if (ndx >= ext_used) { in gw_host_get()
877 for (ndx = 0; ndx <= (int) k; ++ndx) { in gw_host_get()
912 ndx = k; in gw_host_get()
[all …]
H A Dfdevent_impl.c901 for (int ndx = -1, i = n; ++ndx < nfds; ) { in fdevent_select_poll() local
903 if (FD_ISSET(ndx, &ev->select_read)) revents |= FDEVENT_IN; in fdevent_select_poll()
904 if (FD_ISSET(ndx, &ev->select_write)) revents |= FDEVENT_OUT; in fdevent_select_poll()
905 if (FD_ISSET(ndx, &ev->select_error)) revents |= FDEVENT_ERR; in fdevent_select_poll()
907 const fdnode *fdn = ev->fdarray[ndx]; in fdevent_select_poll()
H A Dmod_magnet.c3119 static void magnet_clear_table(lua_State * const L, int ndx) { in magnet_clear_table() argument
3123 if (ndx < 0) --ndx; in magnet_clear_table()
3124 for (lua_pushnil(L); lua_next(L, ndx); ) { in magnet_clear_table()
3128 lua_rawset(L, ndx < 0 ? ndx - 2 : ndx); in magnet_clear_table()
/lighttpd1.4/doc/outdated/
H A Dmagnet.txt271 ndx = math.random(maxndx)
273 lighty.content = { { filename = dir .. "/" .. ndx }}
/lighttpd1.4/
H A DNEWS1158 * [core] reorder srv->config_context to match ndx (fixes #3047)