implemented doubly linked list in memory

please help me; this was painful

src/core/lib/utils/memory.c

@@ -1,24 +1,108 @@
+/*
+    bro this whole file is fucked up af...
+
+    ...or maybe I am...
+*/
+
 #include <why2/memory.h>
 
+#include <stdio.h>
 #include <stdlib.h>
 
+//LOCAL
+typedef struct node
+{
+    void *pointer;
+    struct node *next;
+    struct node *last;
+} node_t; //DOUBLY LINKED LIST
+
+node_t *head = NULL; //TODO: Find a way to deallocate this shit at the end
+
+void push_to_list(void *pointer)
+{
+    node_t *new_node = malloc(sizeof(node_t)); //CREATE ANOTHER ELEMENT
+    node_t *node_buffer_1;
+    node_t *node_buffer_2;
+    //int buffer = 0;
+
+    new_node -> pointer = pointer; //ALLOCATED POINTER
+    new_node -> next = NULL; //NEXT NODE
+    new_node -> last = NULL; //LAST NODE
+
+    if (head == NULL) //ALL MEMORY IS FREED (THERE AREN'T ANY NODES)
+    {
+        head = malloc(sizeof(node_t)); //INIT HEAD
+
+        new_node -> last = head;
+
+        head -> pointer = NULL;
+        head -> next = new_node; //LINK TO new_node
+    } else
+    {
+        node_buffer_1 = head;
+        node_buffer_2 = head;
+
+        while (node_buffer_1 -> next != NULL) //GET 'LAST' NODE (next POINTER)
+        {
+            node_buffer_1 = node_buffer_1 -> next;
+            //buffer++; //THIS WILL BE USED FOR GETTING last POINTER
+        }
+
+        /*for (int i = 0; i < buffer; i++) //GET NODE BEFORE THE 'LAST' ONE (last POINTER)
+        {
+            node_buffer_2 = node_buffer_2 -> next;
+        }*/
+
+        //LINK
+        node_buffer_1 -> next = new_node;
+        new_node -> last = node_buffer_1;
+        //new_node -> last = node_buffer_2; //idk i made it like this but found much better and easies solution | i would rather keep this here just in case I fucked something up
+    }
+}
+
+//GLOBAL
 void *why2_malloc(unsigned long size)
 {
-    //TODO: Add linked list
+    void *allocated = malloc(size);
 
-    return malloc(size);
+    push_to_list(allocated);
+
+    return allocated;
 }
 
 void *why2_calloc(unsigned long element, unsigned long size)
 {
-    //TODO: Add linked list
+    void *allocated = calloc(element, size);
 
-    return calloc(element, size);
+    push_to_list(allocated);
+
+    return allocated;
 }
 
 void why2_free(void *pointer)
 {
-    //TODO: Add linked list
+    //VARIABLES
+    node_t *node_buffer = head;
 
-    free(pointer);
+    //FIND pointer IN LINKED LIST
+    while (node_buffer -> next != NULL) //if pointer won't be found, nothing will happen | idk if I wanna fix this or leave it like this
+    {
+        node_buffer = node_buffer -> next;
+
+        if (node_buffer -> pointer == pointer) //FOUND
+        {
+            //REMOVE NODE
+            node_buffer -> last -> next = node_buffer -> next; //last WILL BE NEVER NULL CUZ CAN ONLY BE ANOTHER NODE OR HEAD
+            if (node_buffer -> next != NULL)
+            {
+                node_buffer -> next -> last = node_buffer -> last;
+            }
+
+            //DEALLOCATION
+            free(node_buffer -> pointer);
+            free(node_buffer);
+            break;
+        }
+    }
 }