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:NM_I
(Results
1 - 16
of
16
) sorted by relevance
/kernel/linux/linux-5.10/fs/f2fs/
H
A
D
debug.c
148
si->nats =
NM_I
(sbi)->nat_cnt[TOTAL_NAT];
in update_general_status()
149
si->dirty_nats =
NM_I
(sbi)->nat_cnt[DIRTY_NAT];
in update_general_status()
152
si->free_nids =
NM_I
(sbi)->nid_cnt[FREE_NID];
in update_general_status()
153
si->avail_nids =
NM_I
(sbi)->available_nids;
in update_general_status()
154
si->alloc_nids =
NM_I
(sbi)->nid_cnt[PREALLOC_NID];
in update_general_status()
255
si->base_mem += (
NM_I
(sbi)->nat_bits_blocks << F2FS_BLKSIZE_BITS);
in update_mem_info()
256
si->base_mem +=
NM_I
(sbi)->nat_blocks *
in update_mem_info()
258
si->base_mem +=
NM_I
(sbi)->nat_blocks / 8;
in update_mem_info()
259
si->base_mem +=
NM_I
(sbi)->nat_blocks * sizeof(unsigned short);
in update_mem_info()
278
si->cache_mem += (
NM_I
(sb
in update_mem_info()
[all...]
H
A
D
node.h
129
return
NM_I
(sbi)->nat_cnt[DIRTY_NAT] >=
NM_I
(sbi)->max_nid *
in excess_dirty_nats()
130
NM_I
(sbi)->dirty_nats_ratio / 100;
in excess_dirty_nats()
135
return
NM_I
(sbi)->nat_cnt[TOTAL_NAT] >= DEF_NAT_CACHE_THRESHOLD;
in excess_cached_nats()
168
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in next_free_nid()
186
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in get_nat_bitmap()
198
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in current_nat_addr()
222
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in next_nat_addr()
H
A
D
node.c
35
if (unlikely(nid < F2FS_ROOT_INO(sbi) || nid >=
NM_I
(sbi)->max_nid)) {
in f2fs_check_nid_range()
46
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in f2fs_available_free_memory()
122
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in get_next_nat_page()
358
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in f2fs_need_dentry_mark()
375
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in f2fs_is_checkpointed_node()
389
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in f2fs_need_inode_block_update()
407
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in cache_nat_entry()
431
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in set_node_addr()
488
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in f2fs_try_to_free_nats()
520
struct f2fs_nm_info *nm_i =
NM_I
(sb
in f2fs_get_node_info()
[all...]
H
A
D
shrinker.c
21
return
NM_I
(sbi)->nat_cnt[RECLAIMABLE_NAT];
in __count_nat_entries()
26
long count =
NM_I
(sbi)->nid_cnt[FREE_NID] - MAX_FREE_NIDS;
in __count_free_nids()
H
A
D
checkpoint.c
247
NAT_BLOCK_OFFSET(
NM_I
(sbi)->max_nid)))
in f2fs_ra_meta_pages()
1155
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in __prepare_cp_block()
1319
sbi->blocks_per_seg -
NM_I
(sbi)->nat_bits_blocks)
in update_ckpt_flags()
1415
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in do_checkpoint()
1627
if (
NM_I
(sbi)->nat_cnt[DIRTY_NAT] == 0 &&
in f2fs_write_checkpoint()
H
A
D
f2fs.h
1779
static inline struct f2fs_nm_info *
NM_I
(struct f2fs_sb_info *sbi)
in NM_I()
function
1909
nat_bits =
NM_I
(sbi)->nat_bits;
in disable_nat_bits()
1910
NM_I
(sbi)->nat_bits = NULL;
in disable_nat_bits()
3679
else if (blkaddr <
NM_I
(sbi)->nat_blkaddr) \
H
A
D
sysfs.c
64
return (unsigned char *)
NM_I
(sbi);
in __struct_ptr()
/kernel/linux/linux-6.6/fs/f2fs/
H
A
D
node.h
132
return
NM_I
(sbi)->nat_cnt[DIRTY_NAT] >=
NM_I
(sbi)->max_nid *
in excess_dirty_nats()
133
NM_I
(sbi)->dirty_nats_ratio / 100;
in excess_dirty_nats()
138
return
NM_I
(sbi)->nat_cnt[TOTAL_NAT] >= DEF_NAT_CACHE_THRESHOLD;
in excess_cached_nats()
168
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in next_free_nid()
186
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in get_nat_bitmap()
198
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in current_nat_addr()
222
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in next_nat_addr()
H
A
D
node.c
35
if (unlikely(nid < F2FS_ROOT_INO(sbi) || nid >=
NM_I
(sbi)->max_nid)) {
in f2fs_check_nid_range()
47
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in f2fs_available_free_memory()
145
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in get_next_nat_page()
382
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in f2fs_need_dentry_mark()
399
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in f2fs_is_checkpointed_node()
413
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in f2fs_need_inode_block_update()
431
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in cache_nat_entry()
459
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in set_node_addr()
517
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in f2fs_try_to_free_nats()
549
struct f2fs_nm_info *nm_i =
NM_I
(sb
in f2fs_get_node_info()
[all...]
H
A
D
debug.c
170
si->nats =
NM_I
(sbi)->nat_cnt[TOTAL_NAT];
in update_general_status()
171
si->dirty_nats =
NM_I
(sbi)->nat_cnt[DIRTY_NAT];
in update_general_status()
174
si->free_nids =
NM_I
(sbi)->nid_cnt[FREE_NID];
in update_general_status()
175
si->avail_nids =
NM_I
(sbi)->available_nids;
in update_general_status()
176
si->alloc_nids =
NM_I
(sbi)->nid_cnt[PREALLOC_NID];
in update_general_status()
279
si->base_mem += (
NM_I
(sbi)->nat_bits_blocks << F2FS_BLKSIZE_BITS);
in update_mem_info()
280
si->base_mem +=
NM_I
(sbi)->nat_blocks *
in update_mem_info()
282
si->base_mem +=
NM_I
(sbi)->nat_blocks / 8;
in update_mem_info()
283
si->base_mem +=
NM_I
(sbi)->nat_blocks * sizeof(unsigned short);
in update_mem_info()
302
si->cache_mem += (
NM_I
(sb
in update_mem_info()
[all...]
H
A
D
shrinker.c
21
return
NM_I
(sbi)->nat_cnt[RECLAIMABLE_NAT];
in __count_nat_entries()
26
long count =
NM_I
(sbi)->nid_cnt[FREE_NID] - MAX_FREE_NIDS;
in __count_free_nids()
H
A
D
checkpoint.c
265
NAT_BLOCK_OFFSET(
NM_I
(sbi)->max_nid)))
in f2fs_ra_meta_pages()
1165
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in __prepare_cp_block()
1327
NM_I
(sbi)->nat_bits_blocks > sbi->blocks_per_seg) {
in update_ckpt_flags()
1453
struct f2fs_nm_info *nm_i =
NM_I
(sbi);
in do_checkpoint()
1664
if (
NM_I
(sbi)->nat_cnt[DIRTY_NAT] == 0 &&
in f2fs_write_checkpoint()
H
A
D
recovery.c
59
if (
NM_I
(sbi)->max_rf_node_blocks &&
in f2fs_space_for_roll_forward()
61
NM_I
(sbi)->max_rf_node_blocks)
in f2fs_space_for_roll_forward()
H
A
D
sysfs.c
76
return (unsigned char *)
NM_I
(sbi);
in __struct_ptr()
H
A
D
f2fs.h
1973
static inline struct f2fs_nm_info *
NM_I
(struct f2fs_sb_info *sbi)
in NM_I()
function
4028
else if (blkaddr <
NM_I
(sbi)->nat_blkaddr) \
/kernel/linux/linux-6.6/include/linux/
H
A
D
f2fs_fs.h
38
#define F2FS_COMPRESS_INO(sbi) (
NM_I
(sbi)->max_nid)
Completed in 35 milliseconds