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
|
#!/bin/sh
. ../../dttools/test/test_runner_common.sh
exe="list_core.test"
prepare()
{
${CC} -I../src/ -g $CCTOOLS_TEST_CCFLAGS -o "$exe" -x c - -x none ../src/libdttools.a -lm <<EOF
#include <assert.h>
#include <stdbool.h>
#include <stdint.h>
#include "list.h"
int main (int argc, char *argv[])
{
bool ok;
unsigned pos;
intptr_t item = 0;
// first create an empty list
struct list *list = list_create();
assert(list);
assert(list_size(list) == 0);
// make a cursor on it
struct list_cursor *cur = list_cursor_create(list);
assert(cur);
// ensure that things don't work when position is undefined
assert(!list_tell(cur, &pos));
ok = list_seek(cur, 0);
assert(!ok);
ok = list_next(cur);
assert(!ok);
ok = list_prev(cur);
assert(!ok);
ok = list_get(cur, (void **) &item);
assert(!ok);
ok = list_set(cur, (void *) item);
assert(!ok);
ok = list_drop(cur);
assert(!ok);
// put in a couple of items
list_insert(cur, (void *) 2);
assert(list_size(list) == 1);
assert(!list_tell(cur, &pos));
list_insert(cur, (void *) 3);
assert(list_size(list) == 2);
assert(!list_tell(cur, &pos));
// move on to an item
ok = list_seek(cur, 0);
assert(ok);
// try moving past the end
ok = list_seek(cur, 2);
assert(!ok);
// try basic functionality
assert(list_tell(cur, &pos));
assert(pos == 0);
ok = list_get(cur, (void **) &item);
assert(ok);
assert(item == 2);
ok = list_set(cur, (void *) 5);
assert(ok);
ok = list_get(cur, (void **) &item);
assert(ok);
assert(item == 5);
// try to seek past the beginning
ok = list_seek(cur, -3);
assert(!ok);
// check we're still on the right item
assert(list_tell(cur, &pos));
assert(pos == 0);
ok = list_get(cur, (void **) &item);
assert(ok);
assert(item == 5);
// make another cursor, and insert between the two elements
struct list_cursor *alt = list_cursor_create(list);
assert(!list_tell(alt, &pos));
ok = list_seek(alt, -1);
assert(ok);
assert(list_tell(alt, &pos));
assert(pos == 1);
list_insert(alt, (void *) 7);
assert(list_size(list) == 3);
// make sure the original cursor is OK
assert(list_tell(cur, &pos));
assert(pos == 0);
ok = list_get(cur, (void **) &item);
assert(ok);
assert(item == 5);
// and the new cursor
assert(list_tell(alt, &pos));
assert(pos == 2);
ok = list_get(alt, (void **) &item);
assert(ok);
assert(item == 3);
// move to the new item
ok = list_prev(alt);
assert(ok);
// and check both again
assert(list_tell(cur, &pos));
assert(pos == 0);
ok = list_get(cur, (void **) &item);
assert(ok);
assert(item == 5);
assert(list_tell(alt, &pos));
assert(pos == 1);
ok = list_get(alt, (void **) &item);
assert(ok);
assert(item == 7);
// now move the old cursor to the same place
ok = list_next(cur);
assert(ok);
// and check both again
assert(list_tell(cur, &pos));
assert(pos == 1);
ok = list_get(cur, (void **) &item);
assert(ok);
assert(item == 7);
assert(list_tell(alt, &pos));
assert(pos == 1);
ok = list_get(alt, (void **) &item);
assert(ok);
assert(item == 7);
// drop the middle element
ok = list_drop(cur);
assert(ok);
assert(list_size(list) == 2);
// and check both again
assert(!list_tell(cur, &pos));
ok = list_get(cur, (void **) &item);
assert(!ok);
ok = list_next(cur);
assert(ok);
ok = list_get(cur, (void **) &item);
assert(ok);
assert(item == 3);
assert(list_tell(cur, &pos));
assert(pos == 1);
assert(!list_tell(alt, &pos));
ok = list_get(alt, (void **) &item);
assert(!ok);
// walk off the right
ok = list_next(alt);
assert(ok);
assert(list_tell(alt, &pos));
assert(pos == 1);
ok = list_next(alt);
assert(!ok);
assert(!list_tell(alt, &pos));
// and the left
ok = list_prev(cur);
assert(ok);
assert(list_tell(cur, &pos));
assert(pos == 0);
ok = list_get(cur, (void **) &item);
assert(ok);
assert(item == 5);
ok = list_prev(cur);
assert(!ok);
assert(!list_tell(cur, &pos));
// delete the cursors and try to delete while there are items
list_cursor_destroy(cur);
list_cursor_destroy(alt);
ok = list_destroy(list);
assert(!ok);
// we still need a cursor...
cur = list_cursor_create(list);
assert(cur);
// clear the list
list_seek(cur, 0);
do {
ok = list_drop(cur);
assert(ok);
} while (list_next(cur));
// try to delete while there's an outstanding cursor
ok = list_destroy(list);
assert(!ok);
// delete said cursor
list_cursor_destroy(cur);
// finally delete the list
ok = list_destroy(list);
assert(ok);
return 0;
}
EOF
return $?
}
run()
{
./"$exe"
return $?
}
clean()
{
rm -f "$exe"
return 0
}
dispatch "$@"
|
