Lines Matching defs:distance
796 * Given a node-distance table, for example:
1602 bool find_numa_distance(int distance)
1606 if (distance == node_distance(0, 0)) {
1611 if (sched_domains_numa_distance[i] == distance) {
1632 * - If the maximum distance between any nodes is 1 hop, the system
1694 int distance = node_distance(i, j);
1695 if (distance < LOCAL_DISTANCE || distance >= NR_DISTANCE_VALUES) {
1696 sched_numa_warn("Invalid distance value range");
1700 bitmap_set(distance_map, distance, 1);
1704 * We can now figure out how many unique distance values there are and
1725 * The sched_domains_numa_distance[] array includes the actual distance
1768 sched_numa_warn("Node-distance not symmetric");
1798 * Add the NUMA identity distance, aka single NODE.