Coverage Report

Created: 2025-08-03 06:36

/src/bzip2/bzlib.c
Line
Count
Source (jump to first uncovered line)
1
2
/*-------------------------------------------------------------*/
3
/*--- Library top-level functions.                          ---*/
4
/*---                                               bzlib.c ---*/
5
/*-------------------------------------------------------------*/
6
7
/* ------------------------------------------------------------------
8
   This file is part of bzip2/libbzip2, a program and library for
9
   lossless, block-sorting data compression.
10
11
   bzip2/libbzip2 version 1.0.8 of 13 July 2019
12
   Copyright (C) 1996-2019 Julian Seward <jseward@acm.org>
13
14
   Please read the WARNING, DISCLAIMER and PATENTS sections in the 
15
   README file.
16
17
   This program is released under the terms of the license contained
18
   in the file LICENSE.
19
   ------------------------------------------------------------------ */
20
21
/* CHANGES
22
   0.9.0    -- original version.
23
   0.9.0a/b -- no changes in this file.
24
   0.9.0c   -- made zero-length BZ_FLUSH work correctly in bzCompress().
25
     fixed bzWrite/bzRead to ignore zero-length requests.
26
     fixed bzread to correctly handle read requests after EOF.
27
     wrong parameter order in call to bzDecompressInit in
28
     bzBuffToBuffDecompress.  Fixed.
29
*/
30
31
#include "bzlib_private.h"
32
33
34
/*---------------------------------------------------*/
35
/*--- Compression stuff                           ---*/
36
/*---------------------------------------------------*/
37
38
39
/*---------------------------------------------------*/
40
#ifndef BZ_NO_STDIO
41
void BZ2_bz__AssertH__fail ( int errcode )
42
0
{
43
0
   fprintf(stderr, 
44
0
      "\n\nbzip2/libbzip2: internal error number %d.\n"
45
0
      "This is a bug in bzip2/libbzip2, %s.\n"
46
0
      "Please report it to: bzip2-devel@sourceware.org.  If this happened\n"
47
0
      "when you were using some program which uses libbzip2 as a\n"
48
0
      "component, you should also report this bug to the author(s)\n"
49
0
      "of that program.  Please make an effort to report this bug;\n"
50
0
      "timely and accurate bug reports eventually lead to higher\n"
51
0
      "quality software.  Thanks.\n\n",
52
0
      errcode,
53
0
      BZ2_bzlibVersion()
54
0
   );
55
56
0
   if (errcode == 1007) {
57
0
   fprintf(stderr,
58
0
      "\n*** A special note about internal error number 1007 ***\n"
59
0
      "\n"
60
0
      "Experience suggests that a common cause of i.e. 1007\n"
61
0
      "is unreliable memory or other hardware.  The 1007 assertion\n"
62
0
      "just happens to cross-check the results of huge numbers of\n"
63
0
      "memory reads/writes, and so acts (unintendedly) as a stress\n"
64
0
      "test of your memory system.\n"
65
0
      "\n"
66
0
      "I suggest the following: try compressing the file again,\n"
67
0
      "possibly monitoring progress in detail with the -vv flag.\n"
68
0
      "\n"
69
0
      "* If the error cannot be reproduced, and/or happens at different\n"
70
0
      "  points in compression, you may have a flaky memory system.\n"
71
0
      "  Try a memory-test program.  I have used Memtest86\n"
72
0
      "  (www.memtest86.com).  At the time of writing it is free (GPLd).\n"
73
0
      "  Memtest86 tests memory much more thorougly than your BIOSs\n"
74
0
      "  power-on test, and may find failures that the BIOS doesn't.\n"
75
0
      "\n"
76
0
      "* If the error can be repeatably reproduced, this is a bug in\n"
77
0
      "  bzip2, and I would very much like to hear about it.  Please\n"
78
0
      "  let me know, and, ideally, save a copy of the file causing the\n"
79
0
      "  problem -- without which I will be unable to investigate it.\n"
80
0
      "\n"
81
0
   );
82
0
   }
83
84
0
   exit(3);
85
0
}
86
#endif
87
88
89
/*---------------------------------------------------*/
90
static
91
int bz_config_ok ( void )
92
5.48k
{
93
5.48k
   if (sizeof(int)   != 4) return 0;
94
5.48k
   if (sizeof(short) != 2) return 0;
95
5.48k
   if (sizeof(char)  != 1) return 0;
96
5.48k
   return 1;
97
5.48k
}
98
99
100
/*---------------------------------------------------*/
101
static
102
void* default_bzalloc ( void* opaque, Int32 items, Int32 size )
103
13.7k
{
104
13.7k
   void* v = malloc ( items * size );
105
13.7k
   return v;
106
13.7k
}
107
108
static
109
void default_bzfree ( void* opaque, void* addr )
110
13.7k
{
111
13.7k
   if (addr != NULL) free ( addr );
112
13.7k
}
113
114
115
/*---------------------------------------------------*/
116
static
117
void prepare_new_block ( EState* s )
118
2.86k
{
119
2.86k
   Int32 i;
120
2.86k
   s->nblock = 0;
121
2.86k
   s->numZ = 0;
122
2.86k
   s->state_out_pos = 0;
123
2.86k
   BZ_INITIALISE_CRC ( s->blockCRC );
124
735k
   for (i = 0; i < 256; i++) s->inUse[i] = False;
125
2.86k
   s->blockNo++;
126
2.86k
}
127
128
129
/*---------------------------------------------------*/
130
static
131
void init_RL ( EState* s )
132
5.48k
{
133
5.48k
   s->state_in_ch  = 256;
134
5.48k
   s->state_in_len = 0;
135
5.48k
}
136
137
138
static
139
Bool isempty_RL ( EState* s )
140
11.3k
{
141
11.3k
   if (s->state_in_ch < 256 && s->state_in_len > 0)
142
426
      return False; else
143
10.9k
      return True;
144
11.3k
}
145
146
147
/*---------------------------------------------------*/
148
int BZ_API(BZ2_bzCompressInit) 
149
                    ( bz_stream* strm, 
150
                     int        blockSize100k,
151
                     int        verbosity,
152
                     int        workFactor )
153
2.74k
{
154
2.74k
   Int32   n;
155
2.74k
   EState* s;
156
157
2.74k
   if (!bz_config_ok()) return BZ_CONFIG_ERROR;
158
159
2.74k
   if (strm == NULL || 
160
2.74k
       blockSize100k < 1 || blockSize100k > 9 ||
161
2.74k
       workFactor < 0 || workFactor > 250)
162
0
     return BZ_PARAM_ERROR;
163
164
2.74k
   if (workFactor == 0) workFactor = 30;
165
2.74k
   if (strm->bzalloc == NULL) strm->bzalloc = default_bzalloc;
166
2.74k
   if (strm->bzfree == NULL) strm->bzfree = default_bzfree;
167
168
2.74k
   s = BZALLOC( sizeof(EState) );
169
2.74k
   if (s == NULL) return BZ_MEM_ERROR;
170
2.74k
   s->strm = strm;
171
172
2.74k
   s->arr1 = NULL;
173
2.74k
   s->arr2 = NULL;
174
2.74k
   s->ftab = NULL;
175
176
2.74k
   n       = 100000 * blockSize100k;
177
2.74k
   s->arr1 = BZALLOC( n                  * sizeof(UInt32) );
178
2.74k
   s->arr2 = BZALLOC( (n+BZ_N_OVERSHOOT) * sizeof(UInt32) );
179
2.74k
   s->ftab = BZALLOC( 65537              * sizeof(UInt32) );
180
181
2.74k
   if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) {
182
0
      if (s->arr1 != NULL) BZFREE(s->arr1);
183
0
      if (s->arr2 != NULL) BZFREE(s->arr2);
184
0
      if (s->ftab != NULL) BZFREE(s->ftab);
185
0
      if (s       != NULL) BZFREE(s);
186
0
      return BZ_MEM_ERROR;
187
0
   }
188
189
2.74k
   s->blockNo           = 0;
190
2.74k
   s->state             = BZ_S_INPUT;
191
2.74k
   s->mode              = BZ_M_RUNNING;
192
2.74k
   s->combinedCRC       = 0;
193
2.74k
   s->blockSize100k     = blockSize100k;
194
2.74k
   s->nblockMAX         = 100000 * blockSize100k - 19;
195
2.74k
   s->verbosity         = verbosity;
196
2.74k
   s->workFactor        = workFactor;
197
198
2.74k
   s->block             = (UChar*)s->arr2;
199
2.74k
   s->mtfv              = (UInt16*)s->arr1;
200
2.74k
   s->zbits             = NULL;
201
2.74k
   s->ptr               = (UInt32*)s->arr1;
202
203
2.74k
   strm->state          = s;
204
2.74k
   strm->total_in_lo32  = 0;
205
2.74k
   strm->total_in_hi32  = 0;
