Home
last modified time | relevance | path

Searched refs:distances (Results 1 – 17 of 17) sorted by relevance

/openbmc/qemu/docs/specs/
H A Dppc-spapr-numa.rst63 other. Subsequent boundaries represents greater distances and degraded
137 How the pseries Linux guest calculates NUMA distances
141 how the distances are expressed. The SLIT table provides the NUMA distance
152 kernel tree). This results in the following distances:
178 around for such a long time, with users seeing NUMA distances 10 and 40
184 `How the pseries Linux guest calculates NUMA distances`_. The result
273 Honoring just the relative distances of node 0 to every other node, we find the
298 The distances related to node 0 are accounted for. For node 1, and keeping
383 In short, we can summarize the NUMA distances seem in pseries Linux guests, using
390 The way the pseries Linux guest calculates NUMA distances has a direct effect
H A Dfsi.rst9 distances of up to 4 meters. FSI interfaces have been used successfully for
/openbmc/linux/drivers/net/ethernet/microchip/sparx5/
H A Dsparx5_calendar.c482 u32 slot_indices[SPX5_DSM_CAL_LEN], distances[SPX5_DSM_CAL_LEN]; in sparx5_dsm_calendar_check() local
490 distances[idx] = SPX5_DSM_CAL_EMPTY; in sparx5_dsm_calendar_check()
503 distances[idx] = (slot_indices[idx + 1] - in sparx5_dsm_calendar_check()
510 cnt = distances[idx] - max_dist; in sparx5_dsm_calendar_check()
517 cnt = cnt + distances[jdx] - max_dist; in sparx5_dsm_calendar_check()
/openbmc/linux/kernel/sched/
H A Dtopology.c1737 int i, *distances; in find_numa_distance() local
1743 distances = rcu_dereference(sched_domains_numa_distance); in find_numa_distance()
1744 if (!distances) in find_numa_distance()
1747 if (distances[i] == distance) { in find_numa_distance()
1828 int *distances; in sched_init_numa() local
1833 * unique distances in the node_distance() table. in sched_init_numa()
1859 distances = kcalloc(nr_levels, sizeof(int), GFP_KERNEL); in sched_init_numa()
1860 if (!distances) { in sched_init_numa()
1867 distances[i] = j; in sched_init_numa()
1869 rcu_assign_pointer(sched_domains_numa_distance, distances); in sched_init_numa()
1974 int nr_levels, *distances; sched_reset_numa() local
[all...]
/openbmc/linux/Documentation/ABI/testing/
H A Dsysfs-kernel-mm-numa15 the same kind of memory is found at varied distances.
/openbmc/linux/Documentation/powerpc/
H A Dassociativity.rst24 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.
/openbmc/linux/Documentation/devicetree/bindings/
H A Dnuma.txt45 This property defines a matrix to describe the relative distances
51 The distances are equal in either direction.
/openbmc/linux/Documentation/mm/
H A Dnuma.rst23 cells at multiple distances from other cells.
35 can have cells at multiple remote distances from any given cell.
/openbmc/linux/Documentation/driver-api/serial/
H A Dserial-rs485.rst12 because it can be used effectively over long distances and in electrically
/openbmc/linux/drivers/net/wan/
H A DKconfig11 distances with data transfer rates significantly higher than those
/openbmc/linux/Documentation/staging/
H A Dlzo.rst53 For references to the dictionary, distances are relative to the output
/openbmc/linux/Documentation/admin-guide/mm/
H A Dksm.rst96 significant NUMA distances, are likely to benefit from the
/openbmc/qemu/qapi/
H A Dqom.json861 # reference point used for defining NUMA distances and access
865 # bus. NUMA distances and access characteristics are defined to
/openbmc/linux/Documentation/core-api/
H A Dworkqueue.rst565 impact is dependent on the distances between the scopes and may be more
/openbmc/linux/Documentation/networking/
H A Dethtool-netlink.rst1314 of the nest. All distances are expressed in centimeters. The PHY takes
1315 the distances as a guide, and rounds to the nearest distance it
/openbmc/linux/Documentation/admin-guide/sysctl/
H A Dvm.rst999 distances between watermarks are 0.1% of the available memory in the
/openbmc/qemu/
H A Dqemu-options.hx485 all pairs must be given distances. Although, when distances are only
486 given in one direction for each pair of nodes, then the distances in
488 asymmetrical pair of distances is given for even one node pair, then