| /linux/arch/sparc/kernel/ |
| H A D | head_64.S | 99 ba,a,pt %xcc, 1f
174 stx %l1, [%sp + 2047 + 128 + 0x00] ! service, "peer"
176 stx %l3, [%sp + 2047 + 128 + 0x08] ! num_args, 1
177 stx %l3, [%sp + 2047 + 128 + 0x10] ! num_rets, 1
178 stx %l2, [%sp + 2047 + 128 + 0x18] ! arg1, 0
179 stx %g0, [%sp + 2047 + 128 + 0x20] ! ret1
181 add %sp, (2047 + 128), %o0 ! argument array
183 ldx [%sp + 2047 + 128 + 0x20], %l4 ! prom root node
198 stx %l1, [%sp + 2047 + 128 + 0x00] ! service, "getprop"
200 stx %l3, [%sp + 2047 + 128 + 0x08] ! num_args, 4
[all …]
|
| /linux/fs/btrfs/tests/ |
| H A D | free-space-tests.c | 99 test_err("couldn't create a bitmap entry %d", ret); in test_bitmaps()
132 /* Test a bit straddling two bitmaps */ in test_bitmaps()
213 * Ok so a little more evil, extent entry and bitmap at the same offset, in test_bitmaps_and_extents()
218 test_err("couldn't add to a bitmap %d", ret); in test_bitmaps_and_extents()
297 * This blew up before, we have part of the free space in a bitmap and in test_bitmaps_and_extents()
381 * Before we were able to steal free space from a bitmap entry to an extent
382 * entry, we could end up with 2 entries representing a contiguous free space.
383 * One would be an extent entry and the other a bitmap entry. Since in order
384 * to allocate space to a caller we use only 1 entry, we couldn't return that
410 * immediately adjacent to a bitmap entry, where the bitmap starts in test_steal_space_from_bitmap_to_extent()
[all …]
|
| /linux/Documentation/admin-guide/device-mapper/ |
| H A D | dm-service-time.rst | 5 dm-service-time is a path selector module for device-mapper targets,
6 which selects a path with the shortest estimated service time for
10 of in-flight I/Os on a path with the performance value of the path.
11 The performance value is a relative throughput value among all paths
12 in a path-group, and it can be specified as a table argument.
30 other paths having a positive value are available.
36 'A' if the path is active, 'F' if the path is failed.
51 Basically, dm-service-time selects a path having minimum service time
78 In case that 2 paths (sda and sdb) are used with repeat_count == 128
82 # echo "0 10 multipath 0 0 1 1 service-time 0 2 2 8:0 128 1 8:16 128 4" \
[all …]
|
| H A D | dm-queue-length.rst | 5 dm-queue-length is a path selector module for device-mapper targets,
6 which selects a path with the least number of in-flight I/Os.
22 <status>: 'A' if the path is active, 'F' if the path is failed.
32 dm-queue-length selects a path with the minimum 'in-flight'.
37 In case that 2 paths (sda and sdb) are used with repeat_count == 128.
41 # echo "0 10 multipath 0 0 1 1 queue-length 0 2 1 8:0 128 8:16 128" \
45 test: 0 10 multipath 0 0 1 1 queue-length 0 2 1 8:0 128 8:16 128
48 test: 0 10 multipath 2 0 0 0 1 1 E 0 2 1 8:0 A 0 0 8:16 A 0 0
|
| H A D | dm-dust.rst | 8 This target behaves similarly to a linear target. At a given time,
9 the user can send a message to the target to start failing read
10 requests on specific blocks (to emulate the behavior of a hard disk
22 This emulates the "remapped sector" behavior of a drive with bad
25 Normally, a drive that is encountering bad sectors will most likely
32 simulating a "failure" event where bad sectors start to appear.
48 (minimum 512, maximum 1073741824, must be a power of 2)
59 (For a device with a block size of 512 bytes)
65 (For a device with a block size of 4096 bytes)
78 $ sudo dd if=/dev/mapper/dust1 of=/dev/null bs=512 count=128 iflag=direct
[all …]
|
| /linux/tools/testing/selftests/net/ |
| H A D | bareudp.sh | 13 # * A chain of 4 network namespaces, connected with veth pairs. Each veth
14 # is assigned an IPv4 and an IPv6 address. A host-route allows a veth to
24 # * NS1 and NS2 are the intermediate namespaces. They use a bareudp device to
32 # | * IPv6 address: 2001:db8::100/128 |
33 # | * IPv6 address: 2001:db8::200/128 |
35 # | * IPv6 route: 2001:db8::103/128 reachable via 2001:db8::11 |
36 # | * IPv6 route: 2001:db8::203/128 reachable via 2001:db8::11 |
41 # | | * IPv6 address: 2001:db8::10, peer 2001:db8::11/128 |
53 # | * IPv6 address: 2001:db8::11, peer 2001:db8::10/128 |
63 # | | * IPv6 address: 2001:db8::21, peer 2001:db8::22/128 |
[all …]
|
| /linux/lib/crc/arm/ |
| H A D | crc-t10dif-core.S | 24 // This software is available to you under a choice of one of two
49 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
75 .arch armv8-a
124 * where each vector element is a byte, ordered from least to most
152 * a := { w0*x0, w0*x2, w0*x4, w0*x6 }, { y0*z0, y0*z2, y0*z4, y0*z6 }
165 vld1.64 {q12}, [r4, :128]
218 vld1.64 {FOLD_CONSTS}, [fold_consts_ptr, :128]!
224 // For sizes less than 256 bytes, we can't fold 128 bytes at a time.
230 // Load the first 128 data bytes. Byte swapping is necessary to make
258 // Load the constants for folding across 128 bytes.
[all …]
|
| H A D | crc32-core.S | 21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
22 * General Public License version 2 for more details (a copy is included
25 * You should have received a copy of the GNU General Public License
40 * PCLMULQDQ is a new instruction in Intel SSE4.2, the reference can be found
55 .arch armv8-a
61 * [x4*128+32 mod P(x) << 32)]' << 1 = 0x154442bd4
64 * [(x4*128-32 mod P(x) << 32)]' << 1 = 0x1c6e41596
135 vld1.8 {q1-q2}, [BUF, :128]!
136 vld1.8 {q3-q4}, [BUF, :128]!
161 vld1.8 {q5}, [BUF, :128]!
[all …]
|
| /linux/tools/testing/selftests/bpf/ |
| H A D | test_lwt_ip_encap.sh | |
| /linux/drivers/media/test-drivers/vidtv/ |
| H A D | vidtv_s302m.c | 3 * Vidtv serves as a reference DVB driver and helps validate the existing APIs
84 { NOTE_E_6, 128}, { NOTE_DS_6, 128}, { NOTE_E_6, 128},
85 { NOTE_DS_6, 128}, { NOTE_E_6, 128}, { NOTE_B_5, 128},
86 { NOTE_D_6, 128}, { NOTE_C_6, 128}, { NOTE_A_3, 128},
87 { NOTE_E_4, 128}, { NOTE_A_4, 128}, { NOTE_C_5, 128},
88 { NOTE_E_5, 128}, { NOTE_A_5, 128}, { NOTE_E_3, 128},
89 { NOTE_E_4, 128}, { NOTE_GS_4, 128}, { NOTE_E_5, 128},
90 { NOTE_GS_5, 128}, { NOTE_B_5, 128}, { NOTE_A_3, 128},
91 { NOTE_E_4, 128}, { NOTE_A_4, 128}, { NOTE_E_5, 128},
92 { NOTE_E_6, 128}, { NOTE_DS_6, 128}, { NOTE_E_6, 128},
[all …]
|
| /linux/drivers/net/wireguard/selftest/ |
| H A D | allowedips.c | 3 * Copyright (C) 2015-2019 Jason A. Donenfeld <Jason@zx2c4.com>. All Rights Reserved.
8 * DEBUG_PRINT_TRIE_GRAPHVIZ to be 1, then every time there's a full tree in
9 * memory, it will be printed out as KERN_DEBUG in a format that can be passed
12 * randomized tests done against a trivial implementation, which may take
13 * upwards of a half-hour to complete. There's no set of users who should be
35 } else if (bits == 128) { in print_node()
332 cidr = get_random_u32_inclusive(1, 128); in randomized_test()
347 mutate_amount = get_random_u32_below(128); in randomized_test()
358 cidr = get_random_u32_inclusive(1, 128); in randomized_test()
379 print_tree(t.root6, 128); in randomized_test()
[all …]
|
| /linux/lib/crypto/x86/ |
| H A D | polyval-pclmul-avx.S | 7 * instructions. It works on 8 blocks at a time, by precomputing the first 8
12 * than 128. We then compute p(x) = h^8m_0 + ... + h^1m_7 where multiplication
16 * modulus g(x) = x^128 + x^127 + x^126 + x^121 + 1.
54 * Performs schoolbook1_iteration on two lists of 128-bit polynomials of length
66 * Computes the product of two 128-bit polynomials at the memory locations
128 * Computes the 128-bit reduction of PH : PL. Stores the result in dest.
131 * x^128 + x^127 + x^126 + x^121 + 1.
133 * We have a 256-bit polynomial PH : PL = P_3 : P_2 : P_1 : P_0 that is the
134 * product of two 128-bit polynomials in Montgomery form. We need to reduce it
136 * of x^128, this product has two extra factors of x^128. To get it back into
[all …]
|
| /linux/lib/crypto/arm64/ |
| H A D | polyval-ce-core.S | 9 * It works on 8 blocks at a time, by precomputing the first 8 keys powers h^8,
14 * than 128. We then compute p(x) = h^8m_0 + ... + h^1m_7 where multiplication
18 * modulus g(x) = x^128 + x^127 + x^126 + x^121 + 1.
65 .arch armv8-a+crypto
72 * Computes the product of two 128-bit polynomials in X and Y and XORs the
154 * Computes the 128-bit reduction of PH : PL. Stores the result in dest.
157 * x^128 + x^127 + x^126 + x^121 + 1.
159 * We have a 256-bit polynomial PH : PL = P_3 : P_2 : P_1 : P_0 that is the
160 * product of two 128-bit polynomials in Montgomery form. We need to reduce it
162 * of x^128, this product has two extra factors of x^128. To get it back into
[all …]
|
| /linux/arch/arm/nwfpe/ |
| H A D | softfloat-macros | 12 of this code was written as part of a project to build a fixed-point vector
34 Shifts `a' right by the number of bits given in `count'. If any nonzero
38 result will be either 0 or 1, depending on whether `a' is zero or nonzero.
42 INLINE void shift32RightJamming( bits32 a, int16 count, bits32 *zPtr )
46 z = a;
49 z = ( a>>count ) | ( ( a<<( ( - count ) & 31 ) ) != 0 );
52 z = ( a != 0 );
59 Shifts `a' right by the number of bits given in `count'. If any nonzero
63 result will be either 0 or 1, depending on whether `a' is zero or nonzero.
67 INLINE void shift64RightJamming( bits64 a, int16 count, bits64 *zPtr )
[all …]
|
| /linux/Documentation/networking/devlink/ |
| H A D | devlink-resource.rst | 8 can allow administrators to see the device restrictions for a given
16 rules for a given device.
22 current size and related sub resources. To access a sub resource, you
38 - A limited capacity of physical ports that the switch ASIC can support
51 name linear size 98304 occ 0 unit entry size_min 0 size_max 147456 size_gran 128
52 name hash_double size 60416 unit entry size_min 32768 size_max 180224 size_gran 128
53 name hash_single size 87040 unit entry size_min 65536 size_max 212992 size_gran 128
71 … name linear size 98304 size_new 147456 occ 0 unit entry size_min 0 size_max 147456 size_gran 128
72 name hash_double size 60416 unit entry size_min 32768 size_max 180224 size_gran 128
73 name hash_single size 87040 unit entry size_min 65536 size_max 212992 size_gran 128
[all …]
|
| /linux/lib/crc/arm64/ |
| H A D | crc-t10dif-core.S | 27 // This software is available to you under a choice of one of two
52 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
72 .arch armv8-a+crypto
104 * where each vector element is a byte, ordered from least to most
132 * a := { w0*x0, w0*x2, w0*x4, w0*x6 }, { y0*z0, y0*z2, y0*z4, y0*z6 }
210 // For sizes less than 256 bytes, we can't fold 128 bytes at a time.
216 // Load the first 128 data bytes. Byte swapping is necessary to make
245 // Load the constants for folding across 128 bytes.
248 // Subtract 128 for the 128 data bytes just consumed. Subtract another
249 // 128 to simplify the termination condition of the following loop.
[all …]
|
| /linux/lib/crc/x86/ |
| H A D | crc-pclmul-template.S | 22 // Emit a VEX (or EVEX) coded instruction if allowed, or emulate it using the
30 // \insn gives the instruction without a "v" prefix and including any immediate
76 // Broadcast an aligned 128-bit mem operand to all 128-bit lanes of a vector
89 // is msb-first use \bswap_mask to reflect the bytes within each 128-bit lane.
126 // Multiply the given \src1_terms of each 128-bit lane of \src1 by the given
127 // \src2_terms of each 128-bit lane of \src2, and write the result(s) to \dst.
135 // byte-reflection is needed; otherwise it must be a vector register. \consts
136 // is a vector register containing the needed fold constants, and \tmp is a
150 // unaligned mem operand, \consts is a vector register containing the needed
151 // fold constants, \bswap_mask is a vector register containing the
[all …]
|
| /linux/tools/testing/selftests/net/forwarding/ |
| H A D | ip6gre_custom_multipath_hash.sh | 7 # policy, SW2 will only look at the outer IP addresses, hence only a single
108 __simple_if_init g1 v$ol1 2001:db8:3::1/128
109 ip route add vrf v$ol1 2001:db8:3::2/128 via 2001:db8:10::2
120 ip route del vrf v$ol1 2001:db8:3::2/128
121 __simple_if_fini g1 2001:db8:3::1/128
135 ip -6 route add vrf v$ul21 2001:db8:3::1/128 via 2001:db8:10::1
136 ip -6 route add vrf v$ul21 2001:db8:3::2/128 \
143 ip -6 route del vrf v$ul21 2001:db8:3::2/128
144 ip -6 route del vrf v$ul21 2001:db8:3::1/128
159 ip -6 route add vrf v$ul31 2001:db8:3::2/128 vi
[all...] |
| /linux/tools/testing/selftests/bpf/progs/ |
| H A D | uninit_stack.c | 7 /* Read an uninitialized value from stack at a fixed offset */
13 /* force stack depth to be 128 */ \ in read_uninit_stack_fixed_off()
14 *(u64*)(r10 - 128) = r1; \ in read_uninit_stack_fixed_off()
23 /* read from a spill of a wrong size, it is a separate \ in read_uninit_stack_fixed_off()
34 /* Read an uninitialized value from stack at a variable offset */
43 /* give r0 a range [-31, -1] */ \ in read_uninit_stack_var_off()
60 /* Pass a pointer to uninitialized stack memory to a helper.
68 /* force stack depth to be 128 */ \ in helper_uninit_to_misc()
69 *(u64*)(r10 - 128) = r1; \ in helper_uninit_to_misc()
71 r1 += -128; \ in helper_uninit_to_misc()
|
| /linux/drivers/infiniband/hw/hfi1/ |
| H A D | qsfp.c | 44 /* do a read to force the write into the chip */ in hfi1_setsda()
68 /* do a read to force the write into the chip */ in hfi1_setscl()
369 * Set the qsfp page based on a zero-based address in qsfp_write()
370 * and a page size of QSFP_PAGESIZE bytes. in qsfp_write()
376 /* QSFPs require a 5-10msec delay after write operations */ in qsfp_write()
393 /* QSFPs require a 5-10msec delay after write operations */ in qsfp_write()
429 * Set the qsfp page based on a zero-based address in qsfp_read()
430 * and a page size of QSFP_PAGESIZE bytes. in qsfp_read()
435 /* QSFPs require a 5-10msec delay after write operations */ in qsfp_read()
465 * Perform a stand-alone single QSFP read. Acquire the resource, do the
[all …]
|
| /linux/tools/perf/pmu-events/arch/x86/pantherlake/ |
| H A D | floating-point.json | 69 …"BriefDescription": "Counts number of SSE/AVX computational 128-bit packed double precision floati…
72 "EventName": "FP_ARITH_OPS_RETIRED.128B_PACKED_DOUBLE",
73 …"PublicDescription": "Number of SSE/AVX computational 128-bit packed double precision floating-poi…
79 …"BriefDescription": "Number of SSE/AVX computational 128-bit packed single precision floating-poin…
82 "EventName": "FP_ARITH_OPS_RETIRED.128B_PACKED_SINGLE",
83 …"PublicDescription": "Number of SSE/AVX computational 128-bit packed single precision floating-poi…
109 …"BriefDescription": "Number of SSE/AVX computational 128-bit packed single and 256-bit packed doub…
113 …"PublicDescription": "Number of SSE/AVX computational 128-bit packed single precision and 256-bit …
207 …etired instructions whose sources are a packed 128 bit double precision floating point. This may b…
210 "EventName": "FP_INST_RETIRED.128B_DP",
[all …]
|
| /linux/tools/testing/selftests/mm/ |
| H A D | virtual_address_range.c | |
| /linux/lib/crypto/ |
| H A D | polyval.c | 16 * interprets the message as the coefficients of a polynomial in GF(2^128) and
17 * evaluates that polynomial at a secret point. POLYVAL has a simple
18 * mathematical relationship with GHASH, but it uses a better field convention
21 * POLYVAL is not a cryptographic hash function, and it should be used only by
30 * This file provides a library API for POLYVAL. This API can delegate to
31 * either a generic implementation or an architecture-optimized implementation.
34 * to GF(2^128) multiplication. That approach is not constant-time and requires
35 * a lot of memory. Instead, we use a different approach which emulates
40 * "holes" trick and a presentation by Shay Gueron
42 * 256-bit => 128-bit reduction algorithm.
[all …]
|
| /linux/tools/testing/selftests/drivers/net/mlxsw/ |
| H A D | fib_offload.sh | 20 simple_if_init $tor1_p1 2001:db8:1::2/128 2001:db8:1::3/128
25 simple_if_fini $tor1_p1 2001:db8:1::2/128 2001:db8:1::3/128
30 simple_if_init $tor2_p1 2001:db8:2::2/128 2001:db8:2::3/128
35 simple_if_fini $tor2_p1 2001:db8:2::2/128 2001:db8:2::3/128
78 # Add a prefix route and check that it is offloaded.
101 # Delete the routes and add the same route with a different nexthop
116 # Add a multipath route and check that it is offloaded.
138 # Append a nexthop with an higher metric and check that the offload
147 # Prepend a nexthop with a lower metric and check that it is offloaded
188 # Replace multipath route with prefix route. A prefix route cannot
[all …]
|
| /linux/crypto/ |
| H A D | Kconfig | 32 required if you want the system to operate in a FIPS 200
222 This converts an arbitrary crypto algorithm into a parallel
231 This is a generic software asynchronous crypto daemon that
233 into an asynchronous algorithm that executes in a kernel thread.
367 Rijndael appears to be consistently a very good performer in
368 both hardware and software across a wide range of computing
376 The AES specifies three key sizes: 128, 192 and 256 bits
385 Anubis is a variable key length cipher which can use keys from
386 128 bits to 320 bits in length. It was evaluated as a entrant
398 ARIA is a standard encryption algorithm of the Republic of Korea.
[all …]
|