keyp 128 crypto/adiantum.c u8 *keyp; keyp 160 crypto/adiantum.c keyp = data->derived_keys; keyp 167 crypto/adiantum.c err = crypto_cipher_setkey(tctx->blockcipher, keyp, keyp 174 crypto/adiantum.c keyp += BLOCKCIPHER_KEY_SIZE; keyp 177 crypto/adiantum.c poly1305_core_setkey(&tctx->header_hash_key, keyp); keyp 178 crypto/adiantum.c keyp += POLY1305_BLOCK_SIZE; keyp 183 crypto/adiantum.c err = crypto_shash_setkey(tctx->hash, keyp, NHPOLY1305_KEY_SIZE); keyp 186 crypto/adiantum.c keyp += NHPOLY1305_KEY_SIZE; keyp 187 crypto/adiantum.c WARN_ON(keyp != &data->derived_keys[ARRAY_SIZE(data->derived_keys)]); keyp 778 drivers/net/hyperv/rndis_filter.c u8 *keyp; keyp 813 drivers/net/hyperv/rndis_filter.c keyp = (u8 *)((unsigned long)rssp + rssp->hashkey_offset); keyp 814 drivers/net/hyperv/rndis_filter.c memcpy(keyp, rss_key, NETVSC_HASH_KEYLEN); keyp 168 fs/dax.c unsigned int mode, int sync, void *keyp) keyp 170 fs/dax.c struct exceptional_entry_key *key = keyp; keyp 217 fs/fuse/cuse.c static int cuse_parse_one(char **pp, char *end, char **keyp, char **valp) keyp 250 fs/fuse/cuse.c *keyp = key; keyp 197 fs/nilfs2/bmap.c int nilfs_bmap_seek_key(struct nilfs_bmap *bmap, __u64 start, __u64 *keyp) keyp 202 fs/nilfs2/bmap.c ret = bmap->b_ops->bop_seek_key(bmap, start, keyp); keyp 210 fs/nilfs2/bmap.c int nilfs_bmap_last_key(struct nilfs_bmap *bmap, __u64 *keyp) keyp 215 fs/nilfs2/bmap.c ret = bmap->b_ops->bop_last_key(bmap, keyp); keyp 151 fs/nilfs2/bmap.h int nilfs_bmap_seek_key(struct nilfs_bmap *bmap, __u64 start, __u64 *keyp); keyp 152 fs/nilfs2/bmap.h int nilfs_bmap_last_key(struct nilfs_bmap *bmap, __u64 *keyp); keyp 262 fs/nilfs2/btree.c __u64 *keyp, __u64 *ptrp, int ncmax) keyp 275 fs/nilfs2/btree.c if (keyp != NULL) keyp 276 fs/nilfs2/btree.c *keyp = key; keyp 599 fs/nilfs2/btree.c __u64 *keyp, __u64 *ptrp) keyp 628 fs/nilfs2/btree.c if (keyp != NULL) keyp 629 fs/nilfs2/btree.c *keyp = nilfs_btree_node_get_key(node, index); keyp 800 fs/nilfs2/btree.c int level, __u64 *keyp, __u64 *ptrp) keyp 809 fs/nilfs2/btree.c *keyp, *ptrp, ncblk); keyp 820 fs/nilfs2/btree.c *keyp, *ptrp, keyp 827 fs/nilfs2/btree.c int level, __u64 *keyp, __u64 *ptrp) keyp 868 fs/nilfs2/btree.c nilfs_btree_do_insert(btree, path, level, keyp, ptrp); keyp 873 fs/nilfs2/btree.c int level, __u64 *keyp, __u64 *ptrp) keyp 915 fs/nilfs2/btree.c nilfs_btree_do_insert(btree, path, level, keyp, ptrp); keyp 920 fs/nilfs2/btree.c int level, __u64 *keyp, __u64 *ptrp) keyp 947 fs/nilfs2/btree.c *keyp, *ptrp, ncblk); keyp 949 fs/nilfs2/btree.c *keyp = nilfs_btree_node_get_key(right, 0); keyp 956 fs/nilfs2/btree.c nilfs_btree_do_insert(btree, path, level, keyp, ptrp); keyp 958 fs/nilfs2/btree.c *keyp = nilfs_btree_node_get_key(right, 0); keyp 970 fs/nilfs2/btree.c int level, __u64 *keyp, __u64 *ptrp) keyp 991 fs/nilfs2/btree.c nilfs_btree_do_insert(btree, path, level, keyp, ptrp); keyp 993 fs/nilfs2/btree.c *keyp = nilfs_btree_node_get_key(child, 0); keyp 1250 fs/nilfs2/btree.c int level, __u64 *keyp, __u64 *ptrp) keyp 1259 fs/nilfs2/btree.c keyp, ptrp, ncblk); keyp 1268 fs/nilfs2/btree.c keyp, ptrp, keyp 1275 fs/nilfs2/btree.c int level, __u64 *keyp, __u64 *ptrp) keyp 1280 fs/nilfs2/btree.c nilfs_btree_do_delete(btree, path, level, keyp, ptrp); keyp 1307 fs/nilfs2/btree.c int level, __u64 *keyp, __u64 *ptrp) keyp 1312 fs/nilfs2/btree.c nilfs_btree_do_delete(btree, path, level, keyp, ptrp); keyp 1340 fs/nilfs2/btree.c int level, __u64 *keyp, __u64 *ptrp) keyp 1345 fs/nilfs2/btree.c nilfs_btree_do_delete(btree, path, level, keyp, ptrp); keyp 1366 fs/nilfs2/btree.c int level, __u64 *keyp, __u64 *ptrp) keyp 1371 fs/nilfs2/btree.c nilfs_btree_do_delete(btree, path, level, keyp, ptrp); keyp 1391 fs/nilfs2/btree.c int level, __u64 *keyp, __u64 *ptrp) keyp 1396 fs/nilfs2/btree.c nilfs_btree_do_delete(btree, path, level, keyp, ptrp); keyp 1415 fs/nilfs2/btree.c int level, __u64 *keyp, __u64 *ptrp) keyp 1601 fs/nilfs2/btree.c __u64 *keyp) keyp 1613 fs/nilfs2/btree.c *keyp = start; keyp 1615 fs/nilfs2/btree.c ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp); keyp 1621 fs/nilfs2/btree.c static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp) keyp 1630 fs/nilfs2/btree.c ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL); keyp 165 fs/nilfs2/direct.c __u64 *keyp) keyp 172 fs/nilfs2/direct.c *keyp = key; keyp 179 fs/nilfs2/direct.c static int nilfs_direct_last_key(const struct nilfs_bmap *direct, __u64 *keyp) keyp 192 fs/nilfs2/direct.c *keyp = lastkey; keyp 266 fs/xfs/libxfs/xfs_bmap.c xfs_bmbt_key_t *prevp, *keyp; keyp 273 fs/xfs/libxfs/xfs_bmap.c keyp = XFS_BMBT_KEY_ADDR(mp, block, i); keyp 277 fs/xfs/libxfs/xfs_bmap.c be64_to_cpu(keyp->br_startoff)); keyp 279 fs/xfs/libxfs/xfs_bmap.c prevp = keyp; keyp 132 fs/xfs/scrub/btree.c union xfs_btree_key *keyp; keyp 154 fs/xfs/scrub/btree.c keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[1], keyblock); keyp 155 fs/xfs/scrub/btree.c if (cur->bc_ops->diff_two_keys(cur, &key, keyp) < 0) keyp 163 fs/xfs/scrub/btree.c keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[1], keyblock); keyp 164 fs/xfs/scrub/btree.c if (cur->bc_ops->diff_two_keys(cur, keyp, &hkey) < 0) keyp 179 fs/xfs/scrub/btree.c union xfs_btree_key *keyp; keyp 201 fs/xfs/scrub/btree.c keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1], keyblock); keyp 202 fs/xfs/scrub/btree.c if (cur->bc_ops->diff_two_keys(cur, key, keyp) < 0) keyp 210 fs/xfs/scrub/btree.c keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level + 1], keyblock); keyp 211 fs/xfs/scrub/btree.c if (cur->bc_ops->diff_two_keys(cur, keyp, key) < 0) keyp 32 security/selinux/ss/avtab.c static inline int avtab_hash(struct avtab_key *keyp, u32 mask) keyp 53 security/selinux/ss/avtab.c mix(keyp->target_class); keyp 54 security/selinux/ss/avtab.c mix(keyp->target_type); keyp 55 security/selinux/ss/avtab.c mix(keyp->source_type); keyp 14 security/selinux/ss/symtab.c const char *p, *keyp; keyp 19 security/selinux/ss/symtab.c keyp = key; keyp 20 security/selinux/ss/symtab.c size = strlen(keyp); keyp 21 security/selinux/ss/symtab.c for (p = keyp; (p - keyp) < size; p++) keyp 4238 security/smack/smack_lsm.c struct key *keyp; keyp 4250 security/smack/smack_lsm.c keyp = key_ref_to_ptr(key_ref); keyp 4251 security/smack/smack_lsm.c if (keyp == NULL) keyp 4257 security/smack/smack_lsm.c if (keyp->security == NULL) keyp 4270 security/smack/smack_lsm.c ad.a.u.key_struct.key = keyp->serial; keyp 4271 security/smack/smack_lsm.c ad.a.u.key_struct.key_desc = keyp->description; keyp 4277 security/smack/smack_lsm.c rc = smk_access(tkp, keyp->security, request, &ad); keyp 4278 security/smack/smack_lsm.c rc = smk_bu_note("key access", tkp, keyp->security, request, rc);