printf("\n\n");
}
+static
+int test_free_all_nodes(struct cds_ja *ja)
+{
+ uint64_t key;
+ struct cds_ja_node *ja_node;
+ int ret = 0;
+
+ rcu_read_lock();
+ cds_ja_for_each_key_rcu(test_ja, key, ja_node) {
+ struct cds_ja_node *tmp_node;
+
+ cds_ja_for_each_duplicate_safe_rcu(ja_node, tmp_node) {
+ ret = cds_ja_del(test_ja, key, ja_node);
+ if (ret) {
+ fprintf(stderr, "Error (%d) removing node %" PRIu64 "\n", ret, key);
+ goto end;
+ }
+ /* Alone using Judy array, OK to free now */
+ free_node(ja_node);
+ }
+ }
+end:
+ rcu_read_unlock();
+ return ret;
+}
+
static
int test_8bit_key(void)
{
uint64_t key;
uint64_t ka[] = { 5, 17, 100, 222 };
uint64_t ka_test_offset = 5;
+ struct cds_ja_node *ja_node;
/* Test with 8-bit key */
test_ja = cds_ja_new(8);
printf("Test #2: successful key lookup (8-bit).\n");
for (key = 0; key < 200; key++) {
- struct cds_ja_node *node;
-
rcu_read_lock();
- node = cds_ja_lookup(test_ja, key);
- if (!node) {
+ ja_node = cds_ja_lookup(test_ja, key);
+ if (!ja_node) {
fprintf(stderr, "Error lookup node %" PRIu64 "\n", key);
assert(0);
}
printf("OK\n");
printf("Test #3: unsuccessful key lookup (8-bit).\n");
for (key = 200; key < 240; key++) {
- struct cds_ja_node *node;
-
rcu_read_lock();
- node = cds_ja_lookup(test_ja, key);
- if (node) {
+ ja_node = cds_ja_lookup(test_ja, key);
+ if (ja_node) {
fprintf(stderr,
"Error unexpected lookup node %" PRIu64 "\n",
key);
printf("OK\n");
printf("Test #4: remove keys (8-bit).\n");
for (key = 0; key < 200; key++) {
- struct cds_ja_node *ja_node;
struct ja_test_node *node;
rcu_read_lock();
}
for (i = 0; i < CAA_ARRAY_SIZE(ka); i++) {
- struct cds_ja_node *ja_node;
struct ja_test_node *node;
uint64_t result_key;
}
for (i = 0; i < CAA_ARRAY_SIZE(ka); i++) {
- struct cds_ja_node *ja_node;
struct ja_test_node *node;
uint64_t result_key;
}
for (i = 0; i < CAA_ARRAY_SIZE(ka); i++) {
- struct cds_ja_node *ja_node;
struct ja_test_node *node;
uint64_t result_key;
printf("OK\n");
+ ret = test_free_all_nodes(test_ja);
+ if (ret) {
+ fprintf(stderr, "Error freeing all nodes\n");
+ return -1;
+ }
+
ret = cds_ja_destroy(test_ja, free_node);
if (ret) {
fprintf(stderr, "Error destroying judy array\n");
uint64_t key;
uint64_t ka[] = { 105, 206, 4000, 4111, 59990, 65435 };
uint64_t ka_test_offset = 100;
+ struct cds_ja_node *ja_node;
/* Test with 16-bit key */
test_ja = cds_ja_new(16);
printf("Test #2: successful key lookup (16-bit).\n");
for (key = 0; key < 10000; key++) {
//for (key = 0; key < 65536; key+=256) {
- struct cds_ja_node *node;
+ struct cds_ja_node *ja_node;
rcu_read_lock();
- node = cds_ja_lookup(test_ja, key);
- if (!node) {
+ ja_node = cds_ja_lookup(test_ja, key);
+ if (!ja_node) {
fprintf(stderr, "Error lookup node %" PRIu64 "\n", key);
assert(0);
}
printf("OK\n");
printf("Test #3: unsuccessful key lookup (16-bit).\n");
for (key = 11000; key <= 11002; key++) {
- struct cds_ja_node *node;
+ struct cds_ja_node *ja_node;
rcu_read_lock();
- node = cds_ja_lookup(test_ja, key);
- if (node) {
+ ja_node = cds_ja_lookup(test_ja, key);
+ if (ja_node) {
fprintf(stderr,
"Error unexpected lookup node %" PRIu64 "\n",
key);
printf("Test #4: remove keys (16-bit).\n");
for (key = 0; key < 10000; key++) {
//for (key = 0; key < 65536; key+=256) {
- struct cds_ja_node *ja_node;
struct ja_test_node *node;
rcu_read_lock();
}
for (i = 0; i < CAA_ARRAY_SIZE(ka); i++) {
- struct cds_ja_node *ja_node;
struct ja_test_node *node;
uint64_t result_key;
}
for (i = 0; i < CAA_ARRAY_SIZE(ka); i++) {
- struct cds_ja_node *ja_node;
struct ja_test_node *node;
uint64_t result_key;
}
for (i = 0; i < CAA_ARRAY_SIZE(ka); i++) {
- struct cds_ja_node *ja_node;
struct ja_test_node *node;
uint64_t result_key;
printf("OK\n");
+ ret = test_free_all_nodes(test_ja);
+ if (ret) {
+ fprintf(stderr, "Error freeing all nodes\n");
+ return -1;
+ }
+
ret = cds_ja_destroy(test_ja, free_node);
if (ret) {
fprintf(stderr, "Error destroying judy array\n");
{
uint64_t key, max_key;
int zerocount, i, ret;
+ struct cds_ja_node *ja_node;
if (bits == 64)
max_key = UINT64_MAX;
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_ja_node *ja_node;
struct ja_test_node *node;
int count = 0;
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_ja_node *ja_node;
-
rcu_read_lock();
ja_node = cds_ja_lookup(test_ja, key + 42);
if (ja_node) {
printf("Test #4: remove keys (%u-bit).\n", bits);
zerocount = 0;
for (key = 0; key <= max_key && (key != 0 || zerocount < 1); key += 1ULL << (bits - 8)) {
- struct cds_ja_node *ja_node;
int count = 0;
rcu_read_lock();
}
printf("OK\n");
+ ret = test_free_all_nodes(test_ja);
+ if (ret) {
+ fprintf(stderr, "Error freeing all nodes\n");
+ return -1;
+ }
+
ret = cds_ja_destroy(test_ja, free_node);
if (ret) {
fprintf(stderr, "Error destroying judy array\n");
}
rcu_thread_online_qsbr();
+ ret = test_free_all_nodes(test_ja);
+ if (ret) {
+ fprintf(stderr, "Error freeing all nodes\n");
+ return -1;
+ }
+
ret = cds_ja_destroy(test_ja, free_node);
if (ret) {
fprintf(stderr, "Error destroying judy array\n");