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:smallerPtr
(Results
1 - 4
of
4
) sorted by relevance
/kernel/linux/linux-6.6/lib/zstd/compress/
H
A
D
zstd_opt.c
434
U32*
smallerPtr
= bt + 2*(curr&btMask);
in ZSTD_insertBt1()
local
435
U32* largerPtr =
smallerPtr
+ 1;
in ZSTD_insertBt1()
467
*
smallerPtr
= matchIndex;
in ZSTD_insertBt1()
468
if (matchIndex <= btLow) {
smallerPtr
=&dummy32; break; } /* beyond tree size, stop the search */
in ZSTD_insertBt1()
469
smallerPtr
= nextPtr+1; /* new "smaller" => larger of match */
in ZSTD_insertBt1()
507
*
smallerPtr
= matchIndex; /* update smaller idx */
in ZSTD_insertBt1()
509
if (matchIndex <= btLow) {
smallerPtr
=&dummy32; break; } /* beyond tree size, stop searching */
in ZSTD_insertBt1()
510
smallerPtr
= nextPtr+1; /* new "candidate" => larger than match, which was smaller than target */
in ZSTD_insertBt1()
521
*
smallerPtr
= *largerPtr = 0;
in ZSTD_insertBt1()
586
U32*
smallerPtr
in ZSTD_insertBtAndGetAllMatches()
local
[all...]
H
A
D
zstd_lazy.c
82
U32*
smallerPtr
= bt + 2*(curr&btMask);
in ZSTD_insertDUBT1()
local
83
U32* largerPtr =
smallerPtr
+ 1;
in ZSTD_insertDUBT1()
84
U32 matchIndex = *
smallerPtr
; /* this candidate is unsorted : next sorted candidate is reached through *
smallerPtr
, while *largerPtr contains previous unsorted candidate (which is already saved and can be overwritten) */
in ZSTD_insertDUBT1()
130
*
smallerPtr
= matchIndex; /* update smaller idx */
in ZSTD_insertDUBT1()
132
if (matchIndex <= btLow) {
smallerPtr
=&dummy32; break; } /* beyond tree size, stop searching */
in ZSTD_insertDUBT1()
135
smallerPtr
= nextPtr+1; /* new "candidate" => larger than match, which was smaller than target */
in ZSTD_insertDUBT1()
148
*
smallerPtr
= *largerPtr = 0;
in ZSTD_insertDUBT1()
303
U32*
smallerPtr
= bt + 2*(curr&btMask);
in ZSTD_DUBT_findBestMatch()
local
344
*
smallerPtr
in ZSTD_DUBT_findBestMatch()
[all...]
/kernel/linux/linux-5.10/lib/zstd/
H
A
D
zstd_opt.h
254
U32 *
smallerPtr
= bt + 2 * (curr & btMask);
in ZSTD_insertBtAndGetAllMatches()
local
327
*
smallerPtr
= matchIndex; /* update smaller idx */
in ZSTD_insertBtAndGetAllMatches()
330
smallerPtr
= &dummy32;
in ZSTD_insertBtAndGetAllMatches()
333
smallerPtr
= nextPtr + 1; /* new "smaller" => larger of match */
in ZSTD_insertBtAndGetAllMatches()
348
*
smallerPtr
= *largerPtr = 0;
in ZSTD_insertBtAndGetAllMatches()
H
A
D
compress.c
1579
U32 *
smallerPtr
= bt + 2 * (curr & btMask);
in ZSTD_insertBt1()
local
1580
U32 *largerPtr =
smallerPtr
+ 1;
in ZSTD_insertBt1()
1614
*
smallerPtr
= matchIndex; /* update smaller idx */
in ZSTD_insertBt1()
1617
smallerPtr
= &dummy32;
in ZSTD_insertBt1()
1620
smallerPtr
= nextPtr + 1; /* new "smaller" => larger of match */
in ZSTD_insertBt1()
1635
*
smallerPtr
= *largerPtr = 0;
in ZSTD_insertBt1()
1662
U32 *
smallerPtr
= bt + 2 * (curr & btMask);
in ZSTD_insertBtAndFindBestMatch()
local
1697
*
smallerPtr
= matchIndex; /* update smaller idx */
in ZSTD_insertBtAndFindBestMatch()
1700
smallerPtr
= &dummy32;
in ZSTD_insertBtAndFindBestMatch()
1703
smallerPtr
in ZSTD_insertBtAndFindBestMatch()
[all...]
Completed in 13 milliseconds