Home
last modified time | relevance | path

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

/openbmc/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()
2410 if (unlikely(start_nid >= nm_i->max_nid)) in scan_nat_page()
2490 if (unlikely(nid >= nm_i->max_nid)) in __f2fs_build_free_nids()
2544 if (unlikely(nid >= nm_i->max_nid)) in __f2fs_build_free_nids()
3257 nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nm_i->nat_blocks; in init_node_manager()
3260 nm_i->available_nids = nm_i->max_nid - sbi->total_valid_node_count - in init_node_manager()
H A Dcheckpoint.c265 NAT_BLOCK_OFFSET(NM_I(sbi)->max_nid))) in f2fs_ra_meta_pages()
H A Df2fs.h922 nid_t max_nid; /* maximum possible node ids */ member
/openbmc/linux/include/linux/
H A Df2fs_fs.h38 #define F2FS_COMPRESS_INO(sbi) (NM_I(sbi)->max_nid)
/openbmc/linux/kernel/sched/
H A Dfair.c2840 int seq, nid, max_nid = NUMA_NO_NODE; in task_numa_placement() local
2925 max_nid = nid; in task_numa_placement()
2929 max_nid = nid; in task_numa_placement()
2934 if (max_nid != NUMA_NO_NODE && !node_state(max_nid, N_CPU)) { in task_numa_placement()
2935 int near_nid = max_nid; in task_numa_placement()
2939 distance = node_distance(max_nid, nid); in task_numa_placement()
2945 max_nid = near_nid; in task_numa_placement()
2951 max_nid = preferred_group_nid(p, max_nid); in task_numa_placement()
2956 if (max_nid != p->numa_preferred_nid) in task_numa_placement()
2957 sched_setnuma(p, max_nid); in task_numa_placement()