118 	unsigned long n_entries;  member
261 	while (map->n_entries > map->max_entries) {  in ck_rhs_set_load_factor()
308 	st->n_entries = map->n_entries;  in ck_rhs_stat()
317 	return hs->map->n_entries;  in ck_rhs_count()
340 	unsigned long size, n_entries, limit;  in ck_rhs_map_create()  local
342 	n_entries = ck_internal_power_2(entries);  in ck_rhs_map_create()
343 	if (n_entries < CK_RHS_PROBE_L1)  in ck_rhs_map_create()
344 		n_entries = CK_RHS_PROBE_L1;  in ck_rhs_map_create()
348 		    (sizeof(void *) * n_entries +  in ck_rhs_map_create()
349 		     sizeof(struct ck_rhs_no_entry_desc) * n_entries +  in ck_rhs_map_create()
353 		    (sizeof(struct ck_rhs_entry_desc) * n_entries +  in ck_rhs_map_create()
362 	limit = ck_internal_max(n_entries >> (CK_RHS_PROBE_L1_SHIFT + 2), CK_RHS_PROBE_L1_DEFAULT);  in ck_rhs_map_create()
368 	map->capacity = n_entries;  in ck_rhs_map_create()
369 	map->step = ck_cc_ffsl(n_entries);  in ck_rhs_map_create()
370 	map->mask = n_entries - 1;  in ck_rhs_map_create()
371 	map->n_entries = 0;  in ck_rhs_map_create()
378 …void *)(((uintptr_t)map->entries.no_entries.entries + (sizeof(void *) * n_entries) + CK_MD_CACHELI…  in ck_rhs_map_create()
380 		    sizeof(void *) * n_entries);  in ck_rhs_map_create()
382 		    sizeof(struct ck_rhs_no_entry_desc) * n_entries);  in ck_rhs_map_create()
389 		memset(map->entries.descs, 0, sizeof(struct ck_rhs_entry_desc) * n_entries);  in ck_rhs_map_create()
540 				update->n_entries++;  in ck_rhs_grow()
1227 		map->n_entries++;  in ck_rhs_apply()
1228 		if ((map->n_entries ) > map->max_entries)  in ck_rhs_apply()
1305 		map->n_entries++;  in ck_rhs_set()
1306 		if ((map->n_entries ) > map->max_entries)  in ck_rhs_set()
1364 	map->n_entries++;  in ck_rhs_put_internal()
1365 	if ((map->n_entries ) > map->max_entries)  in ck_rhs_put_internal()
1432 	map->n_entries--;  in ck_rhs_remove()
1464     unsigned long n_entries,  in ck_rhs_init()  argument
1478 	hs->map = ck_rhs_map_create(hs, n_entries);  in ck_rhs_init()