DHTFindNodeMessageTest.cc 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113
  1. #include "DHTFindNodeMessage.h"
  2. #include "DHTNode.h"
  3. #include "DHTUtil.h"
  4. #include "BencodeVisitor.h"
  5. #include "Dictionary.h"
  6. #include "Data.h"
  7. #include "Exception.h"
  8. #include "Util.h"
  9. #include "MockDHTMessageFactory.h"
  10. #include "MockDHTMessage.h"
  11. #include "MockDHTMessageDispatcher.h"
  12. #include "DHTRoutingTable.h"
  13. #include <cppunit/extensions/HelperMacros.h>
  14. namespace aria2 {
  15. class DHTFindNodeMessageTest:public CppUnit::TestFixture {
  16. CPPUNIT_TEST_SUITE(DHTFindNodeMessageTest);
  17. CPPUNIT_TEST(testGetBencodedMessage);
  18. CPPUNIT_TEST(testDoReceivedAction);
  19. CPPUNIT_TEST_SUITE_END();
  20. public:
  21. void setUp() {}
  22. void tearDown() {}
  23. void testGetBencodedMessage();
  24. void testDoReceivedAction();
  25. class MockDHTMessageFactory2:public MockDHTMessageFactory {
  26. public:
  27. virtual SharedHandle<DHTMessage>
  28. createFindNodeReplyMessage(const SharedHandle<DHTNode>& remoteNode,
  29. const std::deque<SharedHandle<DHTNode> >& closestKNodes,
  30. const std::string& transactionID)
  31. {
  32. SharedHandle<MockDHTMessage> m
  33. (new MockDHTMessage(_localNode, remoteNode, "find_node", transactionID));
  34. m->_nodes = closestKNodes;
  35. return m;
  36. }
  37. };
  38. };
  39. CPPUNIT_TEST_SUITE_REGISTRATION(DHTFindNodeMessageTest);
  40. void DHTFindNodeMessageTest::testGetBencodedMessage()
  41. {
  42. SharedHandle<DHTNode> localNode(new DHTNode());
  43. SharedHandle<DHTNode> remoteNode(new DHTNode());
  44. unsigned char tid[DHT_TRANSACTION_ID_LENGTH];
  45. DHTUtil::generateRandomData(tid, DHT_TRANSACTION_ID_LENGTH);
  46. std::string transactionID(&tid[0], &tid[DHT_TRANSACTION_ID_LENGTH]);
  47. SharedHandle<DHTNode> targetNode(new DHTNode());
  48. DHTFindNodeMessage msg(localNode, remoteNode, targetNode->getID(), transactionID);
  49. std::string msgbody = msg.getBencodedMessage();
  50. SharedHandle<Dictionary> cm(new Dictionary());
  51. cm->put("t", new Data(transactionID));
  52. cm->put("y", new Data("q"));
  53. cm->put("q", new Data("find_node"));
  54. Dictionary* a = new Dictionary();
  55. cm->put("a", a);
  56. a->put("id", new Data(localNode->getID(), DHT_ID_LENGTH));
  57. a->put("target", new Data(targetNode->getID(), DHT_ID_LENGTH));
  58. BencodeVisitor v;
  59. cm->accept(&v);
  60. CPPUNIT_ASSERT_EQUAL(v.getBencodedData(), msgbody);
  61. }
  62. void DHTFindNodeMessageTest::testDoReceivedAction()
  63. {
  64. SharedHandle<DHTNode> localNode(new DHTNode());
  65. SharedHandle<DHTNode> remoteNode(new DHTNode());
  66. unsigned char tid[DHT_TRANSACTION_ID_LENGTH];
  67. DHTUtil::generateRandomData(tid, DHT_TRANSACTION_ID_LENGTH);
  68. std::string transactionID(&tid[0], &tid[DHT_TRANSACTION_ID_LENGTH]);
  69. SharedHandle<DHTNode> targetNode(new 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(), transactionID);
  76. msg.setMessageDispatcher(WeakHandle<DHTMessageDispatcher>(&dispatcher));
  77. msg.setMessageFactory(WeakHandle<DHTMessageFactory>(&factory));
  78. msg.setRoutingTable(WeakHandle<DHTRoutingTable>(&routingTable));
  79. msg.doReceivedAction();
  80. CPPUNIT_ASSERT_EQUAL((size_t)1, dispatcher._messageQueue.size());
  81. SharedHandle<MockDHTMessage> m
  82. (dynamic_pointer_cast<MockDHTMessage>(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