michael@0: michael@0: /*-------------------------------------------------------------*/ michael@0: /*--- Decompression machinery ---*/ michael@0: /*--- decompress.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: #include "bzlib_private.h" michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: static michael@0: void makeMaps_d ( DState* 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->seqToUnseq[s->nInUse] = i; michael@0: s->nInUse++; michael@0: } michael@0: } michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: #define RETURN(rrr) \ michael@0: { retVal = rrr; goto save_state_and_return; }; michael@0: michael@0: #define GET_BITS(lll,vvv,nnn) \ michael@0: case lll: s->state = lll; \ michael@0: while (True) { \ michael@0: if (s->bsLive >= nnn) { \ michael@0: UInt32 v; \ michael@0: v = (s->bsBuff >> \ michael@0: (s->bsLive-nnn)) & ((1 << nnn)-1); \ michael@0: s->bsLive -= nnn; \ michael@0: vvv = v; \ michael@0: break; \ michael@0: } \ michael@0: if (s->strm->avail_in == 0) RETURN(BZ_OK); \ michael@0: s->bsBuff \ michael@0: = (s->bsBuff << 8) | \ michael@0: ((UInt32) \ michael@0: (*((UChar*)(s->strm->next_in)))); \ michael@0: s->bsLive += 8; \ michael@0: s->strm->next_in++; \ michael@0: s->strm->avail_in--; \ michael@0: s->strm->total_in_lo32++; \ michael@0: if (s->strm->total_in_lo32 == 0) \ michael@0: s->strm->total_in_hi32++; \ michael@0: } michael@0: michael@0: #define GET_UCHAR(lll,uuu) \ michael@0: GET_BITS(lll,uuu,8) michael@0: michael@0: #define GET_BIT(lll,uuu) \ michael@0: GET_BITS(lll,uuu,1) michael@0: michael@0: /*---------------------------------------------------*/ michael@0: #define GET_MTF_VAL(label1,label2,lval) \ michael@0: { \ michael@0: if (groupPos == 0) { \ michael@0: groupNo++; \ michael@0: if (groupNo >= nSelectors) \ michael@0: RETURN(BZ_DATA_ERROR); \ michael@0: groupPos = BZ_G_SIZE; \ michael@0: gSel = s->selector[groupNo]; \ michael@0: gMinlen = s->minLens[gSel]; \ michael@0: gLimit = &(s->limit[gSel][0]); \ michael@0: gPerm = &(s->perm[gSel][0]); \ michael@0: gBase = &(s->base[gSel][0]); \ michael@0: } \ michael@0: groupPos--; \ michael@0: zn = gMinlen; \ michael@0: GET_BITS(label1, zvec, zn); \ michael@0: while (1) { \ michael@0: if (zn > 20 /* the longest code */) \ michael@0: RETURN(BZ_DATA_ERROR); \ michael@0: if (zvec <= gLimit[zn]) break; \ michael@0: zn++; \ michael@0: GET_BIT(label2, zj); \ michael@0: zvec = (zvec << 1) | zj; \ michael@0: }; \ michael@0: if (zvec - gBase[zn] < 0 \ michael@0: || zvec - gBase[zn] >= BZ_MAX_ALPHA_SIZE) \ michael@0: RETURN(BZ_DATA_ERROR); \ michael@0: lval = gPerm[zvec - gBase[zn]]; \ michael@0: } michael@0: michael@0: michael@0: /*---------------------------------------------------*/ michael@0: Int32 BZ2_decompress ( DState* s ) michael@0: { michael@0: UChar uc; michael@0: Int32 retVal; michael@0: Int32 minLen, maxLen; michael@0: bz_stream* strm = s->strm; michael@0: michael@0: /* stuff that needs to be saved/restored */ michael@0: Int32 i; michael@0: Int32 j; michael@0: Int32 t; michael@0: Int32 alphaSize; michael@0: Int32 nGroups; michael@0: Int32 nSelectors; michael@0: Int32 EOB; michael@0: Int32 groupNo; michael@0: Int32 groupPos; michael@0: Int32 nextSym; michael@0: Int32 nblockMAX; michael@0: Int32 nblock; michael@0: Int32 es; michael@0: Int32 N; michael@0: Int32 curr; michael@0: Int32 zt; michael@0: Int32 zn; michael@0: Int32 zvec; michael@0: Int32 zj; michael@0: Int32 gSel; michael@0: Int32 gMinlen; michael@0: Int32* gLimit; michael@0: Int32* gBase; michael@0: Int32* gPerm; michael@0: michael@0: if (s->state == BZ_X_MAGIC_1) { michael@0: /*initialise the save area*/ michael@0: s->save_i = 0; michael@0: s->save_j = 0; michael@0: s->save_t = 0; michael@0: s->save_alphaSize = 0; michael@0: s->save_nGroups = 0; michael@0: s->save_nSelectors = 0; michael@0: s->save_EOB = 0; michael@0: s->save_groupNo = 0; michael@0: s->save_groupPos = 0; michael@0: s->save_nextSym = 0; michael@0: s->save_nblockMAX = 0; michael@0: s->save_nblock = 0; michael@0: s->save_es = 0; michael@0: s->save_N = 0; michael@0: s->save_curr = 0; michael@0: s->save_zt = 0; michael@0: s->save_zn = 0; michael@0: s->save_zvec = 0; michael@0: s->save_zj = 0; michael@0: s->save_gSel = 0; michael@0: s->save_gMinlen = 0; michael@0: s->save_gLimit = NULL; michael@0: s->save_gBase = NULL; michael@0: s->save_gPerm = NULL; michael@0: } michael@0: michael@0: /*restore from the save area*/ michael@0: i = s->save_i; michael@0: j = s->save_j; michael@0: t = s->save_t; michael@0: alphaSize = s->save_alphaSize; michael@0: nGroups = s->save_nGroups; michael@0: nSelectors = s->save_nSelectors; michael@0: EOB = s->save_EOB; michael@0: groupNo = s->save_groupNo; michael@0: groupPos = s->save_groupPos; michael@0: nextSym = s->save_nextSym; michael@0: nblockMAX = s->save_nblockMAX; michael@0: nblock = s->save_nblock; michael@0: es = s->save_es; michael@0: N = s->save_N; michael@0: curr = s->save_curr; michael@0: zt = s->save_zt; michael@0: zn = s->save_zn; michael@0: zvec = s->save_zvec; michael@0: zj = s->save_zj; michael@0: gSel = s->save_gSel; michael@0: gMinlen = s->save_gMinlen; michael@0: gLimit = s->save_gLimit; michael@0: gBase = s->save_gBase; michael@0: gPerm = s->save_gPerm; michael@0: michael@0: retVal = BZ_OK; michael@0: michael@0: switch (s->state) { michael@0: michael@0: GET_UCHAR(BZ_X_MAGIC_1, uc); michael@0: if (uc != BZ_HDR_B) RETURN(BZ_DATA_ERROR_MAGIC); michael@0: michael@0: GET_UCHAR(BZ_X_MAGIC_2, uc); michael@0: if (uc != BZ_HDR_Z) RETURN(BZ_DATA_ERROR_MAGIC); michael@0: michael@0: GET_UCHAR(BZ_X_MAGIC_3, uc) michael@0: if (uc != BZ_HDR_h) RETURN(BZ_DATA_ERROR_MAGIC); michael@0: michael@0: GET_BITS(BZ_X_MAGIC_4, s->blockSize100k, 8) michael@0: if (s->blockSize100k < (BZ_HDR_0 + 1) || michael@0: s->blockSize100k > (BZ_HDR_0 + 9)) RETURN(BZ_DATA_ERROR_MAGIC); michael@0: s->blockSize100k -= BZ_HDR_0; michael@0: michael@0: if (s->smallDecompress) { michael@0: s->ll16 = BZALLOC( s->blockSize100k * 100000 * sizeof(UInt16) ); michael@0: s->ll4 = BZALLOC( michael@0: ((1 + s->blockSize100k * 100000) >> 1) * sizeof(UChar) michael@0: ); michael@0: if (s->ll16 == NULL || s->ll4 == NULL) RETURN(BZ_MEM_ERROR); michael@0: } else { michael@0: s->tt = BZALLOC( s->blockSize100k * 100000 * sizeof(Int32) ); michael@0: if (s->tt == NULL) RETURN(BZ_MEM_ERROR); michael@0: } michael@0: michael@0: GET_UCHAR(BZ_X_BLKHDR_1, uc); michael@0: michael@0: if (uc == 0x17) goto endhdr_2; michael@0: if (uc != 0x31) RETURN(BZ_DATA_ERROR); michael@0: GET_UCHAR(BZ_X_BLKHDR_2, uc); michael@0: if (uc != 0x41) RETURN(BZ_DATA_ERROR); michael@0: GET_UCHAR(BZ_X_BLKHDR_3, uc); michael@0: if (uc != 0x59) RETURN(BZ_DATA_ERROR); michael@0: GET_UCHAR(BZ_X_BLKHDR_4, uc); michael@0: if (uc != 0x26) RETURN(BZ_DATA_ERROR); michael@0: GET_UCHAR(BZ_X_BLKHDR_5, uc); michael@0: if (uc != 0x53) RETURN(BZ_DATA_ERROR); michael@0: GET_UCHAR(BZ_X_BLKHDR_6, uc); michael@0: if (uc != 0x59) RETURN(BZ_DATA_ERROR); michael@0: michael@0: s->currBlockNo++; michael@0: if (s->verbosity >= 2) michael@0: VPrintf1 ( "\n [%d: huff+mtf ", s->currBlockNo ); michael@0: michael@0: s->storedBlockCRC = 0; michael@0: GET_UCHAR(BZ_X_BCRC_1, uc); michael@0: s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc); michael@0: GET_UCHAR(BZ_X_BCRC_2, uc); michael@0: s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc); michael@0: GET_UCHAR(BZ_X_BCRC_3, uc); michael@0: s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc); michael@0: GET_UCHAR(BZ_X_BCRC_4, uc); michael@0: s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc); michael@0: michael@0: GET_BITS(BZ_X_RANDBIT, s->blockRandomised, 1); michael@0: michael@0: s->origPtr = 0; michael@0: GET_UCHAR(BZ_X_ORIGPTR_1, uc); michael@0: s->origPtr = (s->origPtr << 8) | ((Int32)uc); michael@0: GET_UCHAR(BZ_X_ORIGPTR_2, uc); michael@0: s->origPtr = (s->origPtr << 8) | ((Int32)uc); michael@0: GET_UCHAR(BZ_X_ORIGPTR_3, uc); michael@0: s->origPtr = (s->origPtr << 8) | ((Int32)uc); michael@0: michael@0: if (s->origPtr < 0) michael@0: RETURN(BZ_DATA_ERROR); michael@0: if (s->origPtr > 10 + 100000*s->blockSize100k) michael@0: RETURN(BZ_DATA_ERROR); michael@0: michael@0: /*--- Receive the mapping table ---*/ michael@0: for (i = 0; i < 16; i++) { michael@0: GET_BIT(BZ_X_MAPPING_1, uc); michael@0: if (uc == 1) michael@0: s->inUse16[i] = True; else michael@0: s->inUse16[i] = False; michael@0: } michael@0: michael@0: for (i = 0; i < 256; i++) s->inUse[i] = False; michael@0: michael@0: for (i = 0; i < 16; i++) michael@0: if (s->inUse16[i]) michael@0: for (j = 0; j < 16; j++) { michael@0: GET_BIT(BZ_X_MAPPING_2, uc); michael@0: if (uc == 1) s->inUse[i * 16 + j] = True; michael@0: } michael@0: makeMaps_d ( s ); michael@0: if (s->nInUse == 0) RETURN(BZ_DATA_ERROR); michael@0: alphaSize = s->nInUse+2; michael@0: michael@0: /*--- Now the selectors ---*/ michael@0: GET_BITS(BZ_X_SELECTOR_1, nGroups, 3); michael@0: if (nGroups < 2 || nGroups > 6) RETURN(BZ_DATA_ERROR); michael@0: GET_BITS(BZ_X_SELECTOR_2, nSelectors, 15); michael@0: if (nSelectors < 1) RETURN(BZ_DATA_ERROR); michael@0: for (i = 0; i < nSelectors; i++) { michael@0: j = 0; michael@0: while (True) { michael@0: GET_BIT(BZ_X_SELECTOR_3, uc); michael@0: if (uc == 0) break; michael@0: j++; michael@0: if (j >= nGroups) RETURN(BZ_DATA_ERROR); michael@0: } michael@0: s->selectorMtf[i] = j; michael@0: } michael@0: michael@0: /*--- Undo the MTF values for the selectors. ---*/ michael@0: { michael@0: UChar pos[BZ_N_GROUPS], tmp, v; michael@0: for (v = 0; v < nGroups; v++) pos[v] = v; michael@0: michael@0: for (i = 0; i < nSelectors; i++) { michael@0: v = s->selectorMtf[i]; michael@0: tmp = pos[v]; michael@0: while (v > 0) { pos[v] = pos[v-1]; v--; } michael@0: pos[0] = tmp; michael@0: s->selector[i] = tmp; michael@0: } michael@0: } michael@0: michael@0: /*--- Now the coding tables ---*/ michael@0: for (t = 0; t < nGroups; t++) { michael@0: GET_BITS(BZ_X_CODING_1, curr, 5); michael@0: for (i = 0; i < alphaSize; i++) { michael@0: while (True) { michael@0: if (curr < 1 || curr > 20) RETURN(BZ_DATA_ERROR); michael@0: GET_BIT(BZ_X_CODING_2, uc); michael@0: if (uc == 0) break; michael@0: GET_BIT(BZ_X_CODING_3, uc); michael@0: if (uc == 0) curr++; else curr--; michael@0: } michael@0: s->len[t][i] = curr; michael@0: } michael@0: } michael@0: michael@0: /*--- Create the Huffman decoding 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: BZ2_hbCreateDecodeTables ( michael@0: &(s->limit[t][0]), michael@0: &(s->base[t][0]), michael@0: &(s->perm[t][0]), michael@0: &(s->len[t][0]), michael@0: minLen, maxLen, alphaSize michael@0: ); michael@0: s->minLens[t] = minLen; michael@0: } michael@0: michael@0: /*--- Now the MTF values ---*/ michael@0: michael@0: EOB = s->nInUse+1; michael@0: nblockMAX = 100000 * s->blockSize100k; michael@0: groupNo = -1; michael@0: groupPos = 0; michael@0: michael@0: for (i = 0; i <= 255; i++) s->unzftab[i] = 0; michael@0: michael@0: /*-- MTF init --*/ michael@0: { michael@0: Int32 ii, jj, kk; michael@0: kk = MTFA_SIZE-1; michael@0: for (ii = 256 / MTFL_SIZE - 1; ii >= 0; ii--) { michael@0: for (jj = MTFL_SIZE-1; jj >= 0; jj--) { michael@0: s->mtfa[kk] = (UChar)(ii * MTFL_SIZE + jj); michael@0: kk--; michael@0: } michael@0: s->mtfbase[ii] = kk + 1; michael@0: } michael@0: } michael@0: /*-- end MTF init --*/ michael@0: michael@0: nblock = 0; michael@0: GET_MTF_VAL(BZ_X_MTF_1, BZ_X_MTF_2, nextSym); michael@0: michael@0: while (True) { michael@0: michael@0: if (nextSym == EOB) break; michael@0: michael@0: if (nextSym == BZ_RUNA || nextSym == BZ_RUNB) { michael@0: michael@0: es = -1; michael@0: N = 1; michael@0: do { michael@0: if (nextSym == BZ_RUNA) es = es + (0+1) * N; else michael@0: if (nextSym == BZ_RUNB) es = es + (1+1) * N; michael@0: N = N * 2; michael@0: GET_MTF_VAL(BZ_X_MTF_3, BZ_X_MTF_4, nextSym); michael@0: } michael@0: while (nextSym == BZ_RUNA || nextSym == BZ_RUNB); michael@0: michael@0: es++; michael@0: uc = s->seqToUnseq[ s->mtfa[s->mtfbase[0]] ]; michael@0: s->unzftab[uc] += es; michael@0: michael@0: if (s->smallDecompress) michael@0: while (es > 0) { michael@0: if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); michael@0: s->ll16[nblock] = (UInt16)uc; michael@0: nblock++; michael@0: es--; michael@0: } michael@0: else michael@0: while (es > 0) { michael@0: if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); michael@0: s->tt[nblock] = (UInt32)uc; michael@0: nblock++; michael@0: es--; michael@0: }; michael@0: michael@0: continue; michael@0: michael@0: } else { michael@0: michael@0: if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR); michael@0: michael@0: /*-- uc = MTF ( nextSym-1 ) --*/ michael@0: { michael@0: Int32 ii, jj, kk, pp, lno, off; michael@0: UInt32 nn; michael@0: nn = (UInt32)(nextSym - 1); michael@0: michael@0: if (nn < MTFL_SIZE) { michael@0: /* avoid general-case expense */ michael@0: pp = s->mtfbase[0]; michael@0: uc = s->mtfa[pp+nn]; michael@0: while (nn > 3) { michael@0: Int32 z = pp+nn; michael@0: s->mtfa[(z) ] = s->mtfa[(z)-1]; michael@0: s->mtfa[(z)-1] = s->mtfa[(z)-2]; michael@0: s->mtfa[(z)-2] = s->mtfa[(z)-3]; michael@0: s->mtfa[(z)-3] = s->mtfa[(z)-4]; michael@0: nn -= 4; michael@0: } michael@0: while (nn > 0) { michael@0: s->mtfa[(pp+nn)] = s->mtfa[(pp+nn)-1]; nn--; michael@0: }; michael@0: s->mtfa[pp] = uc; michael@0: } else { michael@0: /* general case */ michael@0: lno = nn / MTFL_SIZE; michael@0: off = nn % MTFL_SIZE; michael@0: pp = s->mtfbase[lno] + off; michael@0: uc = s->mtfa[pp]; michael@0: while (pp > s->mtfbase[lno]) { michael@0: s->mtfa[pp] = s->mtfa[pp-1]; pp--; michael@0: }; michael@0: s->mtfbase[lno]++; michael@0: while (lno > 0) { michael@0: s->mtfbase[lno]--; michael@0: s->mtfa[s->mtfbase[lno]] michael@0: = s->mtfa[s->mtfbase[lno-1] + MTFL_SIZE - 1]; michael@0: lno--; michael@0: } michael@0: s->mtfbase[0]--; michael@0: s->mtfa[s->mtfbase[0]] = uc; michael@0: if (s->mtfbase[0] == 0) { michael@0: kk = MTFA_SIZE-1; michael@0: for (ii = 256 / MTFL_SIZE-1; ii >= 0; ii--) { michael@0: for (jj = MTFL_SIZE-1; jj >= 0; jj--) { michael@0: s->mtfa[kk] = s->mtfa[s->mtfbase[ii] + jj]; michael@0: kk--; michael@0: } michael@0: s->mtfbase[ii] = kk + 1; michael@0: } michael@0: } michael@0: } michael@0: } michael@0: /*-- end uc = MTF ( nextSym-1 ) --*/ michael@0: michael@0: s->unzftab[s->seqToUnseq[uc]]++; michael@0: if (s->smallDecompress) michael@0: s->ll16[nblock] = (UInt16)(s->seqToUnseq[uc]); else michael@0: s->tt[nblock] = (UInt32)(s->seqToUnseq[uc]); michael@0: nblock++; michael@0: michael@0: GET_MTF_VAL(BZ_X_MTF_5, BZ_X_MTF_6, nextSym); michael@0: continue; michael@0: } michael@0: } michael@0: michael@0: /* Now we know what nblock is, we can do a better sanity michael@0: check on s->origPtr. michael@0: */ michael@0: if (s->origPtr < 0 || s->origPtr >= nblock) michael@0: RETURN(BZ_DATA_ERROR); michael@0: michael@0: /*-- Set up cftab to facilitate generation of T^(-1) --*/ michael@0: s->cftab[0] = 0; michael@0: for (i = 1; i <= 256; i++) s->cftab[i] = s->unzftab[i-1]; michael@0: for (i = 1; i <= 256; i++) s->cftab[i] += s->cftab[i-1]; michael@0: for (i = 0; i <= 256; i++) { michael@0: if (s->cftab[i] < 0 || s->cftab[i] > nblock) { michael@0: /* s->cftab[i] can legitimately be == nblock */ michael@0: RETURN(BZ_DATA_ERROR); michael@0: } michael@0: } michael@0: michael@0: s->state_out_len = 0; michael@0: s->state_out_ch = 0; michael@0: BZ_INITIALISE_CRC ( s->calculatedBlockCRC ); michael@0: s->state = BZ_X_OUTPUT; michael@0: if (s->verbosity >= 2) VPrintf0 ( "rt+rld" ); michael@0: michael@0: if (s->smallDecompress) { michael@0: michael@0: /*-- Make a copy of cftab, used in generation of T --*/ michael@0: for (i = 0; i <= 256; i++) s->cftabCopy[i] = s->cftab[i]; michael@0: michael@0: /*-- compute the T vector --*/ michael@0: for (i = 0; i < nblock; i++) { michael@0: uc = (UChar)(s->ll16[i]); michael@0: SET_LL(i, s->cftabCopy[uc]); michael@0: s->cftabCopy[uc]++; michael@0: } michael@0: michael@0: /*-- Compute T^(-1) by pointer reversal on T --*/ michael@0: i = s->origPtr; michael@0: j = GET_LL(i); michael@0: do { michael@0: Int32 tmp = GET_LL(j); michael@0: SET_LL(j, i); michael@0: i = j; michael@0: j = tmp; michael@0: } michael@0: while (i != s->origPtr); michael@0: michael@0: s->tPos = s->origPtr; michael@0: s->nblock_used = 0; michael@0: if (s->blockRandomised) { michael@0: BZ_RAND_INIT_MASK; michael@0: BZ_GET_SMALL(s->k0); s->nblock_used++; michael@0: BZ_RAND_UPD_MASK; s->k0 ^= BZ_RAND_MASK; michael@0: } else { michael@0: BZ_GET_SMALL(s->k0); s->nblock_used++; michael@0: } michael@0: michael@0: } else { michael@0: michael@0: /*-- compute the T^(-1) vector --*/ michael@0: for (i = 0; i < nblock; i++) { michael@0: uc = (UChar)(s->tt[i] & 0xff); michael@0: s->tt[s->cftab[uc]] |= (i << 8); michael@0: s->cftab[uc]++; michael@0: } michael@0: michael@0: s->tPos = s->tt[s->origPtr] >> 8; michael@0: s->nblock_used = 0; michael@0: if (s->blockRandomised) { michael@0: BZ_RAND_INIT_MASK; michael@0: BZ_GET_FAST(s->k0); s->nblock_used++; michael@0: BZ_RAND_UPD_MASK; s->k0 ^= BZ_RAND_MASK; michael@0: } else { michael@0: BZ_GET_FAST(s->k0); s->nblock_used++; michael@0: } michael@0: michael@0: } michael@0: michael@0: RETURN(BZ_OK); michael@0: michael@0: michael@0: michael@0: endhdr_2: michael@0: michael@0: GET_UCHAR(BZ_X_ENDHDR_2, uc); michael@0: if (uc != 0x72) RETURN(BZ_DATA_ERROR); michael@0: GET_UCHAR(BZ_X_ENDHDR_3, uc); michael@0: if (uc != 0x45) RETURN(BZ_DATA_ERROR); michael@0: GET_UCHAR(BZ_X_ENDHDR_4, uc); michael@0: if (uc != 0x38) RETURN(BZ_DATA_ERROR); michael@0: GET_UCHAR(BZ_X_ENDHDR_5, uc); michael@0: if (uc != 0x50) RETURN(BZ_DATA_ERROR); michael@0: GET_UCHAR(BZ_X_ENDHDR_6, uc); michael@0: if (uc != 0x90) RETURN(BZ_DATA_ERROR); michael@0: michael@0: s->storedCombinedCRC = 0; michael@0: GET_UCHAR(BZ_X_CCRC_1, uc); michael@0: s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc); michael@0: GET_UCHAR(BZ_X_CCRC_2, uc); michael@0: s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc); michael@0: GET_UCHAR(BZ_X_CCRC_3, uc); michael@0: s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc); michael@0: GET_UCHAR(BZ_X_CCRC_4, uc); michael@0: s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc); michael@0: michael@0: s->state = BZ_X_IDLE; michael@0: RETURN(BZ_STREAM_END); michael@0: michael@0: default: AssertH ( False, 4001 ); michael@0: } michael@0: michael@0: AssertH ( False, 4002 ); michael@0: michael@0: save_state_and_return: michael@0: michael@0: s->save_i = i; michael@0: s->save_j = j; michael@0: s->save_t = t; michael@0: s->save_alphaSize = alphaSize; michael@0: s->save_nGroups = nGroups; michael@0: s->save_nSelectors = nSelectors; michael@0: s->save_EOB = EOB; michael@0: s->save_groupNo = groupNo; michael@0: s->save_groupPos = groupPos; michael@0: s->save_nextSym = nextSym; michael@0: s->save_nblockMAX = nblockMAX; michael@0: s->save_nblock = nblock; michael@0: s->save_es = es; michael@0: s->save_N = N; michael@0: s->save_curr = curr; michael@0: s->save_zt = zt; michael@0: s->save_zn = zn; michael@0: s->save_zvec = zvec; michael@0: s->save_zj = zj; michael@0: s->save_gSel = gSel; michael@0: s->save_gMinlen = gMinlen; michael@0: s->save_gLimit = gLimit; michael@0: s->save_gBase = gBase; michael@0: s->save_gPerm = gPerm; michael@0: michael@0: return retVal; michael@0: } michael@0: michael@0: michael@0: /*-------------------------------------------------------------*/ michael@0: /*--- end decompress.c ---*/ michael@0: /*-------------------------------------------------------------*/