32 MODULE_PARM_DESC(parm_entries, "Number of entries to add (default: 50000)");
74 	unsigned int entries;  member
139 				  unsigned int entries)  in test_rht_lookup()  argument
143 	for (i = 0; i < entries; i++) {  in test_rht_lookup()
176 static void test_bucket_stats(struct rhashtable *ht, unsigned int entries)  in test_bucket_stats()  argument
202 	pr_info("  Traversal complete: counted=%u, nelems=%u, entries=%d, table-jumps=%u\n",  in test_bucket_stats()
203 		total, atomic_read(&ht->nelems), entries, chain_len);  in test_bucket_stats()
205 	if (total != atomic_read(&ht->nelems) || total != entries)  in test_bucket_stats()
210 				  unsigned int entries)  in test_rhashtable()  argument
219 	 * Insert entries into table with all keys even numbers  in test_rhashtable()
221 	pr_info("  Adding %d keys\n", entries);  in test_rhashtable()
223 	for (i = 0; i < entries; i++) {  in test_rhashtable()
238 	test_bucket_stats(ht, entries);  in test_rhashtable()
240 	test_rht_lookup(ht, array, entries);  in test_rhashtable()
243 	test_bucket_stats(ht, entries);  in test_rhashtable()
245 	pr_info("  Deleting %d keys\n", entries);  in test_rhashtable()
246 	for (i = 0; i < entries; i++) {  in test_rhashtable()
270 static int __init test_rhltable(unsigned int entries)  in test_rhltable()  argument
277 	if (entries == 0)  in test_rhltable()
278 		entries = 1;  in test_rhltable()
280 	rhl_test_objects = vzalloc(array_size(entries,  in test_rhltable()
287 					  BITS_TO_LONGS(entries)));  in test_rhltable()
297 	for (i = 0; i < entries; i++) {  in test_rhltable()
310 	pr_info("test %d add/delete pairs into rhlist\n", entries);  in test_rhltable()
311 	for (i = 0; i < entries; i++) {  in test_rhltable()
321 		if (WARN(!h, "key not found during iteration %d of %d", i, entries)) {  in test_rhltable()
359 	for (i = 0; i < entries; i++) {  in test_rhltable()
370 	pr_info("test %d random rhlist add/delete operations\n", entries);  in test_rhltable()
371 	for (j = 0; j < entries; j++) {  in test_rhltable()
372 		u32 i = get_random_u32_below(entries);  in test_rhltable()
400 			i = get_random_u32_below(entries);  in test_rhltable()
415 	for (i = 0; i < entries; i++) {  in test_rhltable()
436 				      unsigned int entries)  in test_rhashtable_max()  argument
441 	test_rht_params.max_size = roundup_pow_of_two(entries / 8);  in test_rhashtable_max()
589 	unsigned int entries = tdata->entries;  in thread_lookup_test()  local
592 	for (i = 0; i < entries; i++) {  in thread_lookup_test()
629 	for (i = 0; i < tdata->entries; i++) {  in threadfunc()
653 		for (i = 0; i < tdata->entries; i += step) {  in threadfunc()
684 	unsigned int entries;  in test_rht_init()  local
693 	entries = min(parm_entries, MAX_ENTRIES);  in test_rht_init()
696 	test_rht_params.max_size = max_size ? : roundup_pow_of_two(entries);  in test_rht_init()
720 		time = test_rhashtable(&ht, objs, entries);  in test_rht_init()
732 			test_rht_params.max_size, test_rhashtable_max(objs, entries) == 0 ?  in test_rht_init()
750 	objs  = vzalloc(array3_size(sizeof(struct test_obj), tcount, entries));  in test_rht_init()
757 	                           roundup_pow_of_two(tcount * entries);  in test_rht_init()
768 		tdata[i].entries = entries;  in test_rht_init()
769 		tdata[i].objs = objs + i * entries;  in test_rht_init()
801 	err = test_rhltable(entries / 16);  in test_rht_init()