Home
last modified time | relevance | path

Searched refs:NAT_ENTRY_PER_BLOCK (Results 1 – 7 of 7) sorted by relevance

/linux-6.15/fs/f2fs/
H A Dnode.h9 #define START_NID(nid) (((nid) / NAT_ENTRY_PER_BLOCK) * NAT_ENTRY_PER_BLOCK)
12 #define NAT_BLOCK_OFFSET(start_nid) ((start_nid) / NAT_ENTRY_PER_BLOCK)
16 #define MAX_FREE_NIDS (NAT_ENTRY_PER_BLOCK * FREE_NID_PAGES)
H A Dnode.c2434 i = start_nid % NAT_ENTRY_PER_BLOCK; in scan_nat_page()
2493 NAT_ENTRY_PER_BLOCK, idx); in scan_free_nid_bits()
2494 if (idx >= NAT_ENTRY_PER_BLOCK) in scan_free_nid_bits()
2497 nid = i * NAT_ENTRY_PER_BLOCK + idx; in scan_free_nid_bits()
2520 if (unlikely(nid % NAT_ENTRY_PER_BLOCK)) in __f2fs_build_free_nids()
2570 nid += (NAT_ENTRY_PER_BLOCK - (nid % NAT_ENTRY_PER_BLOCK)); in __f2fs_build_free_nids()
3000 for (; i < NAT_ENTRY_PER_BLOCK; i++) { in __update_nat_bits()
3011 if (valid == NAT_ENTRY_PER_BLOCK) in __update_nat_bits()
3022 nid_t start_nid = set->set * NAT_ENTRY_PER_BLOCK; in __flush_nat_entry_set()
3216 nid = i * NAT_ENTRY_PER_BLOCK; in load_free_nid_bitmap()
[all …]
H A Ddebug.c347 f2fs_bitmap_size(NAT_ENTRY_PER_BLOCK); in update_mem_info()
H A Dcheckpoint.c285 blkno * NAT_ENTRY_PER_BLOCK); in f2fs_ra_meta_pages()
H A Dsuper.c3884 NAT_ENTRY_PER_BLOCK)); in init_sb_info()
H A Dsegment.c496 f2fs_try_to_free_nats(sbi, NAT_ENTRY_PER_BLOCK); in f2fs_balance_fs_bg()
/linux-6.15/include/linux/
H A Df2fs_fs.h372 #define NAT_ENTRY_PER_BLOCK (F2FS_BLKSIZE / sizeof(struct f2fs_nat_entry)) macro
381 struct f2fs_nat_entry entries[NAT_ENTRY_PER_BLOCK];