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:matchIndex
(Results
1 - 10
of
10
) sorted by relevance
/kernel/linux/linux-6.6/lib/zstd/compress/
H
A
D
zstd_lazy.c
45
U32 const
matchIndex
= hashTable[h];
in ZSTD_updateDUBT()
local
52
*nextCandidatePtr =
matchIndex
; /* update BT like a chain */
in ZSTD_updateDUBT()
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()
local
96
for (; nbCompares && (
matchIndex
> windowLow); --nbCompares) {
in ZSTD_insertDUBT1()
97
U32* const nextPtr = bt + 2*(
matchIndex
& btMask);
in ZSTD_insertDUBT1()
99
assert(
matchIndex
< curr);
in ZSTD_insertDUBT1()
105
|| (
matchIndex
+matchLength >= dictLimit) /* both in current segment*/
in ZSTD_insertDUBT1()
108
|| (
matchIndex
+matchLength >= dictLimit)) ?
in ZSTD_insertDUBT1()
110
assert( (
matchIndex
+matchLength >= dictLimit) /* might be wrong if extDict is incorrectly set to 0 */
in ZSTD_insertDUBT1()
112
match = mBase +
matchIndex
;
in ZSTD_insertDUBT1()
197
U32
matchIndex
= dictMatchIndex + dictIndexDelta;
ZSTD_DUBT_findBetterDictMatch()
local
241
U32
matchIndex
= hashTable[h];
ZSTD_DUBT_findBestMatch()
local
529
U32
matchIndex
;
ZSTD_dedicatedDictSearch_lazy_search()
local
679
U32
matchIndex
;
ZSTD_HcFindBestMatch()
local
1197
U32 const
matchIndex
= row[matchPos];
ZSTD_RowFindBestMatch()
local
1219
U32 const
matchIndex
= matchBuffer[currMatch];
ZSTD_RowFindBestMatch()
local
1265
U32 const
matchIndex
= dmsRow[matchPos];
ZSTD_RowFindBestMatch()
local
1274
U32 const
matchIndex
= matchBuffer[currMatch];
ZSTD_RowFindBestMatch()
local
1663
U32 const
matchIndex
= (U32)((size_t)(start-base) - STORED_OFFSET(offcode));
ZSTD_compressBlock_lazy_generic()
local
2005
U32 const
matchIndex
= (U32)((size_t)(start-base) - STORED_OFFSET(offcode));
ZSTD_compressBlock_lazy_extDict_generic()
local
[all...]
H
A
D
zstd_opt.c
424
U32
matchIndex
= hashTable[h];
in ZSTD_insertBt1()
local
458
for (; nbCompares && (
matchIndex
>= windowLow); --nbCompares) {
in ZSTD_insertBt1()
459
U32* const nextPtr = bt + 2*(
matchIndex
& btMask);
in ZSTD_insertBt1()
461
assert(
matchIndex
< curr);
in ZSTD_insertBt1()
464
const U32* predictPtr = bt + 2*((
matchIndex
-1) & btMask); /* written this way, as bt is a roll buffer */
in ZSTD_insertBt1()
465
if (
matchIndex
== predictedSmall) {
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()
470
matchIndex
= nextPtr[1]; /* new
matchIndex
large
in ZSTD_insertBt1()
574
U32
matchIndex
= hashTable[h];
ZSTD_insertBtAndGetAllMatches()
local
[all...]
H
A
D
zstd_fast.c
429
U32 const
matchIndex
= hashTable[h];
in ZSTD_compressBlock_fast_dictMatchState_generic()
local
430
const BYTE* match = base +
matchIndex
;
in ZSTD_compressBlock_fast_dictMatchState_generic()
443
} else if ( (
matchIndex
<= prefixStartIndex) ) {
in ZSTD_compressBlock_fast_dictMatchState_generic()
585
const U32
matchIndex
= hashTable[h];
in ZSTD_compressBlock_fast_extDict_generic()
local
586
const BYTE* const matchBase =
matchIndex
< prefixStartIndex ? dictBase : base;
in ZSTD_compressBlock_fast_extDict_generic()
587
const BYTE* match = matchBase +
matchIndex
;
in ZSTD_compressBlock_fast_extDict_generic()
605
if ( (
matchIndex
< dictStartIndex) ||
in ZSTD_compressBlock_fast_extDict_generic()
611
{ const BYTE* const matchEnd =
matchIndex
< prefixStartIndex ? dictEnd : iend;
in ZSTD_compressBlock_fast_extDict_generic()
612
const BYTE* const lowMatchPtr =
matchIndex
< prefixStartIndex ? dictStart : prefixStart;
in ZSTD_compressBlock_fast_extDict_generic()
613
U32 const offset = curr -
matchIndex
;
in ZSTD_compressBlock_fast_extDict_generic()
[all...]
H
A
D
zstd_double_fast.c
566
const U32
matchIndex
= hashSmall[hSmall];
in ZSTD_compressBlock_doubleFast_extDict_generic()
local
567
const BYTE* const matchBase =
matchIndex
< prefixStartIndex ? dictBase : base;
in ZSTD_compressBlock_doubleFast_extDict_generic()
568
const BYTE* match = matchBase +
matchIndex
;
in ZSTD_compressBlock_doubleFast_extDict_generic()
601
} else if ((
matchIndex
> dictStartIndex) && (MEM_read32(match) == MEM_read32(ip))) {
in ZSTD_compressBlock_doubleFast_extDict_generic()
616
const BYTE* const matchEnd =
matchIndex
< prefixStartIndex ? dictEnd : iend;
in ZSTD_compressBlock_doubleFast_extDict_generic()
617
const BYTE* const lowMatchPtr =
matchIndex
< prefixStartIndex ? dictStart : prefixStart;
in ZSTD_compressBlock_doubleFast_extDict_generic()
619
offset = curr -
matchIndex
;
in ZSTD_compressBlock_doubleFast_extDict_generic()
/kernel/linux/linux-5.10/lib/lz4/
H
A
D
lz4hc_compress.c
114
U32
matchIndex
;
in LZ4HC_InsertAndFindBestMatch()
local
120
matchIndex
= HashTable[LZ4HC_hashPtr(ip)];
in LZ4HC_InsertAndFindBestMatch()
122
while ((
matchIndex
>= lowLimit)
in LZ4HC_InsertAndFindBestMatch()
125
if (
matchIndex
>= dictLimit) {
in LZ4HC_InsertAndFindBestMatch()
126
const BYTE * const match = base +
matchIndex
;
in LZ4HC_InsertAndFindBestMatch()
139
const BYTE * const match = dictBase +
matchIndex
;
in LZ4HC_InsertAndFindBestMatch()
144
+ (dictLimit -
matchIndex
);
in LZ4HC_InsertAndFindBestMatch()
158
*matchpos = base +
matchIndex
;
in LZ4HC_InsertAndFindBestMatch()
162
matchIndex
-= DELTANEXTU16(
matchIndex
);
in LZ4HC_InsertAndFindBestMatch()
187
U32
matchIndex
;
LZ4HC_InsertAndGetWiderMatch()
local
[all...]
/kernel/linux/linux-6.6/lib/lz4/
H
A
D
lz4hc_compress.c
114
U32
matchIndex
;
in LZ4HC_InsertAndFindBestMatch()
local
120
matchIndex
= HashTable[LZ4HC_hashPtr(ip)];
in LZ4HC_InsertAndFindBestMatch()
122
while ((
matchIndex
>= lowLimit)
in LZ4HC_InsertAndFindBestMatch()
125
if (
matchIndex
>= dictLimit) {
in LZ4HC_InsertAndFindBestMatch()
126
const BYTE * const match = base +
matchIndex
;
in LZ4HC_InsertAndFindBestMatch()
139
const BYTE * const match = dictBase +
matchIndex
;
in LZ4HC_InsertAndFindBestMatch()
144
+ (dictLimit -
matchIndex
);
in LZ4HC_InsertAndFindBestMatch()
158
*matchpos = base +
matchIndex
;
in LZ4HC_InsertAndFindBestMatch()
162
matchIndex
-= DELTANEXTU16(
matchIndex
);
in LZ4HC_InsertAndFindBestMatch()
187
U32
matchIndex
;
LZ4HC_InsertAndGetWiderMatch()
local
[all...]
/kernel/linux/linux-5.10/drivers/net/wireless/ath/ath9k/
H
A
D
eeprom.c
279
int
matchIndex
= -1, lowIndex = -1;
in ath9k_hw_get_legacy_target_powers()
local
287
matchIndex
= 0;
in ath9k_hw_get_legacy_target_powers()
293
matchIndex
= i;
in ath9k_hw_get_legacy_target_powers()
303
if ((
matchIndex
== -1) && (lowIndex == -1))
in ath9k_hw_get_legacy_target_powers()
304
matchIndex
= i - 1;
in ath9k_hw_get_legacy_target_powers()
307
if (
matchIndex
!= -1) {
in ath9k_hw_get_legacy_target_powers()
308
*pNewPower = powInfo[
matchIndex
];
in ath9k_hw_get_legacy_target_powers()
334
int
matchIndex
= -1, lowIndex = -1;
in ath9k_hw_get_target_powers()
local
341
matchIndex
= 0;
in ath9k_hw_get_target_powers()
347
matchIndex
in ath9k_hw_get_target_powers()
[all...]
/kernel/linux/linux-6.6/drivers/net/wireless/ath/ath9k/
H
A
D
eeprom.c
289
int
matchIndex
= -1, lowIndex = -1;
in ath9k_hw_get_legacy_target_powers()
local
297
matchIndex
= 0;
in ath9k_hw_get_legacy_target_powers()
303
matchIndex
= i;
in ath9k_hw_get_legacy_target_powers()
313
if ((
matchIndex
== -1) && (lowIndex == -1))
in ath9k_hw_get_legacy_target_powers()
314
matchIndex
= i - 1;
in ath9k_hw_get_legacy_target_powers()
317
if (
matchIndex
!= -1) {
in ath9k_hw_get_legacy_target_powers()
318
*pNewPower = powInfo[
matchIndex
];
in ath9k_hw_get_legacy_target_powers()
344
int
matchIndex
= -1, lowIndex = -1;
in ath9k_hw_get_target_powers()
local
351
matchIndex
= 0;
in ath9k_hw_get_target_powers()
357
matchIndex
in ath9k_hw_get_target_powers()
[all...]
/kernel/linux/linux-5.10/lib/zstd/
H
A
D
compress.c
1039
U32 const
matchIndex
= hashTable[h];
in ZSTD_compressBlock_fast_generic()
local
1040
const BYTE *match = base +
matchIndex
;
in ZSTD_compressBlock_fast_generic()
1049
if ((
matchIndex
<= lowestIndex) || (ZSTD_read32(match) != ZSTD_read32(ip))) {
in ZSTD_compressBlock_fast_generic()
1138
const U32
matchIndex
= hashTable[h];
in ZSTD_compressBlock_fast_extDict_generic()
local
1139
const BYTE *matchBase =
matchIndex
< dictLimit ? dictBase : base;
in ZSTD_compressBlock_fast_extDict_generic()
1140
const BYTE *match = matchBase +
matchIndex
;
in ZSTD_compressBlock_fast_extDict_generic()
1155
if ((
matchIndex
< lowestIndex) || (ZSTD_read32(match) != ZSTD_read32(ip))) {
in ZSTD_compressBlock_fast_extDict_generic()
1160
const BYTE *matchEnd =
matchIndex
< dictLimit ? dictEnd : iend;
in ZSTD_compressBlock_fast_extDict_generic()
1161
const BYTE *lowMatchPtr =
matchIndex
< dictLimit ? dictStart : lowPrefixPtr;
in ZSTD_compressBlock_fast_extDict_generic()
1169
offset = curr -
matchIndex
;
in ZSTD_compressBlock_fast_extDict_generic()
1419
const U32
matchIndex
= hashSmall[hSmall];
ZSTD_compressBlock_doubleFast_extDict_generic()
local
1569
U32
matchIndex
= hashTable[h];
ZSTD_insertBt1()
local
1652
U32
matchIndex
= hashTable[h];
ZSTD_insertBtAndFindBestMatch()
local
1838
U32
matchIndex
= ZSTD_insertAndFindFirstIndex(zc, ip, mls);
ZSTD_HcFindBestMatch_generic()
local
2198
U32 const
matchIndex
= (U32)((start - base) - (offset - ZSTD_REP_MOVE));
ZSTD_compressBlock_lazy_extDict_generic()
local
[all...]
H
A
D
zstd_opt.h
243
U32
matchIndex
= hashTable[h];
in ZSTD_insertBtAndGetAllMatches()
local
295
while (nbCompares-- && (
matchIndex
> windowLow)) {
in ZSTD_insertBtAndGetAllMatches()
296
U32 *nextPtr = bt + 2 * (
matchIndex
& btMask);
in ZSTD_insertBtAndGetAllMatches()
300
if ((!extDict) || (
matchIndex
+ matchLength >= dictLimit)) {
in ZSTD_insertBtAndGetAllMatches()
301
match = base +
matchIndex
;
in ZSTD_insertBtAndGetAllMatches()
306
match = dictBase +
matchIndex
;
in ZSTD_insertBtAndGetAllMatches()
308
if (
matchIndex
+ matchLength >= dictLimit)
in ZSTD_insertBtAndGetAllMatches()
309
match = base +
matchIndex
; /* to prepare for next usage of match[matchLength] */
in ZSTD_insertBtAndGetAllMatches()
313
if (matchLength > matchEndIdx -
matchIndex
)
in ZSTD_insertBtAndGetAllMatches()
314
matchEndIdx =
matchIndex
in ZSTD_insertBtAndGetAllMatches()
[all...]
Completed in 24 milliseconds