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
|
/*
* 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.
*/
#ifndef PDNS_SYNCRES_HH
#define PDNS_SYNCRES_HH
#include <string>
#include <atomic>
#include "utility.hh"
#include "dns.hh"
#include "qtype.hh"
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <cmath>
#include <iostream>
#include <utility>
#include "misc.hh"
#include "lwres.hh"
#include <boost/circular_buffer.hpp>
#include <boost/utility.hpp>
#include "sstuff.hh"
#include "recursor_cache.hh"
#include "recpacketcache.hh"
#include <boost/tuple/tuple.hpp>
#include <boost/optional.hpp>
#include <boost/tuple/tuple_comparison.hpp>
#include "mtasker.hh"
#include "iputils.hh"
#include "validate.hh"
#include "filterpo.hh"
void primeHints(void);
int getRootNS(void);
class RecursorLua4;
struct BothRecordsAndSignatures
{
vector<DNSRecord> records;
vector<DNSRecord> signatures;
};
typedef map<pair<DNSName,uint16_t>, BothRecordsAndSignatures> recsig_t;
recsig_t harvestRecords(const std::vector<DNSRecord>& records, const std::set<uint16_t>& types);
struct NegCacheEntry
{
DNSName d_name;
QType d_qtype;
DNSName d_qname;
uint32_t d_ttd;
uint32_t getTTD() const
{
return d_ttd;
}
recsig_t d_dnssecProof;
};
typedef map<
DNSName,
pair<
vector<ComboAddress>,
bool
>
> NsSet;
template<class Thing> class Throttle : public boost::noncopyable
{
public:
Throttle()
{
d_limit=3;
d_ttl=60;
d_last_clean=time(0);
}
bool shouldThrottle(time_t now, const Thing& t)
{
if(now > d_last_clean + 300 ) {
d_last_clean=now;
for(typename cont_t::iterator i=d_cont.begin();i!=d_cont.end();) {
if( i->second.ttd < now) {
d_cont.erase(i++);
}
else
++i;
}
}
typename cont_t::iterator i=d_cont.find(t);
if(i==d_cont.end())
return false;
if(now > i->second.ttd || i->second.count-- < 0) {
d_cont.erase(i);
return false;
}
return true; // still listed, still blocked
}
void throttle(time_t now, const Thing& t, time_t ttl=0, unsigned int tries=0)
{
typename cont_t::iterator i=d_cont.find(t);
entry e={ now+(ttl ? ttl : d_ttl), tries ? tries : d_limit};
if(i==d_cont.end()) {
d_cont[t]=e;
}
else if(i->second.ttd > e.ttd || (i->second.count) < e.count)
d_cont[t]=e;
}
unsigned int size()
{
return (unsigned int)d_cont.size();
}
private:
unsigned int d_limit;
time_t d_ttl;
time_t d_last_clean;
struct entry
{
time_t ttd;
unsigned int count;
};
typedef map<Thing,entry> cont_t;
cont_t d_cont;
};
/** Class that implements a decaying EWMA.
This class keeps an exponentially weighted moving average which, additionally, decays over time.
The decaying is only done on get.
*/
class DecayingEwma
{
public:
DecayingEwma() : d_val(0.0)
{
d_needinit=true;
d_last.tv_sec = d_last.tv_usec = 0;
d_lastget=d_last;
}
DecayingEwma(const DecayingEwma& orig) : d_last(orig.d_last), d_lastget(orig.d_lastget), d_val(orig.d_val), d_needinit(orig.d_needinit)
{
}
struct timeval getOrMakeTime(struct timeval* tv)
{
if(tv)
return *tv;
else {
struct timeval ret;
Utility::gettimeofday(&ret, 0);
return ret;
}
}
void submit(int val, struct timeval* tv)
{
struct timeval now=getOrMakeTime(tv);
if(d_needinit) {
d_last=now;
d_lastget=now;
d_needinit=false;
d_val = val;
}
else {
float diff= makeFloat(d_last - now);
d_last=now;
double factor=exp(diff)/2.0; // might be '0.5', or 0.0001
d_val=(float)((1-factor)*val+ (float)factor*d_val);
}
}
double get(struct timeval* tv)
{
struct timeval now=getOrMakeTime(tv);
float diff=makeFloat(d_lastget-now);
d_lastget=now;
float factor=exp(diff/60.0f); // is 1.0 or less
return d_val*=factor;
}
double peek(void)
{
return d_val;
}
bool stale(time_t limit) const
{
return limit > d_lastget.tv_sec;
}
private:
struct timeval d_last; // stores time
struct timeval d_lastget; // stores time
float d_val;
bool d_needinit;
};
template<class Thing> class Counters : public boost::noncopyable
{
public:
Counters()
{
}
unsigned long value(const Thing& t)
{
typename cont_t::iterator i=d_cont.find(t);
if(i==d_cont.end()) {
return 0;
}
return (unsigned long)i->second;
}
unsigned long incr(const Thing& t)
{
typename cont_t::iterator i=d_cont.find(t);
if(i==d_cont.end()) {
d_cont[t]=1;
return 1;
}
else {
if (i->second < std::numeric_limits<unsigned long>::max())
i->second++;
return (unsigned long)i->second;
}
}
unsigned long decr(const Thing& t)
{
typename cont_t::iterator i=d_cont.find(t);
if(i!=d_cont.end() && --i->second == 0) {
d_cont.erase(i);
return 0;
} else
return (unsigned long)i->second;
}
void clear(const Thing& t)
{
typename cont_t::iterator i=d_cont.find(t);
if(i!=d_cont.end()) {
d_cont.erase(i);
}
}
size_t size()
{
return d_cont.size();
}
private:
typedef map<Thing,unsigned long> cont_t;
cont_t d_cont;
};
class SyncRes : public boost::noncopyable
{
public:
enum LogMode { LogNone, Log, Store};
explicit SyncRes(const struct timeval& now);
int beginResolve(const DNSName &qname, const QType &qtype, uint16_t qclass, vector<DNSRecord>&ret);
void setId(int id)
{
if(doLog())
d_prefix="["+itoa(id)+"] ";
}
static void setDefaultLogMode(LogMode lm)
{
s_lm = lm;
}
void setLogMode(LogMode lm)
{
d_lm = lm;
}
bool doLog()
{
return d_lm != LogNone;
}
void setCacheOnly(bool state=true)
{
d_cacheonly=state;
}
void setNoCache(bool state=true)
{
d_nocache=state;
}
void setDoEDNS0(bool state=true)
{
d_doEDNS0=state;
}
string getTrace() const
{
return d_trace.str();
}
void setLuaEngine(shared_ptr<RecursorLua4> pdl)
{
d_pdl = pdl;
}
bool wasVariable() const
{
return d_wasVariable;
}
bool wasOutOfBand() const
{
return d_wasOutOfBand;
}
void setSkipCNAMECheck(bool skip = false)
{
d_skipCNAMECheck = skip;
}
int asyncresolveWrapper(const ComboAddress& ip, bool ednsMANDATORY, const DNSName& domain, int type, bool doTCP, bool sendRDQuery, struct timeval* now, boost::optional<Netmask>& srcmask, LWResult* res);
static void doEDNSDumpAndClose(int fd);
static std::atomic<uint64_t> s_queries;
static std::atomic<uint64_t> s_outgoingtimeouts;
static std::atomic<uint64_t> s_outgoing4timeouts;
static std::atomic<uint64_t> s_outgoing6timeouts;
static std::atomic<uint64_t> s_throttledqueries;
static std::atomic<uint64_t> s_dontqueries;
static std::atomic<uint64_t> s_outqueries;
static std::atomic<uint64_t> s_tcpoutqueries;
static std::atomic<uint64_t> s_nodelegated;
static std::atomic<uint64_t> s_unreachables;
static unsigned int s_minimumTTL;
static bool s_doIPv6;
static unsigned int s_maxqperq;
static unsigned int s_maxtotusec;
static unsigned int s_maxdepth;
std::unordered_map<std::string,bool> d_discardedPolicies;
DNSFilterEngine::Policy d_appliedPolicy;
unsigned int d_outqueries;
unsigned int d_tcpoutqueries;
unsigned int d_throttledqueries;
unsigned int d_timeouts;
unsigned int d_unreachables;
unsigned int d_totUsec;
ComboAddress d_requestor;
bool d_doDNSSEC;
bool d_wasVariable{false};
bool d_wasOutOfBand{false};
bool d_wantsRPZ{true};
bool d_skipCNAMECheck{false};
typedef multi_index_container <
NegCacheEntry,
indexed_by <
ordered_unique<
composite_key<
NegCacheEntry,
member<NegCacheEntry, DNSName, &NegCacheEntry::d_name>,
member<NegCacheEntry, QType, &NegCacheEntry::d_qtype>
>,
composite_key_compare<CanonDNSNameCompare, std::less<QType> >
>,
sequenced<>
>
> negcache_t;
//! This represents a number of decaying Ewmas, used to store performance per nameserver-name.
/** Modelled to work mostly like the underlying DecayingEwma. After you've called get,
d_best is filled out with the best address for this collection */
struct DecayingEwmaCollection
{
void submit(const ComboAddress& remote, int usecs, struct timeval* now)
{
collection_t::iterator pos;
for(pos=d_collection.begin(); pos != d_collection.end(); ++pos)
if(pos->first==remote)
break;
if(pos!=d_collection.end()) {
pos->second.submit(usecs, now);
}
else {
DecayingEwma de;
de.submit(usecs, now);
d_collection.push_back(make_pair(remote, de));
}
}
double get(struct timeval* now)
{
if(d_collection.empty())
return 0;
double ret=std::numeric_limits<double>::max();
double tmp;
for(collection_t::iterator pos=d_collection.begin(); pos != d_collection.end(); ++pos) {
if((tmp=pos->second.get(now)) < ret) {
ret=tmp;
d_best=pos->first;
}
}
return ret;
}
bool stale(time_t limit) const
{
for(collection_t::const_iterator pos=d_collection.begin(); pos != d_collection.end(); ++pos)
if(!pos->second.stale(limit))
return false;
return true;
}
typedef vector<pair<ComboAddress, DecayingEwma> > collection_t;
collection_t d_collection;
ComboAddress d_best;
};
typedef map<DNSName, DecayingEwmaCollection> nsspeeds_t;
struct EDNSStatus
{
EDNSStatus() : mode(UNKNOWN), modeSetAt(0) {}
enum EDNSMode { UNKNOWN=0, EDNSOK=1, EDNSIGNORANT=2, NOEDNS=3 } mode;
time_t modeSetAt;
};
typedef map<ComboAddress, EDNSStatus> ednsstatus_t;
static bool s_noEDNSPing;
static bool s_noEDNS;
static bool s_rootNXTrust;
struct AuthDomain
{
vector<ComboAddress> d_servers;
bool d_rdForward;
typedef multi_index_container <
DNSRecord,
indexed_by <
ordered_non_unique<
composite_key< DNSRecord,
member<DNSRecord, DNSName, &DNSRecord::d_name>,
member<DNSRecord, uint16_t, &DNSRecord::d_type>
>,
composite_key_compare<std::less<DNSName>, std::less<uint16_t> >
>
>
> records_t;
records_t d_records;
};
typedef map<DNSName, AuthDomain> domainmap_t;
typedef Throttle<boost::tuple<ComboAddress,DNSName,uint16_t> > throttle_t;
typedef Counters<ComboAddress> fails_t;
struct timeval d_now;
static unsigned int s_maxnegttl;
static unsigned int s_maxcachettl;
static unsigned int s_packetcachettl;
static unsigned int s_packetcacheservfailttl;
static unsigned int s_serverdownmaxfails;
static unsigned int s_serverdownthrottletime;
static bool s_nopacketcache;
static string s_serverID;
struct StaticStorage {
negcache_t negcache;
nsspeeds_t nsSpeeds;
ednsstatus_t ednsstatus;
throttle_t throttle;
fails_t fails;
domainmap_t* domainmap;
map<DNSName, bool> dnssecmap;
};
private:
struct GetBestNSAnswer;
int doResolveAt(NsSet &nameservers, DNSName auth, bool flawedNSSet, const DNSName &qname, const QType &qtype, vector<DNSRecord>&ret,
unsigned int depth, set<GetBestNSAnswer>&beenthere);
int doResolve(const DNSName &qname, const QType &qtype, vector<DNSRecord>&ret, unsigned int depth, set<GetBestNSAnswer>& beenthere);
bool doOOBResolve(const DNSName &qname, const QType &qtype, vector<DNSRecord>&ret, unsigned int depth, int &res);
domainmap_t::const_iterator getBestAuthZone(DNSName* qname);
bool doCNAMECacheCheck(const DNSName &qname, const QType &qtype, vector<DNSRecord>&ret, unsigned int depth, int &res);
bool doCacheCheck(const DNSName &qname, const QType &qtype, vector<DNSRecord>&ret, unsigned int depth, int &res);
void getBestNSFromCache(const DNSName &qname, const QType &qtype, vector<DNSRecord>&bestns, bool* flawedNSSet, unsigned int depth, set<GetBestNSAnswer>& beenthere);
DNSName getBestNSNamesFromCache(const DNSName &qname, const QType &qtype, NsSet& nsset, bool* flawedNSSet, unsigned int depth, set<GetBestNSAnswer>&beenthere);
inline vector<DNSName> shuffleInSpeedOrder(NsSet &nameservers, const string &prefix);
bool moreSpecificThan(const DNSName& a, const DNSName &b);
vector<ComboAddress> getAddrs(const DNSName &qname, unsigned int depth, set<GetBestNSAnswer>& beenthere);
private:
ostringstream d_trace;
shared_ptr<RecursorLua4> d_pdl;
string d_prefix;
bool d_cacheonly;
bool d_nocache;
bool d_doEDNS0;
static LogMode s_lm;
LogMode d_lm;
struct GetBestNSAnswer
{
DNSName qname;
set<pair<DNSName,DNSName> > bestns;
uint8_t qtype; // only A and AAAA anyhow
bool operator<(const GetBestNSAnswer &b) const
{
return boost::tie(qname, qtype, bestns) <
boost::tie(b.qname, b.qtype, b.bestns);
}
};
};
extern __thread SyncRes::StaticStorage* t_sstorage;
class Socket;
/* external functions, opaque to us */
int asendtcp(const string& data, Socket* sock);
int arecvtcp(string& data, size_t len, Socket* sock, bool incompleteOkay);
struct PacketID
{
PacketID() : id(0), type(0), sock(0), inNeeded(0), inIncompleteOkay(false), outPos(0), nearMisses(0), fd(-1)
{
memset(&remote, 0, sizeof(remote));
}
uint16_t id; // wait for a specific id/remote pair
uint16_t type; // and this is its type
ComboAddress remote; // this is the remote
DNSName domain; // this is the question
Socket* sock; // or wait for an event on a TCP fd
string inMSG; // they'll go here
size_t inNeeded; // if this is set, we'll read until inNeeded bytes are read
bool inIncompleteOkay;
string outMSG; // the outgoing message that needs to be sent
string::size_type outPos; // how far we are along in the outMSG
typedef set<uint16_t > chain_t;
mutable chain_t chain;
mutable uint32_t nearMisses; // number of near misses - host correct, id wrong
int fd;
bool operator<(const PacketID& b) const
{
int ourSock= sock ? sock->getHandle() : 0;
int bSock = b.sock ? b.sock->getHandle() : 0;
if( tie(remote, ourSock, type) < tie(b.remote, bSock, b.type))
return true;
if( tie(remote, ourSock, type) > tie(b.remote, bSock, b.type))
return false;
return tie(domain, fd, id) < tie(b.domain, b.fd, b.id);
}
};
struct PacketIDBirthdayCompare: public std::binary_function<PacketID, PacketID, bool>
{
bool operator()(const PacketID& a, const PacketID& b) const
{
int ourSock= a.sock ? a.sock->getHandle() : 0;
int bSock = b.sock ? b.sock->getHandle() : 0;
if( tie(a.remote, ourSock, a.type) < tie(b.remote, bSock, b.type))
return true;
if( tie(a.remote, ourSock, a.type) > tie(b.remote, bSock, b.type))
return false;
return a.domain < b.domain;
}
};
extern __thread MemRecursorCache* t_RC;
extern __thread RecursorPacketCache* t_packetCache;
typedef MTasker<PacketID,string> MT_t;
extern __thread MT_t* MT;
struct RecursorStats
{
std::atomic<uint64_t> servFails;
std::atomic<uint64_t> nxDomains;
std::atomic<uint64_t> noErrors;
std::atomic<uint64_t> answers0_1, answers1_10, answers10_100, answers100_1000, answersSlow;
std::atomic<uint64_t> auth4Answers0_1, auth4Answers1_10, auth4Answers10_100, auth4Answers100_1000, auth4AnswersSlow;
std::atomic<uint64_t> auth6Answers0_1, auth6Answers1_10, auth6Answers10_100, auth6Answers100_1000, auth6AnswersSlow;
double avgLatencyUsec;
std::atomic<uint64_t> qcounter; // not increased for unauth packets
std::atomic<uint64_t> ipv6qcounter;
std::atomic<uint64_t> tcpqcounter;
std::atomic<uint64_t> unauthorizedUDP; // when this is increased, qcounter isn't
std::atomic<uint64_t> unauthorizedTCP; // when this is increased, qcounter isn't
std::atomic<uint64_t> policyDrops;
std::atomic<uint64_t> tcpClientOverflow;
std::atomic<uint64_t> clientParseError;
std::atomic<uint64_t> serverParseError;
std::atomic<uint64_t> tooOldDrops;
std::atomic<uint64_t> unexpectedCount;
std::atomic<uint64_t> caseMismatchCount;
std::atomic<uint64_t> spoofCount;
std::atomic<uint64_t> resourceLimits;
std::atomic<uint64_t> overCapacityDrops;
std::atomic<uint64_t> ipv6queries;
std::atomic<uint64_t> chainResends;
std::atomic<uint64_t> nsSetInvalidations;
std::atomic<uint64_t> ednsPingMatches;
std::atomic<uint64_t> ednsPingMismatches;
std::atomic<uint64_t> noPingOutQueries, noEdnsOutQueries;
std::atomic<uint64_t> packetCacheHits;
std::atomic<uint64_t> noPacketError;
std::atomic<uint64_t> ignoredCount;
time_t startupTime;
std::atomic<uint64_t> dnssecQueries;
unsigned int maxMThreadStackUsage;
std::atomic<uint64_t> dnssecValidations; // should be the sum of all dnssecResult* stats
std::map<vState, std::atomic<uint64_t> > dnssecResults;
std::map<DNSFilterEngine::PolicyKind, std::atomic<uint64_t> > policyResults;
};
//! represents a running TCP/IP client session
class TCPConnection : public boost::noncopyable
{
public:
TCPConnection(int fd, const ComboAddress& addr);
~TCPConnection();
int getFD()
{
return d_fd;
}
enum stateenum {BYTE0, BYTE1, GETQUESTION, DONE} state{BYTE0};
uint16_t qlen{0};
uint16_t bytesread{0};
const ComboAddress d_remote;
char data[65535]; // damn
static unsigned int getCurrentConnections() { return s_currentConnections; }
private:
const int d_fd;
static AtomicCounter s_currentConnections; //!< total number of current TCP connections
};
class ImmediateServFailException
{
public:
ImmediateServFailException(string r){reason=r;};
string reason; //! Print this to tell the user what went wrong
};
#if (__GNUC__ == 4 && __GNUC_MINOR__ == 2)
typedef boost::circular_buffer<SComboAddress> addrringbuf_t;
#else
typedef boost::circular_buffer<ComboAddress> addrringbuf_t;
#endif
extern __thread addrringbuf_t* t_servfailremotes, *t_largeanswerremotes, *t_remotes;
extern __thread boost::circular_buffer<pair<DNSName,uint16_t> >* t_queryring, *t_servfailqueryring;
extern __thread NetmaskGroup* t_allowFrom;
string doQueueReloadLuaScript(vector<string>::const_iterator begin, vector<string>::const_iterator end);
string doTraceRegex(vector<string>::const_iterator begin, vector<string>::const_iterator end);
void parseACLs();
extern RecursorStats g_stats;
extern unsigned int g_numThreads;
extern std::unordered_set<DNSName> g_delegationOnly;
extern uint16_t g_outgoingEDNSBufsize;
std::string reloadAuthAndForwards();
ComboAddress parseIPAndPort(const std::string& input, uint16_t port);
ComboAddress getQueryLocalAddress(int family, uint16_t port);
typedef boost::function<void*(void)> pipefunc_t;
void broadcastFunction(const pipefunc_t& func, bool skipSelf = false);
void distributeAsyncFunction(const std::string& question, const pipefunc_t& func);
int directResolve(const DNSName& qname, const QType& qtype, int qclass, vector<DNSRecord>& ret);
template<class T> T broadcastAccFunction(const boost::function<T*()>& func, bool skipSelf=false);
SyncRes::domainmap_t* parseAuthAndForwards();
uint64_t* pleaseGetNsSpeedsSize();
uint64_t* pleaseGetCacheSize();
uint64_t* pleaseGetNegCacheSize();
uint64_t* pleaseGetCacheHits();
uint64_t* pleaseGetCacheMisses();
uint64_t* pleaseGetConcurrentQueries();
uint64_t* pleaseGetThrottleSize();
uint64_t* pleaseGetPacketCacheHits();
uint64_t* pleaseGetPacketCacheSize();
uint64_t* pleaseWipeCache(const DNSName& canon, bool subtree=false);
uint64_t* pleaseWipePacketCache(const DNSName& canon, bool subtree);
uint64_t* pleaseWipeAndCountNegCache(const DNSName& canon, bool subtree=false);
void doCarbonDump(void*);
boost::optional<Netmask> getEDNSSubnetMask(const ComboAddress& local, const DNSName&dn, const ComboAddress& rem);
void parseEDNSSubnetWhitelist(const std::string& wlist);
extern __thread struct timeval g_now;
#endif
|