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:max_nid
(Results
1 - 11
of
11
) sorted by relevance
/kernel/linux/linux-5.10/fs/f2fs/
H
A
D
node.c
35
if (unlikely(nid < F2FS_ROOT_INO(sbi) || nid >= NM_I(sbi)->
max_nid
)) {
in f2fs_check_nid_range()
2308
if (unlikely(start_nid >= nm_i->
max_nid
))
in scan_nat_page()
2388
if (unlikely(nid >= nm_i->
max_nid
))
in __f2fs_build_free_nids()
2435
if (unlikely(nid >= nm_i->
max_nid
))
in __f2fs_build_free_nids()
3104
nm_i->
max_nid
= NAT_ENTRY_PER_BLOCK * nm_i->nat_blocks;
in init_node_manager()
3107
nm_i->available_nids = nm_i->
max_nid
- sbi->total_valid_node_count -
in init_node_manager()
H
A
D
node.h
129
return NM_I(sbi)->nat_cnt[DIRTY_NAT] >= NM_I(sbi)->
max_nid
*
in excess_dirty_nats()
H
A
D
checkpoint.c
247
NAT_BLOCK_OFFSET(NM_I(sbi)->
max_nid
)))
in f2fs_ra_meta_pages()
H
A
D
f2fs.h
858
nid_t
max_nid
; /* maximum possible node ids */
member
/kernel/linux/linux-6.6/fs/f2fs/
H
A
D
node.c
35
if (unlikely(nid < F2FS_ROOT_INO(sbi) || nid >= NM_I(sbi)->
max_nid
)) {
in f2fs_check_nid_range()
2395
if (unlikely(start_nid >= nm_i->
max_nid
))
in scan_nat_page()
2475
if (unlikely(nid >= nm_i->
max_nid
))
in __f2fs_build_free_nids()
2529
if (unlikely(nid >= nm_i->
max_nid
))
in __f2fs_build_free_nids()
3242
nm_i->
max_nid
= NAT_ENTRY_PER_BLOCK * nm_i->nat_blocks;
in init_node_manager()
3245
nm_i->available_nids = nm_i->
max_nid
- sbi->total_valid_node_count -
in init_node_manager()
H
A
D
node.h
132
return NM_I(sbi)->nat_cnt[DIRTY_NAT] >= NM_I(sbi)->
max_nid
*
in excess_dirty_nats()
H
A
D
checkpoint.c
265
NAT_BLOCK_OFFSET(NM_I(sbi)->
max_nid
)))
in f2fs_ra_meta_pages()
H
A
D
f2fs.h
917
nid_t
max_nid
; /* maximum possible node ids */
member
/kernel/linux/linux-6.6/include/linux/
H
A
D
f2fs_fs.h
38
#define F2FS_COMPRESS_INO(sbi) (NM_I(sbi)->
max_nid
)
/kernel/linux/linux-6.6/kernel/sched/
H
A
D
fair.c
2877
int seq, nid,
max_nid
= NUMA_NO_NODE;
in task_numa_placement()
local
2962
max_nid
= nid;
in task_numa_placement()
2966
max_nid
= nid;
in task_numa_placement()
2971
if (
max_nid
!= NUMA_NO_NODE && !node_state(
max_nid
, N_CPU)) {
in task_numa_placement()
2972
int near_nid =
max_nid
;
in task_numa_placement()
2976
distance = node_distance(
max_nid
, nid);
in task_numa_placement()
2982
max_nid
= near_nid;
in task_numa_placement()
2988
max_nid
= preferred_group_nid(p,
max_nid
);
in task_numa_placement()
[all...]
/kernel/linux/linux-5.10/kernel/sched/
H
A
D
fair.c
2394
int seq, nid,
max_nid
= NUMA_NO_NODE;
in task_numa_placement()
local
2479
max_nid
= nid;
in task_numa_placement()
2483
max_nid
= nid;
in task_numa_placement()
2490
max_nid
= preferred_group_nid(p,
max_nid
);
in task_numa_placement()
2495
if (
max_nid
!= p->numa_preferred_nid)
in task_numa_placement()
2496
sched_setnuma(p,
max_nid
);
in task_numa_placement()
Completed in 60 milliseconds