Check in and expose a linked list.

src/CMakeLists.txt

@@ -42,6 +42,7 @@ set(LIBRARY_SOURCES
   houdini_html_e.c
   houdini_html_u.c
   cmark_ctype.c
+  linked_list.c
   ${HEADERS}
   )
 

src/cmark.h

@@ -106,6 +106,46 @@ typedef struct cmark_mem {
   void (*free)(void *);
 } cmark_mem;
 
+/**
+ * ## Basic data structures
+ *
+ * To keep dependencies to the strict minimum, libcmark implements
+ * its own versions of "classic" data structures.
+ */
+
+/**
+ * ### Linked list
+ */
+
+/** A generic singly linked list.
+ */
+typedef struct _cmark_llist
+{
+  struct _cmark_llist *next;
+  void         *data;
+} cmark_llist;
+
+typedef void (*CMarkListFreeFunc)(void *data);
+
+/** Append an element to the linked list, return the possibly modified
+ * head of the list.
+ */
+CMARK_EXPORT
+cmark_llist * cmark_llist_append    (cmark_llist       * head,
+                                     void              * data);
+
+/** Free the list starting with 'head', calling 'free_func' with the
+ *  data pointer of each of its elements
+ */
+CMARK_EXPORT
+void          cmark_llist_free_full (cmark_llist       * head,
+                                     CMarkListFreeFunc   free_func);
+
+/** Free the list starting with 'head'
+ */
+CMARK_EXPORT
+void          cmark_llist_free      (cmark_llist       * head);
+
 /**
  * ## Creating and Destroying Nodes
  */

src/linked_list.c

@@ -0,0 +1,37 @@
+#include <stdlib.h>
+
+#include "cmark.h"
+
+cmark_llist *cmark_llist_append(cmark_llist *head, void *data) {
+  cmark_llist *tmp;
+  cmark_llist *new_node = malloc(sizeof(cmark_llist));
+
+  new_node->data = data;
+  new_node->next = NULL;
+
+  if (!head)
+    return new_node;
+
+  for (tmp = head; tmp->next; tmp=tmp->next);
+
+  tmp->next = new_node;
+
+  return head;
+}
+
+void cmark_llist_free_full(cmark_llist *head, CMarkListFreeFunc free_func) {
+  cmark_llist *tmp, *prev;
+
+  for (tmp = head; tmp;) {
+    if (free_func)
+      free_func(tmp->data);
+
+    prev = tmp;
+    tmp = tmp->next;
+    free(prev);
+  }
+}
+
+void cmark_llist_free(cmark_llist *head) {
+  cmark_llist_free_full(head, NULL);
+}