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));
21 new_head->data = data;
22 new_head->link = *old_head;
26 /* Add data to the end of the linked list. */
27 void llist_add_to_end(llist_t **list_head, void *data)
29 llist_t *new_item = xmalloc(sizeof(llist_t));
31 new_item->data = data;
32 new_item->link = NULL;
35 *list_head = new_item;
37 llist_t *tail = *list_head;
41 tail->link = new_item;
45 /* Remove first element from the list and return it */
46 void *llist_pop(llist_t **head)
61 /* Unlink arbitrary given element from the list */
62 void llist_unlink(llist_t **head, llist_t *elm)
70 *head = (*head)->link;
74 for (crt = *head; crt; crt = crt->link) {
75 if (crt->link == elm) {
76 crt->link = elm->link;
82 /* Recursively free all elements in the linked list. If freeit != NULL
83 * call it on each datum in the list */
84 void llist_free(llist_t *elm, void (*freeit) (void *data))
87 void *data = llist_pop(&elm);
95 /* Reverse list order. */
96 llist_t *llist_rev(llist_t *list)
101 llist_t *next = list->link;