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
|
/*
* This file is part of PowerDNS or dnsdist.
* Copyright -- PowerDNS.COM B.V. and its contributors
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
* In addition, for the avoidance of any doubt, permission is granted to
* link this program with OpenSSL and to (re)distribute the binaries
* produced as the result of such linking.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#pragma once
#include "cachecleaner.hh"
#include "dnsdist.hh"
#include "dnsdist-ecs.hh"
#include "dnsdist-kvs.hh"
#include "dnsdist-lua-ffi.hh"
#include "dolog.hh"
#include "dnsparser.hh"
class MaxQPSIPRule : public DNSRule
{
public:
MaxQPSIPRule(unsigned int qps, unsigned int burst, unsigned int ipv4trunc=32, unsigned int ipv6trunc=64, unsigned int expiration=300, unsigned int cleanupDelay=60, unsigned int scanFraction=10):
d_qps(qps), d_burst(burst), d_ipv4trunc(ipv4trunc), d_ipv6trunc(ipv6trunc), d_cleanupDelay(cleanupDelay), d_expiration(expiration), d_scanFraction(scanFraction)
{
gettime(&d_lastCleanup, true);
}
void clear()
{
d_limits.lock()->clear();
}
size_t cleanup(const struct timespec& cutOff, size_t* scannedCount=nullptr) const
{
auto limits = d_limits.lock();
size_t toLook = limits->size() / d_scanFraction + 1;
size_t lookedAt = 0;
size_t removed = 0;
auto& sequence = limits->get<SequencedTag>();
for (auto entry = sequence.begin(); entry != sequence.end() && lookedAt < toLook; lookedAt++) {
if (entry->d_limiter.seenSince(cutOff)) {
/* entries are ordered from least recently seen to more recently
seen, as soon as we see one that has not expired yet, we are
done */
lookedAt++;
break;
}
entry = sequence.erase(entry);
removed++;
}
if (scannedCount != nullptr) {
*scannedCount = lookedAt;
}
return removed;
}
void cleanupIfNeeded(const struct timespec& now) const
{
if (d_cleanupDelay > 0) {
struct timespec cutOff = d_lastCleanup;
cutOff.tv_sec += d_cleanupDelay;
if (cutOff < now) {
/* the QPS Limiter doesn't use realtime, be careful! */
gettime(&cutOff, false);
cutOff.tv_sec -= d_expiration;
cleanup(cutOff);
d_lastCleanup = now;
}
}
}
bool matches(const DNSQuestion* dq) const override
{
cleanupIfNeeded(*dq->queryTime);
ComboAddress zeroport(*dq->remote);
zeroport.sin4.sin_port=0;
zeroport.truncate(zeroport.sin4.sin_family == AF_INET ? d_ipv4trunc : d_ipv6trunc);
{
auto limits = d_limits.lock();
auto iter = limits->find(zeroport);
if (iter == limits->end()) {
Entry e(zeroport, QPSLimiter(d_qps, d_burst));
iter = limits->insert(e).first;
}
moveCacheItemToBack<SequencedTag>(*limits, iter);
return !iter->d_limiter.check(d_qps, d_burst);
}
}
string toString() const override
{
return "IP (/"+std::to_string(d_ipv4trunc)+", /"+std::to_string(d_ipv6trunc)+") match for QPS over " + std::to_string(d_qps) + " burst "+ std::to_string(d_burst);
}
size_t getEntriesCount() const
{
return d_limits.lock()->size();
}
private:
struct OrderedTag {};
struct SequencedTag {};
struct Entry
{
Entry(const ComboAddress& addr, BasicQPSLimiter&& limiter): d_limiter(limiter), d_addr(addr)
{
}
mutable BasicQPSLimiter d_limiter;
ComboAddress d_addr;
};
typedef multi_index_container<
Entry,
indexed_by <
ordered_unique<tag<OrderedTag>, member<Entry,ComboAddress,&Entry::d_addr>, ComboAddress::addressOnlyLessThan >,
sequenced<tag<SequencedTag> >
>
> qpsContainer_t;
mutable LockGuarded<qpsContainer_t> d_limits;
mutable struct timespec d_lastCleanup;
unsigned int d_qps, d_burst, d_ipv4trunc, d_ipv6trunc, d_cleanupDelay, d_expiration;
unsigned int d_scanFraction{10};
};
class MaxQPSRule : public DNSRule
{
public:
MaxQPSRule(unsigned int qps)
: d_qps(qps, qps)
{}
MaxQPSRule(unsigned int qps, unsigned int burst)
: d_qps(qps, burst)
{}
bool matches(const DNSQuestion* qd) const override
{
return d_qps.check();
}
string toString() const override
{
return "Max " + std::to_string(d_qps.getRate()) + " qps";
}
private:
mutable QPSLimiter d_qps;
};
class NMGRule : public DNSRule
{
public:
NMGRule(const NetmaskGroup& nmg) : d_nmg(nmg) {}
protected:
NetmaskGroup d_nmg;
};
class NetmaskGroupRule : public NMGRule
{
public:
NetmaskGroupRule(const NetmaskGroup& nmg, bool src, bool quiet = false) : NMGRule(nmg)
{
d_src = src;
d_quiet = quiet;
}
bool matches(const DNSQuestion* dq) const override
{
if(!d_src) {
return d_nmg.match(*dq->local);
}
return d_nmg.match(*dq->remote);
}
string toString() const override
{
string ret = "Src: ";
if(!d_src) {
ret = "Dst: ";
}
if (d_quiet) {
return ret + "in-group";
}
return ret + d_nmg.toString();
}
private:
bool d_src;
bool d_quiet;
};
class TimedIPSetRule : public DNSRule, boost::noncopyable
{
private:
struct IPv6 {
IPv6(const ComboAddress& ca)
{
static_assert(sizeof(*this)==16, "IPv6 struct has wrong size");
memcpy((char*)this, ca.sin6.sin6_addr.s6_addr, 16);
}
bool operator==(const IPv6& rhs) const
{
return a==rhs.a && b==rhs.b;
}
uint64_t a, b;
};
public:
TimedIPSetRule()
{
}
~TimedIPSetRule()
{
}
bool matches(const DNSQuestion* dq) const override
{
if (dq->remote->sin4.sin_family == AF_INET) {
auto ip4s = d_ip4s.read_lock();
auto fnd = ip4s->find(dq->remote->sin4.sin_addr.s_addr);
if (fnd == ip4s->end()) {
return false;
}
return time(nullptr) < fnd->second;
} else {
auto ip6s = d_ip6s.read_lock();
auto fnd = ip6s->find({*dq->remote});
if (fnd == ip6s->end()) {
return false;
}
return time(nullptr) < fnd->second;
}
}
void add(const ComboAddress& ca, time_t ttd)
{
// think twice before adding templates here
if (ca.sin4.sin_family == AF_INET) {
auto res = d_ip4s.write_lock()->insert({ca.sin4.sin_addr.s_addr, ttd});
if (!res.second && (time_t)res.first->second < ttd) {
res.first->second = (uint32_t)ttd;
}
}
else {
auto res = d_ip6s.write_lock()->insert({{ca}, ttd});
if (!res.second && (time_t)res.first->second < ttd) {
res.first->second = (uint32_t)ttd;
}
}
}
void remove(const ComboAddress& ca)
{
if (ca.sin4.sin_family == AF_INET) {
d_ip4s.write_lock()->erase(ca.sin4.sin_addr.s_addr);
}
else {
d_ip6s.write_lock()->erase({ca});
}
}
void clear()
{
d_ip4s.write_lock()->clear();
d_ip6s.write_lock()->clear();
}
void cleanup()
{
time_t now = time(nullptr);
{
auto ip4s = d_ip4s.write_lock();
for (auto iter = ip4s->begin(); iter != ip4s->end(); ) {
if (iter->second < now) {
iter = ip4s->erase(iter);
}
else {
++iter;
}
}
}
{
auto ip6s = d_ip6s.write_lock();
for (auto iter = ip6s->begin(); iter != ip6s->end(); ) {
if (iter->second < now) {
iter = ip6s->erase(iter);
}
else {
++iter;
}
}
}
}
string toString() const override
{
time_t now = time(nullptr);
uint64_t count = 0;
for (const auto& ip : *(d_ip4s.read_lock())) {
if (now < ip.second) {
++count;
}
}
for (const auto& ip : *(d_ip6s.read_lock())) {
if (now < ip.second) {
++count;
}
}
return "Src: "+std::to_string(count)+" ips";
}
private:
struct IPv6Hash
{
std::size_t operator()(const IPv6& ip) const
{
auto ah=std::hash<uint64_t>{}(ip.a);
auto bh=std::hash<uint64_t>{}(ip.b);
return ah & (bh<<1);
}
};
mutable SharedLockGuarded<std::unordered_map<IPv6, time_t, IPv6Hash>> d_ip6s;
mutable SharedLockGuarded<std::unordered_map<uint32_t, time_t>> d_ip4s;
};
class AllRule : public DNSRule
{
public:
AllRule() {}
bool matches(const DNSQuestion* dq) const override
{
return true;
}
string toString() const override
{
return "All";
}
};
class DNSSECRule : public DNSRule
{
public:
DNSSECRule()
{
}
bool matches(const DNSQuestion* dq) const override
{
return dq->getHeader()->cd || (getEDNSZ(*dq) & EDNS_HEADER_FLAG_DO); // turns out dig sets ad by default..
}
string toString() const override
{
return "DNSSEC";
}
};
class AndRule : public DNSRule
{
public:
AndRule(const vector<pair<int, shared_ptr<DNSRule> > >& rules)
{
for(const auto& r : rules)
d_rules.push_back(r.second);
}
bool matches(const DNSQuestion* dq) const override
{
auto iter = d_rules.begin();
for(; iter != d_rules.end(); ++iter)
if(!(*iter)->matches(dq))
break;
return iter == d_rules.end();
}
string toString() const override
{
string ret;
for(const auto& rule : d_rules) {
if(!ret.empty())
ret+= " && ";
ret += "("+ rule->toString()+")";
}
return ret;
}
private:
vector<std::shared_ptr<DNSRule> > d_rules;
};
class OrRule : public DNSRule
{
public:
OrRule(const vector<pair<int, shared_ptr<DNSRule> > >& rules)
{
for(const auto& r : rules)
d_rules.push_back(r.second);
}
bool matches(const DNSQuestion* dq) const override
{
auto iter = d_rules.begin();
for(; iter != d_rules.end(); ++iter)
if((*iter)->matches(dq))
return true;
return false;
}
string toString() const override
{
string ret;
for(const auto& rule : d_rules) {
if(!ret.empty())
ret+= " || ";
ret += "("+ rule->toString()+")";
}
return ret;
}
private:
vector<std::shared_ptr<DNSRule> > d_rules;
};
class RegexRule : public DNSRule
{
public:
RegexRule(const std::string& regex) : d_regex(regex), d_visual(regex)
{
}
bool matches(const DNSQuestion* dq) const override
{
return d_regex.match(dq->qname->toStringNoDot());
}
string toString() const override
{
return "Regex: "+d_visual;
}
private:
Regex d_regex;
string d_visual;
};
#ifdef HAVE_RE2
#include <re2/re2.h>
class RE2Rule : public DNSRule
{
public:
RE2Rule(const std::string& re2) : d_re2(re2, RE2::Latin1), d_visual(re2)
{
}
bool matches(const DNSQuestion* dq) const override
{
return RE2::FullMatch(dq->qname->toStringNoDot(), d_re2);
}
string toString() const override
{
return "RE2 match: "+d_visual;
}
private:
RE2 d_re2;
string d_visual;
};
#endif
#ifdef HAVE_DNS_OVER_HTTPS
class HTTPHeaderRule : public DNSRule
{
public:
HTTPHeaderRule(const std::string& header, const std::string& regex);
bool matches(const DNSQuestion* dq) const override;
string toString() const override;
private:
string d_header;
Regex d_regex;
string d_visual;
};
class HTTPPathRule : public DNSRule
{
public:
HTTPPathRule(const std::string& path);
bool matches(const DNSQuestion* dq) const override;
string toString() const override;
private:
string d_path;
};
class HTTPPathRegexRule : public DNSRule
{
public:
HTTPPathRegexRule(const std::string& regex);
bool matches(const DNSQuestion* dq) const override;
string toString() const override;
private:
Regex d_regex;
std::string d_visual;
};
#endif
class SNIRule : public DNSRule
{
public:
SNIRule(const std::string& name) : d_sni(name)
{
}
bool matches(const DNSQuestion* dq) const override
{
return dq->sni == d_sni;
}
string toString() const override
{
return "SNI == " + d_sni;
}
private:
std::string d_sni;
};
class SuffixMatchNodeRule : public DNSRule
{
public:
SuffixMatchNodeRule(const SuffixMatchNode& smn, bool quiet=false) : d_smn(smn), d_quiet(quiet)
{
}
bool matches(const DNSQuestion* dq) const override
{
return d_smn.check(*dq->qname);
}
string toString() const override
{
if(d_quiet)
return "qname==in-set";
else
return "qname in "+d_smn.toString();
}
private:
SuffixMatchNode d_smn;
bool d_quiet;
};
class QNameRule : public DNSRule
{
public:
QNameRule(const DNSName& qname) : d_qname(qname)
{
}
bool matches(const DNSQuestion* dq) const override
{
return d_qname==*dq->qname;
}
string toString() const override
{
return "qname=="+d_qname.toString();
}
private:
DNSName d_qname;
};
class QNameSetRule : public DNSRule {
public:
QNameSetRule(const DNSNameSet& names) : qname_idx(names) {}
bool matches(const DNSQuestion* dq) const override {
return qname_idx.find(*dq->qname) != qname_idx.end();
}
string toString() const override {
std::stringstream ss;
ss << "qname in DNSNameSet(" << qname_idx.size() << " FQDNs)";
return ss.str();
}
private:
DNSNameSet qname_idx;
};
class QTypeRule : public DNSRule
{
public:
QTypeRule(uint16_t qtype) : d_qtype(qtype)
{
}
bool matches(const DNSQuestion* dq) const override
{
return d_qtype == dq->qtype;
}
string toString() const override
{
QType qt(d_qtype);
return "qtype=="+qt.toString();
}
private:
uint16_t d_qtype;
};
class QClassRule : public DNSRule
{
public:
QClassRule(uint16_t qclass) : d_qclass(qclass)
{
}
bool matches(const DNSQuestion* dq) const override
{
return d_qclass == dq->qclass;
}
string toString() const override
{
return "qclass=="+std::to_string(d_qclass);
}
private:
uint16_t d_qclass;
};
class OpcodeRule : public DNSRule
{
public:
OpcodeRule(uint8_t opcode) : d_opcode(opcode)
{
}
bool matches(const DNSQuestion* dq) const override
{
return d_opcode == dq->getHeader()->opcode;
}
string toString() const override
{
return "opcode=="+std::to_string(d_opcode);
}
private:
uint8_t d_opcode;
};
class DSTPortRule : public DNSRule
{
public:
DSTPortRule(uint16_t port) : d_port(port)
{
}
bool matches(const DNSQuestion* dq) const override
{
return htons(d_port) == dq->local->sin4.sin_port;
}
string toString() const override
{
return "dst port=="+std::to_string(d_port);
}
private:
uint16_t d_port;
};
class TCPRule : public DNSRule
{
public:
TCPRule(bool tcp): d_tcp(tcp)
{
}
bool matches(const DNSQuestion* dq) const override
{
return dq->overTCP() == d_tcp;
}
string toString() const override
{
return (d_tcp ? "TCP" : "UDP");
}
private:
bool d_tcp;
};
class NotRule : public DNSRule
{
public:
NotRule(shared_ptr<DNSRule>& rule): d_rule(rule)
{
}
bool matches(const DNSQuestion* dq) const override
{
return !d_rule->matches(dq);
}
string toString() const override
{
return "!("+ d_rule->toString()+")";
}
private:
shared_ptr<DNSRule> d_rule;
};
class RecordsCountRule : public DNSRule
{
public:
RecordsCountRule(uint8_t section, uint16_t minCount, uint16_t maxCount): d_minCount(minCount), d_maxCount(maxCount), d_section(section)
{
}
bool matches(const DNSQuestion* dq) const override
{
uint16_t count = 0;
switch(d_section) {
case 0:
count = ntohs(dq->getHeader()->qdcount);
break;
case 1:
count = ntohs(dq->getHeader()->ancount);
break;
case 2:
count = ntohs(dq->getHeader()->nscount);
break;
case 3:
count = ntohs(dq->getHeader()->arcount);
break;
}
return count >= d_minCount && count <= d_maxCount;
}
string toString() const override
{
string section;
switch(d_section) {
case 0:
section = "QD";
break;
case 1:
section = "AN";
break;
case 2:
section = "NS";
break;
case 3:
section = "AR";
break;
}
return std::to_string(d_minCount) + " <= records in " + section + " <= "+ std::to_string(d_maxCount);
}
private:
uint16_t d_minCount;
uint16_t d_maxCount;
uint8_t d_section;
};
class RecordsTypeCountRule : public DNSRule
{
public:
RecordsTypeCountRule(uint8_t section, uint16_t type, uint16_t minCount, uint16_t maxCount): d_type(type), d_minCount(minCount), d_maxCount(maxCount), d_section(section)
{
}
bool matches(const DNSQuestion* dq) const override
{
uint16_t count = 0;
switch(d_section) {
case 0:
count = ntohs(dq->getHeader()->qdcount);
break;
case 1:
count = ntohs(dq->getHeader()->ancount);
break;
case 2:
count = ntohs(dq->getHeader()->nscount);
break;
case 3:
count = ntohs(dq->getHeader()->arcount);
break;
}
if (count < d_minCount) {
return false;
}
count = getRecordsOfTypeCount(reinterpret_cast<const char*>(dq->getData().data()), dq->getData().size(), d_section, d_type);
return count >= d_minCount && count <= d_maxCount;
}
string toString() const override
{
string section;
switch(d_section) {
case 0:
section = "QD";
break;
case 1:
section = "AN";
break;
case 2:
section = "NS";
break;
case 3:
section = "AR";
break;
}
return std::to_string(d_minCount) + " <= " + QType(d_type).toString() + " records in " + section + " <= "+ std::to_string(d_maxCount);
}
private:
uint16_t d_type;
uint16_t d_minCount;
uint16_t d_maxCount;
uint8_t d_section;
};
class TrailingDataRule : public DNSRule
{
public:
TrailingDataRule()
{
}
bool matches(const DNSQuestion* dq) const override
{
uint16_t length = getDNSPacketLength(reinterpret_cast<const char*>(dq->getData().data()), dq->getData().size());
return length < dq->getData().size();
}
string toString() const override
{
return "trailing data";
}
};
class QNameLabelsCountRule : public DNSRule
{
public:
QNameLabelsCountRule(unsigned int minLabelsCount, unsigned int maxLabelsCount): d_min(minLabelsCount), d_max(maxLabelsCount)
{
}
bool matches(const DNSQuestion* dq) const override
{
unsigned int count = dq->qname->countLabels();
return count < d_min || count > d_max;
}
string toString() const override
{
return "labels count < " + std::to_string(d_min) + " || labels count > " + std::to_string(d_max);
}
private:
unsigned int d_min;
unsigned int d_max;
};
class QNameWireLengthRule : public DNSRule
{
public:
QNameWireLengthRule(size_t min, size_t max): d_min(min), d_max(max)
{
}
bool matches(const DNSQuestion* dq) const override
{
size_t const wirelength = dq->qname->wirelength();
return wirelength < d_min || wirelength > d_max;
}
string toString() const override
{
return "wire length < " + std::to_string(d_min) + " || wire length > " + std::to_string(d_max);
}
private:
size_t d_min;
size_t d_max;
};
class RCodeRule : public DNSRule
{
public:
RCodeRule(uint8_t rcode) : d_rcode(rcode)
{
}
bool matches(const DNSQuestion* dq) const override
{
return d_rcode == dq->getHeader()->rcode;
}
string toString() const override
{
return "rcode=="+RCode::to_s(d_rcode);
}
private:
uint8_t d_rcode;
};
class ERCodeRule : public DNSRule
{
public:
ERCodeRule(uint8_t rcode) : d_rcode(rcode & 0xF), d_extrcode(rcode >> 4)
{
}
bool matches(const DNSQuestion* dq) const override
{
// avoid parsing EDNS OPT RR when not needed.
if (d_rcode != dq->getHeader()->rcode) {
return false;
}
EDNS0Record edns0;
if (!getEDNS0Record(*dq, edns0)) {
return false;
}
return d_extrcode == edns0.extRCode;
}
string toString() const override
{
return "ercode=="+ERCode::to_s(d_rcode | (d_extrcode << 4));
}
private:
uint8_t d_rcode; // plain DNS Rcode
uint8_t d_extrcode; // upper bits in EDNS0 record
};
class EDNSVersionRule : public DNSRule
{
public:
EDNSVersionRule(uint8_t version) : d_version(version)
{
}
bool matches(const DNSQuestion* dq) const override
{
EDNS0Record edns0;
if (!getEDNS0Record(*dq, edns0)) {
return false;
}
return d_version < edns0.version;
}
string toString() const override
{
return "ednsversion>"+std::to_string(d_version);
}
private:
uint8_t d_version;
};
class EDNSOptionRule : public DNSRule
{
public:
EDNSOptionRule(uint16_t optcode) : d_optcode(optcode)
{
}
bool matches(const DNSQuestion* dq) const override
{
uint16_t optStart;
size_t optLen = 0;
bool last = false;
int res = locateEDNSOptRR(dq->getData(), &optStart, &optLen, &last);
if (res != 0) {
// no EDNS OPT RR
return false;
}
if (optLen < optRecordMinimumSize) {
return false;
}
if (optStart < dq->getData().size() && dq->getData().at(optStart) != 0) {
// OPT RR Name != '.'
return false;
}
return isEDNSOptionInOpt(dq->getData(), optStart, optLen, d_optcode);
}
string toString() const override
{
return "ednsoptcode=="+std::to_string(d_optcode);
}
private:
uint16_t d_optcode;
};
class RDRule : public DNSRule
{
public:
RDRule()
{
}
bool matches(const DNSQuestion* dq) const override
{
return dq->getHeader()->rd == 1;
}
string toString() const override
{
return "rd==1";
}
};
class ProbaRule : public DNSRule
{
public:
ProbaRule(double proba) : d_proba(proba)
{
}
bool matches(const DNSQuestion* dq) const override
{
if(d_proba == 1.0)
return true;
double rnd = 1.0*random() / RAND_MAX;
return rnd > (1.0 - d_proba);
}
string toString() const override
{
return "match with prob. " + (boost::format("%0.2f") % d_proba).str();
}
private:
double d_proba;
};
class TagRule : public DNSRule
{
public:
TagRule(const std::string& tag, boost::optional<std::string> value) : d_value(value), d_tag(tag)
{
}
bool matches(const DNSQuestion* dq) const override
{
if (!dq->qTag) {
return false;
}
const auto it = dq->qTag->find(d_tag);
if (it == dq->qTag->cend()) {
return false;
}
if (!d_value) {
return true;
}
return it->second == *d_value;
}
string toString() const override
{
return "tag '" + d_tag + "' is set" + (d_value ? (" to '" + *d_value + "'") : "");
}
private:
boost::optional<std::string> d_value;
std::string d_tag;
};
class PoolAvailableRule : public DNSRule
{
public:
PoolAvailableRule(const std::string& poolname) : d_pools(&g_pools), d_poolname(poolname)
{
}
bool matches(const DNSQuestion* dq) const override
{
return (getPool(*d_pools, d_poolname)->countServers(true) > 0);
}
string toString() const override
{
return "pool '" + d_poolname + "' is available";
}
private:
mutable LocalStateHolder<pools_t> d_pools;
std::string d_poolname;
};
class PoolOutstandingRule : public DNSRule
{
public:
PoolOutstandingRule(const std::string& poolname, const size_t limit) : d_pools(&g_pools), d_poolname(poolname), d_limit(limit)
{
}
bool matches(const DNSQuestion* dq) const override
{
return (getPool(*d_pools, d_poolname)->poolLoad()) > d_limit;
}
string toString() const override
{
return "pool '" + d_poolname + "' outstanding > " + std::to_string(d_limit);
}
private:
mutable LocalStateHolder<pools_t> d_pools;
std::string d_poolname;
size_t d_limit;
};
class KeyValueStoreLookupRule: public DNSRule
{
public:
KeyValueStoreLookupRule(std::shared_ptr<KeyValueStore>& kvs, std::shared_ptr<KeyValueLookupKey>& lookupKey): d_kvs(kvs), d_key(lookupKey)
{
}
bool matches(const DNSQuestion* dq) const override
{
std::vector<std::string> keys = d_key->getKeys(*dq);
for (const auto& key : keys) {
if (d_kvs->keyExists(key) == true) {
return true;
}
}
return false;
}
string toString() const override
{
return "lookup key-value store based on '" + d_key->toString() + "'";
}
private:
std::shared_ptr<KeyValueStore> d_kvs;
std::shared_ptr<KeyValueLookupKey> d_key;
};
class KeyValueStoreRangeLookupRule: public DNSRule
{
public:
KeyValueStoreRangeLookupRule(std::shared_ptr<KeyValueStore>& kvs, std::shared_ptr<KeyValueLookupKey>& lookupKey): d_kvs(kvs), d_key(lookupKey)
{
}
bool matches(const DNSQuestion* dq) const override
{
std::vector<std::string> keys = d_key->getKeys(*dq);
for (const auto& key : keys) {
std::string value;
if (d_kvs->getRangeValue(key, value) == true) {
return true;
}
}
return false;
}
string toString() const override
{
return "range-based lookup key-value store based on '" + d_key->toString() + "'";
}
private:
std::shared_ptr<KeyValueStore> d_kvs;
std::shared_ptr<KeyValueLookupKey> d_key;
};
class LuaRule : public DNSRule
{
public:
typedef std::function<bool(const DNSQuestion* dq)> func_t;
LuaRule(const func_t& func): d_func(func)
{}
bool matches(const DNSQuestion* dq) const override
{
try {
auto lock = g_lua.lock();
return d_func(dq);
} catch (const std::exception &e) {
warnlog("LuaRule failed inside Lua: %s", e.what());
} catch (...) {
warnlog("LuaRule failed inside Lua: [unknown exception]");
}
return false;
}
string toString() const override
{
return "Lua script";
}
private:
func_t d_func;
};
class LuaFFIRule : public DNSRule
{
public:
typedef std::function<bool(dnsdist_ffi_dnsquestion_t* dq)> func_t;
LuaFFIRule(const func_t& func): d_func(func)
{}
bool matches(const DNSQuestion* dq) const override
{
dnsdist_ffi_dnsquestion_t dqffi(const_cast<DNSQuestion*>(dq));
try {
auto lock = g_lua.lock();
return d_func(&dqffi);
} catch (const std::exception &e) {
warnlog("LuaFFIRule failed inside Lua: %s", e.what());
} catch (...) {
warnlog("LuaFFIRule failed inside Lua: [unknown exception]");
}
return false;
}
string toString() const override
{
return "Lua FFI script";
}
private:
func_t d_func;
};
class LuaFFIPerThreadRule : public DNSRule
{
public:
typedef std::function<bool(dnsdist_ffi_dnsquestion_t* dq)> func_t;
LuaFFIPerThreadRule(const std::string& code): d_functionCode(code), d_functionID(s_functionsCounter++)
{
}
bool matches(const DNSQuestion* dq) const override
{
try {
auto& state = t_perThreadStates[d_functionID];
if (!state.d_initialized) {
setupLuaFFIPerThreadContext(state.d_luaContext);
/* mark the state as initialized first so if there is a syntax error
we only try to execute the code once */
state.d_initialized = true;
state.d_func = state.d_luaContext.executeCode<func_t>(d_functionCode);
}
if (!state.d_func) {
/* the function was not properly initialized */
return false;
}
dnsdist_ffi_dnsquestion_t dqffi(const_cast<DNSQuestion*>(dq));
return state.d_func(&dqffi);
}
catch (const std::exception &e) {
warnlog("LuaFFIPerthreadRule failed inside Lua: %s", e.what());
}
catch (...) {
warnlog("LuaFFIPerThreadRule failed inside Lua: [unknown exception]");
}
return false;
}
string toString() const override
{
return "Lua FFI per-thread script";
}
private:
struct PerThreadState
{
LuaContext d_luaContext;
func_t d_func;
bool d_initialized{false};
};
static std::atomic<uint64_t> s_functionsCounter;
static thread_local std::map<uint64_t, PerThreadState> t_perThreadStates;
const std::string d_functionCode;
const uint64_t d_functionID;
};
class ProxyProtocolValueRule : public DNSRule
{
public:
ProxyProtocolValueRule(uint8_t type, boost::optional<std::string> value): d_value(value), d_type(type)
{
}
bool matches(const DNSQuestion* dq) const override
{
if (!dq->proxyProtocolValues) {
return false;
}
for (const auto& entry : *dq->proxyProtocolValues) {
if (entry.type == d_type && (!d_value || entry.content == *d_value)) {
return true;
}
}
return false;
}
string toString() const override
{
if (d_value) {
return "proxy protocol value of type " + std::to_string(d_type) + " matches";
}
return "proxy protocol value of type " + std::to_string(d_type) + " is present";
}
private:
boost::optional<std::string> d_value;
uint8_t d_type;
};
|