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:no_pairs
(Results
1 - 2
of
2
) sorted by relevance
/kernel/linux/linux-5.10/lib/
H
A
D
btree.c
51
int
no_pairs
;
member
57
.
no_pairs
= NODESIZE / sizeof(long) / 2,
65
.
no_pairs
= NODESIZE / sizeof(long) / (1 + LONG_PER_U64),
72
.
no_pairs
= NODESIZE / sizeof(long) / (1 + 2 * LONG_PER_U64),
251
for (i = 0; i < geo->
no_pairs
; i++)
in btree_lookup()
254
if (i == geo->
no_pairs
)
in btree_lookup()
264
for (i = 0; i < geo->
no_pairs
; i++)
in btree_lookup()
281
for (i = 0; i < geo->
no_pairs
; i++)
in btree_update()
284
if (i == geo->
no_pairs
)
in btree_update()
294
for (i = 0; i < geo->
no_pairs
;
in btree_update()
[all...]
/kernel/linux/linux-6.6/lib/
H
A
D
btree.c
51
int
no_pairs
;
member
57
.
no_pairs
= NODESIZE / sizeof(long) / 2,
65
.
no_pairs
= NODESIZE / sizeof(long) / (1 + LONG_PER_U64),
72
.
no_pairs
= NODESIZE / sizeof(long) / (1 + 2 * LONG_PER_U64),
251
for (i = 0; i < geo->
no_pairs
; i++)
in btree_lookup_node()
254
if (i == geo->
no_pairs
)
in btree_lookup_node()
273
for (i = 0; i < geo->
no_pairs
; i++)
in btree_lookup()
290
for (i = 0; i < geo->
no_pairs
; i++)
in btree_update()
325
for (i = 0; i < geo->
no_pairs
; i++)
in btree_get_prev()
328
if (i == geo->
no_pairs
)
in btree_get_prev()
[all...]
Completed in 3 milliseconds