Function report |
Source Code:lib\zstd\compress.c |
Create Date:2022-07-28 07:03:21 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
home page | Tree |
Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:ZSTD_count
Proto:static size_t ZSTD_count(const BYTE *pIn, const BYTE *pMatch, const BYTE *const pInLimit)
Type:size_t
Parameter:
Type | Parameter | Name |
---|---|---|
const BYTE * | pIn | |
const BYTE * | pMatch | |
const BYTE *const | pInLimit |
910 | pInLoopLimit = pInLimit - sizeof(size_t) - 1 |
912 | When pIn < pInLoopLimit cycle |
913 | diff = ZSTD_readST(pMatch) ^ ZSTD_readST(pIn) |
914 | If Not diff Then |
922 | If ZSTD_64bits() Then If pIn < pInLimit - 3 && ZSTD_read32(pMatch) == ZSTD_read32(pIn) Then |
927 | If pIn < pInLimit - 1 && ZSTD_read16(pMatch) == ZSTD_read16(pIn) Then |
Name | Describe |
---|---|
ZSTD_count_2segments | ZSTD_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 |
Source code conversion tool public plug-in interface | X |
---|---|
Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion |