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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
|
// Copyright (C) 2010 Internet Systems Consortium, Inc. ("ISC")
//
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission notice appear in all copies.
//
// THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
// REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
// AND FITNESS. IN NO EVENT SHALL ISC 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 <config.h>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <vector>
#include <boost/shared_ptr.hpp>
#include <boost/foreach.hpp>
#include <datasrc/cache.h>
#include <datasrc/data_source.h>
#include <datasrc/query.h>
#include <util/base32hex.h>
#include <util/buffer.h>
#include <util/sha1.h>
#include <dns/message.h>
#include <dns/name.h>
#include <dns/rcode.h>
#include <dns/rdataclass.h>
#include <dns/rrset.h>
#include <dns/rrsetlist.h>
#include <cc/data.h>
#define RETERR(x) do { \
DataSrc::Result r = (x); \
if (r != DataSrc::SUCCESS) \
return (r); \
} while (0)
using namespace std;
using namespace isc::util;
using namespace isc::dns;
using namespace isc::dns::rdata;
namespace {
struct MatchRRsetForType {
MatchRRsetForType(const RRType rrtype) : rrtype_(rrtype) {}
bool operator()(RRsetPtr rrset) {
return (rrset->getType() == rrtype_);
}
const RRType rrtype_;
};
// This is a helper to retrieve a specified RR type of RRset from RRsetList.
// In our case the data source search logic should ensure that the class is
// valid. We use this find logic of our own so that we can support both
// specific RR class queries (normal case) and class ANY queries.
RRsetPtr
findRRsetFromList(RRsetList& list, const RRType rrtype) {
RRsetList::iterator it(find_if(list.begin(), list.end(),
MatchRRsetForType(rrtype)));
return (it != list.end() ? *it : RRsetPtr());
}
}
namespace isc {
namespace datasrc {
typedef boost::shared_ptr<const Nsec3Param> ConstNsec3ParamPtr;
class ZoneInfo {
public:
ZoneInfo(DataSrc* ts,
const isc::dns::Name& n,
const isc::dns::RRClass& c,
const isc::dns::RRType& t = isc::dns::RRType::ANY()) :
top_source_(ts),
dsm_(((t == RRType::DS() && n.getLabelCount() != 1)
? n.split(1, n.getLabelCount() - 1) : n),
c)
{}
const Name* getEnclosingZone() {
if (dsm_.getEnclosingZone() == NULL) {
top_source_->findClosestEnclosure(dsm_);
}
return (dsm_.getEnclosingZone());
}
const DataSrc* getDataSource() {
if (dsm_.getDataSource() == NULL) {
top_source_->findClosestEnclosure(dsm_);
}
return (dsm_.getDataSource());
}
private:
const DataSrc* top_source_;
DataSrcMatch dsm_;
};
// Add a task to the query task queue to look up additional data
// (i.e., address records for the names included in NS or MX records)
void
getAdditional(Query& q, ConstRRsetPtr rrset) {
if (!q.wantAdditional()) {
return;
}
RdataIteratorPtr it = rrset->getRdataIterator();
for (; !it->isLast(); it->next()) {
const Rdata& rd(it->getCurrent());
if (rrset->getType() == RRType::NS()) {
const generic::NS& ns = dynamic_cast<const generic::NS&>(rd);
q.tasks().push(QueryTaskPtr(
new QueryTask(q, ns.getNSName(),
Message::SECTION_ADDITIONAL,
QueryTask::GLUE_QUERY,
QueryTask::GETADDITIONAL)));
} else if (rrset->getType() == RRType::MX()) {
const generic::MX& mx = dynamic_cast<const generic::MX&>(rd);
q.tasks().push(QueryTaskPtr(
new QueryTask(q, mx.getMXName(),
Message::SECTION_ADDITIONAL,
QueryTask::NOGLUE_QUERY,
QueryTask::GETADDITIONAL)));
}
}
}
// Synthesize a CNAME answer, for the benefit of clients that don't
// understand DNAME
void
synthesizeCname(QueryTaskPtr task, RRsetPtr rrset, RRsetList& target) {
RdataIteratorPtr it = rrset->getRdataIterator();
// More than one DNAME RR in the RRset is illegal, so we only have
// to process the first one.
if (it->isLast()) {
return;
}
const Rdata& rd(it->getCurrent());
const generic::DNAME& dname = dynamic_cast<const generic::DNAME&>(rd);
const Name& dname_target(dname.getDname());
RRsetPtr cname(new RRset(task->qname, rrset->getClass(), RRType::CNAME(),
rrset->getTTL()));
const int qnlen = task->qname.getLabelCount();
const int dnlen = rrset->getName().getLabelCount();
assert(qnlen > dnlen);
const Name& prefix(task->qname.split(0, qnlen - dnlen));
cname->addRdata(generic::CNAME(prefix.concatenate(dname_target)));
target.addRRset(cname);
}
// Add a task to the query task queue to look up the data pointed
// to by a CNAME record
void
chaseCname(Query& q, QueryTaskPtr task, RRsetPtr rrset) {
RdataIteratorPtr it = rrset->getRdataIterator();
// More than one CNAME RR in the RRset is illegal, so we only have
// to process the first one.
if (it->isLast()) {
return;
}
// Stop chasing CNAMES after 16 lookups, to prevent loops
if (q.tooMany()) {
return;
}
q.tasks().push(QueryTaskPtr(
new QueryTask(q, dynamic_cast<const generic::CNAME&>
(it->getCurrent()).getCname(),
task->qtype, Message::SECTION_ANSWER,
QueryTask::FOLLOWCNAME)));
}
// Check the cache for data which can answer the current query task.
bool
checkCache(QueryTask& task, RRsetList& target) {
HotCache& cache = task.q.getCache();
RRsetList rrsets;
RRsetPtr rrset;
int count = 0;
uint32_t flags = 0, cflags = 0;
bool hit = false, found = false;
switch (task.op) {
case QueryTask::SIMPLE_QUERY: // Find exact RRset
// ANY queries must be handled by the low-level data source,
// or the results won't be guaranteed to be complete
if (task.qtype == RRType::ANY() || task.qclass == RRClass::ANY()) {
break;
}
hit = cache.retrieve(task.qname, task.qclass, task.qtype, rrset, flags);
if (hit) {
if (rrset) {
rrsets.addRRset(rrset);
target.append(rrsets);
}
// Reset the referral flag and treat CNAME as "not found".
// This emulates the behavior of the sqlite3 data source.
// XXX: this is not ideal in that the responsibility for handling
// operation specific cases is spread over various classes at
// different abstraction levels. For longer terms we should
// revisit the whole datasource/query design, and clarify this
// point better.
flags &= ~DataSrc::REFERRAL;
if ((flags & DataSrc::CNAME_FOUND) != 0) {
flags &= ~DataSrc::CNAME_FOUND;
flags |= DataSrc::TYPE_NOT_FOUND;
}
task.flags = flags;
return (true);
}
break;
case QueryTask::AUTH_QUERY: // Find exact RRset or CNAME
if (task.qtype == RRType::ANY() || task.qclass == RRClass::ANY()) {
break;
}
hit = cache.retrieve(task.qname, task.qclass, task.qtype, rrset, flags);
if (!hit || !rrset || (flags & DataSrc::CNAME_FOUND) != 0) {
hit = cache.retrieve(task.qname, task.qclass, RRType::CNAME(),
rrset, flags);
if (!rrset) {
// If we don't have a positive cache, forget it; otherwise the
// intermediate result may confuse the subsequent processing.
hit = false;
}
}
if (hit) {
if (rrset) {
rrsets.addRRset(rrset);
target.append(rrsets);
}
task.flags = flags;
return (true);
}
break;
case QueryTask::GLUE_QUERY: // Find addresses
case QueryTask::NOGLUE_QUERY:
// (XXX: need to figure out how to deal with noglue case)
flags = 0;
hit = cache.retrieve(task.qname, task.qclass, RRType::A(),
rrset, cflags);
if (hit) {
flags |= cflags;
++count;
if (rrset) {
rrsets.addRRset(rrset);
found = true;
}
}
hit = cache.retrieve(task.qname, task.qclass, RRType::AAAA(),
rrset, flags);
if (hit) {
flags |= cflags;
++count;
if (rrset) {
rrsets.addRRset(rrset);
found = true;
}
}
if (count == 2) {
if (found) {
flags &= ~DataSrc::TYPE_NOT_FOUND;
target.append(rrsets);
}
task.flags = flags;
return (true);
}
break;
case QueryTask::REF_QUERY: // Find NS, DS and/or DNAME
flags = count = 0;
hit = cache.retrieve(task.qname, task.qclass, RRType::NS(),
rrset, cflags);
if (hit) {
flags |= cflags;
++count;
if (rrset) {
rrsets.addRRset(rrset);
found = true;
}
}
hit = cache.retrieve(task.qname, task.qclass, RRType::DS(),
rrset, flags);
if (hit) {
flags |= cflags;
++count;
if (rrset) {
rrsets.addRRset(rrset);
found = true;
}
}
hit = cache.retrieve(task.qname, task.qclass, RRType::DNAME(),
rrset, flags);
if (hit) {
flags |= cflags;
++count;
if (rrset) {
rrsets.addRRset(rrset);
found = true;
}
}
if (count == 3) {
if (found) {
flags &= ~DataSrc::TYPE_NOT_FOUND;
flags &= DataSrc::REFERRAL;
target.append(rrsets);
}
task.flags = flags;
return (true);
}
break;
}
return (false);
}
// Carry out the query specified in a QueryTask object
DataSrc::Result
doQueryTask(QueryTask& task, ZoneInfo& zoneinfo, RRsetList& target) {
HotCache& cache = task.q.getCache();
RRsetPtr rrset;
// First, check the cache for matching data
if (checkCache(task, target)) {
return (DataSrc::SUCCESS);
}
// Requested data weren't in the cache (or were, but had expired),
// so now we proceed with the low-level data source lookup, and cache
// whatever we find.
const DataSrc* ds = zoneinfo.getDataSource();
const Name* const zonename = zoneinfo.getEnclosingZone();
if (ds == NULL) {
task.flags |= DataSrc::NO_SUCH_ZONE;
return (DataSrc::SUCCESS);
}
DataSrc::Result result;
switch (task.op) {
case QueryTask::SIMPLE_QUERY:
result = ds->findExactRRset(task.qname, task.qclass, task.qtype,
target, task.flags, zonename);
if (result != DataSrc::SUCCESS) {
return (result);
}
if (task.qclass == RRClass::ANY()) {
// XXX: Currently, RRsetList::findRRset() doesn't handle
// ANY queries, and without that we can't cache the results,
// so we just return in that case.
return (result);
}
if (task.flags == 0) {
rrset = target.findRRset(task.qtype, task.qclass);
assert(rrset);
cache.addPositive(rrset, task.flags);
} else {
cache.addNegative(task.qname, task.qclass, task.qtype, task.flags);
}
return (result);
case QueryTask::AUTH_QUERY:
result = ds->findRRset(task.qname, task.qclass, task.qtype,
target, task.flags, zonename);
if (result != DataSrc::SUCCESS) {
return (result);
}
if (task.qclass == RRClass::ANY()) {
return (result);
}
if (task.qtype == RRType::ANY()) {
BOOST_FOREACH(RRsetPtr rr, target) {
cache.addPositive(rr, task.flags);
}
} else if ((task.flags & DataSrc::CNAME_FOUND) != 0) {
cache.addNegative(task.qname, task.qclass, task.qtype, task.flags);
rrset = target.findRRset(RRType::CNAME(), task.qclass);
assert(rrset);
cache.addPositive(rrset, task.flags);
} else if ((task.flags & DataSrc::DATA_NOT_FOUND) == 0) {
if (task.qtype != RRType::CNAME()) {
cache.addNegative(task.qname, task.qclass, RRType::CNAME(),
task.flags);
}
rrset = target.findRRset(task.qtype, task.qclass);
assert(rrset);
cache.addPositive(rrset, task.flags);
} else {
cache.addNegative(task.qname, task.qclass, task.qtype, task.flags);
}
return (result);
case QueryTask::GLUE_QUERY:
case QueryTask::NOGLUE_QUERY:
result = ds->findAddrs(task.qname, task.qclass, target,
task.flags, zonename);
if (result != DataSrc::SUCCESS) {
return (result);
}
if (task.qclass == RRClass::ANY()) {
return (result);
}
rrset = target.findRRset(RRType::A(), task.qclass);
if (rrset) {
cache.addPositive(rrset, task.flags);
} else {
cache.addNegative(task.qname, task.qclass, RRType::A(), task.flags);
}
rrset = target.findRRset(RRType::AAAA(), task.qclass);
if (rrset) {
cache.addPositive(rrset, task.flags);
} else {
cache.addNegative(task.qname, task.qclass, RRType::AAAA(),
task.flags);
}
return (result);
case QueryTask::REF_QUERY:
result = ds->findReferral(task.qname, task.qclass, target,
task.flags, zonename);
if (result != DataSrc::SUCCESS) {
return (result);
}
if (task.qclass == RRClass::ANY()) {
return (result);
}
rrset = target.findRRset(RRType::NS(), task.qclass);
if (rrset) {
cache.addPositive(rrset, task.flags);
} else {
cache.addNegative(task.qname, task.qclass, RRType::NS(),
task.flags);
}
rrset = target.findRRset(RRType::DS(), task.qclass);
if (rrset) {
cache.addPositive(rrset, task.flags);
} else {
cache.addNegative(task.qname, task.qclass, RRType::DS(),
task.flags);
}
rrset = target.findRRset(RRType::DNAME(), task.qclass);
if (rrset) {
cache.addPositive(rrset, task.flags);
} else {
cache.addNegative(task.qname, task.qclass, RRType::DNAME(),
task.flags);
}
return (result);
}
// Not reached
return (DataSrc::ERROR);
}
// Add an RRset (and its associated RRSIG) to a message section,
// checking first to ensure that there isn't already an RRset with
// the same name and type.
inline void
addToMessage(Query& q, const Message::Section sect, RRsetPtr rrset,
bool no_dnssec = false)
{
Message& m = q.message();
if (no_dnssec) {
if (rrset->getType() == RRType::RRSIG() ||
!m.hasRRset(sect, rrset->getName(), rrset->getClass(),
rrset->getType())) {
m.addRRset(sect, rrset, false);
}
} else {
if (!m.hasRRset(sect, rrset->getName(), rrset->getClass(),
rrset->getType())) {
m.addRRset(sect, rrset, q.wantDnssec());
}
}
}
// Copy referral information into the authority section of a message
inline void
copyAuth(Query& q, RRsetList& auth) {
BOOST_FOREACH(RRsetPtr rrset, auth) {
if (rrset->getType() == RRType::DNAME()) {
continue;
}
if (rrset->getType() == RRType::DS() && !q.wantDnssec()) {
continue;
}
addToMessage(q, Message::SECTION_AUTHORITY, rrset);
getAdditional(q, rrset);
}
}
// Query for referrals (i.e., NS/DS or DNAME) at a given name
inline bool
refQuery(const Query& q, const Name& name, ZoneInfo& zoneinfo,
RRsetList& target)
{
QueryTask newtask(q, name, QueryTask::REF_QUERY);
if (doQueryTask(newtask, zoneinfo, target) != DataSrc::SUCCESS) {
// Lookup failed
return (false);
}
// Referral bit is expected, so clear it when checking flags
if ((newtask.flags & ~DataSrc::REFERRAL) != 0) {
return (false);
}
return (true);
}
// Match downward, from the zone apex to the query name, looking for
// referrals. Note that we exclude the apex name and query name themselves;
// they'll be handled in a normal lookup in the zone.
inline bool
hasDelegation(Query& q, QueryTaskPtr task, ZoneInfo& zoneinfo) {
const Name* const zonename = zoneinfo.getEnclosingZone();
if (zonename == NULL) {
if (task->state == QueryTask::GETANSWER) {
q.message().setRcode(Rcode::REFUSED());
}
return (false);
}
const int diff = task->qname.getLabelCount() - zonename->getLabelCount();
if (diff > 1) {
bool found = false;
RRsetList ref;
for (int i = diff - 1; i > 0; --i) {
const Name sub(task->qname.split(i));
if (refQuery(q, sub, zoneinfo, ref)) {
found = true;
break;
}
}
// Found a referral while getting additional data
// for something other than NS; we skip it.
if (found && task->op == QueryTask::NOGLUE_QUERY) {
return (true);
}
// Found a referral while getting answer data;
// send a delegation.
if (found) {
RRsetPtr r = findRRsetFromList(ref, RRType::DNAME());
if (r != NULL) {
RRsetList syn;
addToMessage(q, Message::SECTION_ANSWER, r);
q.message().setHeaderFlag(Message::HEADERFLAG_AA);
synthesizeCname(task, r, syn);
if (syn.size() == 1) {
RRsetPtr cname_rrset = findRRsetFromList(syn,
RRType::CNAME());
addToMessage(q, Message::SECTION_ANSWER, cname_rrset);
chaseCname(q, task, cname_rrset);
return (true);
}
}
copyAuth(q, ref);
return (true);
}
}
// We appear to have authoritative data; set the header
// flag. (We may clear it later if we find a referral
// at the actual qname node.)
if (task->op == QueryTask::AUTH_QUERY &&
task->state == QueryTask::GETANSWER) {
q.message().setHeaderFlag(Message::HEADERFLAG_AA);
}
return (false);
}
inline DataSrc::Result
addSOA(Query& q, ZoneInfo& zoneinfo) {
RRsetList soa;
const Name* const zonename = zoneinfo.getEnclosingZone();
QueryTask newtask(q, *zonename, RRType::SOA(), QueryTask::SIMPLE_QUERY);
RETERR(doQueryTask(newtask, zoneinfo, soa));
if (newtask.flags != 0) {
return (DataSrc::ERROR);
}
addToMessage(q, Message::SECTION_AUTHORITY,
findRRsetFromList(soa, RRType::SOA()));
return (DataSrc::SUCCESS);
}
inline DataSrc::Result
addNSEC(Query& q, const Name& name, ZoneInfo& zoneinfo) {
RRsetList nsec;
QueryTask newtask(q, name, RRType::NSEC(), QueryTask::SIMPLE_QUERY);
RETERR(doQueryTask(newtask, zoneinfo, nsec));
if (newtask.flags == 0) {
addToMessage(q, Message::SECTION_AUTHORITY,
findRRsetFromList(nsec, RRType::NSEC()));
}
return (DataSrc::SUCCESS);
}
inline DataSrc::Result
getNsec3(Query& q, ZoneInfo& zoneinfo, string& hash, RRsetPtr& target) {
const DataSrc* ds = zoneinfo.getDataSource();
const Name* const zonename = zoneinfo.getEnclosingZone();
if (ds == NULL) {
q.message().setRcode(Rcode::SERVFAIL());
return (DataSrc::ERROR);
}
RRsetList rl;
RETERR(ds->findCoveringNSEC3(*zonename, hash, rl));
target = rl.findRRset(RRType::NSEC3(), q.qclass());
return (DataSrc::SUCCESS);
}
ConstNsec3ParamPtr
getNsec3Param(Query& q, ZoneInfo& zoneinfo) {
DataSrc::Result result;
RRsetList nsec3param;
const Name* const zonename = zoneinfo.getEnclosingZone();
QueryTask newtask(q, *zonename, RRType::NSEC3PARAM(),
QueryTask::SIMPLE_QUERY);
result = doQueryTask(newtask, zoneinfo, nsec3param);
newtask.flags &= ~DataSrc::REFERRAL;
if (result != DataSrc::SUCCESS || newtask.flags != 0) {
return (ConstNsec3ParamPtr());
}
RRsetPtr rrset = nsec3param.findRRset(RRType::NSEC3PARAM(), q.qclass());
if (!rrset) {
return (ConstNsec3ParamPtr());
}
// XXX: currently only one NSEC3 chain per zone is supported;
// we will need to revisit this.
RdataIteratorPtr it = rrset->getRdataIterator();
if (it->isLast()) {
return (ConstNsec3ParamPtr());
}
const generic::NSEC3PARAM& np =
dynamic_cast<const generic::NSEC3PARAM&>(it->getCurrent());
return (ConstNsec3ParamPtr(new Nsec3Param(np.getHashalg(), np.getFlags(),
np.getIterations(),
np.getSalt())));
}
inline DataSrc::Result
proveNX(Query& q, QueryTaskPtr task, ZoneInfo& zoneinfo, const bool wildcard) {
Message& m = q.message();
const Name* const zonename = zoneinfo.getEnclosingZone();
ConstNsec3ParamPtr nsec3 = getNsec3Param(q, zoneinfo);
if (nsec3 != NULL) {
// Attach the NSEC3 record covering the QNAME
RRsetPtr rrset;
string hash1(nsec3->getHash(task->qname));
RETERR(getNsec3(q, zoneinfo, hash1, rrset));
addToMessage(q, Message::SECTION_AUTHORITY, rrset);
// If this is an NXRRSET or NOERROR/NODATA, we're done
if ((task->flags & DataSrc::TYPE_NOT_FOUND) != 0) {
return (DataSrc::SUCCESS);
}
// Find the closest provable enclosing name for QNAME
Name enclosure(*zonename);
const int diff = task->qname.getLabelCount() -
enclosure.getLabelCount();
string hash2;
for (int i = 1; i <= diff; ++i) {
enclosure = task->qname.split(i);
string nodehash(nsec3->getHash(enclosure));
if (nodehash == hash1) {
break;
}
hash2 = nodehash;
RRsetList rl;
// hash2 will be overwritten with the actual hash found;
// we don't want to use one until we find an exact match
RETERR(getNsec3(q, zoneinfo, hash2, rrset));
if (hash2 == nodehash) {
addToMessage(q, Message::SECTION_AUTHORITY, rrset);
break;
}
}
// If we are processing a wildcard answer, we're done.
if (wildcard) {
return (DataSrc::SUCCESS);
}
// Otherwise, there is no wildcard record, so we must add a
// covering NSEC3 to prove that it doesn't exist.
string hash3(nsec3->getHash(Name("*").concatenate(enclosure)));
RETERR(getNsec3(q, zoneinfo, hash3, rrset));
if (hash3 != hash1 && hash3 != hash2) {
addToMessage(q, Message::SECTION_AUTHORITY, rrset);
}
} else {
Name nsecname(task->qname);
if ((task->flags & DataSrc::NAME_NOT_FOUND) != 0 || wildcard) {
const DataSrc* ds = zoneinfo.getDataSource();
if (ds == NULL) {
m.setRcode(Rcode::SERVFAIL());
return (DataSrc::ERROR);
}
ds->findPreviousName(task->qname, nsecname, zonename);
}
RETERR(addNSEC(q, nsecname, zoneinfo));
if ((task->flags & DataSrc::TYPE_NOT_FOUND) != 0 ||
nsecname == *zonename)
{
return (DataSrc::SUCCESS);
}
// If we are processing a wildcard answer, we're done.
if (wildcard) {
return (DataSrc::SUCCESS);
}
// Otherwise, there is no wildcard record, so we must add an
// NSEC for the zone to prove the wildcard doesn't exist.
RETERR(addNSEC(q, *zonename, zoneinfo));
}
return (DataSrc::SUCCESS);
}
// Attempt a wildcard lookup
inline DataSrc::Result
tryWildcard(Query& q, QueryTaskPtr task, ZoneInfo& zoneinfo, bool& found) {
Message& m = q.message();
DataSrc::Result result;
found = false;
if ((task->flags & DataSrc::NAME_NOT_FOUND) == 0 ||
(task->state != QueryTask::GETANSWER &&
task->state != QueryTask::FOLLOWCNAME)) {
return (DataSrc::SUCCESS);
}
const Name* const zonename = zoneinfo.getEnclosingZone();
const int diff = task->qname.getLabelCount() - zonename->getLabelCount();
if (diff < 1) {
return (DataSrc::SUCCESS);
}
RRsetList wild;
const Name star("*");
bool cname = false;
for (int i = 1; i <= diff; ++i) {
const Name& wname(star.concatenate(task->qname.split(i)));
QueryTask newtask(q, wname, task->qtype, Message::SECTION_ANSWER,
QueryTask::AUTH_QUERY);
result = doQueryTask(newtask, zoneinfo, wild);
if (result == DataSrc::SUCCESS) {
if (newtask.flags == 0) {
task->flags &= ~DataSrc::NAME_NOT_FOUND;
task->flags &= ~DataSrc::TYPE_NOT_FOUND;
found = true;
break;
} else if ((newtask.flags & DataSrc::CNAME_FOUND) != 0) {
task->flags &= ~DataSrc::NAME_NOT_FOUND;
task->flags &= ~DataSrc::TYPE_NOT_FOUND;
task->flags |= DataSrc::CNAME_FOUND;
found = true;
cname = true;
break;
} else if ((newtask.flags & DataSrc::TYPE_NOT_FOUND) != 0) {
task->flags &= ~DataSrc::NAME_NOT_FOUND;
task->flags |= DataSrc::TYPE_NOT_FOUND;
break;
}
}
}
// A wildcard was found.
if (found) {
// Prove the nonexistence of the name we were looking for
if (q.wantDnssec()) {
result = proveNX(q, task, zoneinfo, true);
if (result != DataSrc::SUCCESS) {
m.setRcode(Rcode::SERVFAIL());
return (DataSrc::ERROR);
}
}
// Add the data to the answer section (but with the name changed to
// match the qname), and then continue as if this were a normal
// answer: if a CNAME, chase the target, otherwise add authority.
if (cname) {
RRsetPtr rrset = findRRsetFromList(wild, RRType::CNAME());
if (rrset != NULL) {
rrset->setName(task->qname);
addToMessage(q, Message::SECTION_ANSWER, rrset);
chaseCname(q, task, rrset);
}
} else {
BOOST_FOREACH (RRsetPtr rrset, wild) {
rrset->setName(task->qname);
addToMessage(q, Message::SECTION_ANSWER, rrset);
}
RRsetList auth;
if (!refQuery(q, *zonename, zoneinfo, auth)) {
return (DataSrc::ERROR);
}
copyAuth(q, auth);
}
}
return (DataSrc::SUCCESS);
}
//
// doQuery: Processes a query.
//
void
DataSrc::doQuery(Query& q) {
Message& m = q.message();
vector<RRsetPtr> additional;
// Record the fact that the query is being processed by the
// current data source.
q.setDatasrc(this);
// Process the query task queue. (The queue is initialized
// and the first task placed on it by the Query constructor.)
m.setHeaderFlag(Message::HEADERFLAG_AA, false);
while (!q.tasks().empty()) {
QueryTaskPtr task = q.tasks().front();
q.tasks().pop();
// Can't query directly for RRSIG.
if (task->qtype == RRType::RRSIG()) {
m.setRcode(Rcode::REFUSED());
return;
}
// These task types should never be on the task queue.
if (task->op == QueryTask::SIMPLE_QUERY ||
task->op == QueryTask::REF_QUERY) {
m.setRcode(Rcode::SERVFAIL());
return;
}
ZoneInfo zoneinfo(this, task->qname, task->qclass, task->qtype);
RRsetList data;
Result result = SUCCESS;
// For these query task types, if there is more than
// one level between the zone name and qname, we need to
// check the intermediate nodes for referrals.
if ((task->op == QueryTask::AUTH_QUERY ||
task->op == QueryTask::NOGLUE_QUERY) &&
hasDelegation(q, task, zoneinfo)) {
continue;
}
result = doQueryTask(*task, zoneinfo, data);
if (result != SUCCESS) {
m.setRcode(Rcode::SERVFAIL());
return;
}
// No such zone. If we're chasing cnames or adding additional
// data, that's okay, but if doing an original query, return
// REFUSED.
if (task->flags == NO_SUCH_ZONE) {
if (task->state == QueryTask::GETANSWER) {
m.setRcode(Rcode::REFUSED());
return;
}
continue;
}
// Query found a referral; let's find out if that was expected--
// i.e., if an NS was at the zone apex, or if we were querying
// specifically for, and found, a DS, NSEC, or DNAME record.
const Name* const zonename = zoneinfo.getEnclosingZone();
if ((task->flags & REFERRAL) != 0 &&
(zonename->getLabelCount() == task->qname.getLabelCount() ||
((task->qtype == RRType::NSEC() ||
task->qtype == RRType::DS() ||
task->qtype == RRType::DNAME()) &&
findRRsetFromList(data, task->qtype)))) {
task->flags &= ~REFERRAL;
}
if (result == SUCCESS && task->flags == 0) {
bool have_ns = false, need_auth = false;
switch (task->state) {
case QueryTask::GETANSWER:
case QueryTask::FOLLOWCNAME:
BOOST_FOREACH(RRsetPtr rrset, data) {
addToMessage(q, task->section, rrset);
if (q.tasks().empty()) {
need_auth = true;
}
getAdditional(q, rrset);
if (rrset->getType() == RRType::NS()) {
have_ns = true;
}
}
q.setStatus(Query::ANSWERED);
if (need_auth && !have_ns) {
// Data found, no additional processing needed.
// Add the NS records for the enclosing zone to
// the authority section.
RRsetList auth;
if (!refQuery(q, Name(*zonename), zoneinfo, auth) ||
!findRRsetFromList(auth, RRType::NS())) {
isc_throw(DataSourceError,
"NS RR not found in " << *zonename << "/" <<
q.qclass());
}
copyAuth(q, auth);
}
continue;
case QueryTask::GETADDITIONAL:
// Got additional data. Do not add it to the message
// yet; instead store it and copy it in at the end
// (this allow RRSIGs to be omitted if necessary).
BOOST_FOREACH(RRsetPtr rrset, data) {
if (q.status() == Query::ANSWERED &&
rrset->getName() == q.qname() &&
rrset->getType() == q.qtype()) {
continue;
}
additional.push_back(rrset);
}
continue;
default:
isc_throw (Unexpected, "unexpected query state");
}
} else if (result == ERROR || result == NOT_IMPLEMENTED) {
m.setRcode(Rcode::SERVFAIL());
return;
} else if ((task->flags & CNAME_FOUND) != 0) {
// The qname node contains a CNAME. Add a new task to the
// queue to look up its target.
RRsetPtr rrset = findRRsetFromList(data, RRType::CNAME());
if (rrset != NULL) {
addToMessage(q, task->section, rrset);
chaseCname(q, task, rrset);
}
continue;
} else if ((task->flags & REFERRAL) != 0) {
// The qname node contains an out-of-zone referral.
if (task->state == QueryTask::GETANSWER) {
RRsetList auth;
m.setHeaderFlag(Message::HEADERFLAG_AA, false);
if (!refQuery(q, task->qname, zoneinfo, auth)) {
m.setRcode(Rcode::SERVFAIL());
return;
}
BOOST_FOREACH (RRsetPtr rrset, auth) {
if (rrset->getType() == RRType::NS()) {
addToMessage(q, Message::SECTION_AUTHORITY, rrset);
} else if (rrset->getType() == task->qtype) {
addToMessage(q, Message::SECTION_ANSWER, rrset);
} else if (rrset->getType() == RRType::DS() &&
q.wantDnssec()) {
addToMessage(q, Message::SECTION_AUTHORITY, rrset);
}
getAdditional(q, rrset);
}
}
continue;
} else if ((task->flags & (NAME_NOT_FOUND|TYPE_NOT_FOUND)) != 0) {
// No data found at this qname/qtype.
// If we were looking for additional data, we should simply
// ignore this result.
if (task->state == QueryTask::GETADDITIONAL) {
continue;
}
// If we were looking for answer data, not additional,
// and the name was not found, we need to find out whether
// there are any relevant wildcards.
bool wildcard_found = false;
result = tryWildcard(q, task, zoneinfo, wildcard_found);
if (result != SUCCESS) {
m.setRcode(Rcode::SERVFAIL());
return;
}
if (wildcard_found) {
continue;
}
// If we've reached this point, there is definitely no answer.
// If we were chasing cnames or adding additional data, that's
// okay, but if we were doing an original query, reply with the
// SOA in the authority section. For NAME_NOT_FOUND, set
// NXDOMAIN, and also add the previous NSEC to the authority
// section. For TYPE_NOT_FOUND, do not set an error rcode,
// and send the current NSEC in the authority section.
if (task->state == QueryTask::GETANSWER) {
if ((task->flags & NAME_NOT_FOUND) != 0) {
m.setRcode(Rcode::NXDOMAIN());
}
result = addSOA(q, zoneinfo);
if (result != SUCCESS) {
isc_throw(DataSourceError,
"SOA RR not found in " << *zonename <<
"/" << q.qclass());
}
}
Name nsecname(task->qname);
if ((task->flags & NAME_NOT_FOUND) != 0) {
const DataSrc* ds = zoneinfo.getDataSource();
ds->findPreviousName(task->qname, nsecname, zonename);
}
if (q.wantDnssec()) {
result = proveNX(q, task, zoneinfo, false);
if (result != DataSrc::SUCCESS) {
m.setRcode(Rcode::SERVFAIL());
return;
}
}
return;
} else {
// Should never be reached!
m.setRcode(Rcode::SERVFAIL());
return;
}
}
// We're done, so now copy in the additional data:
// data first, then signatures. (If we run out of
// space, signatures in additional section are
// optional.)
BOOST_FOREACH(RRsetPtr rrset, additional) {
addToMessage(q, Message::SECTION_ADDITIONAL, rrset, true);
}
if (q.wantDnssec()) {
BOOST_FOREACH(RRsetPtr rrset, additional) {
if (rrset->getRRsig()) {
addToMessage(q, Message::SECTION_ADDITIONAL, rrset->getRRsig(),
true);
}
}
}
}
DataSrc::Result
DataSrc::findAddrs(const Name& qname, const RRClass& qclass,
RRsetList& target, uint32_t& flags,
const Name* zonename) const
{
Result r;
bool a = false, aaaa = false;
flags = 0;
r = findExactRRset(qname, qclass, RRType::A(), target, flags, zonename);
if (r == SUCCESS && flags == 0) {
a = true;
}
flags = 0;
r = findExactRRset(qname, qclass, RRType::AAAA(), target, flags,
zonename);
if (r == SUCCESS && flags == 0) {
aaaa = true;
}
if (!a && !aaaa) {
flags = TYPE_NOT_FOUND;
} else {
flags = 0;
}
return (SUCCESS);
}
DataSrc::Result
DataSrc::findReferral(const Name& qname, const RRClass& qclass,
RRsetList& target, uint32_t& flags,
const Name* zonename) const
{
Result r;
bool ns = false, ds = false, dname = false;
flags = 0;
r = findExactRRset(qname, qclass, RRType::NS(), target, flags, zonename);
if (r == SUCCESS && flags == 0) {
ns = true;
} else if ((flags & (NO_SUCH_ZONE|NAME_NOT_FOUND))) {
return (SUCCESS);
}
flags = 0;
r = findExactRRset(qname, qclass, RRType::DS(), target, flags, zonename);
if (r == SUCCESS && flags == 0) {
ds = true;
} else if ((flags & (NO_SUCH_ZONE|NAME_NOT_FOUND))) {
return (SUCCESS);
}
flags = 0;
r = findExactRRset(qname, qclass, RRType::DNAME(), target, flags, zonename);
if (r == SUCCESS && flags == 0) {
dname = true;
} else if ((flags & (NO_SUCH_ZONE|NAME_NOT_FOUND))) {
return (SUCCESS);
}
if (!ns && !dname && !ds) {
flags = TYPE_NOT_FOUND;
} else {
flags = 0;
}
return (SUCCESS);
}
void
MetaDataSrc::addDataSrc(ConstDataSrcPtr data_src) {
if (getClass() != RRClass::ANY() && data_src->getClass() != getClass()) {
isc_throw(Unexpected, "class mismatch");
}
data_sources.push_back(data_src);
}
void
MetaDataSrc::removeDataSrc(ConstDataSrcPtr data_src) {
std::vector<ConstDataSrcPtr>::iterator it, itr;
for (it = data_sources.begin(); it != data_sources.end(); ++it) {
if (*it == data_src) {
itr = it;
}
}
data_sources.erase(itr);
}
void
MetaDataSrc::findClosestEnclosure(DataSrcMatch& match) const {
if (getClass() != match.getClass() &&
getClass() != RRClass::ANY() && match.getClass() != RRClass::ANY()) {
return;
}
BOOST_FOREACH (ConstDataSrcPtr data_src, data_sources) {
data_src->findClosestEnclosure(match);
}
}
DataSrcMatch::~DataSrcMatch() {
delete closest_name_;
}
void
DataSrcMatch::update(const DataSrc& new_source, const Name& container) {
if (getClass() != new_source.getClass() && getClass() != RRClass::ANY() &&
new_source.getClass() != RRClass::ANY())
{
return;
}
if (closest_name_ == NULL) {
const NameComparisonResult::NameRelation cmp =
getName().compare(container).getRelation();
if (cmp != NameComparisonResult::EQUAL &&
cmp != NameComparisonResult::SUBDOMAIN)
{
return;
}
closest_name_ = new Name(container);
best_source_ = &new_source;
return;
}
if (container.compare(*closest_name_).getRelation() ==
NameComparisonResult::SUBDOMAIN) {
Name* newname = new Name(container);
delete closest_name_;
closest_name_ = newname;
best_source_ = &new_source;
}
}
Nsec3Param::Nsec3Param(const uint8_t a, const uint8_t f, const uint16_t i,
const std::vector<uint8_t>& s) :
algorithm_(a), flags_(f), iterations_(i), salt_(s)
{}
string
Nsec3Param::getHash(const Name& name) const {
OutputBuffer buf(0);
name.toWire(buf);
uint8_t digest[SHA1_HASHSIZE];
const uint8_t* input = static_cast<const uint8_t*>(buf.getData());
size_t inlength = buf.getLength();
const uint8_t saltlen = salt_.size();
int n = 0;
SHA1Context sha;
do {
SHA1Reset(&sha);
SHA1Input(&sha, input, inlength);
SHA1Input(&sha, &salt_[0], saltlen);
SHA1Result(&sha, digest);
input = digest;
inlength = SHA1_HASHSIZE;
} while (n++ < iterations_);
return (encodeBase32Hex(vector<uint8_t>(digest, digest + SHA1_HASHSIZE)));
}
DataSrc::Result
DataSrc::init(isc::data::ConstElementPtr) {
return (NOT_IMPLEMENTED);
}
DataSrc::Result
MetaDataSrc::findRRset(const isc::dns::Name&,
const isc::dns::RRClass&,
const isc::dns::RRType&,
isc::dns::RRsetList&,
uint32_t&,
const isc::dns::Name*) const
{
return (NOT_IMPLEMENTED);
}
DataSrc::Result
MetaDataSrc::findExactRRset(const isc::dns::Name&,
const isc::dns::RRClass&,
const isc::dns::RRType&,
isc::dns::RRsetList&,
uint32_t&,
const isc::dns::Name*) const
{
return (NOT_IMPLEMENTED);
}
DataSrc::Result
MetaDataSrc::findAddrs(const isc::dns::Name&,
const isc::dns::RRClass&,
isc::dns::RRsetList&,
uint32_t&,
const isc::dns::Name*) const
{
return (NOT_IMPLEMENTED);
}
DataSrc::Result
MetaDataSrc::findReferral(const isc::dns::Name&,
const isc::dns::RRClass&,
isc::dns::RRsetList&,
uint32_t&,
const isc::dns::Name*) const
{
return (NOT_IMPLEMENTED);
}
DataSrc::Result
MetaDataSrc::findPreviousName(const isc::dns::Name&,
isc::dns::Name&,
const isc::dns::Name*) const
{
return (NOT_IMPLEMENTED);
}
DataSrc::Result
MetaDataSrc::findCoveringNSEC3(const isc::dns::Name&,
std::string&,
isc::dns::RRsetList&) const
{
return (NOT_IMPLEMENTED);
}
}
}
|