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
151
152
153
154
155
156
157
158
159
|
/*
A simple linked list implementation.
Copyright (C) 2006,2007,2009 Tavis Ormandy <taviso@sdf.lonestar.org>
This file is part of libscanmem.
This library is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published
by the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this library. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdlib.h>
#include "list.h"
/* create a new list */
list_t *l_init(void)
{
return calloc(1, sizeof(list_t));
}
/* destroy the whole list */
void l_destroy(list_t * list)
{
void *data;
if (list == NULL)
return;
/* remove every element */
while (list->size) {
l_remove(list, NULL, &data);
free(data);
}
free(list);
}
/* add a new element to the list */
int l_append(list_t * list, element_t * element, void *data)
{
element_t *n = calloc(1, sizeof(element_t));
if (n == NULL)
return -1;
n->data = data;
/* insert at head or tail */
if (element == NULL) {
if (list->size == 0) {
list->tail = n;
}
n->next = list->head;
list->head = n;
} else {
/* insertion at the middle of a list */
if (element->next == NULL) {
list->tail = n;
}
n->next = element->next;
element->next = n;
}
list->size++;
return 0;
}
/* concatenate list src with list dst */
int l_concat(list_t *dst, list_t **src)
{
void *data;
element_t *n;
n = (*src)->head;
while (n) {
l_remove(*src, NULL, &data);
if (l_append(dst, NULL, data) == -1)
return -1;
n = (*src)->head;
}
l_destroy(*src);
*src = NULL;
return 0;
}
/* remove the element at element->next */
void l_remove(list_t * list, element_t * element, void **data)
{
element_t *o;
/* remove from head */
if (element == NULL) {
if (data) {
*data = list->head->data;
}
o = list->head;
list->head = o->next;
if (list->size == 1) {
list->tail = NULL;
}
} else {
if (data) {
*data = element->next->data;
}
o = element->next;
if ((element->next = element->next->next) == NULL) {
list->tail = element;
}
}
if (data == NULL)
free(o->data);
free(o);
list->size--;
return;
}
/* remove the nth element */
void l_remove_nth(list_t * list, size_t n, void **data)
{
element_t *np = list->head;
/* traverse to correct element */
while (n--) {
if ((np = np->next) == NULL)
/* return */ abort();
}
l_remove(list, np, data);
}
|
