Apple-2gs-SW/hush
1
0
Fork 0
mirror of https://github.com/sheumann/hush.git synced 2025-01-13 21:31:51 +00:00
Code Issues Projects Releases Wiki Activity

- indent

Browse Source
This commit is contained in:
Bernhard Reutner-Fischer 2007-02-04 20:32:38 +00:00
parent 7154b99c89
commit d909d23451
1 changed files with 20 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
libbb/llist.c
View File

@ -14,37 +14,44 @@
#include "libbb.h" #include "libbb.h"
/* Add data to the start of the linked list. */ /* Add data to the start of the linked list. */
void llist_add_to(llist_t **old_head, void *data) void llist_add_to(llist_t ** old_head, void *data)
{ {
llist_t *new_head = xmalloc(sizeof(llist_t)); llist_t *new_head = xmalloc(sizeof(llist_t));
new_head->data = data; new_head->data = data;
new_head->link = *old_head; new_head->link = *old_head;
*old_head = new_head; *old_head = new_head;
} }
/* Add data to the end of the linked list. */ /* Add data to the end of the linked list. */
void llist_add_to_end(llist_t **list_head, void *data) void llist_add_to_end(llist_t ** list_head, void *data)
{ {
llist_t *new_item = xmalloc(sizeof(llist_t)); llist_t *new_item = xmalloc(sizeof(llist_t));
new_item->data = data; new_item->data = data;
new_item->link = NULL; new_item->link = NULL;
if (!*list_head) *list_head = new_item; if (!*list_head)
*list_head = new_item;
else { else {
llist_t *tail = *list_head; llist_t *tail = *list_head;
while (tail->link) tail = tail->link;
while (tail->link)
tail = tail->link;
tail->link = new_item; tail->link = new_item;
} }
} }
/* Remove first element from the list and return it */ /* Remove first element from the list and return it */
void *llist_pop(llist_t **head) void *llist_pop(llist_t ** head)
{ {
void *data; void *data;
if(!*head) data = *head; if (!*head)
data = *head;
else { else {
void *next = (*head)->link; void *next = (*head)->link;
data = (*head)->data; data = (*head)->data;
free(*head); free(*head);
*head = next; *head = next;
@ -55,21 +62,25 @@ void *llist_pop(llist_t **head)
/* Recursively free all elements in the linked list. If freeit != NULL /* Recursively free all elements in the linked list. If freeit != NULL
* call it on each datum in the list */ * call it on each datum in the list */
void llist_free(llist_t *elm, void (*freeit)(void *data)) void llist_free(llist_t * elm, void (*freeit) (void *data))
{ {
while (elm) { while (elm) {
void *data = llist_pop(&elm); void *data = llist_pop(&elm);
if (freeit) freeit(data);
if (freeit)
freeit(data);
} }
} }
/* Reverse list order. Useful since getopt32 saves option params /* Reverse list order. Useful since getopt32 saves option params
* in reverse order */ * in reverse order */
llist_t* rev_llist(llist_t *list) llist_t *rev_llist(llist_t * list)
{ {
llist_t *new = NULL; llist_t *new = NULL;
while (list) { while (list) {
llist_t *next = list->link; llist_t *next = list->link;
list->link = new; list->link = new;
new = list; new = list;
list = next; list = next;