|
sl@0
|
1 |
/* inflate_util.c -- data and routines common to blocks and codes
|
|
sl@0
|
2 |
* Copyright (C) 1995-1998 Mark Adler
|
|
sl@0
|
3 |
* For conditions of distribution and use, see copyright notice in zlib.h
|
|
sl@0
|
4 |
*/
|
|
sl@0
|
5 |
|
|
sl@0
|
6 |
#include "zutil.h"
|
|
sl@0
|
7 |
#include "infblock.h"
|
|
sl@0
|
8 |
#include "inftrees.h"
|
|
sl@0
|
9 |
#include "infcodes.h"
|
|
sl@0
|
10 |
#include "infutil.h"
|
|
sl@0
|
11 |
|
|
sl@0
|
12 |
struct inflate_codes_state {int dummy;}; /* for buggy compilers */
|
|
sl@0
|
13 |
|
|
sl@0
|
14 |
/* And'ing with mask[n] masks the lower n bits */
|
|
sl@0
|
15 |
const uInt inflate_mask[17] = {
|
|
sl@0
|
16 |
0x0000,
|
|
sl@0
|
17 |
0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff,
|
|
sl@0
|
18 |
0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff
|
|
sl@0
|
19 |
};
|
|
sl@0
|
20 |
|
|
sl@0
|
21 |
|
|
sl@0
|
22 |
/* copy as much as possible from the sliding window to the output area */
|
|
sl@0
|
23 |
int inflate_flush(
|
|
sl@0
|
24 |
inflate_blocks_statef *s,
|
|
sl@0
|
25 |
z_streamp z,
|
|
sl@0
|
26 |
int r)
|
|
sl@0
|
27 |
{
|
|
sl@0
|
28 |
uInt n;
|
|
sl@0
|
29 |
Bytef *p;
|
|
sl@0
|
30 |
Bytef *q;
|
|
sl@0
|
31 |
|
|
sl@0
|
32 |
/* local copies of source and destination pointers */
|
|
sl@0
|
33 |
p = z->next_out;
|
|
sl@0
|
34 |
q = s->read;
|
|
sl@0
|
35 |
|
|
sl@0
|
36 |
/* compute number of bytes to copy as far as end of window */
|
|
sl@0
|
37 |
n = (uInt)((q <= s->write ? s->write : s->end) - q);
|
|
sl@0
|
38 |
if (n > z->avail_out) n = z->avail_out;
|
|
sl@0
|
39 |
if (n && r == Z_BUF_ERROR) r = Z_OK;
|
|
sl@0
|
40 |
|
|
sl@0
|
41 |
/* update counters */
|
|
sl@0
|
42 |
z->avail_out -= n;
|
|
sl@0
|
43 |
z->total_out += n;
|
|
sl@0
|
44 |
|
|
sl@0
|
45 |
/* update check information */
|
|
sl@0
|
46 |
if (s->checkfn != Z_NULL)
|
|
sl@0
|
47 |
z->adler = s->check = (*s->checkfn)(s->check, q, n);
|
|
sl@0
|
48 |
|
|
sl@0
|
49 |
/* copy as far as end of window */
|
|
sl@0
|
50 |
zmemcpy(p, q, n);
|
|
sl@0
|
51 |
p += n;
|
|
sl@0
|
52 |
q += n;
|
|
sl@0
|
53 |
|
|
sl@0
|
54 |
/* see if more to copy at beginning of window */
|
|
sl@0
|
55 |
if (q == s->end)
|
|
sl@0
|
56 |
{
|
|
sl@0
|
57 |
/* wrap pointers */
|
|
sl@0
|
58 |
q = s->window;
|
|
sl@0
|
59 |
if (s->write == s->end)
|
|
sl@0
|
60 |
s->write = s->window;
|
|
sl@0
|
61 |
|
|
sl@0
|
62 |
/* compute bytes to copy */
|
|
sl@0
|
63 |
n = (uInt)(s->write - q);
|
|
sl@0
|
64 |
if (n > z->avail_out) n = z->avail_out;
|
|
sl@0
|
65 |
if (n && r == Z_BUF_ERROR) r = Z_OK;
|
|
sl@0
|
66 |
|
|
sl@0
|
67 |
/* update counters */
|
|
sl@0
|
68 |
z->avail_out -= n;
|
|
sl@0
|
69 |
z->total_out += n;
|
|
sl@0
|
70 |
|
|
sl@0
|
71 |
/* update check information */
|
|
sl@0
|
72 |
if (s->checkfn != Z_NULL)
|
|
sl@0
|
73 |
z->adler = s->check = (*s->checkfn)(s->check, q, n);
|
|
sl@0
|
74 |
|
|
sl@0
|
75 |
/* copy */
|
|
sl@0
|
76 |
zmemcpy(p, q, n);
|
|
sl@0
|
77 |
p += n;
|
|
sl@0
|
78 |
q += n;
|
|
sl@0
|
79 |
}
|
|
sl@0
|
80 |
|
|
sl@0
|
81 |
/* update pointers */
|
|
sl@0
|
82 |
z->next_out = p;
|
|
sl@0
|
83 |
s->read = q;
|
|
sl@0
|
84 |
|
|
sl@0
|
85 |
/* done */
|
|
sl@0
|
86 |
return r;
|
|
sl@0
|
87 |
}
|