Home
last modified time | relevance | path

Searched refs:K (Results 1 – 25 of 516) sorted by relevance

12345678910>>...21

/linux/include/uapi/linux/
H A Dkeyboard.h45 #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)
56 #define K_F8 K(KT_FN,7)
57 #define K_F9 K(KT_F
[all...]
/linux/rust/kernel/
H A Drbtree.rs171 pub struct RBTree<K, V> {
173 _p: PhantomData<Node<K, V>>,
177 // fields, so we use the same Send condition as would be used for a struct with K and V fields.
178 unsafe impl<K: Send, V: Send> Send for RBTree<K, V> {}
181 // fields, so we use the same Sync condition as would be used for a struct with K and V fields.
182 unsafe impl<K: Sync, V: Sync> Sync for RBTree<K, V> {}
184 impl<K, V> RBTree<K,
201 iter(&self) -> Iter<'_, K, V> iter() argument
216 iter_mut(&mut self) -> IterMut<'_, K, V> iter_mut() argument
246 cursor_front(&mut self) -> Option<Cursor<'_, K, V>> cursor_front() argument
261 cursor_back(&mut self) -> Option<Cursor<'_, K, V>> cursor_back() argument
288 try_create_and_insert( &mut self, key: K, value: V, flags: Flags, ) -> Result<Option<RBTreeNode<K, V>>> try_create_and_insert() argument
291 try_create_and_insert( &mut self, key: K, value: V, flags: Flags, ) -> Result<Option<RBTreeNode<K, V>>> try_create_and_insert() argument
301 insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> insert() argument
311 raw_entry(&mut self, key: &K) -> RawEntry<'_, K, V> raw_entry() argument
365 entry(&mut self, key: K) -> Entry<'_, K, V> entry() argument
373 find_mut(&mut self, key: &K) -> Option<OccupiedEntry<'_, K, V>> find_mut() argument
408 remove_node(&mut self, key: &K) -> Option<RBTreeNode<K, V>> remove_node() argument
424 cursor_lower_bound(&mut self, key: &K) -> Option<Cursor<'_, K, V>> where K: Ord, cursor_lower_bound() argument
745 current(&self) -> (&K, &V) current() argument
753 current_mut(&mut self) -> (&K, &mut V) current_mut() argument
765 remove_current(self) -> (Option<Self>, RBTreeNode<K, V>) remove_current() argument
789 remove_prev(&mut self) -> Option<RBTreeNode<K, V>> remove_prev() argument
794 remove_next(&mut self) -> Option<RBTreeNode<K, V>> remove_next() argument
798 remove_neighbor(&mut self, direction: Direction) -> Option<RBTreeNode<K, V>> remove_neighbor() argument
834 peek_prev(&self) -> Option<(&K, &V)> peek_prev() argument
839 peek_next(&self) -> Option<(&K, &V)> peek_next() argument
843 peek(&self, direction: Direction) -> Option<(&K, &V)> peek() argument
853 peek_prev_mut(&mut self) -> Option<(&K, &mut V)> peek_prev_mut() argument
858 peek_next_mut(&mut self) -> Option<(&K, &mut V)> peek_next_mut() argument
862 peek_mut(&mut self, direction: Direction) -> Option<(&K, &mut V)> peek_mut() argument
887 to_key_value<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b V) to_key_value() argument
898 to_key_value_mut<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b mut V) to_key_value_mut() argument
909 to_key_value_raw<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, *mut V) to_key_value_raw() argument
1043 new(flags: Flags) -> Result<RBTreeNodeReservation<K, V>> new() argument
1061 into_node(self, key: K, value: V) -> RBTreeNode<K, V> into_node() argument
1085 new(key: K, value: V, flags: Flags) -> Result<RBTreeNode<K, V>> new() argument
1090 to_key_value(self) -> (K, V) to_key_value() argument
1113 into_reservation(self) -> RBTreeNodeReservation<K, V> into_reservation() argument
1165 insert(self, node: RBTreeNode<K, V>) -> &'a mut V insert() argument
1187 insert(self, value: V, reservation: RBTreeNodeReservation<K, V>) -> &'a mut V insert() argument
1230 remove_node(self) -> RBTreeNode<K, V> remove_node() argument
1254 replace(self, node: RBTreeNode<K, V>) -> RBTreeNode<K, V> replace() argument
[all...]
/linux/crypto/
H A Dwp512.c782 u64 K[8]; /* the round key */ in wp512_process_buffer() local
790 state[0] = block[0] ^ (K[0] = wctx->hash[0]); in wp512_process_buffer()
791 state[1] = block[1] ^ (K[1] = wctx->hash[1]); in wp512_process_buffer()
792 state[2] = block[2] ^ (K[2] = wctx->hash[2]); in wp512_process_buffer()
793 state[3] = block[3] ^ (K[3] = wctx->hash[3]); in wp512_process_buffer()
794 state[4] = block[4] ^ (K[4] = wctx->hash[4]); in wp512_process_buffer()
795 state[5] = block[5] ^ (K[5] = wctx->hash[5]); in wp512_process_buffer()
796 state[6] = block[6] ^ (K[6] = wctx->hash[6]); in wp512_process_buffer()
797 state[7] = block[7] ^ (K[7] = wctx->hash[7]); in wp512_process_buffer()
801 L[0] = C0[(int)(K[ in wp512_process_buffer()
[all...]
/linux/lib/crypto/
H A Dsm3.c18 static const u32 ____cacheline_aligned K[64] = { variable
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()
94 R1(c, d, a, b, g, h, e, f, K[6], W1(6), I(10)); in sm3_transform()
95 R1(b, c, d, a, f, g, h, e, K[7], W1(7), I(11)); in sm3_transform()
96 R1(a, b, c, d, e, f, g, h, K[ in sm3_transform()
[all...]
/linux/include/crypto/internal/
H A Ddes.h59 u32 K[6]; in des3_ede_verify_key() local
61 memcpy(K, key, DES3_EDE_KEY_SIZE); in des3_ede_verify_key()
63 if ((!((K[0] ^ K[2]) | (K[1] ^ K[3])) || in des3_ede_verify_key()
64 !((K[2] ^ K[4]) | (K[3] ^ K[ in des3_ede_verify_key()
[all...]
/linux/mm/
H A Dshow_mem.c259 K(node_page_state(pgdat, NR_ACTIVE_ANON)), in show_free_areas()
260 K(node_page_state(pgdat, NR_INACTIVE_ANON)), in show_free_areas()
261 K(node_page_state(pgdat, NR_ACTIVE_FILE)), in show_free_areas()
262 K(node_page_state(pgdat, NR_INACTIVE_FILE)), in show_free_areas()
263 K(node_page_state(pgdat, NR_UNEVICTABLE)), in show_free_areas()
264 K(node_page_state(pgdat, NR_ISOLATED_ANON)), in show_free_areas()
265 K(node_page_state(pgdat, NR_ISOLATED_FILE)), in show_free_areas()
266 K(node_page_state(pgdat, NR_FILE_MAPPED)), in show_free_areas()
267 K(node_page_state(pgdat, NR_FILE_DIRTY)), in show_free_areas()
268 K(node_page_stat in show_free_areas()
[all...]
/linux/arch/sparc/net/
H A Dbpf_jit_comp_32.c68 #define SETHI(K, REG) \ argument
69 (F2(0, 0x4) | RD(REG) | (((K) >> 10) & 0x3fffff))
70 #define OR_LO(K, REG) \ argument
71 (F3(2, 0x02) | IMMED | RS1(REG) | ((K) & 0x3ff) | RD(REG))
126 #define emit_set_const(K, REG) \ argument
127 do { /* sethi %hi(K), REG */ \
128 *prog++ = SETHI(K, REG); \
129 /* or REG, %lo(K), REG */ \
130 *prog++ = OR_LO(K, REG); \
145 * OP r_A, K, r_
157 emit_alu_K(OPCODE,K) global() argument
171 emit_loadimm(K,DEST) global() argument
391 unsigned int K = filter[i].k; bpf_jit_compile() local
593 CHOOSE_LOAD_FUNC(K,func) bpf_jit_compile() argument
[all...]
/linux/Documentation/arch/powerpc/
H A Dvmemmap_dedup.rst11 with a 64K page size, only the devdax namespace with 1G alignment uses vmemmap
14 With 2M PMD level mapping, we require 32 struct pages and a single 64K vmemmap
15 page can contain 1024 struct pages (64K/sizeof(struct page)). Hence there is no
18 With 1G PUD level mapping, we require 16384 struct pages and a single 64K
19 vmemmap page can contain 1024 struct pages (64K/sizeof(struct page)). Hence we
20 require 16 64K pages in vmemmap to map the struct page for 1G PUD level mapping.
46 With 4K page size, 2M PMD level mapping requires 512 struct pages and a single
47 4K vmemmap page contains 64 struct pages(4K/sizeof(struct page)). Hence we
48 require 8 4K page
[all...]
/linux/Documentation/networking/device_drivers/atm/
H A Diphase.rst24 - Supports 4K VCs for the server board (with 512K control memory) and 1K
25 VCs for the client board (with 128K control memory).
31 including x575 (OC3, control memory 128K , 512K and packet memory 128K,
32 512K and 1M), x525 (UTP25) and x531 (DS3 and E3). See
93 The (i)Chip boards have 3 different packet RAM size variants: 128K, 512K an
[all...]
/linux/arch/arm64/include/asm/
H A Datomic_ll_sc.h16 #define K macro
106 ATOMIC_OPS(and, and, K) in ATOMIC_OPS()
107 ATOMIC_OPS(or, orr, K) in ATOMIC_OPS()
108 ATOMIC_OPS(xor, eor, K) in ATOMIC_OPS()
275 * handle the 'K' constraint for the value 4294967295 - thus we use no
278 __CMPXCHG_CASE(w, b, , 8, , , , , K)
279 __CMPXCHG_CASE(w, h, , 16, , , , , K)
280 __CMPXCHG_CASE(w, , , 32, , , , , K)
282 __CMPXCHG_CASE(w, b, acq_, 8, , a, , "memory", K)
283 __CMPXCHG_CASE(w, h, acq_, 16, , a, , "memory", K)
[all...]
/linux/drivers/base/
H A Dnode.c402 #define K(x) ((x) << (PAGE_SHIFT - 10)) macro
432 nid, K(i.totalram), in node_read_meminfo()
433 nid, K(i.freeram), in node_read_meminfo()
434 nid, K(i.totalram - i.freeram), in node_read_meminfo()
435 nid, K(swapcached), in node_read_meminfo()
436 nid, K(node_page_state(pgdat, NR_ACTIVE_ANON) + in node_read_meminfo()
438 nid, K(node_page_state(pgdat, NR_INACTIVE_ANON) + in node_read_meminfo()
440 nid, K(node_page_state(pgdat, NR_ACTIVE_ANON)), in node_read_meminfo()
441 nid, K(node_page_state(pgdat, NR_INACTIVE_ANON)), in node_read_meminfo()
442 nid, K(node_page_stat in node_read_meminfo()
[all...]
/linux/crypto/krb5/
H A Drfc6803_camellia.c17 * K(0) = zeros
18 * K(i) = CMAC(key, K(i-1) | i | constant | 0x00 | k)
19 * DR(key, constant) = k-truncate(K(1) | K(2) | ... | K(n))
31 struct krb5_buffer K, data; in rfc6803_calc_KDF_FEEDBACK_CMAC() local
48 K.len = crypto_shash_digestsize(shash); in rfc6803_calc_KDF_FEEDBACK_CMAC()
49 data.len = K.len + 4 + constant->len + 1 + 4; in rfc6803_calc_KDF_FEEDBACK_CMAC()
52 crypto_roundup(K in rfc6803_calc_KDF_FEEDBACK_CMAC()
[all...]
/linux/Documentation/admin-guide/media/
H A Ddvb_intro.rst151 TRANSMISSION_MODE = 8K
179 TRANSMISSION_MODE = 8K
194 TRANSMISSION_MODE = 8K
209 TRANSMISSION_MODE = 8K
224 TRANSMISSION_MODE = 8K
239 TRANSMISSION_MODE = 8K
254 TRANSMISSION_MODE = 8K
269 TRANSMISSION_MODE = 8K
284 TRANSMISSION_MODE = 8K
299 TRANSMISSION_MODE = 8K
[all...]
/linux/arch/sparc/crypto/
H A Ddes_glue.c76 const u64 *K = ctx->encrypt_expkey; in sparc_des_encrypt() local
78 des_sparc64_crypt(K, (const u64 *) src, (u64 *) dst); in sparc_des_encrypt()
84 const u64 *K = ctx->decrypt_expkey; in sparc_des_decrypt() local
86 des_sparc64_crypt(K, (const u64 *) src, (u64 *) dst); in sparc_des_decrypt()
225 const u64 *K = ctx->encrypt_expkey; in sparc_des3_ede_encrypt() local
227 des3_ede_sparc64_crypt(K, (const u64 *) src, (u64 *) dst); in sparc_des3_ede_encrypt()
233 const u64 *K = ctx->decrypt_expkey; in sparc_des3_ede_decrypt() local
235 des3_ede_sparc64_crypt(K, (const u64 *) src, (u64 *) dst); in sparc_des3_ede_decrypt()
248 const u64 *K; in __ecb3_crypt() local
257 K in __ecb3_crypt()
294 const u64 *K; __cbc3_crypt() local
[all...]
/linux/tools/perf/bench/
H A Dmem-functions.c29 #define K 1024 macro
100 if (x < K) \
102 else if (x < K * K) \
103 printf(" %14lfd KB/sec\n", x / K); \
104 else if (x < K * K * K) \
105 printf(" %14lf MB/sec\n", x / K / K); \
[all...]
/linux/tools/bpf/
H A Dbpf_dbg.c636 uint32_t K = f->k; in bpf_single_step() local
641 r->R = K; in bpf_single_step()
659 r->M[K] = r->A; in bpf_single_step()
662 r->M[K] = r->X; in bpf_single_step()
665 d = pkt_caplen - K; in bpf_single_step()
667 r->A = extract_u32(pkt, K); in bpf_single_step()
672 d = pkt_caplen - K; in bpf_single_step()
674 r->A = extract_u16(pkt, K); in bpf_single_step()
679 d = pkt_caplen - K; in bpf_single_step()
681 r->A = extract_u8(pkt, K); in bpf_single_step()
[all...]
/linux/Documentation/ABI/testing/
H A Dsysfs-bus-siox
/linux/Documentation/translations/zh_CN/arch/arm64/
H A Dhugetlbpage.rst42 4K: 64K 2M 32M 1G
43 16K: 2M 32M 1G
44 64K: 2M 512M 16G
/linux/Documentation/translations/zh_TW/arch/arm64/
H A Dhugetlbpage.rst45 4K: 64K 2M 32M 1G
46 16K: 2M 32M 1G
47 64K: 2M 512M 16G
/linux/tools/testing/selftests/net/packetdrill/
H A Dtcp_inq_server.pkt23 // Now we have 10K of data ready on the socket.
27 // We read 2K and we should have 8K ready to read.
34 // We read 8K 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
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/Documentation/features/scripts/
H A Dfeatures-refresh.sh9 # Each feature F is identified by a pair (O, K), where 'O' can
14 K=$F
17 K=$(echo $F | sed -e 's/^!//g')
21 # F := (O, K) is 'valid' iff there is a Kconfig file (for some
22 # arch) which contains K.
30 # 2) K does not exist (e.g., it was renamed/mis-typed);
42 # that K can be removed.
47 K_GREP=$(grep "$K" $K_FILES)
65 K_GREP=$(grep "$K" $K_FILES)
67 # Arch support status values for (O, K) ar
[all...]
/linux/tools/testing/kunit/test_data/
H A Dtest_is_test_passed-no_tests_run_no_header.log14 Memory: 27868K/56932K available (1681K kernel code, 480K rwdata, 400K rodata, 89K init, 205K bss, 29064K reserved, 0K cma-reserved)
H A Dtest_output_isolated_correctly.log6 Memory: 254468K/283500K available (1734K kernel code, 489K rwdata, 396K rodata, 85K init, 216K bss, 29032K reserved, 0K cma-reserved)
/linux/Documentation/hwmon/
H A Df71805f.rst84 in1 VIN1 VTT1.2V 10K - 1.00 1.20 V
85 in2 VIN2 VRAM 100K 100K 2.00 ~1.25 V [1]_
86 in3 VIN3 VCHIPSET 47K 100K 1.47 2.24 V [2]_
87 in4 VIN4 VCC5V 200K 47K 5.25 0.95 V
88 in5 VIN5 +12V 200K 20K 11.00 1.05 V
89 in6 VIN6 VCC1.5V 10K
[all...]

12345678910>>...21