| /Linux-v5.15/Documentation/powerpc/ |
| D | associativity.rst | 10 characteristic is presented in terms of NUMA node distance within the Linux kernel.
29 device tree properties are used to determine the NUMA distance between resource groups/domains.
42 Linux kernel computes NUMA distance between two domains by recursively comparing
44 level of the resource group, the kernel doubles the NUMA distance between the
49 Form 2 associativity format adds separate device tree properties representing NUMA node distance
50 thereby making the node distance computation flexible. Form 2 also allows flexible primary
51 domain numbering. With numa distance computation now detached from the index value in
61 used as an index while computing numa distance information via "ibm,numa-distance-table".
68 computing the distance of domain 8 from other domains present in the system. For the rest of
69 this document, this offset will be referred to as domain distance offset.
[all …]
|
| /Linux-v5.15/drivers/of/ |
| D | of_numa.c | 83 pr_info("parsing numa-distance-map-v1\n"); in of_numa_parse_distance_map_v1()
85 matrix = of_get_property(map, "distance-matrix", NULL); in of_numa_parse_distance_map_v1()
87 pr_err("No distance-matrix property in distance-map\n"); in of_numa_parse_distance_map_v1()
91 entry_count = of_property_count_u32_elems(map, "distance-matrix"); in of_numa_parse_distance_map_v1()
93 pr_err("Invalid distance-matrix\n"); in of_numa_parse_distance_map_v1()
98 u32 nodea, nodeb, distance; in of_numa_parse_distance_map_v1() local
104 distance = of_read_number(matrix, 1); in of_numa_parse_distance_map_v1()
107 if ((nodea == nodeb && distance != LOCAL_DISTANCE) || in of_numa_parse_distance_map_v1()
108 (nodea != nodeb && distance <= LOCAL_DISTANCE)) { in of_numa_parse_distance_map_v1()
109 pr_err("Invalid distance[node%d -> node%d] = %d\n", in of_numa_parse_distance_map_v1()
[all …]
|
| /Linux-v5.15/Documentation/staging/ |
| D | lzo.rst | 26 - a distance when copying data from the dictionary (past output buffer)
32 extra data can be a complement for the operand (eg: a length or a distance
66 taken from the last two bits of an extra operand (eg: distance).
68 End of stream is declared when a block copy of distance 0 is seen. Only one
69 instruction may encode this distance (0001HLLL), it takes one LE16 operand
70 for the distance, thus requiring 3 bytes.
133 the instruction's opcode or distance), the instruction is a copy of a
134 2-byte block from the dictionary within a 1kB distance. It is worth
139 0 0 0 0 D D S S (0..15) : copy 2 bytes from <= 1kB distance
143 distance = (H << 2) + D + 1
[all …]
|
| /Linux-v5.15/lib/xz/ |
| D | xz_lzma2.h | 35 * - Match: Repeat a chunk of data at some distance
36 * - Long repeat: Multi-byte match at a recently seen distance
37 * - Short repeat: One-byte repeat at a recently seen distance
145 * the distance slot.
154 * The highest two bits of a 32-bit match distance are encoded using six bits.
155 * This six-bit value is called a distance slot. This way encoding a 32-bit
162 * the highest two bits (distance slot) are always encoded using six bits,
164 * distance slot itself is the same as the actual distance. DIST_MODEL_START
165 * indicates the first distance slot where at least one additional bit is
172 * - distance slot: the highest two bits
[all …]
|
| /Linux-v5.15/drivers/base/ |
| D | arch_numa.c | 273 * Create a new NUMA distance table.
295 pr_debug("Initialized distance table, cnt=%d\n", numa_distance_cnt); in numa_alloc_distance()
301 * numa_set_distance() - Set inter node NUMA distance from node to node.
302 * @from: the 'from' node to set distance
303 * @to: the 'to' node to set distance
304 * @distance: NUMA distance
306 * Set the distance from node @from to @to to @distance.
307 * If distance table doesn't exist, a warning is printed.
310 * or @distance doesn't make sense, the call is ignored.
312 void __init numa_set_distance(int from, int to, int distance) in numa_set_distance() argument
[all …]
|
| /Linux-v5.15/Documentation/devicetree/bindings/ |
| D | numa.txt | 36 3 - distance-map
39 The optional device tree node distance-map describes the relative
40 distance (memory latency) between all numa nodes.
42 - compatible : Should at least contain "numa-distance-map-v1".
44 - distance-matrix
47 It is represented as a list of node pairs and their relative distance.
50 1. Each entry represents distance from first node to second node.
52 2. The distance from a node to self (local distance) is represented
53 with value 10 and all internode distance should be represented with
55 3. distance-matrix should have entries in lexicographical ascending
[all …]
|
| /Linux-v5.15/lib/zlib_inflate/ |
| D | inffast.c | 31 Decode literal, length, and distance codes and write out the resulting
54 - The maximum input bits used by a length/distance pair is 15 bits for the
55 length code, 5 bits for the length extra, 15 bits for the distance code,
56 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
60 - The maximum bytes that a single length/distance pair can output is 258
76 unsigned dmax; /* maximum distance from zlib header */ in inflate_fast()
87 unsigned dmask; /* mask for first level of distance codes */ in inflate_fast()
92 unsigned dist; /* match distance */ in inflate_fast()
158 if (op & 16) { /* distance base */ in inflate_fast()
172 strm->msg = (char *)"invalid distance too far back"; in inflate_fast()
[all …]
|
| D | inflate.h | 35 CODELENS, /* i: waiting for length/lit and distance code lengths */
38 DIST, /* i: waiting for distance code */
39 DISTEXT, /* i: waiting for distance extra bits */
80 unsigned dmax; /* zlib header max distance (INFLATE_STRICT) */
95 unsigned offset; /* distance back to copy string from */
100 code const *distcode; /* starting table for distance codes */
106 unsigned ndist; /* number of distance code lengths */
|
| D | inftrees.h | 19 distance, an end-of-block, or an invalid code. For a table
21 that table. For a length or distance, the low four bits of op
25 of a literal, the base length or distance, or the offset from
36 0001eeee - length or distance, eeee is the number of extra bits
|
| /Linux-v5.15/drivers/iio/proximity/ |
| D | Kconfig | 22 menu "Proximity and distance sensors"
66 the distance of objects. Supported types are mb1202, mb1212,
78 used to measure the distance of objects.
91 Say Y to build a driver for the RFD77402 Time-of-Flight (distance)
102 ranger sensor. This driver can be used to measure the distance
149 This driver can be used to measure the distance of objects.
171 This driver can be used to measure the distance of objects.
|
| D | mb1232.c | 45 s16 distance; member
64 s16 distance; in mb1232_read_distance() local
98 distance = __be16_to_cpu(buf); in mb1232_read_distance()
100 if (distance < 0) { in mb1232_read_distance()
101 dev_err(&client->dev, "distance=%d\n", distance); in mb1232_read_distance()
108 return distance; in mb1232_read_distance()
122 data->scan.distance = mb1232_read_distance(data); in mb1232_trigger_handler()
123 if (data->scan.distance < 0) in mb1232_trigger_handler()
|
| /Linux-v5.15/arch/parisc/kernel/ |
| D | jump_label.c | 29 int distance = target - addr; in arch_jump_label_transform() local
36 distance -= 8; in arch_jump_label_transform()
37 BUG_ON(distance > 262143 || distance < -262144); in arch_jump_label_transform()
38 insn = 0xe8000002 | reassemble_17(distance >> 2); in arch_jump_label_transform()
|
| /Linux-v5.15/mm/ |
| D | workingset.c | 40 * Access frequency and refault distance
46 * In cases where the average access distance between thrashing pages
51 * However, the average access distance could be bigger than the
99 * This is called the refault distance.
102 * access the refault, we combine the in-cache distance with the
103 * out-of-cache distance to get the complete minimum access distance
108 * And knowing the minimum access distance of a page, we can easily
118 * Put into words, the refault distance (out-of-cache) can be seen as
132 * So when a refault distance of (R - E) is observed and there are at
139 * distance, we assume the cache workingset is transitioning and put
[all …]
|
| /Linux-v5.15/arch/x86/mm/ |
| D | numa.c | 347 * numa_reset_distance - Reset NUMA distance table
382 pr_warn("Warning: can't allocate distance table!\n"); in numa_alloc_distance()
396 printk(KERN_DEBUG "NUMA: Initialized distance table, cnt=%d\n", cnt); in numa_alloc_distance()
402 * numa_set_distance - Set NUMA distance from one NUMA to another
403 * @from: the 'from' node to set distance
404 * @to: the 'to' node to set distance
405 * @distance: NUMA distance
407 * Set the distance from node @from to @to to @distance. If distance table
412 * calls are ignored until the distance table is reset with
416 * at the time of table creation or @distance doesn't make sense, the call
[all …]
|
| /Linux-v5.15/tools/perf/tests/ |
| D | evsel-roundtrip-name.c | 68 int distance) in __perf_evsel__name_array_test() argument
88 if (strcmp(evsel__name(evsel), names[evsel->core.idx / distance])) { in __perf_evsel__name_array_test()
90 pr_debug("%s != %s\n", evsel__name(evsel), names[evsel->core.idx / distance]); in __perf_evsel__name_array_test()
99 #define perf_evsel__name_array_test(names, distance) \ argument
100 __perf_evsel__name_array_test(names, ARRAY_SIZE(names), distance)
|
| /Linux-v5.15/drivers/video/fbdev/ |
| D | arcfb.c | 248 unsigned int left, unsigned int right, unsigned int distance) in arcfb_lcd_update_page() argument
302 unsigned int distance, upper, lower; in arcfb_lcd_update_vert() local
304 distance = (bottom - top) + 1; in arcfb_lcd_update_vert()
308 while (distance > 0) { in arcfb_lcd_update_vert()
309 distance -= 8; in arcfb_lcd_update_vert()
324 unsigned int distance, upper, lower; in arcfb_lcd_update_horiz() local
326 distance = h; in arcfb_lcd_update_horiz()
328 lower = min(upper + distance - 1, ceil64(upper)); in arcfb_lcd_update_horiz()
330 while (distance > 0) { in arcfb_lcd_update_horiz()
331 distance -= ((lower - upper) + 1 ); in arcfb_lcd_update_horiz()
[all …]
|
| /Linux-v5.15/tools/perf/util/ |
| D | levenshtein.c | 9 * calculate a distance between strings.
14 * The idea is to build a distance matrix for the substrings of both
20 * string1 that the distance is calculated for.
26 * Damerau-Levenshtein distance between the substring of string1 of length
42 * Note that this algorithm calculates a distance _iff_ d == a.
|
| /Linux-v5.15/drivers/pci/ |
| D | p2pdma.c | 414 * Calculate the P2PDMA mapping type and distance between two PCI devices.
417 * PCI_P2PDMA_MAP_BUS_ADDR and a distance of 0.
420 * PCI_P2PDMA_MAP_BUS_ADDR and a distance of 2 (one hop up to the bridge,
424 * return a distance of 4. This corresponds to the following PCI tree:
433 * The distance is 4 because we traverse from Device A to Downstream Port 0
445 * PCI_P2PDMA_MAP_THRU_HOST_BRIDGE with the distance set to the number of
545 * pci_p2pdma_distance_many - Determine the cumulative distance between
568 int i, distance; in pci_p2pdma_distance_many() local
582 map = calc_map_type_and_dist(provider, pci_client, &distance, in pci_p2pdma_distance_many()
593 total_dist += distance; in pci_p2pdma_distance_many()
[all …]
|
| /Linux-v5.15/lib/ |
| D | inflate.c | 23 codes the length of the matched string and its distance backwards from
26 code codes the distance information, which follows a length code. Each
27 length or distance code actually represents a base value and a number
32 length then get the distance and emit the referred-to bytes from the
45 an encoding of the literal/length and distance Huffman codes that are
65 1. Distance pointers never point before the beginning of the output
67 2. Distance pointers can point back across blocks, up to 32k away.
73 5. There is no way of sending zero distance codes--a dummy must be
75 store blocks with no distance codes, but this was discovered to be
77 zero distance codes, which is sent as one code of zero bits in
[all …]
|
| D | cpu_rmap.c | 47 * no idea where the objects are. Use infinite distance, so in alloc_cpu_rmap()
48 * any object with known distance is preferable. Include the in alloc_cpu_rmap()
92 * neighbours at the given distance.
120 pr_info("cpu %d -> obj %u (distance %u)\n", in debug_print_rmap()
164 /* Invalidate distance for all CPUs for which this used to be in cpu_rmap_update()
176 /* Set distance to 0 for all CPUs in the new affinity mask. in cpu_rmap_update()
|
| /Linux-v5.15/include/linux/ |
| D | topology.h | 48 /* Conform to ACPI 2.0 SLIT distance definitions */
57 * If the distance between nodes in a system is larger than RECLAIM_DISTANCE
60 * on nodes within this distance.
67 * reclaim distance (RECLAIM_DISTANCE) if remote memory accesses are
71 * AMD EPYC machines use this because even though the 2-hop distance
|
| /Linux-v5.15/arch/arm64/boot/dts/hisilicon/ |
| D | hip07-d05.dts | 23 distance-map {
24 compatible = "numa-distance-map-v1";
25 distance-matrix = <0 0 10>,
|
| /Linux-v5.15/Documentation/userspace-api/media/v4l/ |
| D | pixfmt-z16.rst | 10 16-bit depth data with distance values at each pixel
17 distance to the respective point in the image coordinates. Distance unit
|
| /Linux-v5.15/Documentation/ABI/testing/ |
| D | sysfs-bus-iio-proximity-as3935 | 6 Get the current distance in meters of storm (1km steps)
7 1000-40000 = distance in meters
|
| /Linux-v5.15/lib/zlib_deflate/ |
| D | deftree.c | 67 static const int extra_dbits[D_CODES] /* extra bits for each distance code */
91 /* The static distance tree. (Actually a trivial tree since all codes use
96 /* distance codes. The first 256 values correspond to the distances
108 /* First normalized distance for each code (0 = distance of 1) */
161 /* Mapping from a distance to a distance code. dist is the distance - 1 and
178 int dist; /* distance index */ in tr_static_init()
230 /* The static distance tree is trivial: */ in tr_static_init()
511 /* The pkzip format requires that at least one distance code exists, in build_tree()
569 * Scan a literal or distance tree to determine the frequencies of the codes
615 * Send a literal or distance tree in compressed form, using the codes in
[all …]
|
