mirror of https://github.com/aria2/aria2
142 lines
4.6 KiB
C++
142 lines
4.6 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 "DHTGetPeersReplyMessage.h"
|
|
|
|
#include <cstring>
|
|
|
|
#include "DHTNode.h"
|
|
#include "DHTBucket.h"
|
|
#include "DHTRoutingTable.h"
|
|
#include "DHTMessageFactory.h"
|
|
#include "DHTMessageDispatcher.h"
|
|
#include "DHTMessageCallback.h"
|
|
#include "PeerMessageUtil.h"
|
|
#include "Peer.h"
|
|
#include "DHTUtil.h"
|
|
#include "Util.h"
|
|
#include "bencode.h"
|
|
|
|
namespace aria2 {
|
|
|
|
const std::string DHTGetPeersReplyMessage::GET_PEERS("get_peers");
|
|
|
|
const std::string DHTGetPeersReplyMessage::TOKEN("token");
|
|
|
|
const std::string DHTGetPeersReplyMessage::VALUES("values");
|
|
|
|
const std::string DHTGetPeersReplyMessage::NODES("nodes");
|
|
|
|
DHTGetPeersReplyMessage::DHTGetPeersReplyMessage(const SharedHandle<DHTNode>& localNode,
|
|
const SharedHandle<DHTNode>& remoteNode,
|
|
const std::string& token,
|
|
const std::string& transactionID):
|
|
DHTResponseMessage(localNode, remoteNode, transactionID),
|
|
_token(token) {}
|
|
|
|
DHTGetPeersReplyMessage::~DHTGetPeersReplyMessage() {}
|
|
|
|
void DHTGetPeersReplyMessage::doReceivedAction()
|
|
{
|
|
// Returned peers and nodes are handled in DHTPeerLookupTask.
|
|
}
|
|
|
|
bencode::BDE DHTGetPeersReplyMessage::getResponse()
|
|
{
|
|
bencode::BDE rDict = bencode::BDE::dict();
|
|
rDict[DHTMessage::ID] = bencode::BDE(_localNode->getID(), DHT_ID_LENGTH);
|
|
rDict[TOKEN] = _token;
|
|
if(_values.empty()) {
|
|
size_t offset = 0;
|
|
unsigned char buffer[DHTBucket::K*26];
|
|
for(std::deque<SharedHandle<DHTNode> >::const_iterator i =
|
|
_closestKNodes.begin();
|
|
i != _closestKNodes.end() && offset < DHTBucket::K*26; ++i) {
|
|
SharedHandle<DHTNode> node = *i;
|
|
memcpy(buffer+offset, node->getID(), DHT_ID_LENGTH);
|
|
if(PeerMessageUtil::createcompact(buffer+20+offset, node->getIPAddress(), node->getPort())) {
|
|
offset += 26;
|
|
}
|
|
}
|
|
rDict[NODES] = bencode::BDE(buffer, offset);
|
|
} else {
|
|
bencode::BDE valuesList = bencode::BDE::list();
|
|
for(std::deque<SharedHandle<Peer> >::const_iterator i = _values.begin();
|
|
i != _values.end(); ++i) {
|
|
const SharedHandle<Peer>& peer = *i;
|
|
unsigned char buffer[6];
|
|
if(PeerMessageUtil::createcompact(buffer, peer->ipaddr, peer->port)) {
|
|
valuesList << bencode::BDE(buffer, sizeof(buffer));
|
|
}
|
|
}
|
|
rDict[VALUES] = valuesList;
|
|
}
|
|
return rDict;
|
|
}
|
|
|
|
std::string DHTGetPeersReplyMessage::getMessageType() const
|
|
{
|
|
return GET_PEERS;
|
|
}
|
|
|
|
void DHTGetPeersReplyMessage::validate() const {}
|
|
|
|
const std::deque<SharedHandle<DHTNode> >& DHTGetPeersReplyMessage::getClosestKNodes() const
|
|
{
|
|
return _closestKNodes;
|
|
}
|
|
|
|
void DHTGetPeersReplyMessage::setClosestKNodes(const std::deque<SharedHandle<DHTNode> >& closestKNodes)
|
|
{
|
|
_closestKNodes = closestKNodes;
|
|
}
|
|
|
|
const std::deque<SharedHandle<Peer> >& DHTGetPeersReplyMessage::getValues() const
|
|
{
|
|
return _values;
|
|
}
|
|
|
|
void DHTGetPeersReplyMessage::setValues(const std::deque<SharedHandle<Peer> >& peers)
|
|
{
|
|
_values = peers;
|
|
}
|
|
|
|
std::string DHTGetPeersReplyMessage::toStringOptional() const
|
|
{
|
|
return "token="+Util::toHex(_token)+", values="+Util::uitos(_values.size())+
|
|
", nodes="+Util::uitos(_closestKNodes.size());
|
|
}
|
|
|
|
} // namespace aria2
|