1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/ossrv/compressionlibs/ziplib/test/oldezlib/EZLib/inffast.cpp Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,183 @@
1.4 +/* inffast.c -- process literals and length/distance pairs fast
1.5 + * Copyright (C) 1995-2002 Mark Adler
1.6 + * For conditions of distribution and use, see copyright notice in zlib.h
1.7 + */
1.8 +
1.9 +#include "zutil.h"
1.10 +#include "inftrees.h"
1.11 +#include "infblock.h"
1.12 +#include "infcodes.h"
1.13 +#include "infutil.h"
1.14 +#include "inffast.h"
1.15 +
1.16 +struct inflate_codes_state {int dummy;}; /* for buggy compilers */
1.17 +
1.18 +/* simplify the use of the inflate_huft type with some defines */
1.19 +#define exop word.what.Exop
1.20 +#define bits word.what.Bits
1.21 +
1.22 +/* macros for bit input with no checking and for returning unused bytes */
1.23 +#define GRABBITS(j) {while(k<(j)){b|=((uLong)NEXTBYTE)<<k;k+=8;}}
1.24 +#define UNGRAB {c=z->avail_in-n;c=(k>>3)<c?k>>3:c;n+=c;p-=c;k-=c<<3;}
1.25 +
1.26 +/* Called with number of bytes left to write in window at least 258
1.27 + (the maximum string length) and number of input bytes available
1.28 + at least ten. The ten bytes are six bytes for the longest length/
1.29 + distance pair plus four bytes for overloading the bit buffer. */
1.30 +
1.31 +int inflate_fast(
1.32 +uInt bl, uInt bd,
1.33 +const inflate_huft *tl,
1.34 +const inflate_huft *td, /* need separate declaration for Borland C++ */
1.35 +inflate_blocks_statef *s,
1.36 +z_streamp z)
1.37 +{
1.38 + const inflate_huft *t; /* temporary pointer */
1.39 + uInt e; /* extra bits or operation */
1.40 + uLong b; /* bit buffer */
1.41 + uInt k; /* bits in bit buffer */
1.42 + Bytef *p; /* input data pointer */
1.43 + uInt n; /* bytes available there */
1.44 + Bytef *q; /* output window write pointer */
1.45 + uInt m; /* bytes to end of window or read pointer */
1.46 + uInt ml; /* mask for literal/length tree */
1.47 + uInt md; /* mask for distance tree */
1.48 + uInt c; /* bytes to copy */
1.49 + uInt d; /* distance back to copy from */
1.50 + Bytef *r; /* copy source pointer */
1.51 + int alwaysTrue = 1; /* Added by Markr Symbian 9/11/99 to get rid of warnings */
1.52 + /* load input, output, bit values */
1.53 + LOAD
1.54 +
1.55 + /* initialize masks */
1.56 + ml = inflate_mask[bl];
1.57 + md = inflate_mask[bd];
1.58 +
1.59 + /* do until not enough input or output space for fast loop */
1.60 + do { /* assume called with m >= 258 && n >= 10 */
1.61 + /* get literal/length code */
1.62 + GRABBITS(20) /* max bits for literal/length code */
1.63 + if ((e = (t = tl + ((uInt)b & ml))->exop) == 0)
1.64 + {
1.65 + DUMPBITS(t->bits)
1.66 + Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ?
1.67 + "inflate: * literal '%c'\n" :
1.68 + "inflate: * literal 0x%02x\n", t->base));
1.69 + *q++ = (Byte)t->base;
1.70 + m--;
1.71 + continue;
1.72 + }
1.73 + do {
1.74 + DUMPBITS(t->bits)
1.75 + if (e & 16)
1.76 + {
1.77 + /* get extra bits for length */
1.78 + e &= 15;
1.79 + c = t->base + ((uInt)b & inflate_mask[e]);
1.80 + DUMPBITS(e)
1.81 + Tracevv((stderr, "inflate: * length %u\n", c));
1.82 +
1.83 + /* decode distance base of block to copy */
1.84 + GRABBITS(15); /* max bits for distance code */
1.85 + e = (t = td + ((uInt)b & md))->exop;
1.86 + do {
1.87 + DUMPBITS(t->bits)
1.88 + if (e & 16)
1.89 + {
1.90 + /* get extra bits to add to distance base */
1.91 + e &= 15;
1.92 + GRABBITS(e) /* get extra bits (up to 13) */
1.93 + d = t->base + ((uInt)b & inflate_mask[e]);
1.94 + DUMPBITS(e)
1.95 + Tracevv((stderr, "inflate: * distance %u\n", d));
1.96 +
1.97 + /* do the copy */
1.98 + m -= c;
1.99 + r = q - d;
1.100 + if (r < s->window) /* wrap if needed */
1.101 + {
1.102 + do {
1.103 + r += s->end - s->window; /* force pointer in window */
1.104 + } while (r < s->window); /* covers invalid distances */
1.105 + e = s->end - r;
1.106 + if (c > e)
1.107 + {
1.108 + c -= e; /* wrapped copy */
1.109 + do {
1.110 + *q++ = *r++;
1.111 + } while (--e);
1.112 + r = s->window;
1.113 + do {
1.114 + *q++ = *r++;
1.115 + } while (--c);
1.116 + }
1.117 + else /* normal copy */
1.118 + {
1.119 + *q++ = *r++; c--;
1.120 + *q++ = *r++; c--;
1.121 + do {
1.122 + *q++ = *r++;
1.123 + } while (--c);
1.124 + }
1.125 + }
1.126 + else /* normal copy */
1.127 + {
1.128 + *q++ = *r++; c--;
1.129 + *q++ = *r++; c--;
1.130 + do {
1.131 + *q++ = *r++;
1.132 + } while (--c);
1.133 + }
1.134 + break;
1.135 + }
1.136 + else if ((e & 64) == 0)
1.137 + {
1.138 + t += t->base;
1.139 + e = (t += ((uInt)b & inflate_mask[e]))->exop;
1.140 + }
1.141 + else
1.142 + {
1.143 + z->msg = (char*)"invalid distance code";
1.144 + UNGRAB
1.145 + UPDATE
1.146 + return Z_DATA_ERROR;
1.147 + }
1.148 + } while (alwaysTrue); // Changed by Markr to alleviate warning
1.149 + break;
1.150 + }
1.151 + if ((e & 64) == 0)
1.152 + {
1.153 + t += t->base;
1.154 + if ((e = (t += ((uInt)b & inflate_mask[e]))->exop) == 0)
1.155 + {
1.156 + DUMPBITS(t->bits)
1.157 + Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ?
1.158 + "inflate: * literal '%c'\n" :
1.159 + "inflate: * literal 0x%02x\n", t->base));
1.160 + *q++ = (Byte)t->base;
1.161 + m--;
1.162 + break;
1.163 + }
1.164 + }
1.165 + else if (e & 32)
1.166 + {
1.167 + Tracevv((stderr, "inflate: * end of block\n"));
1.168 + UNGRAB
1.169 + UPDATE
1.170 + return Z_STREAM_END;
1.171 + }
1.172 + else
1.173 + {
1.174 + z->msg = (char*)"invalid literal/length code";
1.175 + UNGRAB
1.176 + UPDATE
1.177 + return Z_DATA_ERROR;
1.178 + }
1.179 + } while (alwaysTrue); // Changed by Markr to alleviate warning
1.180 + } while (m >= 258 && n >= 10);
1.181 +
1.182 + /* not enough input or output--restore pointers and return */
1.183 + UNGRAB
1.184 + UPDATE
1.185 + return Z_OK;
1.186 +}