init: fix logically inverted FEATURE_EXTRA_QUIET check

[oweals/busybox.git] / libbb / llist.c

diff --git a/libbb/llist.c b/libbb/llist.c
index cb87176c5292bfa379479ae6298cc96c7beff33b..51b1ce6c99c979dc9741818fffd64ab341f4598d 100644 (file)
--- a/libbb/llist.c
+++ b/libbb/llist.c
@@ -1,43 +1,98 @@
-#include <stdlib.h>
-#include <string.h>
-#include "unarchive.h"
+/* 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 the GPL v2 or later, see the file LICENSE in this tarball.
+ */
+
 #include "libbb.h"
 
-#ifdef L_llist_add_to
-extern llist_t *llist_add_to(llist_t *old_head, char *new_item)
+/* 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;
+       llist_t *new_head = xmalloc(sizeof(llist_t));
 
-       new_head = xmalloc(sizeof(llist_t));
-       new_head->data = new_item;
-       new_head->link = old_head;
+       new_head->data = data;
+       new_head->link = *old_head;
+       *old_head = new_head;
+}
 
-       return (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;*/
 }
-#endif
 
-#ifdef L_llist_add_to_end
-extern llist_t *llist_add_to_end(llist_t *list_head, char *data)
+/* Remove first element from the list and return it */
+void* FAST_FUNC llist_pop(llist_t **head)
 {
-       llist_t *new_item, *tmp, *prev;
+       void *data = NULL;
+       llist_t *temp = *head;
 
-       new_item = xmalloc(sizeof(llist_t));
-       new_item->data = data;
-       new_item->link = NULL;
+       if (temp) {
+               data = temp->data;
+               *head = temp->link;
+               free(temp);
+       }
+       return data;
+}
 
-       prev = NULL;
-       tmp = list_head;
-       while (tmp) {
-               prev = tmp;
-               tmp = tmp->link;
+/* 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;
        }
-       if (prev) {
-               prev->link = new_item;
-       } else {
-               list_head = new_item;
+}
+
+/* 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;
 
-       return (list_head);
+               list->link = rev;
+               rev = list;
+               list = next;
+       }
+       return rev;
 }
-#endif
 
+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;
+}