Lines Matching refs:array
59 sl->array = (struct lruhash**)calloc(sl->size, sizeof(struct lruhash*));
60 if(!sl->array) {
77 sl->array[i] = lruhash_create(start_size, maxmem / sl->size,
79 if(!sl->array[i]) {
91 if(sl->array) {
94 lruhash_delete(sl->array[i]);
95 free(sl->array);
106 lruhash_clear(sl->array[i]);
119 lruhash_insert(sl->array[slab_idx(sl, hash)], hash, entry, data, arg);
125 return lruhash_lookup(sl->array[slab_idx(sl, hash)], hash, key, wr);
130 lruhash_remove(sl->array[slab_idx(sl, hash)], hash, key);
141 lruhash_status(sl->array[i], num, extended);
149 lock_quick_lock(&sl->array[i]->lock);
150 total += sl->array[i]->space_max;
151 lock_quick_unlock(&sl->array[i]->lock);
172 lruhash_update_space_used(sl->array[slab_idx(sl, hash)], cb_arg,
181 total += lruhash_get_mem(sl->array[i]);
188 return sl->array[slab_idx(sl, hash)];
229 lruhash_setmarkdel(sl->array[i], md);
238 lruhash_traverse(sh->array[i], wr, func, arg);
246 lock_quick_lock(&sh->array[slab]->lock);
247 cnt += sh->array[slab]->num;
248 lock_quick_unlock(&sh->array[slab]->lock);
258 lock_quick_lock(&sh->array[slab]->lock);
259 cnt += sh->array[slab]->num;
260 if (max_collisions < sh->array[slab]->max_collisions) {
261 max_collisions = sh->array[slab]->max_collisions;
263 lock_quick_unlock(&sh->array[slab]->lock);
276 lruhash_update_space_max(sl->array[i], NULL, space_max);