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:HFS_NODE_LEAF
(Results
1 - 16
of
16
) sorted by relevance
/kernel/linux/linux-6.6/fs/hfs/
H
A
D
bnode.c
64
if (node->type ==
HFS_NODE_LEAF
||
in hfs_bnode_read_key()
169
} else if (i && node->type ==
HFS_NODE_LEAF
) {
in hfs_bnode_dump()
194
} else if (node->type ==
HFS_NODE_LEAF
)
in hfs_bnode_unlink()
205
} else if (node->type ==
HFS_NODE_LEAF
)
in hfs_bnode_unlink()
358
case
HFS_NODE_LEAF
:
in hfs_bnode_find()
383
node->type !=
HFS_NODE_LEAF
)
in hfs_bnode_find()
H
A
D
brec.c
35
if (node->type != HFS_NODE_INDEX && node->type !=
HFS_NODE_LEAF
)
in hfs_brec_keylen()
107
if (node->type ==
HFS_NODE_LEAF
) {
in hfs_brec_insert()
189
if (node->type ==
HFS_NODE_LEAF
) {
in hfs_brec_remove()
480
new_node->type =
HFS_NODE_LEAF
;
in hfs_btree_inc_height()
505
if (node->type ==
HFS_NODE_LEAF
||
in hfs_btree_inc_height()
H
A
D
btree.h
145
#define
HFS_NODE_LEAF
0xFF /* A leaf (ndNHeight==1) node */
macro
H
A
D
bfind.c
134
if (bnode->type != (--height ? HFS_NODE_INDEX :
HFS_NODE_LEAF
))
in hfs_brec_find()
/kernel/linux/linux-5.10/fs/hfs/
H
A
D
bnode.c
67
if (node->type ==
HFS_NODE_LEAF
||
in hfs_bnode_read_key()
176
} else if (i && node->type ==
HFS_NODE_LEAF
) {
in hfs_bnode_dump()
201
} else if (node->type ==
HFS_NODE_LEAF
)
in hfs_bnode_unlink()
212
} else if (node->type ==
HFS_NODE_LEAF
)
in hfs_bnode_unlink()
368
case
HFS_NODE_LEAF
:
in hfs_bnode_find()
393
node->type !=
HFS_NODE_LEAF
)
in hfs_bnode_find()
H
A
D
brec.c
35
if (node->type != HFS_NODE_INDEX && node->type !=
HFS_NODE_LEAF
)
in hfs_brec_keylen()
107
if (node->type ==
HFS_NODE_LEAF
) {
in hfs_brec_insert()
189
if (node->type ==
HFS_NODE_LEAF
) {
in hfs_brec_remove()
480
new_node->type =
HFS_NODE_LEAF
;
in hfs_btree_inc_height()
505
if (node->type ==
HFS_NODE_LEAF
||
in hfs_btree_inc_height()
H
A
D
btree.h
145
#define
HFS_NODE_LEAF
0xFF /* A leaf (ndNHeight==1) node */
macro
H
A
D
bfind.c
136
if (bnode->type != (--height ? HFS_NODE_INDEX :
HFS_NODE_LEAF
))
in hfs_brec_find()
/kernel/linux/linux-5.10/fs/hfsplus/
H
A
D
brec.c
36
if (node->type != HFS_NODE_INDEX && node->type !=
HFS_NODE_LEAF
)
in hfs_brec_keylen()
105
if (node->type ==
HFS_NODE_LEAF
) {
in hfs_brec_insert()
191
if (node->type ==
HFS_NODE_LEAF
) {
in hfs_brec_remove()
484
new_node->type =
HFS_NODE_LEAF
;
in hfs_btree_inc_height()
509
if (node->type ==
HFS_NODE_LEAF
||
in hfs_btree_inc_height()
H
A
D
bnode.c
65
if (node->type ==
HFS_NODE_LEAF
||
in hfs_bnode_read_key()
325
} else if (i && node->type ==
HFS_NODE_LEAF
) {
in hfs_bnode_dump()
351
} else if (node->type ==
HFS_NODE_LEAF
)
in hfs_bnode_unlink()
363
} else if (node->type ==
HFS_NODE_LEAF
)
in hfs_bnode_unlink()
520
case
HFS_NODE_LEAF
:
in hfs_bnode_find()
545
node->type !=
HFS_NODE_LEAF
)
in hfs_bnode_find()
H
A
D
bfind.c
191
if (bnode->type != (--height ? HFS_NODE_INDEX :
HFS_NODE_LEAF
))
in hfs_brec_find()
H
A
D
hfsplus_raw.h
164
#define
HFS_NODE_LEAF
0xFF /* A leaf (ndNHeight==1) node */
macro
/kernel/linux/linux-6.6/fs/hfsplus/
H
A
D
brec.c
36
if (node->type != HFS_NODE_INDEX && node->type !=
HFS_NODE_LEAF
)
in hfs_brec_keylen()
105
if (node->type ==
HFS_NODE_LEAF
) {
in hfs_brec_insert()
191
if (node->type ==
HFS_NODE_LEAF
) {
in hfs_brec_remove()
484
new_node->type =
HFS_NODE_LEAF
;
in hfs_btree_inc_height()
509
if (node->type ==
HFS_NODE_LEAF
||
in hfs_btree_inc_height()
H
A
D
bnode.c
63
if (node->type ==
HFS_NODE_LEAF
||
in hfs_bnode_read_key()
318
} else if (i && node->type ==
HFS_NODE_LEAF
) {
in hfs_bnode_dump()
344
} else if (node->type ==
HFS_NODE_LEAF
)
in hfs_bnode_unlink()
356
} else if (node->type ==
HFS_NODE_LEAF
)
in hfs_bnode_unlink()
509
case
HFS_NODE_LEAF
:
in hfs_bnode_find()
534
node->type !=
HFS_NODE_LEAF
)
in hfs_bnode_find()
H
A
D
hfsplus_raw.h
164
#define
HFS_NODE_LEAF
0xFF /* A leaf (ndNHeight==1) node */
macro
H
A
D
bfind.c
191
if (bnode->type != (--height ? HFS_NODE_INDEX :
HFS_NODE_LEAF
))
in hfs_brec_find()
Completed in 11 milliseconds