fs/f2fs/checkpoint.c

482

blkno * NAT_ENTRY_PER_BLOCK);

fs/f2fs/debug.c

348

f2fs_bitmap_size(NAT_ENTRY_PER_BLOCK);

fs/f2fs/node.c

2520

i = start_nid % NAT_ENTRY_PER_BLOCK;

fs/f2fs/node.c

2522

for (; i < NAT_ENTRY_PER_BLOCK; i++, start_nid++) {

fs/f2fs/node.c

2577

for (idx = 0; idx < NAT_ENTRY_PER_BLOCK; idx++) {

fs/f2fs/node.c

2579

NAT_ENTRY_PER_BLOCK, idx);

fs/f2fs/node.c

2580

if (idx >= NAT_ENTRY_PER_BLOCK)

fs/f2fs/node.c

2583

nid = i * NAT_ENTRY_PER_BLOCK + idx;

fs/f2fs/node.c

2606

if (unlikely(nid % NAT_ENTRY_PER_BLOCK))

fs/f2fs/node.c

2607

nid = NAT_BLOCK_OFFSET(nid) * NAT_ENTRY_PER_BLOCK;

fs/f2fs/node.c

2610

if (nm_i->nid_cnt[FREE_NID] >= NAT_ENTRY_PER_BLOCK)

fs/f2fs/node.c

2620

if (nm_i->nid_cnt[FREE_NID] >= NAT_ENTRY_PER_BLOCK)

fs/f2fs/node.c

2657

nid += (NAT_ENTRY_PER_BLOCK - (nid % NAT_ENTRY_PER_BLOCK));

fs/f2fs/node.c

3091

unsigned int nat_index = start_nid / NAT_ENTRY_PER_BLOCK;

fs/f2fs/node.c

3102

for (; i < NAT_ENTRY_PER_BLOCK; i++) {

fs/f2fs/node.c

3113

if (valid == NAT_ENTRY_PER_BLOCK)

fs/f2fs/node.c

3124

nid_t start_nid = set->set * NAT_ENTRY_PER_BLOCK;

fs/f2fs/node.c

3330

nid = i * NAT_ENTRY_PER_BLOCK;

fs/f2fs/node.c

3331

last_nid = nid + NAT_ENTRY_PER_BLOCK;

fs/f2fs/node.c

3361

nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nm_i->nat_blocks;

fs/f2fs/node.c

3423

f2fs_bitmap_size(NAT_ENTRY_PER_BLOCK), GFP_KERNEL);

fs/f2fs/node.h

12

#define NAT_BLOCK_OFFSET(start_nid) ((start_nid) / NAT_ENTRY_PER_BLOCK)

fs/f2fs/node.h

16

#define MAX_FREE_NIDS (NAT_ENTRY_PER_BLOCK * FREE_NID_PAGES)

fs/f2fs/node.h

9

#define START_NID(nid) (((nid) / NAT_ENTRY_PER_BLOCK) * NAT_ENTRY_PER_BLOCK)

fs/f2fs/segment.c

516

f2fs_try_to_free_nats(sbi, NAT_ENTRY_PER_BLOCK);

fs/f2fs/super.c

4355

NAT_ENTRY_PER_BLOCK));

include/linux/f2fs_fs.h

387

struct f2fs_nat_entry entries[NAT_ENTRY_PER_BLOCK];