206
2.74k
   strm->total_out_lo32 = 0;
207
2.74k
   strm->total_out_hi32 = 0;
208
2.74k
   init_RL ( s );
209
2.74k
   prepare_new_block ( s );
210
2.74k
   return BZ_OK;
211
2.74k
}
212
213
214
/*---------------------------------------------------*/
215
static
216
void add_pair_to_block ( EState* s )
217
21.3M
{
218
21.3M
   Int32 i;
219
21.3M
   UChar ch = (UChar)(s->state_in_ch);
220
97.2M
   for (i = 0; i < s->state_in_len; i++) {
221
75.9M
      BZ_UPDATE_CRC( s->blockCRC, ch );
222
75.9M
   }
223
21.3M
   s->inUse[s->state_in_ch] = True;
224
21.3M
   switch (s->state_in_len) {
225
2.08k
      case 1:
226
2.08k
         s->block[s->nblock] = (UChar)ch; s->nblock++;
227
2.08k
         break;
228
4.81M
      case 2:
229
4.81M
         s->block[s->nblock] = (UChar)ch; s->nblock++;
230
4.81M
         s->block[s->nblock] = (UChar)ch; s->nblock++;
231
4.81M
         break;
232
951k
      case 3:
233
951k
         s->block[s->nblock] = (UChar)ch; s->nblock++;
234
951k
         s->block[s->nblock] = (UChar)ch; s->nblock++;
235
951k
         s->block[s->nblock] = (UChar)ch; s->nblock++;
236
951k
         break;
237
15.5M
      default:
238
15.5M
         s->inUse[s->state_in_len-4] = True;
239
15.5M
         s->block[s->nblock] = (UChar)ch; s->nblock++;
240
15.5M
         s->block[s->nblock] = (UChar)ch; s->nblock++;
241
15.5M
         s->block[s->nblock] = (UChar)ch; s->nblock++;
242
15.5M
         s->block[s->nblock] = (UChar)ch; s->nblock++;
243
15.5M
         s->block[s->nblock] = ((UChar)(s->state_in_len-4));
244
15.5M
         s->nblock++;
245
15.5M
         break;
246
21.3M
   }
247
21.3M
}
248
249
250
/*---------------------------------------------------*/
251
static
252
void flush_RL ( EState* s )
253
2.74k
{
254
2.74k
   if (s->state_in_ch < 256) add_pair_to_block ( s );
255
2.74k
   init_RL ( s );
256
2.74k
}
257
258
259
/*---------------------------------------------------*/
260
189M
#define ADD_CHAR_TO_BLOCK(zs,zchh0)               \
261
189M
{                                                 \
262
189M
   UInt32 zchh = (UInt32)(zchh0);                 \
263
189M
   /*-- fast track the common case --*/           \
264
189M
   if (zchh != zs->state_in_ch &&                 \
265
189M
       zs->state_in_len == 1) {                   \
266
113M
      UChar ch = (UChar)(zs->state_in_ch);        \
267
113M
      BZ_UPDATE_CRC( zs->blockCRC, ch );          \
268
113M
      zs->inUse[zs->state_in_ch] = True;          \
269
113M
      zs->block[zs->nblock] = (UChar)ch;          \
270
113M
      zs->nblock++;                               \
271
113M
      zs->state_in_ch = zchh;                     \
272
113M
   }                                              \
273
189M
   else                                           \
274
189M
   /*-- general, uncommon cases --*/              \
275
189M
   if (zchh != zs->state_in_ch ||                 \
276
75.9M
      zs->state_in_len == 255) {                  \
277
21.3M
      if (zs->state_in_ch < 256)                  \
278
21.3M
         add_pair_to_block ( zs );                \
279
21.3M
      zs->state_in_ch = zchh;                     \
280
21.3M
      zs->state_in_len = 1;                       \
281
54.5M
   } else {                                       \
282
54.5M
      zs->state_in_len++;                         \
283
54.5M
   }                                              \
284
189M
}
285
286
287
/*---------------------------------------------------*/
288
static
289
Bool copy_input_until_stop ( EState* s )
290
5.59k
{
291
5.59k
   Bool progress_in = False;
292
293
5.59k
   if (s->mode == BZ_M_RUNNING) {
294
295
      /*-- fast track the common case --*/
296
189M
      while (True) {
297
         /*-- block full? --*/
298
189M
         if (s->nblock >= s->nblockMAX) break;
299
         /*-- no input? --*/
300
189M
         if (s->strm->avail_in == 0) break;
301
189M
         progress_in = True;
302
189M
         ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 
303
189M
         s->strm->next_in++;
304
189M
         s->strm->avail_in--;
305
189M
         s->strm->total_in_lo32++;
306
189M
         if (s->strm->total_in_lo32 == 0) s->strm->total_in_hi32++;
307
189M
      }
308
309
2.85k
   } else {
310
311
      /*-- general, uncommon case --*/
312
2.74k
      while (True) {
313
         /*-- block full? --*/
314
2.74k
         if (s->nblock >= s->nblockMAX) break;
315
         /*-- no input? --*/
316
2.74k
         if (s->strm->avail_in == 0) break;
317
         /*-- flush/finish end? --*/
318
0
         if (s->avail_in_expect == 0) break;
319
0
         progress_in = True;
320
0
         ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 
321
0
         s->strm->next_in++;
322
0
         s->strm->avail_in--;
323
0
         s->strm->total_in_lo32++;
324
0
         if (s->strm->total_in_lo32 == 0) s->strm->total_in_hi32++;
325
0
         s->avail_in_expect--;
326
0
      }
327
2.74k
   }
328
5.59k
   return progress_in;
329
5.59k
}
330
331
332
/*---------------------------------------------------*/
333
static
334
Bool copy_output_until_stop ( EState* s )
335
14.7k
{
336
14.7k
   Bool progress_out = False;
337
338
61.7M
   while (True) {
339
340
      /*-- no output space? --*/
341
61.7M
      if (s->strm->avail_out == 0) break;
342
343
      /*-- block done? --*/
344
61.6M
      if (s->state_out_pos >= s->numZ) break;
345
346
61.6M
      progress_out = True;
347
61.6M
      *(s->strm->next_out) = s->zbits[s->state_out_pos];
348
61.6M
      s->state_out_pos++;
349
61.6M
      s->strm->avail_out--;
350
61.6M
      s->strm->next_out++;
351
61.6M
      s->strm->total_out_lo32++;
352
61.6M
      if (s->strm->total_out_lo32 == 0) s->strm->total_out_hi32++;
353
61.6M
   }
354
355
14.7k
   return progress_out;
356
14.7k
}
357
358
359
/*---------------------------------------------------*/
360
static
361
Bool handle_compress ( bz_stream* strm )
362
17.3k
{
363
17.3k
   Bool progress_in  = False;
364
17.3k
   Bool progress_out = False;
365
17.3k
   EState* s = strm->state;
366
   
367
20.1k
   while (True) {
368
369
20.1k
      if (s->state == BZ_S_OUTPUT) {
370
14.7k
         progress_out |= copy_output_until_stop ( s );
371
14.7k
         if (s->state_out_pos < s->numZ) break;
372
2.86k
         if (s->mode == BZ_M_FINISHING && 
373
2.86k
             s->avail_in_expect == 0 &&
374
2.86k
             isempty_RL(s)) break;
375
120
         prepare_new_block ( s );
376
120
         s->state = BZ_S_INPUT;
377
120
         if (s->mode == BZ_M_FLUSHING && 
378
120
             s->avail_in_expect == 0 &&
379
120
             isempty_RL(s)) break;
380
120
      }
381
382
5.59k
      if (s->state == BZ_S_INPUT) {
383
5.59k
         progress_in |= copy_input_until_stop ( s );
384
5.59k
         if (s->mode != BZ_M_RUNNING && s->avail_in_expect == 0) {
385
2.74k
            flush_RL ( s );
386
2.74k
            BZ2_compressBlock ( s, (Bool)(s->mode == BZ_M_FINISHING) );
387
2.74k
            s->state = BZ_S_OUTPUT;
388
2.74k
         }
389
2.85k
         else
390
2.85k
         if (s->nblock >= s->nblockMAX) {
391
120
            BZ2_compressBlock ( s, False );
392
120
            s->state = BZ_S_OUTPUT;
393
120
         }
394
2.73k
         else
395
2.73k
         if (s->strm->avail_in == 0) {
396
2.73k
            break;
397
2.73k
         }
398
5.59k
      }
399
400
5.59k
   }
401
402
17.3k
   return progress_in || progress_out;
403
17.3k
}
404
405
406
/*---------------------------------------------------*/
407
int BZ_API(BZ2_bzCompress) ( bz_stream *strm, int action )
408
17.3k
{
409
17.3k
   Bool progress;
410
17.3k
   EState* s;
411
17.3k
   if (strm == NULL) return BZ_PARAM_ERROR;
412
17.3k
   s = strm->state;
413
17.3k
   if (s == NULL) return BZ_PARAM_ERROR;
414
17.3k
   if (s->strm != strm) return BZ_PARAM_ERROR;
415
416
20.0k
   preswitch:
417
20.0k
   switch (s->mode) {
418
419
0
      case BZ_M_IDLE:
420
0
         return BZ_SEQUENCE_ERROR;
421
422
11.4k
      case BZ_M_RUNNING:
423
11.4k
         if (action == BZ_RUN) {
424
8.67k
            progress = handle_compress ( strm );
425
8.67k
            return progress ? BZ_RUN_OK : BZ_PARAM_ERROR;
426
8.67k
         } 
427
2.74k
         else
428
2.74k
   if (action == BZ_FLUSH) {
429
0
            s->avail_in_expect = strm->avail_in;
430
0
            s->mode = BZ_M_FLUSHING;
431
0
            goto preswitch;
432
0
         }
433
2.74k
         else
434
2.74k
         if (action == BZ_FINISH) {
435
2.74k
            s->avail_in_expect = strm->avail_in;
436
2.74k
            s->mode = BZ_M_FINISHING;
437
2.74k
            goto preswitch;
438
2.74k
         }
439
0
         else 
440
0
            return BZ_PARAM_ERROR;
441
442
0
      case BZ_M_FLUSHING:
443
0
         if (action != BZ_FLUSH) return BZ_SEQUENCE_ERROR;
444
0
         if (s->avail_in_expect != s->strm->avail_in) 
445
0
            return BZ_SEQUENCE_ERROR;
446
0
         progress = handle_compress ( strm );
447
0
         if (s->avail_in_expect > 0 || !isempty_RL(s) ||
448
0
             s->state_out_pos < s->numZ) return BZ_FLUSH_OK;
449
0
         s->mode = BZ_M_RUNNING;
450
0
         return BZ_RUN_OK;
451
452
8.64k
      case BZ_M_FINISHING:
453
8.64k
         if (action != BZ_FINISH) return BZ_SEQUENCE_ERROR;
454
8.64k
         if (s->avail_in_expect != s->strm->avail_in) 
455
0
            return BZ_SEQUENCE_ERROR;
456
8.64k
         progress = handle_compress ( strm );
457
8.64k
         if (!progress) return BZ_SEQUENCE_ERROR;
458
8.64k
         if (s->avail_in_expect > 0 || !isempty_RL(s) ||
459
8.64k
             s->state_out_pos < s->numZ) return BZ_FINISH_OK;
460
2.74k
         s->mode = BZ_M_IDLE;
461
2.74k
         return BZ_STREAM_END;
462
20.0k
   }
463
0
   return BZ_OK; /*--not reached--*/
464
20.0k
}
465
466
467
/*---------------------------------------------------*/
468
int BZ_API(BZ2_bzCompressEnd)  ( bz_stream *strm )
469
2.74k
{
470
2.74k
   EState* s;
471
2.74k
   if (strm == NULL) return BZ_PARAM_ERROR;
472
2.74k
   s = strm->state;
473
2.74k
   if (s == NULL) return BZ_PARAM_ERROR;
474
2.74k
   if (s->strm != strm) return BZ_PARAM_ERROR;
475
476
2.74k
   if (s->arr1 != NULL) BZFREE(s->arr1);
477
2.74k
   if (s->arr2 != NULL) BZFREE(s->arr2);
478
2.74k
   if (s->ftab != NULL) BZFREE(s->ftab);
479
2.74k
   BZFREE(strm->state);
480
481
2.74k
   strm->state = NULL;   
482
483
2.74k
   return BZ_OK;
484
2.74k
}
485
486
487
/*---------------------------------------------------*/
488
/*--- Decompression stuff                         ---*/
489
/*---------------------------------------------------*/
490
491
/*---------------------------------------------------*/
492
int BZ_API(BZ2_bzDecompressInit) 
493
                     ( bz_stream* strm, 
494
                       int        verbosity,
495
                       int        small )
