1 files changed, 69 insertions, 0 deletions
diff --git a/src/hashmap.c b/src/hashmap.c
new file mode 100644
index 0000000..cc7f2db
--- /dev/null
+++ b/src/hashmap.c
@@ -0,0 +1,69 @@
+/*
+ * Copyright (c) 2025 Quinn Stephens and the OSMORA team.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice,
+ *    this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright notice,
+ *    this list of conditions and the following disclaimer in the documentation
+ *    and/or other materials provided with the distribution.
+ * 3. Neither the name of the copyright holder nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS”
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <stddef.h>
+#include "hashmap.h"
+#include "log.h"
+
+void
+hashmap_remove(struct hashmap_entry *entry)
+{
+    list_remove(&entry->list_entry);
+}
+
+void
+hashmap_add(struct hashmap map, struct hashmap_entry *entry)
+{
+    list_prepend(&map.rows[entry->hash % map.row_count], &entry->list_entry);
+}
+
+struct hashmap_entry *
+hashmap_find(struct hashmap map, hash_t hash)
+{
+    struct hashmap_entry *head, *entry;
+
+    entry = head = (struct hashmap_entry *)map.rows[hash % map.row_count].head;
+    do {
+        if (entry->hash == hash) {
+            return entry;
+        }
+
+        entry = (struct hashmap_entry *)entry->list_entry.next;
+    } while (entry != head);
+
+    return NULL;
+}
+
+void
+hashmap_init(struct hashmap map)
+{
+    for (size_t r = 0; r < map.row_count; r++) {
+        list_init(&map.rows[r]);
+    }
+}