DHTFindNodeMessageTest.cc 1.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
  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 <cppunit/extensions/HelperMacros.h>
  10. class DHTFindNodeMessageTest:public CppUnit::TestFixture {
  11. CPPUNIT_TEST_SUITE(DHTFindNodeMessageTest);
  12. CPPUNIT_TEST(testGetBencodedMessage);
  13. CPPUNIT_TEST_SUITE_END();
  14. public:
  15. void setUp() {}
  16. void tearDown() {}
  17. void testGetBencodedMessage();
  18. };
  19. CPPUNIT_TEST_SUITE_REGISTRATION(DHTFindNodeMessageTest);
  20. void DHTFindNodeMessageTest::testGetBencodedMessage()
  21. {
  22. DHTNodeHandle localNode = new DHTNode();
  23. DHTNodeHandle remoteNode = new DHTNode();
  24. char tid[DHT_TRANSACTION_ID_LENGTH];
  25. DHTUtil::generateRandomData(tid, DHT_TRANSACTION_ID_LENGTH);
  26. string transactionID(&tid[0], &tid[DHT_TRANSACTION_ID_LENGTH]);
  27. DHTNodeHandle targetNode = new DHTNode();
  28. DHTFindNodeMessage msg(localNode, remoteNode, targetNode->getID(), transactionID);
  29. string msgbody = msg.getBencodedMessage();
  30. SharedHandle<Dictionary> cm = new Dictionary();
  31. cm->put("t", new Data(transactionID));
  32. cm->put("y", new Data("q"));
  33. cm->put("q", new Data("find_node"));
  34. Dictionary* a = new Dictionary();
  35. cm->put("a", a);
  36. a->put("id", new Data(reinterpret_cast<const char*>(localNode->getID()), DHT_ID_LENGTH));
  37. a->put("target", new Data(reinterpret_cast<const char*>(targetNode->getID()), DHT_ID_LENGTH));
  38. BencodeVisitor v;
  39. cm->accept(&v);
  40. CPPUNIT_ASSERT_EQUAL(v.getBencodedData(), msgbody);
  41. }