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:35
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:deflate_slow

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

Type:block_state

Parameter:

TypeParameterName
deflate_state *s
intflush
1011  hash_head = Local data
1015  cycle
1021  If umber of valid bytes ahead in window < Matches of length 3 are discarded if their distance exceeds TOO_FAR Then
1022  Compression function. Returns the block state after the call.
1023  If umber of valid bytes ahead in window < Matches of length 3 are discarded if their distance exceeds TOO_FAR && flush == constants Then
1026  If umber of valid bytes ahead in window == 0 Then Break
1032  If umber of valid bytes ahead in window >= The three kinds of block type Then
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  If 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) Then
1047  If avor or force Huffman coding != Z_HUFFMAN_ONLY Then
1052  If 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 ) Then
1065  If prev_length >= The three kinds of block type && length of best match <= prev_length Then
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  Do
1085  When --prev_length != 0 cycle
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  If bflush Then
1092  Else if set if previous match exists Then
1098  If zlib_tr_tally(s, 0, window[start of string to insert - 1]) Then
1101  start of string to insert ++
1102  umber of valid bytes ahead in window --
1103  If remaining free space at next_out == 0 Then Return lock not completed, need more input or more output
1104  Else
1108  set if previous match exists = 1
1109  start of string to insert ++
1110  umber of valid bytes ahead in window --
1114  If set if previous match exists Then