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 or later, see the file LICENSE in this tarball.
16 /* Add data to the start of the linked list. */
17 void llist_add_to(llist_t **old_head, void *data)
19 llist_t *new_head = xmalloc(sizeof(llist_t));
20 new_head->data = data;
21 new_head->link = *old_head;
25 /* Add data to the end of the linked list. */
26 void llist_add_to_end(llist_t **list_head, void *data)
28 llist_t *new_item = xmalloc(sizeof(llist_t));
29 new_item->data = data;
30 new_item->link = NULL;
32 if (!*list_head) *list_head = new_item;
34 llist_t *tail = *list_head;
35 while (tail->link) tail = tail->link;
36 tail->link = new_item;
40 /* Remove first element from the list and return it */
41 void *llist_pop(llist_t **head)
45 if(!*head) data = *head;
47 void *next = (*head)->link;
56 /* Recursively free all elements in the linked list. If freeit != NULL
57 * call it on each datum in the list */
58 void llist_free(llist_t *elm, void (*freeit)(void *data))
61 void *data = llist_pop(&elm);
62 if (freeit) freeit(data);
66 /* Reverse list order. Useful since getopt32 saves option params
68 llist_t* rev_llist(llist_t *list)
72 llist_t *next = list->link;