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 void void_list_elt_init(void_list_elt_t
*elt
, void *data
)
26 INIT_LIST_HEAD(&elt
->node
);
30 void_list_elt_t
* void_list_elt_new (void *data
) {
32 /* freed in void_list_elt_deinit */
33 elt
= xcalloc(1, sizeof(void_list_elt_t
));
34 void_list_elt_init(elt
, data
);
38 void void_list_elt_deinit(void_list_elt_t
*elt
)
40 list_del_init(&elt
->node
);
41 void_list_elt_init(elt
, NULL
);
45 void void_list_init(void_list_t
*list
)
47 INIT_LIST_HEAD(&list
->head
);
50 void void_list_deinit(void_list_t
*list
)
54 while (!void_list_empty(list
)) {
55 elt
= void_list_pop(list
);
56 void_list_elt_deinit(elt
);
58 INIT_LIST_HEAD(&list
->head
);
61 void void_list_append(void_list_t
*list
, void *data
)
63 void_list_elt_t
*elt
= void_list_elt_new(data
);
64 list_add_tail(&elt
->node
, &list
->head
);
67 void void_list_push(void_list_t
*list
, void *data
)
69 void_list_elt_t
*elt
= void_list_elt_new(data
);
70 list_add(&elt
->node
, &list
->head
);
73 void_list_elt_t
*void_list_pop(void_list_t
*list
)
75 struct list_head
*node
;
77 if (void_list_empty(list
))
79 node
= list
->head
.next
;
81 return list_entry(node
, void_list_elt_t
, node
);
84 void *void_list_remove(void_list_t
*list
, void_list_elt_t
**iter
)
86 void_list_elt_t
*pos
, *n
;
87 void_list_elt_t
*old_elt
;
88 void *old_data
= NULL
;
93 old_data
= old_elt
->data
;
95 list_for_each_entry_safe(pos
, n
, &list
->head
, node
) {
99 if ( pos
!= old_elt
) {
100 fprintf(stderr
, "%s: ERROR: element not found in list\n", __FUNCTION__
);
104 *iter
= list_entry(pos
->node
.prev
, void_list_elt_t
, node
);
105 void_list_elt_deinit(pos
);
110 /* remove element containing elt data, using cmp(elt->data, target_data) == 0. */
111 void *void_list_remove_elt(void_list_t
*list
, const void *target_data
, void_list_cmp_t cmp
)
113 void_list_elt_t
*pos
, *n
;
114 void *old_data
= NULL
;
115 list_for_each_entry_safe(pos
, n
, &list
->head
, node
) {
116 if ( pos
->data
&& cmp(pos
->data
, target_data
)==0 ){
117 old_data
= pos
->data
;
118 void_list_elt_deinit(pos
);
125 void_list_elt_t
*void_list_first(void_list_t
*list
) {
126 struct list_head
*elt
;
129 elt
= list
->head
.next
;
130 if (elt
== &list
->head
) {
133 return list_entry(elt
, void_list_elt_t
, node
);
136 void_list_elt_t
*void_list_prev(void_list_t
*list
, void_list_elt_t
*node
) {
137 struct list_head
*elt
;
140 elt
= node
->node
.prev
;
141 if (elt
== &list
->head
) {
144 return list_entry(elt
, void_list_elt_t
, node
);
147 void_list_elt_t
*void_list_next(void_list_t
*list
, void_list_elt_t
*node
) {
148 struct list_head
*elt
;
151 elt
= node
->node
.next
;
152 if (elt
== &list
->head
) {
155 return list_entry(elt
, void_list_elt_t
, node
);
158 void_list_elt_t
*void_list_last(void_list_t
*list
) {
159 struct list_head
*elt
;
162 elt
= list
->head
.prev
;
163 if (elt
== &list
->head
) {
166 return list_entry(elt
, void_list_elt_t
, node
);