|
 |
be0c12 |
From dcb475e97a48cddacab3ab5178fb351c702cdfb8 Mon Sep 17 00:00:00 2001
|
|
|
be0c12 |
From: Yu Watanabe <watanabe.yu+github@gmail.com>
|
|
|
be0c12 |
Date: Sun, 25 Nov 2018 21:54:44 +0900
|
|
|
be0c12 |
Subject: [PATCH] test: add tests for destructors of hashmap or set
|
|
|
be0c12 |
|
|
|
be0c12 |
(cherry picked from commit 98233ee5e031cf39f5be73651a1f05c52927116b)
|
|
|
be0c12 |
|
|
|
be0c12 |
Resolves: #2037807
|
|
|
be0c12 |
---
|
|
|
be0c12 |
src/test/test-hashmap-plain.c | 38 +++++++++++++++++++++++++++++++++++
|
|
|
be0c12 |
src/test/test-set.c | 19 ++++++++++++++++++
|
|
|
be0c12 |
2 files changed, 57 insertions(+)
|
|
|
be0c12 |
|
|
|
be0c12 |
diff --git a/src/test/test-hashmap-plain.c b/src/test/test-hashmap-plain.c
|
|
|
be0c12 |
index b695d4ee35..a34de067fc 100644
|
|
|
be0c12 |
--- a/src/test/test-hashmap-plain.c
|
|
|
be0c12 |
+++ b/src/test/test-hashmap-plain.c
|
|
|
be0c12 |
@@ -867,6 +867,43 @@ static void test_hashmap_clear_free_free(void) {
|
|
|
be0c12 |
|
|
|
be0c12 |
hashmap_clear_free_free(m);
|
|
|
be0c12 |
assert_se(hashmap_isempty(m));
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+ assert_se(hashmap_put(m, strdup("key 1"), strdup("value 1")) == 1);
|
|
|
be0c12 |
+ assert_se(hashmap_put(m, strdup("key 2"), strdup("value 2")) == 1);
|
|
|
be0c12 |
+ assert_se(hashmap_put(m, strdup("key 3"), strdup("value 3")) == 1);
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+ hashmap_clear_free_free(m);
|
|
|
be0c12 |
+ assert_se(hashmap_isempty(m));
|
|
|
be0c12 |
+}
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+DEFINE_PRIVATE_HASH_OPS_WITH_KEY_DESTRUCTOR(test_hash_ops_key, char, string_hash_func, string_compare_func, free);
|
|
|
be0c12 |
+DEFINE_PRIVATE_HASH_OPS_FULL(test_hash_ops_full, char, string_hash_func, string_compare_func, free, char, free);
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+static void test_hashmap_clear_free_with_destructor(void) {
|
|
|
be0c12 |
+ _cleanup_hashmap_free_ Hashmap *m = NULL;
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+ log_info("%s", __func__);
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+ m = hashmap_new(&test_hash_ops_key);
|
|
|
be0c12 |
+ assert_se(m);
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+ assert_se(hashmap_put(m, strdup("key 1"), NULL) == 1);
|
|
|
be0c12 |
+ assert_se(hashmap_put(m, strdup("key 2"), NULL) == 1);
|
|
|
be0c12 |
+ assert_se(hashmap_put(m, strdup("key 3"), NULL) == 1);
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+ hashmap_clear_free(m);
|
|
|
be0c12 |
+ assert_se(hashmap_isempty(m));
|
|
|
be0c12 |
+ m = hashmap_free(m);
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+ m = hashmap_new(&test_hash_ops_full);
|
|
|
be0c12 |
+ assert_se(m);
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+ assert_se(hashmap_put(m, strdup("key 1"), strdup("value 1")) == 1);
|
|
|
be0c12 |
+ assert_se(hashmap_put(m, strdup("key 2"), strdup("value 2")) == 1);
|
|
|
be0c12 |
+ assert_se(hashmap_put(m, strdup("key 3"), strdup("value 3")) == 1);
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+ hashmap_clear_free(m);
|
|
|
be0c12 |
+ assert_se(hashmap_isempty(m));
|
|
|
be0c12 |
}
|
|
|
be0c12 |
|
|
|
be0c12 |
static void test_hashmap_reserve(void) {
|
|
|
be0c12 |
@@ -924,5 +961,6 @@ void test_hashmap_funcs(void) {
|
|
|
be0c12 |
test_hashmap_steal_first_key();
|
|
|
be0c12 |
test_hashmap_steal_first();
|
|
|
be0c12 |
test_hashmap_clear_free_free();
|
|
|
be0c12 |
+ test_hashmap_clear_free_with_destructor();
|
|
|
be0c12 |
test_hashmap_reserve();
|
|
|
be0c12 |
}
|
|
|
be0c12 |
diff --git a/src/test/test-set.c b/src/test/test-set.c
|
|
|
be0c12 |
index 6307403e4c..340edeb65f 100644
|
|
|
be0c12 |
--- a/src/test/test-set.c
|
|
|
be0c12 |
+++ b/src/test/test-set.c
|
|
|
be0c12 |
@@ -45,6 +45,24 @@ static void test_set_free_with_destructor(void) {
|
|
|
be0c12 |
assert_se(items[3].seen == 0);
|
|
|
be0c12 |
}
|
|
|
be0c12 |
|
|
|
be0c12 |
+DEFINE_PRIVATE_HASH_OPS_WITH_VALUE_DESTRUCTOR(item_hash_ops, void, trivial_hash_func, trivial_compare_func, Item, item_seen);
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+static void test_set_free_with_hash_ops(void) {
|
|
|
be0c12 |
+ Set *m;
|
|
|
be0c12 |
+ struct Item items[4] = {};
|
|
|
be0c12 |
+ unsigned i;
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+ assert_se(m = set_new(&item_hash_ops));
|
|
|
be0c12 |
+ for (i = 0; i < ELEMENTSOF(items) - 1; i++)
|
|
|
be0c12 |
+ assert_se(set_put(m, items + i) == 1);
|
|
|
be0c12 |
+
|
|
|
be0c12 |
+ m = set_free(m);
|
|
|
be0c12 |
+ assert_se(items[0].seen == 1);
|
|
|
be0c12 |
+ assert_se(items[1].seen == 1);
|
|
|
be0c12 |
+ assert_se(items[2].seen == 1);
|
|
|
be0c12 |
+ assert_se(items[3].seen == 0);
|
|
|
be0c12 |
+}
|
|
|
be0c12 |
+
|
|
|
be0c12 |
static void test_set_put(void) {
|
|
|
be0c12 |
_cleanup_set_free_ Set *m = NULL;
|
|
|
be0c12 |
|
|
|
be0c12 |
@@ -64,6 +82,7 @@ static void test_set_put(void) {
|
|
|
be0c12 |
int main(int argc, const char *argv[]) {
|
|
|
be0c12 |
test_set_steal_first();
|
|
|
be0c12 |
test_set_free_with_destructor();
|
|
|
be0c12 |
+ test_set_free_with_hash_ops();
|
|
|
be0c12 |
test_set_put();
|
|
|
be0c12 |
|
|
|
be0c12 |
return 0;
|