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:LEAF_NODE
(Results
1 - 14
of
14
) sorted by relevance
/kernel/linux/linux-5.10/drivers/md/persistent-data/
H
A
D
dm-btree-remove.c
494
if (le32_to_cpu(n->header.flags) &
LEAF_NODE
)
in remove_raw()
502
if (le32_to_cpu(n->header.flags) &
LEAF_NODE
)
in remove_raw()
587
if (le32_to_cpu(n->header.flags) &
LEAF_NODE
) {
in remove_nearest()
597
if (le32_to_cpu(n->header.flags) &
LEAF_NODE
) {
in remove_nearest()
H
A
D
dm-btree-internal.h
21
LEAF_NODE
= 1 << 1
enumerator
H
A
D
dm-btree.c
145
n->header.flags = cpu_to_le32(
LEAF_NODE
);
in dm_btree_empty()
368
} while (!(flags &
LEAF_NODE
));
in btree_lookup_raw()
738
if (le32_to_cpu(node->header.flags) &
LEAF_NODE
)
in btree_insert_raw()
1020
return le32_to_cpu(bn->header.flags) &
LEAF_NODE
;
in leaf_node()
1085
if (le32_to_cpu(bn->header.flags) &
LEAF_NODE
)
in find_leaf()
H
A
D
dm-btree-spine.c
79
if (!(flags & INTERNAL_NODE) && !(flags &
LEAF_NODE
)) {
in node_check()
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H
A
D
dm-btree-internal.h
22
LEAF_NODE
= 1 << 1
enumerator
H
A
D
dm-btree-remove.c
570
if (le32_to_cpu(n->header.flags) &
LEAF_NODE
)
in remove_raw()
578
if (le32_to_cpu(n->header.flags) &
LEAF_NODE
)
in remove_raw()
664
if (le32_to_cpu(n->header.flags) &
LEAF_NODE
) {
in remove_nearest()
674
if (le32_to_cpu(n->header.flags) &
LEAF_NODE
) {
in remove_nearest()
H
A
D
dm-btree.c
146
n->header.flags = cpu_to_le32(
LEAF_NODE
);
in dm_btree_empty()
365
} while (!(flags &
LEAF_NODE
));
in btree_lookup_raw()
1081
if (le32_to_cpu(node->header.flags) &
LEAF_NODE
) {
in has_space_for_insert()
1136
if (le32_to_cpu(node->header.flags) &
LEAF_NODE
)
in btree_insert_raw()
1189
if (le32_to_cpu(node->header.flags) &
LEAF_NODE
) {
in __btree_get_overwrite_leaf()
1489
return le32_to_cpu(bn->header.flags) &
LEAF_NODE
;
in leaf_node()
1554
if (le32_to_cpu(bn->header.flags) &
LEAF_NODE
)
in find_leaf()
H
A
D
dm-btree-spine.c
76
if (!(flags & INTERNAL_NODE) && !(flags &
LEAF_NODE
)) {
in node_check()
/kernel/linux/linux-5.10/fs/ntfs/
H
A
D
index.c
402
if ((ia->index.flags & NODE_MASK) ==
LEAF_NODE
) {
in ntfs_index_lookup()
H
A
D
dir.c
535
if ((ia->index.flags & NODE_MASK) ==
LEAF_NODE
) {
in ntfs_lookup_inode_by_name()
945
if ((ia->index.flags & NODE_MASK) ==
LEAF_NODE
) {
H
A
D
layout.h
1950
LEAF_NODE
= 0, /* This is a leaf node, i.e. there are no more nodes
enumerator
/kernel/linux/linux-6.6/fs/ntfs/
H
A
D
index.c
402
if ((ia->index.flags & NODE_MASK) ==
LEAF_NODE
) {
in ntfs_index_lookup()
H
A
D
dir.c
535
if ((ia->index.flags & NODE_MASK) ==
LEAF_NODE
) {
in ntfs_lookup_inode_by_name()
945
if ((ia->index.flags & NODE_MASK) ==
LEAF_NODE
) {
H
A
D
layout.h
1950
LEAF_NODE
= 0, /* This is a leaf node, i.e. there are no more nodes
enumerator
Completed in 21 milliseconds