73 	unsigned int entries;  member
138 				  unsigned int entries)  in test_rht_lookup()  argument
142 	for (i = 0; i < entries; i++) {  in test_rht_lookup()
175 static void test_bucket_stats(struct rhashtable *ht, unsigned int entries)  in test_bucket_stats()  argument
202 		total, atomic_read(&ht->nelems), entries, chain_len);  in test_bucket_stats()
204 	if (total != atomic_read(&ht->nelems) || total != entries)  in test_bucket_stats()
209 				  unsigned int entries)  in test_rhashtable()  argument
220 	pr_info("  Adding %d keys\n", entries);  in test_rhashtable()
222 	for (i = 0; i < entries; i++) {  in test_rhashtable()
237 	test_bucket_stats(ht, entries);  in test_rhashtable()
239 	test_rht_lookup(ht, array, entries);  in test_rhashtable()
242 	test_bucket_stats(ht, entries);  in test_rhashtable()
244 	pr_info("  Deleting %d keys\n", entries);  in test_rhashtable()
245 	for (i = 0; i < entries; i++) {  in test_rhashtable()
269 static int __init test_rhltable(unsigned int entries)  in test_rhltable()  argument
276 	if (entries == 0)  in test_rhltable()
277 		entries = 1;  in test_rhltable()
279 	rhl_test_objects = vzalloc(array_size(entries,  in test_rhltable()
286 					  BITS_TO_LONGS(entries)));  in test_rhltable()
296 	for (i = 0; i < entries; i++) {  in test_rhltable()
309 	pr_info("test %d add/delete pairs into rhlist\n", entries);  in test_rhltable()
310 	for (i = 0; i < entries; i++) {  in test_rhltable()
320 		if (WARN(!h, "key not found during iteration %d of %d", i, entries)) {  in test_rhltable()
358 	for (i = 0; i < entries; i++) {  in test_rhltable()
369 	pr_info("test %d random rhlist add/delete operations\n", entries);  in test_rhltable()
370 	for (j = 0; j < entries; j++) {  in test_rhltable()
371 		u32 i = prandom_u32_max(entries);  in test_rhltable()
414 		i = prandom_u32_max(entries);  in test_rhltable()
428 	for (i = 0; i < entries; i++) {  in test_rhltable()
449 				      unsigned int entries)  in test_rhashtable_max()  argument
454 	test_rht_params.max_size = roundup_pow_of_two(entries / 8);  in test_rhashtable_max()
603 	unsigned int entries = tdata->entries;  in thread_lookup_test()  local
606 	for (i = 0; i < entries; i++) {  in thread_lookup_test()
643 	for (i = 0; i < tdata->entries; i++) {  in threadfunc()
667 		for (i = 0; i < tdata->entries; i += step) {  in threadfunc()
698 	unsigned int entries;  in test_rht_init()  local
707 	entries = min(parm_entries, MAX_ENTRIES);  in test_rht_init()
710 	test_rht_params.max_size = max_size ? : roundup_pow_of_two(entries);  in test_rht_init()
734 		time = test_rhashtable(&ht, objs, entries);  in test_rht_init()
746 			test_rht_params.max_size, test_rhashtable_max(objs, entries) == 0 ?  in test_rht_init()
764 	objs  = vzalloc(array3_size(sizeof(struct test_obj), tcount, entries));  in test_rht_init()
771 	                           roundup_pow_of_two(tcount * entries);  in test_rht_init()
782 		tdata[i].entries = entries;  in test_rht_init()
783 		tdata[i].objs = objs + i * entries;  in test_rht_init()
815 	err = test_rhltable(entries / 16);  in test_rht_init()