=========================================================================== * Flush the bits in the bit buffer to pending output (leaves at most 7 bi

=========================================================================== * Send a stored block */

========================================================================= */

=========================================================================== * Flush the bit buffer, keeping at most 7 bits in it. */

=========================================================================== * Reverse the first len bits of a code, using straightforward code (a fas

=========================================================================== * Flush the bit buffer and align the output on a byte boundary */

=========================================================================== * Send the block data compressed using the given Huffman trees */

NON_MATCHING | Score: 1065 (lower is better)

========================================================================= */

param names guessed

Return state with length and distance decoding tables and index sizes set to fixed code decoding. Normally this returns fixed tables from inffixe

=========================================================================== * Generate the codes for a given tree and bit counts (which need not be

setup some texture stuff

NON_MATCHING: I'm dumb, impossible to match :), fix the structure

Load up input buffer and set eof flag if last data loaded -- return -1 on error, 0 otherwise. Note that the eof flag is set when the end of the in

Decompress from input to the provided next_out and avail_out in the state. On return, state->x.have and state->x.next point to the just decompresse

Look for gzip header, set up for inflate or copy. state->x.have must be 0. If this is the first time in, allocate required memory. state->how wil

Reset gzip file state */

-- see zlib.h -- */

-- see zlib.h -- */

Decode literal, length, and distance codes and write out the resulting literal and match bytes until either not enough input or output is availa

=========================================================================== * Initialize a new block. */

For 80x86 and 680x0, an optimized version will be provided in match.asm or * match.S. The code will be functionally equivalent. */

MAKECRCH */ Generate tables for a byte-wise 32-bit CRC calculation on the polynomial: x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+

Function to format a fixed point value in ASCII. */

Function to format a floating point value in ASCII with a given * precision. */

Internal function to build a single 16-bit table - the table consists of * 'num' 256 entry subtables, where 'num' is determined by 'shift' - the amou