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"
23 int void_list_elt_init(void_list_elt_t *elt, void *data)
25 INIT_LIST_HEAD(&elt->node);
31 void_list_elt_t * void_list_elt_new (void *data) {
33 /* freed in void_list_elt_deinit */
34 elt = calloc(1, sizeof(void_list_elt_t));
36 fprintf(stderr, "%s: out of memory\n", __FUNCTION__);
39 void_list_elt_init(elt, data);
43 void void_list_elt_deinit(void_list_elt_t *elt)
45 list_del_init(&elt->node);
46 void_list_elt_init(elt, NULL);
50 int void_list_init(void_list_t *list)
52 INIT_LIST_HEAD(&list->head);
56 void void_list_deinit(void_list_t *list)
60 while (!void_list_empty(list)) {
61 elt = void_list_pop(list);
62 void_list_elt_deinit(elt);
64 INIT_LIST_HEAD(&list->head);
67 int void_list_append(void_list_t *list, void *data)
69 void_list_elt_t *elt = void_list_elt_new(data);
71 list_add_tail(&elt->node, &list->head);
76 int void_list_push(void_list_t *list, void *data)
78 void_list_elt_t *elt = void_list_elt_new(data);
80 list_add(&elt->node, &list->head);
85 void_list_elt_t *void_list_pop(void_list_t *list)
87 struct list_head *node;
89 if (void_list_empty(list))
91 node = list->head.next;
93 return list_entry(node, void_list_elt_t, node);
96 void *void_list_remove(void_list_t *list, void_list_elt_t **iter)
98 void_list_elt_t *pos, *n;
99 void_list_elt_t *old_elt;
100 void *old_data = NULL;
105 old_data = old_elt->data;
107 list_for_each_entry_safe(pos, n, &list->head, node) {
111 if ( pos != old_elt) {
112 fprintf(stderr, "%s: ERROR: element not found in list\n", __FUNCTION__);
116 *iter = list_entry(pos->node.prev, void_list_elt_t, node);
117 void_list_elt_deinit(pos);
122 /* remove element containing elt data, using cmp(elt->data, target_data) == 0. */
123 void *void_list_remove_elt(void_list_t *list, const void *target_data, void_list_cmp_t cmp)
125 void_list_elt_t *pos, *n;
126 void *old_data = NULL;
127 list_for_each_entry_safe(pos, n, &list->head, node) {
128 if ( pos->data && cmp(pos->data, target_data)==0 ){
129 old_data = pos->data;
130 void_list_elt_deinit(pos);
137 void_list_elt_t *void_list_first(void_list_t *list) {
138 struct list_head *elt;
141 elt = list->head.next;
142 if (elt == &list->head ) {
145 return list_entry(elt, void_list_elt_t, node);
148 void_list_elt_t *void_list_prev(void_list_t *list, void_list_elt_t *node) {
149 struct list_head *elt;
152 elt = node->node.prev;
153 if (elt == &list->head ) {
156 return list_entry(elt, void_list_elt_t, node);
159 void_list_elt_t *void_list_next(void_list_t *list, void_list_elt_t *node) {
160 struct list_head *elt;
163 elt = node->node.next;
164 if (elt == &list->head ) {
167 return list_entry(elt, void_list_elt_t, node);
170 void_list_elt_t *void_list_last(void_list_t *list) {
171 struct list_head *elt;
174 elt = list->head.prev;
175 if (elt == &list->head ) {
178 return list_entry(elt, void_list_elt_t, node);