2 ff3adf60 2004-04-14 devnull /*-------------------------------------------------------------*/
3 ff3adf60 2004-04-14 devnull /*--- Compression machinery (not incl block sorting) ---*/
4 ff3adf60 2004-04-14 devnull /*--- compress.c ---*/
5 ff3adf60 2004-04-14 devnull /*-------------------------------------------------------------*/
8 ff3adf60 2004-04-14 devnull This file is a part of bzip2 and/or libbzip2, a program and
9 ff3adf60 2004-04-14 devnull library for lossless, block-sorting data compression.
11 ff3adf60 2004-04-14 devnull Copyright (C) 1996-2000 Julian R Seward. All rights reserved.
13 ff3adf60 2004-04-14 devnull Redistribution and use in source and binary forms, with or without
14 ff3adf60 2004-04-14 devnull modification, are permitted provided that the following conditions
17 ff3adf60 2004-04-14 devnull 1. Redistributions of source code must retain the above copyright
18 ff3adf60 2004-04-14 devnull notice, this list of conditions and the following disclaimer.
20 ff3adf60 2004-04-14 devnull 2. The origin of this software must not be misrepresented; you must
21 ff3adf60 2004-04-14 devnull not claim that you wrote the original software. If you use this
22 ff3adf60 2004-04-14 devnull software in a product, an acknowledgment in the product
23 ff3adf60 2004-04-14 devnull documentation would be appreciated but is not required.
25 ff3adf60 2004-04-14 devnull 3. Altered source versions must be plainly marked as such, and must
26 ff3adf60 2004-04-14 devnull not be misrepresented as being the original software.
28 ff3adf60 2004-04-14 devnull 4. The name of the author may not be used to endorse or promote
29 ff3adf60 2004-04-14 devnull products derived from this software without specific prior written
30 ff3adf60 2004-04-14 devnull permission.
32 ff3adf60 2004-04-14 devnull THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
33 ff3adf60 2004-04-14 devnull OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
34 ff3adf60 2004-04-14 devnull WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
35 ff3adf60 2004-04-14 devnull ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
36 ff3adf60 2004-04-14 devnull DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
37 ff3adf60 2004-04-14 devnull DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
38 ff3adf60 2004-04-14 devnull GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
39 ff3adf60 2004-04-14 devnull INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
40 ff3adf60 2004-04-14 devnull WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
41 ff3adf60 2004-04-14 devnull NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
42 ff3adf60 2004-04-14 devnull SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
44 ff3adf60 2004-04-14 devnull Julian Seward, Cambridge, UK.
45 ff3adf60 2004-04-14 devnull jseward@acm.org
46 ff3adf60 2004-04-14 devnull bzip2/libbzip2 version 1.0 of 21 March 2000
48 ff3adf60 2004-04-14 devnull This program is based on (at least) the work of:
49 ff3adf60 2004-04-14 devnull Mike Burrows
50 ff3adf60 2004-04-14 devnull David Wheeler
51 ff3adf60 2004-04-14 devnull Peter Fenwick
52 ff3adf60 2004-04-14 devnull Alistair Moffat
53 ff3adf60 2004-04-14 devnull Radford Neal
54 ff3adf60 2004-04-14 devnull Ian H. Witten
55 ff3adf60 2004-04-14 devnull Robert Sedgewick
56 ff3adf60 2004-04-14 devnull Jon L. Bentley
58 ff3adf60 2004-04-14 devnull For more information on these sources, see the manual.
64 ff3adf60 2004-04-14 devnull 0.9.0 -- original version.
66 ff3adf60 2004-04-14 devnull 0.9.0a/b -- no changes in this file.
69 ff3adf60 2004-04-14 devnull * changed setting of nGroups in sendMTFValues() so as to
70 ff3adf60 2004-04-14 devnull do a bit better on small files
73 ff3adf60 2004-04-14 devnull #include "os.h"
74 ff3adf60 2004-04-14 devnull #include "bzlib.h"
75 ff3adf60 2004-04-14 devnull #include "bzlib_private.h"
78 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
79 ff3adf60 2004-04-14 devnull /*--- Bit stream I/O ---*/
80 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
82 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
83 ff3adf60 2004-04-14 devnull void BZ2_bsInitWrite ( EState* s )
85 ff3adf60 2004-04-14 devnull s->bsLive = 0;
86 ff3adf60 2004-04-14 devnull s->bsBuff = 0;
90 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
92 ff3adf60 2004-04-14 devnull void bsFinishWrite ( EState* s )
94 ff3adf60 2004-04-14 devnull while (s->bsLive > 0) {
95 ff3adf60 2004-04-14 devnull s->zbits[s->numZ] = (UChar)(s->bsBuff >> 24);
96 ff3adf60 2004-04-14 devnull s->numZ++;
97 ff3adf60 2004-04-14 devnull s->bsBuff <<= 8;
98 ff3adf60 2004-04-14 devnull s->bsLive -= 8;
103 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
104 ff3adf60 2004-04-14 devnull #define bsNEEDW(nz) \
106 ff3adf60 2004-04-14 devnull while (s->bsLive >= 8) { \
107 ff3adf60 2004-04-14 devnull s->zbits[s->numZ] \
108 ff3adf60 2004-04-14 devnull = (UChar)(s->bsBuff >> 24); \
109 ff3adf60 2004-04-14 devnull s->numZ++; \
110 ff3adf60 2004-04-14 devnull s->bsBuff <<= 8; \
111 ff3adf60 2004-04-14 devnull s->bsLive -= 8; \
116 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
118 ff3adf60 2004-04-14 devnull __inline__
119 ff3adf60 2004-04-14 devnull void bsW ( EState* s, Int32 n, UInt32 v )
121 ff3adf60 2004-04-14 devnull bsNEEDW ( n );
122 ff3adf60 2004-04-14 devnull s->bsBuff |= (v << (32 - s->bsLive - n));
123 ff3adf60 2004-04-14 devnull s->bsLive += n;
127 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
129 ff3adf60 2004-04-14 devnull void bsPutUInt32 ( EState* s, UInt32 u )
131 ff3adf60 2004-04-14 devnull bsW ( s, 8, (u >> 24) & 0xffL );
132 ff3adf60 2004-04-14 devnull bsW ( s, 8, (u >> 16) & 0xffL );
133 ff3adf60 2004-04-14 devnull bsW ( s, 8, (u >> 8) & 0xffL );
134 ff3adf60 2004-04-14 devnull bsW ( s, 8, u & 0xffL );
138 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
140 ff3adf60 2004-04-14 devnull void bsPutUChar ( EState* s, UChar c )
142 ff3adf60 2004-04-14 devnull bsW( s, 8, (UInt32)c );
146 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
147 ff3adf60 2004-04-14 devnull /*--- The back end proper ---*/
148 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
150 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
152 ff3adf60 2004-04-14 devnull void makeMaps_e ( EState* s )
154 ff3adf60 2004-04-14 devnull Int32 i;
155 ff3adf60 2004-04-14 devnull s->nInUse = 0;
156 ff3adf60 2004-04-14 devnull for (i = 0; i < 256; i++)
157 ff3adf60 2004-04-14 devnull if (s->inUse[i]) {
158 ff3adf60 2004-04-14 devnull s->unseqToSeq[i] = s->nInUse;
159 ff3adf60 2004-04-14 devnull s->nInUse++;
164 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
166 ff3adf60 2004-04-14 devnull void generateMTFValues ( EState* s )
168 ff3adf60 2004-04-14 devnull UChar yy[256];
169 ff3adf60 2004-04-14 devnull Int32 i, j;
170 ff3adf60 2004-04-14 devnull Int32 zPend;
171 ff3adf60 2004-04-14 devnull Int32 wr;
172 ff3adf60 2004-04-14 devnull Int32 EOB;
175 ff3adf60 2004-04-14 devnull After sorting (eg, here),
176 ff3adf60 2004-04-14 devnull s->arr1 [ 0 .. s->nblock-1 ] holds sorted order,
178 ff3adf60 2004-04-14 devnull ((UChar*)s->arr2) [ 0 .. s->nblock-1 ]
179 ff3adf60 2004-04-14 devnull holds the original block data.
181 ff3adf60 2004-04-14 devnull The first thing to do is generate the MTF values,
182 ff3adf60 2004-04-14 devnull and put them in
183 ff3adf60 2004-04-14 devnull ((UInt16*)s->arr1) [ 0 .. s->nblock-1 ].
184 ff3adf60 2004-04-14 devnull Because there are strictly fewer or equal MTF values
185 ff3adf60 2004-04-14 devnull than block values, ptr values in this area are overwritten
186 ff3adf60 2004-04-14 devnull with MTF values only when they are no longer needed.
188 ff3adf60 2004-04-14 devnull The final compressed bitstream is generated into the
189 ff3adf60 2004-04-14 devnull area starting at
190 ff3adf60 2004-04-14 devnull (UChar*) (&((UChar*)s->arr2)[s->nblock])
192 ff3adf60 2004-04-14 devnull These storage aliases are set up in bzCompressInit(),
193 ff3adf60 2004-04-14 devnull except for the last one, which is arranged in
194 ff3adf60 2004-04-14 devnull compressBlock().
196 ff3adf60 2004-04-14 devnull UInt32* ptr = s->ptr;
197 ff3adf60 2004-04-14 devnull UChar* block = s->block;
198 ff3adf60 2004-04-14 devnull UInt16* mtfv = s->mtfv;
200 ff3adf60 2004-04-14 devnull makeMaps_e ( s );
201 ff3adf60 2004-04-14 devnull EOB = s->nInUse+1;
203 ff3adf60 2004-04-14 devnull for (i = 0; i <= EOB; i++) s->mtfFreq[i] = 0;
206 ff3adf60 2004-04-14 devnull zPend = 0;
207 ff3adf60 2004-04-14 devnull for (i = 0; i < s->nInUse; i++) yy[i] = (UChar) i;
209 ff3adf60 2004-04-14 devnull for (i = 0; i < s->nblock; i++) {
210 ff3adf60 2004-04-14 devnull UChar ll_i;
211 ff3adf60 2004-04-14 devnull AssertD ( wr <= i, "generateMTFValues(1)" );
212 ff3adf60 2004-04-14 devnull j = ptr[i]-1; if (j < 0) j += s->nblock;
213 ff3adf60 2004-04-14 devnull ll_i = s->unseqToSeq[block[j]];
214 ff3adf60 2004-04-14 devnull AssertD ( ll_i < s->nInUse, "generateMTFValues(2a)" );
216 ff3adf60 2004-04-14 devnull if (yy[0] == ll_i) {
217 ff3adf60 2004-04-14 devnull zPend++;
218 ff3adf60 2004-04-14 devnull } else {
220 ff3adf60 2004-04-14 devnull if (zPend > 0) {
221 ff3adf60 2004-04-14 devnull zPend--;
222 ff3adf60 2004-04-14 devnull while (True) {
223 ff3adf60 2004-04-14 devnull if (zPend & 1) {
224 ff3adf60 2004-04-14 devnull mtfv[wr] = BZ_RUNB; wr++;
225 ff3adf60 2004-04-14 devnull s->mtfFreq[BZ_RUNB]++;
226 ff3adf60 2004-04-14 devnull } else {
227 ff3adf60 2004-04-14 devnull mtfv[wr] = BZ_RUNA; wr++;
228 ff3adf60 2004-04-14 devnull s->mtfFreq[BZ_RUNA]++;
230 ff3adf60 2004-04-14 devnull if (zPend < 2) break;
231 ff3adf60 2004-04-14 devnull zPend = (zPend - 2) / 2;
233 ff3adf60 2004-04-14 devnull zPend = 0;
236 ff3adf60 2004-04-14 devnull register UChar rtmp;
237 ff3adf60 2004-04-14 devnull register UChar* ryy_j;
238 ff3adf60 2004-04-14 devnull register UChar rll_i;
239 ff3adf60 2004-04-14 devnull rtmp = yy[1];
240 ff3adf60 2004-04-14 devnull yy[1] = yy[0];
241 ff3adf60 2004-04-14 devnull ryy_j = &(yy[1]);
242 ff3adf60 2004-04-14 devnull rll_i = ll_i;
243 ff3adf60 2004-04-14 devnull while ( rll_i != rtmp ) {
244 ff3adf60 2004-04-14 devnull register UChar rtmp2;
245 ff3adf60 2004-04-14 devnull ryy_j++;
246 ff3adf60 2004-04-14 devnull rtmp2 = rtmp;
247 ff3adf60 2004-04-14 devnull rtmp = *ryy_j;
248 ff3adf60 2004-04-14 devnull *ryy_j = rtmp2;
250 ff3adf60 2004-04-14 devnull yy[0] = rtmp;
251 ff3adf60 2004-04-14 devnull j = ryy_j - &(yy[0]);
252 ff3adf60 2004-04-14 devnull mtfv[wr] = j+1; wr++; s->mtfFreq[j+1]++;
258 ff3adf60 2004-04-14 devnull if (zPend > 0) {
259 ff3adf60 2004-04-14 devnull zPend--;
260 ff3adf60 2004-04-14 devnull while (True) {
261 ff3adf60 2004-04-14 devnull if (zPend & 1) {
262 ff3adf60 2004-04-14 devnull mtfv[wr] = BZ_RUNB; wr++;
263 ff3adf60 2004-04-14 devnull s->mtfFreq[BZ_RUNB]++;
264 ff3adf60 2004-04-14 devnull } else {
265 ff3adf60 2004-04-14 devnull mtfv[wr] = BZ_RUNA; wr++;
266 ff3adf60 2004-04-14 devnull s->mtfFreq[BZ_RUNA]++;
268 ff3adf60 2004-04-14 devnull if (zPend < 2) break;
269 ff3adf60 2004-04-14 devnull zPend = (zPend - 2) / 2;
271 cbeb0b26 2006-04-01 devnull /*rsc: not used zPend = 0; */
274 ff3adf60 2004-04-14 devnull mtfv[wr] = EOB; wr++; s->mtfFreq[EOB]++;
276 ff3adf60 2004-04-14 devnull s->nMTF = wr;
280 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
281 ff3adf60 2004-04-14 devnull #define BZ_LESSER_ICOST 0
282 ff3adf60 2004-04-14 devnull #define BZ_GREATER_ICOST 15
285 ff3adf60 2004-04-14 devnull void sendMTFValues ( EState* s )
287 ff3adf60 2004-04-14 devnull Int32 v, t, i, j, gs, ge, totc, bt, bc, iter;
288 ff3adf60 2004-04-14 devnull Int32 nSelectors, alphaSize, minLen, maxLen, selCtr;
289 ff3adf60 2004-04-14 devnull Int32 nGroups, nBytes;
292 ff3adf60 2004-04-14 devnull UChar len [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
293 ff3adf60 2004-04-14 devnull is a global since the decoder also needs it.
295 ff3adf60 2004-04-14 devnull Int32 code[BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
296 ff3adf60 2004-04-14 devnull Int32 rfreq[BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
297 ff3adf60 2004-04-14 devnull are also globals only used in this proc.
298 ff3adf60 2004-04-14 devnull Made global to keep stack frame size small.
302 ff3adf60 2004-04-14 devnull UInt16 cost[BZ_N_GROUPS];
303 ff3adf60 2004-04-14 devnull Int32 fave[BZ_N_GROUPS];
305 ff3adf60 2004-04-14 devnull UInt16* mtfv = s->mtfv;
307 ff3adf60 2004-04-14 devnull if (s->verbosity >= 3)
308 ff3adf60 2004-04-14 devnull VPrintf3( " %d in block, %d after MTF & 1-2 coding, "
309 ff3adf60 2004-04-14 devnull "%d+2 syms in use\n",
310 ff3adf60 2004-04-14 devnull s->nblock, s->nMTF, s->nInUse );
312 ff3adf60 2004-04-14 devnull alphaSize = s->nInUse+2;
313 ff3adf60 2004-04-14 devnull for (t = 0; t < BZ_N_GROUPS; t++)
314 ff3adf60 2004-04-14 devnull for (v = 0; v < alphaSize; v++)
315 ff3adf60 2004-04-14 devnull s->len[t][v] = BZ_GREATER_ICOST;
317 ff3adf60 2004-04-14 devnull /*--- Decide how many coding tables to use ---*/
318 ff3adf60 2004-04-14 devnull AssertH ( s->nMTF > 0, 3001 );
319 ff3adf60 2004-04-14 devnull if (s->nMTF < 200) nGroups = 2; else
320 ff3adf60 2004-04-14 devnull if (s->nMTF < 600) nGroups = 3; else
321 ff3adf60 2004-04-14 devnull if (s->nMTF < 1200) nGroups = 4; else
322 ff3adf60 2004-04-14 devnull if (s->nMTF < 2400) nGroups = 5; else
323 ff3adf60 2004-04-14 devnull nGroups = 6;
325 ff3adf60 2004-04-14 devnull /*--- Generate an initial set of coding tables ---*/
327 ff3adf60 2004-04-14 devnull Int32 nPart, remF, tFreq, aFreq;
329 ff3adf60 2004-04-14 devnull nPart = nGroups;
330 ff3adf60 2004-04-14 devnull remF = s->nMTF;
332 ff3adf60 2004-04-14 devnull while (nPart > 0) {
333 ff3adf60 2004-04-14 devnull tFreq = remF / nPart;
334 ff3adf60 2004-04-14 devnull ge = gs-1;
335 ff3adf60 2004-04-14 devnull aFreq = 0;
336 ff3adf60 2004-04-14 devnull while (aFreq < tFreq && ge < alphaSize-1) {
338 ff3adf60 2004-04-14 devnull aFreq += s->mtfFreq[ge];
341 ff3adf60 2004-04-14 devnull if (ge > gs
342 ff3adf60 2004-04-14 devnull && nPart != nGroups && nPart != 1
343 ff3adf60 2004-04-14 devnull && ((nGroups-nPart) % 2 == 1)) {
344 ff3adf60 2004-04-14 devnull aFreq -= s->mtfFreq[ge];
348 ff3adf60 2004-04-14 devnull if (s->verbosity >= 3)
349 ff3adf60 2004-04-14 devnull VPrintf5( " initial group %d, [%d .. %d], "
350 ff3adf60 2004-04-14 devnull "has %d syms (%4.1f%%)\n",
351 ff3adf60 2004-04-14 devnull nPart, gs, ge, aFreq,
352 ff3adf60 2004-04-14 devnull (100.0 * (float)aFreq) / (float)(s->nMTF) );
354 ff3adf60 2004-04-14 devnull for (v = 0; v < alphaSize; v++)
355 ff3adf60 2004-04-14 devnull if (v >= gs && v <= ge)
356 ff3adf60 2004-04-14 devnull s->len[nPart-1][v] = BZ_LESSER_ICOST; else
357 ff3adf60 2004-04-14 devnull s->len[nPart-1][v] = BZ_GREATER_ICOST;
359 ff3adf60 2004-04-14 devnull nPart--;
360 ff3adf60 2004-04-14 devnull gs = ge+1;
361 ff3adf60 2004-04-14 devnull remF -= aFreq;
366 ff3adf60 2004-04-14 devnull Iterate up to BZ_N_ITERS times to improve the tables.
368 ff3adf60 2004-04-14 devnull nSelectors = 40000; /* shut up some compilers' warnings about used and not set */
370 ff3adf60 2004-04-14 devnull for (iter = 0; iter < BZ_N_ITERS; iter++) {
372 ff3adf60 2004-04-14 devnull for (t = 0; t < nGroups; t++) fave[t] = 0;
374 ff3adf60 2004-04-14 devnull for (t = 0; t < nGroups; t++)
375 ff3adf60 2004-04-14 devnull for (v = 0; v < alphaSize; v++)
376 ff3adf60 2004-04-14 devnull s->rfreq[t][v] = 0;
379 ff3adf60 2004-04-14 devnull Set up an auxiliary length table which is used to fast-track
380 ff3adf60 2004-04-14 devnull the common case (nGroups == 6).
382 ff3adf60 2004-04-14 devnull if (nGroups == 6) {
383 ff3adf60 2004-04-14 devnull for (v = 0; v < alphaSize; v++) {
384 ff3adf60 2004-04-14 devnull s->len_pack[v][0] = (s->len[1][v] << 16) | s->len[0][v];
385 ff3adf60 2004-04-14 devnull s->len_pack[v][1] = (s->len[3][v] << 16) | s->len[2][v];
386 ff3adf60 2004-04-14 devnull s->len_pack[v][2] = (s->len[5][v] << 16) | s->len[4][v];
390 ff3adf60 2004-04-14 devnull nSelectors = 0;
391 ff3adf60 2004-04-14 devnull totc = 0;
393 ff3adf60 2004-04-14 devnull while (True) {
395 ff3adf60 2004-04-14 devnull /*--- Set group start & end marks. --*/
396 ff3adf60 2004-04-14 devnull if (gs >= s->nMTF) break;
397 ff3adf60 2004-04-14 devnull ge = gs + BZ_G_SIZE - 1;
398 ff3adf60 2004-04-14 devnull if (ge >= s->nMTF) ge = s->nMTF-1;
401 ff3adf60 2004-04-14 devnull Calculate the cost of this group as coded
402 ff3adf60 2004-04-14 devnull by each of the coding tables.
404 ff3adf60 2004-04-14 devnull for (t = 0; t < nGroups; t++) cost[t] = 0;
406 ff3adf60 2004-04-14 devnull if (nGroups == 6 && 50 == ge-gs+1) {
407 ff3adf60 2004-04-14 devnull /*--- fast track the common case ---*/
408 ff3adf60 2004-04-14 devnull register UInt32 cost01, cost23, cost45;
409 ff3adf60 2004-04-14 devnull register UInt16 icv;
410 ff3adf60 2004-04-14 devnull cost01 = cost23 = cost45 = 0;
412 ff3adf60 2004-04-14 devnull # define BZ_ITER(nn) \
413 ff3adf60 2004-04-14 devnull icv = mtfv[gs+(nn)]; \
414 ff3adf60 2004-04-14 devnull cost01 += s->len_pack[icv][0]; \
415 ff3adf60 2004-04-14 devnull cost23 += s->len_pack[icv][1]; \
416 ff3adf60 2004-04-14 devnull cost45 += s->len_pack[icv][2]; \
418 ff3adf60 2004-04-14 devnull BZ_ITER(0); BZ_ITER(1); BZ_ITER(2); BZ_ITER(3); BZ_ITER(4);
419 ff3adf60 2004-04-14 devnull BZ_ITER(5); BZ_ITER(6); BZ_ITER(7); BZ_ITER(8); BZ_ITER(9);
420 ff3adf60 2004-04-14 devnull BZ_ITER(10); BZ_ITER(11); BZ_ITER(12); BZ_ITER(13); BZ_ITER(14);
421 ff3adf60 2004-04-14 devnull BZ_ITER(15); BZ_ITER(16); BZ_ITER(17); BZ_ITER(18); BZ_ITER(19);
422 ff3adf60 2004-04-14 devnull BZ_ITER(20); BZ_ITER(21); BZ_ITER(22); BZ_ITER(23); BZ_ITER(24);
423 ff3adf60 2004-04-14 devnull BZ_ITER(25); BZ_ITER(26); BZ_ITER(27); BZ_ITER(28); BZ_ITER(29);
424 ff3adf60 2004-04-14 devnull BZ_ITER(30); BZ_ITER(31); BZ_ITER(32); BZ_ITER(33); BZ_ITER(34);
425 ff3adf60 2004-04-14 devnull BZ_ITER(35); BZ_ITER(36); BZ_ITER(37); BZ_ITER(38); BZ_ITER(39);
426 ff3adf60 2004-04-14 devnull BZ_ITER(40); BZ_ITER(41); BZ_ITER(42); BZ_ITER(43); BZ_ITER(44);
427 ff3adf60 2004-04-14 devnull BZ_ITER(45); BZ_ITER(46); BZ_ITER(47); BZ_ITER(48); BZ_ITER(49);
429 ff3adf60 2004-04-14 devnull # undef BZ_ITER
431 ff3adf60 2004-04-14 devnull cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16;
432 ff3adf60 2004-04-14 devnull cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16;
433 ff3adf60 2004-04-14 devnull cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
435 ff3adf60 2004-04-14 devnull } else {
436 ff3adf60 2004-04-14 devnull /*--- slow version which correctly handles all situations ---*/
437 ff3adf60 2004-04-14 devnull for (i = gs; i <= ge; i++) {
438 ff3adf60 2004-04-14 devnull UInt16 icv = mtfv[i];
439 ff3adf60 2004-04-14 devnull for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv];
444 ff3adf60 2004-04-14 devnull Find the coding table which is best for this group,
445 ff3adf60 2004-04-14 devnull and record its identity in the selector table.
447 ff3adf60 2004-04-14 devnull bc = 999999999; bt = -1;
448 ff3adf60 2004-04-14 devnull for (t = 0; t < nGroups; t++)
449 ff3adf60 2004-04-14 devnull if (cost[t] < bc) { bc = cost[t]; bt = t; };
450 ff3adf60 2004-04-14 devnull totc += bc;
451 ff3adf60 2004-04-14 devnull fave[bt]++;
452 ff3adf60 2004-04-14 devnull s->selector[nSelectors] = bt;
453 ff3adf60 2004-04-14 devnull nSelectors++;
456 ff3adf60 2004-04-14 devnull Increment the symbol frequencies for the selected table.
458 ff3adf60 2004-04-14 devnull if (nGroups == 6 && 50 == ge-gs+1) {
459 ff3adf60 2004-04-14 devnull /*--- fast track the common case ---*/
461 ff3adf60 2004-04-14 devnull # define BZ_ITUR(nn) s->rfreq[bt][ mtfv[gs+(nn)] ]++
463 ff3adf60 2004-04-14 devnull BZ_ITUR(0); BZ_ITUR(1); BZ_ITUR(2); BZ_ITUR(3); BZ_ITUR(4);
464 ff3adf60 2004-04-14 devnull BZ_ITUR(5); BZ_ITUR(6); BZ_ITUR(7); BZ_ITUR(8); BZ_ITUR(9);
465 ff3adf60 2004-04-14 devnull BZ_ITUR(10); BZ_ITUR(11); BZ_ITUR(12); BZ_ITUR(13); BZ_ITUR(14);
466 ff3adf60 2004-04-14 devnull BZ_ITUR(15); BZ_ITUR(16); BZ_ITUR(17); BZ_ITUR(18); BZ_ITUR(19);
467 ff3adf60 2004-04-14 devnull BZ_ITUR(20); BZ_ITUR(21); BZ_ITUR(22); BZ_ITUR(23); BZ_ITUR(24);
468 ff3adf60 2004-04-14 devnull BZ_ITUR(25); BZ_ITUR(26); BZ_ITUR(27); BZ_ITUR(28); BZ_ITUR(29);
469 ff3adf60 2004-04-14 devnull BZ_ITUR(30); BZ_ITUR(31); BZ_ITUR(32); BZ_ITUR(33); BZ_ITUR(34);
470 ff3adf60 2004-04-14 devnull BZ_ITUR(35); BZ_ITUR(36); BZ_ITUR(37); BZ_ITUR(38); BZ_ITUR(39);
471 ff3adf60 2004-04-14 devnull BZ_ITUR(40); BZ_ITUR(41); BZ_ITUR(42); BZ_ITUR(43); BZ_ITUR(44);
472 ff3adf60 2004-04-14 devnull BZ_ITUR(45); BZ_ITUR(46); BZ_ITUR(47); BZ_ITUR(48); BZ_ITUR(49);
474 ff3adf60 2004-04-14 devnull # undef BZ_ITUR
476 ff3adf60 2004-04-14 devnull } else {
477 ff3adf60 2004-04-14 devnull /*--- slow version which correctly handles all situations ---*/
478 ff3adf60 2004-04-14 devnull for (i = gs; i <= ge; i++)
479 ff3adf60 2004-04-14 devnull s->rfreq[bt][ mtfv[i] ]++;
482 ff3adf60 2004-04-14 devnull gs = ge+1;
484 ff3adf60 2004-04-14 devnull if (s->verbosity >= 3) {
485 ff3adf60 2004-04-14 devnull VPrintf2 ( " pass %d: size is %d, grp uses are ",
486 ff3adf60 2004-04-14 devnull iter+1, totc/8 );
487 ff3adf60 2004-04-14 devnull for (t = 0; t < nGroups; t++)
488 ff3adf60 2004-04-14 devnull VPrintf1 ( "%d ", fave[t] );
489 ff3adf60 2004-04-14 devnull VPrintf0 ( "\n" );
493 ff3adf60 2004-04-14 devnull Recompute the tables based on the accumulated frequencies.
495 ff3adf60 2004-04-14 devnull for (t = 0; t < nGroups; t++)
496 ff3adf60 2004-04-14 devnull BZ2_hbMakeCodeLengths ( &(s->len[t][0]), &(s->rfreq[t][0]),
497 ff3adf60 2004-04-14 devnull alphaSize, 20 );
501 ff3adf60 2004-04-14 devnull AssertH( nGroups < 8, 3002 );
502 ff3adf60 2004-04-14 devnull AssertH( nSelectors < 32768 &&
503 ff3adf60 2004-04-14 devnull nSelectors <= (2 + (900000 / BZ_G_SIZE)),
507 ff3adf60 2004-04-14 devnull /*--- Compute MTF values for the selectors. ---*/
509 ff3adf60 2004-04-14 devnull UChar pos[BZ_N_GROUPS], ll_i, tmp2, tmp;
510 ff3adf60 2004-04-14 devnull for (i = 0; i < nGroups; i++) pos[i] = i;
511 ff3adf60 2004-04-14 devnull for (i = 0; i < nSelectors; i++) {
512 ff3adf60 2004-04-14 devnull ll_i = s->selector[i];
514 ff3adf60 2004-04-14 devnull tmp = pos[j];
515 ff3adf60 2004-04-14 devnull while ( ll_i != tmp ) {
517 ff3adf60 2004-04-14 devnull tmp2 = tmp;
518 ff3adf60 2004-04-14 devnull tmp = pos[j];
519 ff3adf60 2004-04-14 devnull pos[j] = tmp2;
521 ff3adf60 2004-04-14 devnull pos[0] = tmp;
522 ff3adf60 2004-04-14 devnull s->selectorMtf[i] = j;
526 ff3adf60 2004-04-14 devnull /*--- Assign actual codes for the tables. --*/
527 ff3adf60 2004-04-14 devnull for (t = 0; t < nGroups; t++) {
528 ff3adf60 2004-04-14 devnull minLen = 32;
529 ff3adf60 2004-04-14 devnull maxLen = 0;
530 ff3adf60 2004-04-14 devnull for (i = 0; i < alphaSize; i++) {
531 ff3adf60 2004-04-14 devnull if (s->len[t][i] > maxLen) maxLen = s->len[t][i];
532 ff3adf60 2004-04-14 devnull if (s->len[t][i] < minLen) minLen = s->len[t][i];
534 ff3adf60 2004-04-14 devnull AssertH ( !(maxLen > 20), 3004 );
535 ff3adf60 2004-04-14 devnull AssertH ( !(minLen < 1), 3005 );
536 ff3adf60 2004-04-14 devnull BZ2_hbAssignCodes ( &(s->code[t][0]), &(s->len[t][0]),
537 ff3adf60 2004-04-14 devnull minLen, maxLen, alphaSize );
540 ff3adf60 2004-04-14 devnull /*--- Transmit the mapping table. ---*/
542 ff3adf60 2004-04-14 devnull Bool inUse16[16];
543 ff3adf60 2004-04-14 devnull for (i = 0; i < 16; i++) {
544 ff3adf60 2004-04-14 devnull inUse16[i] = False;
545 ff3adf60 2004-04-14 devnull for (j = 0; j < 16; j++)
546 ff3adf60 2004-04-14 devnull if (s->inUse[i * 16 + j]) inUse16[i] = True;
549 ff3adf60 2004-04-14 devnull nBytes = s->numZ;
550 ff3adf60 2004-04-14 devnull for (i = 0; i < 16; i++)
551 ff3adf60 2004-04-14 devnull if (inUse16[i]) bsW(s,1,1); else bsW(s,1,0);
553 ff3adf60 2004-04-14 devnull for (i = 0; i < 16; i++)
554 ff3adf60 2004-04-14 devnull if (inUse16[i])
555 ff3adf60 2004-04-14 devnull for (j = 0; j < 16; j++) {
556 ff3adf60 2004-04-14 devnull if (s->inUse[i * 16 + j]) bsW(s,1,1); else bsW(s,1,0);
559 ff3adf60 2004-04-14 devnull if (s->verbosity >= 3)
560 ff3adf60 2004-04-14 devnull VPrintf1( " bytes: mapping %d, ", s->numZ-nBytes );
563 ff3adf60 2004-04-14 devnull /*--- Now the selectors. ---*/
564 ff3adf60 2004-04-14 devnull nBytes = s->numZ;
565 ff3adf60 2004-04-14 devnull bsW ( s, 3, nGroups );
566 ff3adf60 2004-04-14 devnull bsW ( s, 15, nSelectors );
567 ff3adf60 2004-04-14 devnull for (i = 0; i < nSelectors; i++) {
568 ff3adf60 2004-04-14 devnull for (j = 0; j < s->selectorMtf[i]; j++) bsW(s,1,1);
569 ff3adf60 2004-04-14 devnull bsW(s,1,0);
571 ff3adf60 2004-04-14 devnull if (s->verbosity >= 3)
572 ff3adf60 2004-04-14 devnull VPrintf1( "selectors %d, ", s->numZ-nBytes );
574 ff3adf60 2004-04-14 devnull /*--- Now the coding tables. ---*/
575 ff3adf60 2004-04-14 devnull nBytes = s->numZ;
577 ff3adf60 2004-04-14 devnull for (t = 0; t < nGroups; t++) {
578 ff3adf60 2004-04-14 devnull Int32 curr = s->len[t][0];
579 ff3adf60 2004-04-14 devnull bsW ( s, 5, curr );
580 ff3adf60 2004-04-14 devnull for (i = 0; i < alphaSize; i++) {
581 ff3adf60 2004-04-14 devnull while (curr < s->len[t][i]) { bsW(s,2,2); curr++; /* 10 */ };
582 ff3adf60 2004-04-14 devnull while (curr > s->len[t][i]) { bsW(s,2,3); curr--; /* 11 */ };
583 ff3adf60 2004-04-14 devnull bsW ( s, 1, 0 );
587 ff3adf60 2004-04-14 devnull if (s->verbosity >= 3)
588 ff3adf60 2004-04-14 devnull VPrintf1 ( "code lengths %d, ", s->numZ-nBytes );
590 ff3adf60 2004-04-14 devnull /*--- And finally, the block data proper ---*/
591 ff3adf60 2004-04-14 devnull nBytes = s->numZ;
592 ff3adf60 2004-04-14 devnull selCtr = 0;
594 ff3adf60 2004-04-14 devnull while (True) {
595 ff3adf60 2004-04-14 devnull if (gs >= s->nMTF) break;
596 ff3adf60 2004-04-14 devnull ge = gs + BZ_G_SIZE - 1;
597 ff3adf60 2004-04-14 devnull if (ge >= s->nMTF) ge = s->nMTF-1;
598 ff3adf60 2004-04-14 devnull AssertH ( s->selector[selCtr] < nGroups, 3006 );
600 ff3adf60 2004-04-14 devnull if (nGroups == 6 && 50 == ge-gs+1) {
601 ff3adf60 2004-04-14 devnull /*--- fast track the common case ---*/
602 ff3adf60 2004-04-14 devnull UInt16 mtfv_i;
603 ff3adf60 2004-04-14 devnull UChar* s_len_sel_selCtr
604 ff3adf60 2004-04-14 devnull = &(s->len[s->selector[selCtr]][0]);
605 ff3adf60 2004-04-14 devnull Int32* s_code_sel_selCtr
606 ff3adf60 2004-04-14 devnull = &(s->code[s->selector[selCtr]][0]);
608 ff3adf60 2004-04-14 devnull # define BZ_ITAH(nn) \
609 ff3adf60 2004-04-14 devnull mtfv_i = mtfv[gs+(nn)]; \
610 ff3adf60 2004-04-14 devnull bsW ( s, \
611 ff3adf60 2004-04-14 devnull s_len_sel_selCtr[mtfv_i], \
612 ff3adf60 2004-04-14 devnull s_code_sel_selCtr[mtfv_i] )
614 ff3adf60 2004-04-14 devnull BZ_ITAH(0); BZ_ITAH(1); BZ_ITAH(2); BZ_ITAH(3); BZ_ITAH(4);
615 ff3adf60 2004-04-14 devnull BZ_ITAH(5); BZ_ITAH(6); BZ_ITAH(7); BZ_ITAH(8); BZ_ITAH(9);
616 ff3adf60 2004-04-14 devnull BZ_ITAH(10); BZ_ITAH(11); BZ_ITAH(12); BZ_ITAH(13); BZ_ITAH(14);
617 ff3adf60 2004-04-14 devnull BZ_ITAH(15); BZ_ITAH(16); BZ_ITAH(17); BZ_ITAH(18); BZ_ITAH(19);
618 ff3adf60 2004-04-14 devnull BZ_ITAH(20); BZ_ITAH(21); BZ_ITAH(22); BZ_ITAH(23); BZ_ITAH(24);
619 ff3adf60 2004-04-14 devnull BZ_ITAH(25); BZ_ITAH(26); BZ_ITAH(27); BZ_ITAH(28); BZ_ITAH(29);
620 ff3adf60 2004-04-14 devnull BZ_ITAH(30); BZ_ITAH(31); BZ_ITAH(32); BZ_ITAH(33); BZ_ITAH(34);
621 ff3adf60 2004-04-14 devnull BZ_ITAH(35); BZ_ITAH(36); BZ_ITAH(37); BZ_ITAH(38); BZ_ITAH(39);
622 ff3adf60 2004-04-14 devnull BZ_ITAH(40); BZ_ITAH(41); BZ_ITAH(42); BZ_ITAH(43); BZ_ITAH(44);
623 ff3adf60 2004-04-14 devnull BZ_ITAH(45); BZ_ITAH(46); BZ_ITAH(47); BZ_ITAH(48); BZ_ITAH(49);
625 ff3adf60 2004-04-14 devnull # undef BZ_ITAH
627 ff3adf60 2004-04-14 devnull } else {
628 ff3adf60 2004-04-14 devnull /*--- slow version which correctly handles all situations ---*/
629 ff3adf60 2004-04-14 devnull for (i = gs; i <= ge; i++) {
630 ff3adf60 2004-04-14 devnull bsW ( s,
631 ff3adf60 2004-04-14 devnull s->len [s->selector[selCtr]] [mtfv[i]],
632 ff3adf60 2004-04-14 devnull s->code [s->selector[selCtr]] [mtfv[i]] );
637 ff3adf60 2004-04-14 devnull gs = ge+1;
638 ff3adf60 2004-04-14 devnull selCtr++;
640 ff3adf60 2004-04-14 devnull AssertH( selCtr == nSelectors, 3007 );
642 ff3adf60 2004-04-14 devnull if (s->verbosity >= 3)
643 ff3adf60 2004-04-14 devnull VPrintf1( "codes %d\n", s->numZ-nBytes );
647 ff3adf60 2004-04-14 devnull /*---------------------------------------------------*/
648 ff3adf60 2004-04-14 devnull void BZ2_compressBlock ( EState* s, Bool is_last_block )
650 ff3adf60 2004-04-14 devnull if (s->nblock > 0) {
652 ff3adf60 2004-04-14 devnull BZ_FINALISE_CRC ( s->blockCRC );
653 ff3adf60 2004-04-14 devnull s->combinedCRC = (s->combinedCRC << 1) | (s->combinedCRC >> 31);
654 ff3adf60 2004-04-14 devnull s->combinedCRC ^= s->blockCRC;
655 ff3adf60 2004-04-14 devnull if (s->blockNo > 1) s->numZ = 0;
657 ff3adf60 2004-04-14 devnull if (s->verbosity >= 2)
658 ff3adf60 2004-04-14 devnull VPrintf4( " block %d: crc = 0x%8x, "
659 ff3adf60 2004-04-14 devnull "combined CRC = 0x%8x, size = %d\n",
660 ff3adf60 2004-04-14 devnull s->blockNo, s->blockCRC, s->combinedCRC, s->nblock );
662 ff3adf60 2004-04-14 devnull BZ2_blockSort ( s );
665 ff3adf60 2004-04-14 devnull s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]);
667 ff3adf60 2004-04-14 devnull /*-- If this is the first block, create the stream header. --*/
668 ff3adf60 2004-04-14 devnull if (s->blockNo == 1) {
669 ff3adf60 2004-04-14 devnull BZ2_bsInitWrite ( s );
670 ff3adf60 2004-04-14 devnull bsPutUChar ( s, 'B' );
671 ff3adf60 2004-04-14 devnull bsPutUChar ( s, 'Z' );
672 ff3adf60 2004-04-14 devnull bsPutUChar ( s, 'h' );
673 ff3adf60 2004-04-14 devnull bsPutUChar ( s, (UChar)('0' + s->blockSize100k) );
676 ff3adf60 2004-04-14 devnull if (s->nblock > 0) {
678 ff3adf60 2004-04-14 devnull bsPutUChar ( s, 0x31 ); bsPutUChar ( s, 0x41 );
679 ff3adf60 2004-04-14 devnull bsPutUChar ( s, 0x59 ); bsPutUChar ( s, 0x26 );
680 ff3adf60 2004-04-14 devnull bsPutUChar ( s, 0x53 ); bsPutUChar ( s, 0x59 );
682 ff3adf60 2004-04-14 devnull /*-- Now the block's CRC, so it is in a known place. --*/
683 ff3adf60 2004-04-14 devnull bsPutUInt32 ( s, s->blockCRC );
686 ff3adf60 2004-04-14 devnull Now a single bit indicating (non-)randomisation.
687 ff3adf60 2004-04-14 devnull As of version 0.9.5, we use a better sorting algorithm
688 ff3adf60 2004-04-14 devnull which makes randomisation unnecessary. So always set
689 ff3adf60 2004-04-14 devnull the randomised bit to 'no'. Of course, the decoder
690 ff3adf60 2004-04-14 devnull still needs to be able to handle randomised blocks
691 ff3adf60 2004-04-14 devnull so as to maintain backwards compatibility with
692 ff3adf60 2004-04-14 devnull older versions of bzip2.
694 ff3adf60 2004-04-14 devnull bsW(s,1,0);
696 ff3adf60 2004-04-14 devnull bsW ( s, 24, s->origPtr );
697 ff3adf60 2004-04-14 devnull generateMTFValues ( s );
698 ff3adf60 2004-04-14 devnull sendMTFValues ( s );
702 ff3adf60 2004-04-14 devnull /*-- If this is the last block, add the stream trailer. --*/
703 ff3adf60 2004-04-14 devnull if (is_last_block) {
705 ff3adf60 2004-04-14 devnull bsPutUChar ( s, 0x17 ); bsPutUChar ( s, 0x72 );
706 ff3adf60 2004-04-14 devnull bsPutUChar ( s, 0x45 ); bsPutUChar ( s, 0x38 );
707 ff3adf60 2004-04-14 devnull bsPutUChar ( s, 0x50 ); bsPutUChar ( s, 0x90 );
708 ff3adf60 2004-04-14 devnull bsPutUInt32 ( s, s->combinedCRC );
709 ff3adf60 2004-04-14 devnull if (s->verbosity >= 2)
710 ff3adf60 2004-04-14 devnull VPrintf1( " final combined CRC = 0x%x\n ", s->combinedCRC );
711 ff3adf60 2004-04-14 devnull bsFinishWrite ( s );
716 ff3adf60 2004-04-14 devnull /*-------------------------------------------------------------*/
717 ff3adf60 2004-04-14 devnull /*--- end compress.c ---*/
718 ff3adf60 2004-04-14 devnull /*-------------------------------------------------------------*/
