1 /* vi: set sw=4 ts=4: */
3 * linked list helper functions.
5 * Copyright (C) 2003 Glenn McGrath
6 * Copyright (C) 2005 Vladimir Oleynik
7 * Copyright (C) 2005 Bernhard Fischer
9 * Licensed under the GPL v2, see the file LICENSE in this tarball.
15 /* Add data to the start of the linked list. */
16 llist_t *llist_add_to(llist_t *old_head, char *new_item)
20 new_head = xmalloc(sizeof(llist_t));
21 new_head->data = new_item;
22 new_head->link = old_head;
28 #ifdef L_llist_add_to_end
29 /* Add data to the end of the linked list. */
30 llist_t *llist_add_to_end(llist_t *list_head, char *data)
34 new_item = xmalloc(sizeof(llist_t));
35 new_item->data = data;
36 new_item->link = NULL;
38 if (list_head == NULL) {
41 llist_t *tail = list_head;
44 tail->link = new_item;
51 /* Remove first element from the list and return it */
52 void *llist_pop(llist_t **head)
56 if(!*head) data = *head;
58 void *next = (*head)->link;
60 *head = (*head)->link;
69 /* Recursively free all elements in the linked list. If freeit != NULL
70 * call it on each datum in the list */
71 void llist_free(llist_t *elm, void (*freeit)(void *data))
74 void *data = llist_pop(&elm);
75 if (freeit) freeit(data);