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
|
/*
PowerDNS Versatile Database Driven Nameserver
Copyright (C) 2002-2012 PowerDNS.COM BV
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License version 2
as published by the Free Software Foundation
Additionally, the license of this program contains a special
exception which allows to distribute the program in binary form when
it is linked against OpenSSL.
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 St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef MISC_HH
#define MISC_HH
#include <inttypes.h>
#include <cstring>
#include <cstdio>
#include <regex.h>
#include <boost/algorithm/string.hpp>
#include <boost/multi_index_container.hpp>
#include <boost/multi_index/ordered_index.hpp>
#include <boost/tuple/tuple_comparison.hpp>
#include <boost/multi_index/key_extractors.hpp>
#include <boost/multi_index/sequenced_index.hpp>
using namespace ::boost::multi_index;
#if 0
#include <iostream>
using std::cout;
using std::endl;
struct TSCTimer
{
TSCTimer()
{
RDTSC(d_tsc1);
}
~TSCTimer()
{
uint64_t tsc2;
RDTSC(tsc2);
cout<<"Timer: "<< (tsc2 - d_tsc1)/3000.0 << endl;
}
uint64_t d_tsc1;
};
#endif
#include "utility.hh"
#include "dns.hh"
#include <sys/time.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <time.h>
#include <syslog.h>
#include <deque>
#include <stdexcept>
#include <string>
#include <ctype.h>
#include <vector>
#include "namespaces.hh"
bool chopOff(string &domain);
bool chopOffDotted(string &domain);
bool endsOn(const string &domain, const string &suffix);
bool dottedEndsOn(const string &domain, const string &suffix);
string nowTime();
const string unquotify(const string &item);
string humanDuration(time_t passed);
bool stripDomainSuffix(string *qname, const string &domain);
void stripLine(string &line);
string getHostname();
string urlEncode(const string &text);
int waitForData(int fd, int seconds, int useconds=0);
int waitFor2Data(int fd1, int fd2, int seconds, int useconds, int* fd);
int waitForRWData(int fd, bool waitForRead, int seconds, int useconds);
uint16_t getShort(const unsigned char *p);
uint16_t getShort(const char *p);
uint32_t getLong(const unsigned char *p);
uint32_t getLong(const char *p);
int logFacilityToLOG(unsigned int facility);
struct ServiceTuple
{
string host;
uint16_t port;
};
void parseService(const string &descr, ServiceTuple &st);
template <typename Container>
void
stringtok (Container &container, string const &in,
const char * const delimiters = " \t\n")
{
const string::size_type len = in.length();
string::size_type i = 0;
while (i<len) {
// eat leading whitespace
i = in.find_first_not_of (delimiters, i);
if (i == string::npos)
return; // nothing left but white space
// find the end of the token
string::size_type j = in.find_first_of (delimiters, i);
// push token
if (j == string::npos) {
container.push_back (in.substr(i));
return;
} else
container.push_back (in.substr(i, j-i));
// set up for next loop
i = j + 1;
}
}
template<typename T> bool rfc1982LessThan(T a, T b)
{
return ((signed)(a - b)) < 0;
}
// fills container with ranges, so {posbegin,posend}
template <typename Container>
void
vstringtok (Container &container, string const &in,
const char * const delimiters = " \t\n")
{
const string::size_type len = in.length();
string::size_type i = 0;
while (i<len) {
// eat leading whitespace
i = in.find_first_not_of (delimiters, i);
if (i == string::npos)
return; // nothing left but white space
// find the end of the token
string::size_type j = in.find_first_of (delimiters, i);
// push token
if (j == string::npos) {
container.push_back (make_pair(i, len));
return;
} else
container.push_back (make_pair(i, j));
// set up for next loop
i = j + 1;
}
}
int writen2(int fd, const void *buf, size_t count);
inline int writen2(int fd, const std::string &s) { return writen2(fd, s.data(), s.size()); }
int readn2(int fd, void* buffer, unsigned int len);
const string toLower(const string &upper);
const string toLowerCanonic(const string &upper);
bool IpToU32(const string &str, uint32_t *ip);
string U32ToIP(uint32_t);
string stringerror();
string netstringerror();
string itoa(int i);
string uitoa(unsigned int i);
void dropPrivs(int uid, int gid);
int makeGidNumeric(const string &group);
int makeUidNumeric(const string &user);
void cleanSlashes(string &str);
/** The DTime class can be used for timing statistics with microsecond resolution.
On 32 bits systems this means that 2147 seconds is the longest time that can be measured. */
class DTime
{
public:
DTime(); //!< Does not set the timer for you! Saves lots of gettimeofday() calls
DTime(const DTime &dt);
time_t time();
inline void set(); //!< Reset the timer
inline int udiff(); //!< Return the number of microseconds since the timer was last set.
inline int udiffNoReset(); //!< Return the number of microseconds since the timer was last set.
void setTimeval(const struct timeval& tv)
{
d_set=tv;
}
struct timeval getTimeval()
{
return d_set;
}
private:
struct timeval d_set;
};
inline void DTime::set()
{
Utility::gettimeofday(&d_set,0);
}
inline int DTime::udiff()
{
int res=udiffNoReset();
Utility::gettimeofday(&d_set,0);
return res;
}
inline int DTime::udiffNoReset()
{
struct timeval now;
Utility::gettimeofday(&now,0);
int ret=1000000*(now.tv_sec-d_set.tv_sec)+(now.tv_usec-d_set.tv_usec);
return ret;
}
inline bool dns_isspace(char c)
{
return c==' ' || c=='\t' || c=='\r' || c=='\n';
}
inline char dns_tolower(char c)
{
if(c>='A' && c<='Z')
c+='a'-'A';
return c;
}
inline const string toLower(const string &upper)
{
string reply(upper);
char c;
for(unsigned int i = 0; i < reply.length(); i++) {
c = dns_tolower(upper[i]);
if( c != upper[i])
reply[i] = c;
}
return reply;
}
inline const string toLowerCanonic(const string &upper)
{
string reply(upper);
if(!upper.empty()) {
unsigned int i, limit= ( unsigned int ) reply.length();
char c;
for(i = 0; i < limit ; i++) {
c = dns_tolower(upper[i]);
if(c != upper[i])
reply[i] = c;
}
if(upper[i-1]=='.')
reply.resize(i-1);
}
return reply;
}
// Make s uppercase:
inline string toUpper( const string& s )
{
string r(s);
for( unsigned int i = 0; i < s.length(); i++ ) {
r[i] = toupper( r[i] );
}
return r;
}
inline double getTime()
{
struct timeval now;
Utility::gettimeofday(&now,0);
return now.tv_sec+now.tv_usec/1000000.0;
}
inline void unixDie(const string &why)
{
throw runtime_error(why+": "+strerror(errno));
}
string makeHexDump(const string& str);
void shuffle(vector<DNSResourceRecord>& rrs);
void orderAndShuffle(vector<DNSResourceRecord>& rrs);
void normalizeTV(struct timeval& tv);
const struct timeval operator+(const struct timeval& lhs, const struct timeval& rhs);
const struct timeval operator-(const struct timeval& lhs, const struct timeval& rhs);
inline float makeFloat(const struct timeval& tv)
{
return tv.tv_sec + tv.tv_usec/1000000.0f;
}
inline bool operator<(const struct timeval& lhs, const struct timeval& rhs)
{
return make_pair(lhs.tv_sec, lhs.tv_usec) < make_pair(rhs.tv_sec, rhs.tv_usec);
}
inline bool pdns_ilexicographical_compare(const std::string& a, const std::string& b) __attribute__((pure));
inline bool pdns_ilexicographical_compare(const std::string& a, const std::string& b)
{
const unsigned char *aPtr = (const unsigned char*)a.c_str(), *bPtr = (const unsigned char*)b.c_str();
const unsigned char *aEptr = aPtr + a.length(), *bEptr = bPtr + b.length();
while(aPtr != aEptr && bPtr != bEptr) {
if ((*aPtr != *bPtr) && (dns_tolower(*aPtr) - dns_tolower(*bPtr)))
return (dns_tolower(*aPtr) - dns_tolower(*bPtr)) < 0;
aPtr++;
bPtr++;
}
if(aPtr == aEptr && bPtr == bEptr) // strings are equal (in length)
return false;
return aPtr == aEptr; // true if first string was shorter
}
inline bool pdns_iequals(const std::string& a, const std::string& b) __attribute__((pure));
inline bool pdns_iequals(const std::string& a, const std::string& b)
{
if (a.length() != b.length())
return false;
const char *aPtr = a.c_str(), *bPtr = b.c_str();
const char *aEptr = aPtr + a.length();
while(aPtr != aEptr) {
if((*aPtr != *bPtr) && (dns_tolower(*aPtr) != dns_tolower(*bPtr)))
return false;
aPtr++;
bPtr++;
}
return true;
}
inline bool pdns_iequals_ch(const char a, const char b) __attribute__((pure));
inline bool pdns_iequals_ch(const char a, const char b)
{
if ((a != b) && (dns_tolower(a) != dns_tolower(b)))
return false;
return true;
}
// lifted from boost, with thanks
class AtomicCounter
{
public:
explicit AtomicCounter( unsigned int v = 0) : value_( v ) {}
unsigned int operator++()
{
return atomic_exchange_and_add( &value_, +1 ) + 1;
}
unsigned int operator++(int)
{
return atomic_exchange_and_add( &value_, +1 );
}
unsigned int operator--()
{
return atomic_exchange_and_add( &value_, -1 ) - 1;
}
operator unsigned int() const
{
return atomic_exchange_and_add( &value_, 0);
}
AtomicCounter(AtomicCounter const &rhs) : value_(rhs)
{
}
private:
mutable unsigned int value_;
// the below is necessary because __sync_fetch_and_add is not universally available on i386.. I 3> RHEL5.
#if defined( __GNUC__ ) && ( defined( __i386__ ) || defined( __x86_64__ ) )
static int atomic_exchange_and_add( unsigned int * pw, int dv )
{
// int r = *pw;
// *pw += dv;
// return r;
int r;
__asm__ __volatile__
(
"lock\n\t"
"xadd %1, %0":
"+m"( *pw ), "=r"( r ): // outputs (%0, %1)
"1"( dv ): // inputs (%2 == %1)
"memory", "cc" // clobbers
);
return r;
}
#else
static int atomic_exchange_and_add( unsigned int * pw, int dv )
{
return __sync_fetch_and_add(pw, dv);
}
#endif
};
struct CIStringCompare: public std::binary_function<string, string, bool>
{
bool operator()(const string& a, const string& b) const
{
return pdns_ilexicographical_compare(a, b);
}
};
struct CIStringComparePOSIX
{
bool operator() (const std::string& lhs, const std::string& rhs)
{
std::string::const_iterator a,b;
const std::locale &loc = std::locale("POSIX");
a=lhs.begin();b=rhs.begin();
while(a!=lhs.end()) {
if (b==rhs.end() || std::tolower(*b,loc)<std::tolower(*a,loc)) return false;
else if (std::tolower(*a,loc)<std::tolower(*b,loc)) return true;
a++;b++;
}
return (b!=rhs.end());
}
};
struct CIStringPairCompare: public std::binary_function<pair<string, uint16_t>, pair<string,uint16_t>, bool>
{
bool operator()(const pair<string, uint16_t>& a, const pair<string, uint16_t>& b) const
{
if(pdns_ilexicographical_compare(a.first, b.first))
return true;
if(pdns_ilexicographical_compare(b.first, a.first))
return false;
return a.second < b.second;
}
};
inline size_t pdns_ci_find(const string& haystack, const string& needle)
{
string::const_iterator it = std::search(haystack.begin(), haystack.end(),
needle.begin(), needle.end(), pdns_iequals_ch);
if (it == haystack.end()) {
// not found
return string::npos;
} else {
return it - haystack.begin();
}
}
pair<string, string> splitField(const string& inp, char sepa);
inline bool isCanonical(const string& dom)
{
if(dom.empty())
return false;
return dom[dom.size()-1]=='.';
}
inline string toCanonic(const string& zone, const string& domain)
{
if(domain.length()==1 && domain[0]=='@')
return zone;
if(isCanonical(domain))
return domain;
string ret=domain;
ret.append(1,'.');
if(!zone.empty() && zone[0]!='.')
ret.append(zone);
return ret;
}
string stripDot(const string& dom);
void seedRandom(const string& source);
string makeRelative(const std::string& fqdn, const std::string& zone);
string labelReverse(const std::string& qname);
std::string dotConcat(const std::string& a, const std::string &b);
int makeIPv6sockaddr(const std::string& addr, struct sockaddr_in6* ret);
int makeIPv4sockaddr(const std::string& str, struct sockaddr_in* ret);
int makeUNsockaddr(const std::string& path, struct sockaddr_un* ret);
bool stringfgets(FILE* fp, std::string& line);
template<typename Index>
std::pair<typename Index::iterator,bool>
replacing_insert(Index& i,const typename Index::value_type& x)
{
std::pair<typename Index::iterator,bool> res=i.insert(x);
if(!res.second)res.second=i.replace(res.first,x);
return res;
}
/** very small regex wrapper */
class Regex
{
public:
/** constructor that accepts the expression to regex */
Regex(const string &expr);
~Regex()
{
regfree(&d_preg);
}
/** call this to find out if 'line' matches your expression */
bool match(const string &line)
{
return regexec(&d_preg,line.c_str(),0,0,0)==0;
}
private:
regex_t d_preg;
};
union ComboAddress;
void addCMsgSrcAddr(struct msghdr* msgh, void* cmsgbuf, ComboAddress* source);
unsigned int getFilenumLimit(bool hardOrSoft=0);
void setFilenumLimit(unsigned int lim);
bool readFileIfThere(const char* fname, std::string* line);
uint32_t burtle(const unsigned char* k, uint32_t lengh, uint32_t init);
#endif
|