-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathbenr-api-test.c
More file actions
259 lines (206 loc) · 4.57 KB
/
benr-api-test.c
File metadata and controls
259 lines (206 loc) · 4.57 KB
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
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
#include "benr.h"
#include <assert.h>
#include <string.h>
#define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
#define S(x) x, (ARRAY_SIZE(x) - 1)
/*
* this is formulated as a debugging aid for confirming the library works properly.
* In real life, bencode equality can compare the encoded data directly for more efficiency
*/
static bool
benr_eq(struct benr *a, struct benr *b)
{
if (a->kind != b->kind)
return false;
switch (a->kind) {
case BENR_INT:
return a->data.i == b->data.i;
case BENR_STRING:
if (a->data.s.len != b->data.s.len)
return false;
return !memcmp(a->data.s.start, b->data.s.start, a->data.s.len);
default:
/* XXX: eventually fill in the others */
return false;
}
}
int main(void)
{
/* integer */
{
struct benr b;
benr_init(&b, S("i1e"));
assert(b.kind == BENR_INT);
assert(b.data.i == 1);
}
/* integer, negative multi digit */
{
struct benr b;
benr_init(&b, S("i-42561e"));
assert(b.kind == BENR_INT);
assert(b.data.i == -42561);
}
/* list */
{
struct benr b;
benr_init(&b, S("li3ei6ei-1ee"));
assert(b.kind == BENR_LIST);
struct benr_list l;
int r = benr_as_list(&b, &l);
assert(r >= 0);
struct benr_list_iter li;
benr_list_iter(&l, &li);
struct benr bl;
r = benr_list_iter_next(&li, &bl);
assert(r >= 0);
assert(bl.kind == BENR_INT);
assert(bl.data.i == 3);
r = benr_list_iter_next(&li, &bl);
assert(r >= 0);
assert(bl.kind == BENR_INT);
assert(bl.data.i == 6);
r = benr_list_iter_next(&li, &bl);
assert(r >= 0);
assert(bl.kind == BENR_INT);
assert(bl.data.i == -1);
r = benr_list_iter_next(&li, &bl);
assert(r < 0);
}
/* list with magic markers in it */
{
struct benr b;
benr_init(&b, S("l1:ee"));
struct benr_list l;
int r = benr_as_list(&b, &l);
assert(r >= 0);
struct benr_list_iter li;
benr_list_iter(&l, &li);
struct benr bl;
r = benr_list_iter_next(&li, &bl);
assert(r >= 0);
assert(bl.kind == BENR_STRING);
assert(bl.data.s.len == 1);
assert(*bl.data.s.start == 'e');
}
/* string */
{
struct benr b;
benr_init(&b, S("5:hello"));
assert(b.kind == BENR_STRING);
struct benr_string s;
int r = benr_as_string(&b, &s);
assert(r >= 0);
assert(s.len == 5);
assert(!memcmp("hello", s.start, s.len));
}
/* dict */
{
struct benr b;
benr_init(&b, S("d3:onei1e5:seveni7ee"));
struct benr_dict d;
int r = benr_as_dict(&b, &d);
assert(r >= 0);
struct benr_dict_iter di;
benr_dict_iter(&d, &di);
struct benr k, v;
r = benr_dict_iter_next(&di, &k, &v);
assert(r >= 0);
assert(benr_eq(&(struct benr){
.kind = BENR_STRING,
.data = { .s = {
.start = (void *)"one",
.len = 3,
}}
}, &k));
assert(v.kind == BENR_INT);
assert(v.data.i == 1);
r = benr_dict_iter_next(&di, &k, &v);
assert(r >= 0);
assert(benr_eq(&(struct benr){
.kind = BENR_STRING,
.data = { .s = {
.start = (void *)"seven",
.len = 5,
}}
}, &k));
assert(v.kind == BENR_INT);
assert(v.data.i == 7);
r = benr_dict_iter_next(&di, &k, &v);
assert(r < 0);
}
/* nesting */
/* [ ]
* [][ ]
* [ ][ ]
*/
{
struct benr b;
benr_init(&b, S("lded1:eli3eeee"));
/* 'lded1:eli3eee'
* ^
*/
struct benr_list l;
int r = benr_as_list(&b, &l);
assert(r >= 0);
struct benr_list_iter li;
benr_list_iter(&l, &li);
/* 'lded1:eli3eee'
* ^
* ^
*/
struct benr b1;
r = benr_list_iter_next(&li, &b1);
assert(r >= 0);
struct benr_dict d;
r = benr_as_dict(&b1, &d);
assert(r >= 0);
struct benr_dict_iter di;
benr_dict_iter(&d, &di);
struct benr b2, v2;
/* 'lded1:eli3eee'
* ^
* ^
*/
r = benr_dict_iter_next(&di, &b2, &v2);
assert(r < 0);
/* 'lded1:eli3eee'
* ^
* ^
*/
r = benr_list_iter_next(&li, &b1);
assert(r >= 0);
r = benr_as_dict(&b1, &d);
assert(r >= 0);
benr_dict_iter(&d, &di);
/* 'lded1:eli3eee'
* ^
* ^
*/
r = benr_dict_iter_next(&di, &b2, &v2);
assert(r >= 0);
assert(benr_eq(&(struct benr){
.kind = BENR_STRING,
.data = { .s = {
.start = (void*)"e",
.len = 1,
}}
}, &b2));
struct benr_list l2;
r = benr_as_list(&v2, &l2);
assert(r >= 0);
struct benr_list_iter li2;
benr_list_iter(&l2, &li2);
struct benr b3;
r = benr_list_iter_next(&li2, &b3);
assert(r >= 0);
assert(b3.kind == BENR_INT);
assert(b3.data.i == 3);
r = benr_list_iter_next(&li2, &b3);
assert(r < 0);
r = benr_dict_iter_next(&di, &b2, &v2);
assert(r < 0);
r = benr_list_iter_next(&li, &b1);
assert(r < 0);
}
return 0;
}