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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
|
#include <ccan/list/list.h>
#include <ccan/tap/tap.h>
#include <ccan/list/list.c>
#include "helper.h"
struct parent {
const char *name;
struct list_head children;
unsigned int num_children;
};
struct child {
const char *name;
struct list_node list;
};
static LIST_HEAD(static_list);
int main(int argc, char *argv[])
{
struct parent parent;
struct child c1, c2, c3, x1, *c, *n;
unsigned int i;
struct list_head list = LIST_HEAD_INIT(list);
opaque_t *q, *nq;
struct list_head opaque_list = LIST_HEAD_INIT(opaque_list);
LIST_HEAD(rev);
plan_tests(92);
/* Test LIST_HEAD, LIST_HEAD_INIT, list_empty and check_list */
ok1(list_empty(&static_list));
ok1(list_check(&static_list, NULL));
ok1(list_empty(&list));
ok1(list_check(&list, NULL));
parent.num_children = 0;
list_head_init(&parent.children);
/* Test list_head_init */
ok1(list_empty(&parent.children));
ok1(list_check(&parent.children, NULL));
c2.name = "c2";
list_add(&parent.children, &c2.list);
/* Test list_add and !list_empty. */
ok1(!list_empty(&parent.children));
ok1(c2.list.next == &parent.children.n);
ok1(c2.list.prev == &parent.children.n);
ok1(parent.children.n.next == &c2.list);
ok1(parent.children.n.prev == &c2.list);
/* Test list_check */
ok1(list_check(&parent.children, NULL));
c1.name = "c1";
list_add(&parent.children, &c1.list);
/* Test list_add and !list_empty. */
ok1(!list_empty(&parent.children));
ok1(c2.list.next == &parent.children.n);
ok1(c2.list.prev == &c1.list);
ok1(parent.children.n.next == &c1.list);
ok1(parent.children.n.prev == &c2.list);
ok1(c1.list.next == &c2.list);
ok1(c1.list.prev == &parent.children.n);
/* Test list_check */
ok1(list_check(&parent.children, NULL));
c3.name = "c3";
list_add_tail(&parent.children, &c3.list);
/* Test list_add_tail and !list_empty. */
ok1(!list_empty(&parent.children));
ok1(parent.children.n.next == &c1.list);
ok1(parent.children.n.prev == &c3.list);
ok1(c1.list.next == &c2.list);
ok1(c1.list.prev == &parent.children.n);
ok1(c2.list.next == &c3.list);
ok1(c2.list.prev == &c1.list);
ok1(c3.list.next == &parent.children.n);
ok1(c3.list.prev == &c2.list);
/* Test list_check */
ok1(list_check(&parent.children, NULL));
/* Test list_check_node */
ok1(list_check_node(&c1.list, NULL));
ok1(list_check_node(&c2.list, NULL));
ok1(list_check_node(&c3.list, NULL));
/* Test list_top */
ok1(list_top(&parent.children, struct child, list) == &c1);
/* Test list_pop */
ok1(list_pop(&parent.children, struct child, list) == &c1);
ok1(list_top(&parent.children, struct child, list) == &c2);
list_add(&parent.children, &c1.list);
/* Test list_tail */
ok1(list_tail(&parent.children, struct child, list) == &c3);
/* Test list_for_each. */
i = 0;
list_for_each(&parent.children, c, list) {
switch (i++) {
case 0:
ok1(c == &c1);
break;
case 1:
ok1(c == &c2);
break;
case 2:
ok1(c == &c3);
break;
}
if (i > 2)
break;
}
ok1(i == 3);
/* Test list_for_each_rev. */
i = 0;
list_for_each_rev(&parent.children, c, list) {
switch (i++) {
case 0:
ok1(c == &c3);
break;
case 1:
ok1(c == &c2);
break;
case 2:
ok1(c == &c1);
break;
}
if (i > 2)
break;
}
ok1(i == 3);
/* Test list_for_each_safe, list_del and list_del_from. */
i = 0;
list_for_each_safe(&parent.children, c, n, list) {
switch (i++) {
case 0:
ok1(c == &c1);
list_del(&c->list);
break;
case 1:
ok1(c == &c2);
list_del_from(&parent.children, &c->list);
break;
case 2:
ok1(c == &c3);
list_del_from(&parent.children, &c->list);
break;
}
/* prepare for list_for_each_rev_safe test */
list_add(&rev, &c->list);
ok1(list_check(&parent.children, NULL));
if (i > 2)
break;
}
ok1(i == 3);
ok1(list_empty(&parent.children));
/* Test list_for_each_rev_safe, list_del and list_del_from. */
i = 0;
list_for_each_rev_safe(&rev, c, n, list) {
switch (i++) {
case 0:
ok1(c == &c1);
list_del(&c->list);
break;
case 1:
ok1(c == &c2);
list_del_from(&rev, &c->list);
break;
case 2:
ok1(c == &c3);
list_del_from(&rev, &c->list);
break;
}
ok1(list_check(&rev, NULL));
if (i > 2)
break;
}
ok1(i == 3);
ok1(list_empty(&rev));
/* Test list_node_init: safe to list_del after this. */
list_node_init(&c->list);
list_del(&c->list);
/* Test list_del_init */
list_add(&parent.children, &c->list);
ok1(!list_empty(&parent.children));
list_del_init(&c->list);
ok1(list_empty(&parent.children));
/* We can call this as many times as we like. */
list_del_init(&c->list);
list_del_init(&c->list);
/* Test list_for_each_off. */
list_add_tail(&opaque_list,
(struct list_node *)create_opaque_blob());
list_add_tail(&opaque_list,
(struct list_node *)create_opaque_blob());
list_add_tail(&opaque_list,
(struct list_node *)create_opaque_blob());
i = 0;
list_for_each_off(&opaque_list, q, 0) {
i++;
ok1(if_blobs_know_the_secret(q));
}
ok1(i == 3);
/* Test list_for_each_safe_off, list_del_off and list_del_from_off. */
i = 0;
list_for_each_safe_off(&opaque_list, q, nq, 0) {
switch (i++) {
case 0:
ok1(if_blobs_know_the_secret(q));
list_del_off(q, 0);
destroy_opaque_blob(q);
break;
case 1:
ok1(if_blobs_know_the_secret(q));
list_del_from_off(&opaque_list, q, 0);
destroy_opaque_blob(q);
break;
case 2:
ok1(c == &c3);
list_del_from_off(&opaque_list, q, 0);
destroy_opaque_blob(q);
break;
}
ok1(list_check(&opaque_list, NULL));
if (i > 2)
break;
}
ok1(i == 3);
ok1(list_empty(&opaque_list));
/* Test list_top/list_tail/list_pop on empty list. */
ok1(list_top(&parent.children, struct child, list) == NULL);
ok1(list_tail(&parent.children, struct child, list) == NULL);
ok1(list_pop(&parent.children, struct child, list) == NULL);
/* Test list_add_before and list_add_after */
list_add(&parent.children, &c1.list);
list_add_after(&parent.children, &c1.list, &c2.list);
ok1(list_check(&parent.children, "list_add_after"));
i = 0;
list_for_each(&parent.children, c, list) {
switch (i++) {
case 0:
ok1(c == &c1);
break;
case 1:
ok1(c == &c2);
break;
}
}
ok1(i == 2);
list_add_before(&parent.children, &c2.list, &c3.list);
ok1(list_check(&parent.children, "list_add_before"));
i = 0;
list_for_each(&parent.children, c, list) {
switch (i++) {
case 0:
ok1(c == &c1);
break;
case 1:
ok1(c == &c3);
break;
case 2:
ok1(c == &c2);
break;
}
}
ok1(i == 3);
/* test list_swap */
list_swap(&c3.list, &x1.list);
ok1(list_check(&parent.children, "list_swap"));
i = 0;
list_for_each(&parent.children, c, list) {
switch (i++) {
case 0:
ok1(c == &c1);
break;
case 1:
ok1(c == &x1);
break;
case 2:
ok1(c == &c2);
break;
}
}
ok1(i == 3);
return exit_status();
}
|
