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 #ifndef D_DHT_ROUTING_TABLE_H 36 #define D_DHT_ROUTING_TABLE_H 37 38 #include "common.h" 39 40 #include <string> 41 #include <vector> 42 #include <memory> 43 44 namespace aria2 { 45 46 class DHTNode; 47 class DHTBucket; 48 class DHTTaskQueue; 49 class DHTTaskFactory; 50 class DHTBucketTreeNode; 51 52 class DHTRoutingTable { 53 private: 54 std::shared_ptr<DHTNode> localNode_; 55 56 std::unique_ptr<DHTBucketTreeNode> root_; 57 58 int numBucket_; 59 60 DHTTaskQueue* taskQueue_; 61 62 DHTTaskFactory* taskFactory_; 63 64 bool addNode(const std::shared_ptr<DHTNode>& node, bool good); 65 66 public: 67 DHTRoutingTable(const std::shared_ptr<DHTNode>& localNode); 68 69 ~DHTRoutingTable(); 70 71 bool addNode(const std::shared_ptr<DHTNode>& node); 72 73 bool addGoodNode(const std::shared_ptr<DHTNode>& node); 74 75 void getClosestKNodes(std::vector<std::shared_ptr<DHTNode>>& nodes, 76 const unsigned char* key) const; 77 78 int getNumBucket() const; 79 80 void showBuckets() const; 81 82 void dropNode(const std::shared_ptr<DHTNode>& node); 83 84 void moveBucketHead(const std::shared_ptr<DHTNode>& node); 85 86 void moveBucketTail(const std::shared_ptr<DHTNode>& node); 87 88 std::shared_ptr<DHTBucket> getBucketFor(const unsigned char* nodeID) const; 89 90 std::shared_ptr<DHTBucket> 91 getBucketFor(const std::shared_ptr<DHTNode>& node) const; 92 93 std::shared_ptr<DHTNode> getNode(const unsigned char* id, 94 const std::string& ipaddr, 95 uint16_t port) const; 96 97 void getBuckets(std::vector<std::shared_ptr<DHTBucket>>& buckets) const; 98 99 void setTaskQueue(DHTTaskQueue* taskQueue); 100 101 void setTaskFactory(DHTTaskFactory* taskFactory); 102 }; 103 104 } // namespace aria2 105 106 #endif // D_DHT_ROUTING_TABLE_H 107