DHTFindNodeMessageTest.cc 3.5 KB

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