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:n_free_nodes
(Results
1 - 10
of
10
) sorted by relevance
/kernel/linux/linux-5.10/fs/hpfs/
H
A
D
anode.c
124
if (!btree->
n_free_nodes
) {
in hpfs_add_sector_to_btree()
136
anode->btree.
n_free_nodes
= 40 - anode->btree.n_used_nodes;
in hpfs_add_sector_to_btree()
139
btree->
n_free_nodes
= 11;
in hpfs_add_sector_to_btree()
156
btree->
n_free_nodes
--; n = btree->n_used_nodes++;
in hpfs_add_sector_to_btree()
176
if (btree->
n_free_nodes
) {
in hpfs_add_sector_to_btree()
177
btree->
n_free_nodes
--; n = btree->n_used_nodes++;
in hpfs_add_sector_to_btree()
207
anode->btree.
n_free_nodes
= 59;
in hpfs_add_sector_to_btree()
244
ranode->btree.
n_free_nodes
= (bp_internal(&ranode->btree) ? 60 : 40) - ranode->btree.n_used_nodes;
in hpfs_add_sector_to_btree()
255
btree->
n_free_nodes
= fnod ? 10 : 58;
in hpfs_add_sector_to_btree()
418
btree->
n_free_nodes
in hpfs_truncate_btree()
[all...]
H
A
D
map.c
180
if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.
n_free_nodes
!=
in hpfs_map_fnode()
235
if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.
n_free_nodes
!=
in hpfs_map_anode()
H
A
D
alloc.c
466
f->btree.
n_free_nodes
= 8;
in hpfs_alloc_fnode()
483
a->btree.
n_free_nodes
= 40;
in hpfs_alloc_anode()
H
A
D
hpfs.h
406
u8
n_free_nodes
; /* free nodes in following array */
member
H
A
D
namei.c
86
fnode->btree.
n_free_nodes
= 7;
in hpfs_mkdir()
/kernel/linux/linux-6.6/fs/hpfs/
H
A
D
anode.c
124
if (!btree->
n_free_nodes
) {
in hpfs_add_sector_to_btree()
136
anode->btree.
n_free_nodes
= 40 - anode->btree.n_used_nodes;
in hpfs_add_sector_to_btree()
139
btree->
n_free_nodes
= 11;
in hpfs_add_sector_to_btree()
156
btree->
n_free_nodes
--; n = btree->n_used_nodes++;
in hpfs_add_sector_to_btree()
176
if (btree->
n_free_nodes
) {
in hpfs_add_sector_to_btree()
177
btree->
n_free_nodes
--; n = btree->n_used_nodes++;
in hpfs_add_sector_to_btree()
207
anode->btree.
n_free_nodes
= 59;
in hpfs_add_sector_to_btree()
244
ranode->btree.
n_free_nodes
= (bp_internal(&ranode->btree) ? 60 : 40) - ranode->btree.n_used_nodes;
in hpfs_add_sector_to_btree()
255
btree->
n_free_nodes
= fnod ? 10 : 58;
in hpfs_add_sector_to_btree()
418
btree->
n_free_nodes
in hpfs_truncate_btree()
[all...]
H
A
D
map.c
180
if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.
n_free_nodes
!=
in hpfs_map_fnode()
235
if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.
n_free_nodes
!=
in hpfs_map_anode()
H
A
D
alloc.c
466
f->btree.
n_free_nodes
= 8;
in hpfs_alloc_fnode()
483
a->btree.
n_free_nodes
= 40;
in hpfs_alloc_anode()
H
A
D
hpfs.h
407
u8
n_free_nodes
; /* free nodes in following array */
member
H
A
D
namei.c
84
fnode->btree.
n_free_nodes
= 7;
in hpfs_mkdir()
Completed in 11 milliseconds