函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

函数名称：deflate_slow

函数原型：static block_state deflate_slow(deflate_state *s, int flush)

返回类型：block_state

参数：

类型参数名称
deflate_state *s
intflush
1011  hash_head等于Local data
1015  循环
1021  如果umber of valid bytes ahead in window 小于Matches of length 3 are discarded if their distance exceeds TOO_FAR 则
1022  Compression function. Returns the block state after the call.
1023  如果umber of valid bytes ahead in window 小于Matches of length 3 are discarded if their distance exceeds TOO_FAR 且flush恒等于constants 则
1026  如果umber of valid bytes ahead in window 恒等于0则退出
1032  如果umber of valid bytes ahead in window 大于等于The three kinds of block type 则
1033  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)
1038  prev_length等于length of best match , previous match 等于start of matching string
1039  length of best match 等于The three kinds of block type 减1
1041  如果hash_head不等于Local data且prev_length小于To speed up deflation, hash chains are never searched beyond this* length. A higher limit improves compression ratio but degrades the* speed.且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)则
1047  如果avor or force Huffman coding不等于Z_HUFFMAN_ONLY则
1052  如果length of best match 小于等于5且avor or force Huffman coding恒等于compression levels 或length of best match 恒等于The three kinds of block type 且start of string to insert 减start of matching string 大于Tail of hash chains 的值则
1065  如果prev_length大于等于The three kinds of block type 且length of best match 小于等于prev_length则
1066  max_insert等于start of string to insert 加umber of valid bytes ahead in window 减The three kinds of block type
1071  bflush等于zlib_tr_tally(s, start of string to insert - 1 - previous match , prev_length - The three kinds of block type )
1079  umber of valid bytes ahead in window 减等于prev_length减1
1080  prev_length减等于2
1081  循环
1085  当prev_length先自减不等于0循环
1086  set if previous match exists 等于0
1087  length of best match 等于The three kinds of block type 减1
1088  start of string to insert 自加
1090  如果bflush则
1092  否则如果set if previous match exists 则
1098  如果zlib_tr_tally(s, 0, window[start of string to insert - 1])则
1101  start of string to insert 自加
1102  umber of valid bytes ahead in window 自减
1103  如果 remaining free space at next_out 恒等于0则返回:lock not completed, need more input or more output
1104  否则
1108  set if previous match exists 等于1
1109  start of string to insert 自加
1110  umber of valid bytes ahead in window 自减
1114  如果set if previous match exists 则