76 	unsigned int entries;  member
141 				  unsigned int entries)  in test_rht_lookup()  argument
145 	for (i = 0; i < entries; i++) {  in test_rht_lookup()
178 static void test_bucket_stats(struct rhashtable *ht, unsigned int entries)  in test_bucket_stats()  argument
210 		total, atomic_read(&ht->nelems), entries, chain_len);  in test_bucket_stats()
212 	if (total != atomic_read(&ht->nelems) || total != entries)  in test_bucket_stats()
217 				  unsigned int entries)  in test_rhashtable()  argument
228 	pr_info("  Adding %d keys\n", entries);  in test_rhashtable()
230 	for (i = 0; i < entries; i++) {  in test_rhashtable()
245 	test_bucket_stats(ht, entries);  in test_rhashtable()
247 	test_rht_lookup(ht, array, entries);  in test_rhashtable()
250 	test_bucket_stats(ht, entries);  in test_rhashtable()
252 	pr_info("  Deleting %d keys\n", entries);  in test_rhashtable()
253 	for (i = 0; i < entries; i++) {  in test_rhashtable()
277 static int __init test_rhltable(unsigned int entries)  in test_rhltable()  argument
284 	if (entries == 0)  in test_rhltable()
285 		entries = 1;  in test_rhltable()
287 	rhl_test_objects = vzalloc(array_size(entries,  in test_rhltable()
294 					  BITS_TO_LONGS(entries)));  in test_rhltable()
304 	for (i = 0; i < entries; i++) {  in test_rhltable()
317 	pr_info("test %d add/delete pairs into rhlist\n", entries);  in test_rhltable()
318 	for (i = 0; i < entries; i++) {  in test_rhltable()
328 		if (WARN(!h, "key not found during iteration %d of %d", i, entries)) {  in test_rhltable()
366 	for (i = 0; i < entries; i++) {  in test_rhltable()
377 	pr_info("test %d random rhlist add/delete operations\n", entries);  in test_rhltable()
378 	for (j = 0; j < entries; j++) {  in test_rhltable()
379 		u32 i = prandom_u32_max(entries);  in test_rhltable()
422 		i = prandom_u32_max(entries);  in test_rhltable()
436 	for (i = 0; i < entries; i++) {  in test_rhltable()
457 				      unsigned int entries)  in test_rhashtable_max()  argument
462 	test_rht_params.max_size = roundup_pow_of_two(entries / 8);  in test_rhashtable_max()
604 	unsigned int entries = tdata->entries;  in thread_lookup_test()  local
607 	for (i = 0; i < entries; i++) {  in thread_lookup_test()
641 	for (i = 0; i < tdata->entries; i++) {  in threadfunc()
665 		for (i = 0; i < tdata->entries; i += step) {  in threadfunc()
696 	unsigned int entries;  in test_rht_init()  local
705 	entries = min(parm_entries, MAX_ENTRIES);  in test_rht_init()
708 	test_rht_params.max_size = max_size ? : roundup_pow_of_two(entries);  in test_rht_init()
732 		time = test_rhashtable(&ht, objs, entries);  in test_rht_init()
744 			test_rht_params.max_size, test_rhashtable_max(objs, entries) == 0 ?  in test_rht_init()
762 	objs  = vzalloc(array3_size(sizeof(struct test_obj), tcount, entries));  in test_rht_init()
769 	                           roundup_pow_of_two(tcount * entries);  in test_rht_init()
780 		tdata[i].entries = entries;  in test_rht_init()
781 		tdata[i].objs = objs + i * entries;  in test_rht_init()
810 	err = test_rhltable(entries / 16);  in test_rht_init()