NIDS_PER_BLOCK
unsigned int indirect_blks = 2 * NIDS_PER_BLOCK + 4;
int dec = (node_ofs - 4) / (NIDS_PER_BLOCK + 1);
int dec = (node_ofs - indirect_blks - 3) / (NIDS_PER_BLOCK + 1);
return NIDS_PER_BLOCK + 1;
f2fs_ra_node_pages(folio, ofs, NIDS_PER_BLOCK);
for (i = ofs; i < NIDS_PER_BLOCK; i++, freed++) {
child_nofs = nofs + ofs * (NIDS_PER_BLOCK + 1) + 1;
for (i = ofs; i < NIDS_PER_BLOCK; i++) {
child_nofs += NIDS_PER_BLOCK + 1;
if (ret == (NIDS_PER_BLOCK + 1)) {
f2fs_ra_node_pages(folios[idx], offset[idx + 1], NIDS_PER_BLOCK);
for (i = offset[idx + 1]; i < NIDS_PER_BLOCK; i++) {
nofs += 1 + NIDS_PER_BLOCK;
nofs = 5 + 2 * NIDS_PER_BLOCK;
end = min(end, (int)NIDS_PER_BLOCK);
const long indirect_blks = ADDRS_PER_BLOCK(dn->inode) * NIDS_PER_BLOCK;
skipped_unit *= NIDS_PER_BLOCK;
const long dptrs_per_blk = NIDS_PER_BLOCK;
const long indirect_blks = ADDRS_PER_BLOCK(inode) * NIDS_PER_BLOCK;
const long dindirect_blks = indirect_blks * NIDS_PER_BLOCK;
if (ofs == 3 || ofs == 4 + NIDS_PER_BLOCK ||
ofs == 5 + 2 * NIDS_PER_BLOCK)
if (ofs >= 6 + 2 * NIDS_PER_BLOCK) {
ofs -= 6 + 2 * NIDS_PER_BLOCK;
if (!((long int)ofs % (NIDS_PER_BLOCK + 1)))
leaf_count *= NIDS_PER_BLOCK;
leaf_count *= NIDS_PER_BLOCK;
__le32 nid[NIDS_PER_BLOCK]; /* array of data block address */