274 lines
8.3 KiB
C++
Executable File
274 lines
8.3 KiB
C++
Executable File
//
|
|
// INFCODES.CPP
|
|
//
|
|
// Source file for ArchiveLib 2.0
|
|
//
|
|
// No Copyright claimed by Greenleaf Software!
|
|
//
|
|
// DESCRIPTION
|
|
//
|
|
// This is one of the ZLIB source files, with as few changes as possible.
|
|
//
|
|
// REVISION HISTORY
|
|
//
|
|
// February 14, 1996 2.0A : New release
|
|
|
|
#include "arclib.h"
|
|
#if !defined( AL_IBM )
|
|
#pragma hdrstop
|
|
#endif
|
|
#if defined( AL_BORLAND )
|
|
#pragma option -w-
|
|
#endif
|
|
|
|
/* infcodes.c -- process literals and length/distance pairs
|
|
* Copyright (C) 1995 Mark Adler
|
|
* For conditions of distribution and use, see copyright notice in zlib.h
|
|
*/
|
|
|
|
#include "zutil.h"
|
|
#include "inftrees.h"
|
|
#include "infutil.h"
|
|
#include "inffast.h"
|
|
#include "infcodes.h"
|
|
|
|
/* simplify the use of the inflate_huft type with some defines */
|
|
#define base more.Base
|
|
#define next more.Next
|
|
#define exop word.what.Exop
|
|
#define bits word.what.Bits
|
|
|
|
/* mode */
|
|
enum inflate_codes_state_mode { /* waiting for "i:"=input, "o:"=output, "x:"=nothing */
|
|
START, /* x: set up for LEN */
|
|
LEN, /* i: get length/literal/eob next */
|
|
LENEXT, /* i: getting length extra (have base) */
|
|
DIST, /* i: get distance next */
|
|
DISTEXT, /* i: getting distance extra */
|
|
COPY, /* o: copying bytes in window, waiting for space */
|
|
LIT, /* o: got literal, waiting for output space */
|
|
WASH, /* o: got eob, possibly still output waiting */
|
|
END, /* x: got eob and all data flushed */
|
|
BADCODE}; /* x: got error */
|
|
/* inflate codes private state */
|
|
struct inflate_codes_state {
|
|
|
|
inflate_codes_state_mode mode; /* current inflate_codes mode */
|
|
|
|
/* mode dependent information */
|
|
uInt len;
|
|
union {
|
|
struct {
|
|
inflate_huft ZL_FAR *tree; /* pointer into tree */
|
|
uInt need; /* bits needed */
|
|
} code; /* if LEN or DIST, where in tree */
|
|
uInt lit; /* if LIT, literal */
|
|
struct {
|
|
uInt get; /* bits to get for extra */
|
|
uInt dist; /* distance back to copy from */
|
|
} copy; /* if EXT or COPY, where and how much */
|
|
} sub; /* submode */
|
|
|
|
/* mode independent information */
|
|
Byte lbits; /* ltree bits decoded per branch */
|
|
Byte dbits; /* dtree bits decoder per branch */
|
|
inflate_huft ZL_FAR *ltree; /* literal/length/eob tree */
|
|
inflate_huft ZL_FAR *dtree; /* distance tree */
|
|
|
|
};
|
|
|
|
|
|
struct inflate_codes_state ZL_FAR *inflate_codes_new(uInt bl, uInt bd, inflate_huft ZL_FAR *tl, inflate_huft ZL_FAR *td, z_stream *z)
|
|
{
|
|
struct inflate_codes_state ZL_FAR *c;
|
|
|
|
if ((c = (struct inflate_codes_state ZL_FAR *)
|
|
ZALLOC(z,1,sizeof(struct inflate_codes_state))) != Z_NULL)
|
|
{
|
|
c->mode = START;
|
|
c->lbits = (Byte)bl;
|
|
c->dbits = (Byte)bd;
|
|
c->ltree = tl;
|
|
c->dtree = td;
|
|
Tracev((stderr, "inflate: codes new\n"));
|
|
}
|
|
return c;
|
|
}
|
|
|
|
|
|
int inflate_codes(
|
|
struct inflate_blocks_state ZL_FAR *s,
|
|
z_stream *z,
|
|
int r )
|
|
{
|
|
uInt j; /* temporary storage */
|
|
inflate_huft ZL_FAR *t; /* temporary pointer */
|
|
uInt e; /* extra bits or operation */
|
|
uLong b; /* bit buffer */
|
|
uInt k; /* bits in bit buffer */
|
|
Byte ZL_FAR *p; /* input data pointer */
|
|
uInt n; /* bytes available there */
|
|
Byte ZL_FAR *q; /* output window write pointer */
|
|
uInt m; /* bytes to end of window or read pointer */
|
|
Byte ZL_FAR *f; /* pointer to copy strings from */
|
|
struct inflate_codes_state ZL_FAR *c = s->sub.decode.codes; /* codes state */
|
|
|
|
/* copy input/output information to locals (UPDATE macro restores) */
|
|
LOAD
|
|
|
|
/* process input and output based on current state */
|
|
for ( ; ; ) switch (c->mode)
|
|
{ /* waiting for "i:"=input, "o:"=output, "x:"=nothing */
|
|
case START: /* x: set up for LEN */
|
|
#ifndef SLOW
|
|
if (m >= 258 && n >= 10)
|
|
{
|
|
UPDATE
|
|
r = inflate_fast(c->lbits, c->dbits, c->ltree, c->dtree, s, z);
|
|
LOAD
|
|
if (r != Z_OK)
|
|
{
|
|
c->mode = r == Z_STREAM_END ? WASH : BADCODE;
|
|
break;
|
|
}
|
|
}
|
|
#endif /* !SLOW */
|
|
c->sub.code.need = c->lbits;
|
|
c->sub.code.tree = c->ltree;
|
|
c->mode = LEN;
|
|
case LEN: /* i: get length/literal/eob next */
|
|
j = c->sub.code.need;
|
|
NEEDBITS(j)
|
|
t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
|
|
DUMPBITS(t->bits)
|
|
e = (uInt)(t->exop);
|
|
if (e == 0) /* literal */
|
|
{
|
|
c->sub.lit = t->base;
|
|
Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ?
|
|
"inflate: literal '%c'\n" :
|
|
"inflate: literal 0x%02x\n", t->base));
|
|
c->mode = LIT;
|
|
break;
|
|
}
|
|
if (e & 16) /* length */
|
|
{
|
|
c->sub.copy.get = e & 15;
|
|
c->len = t->base;
|
|
c->mode = LENEXT;
|
|
break;
|
|
}
|
|
if ((e & 64) == 0) /* next table */
|
|
{
|
|
c->sub.code.need = e;
|
|
c->sub.code.tree = t->next;
|
|
break;
|
|
}
|
|
if (e & 32) /* end of block */
|
|
{
|
|
Tracevv((stderr, "inflate: end of block\n"));
|
|
c->mode = WASH;
|
|
break;
|
|
}
|
|
c->mode = BADCODE; /* invalid code */
|
|
z->msg = "invalid literal/length code";
|
|
r = Z_DATA_ERROR;
|
|
LEAVE
|
|
case LENEXT: /* i: getting length extra (have base) */
|
|
j = c->sub.copy.get;
|
|
NEEDBITS(j)
|
|
c->len += (uInt)b & inflate_mask[j];
|
|
DUMPBITS(j)
|
|
c->sub.code.need = c->dbits;
|
|
c->sub.code.tree = c->dtree;
|
|
Tracevv((stderr, "inflate: length %u\n", c->len));
|
|
c->mode = DIST;
|
|
case DIST: /* i: get distance next */
|
|
j = c->sub.code.need;
|
|
NEEDBITS(j)
|
|
t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
|
|
DUMPBITS(t->bits)
|
|
e = (uInt)(t->exop);
|
|
if (e & 16) /* distance */
|
|
{
|
|
c->sub.copy.get = e & 15;
|
|
c->sub.copy.dist = t->base;
|
|
c->mode = DISTEXT;
|
|
break;
|
|
}
|
|
if ((e & 64) == 0) /* next table */
|
|
{
|
|
c->sub.code.need = e;
|
|
c->sub.code.tree = t->next;
|
|
break;
|
|
}
|
|
c->mode = BADCODE; /* invalid code */
|
|
z->msg = "invalid distance code";
|
|
r = Z_DATA_ERROR;
|
|
LEAVE
|
|
case DISTEXT: /* i: getting distance extra */
|
|
j = c->sub.copy.get;
|
|
NEEDBITS(j)
|
|
c->sub.copy.dist += (uInt)b & inflate_mask[j];
|
|
DUMPBITS(j)
|
|
Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist));
|
|
c->mode = COPY;
|
|
case COPY: /* o: copying bytes in window, waiting for space */
|
|
f = (uInt)(q - s->window) < c->sub.copy.dist ?
|
|
s->end - (c->sub.copy.dist - (q - s->window)) :
|
|
q - c->sub.copy.dist;
|
|
while (c->len)
|
|
{
|
|
NEEDOUT
|
|
OUTBYTE(*f++)
|
|
if (f == s->end)
|
|
f = s->window;
|
|
c->len--;
|
|
}
|
|
c->mode = START;
|
|
break;
|
|
case LIT: /* o: got literal, waiting for output space */
|
|
NEEDOUT
|
|
OUTBYTE(c->sub.lit)
|
|
c->mode = START;
|
|
break;
|
|
case WASH: /* o: got eob, possibly more output */
|
|
FLUSH
|
|
if (s->read != s->write)
|
|
LEAVE
|
|
c->mode = END;
|
|
case END:
|
|
r = Z_STREAM_END;
|
|
LEAVE
|
|
case BADCODE: /* x: got error */
|
|
r = Z_DATA_ERROR;
|
|
LEAVE
|
|
default:
|
|
r = Z_STREAM_ERROR;
|
|
LEAVE
|
|
}
|
|
/*
|
|
* Microsoft C++ 7.0 complained that not all control paths
|
|
* in this function returned a value. I don't think that
|
|
* control can ever get to this point, but putting a return
|
|
* value here mollifies the compiler. I'm worried that
|
|
* smarter compilers are going to say that this is code that
|
|
* can never be reached, so I'm wrapping the whole thing up
|
|
* in some protective ifdefs
|
|
*/
|
|
#if defined( AL_MICROSOFT )
|
|
# if ( AL_MICROSOFT < 800 )
|
|
return 0;
|
|
# endif
|
|
#endif
|
|
}
|
|
|
|
|
|
void inflate_codes_free(
|
|
struct inflate_codes_state ZL_FAR *c,
|
|
z_stream *z )
|
|
{
|
|
ZFREE(z, c);
|
|
Tracev((stderr, "inflate: codes free\n"));
|
|
}
|