/linux-master/drivers/i2c/busses/ |
H A D | i2c-npcm7xx.c | 1806 u32 k2 = 0; local 1844 k2 = 48; 1853 k2 = clk_coef(src_clk_khz, 900); 1867 k2 = clk_coef(src_clk_khz, 380); 1889 k2 = round_up(k2 + 1, 2); 1891 k2 < SCLFRQ_MIN || k2 > SCLFRQ_MAX) 1910 * k2 = 2 * SCLLT7-0 -> High Time = k2 / [all...] |
/linux-master/drivers/md/dm-vdo/ |
H A D | murmurhash3.c | 54 u64 k2 = get_unaligned_le64(&blocks[i * 2 + 1]); local 65 k2 *= c2; 66 k2 = ROTL64(k2, 33); 67 k2 *= c1; 68 h2 ^= k2; 81 u64 k2 = 0; local 85 k2 ^= ((u64)tail[14]) << 48; 88 k2 ^= ((u64)tail[13]) << 40; 91 k2 [all...] |
/linux-master/drivers/media/usb/gspca/ |
H A D | sonixj.c | 1802 u8 k2; local 1804 k2 = (brightness - 0x80) >> 2; 1807 if (k2 > 0x1f) 1808 k2 = 0; /* only positive Y offset */ 1841 reg_w1(gspca_dev, 0x96, k2); /* color matrix Y offset */ 1847 u8 k2; local 1850 k2 = sd->contrast->val * 37 / (CONTRAST_MAX + 1) 1852 contrast[0] = (k2 + 1) / 2; /* red */ 1854 contrast[2] = k2; /* green */ 1856 contrast[4] = k2 / [all...] |
/linux-master/drivers/net/ethernet/netronome/nfp/flower/ |
H A D | conntrack.h | 18 char *k1, *m1, *k2, *m2; \ 22 k2 = (char *)_match2.key; \ 26 (k2[i] & m1[i] & m2[i])) { \
|
/linux-master/drivers/net/wireless/intel/iwlwifi/fw/api/ |
H A D | sta.h | 435 * @k2: unused 444 u8 k2[16]; member in struct:iwl_mvm_mgmt_mcast_key_cmd_v1
|
/linux-master/fs/bcachefs/ |
H A D | bset.c | 187 struct bkey_packed *k2 = __btree_node_offset_to_key(b, set->k); local 188 struct bset_tree *t = bch2_bkey_to_bset(b, k2); 190 k2->_data - bset(b, t)->_data); 257 struct bkey k2 = bkey_unpack_key(b, insert); local 261 bch2_bkey_to_text(&buf2, &k2); 276 struct bkey k2 = bkey_unpack_key(b, next); local 280 bch2_bkey_to_text(&buf2, &k2);
|
H A D | btree_iter.c | 495 struct bkey_packed *k, *k2, *p; local 505 k2 = bch2_btree_node_iter_bset_pos(node_iter, b, t); 507 while ((p = bch2_bkey_prev_all(b, t, k2)) && 509 k2 = p; 515 b, t, k2); 2046 struct bkey_s_c k, k2; local 2083 (k2 = btree_trans_peek_key_cache(iter, k.k->p)).k) { 2084 k = k2;
|
H A D | extents.c | 893 bool bch2_extents_match(struct bkey_s_c k1, struct bkey_s_c k2) argument 895 if (k1.k->type != k2.k->type) 900 struct bkey_ptrs_c ptrs2 = bch2_bkey_ptrs_c(k2); 904 if (bkey_extent_is_unwritten(k1) != bkey_extent_is_unwritten(k2)) 908 bkey_for_each_ptr_decode(k2.k, ptrs2, p2, entry2) 912 (s64) p2.ptr.offset + p2.crc.offset - bkey_start_offset(k2.k)) 923 bch2_extent_has_ptr(struct bkey_s_c k1, struct extent_ptr_decoded p1, struct bkey_s k2) argument 925 struct bkey_ptrs ptrs2 = bch2_bkey_ptrs(k2); 929 bkey_for_each_ptr_decode(k2.k, ptrs2, p2, entry2) 933 (s64) p2.ptr.offset + p2.crc.offset - bkey_start_offset(k2 [all...] |
H A D | fsck.c | 1359 struct bkey_s_c k1, k2; local 1392 k2 = bch2_btree_iter_peek_upto(&iter2, POS(pos1.inode, U64_MAX)); 1393 ret = bkey_err(k2); 1397 if (bpos_ge(k2.k->p, pos2.p)) 1402 bch2_bkey_val_to_text(&buf, c, k2); 1404 if (bpos_gt(k2.k->p, pos2.p) || 1405 pos2.size != k2.k->size) { 1422 swap(k1, k2); 1425 trans->extra_disk_res += bch2_bkey_sectors_compressed(k2); 1429 k1, k2) [all...] |
H A D | sb-clean.c | 103 struct bkey_i *k1, *k2; local 107 k2 = btree_root_find(c, NULL, j, i, &l2); 109 if (!k1 && !k2) 120 if (k2) 121 bch2_bkey_val_to_text(&buf2, c, bkey_i_to_s_c(k2)); 125 mustfix_fsck_err_on(!k1 || !k2 || 127 IS_ERR(k2) || 128 k1->k.u64s != k2->k.u64s || 129 memcmp(k1, k2, bkey_bytes(&k1->k)) ||
|
/linux-master/fs/btrfs/ |
H A D | ctree.c | 761 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)
|
H A D | ctree.h | 492 int __pure btrfs_comp_cpu_keys(const struct btrfs_key *k1, const struct btrfs_key *k2); 501 const struct btrfs_key *k2) 505 return btrfs_comp_cpu_keys(k1, k2); 512 const struct btrfs_key *k2) 518 return btrfs_comp_cpu_keys(&k1, k2); 500 btrfs_comp_keys(const struct btrfs_disk_key *disk_key, const struct btrfs_key *k2) argument 511 btrfs_comp_keys(const struct btrfs_disk_key *disk, const struct btrfs_key *k2) argument
|
/linux-master/fs/hfsplus/ |
H A D | attributes.c | 36 const hfsplus_btree_key *k2) 41 k2_cnid = k2->attr.cnid; 47 (const struct hfsplus_unistr *)&k2->attr.key_name); 35 hfsplus_attr_bin_cmp_key(const hfsplus_btree_key *k1, const hfsplus_btree_key *k2) argument
|
H A D | catalog.c | 17 const hfsplus_btree_key *k2) 22 k2p = k2->cat.parent; 26 return hfsplus_strcasecmp(&k1->cat.name, &k2->cat.name); 30 const hfsplus_btree_key *k2) 35 k2p = k2->cat.parent; 39 return hfsplus_strcmp(&k1->cat.name, &k2->cat.name); 16 hfsplus_cat_case_cmp_key(const hfsplus_btree_key *k1, const hfsplus_btree_key *k2) argument 29 hfsplus_cat_bin_cmp_key(const hfsplus_btree_key *k1, const hfsplus_btree_key *k2) argument
|
H A D | extents.c | 21 const hfsplus_btree_key *k2) 27 k2id = k2->ext.cnid; 31 if (k1->ext.fork_type != k2->ext.fork_type) 32 return k1->ext.fork_type < k2->ext.fork_type ? -1 : 1; 35 k2s = k2->ext.start_block; 20 hfsplus_ext_cmp_key(const hfsplus_btree_key *k1, const hfsplus_btree_key *k2) argument
|
H A D | hfsplus_fs.h | 367 const hfsplus_btree_key *k2); 438 const hfsplus_btree_key *k2); 440 const hfsplus_btree_key *k2); 460 const hfsplus_btree_key *k2);
|
/linux-master/fs/ntfs3/ |
H A D | index.c | 73 const u32 *k2 = key2; local 78 if (*k1 < *k2) 80 if (*k1 > *k2) 92 const struct SECURITY_KEY *k2 = key2; local 99 t2 = le32_to_cpu(k2->hash); 110 t2 = le32_to_cpu(k2->sec_id); 127 const __le32 *k2 = key2; local 134 * k1, k2 - pointers to REPARSE_KEY 138 k2 += 1; // Skip REPARSE_KEY.ReparseTag 150 for (count = min(l1, l2) >> 2; count > 0; --count, ++k1, ++k2) { [all...] |
/linux-master/fs/reiserfs/ |
H A D | stree.c | 38 * form. k2 is pointer to cpu variable. For key of items of the same 63 * form. k2 is pointer to cpu variable. 133 const struct reiserfs_key *k2) 135 return memcmp(k1, k2, sizeof(struct reiserfs_key)); 132 comp_le_keys(const struct reiserfs_key *k1, const struct reiserfs_key *k2) argument
|
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_alloc_btree.c | 281 const union xfs_btree_key *k2, 287 be32_to_cpu(k2->alloc.ar_startblock); 294 const union xfs_btree_key *k2, 303 be32_to_cpu(k2->alloc.ar_blockcount); 308 be32_to_cpu(k2->alloc.ar_startblock); 424 const union xfs_btree_key *k2) 427 be32_to_cpu(k2->alloc.ar_startblock); 445 const union xfs_btree_key *k2) 448 be32_to_cpu(k2->alloc.ar_blockcount) || 449 (k1->alloc.ar_blockcount == k2 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...] |
H A D | xfs_bmap_btree.c | 385 const union xfs_btree_key *k2, 389 uint64_t b = be64_to_cpu(k2->bmbt.br_startoff); 489 const union xfs_btree_key *k2) 492 be64_to_cpu(k2->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 D | xfs_btree.h | 197 /* check that k1 is lower than k2 */ 200 const union xfs_btree_key *k2);
|
H A D | xfs_ialloc_btree.c | 280 const union xfs_btree_key *k2, 286 be32_to_cpu(k2->inobt.ir_startino); 381 const union xfs_btree_key *k2) 384 be32_to_cpu(k2->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 D | xfs_refcount_btree.c | 196 const union xfs_btree_key *k2, 202 be32_to_cpu(k2->refc.rc_startblock); 291 const union xfs_btree_key *k2) 294 be32_to_cpu(k2->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 D | xfs_rmap_btree.c | 274 const union xfs_btree_key *k2, 278 const struct xfs_rmap_key *kp2 = &k2->rmap; 412 const union xfs_btree_key *k2) 420 y = be32_to_cpu(k2->rmap.rm_startblock); 426 b = be64_to_cpu(k2->rmap.rm_owner); 432 b = offset_keymask(be64_to_cpu(k2->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
|
/linux-master/fs/xfs/scrub/ |
H A D | rcbag_btree.c | 75 const union xfs_btree_key *k2, 79 const struct rcbag_key *kp2 = (const struct rcbag_key *)k2; 100 const union xfs_btree_key *k2) 103 const struct rcbag_key *kp2 = (const struct rcbag_key *)k2; 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
|