X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~ianmdlvl/git?a=blobdiff_plain;f=src%2Ftest%2Ftest-hashmap-plain.c;h=84b508f874e754efd7d8f72b1cd41a8828e8d141;hb=caac2704d57ef6d95f7053456479353bae3638de;hp=f7917521c572e8dd61fc47cbe7fd1a1840dd3f71;hpb=ce79279bff6e7a1a17070509a039ab635796f129;p=elogind.git diff --git a/src/test/test-hashmap-plain.c b/src/test/test-hashmap-plain.c index f7917521c..84b508f87 100644 --- a/src/test/test-hashmap-plain.c +++ b/src/test/test-hashmap-plain.c @@ -194,8 +194,8 @@ static void test_hashmap_move(void) { hashmap_put(m, "key 3", val3); hashmap_put(m, "key 4", val4); - assert(hashmap_move(n, NULL) == 0); - assert(hashmap_move(n, m) == 0); + assert_se(hashmap_move(n, NULL) == 0); + assert_se(hashmap_move(n, m) == 0); assert_se(hashmap_size(m) == 1); r = hashmap_get(m, "key 1"); @@ -245,14 +245,19 @@ static void test_hashmap_put(void) { Hashmap *m = NULL; int valid_hashmap_put; void *val1 = (void*) "val 1"; + void *val2 = (void*) "val 2"; + _cleanup_free_ char* key1 = NULL; - hashmap_ensure_allocated(&m, &string_hash_ops); + assert_se(hashmap_ensure_allocated(&m, &string_hash_ops) >= 0); assert_se(m); valid_hashmap_put = hashmap_put(m, "key 1", val1); assert_se(valid_hashmap_put == 1); assert_se(hashmap_put(m, "key 1", val1) == 0); - assert_se(hashmap_put(m, "key 1", (void *)"val 2") == -EEXIST); + assert_se(hashmap_put(m, "key 1", val2) == -EEXIST); + key1 = strdup("key 1"); + assert_se(hashmap_put(m, key1, val1) == 0); + assert_se(hashmap_put(m, key1, val2) == -EEXIST); hashmap_free(m); } @@ -380,6 +385,7 @@ static void test_hashmap_remove_and_replace(void) { void *key2 = UINT_TO_PTR(2); void *key3 = UINT_TO_PTR(3); void *r; + int i, j; m = hashmap_new(&trivial_hash_ops); assert_se(m); @@ -407,6 +413,25 @@ static void test_hashmap_remove_and_replace(void) { r = hashmap_get(m, key2); assert_se(r == key2); assert_se(!hashmap_get(m, key3)); + + /* Repeat this test several times to increase the chance of hitting + * the less likely case in hashmap_remove_and_replace where it + * compensates for the backward shift. */ + for (i = 0; i < 20; i++) { + hashmap_clear(m); + + for (j = 1; j < 7; j++) + hashmap_put(m, UINT_TO_PTR(10*i + j), UINT_TO_PTR(10*i + j)); + valid = hashmap_remove_and_replace(m, UINT_TO_PTR(10*i + 1), + UINT_TO_PTR(10*i + 2), + UINT_TO_PTR(10*i + 2)); + assert_se(valid == 0); + assert_se(!hashmap_get(m, UINT_TO_PTR(10*i + 1))); + for (j = 2; j < 7; j++) { + r = hashmap_get(m, UINT_TO_PTR(10*i + j)); + assert_se(r == UINT_TO_PTR(10*i + j)); + } + } } static void test_hashmap_ensure_allocated(void) {