-
Notifications
You must be signed in to change notification settings - Fork 3
/
list.h
89 lines (72 loc) · 2.01 KB
/
list.h
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
/*
Copyright 2008-2011 Ostap Cherkashin
Copyright 2008-2011 Julius Chrobak
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
struct List {
void *elem;
struct List *next;
struct List *prev;
};
typedef struct List List;
static void list_del(List *e)
{
if (e->prev != NULL)
e->prev->next = e->next;
if (e->next != NULL)
e->next->prev = e->prev;
mem_free(e);
}
static List *list_next(List *e)
{
List *res = e->next;
list_del(e);
return res;
}
static List *list_prev(List *e)
{
List *res = e->prev;
list_del(e);
return res;
}
static List *list_prepend(List *dest, void *elem)
{
List *new = mem_alloc(sizeof(List));
new->elem = elem;
new->next = dest;
new->prev = NULL;
if (dest != NULL) {
new->prev = dest->prev;
if (dest->prev != NULL)
dest->prev->next = new;
dest->prev = new;
}
return new;
}
/* remove elements from the list using rm function:
- non-zero result indicates that the passed element should be removed
- rm is reponsible for freeing the actual elem
- new list head is passed to rm in case a nested loop is required */
static List *list_rm(List *list,
const void *cmp,
int (*rm)(List *head, void *elem, const void *cmp))
{
List *it = list, *res = NULL, *tmp = NULL;
while (it != NULL) {
tmp = it->next;
if (rm(res, it->elem, cmp))
list_del(it);
else if (res == NULL)
res = it;
it = tmp;
}
return res;
}