zlib-streams 1.0.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/src/inflate9.c ADDED
@@ -0,0 +1,725 @@
1
+ /* inflate9.c -- zlib decompression
2
+ * Copyright (C) 2025 Gildas Lormeau (inflate9.c) - 1995-2022 Mark Adler (zlib)
3
+ * For conditions of distribution and use, see copyright notice in zlib.h
4
+ */
5
+
6
+ #include "zutil.h"
7
+ #include "inftree9.h"
8
+ #include "inflate.h"
9
+
10
+ #include "infback9.h"
11
+
12
+ extern int ZEXPORT inflate9Init2_(z_streamp strm, int windowBits,
13
+ const char *version, int stream_size);
14
+
15
+ int ZEXPORT inflate9Init(z_streamp strm) {
16
+ return inflate9Init2_(strm, 16, ZLIB_VERSION, (int)sizeof(z_stream));
17
+ }
18
+
19
+ static unsigned in(void *in_desc, unsigned char FAR **next);
20
+
21
+ static const unsigned char order[19] = {16, 17, 18, 0, 8, 7, 9, 6, 10, 5,
22
+ 11, 4, 12, 3, 13, 2, 14, 1, 15};
23
+
24
+ local int inflateStateCheck(z_streamp strm) {
25
+ struct inflate_state FAR *state;
26
+ if (strm == Z_NULL || strm->zalloc == (alloc_func)0 ||
27
+ strm->zfree == (free_func)0)
28
+ return 1;
29
+ state = (struct inflate_state FAR *)strm->state;
30
+ if (state == Z_NULL || state->strm != strm || state->mode < TYPE ||
31
+ state->mode > BAD)
32
+ return 1;
33
+ return 0;
34
+ }
35
+
36
+ int ZEXPORT inflate9ResetKeep(z_streamp strm) {
37
+ struct inflate_state FAR *state;
38
+
39
+ if (inflateStateCheck(strm))
40
+ return Z_STREAM_ERROR;
41
+ state = (struct inflate_state FAR *)strm->state;
42
+ strm->total_in = strm->total_out = state->total = 0;
43
+ strm->msg = Z_NULL;
44
+ if (state->wrap) /* to support ill-conceived Java test suite */
45
+ strm->adler = state->wrap & 1;
46
+ state->mode = TYPE;
47
+ state->last = 0;
48
+ state->havedict = 0;
49
+ state->flags = -1;
50
+ state->dmax = 65536U;
51
+ state->head = Z_NULL;
52
+ state->hold = 0;
53
+ state->bits = 0;
54
+ state->lencode = state->distcode = state->next = state->codes;
55
+ state->sane = 1;
56
+ state->back = -1;
57
+ Tracev((stderr, "inflate: reset\n"));
58
+ return Z_OK;
59
+ }
60
+
61
+ int ZEXPORT inflate9Reset(z_streamp strm) {
62
+ struct inflate_state FAR *state;
63
+
64
+ if (inflateStateCheck(strm))
65
+ return Z_STREAM_ERROR;
66
+ state = (struct inflate_state FAR *)strm->state;
67
+ state->wsize = 0;
68
+ state->whave = 0;
69
+ state->wnext = 0;
70
+ return inflate9ResetKeep(strm);
71
+ }
72
+
73
+ int ZEXPORT inflate9Reset2(z_streamp strm, int windowBits) {
74
+ int wrap;
75
+ struct inflate_state FAR *state;
76
+
77
+ /* get the state */
78
+ if (inflateStateCheck(strm))
79
+ return Z_STREAM_ERROR;
80
+ state = (struct inflate_state FAR *)strm->state;
81
+
82
+ /* extract wrap request from windowBits parameter */
83
+ if (windowBits < 0) {
84
+ if (windowBits < -16)
85
+ return Z_STREAM_ERROR;
86
+ wrap = 0;
87
+ windowBits = -windowBits;
88
+ } else {
89
+ wrap = (windowBits >> 4) + 5;
90
+ }
91
+ /* set number of window bits, free window if different */
92
+ if (windowBits && (windowBits < 8 || windowBits > 16))
93
+ return Z_STREAM_ERROR;
94
+ if (state->window != Z_NULL && state->wbits != (unsigned)windowBits) {
95
+ ZFREE(strm, state->window);
96
+ state->window = Z_NULL;
97
+ }
98
+ /* update state and reset the rest of it */
99
+ state->wrap = wrap;
100
+ state->wbits = (unsigned)windowBits;
101
+ return inflate9Reset(strm);
102
+ }
103
+
104
+ int ZEXPORT inflate9Init2_(z_streamp strm, int windowBits, const char *version,
105
+ int stream_size) {
106
+ int ret;
107
+ struct inflate_state FAR *state;
108
+
109
+ if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
110
+ stream_size != (int)(sizeof(z_stream)))
111
+ return Z_VERSION_ERROR;
112
+ if (strm == Z_NULL)
113
+ return Z_STREAM_ERROR;
114
+ strm->msg = Z_NULL; /* in case we return an error */
115
+ if (strm->zalloc == (alloc_func)0) {
116
+ strm->zalloc = zcalloc;
117
+ strm->opaque = (voidpf)0;
118
+ }
119
+ if (strm->zfree == (free_func)0)
120
+ strm->zfree = zcfree;
121
+ state =
122
+ (struct inflate_state FAR *)ZALLOC(strm, 1, sizeof(struct inflate_state));
123
+ if (state == Z_NULL)
124
+ return Z_MEM_ERROR;
125
+ Tracev((stderr, "inflate: allocated\n"));
126
+ strm->state = (struct internal_state FAR *)state;
127
+ state->strm = strm;
128
+ state->window = Z_NULL;
129
+ state->mode = TYPE;
130
+ ret = inflate9Reset2(strm, windowBits);
131
+ if (ret != Z_OK) {
132
+ ZFREE(strm, state);
133
+ strm->state = Z_NULL;
134
+ }
135
+ return ret;
136
+ }
137
+
138
+ int ZEXPORT inflate9Init_(z_streamp strm, const char *version,
139
+ int stream_size) {
140
+ return inflate9Init2_(strm, DEF_WBITS, version, stream_size);
141
+ }
142
+
143
+ static unsigned in(void *in_desc, unsigned char FAR **next) {
144
+ z_stream *strm = (z_stream *)in_desc;
145
+
146
+ if (strm == Z_NULL || strm->next_in == Z_NULL || strm->avail_in == 0) {
147
+ *next = Z_NULL;
148
+ return 0;
149
+ }
150
+ *next = strm->next_in;
151
+ return strm->avail_in;
152
+ }
153
+
154
+ void fixedtables(struct inflate_state FAR *state) {
155
+ static int virgin = 1;
156
+ static code *lenfix, *distfix;
157
+ static code fixed[544];
158
+ if (virgin) {
159
+ unsigned sym, bits;
160
+ static code *next;
161
+ sym = 0;
162
+ while (sym < 144)
163
+ state->lens[sym++] = 8;
164
+ while (sym < 256)
165
+ state->lens[sym++] = 9;
166
+ while (sym < 280)
167
+ state->lens[sym++] = 7;
168
+ while (sym < 288)
169
+ state->lens[sym++] = 8;
170
+ next = fixed;
171
+ lenfix = next;
172
+ bits = 9;
173
+ inflate_table9(LENS, state->lens, 288, &(next), &(bits), state->work);
174
+
175
+ /* distance table */
176
+ sym = 0;
177
+ while (sym < 32)
178
+ state->lens[sym++] = 5;
179
+ distfix = next;
180
+ bits = 5;
181
+ inflate_table9(DISTS, state->lens, 32, &(next), &(bits), state->work);
182
+
183
+ /* do this just once */
184
+ virgin = 0;
185
+ }
186
+ state->lencode = lenfix;
187
+ state->lenbits = 9;
188
+ state->distcode = distfix;
189
+ state->distbits = 5;
190
+ }
191
+
192
+ local int updatewindow(z_streamp strm, const Bytef *end, unsigned copy) {
193
+ struct inflate_state FAR *state;
194
+ unsigned dist;
195
+
196
+ state = (struct inflate_state FAR *)strm->state;
197
+
198
+ /* if it hasn't been done already, allocate space for the window */
199
+ if (state->window == Z_NULL) {
200
+ state->window = (unsigned char FAR *)ZALLOC(strm, 1U << state->wbits,
201
+ sizeof(unsigned char));
202
+ if (state->window == Z_NULL)
203
+ return 1;
204
+ }
205
+
206
+ /* if window not in use yet, initialize */
207
+ if (state->wsize == 0) {
208
+ state->wsize = 1U << state->wbits;
209
+ state->wnext = 0;
210
+ state->whave = 0;
211
+ }
212
+
213
+ /* copy state->wsize or less output bytes into the circular window */
214
+ if (copy >= state->wsize) {
215
+ zmemcpy(state->window, end - state->wsize, state->wsize);
216
+ state->wnext = 0;
217
+ state->whave = state->wsize;
218
+ } else {
219
+ dist = state->wsize - state->wnext;
220
+ if (dist > copy)
221
+ dist = copy;
222
+ zmemcpy(state->window + state->wnext, end - copy, dist);
223
+ copy -= dist;
224
+ if (copy) {
225
+ zmemcpy(state->window, end - copy, copy);
226
+ state->wnext = copy;
227
+ state->whave = state->wsize;
228
+ } else {
229
+ state->wnext += dist;
230
+ if (state->wnext == state->wsize)
231
+ state->wnext = 0;
232
+ if (state->whave < state->wsize)
233
+ state->whave += dist;
234
+ }
235
+ }
236
+ return 0;
237
+ }
238
+
239
+ /* Load registers with state in inflate() for speed */
240
+ #define LOAD() \
241
+ do { \
242
+ put = strm->next_out; \
243
+ left = strm->avail_out; \
244
+ next = strm->next_in; \
245
+ have = strm->avail_in; \
246
+ hold = state->hold; \
247
+ bits = state->bits; \
248
+ } while (0)
249
+
250
+ /* Restore state from registers in inflate() */
251
+ #define RESTORE() \
252
+ do { \
253
+ strm->next_out = put; \
254
+ strm->avail_out = left; \
255
+ strm->next_in = next; \
256
+ strm->avail_in = have; \
257
+ state->hold = hold; \
258
+ state->bits = bits; \
259
+ } while (0)
260
+
261
+ /* Clear the input bit accumulator */
262
+ #define INITBITS() \
263
+ do { \
264
+ hold = 0; \
265
+ bits = 0; \
266
+ } while (0)
267
+
268
+ #define PULLBYTE() \
269
+ do { \
270
+ if (have == 0) \
271
+ goto inf_leave; \
272
+ have--; \
273
+ hold += (unsigned long)(*next++) << bits; \
274
+ bits += 8; \
275
+ } while (0)
276
+
277
+ #define NEEDBITS(n) \
278
+ do { \
279
+ while (bits < (unsigned)(n)) \
280
+ PULLBYTE(); \
281
+ } while (0)
282
+
283
+ #define BITS(n) ((unsigned)hold & ((1U << (n)) - 1))
284
+
285
+ #define DROPBITS(n) \
286
+ do { \
287
+ hold >>= (n); \
288
+ bits -= (unsigned)(n); \
289
+ } while (0)
290
+
291
+ #define BYTEBITS() \
292
+ do { \
293
+ hold >>= bits & 7; \
294
+ bits -= bits & 7; \
295
+ } while (0)
296
+
297
+ int ZEXPORT inflate9(z_streamp strm, int flush) {
298
+ struct inflate_state FAR *state;
299
+ z_const unsigned char FAR *next; /* next input */
300
+ unsigned char FAR *put; /* next output */
301
+ unsigned have, left; /* available input and output */
302
+ unsigned long hold; /* bit buffer */
303
+ unsigned bits; /* bits in bit buffer */
304
+ unsigned in, out; /* save starting available input and output */
305
+ unsigned copy; /* number of stored or match bytes to copy */
306
+ unsigned char FAR *from; /* where to copy match bytes from */
307
+ code here; /* current decoding table entry */
308
+ code last; /* parent table entry */
309
+ unsigned len; /* length to copy for repeats, bits to drop */
310
+ int ret; /* return code */
311
+ static const unsigned short order[19] = /* permutation of code lengths */
312
+ {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
313
+
314
+ if (inflateStateCheck(strm) || strm->next_out == Z_NULL ||
315
+ (strm->next_in == Z_NULL && strm->avail_in != 0))
316
+ return Z_STREAM_ERROR;
317
+
318
+ state = (struct inflate_state FAR *)strm->state;
319
+ LOAD();
320
+ in = have;
321
+ out = left;
322
+ ret = Z_OK;
323
+ for (;;)
324
+ switch (state->mode) {
325
+ case TYPE:
326
+ if (flush == Z_BLOCK || flush == Z_TREES)
327
+ goto inf_leave;
328
+ /* fallthrough */
329
+ case TYPEDO:
330
+ if (state->last) {
331
+ BYTEBITS();
332
+ state->mode = DONE;
333
+ break;
334
+ }
335
+ NEEDBITS(3);
336
+ state->last = BITS(1);
337
+ DROPBITS(1);
338
+ switch (BITS(2)) {
339
+ case 0: /* stored block */
340
+ Tracev((stderr, "inflate: stored block%s\n",
341
+ state->last ? " (last)" : ""));
342
+ state->mode = STORED;
343
+ break;
344
+ case 1: /* fixed block */
345
+ fixedtables(state);
346
+ Tracev((stderr, "inflate: fixed codes block%s\n",
347
+ state->last ? " (last)" : ""));
348
+ state->mode = LEN_; /* decode codes */
349
+ if (flush == Z_TREES) {
350
+ DROPBITS(2);
351
+ goto inf_leave;
352
+ }
353
+ break;
354
+ case 2: /* dynamic block */
355
+ Tracev((stderr, "inflate: dynamic codes block%s\n",
356
+ state->last ? " (last)" : ""));
357
+ state->mode = TABLE;
358
+ break;
359
+ case 3:
360
+ strm->msg = (z_const char *)"invalid block type";
361
+ state->mode = BAD;
362
+ }
363
+ DROPBITS(2);
364
+ break;
365
+ case STORED:
366
+ BYTEBITS();
367
+ NEEDBITS(32);
368
+ if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
369
+ strm->msg = (z_const char *)"invalid stored block lengths";
370
+ state->mode = BAD;
371
+ break;
372
+ }
373
+ state->length = (unsigned)hold & 0xffff;
374
+ Tracev((stderr, "inflate: stored length %u\n", state->length));
375
+ INITBITS();
376
+ state->mode = COPY_;
377
+ if (flush == Z_TREES)
378
+ goto inf_leave;
379
+ /* fallthrough */
380
+ case COPY_:
381
+ state->mode = COPY;
382
+ /* fallthrough */
383
+ case COPY:
384
+ copy = state->length;
385
+ if (copy) {
386
+ if (copy > have)
387
+ copy = have;
388
+ if (copy > left)
389
+ copy = left;
390
+ if (copy == 0)
391
+ goto inf_leave;
392
+ zmemcpy(put, next, copy);
393
+ have -= copy;
394
+ next += copy;
395
+ left -= copy;
396
+ put += copy;
397
+ state->length -= copy;
398
+ break;
399
+ }
400
+ Tracev((stderr, "inflate: stored end\n"));
401
+ state->mode = TYPE;
402
+ break;
403
+ case TABLE:
404
+ NEEDBITS(14);
405
+ state->nlen = BITS(5) + 257;
406
+ DROPBITS(5);
407
+ state->ndist = BITS(5) + 1;
408
+ DROPBITS(5);
409
+ state->ncode = BITS(4) + 4;
410
+ DROPBITS(4);
411
+ if (state->nlen > 286) {
412
+ strm->msg = (z_const char *)"too many length or distance symbols";
413
+ state->mode = BAD;
414
+ break;
415
+ }
416
+ Tracev((stderr, "inflate: table sizes ok\n"));
417
+ state->have = 0;
418
+ state->mode = LENLENS;
419
+ /* fallthrough */
420
+ case LENLENS:
421
+ while (state->have < state->ncode) {
422
+ NEEDBITS(3);
423
+ state->lens[order[state->have++]] = (unsigned short)BITS(3);
424
+ DROPBITS(3);
425
+ }
426
+ while (state->have < 19)
427
+ state->lens[order[state->have++]] = 0;
428
+ state->next = state->codes;
429
+ state->lencode = state->distcode = (const code FAR *)(state->next);
430
+ state->lenbits = 7;
431
+ ret = inflate_table9(CODES, state->lens, 19, &(state->next),
432
+ &(state->lenbits), state->work);
433
+ if (ret) {
434
+ strm->msg = (z_const char *)"invalid code lengths set";
435
+ state->mode = BAD;
436
+ break;
437
+ }
438
+ Tracev((stderr, "inflate: code lengths ok\n"));
439
+ state->have = 0;
440
+ state->mode = CODELENS;
441
+ /* fallthrough */
442
+ case CODELENS:
443
+ while (state->have < state->nlen + state->ndist) {
444
+ for (;;) {
445
+ here = state->lencode[BITS(state->lenbits)];
446
+ if ((unsigned)(here.bits) <= bits)
447
+ break;
448
+ PULLBYTE();
449
+ }
450
+ if (here.val < 16) {
451
+ DROPBITS(here.bits);
452
+ state->lens[state->have++] = here.val;
453
+ } else {
454
+ if (here.val == 16) {
455
+ NEEDBITS(here.bits + 2);
456
+ DROPBITS(here.bits);
457
+ if (state->have == 0) {
458
+ strm->msg = (z_const char *)"invalid bit length repeat";
459
+ state->mode = BAD;
460
+ break;
461
+ }
462
+ len = state->lens[state->have - 1];
463
+ copy = 3 + BITS(2);
464
+ DROPBITS(2);
465
+ } else if (here.val == 17) {
466
+ NEEDBITS(here.bits + 3);
467
+ DROPBITS(here.bits);
468
+ len = 0;
469
+ copy = 3 + BITS(3);
470
+ DROPBITS(3);
471
+ } else {
472
+ NEEDBITS(here.bits + 7);
473
+ DROPBITS(here.bits);
474
+ len = 0;
475
+ copy = 11 + BITS(7);
476
+ DROPBITS(7);
477
+ }
478
+ if (state->have + copy > state->nlen + state->ndist) {
479
+ strm->msg = (z_const char *)"invalid bit length repeat";
480
+ state->mode = BAD;
481
+ break;
482
+ }
483
+ while (copy--)
484
+ state->lens[state->have++] = (unsigned short)len;
485
+ }
486
+ }
487
+
488
+ /* handle error breaks in while */
489
+ if (state->mode == BAD)
490
+ break;
491
+
492
+ /* check for end-of-block code (better have one) */
493
+ if (state->lens[256] == 0) {
494
+ strm->msg = (z_const char *)"invalid code -- missing end-of-block";
495
+ state->mode = BAD;
496
+ break;
497
+ }
498
+
499
+ state->next = state->codes;
500
+ state->lencode = (const code FAR *)(state->next);
501
+ ret = inflate_table9(LENS, state->lens, state->nlen, &(state->next),
502
+ &(state->lenbits), state->work);
503
+ if (ret) {
504
+ strm->msg = (z_const char *)"invalid literal/lengths set";
505
+ state->mode = BAD;
506
+ break;
507
+ }
508
+ state->distcode = (const code FAR *)(state->next);
509
+ ret = inflate_table9(DISTS, state->lens + state->nlen, state->ndist,
510
+ &(state->next), &(state->distbits), state->work);
511
+ if (ret) {
512
+ strm->msg = (z_const char *)"invalid distances set";
513
+ state->mode = BAD;
514
+ break;
515
+ }
516
+ Tracev((stderr, "inflate: codes ok\n"));
517
+ state->mode = LEN_;
518
+ if (flush == Z_TREES)
519
+ goto inf_leave;
520
+ /* fallthrough */
521
+ case LEN_:
522
+ state->mode = LEN;
523
+ /* fallthrough */
524
+ case LEN:
525
+ state->back = 0;
526
+ for (;;) {
527
+ here = state->lencode[BITS(state->lenbits)];
528
+ if ((unsigned)(here.bits) <= bits)
529
+ break;
530
+ PULLBYTE();
531
+ }
532
+ if (here.op && (here.op & 0xf0) == 0) {
533
+ last = here;
534
+ for (;;) {
535
+ here = state->lencode[last.val +
536
+ (BITS(last.bits + last.op) >> last.bits)];
537
+ if ((unsigned)(last.bits + here.bits) <= bits)
538
+ break;
539
+ PULLBYTE();
540
+ }
541
+ DROPBITS(last.bits);
542
+ state->back += last.bits;
543
+ }
544
+ DROPBITS(here.bits);
545
+ state->back += here.bits;
546
+ state->length = (unsigned)here.val;
547
+ if ((int)(here.op) == 0) {
548
+ Tracevv((stderr,
549
+ here.val >= 0x20 && here.val < 0x7f
550
+ ? "inflate: literal '%c'\n"
551
+ : "inflate: literal 0x%02x\n",
552
+ here.val));
553
+ state->mode = LIT;
554
+ break;
555
+ }
556
+ if (here.op & 32) {
557
+ Tracevv((stderr, "inflate: end of block\n"));
558
+ state->back = -1;
559
+ state->mode = TYPE;
560
+ break;
561
+ }
562
+ if (here.op & 64) {
563
+ strm->msg = (z_const char *)"invalid literal/length code";
564
+ state->mode = BAD;
565
+ break;
566
+ }
567
+ state->extra = (unsigned)(here.op) & 15;
568
+ state->mode = LENEXT;
569
+ /* fallthrough */
570
+ case LENEXT:
571
+ if (state->extra) {
572
+ NEEDBITS(state->extra);
573
+ state->length += BITS(state->extra);
574
+ DROPBITS(state->extra);
575
+ state->back += state->extra;
576
+ }
577
+ Tracevv((stderr, "inflate: length %u\n", state->length));
578
+ state->was = state->length;
579
+ state->mode = DIST;
580
+ /* fallthrough */
581
+ case DIST:
582
+ for (;;) {
583
+ here = state->distcode[BITS(state->distbits)];
584
+ if ((unsigned)(here.bits) <= bits)
585
+ break;
586
+ PULLBYTE();
587
+ }
588
+ if ((here.op & 0xf0) == 0) {
589
+ last = here;
590
+ for (;;) {
591
+ here = state->distcode[last.val +
592
+ (BITS(last.bits + last.op) >> last.bits)];
593
+ if ((unsigned)(last.bits + here.bits) <= bits)
594
+ break;
595
+ PULLBYTE();
596
+ }
597
+ DROPBITS(last.bits);
598
+ state->back += last.bits;
599
+ }
600
+ DROPBITS(here.bits);
601
+ state->back += here.bits;
602
+ if (here.op & 64) {
603
+ strm->msg = (z_const char *)"invalid distance code";
604
+ state->mode = BAD;
605
+ break;
606
+ }
607
+ state->offset = (unsigned)here.val;
608
+ state->extra = (unsigned)(here.op) & 15;
609
+ state->mode = DISTEXT;
610
+ /* fallthrough */
611
+ case DISTEXT:
612
+ if (state->extra) {
613
+ NEEDBITS(state->extra);
614
+ state->offset += BITS(state->extra);
615
+ DROPBITS(state->extra);
616
+ state->back += state->extra;
617
+ }
618
+ if (state->offset > state->dmax) {
619
+ strm->msg = (z_const char *)"invalid distance too far back";
620
+ state->mode = BAD;
621
+ break;
622
+ }
623
+ Tracevv((stderr, "inflate: distance %u\n", state->offset));
624
+ state->mode = MATCH;
625
+ /* fallthrough */
626
+ case MATCH:
627
+ if (left == 0)
628
+ goto inf_leave;
629
+ copy = out - left;
630
+ if (state->offset > copy) { /* copy from window */
631
+ copy = state->offset - copy;
632
+ if (copy > state->whave) {
633
+ if (state->sane) {
634
+ strm->msg = (z_const char *)"invalid distance too far back";
635
+ state->mode = BAD;
636
+ break;
637
+ }
638
+ #ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
639
+ copy -= state->whave;
640
+ if (copy > state->length)
641
+ copy = state->length;
642
+ if (copy > left)
643
+ copy = left;
644
+ left -= copy;
645
+ state->length -= copy;
646
+ do {
647
+ *put++ = 0;
648
+ } while (--copy);
649
+ if (state->length == 0)
650
+ state->mode = LEN;
651
+ break;
652
+ #endif
653
+ }
654
+ if (copy > state->wnext) {
655
+ copy -= state->wnext;
656
+ from = state->window + (state->wsize - copy);
657
+ } else
658
+ from = state->window + (state->wnext - copy);
659
+ if (copy > state->length)
660
+ copy = state->length;
661
+ } else { /* copy from output */
662
+ from = put - state->offset;
663
+ copy = state->length;
664
+ }
665
+ if (copy > left)
666
+ copy = left;
667
+ left -= copy;
668
+ state->length -= copy;
669
+ do {
670
+ *put++ = *from++;
671
+ } while (--copy);
672
+ if (state->length == 0)
673
+ state->mode = LEN;
674
+ break;
675
+ case LIT:
676
+ if (left == 0)
677
+ goto inf_leave;
678
+ *put++ = (unsigned char)(state->length);
679
+ left--;
680
+ state->mode = LEN;
681
+ break;
682
+ case DONE:
683
+ ret = Z_STREAM_END;
684
+ goto inf_leave;
685
+ case BAD:
686
+ ret = Z_DATA_ERROR;
687
+ goto inf_leave;
688
+ default:
689
+ return Z_STREAM_ERROR;
690
+ }
691
+
692
+ inf_leave:
693
+ state->hold = hold;
694
+ RESTORE();
695
+ if (state->wsize || (out != strm->avail_out && state->mode < BAD &&
696
+ (state->mode < DONE || flush != Z_FINISH)))
697
+ if (updatewindow(strm, strm->next_out, out - strm->avail_out)) {
698
+ state->mode = MEM;
699
+ return Z_MEM_ERROR;
700
+ }
701
+ in -= strm->avail_in;
702
+ out -= strm->avail_out;
703
+ strm->total_in += in;
704
+ strm->total_out += out;
705
+ state->total += out;
706
+ strm->data_type = (int)state->bits + (state->last ? 64 : 0) +
707
+ (state->mode == TYPE ? 128 : 0) +
708
+ (state->mode == LEN_ || state->mode == COPY_ ? 256 : 0);
709
+ if (((in == 0 && out == 0) || flush == Z_FINISH) && ret == Z_OK)
710
+ ret = Z_BUF_ERROR;
711
+ return ret;
712
+ }
713
+
714
+ int ZEXPORT inflate9End(z_streamp strm) {
715
+ struct inflate_state FAR *state;
716
+ if (inflateStateCheck(strm))
717
+ return Z_STREAM_ERROR;
718
+ state = (struct inflate_state FAR *)strm->state;
719
+ if (state->window != Z_NULL)
720
+ ZFREE(strm, state->window);
721
+ ZFREE(strm, strm->state);
722
+ strm->state = Z_NULL;
723
+ Tracev((stderr, "inflate: end\n"));
724
+ return Z_OK;
725
+ }