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)
30 /* freed in void_list_elt_deinit */
31 elt = xcalloc(1, sizeof(void_list_elt_t));
32 void_list_elt_init(elt, data);
36 void void_list_elt_deinit(void_list_elt_t * elt)
38 list_del_init(&elt->node);
39 void_list_elt_init(elt, NULL);
43 void void_list_init(void_list_t * list)
45 INIT_LIST_HEAD(&list->head);
48 void void_list_deinit(void_list_t * list)
52 while (!void_list_empty(list)) {
53 elt = void_list_pop(list);
54 void_list_elt_deinit(elt);
56 INIT_LIST_HEAD(&list->head);
59 void void_list_append(void_list_t * list, void *data)
61 void_list_elt_t *elt = void_list_elt_new(data);
62 list_add_tail(&elt->node, &list->head);
65 void void_list_push(void_list_t * list, void *data)
67 void_list_elt_t *elt = void_list_elt_new(data);
68 list_add(&elt->node, &list->head);
71 void_list_elt_t *void_list_pop(void_list_t * list)
73 struct list_head *node;
75 if (void_list_empty(list))
77 node = list->head.next;
79 return list_entry(node, void_list_elt_t, node);
82 void *void_list_remove(void_list_t * list, void_list_elt_t ** iter)
84 void_list_elt_t *pos, *n;
85 void_list_elt_t *old_elt;
86 void *old_data = NULL;
91 old_data = old_elt->data;
93 list_for_each_entry_safe(pos, n, &list->head, node) {
98 opkg_msg(ERROR, "Internal error: element not found in list.\n");
102 *iter = list_entry(pos->node.prev, void_list_elt_t, node);
103 void_list_elt_deinit(pos);
108 /* remove element containing elt data, using cmp(elt->data, target_data) == 0. */
109 void *void_list_remove_elt(void_list_t * list, const void *target_data,
112 void_list_elt_t *pos, *n;
113 void *old_data = NULL;
114 list_for_each_entry_safe(pos, n, &list->head, node) {
115 if (pos->data && cmp(pos->data, target_data) == 0) {
116 old_data = pos->data;
117 void_list_elt_deinit(pos);
124 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)
138 struct list_head *elt;
141 elt = node->node.prev;
142 if (elt == &list->head) {
145 return list_entry(elt, void_list_elt_t, node);
148 void_list_elt_t *void_list_next(void_list_t * list, void_list_elt_t * node)
150 struct list_head *elt;
153 elt = node->node.next;
154 if (elt == &list->head) {
157 return list_entry(elt, void_list_elt_t, node);
160 void_list_elt_t *void_list_last(void_list_t * list)
162 struct list_head *elt;
165 elt = list->head.prev;
166 if (elt == &list->head) {
169 return list_entry(elt, void_list_elt_t, node);