0001
0002
0003
0004
0005
0006
0007
0008
0009
0010
0011
0012
0013 #include <linux/init.h>
0014 #include <linux/jhash.h>
0015 #include <linux/kernel.h>
0016 #include <linux/kthread.h>
0017 #include <linux/module.h>
0018 #include <linux/rcupdate.h>
0019 #include <linux/rhashtable.h>
0020 #include <linux/slab.h>
0021 #include <linux/sched.h>
0022 #include <linux/random.h>
0023 #include <linux/vmalloc.h>
0024 #include <linux/wait.h>
0025
0026 #define MAX_ENTRIES 1000000
0027 #define TEST_INSERT_FAIL INT_MAX
0028
0029 static int parm_entries = 50000;
0030 module_param(parm_entries, int, 0);
0031 MODULE_PARM_DESC(parm_entries, "Number of entries to add (default: 50000)");
0032
0033 static int runs = 4;
0034 module_param(runs, int, 0);
0035 MODULE_PARM_DESC(runs, "Number of test runs per variant (default: 4)");
0036
0037 static int max_size = 0;
0038 module_param(max_size, int, 0);
0039 MODULE_PARM_DESC(max_size, "Maximum table size (default: calculated)");
0040
0041 static bool shrinking = false;
0042 module_param(shrinking, bool, 0);
0043 MODULE_PARM_DESC(shrinking, "Enable automatic shrinking (default: off)");
0044
0045 static int size = 8;
0046 module_param(size, int, 0);
0047 MODULE_PARM_DESC(size, "Initial size hint of table (default: 8)");
0048
0049 static int tcount = 10;
0050 module_param(tcount, int, 0);
0051 MODULE_PARM_DESC(tcount, "Number of threads to spawn (default: 10)");
0052
0053 static bool enomem_retry = false;
0054 module_param(enomem_retry, bool, 0);
0055 MODULE_PARM_DESC(enomem_retry, "Retry insert even if -ENOMEM was returned (default: off)");
0056
0057 struct test_obj_val {
0058 int id;
0059 int tid;
0060 };
0061
0062 struct test_obj {
0063 struct test_obj_val value;
0064 struct rhash_head node;
0065 };
0066
0067 struct test_obj_rhl {
0068 struct test_obj_val value;
0069 struct rhlist_head list_node;
0070 };
0071
0072 struct thread_data {
0073 unsigned int entries;
0074 int id;
0075 struct task_struct *task;
0076 struct test_obj *objs;
0077 };
0078
0079 static u32 my_hashfn(const void *data, u32 len, u32 seed)
0080 {
0081 const struct test_obj_rhl *obj = data;
0082
0083 return (obj->value.id % 10);
0084 }
0085
0086 static int my_cmpfn(struct rhashtable_compare_arg *arg, const void *obj)
0087 {
0088 const struct test_obj_rhl *test_obj = obj;
0089 const struct test_obj_val *val = arg->key;
0090
0091 return test_obj->value.id - val->id;
0092 }
0093
0094 static struct rhashtable_params test_rht_params = {
0095 .head_offset = offsetof(struct test_obj, node),
0096 .key_offset = offsetof(struct test_obj, value),
0097 .key_len = sizeof(struct test_obj_val),
0098 .hashfn = jhash,
0099 };
0100
0101 static struct rhashtable_params test_rht_params_dup = {
0102 .head_offset = offsetof(struct test_obj_rhl, list_node),
0103 .key_offset = offsetof(struct test_obj_rhl, value),
0104 .key_len = sizeof(struct test_obj_val),
0105 .hashfn = jhash,
0106 .obj_hashfn = my_hashfn,
0107 .obj_cmpfn = my_cmpfn,
0108 .nelem_hint = 128,
0109 .automatic_shrinking = false,
0110 };
0111
0112 static atomic_t startup_count;
0113 static DECLARE_WAIT_QUEUE_HEAD(startup_wait);
0114
0115 static int insert_retry(struct rhashtable *ht, struct test_obj *obj,
0116 const struct rhashtable_params params)
0117 {
0118 int err, retries = -1, enomem_retries = 0;
0119
0120 do {
0121 retries++;
0122 cond_resched();
0123 err = rhashtable_insert_fast(ht, &obj->node, params);
0124 if (err == -ENOMEM && enomem_retry) {
0125 enomem_retries++;
0126 err = -EBUSY;
0127 }
0128 } while (err == -EBUSY);
0129
0130 if (enomem_retries)
0131 pr_info(" %u insertions retried after -ENOMEM\n",
0132 enomem_retries);
0133
0134 return err ? : retries;
0135 }
0136
0137 static int __init test_rht_lookup(struct rhashtable *ht, struct test_obj *array,
0138 unsigned int entries)
0139 {
0140 unsigned int i;
0141
0142 for (i = 0; i < entries; i++) {
0143 struct test_obj *obj;
0144 bool expected = !(i % 2);
0145 struct test_obj_val key = {
0146 .id = i,
0147 };
0148
0149 if (array[i / 2].value.id == TEST_INSERT_FAIL)
0150 expected = false;
0151
0152 obj = rhashtable_lookup_fast(ht, &key, test_rht_params);
0153
0154 if (expected && !obj) {
0155 pr_warn("Test failed: Could not find key %u\n", key.id);
0156 return -ENOENT;
0157 } else if (!expected && obj) {
0158 pr_warn("Test failed: Unexpected entry found for key %u\n",
0159 key.id);
0160 return -EEXIST;
0161 } else if (expected && obj) {
0162 if (obj->value.id != i) {
0163 pr_warn("Test failed: Lookup value mismatch %u!=%u\n",
0164 obj->value.id, i);
0165 return -EINVAL;
0166 }
0167 }
0168
0169 cond_resched_rcu();
0170 }
0171
0172 return 0;
0173 }
0174
0175 static void test_bucket_stats(struct rhashtable *ht, unsigned int entries)
0176 {
0177 unsigned int total = 0, chain_len = 0;
0178 struct rhashtable_iter hti;
0179 struct rhash_head *pos;
0180
0181 rhashtable_walk_enter(ht, &hti);
0182 rhashtable_walk_start(&hti);
0183
0184 while ((pos = rhashtable_walk_next(&hti))) {
0185 if (PTR_ERR(pos) == -EAGAIN) {
0186 pr_info("Info: encountered resize\n");
0187 chain_len++;
0188 continue;
0189 } else if (IS_ERR(pos)) {
0190 pr_warn("Test failed: rhashtable_walk_next() error: %ld\n",
0191 PTR_ERR(pos));
0192 break;
0193 }
0194
0195 total++;
0196 }
0197
0198 rhashtable_walk_stop(&hti);
0199 rhashtable_walk_exit(&hti);
0200
0201 pr_info(" Traversal complete: counted=%u, nelems=%u, entries=%d, table-jumps=%u\n",
0202 total, atomic_read(&ht->nelems), entries, chain_len);
0203
0204 if (total != atomic_read(&ht->nelems) || total != entries)
0205 pr_warn("Test failed: Total count mismatch ^^^");
0206 }
0207
0208 static s64 __init test_rhashtable(struct rhashtable *ht, struct test_obj *array,
0209 unsigned int entries)
0210 {
0211 struct test_obj *obj;
0212 int err;
0213 unsigned int i, insert_retries = 0;
0214 s64 start, end;
0215
0216
0217
0218
0219
0220 pr_info(" Adding %d keys\n", entries);
0221 start = ktime_get_ns();
0222 for (i = 0; i < entries; i++) {
0223 struct test_obj *obj = &array[i];
0224
0225 obj->value.id = i * 2;
0226 err = insert_retry(ht, obj, test_rht_params);
0227 if (err > 0)
0228 insert_retries += err;
0229 else if (err)
0230 return err;
0231 }
0232
0233 if (insert_retries)
0234 pr_info(" %u insertions retried due to memory pressure\n",
0235 insert_retries);
0236
0237 test_bucket_stats(ht, entries);
0238 rcu_read_lock();
0239 test_rht_lookup(ht, array, entries);
0240 rcu_read_unlock();
0241
0242 test_bucket_stats(ht, entries);
0243
0244 pr_info(" Deleting %d keys\n", entries);
0245 for (i = 0; i < entries; i++) {
0246 struct test_obj_val key = {
0247 .id = i * 2,
0248 };
0249
0250 if (array[i].value.id != TEST_INSERT_FAIL) {
0251 obj = rhashtable_lookup_fast(ht, &key, test_rht_params);
0252 BUG_ON(!obj);
0253
0254 rhashtable_remove_fast(ht, &obj->node, test_rht_params);
0255 }
0256
0257 cond_resched();
0258 }
0259
0260 end = ktime_get_ns();
0261 pr_info(" Duration of test: %lld ns\n", end - start);
0262
0263 return end - start;
0264 }
0265
0266 static struct rhashtable ht;
0267 static struct rhltable rhlt;
0268
0269 static int __init test_rhltable(unsigned int entries)
0270 {
0271 struct test_obj_rhl *rhl_test_objects;
0272 unsigned long *obj_in_table;
0273 unsigned int i, j, k;
0274 int ret, err;
0275
0276 if (entries == 0)
0277 entries = 1;
0278
0279 rhl_test_objects = vzalloc(array_size(entries,
0280 sizeof(*rhl_test_objects)));
0281 if (!rhl_test_objects)
0282 return -ENOMEM;
0283
0284 ret = -ENOMEM;
0285 obj_in_table = vzalloc(array_size(sizeof(unsigned long),
0286 BITS_TO_LONGS(entries)));
0287 if (!obj_in_table)
0288 goto out_free;
0289
0290 err = rhltable_init(&rhlt, &test_rht_params);
0291 if (WARN_ON(err))
0292 goto out_free;
0293
0294 k = prandom_u32();
0295 ret = 0;
0296 for (i = 0; i < entries; i++) {
0297 rhl_test_objects[i].value.id = k;
0298 err = rhltable_insert(&rhlt, &rhl_test_objects[i].list_node,
0299 test_rht_params);
0300 if (WARN(err, "error %d on element %d\n", err, i))
0301 break;
0302 if (err == 0)
0303 set_bit(i, obj_in_table);
0304 }
0305
0306 if (err)
0307 ret = err;
0308
0309 pr_info("test %d add/delete pairs into rhlist\n", entries);
0310 for (i = 0; i < entries; i++) {
0311 struct rhlist_head *h, *pos;
0312 struct test_obj_rhl *obj;
0313 struct test_obj_val key = {
0314 .id = k,
0315 };
0316 bool found;
0317
0318 rcu_read_lock();
0319 h = rhltable_lookup(&rhlt, &key, test_rht_params);
0320 if (WARN(!h, "key not found during iteration %d of %d", i, entries)) {
0321 rcu_read_unlock();
0322 break;
0323 }
0324
0325 if (i) {
0326 j = i - 1;
0327 rhl_for_each_entry_rcu(obj, pos, h, list_node) {
0328 if (WARN(pos == &rhl_test_objects[j].list_node, "old element found, should be gone"))
0329 break;
0330 }
0331 }
0332
0333 cond_resched_rcu();
0334
0335 found = false;
0336
0337 rhl_for_each_entry_rcu(obj, pos, h, list_node) {
0338 if (pos == &rhl_test_objects[i].list_node) {
0339 found = true;
0340 break;
0341 }
0342 }
0343
0344 rcu_read_unlock();
0345
0346 if (WARN(!found, "element %d not found", i))
0347 break;
0348
0349 err = rhltable_remove(&rhlt, &rhl_test_objects[i].list_node, test_rht_params);
0350 WARN(err, "rhltable_remove: err %d for iteration %d\n", err, i);
0351 if (err == 0)
0352 clear_bit(i, obj_in_table);
0353 }
0354
0355 if (ret == 0 && err)
0356 ret = err;
0357
0358 for (i = 0; i < entries; i++) {
0359 WARN(test_bit(i, obj_in_table), "elem %d allegedly still present", i);
0360
0361 err = rhltable_insert(&rhlt, &rhl_test_objects[i].list_node,
0362 test_rht_params);
0363 if (WARN(err, "error %d on element %d\n", err, i))
0364 break;
0365 if (err == 0)
0366 set_bit(i, obj_in_table);
0367 }
0368
0369 pr_info("test %d random rhlist add/delete operations\n", entries);
0370 for (j = 0; j < entries; j++) {
0371 u32 i = prandom_u32_max(entries);
0372 u32 prand = prandom_u32();
0373
0374 cond_resched();
0375
0376 if (prand == 0)
0377 prand = prandom_u32();
0378
0379 if (prand & 1) {
0380 prand >>= 1;
0381 continue;
0382 }
0383
0384 err = rhltable_remove(&rhlt, &rhl_test_objects[i].list_node, test_rht_params);
0385 if (test_bit(i, obj_in_table)) {
0386 clear_bit(i, obj_in_table);
0387 if (WARN(err, "cannot remove element at slot %d", i))
0388 continue;
0389 } else {
0390 if (WARN(err != -ENOENT, "removed non-existent element %d, error %d not %d",
0391 i, err, -ENOENT))
0392 continue;
0393 }
0394
0395 if (prand & 1) {
0396 prand >>= 1;
0397 continue;
0398 }
0399
0400 err = rhltable_insert(&rhlt, &rhl_test_objects[i].list_node, test_rht_params);
0401 if (err == 0) {
0402 if (WARN(test_and_set_bit(i, obj_in_table), "succeeded to insert same object %d", i))
0403 continue;
0404 } else {
0405 if (WARN(!test_bit(i, obj_in_table), "failed to insert object %d", i))
0406 continue;
0407 }
0408
0409 if (prand & 1) {
0410 prand >>= 1;
0411 continue;
0412 }
0413
0414 i = prandom_u32_max(entries);
0415 if (test_bit(i, obj_in_table)) {
0416 err = rhltable_remove(&rhlt, &rhl_test_objects[i].list_node, test_rht_params);
0417 WARN(err, "cannot remove element at slot %d", i);
0418 if (err == 0)
0419 clear_bit(i, obj_in_table);
0420 } else {
0421 err = rhltable_insert(&rhlt, &rhl_test_objects[i].list_node, test_rht_params);
0422 WARN(err, "failed to insert object %d", i);
0423 if (err == 0)
0424 set_bit(i, obj_in_table);
0425 }
0426 }
0427
0428 for (i = 0; i < entries; i++) {
0429 cond_resched();
0430 err = rhltable_remove(&rhlt, &rhl_test_objects[i].list_node, test_rht_params);
0431 if (test_bit(i, obj_in_table)) {
0432 if (WARN(err, "cannot remove element at slot %d", i))
0433 continue;
0434 } else {
0435 if (WARN(err != -ENOENT, "removed non-existent element, error %d not %d",
0436 err, -ENOENT))
0437 continue;
0438 }
0439 }
0440
0441 rhltable_destroy(&rhlt);
0442 out_free:
0443 vfree(rhl_test_objects);
0444 vfree(obj_in_table);
0445 return ret;
0446 }
0447
0448 static int __init test_rhashtable_max(struct test_obj *array,
0449 unsigned int entries)
0450 {
0451 unsigned int i, insert_retries = 0;
0452 int err;
0453
0454 test_rht_params.max_size = roundup_pow_of_two(entries / 8);
0455 err = rhashtable_init(&ht, &test_rht_params);
0456 if (err)
0457 return err;
0458
0459 for (i = 0; i < ht.max_elems; i++) {
0460 struct test_obj *obj = &array[i];
0461
0462 obj->value.id = i * 2;
0463 err = insert_retry(&ht, obj, test_rht_params);
0464 if (err > 0)
0465 insert_retries += err;
0466 else if (err)
0467 return err;
0468 }
0469
0470 err = insert_retry(&ht, &array[ht.max_elems], test_rht_params);
0471 if (err == -E2BIG) {
0472 err = 0;
0473 } else {
0474 pr_info("insert element %u should have failed with %d, got %d\n",
0475 ht.max_elems, -E2BIG, err);
0476 if (err == 0)
0477 err = -1;
0478 }
0479
0480 rhashtable_destroy(&ht);
0481
0482 return err;
0483 }
0484
0485 static unsigned int __init print_ht(struct rhltable *rhlt)
0486 {
0487 struct rhashtable *ht;
0488 const struct bucket_table *tbl;
0489 char buff[512] = "";
0490 int offset = 0;
0491 unsigned int i, cnt = 0;
0492
0493 ht = &rhlt->ht;
0494
0495 mutex_lock(&ht->mutex);
0496 tbl = rht_dereference(ht->tbl, ht);
0497 for (i = 0; i < tbl->size; i++) {
0498 struct rhash_head *pos, *next;
0499 struct test_obj_rhl *p;
0500
0501 pos = rht_ptr_exclusive(tbl->buckets + i);
0502 next = !rht_is_a_nulls(pos) ? rht_dereference(pos->next, ht) : NULL;
0503
0504 if (!rht_is_a_nulls(pos)) {
0505 offset += sprintf(buff + offset, "\nbucket[%d] -> ", i);
0506 }
0507
0508 while (!rht_is_a_nulls(pos)) {
0509 struct rhlist_head *list = container_of(pos, struct rhlist_head, rhead);
0510 offset += sprintf(buff + offset, "[[");
0511 do {
0512 pos = &list->rhead;
0513 list = rht_dereference(list->next, ht);
0514 p = rht_obj(ht, pos);
0515
0516 offset += sprintf(buff + offset, " val %d (tid=%d)%s", p->value.id, p->value.tid,
0517 list? ", " : " ");
0518 cnt++;
0519 } while (list);
0520
0521 pos = next,
0522 next = !rht_is_a_nulls(pos) ?
0523 rht_dereference(pos->next, ht) : NULL;
0524
0525 offset += sprintf(buff + offset, "]]%s", !rht_is_a_nulls(pos) ? " -> " : "");
0526 }
0527 }
0528 printk(KERN_ERR "\n---- ht: ----%s\n-------------\n", buff);
0529 mutex_unlock(&ht->mutex);
0530
0531 return cnt;
0532 }
0533
0534 static int __init test_insert_dup(struct test_obj_rhl *rhl_test_objects,
0535 int cnt, bool slow)
0536 {
0537 struct rhltable *rhlt;
0538 unsigned int i, ret;
0539 const char *key;
0540 int err = 0;
0541
0542 rhlt = kmalloc(sizeof(*rhlt), GFP_KERNEL);
0543 if (WARN_ON(!rhlt))
0544 return -EINVAL;
0545
0546 err = rhltable_init(rhlt, &test_rht_params_dup);
0547 if (WARN_ON(err)) {
0548 kfree(rhlt);
0549 return err;
0550 }
0551
0552 for (i = 0; i < cnt; i++) {
0553 rhl_test_objects[i].value.tid = i;
0554 key = rht_obj(&rhlt->ht, &rhl_test_objects[i].list_node.rhead);
0555 key += test_rht_params_dup.key_offset;
0556
0557 if (slow) {
0558 err = PTR_ERR(rhashtable_insert_slow(&rhlt->ht, key,
0559 &rhl_test_objects[i].list_node.rhead));
0560 if (err == -EAGAIN)
0561 err = 0;
0562 } else
0563 err = rhltable_insert(rhlt,
0564 &rhl_test_objects[i].list_node,
0565 test_rht_params_dup);
0566 if (WARN(err, "error %d on element %d/%d (%s)\n", err, i, cnt, slow? "slow" : "fast"))
0567 goto skip_print;
0568 }
0569
0570 ret = print_ht(rhlt);
0571 WARN(ret != cnt, "missing rhltable elements (%d != %d, %s)\n", ret, cnt, slow? "slow" : "fast");
0572
0573 skip_print:
0574 rhltable_destroy(rhlt);
0575 kfree(rhlt);
0576
0577 return 0;
0578 }
0579
0580 static int __init test_insert_duplicates_run(void)
0581 {
0582 struct test_obj_rhl rhl_test_objects[3] = {};
0583
0584 pr_info("test inserting duplicates\n");
0585
0586
0587 rhl_test_objects[0].value.id = 1;
0588 rhl_test_objects[1].value.id = 21;
0589
0590
0591
0592 rhl_test_objects[2].value.id = rhl_test_objects[0].value.id;
0593
0594 test_insert_dup(rhl_test_objects, 2, false);
0595 test_insert_dup(rhl_test_objects, 3, false);
0596 test_insert_dup(rhl_test_objects, 2, true);
0597 test_insert_dup(rhl_test_objects, 3, true);
0598
0599 return 0;
0600 }
0601
0602 static int thread_lookup_test(struct thread_data *tdata)
0603 {
0604 unsigned int entries = tdata->entries;
0605 int i, err = 0;
0606
0607 for (i = 0; i < entries; i++) {
0608 struct test_obj *obj;
0609 struct test_obj_val key = {
0610 .id = i,
0611 .tid = tdata->id,
0612 };
0613
0614 obj = rhashtable_lookup_fast(&ht, &key, test_rht_params);
0615 if (obj && (tdata->objs[i].value.id == TEST_INSERT_FAIL)) {
0616 pr_err(" found unexpected object %d-%d\n", key.tid, key.id);
0617 err++;
0618 } else if (!obj && (tdata->objs[i].value.id != TEST_INSERT_FAIL)) {
0619 pr_err(" object %d-%d not found!\n", key.tid, key.id);
0620 err++;
0621 } else if (obj && memcmp(&obj->value, &key, sizeof(key))) {
0622 pr_err(" wrong object returned (got %d-%d, expected %d-%d)\n",
0623 obj->value.tid, obj->value.id, key.tid, key.id);
0624 err++;
0625 }
0626
0627 cond_resched();
0628 }
0629 return err;
0630 }
0631
0632 static int threadfunc(void *data)
0633 {
0634 int i, step, err = 0, insert_retries = 0;
0635 struct thread_data *tdata = data;
0636
0637 if (atomic_dec_and_test(&startup_count))
0638 wake_up(&startup_wait);
0639 if (wait_event_interruptible(startup_wait, atomic_read(&startup_count) == -1)) {
0640 pr_err(" thread[%d]: interrupted\n", tdata->id);
0641 goto out;
0642 }
0643
0644 for (i = 0; i < tdata->entries; i++) {
0645 tdata->objs[i].value.id = i;
0646 tdata->objs[i].value.tid = tdata->id;
0647 err = insert_retry(&ht, &tdata->objs[i], test_rht_params);
0648 if (err > 0) {
0649 insert_retries += err;
0650 } else if (err) {
0651 pr_err(" thread[%d]: rhashtable_insert_fast failed\n",
0652 tdata->id);
0653 goto out;
0654 }
0655 }
0656 if (insert_retries)
0657 pr_info(" thread[%d]: %u insertions retried due to memory pressure\n",
0658 tdata->id, insert_retries);
0659
0660 err = thread_lookup_test(tdata);
0661 if (err) {
0662 pr_err(" thread[%d]: rhashtable_lookup_test failed\n",
0663 tdata->id);
0664 goto out;
0665 }
0666
0667 for (step = 10; step > 0; step--) {
0668 for (i = 0; i < tdata->entries; i += step) {
0669 if (tdata->objs[i].value.id == TEST_INSERT_FAIL)
0670 continue;
0671 err = rhashtable_remove_fast(&ht, &tdata->objs[i].node,
0672 test_rht_params);
0673 if (err) {
0674 pr_err(" thread[%d]: rhashtable_remove_fast failed\n",
0675 tdata->id);
0676 goto out;
0677 }
0678 tdata->objs[i].value.id = TEST_INSERT_FAIL;
0679
0680 cond_resched();
0681 }
0682 err = thread_lookup_test(tdata);
0683 if (err) {
0684 pr_err(" thread[%d]: rhashtable_lookup_test (2) failed\n",
0685 tdata->id);
0686 goto out;
0687 }
0688 }
0689 out:
0690 while (!kthread_should_stop()) {
0691 set_current_state(TASK_INTERRUPTIBLE);
0692 schedule();
0693 }
0694 return err;
0695 }
0696
0697 static int __init test_rht_init(void)
0698 {
0699 unsigned int entries;
0700 int i, err, started_threads = 0, failed_threads = 0;
0701 u64 total_time = 0;
0702 struct thread_data *tdata;
0703 struct test_obj *objs;
0704
0705 if (parm_entries < 0)
0706 parm_entries = 1;
0707
0708 entries = min(parm_entries, MAX_ENTRIES);
0709
0710 test_rht_params.automatic_shrinking = shrinking;
0711 test_rht_params.max_size = max_size ? : roundup_pow_of_two(entries);
0712 test_rht_params.nelem_hint = size;
0713
0714 objs = vzalloc(array_size(sizeof(struct test_obj),
0715 test_rht_params.max_size + 1));
0716 if (!objs)
0717 return -ENOMEM;
0718
0719 pr_info("Running rhashtable test nelem=%d, max_size=%d, shrinking=%d\n",
0720 size, max_size, shrinking);
0721
0722 for (i = 0; i < runs; i++) {
0723 s64 time;
0724
0725 pr_info("Test %02d:\n", i);
0726 memset(objs, 0, test_rht_params.max_size * sizeof(struct test_obj));
0727
0728 err = rhashtable_init(&ht, &test_rht_params);
0729 if (err < 0) {
0730 pr_warn("Test failed: Unable to initialize hashtable: %d\n",
0731 err);
0732 continue;
0733 }
0734
0735 time = test_rhashtable(&ht, objs, entries);
0736 rhashtable_destroy(&ht);
0737 if (time < 0) {
0738 vfree(objs);
0739 pr_warn("Test failed: return code %lld\n", time);
0740 return -EINVAL;
0741 }
0742
0743 total_time += time;
0744 }
0745
0746 pr_info("test if its possible to exceed max_size %d: %s\n",
0747 test_rht_params.max_size, test_rhashtable_max(objs, entries) == 0 ?
0748 "no, ok" : "YES, failed");
0749 vfree(objs);
0750
0751 do_div(total_time, runs);
0752 pr_info("Average test time: %llu\n", total_time);
0753
0754 test_insert_duplicates_run();
0755
0756 if (!tcount)
0757 return 0;
0758
0759 pr_info("Testing concurrent rhashtable access from %d threads\n",
0760 tcount);
0761 atomic_set(&startup_count, tcount);
0762 tdata = vzalloc(array_size(tcount, sizeof(struct thread_data)));
0763 if (!tdata)
0764 return -ENOMEM;
0765 objs = vzalloc(array3_size(sizeof(struct test_obj), tcount, entries));
0766 if (!objs) {
0767 vfree(tdata);
0768 return -ENOMEM;
0769 }
0770
0771 test_rht_params.max_size = max_size ? :
0772 roundup_pow_of_two(tcount * entries);
0773 err = rhashtable_init(&ht, &test_rht_params);
0774 if (err < 0) {
0775 pr_warn("Test failed: Unable to initialize hashtable: %d\n",
0776 err);
0777 vfree(tdata);
0778 vfree(objs);
0779 return -EINVAL;
0780 }
0781 for (i = 0; i < tcount; i++) {
0782 tdata[i].id = i;
0783 tdata[i].entries = entries;
0784 tdata[i].objs = objs + i * entries;
0785 tdata[i].task = kthread_run(threadfunc, &tdata[i],
0786 "rhashtable_thrad[%d]", i);
0787 if (IS_ERR(tdata[i].task)) {
0788 pr_err(" kthread_run failed for thread %d\n", i);
0789 atomic_dec(&startup_count);
0790 } else {
0791 started_threads++;
0792 }
0793 }
0794 if (wait_event_interruptible(startup_wait, atomic_read(&startup_count) == 0))
0795 pr_err(" wait_event interruptible failed\n");
0796
0797 atomic_dec(&startup_count);
0798 wake_up_all(&startup_wait);
0799 for (i = 0; i < tcount; i++) {
0800 if (IS_ERR(tdata[i].task))
0801 continue;
0802 if ((err = kthread_stop(tdata[i].task))) {
0803 pr_warn("Test failed: thread %d returned: %d\n",
0804 i, err);
0805 failed_threads++;
0806 }
0807 }
0808 rhashtable_destroy(&ht);
0809 vfree(tdata);
0810 vfree(objs);
0811
0812
0813
0814
0815
0816 err = test_rhltable(entries / 16);
0817 pr_info("Started %d threads, %d failed, rhltable test returns %d\n",
0818 started_threads, failed_threads, err);
0819 return 0;
0820 }
0821
0822 static void __exit test_rht_exit(void)
0823 {
0824 }
0825
0826 module_init(test_rht_init);
0827 module_exit(test_rht_exit);
0828
0829 MODULE_LICENSE("GPL v2");
