Home
Sort by
last modified time
|
relevance
|
path
Repository(s)
applications
arkcompiler
base
build
commonlibrary
developtools
device
docs
domains
drivers
foundation
ide
interface
kernel
napi_generator
productdefine
test
third_party
vendor
select all
invert selection
clear
Full Search
Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition
Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol
Only finds symbol(e.g. methods classes,function,variables).
File Path
Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History
History log comments.
Type
Any
Bzip(2)
C
Clojure
C#
C++
ELF
Erlang
Image file
Fortran
Golang
GZIP
Haskell
Jar
Java
Java class
JavaScript
Lisp
Lua
Pascal
Perl
PHP
Plain Text
PL/SQL
Python
Rust
Scala
Shell script
SQL
Tar
Tcl
Troff
UUEncoded
Visual Basic
XML
Zip
Type of analyzer used to filter file types include with selected(e.g. just C sources).
Help
Searched
refs:btMask
(Results
1 - 4
of
4
) sorted by relevance
/kernel/linux/linux-6.6/lib/zstd/compress/
H
A
D
zstd_lazy.c
30
U32 const
btMask
= (1 << btLog) - 1;
in ZSTD_updateDUBT()
local
47
U32* const nextCandidatePtr = bt + 2*(idx&
btMask
);
in ZSTD_updateDUBT()
72
U32 const
btMask
= (1 << btLog) - 1;
in ZSTD_insertDUBT1()
local
82
U32* smallerPtr = bt + 2*(curr&
btMask
);
in ZSTD_insertDUBT1()
97
U32* const nextPtr = bt + 2*(matchIndex &
btMask
);
in ZSTD_insertDUBT1()
180
U32 const
btMask
= (1 << btLog) - 1;
in ZSTD_DUBT_findBetterDictMatch()
local
181
U32 const btLow = (
btMask
>= dictHighLimit - dictLowLimit) ? dictLowLimit : dictHighLimit -
btMask
;
in ZSTD_DUBT_findBetterDictMatch()
189
U32* const nextPtr = dictBt + 2*(dictMatchIndex &
btMask
);
in ZSTD_DUBT_findBetterDictMatch()
249
U32 const
btMask
in ZSTD_DUBT_findBestMatch()
local
[all...]
H
A
D
zstd_opt.c
423
U32 const
btMask
= (1 << btLog) - 1;
in ZSTD_insertBt1()
local
433
const U32 btLow =
btMask
>= curr ? 0 : curr -
btMask
;
in ZSTD_insertBt1()
434
U32* smallerPtr = bt + 2*(curr&
btMask
);
in ZSTD_insertBt1()
445
U32 predictedSmall = *(bt + 2*((curr-1)&
btMask
) + 0);
in ZSTD_insertBt1()
446
U32 predictedLarge = *(bt + 2*((curr-1)&
btMask
) + 1);
in ZSTD_insertBt1()
459
U32* const nextPtr = bt + 2*(matchIndex &
btMask
);
in ZSTD_insertBt1()
464
const U32* predictPtr = bt + 2*((matchIndex-1) &
btMask
); /* written this way, as bt is a roll buffer */
in ZSTD_insertBt1()
577
U32 const
btMask
= (1U << btLog) - 1;
in ZSTD_insertBtAndGetAllMatches()
local
583
U32 const btLow = (
btMask
>
in ZSTD_insertBtAndGetAllMatches()
[all...]
/kernel/linux/linux-5.10/lib/zstd/
H
A
D
zstd_opt.h
246
const U32
btMask
= (1U << btLog) - 1;
in ZSTD_insertBtAndGetAllMatches()
local
252
const U32 btLow =
btMask
>= curr ? 0 : curr -
btMask
;
in ZSTD_insertBtAndGetAllMatches()
254
U32 *smallerPtr = bt + 2 * (curr &
btMask
);
in ZSTD_insertBtAndGetAllMatches()
255
U32 *largerPtr = bt + 2 * (curr &
btMask
) + 1;
in ZSTD_insertBtAndGetAllMatches()
296
U32 *nextPtr = bt + 2 * (matchIndex &
btMask
);
in ZSTD_insertBtAndGetAllMatches()
H
A
D
compress.c
1568
U32 const
btMask
= (1 << btLog) - 1;
in ZSTD_insertBt1()
local
1578
const U32 btLow =
btMask
>= curr ? 0 : curr -
btMask
;
in ZSTD_insertBt1()
1579
U32 *smallerPtr = bt + 2 * (curr &
btMask
);
in ZSTD_insertBt1()
1589
U32 *const nextPtr = bt + 2 * (matchIndex &
btMask
);
in ZSTD_insertBt1()
1651
U32 const
btMask
= (1 << btLog) - 1;
in ZSTD_insertBtAndFindBestMatch()
local
1660
const U32 btLow =
btMask
>= curr ? 0 : curr -
btMask
;
in ZSTD_insertBtAndFindBestMatch()
1662
U32 *smallerPtr = bt + 2 * (curr &
btMask
);
in ZSTD_insertBtAndFindBestMatch()
1663
U32 *largerPtr = bt + 2 * (curr &
btMask
)
in ZSTD_insertBtAndFindBestMatch()
[all...]
Completed in 13 milliseconds