Home
last modified time | relevance | path

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

/linux/drivers/acpi/numa/
H A Dsrat.c92 int __init fix_pxm_node_maps(int max_nid) in fix_pxm_node_maps() argument
111 for (j = 0; j <= max_nid; j++) { in fix_pxm_node_maps()
132 if (WARN(index != max_nid, "%d max nid when expected %d\n", in fix_pxm_node_maps()
133 index, max_nid)) in fix_pxm_node_maps()
141 for (j = 0; j <= max_nid; j++) in fix_pxm_node_maps()
145 if (j <= max_nid) in fix_pxm_node_maps()
/linux/fs/f2fs/
H A Dnode.h140 return NM_I(sbi)->nat_cnt[DIRTY_NAT] >= NM_I(sbi)->max_nid * in excess_dirty_nats()
H A Dnode.c32 return nid < F2FS_ROOT_INO(sbi) || nid >= NM_I(sbi)->max_nid; in is_invalid_nid()
2470 if (unlikely(start_nid >= nm_i->max_nid)) in scan_nat_page()
2550 if (unlikely(nid >= nm_i->max_nid)) in __f2fs_build_free_nids()
2605 if (unlikely(nid >= nm_i->max_nid)) in __f2fs_build_free_nids()
3294 nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nm_i->nat_blocks; in init_node_manager()
3297 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.h1035 nid_t max_nid; /* maximum possible node ids */ member
/linux/include/linux/
H A Df2fs_fs.h40 #define F2FS_COMPRESS_INO(sbi) (NM_I(sbi)->max_nid)
/linux/kernel/sched/
H A Dfair.c2864 int seq, nid, max_nid = NUMA_NO_NODE; in task_numa_placement() local
2949 max_nid = nid; in task_numa_placement()
2953 max_nid = nid; in task_numa_placement()
2958 max_nid = numa_nearest_node(max_nid, N_CPU); in task_numa_placement()
2963 max_nid = preferred_group_nid(p, max_nid); in task_numa_placement()
2968 if (max_nid != p->numa_preferred_nid) in task_numa_placement()
2969 sched_setnuma(p, max_nid); in task_numa_placement()