函数逻辑报告 |
Source Code:lib\zlib_deflate\deflate.c |
Create Date:2022-07-27 07:55:48 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:longest_match
函数原型:static uInt longest_match(deflate_state *s, IPos cur_match)
返回类型:uInt
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| deflate_state * | s | |
| IPos | cur_match |
| 559 | chain_length等于Length of the best match at previous step. Matches not greater than this* are discarded. This is used in the lazy match evaluation. |
| 563 | best_len等于prev_length |
| 570 | prev等于Actual size of window: 2*wSize, except when the user input buffer* is directly used as sliding window. |
| 571 | wmask等于w_size - 1 |
| 592 | 如果prev_length大于等于good_match则 |
| 593 | chain_length右移等于2位 |
| 598 | 如果nice_match大于umber of valid bytes ahead in window 则nice_match等于umber of valid bytes ahead in window |
| 602 | 循环 |
| 644 | 如果match[best_len]不等于scan_end或match[best_len - 1]不等于scan_end1或match不等于scan或*match先自加不等于scan[1]则继续下一循环 |
| 661 | 循环 |
| 689 | 如果best_len小于等于umber of valid bytes ahead in window 则返回:best_len |
| 名称 | 描述 |
|---|---|
| deflate_fast | |
| deflate_slow |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |