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
|
#include <rlist.h>
#include <stdio.h>
#include <stdarg.h>
#include "test.h"
#define PLAN 65
#define ITEMS 7
struct test {
char ch;
int no;
struct rlist list;
};
static struct test items[ITEMS];
static RLIST_HEAD(head);
static RLIST_HEAD(head2);
int
main(void)
{
int i;
struct test *it;
struct rlist *rlist;
plan(PLAN);
ok(rlist_empty(&head), "list is empty");
for (i = 0; i < ITEMS; i++) {
items[i].no = i;
rlist_add_tail(&head, &(items[i].list));
}
is(rlist_first(&head), &items[0].list, "first item");
isnt(rlist_first(&head), &items[ITEMS - 1].list, "first item");
is(rlist_last(&head), &items[ITEMS - 1].list, "last item");
isnt(rlist_last(&head), &items[0].list, "last item");
is(rlist_next(&head), &items[0].list, "rlist_next");
is(rlist_prev(&head), &items[ITEMS - 1].list, "rlist_prev");
i = 0;
rlist_foreach(rlist, &head) {
is(rlist, &items[i].list, "element (foreach) %d", i);
i++;
}
rlist_foreach_reverse(rlist, &head) {
i--;
is(rlist, &items[i].list, "element (foreach_reverse) %d", i);
}
is(rlist_entry(&items[0].list, struct test, list), &items[0],
"rlist_entry");
is(rlist_first_entry(&head, struct test, list), &items[0],
"rlist_first_entry");
is(rlist_next_entry(&items[0], list), &items[1], "rlist_next_entry");
is(rlist_prev_entry(&items[2], list), &items[1], "rlist_prev_entry");
i = 0;
rlist_foreach_entry(it, &head, list) {
is(it, items + i, "element (foreach_entry) %d", i);
i++;
}
rlist_foreach_entry_reverse(it, &head, list) {
i--;
is(it, items + i, "element (foreach_entry_reverse) %d", i);
}
rlist_del(&items[2].list);
ok(rlist_empty(&head2), "head2 is empty");
rlist_move(&head2, &items[3].list);
ok(!rlist_empty(&head2), "head2 isnt empty");
is(rlist_first_entry(&head2, struct test, list),
&items[3], "Item was moved");
rlist_move_tail(&head2, &items[4].list);
rlist_foreach_entry(it, &head, list) {
is(it, items + i, "element (second deleted) %d", i);
i++;
if (i == 2)
i += 3;
}
rlist_foreach_entry_reverse(it, &head, list) {
i--;
if (i == 4)
i -= 3;
is(it, items + i, "element (second deleted) %d", i);
}
rlist_create(&head);
ok(rlist_empty(&head), "list is empty");
for (i = 0; i < ITEMS; i++) {
items[i].no = i;
rlist_add(&head, &(items[i].list));
}
i = 0;
rlist_foreach_entry_reverse(it, &head, list) {
is(it, items + i, "element (foreach_entry_reverse) %d", i);
i++;
}
rlist_foreach_entry(it, &head, list) {
i--;
is(it, items + i, "element (foreach_entry) %d", i);
}
return check_plan();
}
|
