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
|
/* Copyright (C) 2018 CZ.NIC, z.s.p.o. <knot-dns@labs.nic.cz>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <string.h>
#include <tap/basic.h>
#include <unistd.h>
#include "binary.h"
#include "error.h"
#include "key.h"
#include "keystore.h"
#include "keystore/pkcs8_dir.c"
typedef struct test_pem {
const char *id;
dnssec_binary_t data;
} test_pem_t;
extern const dnssec_keystore_pkcs8_functions_t PKCS8_DIR_FUNCTIONS;
const test_pem_t TEST_PEM_A = {
"7b0c9f6a59b1c76b26ed93ea8684f300821eee41",
{ .size = 5, .data = (uint8_t *)"hello" }
};
const test_pem_t TEST_PEM_B = {
"f4f3e73cf4ee605993c2ef2d790571ade827244c",
{ .size = 4, .data = (uint8_t *)"knot" }
};
static void rm(const char *dir, const char *file)
{
char buffer[4096] = { 0 };
int r = snprintf(buffer, 4096, "%s/%s", dir, file);
if (r < 0) {
ok(0, "rm");
return;
}
r = unlink(buffer);
ok(r == 0, "rm %s", buffer);
}
int main(void)
{
plan_lazy();
int r = 0;
void *handle = NULL;
dnssec_binary_t bin = { 0 };
char *dir = test_tmpdir();
if (!dir) {
return 1;
}
// create context
const dnssec_keystore_pkcs8_functions_t *func = &PKCS8_DIR_FUNCTIONS;
r = func->handle_new(&handle);
ok(r == DNSSEC_EOK && handle != NULL, "new handle");
r = func->init(handle, dir);
ok(r == DNSSEC_EOK, "init");
r = func->open(handle, dir);
ok(r == DNSSEC_EOK, "open");
// non-existent reads
r = func->read(handle, TEST_PEM_A.id, &bin);
ok(r == DNSSEC_ENOENT && bin.size == 0, "read non-existent");
// writing new content
r = func->write(handle, TEST_PEM_A.id, &TEST_PEM_A.data);
ok(r == DNSSEC_EOK, "write A");
r = func->write(handle, TEST_PEM_B.id, &TEST_PEM_B.data);
ok(r == DNSSEC_EOK, "write B");
r = func->write(handle, TEST_PEM_A.id, &TEST_PEM_A.data);
ok(r == DNSSEC_EOK, "write A (duplicate)");
// content listing
dnssec_list_t *list = NULL;
r = func->list(handle, &list);
ok(r == DNSSEC_EOK, "get list");
is_int(2, dnssec_list_size(list), "list size");
bool found_a = false;
bool found_b = false;
dnssec_list_foreach(item, list) {
char *id = dnssec_item_get(item);
if (id && strcmp(TEST_PEM_A.id, id) == 0) { found_a = true; }
if (id && strcmp(TEST_PEM_B.id, id) == 0) { found_b = true; }
}
ok(found_a && found_b, "list content");
dnssec_list_free_full(list, NULL, NULL);
// reading existing content
r = func->read(handle, TEST_PEM_A.id, &bin);
ok(r == DNSSEC_EOK && dnssec_binary_cmp(&TEST_PEM_A.data, &bin) == 0,
"read A");
dnssec_binary_free(&bin);
r = func->read(handle, TEST_PEM_B.id, &bin);
ok(r == DNSSEC_EOK && dnssec_binary_cmp(&TEST_PEM_B.data, &bin) == 0,
"read B");
dnssec_binary_free(&bin);
// content removal
r = func->remove(handle, TEST_PEM_A.id);
ok(r == DNSSEC_EOK, "remove A");
r = func->read(handle, TEST_PEM_A.id, &bin);
ok(r == DNSSEC_ENOENT && bin.size == 0, "read removed");
// cleanup
r = func->close(handle);
ok(r == DNSSEC_EOK, "close");
r = func->handle_free(handle);
ok(r == DNSSEC_EOK, "free handle");
rm(dir, "f4f3e73cf4ee605993c2ef2d790571ade827244c.pem");
test_tmpdir_free(dir);
return 0;
}
|