496
2.74k
{
497
2.74k
   DState* s;
498
499
2.74k
   if (!bz_config_ok()) return BZ_CONFIG_ERROR;
500
501
2.74k
   if (strm == NULL) return BZ_PARAM_ERROR;
502
2.74k
   if (small != 0 && small != 1) return BZ_PARAM_ERROR;
503
2.74k
   if (verbosity < 0 || verbosity > 4) return BZ_PARAM_ERROR;
504
505
2.74k
   if (strm->bzalloc == NULL) strm->bzalloc = default_bzalloc;
506
2.74k
   if (strm->bzfree == NULL) strm->bzfree = default_bzfree;
507
508
2.74k
   s = BZALLOC( sizeof(DState) );
509
2.74k
   if (s == NULL) return BZ_MEM_ERROR;
510
2.74k
   s->strm                  = strm;
511
2.74k
   strm->state              = s;
512
2.74k
   s->state                 = BZ_X_MAGIC_1;
513
2.74k
   s->bsLive                = 0;
514
2.74k
   s->bsBuff                = 0;
515
2.74k
   s->calculatedCombinedCRC = 0;
516
2.74k
   strm->total_in_lo32      = 0;
517
2.74k
   strm->total_in_hi32      = 0;
518
2.74k
   strm->total_out_lo32     = 0;
519
2.74k
   strm->total_out_hi32     = 0;
520
2.74k
   s->smallDecompress       = (Bool)small;
521
2.74k
   s->ll4                   = NULL;
522
2.74k
   s->ll16                  = NULL;
523
2.74k
   s->tt                    = NULL;
524
2.74k
   s->currBlockNo           = 0;
525
2.74k
   s->verbosity             = verbosity;
526
527
2.74k
   return BZ_OK;
528
2.74k
}
529
530
531
/*---------------------------------------------------*/
532
/* Return  True iff data corruption is discovered.
533
   Returns False if there is no problem.
534
*/
535
static
536
Bool unRLE_obuf_to_output_FAST ( DState* s )
537
0
{
538
0
   UChar k1;
539
540
0
   if (s->blockRandomised) {
541
542
0
      while (True) {
543
         /* try to finish existing run */
544
0
         while (True) {
545
0
            if (s->strm->avail_out == 0) return False;
546
0
            if (s->state_out_len == 0) break;
547
0
            *( (UChar*)(s->strm->next_out) ) = s->state_out_ch;
548
0
            BZ_UPDATE_CRC ( s->calculatedBlockCRC, s->state_out_ch );
549
0
            s->state_out_len--;
550
0
            s->strm->next_out++;
551
0
            s->strm->avail_out--;
552
0
            s->strm->total_out_lo32++;
553
0
            if (s->strm->total_out_lo32 == 0) s->strm->total_out_hi32++;
554
0
         }
555
556
         /* can a new run be started? */
557
0
         if (s->nblock_used == s->save_nblock+1) return False;
558
               
559
         /* Only caused by corrupt data stream? */
560
0
         if (s->nblock_used > s->save_nblock+1)
561
0
            return True;
562
   
563
0
         s->state_out_len = 1;
564
0
         s->state_out_ch = s->k0;
565
0
         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK; 
566
0
         k1 ^= BZ_RAND_MASK; s->nblock_used++;
567
0
         if (s->nblock_used == s->save_nblock+1) continue;
568
0
         if (k1 != s->k0) { s->k0 = k1; continue; };
569
   
570
0
         s->state_out_len = 2;
571
0
         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK; 
572
0
         k1 ^= BZ_RAND_MASK; s->nblock_used++;
573
0
         if (s->nblock_used == s->save_nblock+1) continue;
574
0
         if (k1 != s->k0) { s->k0 = k1; continue; };
575
   
576
0
         s->state_out_len = 3;
577
0
         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK; 
578
0
         k1 ^= BZ_RAND_MASK; s->nblock_used++;
579
0
         if (s->nblock_used == s->save_nblock+1) continue;
580
0
         if (k1 != s->k0) { s->k0 = k1; continue; };
581
   
582
0
         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK; 
583
0
         k1 ^= BZ_RAND_MASK; s->nblock_used++;
584
0
         s->state_out_len = ((Int32)k1) + 4;
585
0
         BZ_GET_FAST(s->k0); BZ_RAND_UPD_MASK; 
586
0
         s->k0 ^= BZ_RAND_MASK; s->nblock_used++;
587
0
      }
588
589
0
   } else {
590
591
      /* restore */
592
0
      UInt32        c_calculatedBlockCRC = s->calculatedBlockCRC;
593
0
      UChar         c_state_out_ch       = s->state_out_ch;
594
0
      Int32         c_state_out_len      = s->state_out_len;
595
0
      Int32         c_nblock_used        = s->nblock_used;
596
0
      Int32         c_k0                 = s->k0;
597
0
      UInt32*       c_tt                 = s->tt;
598
0
      UInt32        c_tPos               = s->tPos;
599
0
      char*         cs_next_out          = s->strm->next_out;
600
0
      unsigned int  cs_avail_out         = s->strm->avail_out;
601
0
      Int32         ro_blockSize100k     = s->blockSize100k;
602
      /* end restore */
603
604
0
      UInt32       avail_out_INIT = cs_avail_out;
605
0
      Int32        s_save_nblockPP = s->save_nblock+1;
606
0
      unsigned int total_out_lo32_old;
607
608
0
      while (True) {
609
610
         /* try to finish existing run */
611
0
         if (c_state_out_len > 0) {
612
0
            while (True) {
613
0
               if (cs_avail_out == 0) goto return_notr;
614
0
               if (c_state_out_len == 1) break;
615
0
               *( (UChar*)(cs_next_out) ) = c_state_out_ch;
616
0
               BZ_UPDATE_CRC ( c_calculatedBlockCRC, c_state_out_ch );
617
0
               c_state_out_len--;
618
0
               cs_next_out++;
619
0
               cs_avail_out--;
620
0
            }
621
0
            s_state_out_len_eq_one:
622
0
            {
623
0
               if (cs_avail_out == 0) { 
624
0
                  c_state_out_len = 1; goto return_notr;
625
0
               };
626
0
               *( (UChar*)(cs_next_out) ) = c_state_out_ch;
627
0
               BZ_UPDATE_CRC ( c_calculatedBlockCRC, c_state_out_ch );
628
0
               cs_next_out++;
629
0
               cs_avail_out--;
630
0
            }
631
0
         }   
632
         /* Only caused by corrupt data stream? */
633
0
         if (c_nblock_used > s_save_nblockPP)
634
0
            return True;
635
636
         /* can a new run be started? */
637
0
         if (c_nblock_used == s_save_nblockPP) {
638
0
            c_state_out_len = 0; goto return_notr;
639
0
         };   
640
0
         c_state_out_ch = c_k0;
641
0
         BZ_GET_FAST_C(k1); c_nblock_used++;
642
0
         if (k1 != c_k0) { 
643
0
            c_k0 = k1; goto s_state_out_len_eq_one; 
644
0
         };
645
0
         if (c_nblock_used == s_save_nblockPP) 
646
0
            goto s_state_out_len_eq_one;
647
   
648
0
         c_state_out_len = 2;
649
0
         BZ_GET_FAST_C(k1); c_nblock_used++;
650
0
         if (c_nblock_used == s_save_nblockPP) continue;
651
0
         if (k1 != c_k0) { c_k0 = k1; continue; };
652
   
653
0
         c_state_out_len = 3;
654
0
         BZ_GET_FAST_C(k1); c_nblock_used++;
655
0
         if (c_nblock_used == s_save_nblockPP) continue;
656
0
         if (k1 != c_k0) { c_k0 = k1; continue; };
657
   
658
0
         BZ_GET_FAST_C(k1); c_nblock_used++;
659
0
         c_state_out_len = ((Int32)k1) + 4;
660
0
         BZ_GET_FAST_C(c_k0); c_nblock_used++;
661
0
      }
662
663
0
      return_notr:
664
0
      total_out_lo32_old = s->strm->total_out_lo32;
665
0
      s->strm->total_out_lo32 += (avail_out_INIT - cs_avail_out);
666
0
      if (s->strm->total_out_lo32 < total_out_lo32_old)
667
0
         s->strm->total_out_hi32++;
668
669
      /* save */
670
0
      s->calculatedBlockCRC = c_calculatedBlockCRC;
671
0
      s->state_out_ch       = c_state_out_ch;
672
0
      s->state_out_len      = c_state_out_len;
673
0
      s->nblock_used        = c_nblock_used;
674
0
      s->k0                 = c_k0;
675
0
      s->tt                 = c_tt;
676
0
      s->tPos               = c_tPos;
677
0
      s->strm->next_out     = cs_next_out;
678
0
      s->strm->avail_out    = cs_avail_out;
679
      /* end save */
680
0
   }
681
0
   return False;
682
0
}
683
684
685
686
/*---------------------------------------------------*/
687
__inline__ Int32 BZ2_indexIntoF ( Int32 indx, Int32 *cftab )
688
0
{
689
0
   Int32 nb, na, mid;
690
0
   nb = 0;
691
0
   na = 256;
692
0
   do {
693
0
      mid = (nb + na) >> 1;
694
0
      if (indx >= cftab[mid]) nb = mid; else na = mid;
695
0
   }
696
0
   while (na - nb != 1);
697
0
   return nb;
698
0
}
699
700
701
/*---------------------------------------------------*/
702
/* Return  True iff data corruption is discovered.
703
   Returns False if there is no problem.
704
*/
705
static
706
Bool unRLE_obuf_to_output_SMALL ( DState* s )
707
0
{
708
0
   UChar k1;
709
710
0
   if (s->blockRandomised) {
711
712
0
      while (True) {
713
         /* try to finish existing run */
714
0
         while (True) {
715
0
            if (s->strm->avail_out == 0) return False;
716
0
            if (s->state_out_len == 0) break;
717
0
            *( (UChar*)(s->strm->next_out) ) = s->state_out_ch;
718
0
            BZ_UPDATE_CRC ( s->calculatedBlockCRC, s->state_out_ch );
719
0
            s->state_out_len--;
720
0
            s->strm->next_out++;
721
0
            s->strm->avail_out--;
722
0
            s->strm->total_out_lo32++;
723
0
            if (s->strm->total_out_lo32 == 0) s->strm->total_out_hi32++;
724
0
         }
725
   
726
         /* can a new run be started? */
727
0
         if (s->nblock_used == s->save_nblock+1) return False;
728
729
         /* Only caused by corrupt data stream? */
730
0
         if (s->nblock_used > s->save_nblock+1)
731
0
            return True;
732
   
733
0
         s->state_out_len = 1;
734
0
         s->state_out_ch = s->k0;
735
0
         BZ_GET_SMALL(k1); BZ_RAND_UPD_MASK; 
736
0
         k1 ^= BZ_RAND_MASK; s->nblock_used++;
737
0
         if (s->nblock_used == s->save_nblock+1) continue;
738
0
         if (k1 != s->k0) { s->k0 = k1; continue; };
739
   
740
0
         s->state_out_len = 2;
741
0
         BZ_GET_SMALL(k1); BZ_RAND_UPD_MASK; 
742
0
         k1 ^= BZ_RAND_MASK; s->nblock_used++;
743
0
         if (s->nblock_used == s->save_nblock+1) continue;
744
0
         if (k1 != s->k0) { s->k0 = k1; continue; };
745
   
746
0
         s->state_out_len = 3;
747
0
         BZ_GET_SMALL(k1); BZ_RAND_UPD_MASK; 
748
0
         k1 ^= BZ_RAND_MASK; s->nblock_used++;
749
0
         if (s->nblock_used == s->save_nblock+1) continue;
750
0
         if (k1 != s->k0) { s->k0 = k1; continue; };
751
   
752
0
         BZ_GET_SMALL(k1); BZ_RAND_UPD_MASK; 
753
0
         k1 ^= BZ_RAND_MASK; s->nblock_used++;
754
0
         s->state_out_len = ((Int32)k1) + 4;
755
0
         BZ_GET_SMALL(s->k0); BZ_RAND_UPD_MASK; 
756
0
         s->k0 ^= BZ_RAND_MASK; s->nblock_used++;
757
0
      }
758
759
0
   } else {
760
761
0
      while (True) {
762
         /* try to finish existing run */
763
0
         while (True) {
764
0
            if (s->strm->avail_out == 0) return False;
765
0
            if (s->state_out_len == 0) break;
766
0
            *( (UChar*)(s->strm->next_out) ) = s->state_out_ch;
767
0
            BZ_UPDATE_CRC ( s->calculatedBlockCRC, s->state_out_ch );
768
0
            s->state_out_len--;
769
0
            s->strm->next_out++;
770
0
            s->strm->avail_out--;
771
0
            s->strm->total_out_lo32++;
772
0
            if (s->strm->total_out_lo32 == 0) s->strm->total_out_hi32++;
773
0
         }
774
   
775
         /* can a new run be started? */
776
0
         if (s->nblock_used == s->save_nblock+1) return False;
777
778
         /* Only caused by corrupt data stream? */
779
0
         if (s->nblock_used > s->save_nblock+1)
780
0
            return True;
781
   
782
0
         s->state_out_len = 1;
783
0
         s->state_out_ch = s->k0;
784
0
         BZ_GET_SMALL(k1); s->nblock_used++;
785
0
         if (s->nblock_used == s->save_nblock+1) continue;
786
0
         if (k1 != s->k0) { s->k0 = k1; continue; };
787
   
788
0
         s->state_out_len = 2;
789
0
         BZ_GET_SMALL(k1); s->nblock_used++;
790
0
         if (s->nblock_used == s->save_nblock+1) continue;
791
0
         if (k1 != s->k0) { s->k0 = k1; continue; };
792
   
793
0
         s->state_out_len = 3;
794
0
         BZ_GET_SMALL(k1); s->nblock_used++;
795
0
         if (s->nblock_used == s->save_nblock+1) continue;
796
0
         if (k1 != s->k0) { s->k0 = k1; continue; };
797
   
798
0
         BZ_GET_SMALL(k1); s->nblock_used++;
799
0
         s->state_out_len = ((Int32)k1) + 4;
800
0
         BZ_GET_SMALL(s->k0); s->nblock_used++;
801
0
      }
802
803
0
   }
804
0
}
805
806
807
/*---------------------------------------------------*/
808
int BZ_API(BZ2_bzDecompress) ( bz_stream *strm )
809
2.74k
{
810
2.74k
   Bool    corrupt;
811
2.74k
   DState* s;
812
2.74k
   if (strm == NULL) return BZ_PARAM_ERROR;
813
2.74k
   s = strm->state;
814
2.74k
   if (s == NULL) return BZ_PARAM_ERROR;
815
2.74k
   if (s->strm != strm) return BZ_PARAM_ERROR;
816
817
2.74k
   while (True) {
818
2.74k
      if (s->state == BZ_X_IDLE) return BZ_SEQUENCE_ERROR;
819
2.74k
      if (s->state == BZ_X_OUTPUT) {
820
0
         if (s->smallDecompress)
821
0
            corrupt = unRLE_obuf_to_output_SMALL ( s ); else
822
0
            corrupt = unRLE_obuf_to_output_FAST  ( s );
823
0
         if (corrupt) return BZ_DATA_ERROR;
824
0
         if (s->nblock_used == s->save_nblock+1 && s->state_out_len == 0) {
825
0
            BZ_FINALISE_CRC ( s->calculatedBlockCRC );
826
0
            if (s->verbosity >= 3) 
827
0
               VPrintf2 ( " {0x%08x, 0x%08x}", s->storedBlockCRC, 
828
0
                          s->calculatedBlockCRC );
829
0
            if (s->verbosity >= 2) VPrintf0 ( "]" );
830
0
            if (s->calculatedBlockCRC != s->storedBlockCRC)
831
0
               return BZ_DATA_ERROR;
832
0
            s->calculatedCombinedCRC 
833
0
               = (s->calculatedCombinedCRC << 1) | 
834
0
                    (s->calculatedCombinedCRC >> 31);
835
0
            s->calculatedCombinedCRC ^= s->calculatedBlockCRC;
836
0
            s->state = BZ_X_BLKHDR_1;
837
0
         } else {
838
0
            return BZ_OK;
839
0
         }
840
0
      }
841
2.74k
      if (s->state >= BZ_X_MAGIC_1) {
842
2.74k
         Int32 r = BZ2_decompress ( s );
843
2.74k
         if (r == BZ_STREAM_END) {
844
0
            if (s->verbosity >= 3)
845
0
               VPrintf2 ( "\n    combined CRCs: stored = 0x%08x, computed = 0x%08x", 
846
0
                          s->storedCombinedCRC, s->calculatedCombinedCRC );
847
0
            if (s->calculatedCombinedCRC != s->storedCombinedCRC)
848
0
               return BZ_DATA_ERROR;
849
0
            return r;
850
0
         }
851
2.74k
         if (s->state != BZ_X_OUTPUT) return r;
852
2.74k
      }
853
2.74k
   }
854
855
0
   AssertH ( 0, 6001 );
856
857
0
   return 0;  /*NOTREACHED*/
858
2.74k
}
859
860
861
/*---------------------------------------------------*/
862
int BZ_API(BZ2_bzDecompressEnd)  ( bz_stream *strm )
863
2.74k
{
864
2.74k
   DState* s;
865
2.74k
   if (strm == NULL) return BZ_PARAM_ERROR;
866
2.74k
   s = strm->state;
867
2.74k
   if (s == NULL) return BZ_PARAM_ERROR;
868
2.74k
   if (s->strm != strm) return BZ_PARAM_ERROR;
869
870
2.74k
   if (s->tt   != NULL) BZFREE(s->tt);
871
2.74k
   if (s->ll16 != NULL) BZFREE(s->ll16);
872
2.74k
   if (s->ll4  != NULL) BZFREE(s->ll4);
873
874
2.74k
   BZFREE(strm->state);
875
2.74k
   strm->state = NULL;
876
877
2.74k
   return BZ_OK;
878
2.74k
}
879
880
881
#ifndef BZ_NO_STDIO
882
/*---------------------------------------------------*/
883
/*--- File I/O stuff                              ---*/
884
/*---------------------------------------------------*/
885
886
30.1k
#define BZ_SETERR(eee)                    \
887
30.1k
{                                         \
888
30.1k
   if (bzerror != NULL) *bzerror = eee;   \
889
30.1k
   if (bzf != NULL) bzf->lastErr = eee;   \
890
30.1k
}
891
892
typedef 
893
   struct {
894
      FILE*     handle;
895
      Char      buf[BZ_MAX_UNUSED];
896
      Int32     bufN;
897
      Bool      writing;
898
      bz_stream strm;
899
      Int32     lastErr;
900
      Bool      initialisedOk;
901
   }
