Home
last modified time | relevance | path

Searched refs:max_nid (Results 1 – 6 of 6) sorted by relevance

/linux/fs/f2fs/
H A Dnode.h132 return NM_I(sbi)->nat_cnt[DIRTY_NAT] >= NM_I(sbi)->max_nid * in excess_dirty_nats()
H A Dnode.c35 if (unlikely(nid < F2FS_ROOT_INO(sbi) || nid >= NM_I(sbi)->max_nid)) { in f2fs_check_nid_range()
2405 if (unlikely(start_nid >= nm_i->max_nid)) in scan_nat_page()
2485 if (unlikely(nid >= nm_i->max_nid)) in __f2fs_build_free_nids()
2539 if (unlikely(nid >= nm_i->max_nid)) in __f2fs_build_free_nids()
3252 nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nm_i->nat_blocks; in init_node_manager()
3255 nm_i->available_nids = nm_i->max_nid - sbi->total_valid_node_count - in init_node_manager()
H A Dcheckpoint.c281 NAT_BLOCK_OFFSET(NM_I(sbi)->max_nid))) in f2fs_ra_meta_pages()
H A Df2fs.h927 nid_t max_nid; /* maximum possible node ids */ member
/linux/include/linux/
H A Df2fs_fs.h38 #define F2FS_COMPRESS_INO(sbi) (NM_I(sbi)->max_nid)
/linux/kernel/sched/
H A Dfair.c2882 int seq, nid, max_nid = NUMA_NO_NODE; in task_numa_placement()
2967 max_nid = nid; in task_numa_group()
2971 max_nid = nid; in task_numa_group()
2976 max_nid = numa_nearest_node(max_nid, N_CPU); in task_numa_group()
2981 max_nid = preferred_group_nid(p, max_nid); in task_numa_group()
2986 if (max_nid != p->numa_preferred_nid) in task_numa_group()
2987 sched_setnuma(p, max_nid); in task_numa_group()
2801 int seq, nid, max_nid = NUMA_NO_NODE; task_numa_placement() local