mirror of
https://github.com/aria2/aria2.git
synced 2025-04-05 13:37:40 +03:00
114 lines
3.8 KiB
C++
114 lines
3.8 KiB
C++
/* <!-- 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
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*
|
|
* 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 --> */
|
|
#include "DHTFindNodeReplyMessage.h"
|
|
|
|
#include <cstring>
|
|
|
|
#include "DHTNode.h"
|
|
#include "DHTBucket.h"
|
|
#include "DHTRoutingTable.h"
|
|
#include "DHTMessageFactory.h"
|
|
#include "DHTMessageDispatcher.h"
|
|
#include "DHTMessageCallback.h"
|
|
#include "bittorrent_helper.h"
|
|
#include "util.h"
|
|
|
|
namespace aria2 {
|
|
|
|
const std::string DHTFindNodeReplyMessage::FIND_NODE("find_node");
|
|
|
|
const std::string DHTFindNodeReplyMessage::NODES("nodes");
|
|
|
|
DHTFindNodeReplyMessage::DHTFindNodeReplyMessage
|
|
(const SharedHandle<DHTNode>& localNode,
|
|
const SharedHandle<DHTNode>& remoteNode,
|
|
const std::string& transactionID):
|
|
DHTResponseMessage(localNode, remoteNode, transactionID) {}
|
|
|
|
DHTFindNodeReplyMessage::~DHTFindNodeReplyMessage() {}
|
|
|
|
void DHTFindNodeReplyMessage::doReceivedAction()
|
|
{
|
|
for(std::vector<SharedHandle<DHTNode> >::iterator i = _closestKNodes.begin(),
|
|
eoi = _closestKNodes.end(); i != eoi; ++i) {
|
|
if(memcmp((*i)->getID(), getLocalNode()->getID(), DHT_ID_LENGTH) != 0) {
|
|
getRoutingTable()->addNode(*i);
|
|
}
|
|
}
|
|
}
|
|
|
|
SharedHandle<Dict> DHTFindNodeReplyMessage::getResponse()
|
|
{
|
|
SharedHandle<Dict> aDict = Dict::g();
|
|
aDict->put(DHTMessage::ID, String::g(getLocalNode()->getID(), DHT_ID_LENGTH));
|
|
size_t offset = 0;
|
|
unsigned char buffer[DHTBucket::K*26];
|
|
// TODO if _closestKNodes.size() > DHTBucket::K ??
|
|
for(std::vector<SharedHandle<DHTNode> >::const_iterator i =
|
|
_closestKNodes.begin(), eoi = _closestKNodes.end();
|
|
i != eoi && offset < DHTBucket::K*26; ++i) {
|
|
SharedHandle<DHTNode> node = *i;
|
|
memcpy(buffer+offset, node->getID(), DHT_ID_LENGTH);
|
|
if(bittorrent::createcompact(buffer+20+offset, node->getIPAddress(),
|
|
node->getPort())) {
|
|
offset += 26;
|
|
}
|
|
}
|
|
aDict->put(NODES, String::g(buffer, offset));
|
|
return aDict;
|
|
}
|
|
|
|
const std::string& DHTFindNodeReplyMessage::getMessageType() const
|
|
{
|
|
return FIND_NODE;
|
|
}
|
|
|
|
void DHTFindNodeReplyMessage::accept(DHTMessageCallback* callback)
|
|
{
|
|
callback->visit(this);
|
|
}
|
|
|
|
void DHTFindNodeReplyMessage::setClosestKNodes
|
|
(const std::vector<SharedHandle<DHTNode> >& closestKNodes)
|
|
{
|
|
_closestKNodes = closestKNodes;
|
|
}
|
|
|
|
std::string DHTFindNodeReplyMessage::toStringOptional() const
|
|
{
|
|
return "nodes="+util::uitos(_closestKNodes.size());
|
|
}
|
|
|
|
} // namespace aria2
|