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
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
|
/*
* Code in examine_result() is taken from official libunbound examples:
* https://nlnetlabs.nl/documentation/unbound/libunbound-tutorial-3/
* The rest of this file is
* Copyright (C) 2020 by Wojtek Kosior <echo a3dvanR1c0Bwcm90b25tYWlsLmNvbQo= | base64 --decode>
* Permission to use, copy, modify, and/or distribute this software
* for any purpose with or without fee is hereby granted.
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
* INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
* OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
* OF THIS SOFTWARE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <arpa/inet.h>
#include <stdbool.h>
#include <unbound.h>
#define DEFAULT_DEBUGLEVEL 0
/*
* This is the path in Debian - in other systems it will be different
* and we will need to either somehow find it dynamically or get the path
* from the user.
*/
#define CA_BUNDLE_FILE "/etc/ssl/certs/ca-certificates.crt"
/* In the long run me might rename this file to somewhere else... */
#define TRUST_ANCHOR_FILE "./root.key"
#define MALLOC_FAILURE_STRING "Couldn't allocate memory.\n"
/* examine the result structure in detail */
void examine_result(const char *query, struct ub_result *result)
{
int i;
int num;
printf("The query is for: %s\n", query);
printf("The result has:\n");
printf("qname: %s\n", result->qname);
printf("qtype: %d\n", result->qtype);
printf("qclass: %d\n", result->qclass);
if(result->canonname)
printf("canonical name: %s\n",
result->canonname);
else printf("canonical name: <none>\n");
if(result->havedata)
printf("has data\n");
else printf("has no data\n");
if(result->nxdomain)
printf("nxdomain (name does not exist)\n");
else printf("not an nxdomain (name exists)\n");
if(result->secure)
printf("validated to be secure\n");
else printf("not validated as secure\n");
if(result->bogus)
printf("a security failure! (bogus)\n");
else printf("not a security failure (not bogus)\n");
printf("DNS rcode: %d\n", result->rcode);
if(!result->havedata)
return;
num = 0;
for(i=0; result->data[i]; i++) {
printf("result data element %d has length %d\n",
i, result->len[i]);
printf("result data element %d is: %s\n",
i, inet_ntoa(*(struct in_addr*)result->data[i]));
num++;
}
printf("result has %d data element(s)\n", num);
}
enum resolution_mode {
RECURSIVE,
FULL,
RESOLV_CONF
};
struct ub_ctx *ztdns_create_ub_context(enum resolution_mode mode,
const char *resolver_addr,
int debuglevel) {
int rc;
struct ub_ctx* ctx;
const char *error_message_format;
ctx = ub_ctx_create();
if (!ctx) {
fprintf(stderr, "Couldn't create libunbound context.\n");
return NULL;
}
if (mode == RECURSIVE) {
error_message_format = "Couldn't set forward server: %s\n";
rc = ub_ctx_set_fwd(ctx, resolver_addr);
if (rc)
goto out;
/* Make DNS over TLS mandatory for recursive resolvers */
/* TODO tls not working for some reason - this has to be fixed */
/* error_message_format = "Couldn't enable DNS over TLS: %s\n"; */
/* rc = ub_ctx_set_tls(ctx, 1); */
/* if (rc) */
/* goto out; */
/* rc = ub_ctx_set_option(ctx, "tls-cert-bundle:", CA_BUNDLE_FILE); */
} else if (mode == FULL) {
/* TODO use root_hints here for better reliability */
/* For iterative queries we use DNSSEC if possible */
error_message_format = "Couldn't set trust anchors: %s\n";
rc = ub_ctx_add_ta_autr(ctx, TRUST_ANCHOR_FILE);
} else /* if (mode == RESOLV_CONF) */ {
/* NULL can be passed to use system's default resolv.conf */
error_message_format = "Couldn't use system resolv.conf: %s\n";
rc = ub_ctx_resolvconf(ctx, NULL);
}
if (rc)
goto out;
error_message_format = "Couldn't set debuglevel: %s\n";
rc = ub_ctx_debuglevel(ctx, debuglevel);
out:
if (rc) {
fprintf(stderr, error_message_format, ub_strerror(rc));
ub_ctx_delete(ctx);
return NULL;
}
return ctx;
}
void ztdns_try_resolve(struct ub_ctx *ctx, const char *name) {
struct ub_result* result;
int rc;
rc = ub_resolve(ctx, name,
1 /* TYPE A (IPv4 address) */,
1 /* CLASS IN (internet) */, &result);
if(rc)
printf("resolve error: %s\n", ub_strerror(rc));
else {
examine_result(name, result);
ub_resolve_free(result);
}
}
struct ztdns_resolver {
struct ub_ctx *ctx;
const char *name; /* arbitrary name - only used for printing to user */
const char *address; /* IP addr in dot notation stored as string */
/* Compatible answer must be returned by resolvers with their
* trust levels summing to at least 100 - otherwise the answer is
* considered unreliable.
*/
uint8_t trust_level;
/* Whether we want ztdns to report when this resolver gives answer,
* that is not confirmed by others (i.e. trust levels sum for this
* answer doesn't reach 100).
*/
bool report_errors;
struct ztdns_resolver *next;
};
struct ztdns_resolver *ztdns_create_recursive_resolver
(const char *name, const char *address, uint8_t trust_level, bool report_errors,
int debuglevel)
{
struct ztdns_resolver *resolver;
resolver = malloc(sizeof(struct ztdns_resolver));
if (!resolver) {
fprintf(stderr, MALLOC_FAILURE_STRING);
return NULL;
}
resolver->ctx = ztdns_create_ub_context(RECURSIVE, address, debuglevel);
if (!resolver->ctx)
goto out_err;
resolver->name = name;
resolver->address = address;
resolver->trust_level = trust_level;
resolver->report_errors = report_errors;
resolver->next = NULL;
return resolver;
out_err:
free(resolver);
return NULL;
}
void ztdns_delete_recursive_resolver(struct ztdns_resolver *resolver) {
ub_ctx_delete(resolver->ctx);
free(resolver);
}
struct ztdns_instance {
struct ub_ctx *ctx_resolv_conf, *ctx_full;
struct ztdns_resolver *recursive_resolvers;
};
/*
* Hardcoded recursive DNS servers. A temporary solution - those should
* ideally by obtained from command line or configuration file.
*/
const char *resolvers_addresses[] = {"8.8.8.8", "8.8.4.4",
"1.1.1.1", "127.0.0.1"};
const char *resolvers_names[] = {"google", "google",
"cloudflare", "localhost"};
uint8_t resolvers_trust_levels[] = {40, 40, 80, 20};
uint8_t resolvers_report_errors[] = {false, false, false, true};
#define RESOLVERS_COUNT 4
struct ztdns_instance *ztdns_create_instance(int argc, char **argv)
{
struct ztdns_instance *ztdns;
int i;
struct ztdns_resolver *tmp;
ztdns = malloc(sizeof(struct ztdns_instance));
if (!ztdns)
return NULL;
/* Create context for performing full resolution */
ztdns->ctx_full =
ztdns_create_ub_context(FULL, NULL, DEFAULT_DEBUGLEVEL);
if (!ztdns->ctx_full)
goto out_err_cleanup_instance;
/* Create context for performing resolution with default resolver */
ztdns->ctx_resolv_conf =
ztdns_create_ub_context(RESOLV_CONF, NULL, DEFAULT_DEBUGLEVEL);
if (!ztdns->ctx_resolv_conf)
goto out_err_cleanup_ctx_full;
/* Create contexts for performing resolution with resolvers provided
* by user (well, hardcoded ones in this case)
*/
ztdns->recursive_resolvers = NULL;
for (i = 0; i < RESOLVERS_COUNT; i++) {
tmp = ztdns_create_recursive_resolver
(resolvers_names[i], resolvers_addresses[i],
resolvers_trust_levels[i], resolvers_report_errors[i],
DEFAULT_DEBUGLEVEL);
if (!tmp)
goto out_err_cleanup_recursive_resolvers;
tmp->next = ztdns->recursive_resolvers;
ztdns->recursive_resolvers = tmp;
}
return ztdns;
out_err_cleanup_recursive_resolvers:
while (ztdns->recursive_resolvers) {
tmp = ztdns->recursive_resolvers->next;
ztdns_delete_recursive_resolver(ztdns->recursive_resolvers);
ztdns->recursive_resolvers = tmp;
}
ub_ctx_delete(ztdns->ctx_resolv_conf);
out_err_cleanup_ctx_full:
ub_ctx_delete(ztdns->ctx_full);
out_err_cleanup_instance:
free(ztdns);
return NULL;
}
void ztdns_delete_instance(struct ztdns_instance *ztdns)
{
struct ztdns_resolver *tmp;
while (ztdns->recursive_resolvers) {
tmp = ztdns->recursive_resolvers->next;
ztdns_delete_recursive_resolver(ztdns->recursive_resolvers);
ztdns->recursive_resolvers = tmp;
}
ub_ctx_delete(ztdns->ctx_resolv_conf);
ub_ctx_delete(ztdns->ctx_full);
free(ztdns);
}
int main(int argc, char** argv)
{
struct ztdns_instance *ztdns;
struct ztdns_resolver *tmp;
const char *queried_name = "google.com";
ztdns = ztdns_create_instance(argc, argv);
if (!ztdns)
return EXIT_FAILURE;
printf("* FULL RESOLUTION\n");
ztdns_try_resolve(ztdns->ctx_full, queried_name);
printf("* USING RESOLVER FROM resolv.conf\n");
ztdns_try_resolve(ztdns->ctx_resolv_conf, queried_name);
for (tmp = ztdns->recursive_resolvers; tmp; tmp = tmp->next) {
printf("* VIA %s (%s)\n", tmp->name, tmp->address);
ztdns_try_resolve(tmp->ctx, queried_name);
}
ztdns_delete_instance(ztdns);
return EXIT_SUCCESS;
}
|