summaryrefslogtreecommitdiff
path: root/hash_table.h
diff options
context:
space:
mode:
authorEric Anholt <eric@anholt.net>2009-11-23 10:58:33 +0100
committerEric Anholt <eric@anholt.net>2009-11-23 10:58:33 +0100
commit3181f54ca8a77d7694aaf42a87e5a59986fdbe8e (patch)
treee1495bf43764d35f5de3688b2ab91e18028a7776 /hash_table.h
Initial import of hash_table.
This is entirely written by myself, with the exception of the hash_sizes[] contents which come from the hash_table implementation in nickle, which I decided to not use.
Diffstat (limited to 'hash_table.h')
-rw-r--r--hash_table.h59
1 files changed, 59 insertions, 0 deletions
diff --git a/hash_table.h b/hash_table.h
new file mode 100644
index 0000000..0d7afee
--- /dev/null
+++ b/hash_table.h
@@ -0,0 +1,59 @@
+/*
+ * Copyright © 2009 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 <inttypes.h>
+
+struct hash_entry {
+ uint32_t hash;
+ const void *key;
+ void *data;
+};
+
+struct hash_table {
+ struct hash_entry *table;
+ uint32_t (*hash_function)(const void *key);
+ int (*key_equals_function)(const void *a, const void *b);
+ uint32_t size;
+ uint32_t rehash;
+ uint32_t max_entries;
+ uint32_t size_index;
+ uint32_t entries;
+};
+
+struct hash_table *hash_table_create(uint32_t (*hash_function)(const void *key),
+ int (*key_equals_function)(const void *a,
+ const void *b));
+void hash_table_destroy(struct hash_table *ht,
+ void (*delete_function)(struct hash_entry *entry));
+
+struct hash_entry *hash_table_insert(struct hash_table *ht, const void *key,
+ void *data);
+struct hash_entry *hash_table_search(struct hash_table *ht, const void *key);
+
+void hash_table_delete_entry(struct hash_table *ht, struct hash_entry *entry);
+struct hash_entry *hash_table_next_entry(struct hash_table *ht,
+ struct hash_entry *entry);