| /linux/Documentation/arch/powerpc/ |
| H A 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/Documentation/staging/ |
| H A 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/drivers/of/ |
| H A D | of_numa.c | 84 pr_info("parsing numa-distance-map-v1\n"); in of_numa_parse_distance_map_v1()
86 matrix = of_get_property(map, "distance-matrix", NULL); in of_numa_parse_distance_map_v1()
88 pr_err("No distance-matrix property in distance-map\n"); in of_numa_parse_distance_map_v1()
92 entry_count = of_property_count_u32_elems(map, "distance-matrix"); in of_numa_parse_distance_map_v1()
94 pr_err("Invalid distance-matrix\n"); in of_numa_parse_distance_map_v1()
99 u32 nodea, nodeb, distance; in of_numa_parse_distance_map_v1() local
105 distance = of_read_number(matrix, 1); in of_numa_parse_distance_map_v1()
108 if ((nodea == nodeb && distance != LOCAL_DISTANCE) || in of_numa_parse_distance_map_v1()
109 (nodea != nodeb && distance <= LOCAL_DISTANCE)) { in of_numa_parse_distance_map_v1()
110 pr_err("Invalid distance[node%d -> node%d] = %d\n", in of_numa_parse_distance_map_v1()
[all …]
|
| /linux/lib/xz/ |
| H A D | xz_lzma2.h | 34 * - Match: Repeat a chunk of data at some distance
35 * - Long repeat: Multi-byte match at a recently seen distance
36 * - Short repeat: One-byte repeat at a recently seen distance
144 * the distance slot.
153 * The highest two bits of a 32-bit match distance are encoded using six bits.
154 * This six-bit value is called a distance slot. This way encoding a 32-bit
161 * the highest two bits (distance slot) are always encoded using six bits,
163 * distance slot itself is the same as the actual distance. DIST_MODEL_START
164 * indicates the first distance slot where at least one additional bit is
171 * - distance slot: the highest two bits
[all …]
|
| /linux/arch/csky/lib/ |
| H A D | string.c | 34 int distance = 0; in memcpy() local
43 distance = s.as_uptr & WORD_MASK; in memcpy()
45 if (distance) { in memcpy()
49 * s is distance bytes ahead of d, and d just reached in memcpy()
51 * and shift data to compensate for distance, in order to do in memcpy()
54 s.as_u8 -= distance; in memcpy()
61 d.as_ulong[0] = last >> (distance * 8) | in memcpy()
62 next << ((BYTES_LONG - distance) * 8); in memcpy()
69 s.as_u8 += distance; in memcpy()
|
| /linux/mm/ |
| H A D | numa_memblks.c | 35 * numa_reset_distance - Reset NUMA distance table
68 pr_warn("Warning: can't allocate distance table!\n"); in numa_alloc_distance()
81 pr_debug("NUMA: Initialized distance table, cnt=%d\n", cnt); in numa_alloc_distance()
87 * numa_set_distance - Set NUMA distance from one NUMA to another
88 * @from: the 'from' node to set distance
89 * @to: the 'to' node to set distance
90 * @distance: NUMA distance
92 * Set the distance from node @from to @to to @distance. If distance table
97 * calls are ignored until the distance table is reset with
101 * at the time of table creation or @distance doesn't make sense, the call
[all …]
|
| H A D | numa_emulation.c | 350 * @numa_dist_cnt: The size of the physical NUMA distance table
355 * used to determine the size of the physical distance table.
364 * - NUMA distance table is rebuilt to represent distances between emulated
449 /* copy the physical distance table */ in numa_emulation()
453 pr_warn("NUMA: Warning: can't allocate copy of distance table, disabling emulation\n"); in numa_emulation()
494 /* transform distance table */ in numa_emulation()
518 /* distance between fake nodes is already ok */ in numa_emulation()
535 /* free the copied physical distance table */ in numa_emulation()
|
| /linux/lib/zlib_inflate/ |
| H A 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 …]
|
| H A 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 */
|
| H A 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/drivers/iio/proximity/ |
| H A D | Kconfig | 22 menu "Proximity and distance sensors"
103 the distance of objects. Supported types are mb1202, mb1212,
115 used to measure the distance of objects.
128 Say Y to build a driver for the RFD77402 Time-of-Flight (distance)
139 ranger sensor. This driver can be used to measure the distance
220 This driver can be used to measure the distance of objects.
242 This driver can be used to measure the distance of objects.
257 This driver can be used to measure the distance of objects.
|
| /linux/drivers/video/fbdev/ |
| H A D | arcfb.c | 249 unsigned int left, unsigned int right, unsigned int distance) in arcfb_lcd_update_page() argument
303 unsigned int distance, upper, lower; in arcfb_lcd_update_vert() local
305 distance = (bottom - top) + 1; in arcfb_lcd_update_vert()
309 while (distance > 0) { in arcfb_lcd_update_vert()
310 distance -= 8; in arcfb_lcd_update_vert()
325 unsigned int distance, upper, lower; in arcfb_lcd_update_horiz() local
327 distance = h; in arcfb_lcd_update_horiz()
329 lower = min(upper + distance - 1, ceil64(upper)); in arcfb_lcd_update_horiz()
331 while (distance > 0) { in arcfb_lcd_update_horiz()
332 distance -= ((lower - upper) + 1 ); in arcfb_lcd_update_horiz()
[all …]
|
| /linux/include/linux/ |
| H A D | topology.h | 45 /* Conform to ACPI 2.0 SLIT distance definitions */
54 * If the distance between nodes in a system is larger than RECLAIM_DISTANCE
57 * on nodes within this distance.
64 * reclaim distance (RECLAIM_DISTANCE) if remote memory accesses are
68 * AMD EPYC machines use this because even though the 2-hop distance
285 * for_each_node_numadist() - iterate over nodes in increasing distance
290 * This macro iterates over NUMA node IDs in increasing distance from the
299 * the latter iterates over nodes in increasing order of distance.
303 * find the one with the shortest distance.
315 * for_each_numa_hop_mask - iterate over cpumasks of increasing NUMA distance
|
| /linux/drivers/net/phy/ |
| H A D | open_alliance_helpers.c | 56 * oa_1000bt1_get_tdr_distance - Get distance to the main fault from TDR
61 * the distance to the main fault detected by the TDR feature. The distance is
63 * distance is not available (0x3f), the function returns -ERANGE.
65 * Return: The distance to the main fault in centimeters, or -ERANGE if the
|
| H A D | open_alliance_helpers.h | 28 * This mask is used to extract the distance to the first/main fault
29 * detected by the TDR feature. Each bit represents an approximate distance
37 * 111111 = resolution not possible / out of distance
|
| /linux/tools/perf/util/ |
| H A 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/tools/perf/pmu-events/arch/arm64/ampere/ampereonex/ |
| H A D | cache.json | 167 "PublicDescription": "L1 prefetcher, distance was reset",
170 "BriefDescription": "L1 prefetcher, distance was reset"
173 "PublicDescription": "L1 prefetcher, distance was increased",
176 "BriefDescription": "L1 prefetcher, distance was increased"
|
| /linux/arch/arm64/boot/dts/hisilicon/ |
| H A D | hip07-d05.dts | 23 distance-map {
24 compatible = "numa-distance-map-v1";
25 distance-matrix = <0 0 10>,
|
| /linux/lib/zstd/compress/ |
| H A D | zstd_ldm.h | 19 * Long distance matching
31 * Generates the sequences using the long distance match finder.
87 * Estimate the space needed for long distance matching tables or 0 if LDM is
94 * the long distance matcher, or 0 if LDM is disabled.
|
| /linux/Documentation/userspace-api/media/v4l/ |
| H A D | pixfmt-z16.rst | 11 16-bit depth data with distance values at each pixel
18 distance to the respective point in the image coordinates. Distance unit
|
| /linux/lib/ |
| H A 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()
176 /* Invalidate distance for all CPUs for which this used to be in cpu_rmap_update()
188 /* Set distance to 0 for all CPUs in the new affinity mask. in cpu_rmap_update()
|
| /linux/lib/zlib_deflate/ |
| H A 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 …]
|
| /linux/Documentation/ABI/testing/ |
| H A D | sysfs-bus-iio-proximity-as3935 | 6 Get the current distance in meters of storm (1km steps)
7 1000-40000 = distance in meters
|
| H A D | sysfs-kernel-mm-memory-tiers | 7 named by the abstract distance of the memory tier.
19 memory tier, memtierN, where N is derived based on abstract distance.
|
| /linux/net/dccp/ |
| H A D | ackvec.c | |