(C) Relatively high density file backups on paper. Cross-platform CLI port of Ollydbg's Paperback from Windows and Borland C.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

bz_compress.cpp 20KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663
  1. /*-------------------------------------------------------------*/
  2. /*--- Compression machinery (not incl block sorting) ---*/
  3. /*--- compress.c ---*/
  4. /*-------------------------------------------------------------*/
  5. /*--
  6. This file is a part of bzip2 and/or libbzip2, a program and
  7. library for lossless, block-sorting data compression.
  8. Copyright (C) 1996-2005 Julian R Seward. All rights reserved.
  9. Redistribution and use in source and binary forms, with or without
  10. modification, are permitted provided that the following conditions
  11. are met:
  12. 1. Redistributions of source code must retain the above copyright
  13. notice, this list of conditions and the following disclaimer.
  14. 2. The origin of this software must not be misrepresented; you must
  15. not claim that you wrote the original software. If you use this
  16. software in a product, an acknowledgment in the product
  17. documentation would be appreciated but is not required.
  18. 3. Altered source versions must be plainly marked as such, and must
  19. not be misrepresented as being the original software.
  20. 4. The name of the author may not be used to endorse or promote
  21. products derived from this software without specific prior written
  22. permission.
  23. THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
  24. OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  25. WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26. ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  27. DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  28. DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
  29. GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  30. INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
  31. WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
  32. NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  33. SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  34. Julian Seward, Cambridge, UK.
  35. jseward@bzip.org
  36. bzip2/libbzip2 version 1.0 of 21 March 2000
  37. This program is based on (at least) the work of:
  38. Mike Burrows
  39. David Wheeler
  40. Peter Fenwick
  41. Alistair Moffat
  42. Radford Neal
  43. Ian H. Witten
  44. Robert Sedgewick
  45. Jon L. Bentley
  46. For more information on these sources, see the manual.
  47. --*/
  48. /*--
  49. CHANGES
  50. ~~~~~~~
  51. 0.9.0 -- original version.
  52. 0.9.0a/b -- no changes in this file.
  53. 0.9.0c
  54. * changed setting of nGroups in sendMTFValues() so as to
  55. do a bit better on small files
  56. --*/
  57. #include "bzlib_private.h"
  58. /*---------------------------------------------------*/
  59. /*--- Bit stream I/O ---*/
  60. /*---------------------------------------------------*/
  61. /*---------------------------------------------------*/
  62. void BZ2_bsInitWrite ( EState* s )
  63. {
  64. s->bsLive = 0;
  65. s->bsBuff = 0;
  66. }
  67. /*---------------------------------------------------*/
  68. static
  69. void bsFinishWrite ( EState* s )
  70. {
  71. while (s->bsLive > 0) {
  72. s->zbits[s->numZ] = (UChar)(s->bsBuff >> 24);
  73. s->numZ++;
  74. s->bsBuff <<= 8;
  75. s->bsLive -= 8;
  76. }
  77. }
  78. /*---------------------------------------------------*/
  79. #define bsNEEDW(nz) \
  80. { \
  81. while (s->bsLive >= 8) { \
  82. s->zbits[s->numZ] \
  83. = (UChar)(s->bsBuff >> 24); \
  84. s->numZ++; \
  85. s->bsBuff <<= 8; \
  86. s->bsLive -= 8; \
  87. } \
  88. }
  89. /*---------------------------------------------------*/
  90. static
  91. __inline__
  92. void bsW ( EState* s, Int32 n, UInt32 v )
  93. {
  94. bsNEEDW ( n );
  95. s->bsBuff |= (v << (32 - s->bsLive - n));
  96. s->bsLive += n;
  97. }
  98. /*---------------------------------------------------*/
  99. static
  100. void bsPutUInt32 ( EState* s, UInt32 u )
  101. {
  102. bsW ( s, 8, (u >> 24) & 0xffL );
  103. bsW ( s, 8, (u >> 16) & 0xffL );
  104. bsW ( s, 8, (u >> 8) & 0xffL );
  105. bsW ( s, 8, u & 0xffL );
  106. }
  107. /*---------------------------------------------------*/
  108. static
  109. void bsPutUChar ( EState* s, UChar c )
  110. {
  111. bsW( s, 8, (UInt32)c );
  112. }
  113. /*---------------------------------------------------*/
  114. /*--- The back end proper ---*/
  115. /*---------------------------------------------------*/
  116. /*---------------------------------------------------*/
  117. static
  118. void makeMaps_e ( EState* s )
  119. {
  120. Int32 i;
  121. s->nInUse = 0;
  122. for (i = 0; i < 256; i++)
  123. if (s->inUse[i]) {
  124. s->unseqToSeq[i] = s->nInUse;
  125. s->nInUse++;
  126. }
  127. }
  128. /*---------------------------------------------------*/
  129. static
  130. void generateMTFValues ( EState* s )
  131. {
  132. UChar yy[256];
  133. Int32 i, j;
  134. Int32 zPend;
  135. Int32 wr;
  136. Int32 EOB;
  137. /*
  138. After sorting (eg, here),
  139. s->arr1 [ 0 .. s->nblock-1 ] holds sorted order,
  140. and
  141. ((UChar*)s->arr2) [ 0 .. s->nblock-1 ]
  142. holds the original block data.
  143. The first thing to do is generate the MTF values,
  144. and put them in
  145. ((UInt16*)s->arr1) [ 0 .. s->nblock-1 ].
  146. Because there are strictly fewer or equal MTF values
  147. than block values, ptr values in this area are overwritten
  148. with MTF values only when they are no longer needed.
  149. The final compressed bitstream is generated into the
  150. area starting at
  151. (UChar*) (&((UChar*)s->arr2)[s->nblock])
  152. These storage aliases are set up in bzCompressInit(),
  153. except for the last one, which is arranged in
  154. compressBlock().
  155. */
  156. UInt32* ptr = s->ptr;
  157. UChar* block = s->block;
  158. UInt16* mtfv = s->mtfv;
  159. makeMaps_e ( s );
  160. EOB = s->nInUse+1;
  161. for (i = 0; i <= EOB; i++) s->mtfFreq[i] = 0;
  162. wr = 0;
  163. zPend = 0;
  164. for (i = 0; i < s->nInUse; i++) yy[i] = (UChar) i;
  165. for (i = 0; i < s->nblock; i++) {
  166. UChar ll_i;
  167. j = ptr[i]-1; if (j < 0) j += s->nblock;
  168. ll_i = s->unseqToSeq[block[j]];
  169. if (yy[0] == ll_i) {
  170. zPend++;
  171. } else {
  172. if (zPend > 0) {
  173. zPend--;
  174. while (True) {
  175. if (zPend & 1) {
  176. mtfv[wr] = BZ_RUNB; wr++;
  177. s->mtfFreq[BZ_RUNB]++;
  178. } else {
  179. mtfv[wr] = BZ_RUNA; wr++;
  180. s->mtfFreq[BZ_RUNA]++;
  181. }
  182. if (zPend < 2) break;
  183. zPend = (zPend - 2) / 2;
  184. };
  185. zPend = 0;
  186. }
  187. {
  188. register UChar rtmp;
  189. register UChar* ryy_j;
  190. register UChar rll_i;
  191. rtmp = yy[1];
  192. yy[1] = yy[0];
  193. ryy_j = &(yy[1]);
  194. rll_i = ll_i;
  195. while ( rll_i != rtmp ) {
  196. register UChar rtmp2;
  197. ryy_j++;
  198. rtmp2 = rtmp;
  199. rtmp = *ryy_j;
  200. *ryy_j = rtmp2;
  201. };
  202. yy[0] = rtmp;
  203. j = ryy_j - &(yy[0]);
  204. mtfv[wr] = j+1; wr++; s->mtfFreq[j+1]++;
  205. }
  206. }
  207. }
  208. if (zPend > 0) {
  209. zPend--;
  210. while (True) {
  211. if (zPend & 1) {
  212. mtfv[wr] = BZ_RUNB; wr++;
  213. s->mtfFreq[BZ_RUNB]++;
  214. } else {
  215. mtfv[wr] = BZ_RUNA; wr++;
  216. s->mtfFreq[BZ_RUNA]++;
  217. }
  218. if (zPend < 2) break;
  219. zPend = (zPend - 2) / 2;
  220. };
  221. zPend = 0;
  222. }
  223. mtfv[wr] = EOB; wr++; s->mtfFreq[EOB]++;
  224. s->nMTF = wr;
  225. }
  226. /*---------------------------------------------------*/
  227. #define BZ_LESSER_ICOST 0
  228. #define BZ_GREATER_ICOST 15
  229. static
  230. void sendMTFValues ( EState* s )
  231. {
  232. Int32 v, t, i, j, gs, ge, totc, bt, bc, iter;
  233. Int32 nSelectors, alphaSize, minLen, maxLen, selCtr;
  234. Int32 nGroups;
  235. /*--
  236. UChar len [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
  237. is a global since the decoder also needs it.
  238. Int32 code[BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
  239. Int32 rfreq[BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
  240. are also globals only used in this proc.
  241. Made global to keep stack frame size small.
  242. --*/
  243. UInt16 cost[BZ_N_GROUPS];
  244. Int32 fave[BZ_N_GROUPS];
  245. UInt16* mtfv = s->mtfv;
  246. alphaSize = s->nInUse+2;
  247. for (t = 0; t < BZ_N_GROUPS; t++)
  248. for (v = 0; v < alphaSize; v++)
  249. s->len[t][v] = BZ_GREATER_ICOST;
  250. /*--- Decide how many coding tables to use ---*/
  251. if (s->nMTF < 200) nGroups = 2; else
  252. if (s->nMTF < 600) nGroups = 3; else
  253. if (s->nMTF < 1200) nGroups = 4; else
  254. if (s->nMTF < 2400) nGroups = 5; else
  255. nGroups = 6;
  256. /*--- Generate an initial set of coding tables ---*/
  257. {
  258. Int32 nPart, remF, tFreq, aFreq;
  259. nPart = nGroups;
  260. remF = s->nMTF;
  261. gs = 0;
  262. while (nPart > 0) {
  263. tFreq = remF / nPart;
  264. ge = gs-1;
  265. aFreq = 0;
  266. while (aFreq < tFreq && ge < alphaSize-1) {
  267. ge++;
  268. aFreq += s->mtfFreq[ge];
  269. }
  270. if (ge > gs
  271. && nPart != nGroups && nPart != 1
  272. && ((nGroups-nPart) % 2 == 1)) {
  273. aFreq -= s->mtfFreq[ge];
  274. ge--;
  275. }
  276. for (v = 0; v < alphaSize; v++)
  277. if (v >= gs && v <= ge)
  278. s->len[nPart-1][v] = BZ_LESSER_ICOST; else
  279. s->len[nPart-1][v] = BZ_GREATER_ICOST;
  280. nPart--;
  281. gs = ge+1;
  282. remF -= aFreq;
  283. }
  284. }
  285. /*---
  286. Iterate up to BZ_N_ITERS times to improve the tables.
  287. ---*/
  288. for (iter = 0; iter < BZ_N_ITERS; iter++) {
  289. for (t = 0; t < nGroups; t++) fave[t] = 0;
  290. for (t = 0; t < nGroups; t++)
  291. for (v = 0; v < alphaSize; v++)
  292. s->rfreq[t][v] = 0;
  293. /*---
  294. Set up an auxiliary length table which is used to fast-track
  295. the common case (nGroups == 6).
  296. ---*/
  297. if (nGroups == 6) {
  298. for (v = 0; v < alphaSize; v++) {
  299. s->len_pack[v][0] = (s->len[1][v] << 16) | s->len[0][v];
  300. s->len_pack[v][1] = (s->len[3][v] << 16) | s->len[2][v];
  301. s->len_pack[v][2] = (s->len[5][v] << 16) | s->len[4][v];
  302. }
  303. }
  304. nSelectors = 0;
  305. totc = 0;
  306. gs = 0;
  307. while (True) {
  308. /*--- Set group start & end marks. --*/
  309. if (gs >= s->nMTF) break;
  310. ge = gs + BZ_G_SIZE - 1;
  311. if (ge >= s->nMTF) ge = s->nMTF-1;
  312. /*--
  313. Calculate the cost of this group as coded
  314. by each of the coding tables.
  315. --*/
  316. for (t = 0; t < nGroups; t++) cost[t] = 0;
  317. if (nGroups == 6 && 50 == ge-gs+1) {
  318. /*--- fast track the common case ---*/
  319. register UInt32 cost01, cost23, cost45;
  320. register UInt16 icv;
  321. cost01 = cost23 = cost45 = 0;
  322. # define BZ_ITER(nn) \
  323. icv = mtfv[gs+(nn)]; \
  324. cost01 += s->len_pack[icv][0]; \
  325. cost23 += s->len_pack[icv][1]; \
  326. cost45 += s->len_pack[icv][2]; \
  327. BZ_ITER(0); BZ_ITER(1); BZ_ITER(2); BZ_ITER(3); BZ_ITER(4);
  328. BZ_ITER(5); BZ_ITER(6); BZ_ITER(7); BZ_ITER(8); BZ_ITER(9);
  329. BZ_ITER(10); BZ_ITER(11); BZ_ITER(12); BZ_ITER(13); BZ_ITER(14);
  330. BZ_ITER(15); BZ_ITER(16); BZ_ITER(17); BZ_ITER(18); BZ_ITER(19);
  331. BZ_ITER(20); BZ_ITER(21); BZ_ITER(22); BZ_ITER(23); BZ_ITER(24);
  332. BZ_ITER(25); BZ_ITER(26); BZ_ITER(27); BZ_ITER(28); BZ_ITER(29);
  333. BZ_ITER(30); BZ_ITER(31); BZ_ITER(32); BZ_ITER(33); BZ_ITER(34);
  334. BZ_ITER(35); BZ_ITER(36); BZ_ITER(37); BZ_ITER(38); BZ_ITER(39);
  335. BZ_ITER(40); BZ_ITER(41); BZ_ITER(42); BZ_ITER(43); BZ_ITER(44);
  336. BZ_ITER(45); BZ_ITER(46); BZ_ITER(47); BZ_ITER(48); BZ_ITER(49);
  337. # undef BZ_ITER
  338. cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16;
  339. cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16;
  340. cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
  341. } else {
  342. /*--- slow version which correctly handles all situations ---*/
  343. for (i = gs; i <= ge; i++) {
  344. UInt16 icv = mtfv[i];
  345. for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv];
  346. }
  347. }
  348. /*--
  349. Find the coding table which is best for this group,
  350. and record its identity in the selector table.
  351. --*/
  352. bc = 999999999; bt = -1;
  353. for (t = 0; t < nGroups; t++)
  354. if (cost[t] < bc) { bc = cost[t]; bt = t; };
  355. totc += bc;
  356. fave[bt]++;
  357. s->selector[nSelectors] = bt;
  358. nSelectors++;
  359. /*--
  360. Increment the symbol frequencies for the selected table.
  361. --*/
  362. if (nGroups == 6 && 50 == ge-gs+1) {
  363. /*--- fast track the common case ---*/
  364. # define BZ_ITUR(nn) s->rfreq[bt][ mtfv[gs+(nn)] ]++
  365. BZ_ITUR(0); BZ_ITUR(1); BZ_ITUR(2); BZ_ITUR(3); BZ_ITUR(4);
  366. BZ_ITUR(5); BZ_ITUR(6); BZ_ITUR(7); BZ_ITUR(8); BZ_ITUR(9);
  367. BZ_ITUR(10); BZ_ITUR(11); BZ_ITUR(12); BZ_ITUR(13); BZ_ITUR(14);
  368. BZ_ITUR(15); BZ_ITUR(16); BZ_ITUR(17); BZ_ITUR(18); BZ_ITUR(19);
  369. BZ_ITUR(20); BZ_ITUR(21); BZ_ITUR(22); BZ_ITUR(23); BZ_ITUR(24);
  370. BZ_ITUR(25); BZ_ITUR(26); BZ_ITUR(27); BZ_ITUR(28); BZ_ITUR(29);
  371. BZ_ITUR(30); BZ_ITUR(31); BZ_ITUR(32); BZ_ITUR(33); BZ_ITUR(34);
  372. BZ_ITUR(35); BZ_ITUR(36); BZ_ITUR(37); BZ_ITUR(38); BZ_ITUR(39);
  373. BZ_ITUR(40); BZ_ITUR(41); BZ_ITUR(42); BZ_ITUR(43); BZ_ITUR(44);
  374. BZ_ITUR(45); BZ_ITUR(46); BZ_ITUR(47); BZ_ITUR(48); BZ_ITUR(49);
  375. # undef BZ_ITUR
  376. } else {
  377. /*--- slow version which correctly handles all situations ---*/
  378. for (i = gs; i <= ge; i++)
  379. s->rfreq[bt][ mtfv[i] ]++;
  380. }
  381. gs = ge+1;
  382. }
  383. /*--
  384. Recompute the tables based on the accumulated frequencies.
  385. --*/
  386. /* maxLen was changed from 20 to 17 in bzip2-1.0.3. See
  387. comment in huffman.c for details. */
  388. for (t = 0; t < nGroups; t++)
  389. BZ2_hbMakeCodeLengths ( &(s->len[t][0]), &(s->rfreq[t][0]),
  390. alphaSize, 17 /*20*/ );
  391. }
  392. /*--- Compute MTF values for the selectors. ---*/
  393. {
  394. UChar pos[BZ_N_GROUPS], ll_i, tmp2, tmp;
  395. for (i = 0; i < nGroups; i++) pos[i] = i;
  396. for (i = 0; i < nSelectors; i++) {
  397. ll_i = s->selector[i];
  398. j = 0;
  399. tmp = pos[j];
  400. while ( ll_i != tmp ) {
  401. j++;
  402. tmp2 = tmp;
  403. tmp = pos[j];
  404. pos[j] = tmp2;
  405. };
  406. pos[0] = tmp;
  407. s->selectorMtf[i] = j;
  408. }
  409. };
  410. /*--- Assign actual codes for the tables. --*/
  411. for (t = 0; t < nGroups; t++) {
  412. minLen = 32;
  413. maxLen = 0;
  414. for (i = 0; i < alphaSize; i++) {
  415. if (s->len[t][i] > maxLen) maxLen = s->len[t][i];
  416. if (s->len[t][i] < minLen) minLen = s->len[t][i];
  417. }
  418. BZ2_hbAssignCodes ( &(s->code[t][0]), &(s->len[t][0]),
  419. minLen, maxLen, alphaSize );
  420. }
  421. /*--- Transmit the mapping table. ---*/
  422. {
  423. Bool inUse16[16];
  424. for (i = 0; i < 16; i++) {
  425. inUse16[i] = False;
  426. for (j = 0; j < 16; j++)
  427. if (s->inUse[i * 16 + j]) inUse16[i] = True;
  428. }
  429. for (i = 0; i < 16; i++)
  430. if (inUse16[i]) bsW(s,1,1); else bsW(s,1,0);
  431. for (i = 0; i < 16; i++)
  432. if (inUse16[i])
  433. for (j = 0; j < 16; j++) {
  434. if (s->inUse[i * 16 + j]) bsW(s,1,1); else bsW(s,1,0);
  435. }
  436. }
  437. /*--- Now the selectors. ---*/
  438. bsW ( s, 3, nGroups );
  439. bsW ( s, 15, nSelectors );
  440. for (i = 0; i < nSelectors; i++) {
  441. for (j = 0; j < s->selectorMtf[i]; j++) bsW(s,1,1);
  442. bsW(s,1,0);
  443. }
  444. /*--- Now the coding tables. ---*/
  445. for (t = 0; t < nGroups; t++) {
  446. Int32 curr = s->len[t][0];
  447. bsW ( s, 5, curr );
  448. for (i = 0; i < alphaSize; i++) {
  449. while (curr < s->len[t][i]) { bsW(s,2,2); curr++; /* 10 */ };
  450. while (curr > s->len[t][i]) { bsW(s,2,3); curr--; /* 11 */ };
  451. bsW ( s, 1, 0 );
  452. }
  453. }
  454. /*--- And finally, the block data proper ---*/
  455. selCtr = 0;
  456. gs = 0;
  457. while (True) {
  458. if (gs >= s->nMTF) break;
  459. ge = gs + BZ_G_SIZE - 1;
  460. if (ge >= s->nMTF) ge = s->nMTF-1;
  461. if (nGroups == 6 && 50 == ge-gs+1) {
  462. /*--- fast track the common case ---*/
  463. UInt16 mtfv_i;
  464. UChar* s_len_sel_selCtr
  465. = &(s->len[s->selector[selCtr]][0]);
  466. Int32* s_code_sel_selCtr
  467. = &(s->code[s->selector[selCtr]][0]);
  468. # define BZ_ITAH(nn) \
  469. mtfv_i = mtfv[gs+(nn)]; \
  470. bsW ( s, \
  471. s_len_sel_selCtr[mtfv_i], \
  472. s_code_sel_selCtr[mtfv_i] )
  473. BZ_ITAH(0); BZ_ITAH(1); BZ_ITAH(2); BZ_ITAH(3); BZ_ITAH(4);
  474. BZ_ITAH(5); BZ_ITAH(6); BZ_ITAH(7); BZ_ITAH(8); BZ_ITAH(9);
  475. BZ_ITAH(10); BZ_ITAH(11); BZ_ITAH(12); BZ_ITAH(13); BZ_ITAH(14);
  476. BZ_ITAH(15); BZ_ITAH(16); BZ_ITAH(17); BZ_ITAH(18); BZ_ITAH(19);
  477. BZ_ITAH(20); BZ_ITAH(21); BZ_ITAH(22); BZ_ITAH(23); BZ_ITAH(24);
  478. BZ_ITAH(25); BZ_ITAH(26); BZ_ITAH(27); BZ_ITAH(28); BZ_ITAH(29);
  479. BZ_ITAH(30); BZ_ITAH(31); BZ_ITAH(32); BZ_ITAH(33); BZ_ITAH(34);
  480. BZ_ITAH(35); BZ_ITAH(36); BZ_ITAH(37); BZ_ITAH(38); BZ_ITAH(39);
  481. BZ_ITAH(40); BZ_ITAH(41); BZ_ITAH(42); BZ_ITAH(43); BZ_ITAH(44);
  482. BZ_ITAH(45); BZ_ITAH(46); BZ_ITAH(47); BZ_ITAH(48); BZ_ITAH(49);
  483. # undef BZ_ITAH
  484. } else {
  485. /*--- slow version which correctly handles all situations ---*/
  486. for (i = gs; i <= ge; i++) {
  487. bsW ( s,
  488. s->len [s->selector[selCtr]] [mtfv[i]],
  489. s->code [s->selector[selCtr]] [mtfv[i]] );
  490. }
  491. }
  492. gs = ge+1;
  493. selCtr++;
  494. }
  495. }
  496. /*---------------------------------------------------*/
  497. void BZ2_compressBlock ( EState* s, Bool is_last_block )
  498. {
  499. if (s->nblock > 0) {
  500. BZ_FINALISE_CRC ( s->blockCRC );
  501. s->combinedCRC = (s->combinedCRC << 1) | (s->combinedCRC >> 31);
  502. s->combinedCRC ^= s->blockCRC;
  503. if (s->blockNo > 1) s->numZ = 0;
  504. BZ2_blockSort ( s );
  505. }
  506. s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]);
  507. /*-- If this is the first block, create the stream header. --*/
  508. if (s->blockNo == 1) {
  509. BZ2_bsInitWrite ( s );
  510. bsPutUChar ( s, BZ_HDR_B );
  511. bsPutUChar ( s, BZ_HDR_Z );
  512. bsPutUChar ( s, BZ_HDR_h );
  513. bsPutUChar ( s, (UChar)(BZ_HDR_0 + s->blockSize100k) );
  514. }
  515. if (s->nblock > 0) {
  516. bsPutUChar ( s, 0x31 ); bsPutUChar ( s, 0x41 );
  517. bsPutUChar ( s, 0x59 ); bsPutUChar ( s, 0x26 );
  518. bsPutUChar ( s, 0x53 ); bsPutUChar ( s, 0x59 );
  519. /*-- Now the block's CRC, so it is in a known place. --*/
  520. bsPutUInt32 ( s, s->blockCRC );
  521. /*--
  522. Now a single bit indicating (non-)randomisation.
  523. As of version 0.9.5, we use a better sorting algorithm
  524. which makes randomisation unnecessary. So always set
  525. the randomised bit to 'no'. Of course, the decoder
  526. still needs to be able to handle randomised blocks
  527. so as to maintain backwards compatibility with
  528. older versions of bzip2.
  529. --*/
  530. bsW(s,1,0);
  531. bsW ( s, 24, s->origPtr );
  532. generateMTFValues ( s );
  533. sendMTFValues ( s );
  534. }
  535. /*-- If this is the last block, add the stream trailer. --*/
  536. if (is_last_block) {
  537. bsPutUChar ( s, 0x17 ); bsPutUChar ( s, 0x72 );
  538. bsPutUChar ( s, 0x45 ); bsPutUChar ( s, 0x38 );
  539. bsPutUChar ( s, 0x50 ); bsPutUChar ( s, 0x90 );
  540. bsPutUInt32 ( s, s->combinedCRC );
  541. bsFinishWrite ( s );
  542. }
  543. }
  544. /*-------------------------------------------------------------*/
  545. /*--- end compress.c ---*/
  546. /*-------------------------------------------------------------*/