summaryrefslogtreecommitdiff
path: root/list.h
diff options
context:
space:
mode:
authorvenaas <venaas>2007-06-20 14:59:20 +0000
committervenaas <venaas@e88ac4ed-0b26-0410-9574-a7f39faa03bf>2007-06-20 14:59:20 +0000
commita30235ad2c9992fba307dedfdb5cdc5e3feaa226 (patch)
tree643ce6b662f9516a0e781b20c1cf5def4d1a5282 /list.h
parent9114cdf0d4a0fdd385f7798d0a6686b0551d3a6a (diff)
using linked lists instead of arrays
git-svn-id: https://svn.testnett.uninett.no/radsecproxy/trunk@147 e88ac4ed-0b26-0410-9574-a7f39faa03bf
Diffstat (limited to 'list.h')
-rw-r--r--list.h23
1 files changed, 23 insertions, 0 deletions
diff --git a/list.h b/list.h
new file mode 100644
index 0000000..876d345
--- /dev/null
+++ b/list.h
@@ -0,0 +1,23 @@
+struct list_node {
+ struct list_node *next;
+ void *data;
+};
+
+struct list {
+ struct list_node *first, *last;
+};
+
+/* allocates and initialises list structure; returns NULL if malloc fails */
+struct list *list_create();
+
+/* frees all memory associated with the list */
+void list_destroy(struct list *list);
+
+/* appends entry to list; returns 1 if ok, 0 if malloc fails */
+int list_add(struct list *list, void *data);
+
+/* returns first node */
+struct list_node *list_first(struct list *list);
+
+/* returns the next node after the argument */
+struct list_node *list_next(struct list_node *node);