Home
last modified time | relevance | path

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

/openbmc/linux/fs/f2fs/
H A Dnode.h352 if (ofs == 3 || ofs == 4 + NIDS_PER_BLOCK || in IS_DNODE()
353 ofs == 5 + 2 * NIDS_PER_BLOCK) in IS_DNODE()
355 if (ofs >= 6 + 2 * NIDS_PER_BLOCK) { in IS_DNODE()
356 ofs -= 6 + 2 * NIDS_PER_BLOCK; in IS_DNODE()
357 if (!((long int)ofs % (NIDS_PER_BLOCK + 1))) in IS_DNODE()
H A Dnode.c636 end = min(end, NIDS_PER_BLOCK); in f2fs_ra_node_pages()
649 const long indirect_blks = ADDRS_PER_BLOCK(dn->inode) * NIDS_PER_BLOCK; in f2fs_get_next_page_offset()
659 skipped_unit *= NIDS_PER_BLOCK; in f2fs_get_next_page_offset()
687 const long dptrs_per_blk = NIDS_PER_BLOCK; in get_node_path()
688 const long indirect_blks = ADDRS_PER_BLOCK(inode) * NIDS_PER_BLOCK; in get_node_path()
689 const long dindirect_blks = indirect_blks * NIDS_PER_BLOCK; in get_node_path()
994 return NIDS_PER_BLOCK + 1; in truncate_nodes()
1004 f2fs_ra_node_pages(page, ofs, NIDS_PER_BLOCK); in truncate_nodes()
1008 for (i = ofs; i < NIDS_PER_BLOCK; i++, freed++) { in truncate_nodes()
1020 child_nofs = nofs + ofs * (NIDS_PER_BLOCK + 1) + 1; in truncate_nodes()
[all …]
H A Dgc.c1085 unsigned int indirect_blks = 2 * NIDS_PER_BLOCK + 4; in f2fs_start_bidx_of_node()
1094 int dec = (node_ofs - 4) / (NIDS_PER_BLOCK + 1); in f2fs_start_bidx_of_node()
1098 int dec = (node_ofs - indirect_blks - 3) / (NIDS_PER_BLOCK + 1); in f2fs_start_bidx_of_node()
H A Dsuper.c3308 leaf_count *= NIDS_PER_BLOCK; in max_file_blocks()
3312 leaf_count *= NIDS_PER_BLOCK; in max_file_blocks()
/openbmc/linux/include/linux/
H A Df2fs_fs.h250 #define NIDS_PER_BLOCK 1018 /* Node IDs in an Indirect Block */ macro
330 __le32 nid[NIDS_PER_BLOCK]; /* array of data block address */