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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
#include <zebra.h>
#include "ospf6_linklist.h"
static struct linklist_node *
linklist_lookup_node (void *data, struct linklist *linklist)
{
struct linklist_node *node;
for (node = linklist->head; node; node = node->next)
{
if (linklist->cmp && (*linklist->cmp) (node->data, data) == 0)
return node;
if (node->data == data)
return node;
}
return NULL;
}
void *
linklist_lookup (void *data, struct linklist *linklist)
{
struct linklist_node *node;
node = linklist_lookup_node (data, linklist);
if (node)
return node->data;
return NULL;
}
int
linklist_add (void *data, struct linklist *linklist)
{
struct linklist_node *node = NULL, *add;
if (linklist_lookup_node (data, linklist))
return -1;
add = malloc (sizeof (struct linklist_node));
if (add == NULL)
return -1;
memset (add, 0, sizeof (struct linklist_node));
add->data = data;
if (linklist->cmp)
{
for (node = linklist->head; node; node = node->next)
{
if ((*linklist->cmp) (node->data, add->data) > 0)
break;
}
}
if (! node)
{
/* add to tail */
if (linklist->tail)
{
linklist->tail->next = add;
add->prev = linklist->tail;
}
else
{
linklist->head = add;
add->prev = NULL;
}
linklist->tail = add;
add->next = NULL;
}
else
{
/* insert just before 'node' */
if (node->prev)
{
node->prev->next = add;
add->prev = node->prev;
}
else
{
linklist->head = add;
add->prev = NULL;
}
add->next = node;
node->prev = add;
}
linklist->count++;
return 0;
}
int
linklist_remove (void *data, struct linklist *linklist)
{
struct linklist_node *rem;
rem = linklist_lookup_node (data, linklist);
if (rem == NULL)
return -1;
if (rem->prev)
rem->prev->next = rem->next;
else
linklist->head = rem->next;
if (rem->next)
rem->next->prev = rem->prev;
else
linklist->tail = rem->prev;
free (rem);
linklist->count--;
return 0;
}
void
linklist_head (struct linklist *linklist, struct linklist_node *node)
{
if (linklist->head == NULL)
{
node->prev = NULL;
node->next = NULL;
node->data = NULL;
return;
}
node->prev = linklist->head->prev;
node->next = linklist->head->next;
node->data = linklist->head->data;
}
int
linklist_end (struct linklist_node *node)
{
if (node->data == NULL && node->next == NULL)
return 1;
return 0;
}
void
linklist_next (struct linklist_node *node)
{
if (node->next == NULL)
{
node->prev = NULL;
node->next = NULL;
node->data = NULL;
return;
}
node->data = node->next->data;
node->prev = node->next->prev;
node->next = node->next->next;
}
struct linklist *
linklist_create ()
{
struct linklist *linklist;
linklist = malloc (sizeof (struct linklist));
if (linklist == NULL)
return NULL;
memset (linklist, 0, sizeof (struct linklist));
return linklist;
}
void
linklist_remove_all (struct linklist *linklist)
{
struct linklist_node node;
for (linklist_head (linklist, &node); ! linklist_end (&node);
linklist_next (&node))
linklist_remove (node.data, linklist);
}
void
linklist_delete (struct linklist *linklist)
{
linklist_remove_all (linklist);
assert (linklist->count == 0);
assert (linklist->head == NULL);
assert (linklist->tail == NULL);
free (linklist);
}
|
