Home
last modified time | relevance | path

Searched +full:128 +full:a (Results 1 – 25 of 1129) sorted by relevance

12345678910>>...46

/Linux-v6.1/arch/sparc/kernel/
Dhead_64.S99 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-v6.1/fs/btrfs/tests/
Dfree-space-tests.c99 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-v6.1/Documentation/admin-guide/device-mapper/
Ddm-service-time.rst5 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 …]
Ddm-queue-length.rst5 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
Ddm-dust.rst8 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-v6.1/arch/arm/crypto/
Dcrct10dif-ce-core.S24 // 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
141 vld1.64 {FOLD_CONSTS}, [fold_consts_ptr, :128]!
159 // For sizes less than 256 bytes, we can't fold 128 bytes at a time.
165 // Load the first 128 data bytes. Byte swapping is necessary to make
193 // Load the constants for folding across 128 bytes.
194 vld1.64 {FOLD_CONSTS}, [fold_consts_ptr, :128]!
196 // Subtract 128 for the 128 data bytes just consumed. Subtract another
197 // 128 to simplify the termination condition of the following loop.
[all …]
Dcrc32-ce-core.S21 * 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
134 vld1.8 {q1-q2}, [BUF, :128]!
135 vld1.8 {q3-q4}, [BUF, :128]!
160 vld1.8 {q5}, [BUF, :128]!
[all …]
/Linux-v6.1/arch/x86/crypto/
Dcrct10dif-pcl-asm_64.S12 # This software is available to you under a choice of one of two
37 # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
102 # For sizes less than 256 bytes, we can't fold 128 bytes at a time.
106 # Load the first 128 data bytes. Byte swapping is necessary to make the
116 add $128, buf
133 # Subtract 128 for the 128 data bytes just consumed. Subtract another
134 # 128 to simplify the termination condition of the following loop.
137 # While >= 128 data bytes remain (not counting xmm0-7), fold the 128
144 add $128, buf
145 sub $128, len
[all …]
/Linux-v6.1/drivers/s390/crypto/
Dzcrypt_cex2a.h42 /* Mod-Exp, with a small modulus */
47 unsigned char exponent[128];
48 unsigned char modulus[128];
49 unsigned char message[128];
52 /* Mod-Exp, with a large modulus */
62 /* Mod-Exp, with a larger modulus */
72 /* CRT, with a small modulus */
82 unsigned char message[128];
85 /* CRT, with a large modulus */
90 unsigned char p[128];
[all …]
/Linux-v6.1/drivers/media/test-drivers/vidtv/
Dvidtv_s302m.c3 * 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-v6.1/tools/testing/selftests/net/
Dbareudp.sh13 # * 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-v6.1/tools/testing/selftests/bpf/
Dtest_lwt_ip_encap.sh20 # a GRE device is installed in NS3 with IPv*_GRE, and
26 # 1. routes NS2->IPv*_DST are brought down, so the only way a ping
29 # 2a. in an egress test, a bpf LWT_XMIT program is installed on veth1
35 # 2b. in an ingress test, a bpf LWT_IN program is installed on veth2
171 ip -netns ${NS1} -6 addr add ${IPv6_1}/128 nodad dev veth1
172 ip -netns ${NS2} -6 addr add ${IPv6_2}/128 nodad dev veth2
173 ip -netns ${NS2} -6 addr add ${IPv6_3}/128 nodad dev veth3
174 ip -netns ${NS3} -6 addr add ${IPv6_4}/128 nodad dev veth4
181 ip -netns ${NS1} -6 addr add ${IPv6_5}/128 nodad dev veth5
182 ip -netns ${NS2} -6 addr add ${IPv6_6}/128 nodad dev veth6
[all …]
/Linux-v6.1/arch/ia64/lib/
Dcopy_page_mck.S17 * - avoid l2 bank-conflicts by not storing into the same 16-byte bank within a single
21 * First, note that L1 has a line-size of 64 bytes and L2 a line-size of 128 bytes.
22 * To avoid secondary misses in L2, we prefetch both source and destination with a line-size
23 * of 128 bytes. When both of these lines are in the L2 and the first half of the
28 * We use a software-pipelined loop to control the overall operation. The pipeline
32 * the prefetches. The four relevant points in the pipelined are called A, B, C, D:
33 * p[A] is TRUE if a source-line should be prefetched, p[B] is TRUE if a destination-line
35 * into L1D and p[D] is TRUE if a cacheline needs to be copied.
40 * As a secondary optimization, the first 2*PREFETCH_DIST iterations are implemented
52 * | t6 | t7 | | 128 bytes
[all …]
/Linux-v6.1/Documentation/networking/devlink/
Ddevlink-resource.rst8 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-v6.1/arch/arm64/crypto/
Dcrct10dif-ce-core.S24 // This software is available to you under a choice of one of two
49 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
69 .arch armv8-a+crypto
141 pmull t8.8h, ad.8b, bd1.8b // E = A*B1
143 pmull t7.8h, ad.8b, bd2.8b // G = A*B2
145 pmull t9.8h, ad.8b, bd3.8b // I = A*B3
146 pmull t3.8h, ad.8b, bd4.8b // K = A*B4
155 pmull2 t8.8h, ad.16b, bd1.16b // E = A*B1
157 pmull2 t7.8h, ad.16b, bd2.16b // G = A*B2
159 pmull2 t9.8h, ad.16b, bd3.16b // I = A*B3
[all …]
/Linux-v6.1/Documentation/devicetree/bindings/mtd/
Djedec,spi-nor.yaml21 (m25p(40|80|16|32|64|128)|\
22 n25q(32b|064|128a11|128a13|256a|512a|164k)))|\
23 atmel,at25df(321a|641|081a)|\
24 everspin,mr25h(10|40|128|256)|\
25 (mxicy|macronix),mx25l(4005a|1606e|6405d|8005|12805d|25635e)|\
27 (spansion,)?s25fl(128s|256s1|512s|008k|064k|164k)|\
32 (winbond,)?w25q(16|32(w|dw)?|64(dw)?|80bl|128(fw)?|256))$"
65 addressing) which need to be managed carefully by a system. Because these
66 sorts of flash don't have a standardized software reset command, and
70 be used on such systems, to denote the absence of a reliable reset
/Linux-v6.1/arch/arm/nwfpe/
Dsoftfloat-macros12 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-v6.1/Documentation/leds/
Dleds-class-multicolor.rst49 A user first writes the multi_intensity file with the brightness levels
50 for each LED that are necessary to achieve a certain color output from a
69 global 'brightness' control. Assuming a max_brightness of 255 the user
70 may want to dim the LED color group to half. The user would write a value of
71 128 to the global brightness file then the values written to each LED will be
76 echo 128 > /sys/class/leds/multicolor:status/brightness
78 adjusted_red_value = 128 * 138/255 = 69
79 adjusted_green_value = 128 * 43/255 = 21
80 adjusted_blue_value = 128 * 226/255 = 113
86 128
/Linux-v6.1/tools/testing/selftests/net/forwarding/
Dip6gre_custom_multipath_hash.sh7 # 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 via 2001:db8:13::2
[all …]
/Linux-v6.1/drivers/infiniband/hw/hfi1/
Dqsfp.c44 /* 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()
408 * Perform a stand-alone single QSFP write. Acquire the resource, do the
449 * Set the qsfp page based on a zero-based address in qsfp_read()
450 * and a page size of QSFP_PAGESIZE bytes. in qsfp_read()
455 /* QSFPs require a 5-10msec delay after write operations */ in qsfp_read()
[all …]
/Linux-v6.1/arch/mips/lib/
Dmulti3.c15 static inline long long notrace dmulu(long long a, long long b) in dmulu() argument
19 asm ("dmulu %0,%1,%2" : "=r" (res) : "r" (a), "r" (b)); in dmulu()
23 /* multiply 64-bit unsigned values, high 64-bits of 128-bit result returned */
24 static inline long long notrace dmuhu(long long a, long long b) in dmuhu() argument
28 asm ("dmuhu %0,%1,%2" : "=r" (res) : "r" (a), "r" (b)); in dmuhu()
32 /* multiply 128-bit values, low 128-bits returned */
33 ti_type notrace __multi3(ti_type a, ti_type b) in __multi3() argument
37 aa.ti = a; in __multi3()
41 * a * b = (a.lo * b.lo) in __multi3()
42 * + 2^64 * (a.hi * b.lo + a.lo * b.hi) in __multi3()
[all …]
/Linux-v6.1/drivers/net/wireguard/selftest/
Dallowedips.c3 * 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 = prandom_u32_max(128) + 1; in randomized_test()
347 mutate_amount = prandom_u32_max(128); in randomized_test()
358 cidr = prandom_u32_max(128) + 1; in randomized_test()
379 print_tree(t.root6, 128); in randomized_test()
[all …]
/Linux-v6.1/drivers/input/misc/
Dyealink.h40 * data[0] on return returns the key number, if it changes there's a new
138 /* _SEG( type a b c d e g f ) */
180 _SEG('8', 22,16, 22,32, 22,64, 22,128, 23,128, 23,64, 23,32 ),
181 _SEG('8', 20,16, 20,32, 20,64, 20,128, 21,128, 21,64, 21,32 ),
182 _SEG('8', 18,16, 18,32, 18,64, 18,128, 19,128, 19,64, 19,32 ),
183 _SEG('8', 16,16, 16,32, 16,64, 16,128, 17,128, 17,64, 17,32 ),
184 _SEG('8', 14,16, 14,32, 14,64, 14,128, 15,128, 15,64, 15,32 ),
185 _SEG('8', 12,16, 12,32, 12,64, 12,128, 13,128, 13,64, 13,32 ),
186 _SEG('8', 10,16, 10,32, 10,64, 10,128, 11,128, 11,64, 11,32 ),
187 _SEG('8', 8,16, 8,32, 8,64, 8,128, 9,128, 9,64, 9,32 ),
[all …]
/Linux-v6.1/tools/testing/selftests/drivers/net/mlxsw/
Dfib_offload.sh20 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-v6.1/net/ipv4/
Dtcp_hybla.c6 * C.Caini, R.Firrincieli, "TCP-Hybla: A TCP Enhancement
78 128, 139, 152, 165, 181, 197, 215, 234, in hybla_fraction()
81 return (odds < ARRAY_SIZE(fractions)) ? fractions[odds] : 128; in hybla_fraction()
87 * o Give cwnd a new value based on the model proposed
121 * into 2 parts: an integer part and a fraction part. in hybla_cong_avoid()
128 * calculate 2^fract in a <<7 value. in hybla_cong_avoid()
132 hybla_fraction(rho_fractions)) - 128; in hybla_cong_avoid()
141 if (increment < 128) in hybla_cong_avoid()
145 odd = increment % 128; in hybla_cong_avoid()
149 /* check when fractions goes >=128 and increase cwnd by 1. */ in hybla_cong_avoid()
[all …]

12345678910>>...46