Add a test case for handling of collisions.

2 files changed, 82 insertions, 0 deletions

diff --git a/tests/Makefile.am b/tests/Makefile.am
index 2a1f7eb..2f2a583 100644
--- a/tests/Makefile.am
+++ b/tests/Makefile.am
@@ -24,6 +24,7 @@ AM_CFLAGS = $(WARN_CFLAGS) -I..
 LDADD = ../libhash_table.la
 
 TESTS = \
+	collision \
 	delete_and_lookup \
 	delete_management \
 	destroy_callback \
diff --git a/tests/collision.c b/tests/collision.c
new file mode 100644
index 0000000..6518e04
--- /dev/null
+++ b/tests/collision.c
@@ -0,0 +1,81 @@
+/*
+ * Copyright © 2012 Intel Corporation
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a
+ * copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice (including the next
+ * paragraph) shall be included in all copies or substantial portions of the
+ * Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
+ * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+ * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+ * IN THE SOFTWARE.
+ *
+ * Authors:
+ *    Eric Anholt <eric@anholt.net>
+ */
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <assert.h>
+#include "hash_table.h"
+#include "fnv_hash.h"
+
+int
+main(int argc, char **argv)
+{
+	struct hash_table *ht;
+	const char *str1 = "test1";
+	const char *str2 = "test2";
+	struct hash_entry *entry1, *entry2;
+	uint32_t bad_hash = 5;
+	int i;
+
+	ht = hash_table_create(string_key_equals);
+
+	hash_table_insert(ht, bad_hash, str1, NULL);
+	hash_table_insert(ht, bad_hash, str2, NULL);
+
+	entry1 = hash_table_search(ht, bad_hash, str1);
+	assert(entry1->key == str1);
+
+	entry2 = hash_table_search(ht, bad_hash, str2);
+	assert(entry2->key == str2);
+
+	/* Check that we can still find #1 after inserting #2 */
+	entry1 = hash_table_search(ht, bad_hash, str1);
+	assert(entry1->key == str1);
+
+	/* Remove the collided entry and look again. */
+	hash_table_remove(ht, entry1);
+	entry2 = hash_table_search(ht, bad_hash, str2);
+	assert(entry2->key == str2);
+
+	/* Put str1 back, then spam junk into the table to force a
+	 * resize and make sure we can still find them both.
+	 */
+	hash_table_insert(ht, bad_hash, str1, NULL);
+	for (i = 0; i < 100; i++) {
+		char *key = malloc(10);
+		sprintf(key, "spam%d", i);
+		hash_table_insert(ht, fnv1_hash_string(key), key, NULL);
+	}
+	entry1 = hash_table_search(ht, bad_hash, str1);
+	assert(entry1->key == str1);
+	entry2 = hash_table_search(ht, bad_hash, str2);
+	assert(entry2->key == str2);
+
+	hash_table_destroy(ht, NULL);
+
+	return 0;
+}