refactor: generalized Makefile by adding CC and CFLAGS variables. Changed from realtive to absolute paths for includes

1 files changed, 0 insertions, 108 deletions

diff --git a/analyzer/utils/structures/hashmap.c b/analyzer/utils/structures/hashmap.c
deleted file mode 100644
index 5c7fdf9..0000000
--- a/analyzer/utils/structures/hashmap.c
+++ /dev/null
@@ -1,108 +0,0 @@
-#include "hashmap.h"
-
-#include <stdlib.h>
-#include <string.h>
-
-HashMap *hashmap_new(
-    size_t key_size, size_t value_size, size_t (*hash)(void *key), int (*compare)(void *key1, void *key2), void (*key_cleanup)(void *key),
-    void (*value_cleanup)(void *key)
-) {
-    HashMap *map = malloc(sizeof(HashMap));
-    // initialize NULLs
-    memset(map->table, 0, sizeof(HashMapNode *) * HASHMAP_TABLE_SIZE);
-    map->key_size = key_size;
-    map->value_size = value_size;
-    map->hash = hash;
-    map->compare = compare;
-    map->key_cleanup = key_cleanup;
-    map->value_cleanup = value_cleanup;
-    return map;
-}
-
-void hashmap_put(HashMap *map, void *key, void *value) {
-    size_t key_hash = map->hash(key);
-    HashMapNode *node = map->table[key_hash];
-
-    // check if it exists
-    while (node) {
-        // if it exists - update node
-        if (map->compare(key, node->key)) {
-            // ensure no hanging memory allocation
-            if (map->value_cleanup) {
-                map->value_cleanup(node);
-            }
-            memcpy(node->value, value, map->value_size);
-            return;
-        }
-        node = node->next;
-    }
-
-    // if it doesn't exist - create new node
-    HashMapNode *new_node = malloc(sizeof(HashMapNode));
-    new_node->key = malloc(map->key_size);
-    new_node->value = malloc(map->value_size);
-    memcpy(new_node->key, key, map->key_size);
-    memcpy(new_node->value, value, map->value_size);
-
-    // put in front of the linked list
-    new_node->next = map->table[key_hash];
-    map->table[key_hash] = new_node;
-}
-
-void *hashmap_get(HashMap *map, void *key) {
-    size_t key_hash = map->hash(key);
-    HashMapNode *node = map->table[key_hash];
-
-    // check if it exists
-    while (node) {
-        // if it exists - return the value pointer
-        if (map->compare(key, node->key)) {
-            return node->value;
-        }
-        node = node->next;
-    }
-
-    // if it doesn't exist - return NULL
-    return NULL;
-}
-
-void free_node_without_next(HashMap *map, HashMapNode *node) {
-    if (map->key_cleanup) {
-        map->key_cleanup(node);
-    }
-    if (map->value_cleanup) {
-        map->value_cleanup(node);
-    }
-    free(node->key);
-    free(node->value);
-    free(node);
-}
-
-void hashmap_delete(HashMap *map, void *key) {
-    size_t key_hash = map->hash(key);
-    HashMapNode **p_node = &map->table[key_hash];
-
-    // check if it exists
-    while (*p_node) {
-        // if it exists - delete it
-        if (map->compare(key, (*p_node)->key)) {
-            HashMapNode *next = (*p_node)->next;
-            free_node_without_next(map, *p_node);
-            *p_node = next;
-            return;
-        }
-        p_node = &(*p_node)->next;
-    }
-}
-
-void hashmap_free(HashMap *map) {
-    for (size_t i = 0; i < HASHMAP_TABLE_SIZE; i++) {
-        HashMapNode *curr = map->table[i];
-        while (curr) {
-            HashMapNode *next = curr->next;
-            free_node_without_next(map, curr);
-            curr = next;
-        }
-    }
-    free(map);
-}