| /openbmc/qemu/docs/specs/ |
| H A D | ppc-spapr-numa.rst | 5 NUMA in sPAPR works different than the System Locality Distance
15 similar mean performance (or in our context here, distance) relative to
46 Relative Performance Distance and ibm,associativity-reference-points
50 to define the relevant performance/distance related boundaries, defining
60 same performance boundaries are expected to have relative NUMA distance
62 to the same first boundary will have the shortest distance from each
74 belonging to the first NUMA level have distance equal to 10 from each
75 other, and each NUMA level doubles the distance from the previous. This
95 P1 and P2 have the same third NUMA level, MOD1: Distance between them = 40
98 distance attributes for the same associativity arrays, as the following
[all …]
|
| /openbmc/linux/Documentation/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 …]
|
| /openbmc/linux/drivers/of/ |
| H A 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 …]
|
| /openbmc/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 …]
|
| /openbmc/u-boot/fs/jffs2/ |
| H A D | mini_inflate.c | 53 stream->distance.bits = 16; in init_stream()
54 stream->distance.num_symbols = 32; in init_stream()
55 stream->distance.lengths = stream->distance_lengths; in init_stream()
56 stream->distance.symbols = stream->distance_symbols; in init_stream()
57 stream->distance.count = stream->distance_count; in init_stream()
58 stream->distance.first = stream->distance_first; in init_stream()
59 stream->distance.pos = stream->distance_pos; in init_stream()
137 /* decompress a stream of data encoded with the passed length and distance
142 struct huffman_set *distance = &(stream->distance); in decompress_huffman() local
164 if ((symbol = read_symbol(stream, distance)) < 0) in decompress_huffman()
[all …]
|
| /openbmc/linux/Documentation/devicetree/bindings/ |
| H A 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 …]
|
| /openbmc/linux/lib/xz/ |
| H A 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 …]
|
| /openbmc/linux/drivers/base/ |
| H A D | arch_numa.c | 271 * Create a new NUMA distance table.
291 pr_debug("Initialized distance table, cnt=%d\n", numa_distance_cnt); in numa_alloc_distance()
297 * numa_set_distance() - Set inter node NUMA distance from node to node.
298 * @from: the 'from' node to set distance
299 * @to: the 'to' node to set distance
300 * @distance: NUMA distance
302 * Set the distance from node @from to @to to @distance.
303 * If distance table doesn't exist, a warning is printed.
306 * or @distance doesn't make sense, the call is ignored.
308 void __init numa_set_distance(int from, int to, int distance) in numa_set_distance() argument
[all …]
|
| /openbmc/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()
|
| /openbmc/qemu/hw/ppc/ |
| H A D | spapr_numa.c | 69 * Wrapper that returns node distance from ms->numa_state->nodes
70 * after handling edge cases where the distance might be absent.
75 int ret = numa_info[src].distance[dst]; in get_numa_distance()
84 * the distance will be absent (zero). Return local/remote in get_numa_distance()
85 * distance in this case. in get_numa_distance()
114 * (local distance), 20, 40, 80 and 160, and return the equivalent
116 * - local distance (10) returns numa_level = 0x4, meaning there is
117 * no rounding for local distance
128 static uint8_t spapr_numa_get_numa_level(uint8_t distance) in spapr_numa_get_numa_level() argument
130 if (distance == 10) { in spapr_numa_get_numa_level()
[all …]
|
| /openbmc/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 */
|
| /openbmc/u-boot/lib/zlib/ |
| H A D | inffast.c | 35 Decode literal, length, and distance codes and write out the resulting
58 - The maximum input bits used by a length/distance pair is 15 bits for the
59 length code, 5 bits for the length extra, 15 bits for the distance code,
60 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
64 - The maximum bytes that a single length/distance pair can output is 258
79 unsigned dmax; /* maximum distance from zlib header */ in inflate_fast()
90 unsigned dmask; /* mask for first level of distance codes */ in inflate_fast()
95 unsigned dist; /* match distance */ in inflate_fast()
173 if (op & 16) { /* distance base */ in inflate_fast()
187 strm->msg = (char *)"invalid distance too far back"; in inflate_fast()
[all …]
|
| H A D | inflate.h | 38 CODELENS, /* i: waiting for length/lit and distance code lengths */
41 DIST, /* i: waiting for distance code */
42 DISTEXT, /* i: waiting for distance extra bits */
83 unsigned dmax; /* zlib header max distance (INFLATE_STRICT) */
98 unsigned offset; /* distance back to copy string from */
103 code const FAR *distcode; /* starting table for distance codes */
109 unsigned ndist; /* number of distance code lengths */
|
| H A D | deflate.h | 40 /* number of distance codes */
116 * bytes. With this organization, matches are limited to a distance of
193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
197 struct tree_desc_s d_desc; /* desc. for distance tree */
303 /* Mapping from a distance to a distance code. dist is the distance - 1 and
326 # define _tr_tally_dist(s, distance, length, flush) \ argument
328 ush dist = (distance); \
338 # define _tr_tally_dist(s, distance, length, flush) \ argument
339 flush = _tr_tally(s, distance, length)
|
| /openbmc/qemu/hw/core/ |
| H A D | numa.c | 192 error_setg(errp, "NUMA distance (%" PRIu8 ") is invalid, " in parse_numa_distance()
199 error_setg(errp, "Local distance of node %d should be %d.", in parse_numa_distance()
204 numa_info[src].distance[dst] = val; in parse_numa_distance()
557 * distance from a node to itself is always NUMA_DISTANCE_MIN,
569 if (numa_info[src].distance[dst] == 0 && in validate_numa_distance()
570 numa_info[dst].distance[src] == 0) { in validate_numa_distance()
572 error_report("The distance between node %d and %d is " in validate_numa_distance()
573 "missing, at least one distance value " in validate_numa_distance()
580 if (numa_info[src].distance[dst] != 0 && in validate_numa_distance()
581 numa_info[dst].distance[src] != 0 && in validate_numa_distance()
[all …]
|
| /openbmc/u-boot/lib/lzma/ |
| H A D | LzmaDec.c | 241 UInt32 distance; in LzmaDec_DecodeReal() local
247 distance = rep1; in LzmaDec_DecodeReal()
256 distance = rep2; in LzmaDec_DecodeReal()
261 distance = rep3; in LzmaDec_DecodeReal()
267 rep0 = distance; in LzmaDec_DecodeReal()
307 UInt32 distance; in LzmaDec_DecodeReal() local
310 TREE_6_DECODE(prob, distance); in LzmaDec_DecodeReal()
311 if (distance >= kStartPosModelIndex) in LzmaDec_DecodeReal()
313 unsigned posSlot = (unsigned)distance; in LzmaDec_DecodeReal()
314 int numDirectBits = (int)(((distance >> 1) - 1)); in LzmaDec_DecodeReal()
[all …]
|
| /openbmc/linux/arch/parisc/kernel/ |
| H A 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()
|
| /openbmc/linux/drivers/iio/proximity/ |
| H A D | mb1232.c | 47 s16 distance; member
66 s16 distance; in mb1232_read_distance() local
100 distance = __be16_to_cpu(buf); in mb1232_read_distance()
102 if (distance < 0) { in mb1232_read_distance()
103 dev_err(&client->dev, "distance=%d\n", distance); in mb1232_read_distance()
110 return distance; in mb1232_read_distance()
124 data->scan.distance = mb1232_read_distance(data); in mb1232_trigger_handler()
125 if (data->scan.distance < 0) in mb1232_trigger_handler()
|
| H A D | Kconfig | 22 menu "Proximity and distance sensors"
80 the distance of objects. Supported types are mb1202, mb1212,
92 used to measure the distance of objects.
105 Say Y to build a driver for the RFD77402 Time-of-Flight (distance)
116 ranger sensor. This driver can be used to measure the distance
197 This driver can be used to measure the distance of objects.
219 This driver can be used to measure the distance of objects.
|
| /openbmc/linux/arch/loongarch/kernel/ |
| H A D | acpi.c | 231 void __init numa_set_distance(int from, int to, int distance) in numa_set_distance() argument
233 if ((u8)distance != distance || (from == to && distance != LOCAL_DISTANCE)) { in numa_set_distance()
234 pr_warn_once("Warning: invalid distance parameter, from=%d to=%d distance=%d\n", in numa_set_distance()
235 from, to, distance); in numa_set_distance()
239 node_distances[from][to] = distance; in numa_set_distance()
|
| /openbmc/linux/arch/x86/mm/ |
| H A D | numa.c | 348 * numa_reset_distance - Reset NUMA distance table
383 pr_warn("Warning: can't allocate distance table!\n"); in numa_alloc_distance()
397 printk(KERN_DEBUG "NUMA: Initialized distance table, cnt=%d\n", cnt); in numa_alloc_distance()
403 * numa_set_distance - Set NUMA distance from one NUMA to another
404 * @from: the 'from' node to set distance
405 * @to: the 'to' node to set distance
406 * @distance: NUMA distance
408 * Set the distance from node @from to @to to @distance
421 numa_set_distance(int from,int to,int distance) numa_set_distance() argument
[all...] |
| /openbmc/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 …]
|
| /openbmc/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.
|
| /openbmc/qemu/hw/timer/ |
| H A D | exynos4210_mct.c | 223 uint64_t distance; /* distance to count to the next event */ member
274 VMSTATE_UINT64(distance, struct tick_timer),
433 uint64_t distance; in exynos4210_gcomp_find() local
455 distance = s->g_timer.reg.comp[i] - gfrc; in exynos4210_gcomp_find()
457 if (distance <= distance_min) { in exynos4210_gcomp_find()
458 distance_min = distance; in exynos4210_gcomp_find()
485 "comp 0x%llx distance 0x%llx, gfrc 0x%llx\n", in exynos4210_gcomp_find()
496 * Get distance to nearest Comparator
501 /* no enabled Comparators, choose max distance */ in exynos4210_gcomp_get_distance()
517 uint64_t distance; in exynos4210_gfrc_restart() local
[all …]
|