Lines Matching defs:nid
138 * Lookup the closest node by distance if @nid is not in state.
437 * Check if the folio's nid is in qp->nmask.
439 * If MPOL_MF_INVERT is set in qp->flags, check if the nid is
445 int nid = folio_nid(folio);
448 return node_isset(nid, *qp->nmask) == !(flags & MPOL_MF_INVERT);
1079 .nid = dest,
1976 int nid;
1990 nid = first_node(nodemask);
1992 nid = next_node(nid, nodemask);
1993 return nid;
2027 * Returns a nid suitable for a huge page allocation and a pointer
2037 int nid;
2045 nid = interleave_nid(*mpol, vma, addr,
2048 nid = policy_node(gfp_flags, *mpol, numa_node_id());
2052 return nid;
2132 unsigned nid)
2136 page = __alloc_pages(gfp, order, nid, NULL);
2140 if (page && page_to_nid(page) == nid) {
2149 int nid, struct mempolicy *pol)
2162 page = __alloc_pages(preferred_gfp, order, nid, &pol->nodes);
2164 page = __alloc_pages(gfp, order, nid, NULL);
2197 unsigned nid;
2199 nid = interleave_nid(pol, vma, addr, PAGE_SHIFT + order);
2202 page = alloc_page_interleave(gfp, order, nid);
2357 static unsigned long alloc_pages_bulk_array_preferred_many(gfp_t gfp, int nid,
2367 nr_allocated = __alloc_pages_bulk(preferred_gfp, nid, &pol->nodes,
2925 int nid, prefer = 0;
2935 for_each_node(nid) {
2936 preferred_node_policy[nid] = (struct mempolicy) {
2940 .nodes = nodemask_of_node(nid),
2950 for_each_node_state(nid, N_MEMORY) {
2951 unsigned long total_pages = node_present_pages(nid);
2956 prefer = nid;
2961 node_set(nid, interleave_nodes);