Searched refs:k1 (Results 1 - 25 of 87) sorted by last modified time

1234

/linux-master/drivers/md/dm-vdo/
H A Dmurmurhash3.c53 u64 k1 = get_unaligned_le64(&blocks[i * 2]); local
56 k1 *= c1;
57 k1 = ROTL64(k1, 31);
58 k1 *= c2;
59 h1 ^= k1;
80 u64 k1 = 0; local
111 k1 ^= ((u64)tail[7]) << 56;
114 k1 ^= ((u64)tail[6]) << 48;
117 k1
[all...]
/linux-master/fs/bcachefs/
H A Dsb-clean.c103 struct bkey_i *k1, *k2; local
106 k1 = btree_root_find(c, clean, NULL, i, &l1);
109 if (!k1 && !k2)
115 if (k1)
116 bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(k1));
125 mustfix_fsck_err_on(!k1 || !k2 ||
126 IS_ERR(k1) ||
128 k1->k.u64s != k2->k.u64s ||
129 memcmp(k1, k2, bkey_bytes(&k1
[all...]
H A Dextents.c893 bool bch2_extents_match(struct bkey_s_c k1, struct bkey_s_c k2) argument
895 if (k1.k->type != k2.k->type)
898 if (bkey_extent_is_direct_data(k1.k)) {
899 struct bkey_ptrs_c ptrs1 = bch2_bkey_ptrs_c(k1);
904 if (bkey_extent_is_unwritten(k1) != bkey_extent_is_unwritten(k2))
907 bkey_for_each_ptr_decode(k1.k, ptrs1, p1, entry1)
911 (s64) p1.ptr.offset + p1.crc.offset - bkey_start_offset(k1.k) ==
923 bch2_extent_has_ptr(struct bkey_s_c k1, struct extent_ptr_decoded p1, struct bkey_s k2) argument
932 (s64) p1.ptr.offset + p1.crc.offset - bkey_start_offset(k1.k) ==
H A Dfsck.c1359 struct bkey_s_c k1, k2; local
1367 k1 = bch2_btree_iter_peek_upto(&iter1, POS(pos1.inode, U64_MAX));
1368 ret = bkey_err(k1);
1373 bch2_bkey_val_to_text(&buf, c, k1);
1375 if (!bpos_eq(pos1, k1.k->p)) {
1422 swap(k1, k2);
1429 k1, k2) ?:
H A Dbset.c256 struct bkey k1 = bkey_unpack_key(b, prev); local
260 bch2_bkey_to_text(&buf1, &k1);
275 struct bkey k1 = bkey_unpack_key(b, insert); local
279 bch2_bkey_to_text(&buf1, &k1);
/linux-master/net/netfilter/
H A Dnft_set_hash.c540 u32 hash, k1, k2; local
542 k1 = *key;
543 hash = jhash_1word(k1, priv->seed);
547 if (k1 == k2 &&
560 u32 hash, k1; local
563 k1 = *(u32 *)key;
564 hash = jhash_1word(k1, priv->seed);
/linux-master/tools/lib/bpf/
H A Dlibbpf.c5685 static bool bpf_core_equal_fn(const long k1, const long k2, void *ctx) argument
5687 return k1 == k2;
H A Dbtf.c1817 static bool btf_dedup_equal_fn(long k1, long k2, void *ctx);
3385 static bool btf_dedup_equal_fn(long k1, long k2, void *ctx) argument
3387 return k1 == k2;
/linux-master/tools/bpf/bpftool/
H A Dgen.c1923 static bool btfgen_equal_fn(long k1, long k2, void *ctx) argument
1925 return k1 == k2;
/linux-master/arch/riscv/crypto/
H A Dsha256-riscv64-zvknha_or_zvknhb-zvkb.S102 .macro sha256_16rounds last, k0, k1, k2, k3
104 sha256_4rounds \last, \k1, W1, W2, W3, W0
/linux-master/drivers/i2c/busses/
H A Di2c-npcm7xx.c1805 u32 k1 = 0; local
1843 k1 = 80;
1852 k1 = clk_coef(src_clk_khz, 1600);
1866 k1 = clk_coef(src_clk_khz, 620);
1888 k1 = round_up(k1, 2);
1890 if (k1 < SCLFRQ_MIN || k1 > SCLFRQ_MAX ||
1909 * k1 = 2 * SCLLT7-0 -> Low Time = k1 /
[all...]
/linux-master/arch/mips/include/asm/
H A Dregdef.h144 #define k1 $27 macro
187 #define k1 $27 macro
/linux-master/sound/soc/intel/boards/
H A Dsof_board_helpers.h27 #define SOF_LINK_ORDER(k1, k2, k3, k4, k5, k6, k7) \
28 ((((k1) & SOF_LINK_ORDER_MASK) << (SOF_LINK_ORDER_SHIFT * 0)) | \
/linux-master/fs/xfs/scrub/
H A Drcbag_btree.c74 const union xfs_btree_key *k1,
78 const struct rcbag_key *kp1 = (const struct rcbag_key *)k1;
99 const union xfs_btree_key *k1,
102 const struct rcbag_key *kp1 = (const struct rcbag_key *)k1;
72 rcbagbt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument
97 rcbagbt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument
/linux-master/fs/xfs/libxfs/
H A Dxfs_rmap_btree.c273 const union xfs_btree_key *k1,
277 const struct xfs_rmap_key *kp1 = &k1->rmap;
411 const union xfs_btree_key *k1,
419 x = be32_to_cpu(k1->rmap.rm_startblock);
425 a = be64_to_cpu(k1->rmap.rm_owner);
431 a = offset_keymask(be64_to_cpu(k1->rmap.rm_offset));
271 xfs_rmapbt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument
409 xfs_rmapbt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument
H A Dxfs_refcount_btree.c195 const union xfs_btree_key *k1,
201 return (int64_t)be32_to_cpu(k1->refc.rc_startblock) -
290 const union xfs_btree_key *k1,
293 return be32_to_cpu(k1->refc.rc_startblock) <
193 xfs_refcountbt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument
288 xfs_refcountbt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument
H A Dxfs_ialloc_btree.c279 const union xfs_btree_key *k1,
285 return (int64_t)be32_to_cpu(k1->inobt.ir_startino) -
380 const union xfs_btree_key *k1,
383 return be32_to_cpu(k1->inobt.ir_startino) <
277 xfs_inobt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument
378 xfs_inobt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument
H A Dxfs_btree.h197 /* check that k1 is lower than k2 */
199 const union xfs_btree_key *k1,
H A Dxfs_bmap_btree.c384 const union xfs_btree_key *k1,
388 uint64_t a = be64_to_cpu(k1->bmbt.br_startoff);
488 const union xfs_btree_key *k1,
491 return be64_to_cpu(k1->bmbt.br_startoff) <
382 xfs_bmbt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument
486 xfs_bmbt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument
H A Dxfs_alloc_btree.c280 const union xfs_btree_key *k1,
286 return (int64_t)be32_to_cpu(k1->alloc.ar_startblock) -
293 const union xfs_btree_key *k1,
302 diff = be32_to_cpu(k1->alloc.ar_blockcount) -
307 return be32_to_cpu(k1->alloc.ar_startblock) -
423 const union xfs_btree_key *k1,
426 return be32_to_cpu(k1->alloc.ar_startblock) <
444 const union xfs_btree_key *k1,
447 return be32_to_cpu(k1->alloc.ar_blockcount) <
449 (k1
278 xfs_bnobt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument
291 xfs_cntbt_diff_two_keys( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2, const union xfs_btree_key *mask) argument
421 xfs_bnobt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument
442 xfs_cntbt_keys_inorder( struct xfs_btree_cur *cur, const union xfs_btree_key *k1, const union xfs_btree_key *k2) argument
[all...]
/linux-master/drivers/gpu/drm/radeon/
H A Dr100.c3201 fixed20_12 mc_latency_sclk, mc_latency_mclk, k1; local
3409 k1.full = dfixed_const(40);
3412 k1.full = dfixed_const(20);
3416 k1.full = dfixed_const(40);
3427 mc_latency_mclk.full += k1.full;
/linux-master/security/selinux/ss/
H A Dpolicydb.c418 static int filenametr_cmp(const void *k1, const void *k2) argument
420 const struct filename_trans_key *ft1 = k1;
454 static int rangetr_cmp(const void *k1, const void *k2) argument
456 const struct range_trans *key1 = k1, *key2 = k2;
491 static int role_trans_cmp(const void *k1, const void *k2) argument
493 const struct role_trans_key *key1 = k1, *key2 = k2;
/linux-master/net/sched/
H A Dsch_netem.c909 q->clg.a4 = ge->k1;
1129 .k1 = q->clg.a4,
/linux-master/fs/btrfs/
H A Dctree.h492 int __pure btrfs_comp_cpu_keys(const struct btrfs_key *k1, const struct btrfs_key *k2);
503 const struct btrfs_key *k1 = (const struct btrfs_key *)disk_key; local
505 return btrfs_comp_cpu_keys(k1, k2);
514 struct btrfs_key k1; local
516 btrfs_disk_key_to_cpu(&k1, disk);
518 return btrfs_comp_cpu_keys(&k1, k2);
H A Dctree.c761 int __pure btrfs_comp_cpu_keys(const struct btrfs_key *k1, const struct btrfs_key *k2) argument
763 if (k1->objectid > k2->objectid)
765 if (k1->objectid < k2->objectid)
767 if (k1->type > k2->type)
769 if (k1->type < k2->type)
771 if (k1->offset > k2->offset)
773 if (k1->offset < k2->offset)

Completed in 280 milliseconds

1234