Home
last modified time | relevance | path

Searched +full:5 +full:k (Results 1 – 25 of 1210) sorted by relevance

12345678910>>...49

/linux-6.12.1/drivers/ata/pata_parport/
Don26.c30 w2(5); w2(0xd); w2(5); w2(0xd); w2(5); w2(4); \
35 w2(5); w2(7); w2(5); w2(4); \
63 w3(1); w3(1); w2(5); w4(r); w2(4); in on26_read_regr()
85 w3(1); w3(1); w2(5); w4(r); w2(4); in on26_write_regr()
87 w2(5); w4(val); w2(4); in on26_write_regr()
88 w2(5); w4(val); w2(4); in on26_write_regr()
97 w2(4); w2(5); w2(4); w0(0xff); \
141 pi->delay = 5; in on26_test_port()
151 w0(0x20); w2(4); w2(5); in on26_test_port()
188 return 5; in on26_test_port()
[all …]
Ddstr.c29 #define P1 w2(5);w2(0xd);w2(5);w2(4);
30 #define P2 w2(5);w2(7);w2(5);w2(4);
83 w0(val); w2(5); w2(7); w2(5); w2(4); in dstr_write_regr()
98 w0(x); w2(5); w2(4); \
117 int k, a, b; in dstr_read_block() local
128 for (k = 0; k < count; k++) { in dstr_read_block()
131 buf[k] = j44(a, b); in dstr_read_block()
136 for (k = 0; k < count; k++) { in dstr_read_block()
138 buf[k] = r0(); in dstr_read_block()
145 for (k = 0; k < count; k++) in dstr_read_block()
[all …]
Dkbic.c47 w0(regr|0x38 | s); w2(4); w2(6); w2(4); w2(5); w0(8); in kbic_read_regr()
56 case 5: in kbic_read_regr()
74 w0(val); w2(5); w2(4); in kbic_write_regr()
78 case 5: in kbic_write_regr()
128 int k, a, b; in kbic_read_block() local
133 for (k = 0; k < count / 2; k++) { in kbic_read_block()
138 buf[2 * k] = j44(a, b); in kbic_read_block()
139 w2(5); in kbic_read_block()
143 buf[2 * k + 1] = j44(a, b); in kbic_read_block()
149 for (k = 0; k < count / 4; k++) { in kbic_read_block()
[all …]
Depia.c23 * 1 5/3 reads on ports 1 & 2, 8-bit writes
27 * 5 32-bit EPP
54 w2(3); w2(5); w0(r | 0xf0); in epia_read_regr()
64 case 5: in epia_read_regr()
87 case 5: in epia_write_regr()
129 int k, ph, a, b; in epia_read_block() local
135 for (k = 0; k < count; k++) { in epia_read_block()
138 buf[k] = j44(a, b); in epia_read_block()
145 w0(0x51); w2(5); w0(0xd1); in epia_read_block()
147 for (k = 0; k < count; k++) { in epia_read_block()
[all …]
Dfrpw.c53 w2(5); w2(7); w2(5); w2(4); in frpw_write_regr()
59 int h, l, k, ph; in frpw_read_block_int() local
64 for (k = 0; k < count; k++) { in frpw_read_block_int()
67 buf[k] = j44(l, h); in frpw_read_block_int()
76 for (k = 0; k < count; k++) { in frpw_read_block_int()
78 buf[k] = r0(); in frpw_read_block_int()
86 for (k = 0; k < count; k++) in frpw_read_block_int()
87 buf[k] = r4(); in frpw_read_block_int()
94 for (k = 0; k < count - 2; k++) in frpw_read_block_int()
95 buf[k] = r4(); in frpw_read_block_int()
[all …]
Dfriq.c66 w2(5); w2(7); w2(5); w2(4); in friq_write_regr()
71 int h, l, k, ph; in friq_read_block_int() local
76 for (k = 0; k < count; k++) { in friq_read_block_int()
79 buf[k] = j44(l, h); in friq_read_block_int()
87 for (k = 0; k < count; k++) { in friq_read_block_int()
89 buf[k] = r0(); in friq_read_block_int()
96 for (k = 0; k < count - 2; k++) in friq_read_block_int()
97 buf[k] = r4(); in friq_read_block_int()
105 for (k = 0; k < count / 2 - 1; k++) in friq_read_block_int()
106 ((u16 *)buf)[k] = r4w(); in friq_read_block_int()
[all …]
Depat.c49 case 5: in epat_write_regr()
77 case 5: in epat_read_regr()
87 int k, ph, a, b; in epat_read_block() local
94 for (k = 0; k < count; k++) { in epat_read_block()
95 if (k == count-1) in epat_read_block()
103 buf[k] = j44(a, b); in epat_read_block()
110 w0(0x47); w2(1); w2(5); w0(0xff); in epat_read_block()
112 for (k = 0; k < count; k++) { in epat_read_block()
113 if (k == count - 1) in epat_read_block()
117 buf[k] = j53(a, b); in epat_read_block()
[all …]
Dcomm.c27 #define P1 w2(5);w2(0xd);w2(0xd);w2(5);w2(4);
28 #define P2 w2(5);w2(7);w2(7);w2(5);w2(4);
145 int k; in comm_write_block() local
151 for (k = 0; k < count; k++) { in comm_write_block()
152 w2(5); in comm_write_block()
153 w0(buf[k ^ 1]); in comm_write_block()
156 w2(5); w2(4); in comm_write_block()
160 for (k = 0; k < count; k++) in comm_write_block()
161 w4(buf[k ^ 1]); in comm_write_block()
165 for (k = 0; k < count / 2; k++) in comm_write_block()
[all …]
Dfit2.c40 w2(0xc); w0(regr); w2(4); w0(val); w2(5); w0(0); w2(4); in fit2_write_regr()
55 w2(0xc); w0(r); w2(4); w2(5); in fit2_read_regr()
65 int k, a, b, c, d; in fit2_read_block() local
69 for (k = 0; k < count / 4; k++) { in fit2_read_block()
70 w2(4); w2(5); in fit2_read_block()
73 buf[4 * k + 0] = j44(a, b); in fit2_read_block()
74 buf[4 * k + 1] = j44(d, c); in fit2_read_block()
76 w2(4); w2(5); in fit2_read_block()
79 buf[4 * k + 2] = j44(d, c); in fit2_read_block()
80 buf[4 * k + 3] = j44(a, b); in fit2_read_block()
[all …]
Don20.c20 w2(4); w0(f); w2(5); w2(0xd); \
21 w2(5); w2(0xd); w2(5); w2(4); \
26 w2(4); w0(v); w2(5); \
27 w2(7); w2(5); w2(4); \
91 int k, l, h; in on20_read_block() local
95 for (k = 0; k < count; k++) { in on20_read_block()
97 w2(4); w2(0x26); buf[k] = r0(); in on20_read_block()
101 buf[k] = j44(l, h); in on20_read_block()
109 int k; in on20_write_block() local
113 for (k = 0; k < count; k++) { in on20_write_block()
[all …]
/linux-6.12.1/tools/lib/
Dlist_sort.c50 __attribute__((nonnull(2,3,4,5)))
119 * 2:1 balanced merges. Given two pending sublists of size 2^k, they are
120 * merged to a size-2^(k+1) list as soon as we have 2^k following elements.
122 * Thus, it will avoid cache thrashing as long as 3*2^k elements can
131 * Each time we increment "count", we set one bit (bit k) and clear
132 * bits k-1 .. 0. Each time this happens (except the very first time
133 * for each bit, when count increments to 2^k), we merge two lists of
134 * size 2^k into one list of size 2^(k+1).
137 * 2^k, which is when we have 2^k elements pending in smaller lists,
138 * so it's safe to merge away two lists of size 2^k.
[all …]
/linux-6.12.1/lib/
Dlist_sort.c51 __attribute__((nonnull(2,3,4,5)))
130 * 2:1 balanced merges. Given two pending sublists of size 2^k, they are
131 * merged to a size-2^(k+1) list as soon as we have 2^k following elements.
133 * Thus, it will avoid cache thrashing as long as 3*2^k elements can
142 * Each time we increment "count", we set one bit (bit k) and clear
143 * bits k-1 .. 0. Each time this happens (except the very first time
144 * for each bit, when count increments to 2^k), we merge two lists of
145 * size 2^k into one list of size 2^(k+1).
148 * 2^k, which is when we have 2^k elements pending in smaller lists,
149 * so it's safe to merge away two lists of size 2^k.
[all …]
/linux-6.12.1/crypto/
Dserpent_generic.c25 ({ b ^= d; b ^= c; b ^= a; b ^= PHI ^ i; b = rol32(b, 11); k[j] = b; })
28 ({ x0 = k[i]; x1 = k[i+1]; x2 = k[i+2]; x3 = k[i+3]; })
31 ({ k[i] = x0; k[i+1] = x1; k[i+2] = x2; k[i+3] = x3; })
36 #define K(x0, x1, x2, x3, i) ({ \ macro
37 x3 ^= k[4*(i)+3]; x2 ^= k[4*(i)+2]; \
38 x1 ^= k[4*(i)+1]; x0 ^= k[4*(i)+0]; \
48 x0 ^= x3; x2 ^= x4; x3 ^= k[4*i+3]; \
49 x1 ^= k[4*i+1]; x0 = rol32(x0, 5); x2 = rol32(x2, 22);\
50 x0 ^= k[4*i+0]; x2 ^= k[4*i+2]; \
54 x0 ^= k[4*i+0]; x1 ^= k[4*i+1]; x2 ^= k[4*i+2]; \
[all …]
Dwp512.c784 u64 K[8]; /* the round key */ in wp512_process_buffer() local
793 state[0] = block[0] ^ (K[0] = wctx->hash[0]); in wp512_process_buffer()
794 state[1] = block[1] ^ (K[1] = wctx->hash[1]); in wp512_process_buffer()
795 state[2] = block[2] ^ (K[2] = wctx->hash[2]); in wp512_process_buffer()
796 state[3] = block[3] ^ (K[3] = wctx->hash[3]); in wp512_process_buffer()
797 state[4] = block[4] ^ (K[4] = wctx->hash[4]); in wp512_process_buffer()
798 state[5] = block[5] ^ (K[5] = wctx->hash[5]); in wp512_process_buffer()
799 state[6] = block[6] ^ (K[6] = wctx->hash[6]); in wp512_process_buffer()
800 state[7] = block[7] ^ (K[7] = wctx->hash[7]); in wp512_process_buffer()
804 L[0] = C0[(int)(K[0] >> 56) ] ^ in wp512_process_buffer()
[all …]
Dsm3.c15 static const u32 ____cacheline_aligned K[64] = { variable
81 f = sctx->state[5]; in sm3_transform()
85 R1(a, b, c, d, e, f, g, h, K[0], I(0), I(4)); in sm3_transform()
86 R1(d, a, b, c, h, e, f, g, K[1], I(1), I(5)); in sm3_transform()
87 R1(c, d, a, b, g, h, e, f, K[2], I(2), I(6)); in sm3_transform()
88 R1(b, c, d, a, f, g, h, e, K[3], I(3), I(7)); in sm3_transform()
89 R1(a, b, c, d, e, f, g, h, K[4], W1(4), I(8)); in sm3_transform()
90 R1(d, a, b, c, h, e, f, g, K[5], W1(5), I(9)); in sm3_transform()
91 R1(c, d, a, b, g, h, e, f, K[6], W1(6), I(10)); in sm3_transform()
92 R1(b, c, d, a, f, g, h, e, K[7], W1(7), I(11)); in sm3_transform()
[all …]
/linux-6.12.1/include/uapi/linux/
Dkeyboard.h13 #define KG_SHIFTR 5
34 #define KT_CONS 5
45 #define K(t,v) (((t)<<8)|(v)) macro
49 #define K_F1 K(KT_FN,0)
50 #define K_F2 K(KT_FN,1)
51 #define K_F3 K(KT_FN,2)
52 #define K_F4 K(KT_FN,3)
53 #define K_F5 K(KT_FN,4)
54 #define K_F6 K(KT_FN,5)
55 #define K_F7 K(KT_FN,6)
[all …]
/linux-6.12.1/tools/testing/selftests/tc-testing/tc-tests/actions/
Dpolice.json20 "cmdUnderTest": "$TC actions add action police rate 1kbit burst 10k index 1",
46 "$TC actions add action police rate 4Mbit burst 120k index 9"
48 "cmdUnderTest": "$TC actions add action police rate 8kbit burst 24k index 9",
75 "cmdUnderTest": "$TC actions add action police rate 90kbit burst 10k mtu 1k index 98",
102 …"cmdUnderTest": "$TC actions add action police rate 90kbit burst 10k mtu 2kb peakrate 100kbit inde…
129 … "cmdUnderTest": "$TC actions add action police rate 5kbit burst 6kb peakrate 10kbit index 9",
132 "matchPattern": "action order [0-9]*: police 0x9 rate 5Kb burst 10Kb",
156 "cmdUnderTest": "$TC actions add action police rate 1mbit burst 100k overhead 64 index 64",
183 … "cmdUnderTest": "$TC actions add action police rate 2mbit burst 200k linklayer ethernet index 8",
210 "cmdUnderTest": "$TC actions add action police rate 2mbit burst 200k linklayer atm index 8",
[all …]
/linux-6.12.1/net/ceph/
Dceph_hash.c17 c = c - a; c = c - b; c = c ^ (b >> 5); \
25 const unsigned char *k = (const unsigned char *)str; in ceph_str_hash_rjenkins() local
37 a = a + (k[0] + ((__u32)k[1] << 8) + ((__u32)k[2] << 16) + in ceph_str_hash_rjenkins()
38 ((__u32)k[3] << 24)); in ceph_str_hash_rjenkins()
39 b = b + (k[4] + ((__u32)k[5] << 8) + ((__u32)k[6] << 16) + in ceph_str_hash_rjenkins()
40 ((__u32)k[7] << 24)); in ceph_str_hash_rjenkins()
41 c = c + (k[8] + ((__u32)k[9] << 8) + ((__u32)k[10] << 16) + in ceph_str_hash_rjenkins()
42 ((__u32)k[11] << 24)); in ceph_str_hash_rjenkins()
44 k = k + 12; in ceph_str_hash_rjenkins()
52 c = c + ((__u32)k[10] << 24); in ceph_str_hash_rjenkins()
[all …]
/linux-6.12.1/drivers/media/platform/verisilicon/
Dhantro_vp8.c53 u32 i, j, k; in hantro_vp8_prob_update() local
64 dst[5] = hdr->segment.segment_probs[1]; in hantro_vp8_prob_update()
74 dst[5] = entropy->uv_mode_probs[1]; in hantro_vp8_prob_update()
85 dst[5] = entropy->mv_probs[0][9 + 9]; in hantro_vp8_prob_update()
104 dst[5] = entropy->mv_probs[i][5 + 2]; in hantro_vp8_prob_update()
115 for (k = 0; k < 3; ++k) { in hantro_vp8_prob_update()
116 dst[0] = entropy->coeff_probs[i][j][k][0]; in hantro_vp8_prob_update()
117 dst[1] = entropy->coeff_probs[i][j][k][1]; in hantro_vp8_prob_update()
118 dst[2] = entropy->coeff_probs[i][j][k][2]; in hantro_vp8_prob_update()
119 dst[3] = entropy->coeff_probs[i][j][k][3]; in hantro_vp8_prob_update()
[all …]
/linux-6.12.1/drivers/media/usb/pwc/
Dpwc-dec23.c92 int compression_mode, j, k, bit, pw; in build_table_color() local
104 for (k = 0; k < 16; k++) { in build_table_color()
105 if (k == 0) in build_table_color()
107 else if (k >= 1 && k < 3) in build_table_color()
109 else if (k >= 3 && k < 6) in build_table_color()
111 else if (k >= 6 && k < 10) in build_table_color()
113 else if (k >= 10 && k < 13) in build_table_color()
115 else if (k >= 13 && k < 15) in build_table_color()
119 if (k == 0) in build_table_color()
126 p0[k + 0x00] = (1 * pw) + 0x80; in build_table_color()
[all …]
/linux-6.12.1/arch/arm64/crypto/
Daes-ce.S52 .macro do_enc_Nx, de, mc, k, i0, i1, i2, i3, i4
53 aes\de \i0\().16b, \k\().16b
56 aes\de \i1\().16b, \k\().16b
59 aes\de \i2\().16b, \k\().16b
61 aes\de \i3\().16b, \k\().16b
64 aes\de \i4\().16b, \k\().16b
71 /* up to 5 interleaved encryption rounds with the same round key */
72 .macro round_Nx, enc, k, i0, i1, i2, i3, i4
74 do_enc_Nx e, mc, \k, \i0, \i1, \i2, \i3, \i4
76 do_enc_Nx d, imc, \k, \i0, \i1, \i2, \i3, \i4
[all …]
/linux-6.12.1/drivers/md/dm-vdo/
Dmurmurhash3.c22 static __always_inline u64 fmix64(u64 k) in fmix64() argument
24 k ^= k >> 33; in fmix64()
25 k *= 0xff51afd7ed558ccdLLU; in fmix64()
26 k ^= k >> 33; in fmix64()
27 k *= 0xc4ceb9fe1a85ec53LLU; in fmix64()
28 k ^= k >> 33; in fmix64()
30 return k; in fmix64()
63 h1 = h1 * 5 + 0x52dce729; in murmurhash3_128()
72 h2 = h2 * 5 + 0x38495ab5; in murmurhash3_128()
117 k1 ^= ((u64)tail[5]) << 40; in murmurhash3_128()
[all …]
/linux-6.12.1/tools/testing/selftests/bpf/progs/
Dtest_jhash.h39 const unsigned char *k = key; in jhash() local
44 a += *(volatile u32 *)(k); in jhash()
45 b += *(volatile u32 *)(k + 4); in jhash()
46 c += *(volatile u32 *)(k + 8); in jhash()
49 k += 12; in jhash()
52 case 12: c += (u32)k[11]<<24; in jhash()
53 case 11: c += (u32)k[10]<<16; in jhash()
54 case 10: c += (u32)k[9]<<8; in jhash()
55 case 9: c += k[8]; in jhash()
56 case 8: b += (u32)k[7]<<24; in jhash()
[all …]
/linux-6.12.1/drivers/scsi/
Dqlogicfas408.c67 static int qlcfg5 = (XTALFREQ << 5); /* 15625/512 */
71 static int qlcfg9 = ((XTALFREQ + 4) / 5);
188 int k; in ql_wai() local
192 k = 0; in ql_wai()
195 !((k = inb(qbase + 4)) & 0xe0)) { in ql_wai()
203 if (k & 0x60) in ql_wai()
205 if (k & 0x20) in ql_wai()
207 if (k & 0x40) in ql_wai()
229 inb(qbase + 5); /* clear interrupts */ in ql_icmd()
230 if (inb(qbase + 5)) /* if still interrupting */ in ql_icmd()
[all …]
/linux-6.12.1/tools/perf/tests/
Devent_groups.c17 #define NR_UNCORE_PMUS 5
81 static int run_test(int i, int j, int k) in run_test() argument
83 int erroneous = ((((1 << i) | (1 << j) | (1 << k)) & 5) == 5); in run_test()
96 sibling_fd2 = event_open(types[k], configs[k], group_fd); in run_test()
111 int i, j, k; in test__event_groups() local
122 for (k = 0; k < 3; k++) { in test__event_groups()
123 r = run_test(i, j, k); in test__event_groups()
129 types[k], configs[k], r ? "Fail" : "Pass"); in test__event_groups()

12345678910>>...49