DHTFindNodeReplyMessage.cc 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  1. /* <!-- copyright */
  2. /*
  3. * aria2 - The high speed download utility
  4. *
  5. * Copyright (C) 2006 Tatsuhiro Tsujikawa
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. *
  21. * In addition, as a special exception, the copyright holders give
  22. * permission to link the code of portions of this program with the
  23. * OpenSSL library under certain conditions as described in each
  24. * individual source file, and distribute linked combinations
  25. * including the two.
  26. * You must obey the GNU General Public License in all respects
  27. * for all of the code used other than OpenSSL. If you modify
  28. * file(s) with this exception, you may extend this exception to your
  29. * version of the file(s), but you are not obligated to do so. If you
  30. * do not wish to do so, delete this exception statement from your
  31. * version. If you delete this exception statement from all source
  32. * files in the program, then also delete it here.
  33. */
  34. /* copyright --> */
  35. #include "DHTFindNodeReplyMessage.h"
  36. #include <cstring>
  37. #include "DHTNode.h"
  38. #include "DHTBucket.h"
  39. #include "DHTRoutingTable.h"
  40. #include "DHTMessageFactory.h"
  41. #include "DHTMessageDispatcher.h"
  42. #include "DHTMessageCallback.h"
  43. #include "bittorrent_helper.h"
  44. #include "util.h"
  45. namespace aria2 {
  46. const std::string DHTFindNodeReplyMessage::FIND_NODE("find_node");
  47. const std::string DHTFindNodeReplyMessage::NODES("nodes");
  48. const std::string DHTFindNodeReplyMessage::NODES6("nodes6");
  49. DHTFindNodeReplyMessage::DHTFindNodeReplyMessage
  50. (int family,
  51. const SharedHandle<DHTNode>& localNode,
  52. const SharedHandle<DHTNode>& remoteNode,
  53. const std::string& transactionID):
  54. DHTResponseMessage(localNode, remoteNode, transactionID),
  55. family_(family) {}
  56. DHTFindNodeReplyMessage::~DHTFindNodeReplyMessage() {}
  57. void DHTFindNodeReplyMessage::doReceivedAction()
  58. {
  59. for(std::vector<SharedHandle<DHTNode> >::iterator i = closestKNodes_.begin(),
  60. eoi = closestKNodes_.end(); i != eoi; ++i) {
  61. if(memcmp((*i)->getID(), getLocalNode()->getID(), DHT_ID_LENGTH) != 0) {
  62. getRoutingTable()->addNode(*i);
  63. }
  64. }
  65. }
  66. SharedHandle<Dict> DHTFindNodeReplyMessage::getResponse()
  67. {
  68. SharedHandle<Dict> aDict = Dict::g();
  69. aDict->put(DHTMessage::ID, String::g(getLocalNode()->getID(), DHT_ID_LENGTH));
  70. unsigned char buffer[DHTBucket::K*38];
  71. const int clen = bittorrent::getCompactLength(family_);
  72. const int unit = clen+20;
  73. assert(unit <= 38);
  74. size_t offset = 0;
  75. size_t k = 0;
  76. for(std::vector<SharedHandle<DHTNode> >::const_iterator i =
  77. closestKNodes_.begin(), eoi = closestKNodes_.end();
  78. i != eoi && k < DHTBucket::K; ++i) {
  79. SharedHandle<DHTNode> node = *i;
  80. memcpy(buffer+offset, node->getID(), DHT_ID_LENGTH);
  81. unsigned char compact[COMPACT_LEN_IPV6];
  82. int compactlen = bittorrent::packcompact
  83. (compact, node->getIPAddress(), node->getPort());
  84. if(compactlen == clen) {
  85. memcpy(buffer+20+offset, compact, compactlen);
  86. offset += unit;
  87. ++k;
  88. }
  89. }
  90. aDict->put(family_ == AF_INET?NODES:NODES6, String::g(buffer, offset));
  91. return aDict;
  92. }
  93. const std::string& DHTFindNodeReplyMessage::getMessageType() const
  94. {
  95. return FIND_NODE;
  96. }
  97. void DHTFindNodeReplyMessage::accept(DHTMessageCallback* callback)
  98. {
  99. callback->visit(this);
  100. }
  101. void DHTFindNodeReplyMessage::setClosestKNodes
  102. (const std::vector<SharedHandle<DHTNode> >& closestKNodes)
  103. {
  104. closestKNodes_ = closestKNodes;
  105. }
  106. std::string DHTFindNodeReplyMessage::toStringOptional() const
  107. {
  108. return "nodes="+util::uitos(closestKNodes_.size());
  109. }
  110. } // namespace aria2