902
   bzFile;
903
904
905
/*---------------------------------------------*/
906
static Bool myfeof ( FILE* f )
907
5.48k
{
908
5.48k
   Int32 c = fgetc ( f );
909
5.48k
   if (c == EOF) return True;
910
0
   ungetc ( c, f );
911
0
   return False;
912
5.48k
}
913
914
915
/*---------------------------------------------------*/
916
BZFILE* BZ_API(BZ2_bzWriteOpen) 
917
                    ( int*  bzerror,      
918
                      FILE* f, 
919
                      int   blockSize100k, 
920
                      int   verbosity,
921
                      int   workFactor )
922
2.74k
{
923
2.74k
   Int32   ret;
924
2.74k
   bzFile* bzf = NULL;
925
926
2.74k
   BZ_SETERR(BZ_OK);
927
928
2.74k
   if (f == NULL ||
929
2.74k
       (blockSize100k < 1 || blockSize100k > 9) ||
930
2.74k
       (workFactor < 0 || workFactor > 250) ||
931
2.74k
       (verbosity < 0 || verbosity > 4))
932
2.74k
      { BZ_SETERR(BZ_PARAM_ERROR); return NULL; };
933
934
2.74k
   if (ferror(f))
935
2.74k
      { BZ_SETERR(BZ_IO_ERROR); return NULL; };
936
937
2.74k
   bzf = malloc ( sizeof(bzFile) );
938
2.74k
   if (bzf == NULL)
939
2.74k
      { BZ_SETERR(BZ_MEM_ERROR); return NULL; };
940
941
2.74k
   BZ_SETERR(BZ_OK);
942
2.74k
   bzf->initialisedOk = False;
943
2.74k
   bzf->bufN          = 0;
944
2.74k
   bzf->handle        = f;
945
2.74k
   bzf->writing       = True;
946
2.74k
   bzf->strm.bzalloc  = NULL;
947
2.74k
   bzf->strm.bzfree   = NULL;
948
2.74k
   bzf->strm.opaque   = NULL;
949
950
2.74k
   if (workFactor == 0) workFactor = 30;
951
2.74k
   ret = BZ2_bzCompressInit ( &(bzf->strm), blockSize100k, 
952
2.74k
                              verbosity, workFactor );
953
2.74k
   if (ret != BZ_OK)
954
2.74k
      { BZ_SETERR(ret); free(bzf); return NULL; };
955
956
2.74k
   bzf->strm.avail_in = 0;
957
2.74k
   bzf->initialisedOk = True;
958
2.74k
   return bzf;   
959
2.74k
}
960
961
962
963
/*---------------------------------------------------*/
964
void BZ_API(BZ2_bzWrite)
965
             ( int*    bzerror, 
966
               BZFILE* b, 
967
               void*   buf, 
968
               int     len )
