deflate_fast

Name:deflate_fast

Proto:static block_state deflate_fast(deflate_state *s, int flush)

Type:block_state

Parameter:

Type	Parameter	Name
deflate_state *	s
int	flush

917

hash_head = Local data

920

cycle

926

If umber of valid bytes ahead in window < Matches of length 3 are discarded if their distance exceeds TOO_FAR Then

927

Compression function. Returns the block state after the call.

928

If umber of valid bytes ahead in window < Matches of length 3 are discarded if their distance exceeds TOO_FAR && flush == constants Then

929

Return lock not completed, need more input or more output

931

If umber of valid bytes ahead in window == 0 Then Break

937

If umber of valid bytes ahead in window >= The three kinds of block type Then

938

Insert string str in the dictionary and set match_head to the previous head* of the hash chain (the most recent string with same hash key)(s, start of string to insert , hash_head)

944

If hash_head != Local data && start of string to insert - hash_head <= Minimum amount of lookahead, except at the end of the input file.* See deflate.c for comments about the MIN_MATCH+1.(s) Then

949

If avor or force Huffman coding != Z_HUFFMAN_ONLY Then

950

length of best match = longest_match(s, hash_head)

954

If length of best match >= The three kinds of block type Then

957

bflush = zlib_tr_tally(s, start of string to insert - start of matching string , length of best match - The three kinds of block type )

960

umber of valid bytes ahead in window -= length of best match

965

If length of best match <= max_insert_length && umber of valid bytes ahead in window >= The three kinds of block type Then

967

length of best match --

968

969

start of string to insert ++

970

Insert string str in the dictionary and set match_head to the previous head* of the hash chain (the most recent string with same hash key)(s, start of string to insert , hash_head)

974

When --length of best match != 0 cycle

975

start of string to insert ++

976

Else

977

start of string to insert += length of best match

978

length of best match = 0

979

hash index of string to be inserted = window[start of string to insert ]

980

Update a hash value with the given input byte* IN assertion: all calls to UPDATE_HASH are made with consecutive* input characters, so that a running hash key can be computed from the* previous key instead of complete recalculation each time.(s, hash index of string to be inserted , window[start of string to insert + 1])

988

Else

991

bflush = zlib_tr_tally(s, 0, window[start of string to insert ])

992

umber of valid bytes ahead in window --

993

start of string to insert ++

995

If bflush Then

998

Return If flush == Z_FINISH Then finish_done Else lock flush performed

Source code conversion tool public plug-in interface	X
Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion

Function report