DHTRoutingTableTest.cc 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113
  1. #include "DHTRoutingTable.h"
  2. #include <cstring>
  3. #include <cppunit/extensions/HelperMacros.h>
  4. #include "Exception.h"
  5. #include "util.h"
  6. #include "DHTNode.h"
  7. #include "DHTBucket.h"
  8. #include "MockDHTTaskQueue.h"
  9. #include "MockDHTTaskFactory.h"
  10. #include "DHTTask.h"
  11. namespace aria2 {
  12. class DHTRoutingTableTest:public CppUnit::TestFixture {
  13. CPPUNIT_TEST_SUITE(DHTRoutingTableTest);
  14. CPPUNIT_TEST(testAddNode);
  15. CPPUNIT_TEST(testAddNode_localNode);
  16. CPPUNIT_TEST(testGetClosestKNodes);
  17. CPPUNIT_TEST_SUITE_END();
  18. public:
  19. void setUp() {}
  20. void tearDown() {}
  21. void testAddNode();
  22. void testAddNode_localNode();
  23. void testGetClosestKNodes();
  24. };
  25. CPPUNIT_TEST_SUITE_REGISTRATION(DHTRoutingTableTest);
  26. void DHTRoutingTableTest::testAddNode()
  27. {
  28. SharedHandle<DHTNode> localNode(new DHTNode());
  29. DHTRoutingTable table(localNode);
  30. SharedHandle<MockDHTTaskFactory> taskFactory(new MockDHTTaskFactory());
  31. table.setTaskFactory(taskFactory);
  32. SharedHandle<MockDHTTaskQueue> taskQueue(new MockDHTTaskQueue());
  33. table.setTaskQueue(taskQueue);
  34. uint32_t count = 0;
  35. for(int i = 0; i < 100; ++i) {
  36. SharedHandle<DHTNode> node(new DHTNode());
  37. if(table.addNode(node)) {
  38. ++count;
  39. }
  40. }
  41. table.showBuckets();
  42. }
  43. void DHTRoutingTableTest::testAddNode_localNode()
  44. {
  45. SharedHandle<DHTNode> localNode(new DHTNode());
  46. DHTRoutingTable table(localNode);
  47. SharedHandle<MockDHTTaskFactory> taskFactory(new MockDHTTaskFactory());
  48. table.setTaskFactory(taskFactory);
  49. SharedHandle<MockDHTTaskQueue> taskQueue(new MockDHTTaskQueue());
  50. table.setTaskQueue(taskQueue);
  51. SharedHandle<DHTNode> newNode(new DHTNode(localNode->getID()));
  52. CPPUNIT_ASSERT(!table.addNode(newNode));
  53. }
  54. namespace {
  55. void createID(unsigned char* id, unsigned char firstChar, unsigned char lastChar)
  56. {
  57. memset(id, 0, DHT_ID_LENGTH);
  58. id[0] = firstChar;
  59. id[DHT_ID_LENGTH-1] = lastChar;
  60. }
  61. } // namespace
  62. void DHTRoutingTableTest::testGetClosestKNodes()
  63. {
  64. unsigned char id[DHT_ID_LENGTH];
  65. createID(id, 0x81, 0);
  66. SharedHandle<DHTNode> localNode(new DHTNode(id));
  67. DHTRoutingTable table(localNode);
  68. SharedHandle<DHTNode> nodes1[8];
  69. SharedHandle<DHTNode> nodes2[8];
  70. SharedHandle<DHTNode> nodes3[8];
  71. for(size_t i = 0; i < DHTBucket::K; ++i) {
  72. createID(id, 0xf0, i);
  73. nodes1[i].reset(new DHTNode(id));
  74. CPPUNIT_ASSERT(table.addNode(nodes1[i]));
  75. }
  76. for(size_t i = 0; i < DHTBucket::K; ++i) {
  77. createID(id, 0x80, i);
  78. nodes2[i].reset(new DHTNode(id));
  79. CPPUNIT_ASSERT(table.addNode(nodes2[i]));
  80. }
  81. for(size_t i = 0; i < DHTBucket::K; ++i) {
  82. createID(id, 0x70, i);
  83. nodes3[i].reset(new DHTNode(id));
  84. CPPUNIT_ASSERT(table.addNode(nodes3[i]));
  85. }
  86. {
  87. createID(id, 0x80, 0x10);
  88. std::vector<SharedHandle<DHTNode> > nodes;
  89. table.getClosestKNodes(nodes, id);
  90. CPPUNIT_ASSERT_EQUAL((size_t)8, nodes.size());
  91. for(size_t i = 0; i < nodes.size(); ++i) {
  92. CPPUNIT_ASSERT(memcmp(nodes2[0]->getID(), nodes[0]->getID(), DHT_ID_LENGTH) == 0);
  93. }
  94. }
  95. }
  96. } // namespace aria2