969
2.74k
{
970
2.74k
   Int32 n, n2, ret;
971
2.74k
   bzFile* bzf = (bzFile*)b;
972
973
2.74k
   BZ_SETERR(BZ_OK);
974
2.74k
   if (bzf == NULL || buf == NULL || len < 0)
975
2.74k
      { BZ_SETERR(BZ_PARAM_ERROR); return; };
976
2.74k
   if (!(bzf->writing))
977
2.74k
      { BZ_SETERR(BZ_SEQUENCE_ERROR); return; };
978
2.74k
   if (ferror(bzf->handle))
979
2.74k
      { BZ_SETERR(BZ_IO_ERROR); return; };
980
981
2.74k
   if (len == 0)
982
2.74k
      { BZ_SETERR(BZ_OK); return; };
983
984
2.74k
   bzf->strm.avail_in = len;
985
2.74k
   bzf->strm.next_in  = buf;
986
987
8.67k
   while (True) {
988
8.67k
      bzf->strm.avail_out = BZ_MAX_UNUSED;
989
8.67k
      bzf->strm.next_out = bzf->buf;
990
8.67k
      ret = BZ2_bzCompress ( &(bzf->strm), BZ_RUN );
991
8.67k
      if (ret != BZ_RUN_OK)
992
8.67k
         { BZ_SETERR(ret); return; };
993
994
8.67k
      if (bzf->strm.avail_out < BZ_MAX_UNUSED) {
995
6.05k
         n = BZ_MAX_UNUSED - bzf->strm.avail_out;
996
6.05k
         n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar), 
997
6.05k
                       n, bzf->handle );
998
6.05k
         if (n != n2 || ferror(bzf->handle))
999
6.05k
            { BZ_SETERR(BZ_IO_ERROR); return; };
1000
6.05k
      }
