Home
last modified time | relevance | path

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

/linux-4.1.27/fs/f2fs/
Dnode.h307 if (ofs == 3 || ofs == 4 + NIDS_PER_BLOCK || in IS_DNODE()
308 ofs == 5 + 2 * NIDS_PER_BLOCK) in IS_DNODE()
310 if (ofs >= 6 + 2 * NIDS_PER_BLOCK) { in IS_DNODE()
311 ofs -= 6 + 2 * NIDS_PER_BLOCK; in IS_DNODE()
312 if (!((long int)ofs % (NIDS_PER_BLOCK + 1))) in IS_DNODE()
Dnode.c405 const long dptrs_per_blk = NIDS_PER_BLOCK; in get_node_path()
406 const long indirect_blks = ADDRS_PER_BLOCK * NIDS_PER_BLOCK; in get_node_path()
407 const long dindirect_blks = indirect_blks * NIDS_PER_BLOCK; in get_node_path()
651 return NIDS_PER_BLOCK + 1; in truncate_nodes()
663 for (i = ofs; i < NIDS_PER_BLOCK; i++, freed++) { in truncate_nodes()
674 child_nofs = nofs + ofs * (NIDS_PER_BLOCK + 1) + 1; in truncate_nodes()
675 for (i = ofs; i < NIDS_PER_BLOCK; i++) { in truncate_nodes()
678 child_nofs += NIDS_PER_BLOCK + 1; in truncate_nodes()
683 if (ret == (NIDS_PER_BLOCK + 1)) { in truncate_nodes()
737 for (i = offset[idx + 1]; i < NIDS_PER_BLOCK; i++) { in truncate_partial_nodes()
[all …]
Dgc.c472 unsigned int indirect_blks = 2 * NIDS_PER_BLOCK + 4; in start_bidx_of_node()
481 int dec = (node_ofs - 4) / (NIDS_PER_BLOCK + 1); in start_bidx_of_node()
484 int dec = (node_ofs - indirect_blks - 3) / (NIDS_PER_BLOCK + 1); in start_bidx_of_node()
Dsuper.c811 leaf_count *= NIDS_PER_BLOCK; in max_file_size()
815 leaf_count *= NIDS_PER_BLOCK; in max_file_size()
/linux-4.1.27/include/linux/
Df2fs_fs.h166 #define NIDS_PER_BLOCK 1018 /* Node IDs in an Indirect Block */ macro
223 __le32 nid[NIDS_PER_BLOCK]; /* array of data block address */