BitfieldManTest.cc 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818
  1. #include "BitfieldMan.h"
  2. #include <cstring>
  3. #include <vector>
  4. #include <cppunit/extensions/HelperMacros.h>
  5. #include "bitfield.h"
  6. #include "array_fun.h"
  7. namespace aria2 {
  8. class BitfieldManTest : public CppUnit::TestFixture {
  9. CPPUNIT_TEST_SUITE(BitfieldManTest);
  10. CPPUNIT_TEST(testGetBlockSize);
  11. CPPUNIT_TEST(testGetFirstMissingUnusedIndex);
  12. CPPUNIT_TEST(testGetFirstMissingIndex);
  13. CPPUNIT_TEST(testIsAllBitSet);
  14. CPPUNIT_TEST(testFilter);
  15. CPPUNIT_TEST(testIsFilterBitSet);
  16. CPPUNIT_TEST(testAddFilter_zeroLength);
  17. CPPUNIT_TEST(testAddNotFilter);
  18. CPPUNIT_TEST(testAddNotFilter_zeroLength);
  19. CPPUNIT_TEST(testAddNotFilter_overflow);
  20. CPPUNIT_TEST(testGetSparseMissingUnusedIndex);
  21. CPPUNIT_TEST(testGetSparseMissingUnusedIndex_setBit);
  22. CPPUNIT_TEST(testGetSparseMissingUnusedIndex_withMinSplitSize);
  23. CPPUNIT_TEST(testIsBitSetOffsetRange);
  24. CPPUNIT_TEST(testGetOffsetCompletedLength);
  25. CPPUNIT_TEST(testGetOffsetCompletedLength_largeFile);
  26. CPPUNIT_TEST(testGetMissingUnusedLength);
  27. CPPUNIT_TEST(testSetBitRange);
  28. CPPUNIT_TEST(testGetAllMissingIndexes);
  29. CPPUNIT_TEST(testGetAllMissingIndexes_noarg);
  30. CPPUNIT_TEST(testGetAllMissingIndexes_checkLastByte);
  31. CPPUNIT_TEST(testGetAllMissingUnusedIndexes);
  32. CPPUNIT_TEST(testCountFilteredBlock);
  33. CPPUNIT_TEST(testCountMissingBlock);
  34. CPPUNIT_TEST(testZeroLengthFilter);
  35. CPPUNIT_TEST(testGetFirstNMissingUnusedIndex);
  36. CPPUNIT_TEST(testGetInorderMissingUnusedIndex);
  37. CPPUNIT_TEST(testGetGeomMissingUnusedIndex);
  38. CPPUNIT_TEST_SUITE_END();
  39. public:
  40. void testGetBlockSize();
  41. void testGetFirstMissingUnusedIndex();
  42. void testGetFirstMissingIndex();
  43. void testGetAllMissingIndexes();
  44. void testGetAllMissingIndexes_noarg();
  45. void testGetAllMissingIndexes_checkLastByte();
  46. void testGetAllMissingUnusedIndexes();
  47. void testIsAllBitSet();
  48. void testFilter();
  49. void testIsFilterBitSet();
  50. void testAddFilter_zeroLength();
  51. void testAddNotFilter();
  52. void testAddNotFilter_zeroLength();
  53. void testAddNotFilter_overflow();
  54. void testGetSparseMissingUnusedIndex();
  55. void testGetSparseMissingUnusedIndex_setBit();
  56. void testGetSparseMissingUnusedIndex_withMinSplitSize();
  57. void testIsBitSetOffsetRange();
  58. void testGetOffsetCompletedLength();
  59. void testGetOffsetCompletedLength_largeFile();
  60. void testGetMissingUnusedLength();
  61. void testSetBitRange();
  62. void testCountFilteredBlock();
  63. void testCountMissingBlock();
  64. void testZeroLengthFilter();
  65. void testGetFirstNMissingUnusedIndex();
  66. void testGetInorderMissingUnusedIndex();
  67. void testGetGeomMissingUnusedIndex();
  68. };
  69. CPPUNIT_TEST_SUITE_REGISTRATION(BitfieldManTest);
  70. void BitfieldManTest::testGetBlockSize()
  71. {
  72. BitfieldMan bt1(1_k, 10_k);
  73. CPPUNIT_ASSERT_EQUAL((int32_t)1_k, bt1.getBlockLength(9));
  74. BitfieldMan bt2(1_k, 10_k + 1);
  75. CPPUNIT_ASSERT_EQUAL((int32_t)1_k, bt2.getBlockLength(9));
  76. CPPUNIT_ASSERT_EQUAL((int32_t)1, bt2.getBlockLength(10));
  77. CPPUNIT_ASSERT_EQUAL((int32_t)0, bt2.getBlockLength(11));
  78. }
  79. void BitfieldManTest::testGetFirstMissingUnusedIndex()
  80. {
  81. {
  82. BitfieldMan bt1(1_k, 10_k);
  83. {
  84. size_t index;
  85. CPPUNIT_ASSERT(bt1.getFirstMissingUnusedIndex(index));
  86. CPPUNIT_ASSERT_EQUAL((size_t)0, index);
  87. }
  88. bt1.setUseBit(0);
  89. {
  90. size_t index;
  91. CPPUNIT_ASSERT(bt1.getFirstMissingUnusedIndex(index));
  92. CPPUNIT_ASSERT_EQUAL((size_t)1, index);
  93. }
  94. bt1.unsetUseBit(0);
  95. bt1.setBit(0);
  96. {
  97. size_t index;
  98. CPPUNIT_ASSERT(bt1.getFirstMissingUnusedIndex(index));
  99. CPPUNIT_ASSERT_EQUAL((size_t)1, index);
  100. }
  101. bt1.setAllBit();
  102. {
  103. size_t index;
  104. CPPUNIT_ASSERT(!bt1.getFirstMissingUnusedIndex(index));
  105. }
  106. }
  107. {
  108. BitfieldMan bt1(1_k, 10_k);
  109. bt1.addFilter(1_k, 10_k);
  110. bt1.enableFilter();
  111. {
  112. size_t index;
  113. CPPUNIT_ASSERT(bt1.getFirstMissingUnusedIndex(index));
  114. CPPUNIT_ASSERT_EQUAL((size_t)1, index);
  115. }
  116. bt1.setUseBit(1);
  117. {
  118. size_t index;
  119. CPPUNIT_ASSERT(bt1.getFirstMissingUnusedIndex(index));
  120. CPPUNIT_ASSERT_EQUAL((size_t)2, index);
  121. }
  122. bt1.setBit(2);
  123. {
  124. size_t index;
  125. CPPUNIT_ASSERT(bt1.getFirstMissingUnusedIndex(index));
  126. CPPUNIT_ASSERT_EQUAL((size_t)3, index);
  127. }
  128. }
  129. }
  130. void BitfieldManTest::testGetFirstMissingIndex()
  131. {
  132. {
  133. BitfieldMan bt1(1_k, 10_k);
  134. {
  135. size_t index;
  136. CPPUNIT_ASSERT(bt1.getFirstMissingIndex(index));
  137. CPPUNIT_ASSERT_EQUAL((size_t)0, index);
  138. }
  139. bt1.setUseBit(0);
  140. {
  141. size_t index;
  142. CPPUNIT_ASSERT(bt1.getFirstMissingIndex(index));
  143. CPPUNIT_ASSERT_EQUAL((size_t)0, index);
  144. }
  145. bt1.unsetUseBit(0);
  146. bt1.setBit(0);
  147. {
  148. size_t index;
  149. CPPUNIT_ASSERT(bt1.getFirstMissingIndex(index));
  150. CPPUNIT_ASSERT_EQUAL((size_t)1, index);
  151. }
  152. bt1.setAllBit();
  153. {
  154. size_t index;
  155. CPPUNIT_ASSERT(!bt1.getFirstMissingIndex(index));
  156. }
  157. }
  158. {
  159. BitfieldMan bt1(1_k, 10_k);
  160. bt1.addFilter(1_k, 10_k);
  161. bt1.enableFilter();
  162. {
  163. size_t index;
  164. CPPUNIT_ASSERT(bt1.getFirstMissingIndex(index));
  165. CPPUNIT_ASSERT_EQUAL((size_t)1, index);
  166. }
  167. bt1.setUseBit(1);
  168. {
  169. size_t index;
  170. CPPUNIT_ASSERT(bt1.getFirstMissingIndex(index));
  171. CPPUNIT_ASSERT_EQUAL((size_t)1, index);
  172. }
  173. bt1.setBit(1);
  174. {
  175. size_t index;
  176. CPPUNIT_ASSERT(bt1.getFirstMissingIndex(index));
  177. CPPUNIT_ASSERT_EQUAL((size_t)2, index);
  178. }
  179. }
  180. }
  181. void BitfieldManTest::testIsAllBitSet()
  182. {
  183. BitfieldMan bt1(1_k, 10_k);
  184. CPPUNIT_ASSERT(!bt1.isAllBitSet());
  185. bt1.setBit(1);
  186. CPPUNIT_ASSERT(!bt1.isAllBitSet());
  187. for (size_t i = 0; i < 8; i++) {
  188. CPPUNIT_ASSERT(bt1.setBit(i));
  189. }
  190. CPPUNIT_ASSERT(!bt1.isAllBitSet());
  191. for (size_t i = 0; i < bt1.countBlock(); i++) {
  192. CPPUNIT_ASSERT(bt1.setBit(i));
  193. }
  194. CPPUNIT_ASSERT(bt1.isAllBitSet());
  195. BitfieldMan btzero(1_k, 0);
  196. CPPUNIT_ASSERT(btzero.isAllBitSet());
  197. }
  198. void BitfieldManTest::testFilter()
  199. {
  200. BitfieldMan btman(2, 32);
  201. // test offset=4, length=12
  202. btman.addFilter(4, 12);
  203. btman.enableFilter();
  204. std::vector<size_t> out;
  205. CPPUNIT_ASSERT_EQUAL((size_t)6, btman.getFirstNMissingUnusedIndex(out, 32));
  206. const size_t ans[] = {2, 3, 4, 5, 6, 7};
  207. for (size_t i = 0; i < arraySize(ans); ++i) {
  208. CPPUNIT_ASSERT_EQUAL(ans[i], out[i]);
  209. }
  210. CPPUNIT_ASSERT_EQUAL((int64_t)12ULL, btman.getFilteredTotalLength());
  211. // test offset=5, length=2
  212. out.clear();
  213. btman.clearAllBit();
  214. btman.clearAllUseBit();
  215. btman.clearFilter();
  216. btman.addFilter(5, 2);
  217. btman.enableFilter();
  218. CPPUNIT_ASSERT_EQUAL((size_t)2, btman.getFirstNMissingUnusedIndex(out, 32));
  219. CPPUNIT_ASSERT_EQUAL((size_t)2, out[0]);
  220. CPPUNIT_ASSERT_EQUAL((size_t)3, out[1]);
  221. btman.setBit(2);
  222. btman.setBit(3);
  223. CPPUNIT_ASSERT_EQUAL((int64_t)4ULL, btman.getFilteredTotalLength());
  224. CPPUNIT_ASSERT(btman.isFilteredAllBitSet());
  225. BitfieldMan btman2(2, 31);
  226. btman2.addFilter(0, 31);
  227. btman2.enableFilter();
  228. CPPUNIT_ASSERT_EQUAL((int64_t)31ULL, btman2.getFilteredTotalLength());
  229. }
  230. void BitfieldManTest::testIsFilterBitSet()
  231. {
  232. BitfieldMan btman(2, 32);
  233. CPPUNIT_ASSERT(!btman.isFilterBitSet(0));
  234. btman.addFilter(0, 2);
  235. CPPUNIT_ASSERT(btman.isFilterBitSet(0));
  236. CPPUNIT_ASSERT(!btman.isFilterBitSet(1));
  237. btman.addFilter(2, 4);
  238. CPPUNIT_ASSERT(btman.isFilterBitSet(1));
  239. }
  240. void BitfieldManTest::testAddFilter_zeroLength()
  241. {
  242. BitfieldMan bits(1_k, 1_m);
  243. bits.addFilter(2_k, 0);
  244. bits.enableFilter();
  245. CPPUNIT_ASSERT_EQUAL((size_t)0, bits.countMissingBlock());
  246. CPPUNIT_ASSERT(bits.isFilteredAllBitSet());
  247. }
  248. void BitfieldManTest::testAddNotFilter()
  249. {
  250. BitfieldMan btman(2, 32);
  251. btman.addNotFilter(3, 6);
  252. CPPUNIT_ASSERT(bitfield::test(btman.getFilterBitfield(), 16, 0));
  253. for (size_t i = 1; i < 5; ++i) {
  254. CPPUNIT_ASSERT(!bitfield::test(btman.getFilterBitfield(), 16, i));
  255. }
  256. for (size_t i = 5; i < 16; ++i) {
  257. CPPUNIT_ASSERT(bitfield::test(btman.getFilterBitfield(), 16, i));
  258. }
  259. }
  260. void BitfieldManTest::testAddNotFilter_zeroLength()
  261. {
  262. BitfieldMan btman(2, 6);
  263. btman.addNotFilter(2, 0);
  264. CPPUNIT_ASSERT(!bitfield::test(btman.getFilterBitfield(), 3, 0));
  265. CPPUNIT_ASSERT(!bitfield::test(btman.getFilterBitfield(), 3, 1));
  266. CPPUNIT_ASSERT(!bitfield::test(btman.getFilterBitfield(), 3, 2));
  267. }
  268. void BitfieldManTest::testAddNotFilter_overflow()
  269. {
  270. BitfieldMan btman(2, 6);
  271. btman.addNotFilter(6, 100);
  272. CPPUNIT_ASSERT(bitfield::test(btman.getFilterBitfield(), 3, 0));
  273. CPPUNIT_ASSERT(bitfield::test(btman.getFilterBitfield(), 3, 1));
  274. CPPUNIT_ASSERT(bitfield::test(btman.getFilterBitfield(), 3, 2));
  275. }
  276. // TODO1.5 add test using ignoreBitfield
  277. void BitfieldManTest::testGetSparseMissingUnusedIndex()
  278. {
  279. BitfieldMan bitfield(1_m, 10_m);
  280. const size_t length = 2;
  281. unsigned char ignoreBitfield[length];
  282. memset(ignoreBitfield, 0, sizeof(ignoreBitfield));
  283. size_t minSplitSize = 1_m;
  284. size_t index;
  285. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  286. ignoreBitfield, length));
  287. CPPUNIT_ASSERT_EQUAL((size_t)0, index);
  288. bitfield.setUseBit(0);
  289. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  290. ignoreBitfield, length));
  291. CPPUNIT_ASSERT_EQUAL((size_t)5, index);
  292. bitfield.setUseBit(5);
  293. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  294. ignoreBitfield, length));
  295. CPPUNIT_ASSERT_EQUAL((size_t)3, index);
  296. bitfield.setUseBit(3);
  297. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  298. ignoreBitfield, length));
  299. CPPUNIT_ASSERT_EQUAL((size_t)8, index);
  300. bitfield.setUseBit(8);
  301. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  302. ignoreBitfield, length));
  303. CPPUNIT_ASSERT_EQUAL((size_t)2, index);
  304. bitfield.setUseBit(2);
  305. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  306. ignoreBitfield, length));
  307. CPPUNIT_ASSERT_EQUAL((size_t)1, index);
  308. bitfield.setUseBit(1);
  309. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  310. ignoreBitfield, length));
  311. CPPUNIT_ASSERT_EQUAL((size_t)4, index);
  312. bitfield.setUseBit(4);
  313. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  314. ignoreBitfield, length));
  315. CPPUNIT_ASSERT_EQUAL((size_t)7, index);
  316. bitfield.setUseBit(7);
  317. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  318. ignoreBitfield, length));
  319. CPPUNIT_ASSERT_EQUAL((size_t)6, index);
  320. bitfield.setUseBit(6);
  321. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  322. ignoreBitfield, length));
  323. CPPUNIT_ASSERT_EQUAL((size_t)9, index);
  324. bitfield.setUseBit(9);
  325. CPPUNIT_ASSERT(!bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  326. ignoreBitfield, length));
  327. }
  328. void BitfieldManTest::testGetSparseMissingUnusedIndex_setBit()
  329. {
  330. BitfieldMan bitfield(1_m, 10_m);
  331. const size_t length = 2;
  332. unsigned char ignoreBitfield[length];
  333. memset(ignoreBitfield, 0, sizeof(ignoreBitfield));
  334. size_t minSplitSize = 1_m;
  335. size_t index;
  336. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  337. ignoreBitfield, length));
  338. CPPUNIT_ASSERT_EQUAL((size_t)0, index);
  339. bitfield.setBit(0);
  340. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  341. ignoreBitfield, length));
  342. CPPUNIT_ASSERT_EQUAL((size_t)1, index);
  343. bitfield.setBit(1);
  344. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  345. ignoreBitfield, length));
  346. CPPUNIT_ASSERT_EQUAL((size_t)2, index);
  347. bitfield.setBit(2);
  348. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  349. ignoreBitfield, length));
  350. CPPUNIT_ASSERT_EQUAL((size_t)3, index);
  351. bitfield.setBit(3);
  352. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  353. ignoreBitfield, length));
  354. CPPUNIT_ASSERT_EQUAL((size_t)4, index);
  355. bitfield.setBit(4);
  356. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  357. ignoreBitfield, length));
  358. CPPUNIT_ASSERT_EQUAL((size_t)5, index);
  359. bitfield.setBit(5);
  360. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  361. ignoreBitfield, length));
  362. CPPUNIT_ASSERT_EQUAL((size_t)6, index);
  363. bitfield.setBit(6);
  364. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  365. ignoreBitfield, length));
  366. CPPUNIT_ASSERT_EQUAL((size_t)7, index);
  367. bitfield.setBit(7);
  368. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  369. ignoreBitfield, length));
  370. CPPUNIT_ASSERT_EQUAL((size_t)8, index);
  371. bitfield.setBit(8);
  372. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  373. ignoreBitfield, length));
  374. CPPUNIT_ASSERT_EQUAL((size_t)9, index);
  375. bitfield.setBit(9);
  376. CPPUNIT_ASSERT(!bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  377. ignoreBitfield, length));
  378. }
  379. void BitfieldManTest::testGetSparseMissingUnusedIndex_withMinSplitSize()
  380. {
  381. BitfieldMan bitfield(1_m, 10_m);
  382. const size_t length = 2;
  383. unsigned char ignoreBitfield[length];
  384. memset(ignoreBitfield, 0, sizeof(ignoreBitfield));
  385. size_t minSplitSize = 2_m;
  386. size_t index;
  387. bitfield.setUseBit(1);
  388. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  389. ignoreBitfield, length));
  390. CPPUNIT_ASSERT_EQUAL((size_t)6, index);
  391. bitfield.setBit(6);
  392. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  393. ignoreBitfield, length));
  394. CPPUNIT_ASSERT_EQUAL((size_t)7, index);
  395. bitfield.setUseBit(7);
  396. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  397. ignoreBitfield, length));
  398. CPPUNIT_ASSERT_EQUAL((size_t)4, index);
  399. bitfield.setBit(4);
  400. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  401. ignoreBitfield, length));
  402. CPPUNIT_ASSERT_EQUAL((size_t)0, index);
  403. bitfield.setBit(0);
  404. CPPUNIT_ASSERT(bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  405. ignoreBitfield, length));
  406. CPPUNIT_ASSERT_EQUAL((size_t)5, index);
  407. bitfield.setBit(5);
  408. CPPUNIT_ASSERT(!bitfield.getSparseMissingUnusedIndex(index, minSplitSize,
  409. ignoreBitfield, length));
  410. }
  411. void BitfieldManTest::testIsBitSetOffsetRange()
  412. {
  413. int64_t totalLength = 4_g;
  414. int32_t pieceLength = 4_m;
  415. BitfieldMan bitfield(pieceLength, totalLength);
  416. bitfield.setAllBit();
  417. CPPUNIT_ASSERT(!bitfield.isBitSetOffsetRange(0, 0));
  418. CPPUNIT_ASSERT(!bitfield.isBitSetOffsetRange(totalLength, 100));
  419. CPPUNIT_ASSERT(!bitfield.isBitSetOffsetRange(totalLength + 1, 100));
  420. CPPUNIT_ASSERT(bitfield.isBitSetOffsetRange(0, totalLength));
  421. CPPUNIT_ASSERT(bitfield.isBitSetOffsetRange(0, totalLength + 1));
  422. bitfield.clearAllBit();
  423. bitfield.setBit(100);
  424. bitfield.setBit(101);
  425. CPPUNIT_ASSERT(
  426. bitfield.isBitSetOffsetRange(pieceLength * 100, pieceLength * 2));
  427. CPPUNIT_ASSERT(
  428. !bitfield.isBitSetOffsetRange(pieceLength * 100 - 10, pieceLength * 2));
  429. CPPUNIT_ASSERT(
  430. !bitfield.isBitSetOffsetRange(pieceLength * 100, pieceLength * 2 + 1));
  431. bitfield.clearAllBit();
  432. bitfield.setBit(100);
  433. bitfield.setBit(102);
  434. CPPUNIT_ASSERT(
  435. !bitfield.isBitSetOffsetRange(pieceLength * 100, pieceLength * 3));
  436. }
  437. void BitfieldManTest::testGetOffsetCompletedLength()
  438. {
  439. BitfieldMan bt(1_k, 20_k);
  440. // 00000|00000|00000|00000
  441. CPPUNIT_ASSERT_EQUAL((int64_t)0, bt.getOffsetCompletedLength(0, 1_k));
  442. CPPUNIT_ASSERT_EQUAL((int64_t)0, bt.getOffsetCompletedLength(0, 0));
  443. for (size_t i = 2; i <= 4; ++i) {
  444. bt.setBit(i);
  445. }
  446. // 00111|00000|00000|00000
  447. CPPUNIT_ASSERT_EQUAL((int64_t)3072, bt.getOffsetCompletedLength(2048, 3072));
  448. CPPUNIT_ASSERT_EQUAL((int64_t)3071, bt.getOffsetCompletedLength(2047, 3072));
  449. CPPUNIT_ASSERT_EQUAL((int64_t)3071, bt.getOffsetCompletedLength(2049, 3072));
  450. CPPUNIT_ASSERT_EQUAL((int64_t)0, bt.getOffsetCompletedLength(2048, 0));
  451. CPPUNIT_ASSERT_EQUAL((int64_t)1, bt.getOffsetCompletedLength(2048, 1));
  452. CPPUNIT_ASSERT_EQUAL((int64_t)0, bt.getOffsetCompletedLength(2047, 1));
  453. CPPUNIT_ASSERT_EQUAL((int64_t)3072, bt.getOffsetCompletedLength(0, 20_k));
  454. CPPUNIT_ASSERT_EQUAL((int64_t)3072,
  455. bt.getOffsetCompletedLength(0, 20_k + 10));
  456. CPPUNIT_ASSERT_EQUAL((int64_t)0, bt.getOffsetCompletedLength(20_k, 1));
  457. }
  458. void BitfieldManTest::testGetOffsetCompletedLength_largeFile()
  459. {
  460. // Test for overflow on 32-bit systems.
  461. // Total 4TiB, 4MiB block
  462. BitfieldMan bt(1 << 22, 1LL << 40);
  463. bt.setBit(1 << 11);
  464. bt.setBit((1 << 11) + 1);
  465. bt.setBit((1 << 11) + 2);
  466. // The last piece is missing:
  467. CPPUNIT_ASSERT_EQUAL((int64_t)bt.getBlockLength() * 3,
  468. bt.getOffsetCompletedLength(1LL << 33, 1 << 24));
  469. // The first piece is missing:
  470. CPPUNIT_ASSERT_EQUAL(
  471. (int64_t)bt.getBlockLength() * 3,
  472. bt.getOffsetCompletedLength((1LL << 33) - bt.getBlockLength(), 1 << 24));
  473. }
  474. void BitfieldManTest::testGetMissingUnusedLength()
  475. {
  476. int64_t totalLength = 10_k + 10;
  477. size_t blockLength = 1_k;
  478. BitfieldMan bf(blockLength, totalLength);
  479. // from index 0 and all blocks are unused and not acquired.
  480. CPPUNIT_ASSERT_EQUAL(totalLength, bf.getMissingUnusedLength(0));
  481. // from index 10 and all blocks are unused and not acquired.
  482. CPPUNIT_ASSERT_EQUAL((int64_t)10ULL, bf.getMissingUnusedLength(10));
  483. // from index 11
  484. CPPUNIT_ASSERT_EQUAL((int64_t)0ULL, bf.getMissingUnusedLength(11));
  485. // from index 12
  486. CPPUNIT_ASSERT_EQUAL((int64_t)0ULL, bf.getMissingUnusedLength(12));
  487. // from index 0 and 5th block is used.
  488. bf.setUseBit(5);
  489. CPPUNIT_ASSERT_EQUAL((int64_t)(5LL * blockLength),
  490. bf.getMissingUnusedLength(0));
  491. // from index 0 and 4th block is acquired.
  492. bf.setBit(4);
  493. CPPUNIT_ASSERT_EQUAL((int64_t)(4LL * blockLength),
  494. bf.getMissingUnusedLength(0));
  495. // from index 1
  496. CPPUNIT_ASSERT_EQUAL((int64_t)(3LL * blockLength),
  497. bf.getMissingUnusedLength(1));
  498. }
  499. void BitfieldManTest::testSetBitRange()
  500. {
  501. size_t blockLength = 1_m;
  502. int64_t totalLength = 10 * blockLength;
  503. BitfieldMan bf(blockLength, totalLength);
  504. bf.setBitRange(0, 4);
  505. for (size_t i = 0; i < 5; ++i) {
  506. CPPUNIT_ASSERT(bf.isBitSet(i));
  507. }
  508. for (size_t i = 5; i < 10; ++i) {
  509. CPPUNIT_ASSERT(!bf.isBitSet(i));
  510. }
  511. CPPUNIT_ASSERT_EQUAL((int64_t)(5LL * blockLength), bf.getCompletedLength());
  512. }
  513. void BitfieldManTest::testGetAllMissingIndexes_noarg()
  514. {
  515. size_t blockLength = 16_k;
  516. int64_t totalLength = 1_m;
  517. size_t nbits = (totalLength + blockLength - 1) / blockLength;
  518. BitfieldMan bf(blockLength, totalLength);
  519. unsigned char misbitfield[8];
  520. CPPUNIT_ASSERT(bf.getAllMissingIndexes(misbitfield, sizeof(misbitfield)));
  521. CPPUNIT_ASSERT_EQUAL((size_t)64, bitfield::countSetBit(misbitfield, nbits));
  522. for (size_t i = 0; i < 63; ++i) {
  523. bf.setBit(i);
  524. }
  525. CPPUNIT_ASSERT(bf.getAllMissingIndexes(misbitfield, sizeof(misbitfield)));
  526. CPPUNIT_ASSERT_EQUAL((size_t)1, bitfield::countSetBit(misbitfield, nbits));
  527. CPPUNIT_ASSERT(bitfield::test(misbitfield, nbits, 63));
  528. }
  529. // See garbage bits of last byte are 0
  530. void BitfieldManTest::testGetAllMissingIndexes_checkLastByte()
  531. {
  532. size_t blockLength = 16_k;
  533. int64_t totalLength = blockLength * 2;
  534. size_t nbits = (totalLength + blockLength - 1) / blockLength;
  535. BitfieldMan bf(blockLength, totalLength);
  536. unsigned char misbitfield[1];
  537. CPPUNIT_ASSERT(bf.getAllMissingIndexes(misbitfield, sizeof(misbitfield)));
  538. CPPUNIT_ASSERT_EQUAL((size_t)2, bitfield::countSetBit(misbitfield, nbits));
  539. CPPUNIT_ASSERT(bitfield::test(misbitfield, nbits, 0));
  540. CPPUNIT_ASSERT(bitfield::test(misbitfield, nbits, 1));
  541. }
  542. void BitfieldManTest::testGetAllMissingIndexes()
  543. {
  544. size_t blockLength = 16_k;
  545. int64_t totalLength = 1_m;
  546. size_t nbits = (totalLength + blockLength - 1) / blockLength;
  547. BitfieldMan bf(blockLength, totalLength);
  548. BitfieldMan peerBf(blockLength, totalLength);
  549. peerBf.setAllBit();
  550. unsigned char misbitfield[8];
  551. CPPUNIT_ASSERT(bf.getAllMissingIndexes(misbitfield, sizeof(misbitfield),
  552. peerBf.getBitfield(),
  553. peerBf.getBitfieldLength()));
  554. CPPUNIT_ASSERT_EQUAL((size_t)64, bitfield::countSetBit(misbitfield, nbits));
  555. for (size_t i = 0; i < 62; ++i) {
  556. bf.setBit(i);
  557. }
  558. peerBf.unsetBit(62);
  559. CPPUNIT_ASSERT(bf.getAllMissingIndexes(misbitfield, sizeof(misbitfield),
  560. peerBf.getBitfield(),
  561. peerBf.getBitfieldLength()));
  562. CPPUNIT_ASSERT_EQUAL((size_t)1, bitfield::countSetBit(misbitfield, nbits));
  563. CPPUNIT_ASSERT(bitfield::test(misbitfield, nbits, 63));
  564. }
  565. void BitfieldManTest::testGetAllMissingUnusedIndexes()
  566. {
  567. size_t blockLength = 16_k;
  568. int64_t totalLength = 1_m;
  569. size_t nbits = (totalLength + blockLength - 1) / blockLength;
  570. BitfieldMan bf(blockLength, totalLength);
  571. BitfieldMan peerBf(blockLength, totalLength);
  572. peerBf.setAllBit();
  573. unsigned char misbitfield[8];
  574. CPPUNIT_ASSERT(bf.getAllMissingUnusedIndexes(misbitfield, sizeof(misbitfield),
  575. peerBf.getBitfield(),
  576. peerBf.getBitfieldLength()));
  577. CPPUNIT_ASSERT_EQUAL((size_t)64, bitfield::countSetBit(misbitfield, nbits));
  578. for (size_t i = 0; i < 61; ++i) {
  579. bf.setBit(i);
  580. }
  581. bf.setUseBit(61);
  582. peerBf.unsetBit(62);
  583. CPPUNIT_ASSERT(bf.getAllMissingUnusedIndexes(misbitfield, sizeof(misbitfield),
  584. peerBf.getBitfield(),
  585. peerBf.getBitfieldLength()));
  586. CPPUNIT_ASSERT_EQUAL((size_t)1, bitfield::countSetBit(misbitfield, nbits));
  587. CPPUNIT_ASSERT(bitfield::test(misbitfield, nbits, 63));
  588. }
  589. void BitfieldManTest::testCountFilteredBlock()
  590. {
  591. BitfieldMan bt(1_k, 256_k);
  592. CPPUNIT_ASSERT_EQUAL((size_t)256, bt.countBlock());
  593. CPPUNIT_ASSERT_EQUAL((size_t)0, bt.countFilteredBlock());
  594. bt.addFilter(1_k, 256_k);
  595. bt.enableFilter();
  596. CPPUNIT_ASSERT_EQUAL((size_t)256, bt.countBlock());
  597. CPPUNIT_ASSERT_EQUAL((size_t)255, bt.countFilteredBlock());
  598. bt.disableFilter();
  599. CPPUNIT_ASSERT_EQUAL((size_t)256, bt.countBlock());
  600. CPPUNIT_ASSERT_EQUAL((size_t)0, bt.countFilteredBlock());
  601. }
  602. void BitfieldManTest::testCountMissingBlock()
  603. {
  604. BitfieldMan bt(1_k, 10_k);
  605. CPPUNIT_ASSERT_EQUAL((size_t)10, bt.countMissingBlock());
  606. bt.setBit(1);
  607. CPPUNIT_ASSERT_EQUAL((size_t)9, bt.countMissingBlock());
  608. bt.setAllBit();
  609. CPPUNIT_ASSERT_EQUAL((size_t)0, bt.countMissingBlock());
  610. }
  611. void BitfieldManTest::testZeroLengthFilter()
  612. {
  613. BitfieldMan bt(1_k, 10_k);
  614. bt.enableFilter();
  615. CPPUNIT_ASSERT_EQUAL((size_t)0, bt.countMissingBlock());
  616. }
  617. void BitfieldManTest::testGetFirstNMissingUnusedIndex()
  618. {
  619. BitfieldMan bt(1_k, 10_k);
  620. bt.setUseBit(1);
  621. bt.setBit(5);
  622. std::vector<size_t> out;
  623. CPPUNIT_ASSERT_EQUAL((size_t)8, bt.getFirstNMissingUnusedIndex(out, 256));
  624. CPPUNIT_ASSERT_EQUAL((size_t)8, out.size());
  625. const size_t ans[] = {0, 2, 3, 4, 6, 7, 8, 9};
  626. for (size_t i = 0; i < out.size(); ++i) {
  627. CPPUNIT_ASSERT_EQUAL(ans[i], out[i]);
  628. }
  629. out.clear();
  630. CPPUNIT_ASSERT_EQUAL((size_t)3, bt.getFirstNMissingUnusedIndex(out, 3));
  631. CPPUNIT_ASSERT_EQUAL((size_t)3, out.size());
  632. for (size_t i = 0; i < out.size(); ++i) {
  633. CPPUNIT_ASSERT_EQUAL(ans[i], out[i]);
  634. }
  635. CPPUNIT_ASSERT_EQUAL((size_t)0, bt.getFirstNMissingUnusedIndex(out, 0));
  636. bt.setAllBit();
  637. CPPUNIT_ASSERT_EQUAL((size_t)0, bt.getFirstNMissingUnusedIndex(out, 10));
  638. bt.clearAllBit();
  639. out.clear();
  640. bt.addFilter(9_k, 1_k);
  641. bt.enableFilter();
  642. CPPUNIT_ASSERT_EQUAL((size_t)1, bt.getFirstNMissingUnusedIndex(out, 256));
  643. CPPUNIT_ASSERT_EQUAL((size_t)1, out.size());
  644. CPPUNIT_ASSERT_EQUAL((size_t)9, out[0]);
  645. }
  646. void BitfieldManTest::testGetInorderMissingUnusedIndex()
  647. {
  648. BitfieldMan bt(1_k, 20_k);
  649. const size_t length = 3;
  650. unsigned char ignoreBitfield[length];
  651. memset(ignoreBitfield, 0, sizeof(ignoreBitfield));
  652. size_t minSplitSize = 1_k;
  653. size_t index;
  654. // 00000|00000|00000|00000
  655. CPPUNIT_ASSERT(bt.getInorderMissingUnusedIndex(index, minSplitSize,
  656. ignoreBitfield, length));
  657. CPPUNIT_ASSERT_EQUAL((size_t)0, index);
  658. bt.setUseBit(0);
  659. // 10000|00000|00000|00000
  660. CPPUNIT_ASSERT(bt.getInorderMissingUnusedIndex(index, minSplitSize,
  661. ignoreBitfield, length));
  662. CPPUNIT_ASSERT_EQUAL((size_t)1, index);
  663. minSplitSize = 2_k;
  664. CPPUNIT_ASSERT(bt.getInorderMissingUnusedIndex(index, minSplitSize,
  665. ignoreBitfield, length));
  666. CPPUNIT_ASSERT_EQUAL((size_t)2, index);
  667. bt.unsetUseBit(0);
  668. bt.setBit(0);
  669. CPPUNIT_ASSERT(bt.getInorderMissingUnusedIndex(index, minSplitSize,
  670. ignoreBitfield, length));
  671. CPPUNIT_ASSERT_EQUAL((size_t)1, index);
  672. bt.setAllBit();
  673. bt.unsetBit(10);
  674. // 11111|11111|01111|11111
  675. CPPUNIT_ASSERT(bt.getInorderMissingUnusedIndex(index, minSplitSize,
  676. ignoreBitfield, length));
  677. CPPUNIT_ASSERT_EQUAL((size_t)10, index);
  678. bt.setUseBit(10);
  679. CPPUNIT_ASSERT(!bt.getInorderMissingUnusedIndex(index, minSplitSize,
  680. ignoreBitfield, length));
  681. bt.unsetUseBit(10);
  682. bt.setAllBit();
  683. // 11111|11111|11111|11111
  684. CPPUNIT_ASSERT(!bt.getInorderMissingUnusedIndex(index, minSplitSize,
  685. ignoreBitfield, length));
  686. bt.clearAllBit();
  687. // 00000|00000|00000|00000
  688. for (int i = 0; i <= 1; ++i) {
  689. bitfield::flipBit(ignoreBitfield, length, i);
  690. }
  691. CPPUNIT_ASSERT(bt.getInorderMissingUnusedIndex(index, minSplitSize,
  692. ignoreBitfield, length));
  693. CPPUNIT_ASSERT_EQUAL((size_t)2, index);
  694. bt.addFilter(3_k, 3_k);
  695. bt.enableFilter();
  696. CPPUNIT_ASSERT(bt.getInorderMissingUnusedIndex(index, minSplitSize,
  697. ignoreBitfield, length));
  698. CPPUNIT_ASSERT_EQUAL((size_t)3, index);
  699. }
  700. void BitfieldManTest::testGetGeomMissingUnusedIndex()
  701. {
  702. BitfieldMan bt(1_k, 20_k);
  703. const size_t length = 3;
  704. unsigned char ignoreBitfield[length];
  705. memset(ignoreBitfield, 0, sizeof(ignoreBitfield));
  706. size_t minSplitSize = 1_k;
  707. size_t index;
  708. // 00000|00000|00000|00000
  709. CPPUNIT_ASSERT(bt.getGeomMissingUnusedIndex(index, minSplitSize,
  710. ignoreBitfield, length, 2, 0));
  711. CPPUNIT_ASSERT_EQUAL((size_t)0, index);
  712. bt.setUseBit(0);
  713. // 10000|00000|00000|00000
  714. CPPUNIT_ASSERT(bt.getGeomMissingUnusedIndex(index, minSplitSize,
  715. ignoreBitfield, length, 2, 0));
  716. CPPUNIT_ASSERT_EQUAL((size_t)1, index);
  717. bt.setUseBit(1);
  718. // 11000|00000|00000|00000
  719. CPPUNIT_ASSERT(bt.getGeomMissingUnusedIndex(index, minSplitSize,
  720. ignoreBitfield, length, 2, 0));
  721. CPPUNIT_ASSERT_EQUAL((size_t)2, index);
  722. bt.setUseBit(2);
  723. // 11100|00000|00000|00000
  724. CPPUNIT_ASSERT(bt.getGeomMissingUnusedIndex(index, minSplitSize,
  725. ignoreBitfield, length, 2, 0));
  726. CPPUNIT_ASSERT_EQUAL((size_t)4, index);
  727. bt.setUseBit(4);
  728. // 11110|00000|00000|00000
  729. CPPUNIT_ASSERT(bt.getGeomMissingUnusedIndex(index, minSplitSize,
  730. ignoreBitfield, length, 2, 0));
  731. CPPUNIT_ASSERT_EQUAL((size_t)8, index);
  732. bt.setUseBit(8);
  733. // 11110|00010|00000|00000
  734. CPPUNIT_ASSERT(bt.getGeomMissingUnusedIndex(index, minSplitSize,
  735. ignoreBitfield, length, 2, 0));
  736. CPPUNIT_ASSERT_EQUAL((size_t)16, index);
  737. bt.setUseBit(16);
  738. // 11110|00010|00000|01000
  739. CPPUNIT_ASSERT(bt.getGeomMissingUnusedIndex(index, minSplitSize,
  740. ignoreBitfield, length, 2, 0));
  741. CPPUNIT_ASSERT_EQUAL((size_t)12, index);
  742. bt.setUseBit(12);
  743. }
  744. } // namespace aria2