2007-03-28 15:08:22 +00:00
|
|
|
/* <!-- copyright */
|
|
|
|
/*
|
|
|
|
* aria2 - The high speed download utility
|
|
|
|
*
|
|
|
|
* Copyright (C) 2006 Tatsuhiro Tsujikawa
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* 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
|
2010-01-05 16:01:46 +00:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
2007-03-28 15:08:22 +00:00
|
|
|
*
|
|
|
|
* In addition, as a special exception, the copyright holders give
|
|
|
|
* permission to link the code of portions of this program with the
|
|
|
|
* OpenSSL library under certain conditions as described in each
|
|
|
|
* individual source file, and distribute linked combinations
|
|
|
|
* including the two.
|
|
|
|
* You must obey the GNU General Public License in all respects
|
|
|
|
* for all of the code used other than OpenSSL. If you modify
|
|
|
|
* file(s) with this exception, you may extend this exception to your
|
|
|
|
* version of the file(s), but you are not obligated to do so. If you
|
|
|
|
* do not wish to do so, delete this exception statement from your
|
|
|
|
* version. If you delete this exception statement from all source
|
|
|
|
* files in the program, then also delete it here.
|
|
|
|
*/
|
|
|
|
/* copyright --> */
|
|
|
|
#ifndef _D_DNS_CACHE_H_
|
|
|
|
#define _D_DNS_CACHE_H_
|
|
|
|
|
|
|
|
#include "common.h"
|
2008-11-03 08:18:58 +00:00
|
|
|
|
2008-02-08 15:53:45 +00:00
|
|
|
#include <string>
|
2009-07-02 15:18:13 +00:00
|
|
|
#include <deque>
|
|
|
|
#include <algorithm>
|
2009-12-04 07:39:50 +00:00
|
|
|
#include <vector>
|
2007-03-28 15:08:22 +00:00
|
|
|
|
2008-11-03 08:18:58 +00:00
|
|
|
#include "A2STR.h"
|
|
|
|
|
2008-02-08 15:53:45 +00:00
|
|
|
namespace aria2 {
|
|
|
|
|
2007-03-28 15:08:22 +00:00
|
|
|
class DNSCache {
|
|
|
|
private:
|
2009-12-04 07:39:50 +00:00
|
|
|
struct AddrEntry {
|
2010-06-21 13:51:56 +00:00
|
|
|
std::string addr_;
|
|
|
|
bool good_;
|
2009-12-04 07:39:50 +00:00
|
|
|
|
2010-06-21 13:51:56 +00:00
|
|
|
AddrEntry(const std::string& addr):addr_(addr), good_(true) {}
|
2009-12-04 07:39:50 +00:00
|
|
|
};
|
|
|
|
|
2009-07-02 15:18:13 +00:00
|
|
|
struct CacheEntry {
|
2010-06-21 13:51:56 +00:00
|
|
|
std::string hostname_;
|
|
|
|
uint16_t port_;
|
|
|
|
std::vector<AddrEntry> addrEntries_;
|
2009-12-04 07:39:50 +00:00
|
|
|
|
2009-07-02 15:18:13 +00:00
|
|
|
CacheEntry
|
2009-12-04 07:39:50 +00:00
|
|
|
(const std::string& hostname, uint16_t port):
|
2010-06-21 13:51:56 +00:00
|
|
|
hostname_(hostname), port_(port) {}
|
2009-12-04 07:39:50 +00:00
|
|
|
|
|
|
|
void add(const std::string& addr)
|
|
|
|
{
|
2010-06-21 13:51:56 +00:00
|
|
|
addrEntries_.push_back(AddrEntry(addr));
|
2009-12-04 07:39:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<AddrEntry>::iterator find(const std::string& addr)
|
|
|
|
{
|
2010-06-21 13:51:56 +00:00
|
|
|
for(std::vector<AddrEntry>::iterator i = addrEntries_.begin(),
|
|
|
|
eoi = addrEntries_.end(); i != eoi; ++i) {
|
|
|
|
if((*i).addr_ == addr) {
|
2010-01-05 16:01:46 +00:00
|
|
|
return i;
|
|
|
|
}
|
2009-12-04 07:39:50 +00:00
|
|
|
}
|
2010-06-21 13:51:56 +00:00
|
|
|
return addrEntries_.end();
|
2009-12-04 07:39:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<AddrEntry>::const_iterator find(const std::string& addr) const
|
|
|
|
{
|
2010-06-21 13:51:56 +00:00
|
|
|
for(std::vector<AddrEntry>::const_iterator i = addrEntries_.begin(),
|
|
|
|
eoi = addrEntries_.end(); i != eoi; ++i) {
|
|
|
|
if((*i).addr_ == addr) {
|
2010-01-05 16:01:46 +00:00
|
|
|
return i;
|
|
|
|
}
|
2009-12-04 07:39:50 +00:00
|
|
|
}
|
2010-06-21 13:51:56 +00:00
|
|
|
return addrEntries_.end();
|
2009-12-04 07:39:50 +00:00
|
|
|
}
|
2009-07-02 15:18:13 +00:00
|
|
|
|
2009-12-04 07:39:50 +00:00
|
|
|
bool contains(const std::string& addr) const
|
|
|
|
{
|
2010-06-21 13:51:56 +00:00
|
|
|
return find(addr) != addrEntries_.end();
|
2009-12-04 07:39:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const std::string& getGoodAddr() const
|
|
|
|
{
|
2010-06-21 13:51:56 +00:00
|
|
|
for(std::vector<AddrEntry>::const_iterator i = addrEntries_.begin(),
|
|
|
|
eoi = addrEntries_.end(); i != eoi; ++i) {
|
|
|
|
if((*i).good_) {
|
|
|
|
return (*i).addr_;
|
2010-01-05 16:01:46 +00:00
|
|
|
}
|
2009-12-04 07:39:50 +00:00
|
|
|
}
|
|
|
|
return A2STR::NIL;
|
|
|
|
}
|
|
|
|
|
2010-01-06 14:31:41 +00:00
|
|
|
template<typename OutputIterator>
|
|
|
|
void getAllGoodAddrs(OutputIterator out) const
|
|
|
|
{
|
2010-06-21 13:51:56 +00:00
|
|
|
for(std::vector<AddrEntry>::const_iterator i = addrEntries_.begin(),
|
|
|
|
eoi = addrEntries_.end(); i != eoi; ++i) {
|
|
|
|
if((*i).good_) {
|
|
|
|
*out++ = (*i).addr_;
|
2010-01-06 14:31:41 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-12-04 07:39:50 +00:00
|
|
|
void markBad(const std::string& addr)
|
|
|
|
{
|
|
|
|
std::vector<AddrEntry>::iterator i = find(addr);
|
2010-06-21 13:51:56 +00:00
|
|
|
if(i != addrEntries_.end()) {
|
|
|
|
(*i).good_ = false;
|
2009-12-04 07:39:50 +00:00
|
|
|
}
|
|
|
|
}
|
2009-07-02 15:18:13 +00:00
|
|
|
|
|
|
|
bool operator<(const CacheEntry& e) const
|
|
|
|
{
|
2010-06-21 13:51:56 +00:00
|
|
|
int r = hostname_.compare(e.hostname_);
|
2009-07-02 15:18:13 +00:00
|
|
|
if(r != 0) {
|
2010-01-05 16:01:46 +00:00
|
|
|
return r < 0;
|
2009-07-02 15:18:13 +00:00
|
|
|
}
|
2010-06-21 13:51:56 +00:00
|
|
|
return port_ < e.port_;
|
2009-07-02 15:18:13 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool operator==(const CacheEntry& e) const
|
|
|
|
{
|
2010-06-21 13:51:56 +00:00
|
|
|
return hostname_ == e.hostname_ && port_ == e.port_;
|
2009-07-02 15:18:13 +00:00
|
|
|
}
|
|
|
|
};
|
2007-03-28 15:08:22 +00:00
|
|
|
|
2010-06-21 13:51:56 +00:00
|
|
|
std::deque<CacheEntry> entries_;
|
2007-03-28 15:08:22 +00:00
|
|
|
|
2009-07-02 15:18:13 +00:00
|
|
|
public:
|
|
|
|
const std::string& find(const std::string& hostname, uint16_t port) const
|
2007-03-28 15:08:22 +00:00
|
|
|
{
|
2009-12-04 07:39:50 +00:00
|
|
|
CacheEntry target(hostname, port);
|
2009-07-02 15:18:13 +00:00
|
|
|
std::deque<CacheEntry>::const_iterator i =
|
2010-06-21 13:51:56 +00:00
|
|
|
std::lower_bound(entries_.begin(), entries_.end(), target);
|
|
|
|
if(i != entries_.end() && (*i) == target) {
|
2009-12-04 07:39:50 +00:00
|
|
|
return (*i).getGoodAddr();
|
2009-07-02 15:18:13 +00:00
|
|
|
}
|
|
|
|
return A2STR::NIL;
|
2007-03-28 15:08:22 +00:00
|
|
|
}
|
2010-01-06 14:31:41 +00:00
|
|
|
|
|
|
|
template<typename OutputIterator>
|
|
|
|
void findAll
|
|
|
|
(OutputIterator out, const std::string& hostname, uint16_t port) const
|
|
|
|
{
|
|
|
|
CacheEntry target(hostname, port);
|
|
|
|
std::deque<CacheEntry>::const_iterator i =
|
2010-06-21 13:51:56 +00:00
|
|
|
std::lower_bound(entries_.begin(), entries_.end(), target);
|
|
|
|
if(i != entries_.end() && (*i) == target) {
|
2010-01-06 14:31:41 +00:00
|
|
|
(*i).getAllGoodAddrs(out);
|
|
|
|
}
|
|
|
|
}
|
2007-03-28 15:08:22 +00:00
|
|
|
|
2009-07-02 15:18:13 +00:00
|
|
|
void put
|
|
|
|
(const std::string& hostname, const std::string& ipaddr, uint16_t port)
|
|
|
|
{
|
2009-12-04 07:39:50 +00:00
|
|
|
CacheEntry target(hostname, port);
|
2009-07-02 15:18:13 +00:00
|
|
|
std::deque<CacheEntry>::iterator i =
|
2010-06-21 13:51:56 +00:00
|
|
|
std::lower_bound(entries_.begin(), entries_.end(), target);
|
|
|
|
if(i == entries_.end() || !((*i) == target)) {
|
2009-12-04 07:39:50 +00:00
|
|
|
target.add(ipaddr);
|
2010-06-21 13:51:56 +00:00
|
|
|
entries_.insert(i, target);
|
2009-12-04 07:39:50 +00:00
|
|
|
} else {
|
|
|
|
if(!(*i).contains(ipaddr)) {
|
2010-01-05 16:01:46 +00:00
|
|
|
(*i).add(ipaddr);
|
2009-12-04 07:39:50 +00:00
|
|
|
}
|
2009-07-02 15:18:13 +00:00
|
|
|
}
|
|
|
|
}
|
2007-03-28 15:08:22 +00:00
|
|
|
|
2009-07-02 15:18:13 +00:00
|
|
|
void markBad
|
|
|
|
(const std::string& hostname, const std::string& ipaddr, uint16_t port)
|
2008-11-03 08:18:58 +00:00
|
|
|
{
|
2009-12-04 07:39:50 +00:00
|
|
|
CacheEntry target(hostname, port);
|
|
|
|
std::deque<CacheEntry>::iterator i =
|
2010-06-21 13:51:56 +00:00
|
|
|
std::lower_bound(entries_.begin(), entries_.end(), target);
|
|
|
|
if(i != entries_.end() && (*i) == target) {
|
2009-12-04 07:39:50 +00:00
|
|
|
(*i).markBad(ipaddr);
|
2009-07-02 15:18:13 +00:00
|
|
|
}
|
2008-11-03 08:18:58 +00:00
|
|
|
}
|
2007-03-28 15:08:22 +00:00
|
|
|
|
2009-07-02 15:18:13 +00:00
|
|
|
void remove(const std::string& hostname, uint16_t port)
|
|
|
|
{
|
2009-12-04 07:39:50 +00:00
|
|
|
CacheEntry target(hostname, port);
|
2009-07-02 15:18:13 +00:00
|
|
|
std::deque<CacheEntry>::iterator i =
|
2010-06-21 13:51:56 +00:00
|
|
|
std::lower_bound(entries_.begin(), entries_.end(), target);
|
|
|
|
if(i != entries_.end() && (*i) == target) {
|
|
|
|
entries_.erase(i);
|
2009-07-02 15:18:13 +00:00
|
|
|
}
|
|
|
|
}
|
2007-03-28 15:08:22 +00:00
|
|
|
};
|
|
|
|
|
2008-02-08 15:53:45 +00:00
|
|
|
} // namespace aria2
|
|
|
|
|
2007-03-28 15:08:22 +00:00
|
|
|
#endif // _D_DNS_CACHE_H_
|