1 #include "DHTFindNodeMessage.h"
2
3 #include <cppunit/extensions/HelperMacros.h>
4
5 #include "DHTNode.h"
6 #include "Exception.h"
7 #include "util.h"
8 #include "MockDHTMessageFactory.h"
9 #include "MockDHTMessage.h"
10 #include "MockDHTMessageDispatcher.h"
11 #include "DHTRoutingTable.h"
12 #include "bencode2.h"
13
14 namespace aria2 {
15
16 class DHTFindNodeMessageTest : public CppUnit::TestFixture {
17
18 CPPUNIT_TEST_SUITE(DHTFindNodeMessageTest);
19 CPPUNIT_TEST(testGetBencodedMessage);
20 CPPUNIT_TEST(testDoReceivedAction);
21 CPPUNIT_TEST_SUITE_END();
22
23 public:
24 std::shared_ptr<DHTNode> localNode_;
25 std::shared_ptr<DHTNode> remoteNode_;
26
setUp()27 void setUp()
28 {
29 localNode_ = std::make_shared<DHTNode>();
30 remoteNode_ = std::make_shared<DHTNode>();
31 }
32
tearDown()33 void tearDown() {}
34
35 void testGetBencodedMessage();
36 void testDoReceivedAction();
37
38 class MockDHTMessageFactory2 : public MockDHTMessageFactory {
39 public:
createFindNodeReplyMessage(const std::shared_ptr<DHTNode> & remoteNode,std::vector<std::shared_ptr<DHTNode>> closestKNodes,const std::string & transactionID)40 virtual std::unique_ptr<DHTFindNodeReplyMessage> createFindNodeReplyMessage(
41 const std::shared_ptr<DHTNode>& remoteNode,
42 std::vector<std::shared_ptr<DHTNode>> closestKNodes,
43 const std::string& transactionID) CXX11_OVERRIDE
44 {
45 auto m = make_unique<DHTFindNodeReplyMessage>(AF_INET, localNode_,
46 remoteNode, transactionID);
47 m->setClosestKNodes(std::move(closestKNodes));
48 return m;
49 }
50 };
51 };
52
53 CPPUNIT_TEST_SUITE_REGISTRATION(DHTFindNodeMessageTest);
54
testGetBencodedMessage()55 void DHTFindNodeMessageTest::testGetBencodedMessage()
56 {
57 unsigned char tid[DHT_TRANSACTION_ID_LENGTH];
58 util::generateRandomData(tid, DHT_TRANSACTION_ID_LENGTH);
59 std::string transactionID(&tid[0], &tid[DHT_TRANSACTION_ID_LENGTH]);
60
61 auto targetNode = std::make_shared<DHTNode>();
62
63 DHTFindNodeMessage msg(localNode_, remoteNode_, targetNode->getID(),
64 transactionID);
65 msg.setVersion("A200");
66 std::string msgbody = msg.getBencodedMessage();
67
68 Dict dict;
69 dict.put("t", transactionID);
70 dict.put("v", "A200");
71 dict.put("y", "q");
72 dict.put("q", "find_node");
73 auto aDict = Dict::g();
74 aDict->put("id", String::g(localNode_->getID(), DHT_ID_LENGTH));
75 aDict->put("target", String::g(targetNode->getID(), DHT_ID_LENGTH));
76 dict.put("a", std::move(aDict));
77
78 CPPUNIT_ASSERT_EQUAL(bencode2::encode(&dict), msgbody);
79 }
80
testDoReceivedAction()81 void DHTFindNodeMessageTest::testDoReceivedAction()
82 {
83 unsigned char tid[DHT_TRANSACTION_ID_LENGTH];
84 util::generateRandomData(tid, DHT_TRANSACTION_ID_LENGTH);
85 std::string transactionID(&tid[0], &tid[DHT_TRANSACTION_ID_LENGTH]);
86
87 auto targetNode = std::make_shared<DHTNode>();
88
89 MockDHTMessageDispatcher dispatcher;
90 MockDHTMessageFactory2 factory;
91 factory.setLocalNode(localNode_);
92 DHTRoutingTable routingTable(localNode_);
93 routingTable.addNode(targetNode);
94
95 DHTFindNodeMessage msg(localNode_, remoteNode_, targetNode->getID(),
96 transactionID);
97 msg.setMessageDispatcher(&dispatcher);
98 msg.setMessageFactory(&factory);
99 msg.setRoutingTable(&routingTable);
100
101 msg.doReceivedAction();
102
103 CPPUNIT_ASSERT_EQUAL((size_t)1, dispatcher.messageQueue_.size());
104 auto m = dynamic_cast<DHTFindNodeReplyMessage*>(
105 dispatcher.messageQueue_[0].message_.get());
106 CPPUNIT_ASSERT(*localNode_ == *m->getLocalNode());
107 CPPUNIT_ASSERT(*remoteNode_ == *m->getRemoteNode());
108 CPPUNIT_ASSERT_EQUAL(std::string("find_node"), m->getMessageType());
109 CPPUNIT_ASSERT_EQUAL(msg.getTransactionID(), m->getTransactionID());
110 CPPUNIT_ASSERT_EQUAL((size_t)1, m->getClosestKNodes().size());
111 }
112
113 } // namespace aria2
114