函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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
注解内核,赢得工具下载SCCTEnglish

函数名称：ZSTD_count

函数原型：static size_t ZSTD_count(const BYTE *pIn, const BYTE *pMatch, const BYTE *const pInLimit)

返回类型：size_t

参数：

类型参数名称
const BYTE *pIn
const BYTE *pMatch
const BYTE *constpInLimit
909  pStart等于pIn
910  pInLoopLimit等于pInLimit减sizeof(size_t)减1
912  当pIn小于pInLoopLimit循环
913  diff等于ZSTD_readST(pMatch)按位异或ZSTD_readST(pIn)
914  如果非diff则
915  pIn加等于sizeof(size_t)
916  pMatch加等于sizeof(size_t)
917  继续下一循环
919  pIn加等于-************************************** Match length counter
920  返回:pIn减pStart
922  如果ZSTD_64bits()则如果pIn小于pInLimit减3且ZSTD_read32(pMatch)恒等于ZSTD_read32(pIn)则
924  pIn加等于4
925  pMatch加等于4
927  如果pIn小于pInLimit减1且ZSTD_read16(pMatch)恒等于ZSTD_read16(pIn)则
928  pIn加等于2
929  pMatch加等于2
931  如果pIn小于pInLimit且pMatch恒等于pIn则pIn自加
933  返回:pIn减pStart
调用者
名称描述
ZSTD_count_2segmentsZSTD_count_2segments() :* can count match length with `ip` & `match` in 2 different segments.* convention : on reaching mEnd, match count continue starting from iStart
ZSTD_compressBlock_fast_generic
ZSTD_compressBlock_doubleFast_generic
ZSTD_insertBt1 : nb of positions added
ZSTD_insertBtAndFindBestMatch
ZSTD_HcFindBestMatch_generic
ZSTD_compressBlock_lazy_generic
ZSTD_insertBtAndGetAllMatches-************************************** Binary Tree search
ZSTD_compressBlock_opt_generic