函数逻辑报告 |
Source Code:lib\zstd\compress.c |
Create Date:2022-07-27 08:00:57 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:ZSTD_count_2segments() :* can count match length with `ip` & `match` in 2 different segments.* convention : on reaching mEnd, match count continue starting from iStart
函数原型:static size_t ZSTD_count_2segments(const BYTE *ip, const BYTE *match, const BYTE *iEnd, const BYTE *mEnd, const BYTE *iStart)
返回类型:size_t
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| const BYTE * | ip | |
| const BYTE * | match | |
| const BYTE * | iEnd | |
| const BYTE * | mEnd | |
| const BYTE * | iStart |
| 943 | matchLength等于ZSTD_count(ip, match, vEnd) |
| 944 | 如果match加matchLength不等于mEnd则返回:matchLength |
| 946 | 返回:matchLength加ZSTD_count(ip + matchLength, iStart, iEnd) |
| 名称 | 描述 |
|---|---|
| ZSTD_compressBlock_fast_extDict_generic | |
| ZSTD_compressBlock_doubleFast_extDict_generic | |
| ZSTD_insertBt1 | : nb of positions added |
| ZSTD_insertBtAndFindBestMatch | |
| ZSTD_HcFindBestMatch_generic | |
| ZSTD_compressBlock_lazy_extDict_generic | |
| ZSTD_insertBtAndGetAllMatches | -************************************** Binary Tree search |
| ZSTD_compressBlock_opt_extDict_generic |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |