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
|
#include "config.h"
#include <ccan/lqueue/lqueue.h>
#include <ccan/tap/tap.h>
struct waiter {
const char *name;
struct lqueue_link ql;
};
int main(void)
{
LQUEUE(q);
struct waiter a = { "Alice" };
struct waiter b = { "Bob" };
struct waiter c = { "Carol" };
struct waiter *waiter;
/* This is how many tests you plan to run */
plan_tests(25);
ok1(lqueue_empty(&q));
ok1(lqueue_front(&q, struct waiter, ql) == NULL);
ok1(lqueue_back(&q, struct waiter, ql) == NULL);
lqueue_enqueue(&q, &a, ql);
ok1(!lqueue_empty(&q));
ok1(lqueue_front(&q, struct waiter, ql) == &a);
ok1(lqueue_back(&q, struct waiter, ql) == &a);
lqueue_enqueue(&q, &b, ql);
ok1(!lqueue_empty(&q));
ok1(lqueue_front(&q, struct waiter, ql) == &a);
ok1(lqueue_back(&q, struct waiter, ql) == &b);
lqueue_enqueue(&q, &c, ql);
ok1(!lqueue_empty(&q));
ok1(lqueue_front(&q, struct waiter, ql) == &a);
ok1(lqueue_back(&q, struct waiter, ql) == &c);
waiter = lqueue_dequeue(&q, struct waiter, ql);
ok1(waiter == &a);
ok1(!lqueue_empty(&q));
ok1(lqueue_front(&q, struct waiter, ql) == &b);
ok1(lqueue_back(&q, struct waiter, ql) == &c);
waiter = lqueue_dequeue(&q, struct waiter, ql);
ok1(waiter == &b);
ok1(!lqueue_empty(&q));
ok1(lqueue_front(&q, struct waiter, ql) == &c);
ok1(lqueue_back(&q, struct waiter, ql) == &c);
waiter = lqueue_dequeue(&q, struct waiter, ql);
ok1(waiter == &c);
ok1(lqueue_empty(&q));
ok1(lqueue_front(&q, struct waiter, ql) == NULL);
ok1(lqueue_back(&q, struct waiter, ql) == NULL);
ok1(lqueue_dequeue(&q, struct waiter, ql) == NULL);
/* This exits depending on whether all tests passed */
return exit_status();
}
|
