DHTBucketTest.cc 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452
  1. #include "DHTBucket.h"
  2. #include <cstring>
  3. #include <algorithm>
  4. #include <cppunit/extensions/HelperMacros.h>
  5. #include "DHTNode.h"
  6. #include "Exception.h"
  7. #include "util.h"
  8. namespace aria2 {
  9. class DHTBucketTest : public CppUnit::TestFixture {
  10. CPPUNIT_TEST_SUITE(DHTBucketTest);
  11. CPPUNIT_TEST(testGetRandomNodeID);
  12. CPPUNIT_TEST(testIsInRange);
  13. CPPUNIT_TEST(testSplitAllowed);
  14. CPPUNIT_TEST(testSplit);
  15. CPPUNIT_TEST(testAddNode);
  16. CPPUNIT_TEST(testMoveToHead);
  17. CPPUNIT_TEST(testMoveToTail);
  18. CPPUNIT_TEST(testGetGoodNodes);
  19. CPPUNIT_TEST(testCacheNode);
  20. CPPUNIT_TEST(testDropNode);
  21. CPPUNIT_TEST(testGetNode);
  22. CPPUNIT_TEST_SUITE_END();
  23. public:
  24. void setUp() {}
  25. void tearDown() {}
  26. void testGetRandomNodeID();
  27. void testIsInRange();
  28. void testSplitAllowed();
  29. void testSplit();
  30. void testAddNode();
  31. void testMoveToHead();
  32. void testMoveToTail();
  33. void testGetGoodNodes();
  34. void testCacheNode();
  35. void testDropNode();
  36. void testGetNode();
  37. };
  38. CPPUNIT_TEST_SUITE_REGISTRATION(DHTBucketTest);
  39. void DHTBucketTest::testGetRandomNodeID()
  40. {
  41. unsigned char localNodeID[] = {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  42. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  43. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  44. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  45. {
  46. DHTBucket bucket(localNode);
  47. unsigned char nodeID[DHT_ID_LENGTH];
  48. bucket.getRandomNodeID(nodeID);
  49. }
  50. {
  51. unsigned char max[] = {0x01, 0x01, 0xff, 0xff, 0xff, 0xff, 0xff,
  52. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
  53. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
  54. unsigned char min[] = {0x01, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00,
  55. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  56. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  57. DHTBucket bucket(16, max, min, localNode);
  58. unsigned char nodeID[DHT_ID_LENGTH];
  59. bucket.getRandomNodeID(nodeID);
  60. CPPUNIT_ASSERT_EQUAL(std::string("0101"),
  61. util::toHex(nodeID, sizeof(nodeID)).substr(0, 4));
  62. }
  63. }
  64. void DHTBucketTest::testIsInRange()
  65. {
  66. unsigned char localNodeID[] = {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  67. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  68. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  69. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  70. {
  71. unsigned char nodeID[] = {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  72. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  73. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  74. std::shared_ptr<DHTNode> node(new DHTNode(nodeID));
  75. DHTBucket bucket(localNode);
  76. CPPUNIT_ASSERT(bucket.isInRange(node));
  77. memset(nodeID, 0xff, sizeof(nodeID));
  78. CPPUNIT_ASSERT(bucket.isInRange(node));
  79. }
  80. {
  81. unsigned char max[] = {0x01, 0x01, 0xff, 0xff, 0xff, 0xff, 0xff,
  82. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
  83. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
  84. unsigned char min[] = {0x01, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00,
  85. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  86. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  87. {
  88. // min
  89. unsigned char nodeID[] = {0x01, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00,
  90. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  91. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  92. std::shared_ptr<DHTNode> node(new DHTNode(nodeID));
  93. DHTBucket bucket(16, max, min, localNode);
  94. CPPUNIT_ASSERT(bucket.isInRange(node));
  95. }
  96. {
  97. // max
  98. unsigned char nodeID[] = {0x01, 0x01, 0xff, 0xff, 0xff, 0xff, 0xff,
  99. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
  100. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
  101. std::shared_ptr<DHTNode> node(new DHTNode(nodeID));
  102. DHTBucket bucket(16, max, min, localNode);
  103. CPPUNIT_ASSERT(bucket.isInRange(node));
  104. }
  105. {
  106. unsigned char nodeID[] = {0x01, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00,
  107. 0x00, 0x00, 0x00, 0xff, 0xff, 0xff, 0xff,
  108. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
  109. std::shared_ptr<DHTNode> node(new DHTNode(nodeID));
  110. DHTBucket bucket(16, max, min, localNode);
  111. CPPUNIT_ASSERT(bucket.isInRange(node));
  112. }
  113. {
  114. // nodeID is out of range: smaller than this range
  115. unsigned char nodeID[] = {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  116. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  117. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  118. std::shared_ptr<DHTNode> node(new DHTNode(nodeID));
  119. DHTBucket bucket(16, max, min, localNode);
  120. CPPUNIT_ASSERT(!bucket.isInRange(node));
  121. }
  122. {
  123. // nodeID is out of range: larger than this range
  124. unsigned char nodeID[] = {0x01, 0x02, 0xff, 0xff, 0xff, 0xff, 0xff,
  125. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
  126. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
  127. std::shared_ptr<DHTNode> node(new DHTNode(nodeID));
  128. DHTBucket bucket(16, max, min, localNode);
  129. CPPUNIT_ASSERT(!bucket.isInRange(node));
  130. }
  131. }
  132. }
  133. void DHTBucketTest::testSplitAllowed()
  134. {
  135. {
  136. unsigned char localNodeID[] = {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  137. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  138. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  139. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  140. DHTBucket bucket(localNode);
  141. CPPUNIT_ASSERT(bucket.splitAllowed());
  142. }
  143. {
  144. unsigned char max[] = {0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
  145. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
  146. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
  147. unsigned char min[] = {0xe0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  148. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  149. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  150. {
  151. unsigned char localNodeID[] = {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  152. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  153. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  154. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  155. DHTBucket bucket(3, max, min, localNode);
  156. CPPUNIT_ASSERT(!bucket.splitAllowed());
  157. }
  158. {
  159. unsigned char localNodeID[] = {0xe0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  160. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  161. 0x00, 0x00, 0x00, 0x00, 0x00, 0x01};
  162. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  163. DHTBucket bucket(3, max, min, localNode);
  164. CPPUNIT_ASSERT(bucket.splitAllowed());
  165. }
  166. }
  167. }
  168. void DHTBucketTest::testSplit()
  169. {
  170. {
  171. unsigned char localNodeID[DHT_ID_LENGTH];
  172. memset(localNodeID, 0, DHT_ID_LENGTH);
  173. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  174. {
  175. DHTBucket bucket(localNode);
  176. std::shared_ptr<DHTBucket> r = bucket.split();
  177. {
  178. unsigned char expectedRMax[] = {
  179. 0x7f, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
  180. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
  181. unsigned char expectedRMin[DHT_ID_LENGTH];
  182. memset(expectedRMin, 0, DHT_ID_LENGTH);
  183. CPPUNIT_ASSERT_EQUAL(util::toHex(expectedRMax, DHT_ID_LENGTH),
  184. util::toHex(r->getMaxID(), DHT_ID_LENGTH));
  185. CPPUNIT_ASSERT_EQUAL(util::toHex(expectedRMin, DHT_ID_LENGTH),
  186. util::toHex(r->getMinID(), DHT_ID_LENGTH));
  187. CPPUNIT_ASSERT_EQUAL((size_t)1, r->getPrefixLength());
  188. }
  189. {
  190. unsigned char expectedLMax[DHT_ID_LENGTH];
  191. memset(expectedLMax, 0xff, DHT_ID_LENGTH);
  192. unsigned char expectedLMin[] = {
  193. 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  194. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  195. CPPUNIT_ASSERT_EQUAL(util::toHex(expectedLMax, DHT_ID_LENGTH),
  196. util::toHex(bucket.getMaxID(), DHT_ID_LENGTH));
  197. CPPUNIT_ASSERT_EQUAL(util::toHex(expectedLMin, DHT_ID_LENGTH),
  198. util::toHex(bucket.getMinID(), DHT_ID_LENGTH));
  199. CPPUNIT_ASSERT_EQUAL((size_t)1, bucket.getPrefixLength());
  200. }
  201. }
  202. {
  203. std::shared_ptr<DHTBucket> bucket(new DHTBucket(localNode));
  204. for (int i = 0; i < 159; ++i) {
  205. CPPUNIT_ASSERT(bucket->splitAllowed());
  206. std::shared_ptr<DHTBucket> t = bucket;
  207. bucket = bucket->split();
  208. CPPUNIT_ASSERT(!t->splitAllowed());
  209. }
  210. CPPUNIT_ASSERT(!bucket->splitAllowed());
  211. unsigned char expectedMax[] = {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  212. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  213. 0x00, 0x00, 0x00, 0x00, 0x00, 0x01};
  214. unsigned char expectedMin[DHT_ID_LENGTH];
  215. memset(expectedMin, 0, DHT_ID_LENGTH);
  216. CPPUNIT_ASSERT_EQUAL(util::toHex(expectedMax, DHT_ID_LENGTH),
  217. util::toHex(bucket->getMaxID(), DHT_ID_LENGTH));
  218. CPPUNIT_ASSERT_EQUAL(util::toHex(expectedMin, DHT_ID_LENGTH),
  219. util::toHex(bucket->getMinID(), DHT_ID_LENGTH));
  220. CPPUNIT_ASSERT_EQUAL((size_t)159, bucket->getPrefixLength());
  221. }
  222. }
  223. {
  224. unsigned char localNodeID[DHT_ID_LENGTH];
  225. memset(localNodeID, 0, DHT_ID_LENGTH);
  226. localNodeID[0] = 0x80;
  227. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  228. DHTBucket bucket(localNode);
  229. std::shared_ptr<DHTBucket> r = bucket.split();
  230. {
  231. unsigned char expectedRMax[] = {0x7f, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
  232. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
  233. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
  234. unsigned char expectedRMin[DHT_ID_LENGTH];
  235. memset(expectedRMin, 0, DHT_ID_LENGTH);
  236. CPPUNIT_ASSERT_EQUAL(util::toHex(expectedRMax, DHT_ID_LENGTH),
  237. util::toHex(r->getMaxID(), DHT_ID_LENGTH));
  238. CPPUNIT_ASSERT_EQUAL(util::toHex(expectedRMin, DHT_ID_LENGTH),
  239. util::toHex(r->getMinID(), DHT_ID_LENGTH));
  240. CPPUNIT_ASSERT_EQUAL((size_t)1, r->getPrefixLength());
  241. }
  242. {
  243. unsigned char expectedLMax[DHT_ID_LENGTH];
  244. memset(expectedLMax, 0xff, DHT_ID_LENGTH);
  245. unsigned char expectedLMin[] = {0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  246. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  247. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
  248. CPPUNIT_ASSERT_EQUAL(util::toHex(expectedLMax, DHT_ID_LENGTH),
  249. util::toHex(bucket.getMaxID(), DHT_ID_LENGTH));
  250. CPPUNIT_ASSERT_EQUAL(util::toHex(expectedLMin, DHT_ID_LENGTH),
  251. util::toHex(bucket.getMinID(), DHT_ID_LENGTH));
  252. CPPUNIT_ASSERT_EQUAL((size_t)1, bucket.getPrefixLength());
  253. }
  254. }
  255. }
  256. namespace {
  257. void createID(unsigned char* id, unsigned char firstChar,
  258. unsigned char lastChar)
  259. {
  260. memset(id, 0, DHT_ID_LENGTH);
  261. id[0] = firstChar;
  262. id[DHT_ID_LENGTH - 1] = lastChar;
  263. }
  264. } // namespace
  265. void DHTBucketTest::testAddNode()
  266. {
  267. unsigned char localNodeID[DHT_ID_LENGTH];
  268. memset(localNodeID, 0, DHT_ID_LENGTH);
  269. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  270. DHTBucket bucket(localNode);
  271. unsigned char id[DHT_ID_LENGTH];
  272. std::shared_ptr<DHTNode> nodes[8];
  273. for (size_t i = 0; i < DHTBucket::K; ++i) {
  274. createID(id, 0xf0, i);
  275. nodes[i].reset(new DHTNode(id));
  276. CPPUNIT_ASSERT(bucket.addNode(nodes[i]));
  277. }
  278. createID(id, 0xf0, 0xff);
  279. std::shared_ptr<DHTNode> newNode(new DHTNode(id));
  280. CPPUNIT_ASSERT(!bucket.addNode(newNode));
  281. // nodes[0] is located at the tail of the bucket(least recent seen)
  282. nodes[0]->markBad();
  283. CPPUNIT_ASSERT(bucket.addNode(newNode));
  284. CPPUNIT_ASSERT(*bucket.getNodes().back() == *newNode);
  285. }
  286. void DHTBucketTest::testMoveToHead()
  287. {
  288. unsigned char localNodeID[DHT_ID_LENGTH];
  289. memset(localNodeID, 0, DHT_ID_LENGTH);
  290. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  291. DHTBucket bucket(localNode);
  292. unsigned char id[DHT_ID_LENGTH];
  293. std::shared_ptr<DHTNode> nodes[8];
  294. for (size_t i = 0; i < DHTBucket::K; ++i) {
  295. createID(id, 0xf0, i);
  296. nodes[i].reset(new DHTNode(id));
  297. CPPUNIT_ASSERT(bucket.addNode(nodes[i]));
  298. }
  299. bucket.moveToHead(nodes[DHTBucket::K - 1]);
  300. CPPUNIT_ASSERT(*bucket.getNodes().front() == *nodes[DHTBucket::K - 1]);
  301. }
  302. void DHTBucketTest::testMoveToTail()
  303. {
  304. unsigned char localNodeID[DHT_ID_LENGTH];
  305. memset(localNodeID, 0, DHT_ID_LENGTH);
  306. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  307. DHTBucket bucket(localNode);
  308. unsigned char id[DHT_ID_LENGTH];
  309. std::shared_ptr<DHTNode> nodes[8];
  310. for (size_t i = 0; i < DHTBucket::K; ++i) {
  311. createID(id, 0xf0, i);
  312. nodes[i].reset(new DHTNode(id));
  313. CPPUNIT_ASSERT(bucket.addNode(nodes[i]));
  314. }
  315. bucket.moveToTail(nodes[0]);
  316. CPPUNIT_ASSERT(*bucket.getNodes().back() == *nodes[0]);
  317. }
  318. void DHTBucketTest::testGetGoodNodes()
  319. {
  320. unsigned char localNodeID[DHT_ID_LENGTH];
  321. memset(localNodeID, 0, DHT_ID_LENGTH);
  322. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  323. DHTBucket bucket(localNode);
  324. unsigned char id[DHT_ID_LENGTH];
  325. std::shared_ptr<DHTNode> nodes[8];
  326. for (size_t i = 0; i < DHTBucket::K; ++i) {
  327. createID(id, 0xf0, i);
  328. nodes[i].reset(new DHTNode(id));
  329. nodes[i]->setPort(6881 + i);
  330. CPPUNIT_ASSERT(bucket.addNode(nodes[i]));
  331. }
  332. nodes[3]->markBad();
  333. nodes[5]->markBad();
  334. std::vector<std::shared_ptr<DHTNode>> goodNodes;
  335. bucket.getGoodNodes(goodNodes);
  336. CPPUNIT_ASSERT_EQUAL((size_t)6, goodNodes.size());
  337. CPPUNIT_ASSERT_EQUAL((uint16_t)6881, goodNodes[0]->getPort());
  338. CPPUNIT_ASSERT_EQUAL((uint16_t)6882, goodNodes[1]->getPort());
  339. CPPUNIT_ASSERT_EQUAL((uint16_t)6883, goodNodes[2]->getPort());
  340. CPPUNIT_ASSERT_EQUAL((uint16_t)6885, goodNodes[3]->getPort());
  341. CPPUNIT_ASSERT_EQUAL((uint16_t)6887, goodNodes[4]->getPort());
  342. CPPUNIT_ASSERT_EQUAL((uint16_t)6888, goodNodes[5]->getPort());
  343. }
  344. void DHTBucketTest::testCacheNode()
  345. {
  346. unsigned char localNodeID[DHT_ID_LENGTH];
  347. memset(localNodeID, 0, DHT_ID_LENGTH);
  348. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  349. DHTBucket bucket(localNode);
  350. std::shared_ptr<DHTNode> n1(new DHTNode());
  351. std::shared_ptr<DHTNode> n2(new DHTNode());
  352. std::shared_ptr<DHTNode> n3(new DHTNode());
  353. bucket.cacheNode(n1);
  354. bucket.cacheNode(n2);
  355. CPPUNIT_ASSERT_EQUAL((size_t)2, bucket.getCachedNodes().size());
  356. CPPUNIT_ASSERT(*n2 == *bucket.getCachedNodes()[0]);
  357. bucket.cacheNode(n3);
  358. CPPUNIT_ASSERT_EQUAL((size_t)2, bucket.getCachedNodes().size());
  359. CPPUNIT_ASSERT(*n3 == *bucket.getCachedNodes()[0]);
  360. CPPUNIT_ASSERT(*n2 == *bucket.getCachedNodes()[1]);
  361. }
  362. void DHTBucketTest::testDropNode()
  363. {
  364. unsigned char localNodeID[DHT_ID_LENGTH];
  365. memset(localNodeID, 0, DHT_ID_LENGTH);
  366. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  367. DHTBucket bucket(localNode);
  368. unsigned char id[DHT_ID_LENGTH];
  369. std::shared_ptr<DHTNode> nodes[8];
  370. for (size_t i = 0; i < DHTBucket::K; ++i) {
  371. createID(id, 0xf0, i);
  372. nodes[i].reset(new DHTNode(id));
  373. nodes[i]->setPort(6881 + i);
  374. CPPUNIT_ASSERT(bucket.addNode(nodes[i]));
  375. }
  376. std::shared_ptr<DHTNode> cachedNode1(new DHTNode());
  377. std::shared_ptr<DHTNode> cachedNode2(new DHTNode());
  378. bucket.dropNode(nodes[3]);
  379. // nothing happens because the replacement cache is empty.
  380. {
  381. std::deque<std::shared_ptr<DHTNode>> tnodes = bucket.getNodes();
  382. CPPUNIT_ASSERT_EQUAL((size_t)8, tnodes.size());
  383. CPPUNIT_ASSERT(*nodes[3] == *tnodes[3]);
  384. }
  385. bucket.cacheNode(cachedNode1);
  386. bucket.cacheNode(cachedNode2);
  387. bucket.dropNode(nodes[3]);
  388. {
  389. std::deque<std::shared_ptr<DHTNode>> tnodes = bucket.getNodes();
  390. CPPUNIT_ASSERT_EQUAL((size_t)8, tnodes.size());
  391. CPPUNIT_ASSERT(tnodes.end() == std::find_if(tnodes.begin(), tnodes.end(),
  392. derefEqual(nodes[3])));
  393. CPPUNIT_ASSERT(*cachedNode2 == *tnodes[7]);
  394. }
  395. CPPUNIT_ASSERT_EQUAL((size_t)1, bucket.getCachedNodes().size());
  396. CPPUNIT_ASSERT(*cachedNode1 == *bucket.getCachedNodes()[0]);
  397. }
  398. void DHTBucketTest::testGetNode()
  399. {
  400. unsigned char localNodeID[DHT_ID_LENGTH];
  401. memset(localNodeID, 0, DHT_ID_LENGTH);
  402. std::shared_ptr<DHTNode> localNode(new DHTNode(localNodeID));
  403. DHTBucket bucket(localNode);
  404. unsigned char id[DHT_ID_LENGTH];
  405. createID(id, 0xf0, 0);
  406. std::shared_ptr<DHTNode> node(new DHTNode(id));
  407. node->setIPAddress("192.168.0.1");
  408. node->setPort(6881);
  409. CPPUNIT_ASSERT(bucket.addNode(node));
  410. CPPUNIT_ASSERT(bucket.getNode(id, "192.168.0.1", 6881));
  411. CPPUNIT_ASSERT(!bucket.getNode(id, "192.168.0.2", 6881));
  412. CPPUNIT_ASSERT(!bucket.getNode(id, "192.168.0.1", 6882));
  413. CPPUNIT_ASSERT(!bucket.getNode(localNodeID, "192.168.0.1", 6881));
  414. }
  415. } // namespace aria2