Home
last modified time | relevance | path

Searched refs:k1 (Results 1 – 23 of 23) sorted by relevance

/fs/bcachefs/
A Dsb-clean.c107 struct bkey_i *k1, *k2; in bch2_verify_superblock_clean() local
110 k1 = btree_root_find(c, clean, NULL, i, &l1); in bch2_verify_superblock_clean()
113 if (!k1 && !k2) in bch2_verify_superblock_clean()
119 if (k1) in bch2_verify_superblock_clean()
120 bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(k1)); in bch2_verify_superblock_clean()
129 mustfix_fsck_err_on(!k1 || !k2 || in bch2_verify_superblock_clean()
130 IS_ERR(k1) || in bch2_verify_superblock_clean()
132 k1->k.u64s != k2->k.u64s || in bch2_verify_superblock_clean()
133 memcmp(k1, k2, bkey_bytes(&k1->k)) || in bch2_verify_superblock_clean()
A Dsiphash.c88 u64 k0, k1; in SipHash_Init() local
91 k1 = le64_to_cpu(key->k1); in SipHash_Init()
94 ctx->v[1] = 0x646f72616e646f6dULL ^ k1; in SipHash_Init()
96 ctx->v[3] = 0x7465646279746573ULL ^ k1; in SipHash_Init()
A Dstr_hash.c90 struct bkey_s_c k1, in hash_pick_winner() argument
93 if (bkey_val_bytes(k1.k) == bkey_val_bytes(k2.k) && in hash_pick_winner()
94 !memcmp(k1.v, k2.v, bkey_val_bytes(k1.k))) in hash_pick_winner()
99 int ret = bch2_dirent_has_target(trans, bkey_s_c_to_dirent(k1)); in hash_pick_winner()
198 prt_printf(&buf, " %llx %llx", hash_info->siphash_key.k0, hash_info->siphash_key.k1); in bch2_repair_inode_hash_info()
A Dextents.c1046 bool bch2_extents_match(struct bkey_s_c k1, struct bkey_s_c k2) in bch2_extents_match() argument
1048 if (k1.k->type != k2.k->type) in bch2_extents_match()
1051 if (bkey_extent_is_direct_data(k1.k)) { in bch2_extents_match()
1052 struct bkey_ptrs_c ptrs1 = bch2_bkey_ptrs_c(k1); in bch2_extents_match()
1057 if (bkey_extent_is_unwritten(k1) != bkey_extent_is_unwritten(k2)) in bch2_extents_match()
1060 bkey_for_each_ptr_decode(k1.k, ptrs1, p1, entry1) in bch2_extents_match()
1071 (s64) p1.ptr.offset + p1.crc.offset - bkey_start_offset(k1.k) == in bch2_extents_match()
1097 bch2_extent_has_ptr(struct bkey_s_c k1, struct extent_ptr_decoded p1, struct bkey_s k2) in bch2_extent_has_ptr() argument
1106 (s64) p1.ptr.offset + p1.crc.offset - bkey_start_offset(k1.k) == in bch2_extent_has_ptr()
A Dsiphash.h66 __le64 k1; member
A Dbset.c252 struct bkey k1 = bkey_unpack_key(b, prev); in __bch2_verify_insert_pos() local
256 bch2_bkey_to_text(&buf1, &k1); in __bch2_verify_insert_pos()
271 struct bkey k1 = bkey_unpack_key(b, insert); in __bch2_verify_insert_pos() local
275 bch2_bkey_to_text(&buf1, &k1); in __bch2_verify_insert_pos()
A Dfsck.c1690 struct bkey_s_c k1, k2; in overlapping_extents_found() local
1698 k1 = bch2_btree_iter_peek_max(trans, &iter1, POS(pos1.inode, U64_MAX)); in overlapping_extents_found()
1699 ret = bkey_err(k1); in overlapping_extents_found()
1704 bch2_bkey_val_to_text(&buf, c, k1); in overlapping_extents_found()
1706 if (!bpos_eq(pos1, k1.k->p)) { in overlapping_extents_found()
1753 swap(k1, k2); in overlapping_extents_found()
1760 k1, k2) ?: in overlapping_extents_found()
/fs/xfs/libxfs/
A Dxfs_alloc_btree.c216 const union xfs_btree_key *k1, in xfs_bnobt_cmp_two_keys() argument
222 return cmp_int(be32_to_cpu(k1->alloc.ar_startblock), in xfs_bnobt_cmp_two_keys()
229 const union xfs_btree_key *k1, in xfs_cntbt_cmp_two_keys() argument
236 return cmp_int(be32_to_cpu(k1->alloc.ar_blockcount), in xfs_cntbt_cmp_two_keys()
238 cmp_int(be32_to_cpu(k1->alloc.ar_startblock), in xfs_cntbt_cmp_two_keys()
354 const union xfs_btree_key *k1, in xfs_bnobt_keys_inorder() argument
357 return be32_to_cpu(k1->alloc.ar_startblock) < in xfs_bnobt_keys_inorder()
375 const union xfs_btree_key *k1, in xfs_cntbt_keys_inorder() argument
378 return be32_to_cpu(k1->alloc.ar_blockcount) < in xfs_cntbt_keys_inorder()
380 (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount && in xfs_cntbt_keys_inorder()
[all …]
A Dxfs_rmap_btree.c263 const union xfs_btree_key *k1, in xfs_rmapbt_cmp_two_keys() argument
267 const struct xfs_rmap_key *kp1 = &k1->rmap; in xfs_rmapbt_cmp_two_keys()
396 const union xfs_btree_key *k1, in xfs_rmapbt_keys_inorder() argument
404 x = be32_to_cpu(k1->rmap.rm_startblock); in xfs_rmapbt_keys_inorder()
410 a = be64_to_cpu(k1->rmap.rm_owner); in xfs_rmapbt_keys_inorder()
416 a = offset_keymask(be64_to_cpu(k1->rmap.rm_offset)); in xfs_rmapbt_keys_inorder()
A Dxfs_refcount_btree.c194 const union xfs_btree_key *k1, in xfs_refcountbt_cmp_two_keys() argument
200 return cmp_int(be32_to_cpu(k1->refc.rc_startblock), in xfs_refcountbt_cmp_two_keys()
289 const union xfs_btree_key *k1, in xfs_refcountbt_keys_inorder() argument
292 return be32_to_cpu(k1->refc.rc_startblock) < in xfs_refcountbt_keys_inorder()
A Dxfs_rtrmap_btree.c205 const union xfs_btree_key *k1, in xfs_rtrmapbt_cmp_two_keys() argument
209 const struct xfs_rmap_key *kp1 = &k1->rmap; in xfs_rtrmapbt_cmp_two_keys()
310 const union xfs_btree_key *k1, in xfs_rtrmapbt_keys_inorder() argument
318 x = be32_to_cpu(k1->rmap.rm_startblock); in xfs_rtrmapbt_keys_inorder()
324 a = be64_to_cpu(k1->rmap.rm_owner); in xfs_rtrmapbt_keys_inorder()
330 a = offset_keymask(be64_to_cpu(k1->rmap.rm_offset)); in xfs_rtrmapbt_keys_inorder()
A Dxfs_rtrefcount_btree.c176 const union xfs_btree_key *k1, in xfs_rtrefcountbt_cmp_two_keys() argument
182 return cmp_int(be32_to_cpu(k1->refc.rc_startblock), in xfs_rtrefcountbt_cmp_two_keys()
255 const union xfs_btree_key *k1, in xfs_rtrefcountbt_keys_inorder() argument
258 return be32_to_cpu(k1->refc.rc_startblock) < in xfs_rtrefcountbt_keys_inorder()
A Dxfs_bmap_btree.c384 const union xfs_btree_key *k1, in xfs_bmbt_cmp_two_keys() argument
390 return cmp_int(be64_to_cpu(k1->bmbt.br_startoff), in xfs_bmbt_cmp_two_keys()
476 const union xfs_btree_key *k1, in xfs_bmbt_keys_inorder() argument
479 return be64_to_cpu(k1->bmbt.br_startoff) < in xfs_bmbt_keys_inorder()
A Dxfs_ialloc_btree.c280 const union xfs_btree_key *k1, in xfs_inobt_cmp_two_keys() argument
286 return cmp_int(be32_to_cpu(k1->inobt.ir_startino), in xfs_inobt_cmp_two_keys()
381 const union xfs_btree_key *k1, in xfs_inobt_keys_inorder() argument
384 return be32_to_cpu(k1->inobt.ir_startino) < in xfs_inobt_keys_inorder()
A Dxfs_btree.h196 const union xfs_btree_key *k1,
/fs/btrfs/
A Dctree.h508 int __pure btrfs_comp_cpu_keys(const struct btrfs_key *k1, const struct btrfs_key *k2);
519 const struct btrfs_key *k1 = (const struct btrfs_key *)disk_key; in btrfs_comp_keys() local
521 return btrfs_comp_cpu_keys(k1, k2); in btrfs_comp_keys()
530 struct btrfs_key k1; in btrfs_comp_keys() local
532 btrfs_disk_key_to_cpu(&k1, disk); in btrfs_comp_keys()
534 return btrfs_comp_cpu_keys(&k1, k2); in btrfs_comp_keys()
A Dctree.c707 int __pure btrfs_comp_cpu_keys(const struct btrfs_key *k1, const struct btrfs_key *k2) in btrfs_comp_cpu_keys() argument
709 if (k1->objectid > k2->objectid) in btrfs_comp_cpu_keys()
711 if (k1->objectid < k2->objectid) in btrfs_comp_cpu_keys()
713 if (k1->type > k2->type) in btrfs_comp_cpu_keys()
715 if (k1->type < k2->type) in btrfs_comp_cpu_keys()
717 if (k1->offset > k2->offset) in btrfs_comp_cpu_keys()
719 if (k1->offset < k2->offset) in btrfs_comp_cpu_keys()
/fs/xfs/scrub/
A Drcbag_btree.c65 const union xfs_btree_key *k1, in rcbagbt_cmp_two_keys() argument
69 const struct rcbag_key *kp1 = (const struct rcbag_key *)k1; in rcbagbt_cmp_two_keys()
81 const union xfs_btree_key *k1, in rcbagbt_keys_inorder() argument
84 const struct rcbag_key *kp1 = (const struct rcbag_key *)k1; in rcbagbt_keys_inorder()
/fs/hfsplus/
A Dcatalog.c16 int hfsplus_cat_case_cmp_key(const hfsplus_btree_key *k1, in hfsplus_cat_case_cmp_key() argument
21 k1p = k1->cat.parent; in hfsplus_cat_case_cmp_key()
26 return hfsplus_strcasecmp(&k1->cat.name, &k2->cat.name); in hfsplus_cat_case_cmp_key()
29 int hfsplus_cat_bin_cmp_key(const hfsplus_btree_key *k1, in hfsplus_cat_bin_cmp_key() argument
34 k1p = k1->cat.parent; in hfsplus_cat_bin_cmp_key()
39 return hfsplus_strcmp(&k1->cat.name, &k2->cat.name); in hfsplus_cat_bin_cmp_key()
A Dattributes.c35 int hfsplus_attr_bin_cmp_key(const hfsplus_btree_key *k1, in hfsplus_attr_bin_cmp_key() argument
40 k1_cnid = k1->attr.cnid; in hfsplus_attr_bin_cmp_key()
46 (const struct hfsplus_unistr *)&k1->attr.key_name, in hfsplus_attr_bin_cmp_key()
A Dextents.c20 int hfsplus_ext_cmp_key(const hfsplus_btree_key *k1, in hfsplus_ext_cmp_key() argument
26 k1id = k1->ext.cnid; in hfsplus_ext_cmp_key()
31 if (k1->ext.fork_type != k2->ext.fork_type) in hfsplus_ext_cmp_key()
32 return k1->ext.fork_type < k2->ext.fork_type ? -1 : 1; in hfsplus_ext_cmp_key()
34 k1s = k1->ext.start_block; in hfsplus_ext_cmp_key()
A Dhfsplus_fs.h368 int hfsplus_attr_bin_cmp_key(const hfsplus_btree_key *k1,
439 int hfsplus_cat_case_cmp_key(const hfsplus_btree_key *k1,
441 int hfsplus_cat_bin_cmp_key(const hfsplus_btree_key *k1,
461 int hfsplus_ext_cmp_key(const hfsplus_btree_key *k1,
/fs/ntfs3/
A Dindex.c72 const u32 *k1 = key1; in cmp_uint() local
78 if (*k1 < *k2) in cmp_uint()
80 if (*k1 > *k2) in cmp_uint()
91 const struct SECURITY_KEY *k1 = key1; in cmp_sdh() local
98 t1 = le32_to_cpu(k1->hash); in cmp_sdh()
109 t1 = le32_to_cpu(k1->sec_id); in cmp_sdh()
126 const __le32 *k1 = key1; in cmp_uints() local
137 k1 += 1; // Skip REPARSE_KEY.ReparseTag in cmp_uints()
150 for (count = min(l1, l2) >> 2; count > 0; --count, ++k1, ++k2) { in cmp_uints()
151 u32 t1 = le32_to_cpu(*k1); in cmp_uints()

Completed in 67 milliseconds