1001
1002
8.67k
      if (bzf->strm.avail_in == 0)
1003
5.93k
         { BZ_SETERR(BZ_OK); return; };
1004
5.93k
   }
1005
2.74k
}
1006
1007
1008
/*---------------------------------------------------*/
1009
void BZ_API(BZ2_bzWriteClose)
1010
                  ( int*          bzerror, 
1011
                    BZFILE*       b, 
1012
                    int           abandon,
1013
                    unsigned int* nbytes_in,
1014
                    unsigned int* nbytes_out )
1015
0
{
1016
0
   BZ2_bzWriteClose64 ( bzerror, b, abandon, 
1017
0
                        nbytes_in, NULL, nbytes_out, NULL );
1018
0
}
1019
1020
1021
void BZ_API(BZ2_bzWriteClose64)
1022
                  ( int*          bzerror, 
1023
                    BZFILE*       b, 
1024
                    int           abandon,
1025
                    unsigned int* nbytes_in_lo32,
1026
                    unsigned int* nbytes_in_hi32,
1027
                    unsigned int* nbytes_out_lo32,
1028
                    unsigned int* nbytes_out_hi32 )
1029
2.74k
{
1030
2.74k
   Int32   n, n2, ret;
1031
2.74k
   bzFile* bzf = (bzFile*)b;
1032
1033
2.74k
   if (bzf == NULL)
1034
2.74k
      { BZ_SETERR(BZ_OK); return; };
1035
2.74k
   if (!(bzf->writing))
1036
2.74k
      { BZ_SETERR(BZ_SEQUENCE_ERROR); return; };
1037
2.74k
   if (ferror(bzf->handle))
1038
2.74k
      { BZ_SETERR(BZ_IO_ERROR); return; };
1039
1040
2.74k
   if (nbytes_in_lo32 != NULL) *nbytes_in_lo32 = 0;
1041
2.74k
   if (nbytes_in_hi32 != NULL) *nbytes_in_hi32 = 0;
1042
2.74k
   if (nbytes_out_lo32 != NULL) *nbytes_out_lo32 = 0;
1043
2.74k
   if (nbytes_out_hi32 != NULL) *nbytes_out_hi32 = 0;
1044
1045
2.74k
   if ((!abandon) && bzf->lastErr == BZ_OK) {
1046
8.64k
      while (True) {
1047
8.64k
         bzf->strm.avail_out = BZ_MAX_UNUSED;
1048
8.64k
         bzf->strm.next_out = bzf->buf;
1049
8.64k
         ret = BZ2_bzCompress ( &(bzf->strm), BZ_FINISH );
1050
8.64k
         if (ret != BZ_FINISH_OK && ret != BZ_STREAM_END)
1051
8.64k
            { BZ_SETERR(ret); return; };
1052
1053
8.64k
         if (bzf->strm.avail_out < BZ_MAX_UNUSED) {
1054
8.64k
            n = BZ_MAX_UNUSED - bzf->strm.avail_out;
1055
8.64k
            n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar), 
1056
8.64k
                          n, bzf->handle );
1057
8.64k
            if (n != n2 || ferror(bzf->handle))
1058
8.64k
               { BZ_SETERR(BZ_IO_ERROR); return; };
1059
8.64k
         }
1060
1061
8.64k
         if (ret == BZ_STREAM_END) break;
1062
8.64k
      }
1063
2.74k
   }
1064
1065
2.74k
   if ( !abandon && !ferror ( bzf->handle ) ) {
1066
2.74k
      fflush ( bzf->handle );
1067
2.74k
      if (ferror(bzf->handle))
1068
2.74k
         { BZ_SETERR(BZ_IO_ERROR); return; };
1069
2.74k
   }
1070
1071
2.74k
   if (nbytes_in_lo32 != NULL)
1072
2.74k
      *nbytes_in_lo32 = bzf->strm.total_in_lo32;
1073
2.74k
   if (nbytes_in_hi32 != NULL)
1074
2.74k
      *nbytes_in_hi32 = bzf->strm.total_in_hi32;
1075
2.74k
   if (nbytes_out_lo32 != NULL)
1076
2.74k
      *nbytes_out_lo32 = bzf->strm.total_out_lo32;
1077
2.74k
   if (nbytes_out_hi32 != NULL)
1078
2.74k
      *nbytes_out_hi32 = bzf->strm.total_out_hi32;
1079
1080
2.74k
   BZ_SETERR(BZ_OK);
1081
2.74k
   BZ2_bzCompressEnd ( &(bzf->strm) );
1082
2.74k
   free ( bzf );
1083
2.74k
}
1084
1085
1086
/*---------------------------------------------------*/
1087
BZFILE* BZ_API(BZ2_bzReadOpen) 
1088
                   ( int*  bzerror, 
1089
                     FILE* f, 
1090
                     int   verbosity,
1091
                     int   small,
1092
                     void* unused,
1093
                     int   nUnused )
1094
2.74k
{
1095
2.74k
   bzFile* bzf = NULL;
1096
2.74k
   int     ret;
1097
1098
2.74k
   BZ_SETERR(BZ_OK);
1099
1100
2.74k
   if (f == NULL || 
1101
2.74k
       (small != 0 && small != 1) ||
1102
2.74k
       (verbosity < 0 || verbosity > 4) ||
1103
2.74k
       (unused == NULL && nUnused != 0) ||
1104
2.74k
       (unused != NULL && (nUnused < 0 || nUnused > BZ_MAX_UNUSED)))
1105
2.74k
      { BZ_SETERR(BZ_PARAM_ERROR); return NULL; };
1106
1107
2.74k
   if (ferror(f))
1108
2.74k
      { BZ_SETERR(BZ_IO_ERROR); return NULL; };
1109
1110
2.74k
   bzf = malloc ( sizeof(bzFile) );
1111
2.74k
   if (bzf == NULL) 
1112
2.74k
      { BZ_SETERR(BZ_MEM_ERROR); return NULL; };
1113
1114
2.74k
   BZ_SETERR(BZ_OK);
1115
1116
2.74k
   bzf->initialisedOk = False;
1117
2.74k
   bzf->handle        = f;
1118
2.74k
   bzf->bufN          = 0;
1119
2.74k
   bzf->writing       = False;
1120
2.74k
   bzf->strm.bzalloc  = NULL;
1121
2.74k
   bzf->strm.bzfree   = NULL;
1122
2.74k
   bzf->strm.opaque   = NULL;
1123
   
1124
2.74k
   while (nUnused > 0) {
1125
0
      bzf->buf[bzf->bufN] = *((UChar*)(unused)); bzf->bufN++;
1126
0
      unused = ((void*)( 1 + ((UChar*)(unused))  ));
1127
0
      nUnused--;
1128
0
   }
1129
1130
2.74k
   ret = BZ2_bzDecompressInit ( &(bzf->strm), verbosity, small );
1131
2.74k
   if (ret != BZ_OK)
1132
2.74k
      { BZ_SETERR(ret); free(bzf); return NULL; };
1133
1134
2.74k
   bzf->strm.avail_in = bzf->bufN;
1135
2.74k
   bzf->strm.next_in  = bzf->buf;
1136
1137
2.74k
   bzf->initialisedOk = True;
1138
2.74k
   return bzf;   
1139
2.74k
}
1140
1141
1142
/*---------------------------------------------------*/
1143
void BZ_API(BZ2_bzReadClose) ( int *bzerror, BZFILE *b )
1144
2.74k
{
1145
2.74k
   bzFile* bzf = (bzFile*)b;
1146
1147
2.74k
   BZ_SETERR(BZ_OK);
1148
2.74k
   if (bzf == NULL)
1149
2.74k
      { BZ_SETERR(BZ_OK); return; };
1150
1151
2.74k
   if (bzf->writing)
1152
2.74k
      { BZ_SETERR(BZ_SEQUENCE_ERROR); return; };
1153
1154
2.74k
   if (bzf->initialisedOk)
1155
2.74k
      (void)BZ2_bzDecompressEnd ( &(bzf->strm) );
1156
2.74k
   free ( bzf );
1157
2.74k
}
1158
1159
1160
/*---------------------------------------------------*/
1161
int BZ_API(BZ2_bzRead) 
1162
           ( int*    bzerror, 
1163
             BZFILE* b, 
1164
             void*   buf, 
1165
             int     len )
