Searched refs:distances (Results 1 – 11 of 11) sorted by relevance
1860 int i, *distances; in find_numa_distance() local1866 distances = rcu_dereference(sched_numa_node_distance); in find_numa_distance()1867 if (!distances) in find_numa_distance()1870 if (distances[i] == distance) { in find_numa_distance()1972 int *distances; in sched_record_numa_dist() local2001 distances = kzalloc_objs(int, nr_levels); in sched_record_numa_dist()2002 if (!distances) in sched_record_numa_dist()2007 distances[i] = j; in sched_record_numa_dist()2009 *dist = distances; in sched_record_numa_dist()2020 int *distances, *domain_distances; in sched_init_numa() local[all …]
478 u32 slot_indices[SPX5_DSM_CAL_LEN], distances[SPX5_DSM_CAL_LEN]; in sparx5_dsm_calendar_check() local486 distances[idx] = SPX5_DSM_CAL_EMPTY; in sparx5_dsm_calendar_check()499 distances[idx] = (slot_indices[idx + 1] - in sparx5_dsm_calendar_check()506 cnt = distances[idx] - max_dist; in sparx5_dsm_calendar_check()513 cnt = cnt + distances[jdx] - max_dist; in sparx5_dsm_calendar_check()
7 The system locality information table provides "abstract distances" between
24 Form 0 associativity supports only two NUMA distances (LOCAL and REMOTE).103 Since domainID can be sparse, the matrix of distances can also be effectively sparse.
15 the same kind of memory is found at varied distances.
23 cells at multiple distances from other cells.35 can have cells at multiple remote distances from any given cell.
12 because it can be used effectively over long distances and in electrically
11 distances with data transfer rates significantly higher than those
53 For references to the dictionary, distances are relative to the output
99 significant NUMA distances, are likely to benefit from the
1104 distances between watermarks are 0.1% of the available memory in the