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
|
/* Copyright (C) CZ.NIC, z.s.p.o. and contributors
* SPDX-License-Identifier: GPL-2.0-or-later
* For more information, see <https://www.knot-dns.cz/>
*/
#include <stdlib.h>
#include <string.h>
#include <tap/basic.h>
#include "libknot/error.h"
#include "utils/common/lookup.h"
static void check_search_ok(lookup_t *l, const char *in, const char *out)
{
diag("Search for '%s'", in);
int ret = lookup_search(l, in, strlen(in));
is_int(KNOT_EOK, ret, "Check found");
ok(strcmp(out, l->found.key) == 0, "Compare key");
ok(strcmp(out, l->found.data) == 0, "Compare data");
ok(l->iter.first_key == NULL, "Compare no first key");
ok(l->iter.count == 1, "Compare 1 count");
}
static void check_search_multi(lookup_t *l, const char *in, const char *out,
const char *first, size_t count)
{
diag("Search for '%s'", in);
int ret = lookup_search(l, in, strlen(in));
is_int(KNOT_EFEWDATA, ret, "Check found multi");
ok(strcmp(out, l->found.key) == 0, "Compare key");
ok(l->found.data == NULL, "Compare no data");
ok(strcmp(first, l->iter.first_key) == 0, "Compare first key");
ok(l->iter.count == count, "Compare count");
}
static void check_search_none(lookup_t *l, const char *in)
{
diag("Search for '%s'", in);
int ret = lookup_search(l, in, strlen(in));
is_int(KNOT_ENOENT, ret, "Check not found");
ok(l->found.key == NULL, "Check no key");
ok(l->found.data == NULL, "Check no data");
}
static void init(lookup_t *l, const char **table)
{
int ret = lookup_init(l);
is_int(KNOT_EOK, ret, "Init");
while (*table != NULL) {
ret = lookup_insert(l, *table, (void *)*table);
is_int(KNOT_EOK, ret, "Insert '%s'", *table);
table++;
}
}
static void test_search_basic(void)
{
const char* table[] = {
"aa",
"bb",
NULL
};
lookup_t l;
init(&l, table);
check_search_ok(&l, "a", "aa");
check_search_ok(&l, "aa", "aa");
check_search_ok(&l, "b", "bb");
check_search_ok(&l, "bb", "bb");
check_search_none(&l, "0");
check_search_none(&l, "000");
check_search_none(&l, "00000000000000000000000000000000000000000000");
check_search_none(&l, "a0");
check_search_none(&l, "ab");
check_search_none(&l, "aaa");
check_search_none(&l, "bbb");
check_search_none(&l, "cc");
check_search_none(&l, "ccc");
check_search_none(&l, "cccccccccccccccccccccccccccccccccccccccccccc");
check_search_multi(&l, "", "", "aa", 2);
lookup_deinit(&l);
}
static void test_search_iter(void)
{
const char* table[] = {
"0",
"ab",
"abc",
"abcd",
"abc-1",
"abc-99",
"z",
NULL
};
lookup_t l;
init(&l, table);
check_search_multi(&l, "", "", "0", 7);
check_search_multi(&l, "a", "ab", "ab", 5);
check_search_multi(&l, "ab", "ab", "ab", 5);
check_search_multi(&l, "abc", "abc", "abc", 4);
check_search_multi(&l, "abc-", "abc-", "abc-1", 2);
lookup_deinit(&l);
}
int main(int argc, char *argv[])
{
plan_lazy();
diag("Search tests basic");
test_search_basic();
diag("Search tests multi-result");
test_search_iter();
return 0;
}
|
