+/* removes first entry from list and returns data */
+void *list_shift(struct list *list) {
+ struct list_node *node;
+ void *data;
+
+ if (!list || !list->first)
+ return NULL;
+
+ node = list->first;
+ list->first = node->next;
+ if (!list->first)
+ list->last = NULL;
+ data = node->data;
+ free(node);
+ list->count--;
+ return data;
+}
+
+/* removes all entries with matching data pointer */
+void list_removedata(struct list *list, void *data) {
+ struct list_node *node, *t;
+
+ if (!list || !list->first)
+ return;
+
+ node = list->first;
+ while (node->data == data) {
+ list->first = node->next;
+ free(node);
+ list->count--;
+ node = list->first;
+ if (!node) {
+ list->last = NULL;
+ return;
+ }
+ }
+ for (; node->next; node = node->next)
+ if (node->next->data == data) {
+ t = node->next;
+ node->next = t->next;
+ free(t);
+ list->count--;
+ if (!node->next) { /* we removed the last one */
+ list->last = node;
+ return;
+ }
+ }
+}
+