1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
/*
* Copyright © 2004 Red Hat, Inc.
*
* Permission to use, copy, modify, distribute, and sell this software and its
* documentation for any purpose is hereby granted without fee, provided that
* the above copyright notice appear in all copies and that both that
* copyright notice and this permission notice appear in supporting
* documentation, and that the name of Red Hat not be used in advertising or
* publicity pertaining to distribution of the software without specific,
* written prior permission. Red Hat makes no representations about the
* suitability of this software for any purpose. It is provided "as is"
* without express or implied warranty.
*
* RED HAT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL RED HAT
* BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
* OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
* CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
* Author: Matthias Clasen, Red Hat, Inc.
*/
#include <stdlib.h>
#include <list.h>
void
list_foreach (List *list,
Callback func,
void *user_data)
{
while (list)
{
func (list->data, user_data);
list = list->next;
}
}
List *
list_prepend (List *list,
void *data)
{
List *link;
link = (List *) malloc (sizeof (List));
link->next = list;
link->data = data;
return link;
}
void
list_free (List *list)
{
while (list)
{
List *next = list->next;
free (list);
list = next;
}
}
List *
list_find (List *list,
ListFindFunc func,
void *user_data)
{
List *tmp;
for (tmp = list; tmp; tmp = tmp->next)
{
if ((*func) (tmp->data, user_data))
break;
}
return tmp;
}
List *
list_remove (List *list,
void *data)
{
List *tmp, *prev;
prev = NULL;
for (tmp = list; tmp; tmp = tmp->next)
{
if (tmp->data == data)
{
if (prev)
prev->next = tmp->next;
else
list = tmp->next;
free (tmp);
break;
}
prev = tmp;
}
return list;
}
int
list_length (List *list)
{
List *tmp;
int length;
length = 0;
for (tmp = list; tmp; tmp = tmp->next)
length++;
return length;
}
List *
list_copy (List *list)
{
List *new_list = NULL;
if (list)
{
List *last;
new_list = (List *) malloc (sizeof (List));
new_list->data = list->data;
new_list->next = NULL;
last = new_list;
list = list->next;
while (list)
{
last->next = (List *) malloc (sizeof (List));
last = last->next;
last->data = list->data;
list = list->next;
}
last->next = NULL;
}
return new_list;
}
|
