-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrr.c
593 lines (513 loc) · 17.6 KB
/
rr.c
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
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
/*****************************************************************************
* This file is part of libmicrodns.
*
* Copyright © 2014-2016 VideoLabs SAS
*
* Author: Jonathan Calmels <[email protected]>
*
*****************************************************************************
* libmicrodns is released under LGPLv2.1 (or later) and is also available
* under a commercial license.
*****************************************************************************
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation; either version 2.1 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 Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
*****************************************************************************/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include <string.h>
#include <stdlib.h>
#include <stdint.h>
#include "utils.h"
#include "microdns.h"
#include "rr.h"
typedef const uint8_t *(*rr_reader)(const uint8_t *, size_t *, const uint8_t *, struct rr_entry *);
typedef ssize_t (*rr_writer)(uint8_t *, size_t *, const struct rr_entry *);
typedef void (*rr_printer)(const union rr_data *);
static const uint8_t *rr_decode(const uint8_t *ptr, size_t *n, const uint8_t *root, char **ss, uint8_t nb_rec);
static uint8_t *rr_encode(const char *s);
const uint8_t * rr_read(const uint8_t *ptr, size_t *n, const uint8_t *root, struct rr_entry *entry, int8_t ans);
static const uint8_t *rr_read_SRV(const uint8_t *, size_t *, const uint8_t *, struct rr_entry *);
static const uint8_t *rr_read_PTR(const uint8_t *, size_t *, const uint8_t *, struct rr_entry *);
static const uint8_t *rr_read_TXT(const uint8_t *, size_t *, const uint8_t *, struct rr_entry *);
static const uint8_t *rr_read_AAAA(const uint8_t *, size_t *, const uint8_t *, struct rr_entry *);
static const uint8_t *rr_read_A(const uint8_t *, size_t *, const uint8_t *, struct rr_entry *);
ssize_t rr_write(uint8_t *ptr, size_t *s, const struct rr_entry *entry, int8_t ans);
static ssize_t rr_write_SRV(uint8_t *, size_t *, const struct rr_entry *);
static ssize_t rr_write_PTR(uint8_t *, size_t *, const struct rr_entry *);
static ssize_t rr_write_TXT(uint8_t *, size_t *, const struct rr_entry *);
static ssize_t rr_write_AAAA(uint8_t *, size_t *, const struct rr_entry *);
static ssize_t rr_write_A(uint8_t *, size_t *, const struct rr_entry *);
void rr_print(const struct rr_entry *entry);
static void rr_print_SRV(const union rr_data *);
static void rr_print_PTR(const union rr_data *);
static void rr_print_TXT(const union rr_data *);
static void rr_print_AAAA(const union rr_data *);
static void rr_print_A(const union rr_data *);
void rr_free(struct rr_entry *entry);
static const char *rr_type_str(enum rr_type);
static const char *rr_class_str(enum rr_class);
static const struct {
enum rr_type type;
const char *name;
rr_reader read;
rr_writer write;
rr_printer print;
} rrs[] = {
{RR_SRV, "SRV", &rr_read_SRV, &rr_write_SRV, &rr_print_SRV},
{RR_PTR, "PTR", &rr_read_PTR, &rr_write_PTR, &rr_print_PTR},
{RR_TXT, "TXT", &rr_read_TXT, &rr_write_TXT, &rr_print_TXT},
{RR_AAAA, "AAAA", &rr_read_AAAA, &rr_write_AAAA, &rr_print_AAAA},
{RR_A, "A", &rr_read_A, &rr_write_A, &rr_print_A},
};
static const size_t rr_num = sizeof(rrs) / sizeof(*rrs);
#define advance(x) ptr += x; *n -= x
static const uint8_t *
rr_read_SRV(const uint8_t *ptr, size_t *n, const uint8_t *root, struct rr_entry *entry)
{
union rr_data *data = &entry->data;
if (*n <= sizeof(uint16_t) * 3)
return (NULL);
ptr = read_u16(ptr, n, &data->SRV.priority);
ptr = read_u16(ptr, n, &data->SRV.weight);
ptr = read_u16(ptr, n, &data->SRV.port);
if ((ptr = rr_decode(ptr, n, root, &data->SRV.target, 0)) == NULL)
return (NULL);
return (ptr);
}
static ssize_t
rr_write_SRV(uint8_t *ptr, size_t *s, const struct rr_entry *entry)
{
uint8_t *target, *p = ptr;
if ((target = rr_encode(entry->data.SRV.target)) == NULL)
return (-1);
if (*s < 6) {
free(target);
return -1;
}
p = write_u16(p, s, entry->data.SRV.priority);
p = write_u16(p, s, entry->data.SRV.weight);
p = write_u16(p, s, entry->data.SRV.port);
p = write_raw(p, s, target);
free(target);
if (p == NULL)
return (-1);
return (p - ptr);
}
static void
rr_print_SRV(const union rr_data *data)
{
printf("{"
"\"target\":\"%s\","
"\"port\":%" PRIu16 ","
"\"priority\":%" PRIu16 ","
"\"weight\":%" PRIu16
"}", data->SRV.target, data->SRV.port, data->SRV.priority, data->SRV.weight);
}
static const uint8_t *
rr_read_PTR(const uint8_t *ptr, size_t *n, const uint8_t *root, struct rr_entry *entry)
{
union rr_data *data = &entry->data;
if (*n == 0)
return (NULL);
if ((ptr = rr_decode(ptr, n, root, &data->PTR.domain, 0)) == NULL)
return (NULL);
return (ptr);
}
static ssize_t
rr_write_PTR(uint8_t *ptr, size_t *s, const struct rr_entry *entry)
{
uint8_t *domain, *p = ptr;
if ((domain = rr_encode(entry->data.PTR.domain)) == NULL)
return (0);
p = write_raw(p, s, domain);
free(domain);
if (p == NULL)
return -1;
return (p - ptr);
}
static void
rr_print_PTR(const union rr_data *data)
{
printf("{\"domain\":\"%s\"}", data->PTR.domain);
}
static const uint8_t *
rr_read_TXT(const uint8_t *ptr, size_t *n, const uint8_t *root, struct rr_entry *entry)
{
union rr_data *data = &entry->data;
uint16_t len = entry->data_len;
uint8_t l;
if (*n == 0 || *n < len)
return (NULL);
for (; len > 0 && *n > 0; len -= l + 1) {
struct rr_data_txt *text;
memcpy(&l, ptr, sizeof(l));
advance(1);
if (*n < l)
return (NULL);
text = malloc(sizeof(struct rr_data_txt));
if (!text)
return (NULL);
text->next = data->TXT;
data->TXT = text;
if (l > 0)
memcpy(text->txt, ptr, l);
text->txt[l] = '\0';
advance(l);
}
return (ptr);
}
static ssize_t
rr_write_TXT(uint8_t *ptr, size_t *s, const struct rr_entry *entry)
{
uint8_t *p = ptr;
size_t l;
struct rr_data_txt *text = entry->data.TXT;
while (text) {
l = strlen(text->txt);
if (*s < l + 1)
return (-1);
memcpy(p, &l, 1);
memcpy(p+1, text->txt, l);
p += l + 1;
*s -= l + 1;
text = text->next;
}
return (p - ptr);
}
static void
rr_print_TXT(const union rr_data *data)
{
struct rr_data_txt *text = data->TXT;
printf("{\"text\":[");
while (text) {
printf("\"%s\"%s", text->txt, text->next ? "," : "");
text = text->next;
}
printf("]}");
}
static const uint8_t *
rr_read_AAAA(const uint8_t *ptr, size_t *n, const uint8_t *root, struct rr_entry *entry)
{
union rr_data *data = &entry->data;
const size_t len = sizeof(struct in6_addr);
if (*n < len || entry->data_len < len)
return (NULL);
memcpy(&data->AAAA.addr, ptr, len);
advance(len);
if (!inet_ntop(AF_INET6, &data->AAAA.addr, data->AAAA.addr_str, INET6_ADDRSTRLEN))
return (NULL);
return (ptr);
}
static ssize_t
rr_write_AAAA(uint8_t *ptr, size_t *s, const struct rr_entry *entry)
{
size_t len = sizeof(entry->data.AAAA.addr);
if (*s < len)
return (-1);
memcpy(ptr, &entry->data.AAAA.addr, len);
*s -= len;
return len;
}
static void
rr_print_AAAA(const union rr_data *data)
{
printf("{\"address\":\"%s\"}", data->AAAA.addr_str);
}
static const uint8_t *
rr_read_A(const uint8_t *ptr, size_t *n, const uint8_t *root, struct rr_entry *entry)
{
union rr_data *data = &entry->data;
const size_t len = sizeof(struct in_addr);
if (*n < len)
return (NULL);
memcpy(&data->A.addr, ptr, len);
advance(len);
if (!inet_ntop(AF_INET, &data->A.addr, data->A.addr_str, INET_ADDRSTRLEN))
return (NULL);
return (ptr);
}
static ssize_t
rr_write_A(uint8_t *ptr, size_t *s, const struct rr_entry *entry)
{
size_t len = sizeof(entry->data.A.addr);
if (*s < len)
return -1;
memcpy(ptr, &entry->data.A.addr, sizeof(entry->data.A.addr));
*s -= len;
return len;
}
static void
rr_print_A(const union rr_data *data)
{
printf("{\"address\":\"%s\"}", data->A.addr_str);
}
/*
* Decodes a DN compressed format (RFC 1035)
* e.g "\x03foo\x03bar\x00" gives "foo.bar"
*/
static const uint8_t *
rr_decode(const uint8_t *ptr, size_t *n, const uint8_t *root, char **ss, uint8_t nb_rec)
{
char *s;
const uint8_t *orig_ptr = ptr;
/*
* 16 is arbitrary here, but it should be high enough for most cases
* Ideally, we should store previously analyzed domains with their
* associated offset, in order to avoid re-parsing them for each later
* records
*/
if (nb_rec > 16)
return (NULL);
if (*n == 0)
return (NULL);
s = *ss = malloc(MDNS_DN_MAXSZ);
if (!s)
return (NULL);
if (*ptr == 0) {
*s = '\0';
advance(1);
return (ptr);
}
while (*ptr) {
size_t free_space;
uint16_t len;
free_space = *ss + MDNS_DN_MAXSZ - s;
len = *ptr;
advance(1);
/* resolve the offset of the pointer (RFC 1035-4.1.4) */
if ((len & 0xC0) == 0xC0) {
const uint8_t *p;
char *buf;
size_t m;
uint16_t offset;
/*
* We only check if we have enough bytes left to read the
* offset for now, and will check the offset validity
* just after
*/
if (*n == 0)
goto err;
offset = ~0xC0 & len;
offset = (uint16_t)(offset << 8u) | *ptr;
advance(1);
p = root + offset;
/*
* The resulting pointer can only point to a prior record
* We substract 2 here since we already read the 2 offset
* bytes
*/
if (p > (ptr - 2))
goto err;
m = ptr - p + *n;
/* Avoid recursing on the same element */
if (p == orig_ptr)
goto err;
if (rr_decode(p, &m, root, &buf, nb_rec + 1) == NULL)
goto err;
if (free_space <= strlen(buf)) {
free(buf);
goto err;
}
(void) strcpy(s, buf);
free(buf);
return (ptr);
}
if (*n <= len || free_space <= len)
goto err;
strncpy(s, (const char *) ptr, len);
advance(len);
s += len;
*s++ = (*ptr) ? '.' : '\0';
}
advance(1);
return (ptr);
err:
free(*ss);
*ss = NULL;
return (NULL);
}
/*
* Encode a DN into its compressed format (RFC 1035)
* e.g "foo.bar" gives "\x03foo\x03bar\x00"
*/
static uint8_t *
rr_encode(const char *s)
{
if (!s)
return (NULL);
uint8_t *buf, *b, l = 0;
const char *p = s;
buf = malloc(strlen(s) + 2);
if (!buf)
return (NULL);
for (b = buf, l = strcspn(p, "."); l > 0;
l = *p ? strcspn(++p, ".") : 0) {
*b = l;
memcpy(b + 1, p, l);
b += l + 1;
p += l;
}
*b = 0;
return (buf);
}
static const uint8_t *
rr_read_RR(const uint8_t *ptr, size_t *n, const uint8_t *root, struct rr_entry *entry, int8_t ans)
{
uint16_t tmp;
ptr = rr_decode(ptr, n, root, &entry->name, 0);
if (!ptr || *n < 4)
return (NULL);
ptr = read_u16(ptr, n, &entry->type);
ptr = read_u16(ptr, n, &tmp);
entry->rr_class = (tmp & ~0x8000);
entry->msbit = ((tmp & 0x8000) == 0x8000);
if (ans) {
if (*n < 6)
return (NULL);
ptr = read_u32(ptr, n, &entry->ttl);
ptr = read_u16(ptr, n, &entry->data_len);
}
return ptr;
}
static ssize_t
rr_write_RR(uint8_t *ptr, size_t *s, const struct rr_entry *entry, int8_t ans)
{
uint8_t *name, *p = ptr;
if ((name = rr_encode(entry->name)) == NULL)
return (-1);
p = write_raw(p, s, name);
free(name);
if (p == NULL)
return (-1);
if (*s < 4)
return (-1);
p = write_u16(p, s, entry->type);
p = write_u16(p, s, (entry->rr_class & ~0x8000) | (entry->msbit << 15));
if (ans) {
if (*s < 6)
return (-1);
p = write_u32(p, s, entry->ttl);
p = write_u16(p, s, entry->data_len);
}
return (p - ptr);
}
const uint8_t *
rr_read(const uint8_t *ptr, size_t *n, const uint8_t *root, struct rr_entry *entry, int8_t ans)
{
size_t skip;
const uint8_t *p;
p = ptr = rr_read_RR(ptr, n, root, entry, ans);
if (ans == 0) return ptr;
if (ptr == NULL)
return (NULL);
for (size_t i = 0; i < rr_num; ++i) {
if (rrs[i].type == entry->type) {
ptr = (*rrs[i].read)(ptr, n, root, entry);
if (!ptr)
return (NULL);
break;
}
}
// XXX skip unknown records
skip = entry->data_len - (ptr - p);
if (*n < skip)
return (NULL);
advance(skip);
return (ptr);
}
ssize_t
rr_write(uint8_t *ptr, size_t *s, const struct rr_entry *entry, int8_t ans)
{
uint8_t *p = ptr;
ssize_t n = 0;
ssize_t l = 0;
n = rr_write_RR(p, s, entry, ans);
if (n < 0)
return (-1);
if (ans == 0) return n;
for (size_t i = 0; i < rr_num; ++i) {
if (rrs[i].type == entry->type) {
l = (*rrs[i].write)(p + n, s, entry);
if (l < 0)
return (-1);
// fill in data length after its computed
write_u16(p + n - 2, NULL, l);
n += l;
}
}
return n;
}
static const char *
rr_type_str(enum rr_type type)
{
for (size_t i = 0; i < rr_num; ++i) {
if (rrs[i].type == type)
return (rrs[i].name);
}
return ("UNKNOWN");
}
static const char *
rr_class_str(enum rr_class rr_class)
{
if (rr_class == RR_IN)
return ("IN");
return ("UNKNOWN");
}
void
rr_print(const struct rr_entry *entry)
{
size_t i;
printf("{"
"\"name\":\"%s\","
"\"type\":\"%s\","
"\"class\":\"%s\","
"\"data\":",
entry->name, rr_type_str(entry->type), rr_class_str(entry->rr_class));
for (i = 0; i < rr_num; ++i) {
if (rrs[i].type == entry->type) {
(*rrs[i].print)(&entry->data);
break;
}
}
if (i == rr_num)
printf("null");
printf("}");
}
void
rr_free(struct rr_entry *entry)
{
if (!entry) return;
switch (entry->type) {
case RR_SRV:
if (entry->data.SRV.target)
free(entry->data.SRV.target);
break;
case RR_PTR:
if (entry->data.PTR.domain)
free(entry->data.PTR.domain);
break;
case RR_TXT:
{
struct rr_data_txt *text, *TXT;
TXT = entry->data.TXT;
while ((text = TXT)) {
TXT = TXT->next;
if (text)
free(text);
}
}}
if (entry->name)
free(entry->name);
}