k2                202 arch/sparc/crypto/des_glue.c 	u64 k2[DES_EXPKEY_WORDS / 2];
k2                212 arch/sparc/crypto/des_glue.c 	des_sparc64_key_expand((const u32 *)key, k2);
k2                217 arch/sparc/crypto/des_glue.c 	encrypt_to_decrypt(&dctx->encrypt_expkey[DES_EXPKEY_WORDS / 2], &k2[0]);
k2                223 arch/sparc/crypto/des_glue.c 	       &k2[0], sizeof(k2));
k2               1997 arch/x86/kvm/svm.c 	struct kvm_svm *k2;
k2               2030 arch/x86/kvm/svm.c 		hash_for_each_possible(svm_vm_data_hash, k2, hnode, vm_id) {
k2               2031 arch/x86/kvm/svm.c 			if (k2->avic_vm_id == vm_id)
k2                 60 crypto/tea.c   	u32 k0, k1, k2, k3;
k2                 70 crypto/tea.c   	k2 = ctx->KEY[2];
k2                 78 crypto/tea.c   		z += ((y << 4) + k2) ^ (y + sum) ^ ((y >> 5) + k3);
k2                 88 crypto/tea.c   	u32 k0, k1, k2, k3;
k2                 98 crypto/tea.c   	k2 = ctx->KEY[2];
k2                106 crypto/tea.c   		z -= ((y << 4) + k2) ^ (y + sum) ^ ((y >> 5) + k3);
k2                292 crypto/vmac.c  	p += MUL32(a0, k2);
k2                298 crypto/vmac.c  	p += MUL32(a1, k2);
k2                306 crypto/vmac.c  	q += MUL32(a2, k2);
k2                316 crypto/vmac.c  	q += MUL32(a3, k2);
k2                358 crypto/vmac.c  static u64 l3hash(u64 p1, u64 p2, u64 k1, u64 k2, u64 len)
k2                381 crypto/vmac.c  	p2 += k2;
k2                382 crypto/vmac.c  	p2 += (0 - (p2 < k2)) & 257;
k2                104 drivers/clk/sprd/pll.c 	u16 k1, k2;
k2                133 drivers/clk/sprd/pll.c 		k2 = pll->k2;
k2                136 drivers/clk/sprd/pll.c 					 k2 + refin * nint * CLK_PLL_1M;
k2                 57 drivers/clk/sprd/pll.h 	u16 k2;
k2                 73 drivers/clk/sprd/pll.h 		.k2		= _k2,					\
k2                318 drivers/crypto/ccp/ccp-crypto-aes-cmac.c 	gk = (__be64 *)ctx->u.aes.k2;
k2                325 drivers/crypto/ccp/ccp-crypto-aes-cmac.c 	sg_init_one(&ctx->u.aes.k2_sg, ctx->u.aes.k2, sizeof(ctx->u.aes.k2));
k2                108 drivers/crypto/ccp/ccp-crypto.h 	u8 k2[AES_BLOCK_SIZE];
k2               1802 drivers/media/usb/gspca/sonixj.c 	u8 k2;
k2               1804 drivers/media/usb/gspca/sonixj.c 	k2 = (brightness - 0x80) >> 2;
k2               1807 drivers/media/usb/gspca/sonixj.c 		if (k2 > 0x1f)
k2               1808 drivers/media/usb/gspca/sonixj.c 			k2 = 0;		/* only positive Y offset */
k2               1841 drivers/media/usb/gspca/sonixj.c 	reg_w1(gspca_dev, 0x96, k2);	/* color matrix Y offset */
k2               1847 drivers/media/usb/gspca/sonixj.c 	u8 k2;
k2               1850 drivers/media/usb/gspca/sonixj.c 	k2 = sd->contrast->val * 37 / (CONTRAST_MAX + 1)
k2               1852 drivers/media/usb/gspca/sonixj.c 	contrast[0] = (k2 + 1) / 2;		/* red */
k2               1854 drivers/media/usb/gspca/sonixj.c 	contrast[2] = k2;			/* green */
k2               1856 drivers/media/usb/gspca/sonixj.c 	contrast[4] = k2 / 5;			/* blue */
k2                519 drivers/net/wireless/intel/iwlwifi/fw/api/sta.h 	u8 k2[16];
k2               1550 fs/btrfs/ctree.c 		     const struct btrfs_key *k2)
k2               1556 fs/btrfs/ctree.c 	return btrfs_comp_cpu_keys(&k1, k2);
k2               1562 fs/btrfs/ctree.c int btrfs_comp_cpu_keys(const struct btrfs_key *k1, const struct btrfs_key *k2)
k2               1564 fs/btrfs/ctree.c 	if (k1->objectid > k2->objectid)
k2               1566 fs/btrfs/ctree.c 	if (k1->objectid < k2->objectid)
k2               1568 fs/btrfs/ctree.c 	if (k1->type > k2->type)
k2               1570 fs/btrfs/ctree.c 	if (k1->type < k2->type)
k2               1572 fs/btrfs/ctree.c 	if (k1->offset > k2->offset)
k2               1574 fs/btrfs/ctree.c 	if (k1->offset < k2->offset)
k2               2508 fs/btrfs/ctree.h int btrfs_comp_cpu_keys(const struct btrfs_key *k1, const struct btrfs_key *k2);
k2                 36 fs/hfsplus/attributes.c 				const hfsplus_btree_key *k2)
k2                 41 fs/hfsplus/attributes.c 	k2_cnid = k2->attr.cnid;
k2                 47 fs/hfsplus/attributes.c 			(const struct hfsplus_unistr *)&k2->attr.key_name);
k2                 17 fs/hfsplus/catalog.c 			     const hfsplus_btree_key *k2)
k2                 22 fs/hfsplus/catalog.c 	k2p = k2->cat.parent;
k2                 26 fs/hfsplus/catalog.c 	return hfsplus_strcasecmp(&k1->cat.name, &k2->cat.name);
k2                 30 fs/hfsplus/catalog.c 			    const hfsplus_btree_key *k2)
k2                 35 fs/hfsplus/catalog.c 	k2p = k2->cat.parent;
k2                 39 fs/hfsplus/catalog.c 	return hfsplus_strcmp(&k1->cat.name, &k2->cat.name);
k2                 21 fs/hfsplus/extents.c 			const hfsplus_btree_key *k2)
k2                 27 fs/hfsplus/extents.c 	k2id = k2->ext.cnid;
k2                 31 fs/hfsplus/extents.c 	if (k1->ext.fork_type != k2->ext.fork_type)
k2                 32 fs/hfsplus/extents.c 		return k1->ext.fork_type < k2->ext.fork_type ? -1 : 1;
k2                 35 fs/hfsplus/extents.c 	k2s = k2->ext.start_block;
k2                375 fs/hfsplus/hfsplus_fs.h 			     const hfsplus_btree_key *k2);
k2                446 fs/hfsplus/hfsplus_fs.h 			     const hfsplus_btree_key *k2);
k2                448 fs/hfsplus/hfsplus_fs.h 			    const hfsplus_btree_key *k2);
k2                468 fs/hfsplus/hfsplus_fs.h 			const hfsplus_btree_key *k2);
k2                133 fs/reiserfs/stree.c 			const struct reiserfs_key *k2)
k2                135 fs/reiserfs/stree.c 	return memcmp(k1, k2, sizeof(struct reiserfs_key));
k2                267 fs/xfs/libxfs/xfs_alloc_btree.c 	union xfs_btree_key	*k2)
k2                270 fs/xfs/libxfs/xfs_alloc_btree.c 			  be32_to_cpu(k2->alloc.ar_startblock);
k2                277 fs/xfs/libxfs/xfs_alloc_btree.c 	union xfs_btree_key	*k2)
k2                282 fs/xfs/libxfs/xfs_alloc_btree.c 		be32_to_cpu(k2->alloc.ar_blockcount);
k2                287 fs/xfs/libxfs/xfs_alloc_btree.c 		be32_to_cpu(k2->alloc.ar_startblock);
k2                387 fs/xfs/libxfs/xfs_alloc_btree.c 	union xfs_btree_key	*k2)
k2                390 fs/xfs/libxfs/xfs_alloc_btree.c 	       be32_to_cpu(k2->alloc.ar_startblock);
k2                408 fs/xfs/libxfs/xfs_alloc_btree.c 	union xfs_btree_key	*k2)
k2                411 fs/xfs/libxfs/xfs_alloc_btree.c 		be32_to_cpu(k2->alloc.ar_blockcount) ||
k2                412 fs/xfs/libxfs/xfs_alloc_btree.c 		(k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
k2                414 fs/xfs/libxfs/xfs_alloc_btree.c 		 be32_to_cpu(k2->alloc.ar_startblock));
k2                401 fs/xfs/libxfs/xfs_bmap_btree.c 	union xfs_btree_key	*k2)
k2                404 fs/xfs/libxfs/xfs_bmap_btree.c 	uint64_t		b = be64_to_cpu(k2->bmbt.br_startoff);
k2                502 fs/xfs/libxfs/xfs_bmap_btree.c 	union xfs_btree_key	*k2)
k2                505 fs/xfs/libxfs/xfs_bmap_btree.c 		be64_to_cpu(k2->bmbt.br_startoff);
k2                156 fs/xfs/libxfs/xfs_btree.h 				union xfs_btree_key *k2);
k2                246 fs/xfs/libxfs/xfs_ialloc_btree.c 	union xfs_btree_key	*k2)
k2                249 fs/xfs/libxfs/xfs_ialloc_btree.c 			  be32_to_cpu(k2->inobt.ir_startino);
k2                344 fs/xfs/libxfs/xfs_ialloc_btree.c 	union xfs_btree_key	*k2)
k2                347 fs/xfs/libxfs/xfs_ialloc_btree.c 		be32_to_cpu(k2->inobt.ir_startino);
k2                194 fs/xfs/libxfs/xfs_refcount_btree.c 	union xfs_btree_key	*k2)
k2                197 fs/xfs/libxfs/xfs_refcount_btree.c 			  be32_to_cpu(k2->refc.rc_startblock);
k2                275 fs/xfs/libxfs/xfs_refcount_btree.c 	union xfs_btree_key	*k2)
k2                278 fs/xfs/libxfs/xfs_refcount_btree.c 	       be32_to_cpu(k2->refc.rc_startblock);
k2                259 fs/xfs/libxfs/xfs_rmap_btree.c 	union xfs_btree_key	*k2)
k2                262 fs/xfs/libxfs/xfs_rmap_btree.c 	struct xfs_rmap_key	*kp2 = &k2->rmap;
k2                374 fs/xfs/libxfs/xfs_rmap_btree.c 	union xfs_btree_key	*k2)
k2                382 fs/xfs/libxfs/xfs_rmap_btree.c 	y = be32_to_cpu(k2->rmap.rm_startblock);
k2                388 fs/xfs/libxfs/xfs_rmap_btree.c 	b = be64_to_cpu(k2->rmap.rm_owner);
k2                394 fs/xfs/libxfs/xfs_rmap_btree.c 	b = XFS_RMAP_OFF(be64_to_cpu(k2->rmap.rm_offset));
k2                 22 include/linux/btree-128.h static inline void *btree_lookup128(struct btree_head128 *head, u64 k1, u64 k2)
k2                 24 include/linux/btree-128.h 	u64 key[2] = {k1, k2};
k2                 29 include/linux/btree-128.h 				      u64 *k1, u64 *k2)
k2                 31 include/linux/btree-128.h 	u64 key[2] = {*k1, *k2};
k2                 37 include/linux/btree-128.h 	*k2 = key[1];
k2                 41 include/linux/btree-128.h static inline int btree_insert128(struct btree_head128 *head, u64 k1, u64 k2,
k2                 44 include/linux/btree-128.h 	u64 key[2] = {k1, k2};
k2                 49 include/linux/btree-128.h static inline int btree_update128(struct btree_head128 *head, u64 k1, u64 k2,
k2                 52 include/linux/btree-128.h 	u64 key[2] = {k1, k2};
k2                 57 include/linux/btree-128.h static inline void *btree_remove128(struct btree_head128 *head, u64 k1, u64 k2)
k2                 59 include/linux/btree-128.h 	u64 key[2] = {k1, k2};
k2                 63 include/linux/btree-128.h static inline void *btree_last128(struct btree_head128 *head, u64 *k1, u64 *k2)
k2                 71 include/linux/btree-128.h 		*k2 = key[1];
k2                106 include/linux/btree-128.h #define btree_for_each_safe128(head, k1, k2, val)	\
k2                107 include/linux/btree-128.h 	for (val = btree_last128(head, &k1, &k2);	\
k2                109 include/linux/btree-128.h 	     val = btree_get_prev128(head, &k1, &k2))
k2                467 net/netfilter/nft_set_hash.c 	u32 hash, k1, k2;
k2                473 net/netfilter/nft_set_hash.c 		k2 = *(u32 *)nft_set_ext_key(&he->ext)->data;
k2                474 net/netfilter/nft_set_hash.c 		if (k1 == k2 &&
k2               1035 scripts/kconfig/expr.c 	enum string_value_kind k1 = k_string, k2 = k_string;
k2               1076 scripts/kconfig/expr.c 		k2 = expr_parse_string(str2, e->right.sym->type, &rval);
k2               1079 scripts/kconfig/expr.c 	if (k1 == k_string || k2 == k_string)
k2               1081 scripts/kconfig/expr.c 	else if (k1 == k_unsigned || k2 == k_unsigned)
k2                417 security/selinux/ss/policydb.c static int filenametr_cmp(struct hashtab *h, const void *k1, const void *k2)
k2                420 security/selinux/ss/policydb.c 	const struct filename_trans *ft2 = k2;
k2                447 security/selinux/ss/policydb.c static int rangetr_cmp(struct hashtab *h, const void *k1, const void *k2)
k2                449 security/selinux/ss/policydb.c 	const struct range_trans *key1 = k1, *key2 = k2;
k2               1380 tools/lib/bpf/btf.c static bool btf_dedup_equal_fn(const void *k1, const void *k2, void *ctx)
k2               1382 tools/lib/bpf/btf.c 	return k1 == k2;
k2               2946 tools/lib/bpf/libbpf.c static bool bpf_core_equal_fn(const void *k1, const void *k2, void *ctx)
k2               2948 tools/lib/bpf/libbpf.c 	return k1 == k2;
k2                259 tools/testing/selftests/bpf/test_hashmap.c 	void *k1 = (void *)0, *k2 = (void *)1;
k2                287 tools/testing/selftests/bpf/test_hashmap.c 	err = hashmap__append(map, k2, (void *)8);
k2                290 tools/testing/selftests/bpf/test_hashmap.c 	err = hashmap__append(map, k2, (void *)16);
k2                293 tools/testing/selftests/bpf/test_hashmap.c 	err = hashmap__append(map, k2, (void *)32);
k2                321 tools/testing/selftests/bpf/test_hashmap.c 	hashmap__for_each_key_entry(map, entry, k2) {