=========================================================================== * 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 */

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

** Register a normal function ** Params: db, function name, number arguments, [ callback | step, finalize], user data ** Returns: true on sucess ** **

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

** Check whether there is pending Cdata, and call its handle if necessary */

startPtr gets set to non-null if the section is closed, and to null if the section is not yet closed. */

startPtr gets set to non-null is the section is closed, and to null if the section is not yet closed. */

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

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

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 */

gzclose() is in a separate file so that it is linked in only if it is used. That way the other gzclose functions can be used instead to avoid linki

-- see zlib.h -- */

-- see zlib.h -- */

-- see zlib.h -- */

** hash for lua_Numbers */

return hex representation of digest as string

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. */

move `dead' udata that need finalization to list `tmudata' */

** Look for n-th local variable at line `line' in function `func'. ** Returns NULL if not found. */

** Try to find a boundary in table `t'. A `boundary' is an integer index ** such that t[i] is non-nil and t[i+1] is nil (and 0 if t[1] is nil). */