Home
last modified time | relevance | path

Searched refs:NIDS_PER_BLOCK (Results 1 – 5 of 5) sorted by relevance

/linux-6.15/fs/f2fs/
H A Dnode.h359 if (ofs == 3 || ofs == 4 + NIDS_PER_BLOCK || in IS_DNODE()
360 ofs == 5 + 2 * NIDS_PER_BLOCK) in IS_DNODE()
362 if (ofs >= 6 + 2 * NIDS_PER_BLOCK) { in IS_DNODE()
363 ofs -= 6 + 2 * NIDS_PER_BLOCK; in IS_DNODE()
364 if (!((long int)ofs % (NIDS_PER_BLOCK + 1))) in IS_DNODE()
H A Dnode.c637 end = min(end, (int)NIDS_PER_BLOCK); in f2fs_ra_node_pages()
660 skipped_unit *= NIDS_PER_BLOCK; in f2fs_get_next_page_offset()
688 const long dptrs_per_blk = NIDS_PER_BLOCK; in get_node_path()
995 return NIDS_PER_BLOCK + 1; in truncate_nodes()
1005 f2fs_ra_node_pages(page, ofs, NIDS_PER_BLOCK); in truncate_nodes()
1009 for (i = ofs; i < NIDS_PER_BLOCK; i++, freed++) { in truncate_nodes()
1022 for (i = ofs; i < NIDS_PER_BLOCK; i++) { in truncate_nodes()
1025 child_nofs += NIDS_PER_BLOCK + 1; in truncate_nodes()
1030 if (ret == (NIDS_PER_BLOCK + 1)) { in truncate_nodes()
1172 nofs += 1 + NIDS_PER_BLOCK; in f2fs_truncate_inode_blocks()
[all …]
H A Dgc.c1114 unsigned int indirect_blks = 2 * NIDS_PER_BLOCK + 4; in f2fs_start_bidx_of_node()
1123 int dec = (node_ofs - 4) / (NIDS_PER_BLOCK + 1); in f2fs_start_bidx_of_node()
1127 int dec = (node_ofs - indirect_blks - 3) / (NIDS_PER_BLOCK + 1); in f2fs_start_bidx_of_node()
H A Dsuper.c3396 leaf_count *= NIDS_PER_BLOCK; in max_file_blocks()
3400 leaf_count *= NIDS_PER_BLOCK; in max_file_blocks()
/linux-6.15/include/linux/
H A Df2fs_fs.h268 #define NIDS_PER_BLOCK ((F2FS_BLKSIZE - sizeof(struct node_footer)) / sizeof(__le32)) macro
347 __le32 nid[NIDS_PER_BLOCK]; /* array of data block address */