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
|
#define CCAN_DGRAPH_DEBUG 1
#include <ccan/dgraph/dgraph.h>
/* Include the C files directly. */
#include <ccan/dgraph/dgraph.c>
#include <ccan/tap/tap.h>
static bool count_nodes(struct dgraph_node *n, unsigned int *count)
{
(*count)++;
return true;
}
static bool stop_traverse(struct dgraph_node *n, unsigned int *count)
{
if (--(*count) == 0)
return false;
return true;
}
int main(void)
{
struct dgraph_node n1, n2, n3;
unsigned int count = 0;
/* This is how many tests you plan to run */
plan_tests(42);
dgraph_init_node(&n1);
ok1(dgraph_check(&n1, NULL) == &n1);
count = 0;
dgraph_traverse_from(&n1, count_nodes, &count);
ok1(count == 0);
count = 0;
dgraph_traverse_to(&n1, count_nodes, &count);
ok1(count == 0);
dgraph_init_node(&n2);
ok1(dgraph_check(&n2, NULL) == &n2);
dgraph_add_edge(&n1, &n2);
ok1(dgraph_check(&n1, NULL) == &n1);
ok1(dgraph_check(&n2, NULL) == &n2);
count = 0;
dgraph_traverse_from(&n1, count_nodes, &count);
ok1(count == 1);
count = 0;
dgraph_traverse_to(&n1, count_nodes, &count);
ok1(count == 0);
count = 0;
dgraph_traverse_from(&n2, count_nodes, &count);
ok1(count == 0);
count = 0;
dgraph_traverse_to(&n2, count_nodes, &count);
ok1(count == 1);
dgraph_init_node(&n3);
ok1(dgraph_check(&n3, NULL) == &n3);
dgraph_add_edge(&n2, &n3);
ok1(dgraph_check(&n1, NULL) == &n1);
ok1(dgraph_check(&n2, NULL) == &n2);
ok1(dgraph_check(&n3, NULL) == &n3);
count = 0;
dgraph_traverse_from(&n1, count_nodes, &count);
ok1(count == 2);
count = 0;
dgraph_traverse_to(&n1, count_nodes, &count);
ok1(count == 0);
count = 0;
dgraph_traverse_from(&n2, count_nodes, &count);
ok1(count == 1);
count = 0;
dgraph_traverse_to(&n2, count_nodes, &count);
ok1(count == 1);
count = 0;
dgraph_traverse_from(&n3, count_nodes, &count);
ok1(count == 0);
count = 0;
dgraph_traverse_to(&n3, count_nodes, &count);
ok1(count == 2);
/* Check stopping traverse. */
count = 1;
dgraph_traverse_from(&n1, stop_traverse, &count);
ok1(count == 0);
count = 2;
dgraph_traverse_from(&n1, stop_traverse, &count);
ok1(count == 0);
count = 3;
dgraph_traverse_from(&n1, stop_traverse, &count);
ok1(count == 1);
dgraph_clear_node(&n1);
ok1(dgraph_check(&n1, NULL) == &n1);
ok1(dgraph_check(&n2, NULL) == &n2);
ok1(dgraph_check(&n3, NULL) == &n3);
count = 0;
dgraph_traverse_from(&n2, count_nodes, &count);
ok1(count == 1);
count = 0;
dgraph_traverse_to(&n2, count_nodes, &count);
ok1(count == 0);
count = 0;
dgraph_traverse_from(&n3, count_nodes, &count);
ok1(count == 0);
count = 0;
dgraph_traverse_to(&n3, count_nodes, &count);
ok1(count == 1);
ok1(dgraph_del_edge(&n2, &n3));
count = 0;
dgraph_traverse_from(&n2, count_nodes, &count);
ok1(count == 0);
count = 0;
dgraph_traverse_to(&n2, count_nodes, &count);
ok1(count == 0);
count = 0;
dgraph_traverse_from(&n3, count_nodes, &count);
ok1(count == 0);
count = 0;
dgraph_traverse_to(&n3, count_nodes, &count);
ok1(count == 0);
ok1(dgraph_check(&n1, NULL) == &n1);
ok1(dgraph_check(&n2, NULL) == &n2);
ok1(dgraph_check(&n3, NULL) == &n3);
ok1(!dgraph_del_edge(&n2, &n3));
dgraph_clear_node(&n2);
ok1(dgraph_check(&n1, NULL) == &n1);
ok1(dgraph_check(&n2, NULL) == &n2);
ok1(dgraph_check(&n3, NULL) == &n3);
/* This exits depending on whether all tests passed */
return exit_status();
}
|