Added linked list skeleton.

Author: kyle-github

datastructures/linkedlist.h

@@ -0,0 +1,34 @@
+#include <stddef.h>
+
+struct list_node_t {
+    struct list_node_t *next;
+};
+
+typedef struct list_node_t *list_node_p;
+typedef struct list_node_t list_node_t;
+
+int list_insert(list_node_p *list, list_node_p node)
+{
+    node->next = *list;
+    *list = node;
+
+    return 0;
+}
+
+
+int list_remove(list_node_p *list, list_node_p node)
+{
+    list_node_p *indirect_next = list;
+
+    while(*indirect_next && *indirect_next != node) {
+        indirect_next = &(*indirect_next)->next;
+    }
+
+    if(*indirect_next == node) {
+        *indirect_next = node->next;
+    }
+
+    return 0;
+}
+
+#define container_of(ptr, type, member) ((type *)((char *)(ptr) - offsetof(type, member)))

datastructures/linkedlist_test.c

@@ -0,0 +1,25 @@
+#include <stdio.h>
+
+#include "linkedlist.h"
+
+struct test_data {
+    int i;
+    list_node_t list;
+};
+
+int main()
+{
+    list_node_p list = NULL;
+    struct test_data nodes[3] = { {0,NULL}, {1,NULL}, {2,NULL}};
+
+    list_insert(&list,&(nodes[2].list));
+    list_insert(&list,&(nodes[0].list));
+    list_insert(&list,&(nodes[1].list));
+
+    for(list_node_p node_p = list; node_p; node_p = node_p->next) {
+        struct test_data *data_p = container_of(node_p, struct test_data, list);
+        printf("Node data %d\n",data_p->i);
+    }
+
+    return 0;
+}