mirror of
https://github.com/sheumann/hush.git
synced 2024-11-05 06:07:00 +00:00
8d9f495d68
function old new delta tar_main 705 695 -10 sort_main 928 918 -10 decode_format_string 886 876 -10 run_parts_main 197 185 -12 ps_main 513 500 -13 wget_main 2764 2750 -14 awk_main 1014 1000 -14 od_main 2886 2866 -20 llist_rev 25 - -25 ------------------------------------------------------------------------------ (add/remove: 0/1 grow/shrink: 0/8 up/down: 0/-128) Total: -128 bytes
110 lines
1.9 KiB
C
110 lines
1.9 KiB
C
/* vi: set sw=4 ts=4: */
|
|
/*
|
|
* linked list helper functions.
|
|
*
|
|
* Copyright (C) 2003 Glenn McGrath
|
|
* Copyright (C) 2005 Vladimir Oleynik
|
|
* Copyright (C) 2005 Bernhard Fischer
|
|
* Copyright (C) 2006 Rob Landley <rob@landley.net>
|
|
*
|
|
* Licensed under the GPL v2 or later, see the file LICENSE in this tarball.
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
#include "libbb.h"
|
|
|
|
/* Add data to the start of the linked list. */
|
|
void llist_add_to(llist_t **old_head, void *data)
|
|
{
|
|
llist_t *new_head = xmalloc(sizeof(llist_t));
|
|
|
|
new_head->data = data;
|
|
new_head->link = *old_head;
|
|
*old_head = new_head;
|
|
}
|
|
|
|
/* Add data to the end of the linked list. */
|
|
void llist_add_to_end(llist_t **list_head, void *data)
|
|
{
|
|
llist_t *new_item = xmalloc(sizeof(llist_t));
|
|
|
|
new_item->data = data;
|
|
new_item->link = NULL;
|
|
|
|
if (!*list_head)
|
|
*list_head = new_item;
|
|
else {
|
|
llist_t *tail = *list_head;
|
|
|
|
while (tail->link)
|
|
tail = tail->link;
|
|
tail->link = new_item;
|
|
}
|
|
}
|
|
|
|
/* Remove first element from the list and return it */
|
|
void *llist_pop(llist_t **head)
|
|
{
|
|
void *data, *next;
|
|
|
|
if (!*head)
|
|
return NULL;
|
|
|
|
data = (*head)->data;
|
|
next = (*head)->link;
|
|
free(*head);
|
|
*head = next;
|
|
|
|
return data;
|
|
}
|
|
|
|
/* Unlink arbitrary given element from the list */
|
|
void llist_unlink(llist_t **head, llist_t *elm)
|
|
{
|
|
llist_t *crt;
|
|
|
|
if (!(elm && *head))
|
|
return;
|
|
|
|
if (elm == *head) {
|
|
*head = (*head)->link;
|
|
return;
|
|
}
|
|
|
|
for (crt = *head; crt; crt = crt->link) {
|
|
if (crt->link == elm) {
|
|
crt->link = elm->link;
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Recursively free all elements in the linked list. If freeit != NULL
|
|
* call it on each datum in the list */
|
|
void llist_free(llist_t *elm, void (*freeit) (void *data))
|
|
{
|
|
while (elm) {
|
|
void *data = llist_pop(&elm);
|
|
|
|
if (freeit)
|
|
freeit(data);
|
|
}
|
|
}
|
|
|
|
#ifdef UNUSED
|
|
/* Reverse list order. */
|
|
llist_t *llist_rev(llist_t *list)
|
|
{
|
|
llist_t *rev = NULL;
|
|
|
|
while (list) {
|
|
llist_t *next = list->link;
|
|
|
|
list->link = rev;
|
|
rev = list;
|
|
list = next;
|
|
}
|
|
return rev;
|
|
}
|
|
#endif
|