created llist files

it contains basic llist function, stolen from memory.c

include/llist.h

@@ -0,0 +1,32 @@
+/*
+This is part of WHY2
+Copyright (C) 2022 Václav Šmejkal
+
+This program is free software: you can redistribute it and/or modify
+it under the terms of the GNU General Public License as published by
+the Free Software Foundation, either version 3 of the License, or
+(at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program.  If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#ifndef WHY2_LLIST_H
+#define WHY2_LLIST_H
+
+typedef struct _why2_node
+{
+    void *value;
+    struct _why2_node *next;
+} why2_node_t; //SINGLE LINKED LIST
+
+void why2_push(void *value); //PUSH ELEMENT TO LIST BACK
+void why2_remove(why2_node_t *node); //REMOVE ELEMENT
+why2_node_t *why2_find(void *value); //FIND ELEMENT IN LIST
+
+#endif

src/core/lib/utils/llist.c

@@ -0,0 +1,99 @@
+/*
+This is part of WHY2
+Copyright (C) 2022 Václav Šmejkal
+
+This program is free software: you can redistribute it and/or modify
+it under the terms of the GNU General Public License as published by
+the Free Software Foundation, either version 3 of the License, or
+(at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program.  If not, see <https://www.gnu.org/licenses/>.
+*/
+
+#include <why2/llist.h>
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+why2_node_t *llist_head = NULL;
+
+void why2_push(void *value)
+{
+    //CREATE NODE
+    why2_node_t *new_node = malloc(sizeof(why2_node_t));
+    why2_node_t *buffer = llist_head;
+
+    //INSERT DATA
+    new_node -> value = value;
+    new_node -> next = NULL;
+
+    if (llist_head == NULL) //INIT LIST
+    {
+        llist_head = new_node;
+    } else
+    {
+        while (buffer -> next != NULL) buffer = buffer -> next; //GET TO THE END OF LIST
+
+        buffer -> next = new_node; //LINK
+    }
+}
+
+void why2_remove(why2_node_t *node)
+{
+    if (node == NULL) return; //NULL NODE
+
+    why2_node_t *buffer_1 = llist_head;
+    why2_node_t *buffer_2;
+
+    while (buffer_1 -> next != NULL) //GO TROUGH EVERY ELEMENT IN LIST
+    {
+        if (buffer_1 == node) break; //FOUND (IF THE WHILE GOES TROUGH THE WHOLE LIST WITHOUT THE break, I ASSUME THE LAST NODE IS THE CORRECT ONE)
+
+        buffer_1 = buffer_1 -> next;
+    }
+
+    if (node != buffer_1) return; //node WASN'T FOUND
+
+    if (buffer_1 == llist_head) //node WAS THE FIRST NODE IN THE LIST
+    {
+        //UNLINK
+        llist_head = buffer_1 -> next;
+    } else //wdyt
+    {
+        //GET THE NODE BEFORE node
+        buffer_2 = llist_head;
+
+        while (buffer_2 -> next != buffer_1) buffer_2 = buffer_2 -> next;
+
+        //UNLINK
+        buffer_2 -> next = buffer_1 -> next;
+    }
+
+    //DEALLOCATION
+    free(node);
+}
+
+why2_node_t *why2_find(void *value)
+{
+    if (llist_head == NULL) return NULL; //EMPTY LIST
+
+    why2_node_t *buffer = llist_head;
+
+    while (buffer -> next != NULL)
+    {
+        if (buffer -> value == value) return buffer;
+
+        buffer = buffer -> next;
+    }
+
+    if (value != buffer -> value) buffer = NULL; //PREVENT FROM RETURNING INVALID NODE
+
+    return buffer;
+}