1 /* void_list.c - the opkg package management system
5 Copyright (C) 2001 University of Southern California
7 This program is free software; you can redistribute it and/or
8 modify it under the terms of the GNU General Public License as
9 published by the Free Software Foundation; either version 2, or (at
10 your option) any later version.
12 This program is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
18 #include "void_list.h"
19 #include "libbb/libbb.h"
21 void void_list_elt_init(void_list_elt_t *elt, void *data)
23 INIT_LIST_HEAD(&elt->node);
27 static void_list_elt_t * void_list_elt_new (void *data) {
29 /* freed in void_list_elt_deinit */
30 elt = xcalloc(1, sizeof(void_list_elt_t));
31 void_list_elt_init(elt, data);
35 void void_list_elt_deinit(void_list_elt_t *elt)
37 list_del_init(&elt->node);
38 void_list_elt_init(elt, NULL);
42 void void_list_init(void_list_t *list)
44 INIT_LIST_HEAD(&list->head);
47 void void_list_deinit(void_list_t *list)
51 while (!void_list_empty(list)) {
52 elt = void_list_pop(list);
53 void_list_elt_deinit(elt);
55 INIT_LIST_HEAD(&list->head);
58 void void_list_append(void_list_t *list, void *data)
60 void_list_elt_t *elt = void_list_elt_new(data);
61 list_add_tail(&elt->node, &list->head);
64 void void_list_push(void_list_t *list, void *data)
66 void_list_elt_t *elt = void_list_elt_new(data);
67 list_add(&elt->node, &list->head);
70 void_list_elt_t *void_list_pop(void_list_t *list)
72 struct list_head *node;
74 if (void_list_empty(list))
76 node = list->head.next;
78 return list_entry(node, void_list_elt_t, node);
81 void *void_list_remove(void_list_t *list, void_list_elt_t **iter)
83 void_list_elt_t *pos, *n;
84 void_list_elt_t *old_elt;
85 void *old_data = NULL;
90 old_data = old_elt->data;
92 list_for_each_entry_safe(pos, n, &list->head, node) {
96 if ( pos != old_elt) {
97 opkg_msg(ERROR, "Internal error: element not found in list.\n");
101 *iter = list_entry(pos->node.prev, void_list_elt_t, node);
102 void_list_elt_deinit(pos);
107 /* remove element containing elt data, using cmp(elt->data, target_data) == 0. */
108 void *void_list_remove_elt(void_list_t *list, const void *target_data, void_list_cmp_t cmp)
110 void_list_elt_t *pos, *n;
111 void *old_data = NULL;
112 list_for_each_entry_safe(pos, n, &list->head, node) {
113 if ( pos->data && cmp(pos->data, target_data)==0 ){
114 old_data = pos->data;
115 void_list_elt_deinit(pos);
122 void_list_elt_t *void_list_first(void_list_t *list) {
123 struct list_head *elt;
126 elt = list->head.next;
127 if (elt == &list->head ) {
130 return list_entry(elt, void_list_elt_t, node);
133 void_list_elt_t *void_list_prev(void_list_t *list, void_list_elt_t *node) {
134 struct list_head *elt;
137 elt = node->node.prev;
138 if (elt == &list->head ) {
141 return list_entry(elt, void_list_elt_t, node);
144 void_list_elt_t *void_list_next(void_list_t *list, void_list_elt_t *node) {
145 struct list_head *elt;
148 elt = node->node.next;
149 if (elt == &list->head ) {
152 return list_entry(elt, void_list_elt_t, node);
155 void_list_elt_t *void_list_last(void_list_t *list) {
156 struct list_head *elt;
159 elt = list->head.prev;
160 if (elt == &list->head ) {
163 return list_entry(elt, void_list_elt_t, node);