bzlib_decompress.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674
  1. #include <config.h>
  2. #include <common.h>
  3. #include <watchdog.h>
  4. /*-------------------------------------------------------------*/
  5. /*--- Decompression machinery ---*/
  6. /*--- decompress.c ---*/
  7. /*-------------------------------------------------------------*/
  8. /*--
  9. This file is a part of bzip2 and/or libbzip2, a program and
  10. library for lossless, block-sorting data compression.
  11. Copyright (C) 1996-2002 Julian R Seward. All rights reserved.
  12. Redistribution and use in source and binary forms, with or without
  13. modification, are permitted provided that the following conditions
  14. are met:
  15. 1. Redistributions of source code must retain the above copyright
  16. notice, this list of conditions and the following disclaimer.
  17. 2. The origin of this software must not be misrepresented; you must
  18. not claim that you wrote the original software. If you use this
  19. software in a product, an acknowledgment in the product
  20. documentation would be appreciated but is not required.
  21. 3. Altered source versions must be plainly marked as such, and must
  22. not be misrepresented as being the original software.
  23. 4. The name of the author may not be used to endorse or promote
  24. products derived from this software without specific prior written
  25. permission.
  26. THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
  27. OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  28. WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  29. ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  30. DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  31. DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
  32. GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  33. INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
  34. WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
  35. NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  36. SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  37. Julian Seward, Cambridge, UK.
  38. jseward@acm.org
  39. bzip2/libbzip2 version 1.0 of 21 March 2000
  40. This program is based on (at least) the work of:
  41. Mike Burrows
  42. David Wheeler
  43. Peter Fenwick
  44. Alistair Moffat
  45. Radford Neal
  46. Ian H. Witten
  47. Robert Sedgewick
  48. Jon L. Bentley
  49. For more information on these sources, see the manual.
  50. --*/
  51. #include "bzlib_private.h"
  52. /*---------------------------------------------------*/
  53. static
  54. void makeMaps_d ( DState* s )
  55. {
  56. Int32 i;
  57. s->nInUse = 0;
  58. for (i = 0; i < 256; i++)
  59. if (s->inUse[i]) {
  60. s->seqToUnseq[s->nInUse] = i;
  61. s->nInUse++;
  62. }
  63. }
  64. /*---------------------------------------------------*/
  65. #define RETURN(rrr) \
  66. { retVal = rrr; goto save_state_and_return; };
  67. #define GET_BITS(lll,vvv,nnn) \
  68. case lll: s->state = lll; \
  69. while (True) { \
  70. if (s->bsLive >= nnn) { \
  71. UInt32 v; \
  72. v = (s->bsBuff >> \
  73. (s->bsLive-nnn)) & ((1 << nnn)-1); \
  74. s->bsLive -= nnn; \
  75. vvv = v; \
  76. break; \
  77. } \
  78. if (s->strm->avail_in == 0) RETURN(BZ_OK); \
  79. s->bsBuff \
  80. = (s->bsBuff << 8) | \
  81. ((UInt32) \
  82. (*((UChar*)(s->strm->next_in)))); \
  83. s->bsLive += 8; \
  84. s->strm->next_in++; \
  85. s->strm->avail_in--; \
  86. s->strm->total_in_lo32++; \
  87. if (s->strm->total_in_lo32 == 0) \
  88. s->strm->total_in_hi32++; \
  89. }
  90. #define GET_UCHAR(lll,uuu) \
  91. GET_BITS(lll,uuu,8)
  92. #define GET_BIT(lll,uuu) \
  93. GET_BITS(lll,uuu,1)
  94. /*---------------------------------------------------*/
  95. #define GET_MTF_VAL(label1,label2,lval) \
  96. { \
  97. if (groupPos == 0) { \
  98. groupNo++; \
  99. if (groupNo >= nSelectors) \
  100. RETURN(BZ_DATA_ERROR); \
  101. groupPos = BZ_G_SIZE; \
  102. gSel = s->selector[groupNo]; \
  103. gMinlen = s->minLens[gSel]; \
  104. gLimit = &(s->limit[gSel][0]); \
  105. gPerm = &(s->perm[gSel][0]); \
  106. gBase = &(s->base[gSel][0]); \
  107. } \
  108. groupPos--; \
  109. zn = gMinlen; \
  110. GET_BITS(label1, zvec, zn); \
  111. while (1) { \
  112. if (zn > 20 /* the longest code */) \
  113. RETURN(BZ_DATA_ERROR); \
  114. if (zvec <= gLimit[zn]) break; \
  115. zn++; \
  116. GET_BIT(label2, zj); \
  117. zvec = (zvec << 1) | zj; \
  118. }; \
  119. if (zvec - gBase[zn] < 0 \
  120. || zvec - gBase[zn] >= BZ_MAX_ALPHA_SIZE) \
  121. RETURN(BZ_DATA_ERROR); \
  122. lval = gPerm[zvec - gBase[zn]]; \
  123. }
  124. /*---------------------------------------------------*/
  125. Int32 BZ2_decompress ( DState* s )
  126. {
  127. UChar uc;
  128. Int32 retVal;
  129. Int32 minLen, maxLen;
  130. bz_stream* strm = s->strm;
  131. /* stuff that needs to be saved/restored */
  132. Int32 i;
  133. Int32 j;
  134. Int32 t;
  135. Int32 alphaSize;
  136. Int32 nGroups;
  137. Int32 nSelectors;
  138. Int32 EOB;
  139. Int32 groupNo;
  140. Int32 groupPos;
  141. Int32 nextSym;
  142. Int32 nblockMAX;
  143. Int32 nblock;
  144. Int32 es;
  145. Int32 N;
  146. Int32 curr;
  147. Int32 zt;
  148. Int32 zn;
  149. Int32 zvec;
  150. Int32 zj;
  151. Int32 gSel;
  152. Int32 gMinlen;
  153. Int32* gLimit;
  154. Int32* gBase;
  155. Int32* gPerm;
  156. if (s->state == BZ_X_MAGIC_1) {
  157. /*initialise the save area*/
  158. s->save_i = 0;
  159. s->save_j = 0;
  160. s->save_t = 0;
  161. s->save_alphaSize = 0;
  162. s->save_nGroups = 0;
  163. s->save_nSelectors = 0;
  164. s->save_EOB = 0;
  165. s->save_groupNo = 0;
  166. s->save_groupPos = 0;
  167. s->save_nextSym = 0;
  168. s->save_nblockMAX = 0;
  169. s->save_nblock = 0;
  170. s->save_es = 0;
  171. s->save_N = 0;
  172. s->save_curr = 0;
  173. s->save_zt = 0;
  174. s->save_zn = 0;
  175. s->save_zvec = 0;
  176. s->save_zj = 0;
  177. s->save_gSel = 0;
  178. s->save_gMinlen = 0;
  179. s->save_gLimit = NULL;
  180. s->save_gBase = NULL;
  181. s->save_gPerm = NULL;
  182. }
  183. /*restore from the save area*/
  184. i = s->save_i;
  185. j = s->save_j;
  186. t = s->save_t;
  187. alphaSize = s->save_alphaSize;
  188. nGroups = s->save_nGroups;
  189. nSelectors = s->save_nSelectors;
  190. EOB = s->save_EOB;
  191. groupNo = s->save_groupNo;
  192. groupPos = s->save_groupPos;
  193. nextSym = s->save_nextSym;
  194. nblockMAX = s->save_nblockMAX;
  195. nblock = s->save_nblock;
  196. es = s->save_es;
  197. N = s->save_N;
  198. curr = s->save_curr;
  199. zt = s->save_zt;
  200. zn = s->save_zn;
  201. zvec = s->save_zvec;
  202. zj = s->save_zj;
  203. gSel = s->save_gSel;
  204. gMinlen = s->save_gMinlen;
  205. gLimit = s->save_gLimit;
  206. gBase = s->save_gBase;
  207. gPerm = s->save_gPerm;
  208. retVal = BZ_OK;
  209. switch (s->state) {
  210. GET_UCHAR(BZ_X_MAGIC_1, uc);
  211. if (uc != BZ_HDR_B) RETURN(BZ_DATA_ERROR_MAGIC);
  212. GET_UCHAR(BZ_X_MAGIC_2, uc);
  213. if (uc != BZ_HDR_Z) RETURN(BZ_DATA_ERROR_MAGIC);
  214. GET_UCHAR(BZ_X_MAGIC_3, uc)
  215. if (uc != BZ_HDR_h) RETURN(BZ_DATA_ERROR_MAGIC);
  216. GET_BITS(BZ_X_MAGIC_4, s->blockSize100k, 8)
  217. if (s->blockSize100k < (BZ_HDR_0 + 1) ||
  218. s->blockSize100k > (BZ_HDR_0 + 9)) RETURN(BZ_DATA_ERROR_MAGIC);
  219. s->blockSize100k -= BZ_HDR_0;
  220. if (s->smallDecompress) {
  221. s->ll16 = BZALLOC( s->blockSize100k * 100000 * sizeof(UInt16) );
  222. s->ll4 = BZALLOC(
  223. ((1 + s->blockSize100k * 100000) >> 1) * sizeof(UChar)
  224. );
  225. if (s->ll16 == NULL || s->ll4 == NULL) RETURN(BZ_MEM_ERROR);
  226. } else {
  227. s->tt = BZALLOC( s->blockSize100k * 100000 * sizeof(Int32) );
  228. if (s->tt == NULL) RETURN(BZ_MEM_ERROR);
  229. }
  230. GET_UCHAR(BZ_X_BLKHDR_1, uc);
  231. if (uc == 0x17) goto endhdr_2;
  232. if (uc != 0x31) RETURN(BZ_DATA_ERROR);
  233. GET_UCHAR(BZ_X_BLKHDR_2, uc);
  234. if (uc != 0x41) RETURN(BZ_DATA_ERROR);
  235. GET_UCHAR(BZ_X_BLKHDR_3, uc);
  236. if (uc != 0x59) RETURN(BZ_DATA_ERROR);
  237. GET_UCHAR(BZ_X_BLKHDR_4, uc);
  238. if (uc != 0x26) RETURN(BZ_DATA_ERROR);
  239. GET_UCHAR(BZ_X_BLKHDR_5, uc);
  240. if (uc != 0x53) RETURN(BZ_DATA_ERROR);
  241. GET_UCHAR(BZ_X_BLKHDR_6, uc);
  242. if (uc != 0x59) RETURN(BZ_DATA_ERROR);
  243. s->currBlockNo++;
  244. if (s->verbosity >= 2)
  245. VPrintf1 ( "\n [%d: huff+mtf ", s->currBlockNo );
  246. s->storedBlockCRC = 0;
  247. GET_UCHAR(BZ_X_BCRC_1, uc);
  248. s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
  249. GET_UCHAR(BZ_X_BCRC_2, uc);
  250. s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
  251. GET_UCHAR(BZ_X_BCRC_3, uc);
  252. s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
  253. GET_UCHAR(BZ_X_BCRC_4, uc);
  254. s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
  255. GET_BITS(BZ_X_RANDBIT, s->blockRandomised, 1);
  256. s->origPtr = 0;
  257. GET_UCHAR(BZ_X_ORIGPTR_1, uc);
  258. s->origPtr = (s->origPtr << 8) | ((Int32)uc);
  259. GET_UCHAR(BZ_X_ORIGPTR_2, uc);
  260. s->origPtr = (s->origPtr << 8) | ((Int32)uc);
  261. GET_UCHAR(BZ_X_ORIGPTR_3, uc);
  262. s->origPtr = (s->origPtr << 8) | ((Int32)uc);
  263. if (s->origPtr < 0)
  264. RETURN(BZ_DATA_ERROR);
  265. if (s->origPtr > 10 + 100000*s->blockSize100k)
  266. RETURN(BZ_DATA_ERROR);
  267. /*--- Receive the mapping table ---*/
  268. for (i = 0; i < 16; i++) {
  269. GET_BIT(BZ_X_MAPPING_1, uc);
  270. if (uc == 1)
  271. s->inUse16[i] = True; else
  272. s->inUse16[i] = False;
  273. }
  274. for (i = 0; i < 256; i++) s->inUse[i] = False;
  275. for (i = 0; i < 16; i++)
  276. if (s->inUse16[i])
  277. for (j = 0; j < 16; j++) {
  278. GET_BIT(BZ_X_MAPPING_2, uc);
  279. if (uc == 1) s->inUse[i * 16 + j] = True;
  280. }
  281. makeMaps_d ( s );
  282. if (s->nInUse == 0) RETURN(BZ_DATA_ERROR);
  283. alphaSize = s->nInUse+2;
  284. /*--- Now the selectors ---*/
  285. GET_BITS(BZ_X_SELECTOR_1, nGroups, 3);
  286. if (nGroups < 2 || nGroups > 6) RETURN(BZ_DATA_ERROR);
  287. GET_BITS(BZ_X_SELECTOR_2, nSelectors, 15);
  288. if (nSelectors < 1) RETURN(BZ_DATA_ERROR);
  289. for (i = 0; i < nSelectors; i++) {
  290. j = 0;
  291. while (True) {
  292. GET_BIT(BZ_X_SELECTOR_3, uc);
  293. if (uc == 0) break;
  294. j++;
  295. if (j >= nGroups) RETURN(BZ_DATA_ERROR);
  296. }
  297. s->selectorMtf[i] = j;
  298. }
  299. /*--- Undo the MTF values for the selectors. ---*/
  300. {
  301. UChar pos[BZ_N_GROUPS], tmp, v;
  302. for (v = 0; v < nGroups; v++) pos[v] = v;
  303. for (i = 0; i < nSelectors; i++) {
  304. v = s->selectorMtf[i];
  305. tmp = pos[v];
  306. while (v > 0) { pos[v] = pos[v-1]; v--; }
  307. pos[0] = tmp;
  308. s->selector[i] = tmp;
  309. }
  310. }
  311. /*--- Now the coding tables ---*/
  312. for (t = 0; t < nGroups; t++) {
  313. GET_BITS(BZ_X_CODING_1, curr, 5);
  314. for (i = 0; i < alphaSize; i++) {
  315. while (True) {
  316. if (curr < 1 || curr > 20) RETURN(BZ_DATA_ERROR);
  317. GET_BIT(BZ_X_CODING_2, uc);
  318. if (uc == 0) break;
  319. GET_BIT(BZ_X_CODING_3, uc);
  320. if (uc == 0) curr++; else curr--;
  321. }
  322. s->len[t][i] = curr;
  323. }
  324. }
  325. /*--- Create the Huffman decoding tables ---*/
  326. for (t = 0; t < nGroups; t++) {
  327. minLen = 32;
  328. maxLen = 0;
  329. for (i = 0; i < alphaSize; i++) {
  330. if (s->len[t][i] > maxLen) maxLen = s->len[t][i];
  331. if (s->len[t][i] < minLen) minLen = s->len[t][i];
  332. }
  333. BZ2_hbCreateDecodeTables (
  334. &(s->limit[t][0]),
  335. &(s->base[t][0]),
  336. &(s->perm[t][0]),
  337. &(s->len[t][0]),
  338. minLen, maxLen, alphaSize
  339. );
  340. s->minLens[t] = minLen;
  341. }
  342. /*--- Now the MTF values ---*/
  343. EOB = s->nInUse+1;
  344. nblockMAX = 100000 * s->blockSize100k;
  345. groupNo = -1;
  346. groupPos = 0;
  347. for (i = 0; i <= 255; i++) s->unzftab[i] = 0;
  348. /*-- MTF init --*/
  349. {
  350. Int32 ii, jj, kk;
  351. kk = MTFA_SIZE-1;
  352. for (ii = 256 / MTFL_SIZE - 1; ii >= 0; ii--) {
  353. for (jj = MTFL_SIZE-1; jj >= 0; jj--) {
  354. s->mtfa[kk] = (UChar)(ii * MTFL_SIZE + jj);
  355. kk--;
  356. }
  357. s->mtfbase[ii] = kk + 1;
  358. }
  359. }
  360. /*-- end MTF init --*/
  361. nblock = 0;
  362. GET_MTF_VAL(BZ_X_MTF_1, BZ_X_MTF_2, nextSym);
  363. while (True) {
  364. #if defined(CONFIG_HW_WATCHDOG) || defined(CONFIG_WATCHDOG)
  365. WATCHDOG_RESET();
  366. #endif
  367. if (nextSym == EOB) break;
  368. if (nextSym == BZ_RUNA || nextSym == BZ_RUNB) {
  369. es = -1;
  370. N = 1;
  371. do {
  372. if (nextSym == BZ_RUNA) es = es + (0+1) * N; else
  373. if (nextSym == BZ_RUNB) es = es + (1+1) * N;
  374. N = N * 2;
  375. GET_MTF_VAL(BZ_X_MTF_3, BZ_X_MTF_4, nextSym);
  376. }
  377. while (nextSym == BZ_RUNA || nextSym == BZ_RUNB);
  378. es++;
  379. uc = s->seqToUnseq[ s->mtfa[s->mtfbase[0]] ];
  380. s->unzftab[uc] += es;
  381. if (s->smallDecompress)
  382. while (es > 0) {
  383. if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
  384. s->ll16[nblock] = (UInt16)uc;
  385. nblock++;
  386. es--;
  387. }
  388. else
  389. while (es > 0) {
  390. if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
  391. s->tt[nblock] = (UInt32)uc;
  392. nblock++;
  393. es--;
  394. };
  395. continue;
  396. } else {
  397. if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
  398. /*-- uc = MTF ( nextSym-1 ) --*/
  399. {
  400. Int32 ii, jj, kk, pp, lno, off;
  401. UInt32 nn;
  402. nn = (UInt32)(nextSym - 1);
  403. if (nn < MTFL_SIZE) {
  404. /* avoid general-case expense */
  405. pp = s->mtfbase[0];
  406. uc = s->mtfa[pp+nn];
  407. while (nn > 3) {
  408. Int32 z = pp+nn;
  409. s->mtfa[(z) ] = s->mtfa[(z)-1];
  410. s->mtfa[(z)-1] = s->mtfa[(z)-2];
  411. s->mtfa[(z)-2] = s->mtfa[(z)-3];
  412. s->mtfa[(z)-3] = s->mtfa[(z)-4];
  413. nn -= 4;
  414. }
  415. while (nn > 0) {
  416. s->mtfa[(pp+nn)] = s->mtfa[(pp+nn)-1]; nn--;
  417. };
  418. s->mtfa[pp] = uc;
  419. } else {
  420. /* general case */
  421. lno = nn / MTFL_SIZE;
  422. off = nn % MTFL_SIZE;
  423. pp = s->mtfbase[lno] + off;
  424. uc = s->mtfa[pp];
  425. while (pp > s->mtfbase[lno]) {
  426. s->mtfa[pp] = s->mtfa[pp-1]; pp--;
  427. };
  428. s->mtfbase[lno]++;
  429. while (lno > 0) {
  430. s->mtfbase[lno]--;
  431. s->mtfa[s->mtfbase[lno]]
  432. = s->mtfa[s->mtfbase[lno-1] + MTFL_SIZE - 1];
  433. lno--;
  434. }
  435. s->mtfbase[0]--;
  436. s->mtfa[s->mtfbase[0]] = uc;
  437. if (s->mtfbase[0] == 0) {
  438. kk = MTFA_SIZE-1;
  439. for (ii = 256 / MTFL_SIZE-1; ii >= 0; ii--) {
  440. #if defined(CONFIG_HW_WATCHDOG) || defined(CONFIG_WATCHDOG)
  441. WATCHDOG_RESET();
  442. #endif
  443. for (jj = MTFL_SIZE-1; jj >= 0; jj--) {
  444. s->mtfa[kk] = s->mtfa[s->mtfbase[ii] + jj];
  445. kk--;
  446. }
  447. s->mtfbase[ii] = kk + 1;
  448. }
  449. }
  450. }
  451. }
  452. /*-- end uc = MTF ( nextSym-1 ) --*/
  453. s->unzftab[s->seqToUnseq[uc]]++;
  454. if (s->smallDecompress)
  455. s->ll16[nblock] = (UInt16)(s->seqToUnseq[uc]); else
  456. s->tt[nblock] = (UInt32)(s->seqToUnseq[uc]);
  457. nblock++;
  458. GET_MTF_VAL(BZ_X_MTF_5, BZ_X_MTF_6, nextSym);
  459. continue;
  460. }
  461. }
  462. /* Now we know what nblock is, we can do a better sanity
  463. check on s->origPtr.
  464. */
  465. if (s->origPtr < 0 || s->origPtr >= nblock)
  466. RETURN(BZ_DATA_ERROR);
  467. s->state_out_len = 0;
  468. s->state_out_ch = 0;
  469. BZ_INITIALISE_CRC ( s->calculatedBlockCRC );
  470. s->state = BZ_X_OUTPUT;
  471. if (s->verbosity >= 2) VPrintf0 ( "rt+rld" );
  472. /*-- Set up cftab to facilitate generation of T^(-1) --*/
  473. s->cftab[0] = 0;
  474. for (i = 1; i <= 256; i++) s->cftab[i] = s->unzftab[i-1];
  475. for (i = 1; i <= 256; i++) s->cftab[i] += s->cftab[i-1];
  476. if (s->smallDecompress) {
  477. /*-- Make a copy of cftab, used in generation of T --*/
  478. for (i = 0; i <= 256; i++) s->cftabCopy[i] = s->cftab[i];
  479. /*-- compute the T vector --*/
  480. for (i = 0; i < nblock; i++) {
  481. uc = (UChar)(s->ll16[i]);
  482. SET_LL(i, s->cftabCopy[uc]);
  483. s->cftabCopy[uc]++;
  484. }
  485. /*-- Compute T^(-1) by pointer reversal on T --*/
  486. i = s->origPtr;
  487. j = GET_LL(i);
  488. do {
  489. Int32 tmp = GET_LL(j);
  490. SET_LL(j, i);
  491. i = j;
  492. j = tmp;
  493. }
  494. while (i != s->origPtr);
  495. #if defined(CONFIG_HW_WATCHDOG) || defined(CONFIG_WATCHDOG)
  496. WATCHDOG_RESET();
  497. #endif
  498. s->tPos = s->origPtr;
  499. s->nblock_used = 0;
  500. if (s->blockRandomised) {
  501. BZ_RAND_INIT_MASK;
  502. BZ_GET_SMALL(s->k0); s->nblock_used++;
  503. BZ_RAND_UPD_MASK; s->k0 ^= BZ_RAND_MASK;
  504. } else {
  505. BZ_GET_SMALL(s->k0); s->nblock_used++;
  506. }
  507. } else {
  508. #if defined(CONFIG_HW_WATCHDOG) || defined(CONFIG_WATCHDOG)
  509. WATCHDOG_RESET();
  510. #endif
  511. /*-- compute the T^(-1) vector --*/
  512. for (i = 0; i < nblock; i++) {
  513. uc = (UChar)(s->tt[i] & 0xff);
  514. s->tt[s->cftab[uc]] |= (i << 8);
  515. s->cftab[uc]++;
  516. }
  517. s->tPos = s->tt[s->origPtr] >> 8;
  518. s->nblock_used = 0;
  519. if (s->blockRandomised) {
  520. BZ_RAND_INIT_MASK;
  521. BZ_GET_FAST(s->k0); s->nblock_used++;
  522. BZ_RAND_UPD_MASK; s->k0 ^= BZ_RAND_MASK;
  523. } else {
  524. BZ_GET_FAST(s->k0); s->nblock_used++;
  525. }
  526. }
  527. RETURN(BZ_OK);
  528. endhdr_2:
  529. GET_UCHAR(BZ_X_ENDHDR_2, uc);
  530. if (uc != 0x72) RETURN(BZ_DATA_ERROR);
  531. GET_UCHAR(BZ_X_ENDHDR_3, uc);
  532. if (uc != 0x45) RETURN(BZ_DATA_ERROR);
  533. GET_UCHAR(BZ_X_ENDHDR_4, uc);
  534. if (uc != 0x38) RETURN(BZ_DATA_ERROR);
  535. GET_UCHAR(BZ_X_ENDHDR_5, uc);
  536. if (uc != 0x50) RETURN(BZ_DATA_ERROR);
  537. GET_UCHAR(BZ_X_ENDHDR_6, uc);
  538. if (uc != 0x90) RETURN(BZ_DATA_ERROR);
  539. s->storedCombinedCRC = 0;
  540. GET_UCHAR(BZ_X_CCRC_1, uc);
  541. s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc);
  542. GET_UCHAR(BZ_X_CCRC_2, uc);
  543. s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc);
  544. GET_UCHAR(BZ_X_CCRC_3, uc);
  545. s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc);
  546. GET_UCHAR(BZ_X_CCRC_4, uc);
  547. s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc);
  548. s->state = BZ_X_IDLE;
  549. RETURN(BZ_STREAM_END);
  550. default: AssertH ( False, 4001 );
  551. }
  552. AssertH ( False, 4002 );
  553. save_state_and_return:
  554. s->save_i = i;
  555. s->save_j = j;
  556. s->save_t = t;
  557. s->save_alphaSize = alphaSize;
  558. s->save_nGroups = nGroups;
  559. s->save_nSelectors = nSelectors;
  560. s->save_EOB = EOB;
  561. s->save_groupNo = groupNo;
  562. s->save_groupPos = groupPos;
  563. s->save_nextSym = nextSym;
  564. s->save_nblockMAX = nblockMAX;
  565. s->save_nblock = nblock;
  566. s->save_es = es;
  567. s->save_N = N;
  568. s->save_curr = curr;
  569. s->save_zt = zt;
  570. s->save_zn = zn;
  571. s->save_zvec = zvec;
  572. s->save_zj = zj;
  573. s->save_gSel = gSel;
  574. s->save_gMinlen = gMinlen;
  575. s->save_gLimit = gLimit;
  576. s->save_gBase = gBase;
  577. s->save_gPerm = gPerm;
  578. return retVal;
  579. }
  580. /*-------------------------------------------------------------*/
  581. /*--- end decompress.c ---*/
  582. /*-------------------------------------------------------------*/