rcuja: free all leaf nodes at destruction

[urcu.git] / tests / test_urcu_ja.c

diff --git a/tests/test_urcu_ja.c b/tests/test_urcu_ja.c
index 7c6190daa485429ab896e7db58b2db5c87895dd7..7b64575d7bb1c0d0c2394dd921aa535e94844ae0 100644 (file)
--- a/tests/test_urcu_ja.c
+++ b/tests/test_urcu_ja.c
@@ -123,14 +123,14 @@ void rcu_copy_mutex_unlock(void)
        }
 }
 
-#if 0
 void free_node_cb(struct rcu_head *head)
 {
        struct ja_test_node *node =
-               caa_container_of(head, struct ja_test_node, head);
+               caa_container_of(head, struct ja_test_node, node.head);
        free(node);
 }
 
+#if 0
 static
 void test_delete_all_nodes(struct cds_lfht *ht)
 {
@@ -207,11 +207,11 @@ int test_8bit_key(void)
 
        printf("Test #2: successful key lookup (8-bit).\n");
        for (key = 0; key < 200; key++) {
-               struct cds_hlist_head *head;
+               struct cds_hlist_head head;
 
                rcu_read_lock();
                head = cds_ja_lookup(test_ja, key);
-               if (!head) {
+               if (cds_hlist_empty(&head)) {
                        fprintf(stderr, "Error lookup node %" PRIu64 "\n", key);
                        assert(0);
                }
@@ -220,11 +220,11 @@ int test_8bit_key(void)
        printf("OK\n");
        printf("Test #3: unsuccessful key lookup (8-bit).\n");
        for (key = 200; key < 240; key++) {
-               struct cds_hlist_head *head;
+               struct cds_hlist_head head;
 
                rcu_read_lock();
                head = cds_ja_lookup(test_ja, key);
-               if (head) {
+               if (!cds_hlist_empty(&head)) {
                        fprintf(stderr,
                                "Error unexpected lookup node %" PRIu64 "\n",
                                key);
@@ -233,8 +233,29 @@ int test_8bit_key(void)
                rcu_read_unlock();
        }
        printf("OK\n");
+       printf("Test #4: remove keys (8-bit).\n");
+       for (key = 0; key < 200; key++) {
+               struct cds_hlist_head head;
+               struct ja_test_node *node;
+
+               rcu_read_lock();
+               head = cds_ja_lookup(test_ja, key);
+               node = cds_hlist_first_entry_rcu(&head, struct ja_test_node, node.list);
+               if (!node) {
+                       fprintf(stderr, "Error lookup node %" PRIu64 "\n", key);
+                       assert(0);
+               }
+               ret = cds_ja_del(test_ja, key, &node->node);
+               if (ret) {
+                       fprintf(stderr, "Error (%d) removing node %" PRIu64 "\n", ret, key);
+                       assert(0);
+               }
+               call_rcu(&node->node.head, free_node_cb);
+               rcu_read_unlock();
+       }
+       printf("OK\n");
 
-       ret = cds_ja_destroy(test_ja);
+       ret = cds_ja_destroy(test_ja, free_node_cb);
        if (ret) {
                fprintf(stderr, "Error destroying judy array\n");
                return -1;
@@ -277,11 +298,11 @@ int test_16bit_key(void)
        printf("Test #2: successful key lookup (16-bit).\n");
        //for (key = 0; key < 10000; key++) {
        for (key = 0; key < 65536; key+=256) {
-               struct cds_hlist_head *head;
+               struct cds_hlist_head head;
 
                rcu_read_lock();
                head = cds_ja_lookup(test_ja, key);
-               if (!head) {
+               if (cds_hlist_empty(&head)) {
                        fprintf(stderr, "Error lookup node %" PRIu64 "\n", key);
                        assert(0);
                }
@@ -290,11 +311,11 @@ int test_16bit_key(void)
        printf("OK\n");
        printf("Test #3: unsuccessful key lookup (16-bit).\n");
        for (key = 11000; key <= 11002; key++) {
-               struct cds_hlist_head *head;
+               struct cds_hlist_head head;
 
                rcu_read_lock();
                head = cds_ja_lookup(test_ja, key);
-               if (head) {
+               if (!cds_hlist_empty(&head)) {
                        fprintf(stderr,
                                "Error unexpected lookup node %" PRIu64 "\n",
                                key);
@@ -304,7 +325,7 @@ int test_16bit_key(void)
        }
        printf("OK\n");
 
-       ret = cds_ja_destroy(test_ja);
+       ret = cds_ja_destroy(test_ja, free_node_cb);
        if (ret) {
                fprintf(stderr, "Error destroying judy array\n");
                return -1;
@@ -356,11 +377,11 @@ int test_sparse_key(unsigned int bits)
        printf("Test #2: successful key lookup (%u-bit).\n", bits);
        zerocount = 0;
        for (key = 0; key <= max_key && (key != 0 || zerocount < 1); key += 1ULL << (bits - 8)) {
-               struct cds_hlist_head *head;
+               struct cds_hlist_head head;
 
                rcu_read_lock();
                head = cds_ja_lookup(test_ja, key);
-               if (!head) {
+               if (cds_hlist_empty(&head)) {
                        fprintf(stderr, "Error lookup node %" PRIu64 "\n", key);
                        assert(0);
                }
@@ -373,11 +394,11 @@ int test_sparse_key(unsigned int bits)
                printf("Test #3: unsuccessful key lookup (%u-bit).\n", bits);
                zerocount = 0;
                for (key = 0; key <= max_key && (key != 0 || zerocount < 1); key += 1ULL << (bits - 8)) {
-                       struct cds_hlist_head *head;
+                       struct cds_hlist_head head;
 
                        rcu_read_lock();
                        head = cds_ja_lookup(test_ja, key + 42);
-                       if (head) {
+                       if (!cds_hlist_empty(&head)) {
                                fprintf(stderr,
                                        "Error unexpected lookup node %" PRIu64 "\n",
                                        key + 42);
@@ -390,7 +411,7 @@ int test_sparse_key(unsigned int bits)
                printf("OK\n");
        }
 
-       ret = cds_ja_destroy(test_ja);
+       ret = cds_ja_destroy(test_ja, free_node_cb);
        if (ret) {
                fprintf(stderr, "Error destroying judy array\n");
                return -1;