guillm/42sh
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

feat(utils): hash_map_free_ast

Browse source
This commit is contained in:
william.valenduc 2026-01-31 18:30:15 +00:00
parent 5eed5fa65f
commit 45d97fcc3f
1 changed files with 33 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

33
src/utils/hash_map/hash_map.c
View file

@ -7,6 +7,8 @@
#include <stdlib.h> #include <stdlib.h>
#include <string.h> #include <string.h>
#include "../ast/ast.h"
/* /*
** Hash the key using FNV-1a 32 bits hash algorithm. ** Hash the key using FNV-1a 32 bits hash algorithm.
*/ */
@ -36,6 +38,14 @@ static void destroy_pair_list(struct pair_list **p)
*p = NULL; *p = NULL;
} }
static void destroy_pair_list_ast(struct pair_list **p)
{
free((char *)(*p)->key);
ast_free((*p)->value);
free((*p));
*p = NULL;
}
struct hash_map *hash_map_init(size_t size) struct hash_map *hash_map_init(size_t size)
{ {
struct hash_map *p = malloc(sizeof(struct hash_map)); struct hash_map *p = malloc(sizeof(struct hash_map));
@ -120,6 +130,29 @@ void hash_map_free(struct hash_map **hash_map)
} }
} }
void hash_map_free_ast(struct hash_map **hash_map)
{
struct pair_list *l;
struct pair_list *prev;
if (hash_map != NULL && *hash_map != NULL)
{
for (size_t i = 0; i < (*hash_map)->size; i++)
{
l = (*hash_map)->data[i];
while (l != NULL)
{
prev = l;
l = l->next;
destroy_pair_list_ast(&prev);
}
}
free((*hash_map)->data);
free(*hash_map);
*hash_map = NULL;
}
}
void hash_map_foreach(struct hash_map *hash_map, void hash_map_foreach(struct hash_map *hash_map,
void (*fn)(const char *, const void *)) void (*fn)(const char *, const void *))
{ {