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
|
/* Copyright (C) CZ.NIC, z.s.p.o. <knot-resolver@labs.nic.cz>
* SPDX-License-Identifier: GPL-3.0-or-later
*/
#include "tests/unit/test.h"
#include "lib/generic/pack.h"
#define U8(x) (const uint8_t *)(x)
knot_mm_t global_mm;
static void test_pack_std(void **state)
{
int ret = 0;
pack_t pack;
pack_init(pack);
assert_int_equal(pack.len, 0);
/* Test that iterator on empty pack works */
assert_null(pack_head(pack));
assert_null(pack_tail(pack));
assert_null(pack_obj_find(&pack, U8(""), 1));
assert_int_equal(pack_obj_len(pack_head(pack)), 0);
assert_int_equal(pack_obj_del(&pack, U8(""), 1), -1);
/* Push/delete without reservation. */
assert_int_not_equal(pack_obj_push(&pack, U8(""), 1), 0);
assert_int_not_equal(pack_obj_del(&pack, U8(""), 1), 0);
/* Reserve capacity and fill. */
assert_true(pack_reserve(pack, 10, 10 * 2) >= 0);
for (unsigned i = 0; i < 10; ++i) {
ret = pack_obj_push(&pack, U8("de"), 2);
assert_true(ret >= 0);
}
/* Iterate */
uint8_t *it = pack_head(pack);
assert_non_null(it);
while (it != pack_tail(pack)) {
assert_int_equal(pack_obj_len(it), 2);
assert_true(memcmp(pack_obj_val(it), "de", 2) == 0);
it = pack_obj_next(it);
}
/* Find */
it = pack_obj_find(&pack, U8("de"), 2);
assert_non_null(it);
it = pack_obj_find(&pack, U8("ed"), 2);
assert_null(it);
/* Delete */
assert_int_not_equal(pack_obj_del(&pack, U8("be"), 2), 0);
assert_int_equal(pack_obj_del(&pack, U8("de"), 2), 0);
assert_int_equal(pack.len, 9*(2+2)); /* 9 objects, length=2 */
pack_clear(pack);
}
int main(void)
{
test_mm_ctx_init(&global_mm);
const UnitTest tests[] = {
unit_test(test_pack_std),
};
return run_tests(tests);
}
|
