Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\zlib_deflate\deflate.c Create Date:2022-07-28 06:58:30
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:Compression function. Returns the block state after the call.

Proto:static void fill_window(deflate_state *s)

Type:void

Parameter:

TypeParameterName
deflate_state *s
740  wsize = LZ77 window size (32K by default)
742  Do
743  more = Sliding window - umber of valid bytes ahead in window - start of string to insert
746  If more == 0 && start of string to insert == 0 && umber of valid bytes ahead in window == 0 Then
747  more = wsize
749  Else if more == -1 Then
753  more--
758  Else if start of string to insert >= wsize + Minimum amount of lookahead, except at the end of the input file.* See deflate.c for comments about the MIN_MATCH+1.(s) Then
760  No 3D Now!((char * )window, (char * )window + wsize, (unsigned)wsize)
762  start of matching string -= wsize
763  start of string to insert -= wsize
764  Number of bits by which ins_h must be shifted at each input* step. It must be such that after MIN_MATCH steps, the oldest* byte no longer takes part in the hash key, that is:* hash_shift * MIN_MATCH >= hash_bits -= wsize
772  n = umber of elements in hash table
773  p = Heads of the hash chains or NIL. [n]
774  Do
775  m = *--p
776  p = If m >= wsize Then m - wsize Else Local data
777  When --n cycle
779  n = wsize
780  p = Actual size of window: 2*wSize, except when the user input buffer* is directly used as sliding window.[n]
781  Do
782  m = *--p
783  p = If m >= wsize Then m - wsize Else Local data
787  When --n cycle
788  more += wsize
790  If number of bytes available at next_in == 0 Then Return
805  n = read_buf(pointer back to this zlib stream , window + start of string to insert + umber of valid bytes ahead in window , more)
806  umber of valid bytes ahead in window += n
809  If umber of valid bytes ahead in window >= The three kinds of block type Then
810  hash index of string to be inserted = window[start of string to insert ]
811  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])
820  When umber of valid bytes ahead in window < Matches of length 3 are discarded if their distance exceeds TOO_FAR && number of bytes available at next_in != 0 cycle
Caller
NameDescribe
deflate_stored
deflate_fast
deflate_slow