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:nbAttempts
(Results
1 - 4
of
4
) sorted by relevance
/kernel/linux/linux-5.10/lib/lz4/
H
A
D
lz4hc_compress.c
115
int
nbAttempts
= maxNbAttempts;
in LZ4HC_InsertAndFindBestMatch()
local
123
&& (
nbAttempts
)) {
in LZ4HC_InsertAndFindBestMatch()
124
nbAttempts
--;
in LZ4HC_InsertAndFindBestMatch()
188
int
nbAttempts
= maxNbAttempts;
in LZ4HC_InsertAndGetWiderMatch()
local
196
&& (
nbAttempts
)) {
in LZ4HC_InsertAndGetWiderMatch()
197
nbAttempts
--;
in LZ4HC_InsertAndGetWiderMatch()
/kernel/linux/linux-6.6/lib/lz4/
H
A
D
lz4hc_compress.c
115
int
nbAttempts
= maxNbAttempts;
in LZ4HC_InsertAndFindBestMatch()
local
123
&& (
nbAttempts
)) {
in LZ4HC_InsertAndFindBestMatch()
124
nbAttempts
--;
in LZ4HC_InsertAndFindBestMatch()
188
int
nbAttempts
= maxNbAttempts;
in LZ4HC_InsertAndGetWiderMatch()
local
196
&& (
nbAttempts
)) {
in LZ4HC_InsertAndGetWiderMatch()
197
nbAttempts
--;
in LZ4HC_InsertAndGetWiderMatch()
/kernel/linux/linux-6.6/lib/zstd/compress/
H
A
D
zstd_lazy.c
516
size_t ZSTD_dedicatedDictSearch_lazy_search(size_t* offsetPtr, size_t ml, U32
nbAttempts
,
in ZSTD_dedicatedDictSearch_lazy_search()
argument
527
const U32 bucketLimit =
nbAttempts
< bucketSize - 1 ?
nbAttempts
: bucketSize - 1;
in ZSTD_dedicatedDictSearch_lazy_search()
576
U32 const chainAttempts =
nbAttempts
- ddsAttempt;
in ZSTD_dedicatedDictSearch_lazy_search()
670
U32
nbAttempts
= 1U << cParams->searchLog;
in ZSTD_HcFindBestMatch()
local
689
for ( ; (matchIndex>=lowLimit) & (
nbAttempts
>0) ;
nbAttempts
--) {
in ZSTD_HcFindBestMatch()
714
assert(
nbAttempts
<= (1U << ZSTD_SEARCHLOG_MAX)); /* Check we haven't underflowed. */
in ZSTD_HcFindBestMatch()
716
ml = ZSTD_dedicatedDictSearch_lazy_search(offsetPtr, ml,
nbAttempts
, dms,
in ZSTD_HcFindBestMatch()
731
for ( ; (matchIndex>=dmsLowestIndex) & (
nbAttempts
>
in ZSTD_HcFindBestMatch()
1146
U32
nbAttempts
= 1U << cappedSearchLog;
ZSTD_RowFindBestMatch()
local
[all...]
/kernel/linux/linux-5.10/lib/zstd/
H
A
D
compress.c
1834
int
nbAttempts
= maxNbAttempts;
in ZSTD_HcFindBestMatch_generic()
local
1840
for (; (matchIndex > lowLimit) & (
nbAttempts
> 0);
nbAttempts
--) {
in ZSTD_HcFindBestMatch_generic()
Completed in 15 milliseconds