Home
last modified time | relevance | path

Searched refs:keyp (Results 1 – 12 of 12) sorted by relevance

/linux/arch/riscv/crypto/
H A Daes-macros.S54 .macro aes_begin keyp, label128, label192
55 lwu t0, 480(\keyp) // t0 = key length in bytes
58 vle32.v v1, (\keyp)
59 addi \keyp, \keyp, 16
60 vle32.v v2, (\keyp)
61 addi \keyp, \keyp, 16
62 vle32.v v3, (\keyp)
63 addi \keyp, \keyp, 16
64 vle32.v v4, (\keyp)
65 addi \keyp, \keyp, 16
[all …]
/linux/tools/perf/ui/tui/
H A Dutil.c26 static int popup_menu__run(struct ui_browser *menu, int *keyp) in popup_menu__run() argument
48 if (keyp) { in popup_menu__run()
49 *keyp = key; in popup_menu__run()
63 int ui__popup_menu(int argc, char * const argv[], int *keyp) in ui__popup_menu() argument
72 return popup_menu__run(&menu, keyp); in ui__popup_menu()
/linux/fs/nilfs2/
H A Dbtree.c263 __u64 *keyp, __u64 *ptrp, int ncmax) in nilfs_btree_node_delete() argument
276 if (keyp != NULL) in nilfs_btree_node_delete()
277 *keyp = key; in nilfs_btree_node_delete()
611 __u64 *keyp, __u64 *ptrp) in nilfs_btree_do_lookup_last() argument
640 if (keyp != NULL) in nilfs_btree_do_lookup_last()
641 *keyp = nilfs_btree_node_get_key(node, index); in nilfs_btree_do_lookup_last()
815 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_do_insert()
824 *keyp, *ptrp, ncblk); in nilfs_btree_do_insert()
835 *keyp, *ptrp, in nilfs_btree_do_insert()
842 int level, __u64 *keyp, __u6 in nilfs_btree_carry_left()
816 nilfs_btree_do_insert(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_do_insert() argument
843 nilfs_btree_carry_left(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_carry_left() argument
889 nilfs_btree_carry_right(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_carry_right() argument
936 nilfs_btree_split(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_split() argument
986 nilfs_btree_grow(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_grow() argument
1266 nilfs_btree_do_delete(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_do_delete() argument
1291 nilfs_btree_borrow_left(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_borrow_left() argument
1323 nilfs_btree_borrow_right(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_borrow_right() argument
1356 nilfs_btree_concat_left(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_concat_left() argument
1382 nilfs_btree_concat_right(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_concat_right() argument
1407 nilfs_btree_shrink(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_shrink() argument
1431 nilfs_btree_nop(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_nop() argument
1617 nilfs_btree_seek_key(const struct nilfs_bmap * btree,__u64 start,__u64 * keyp) nilfs_btree_seek_key() argument
1637 nilfs_btree_last_key(const struct nilfs_bmap * btree,__u64 * keyp) nilfs_btree_last_key() argument
[all...]
H A Ddirect.c170 __u64 *keyp) in nilfs_direct_seek_key() argument
177 *keyp = key; in nilfs_direct_seek_key()
184 static int nilfs_direct_last_key(const struct nilfs_bmap *direct, __u64 *keyp) in nilfs_direct_last_key() argument
197 *keyp = lastkey; in nilfs_direct_last_key()
H A Dbmap.c185 * @keyp: place to store valid key in nilfs_bmap_do_delete()
188 * starting from @start, and stores it to @keyp if found.
196 int nilfs_bmap_seek_key(struct nilfs_bmap *bmap, __u64 start, __u64 *keyp)
201 ret = bmap->b_ops->bop_seek_key(bmap, start, keyp);
209 int nilfs_bmap_last_key(struct nilfs_bmap *bmap, __u64 *keyp) in nilfs_bmap_seek_key()
214 ret = bmap->b_ops->bop_last_key(bmap, keyp); in nilfs_bmap_seek_key()
205 nilfs_bmap_seek_key(struct nilfs_bmap * bmap,__u64 start,__u64 * keyp) nilfs_bmap_seek_key() argument
218 nilfs_bmap_last_key(struct nilfs_bmap * bmap,__u64 * keyp) nilfs_bmap_last_key() argument
H A Dbmap.h163 int nilfs_bmap_seek_key(struct nilfs_bmap *bmap, __u64 start, __u64 *keyp);
164 int nilfs_bmap_last_key(struct nilfs_bmap *bmap, __u64 *keyp);
/linux/fs/xfs/scrub/
H A Dbtree.c144 union xfs_btree_key *keyp; in xchk_btree_rec() local
167 keyp = xfs_btree_key_addr(cur, cur->bc_levels[1].ptr, keyblock); in xchk_btree_rec()
168 if (xfs_btree_keycmp_lt(cur, &key, keyp)) in xchk_btree_rec()
176 keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[1].ptr, keyblock); in xchk_btree_rec()
177 if (xfs_btree_keycmp_lt(cur, keyp, &hkey)) in xchk_btree_rec()
192 union xfs_btree_key *keyp; in xchk_btree_key() local
214 keyp = xfs_btree_key_addr(cur, cur->bc_levels[level + 1].ptr, keyblock); in xchk_btree_key()
215 if (xfs_btree_keycmp_lt(cur, key, keyp)) in xchk_btree_key()
223 keyp = xfs_btree_high_key_addr(cur, cur->bc_levels[level + 1].ptr, in xchk_btree_key()
225 if (xfs_btree_keycmp_lt(cur, keyp, key)) in xchk_btree_key()
/linux/crypto/
H A Dadiantum.c128 u8 *keyp; in adiantum_setkey() local
157 keyp = data->derived_keys; in adiantum_setkey()
164 err = crypto_cipher_setkey(tctx->blockcipher, keyp, in adiantum_setkey()
168 keyp += BLOCKCIPHER_KEY_SIZE; in adiantum_setkey()
171 poly1305_core_setkey(&tctx->header_hash_key, keyp); in adiantum_setkey()
172 keyp += POLY1305_BLOCK_SIZE; in adiantum_setkey()
177 err = crypto_shash_setkey(tctx->hash, keyp, NHPOLY1305_KEY_SIZE); in adiantum_setkey()
178 keyp += NHPOLY1305_KEY_SIZE; in adiantum_setkey()
179 WARN_ON(keyp != &data->derived_keys[ARRAY_SIZE(data->derived_keys)]); in adiantum_setkey()
/linux/tools/perf/ui/
H A Dutil.h8 int ui__popup_menu(int argc, char * const argv[], int *keyp);
/linux/tools/testing/selftests/bpf/map_tests/
H A Dmap_percpu_stats.c112 void *keyp = keys + i*MAX_MAP_KEY_SIZE; in delete_all_elements() local
115 ret = bpf_map_delete_elem(map_fd, keyp); in delete_all_elements()
119 ret = bpf_map_lookup_and_delete_elem(map_fd, keyp, val); in delete_all_elements()
/linux/fs/
H A Ddax.c164 unsigned int mode, int sync, void *keyp) in wake_exceptional_entry_func() argument
166 struct exceptional_entry_key *key = keyp; in wake_exceptional_entry_func()
/linux/fs/xfs/libxfs/
H A Dxfs_bmap.c295 xfs_bmbt_key_t *prevp, *keyp; in xfs_check_block() local
302 keyp = xfs_bmbt_key_addr(mp, block, i); in xfs_check_block()
306 be64_to_cpu(keyp->br_startoff)); in xfs_check_block()
308 prevp = keyp; in xfs_check_block()