123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125 |
- /* <!-- 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");
- const std::string DHTFindNodeReplyMessage::NODES6("nodes6");
- DHTFindNodeReplyMessage::DHTFindNodeReplyMessage
- (int family,
- const SharedHandle<DHTNode>& localNode,
- const SharedHandle<DHTNode>& remoteNode,
- const std::string& transactionID):
- DHTResponseMessage(localNode, remoteNode, transactionID),
- family_(family) {}
- 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));
- unsigned char buffer[DHTBucket::K*38];
- const int clen = bittorrent::getCompactLength(family_);
- const int unit = clen+20;
- assert(unit <= 38);
- size_t offset = 0;
- size_t k = 0;
- for(std::vector<SharedHandle<DHTNode> >::const_iterator i =
- closestKNodes_.begin(), eoi = closestKNodes_.end();
- i != eoi && k < DHTBucket::K; ++i) {
- SharedHandle<DHTNode> node = *i;
- memcpy(buffer+offset, node->getID(), DHT_ID_LENGTH);
- unsigned char compact[COMPACT_LEN_IPV6];
- int compactlen = bittorrent::packcompact
- (compact, node->getIPAddress(), node->getPort());
- if(compactlen == clen) {
- memcpy(buffer+20+offset, compact, compactlen);
- offset += unit;
- ++k;
- }
- }
- aDict->put(family_ == AF_INET?NODES:NODES6, 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
|