3 files changed, 101 insertions, 1 deletions
diff --git a/lib/Makefile b/lib/Makefile
index ef56b3a..c324891 100644
--- a/lib/Makefile
+++ b/lib/Makefile
@@ -8,7 +8,8 @@ COBJS = str.o \
 	print.o \
 	serial.o \
 	cpu.o \
-	sys.o
+	sys.o \
+	list.o
 CC = ../cross/opt/bin/i686-elf-gcc
 LD = ../cross/opt/bin/i686-elf-ld
 OC = ../cross/opt/bin/i686-elf-ar
diff --git a/lib/inc/list.h b/lib/inc/list.h
new file mode 100644
index 0000000..5deaf59
--- /dev/null
+++ b/lib/inc/list.h
@@ -0,0 +1,25 @@
+// MIT License, Copyright (c) 2020 Marvin Borner
+
+#ifndef LIST_H
+#define LIST_H
+
+#include <def.h>
+
+struct list {
+	struct node *head;
+};
+
+struct node {
+	void *data;
+	int nonce;
+	struct node *next;
+	struct node *prev;
+};
+
+struct list *list_new();
+/* struct node *list_new_node(); */ // TODO: Make node-specific things static/private?
+/* void list_add_node(struct list *list, struct node *node); */
+void list_add(struct list *list, void *data);
+void list_remove(struct list *list, struct node *node);
+
+#endif
diff --git a/lib/list.c b/lib/list.c
new file mode 100644
index 0000000..c36d6e1
--- /dev/null
+++ b/lib/list.c
@@ -0,0 +1,74 @@
+// MIT License, Copyright (c) 2020 Marvin Borner
+
+#include <def.h>
+#include <list.h>
+#include <mem.h>
+
+static int nonce = 0;
+
+struct list *list_new()
+{
+	struct list *list = malloc(sizeof(*list));
+	list->head = NULL;
+	return list;
+}
+
+struct node *list_new_node()
+{
+	struct node *node = malloc(sizeof(*node));
+	node->data = NULL;
+	node->prev = NULL;
+	node->next = NULL;
+	node->nonce = nonce++;
+	return node;
+}
+
+void list_add_node(struct list *list, struct node *node)
+{
+	if (list == NULL)
+		return;
+
+	if (list->head == NULL) {
+		list->head = node;
+		return;
+	}
+
+	struct node *iterator = list->head;
+	while (iterator != NULL) {
+		if (iterator->next == NULL) {
+			iterator->next = node;
+			node->prev = iterator;
+			break;
+		}
+		iterator = iterator->next;
+	}
+}
+
+void list_add(struct list *list, void *data)
+{
+	struct node *node = list_new_node();
+	node->data = data;
+	list_add_node(list, node);
+}
+
+// Maybe list_remove_node?
+void list_remove(struct list *list, struct node *node)
+{
+	if (list == NULL || list->head == NULL)
+		return;
+
+	if (list->head == node) {
+		list->head = list->head->next;
+		return;
+	}
+
+	struct node *iterator = list->head->next;
+	while (iterator != node) {
+		iterator = iterator->next;
+		if (iterator == NULL)
+			return;
+	}
+
+	iterator->prev->next = iterator->next;
+	iterator->next->prev = iterator->prev;
+}