Lines Matching refs:capacity

119 	unsigned long capacity;  member
260 map->max_entries = (map->capacity * (unsigned long)hs->load_factor) / 100; in ck_rhs_set_load_factor()
262 if (ck_rhs_grow(hs, map->capacity << 1) == false) in ck_rhs_set_load_factor()
284 if (i->offset >= map->capacity) in ck_rhs_next()
298 } while (++i->offset < map->capacity); in ck_rhs_next()
368 map->capacity = n_entries; in ck_rhs_map_create()
373 map->max_entries = (map->capacity * (unsigned long)hs->load_factor) / 100; in ck_rhs_map_create()
401 ck_rhs_reset_size(struct ck_rhs *hs, unsigned long capacity) in ck_rhs_reset_size() argument
406 map = ck_rhs_map_create(hs, capacity); in ck_rhs_reset_size()
421 return ck_rhs_reset_size(hs, previous->capacity); in ck_rhs_reset()
495 unsigned long capacity) in ck_rhs_grow() argument
503 if (map->capacity > capacity) in ck_rhs_grow()
506 update = ck_rhs_map_create(hs, capacity); in ck_rhs_grow()
510 for (k = 0; k < map->capacity; k++) { in ck_rhs_grow()
534 capacity <<= 1; in ck_rhs_grow()
576 return ck_rhs_grow(hs, hs->map->capacity); in ck_rhs_rebuild()
833 for (i = 0; i < map->capacity; i++) { in ck_rhs_gc()
938 if (ck_rhs_grow(hs, map->capacity << 1) == false) { in ck_rhs_put_robin_hood()
1149 if (ck_rhs_grow(hs, map->capacity << 1) == false) in ck_rhs_apply()
1229 ck_rhs_grow(hs, map->capacity << 1); in ck_rhs_apply()
1253 if (ck_rhs_grow(hs, map->capacity << 1) == false) in ck_rhs_set()
1307 ck_rhs_grow(hs, map->capacity << 1); in ck_rhs_set()
1333 if (ck_rhs_grow(hs, map->capacity << 1) == false) in ck_rhs_put_internal()
1366 ck_rhs_grow(hs, map->capacity << 1); in ck_rhs_put_internal()