2 * Copyright (c) 2007, Benedikt Sauter <sauter@ixbat.de>
5 * Short descripton of file:
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * * Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * * Redistributions in binary form must reproduce the above
15 * copyright notice, this list of conditions and the following
16 * disclaimer in the documentation and/or other materials provided
17 * with the distribution.
18 * * Neither the name of the FH Augsburg nor the names of its
19 * contributors may be used to endorse or promote products derived
20 * from this software without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
25 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
26 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
27 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
28 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
32 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 #include "../../malloc.h"
37 #include "../../string.h"
38 #include "../../bootmii_ppc.h"
40 struct list* list_create()
42 struct list *l = (struct list*)malloc(sizeof(struct list));
47 u8 list_add_tail(struct list *l, struct element *e)
51 /* if head is empty put first element here */
57 /* find last element */
58 struct element *iterator = l->head;
60 while(iterator->next!=NULL) {
61 iterator = iterator->next;
71 u8 list_delete_element(struct list *l, struct element *e)
73 struct element *iterator = l->head;
74 struct element *delete = NULL;
79 if(l->head->data && !(memcmp(l->head->data, e->data, sizeof(struct element)))) {
85 while(iterator->next!=NULL) {
86 if(iterator->next->data && !(memcmp(iterator->next->data, e->data, sizeof(struct element)))) {
87 delete = iterator->next;
88 iterator->next = iterator->next->next;
92 iterator = iterator->next;
103 // FIXME: untested and unused!!
104 u8 list_is_element_last(struct list *l, struct element *e)
114 // FIXME: untested and unused!!
115 struct element *list_find_next_element(struct list *l, struct element *e)
117 struct element *iterator = l->head;
119 while(iterator!=NULL){
121 return iterator->next;
122 iterator = iterator->next;