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:b_end
(Results
1 - 3
of
3
) sorted by relevance
/kernel/linux/linux-5.10/lib/
H
A
D
xxhash.c
105
const uint8_t *
b_end
= p + len;
in xxh32()
local
109
const uint8_t *const limit =
b_end
- 16;
in xxh32()
134
while (p + 4 <=
b_end
) {
in xxh32()
140
while (p <
b_end
) {
in xxh32()
175
const uint8_t *const
b_end
= p + len;
in xxh64()
local
179
const uint8_t *const limit =
b_end
- 32;
in xxh64()
209
while (p + 8 <=
b_end
) {
in xxh64()
217
if (p + 4 <=
b_end
) {
in xxh64()
223
while (p <
b_end
) {
in xxh64()
273
const uint8_t *const
b_end
in xxh32_update()
local
342
const uint8_t *const
b_end
= (const uint8_t *)(state->mem32) +
xxh32_digest()
local
380
const uint8_t *const
b_end
= p + len;
xxh64_update()
local
447
const uint8_t *const
b_end
= (const uint8_t *)state->mem64 +
xxh64_digest()
local
[all...]
/kernel/linux/linux-6.6/lib/
H
A
D
xxhash.c
105
const uint8_t *
b_end
= p + len;
in xxh32()
local
109
const uint8_t *const limit =
b_end
- 16;
in xxh32()
134
while (p + 4 <=
b_end
) {
in xxh32()
140
while (p <
b_end
) {
in xxh32()
175
const uint8_t *const
b_end
= p + len;
in xxh64()
local
179
const uint8_t *const limit =
b_end
- 32;
in xxh64()
209
while (p + 8 <=
b_end
) {
in xxh64()
217
if (p + 4 <=
b_end
) {
in xxh64()
223
while (p <
b_end
) {
in xxh64()
273
const uint8_t *const
b_end
in xxh32_update()
local
342
const uint8_t *const
b_end
= (const uint8_t *)(state->mem32) +
xxh32_digest()
local
380
const uint8_t *const
b_end
= p + len;
xxh64_update()
local
447
const uint8_t *const
b_end
= (const uint8_t *)state->mem64 +
xxh64_digest()
local
[all...]
H
A
D
maple_tree.c
130
unsigned char
b_end
;
member
1801
* old data or set b_node->
b_end
.
1808
unsigned long size = b_node->
b_end
* sizeof(unsigned long);
in mab_shift_right()
1828
unsigned char size = b_node->
b_end
;
in mab_middle_node()
1856
(b_node->
b_end
- split) > (mt_min_slots[b_node->type]))
in mab_no_null_split()
1875
unsigned char
b_end
= bn->
b_end
;
in mab_calc_split()
local
1876
int split =
b_end
/ 2; /* Assume equal split. */
in mab_calc_split()
1887
split =
b_end
- mt_min_slots[bn->type];
in mab_calc_split()
1907
split =
b_end
/
in mab_calc_split()
2105
unsigned char
b_end
;
mas_store_b_node()
local
2267
unsigned char
b_end
= mast->bn->
b_end
;
mast_rebalance_next()
local
2282
unsigned char
b_end
= mast->bn->
b_end
;
mast_rebalance_prev()
local
2997
unsigned char shift,
b_end
= ++b_node->
b_end
;
mas_rebalance()
local
3472
unsigned char
b_end
= b_node->
b_end
;
mas_commit_b_node()
local
[all...]
Completed in 7 milliseconds