mirror of
https://github.com/topjohnwu/ndk-busybox.git
synced 2024-12-04 01:43:11 +00:00
9be4702a30
function old new delta run_applet_no_and_exit 438 450 +12 ifupdown_main 2147 2149 +2 writeFileToTarball 1325 1326 +1 pidof_main 244 245 +1 last_main 896 897 +1 grep_main 779 780 +1 find_list_entry2 121 122 +1 tar_main 835 833 -2 llist_unlink 28 26 -2 llist_rev 23 21 -2 main 791 782 -9 ------------------------------------------------------------------------------ (add/remove: 0/0 grow/shrink: 7/4 up/down: 19/-15) Total: 4 bytes Signed-off-by: Denys Vlasenko <vda.linux@googlemail.com>
99 lines
1.9 KiB
C
99 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 Reutner-Fischer
|
|
* Copyright (C) 2006 Rob Landley <rob@landley.net>
|
|
*
|
|
* Licensed under GPLv2 or later, see file LICENSE in this source tree.
|
|
*/
|
|
|
|
#include "libbb.h"
|
|
|
|
/* Add data to the start of the linked list. */
|
|
void FAST_FUNC 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 FAST_FUNC llist_add_to_end(llist_t **list_head, void *data)
|
|
{
|
|
while (*list_head)
|
|
list_head = &(*list_head)->link;
|
|
*list_head = xzalloc(sizeof(llist_t));
|
|
(*list_head)->data = data;
|
|
/*(*list_head)->link = NULL;*/
|
|
}
|
|
|
|
/* Remove first element from the list and return it */
|
|
void* FAST_FUNC llist_pop(llist_t **head)
|
|
{
|
|
void *data = NULL;
|
|
llist_t *temp = *head;
|
|
|
|
if (temp) {
|
|
data = temp->data;
|
|
*head = temp->link;
|
|
free(temp);
|
|
}
|
|
return data;
|
|
}
|
|
|
|
/* Unlink arbitrary given element from the list */
|
|
void FAST_FUNC llist_unlink(llist_t **head, llist_t *elm)
|
|
{
|
|
if (!elm)
|
|
return;
|
|
while (*head) {
|
|
if (*head == elm) {
|
|
*head = (*head)->link;
|
|
break;
|
|
}
|
|
head = &(*head)->link;
|
|
}
|
|
}
|
|
|
|
/* Recursively free all elements in the linked list. If freeit != NULL
|
|
* call it on each datum in the list */
|
|
void FAST_FUNC llist_free(llist_t *elm, void (*freeit)(void *data))
|
|
{
|
|
while (elm) {
|
|
void *data = llist_pop(&elm);
|
|
|
|
if (freeit)
|
|
freeit(data);
|
|
}
|
|
}
|
|
|
|
/* Reverse list order. */
|
|
llist_t* FAST_FUNC 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;
|
|
}
|
|
|
|
llist_t* FAST_FUNC llist_find_str(llist_t *list, const char *str)
|
|
{
|
|
while (list) {
|
|
if (strcmp(list->data, str) == 0)
|
|
break;
|
|
list = list->link;
|
|
}
|
|
return list;
|
|
}
|