Lines Matching refs:hops

1120  * about doing this is to build the domains on 'hops'. For each NUMA level we
1121  * construct the mask of all nodes reachable in @level hops.
2202  * - If for two nodes A and B, located N > 1 hops away from each other,
2203  *   there is an intermediary node C, which is < N hops away from both
2369 	 * CPUs of nodes that are that many hops away from us.
2630  * sched_numa_hop_mask() - Get the cpumask of CPUs at most @hops hops away from
2632  * @node: The node to count hops from.
2633  * @hops: Include CPUs up to that many hops away. 0 means local node.
2635  * Return: On success, a pointer to a cpumask of CPUs at most @hops away from
2641  * Note that not all hops are equal in distance; see sched_init_numa() for how
2646 const struct cpumask *sched_numa_hop_mask(unsigned int node, unsigned int hops)
2650 	if (node >= nr_node_ids || hops >= sched_domains_numa_levels)
2657 	return masks[hops][node];