DHTBucketTest.cc 17 KB

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