| /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/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 …]
|
| /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 | 33 * numa_reset_distance - Reset NUMA distance table
66 pr_warn("Warning: can't allocate distance table!\n"); in numa_alloc_distance()
79 printk(KERN_DEBUG "NUMA: Initialized distance table, cnt=%d\n", cnt); in numa_alloc_distance()
85 * numa_set_distance - Set NUMA distance from one NUMA to another
86 * @from: the 'from' node to set distance
87 * @to: the 'to' node to set distance
88 * @distance: NUMA distance
90 * Set the distance from node @from to @to to @distance. If distance table
95 * calls are ignored until the distance table is reset with
99 * at the time of table creation or @distance doesn't make sense, the call
[all …]
|
| H A D | memory-tiers.c | 19 * start value of abstract distance. memory tier maps
20 * an abstract distance range,
419 int distance, best_distance; in establish_demotion_targets() local
450 * Find all the nodes in the memory tier node list of same best distance. in establish_demotion_targets()
459 distance = node_distance(node, target); in establish_demotion_targets()
460 if (distance == best_distance || best_distance == -1) { in establish_demotion_targets()
461 best_distance = distance; in establish_demotion_targets()
481 * abstract distance below the max value of this memtier in establish_demotion_targets()
757 * will be used as base to calculate the abstract distance of in mt_set_default_dram_perf()
777 " disable default DRAM node performance based abstract distance algorithm.\n"); in mt_set_default_dram_perf()
[all …]
|
| H A D | workingset.c | 41 * Access frequency and refault distance
47 * In cases where the average access distance between thrashing pages
52 * However, the average access distance could be bigger than the
100 * This is called the refault distance.
103 * access the refault, we combine the in-cache distance with the
104 * out-of-cache distance to get the complete minimum access distance
109 * And knowing the minimum access distance of a page, we can easily
130 * Put into words, the refault distance (out-of-cache) can be seen as
144 * So when a refault distance of (R - E) is observed and there are at
151 * distance, we assume the cache workingset is transitioning and put
[all …]
|
| /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 | 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"
94 the distance of objects. Supported types are mb1202, mb1212,
106 used to measure the distance of objects.
119 Say Y to build a driver for the RFD77402 Time-of-Flight (distance)
130 ranger sensor. This driver can be used to measure the distance
211 This driver can be used to measure the distance of objects.
233 This driver can be used to measure the distance of objects.
|
| /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()
|
| /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/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/lib/ |
| H A 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 …]
|
| /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/drivers/pci/ |
| H A D | p2pdma.c | 539 * Calculate the P2PDMA mapping type and distance between two PCI devices.
542 * PCI_P2PDMA_MAP_BUS_ADDR and a distance of 0.
545 * PCI_P2PDMA_MAP_BUS_ADDR and a distance of 2 (one hop up to the bridge,
549 * return a distance of 4. This corresponds to the following PCI tree:
558 * The distance is 4 because we traverse from Device A to Downstream Port 0
570 * PCI_P2PDMA_MAP_THRU_HOST_BRIDGE with the distance set to the number of
670 * pci_p2pdma_distance_many - Determine the cumulative distance between
693 int i, distance; in pci_p2pdma_distance_many() local
707 map = calc_map_type_and_dist(provider, pci_client, &distance, in pci_p2pdma_distance_many()
718 total_dist += distance; in pci_p2pdma_distance_many()
[all …]
|
| /linux/include/linux/ |
| H A 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
265 * for_each_numa_hop_mask - iterate over cpumasks of increasing NUMA distance
|
| H A D | memory-tiers.h | 11 * Each tier cover a abstrace distance chunk size of 128
16 * Smaller abstract distance values imply faster (higher) memory tiers. Offset
29 /* abstract distance for this specific memory type */
31 /* Nodes of same abstract distance */
|
| /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>,
|