1166
2.74k
{
1167
2.74k
   Int32   n, ret;
1168
2.74k
   bzFile* bzf = (bzFile*)b;
1169
1170
2.74k
   BZ_SETERR(BZ_OK);
1171
1172
2.74k
   if (bzf == NULL || buf == NULL || len < 0)
1173
2.74k
      { BZ_SETERR(BZ_PARAM_ERROR); return 0; };
1174
1175
2.74k
   if (bzf->writing)
1176
2.74k
      { BZ_SETERR(BZ_SEQUENCE_ERROR); return 0; };
1177
1178
2.74k
   if (len == 0)
1179
2.74k
      { BZ_SETERR(BZ_OK); return 0; };
1180
1181
2.74k
   bzf->strm.avail_out = len;
1182
2.74k
   bzf->strm.next_out = buf;
1183
1184
2.74k
   while (True) {
1185
1186
2.74k
      if (ferror(bzf->handle)) 
1187
2.74k
         { BZ_SETERR(BZ_IO_ERROR); return 0; };
1188
1189
2.74k
      if (bzf->strm.avail_in == 0 && !myfeof(bzf->handle)) {
1190
0
         n = fread ( bzf->buf, sizeof(UChar), 
1191
0
                     BZ_MAX_UNUSED, bzf->handle );
1192
0
         if (ferror(bzf->handle))
1193
0
            { BZ_SETERR(BZ_IO_ERROR); return 0; };
1194
0
         bzf->bufN = n;
1195
0
         bzf->strm.avail_in = bzf->bufN;
1196
0
         bzf->strm.next_in = bzf->buf;
1197
0
      }
1198
1199
2.74k
      ret = BZ2_bzDecompress ( &(bzf->strm) );
1200
1201
2.74k
      if (ret != BZ_OK && ret != BZ_STREAM_END)
1202
2.74k
         { BZ_SETERR(ret); return 0; };
1203
1204
2.74k
      if (ret == BZ_OK && myfeof(bzf->handle) && 
1205
2.74k
          bzf->strm.avail_in == 0 && bzf->strm.avail_out > 0)
1206
2.74k
         { BZ_SETERR(BZ_UNEXPECTED_EOF); return 0; };
1207
1208
0
      if (ret == BZ_STREAM_END)
1209
0
         { BZ_SETERR(BZ_STREAM_END);
1210
0
           return len - bzf->strm.avail_out; };
1211
0
      if (bzf->strm.avail_out == 0)
1212
0
         { BZ_SETERR(BZ_OK); return len; };
1213
      
1214
0
   }
1215
1216
0
   return 0; /*not reached*/
1217
2.74k
}
1218
1219
1220
/*---------------------------------------------------*/
1221
void BZ_API(BZ2_bzReadGetUnused) 
1222
                     ( int*    bzerror, 
1223
                       BZFILE* b, 
1224
                       void**  unused, 
1225
                       int*    nUnused )
1226
2.74k
{
1227
2.74k
   bzFile* bzf = (bzFile*)b;
1228
2.74k
   if (bzf == NULL)
1229
2.74k
      { BZ_SETERR(BZ_PARAM_ERROR); return; };
1230
2.74k
   if (bzf->lastErr != BZ_STREAM_END)
1231
2.74k
      { BZ_SETERR(BZ_SEQUENCE_ERROR); return; };
1232
0
   if (unused == NULL || nUnused == NULL)
1233
0
      { BZ_SETERR(BZ_PARAM_ERROR); return; };
1234
1235
0
   BZ_SETERR(BZ_OK);
1236
0
   *nUnused = bzf->strm.avail_in;
1237
0
   *unused = bzf->strm.next_in;
1238
0
}
1239
#endif
1240
1241
1242
/*---------------------------------------------------*/
1243
/*--- Misc convenience stuff                      ---*/
1244
/*---------------------------------------------------*/
1245
1246
/*---------------------------------------------------*/
1247
int BZ_API(BZ2_bzBuffToBuffCompress) 
1248
                         ( char*         dest, 
1249
                           unsigned int* destLen,
1250
                           char*         source, 
1251
                           unsigned int  sourceLen,
1252
                           int           blockSize100k, 
1253
                           int           verbosity, 
1254
                           int           workFactor )
1255
0
{
1256
0
   bz_stream strm;
1257
0
   int ret;
1258
1259
0
   if (dest == NULL || destLen == NULL || 
1260
0
       source == NULL ||
1261
0
       blockSize100k < 1 || blockSize100k > 9 ||
1262
0
       verbosity < 0 || verbosity > 4 ||
1263
0
       workFactor < 0 || workFactor > 250) 
1264
0
      return BZ_PARAM_ERROR;
1265
1266
0
   if (workFactor == 0) workFactor = 30;
1267
0
   strm.bzalloc = NULL;
1268
0
   strm.bzfree = NULL;
1269
0
   strm.opaque = NULL;
1270
0
   ret = BZ2_bzCompressInit ( &strm, blockSize100k, 
1271
0
                              verbosity, workFactor );
1272
0
   if (ret != BZ_OK) return ret;
1273
1274
0
   strm.next_in = source;
1275
0
   strm.next_out = dest;
1276
0
   strm.avail_in = sourceLen;
1277
0
   strm.avail_out = *destLen;
1278
1279
0
   ret = BZ2_bzCompress ( &strm, BZ_FINISH );
1280
0
   if (ret == BZ_FINISH_OK) goto output_overflow;
1281
0
   if (ret != BZ_STREAM_END) goto errhandler;
1282
1283
   /* normal termination */
1284
0
   *destLen -= strm.avail_out;   
1285
0
   BZ2_bzCompressEnd ( &strm );
1286
0
   return BZ_OK;
1287
1288
0
   output_overflow:
1289
0
   BZ2_bzCompressEnd ( &strm );
1290
0
   return BZ_OUTBUFF_FULL;
1291
1292
0
   errhandler:
1293
0
   BZ2_bzCompressEnd ( &strm );
1294
0
   return ret;
1295
0
}
1296
1297
1298
/*---------------------------------------------------*/
1299
int BZ_API(BZ2_bzBuffToBuffDecompress) 
1300
                           ( char*         dest, 
1301
                             unsigned int* destLen,
1302
                             char*         source, 
1303
                             unsigned int  sourceLen,
1304
                             int           small,
1305
                             int           verbosity )
1306
0
{
1307
0
   bz_stream strm;
1308
0
   int ret;
1309
1310
0
   if (dest == NULL || destLen == NULL || 
1311
0
       source == NULL ||
1312
0
       (small != 0 && small != 1) ||
1313
0
       verbosity < 0 || verbosity > 4) 
1314
0
          return BZ_PARAM_ERROR;
1315
1316
0
   strm.bzalloc = NULL;
1317
0
   strm.bzfree = NULL;
1318
0
   strm.opaque = NULL;
1319
0
   ret = BZ2_bzDecompressInit ( &strm, verbosity, small );
1320
0
   if (ret != BZ_OK) return ret;
1321
1322
0
   strm.next_in = source;
1323
0
   strm.next_out = dest;
1324
0
   strm.avail_in = sourceLen;
1325
0
   strm.avail_out = *destLen;
1326
1327
0
   ret = BZ2_bzDecompress ( &strm );
1328
0
   if (ret == BZ_OK) goto output_overflow_or_eof;
1329
0
   if (ret != BZ_STREAM_END) goto errhandler;
1330
1331
   /* normal termination */
1332
0
   *destLen -= strm.avail_out;
1333
0
   BZ2_bzDecompressEnd ( &strm );
1334
0
   return BZ_OK;
1335
1336
0
   output_overflow_or_eof:
1337
0
   if (strm.avail_out > 0) {
1338
0
      BZ2_bzDecompressEnd ( &strm );
1339
0
      return BZ_UNEXPECTED_EOF;
1340
0
   } else {
1341
0
      BZ2_bzDecompressEnd ( &strm );
1342
0
      return BZ_OUTBUFF_FULL;
1343
0
   };      
1344
1345
0
   errhandler:
1346
0
   BZ2_bzDecompressEnd ( &strm );
1347
0
   return ret; 
1348
0
}
1349
1350
1351
/*---------------------------------------------------*/
1352
/*--
1353
   Code contributed by Yoshioka Tsuneo (tsuneo@rr.iij4u.or.jp)
1354
   to support better zlib compatibility.
1355
   This code is not _officially_ part of libbzip2 (yet);
1356
   I haven't tested it, documented it, or considered the
1357
   threading-safeness of it.
1358
   If this code breaks, please contact both Yoshioka and me.
1359
--*/
1360
/*---------------------------------------------------*/
1361
1362
/*---------------------------------------------------*/
1363
/*--
1364
   return version like "0.9.5d, 4-Sept-1999".
1365
--*/
1366
const char * BZ_API(BZ2_bzlibVersion)(void)
1367
2.74k
{
1368
2.74k
   return BZ_VERSION;
1369
2.74k
}
1370
1371
1372
#ifndef BZ_NO_STDIO
1373
/*---------------------------------------------------*/
1374
1375
#if defined(_WIN32) || defined(OS2) || defined(MSDOS)
1376
#   include <fcntl.h>
1377
#   include <io.h>
1378
#   define SET_BINARY_MODE(file) setmode(fileno(file),O_BINARY)
1379
#else
1380
#   define SET_BINARY_MODE(file)
1381
#endif
1382
static
1383
BZFILE * bzopen_or_bzdopen
1384
               ( const char *path,   /* no use when bzdopen */
1385
                 int fd,             /* no use when bzdopen */
1386
                 const char *mode,
1387
                 int open_mode)      /* bzopen: 0, bzdopen:1 */
