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
|
#include <ccan/list/list.h>
#include <ccan/tap/tap.h>
#include <ccan/list/list.c>
#include "helper.h"
struct parent {
const char *name;
unsigned int num_children;
struct list_head children;
};
struct child {
const char *name;
struct list_node list;
};
int main(int argc, char *argv[])
{
struct parent parent;
struct child c1, c2, c3;
const struct parent *p;
const struct child *c;
plan_tests(20);
parent.num_children = 0;
list_head_init(&parent.children);
c1.name = "c1";
list_add(&parent.children, &c1.list);
ok1(list_next(&parent.children, &c1, list) == NULL);
ok1(list_prev(&parent.children, &c1, list) == NULL);
c2.name = "c2";
list_add_tail(&parent.children, &c2.list);
ok1(list_next(&parent.children, &c1, list) == &c2);
ok1(list_prev(&parent.children, &c1, list) == NULL);
ok1(list_next(&parent.children, &c2, list) == NULL);
ok1(list_prev(&parent.children, &c2, list) == &c1);
c3.name = "c3";
list_add_tail(&parent.children, &c3.list);
ok1(list_next(&parent.children, &c1, list) == &c2);
ok1(list_prev(&parent.children, &c1, list) == NULL);
ok1(list_next(&parent.children, &c2, list) == &c3);
ok1(list_prev(&parent.children, &c2, list) == &c1);
ok1(list_next(&parent.children, &c3, list) == NULL);
ok1(list_prev(&parent.children, &c3, list) == &c2);
/* Const variants */
p = &parent;
c = &c2;
ok1(list_next(&p->children, &c1, list) == &c2);
ok1(list_prev(&p->children, &c1, list) == NULL);
ok1(list_next(&p->children, c, list) == &c3);
ok1(list_prev(&p->children, c, list) == &c1);
ok1(list_next(&parent.children, c, list) == &c3);
ok1(list_prev(&parent.children, c, list) == &c1);
ok1(list_next(&p->children, &c3, list) == NULL);
ok1(list_prev(&p->children, &c3, list) == &c2);
return exit_status();
}
|
