lennart/advent-of-code-2023
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fix: fix memory leak in map_put

Browse Source 
thanks dylan :)
This commit is contained in:
Lennart ten Wolde
2023-12-08 05:11:01 +01:00
parent a76c093c9f
commit 2fe7b6a4d6
2 changed files with 10 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
day_5.c
View File

@@ -9,12 +9,15 @@
int main() { int main() {
Map *map = map_create(); Map *map = map_create();
map_put(map, 0x0, 1);
map_put(map, 0x10, 2);
for(int i = 0; i < 10000; i++) { for(int i = 0; i < 10000; i++) {
map_put(map, i, i + 1); map_put(map, i, i + 1);
} }
for(int i = 0; i < 10000; i++) { // for(int i = 0; i < 10000; i++) {
assert(map_get(map, i) == i + 1); // assert(map_get(map, i) == i + 1);
} // }
map_free(map); map_free(map);
} }

6
map.c
View File

@@ -95,10 +95,12 @@ static __inline uint32_t map_index(Map *map, int key) {
__inline void map_set_node(Map *map, MapNode node) { __inline void map_set_node(Map *map, MapNode node) {
MapNode *current = &map->nodes[map_index(map, node.key)]; MapNode *current = &map->nodes[map_index(map, node.key)];
if(current->next == NULL || current->key == node.key) { if(current->next == NULL || current->key == node.key) {
if(current->next == NULL) map->size++;
current->key = node.key; current->key = node.key;
current->value = node.value; current->value = node.value;
current->next = (MapNode*) UINTPTR_MAX; if(current->next == NULL) {
map->size++;
current->next = (MapNode*) UINTPTR_MAX;
}
} else { } else {
while((size_t) current->next != UINTPTR_MAX) { while((size_t) current->next != UINTPTR_MAX) {
current = current->next; current = current->next;