Lines Matching defs:node
796 * Given a node-distance table, for example:
798 * node 0 1 2 3
804 * which represents a 4 node ring topology like:
839 * - the only uncovered node is 2, who's child domain is 1-3.
859 * node 0 1 2 3
931 * XXX: This creates per-node group entries; since the load-balancer will
933 * statistics having the groups node local is of dubious benefit.
1027 * Asymmetric node setups can result in situations where the
1049 * node 0 1 2 3
1114 * Where the last one more or less denotes everything up to a NUMA node.
1635 * there is an intermediary node C, which is < N hops away from both
1658 /* Is there an intermediary node between a and b? */
1746 * Now for each level, construct a mask per node which contains all
1824 int node = cpu_to_node(cpu);
1829 if (node_distance(j, node) <= sched_domains_numa_distance[i]) {