+/*
+ * Copyright (C) 2006-2008 Stig Venaas <venaas@uninett.no>
+ *
+ * Permission to use, copy, modify, and distribute this software for any
+ * purpose with or without fee is hereby granted, provided that the above
+ * copyright notice and this permission notice appear in all copies.
+ */
+
struct list_node {
struct list_node *next;
void *data;
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);
+int list_push(struct list *list, void *data);
+
+/* removes first entry from list and returns data */
+void *list_shift(struct list *list);
+/* removes first entry with matching data pointer */
+void list_removedata(struct list *list, void *data);
+
/* returns first node */
struct list_node *list_first(struct list *list);