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

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

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

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

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

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

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

初始化 @param context

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

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

判断网络是否连接 @param context @return

跳转

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

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+

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+

=========================================================================== * Restore the heap property by moving down the tree starting at node k,

=========================================================================== * Restore the heap property by moving down the tree starting at node k,