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.
21 #include "void_list.h"
22 #include "libbb/libbb.h"
24 int void_list_elt_init(void_list_elt_t *elt, void *data)
26 INIT_LIST_HEAD(&elt->node);
32 void_list_elt_t * void_list_elt_new (void *data) {
34 /* freed in void_list_elt_deinit */
35 elt = xcalloc(1, sizeof(void_list_elt_t));
36 void_list_elt_init(elt, data);
40 void void_list_elt_deinit(void_list_elt_t *elt)
42 list_del_init(&elt->node);
43 void_list_elt_init(elt, NULL);
47 int void_list_init(void_list_t *list)
49 INIT_LIST_HEAD(&list->head);
53 void void_list_deinit(void_list_t *list)
57 while (!void_list_empty(list)) {
58 elt = void_list_pop(list);
59 void_list_elt_deinit(elt);
61 INIT_LIST_HEAD(&list->head);
64 int void_list_append(void_list_t *list, void *data)
66 void_list_elt_t *elt = void_list_elt_new(data);
68 list_add_tail(&elt->node, &list->head);
73 int void_list_push(void_list_t *list, void *data)
75 void_list_elt_t *elt = void_list_elt_new(data);
77 list_add(&elt->node, &list->head);
82 void_list_elt_t *void_list_pop(void_list_t *list)
84 struct list_head *node;
86 if (void_list_empty(list))
88 node = list->head.next;
90 return list_entry(node, void_list_elt_t, node);
93 void *void_list_remove(void_list_t *list, void_list_elt_t **iter)
95 void_list_elt_t *pos, *n;
96 void_list_elt_t *old_elt;
97 void *old_data = NULL;
102 old_data = old_elt->data;
104 list_for_each_entry_safe(pos, n, &list->head, node) {
108 if ( pos != old_elt) {
109 fprintf(stderr, "%s: ERROR: element not found in list\n", __FUNCTION__);
113 *iter = list_entry(pos->node.prev, void_list_elt_t, node);
114 void_list_elt_deinit(pos);
119 /* remove element containing elt data, using cmp(elt->data, target_data) == 0. */
120 void *void_list_remove_elt(void_list_t *list, const void *target_data, void_list_cmp_t cmp)
122 void_list_elt_t *pos, *n;
123 void *old_data = NULL;
124 list_for_each_entry_safe(pos, n, &list->head, node) {
125 if ( pos->data && cmp(pos->data, target_data)==0 ){
126 old_data = pos->data;
127 void_list_elt_deinit(pos);
134 void_list_elt_t *void_list_first(void_list_t *list) {
135 struct list_head *elt;
138 elt = list->head.next;
139 if (elt == &list->head ) {
142 return list_entry(elt, void_list_elt_t, node);
145 void_list_elt_t *void_list_prev(void_list_t *list, void_list_elt_t *node) {
146 struct list_head *elt;
149 elt = node->node.prev;
150 if (elt == &list->head ) {
153 return list_entry(elt, void_list_elt_t, node);
156 void_list_elt_t *void_list_next(void_list_t *list, void_list_elt_t *node) {
157 struct list_head *elt;
160 elt = node->node.next;
161 if (elt == &list->head ) {
164 return list_entry(elt, void_list_elt_t, node);
167 void_list_elt_t *void_list_last(void_list_t *list) {
168 struct list_head *elt;
171 elt = list->head.prev;
172 if (elt == &list->head ) {
175 return list_entry(elt, void_list_elt_t, node);