函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\zlib_deflate\deflate.c Create Date:2022-07-27 07:55:50
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称：Compression function. Returns the block state after the call.

函数原型：static void fill_window(deflate_state *s)

返回类型：void

参数：

类型参数名称
deflate_state *s
740  wsize等于LZ77 window size (32K by default)
742  循环
743  more等于Sliding window减umber of valid bytes ahead in window 减start of string to insert
746  如果more恒等于0且start of string to insert 恒等于0且umber of valid bytes ahead in window 恒等于0则
747  more等于wsize
749  否则如果more恒等于负1则
753  more自减
758  否则如果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)则
760  内存复制((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  循环
775  m等于*p先自减
776  p等于如果m大于等于wsize则m减wsize否则Local data
777  当n先自减循环
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  循环
782  m等于*p先自减
783  p等于如果m大于等于wsize则m减wsize否则Local data
787  当n先自减循环
788  more加等于wsize
790  如果 number of bytes available at next_in 恒等于0则返回
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  如果umber of valid bytes ahead in window 大于等于The three kinds of block type 则
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  当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循环
调用者
名称描述
deflate_stored
deflate_fast
deflate_slow