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:pnode_cnt
(Results
1 - 10
of
10
) sorted by relevance
/kernel/linux/linux-5.10/fs/ubifs/
H
A
D
find.c
162
if (c->pnodes_have >= c->
pnode_cnt
)
in scan_for_dirty()
442
if (c->pnodes_have >= c->
pnode_cnt
)
in do_find_free_space()
842
if (c->pnodes_have >= c->
pnode_cnt
)
in find_dirty_idx_leb()
H
A
D
lpt.c
61
c->
pnode_cnt
= DIV_ROUND_UP(c->main_lebs, UBIFS_LPT_FANOUT);
in do_calc_lpt_geom()
63
n = DIV_ROUND_UP(c->
pnode_cnt
, UBIFS_LPT_FANOUT);
in do_calc_lpt_geom()
99
c->lpt_sz = (long long)c->
pnode_cnt
* c->pnode_sz;
in do_calc_lpt_geom()
652
cnt = c->
pnode_cnt
;
in ubifs_create_dflt_lpt()
H
A
D
lpt_commit.c
1759
if (c->dirty_pn_cnt > c->
pnode_cnt
) {
in dbg_chk_lpt_sz()
1761
c->dirty_pn_cnt, c->
pnode_cnt
);
in dbg_chk_lpt_sz()
1802
lpt_sz = (long long)c->
pnode_cnt
* c->pnode_sz;
in dbg_chk_lpt_sz()
H
A
D
ubifs.h
1183
* @
pnode_cnt
: number of pnodes
1428
int
pnode_cnt
;
member
H
A
D
debug.c
806
pr_err("\tpnode_cnt: %d\n", c->
pnode_cnt
);
in ubifs_dump_lpt_info()
/kernel/linux/linux-6.6/fs/ubifs/
H
A
D
find.c
162
if (c->pnodes_have >= c->
pnode_cnt
)
in scan_for_dirty()
442
if (c->pnodes_have >= c->
pnode_cnt
)
in do_find_free_space()
842
if (c->pnodes_have >= c->
pnode_cnt
)
in find_dirty_idx_leb()
H
A
D
lpt.c
61
c->
pnode_cnt
= DIV_ROUND_UP(c->main_lebs, UBIFS_LPT_FANOUT);
in do_calc_lpt_geom()
63
n = DIV_ROUND_UP(c->
pnode_cnt
, UBIFS_LPT_FANOUT);
in do_calc_lpt_geom()
99
c->lpt_sz = (long long)c->
pnode_cnt
* c->pnode_sz;
in do_calc_lpt_geom()
652
cnt = c->
pnode_cnt
;
in ubifs_create_dflt_lpt()
H
A
D
lpt_commit.c
1759
if (c->dirty_pn_cnt > c->
pnode_cnt
) {
in dbg_chk_lpt_sz()
1761
c->dirty_pn_cnt, c->
pnode_cnt
);
in dbg_chk_lpt_sz()
1802
lpt_sz = (long long)c->
pnode_cnt
* c->pnode_sz;
in dbg_chk_lpt_sz()
H
A
D
ubifs.h
1204
* @
pnode_cnt
: number of pnodes
1456
int
pnode_cnt
;
member
H
A
D
debug.c
806
pr_err("\tpnode_cnt: %d\n", c->
pnode_cnt
);
in ubifs_dump_lpt_info()
Completed in 27 milliseconds