/dports/www/aria2/aria2-1.36.0/src/ |
H A D | DHTNode.cc | 46 DHTNode::DHTNode() in DHTNode() function in aria2::DHTNode 52 DHTNode::DHTNode(const unsigned char* id) in DHTNode() function in aria2::DHTNode 58 DHTNode::~DHTNode() = default; 62 bool DHTNode::operator==(const DHTNode& node) const in operator ==() 67 bool DHTNode::operator!=(const DHTNode& node) const { return !(*this == node); } in operator !=() 69 bool DHTNode::operator<(const DHTNode& node) const in operator <() 88 bool DHTNode::isQuestionable() const in isQuestionable() 94 void DHTNode::markGood() { condition_ = 0; } in markGood() 96 void DHTNode::markBad() { condition_ = BAD_CONDITION; } in markBad() 100 void DHTNode::timeout() { ++condition_; } in timeout() [all …]
|
H A D | DHTBucket.h | 50 class DHTNode; variable 61 std::shared_ptr<DHTNode> localNode_; 64 std::deque<std::shared_ptr<DHTNode>> nodes_; 68 std::deque<std::shared_ptr<DHTNode>> cachedNodes_; 76 DHTBucket(const std::shared_ptr<DHTNode>& localNode); 80 const std::shared_ptr<DHTNode>& localNode); 96 bool addNode(const std::shared_ptr<DHTNode>& node); 98 void cacheNode(const std::shared_ptr<DHTNode>& node); 117 void dropNode(const std::shared_ptr<DHTNode>& node); 119 void moveToHead(const std::shared_ptr<DHTNode>& node); [all …]
|
H A D | DHTRoutingTable.h | 46 class DHTNode; variable 54 std::shared_ptr<DHTNode> localNode_; 64 bool addNode(const std::shared_ptr<DHTNode>& node, bool good); 67 DHTRoutingTable(const std::shared_ptr<DHTNode>& localNode); 71 bool addNode(const std::shared_ptr<DHTNode>& node); 73 bool addGoodNode(const std::shared_ptr<DHTNode>& node); 82 void dropNode(const std::shared_ptr<DHTNode>& node); 84 void moveBucketHead(const std::shared_ptr<DHTNode>& node); 86 void moveBucketTail(const std::shared_ptr<DHTNode>& node); 91 getBucketFor(const std::shared_ptr<DHTNode>& node) const; [all …]
|
H A D | DHTMessageFactoryImpl.h | 56 std::shared_ptr<DHTNode> localNode_; 71 std::shared_ptr<DHTNode> getRemoteNode(const unsigned char* id, 79 void extractNodes(std::vector<std::shared_ptr<DHTNode>>& nodes, 97 const std::shared_ptr<DHTNode>& remoteNode, 101 createPingReplyMessage(const std::shared_ptr<DHTNode>& remoteNode, 106 const std::shared_ptr<DHTNode>& remoteNode, 116 const std::shared_ptr<DHTNode>& remoteNode, 117 std::vector<std::shared_ptr<DHTNode>> closestKNodes, 125 const std::shared_ptr<DHTNode>& remoteNode, 126 std::vector<std::shared_ptr<DHTNode>> closestKNodes, [all …]
|
H A D | DHTMessageFactory.h | 61 class DHTNode; variable 77 createPingMessage(const std::shared_ptr<DHTNode>& remoteNode, 81 createPingReplyMessage(const std::shared_ptr<DHTNode>& remoteNode, 86 createFindNodeMessage(const std::shared_ptr<DHTNode>& remoteNode, 91 const std::shared_ptr<DHTNode>& remoteNode, 92 std::vector<std::shared_ptr<DHTNode>> closestKNodes, 96 createGetPeersMessage(const std::shared_ptr<DHTNode>& remoteNode, 101 const std::shared_ptr<DHTNode>& remoteNode, 102 std::vector<std::shared_ptr<DHTNode>> closestKNodes, 107 createAnnouncePeerMessage(const std::shared_ptr<DHTNode>& remoteNode, [all …]
|
H A D | DHTBucket.cc | 56 const std::shared_ptr<DHTNode>& localNode) in DHTBucket() 65 DHTBucket::DHTBucket(const std::shared_ptr<DHTNode>& localNode) in DHTBucket() 106 bool DHTBucket::addNode(const std::shared_ptr<DHTNode>& node) in addNode() 133 void DHTBucket::cacheNode(const std::shared_ptr<DHTNode>& node) in cacheNode() 138 cachedNodes_.resize(CACHE_SIZE, std::shared_ptr<DHTNode>()); in cacheNode() 142 void DHTBucket::dropNode(const std::shared_ptr<DHTNode>& node) in dropNode() 192 std::deque<std::shared_ptr<DHTNode>> lNodes; in split() 215 std::vector<std::shared_ptr<DHTNode>>& goodNodes) const in getGoodNodes() 219 std::mem_fn(&DHTNode::isBad)), in getGoodNodes() 227 auto node = std::make_shared<DHTNode>(nodeID); in getNode() [all …]
|
H A D | DHTNode.h | 47 class DHTNode { 62 DHTNode(); 67 DHTNode(const unsigned char* id); 69 ~DHTNode(); 101 bool operator==(const DHTNode& node) const; 103 bool operator!=(const DHTNode& node) const; 105 bool operator<(const DHTNode& node) const;
|
H A D | DHTMessage.h | 47 class DHTNode; variable 51 std::shared_ptr<DHTNode> localNode_; 53 std::shared_ptr<DHTNode> remoteNode_; 62 DHTMessage(const std::shared_ptr<DHTNode>& localNode, 63 const std::shared_ptr<DHTNode>& remoteNode, 70 const std::shared_ptr<DHTNode>& getLocalNode() const { return localNode_; } in getLocalNode() 72 const std::shared_ptr<DHTNode>& getRemoteNode() const { return remoteNode_; } in getRemoteNode()
|
H A D | DHTRoutingTable.cc | 52 DHTRoutingTable::DHTRoutingTable(const std::shared_ptr<DHTNode>& localNode) in DHTRoutingTable() 64 bool DHTRoutingTable::addNode(const std::shared_ptr<DHTNode>& node) in addNode() 69 bool DHTRoutingTable::addGoodNode(const std::shared_ptr<DHTNode>& node) in addGoodNode() 74 bool DHTRoutingTable::addNode(const std::shared_ptr<DHTNode>& node, bool good) in addNode() 113 std::vector<std::shared_ptr<DHTNode>>& nodes, in getClosestKNodes() 139 DHTRoutingTable::getBucketFor(const std::shared_ptr<DHTNode>& node) const in getBucketFor() 144 std::shared_ptr<DHTNode> DHTRoutingTable::getNode(const unsigned char* nodeID, in getNode() 152 void DHTRoutingTable::dropNode(const std::shared_ptr<DHTNode>& node) in dropNode() 162 void DHTRoutingTable::moveBucketTail(const std::shared_ptr<DHTNode>& node) in moveBucketTail()
|
H A D | DHTRoutingTableSerializer.h | 46 class DHTNode; variable 52 std::shared_ptr<DHTNode> localNode_; 54 std::vector<std::shared_ptr<DHTNode>> nodes_; 61 void setLocalNode(const std::shared_ptr<DHTNode>& localNode); 63 void setNodes(const std::vector<std::shared_ptr<DHTNode>>& nodes);
|
H A D | DHTRoutingTableDeserializer.h | 48 class DHTNode; variable 54 std::shared_ptr<DHTNode> localNode_; 56 std::vector<std::shared_ptr<DHTNode>> nodes_; 65 const std::shared_ptr<DHTNode>& getLocalNode() const { return localNode_; } in getLocalNode() 67 const std::vector<std::shared_ptr<DHTNode>>& getNodes() const in getNodes()
|
H A D | DHTFindNodeReplyMessage.h | 47 std::vector<std::shared_ptr<DHTNode>> closestKNodes_; 53 DHTFindNodeReplyMessage(int family, const std::shared_ptr<DHTNode>& localNode, 54 const std::shared_ptr<DHTNode>& remoteNode, 65 const std::vector<std::shared_ptr<DHTNode>>& getClosestKNodes() const in getClosestKNodes() 70 void setClosestKNodes(std::vector<std::shared_ptr<DHTNode>> closestKNodes);
|
/dports/www/aria2/aria2-1.36.0/test/ |
H A D | DHTBucketTest.cc | 86 std::shared_ptr<DHTNode> node(new DHTNode(nodeID)); in testIsInRange() 104 std::shared_ptr<DHTNode> node(new DHTNode(nodeID)); in testIsInRange() 113 std::shared_ptr<DHTNode> node(new DHTNode(nodeID)); in testIsInRange() 121 std::shared_ptr<DHTNode> node(new DHTNode(nodeID)); in testIsInRange() 130 std::shared_ptr<DHTNode> node(new DHTNode(nodeID)); in testIsInRange() 139 std::shared_ptr<DHTNode> node(new DHTNode(nodeID)); in testIsInRange() 296 std::shared_ptr<DHTNode> newNode(new DHTNode(id)); in testAddNode() 376 std::shared_ptr<DHTNode> n1(new DHTNode()); in testCacheNode() 377 std::shared_ptr<DHTNode> n2(new DHTNode()); in testCacheNode() 378 std::shared_ptr<DHTNode> n3(new DHTNode()); in testCacheNode() [all …]
|
H A D | MockDHTMessageFactory.h | 21 std::shared_ptr<DHTNode> localNode_; 37 auto remoteNode = std::make_shared<DHTNode>(); in createResponseMessage() 46 createPingMessage(const std::shared_ptr<DHTNode>& remoteNode, 53 createPingReplyMessage(const std::shared_ptr<DHTNode>& remoteNode, in createPingReplyMessage() 61 createFindNodeMessage(const std::shared_ptr<DHTNode>& remoteNode, 69 const std::shared_ptr<DHTNode>& remoteNode, in createFindNodeReplyMessage() 70 std::vector<std::shared_ptr<DHTNode>> closestKNodes, in createFindNodeReplyMessage() 77 createGetPeersMessage(const std::shared_ptr<DHTNode>& remoteNode, in createGetPeersMessage() 85 const std::shared_ptr<DHTNode>& remoteNode, in createGetPeersReplyMessage() 86 std::vector<std::shared_ptr<DHTNode>> closestKNodes, in createGetPeersReplyMessage() [all …]
|
H A D | DHTFindNodeReplyMessageTest.cc | 35 std::shared_ptr<DHTNode> localNode(new DHTNode()); in testGetBencodedMessage() 36 std::shared_ptr<DHTNode> remoteNode(new DHTNode()); in testGetBencodedMessage() 45 std::shared_ptr<DHTNode> nodes[8]; in testGetBencodedMessage() 47 nodes[i].reset(new DHTNode()); in testGetBencodedMessage() 60 std::vector<std::shared_ptr<DHTNode>>(&nodes[0], &nodes[DHTBucket::K])); in testGetBencodedMessage() 78 std::shared_ptr<DHTNode> localNode(new DHTNode()); in testGetBencodedMessage6() 79 std::shared_ptr<DHTNode> remoteNode(new DHTNode()); in testGetBencodedMessage6() 88 std::shared_ptr<DHTNode> nodes[8]; in testGetBencodedMessage6() 90 nodes[i].reset(new DHTNode()); in testGetBencodedMessage6() 103 std::vector<std::shared_ptr<DHTNode>>(&nodes[0], &nodes[DHTBucket::K])); in testGetBencodedMessage6()
|
H A D | DHTRoutingTableTest.cc | 38 auto localNode = std::make_shared<DHTNode>(); in testAddNode() 46 if (table.addNode(std::make_shared<DHTNode>())) { in testAddNode() 55 auto localNode = std::make_shared<DHTNode>(); in testAddNode_localNode() 80 auto localNode = std::make_shared<DHTNode>(id); in testGetClosestKNodes() 84 std::shared_ptr<DHTNode> nodes1[8]; in testGetClosestKNodes() 85 std::shared_ptr<DHTNode> nodes2[8]; in testGetClosestKNodes() 86 std::shared_ptr<DHTNode> nodes3[8]; in testGetClosestKNodes() 89 nodes1[i] = std::make_shared<DHTNode>(id); in testGetClosestKNodes() 94 nodes2[i] = std::make_shared<DHTNode>(id); in testGetClosestKNodes() 99 nodes3[i] = std::make_shared<DHTNode>(id); in testGetClosestKNodes() [all …]
|
H A D | DHTGetPeersReplyMessageTest.cc | 36 std::shared_ptr<DHTNode> localNode(new DHTNode()); in testGetBencodedMessage() 37 std::shared_ptr<DHTNode> remoteNode(new DHTNode()); in testGetBencodedMessage() 57 std::shared_ptr<DHTNode> nodes[8]; in testGetBencodedMessage() 59 nodes[i].reset(new DHTNode()); in testGetBencodedMessage() 72 std::vector<std::shared_ptr<DHTNode>>(&nodes[0], &nodes[DHTBucket::K])); in testGetBencodedMessage() 99 std::shared_ptr<DHTNode> localNode(new DHTNode()); in testGetBencodedMessage6() 100 std::shared_ptr<DHTNode> remoteNode(new DHTNode()); in testGetBencodedMessage6() 120 std::shared_ptr<DHTNode> nodes[8]; in testGetBencodedMessage6() 122 nodes[i].reset(new DHTNode()); in testGetBencodedMessage6() 135 std::vector<std::shared_ptr<DHTNode>>(&nodes[0], &nodes[DHTBucket::K])); in testGetBencodedMessage6()
|
H A D | DHTRoutingTableDeserializerTest.cc | 40 std::shared_ptr<DHTNode> localNode(new DHTNode()); in testDeserialize() 42 std::vector<std::shared_ptr<DHTNode>> nodes(3); in testDeserialize() 44 nodes[i].reset(new DHTNode()); in testDeserialize() 65 const std::vector<std::shared_ptr<DHTNode>>& dsnodes = d.getNodes(); in testDeserialize() 78 std::shared_ptr<DHTNode> localNode(new DHTNode()); in testDeserialize6() 80 std::vector<std::shared_ptr<DHTNode>> nodes(3); in testDeserialize6() 82 nodes[i].reset(new DHTNode()); in testDeserialize6() 103 const std::vector<std::shared_ptr<DHTNode>>& dsnodes = d.getNodes(); in testDeserialize6()
|
H A D | MockDHTMessage.h | 23 std::vector<std::shared_ptr<DHTNode>> nodes_; 30 MockDHTMessage(const std::shared_ptr<DHTNode>& localNode, 31 const std::shared_ptr<DHTNode>& remoteNode, 65 std::vector<std::shared_ptr<DHTNode>> nodes_; 72 MockDHTQueryMessage(const std::shared_ptr<DHTNode>& localNode, 73 const std::shared_ptr<DHTNode>& remoteNode, 109 std::vector<std::shared_ptr<DHTNode>> nodes_; 116 MockDHTResponseMessage(const std::shared_ptr<DHTNode>& localNode, 117 const std::shared_ptr<DHTNode>& remoteNode,
|
H A D | BtPortMessageTest.cc | 42 createPingTask(const std::shared_ptr<DHTNode>& remoteNode, in createPingTask() 52 new MockDHTTask(std::shared_ptr<DHTNode>())); in createNodeLookupTask() 111 std::shared_ptr<DHTNode> localNode(new DHTNode(nodeID)); in testDoReceivedAction() 114 std::shared_ptr<DHTNode> nodes[9]; in testDoReceivedAction() 118 nodes[i].reset(new DHTNode(nodeID)); in testDoReceivedAction() 142 std::shared_ptr<DHTNode> node = task->remoteNode_; in testDoReceivedAction() 152 std::shared_ptr<DHTNode> localNode(new DHTNode(nodeID)); in testDoReceivedAction_bootstrap() 170 std::shared_ptr<DHTNode> node(task->remoteNode_); in testDoReceivedAction_bootstrap()
|
H A D | DHTFindNodeMessageTest.cc | 24 std::shared_ptr<DHTNode> localNode_; 25 std::shared_ptr<DHTNode> remoteNode_; 29 localNode_ = std::make_shared<DHTNode>(); in setUp() 30 remoteNode_ = std::make_shared<DHTNode>(); in setUp() 41 const std::shared_ptr<DHTNode>& remoteNode, in createFindNodeReplyMessage() 42 std::vector<std::shared_ptr<DHTNode>> closestKNodes, in createFindNodeReplyMessage() 61 auto targetNode = std::make_shared<DHTNode>(); in testGetBencodedMessage() 87 auto targetNode = std::make_shared<DHTNode>(); in testDoReceivedAction()
|
H A D | DHTBucketTreeTest.cc | 36 auto localNode = std::make_shared<DHTNode>(localNodeID); in testDig() 67 auto localNode = std::make_shared<DHTNode>(localNodeID); in testFindBucketFor() 137 bucket1->addNode(std::make_shared<DHTNode>(id)); in testFindClosestKNodes() 139 bucket2->addNode(std::make_shared<DHTNode>(id)); in testFindClosestKNodes() 141 bucket3->addNode(std::make_shared<DHTNode>(id)); in testFindClosestKNodes() 143 bucket4->addNode(std::make_shared<DHTNode>(id)); in testFindClosestKNodes() 145 bucket5->addNode(std::make_shared<DHTNode>(id)); in testFindClosestKNodes() 150 std::vector<std::shared_ptr<DHTNode>> nodes; in testFindClosestKNodes() 165 std::vector<std::shared_ptr<DHTNode>> nodes; in testFindClosestKNodes() 180 bucket4->addNode(std::make_shared<DHTNode>(id)); in testFindClosestKNodes() [all …]
|
/dports/misc/gedkeeper/GEDKeeper-2.19.1/projects/GKCommunicator/GKNetCore/DHT/ |
H A D | DHTRoutingTable.cs | 30 public class DHTRoutingTable : IEnumerable<DHTNode> 56 private readonly Dictionary<string, DHTNode> fKTable; 73 fKTable = new Dictionary<string, DHTNode>(); in DHTRoutingTable() 78 public void UpdateNodes(IEnumerable<DHTNode> nodes) in UpdateNodes() 85 public void UpdateNode(DHTNode node) in UpdateNode() 101 DHTNode existNode; in UpdateNode() 134 public IList<DHTNode> FindNodes(byte[] id) in FindNodes() 136 DHTNode[] values; in FindNodes() 166 public DHTNode FindNode(IPEndPoint endPoint) in FindNode() 168 DHTNode node; in FindNode() [all …]
|
/dports/games/libretro-fbneo/FBNeo-bbe3c05/src/burner/ |
H A D | dynhuff.cpp | 70 struct DHTNode { struct 73 struct DHTNode *left; argument 74 struct DHTNode *right; argument 75 struct DHTNode *parent; argument 137 …d SetNode (struct DHTNode *node_ptr,unsigned int freq, unsigned char value, struct DHTNode *left, … in SetNode() 157 static void SwapNodes (struct DHTNode *node1, struct DHTNode *node2) in SwapNodes() 204 struct DHTNode *temp; in CorrectDHT() 279 null_node_ptr->right = (struct DHTNode *)malloc(sizeof(struct DHTNode)); in BuildDHT() 322 null_node_ptr->left = (struct DHTNode *)malloc(sizeof(struct DHTNode)); in BuildDHT() 326 null_node_ptr->right = (struct DHTNode *)malloc(sizeof(struct DHTNode)); in BuildDHT() [all …]
|
/dports/games/libretro-fbalpha/fbalpha-84eb9d9/src/burner/win32/ |
H A D | dynhuff.cpp | 70 struct DHTNode { struct 73 struct DHTNode *left; argument 74 struct DHTNode *right; argument 75 struct DHTNode *parent; argument 137 …d SetNode (struct DHTNode *node_ptr,unsigned int freq, unsigned char value, struct DHTNode *left, … in SetNode() 157 static void SwapNodes (struct DHTNode *node1, struct DHTNode *node2) in SwapNodes() 204 struct DHTNode *temp; in CorrectDHT() 279 null_node_ptr->right = (struct DHTNode *)malloc(sizeof(struct DHTNode)); in BuildDHT() 322 null_node_ptr->left = (struct DHTNode *)malloc(sizeof(struct DHTNode)); in BuildDHT() 326 null_node_ptr->right = (struct DHTNode *)malloc(sizeof(struct DHTNode)); in BuildDHT() [all …]
|