/
nsec3.c
1231 lines (1150 loc) · 37.2 KB
/
nsec3.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
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* nsec3.c -- nsec3 handling.
*
* Copyright (c) 2001-2006, NLnet Labs. All rights reserved.
*
* See LICENSE for the license.
*
*/
#include "config.h"
#ifdef NSEC3
#include <stdio.h>
#include <stdlib.h>
#include "nsec3.h"
#include "iterated_hash.h"
#include "namedb.h"
#include "nsd.h"
#include "answer.h"
#include "udbzone.h"
#include "options.h"
#define NSEC3_RDATA_BITMAP 5
/* compare nsec3 hashes in nsec3 tree */
static int
cmp_hash_tree(const void* x, const void* y)
{
const domain_type* a = (const domain_type*)x;
const domain_type* b = (const domain_type*)y;
if(!a->nsec3) return (b->nsec3?-1:0);
if(!b->nsec3) return 1;
if(!a->nsec3->hash_wc) return (b->nsec3->hash_wc?-1:0);
if(!b->nsec3->hash_wc) return 1;
return memcmp(a->nsec3->hash_wc->hash.hash,
b->nsec3->hash_wc->hash.hash, NSEC3_HASH_LEN);
}
/* compare nsec3 hashes in nsec3 wc tree */
static int
cmp_wchash_tree(const void* x, const void* y)
{
const domain_type* a = (const domain_type*)x;
const domain_type* b = (const domain_type*)y;
if(!a->nsec3) return (b->nsec3?-1:0);
if(!b->nsec3) return 1;
if(!a->nsec3->hash_wc) return (b->nsec3->hash_wc?-1:0);
if(!b->nsec3->hash_wc) return 1;
return memcmp(a->nsec3->hash_wc->wc.hash,
b->nsec3->hash_wc->wc.hash, NSEC3_HASH_LEN);
}
/* compare nsec3 hashes in nsec3 ds tree */
static int
cmp_dshash_tree(const void* x, const void* y)
{
const domain_type* a = (const domain_type*)x;
const domain_type* b = (const domain_type*)y;
if(!a->nsec3) return (b->nsec3?-1:0);
if(!b->nsec3) return 1;
if(!a->nsec3->ds_parent_hash) return (b->nsec3->ds_parent_hash?-1:0);
if(!b->nsec3->ds_parent_hash) return 1;
return memcmp(a->nsec3->ds_parent_hash->hash,
b->nsec3->ds_parent_hash->hash, NSEC3_HASH_LEN);
}
/* compare base32-encoded nsec3 hashes in nsec3 rr tree, they are
* stored in the domain name of the node */
static int
cmp_nsec3_tree(const void* x, const void* y)
{
const domain_type* a = (const domain_type*)x;
const domain_type* b = (const domain_type*)y;
/* labelcount + 32long label */
assert(dname_name(domain_dname_const(a))[0] == 32);
assert(dname_name(domain_dname_const(b))[0] == 32);
return memcmp(dname_name(domain_dname_const(a)), dname_name(domain_dname_const(b)), 33);
}
void nsec3_zone_trees_create(struct region* region, zone_type* zone)
{
if(!zone->nsec3tree)
zone->nsec3tree = rbtree_create(region, cmp_nsec3_tree);
if(!zone->hashtree)
zone->hashtree = rbtree_create(region, cmp_hash_tree);
if(!zone->wchashtree)
zone->wchashtree = rbtree_create(region, cmp_wchash_tree);
if(!zone->dshashtree)
zone->dshashtree = rbtree_create(region, cmp_dshash_tree);
}
static void
detect_nsec3_params(rr_type* nsec3_apex,
const unsigned char** salt, int* salt_len, int* iter)
{
assert(salt && salt_len && iter);
assert(nsec3_apex);
*salt_len = rdata_atom_data(nsec3_apex->rdatas[3])[0];
*salt = (unsigned char*)(rdata_atom_data(nsec3_apex->rdatas[3])+1);
*iter = read_uint16(rdata_atom_data(nsec3_apex->rdatas[2]));
}
const dname_type *
nsec3_b32_create(region_type* region, zone_type* zone, unsigned char* hash)
{
const dname_type* dname;
char b32[SHA_DIGEST_LENGTH*2+1];
b32_ntop(hash, SHA_DIGEST_LENGTH, b32, sizeof(b32));
dname=dname_parse(region, b32);
dname=dname_concatenate(region, dname, domain_dname(zone->apex));
return dname;
}
void
nsec3_hash_and_store(zone_type* zone, const dname_type* dname, uint8_t* store)
{
const unsigned char* nsec3_salt = NULL;
int nsec3_saltlength = 0;
int nsec3_iterations = 0;
detect_nsec3_params(zone->nsec3_param, &nsec3_salt,
&nsec3_saltlength, &nsec3_iterations);
assert(nsec3_iterations >= 0 && nsec3_iterations <= 65536);
iterated_hash((unsigned char*)store, nsec3_salt, nsec3_saltlength,
dname_name(dname), dname->name_size, nsec3_iterations);
}
#define STORE_HASH(x,y) memmove(domain->nsec3->x,y,NSEC3_HASH_LEN); domain->nsec3->have_##x =1;
/** find hash or create it and store it */
static void
nsec3_lookup_hash_and_wc(region_type* region, zone_type* zone,
const dname_type* dname, domain_type* domain, region_type* tmpregion)
{
const dname_type* wcard;
if(domain->nsec3->hash_wc) {
return;
}
/* lookup failed; disk failure or so */
domain->nsec3->hash_wc = (nsec3_hash_wc_node_type *)
region_alloc(region, sizeof(nsec3_hash_wc_node_type));
domain->nsec3->hash_wc->hash.node.key = NULL;
domain->nsec3->hash_wc->wc.node.key = NULL;
nsec3_hash_and_store(zone, dname, domain->nsec3->hash_wc->hash.hash);
wcard = dname_parse(tmpregion, "*");
wcard = dname_concatenate(tmpregion, wcard, dname);
nsec3_hash_and_store(zone, wcard, domain->nsec3->hash_wc->wc.hash);
}
static void
nsec3_lookup_hash_ds(region_type* region, zone_type* zone,
const dname_type* dname, domain_type* domain)
{
if(domain->nsec3->ds_parent_hash) {
return;
}
/* lookup failed; disk failure or so */
domain->nsec3->ds_parent_hash = (nsec3_hash_node_type *)
region_alloc(region, sizeof(nsec3_hash_node_type));
domain->nsec3->ds_parent_hash->node.key = NULL;
nsec3_hash_and_store(zone, dname, domain->nsec3->ds_parent_hash->hash);
}
static int
nsec3_has_soa(rr_type* rr)
{
if(rdata_atom_size(rr->rdatas[NSEC3_RDATA_BITMAP]) >= 3 && /* has types in bitmap */
rdata_atom_data(rr->rdatas[NSEC3_RDATA_BITMAP])[0] == 0 && /* first window = 0, */
/* [1]: bitmap length must be >= 1 */
/* [2]: bit[6] = SOA, thus mask first bitmap octet with 0x02 */
rdata_atom_data(rr->rdatas[NSEC3_RDATA_BITMAP])[2]&0x02) { /* SOA bit set */
return 1;
}
return 0;
}
static rr_type*
check_apex_soa(namedb_type* namedb, zone_type *zone, int nolog)
{
uint8_t h[NSEC3_HASH_LEN];
domain_type* domain;
const dname_type* hashed_apex, *dname = domain_dname(zone->apex);
unsigned j;
rrset_type* nsec3_rrset;
region_type* tmpregion;
nsec3_hash_and_store(zone, dname, h);
tmpregion = region_create(xalloc, free);
hashed_apex = nsec3_b32_create(tmpregion, zone, h);
domain = domain_table_find(namedb->domains, hashed_apex);
if(!domain) {
if(!nolog) {
log_msg(LOG_ERR, "%s NSEC3PARAM entry has no hash(apex).",
domain_to_string(zone->apex));
log_msg(LOG_ERR, "hash(apex)= %s",
dname_to_string(hashed_apex, NULL));
}
region_destroy(tmpregion);
return NULL;
}
nsec3_rrset = domain_find_rrset(domain, zone, TYPE_NSEC3);
if(!nsec3_rrset) {
if(!nolog) {
log_msg(LOG_ERR, "%s NSEC3PARAM entry: hash(apex) has no NSEC3 RRset.",
domain_to_string(zone->apex));
log_msg(LOG_ERR, "hash(apex)= %s",
dname_to_string(hashed_apex, NULL));
}
region_destroy(tmpregion);
return NULL;
}
for(j=0; j<nsec3_rrset->rr_count; j++) {
if(nsec3_has_soa(&nsec3_rrset->rrs[j])) {
region_destroy(tmpregion);
return &nsec3_rrset->rrs[j];
}
}
if(!nolog) {
log_msg(LOG_ERR, "%s NSEC3PARAM entry: hash(apex) NSEC3 has no SOA flag.",
domain_to_string(zone->apex));
log_msg(LOG_ERR, "hash(apex)= %s",
dname_to_string(hashed_apex, NULL));
}
region_destroy(tmpregion);
return NULL;
}
static void
nsec3param_to_str(struct rr* rr, char* str, size_t buflen)
{
rdata_atom_type* rd = rr->rdatas;
size_t len;
len = snprintf(str, buflen, "%u %u %u ",
(unsigned)rdata_atom_data(rd[0])[0],
(unsigned)rdata_atom_data(rd[1])[0],
(unsigned)read_uint16(rdata_atom_data(rd[2])));
if(rdata_atom_data(rd[3])[0] == 0) {
if(buflen > len + 2)
str[len++] = '-';
} else {
len += hex_ntop(rdata_atom_data(rd[3])+1,
rdata_atom_data(rd[3])[0], str+len, buflen-len-1);
}
if(buflen > len + 1)
str[len] = 0;
}
static struct rr*
db_find_nsec3param(struct namedb* db, struct zone* z, struct rr* avoid_rr,
int checkchain)
{
unsigned i;
rrset_type* rrset = domain_find_rrset(z->apex, z, TYPE_NSEC3PARAM);
if(!rrset) /* no NSEC3PARAM in mem */
return NULL;
/* find first nsec3param we can support (SHA1, no flags) */
for(i=0; i<rrset->rr_count; i++) {
rdata_atom_type* rd = rrset->rrs[i].rdatas;
/* do not use the RR that is going to be deleted (in IXFR) */
if(&rrset->rrs[i] == avoid_rr) continue;
if(rrset->rrs[i].rdata_count < 4) continue;
if(rdata_atom_data(rd[0])[0] == NSEC3_SHA1_HASH &&
rdata_atom_data(rd[1])[0] == 0) {
if(checkchain) {
z->nsec3_param = &rrset->rrs[i];
if(!check_apex_soa(db, z, 1)) {
char str[MAX_RDLENGTH*2+16];
nsec3param_to_str(z->nsec3_param,
str, sizeof(str));
VERBOSITY(1, (LOG_WARNING, "zone %s NSEC3PARAM %s has broken chain, ignoring", domain_to_string(z->apex), str));
continue; /* don't use broken chain */
}
}
if(2 <= verbosity) {
char str[MAX_RDLENGTH*2+16];
nsec3param_to_str(&rrset->rrs[i], str,
sizeof(str));
VERBOSITY(2, (LOG_INFO, "rehash of zone %s with parameters %s",
domain_to_string(z->apex), str));
}
return &rrset->rrs[i];
}
}
return NULL;
}
static struct rr*
udb_zone_find_nsec3param(struct namedb* db, udb_base* udb, udb_ptr* uz,
struct zone* z, int checkchain)
{
udb_ptr urr;
unsigned i;
rrset_type* rrset = domain_find_rrset(z->apex, z, TYPE_NSEC3PARAM);
if(!rrset) /* no NSEC3PARAM in mem */
return NULL;
udb_ptr_new(&urr, udb, &ZONE(uz)->nsec3param);
if(!urr.data || RR(&urr)->len < 5) {
/* no NSEC3PARAM in udb */
udb_ptr_unlink(&urr, udb);
return NULL;
}
/* find matching NSEC3PARAM RR in memory */
for(i=0; i<rrset->rr_count; i++) {
/* if this RR matches the udb RR then we are done */
rdata_atom_type* rd = rrset->rrs[i].rdatas;
if(rrset->rrs[i].rdata_count < 4) continue;
if(RR(&urr)->wire[0] == rdata_atom_data(rd[0])[0] && /*alg*/
RR(&urr)->wire[1] == rdata_atom_data(rd[1])[0] && /*flg*/
RR(&urr)->wire[2] == rdata_atom_data(rd[2])[0] && /*iter*/
RR(&urr)->wire[3] == rdata_atom_data(rd[2])[1] &&
RR(&urr)->wire[4] == rdata_atom_data(rd[3])[0] && /*slen*/
RR(&urr)->len >= 5 + RR(&urr)->wire[4] &&
memcmp(RR(&urr)->wire+5, rdata_atom_data(rd[3])+1,
rdata_atom_data(rd[3])[0]) == 0) {
udb_ptr_unlink(&urr, udb);
if(checkchain) {
z->nsec3_param = &rrset->rrs[i];
if(!check_apex_soa(db, z, 1))
return db_find_nsec3param(db, z,
NULL, checkchain);
}
return &rrset->rrs[i];
}
}
udb_ptr_unlink(&urr, udb);
return NULL;
}
void
nsec3_find_zone_param(struct namedb* db, struct zone* zone, udb_ptr* z,
struct rr* avoid_rr, int checkchain)
{
/* get nsec3param RR from udb */
if(db->udb)
zone->nsec3_param = udb_zone_find_nsec3param(db, db->udb,
z, zone, checkchain);
/* no db, get from memory, avoid using the rr that is going to be
* deleted, avoid_rr */
else zone->nsec3_param = db_find_nsec3param(db, zone, avoid_rr,
checkchain);
}
/* check params ok for one RR */
static int
nsec3_rdata_params_ok(rdata_atom_type* prd, rdata_atom_type* rd)
{
return (rdata_atom_data(rd[0])[0] ==
rdata_atom_data(prd[0])[0] && /* hash algo */
rdata_atom_data(rd[2])[0] ==
rdata_atom_data(prd[2])[0] && /* iterations 0 */
rdata_atom_data(rd[2])[1] ==
rdata_atom_data(prd[2])[1] && /* iterations 1 */
rdata_atom_data(rd[3])[0] ==
rdata_atom_data(prd[3])[0] && /* salt length */
memcmp(rdata_atom_data(rd[3])+1,
rdata_atom_data(prd[3])+1, rdata_atom_data(rd[3])[0])
== 0 );
}
int
nsec3_rr_uses_params(rr_type* rr, zone_type* zone)
{
if(!rr || rr->rdata_count < 4)
return 0;
return nsec3_rdata_params_ok(zone->nsec3_param->rdatas, rr->rdatas);
}
int
nsec3_in_chain_count(domain_type* domain, zone_type* zone)
{
rrset_type* rrset = domain_find_rrset(domain, zone, TYPE_NSEC3);
unsigned i;
int count = 0;
if(!rrset || !zone->nsec3_param)
return 0; /* no NSEC3s, none in the chain */
for(i=0; i<rrset->rr_count; i++) {
if(nsec3_rr_uses_params(&rrset->rrs[i], zone))
count++;
}
return count;
}
struct domain*
nsec3_chain_find_prev(struct zone* zone, struct domain* domain)
{
if(domain->nsec3 && domain->nsec3->nsec3_node.key) {
/* see if there is a prev */
rbnode_type* r = rbtree_previous(&domain->nsec3->nsec3_node);
if(r != RBTREE_NULL) {
/* found a previous, which is not the root-node in
* the prehash tree (and thus points to the tree) */
return (domain_type*)r->key;
}
}
if(zone->nsec3_last && zone->nsec3_last != domain)
return zone->nsec3_last;
return NULL;
}
/** clear hash tree. Called from nsec3_clear_precompile() only. */
static void
hash_tree_clear(rbtree_type* tree)
{
if(!tree) return;
/* Previously (before commit 4ca61188b3f7a0e077476875810d18a5d439871f
* and/or svn commit 4776) prehashes and corresponding rbtree nodes
* were part of struct nsec3_domain_data. Clearing the hash_tree would
* then mean setting the key value of the nodes to NULL to indicate
* absence of the prehash.
* But since prehash structs are separatly allocated, this is no longer
* necessary as currently the prehash structs are simply recycled and
* NULLed.
*
* rbnode_type* n;
* for(n=rbtree_first(tree); n!=RBTREE_NULL; n=rbtree_next(n)) {
* n->key = NULL;
* }
*/
tree->count = 0;
tree->root = RBTREE_NULL;
}
void
nsec3_clear_precompile(struct namedb* db, zone_type* zone)
{
domain_type* walk;
/* clear prehash items (there must not be items for other zones) */
prehash_clear(db->domains);
/* clear trees */
hash_tree_clear(zone->nsec3tree);
hash_tree_clear(zone->hashtree);
hash_tree_clear(zone->wchashtree);
hash_tree_clear(zone->dshashtree);
/* wipe hashes */
/* wipe precompile */
walk = zone->apex;
while(walk && domain_is_subdomain(walk, zone->apex)) {
if(walk->nsec3) {
if(nsec3_condition_hash(walk, zone)) {
walk->nsec3->nsec3_node.key = NULL;
walk->nsec3->nsec3_cover = NULL;
walk->nsec3->nsec3_wcard_child_cover = NULL;
walk->nsec3->nsec3_is_exact = 0;
if (walk->nsec3->hash_wc) {
region_recycle(db->domains->region,
walk->nsec3->hash_wc,
sizeof(nsec3_hash_wc_node_type));
walk->nsec3->hash_wc = NULL;
}
}
if(nsec3_condition_dshash(walk, zone)) {
walk->nsec3->nsec3_ds_parent_cover = NULL;
walk->nsec3->nsec3_ds_parent_is_exact = 0;
if (walk->nsec3->ds_parent_hash) {
region_recycle(db->domains->region,
walk->nsec3->ds_parent_hash,
sizeof(nsec3_hash_node_type));
walk->nsec3->ds_parent_hash = NULL;
}
}
}
walk = domain_next(walk);
}
zone->nsec3_last = NULL;
}
/* see if domain name is part of (existing names in) the nsec3 zone */
int
nsec3_domain_part_of_zone(domain_type* d, zone_type* z)
{
while(d) {
if(d->is_apex)
return (z->apex == d); /* zonecut, if right zone*/
d = d->parent;
}
return 0;
}
/* condition when a domain is precompiled */
int
nsec3_condition_hash(domain_type* d, zone_type* z)
{
return d->is_existing && !domain_has_only_NSEC3(d, z) &&
nsec3_domain_part_of_zone(d, z) && !domain_is_glue(d, z);
}
/* condition when a domain is ds precompiled */
int
nsec3_condition_dshash(domain_type* d, zone_type* z)
{
return d->is_existing && !domain_has_only_NSEC3(d, z) &&
(domain_find_rrset(d, z, TYPE_DS) ||
domain_find_rrset(d, z, TYPE_NS)) && d != z->apex
&& nsec3_domain_part_of_zone(d->parent, z);
}
zone_type*
nsec3_tree_zone(namedb_type* db, domain_type* d)
{
/* see nsec3_domain_part_of_zone; domains part of zone that has
* apex above them */
/* this does not use the rrset->zone pointer because there may be
* no rrsets left at apex (no SOA), e.g. during IXFR */
while(d) {
if(d->is_apex) {
/* we can try a SOA if its present (faster than tree)*/
/* DNSKEY and NSEC3PARAM are also good indicators */
rrset_type *rrset;
for (rrset = d->rrsets; rrset; rrset = rrset->next)
if (rrset_rrtype(rrset) == TYPE_SOA ||
rrset_rrtype(rrset) == TYPE_DNSKEY ||
rrset_rrtype(rrset) == TYPE_NSEC3PARAM)
return rrset->zone;
return namedb_find_zone(db, domain_dname(d));
}
d = d->parent;
}
return NULL;
}
zone_type*
nsec3_tree_dszone(namedb_type* db, domain_type* d)
{
/* the DStree does not contain nodes with d==z->apex */
if(d->is_apex)
d = d->parent;
return nsec3_tree_zone(db, d);
}
int
nsec3_find_cover(zone_type* zone, uint8_t* hash, size_t hashlen,
domain_type** result)
{
rbnode_type* r = NULL;
int exact;
domain_type d;
uint8_t n[48];
/* nsec3tree is sorted by b32 encoded domain name of the NSEC3 */
b32_ntop(hash, hashlen, (char*)(n+5), sizeof(n)-5);
#ifdef USE_RADIX_TREE
d.dname = (dname_type*)n;
#else
d.node.key = n;
#endif
n[0] = 34; /* name_size */
n[1] = 2; /* label_count */
n[2] = 0; /* label_offset[0] */
n[3] = 0; /* label_offset[1] */
n[4] = 32; /* label-size[0] */
assert(result);
assert(zone->nsec3_param && zone->nsec3tree);
exact = rbtree_find_less_equal(zone->nsec3tree, &d, &r);
if(r) {
*result = (domain_type*)r->key;
} else {
*result = zone->nsec3_last;
}
return exact;
}
void
nsec3_precompile_domain(struct namedb* db, struct domain* domain,
struct zone* zone, region_type* tmpregion)
{
domain_type* result = 0;
int exact;
allocate_domain_nsec3(db->domains, domain);
/* hash it */
nsec3_lookup_hash_and_wc(db->region,
zone, domain_dname(domain), domain, tmpregion);
/* add into tree */
zone_add_domain_in_hash_tree(db->region, &zone->hashtree,
cmp_hash_tree, domain, &domain->nsec3->hash_wc->hash.node);
zone_add_domain_in_hash_tree(db->region, &zone->wchashtree,
cmp_wchash_tree, domain, &domain->nsec3->hash_wc->wc.node);
/* lookup in tree cover ptr (or exact) */
exact = nsec3_find_cover(zone, domain->nsec3->hash_wc->hash.hash,
sizeof(domain->nsec3->hash_wc->hash.hash), &result);
domain->nsec3->nsec3_cover = result;
if(exact)
domain->nsec3->nsec3_is_exact = 1;
else domain->nsec3->nsec3_is_exact = 0;
/* find cover for *.domain for wildcard denial */
(void)nsec3_find_cover(zone, domain->nsec3->hash_wc->wc.hash,
sizeof(domain->nsec3->hash_wc->wc.hash), &result);
domain->nsec3->nsec3_wcard_child_cover = result;
}
void
nsec3_precompile_domain_ds(struct namedb* db, struct domain* domain,
struct zone* zone)
{
domain_type* result = 0;
int exact;
allocate_domain_nsec3(db->domains, domain);
/* hash it : it could have different hash parameters then the
other hash for this domain name */
nsec3_lookup_hash_ds(db->region, zone, domain_dname(domain), domain);
/* lookup in tree cover ptr (or exact) */
exact = nsec3_find_cover(zone, domain->nsec3->ds_parent_hash->hash,
sizeof(domain->nsec3->ds_parent_hash->hash), &result);
if(exact)
domain->nsec3->nsec3_ds_parent_is_exact = 1;
else domain->nsec3->nsec3_ds_parent_is_exact = 0;
domain->nsec3->nsec3_ds_parent_cover = result;
/* add into tree */
zone_add_domain_in_hash_tree(db->region, &zone->dshashtree,
cmp_dshash_tree, domain, &domain->nsec3->ds_parent_hash->node);
}
static void
parse_nsec3_name(const dname_type* dname, uint8_t* hash, size_t buflen)
{
/* first label must be the match, */
size_t lablen = (buflen-1) * 8 / 5;
const uint8_t* wire = dname_name(dname);
assert(lablen == 32 && buflen == NSEC3_HASH_LEN+1);
/* labels of length 32 for SHA1, and must have space+1 for convert */
if(wire[0] != lablen) {
/* not NSEC3 */
memset(hash, 0, buflen);
return;
}
(void)b32_pton((char*)wire+1, hash, buflen);
}
void
nsec3_precompile_nsec3rr(namedb_type* db, struct domain* domain,
struct zone* zone)
{
allocate_domain_nsec3(db->domains, domain);
/* add into nsec3tree */
zone_add_domain_in_hash_tree(db->region, &zone->nsec3tree,
cmp_nsec3_tree, domain, &domain->nsec3->nsec3_node);
/* fixup the last in the zone */
if(rbtree_last(zone->nsec3tree)->key == domain) {
zone->nsec3_last = domain;
}
}
void
nsec3_precompile_newparam(namedb_type* db, zone_type* zone)
{
region_type* tmpregion = region_create(xalloc, free);
domain_type* walk;
time_t s = time(NULL);
unsigned long n = 0, c = 0;
/* add nsec3s of chain to nsec3tree */
for(walk=zone->apex; walk && domain_is_subdomain(walk, zone->apex);
walk = domain_next(walk)) {
n++;
if(nsec3_in_chain_count(walk, zone) != 0) {
nsec3_precompile_nsec3rr(db, walk, zone);
}
}
/* hash and precompile zone */
for(walk=zone->apex; walk && domain_is_subdomain(walk, zone->apex);
walk = domain_next(walk)) {
if(nsec3_condition_hash(walk, zone)) {
nsec3_precompile_domain(db, walk, zone, tmpregion);
region_free_all(tmpregion);
}
if(nsec3_condition_dshash(walk, zone))
nsec3_precompile_domain_ds(db, walk, zone);
if(++c % ZONEC_PCT_COUNT == 0 && time(NULL) > s + ZONEC_PCT_TIME) {
s = time(NULL);
VERBOSITY(1, (LOG_INFO, "nsec3 %s %d %%",
zone->opts->name,
(n==0)?0:(int)(c*((unsigned long)100)/n)));
}
}
region_destroy(tmpregion);
}
void
prehash_zone_complete(struct namedb* db, struct zone* zone)
{
udb_ptr udbz;
/* robust clear it */
nsec3_clear_precompile(db, zone);
/* find zone settings */
assert(db && zone);
udbz.data = 0;
if(db->udb) {
if(!udb_zone_search(db->udb, &udbz, dname_name(domain_dname(
zone->apex)), domain_dname(zone->apex)->name_size)) {
udb_ptr_init(&udbz, db->udb); /* zero the ptr */
}
}
nsec3_find_zone_param(db, zone, &udbz, NULL, 1);
if(!zone->nsec3_param || !check_apex_soa(db, zone, 0)) {
zone->nsec3_param = NULL;
zone->nsec3_last = NULL;
if(udbz.data)
udb_ptr_unlink(&udbz, db->udb);
return;
}
if(udbz.data)
udb_ptr_unlink(&udbz, db->udb);
nsec3_precompile_newparam(db, zone);
}
static void
init_lookup_key_hash_tree(domain_type* d, uint8_t* hash)
{ memcpy(d->nsec3->hash_wc->hash.hash, hash, NSEC3_HASH_LEN); }
static void
init_lookup_key_wc_tree(domain_type* d, uint8_t* hash)
{ memcpy(d->nsec3->hash_wc->wc.hash, hash, NSEC3_HASH_LEN); }
static void
init_lookup_key_ds_tree(domain_type* d, uint8_t* hash)
{ memcpy(d->nsec3->ds_parent_hash->hash, hash, NSEC3_HASH_LEN); }
/* find first in the tree and true if the first to process it */
static int
process_first(rbtree_type* tree, uint8_t* hash, rbnode_type** p,
void (*init)(domain_type*, uint8_t*))
{
domain_type d;
struct nsec3_domain_data n;
nsec3_hash_wc_node_type hash_wc;
nsec3_hash_node_type ds_parent_hash;
if(!tree) {
*p = RBTREE_NULL;
return 0;
}
hash_wc.hash.node.key = NULL;
hash_wc.wc.node.key = NULL;
n.hash_wc = &hash_wc;
ds_parent_hash.node.key = NULL;
n.ds_parent_hash = &ds_parent_hash;
d.nsec3 = &n;
init(&d, hash);
if(rbtree_find_less_equal(tree, &d, p)) {
/* found an exact match */
return 1;
}
if(!*p) /* before first, go from first */
*p = rbtree_first(tree);
/* the inexact, smaller, match we found, does not itself need to
* be edited */
else
*p = rbtree_next(*p); /* if this becomes NULL, nothing to do */
return 0;
}
/* set end pointer if possible */
static void
process_end(rbtree_type* tree, uint8_t* hash, rbnode_type** p,
void (*init)(domain_type*, uint8_t*))
{
domain_type d;
struct nsec3_domain_data n;
nsec3_hash_wc_node_type hash_wc;
nsec3_hash_node_type ds_parent_hash;
if(!tree) {
*p = RBTREE_NULL;
return;
}
hash_wc.hash.node.key = NULL;
hash_wc.wc.node.key = NULL;
n.hash_wc = &hash_wc;
ds_parent_hash.node.key = NULL;
n.ds_parent_hash = &ds_parent_hash;
d.nsec3 = &n;
init(&d, hash);
if(rbtree_find_less_equal(tree, &d, p)) {
/* an exact match, fine, because this one does not get
* processed */
return;
}
/* inexact element, but if NULL, until first element in tree */
if(!*p) {
*p = rbtree_first(tree);
return;
}
/* inexact match, use next element, if possible, the smaller
* element is part of the range */
*p = rbtree_next(*p);
/* if next returns null, we go until the end of the tree */
}
/* prehash domains in hash range start to end */
static void
process_range(zone_type* zone, domain_type* start,
domain_type* end, domain_type* nsec3)
{
/* start NULL means from first in tree */
/* end NULL means to last in tree */
rbnode_type *p = RBTREE_NULL, *pwc = RBTREE_NULL, *pds = RBTREE_NULL;
rbnode_type *p_end = RBTREE_NULL, *pwc_end = RBTREE_NULL, *pds_end = RBTREE_NULL;
/* because the nodes are on the prehashlist, the domain->nsec3 is
* already allocated, and we need not allocate it here */
/* set start */
if(start) {
uint8_t hash[NSEC3_HASH_LEN+1];
parse_nsec3_name(domain_dname(start), hash, sizeof(hash));
/* if exact match on first, set is_exact */
if(process_first(zone->hashtree, hash, &p, init_lookup_key_hash_tree)) {
((domain_type*)(p->key))->nsec3->nsec3_cover = nsec3;
((domain_type*)(p->key))->nsec3->nsec3_is_exact = 1;
p = rbtree_next(p);
}
(void)process_first(zone->wchashtree, hash, &pwc, init_lookup_key_wc_tree);
if(process_first(zone->dshashtree, hash, &pds, init_lookup_key_ds_tree)){
((domain_type*)(pds->key))->nsec3->
nsec3_ds_parent_cover = nsec3;
((domain_type*)(pds->key))->nsec3->
nsec3_ds_parent_is_exact = 1;
pds = rbtree_next(pds);
}
} else {
if(zone->hashtree)
p = rbtree_first(zone->hashtree);
if(zone->wchashtree)
pwc = rbtree_first(zone->wchashtree);
if(zone->dshashtree)
pds = rbtree_first(zone->dshashtree);
}
/* set end */
if(end) {
uint8_t hash[NSEC3_HASH_LEN+1];
parse_nsec3_name(domain_dname(end), hash, sizeof(hash));
process_end(zone->hashtree, hash, &p_end, init_lookup_key_hash_tree);
process_end(zone->wchashtree, hash, &pwc_end, init_lookup_key_wc_tree);
process_end(zone->dshashtree, hash, &pds_end, init_lookup_key_ds_tree);
}
/* precompile */
while(p != RBTREE_NULL && p != p_end) {
((domain_type*)(p->key))->nsec3->nsec3_cover = nsec3;
((domain_type*)(p->key))->nsec3->nsec3_is_exact = 0;
p = rbtree_next(p);
}
while(pwc != RBTREE_NULL && pwc != pwc_end) {
((domain_type*)(pwc->key))->nsec3->
nsec3_wcard_child_cover = nsec3;
pwc = rbtree_next(pwc);
}
while(pds != RBTREE_NULL && pds != pds_end) {
((domain_type*)(pds->key))->nsec3->
nsec3_ds_parent_cover = nsec3;
((domain_type*)(pds->key))->nsec3->
nsec3_ds_parent_is_exact = 0;
pds = rbtree_next(pds);
}
}
/* prehash a domain from the prehash list */
static void
process_prehash_domain(domain_type* domain, zone_type* zone)
{
/* in the hashtree, wchashtree, dshashtree walk through to next NSEC3
* and set precompile pointers to point to this domain (or is_exact),
* the first domain can be is_exact. If it is the last NSEC3, also
* process the initial part (before the first) */
rbnode_type* nx;
/* this domain is part of the prehash list and therefore the
* domain->nsec3 is allocated and need not be allocated here */
assert(domain->nsec3 && domain->nsec3->nsec3_node.key);
nx = rbtree_next(&domain->nsec3->nsec3_node);
if(nx != RBTREE_NULL) {
/* process until next nsec3 */
domain_type* end = (domain_type*)nx->key;
process_range(zone, domain, end, domain);
} else {
/* first is root, but then comes the first nsec3 */
domain_type* first = (domain_type*)(rbtree_first(
zone->nsec3tree)->key);
/* last in zone */
process_range(zone, domain, NULL, domain);
/* also process before first in zone */
process_range(zone, NULL, first, domain);
}
}
void prehash_zone(struct namedb* db, struct zone* zone)
{
domain_type* d;
if(!zone->nsec3_param) {
prehash_clear(db->domains);
return;
}
if(!check_apex_soa(db, zone, 1)) {
/* the zone fails apex soa check, prehash complete may
* detect other valid chains */
prehash_clear(db->domains);
prehash_zone_complete(db, zone);
return;
}
/* process prehash list */
for(d = db->domains->prehash_list; d; d = d->nsec3->prehash_next) {
process_prehash_domain(d, zone);
}
/* clear prehash list */
prehash_clear(db->domains);
if(!check_apex_soa(db, zone, 0)) {
zone->nsec3_param = NULL;
zone->nsec3_last = NULL;
}
}
/* add the NSEC3 rrset to the query answer at the given domain */
static void
nsec3_add_rrset(struct query* query, struct answer* answer,
rr_section_type section, struct domain* domain)
{
if(domain) {
rrset_type* rrset = domain_find_rrset(domain, query->zone, TYPE_NSEC3);
if(rrset)
answer_add_rrset(answer, section, domain, rrset);
}
}
/* this routine does hashing at query-time. slow. */
static void
nsec3_add_nonexist_proof(struct query* query, struct answer* answer,
struct domain* encloser, const dname_type* qname)
{
uint8_t hash[NSEC3_HASH_LEN];
const dname_type* to_prove;
domain_type* cover=0;
assert(encloser);
/* if query=a.b.c.d encloser=c.d. then proof needed for b.c.d. */
/* if query=a.b.c.d encloser=*.c.d. then proof needed for b.c.d. */
to_prove = dname_partial_copy(query->region, qname,
dname_label_match_count(qname, domain_dname(encloser))+1);
/* generate proof that one label below closest encloser does not exist */
nsec3_hash_and_store(query->zone, to_prove, hash);
if(nsec3_find_cover(query->zone, hash, sizeof(hash), &cover))
{
/* exact match, hash collision */
domain_type* walk;
char hashbuf[512];
char reversebuf[512];
(void)b32_ntop(hash, sizeof(hash), hashbuf, sizeof(hashbuf));
snprintf(reversebuf, sizeof(reversebuf), "(no name in the zone hashes to this nsec3 record)");
walk = query->zone->apex;
while(walk) {
if(walk->nsec3 && walk->nsec3->nsec3_cover == cover) {
snprintf(reversebuf, sizeof(reversebuf),
"%s %s", domain_to_string(walk),
walk->nsec3->nsec3_is_exact?"exact":"no_exact_hash_match");
if(walk->nsec3->nsec3_is_exact)
break;
}
if(walk->nsec3 && walk->nsec3->nsec3_ds_parent_cover == cover) {
snprintf(reversebuf, sizeof(reversebuf),
"%s %s", domain_to_string(walk),
walk->nsec3->nsec3_ds_parent_is_exact?"exact":"no_exact_hash_match");
if(walk->nsec3->nsec3_ds_parent_is_exact)
break;
}
walk = domain_next(walk);
}
/* the hashed name of the query corresponds to an existing name. */
VERBOSITY(3, (LOG_ERR, "nsec3 hash collision for name=%s hash=%s reverse=%s",
dname_to_string(to_prove, NULL), hashbuf, reversebuf));
RCODE_SET(query->packet, RCODE_SERVFAIL);
/* RFC 8914 - Extended DNS Errors
* 4.21. Extended DNS Error Code 0 - Other */
ASSIGN_EDE_CODE_AND_STRING_LITERAL(query->edns.ede,
EDE_OTHER, "NSEC3 hash collision");
return;
}
else
{
/* cover proves the qname does not exist */
nsec3_add_rrset(query, answer, AUTHORITY_SECTION, cover);
}
}
static void
nsec3_add_closest_encloser_proof(
struct query* query, struct answer* answer,
struct domain* closest_encloser, const dname_type* qname)
{
if(!closest_encloser)
return;
/* prove that below closest encloser nothing exists */