DHTFindNodeMessageTest.cc 3.4 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. void setUp() {}
  19. void tearDown() {}
  20. void testGetBencodedMessage();
  21. void testDoReceivedAction();
  22. class MockDHTMessageFactory2:public MockDHTMessageFactory {
  23. public:
  24. virtual SharedHandle<DHTResponseMessage>
  25. createFindNodeReplyMessage
  26. (const SharedHandle<DHTNode>& remoteNode,
  27. const std::vector<SharedHandle<DHTNode> >& closestKNodes,
  28. const std::string& transactionID)
  29. {
  30. SharedHandle<MockDHTResponseMessage> m
  31. (new MockDHTResponseMessage
  32. (localNode_, remoteNode, "find_node", transactionID));
  33. m->nodes_ = closestKNodes;
  34. return m;
  35. }
  36. };
  37. };
  38. CPPUNIT_TEST_SUITE_REGISTRATION(DHTFindNodeMessageTest);
  39. void DHTFindNodeMessageTest::testGetBencodedMessage()
  40. {
  41. SharedHandle<DHTNode> localNode(new DHTNode());
  42. SharedHandle<DHTNode> remoteNode(new DHTNode());
  43. unsigned char tid[DHT_TRANSACTION_ID_LENGTH];
  44. util::generateRandomData(tid, DHT_TRANSACTION_ID_LENGTH);
  45. std::string transactionID(&tid[0], &tid[DHT_TRANSACTION_ID_LENGTH]);
  46. SharedHandle<DHTNode> targetNode(new DHTNode());
  47. DHTFindNodeMessage msg(localNode, remoteNode, targetNode->getID(), transactionID);
  48. msg.setVersion("A200");
  49. std::string msgbody = msg.getBencodedMessage();
  50. Dict dict;
  51. dict.put("t", transactionID);
  52. dict.put("v", "A200");
  53. dict.put("y", "q");
  54. dict.put("q", "find_node");
  55. SharedHandle<Dict> aDict = Dict::g();
  56. aDict->put("id", String::g(localNode->getID(), DHT_ID_LENGTH));
  57. aDict->put("target", String::g(targetNode->getID(), DHT_ID_LENGTH));
  58. dict.put("a", aDict);
  59. CPPUNIT_ASSERT_EQUAL(bencode2::encode(&dict), msgbody);
  60. }
  61. void DHTFindNodeMessageTest::testDoReceivedAction()
  62. {
  63. SharedHandle<DHTNode> localNode(new DHTNode());
  64. SharedHandle<DHTNode> remoteNode(new DHTNode());
  65. unsigned char tid[DHT_TRANSACTION_ID_LENGTH];
  66. util::generateRandomData(tid, DHT_TRANSACTION_ID_LENGTH);
  67. std::string transactionID(&tid[0], &tid[DHT_TRANSACTION_ID_LENGTH]);
  68. SharedHandle<DHTNode> targetNode(new DHTNode());
  69. MockDHTMessageDispatcher dispatcher;
  70. MockDHTMessageFactory2 factory;
  71. factory.setLocalNode(localNode);
  72. DHTRoutingTable routingTable(localNode);
  73. routingTable.addNode(targetNode);
  74. DHTFindNodeMessage msg(localNode, remoteNode, targetNode->getID(), transactionID);
  75. msg.setMessageDispatcher(&dispatcher);
  76. msg.setMessageFactory(&factory);
  77. msg.setRoutingTable(&routingTable);
  78. msg.doReceivedAction();
  79. CPPUNIT_ASSERT_EQUAL((size_t)1, dispatcher.messageQueue_.size());
  80. SharedHandle<MockDHTResponseMessage> m
  81. (dynamic_pointer_cast<MockDHTResponseMessage>
  82. (dispatcher.messageQueue_[0].message_));
  83. CPPUNIT_ASSERT(*localNode == *m->getLocalNode());
  84. CPPUNIT_ASSERT(*remoteNode == *m->getRemoteNode());
  85. CPPUNIT_ASSERT_EQUAL(std::string("find_node"), m->getMessageType());
  86. CPPUNIT_ASSERT_EQUAL(msg.getTransactionID(), m->getTransactionID());
  87. CPPUNIT_ASSERT_EQUAL((size_t)1, m->nodes_.size());
  88. }
  89. } // namespace aria2