michael@0: michael@0: /*-------------------------------------------------------------*/ michael@0: /*--- Compression machinery (not incl block sorting) ---*/ michael@0: /*--- compress.c ---*/ michael@0: /*-------------------------------------------------------------*/ michael@0: michael@0: /* ------------------------------------------------------------------ michael@0: This file is part of bzip2/libbzip2, a program and library for michael@0: lossless, block-sorting data compression. michael@0: michael@0: bzip2/libbzip2 version 1.0.4 of 20 December 2006 michael@0: Copyright (C) 1996-2006 Julian Seward michael@0: michael@0: Please read the WARNING, DISCLAIMER and PATENTS sections in the michael@0: README file. michael@0: michael@0: This program is released under the terms of the license contained michael@0: in the file LICENSE. michael@0: ------------------------------------------------------------------ */ michael@0: michael@0: michael@0: /* CHANGES michael@0: 0.9.0 -- original version. michael@0: 0.9.0a/b -- no changes in this file. michael@0: 0.9.0c -- changed setting of nGroups in sendMTFValues() michael@0: so as to do a bit better on small files michael@0: */ michael@0: michael@0: #include "bzlib_private.h" michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: /*--- Bit stream I/O ---*/ michael@0: /*---------------------------------------------------*/ michael@0: michael@0: /*---------------------------------------------------*/ michael@0: void BZ2_bsInitWrite ( EState* s ) michael@0: { michael@0: s->bsLive = 0; michael@0: s->bsBuff = 0; michael@0: } michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: static michael@0: void bsFinishWrite ( EState* s ) michael@0: { michael@0: while (s->bsLive > 0) { michael@0: s->zbits[s->numZ] = (UChar)(s->bsBuff >> 24); michael@0: s->numZ++; michael@0: s->bsBuff <<= 8; michael@0: s->bsLive -= 8; michael@0: } michael@0: } michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: #define bsNEEDW(nz) \ michael@0: { \ michael@0: while (s->bsLive >= 8) { \ michael@0: s->zbits[s->numZ] \ michael@0: = (UChar)(s->bsBuff >> 24); \ michael@0: s->numZ++; \ michael@0: s->bsBuff <<= 8; \ michael@0: s->bsLive -= 8; \ michael@0: } \ michael@0: } michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: static michael@0: __inline__ michael@0: void bsW ( EState* s, Int32 n, UInt32 v ) michael@0: { michael@0: bsNEEDW ( n ); michael@0: s->bsBuff |= (v << (32 - s->bsLive - n)); michael@0: s->bsLive += n; michael@0: } michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: static michael@0: void bsPutUInt32 ( EState* s, UInt32 u ) michael@0: { michael@0: bsW ( s, 8, (u >> 24) & 0xffL ); michael@0: bsW ( s, 8, (u >> 16) & 0xffL ); michael@0: bsW ( s, 8, (u >> 8) & 0xffL ); michael@0: bsW ( s, 8, u & 0xffL ); michael@0: } michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: static michael@0: void bsPutUChar ( EState* s, UChar c ) michael@0: { michael@0: bsW( s, 8, (UInt32)c ); michael@0: } michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: /*--- The back end proper ---*/ michael@0: /*---------------------------------------------------*/ michael@0: michael@0: /*---------------------------------------------------*/ michael@0: static michael@0: void makeMaps_e ( EState* s ) michael@0: { michael@0: Int32 i; michael@0: s->nInUse = 0; michael@0: for (i = 0; i < 256; i++) michael@0: if (s->inUse[i]) { michael@0: s->unseqToSeq[i] = s->nInUse; michael@0: s->nInUse++; michael@0: } michael@0: } michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: static michael@0: void generateMTFValues ( EState* s ) michael@0: { michael@0: UChar yy[256]; michael@0: Int32 i, j; michael@0: Int32 zPend; michael@0: Int32 wr; michael@0: Int32 EOB; michael@0: michael@0: /* michael@0: After sorting (eg, here), michael@0: s->arr1 [ 0 .. s->nblock-1 ] holds sorted order, michael@0: and michael@0: ((UChar*)s->arr2) [ 0 .. s->nblock-1 ] michael@0: holds the original block data. michael@0: michael@0: The first thing to do is generate the MTF values, michael@0: and put them in michael@0: ((UInt16*)s->arr1) [ 0 .. s->nblock-1 ]. michael@0: Because there are strictly fewer or equal MTF values michael@0: than block values, ptr values in this area are overwritten michael@0: with MTF values only when they are no longer needed. michael@0: michael@0: The final compressed bitstream is generated into the michael@0: area starting at michael@0: (UChar*) (&((UChar*)s->arr2)[s->nblock]) michael@0: michael@0: These storage aliases are set up in bzCompressInit(), michael@0: except for the last one, which is arranged in michael@0: compressBlock(). michael@0: */ michael@0: UInt32* ptr = s->ptr; michael@0: UChar* block = s->block; michael@0: UInt16* mtfv = s->mtfv; michael@0: michael@0: makeMaps_e ( s ); michael@0: EOB = s->nInUse+1; michael@0: michael@0: for (i = 0; i <= EOB; i++) s->mtfFreq[i] = 0; michael@0: michael@0: wr = 0; michael@0: zPend = 0; michael@0: for (i = 0; i < s->nInUse; i++) yy[i] = (UChar) i; michael@0: michael@0: for (i = 0; i < s->nblock; i++) { michael@0: UChar ll_i; michael@0: AssertD ( wr <= i, "generateMTFValues(1)" ); michael@0: j = ptr[i]-1; if (j < 0) j += s->nblock; michael@0: ll_i = s->unseqToSeq[block[j]]; michael@0: AssertD ( ll_i < s->nInUse, "generateMTFValues(2a)" ); michael@0: michael@0: if (yy[0] == ll_i) { michael@0: zPend++; michael@0: } else { michael@0: michael@0: if (zPend > 0) { michael@0: zPend--; michael@0: while (True) { michael@0: if (zPend & 1) { michael@0: mtfv[wr] = BZ_RUNB; wr++; michael@0: s->mtfFreq[BZ_RUNB]++; michael@0: } else { michael@0: mtfv[wr] = BZ_RUNA; wr++; michael@0: s->mtfFreq[BZ_RUNA]++; michael@0: } michael@0: if (zPend < 2) break; michael@0: zPend = (zPend - 2) / 2; michael@0: }; michael@0: zPend = 0; michael@0: } michael@0: { michael@0: register UChar rtmp; michael@0: register UChar* ryy_j; michael@0: register UChar rll_i; michael@0: rtmp = yy[1]; michael@0: yy[1] = yy[0]; michael@0: ryy_j = &(yy[1]); michael@0: rll_i = ll_i; michael@0: while ( rll_i != rtmp ) { michael@0: register UChar rtmp2; michael@0: ryy_j++; michael@0: rtmp2 = rtmp; michael@0: rtmp = *ryy_j; michael@0: *ryy_j = rtmp2; michael@0: }; michael@0: yy[0] = rtmp; michael@0: j = ryy_j - &(yy[0]); michael@0: mtfv[wr] = j+1; wr++; s->mtfFreq[j+1]++; michael@0: } michael@0: michael@0: } michael@0: } michael@0: michael@0: if (zPend > 0) { michael@0: zPend--; michael@0: while (True) { michael@0: if (zPend & 1) { michael@0: mtfv[wr] = BZ_RUNB; wr++; michael@0: s->mtfFreq[BZ_RUNB]++; michael@0: } else { michael@0: mtfv[wr] = BZ_RUNA; wr++; michael@0: s->mtfFreq[BZ_RUNA]++; michael@0: } michael@0: if (zPend < 2) break; michael@0: zPend = (zPend - 2) / 2; michael@0: }; michael@0: zPend = 0; michael@0: } michael@0: michael@0: mtfv[wr] = EOB; wr++; s->mtfFreq[EOB]++; michael@0: michael@0: s->nMTF = wr; michael@0: } michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: #define BZ_LESSER_ICOST 0 michael@0: #define BZ_GREATER_ICOST 15 michael@0: michael@0: static michael@0: void sendMTFValues ( EState* s ) michael@0: { michael@0: Int32 v, t, i, j, gs, ge, totc, bt, bc, iter; michael@0: Int32 nSelectors, alphaSize, minLen, maxLen, selCtr; michael@0: Int32 nGroups, nBytes; michael@0: michael@0: /*-- michael@0: UChar len [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE]; michael@0: is a global since the decoder also needs it. michael@0: michael@0: Int32 code[BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE]; michael@0: Int32 rfreq[BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE]; michael@0: are also globals only used in this proc. michael@0: Made global to keep stack frame size small. michael@0: --*/ michael@0: michael@0: michael@0: UInt16 cost[BZ_N_GROUPS]; michael@0: Int32 fave[BZ_N_GROUPS]; michael@0: michael@0: UInt16* mtfv = s->mtfv; michael@0: michael@0: if (s->verbosity >= 3) michael@0: VPrintf3( " %d in block, %d after MTF & 1-2 coding, " michael@0: "%d+2 syms in use\n", michael@0: s->nblock, s->nMTF, s->nInUse ); michael@0: michael@0: alphaSize = s->nInUse+2; michael@0: for (t = 0; t < BZ_N_GROUPS; t++) michael@0: for (v = 0; v < alphaSize; v++) michael@0: s->len[t][v] = BZ_GREATER_ICOST; michael@0: michael@0: /*--- Decide how many coding tables to use ---*/ michael@0: AssertH ( s->nMTF > 0, 3001 ); michael@0: if (s->nMTF < 200) nGroups = 2; else michael@0: if (s->nMTF < 600) nGroups = 3; else michael@0: if (s->nMTF < 1200) nGroups = 4; else michael@0: if (s->nMTF < 2400) nGroups = 5; else michael@0: nGroups = 6; michael@0: michael@0: /*--- Generate an initial set of coding tables ---*/ michael@0: { michael@0: Int32 nPart, remF, tFreq, aFreq; michael@0: michael@0: nPart = nGroups; michael@0: remF = s->nMTF; michael@0: gs = 0; michael@0: while (nPart > 0) { michael@0: tFreq = remF / nPart; michael@0: ge = gs-1; michael@0: aFreq = 0; michael@0: while (aFreq < tFreq && ge < alphaSize-1) { michael@0: ge++; michael@0: aFreq += s->mtfFreq[ge]; michael@0: } michael@0: michael@0: if (ge > gs michael@0: && nPart != nGroups && nPart != 1 michael@0: && ((nGroups-nPart) % 2 == 1)) { michael@0: aFreq -= s->mtfFreq[ge]; michael@0: ge--; michael@0: } michael@0: michael@0: if (s->verbosity >= 3) michael@0: VPrintf5( " initial group %d, [%d .. %d], " michael@0: "has %d syms (%4.1f%%)\n", michael@0: nPart, gs, ge, aFreq, michael@0: (100.0 * (float)aFreq) / (float)(s->nMTF) ); michael@0: michael@0: for (v = 0; v < alphaSize; v++) michael@0: if (v >= gs && v <= ge) michael@0: s->len[nPart-1][v] = BZ_LESSER_ICOST; else michael@0: s->len[nPart-1][v] = BZ_GREATER_ICOST; michael@0: michael@0: nPart--; michael@0: gs = ge+1; michael@0: remF -= aFreq; michael@0: } michael@0: } michael@0: michael@0: /*--- michael@0: Iterate up to BZ_N_ITERS times to improve the tables. michael@0: ---*/ michael@0: for (iter = 0; iter < BZ_N_ITERS; iter++) { michael@0: michael@0: for (t = 0; t < nGroups; t++) fave[t] = 0; michael@0: michael@0: for (t = 0; t < nGroups; t++) michael@0: for (v = 0; v < alphaSize; v++) michael@0: s->rfreq[t][v] = 0; michael@0: michael@0: /*--- michael@0: Set up an auxiliary length table which is used to fast-track michael@0: the common case (nGroups == 6). michael@0: ---*/ michael@0: if (nGroups == 6) { michael@0: for (v = 0; v < alphaSize; v++) { michael@0: s->len_pack[v][0] = (s->len[1][v] << 16) | s->len[0][v]; michael@0: s->len_pack[v][1] = (s->len[3][v] << 16) | s->len[2][v]; michael@0: s->len_pack[v][2] = (s->len[5][v] << 16) | s->len[4][v]; michael@0: } michael@0: } michael@0: michael@0: nSelectors = 0; michael@0: totc = 0; michael@0: gs = 0; michael@0: while (True) { michael@0: michael@0: /*--- Set group start & end marks. --*/ michael@0: if (gs >= s->nMTF) break; michael@0: ge = gs + BZ_G_SIZE - 1; michael@0: if (ge >= s->nMTF) ge = s->nMTF-1; michael@0: michael@0: /*-- michael@0: Calculate the cost of this group as coded michael@0: by each of the coding tables. michael@0: --*/ michael@0: for (t = 0; t < nGroups; t++) cost[t] = 0; michael@0: michael@0: if (nGroups == 6 && 50 == ge-gs+1) { michael@0: /*--- fast track the common case ---*/ michael@0: register UInt32 cost01, cost23, cost45; michael@0: register UInt16 icv; michael@0: cost01 = cost23 = cost45 = 0; michael@0: michael@0: # define BZ_ITER(nn) \ michael@0: icv = mtfv[gs+(nn)]; \ michael@0: cost01 += s->len_pack[icv][0]; \ michael@0: cost23 += s->len_pack[icv][1]; \ michael@0: cost45 += s->len_pack[icv][2]; \ michael@0: michael@0: BZ_ITER(0); BZ_ITER(1); BZ_ITER(2); BZ_ITER(3); BZ_ITER(4); michael@0: BZ_ITER(5); BZ_ITER(6); BZ_ITER(7); BZ_ITER(8); BZ_ITER(9); michael@0: BZ_ITER(10); BZ_ITER(11); BZ_ITER(12); BZ_ITER(13); BZ_ITER(14); michael@0: BZ_ITER(15); BZ_ITER(16); BZ_ITER(17); BZ_ITER(18); BZ_ITER(19); michael@0: BZ_ITER(20); BZ_ITER(21); BZ_ITER(22); BZ_ITER(23); BZ_ITER(24); michael@0: BZ_ITER(25); BZ_ITER(26); BZ_ITER(27); BZ_ITER(28); BZ_ITER(29); michael@0: BZ_ITER(30); BZ_ITER(31); BZ_ITER(32); BZ_ITER(33); BZ_ITER(34); michael@0: BZ_ITER(35); BZ_ITER(36); BZ_ITER(37); BZ_ITER(38); BZ_ITER(39); michael@0: BZ_ITER(40); BZ_ITER(41); BZ_ITER(42); BZ_ITER(43); BZ_ITER(44); michael@0: BZ_ITER(45); BZ_ITER(46); BZ_ITER(47); BZ_ITER(48); BZ_ITER(49); michael@0: michael@0: # undef BZ_ITER michael@0: michael@0: cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16; michael@0: cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16; michael@0: cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16; michael@0: michael@0: } else { michael@0: /*--- slow version which correctly handles all situations ---*/ michael@0: for (i = gs; i <= ge; i++) { michael@0: UInt16 icv = mtfv[i]; michael@0: for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv]; michael@0: } michael@0: } michael@0: michael@0: /*-- michael@0: Find the coding table which is best for this group, michael@0: and record its identity in the selector table. michael@0: --*/ michael@0: bc = 999999999; bt = -1; michael@0: for (t = 0; t < nGroups; t++) michael@0: if (cost[t] < bc) { bc = cost[t]; bt = t; }; michael@0: totc += bc; michael@0: fave[bt]++; michael@0: s->selector[nSelectors] = bt; michael@0: nSelectors++; michael@0: michael@0: /*-- michael@0: Increment the symbol frequencies for the selected table. michael@0: --*/ michael@0: if (nGroups == 6 && 50 == ge-gs+1) { michael@0: /*--- fast track the common case ---*/ michael@0: michael@0: # define BZ_ITUR(nn) s->rfreq[bt][ mtfv[gs+(nn)] ]++ michael@0: michael@0: BZ_ITUR(0); BZ_ITUR(1); BZ_ITUR(2); BZ_ITUR(3); BZ_ITUR(4); michael@0: BZ_ITUR(5); BZ_ITUR(6); BZ_ITUR(7); BZ_ITUR(8); BZ_ITUR(9); michael@0: BZ_ITUR(10); BZ_ITUR(11); BZ_ITUR(12); BZ_ITUR(13); BZ_ITUR(14); michael@0: BZ_ITUR(15); BZ_ITUR(16); BZ_ITUR(17); BZ_ITUR(18); BZ_ITUR(19); michael@0: BZ_ITUR(20); BZ_ITUR(21); BZ_ITUR(22); BZ_ITUR(23); BZ_ITUR(24); michael@0: BZ_ITUR(25); BZ_ITUR(26); BZ_ITUR(27); BZ_ITUR(28); BZ_ITUR(29); michael@0: BZ_ITUR(30); BZ_ITUR(31); BZ_ITUR(32); BZ_ITUR(33); BZ_ITUR(34); michael@0: BZ_ITUR(35); BZ_ITUR(36); BZ_ITUR(37); BZ_ITUR(38); BZ_ITUR(39); michael@0: BZ_ITUR(40); BZ_ITUR(41); BZ_ITUR(42); BZ_ITUR(43); BZ_ITUR(44); michael@0: BZ_ITUR(45); BZ_ITUR(46); BZ_ITUR(47); BZ_ITUR(48); BZ_ITUR(49); michael@0: michael@0: # undef BZ_ITUR michael@0: michael@0: } else { michael@0: /*--- slow version which correctly handles all situations ---*/ michael@0: for (i = gs; i <= ge; i++) michael@0: s->rfreq[bt][ mtfv[i] ]++; michael@0: } michael@0: michael@0: gs = ge+1; michael@0: } michael@0: if (s->verbosity >= 3) { michael@0: VPrintf2 ( " pass %d: size is %d, grp uses are ", michael@0: iter+1, totc/8 ); michael@0: for (t = 0; t < nGroups; t++) michael@0: VPrintf1 ( "%d ", fave[t] ); michael@0: VPrintf0 ( "\n" ); michael@0: } michael@0: michael@0: /*-- michael@0: Recompute the tables based on the accumulated frequencies. michael@0: --*/ michael@0: /* maxLen was changed from 20 to 17 in bzip2-1.0.3. See michael@0: comment in huffman.c for details. */ michael@0: for (t = 0; t < nGroups; t++) michael@0: BZ2_hbMakeCodeLengths ( &(s->len[t][0]), &(s->rfreq[t][0]), michael@0: alphaSize, 17 /*20*/ ); michael@0: } michael@0: michael@0: michael@0: AssertH( nGroups < 8, 3002 ); michael@0: AssertH( nSelectors < 32768 && michael@0: nSelectors <= (2 + (900000 / BZ_G_SIZE)), michael@0: 3003 ); michael@0: michael@0: michael@0: /*--- Compute MTF values for the selectors. ---*/ michael@0: { michael@0: UChar pos[BZ_N_GROUPS], ll_i, tmp2, tmp; michael@0: for (i = 0; i < nGroups; i++) pos[i] = i; michael@0: for (i = 0; i < nSelectors; i++) { michael@0: ll_i = s->selector[i]; michael@0: j = 0; michael@0: tmp = pos[j]; michael@0: while ( ll_i != tmp ) { michael@0: j++; michael@0: tmp2 = tmp; michael@0: tmp = pos[j]; michael@0: pos[j] = tmp2; michael@0: }; michael@0: pos[0] = tmp; michael@0: s->selectorMtf[i] = j; michael@0: } michael@0: }; michael@0: michael@0: /*--- Assign actual codes for the tables. --*/ michael@0: for (t = 0; t < nGroups; t++) { michael@0: minLen = 32; michael@0: maxLen = 0; michael@0: for (i = 0; i < alphaSize; i++) { michael@0: if (s->len[t][i] > maxLen) maxLen = s->len[t][i]; michael@0: if (s->len[t][i] < minLen) minLen = s->len[t][i]; michael@0: } michael@0: AssertH ( !(maxLen > 17 /*20*/ ), 3004 ); michael@0: AssertH ( !(minLen < 1), 3005 ); michael@0: BZ2_hbAssignCodes ( &(s->code[t][0]), &(s->len[t][0]), michael@0: minLen, maxLen, alphaSize ); michael@0: } michael@0: michael@0: /*--- Transmit the mapping table. ---*/ michael@0: { michael@0: Bool inUse16[16]; michael@0: for (i = 0; i < 16; i++) { michael@0: inUse16[i] = False; michael@0: for (j = 0; j < 16; j++) michael@0: if (s->inUse[i * 16 + j]) inUse16[i] = True; michael@0: } michael@0: michael@0: nBytes = s->numZ; michael@0: for (i = 0; i < 16; i++) michael@0: if (inUse16[i]) bsW(s,1,1); else bsW(s,1,0); michael@0: michael@0: for (i = 0; i < 16; i++) michael@0: if (inUse16[i]) michael@0: for (j = 0; j < 16; j++) { michael@0: if (s->inUse[i * 16 + j]) bsW(s,1,1); else bsW(s,1,0); michael@0: } michael@0: michael@0: if (s->verbosity >= 3) michael@0: VPrintf1( " bytes: mapping %d, ", s->numZ-nBytes ); michael@0: } michael@0: michael@0: /*--- Now the selectors. ---*/ michael@0: nBytes = s->numZ; michael@0: bsW ( s, 3, nGroups ); michael@0: bsW ( s, 15, nSelectors ); michael@0: for (i = 0; i < nSelectors; i++) { michael@0: for (j = 0; j < s->selectorMtf[i]; j++) bsW(s,1,1); michael@0: bsW(s,1,0); michael@0: } michael@0: if (s->verbosity >= 3) michael@0: VPrintf1( "selectors %d, ", s->numZ-nBytes ); michael@0: michael@0: /*--- Now the coding tables. ---*/ michael@0: nBytes = s->numZ; michael@0: michael@0: for (t = 0; t < nGroups; t++) { michael@0: Int32 curr = s->len[t][0]; michael@0: bsW ( s, 5, curr ); michael@0: for (i = 0; i < alphaSize; i++) { michael@0: while (curr < s->len[t][i]) { bsW(s,2,2); curr++; /* 10 */ }; michael@0: while (curr > s->len[t][i]) { bsW(s,2,3); curr--; /* 11 */ }; michael@0: bsW ( s, 1, 0 ); michael@0: } michael@0: } michael@0: michael@0: if (s->verbosity >= 3) michael@0: VPrintf1 ( "code lengths %d, ", s->numZ-nBytes ); michael@0: michael@0: /*--- And finally, the block data proper ---*/ michael@0: nBytes = s->numZ; michael@0: selCtr = 0; michael@0: gs = 0; michael@0: while (True) { michael@0: if (gs >= s->nMTF) break; michael@0: ge = gs + BZ_G_SIZE - 1; michael@0: if (ge >= s->nMTF) ge = s->nMTF-1; michael@0: AssertH ( s->selector[selCtr] < nGroups, 3006 ); michael@0: michael@0: if (nGroups == 6 && 50 == ge-gs+1) { michael@0: /*--- fast track the common case ---*/ michael@0: UInt16 mtfv_i; michael@0: UChar* s_len_sel_selCtr michael@0: = &(s->len[s->selector[selCtr]][0]); michael@0: Int32* s_code_sel_selCtr michael@0: = &(s->code[s->selector[selCtr]][0]); michael@0: michael@0: # define BZ_ITAH(nn) \ michael@0: mtfv_i = mtfv[gs+(nn)]; \ michael@0: bsW ( s, \ michael@0: s_len_sel_selCtr[mtfv_i], \ michael@0: s_code_sel_selCtr[mtfv_i] ) michael@0: michael@0: BZ_ITAH(0); BZ_ITAH(1); BZ_ITAH(2); BZ_ITAH(3); BZ_ITAH(4); michael@0: BZ_ITAH(5); BZ_ITAH(6); BZ_ITAH(7); BZ_ITAH(8); BZ_ITAH(9); michael@0: BZ_ITAH(10); BZ_ITAH(11); BZ_ITAH(12); BZ_ITAH(13); BZ_ITAH(14); michael@0: BZ_ITAH(15); BZ_ITAH(16); BZ_ITAH(17); BZ_ITAH(18); BZ_ITAH(19); michael@0: BZ_ITAH(20); BZ_ITAH(21); BZ_ITAH(22); BZ_ITAH(23); BZ_ITAH(24); michael@0: BZ_ITAH(25); BZ_ITAH(26); BZ_ITAH(27); BZ_ITAH(28); BZ_ITAH(29); michael@0: BZ_ITAH(30); BZ_ITAH(31); BZ_ITAH(32); BZ_ITAH(33); BZ_ITAH(34); michael@0: BZ_ITAH(35); BZ_ITAH(36); BZ_ITAH(37); BZ_ITAH(38); BZ_ITAH(39); michael@0: BZ_ITAH(40); BZ_ITAH(41); BZ_ITAH(42); BZ_ITAH(43); BZ_ITAH(44); michael@0: BZ_ITAH(45); BZ_ITAH(46); BZ_ITAH(47); BZ_ITAH(48); BZ_ITAH(49); michael@0: michael@0: # undef BZ_ITAH michael@0: michael@0: } else { michael@0: /*--- slow version which correctly handles all situations ---*/ michael@0: for (i = gs; i <= ge; i++) { michael@0: bsW ( s, michael@0: s->len [s->selector[selCtr]] [mtfv[i]], michael@0: s->code [s->selector[selCtr]] [mtfv[i]] ); michael@0: } michael@0: } michael@0: michael@0: michael@0: gs = ge+1; michael@0: selCtr++; michael@0: } michael@0: AssertH( selCtr == nSelectors, 3007 ); michael@0: michael@0: if (s->verbosity >= 3) michael@0: VPrintf1( "codes %d\n", s->numZ-nBytes ); michael@0: } michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: void BZ2_compressBlock ( EState* s, Bool is_last_block ) michael@0: { michael@0: if (s->nblock > 0) { michael@0: michael@0: BZ_FINALISE_CRC ( s->blockCRC ); michael@0: s->combinedCRC = (s->combinedCRC << 1) | (s->combinedCRC >> 31); michael@0: s->combinedCRC ^= s->blockCRC; michael@0: if (s->blockNo > 1) s->numZ = 0; michael@0: michael@0: if (s->verbosity >= 2) michael@0: VPrintf4( " block %d: crc = 0x%08x, " michael@0: "combined CRC = 0x%08x, size = %d\n", michael@0: s->blockNo, s->blockCRC, s->combinedCRC, s->nblock ); michael@0: michael@0: BZ2_blockSort ( s ); michael@0: } michael@0: michael@0: s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]); michael@0: michael@0: /*-- If this is the first block, create the stream header. --*/ michael@0: if (s->blockNo == 1) { michael@0: BZ2_bsInitWrite ( s ); michael@0: bsPutUChar ( s, BZ_HDR_B ); michael@0: bsPutUChar ( s, BZ_HDR_Z ); michael@0: bsPutUChar ( s, BZ_HDR_h ); michael@0: bsPutUChar ( s, (UChar)(BZ_HDR_0 + s->blockSize100k) ); michael@0: } michael@0: michael@0: if (s->nblock > 0) { michael@0: michael@0: bsPutUChar ( s, 0x31 ); bsPutUChar ( s, 0x41 ); michael@0: bsPutUChar ( s, 0x59 ); bsPutUChar ( s, 0x26 ); michael@0: bsPutUChar ( s, 0x53 ); bsPutUChar ( s, 0x59 ); michael@0: michael@0: /*-- Now the block's CRC, so it is in a known place. --*/ michael@0: bsPutUInt32 ( s, s->blockCRC ); michael@0: michael@0: /*-- michael@0: Now a single bit indicating (non-)randomisation. michael@0: As of version 0.9.5, we use a better sorting algorithm michael@0: which makes randomisation unnecessary. So always set michael@0: the randomised bit to 'no'. Of course, the decoder michael@0: still needs to be able to handle randomised blocks michael@0: so as to maintain backwards compatibility with michael@0: older versions of bzip2. michael@0: --*/ michael@0: bsW(s,1,0); michael@0: michael@0: bsW ( s, 24, s->origPtr ); michael@0: generateMTFValues ( s ); michael@0: sendMTFValues ( s ); michael@0: } michael@0: michael@0: michael@0: /*-- If this is the last block, add the stream trailer. --*/ michael@0: if (is_last_block) { michael@0: michael@0: bsPutUChar ( s, 0x17 ); bsPutUChar ( s, 0x72 ); michael@0: bsPutUChar ( s, 0x45 ); bsPutUChar ( s, 0x38 ); michael@0: bsPutUChar ( s, 0x50 ); bsPutUChar ( s, 0x90 ); michael@0: bsPutUInt32 ( s, s->combinedCRC ); michael@0: if (s->verbosity >= 2) michael@0: VPrintf1( " final combined CRC = 0x%08x\n ", s->combinedCRC ); michael@0: bsFinishWrite ( s ); michael@0: } michael@0: } michael@0: michael@0: michael@0: /*-------------------------------------------------------------*/ michael@0: /*--- end compress.c ---*/ michael@0: /*-------------------------------------------------------------*/