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
8 * Copyright (C) 2006 Rob Landley <rob@landley.net>
10 * Licensed under the GPL v2, see the file LICENSE in this tarball.
16 /* Add data to the start of the linked list. */
17 llist_t *llist_add_to(llist_t *old_head, void *data)
21 new_head = xmalloc(sizeof(llist_t));
22 new_head->data = data;
23 new_head->link = old_head;
29 #ifdef L_llist_add_to_end
30 /* Add data to the end of the linked list. */
31 llist_t *llist_add_to_end(llist_t *list_head, void *data)
35 new_item = xmalloc(sizeof(llist_t));
36 new_item->data = data;
37 new_item->link = NULL;
39 if (list_head == NULL) {
42 llist_t *tail = list_head;
45 tail->link = new_item;
52 /* Remove first element from the list and return it */
53 void *llist_pop(llist_t **head)
57 if(!*head) data = *head;
59 void *next = (*head)->link;
70 /* Recursively free all elements in the linked list. If freeit != NULL
71 * call it on each datum in the list */
72 void llist_free(llist_t *elm, void (*freeit)(void *data))
75 void *data = llist_pop(&elm);
76 if (freeit) freeit(data);