1388
2.74k
{
1389
2.74k
   int    bzerr;
1390
2.74k
   char   unused[BZ_MAX_UNUSED];
1391
2.74k
   int    blockSize100k = 9;
1392
2.74k
   int    writing       = 0;
1393
2.74k
   char   mode2[10]     = "";
1394
2.74k
   FILE   *fp           = NULL;
1395
2.74k
   BZFILE *bzfp         = NULL;
1396
2.74k
   int    verbosity     = 0;
1397
2.74k
   int    workFactor    = 30;
1398
2.74k
   int    smallMode     = 0;
1399
2.74k
   int    nUnused       = 0; 
1400
1401
2.74k
   if (mode == NULL) return NULL;
1402
8.22k
   while (*mode) {
1403
5.48k
      switch (*mode) {
1404
2.74k
      case 'r':
1405
2.74k
         writing = 0; break;
1406
0
      case 'w':
1407
0
         writing = 1; break;
1408
0
      case 's':
1409
0
         smallMode = 1; break;
1410
2.74k
      default:
1411
2.74k
         if (isdigit((unsigned char)(*mode))) {
1412
0
            blockSize100k = *mode-BZ_HDR_0;
1413
0
         }
1414
5.48k
      }
1415
5.48k
      mode++;
1416
5.48k
   }
1417
2.74k
   strcat(mode2, writing ? "w" : "r" );
1418
2.74k
   strcat(mode2,"b");   /* binary mode */
1419
1420
2.74k
   if (open_mode==0) {
1421
0
      if (path==NULL || strcmp(path,"")==0) {
1422
0
        fp = (writing ? stdout : stdin);
1423
0
        SET_BINARY_MODE(fp);
1424
0
      } else {
1425
0
        fp = fopen(path,mode2);
1426
0
      }
1427
2.74k
   } else {
1428
#ifdef BZ_STRICT_ANSI
1429
      fp = NULL;
1430
#else
1431
2.74k
      fp = fdopen(fd,mode2);
1432
2.74k
#endif
1433
2.74k
   }
1434
2.74k
   if (fp == NULL) return NULL;
1435
1436
2.74k
   if (writing) {
1437
      /* Guard against total chaos and anarchy -- JRS */
1438
0
      if (blockSize100k < 1) blockSize100k = 1;
1439
0
      if (blockSize100k > 9) blockSize100k = 9; 
1440
0
      bzfp = BZ2_bzWriteOpen(&bzerr,fp,blockSize100k,
1441
0
                             verbosity,workFactor);
1442
2.74k
   } else {
1443
2.74k
      bzfp = BZ2_bzReadOpen(&bzerr,fp,verbosity,smallMode,
1444
2.74k
                            unused,nUnused);
1445
2.74k
   }
1446
2.74k
   if (bzfp == NULL) {
1447
0
      if (fp != stdin && fp != stdout) fclose(fp);
1448
0
      return NULL;
1449
0
   }
1450
2.74k
   return bzfp;
1451
2.74k
}
1452
1453
1454
/*---------------------------------------------------*/
1455
/*--
1456
   open file for read or write.
1457
      ex) bzopen("file","w9")
1458
      case path="" or NULL => use stdin or stdout.
1459
--*/
1460
BZFILE * BZ_API(BZ2_bzopen)
1461
               ( const char *path,
1462
                 const char *mode )
1463
0
{
1464
0
   return bzopen_or_bzdopen(path,-1,mode,/*bzopen*/0);
1465
0
}
1466
1467
1468
/*---------------------------------------------------*/
1469
BZFILE * BZ_API(BZ2_bzdopen)
1470
               ( int fd,
1471
                 const char *mode )
1472
2.74k
{
1473
2.74k
   return bzopen_or_bzdopen(NULL,fd,mode,/*bzdopen*/1);
1474
2.74k
}
1475
1476
1477
/*---------------------------------------------------*/
1478
int BZ_API(BZ2_bzread) (BZFILE* b, void* buf, int len )
1479
2.74k
{
1480
2.74k
   int bzerr, nread;
1481
2.74k
   if (((bzFile*)b)->lastErr == BZ_STREAM_END) return 0;
1482
2.74k
   nread = BZ2_bzRead(&bzerr,b,buf,len);
1483
2.74k
   if (bzerr == BZ_OK || bzerr == BZ_STREAM_END) {
1484
0
      return nread;
1485
2.74k
   } else {
1486
2.74k
      return -1;
1487
2.74k
   }
1488
2.74k
}
1489
1490
1491
/*---------------------------------------------------*/
1492
int BZ_API(BZ2_bzwrite) (BZFILE* b, void* buf, int len )
1493
2.74k
{
1494
2.74k
   int bzerr;
1495
1496
2.74k
   BZ2_bzWrite(&bzerr,b,buf,len);
1497
2.74k
   if(bzerr == BZ_OK){
1498
2.74k
      return len;
1499
2.74k
   }else{
1500
0
      return -1;
1501
0
   }
1502
2.74k
}
1503
1504
1505
/*---------------------------------------------------*/
1506
int BZ_API(BZ2_bzflush) (BZFILE *b)
1507
2.74k
{
1508
   /* do nothing now... */
1509
2.74k
   return 0;
1510
2.74k
}
1511
1512
1513
/*---------------------------------------------------*/
1514
void BZ_API(BZ2_bzclose) (BZFILE* b)
1515
2.74k
{
1516
2.74k
   int bzerr;
1517
2.74k
   FILE *fp;
1518
   
1519
2.74k
   if (b==NULL) {return;}
1520
2.74k
   fp = ((bzFile *)b)->handle;
1521
2.74k
   if(((bzFile*)b)->writing){
1522
0
      BZ2_bzWriteClose(&bzerr,b,0,NULL,NULL);
1523
0
      if(bzerr != BZ_OK){
1524
0
         BZ2_bzWriteClose(NULL,b,1,NULL,NULL);
1525
0
      }
1526
2.74k
   }else{
1527
2.74k
      BZ2_bzReadClose(&bzerr,b);
1528
2.74k
   }
1529
2.74k
   if(fp!=stdin && fp!=stdout){
1530
2.74k
      fclose(fp);
1531
2.74k
   }
1532
2.74k
}
1533
1534
1535
/*---------------------------------------------------*/
1536
/*--
1537
   return last error code 
1538
--*/
1539
static const char *bzerrorstrings[] = {
1540
       "OK"
1541
      ,"SEQUENCE_ERROR"
1542
      ,"PARAM_ERROR"
1543
      ,"MEM_ERROR"
1544
      ,"DATA_ERROR"
1545
      ,"DATA_ERROR_MAGIC"
1546
      ,"IO_ERROR"
1547
      ,"UNEXPECTED_EOF"
1548
      ,"OUTBUFF_FULL"
1549
      ,"CONFIG_ERROR"
1550
      ,"???"   /* for future */
1551
      ,"???"   /* for future */
1552
      ,"???"   /* for future */
1553
      ,"???"   /* for future */
1554
      ,"???"   /* for future */
1555
      ,"???"   /* for future */
1556
};
1557
1558
1559
const char * BZ_API(BZ2_bzerror) (BZFILE *b, int *errnum)
1560
0
{
1561
0
   int err = ((bzFile *)b)->lastErr;
1562
1563
0
   if(err>0) err = 0;
1564
0
   *errnum = err;
1565
0
   return bzerrorstrings[err*-1];
1566
0
}
1567
#endif
1568
1569
1570
/*-------------------------------------------------------------*/
1571
/*--- end                                           bzlib.c ---*/
1572
/*-------------------------------------------------------------*/