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
|
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <iostream>
#include <cinttypes>
#include "recpacketcache.hh"
#include "cachecleaner.hh"
#include "dns.hh"
#include "dnsparser.hh"
#include "namespaces.hh"
#include "lock.hh"
#include "dnswriter.hh"
#include "ednsoptions.hh"
RecursorPacketCache::RecursorPacketCache()
{
d_hits = d_misses = 0;
}
int RecursorPacketCache::doWipePacketCache(const DNSName& name, uint16_t qtype, bool subtree)
{
int count=0;
auto& idx = d_packetCache.get<NameTag>();
for(auto iter = idx.lower_bound(name); iter != idx.end(); ) {
if(subtree) {
if(!iter->d_name.isPartOf(name)) { // this is case insensitive
break;
}
}
else {
if(iter->d_name != name)
break;
}
if(qtype==0xffff || iter->d_type == qtype) {
iter=idx.erase(iter);
count++;
}
else
++iter;
}
return count;
}
bool RecursorPacketCache::qrMatch(const packetCache_t::index<HashTag>::type::iterator& iter, const std::string& queryPacket, const DNSName& qname, uint16_t qtype, uint16_t qclass, uint16_t ecsBegin, uint16_t ecsEnd)
{
// this ignores checking on the EDNS subnet flags!
if (qname != iter->d_name || iter->d_type != qtype || iter->d_class != qclass) {
return false;
}
if (iter->d_ecsBegin != ecsBegin || iter->d_ecsEnd != ecsEnd) {
return false;
}
return queryMatches(iter->d_query, queryPacket, qname, ecsBegin, ecsEnd);
}
bool RecursorPacketCache::checkResponseMatches(std::pair<packetCache_t::index<HashTag>::type::iterator, packetCache_t::index<HashTag>::type::iterator> range, const std::string& queryPacket, const DNSName& qname, uint16_t qtype, uint16_t qclass, time_t now, std::string* responsePacket, uint32_t* age, RecProtoBufMessage* protobufMessage, uint16_t ecsBegin, uint16_t ecsEnd)
{
for(auto iter = range.first ; iter != range.second ; ++iter) {
// the possibility is VERY real that we get hits that are not right - birthday paradox
if (!qrMatch(iter, queryPacket, qname, qtype, qclass, ecsBegin, ecsEnd)) {
continue;
}
if (now < iter->d_ttd) { // it is right, it is fresh!
*age = static_cast<uint32_t>(now - iter->d_creation);
*responsePacket = iter->d_packet;
responsePacket->replace(0, 2, queryPacket.c_str(), 2);
string::size_type i=sizeof(dnsheader);
for(;;) {
unsigned int labellen = (unsigned char)queryPacket[i];
if(!labellen || i + labellen > responsePacket->size()) break;
i++;
responsePacket->replace(i, labellen, queryPacket, i, labellen);
i = i + labellen;
}
d_hits++;
moveCacheItemToBack(d_packetCache, iter);
#ifdef HAVE_PROTOBUF
if (protobufMessage) {
*protobufMessage = iter->d_protobufMessage;
}
#endif
return true;
}
else {
moveCacheItemToFront(d_packetCache, iter);
d_misses++;
break;
}
}
return false;
}
bool RecursorPacketCache::getResponsePacket(unsigned int tag, const std::string& queryPacket, time_t now,
std::string* responsePacket, uint32_t* age, uint32_t* qhash)
{
DNSName qname;
uint16_t qtype, qclass;
uint16_t ecsBegin;
uint16_t ecsEnd;
return getResponsePacket(tag, queryPacket, qname, &qtype, &qclass, now, responsePacket, age, qhash, &ecsBegin, &ecsEnd, nullptr);
}
bool RecursorPacketCache::getResponsePacket(unsigned int tag, const std::string& queryPacket, const DNSName& qname, uint16_t qtype, uint16_t qclass, time_t now,
std::string* responsePacket, uint32_t* age, uint32_t* qhash)
{
uint16_t ecsBegin;
uint16_t ecsEnd;
return getResponsePacket(tag, queryPacket, qname, qtype, qclass, now, responsePacket, age, qhash, &ecsBegin, &ecsEnd, nullptr);
}
bool RecursorPacketCache::getResponsePacket(unsigned int tag, const std::string& queryPacket, const DNSName& qname, uint16_t qtype, uint16_t qclass, time_t now,
std::string* responsePacket, uint32_t* age, uint32_t* qhash, uint16_t* ecsBegin, uint16_t* ecsEnd, RecProtoBufMessage* protobufMessage)
{
*qhash = canHashPacket(queryPacket, ecsBegin, ecsEnd);
const auto& idx = d_packetCache.get<HashTag>();
auto range = idx.equal_range(tie(tag,*qhash));
if(range.first == range.second) {
d_misses++;
return false;
}
return checkResponseMatches(range, queryPacket, qname, qtype, qclass, now, responsePacket, age, protobufMessage, *ecsBegin, *ecsEnd);
}
bool RecursorPacketCache::getResponsePacket(unsigned int tag, const std::string& queryPacket, DNSName& qname, uint16_t* qtype, uint16_t* qclass, time_t now,
std::string* responsePacket, uint32_t* age, uint32_t* qhash, uint16_t* ecsBegin, uint16_t* ecsEnd, RecProtoBufMessage* protobufMessage)
{
*qhash = canHashPacket(queryPacket, ecsBegin, ecsEnd);
const auto& idx = d_packetCache.get<HashTag>();
auto range = idx.equal_range(tie(tag,*qhash));
if(range.first == range.second) {
d_misses++;
return false;
}
qname = DNSName(queryPacket.c_str(), queryPacket.length(), sizeof(dnsheader), false, qtype, qclass, 0);
return checkResponseMatches(range, queryPacket, qname, *qtype, *qclass, now, responsePacket, age, protobufMessage, *ecsBegin, *ecsEnd);
}
void RecursorPacketCache::insertResponsePacket(unsigned int tag, uint32_t qhash, const std::string& query, const DNSName& qname, uint16_t qtype, uint16_t qclass, const std::string& responsePacket, time_t now, uint32_t ttl, uint16_t ecsBegin, uint16_t ecsEnd)
{
insertResponsePacket(tag, qhash, query, qname, qtype, qclass, responsePacket, now, ttl, ecsBegin, ecsEnd, nullptr);
}
void RecursorPacketCache::insertResponsePacket(unsigned int tag, uint32_t qhash, const std::string& query, const DNSName& qname, uint16_t qtype, uint16_t qclass, const std::string& responsePacket, time_t now, uint32_t ttl, uint16_t ecsBegin, uint16_t ecsEnd, const RecProtoBufMessage* protobufMessage)
{
auto& idx = d_packetCache.get<HashTag>();
auto range = idx.equal_range(tie(tag,qhash));
auto iter = range.first;
for( ; iter != range.second ; ++iter) {
if (iter->d_type != qtype || iter->d_class != qclass || iter->d_name != qname) {
continue;
}
moveCacheItemToBack(d_packetCache, iter);
iter->d_packet = responsePacket;
iter->d_query = query;
iter->d_ecsBegin = ecsBegin;
iter->d_ecsEnd = ecsEnd;
iter->d_ttd = now + ttl;
iter->d_creation = now;
#ifdef HAVE_PROTOBUF
if (protobufMessage) {
iter->d_protobufMessage = *protobufMessage;
}
#endif
break;
}
if(iter == range.second) { // nothing to refresh
struct Entry e(qname, responsePacket, query);
e.d_qhash = qhash;
e.d_ecsBegin = ecsBegin;
e.d_ecsEnd = ecsEnd;
e.d_type = qtype;
e.d_class = qclass;
e.d_ttd = now+ttl;
e.d_creation = now;
e.d_tag = tag;
#ifdef HAVE_PROTOBUF
if (protobufMessage) {
e.d_protobufMessage = *protobufMessage;
}
#endif
d_packetCache.insert(e);
}
}
uint64_t RecursorPacketCache::size()
{
return d_packetCache.size();
}
uint64_t RecursorPacketCache::bytes()
{
uint64_t sum=0;
for(const auto& e : d_packetCache) {
sum += sizeof(e) + e.d_packet.length() + 4;
}
return sum;
}
void RecursorPacketCache::doPruneTo(unsigned int maxCached)
{
pruneCollection(*this, d_packetCache, maxCached);
}
uint64_t RecursorPacketCache::doDump(int fd)
{
FILE* fp=fdopen(dup(fd), "w");
if(!fp) { // dup probably failed
return 0;
}
fprintf(fp, "; main packet cache dump from thread follows\n;\n");
const auto& sidx=d_packetCache.get<1>();
uint64_t count=0;
time_t now=time(0);
for(auto i=sidx.cbegin(); i != sidx.cend(); ++i) {
count++;
try {
fprintf(fp, "%s %" PRId64 " %s ; tag %d\n", i->d_name.toString().c_str(), static_cast<int64_t>(i->d_ttd - now), DNSRecordContent::NumberToType(i->d_type).c_str(), i->d_tag);
}
catch(...) {
fprintf(fp, "; error printing '%s'\n", i->d_name.empty() ? "EMPTY" : i->d_name.toString().c_str());
}
}
fclose(fp);
return count;
}
|