Home
last modified time | relevance | path

Searched +full:9 +full:k (Results 1 – 25 of 1061) sorted by relevance

12345678910>>...43

/linux/tools/testing/selftests/tc-testing/tc-tests/actions/
H A Dpolice.json20 "cmdUnderTest": "$TC actions add action police rate 1kbit burst 10k index 1",
23 "matchPattern": "action order [0-9]*: police 0x1 rate 1Kbit burst 10Kb",
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",
51 "matchPattern": "action order [0-9]*: police 0x9",
75 "cmdUnderTest": "$TC actions add action police rate 90kbit burst 10k mtu 1k index 98",
78 "matchPattern": "action order [0-9]*
246 { global() object
[all...]
/linux/drivers/media/platform/verisilicon/
H A Dhantro_vp8.c42 { 0, -9, 93, 50, -6, 0 },
44 { 0, -6, 50, 93, -9, 0 },
53 u32 i, j, k; in hantro_vp8_prob_update() local
84 dst[4] = entropy->mv_probs[0][8 + 9]; in hantro_vp8_prob_update()
85 dst[5] = entropy->mv_probs[0][9 + 9]; in hantro_vp8_prob_update()
86 dst[6] = entropy->mv_probs[1][8 + 9]; in hantro_vp8_prob_update()
87 dst[7] = entropy->mv_probs[1][9 + 9]; in hantro_vp8_prob_update()
91 dst[0] = entropy->mv_probs[i][j + 9 + 0]; in hantro_vp8_prob_update()
92 dst[1] = entropy->mv_probs[i][j + 9 + 1]; in hantro_vp8_prob_update()
93 dst[2] = entropy->mv_probs[i][j + 9 + 2]; in hantro_vp8_prob_update()
[all …]
/linux/drivers/ata/pata_parport/
H A Dktti.c42 w0(r); w2(0xb); w2(0xa); w2(9); w2(0xc); w2(9); in ktti_read_regr()
43 a = r1(); w2(0xc); b = r1(); w2(9); w2(0xc); w2(9); in ktti_read_regr()
49 int k, a, b; in ktti_read_block() local
51 for (k = 0; k < count / 2; k++) { in ktti_read_block()
52 w0(0x10); w2(0xb); w2(0xa); w2(9); w2(0xc); w2(9); in ktti_read_block()
53 a = r1(); w2(0xc); b = r1(); w2(9); in ktti_read_block()
54 buf[2*k] = j44(a, b); in ktti_read_block()
55 a = r1(); w2(0xc); b = r1(); w2(9); in ktti_read_block()
56 buf[2*k+1] = j44(a, b); in ktti_read_block()
62 int k; in ktti_write_block() local
[all …]
H A Ddstr.c117 int k, a, b; in dstr_read_block() local
123 w0(9); in dstr_read_block()
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()
146 buf[k] = r4(); in dstr_read_block()
151 for (k = 0; k < count / 2; k++) in dstr_read_block()
152 ((u16 *)buf)[k] = r4w(); in dstr_read_block()
[all …]
H A Dbpck.c60 w0(r); w2(9); w2(0); w2(0x20); in bpck_read_regr()
84 case 4: w0(r); w2(9); w2(0); in bpck_write_regr()
124 w0(0x40); w2(9); w2(0); w2(1); in bpck_write_block()
133 w0(0x40); w2(9); w2(0); w2(1); in bpck_write_block()
142 w0(0x40); w2(9); w2(0); w2(1); in bpck_write_block()
181 w0(0x40); w2(9); w2(0); w2(0x20); in bpck_read_block()
190 w0(0x40); w2(9); w2(0); w2(0x20); in bpck_read_block()
199 w0(0x40); w2(9); w2(0); w2(0x20); in bpck_read_block()
275 w2(9); w2(0); in bpck_disconnect()
291 w0(4); w2(9); w2(0); in bpck_force_spp()
[all …]
/linux/include/uapi/linux/
H A Dkeyboard.h18 #define NR_SHIFT 9
38 #define KT_ASCII 9
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/arch/powerpc/include/asm/book3s/64/
H A Dhash-4k.h5 #define H_PTE_INDEX_SIZE 9 // size: 8B << 9 = 4KB, maps: 2^9 x 4KB = 2MB
7 #define H_PUD_INDEX_SIZE 9 // size: 8B << 9 = 4KB, maps: 2^9 x 256MB = 128GB
8 #define H_PGD_INDEX_SIZE 9 // size: 8B << 9 = 4KB, maps: 2^9 x 128GB = 64TB
11 * Each context is 512TB. But on 4k we restrict our max TASK size to 64TB
51 * Not supported by 4k linux page size
72 * On all 4K setups, remap_4k_pfn() equates to remap_pfn_range()
78 * With 4K page size the real_pte machinery is all nops.
106 * 4K PTE format is different from 64K PTE format. Saving the hash_slot is just
107 * a matter of returning the PTE bits that need to be modified. On 64K PTE,
H A Dradix-4k.h6 * For 4K page size supported index is 13/9/9/9
8 #define RADIX_PTE_INDEX_SIZE 9 // size: 8B << 9 = 4KB, maps 2^9 x 4K = 2MB
9 #define RADIX_PMD_INDEX_SIZE 9 // size: 8B << 9 = 4KB, maps 2^9 x 2MB = 1GB
10 #define RADIX_PUD_INDEX_SIZE 9 // size: 8B << 9 = 4KB, maps 2^9 x 1GB = 512GB
H A Dradix-64k.h6 * For 64K page size supported index is 13/9/9/5
8 #define RADIX_PTE_INDEX_SIZE 5 // size: 8B << 5 = 256B, maps 2^5 x 64K = 2MB
9 #define RADIX_PMD_INDEX_SIZE 9 // size: 8B << 9 = 4KB, maps 2^9 x 2MB = 1GB
10 #define RADIX_PUD_INDEX_SIZE 9 // size: 8B << 9 = 4KB, maps 2^9 x 1GB = 512GB
/linux/net/ceph/
H A Dceph_hash.c25 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()
55 c = c + ((__u32)k[9] << 16); in ceph_str_hash_rjenkins()
[all …]
/linux/lib/crypto/
H A Dsm3.c18 static const u32 ____cacheline_aligned K[64] = { variable
47 b = rol32((b), 9); \
64 #define P0(x) ((x) ^ rol32((x), 9) ^ rol32((x), 17))
70 ^ W[(i-9) & 0x0f] \
88 R1(a, b, c, d, e, f, g, h, K[0], I(0), I(4)); in sm3_transform()
89 R1(d, a, b, c, h, e, f, g, K[1], I(1), I(5)); in sm3_transform()
90 R1(c, d, a, b, g, h, e, f, K[2], I(2), I(6)); in sm3_transform()
91 R1(b, c, d, a, f, g, h, e, K[3], I(3), I(7)); in sm3_transform()
92 R1(a, b, c, d, e, f, g, h, K[4], W1(4), I(8)); in sm3_transform()
93 R1(d, a, b, c, h, e, f, g, K[5], W1(5), I(9)); in sm3_transform()
[all …]
/linux/tools/testing/selftests/bpf/progs/
H A 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/include/trace/events/
H A Dbcache.h30 __entry->nr_sector = bio->bi_iter.bi_size >> 9;
42 TP_PROTO(struct bkey *k),
43 TP_ARGS(k),
53 __entry->inode = KEY_INODE(k);
54 __entry->offset = KEY_OFFSET(k);
55 __entry->size = KEY_SIZE(k);
56 __entry->dirty = KEY_DIRTY(k);
104 __entry->nr_sector = bio->bi_iter.bi_size >> 9;
139 __entry->nr_sector = bio->bi_iter.bi_size >> 9;
170 __entry->nr_sector = bio->bi_iter.bi_size >> 9;
[all …]
/linux/drivers/media/usb/pwc/
H A 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()
112 bit = (r[0] >> 9) & 7; 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()
[all …]
/linux/tools/perf/pmu-events/arch/x86/lunarlake/
H A Dvirtual-memory.json31 "Counter": "0,1,2,3,4,5,6,7,8,9",
41 "Counter": "0,1,2,3,4,5,6,7,8,9",
62 "Counter": "0,1,2,3,4,5,6,7,8,9",
72 "Counter": "0,1,2,3,4,5,6,7,8,9",
92 "Counter": "0,1,2,3,4,5,6,7,8,9",
101 …iefDescription": "Counts the number of page walks completed due to load DTLB misses to a 4K page.",
105 …missed in all Translation Lookaside Buffer (TLB) levels and were mapped to 4K pages. Includes page…
111 "BriefDescription": "Page walks completed due to a demand data load to a 4K page.",
112 "Counter": "0,1,2,3,4,5,6,7,8,9",
115 …"PublicDescription": "Counts completed page walks (4K sizes) caused by demand data loads. This im…
[all …]
/linux/fs/smb/common/
H A Dcifs_md4.c51 #define ROUND1(a,b,c,d,k,s) (a = lshift(a + F(b,c,d) + k, s)) argument
52 #define ROUND2(a,b,c,d,k,s) (a = lshift(a + G(b,c,d) + k + (u32)0x5A827999,s)) argument
53 #define ROUND3(a,b,c,d,k,s) (a = lshift(a + H(b,c,d) + k + (u32)0x6ED9EBA1,s)) argument
73 ROUND1(d, a, b, c, in[9], 7); in md4_transform()
83 ROUND2(c, d, a, b, in[8], 9); in md4_transform()
87 ROUND2(c, d, a, b, in[9], 9); in md4_transform()
91 ROUND2(c, d, a, b, in[10], 9); in md4_transform()
95 ROUND2(c, d, a, b, in[11], 9); in md4_transform()
99 ROUND3(d, a, b, c, in[8], 9); in md4_transform()
103 ROUND3(d, a, b, c, in[10], 9); in md4_transform()
[all …]
/linux/tools/include/linux/
H A Djhash.h61 * @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()
92 case 10: c += (u32)k[9]<<8; in jhash()
93 case 9: c += k[8]; in jhash()
[all …]
/linux/include/linux/
H A Djhash.h61 * @k: sequence of bytes as key
73 const u8 *k = key; in jhash() local
80 a += get_unaligned((u32 *)k); in jhash()
81 b += get_unaligned((u32 *)(k + 4)); in jhash()
82 c += get_unaligned((u32 *)(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()
91 case 10: c += (u32)k[9]<<8; fallthrough; in jhash()
92 case 9: c += k[8]; fallthrough; in jhash()
[all …]
/linux/lib/crypto/powerpc/
H A Dmd5-asm.S68 addi w0,w0,k0l; /* 1: wk = w + k */ \
70 addis w0,w0,k0h; /* 1: wk = w + k' */ \
71 addis w1,w1,k1h; /* 2: wk = w + k */ \
73 addi w1,w1,k1l; /* 2: wk = w + k' */ \
88 addi w0,w0,k0l; /* 1: wk = w + k */ \
90 addis w0,w0,k0h; /* 1: wk = w + k' */ \
92 addi w1,w1,k1l; /* 2: wk = w + k */ \
94 addis w1,w1,k1h; /* 2: wk = w + k' */ \
107 addi w0,w0,k0l; /* 1: wk = w + k */ \
109 addis w0,w0,k0h; /* 1: wk = w + k' */ \
[all …]
/linux/lib/
H A Dbitmap.c40 unsigned int k, lim = bits/BITS_PER_LONG; in __bitmap_equal() local
41 for (k = 0; k < lim; ++k) in __bitmap_equal()
42 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
46 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_equal()
58 unsigned int k, lim = bits / BITS_PER_LONG; in __bitmap_or_equal() local
61 for (k = 0; k < lim; ++k) { in __bitmap_or_equal()
62 if ((bitmap1[k] | bitmap2[k]) != bitmap3[k]) in __bitmap_or_equal()
69 tmp = (bitmap1[k] | bitmap2[k]) ^ bitmap3[k]; in __bitmap_or_equal()
75 unsigned int k, lim = BITS_TO_LONGS(bits); in __bitmap_complement() local
76 for (k = 0; k < lim; ++k) in __bitmap_complement()
[all …]
/linux/Documentation/networking/
H A Dfilter.rst80 __u32 k; /* Generic multiuse field */
84 a code, jt, jf and k value. jt and jf are jump offsets and k a generic
207 op:16, jt:8, jf:8, k:32
211 "jump if true", the other one "jump if false". Eventually, element k
236 jeq 7, 8, 9, 10 Jump on A == <x>
237 jneq 9, 10 Jump on A != <x>
238 jne 9, 10 Jump on A != <x>
239 jlt 9, 10 Jump on A < <x>
240 jle 9, 10 Jump on A <= <x>
241 jgt 7, 8, 9, 10 Jump on A > <x>
[all …]
/linux/tools/testing/selftests/net/packetdrill/
H A Dtcp_inq_client.pkt22 // Now we have 10K of data ready on the socket.
26 // We read 1K and we should have 9K ready to read.
33 // We read 9K and we should have no further data ready to read.
45 // We read 10K and we should have one "fake" byte because the connection is
/linux/tools/perf/pmu-events/arch/x86/pantherlake/
H A Dvirtual-memory.json22 "Counter": "0,1,2,3,4,5,6,7,8,9",
32 "Counter": "0,1,2,3,4,5,6,7,8,9",
53 "Counter": "0,1,2,3,4,5,6,7,8,9",
63 "Counter": "0,1,2,3,4,5,6,7,8,9",
73 "Counter": "0,1,2,3,4,5,6,7,8,9",
82 "BriefDescription": "Page walks completed due to a demand data load to a 4K page.",
83 "Counter": "0,1,2,3,4,5,6,7,8,9",
86 …"PublicDescription": "Counts completed page walks (4K sizes) caused by demand data loads. This im…
93 "Counter": "0,1,2,3,4,5,6,7,8,9",
122 "Counter": "0,1,2,3,4,5,6,7,8,9",
[all …]
/linux/drivers/video/fbdev/mb862xx/
H A Dmb862xxfb_accel.c47 cmd[1] = (2 << 7) | (GDC_ROP_COPY << 9); in mb86290fb_copyarea()
81 cmd[1] = (2 << 7) | (GDC_ROP_COPY << 9); in mb86290fb_imageblit1()
100 memcpy(&cmd[9 + i * step], line, step << 2); in mb86290fb_imageblit1()
103 int k = 0; in mb86290fb_imageblit1() local
104 for (k = 0; k < step; k++) in mb86290fb_imageblit1()
105 cmd[9 + i * step + k] = in mb86290fb_imageblit1()
106 cpu_to_be32(cmd[9 + i * step + k]); in mb86290fb_imageblit1()
208 cmdlen = 9 + height * step; in mb86290fb_imageblit()
280 cmd[1] = (2 << 7) | (GDC_ROP_XOR << 9); in mb86290fb_fillrect()
285 cmd[1] = (2 << 7) | (GDC_ROP_COPY << 9); in mb86290fb_fillrect()
/linux/drivers/clk/berlin/
H A Dbg2q.c70 .divsel_shift = 9,
100 BERLIN2_DIV_SELECT(REG_CLKSELECT0, 9),
116 BERLIN2_PLL_SWITCH(REG_CLKSWITCH0, 9),
175 BERLIN2_DIV_SELECT(REG_CLKSELECT1, 9),
268 { "sata", "perif", 9 },
283 const char *parent_names[9]; in berlin2q_clock_setup()
340 int k; in berlin2q_clock_setup() local
342 for (k = 0; k < dd->num_parents; k++) in berlin2q_clock_setup()
343 parent_names[k] = clk_names[dd->parent_ids[k]]; in berlin2q_clock_setup()

12345678910>>...43