Lines Matching full:capacity
91 unsigned long capacity; member
114 if (i->offset >= map->capacity) in _ck_hs_next()
130 } while (++i->offset < map->capacity); in _ck_hs_next()
230 map->capacity = n_entries; in ck_hs_map_create()
255 ck_hs_reset_size(struct ck_hs *hs, unsigned long capacity) in ck_hs_reset_size() argument
260 map = ck_hs_map_create(hs, capacity); in ck_hs_reset_size()
275 return ck_hs_reset_size(hs, previous->capacity); in ck_hs_reset()
334 unsigned long capacity) in ck_hs_grow() argument
342 if (map->capacity > capacity) in ck_hs_grow()
345 update = ck_hs_map_create(hs, capacity); in ck_hs_grow()
349 for (k = 0; k < map->capacity; k++) { in ck_hs_grow()
394 capacity <<= 1; in ck_hs_grow()
410 if ((map->n_entries << 1) > map->capacity) in ck_hs_map_postinsert()
411 ck_hs_grow(hs, map->capacity << 1); in ck_hs_map_postinsert()
420 return ck_hs_grow(hs, hs->map->capacity); in ck_hs_rebuild()
567 memset(map->probe_bound, 0, sizeof(CK_HS_WORD) * map->capacity); in ck_hs_gc()
576 size = sizeof(CK_HS_WORD) * map->capacity; in ck_hs_gc()
587 for (i = 0; i < map->capacity; i++) { in ck_hs_gc()
635 for (i = 0; i < map->capacity; i++) in ck_hs_gc()
704 if (ck_hs_grow(hs, map->capacity << 1) == false) in ck_hs_apply()
776 if (ck_hs_grow(hs, map->capacity << 1) == false) in ck_hs_set()
832 if (ck_hs_grow(hs, map->capacity << 1) == false) in ck_hs_put_internal()