1 files changed, 50 insertions, 6 deletions

diff --git a/libc/list.c b/libc/list.c
index 89de4d0..7baae92 100644
--- a/libc/list.c
+++ b/libc/list.c
@@ -25,7 +25,7 @@ struct node *list_new_node()
 
 struct node *list_add_node(struct list *list, struct node *node)
 {
-	if (list == NULL)
+	if (!list || !node)
 		return NULL;
 
 	if (list->head == NULL) {
@@ -45,6 +45,49 @@ struct node *list_add_node(struct list *list, struct node *node)
 	return node;
 }
 
+struct node *list_last(struct list *list)
+{
+	if (!list || !list->head)
+		return NULL;
+
+	struct node *iterator = list->head;
+	while (iterator != NULL) {
+		if (iterator->next == NULL)
+			return iterator;
+		iterator = iterator->next;
+	}
+
+	return NULL;
+}
+
+struct node *list_first_data(struct list *list, void *data)
+{
+	if (!list || !list->head || !data)
+		return NULL;
+
+	struct node *iterator = list->head;
+	while (iterator != NULL) {
+		if (iterator->data == data)
+			return iterator;
+		iterator = iterator->next;
+	}
+
+	return NULL;
+}
+
+// TODO: Actually swap the nodes, not the data
+struct list *list_swap(struct list *list, struct node *a, struct node *b)
+{
+	if (!list || !list->head || !a || !b)
+		return NULL;
+
+	void *tmp = a->data;
+	a->data = b->data;
+	b->data = tmp;
+
+	return list;
+}
+
 struct node *list_add(struct list *list, void *data)
 {
 	struct node *node = list_new_node();
@@ -53,23 +96,24 @@ struct node *list_add(struct list *list, void *data)
 }
 
 // Maybe list_remove_node?
-void list_remove(struct list *list, struct node *node)
+struct list *list_remove(struct list *list, struct node *node)
 {
-	if (list == NULL || list->head == NULL)
-		return;
+	if (!list || !list->head || !node)
+		return NULL;
 
 	if (list->head == node) {
 		list->head = list->head->next;
-		return;
+		return list;
 	}
 
 	struct node *iterator = list->head->next;
 	while (iterator != node) {
 		iterator = iterator->next;
 		if (iterator == NULL)
-			return;
+			return NULL;
 	}
 
 	iterator->prev->next = iterator->next;
 	iterator->next->prev = iterator->prev;
+	return list;
 }