Home
last modified time | relevance | path

Searched +full:3 +full:k (Results 1 – 25 of 1261) sorted by relevance

12345678910>>...51

/linux-6.12.1/drivers/ata/pata_parport/
Depia.c23 * 1 5/3 reads on ports 1 & 2, 8-bit writes
25 * 3 8-bit EPP mode
31 #define j53(a, b) (((a >> 3) & 0x1f) + ((b << 4) & 0xe0))
48 w0(r); w2(1); w2(3); w0(r); in epia_read_regr()
54 w2(3); w2(5); w0(r | 0xf0); in epia_read_regr()
62 case 3: in epia_read_regr()
83 w0(r); w2(1); w0(val); w2(3); w2(4); in epia_write_regr()
85 case 3: in epia_write_regr()
99 * some EPP counters ... currently we know about 3 different block
110 if (pi->mode >= 3) { in epia_connect()
[all …]
Depat.c21 #define j53(a, b) (((a >> 3) & 0x1f) + ((b << 4) & 0xe0))
35 static int cont_map[3] = { 0x18, 0x10, 0 };
47 case 3: in epat_write_regr()
64 w0(r); w2(1); w2(3); in epat_read_regr()
75 case 3: in epat_read_regr()
87 int k, ph, a, b; in epat_read_block() local
92 w0(7); w2(1); w2(3); w0(0xff); in epat_read_block()
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()
[all …]
Dkbic.c26 #define j53(w) (((w >> 3) & 0x1f) | ((w >> 4) & 0xe0))
54 case 3: in kbic_read_regr()
76 case 3: 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()
143 buf[2 * k + 1] = j44(a, b); in kbic_read_block()
149 for (k = 0; k < count / 4; k++) { in kbic_read_block()
153 buf[4 * k] = j53(r12w()); in kbic_read_block()
155 buf[4 * k + 1] = j53(r12w()); in kbic_read_block()
[all …]
Ddstr.c22 * 3 EPP-16
26 #define j44(a, b) (((a >> 3) & 0x07) | ((~a >> 4) & 0x08) | \
60 case 3: in dstr_read_regr()
86 case 3: in dstr_write_regr()
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 …]
Dfit3.c23 #define j44(a, b) (((a >> 3) & 0x0f) | ((b << 1) & 0xf0))
35 regr += cont << 3; in fit3_write_regr()
56 regr += cont << 3; in fit3_read_regr()
83 int k, a, b, c, d; in fit3_read_block() local
88 for (k = 0; k < count / 2; k++) { in fit3_read_block()
93 buf[2 * k] = j44(a, b); in fit3_read_block()
94 buf[2 * k + 1] = j44(c, d); in fit3_read_block()
101 for (k = 0; k < count / 2; k++) { in fit3_read_block()
104 buf[2 * k] = a; in fit3_read_block()
105 buf[2 * k + 1] = b; in fit3_read_block()
[all …]
Dfriq.c71 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()
103 case 3: 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 …]
Dktti.c32 w0(r); w2(0xb); w2(0xa); w2(3); w2(6); in ktti_write_regr()
33 w0(val); w2(3); w0(0); w2(6); w2(0xb); in ktti_write_regr()
49 int k, a, b; in ktti_read_block() local
51 for (k = 0; k < count / 2; k++) { in ktti_read_block()
54 buf[2*k] = j44(a, b); in ktti_read_block()
56 buf[2*k+1] = j44(a, b); in ktti_read_block()
62 int k; in ktti_write_block() local
64 for (k = 0; k < count / 2; k++) { in ktti_write_block()
65 w0(0x10); w2(0xb); w2(0xa); w2(3); w2(6); in ktti_write_block()
66 w0(buf[2 * k]); w2(3); in ktti_write_block()
[all …]
/linux-6.12.1/Documentation/admin-guide/media/
Ddvb_intro.rst133 T 177500000 7MHz AUTO AUTO QAM64 8k 1/16 NONE
134 T 184500000 7MHz AUTO AUTO QAM64 8k 1/8 NONE
135 T 191625000 7MHz AUTO AUTO QAM64 8k 1/16 NONE
136 T 219500000 7MHz AUTO AUTO QAM64 8k 1/16 NONE
137 T 226500000 7MHz AUTO AUTO QAM64 8k 1/16 NONE
138 T 557625000 7MHz AUTO AUTO QPSK 8k 1/16 NONE
151 TRANSMISSION_MODE = 8K
176 CODE_RATE_HP = 3/4
177 CODE_RATE_LP = 3/4
179 TRANSMISSION_MODE = 8K
[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/tools/include/linux/
Djhash.h34 /* __jhash_mix -- mix 3 32-bit values reversibly. */
45 /* __jhash_final - final mixing of 3 32-bit values (a,b,c) into c */
61 * @k: sequence of bytes as key
73 const u8 *k = key; in jhash() local
80 a += __get_unaligned_cpu32(k); in jhash()
81 b += __get_unaligned_cpu32(k + 4); in jhash()
82 c += __get_unaligned_cpu32(k + 8); in jhash()
85 k += 12; in jhash()
90 case 12: c += (u32)k[11]<<24; in jhash()
91 case 11: c += (u32)k[10]<<16; in jhash()
[all …]
/linux-6.12.1/include/linux/
Djhash.h34 /* __jhash_mix - mix 3 32-bit values reversibly. */
45 /* __jhash_final - final mixing of 3 32-bit values (a,b,c) into c */
61 * @k: sequence of bytes as key
73 const u8 *k = key; in jhash() local
80 a += __get_unaligned_cpu32(k); in jhash()
81 b += __get_unaligned_cpu32(k + 4); in jhash()
82 c += __get_unaligned_cpu32(k + 8); in jhash()
85 k += 12; in jhash()
89 case 12: c += (u32)k[11]<<24; fallthrough; in jhash()
90 case 11: c += (u32)k[10]<<16; fallthrough; in jhash()
[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]; \
43 x2 = rol32(x2, 3); x1 ^= x0; x4 = x0 << 3; \
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]; \
[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 …]
/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",
30 "id": "3abe",
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 …UnderTest": "$TC actions add action police rate 90kbit burst 10k mtu 2kb peakrate 100kbit index 3",
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",
193 "id": "3dda",
210 "cmdUnderTest": "$TC actions add action police rate 2mbit burst 200k linklayer atm index 8",
[all …]
/linux-6.12.1/include/uapi/linux/
Dkeyboard.h9 #define KG_ALT 3
32 #define KT_PAD 3
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/lib/
Dlist_sort.c14 __attribute__((nonnull(2,3,4)))
50 __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,
[all …]
/linux-6.12.1/drivers/media/platform/verisilicon/
Dhantro_vp8.c18 u8 prob_segment[3];
22 u8 prob_chroma_pred_mode[3];
30 u8 prob_coeffs[4][8][3][V4L2_VP8_COEFF_PROB_CNT];
43 { 3, -16, 77, 77, -16, 3 },
53 u32 i, j, k; in hantro_vp8_prob_update() local
62 dst[3] = hdr->prob_gf; in hantro_vp8_prob_update()
72 dst[3] = entropy->y_mode_probs[3]; in hantro_vp8_prob_update()
83 dst[3] = entropy->mv_probs[1][1]; in hantro_vp8_prob_update()
94 dst[3] = entropy->mv_probs[i][j + 9 + 3]; in hantro_vp8_prob_update()
102 dst[3] = entropy->mv_probs[i][3 + 2]; in hantro_vp8_prob_update()
[all …]
/linux-6.12.1/lib/
Dlist_sort.c15 __attribute__((nonnull(2,3,4)))
51 __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,
[all …]
/linux-6.12.1/net/ceph/
Dceph_hash.c18 a = a - b; a = a - c; a = a ^ (c >> 3); \
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/md/bcache/
Dbcache_ondisk.h12 static inline __u64 name(const type *k) \
13 { return (k->field >> offset) & ~(~0ULL << size); } \
15 static inline void SET_##name(type *k, __u64 v) \
17 k->field &= ~(~(~0ULL << size) << offset); \
18 k->field |= (v & ~(~0ULL << size)) << offset; \
33 static inline __u64 name(const struct bkey *k, unsigned int i) \
34 { return (k->ptr[i] >> offset) & ~(~0ULL << size); } \
36 static inline void SET_##name(struct bkey *k, unsigned int i, __u64 v) \
38 k->ptr[i] &= ~(~(~0ULL << size) << offset); \
39 k->ptr[i] |= (v & ~(~0ULL << size)) << offset; \
[all …]
/linux-6.12.1/drivers/isdn/mISDN/
Ddsp_dtmf.c20 * 2 * cos(2 * PI * k / N) precalculated for all k
24 /* k << 15 (source: hfc-4s/8s documentation (www.colognechip.de)) */
31 {'1', '2', '3', 'A'},
124 int k, n, i; in dsp_dtmf_goertzel_decode() local
158 for (k = 0; k < NCOEFF; k++) { in dsp_dtmf_goertzel_decode()
165 /* compute |X(k)|**2 */ in dsp_dtmf_goertzel_decode()
166 result[k] = in dsp_dtmf_goertzel_decode()
168 (((cos2pik[k] * sk) >> 15) * sk2) + in dsp_dtmf_goertzel_decode()
184 for (k = 0; k < NCOEFF; k++) { in dsp_dtmf_goertzel_decode()
189 cos2pik_ = cos2pik[k]; in dsp_dtmf_goertzel_decode()
[all …]
/linux-6.12.1/fs/btrfs/tests/
Dextent-map-tests.c50 * extent [0, 16K), followed by another file extent [16K, 20K), two dio reads
51 * are entering btrfs_get_extent() concurrently, t1 is reading [8K, 16K), t2 is
52 * reading [0, 8K)
57 * -> add_extent_mapping(0, 16K)
59 * ->add_extent_mapping(0, 16K)
77 /* Add [0, 16K) */ in test_case_1()
87 test_err("cannot add extent range [0, 16K)"); in test_case_1()
92 /* Add [16K, 20K) following [0, 16K) */ in test_case_1()
109 test_err("cannot add extent range [16K, 20K)"); in test_case_1()
121 /* Add [0, 8K), should return [0, 16K) instead. */ in test_case_1()
[all …]
/linux-6.12.1/sound/soc/codecs/
Drl6231.c38 case 3: in rl6231_get_pre_div()
68 * 1MHz - 3MHz range.
72 static const int div[] = {2, 3, 4, 6, 8, 12}; in rl6231_calc_dmic_clk()
81 if ((div[i] % 3) == 0) in rl6231_calc_dmic_clk()
96 int k; member
105 {19200000, 24576000, 3, 30, 3, false, false},
107 {3840000, 24576000, 3, 30, 0, true, false},
108 {3840000, 22579200, 3, 5, 0, true, false},
131 * rl6231_pll_calc - Calcualte PLL M/N/K code.
134 * @pll_code: Pointer to structure with M, N, K, m_bypass and k_bypass flag.
[all …]
/linux-6.12.1/drivers/input/joystick/
Dtmdc.c32 #define TMDC_MODE_3DRP 3
45 static const unsigned char tmdc_byte_a[16] = { 0, 1, 3, 4, 6, 7 };
83 { 1, "ThrustMaster Millennium 3D Inceptor", 6, 2, { 4, 2 }, { 4, 6 }, tmdc_abs, tmdc_btn_joy },
84 { 3, "ThrustMaster Rage 3D Gamepad", 2, 0, { 8, 2 }, { 0, 0 }, tmdc_abs, tmdc_btn_pad },
131 int i[2], j[2], t[2], p, k; in tmdc_read_packet() local
135 for (k = 0; k < 2; k++) { in tmdc_read_packet()
136 t[k] = gameport_time(gameport, TMDC_MAX_START); in tmdc_read_packet()
137 i[k] = j[k] = 0; in tmdc_read_packet()
149 for (k = 0, v = w, u = x; k < 2; k++, v >>= 2, u >>= 2) { in tmdc_read_packet()
151 if (t[k] <= 0 || i[k] >= TMDC_MAX_LENGTH) continue; in tmdc_read_packet()
[all …]
/linux-6.12.1/tools/testing/radix-tree/
Dmultiorder.c42 int order[NUM_ENTRIES] = {1, 1, 2, 3, 4, 1, 0, 1, 3, 0, 7}; in multiorder_iteration()
82 int order[MT_NUM_ENTRIES] = {1, 0, 2, 4, 3, 1, 3, 0, 7}; in multiorder_tagged_iteration()
98 int k; in multiorder_tagged_iteration() local
101 for (k = i; index[k] < tag_index[i]; k++) in multiorder_tagged_iteration()
103 if (j <= (index[k] | ((1 << order[k]) - 1))) in multiorder_tagged_iteration()
110 for (k = i; index[k] < tag_index[i]; k++) in multiorder_tagged_iteration()
112 mask = (1UL << order[k]) - 1; in multiorder_tagged_iteration()
117 assert(item->order == order[k]); in multiorder_tagged_iteration()
126 int mask, k; in multiorder_tagged_iteration() local
129 for (k = i; index[k] < tag_index[i]; k++) in multiorder_tagged_iteration()
[all …]

12345678910>>...51