Home
last modified time | relevance | path

Searched refs:keyp (Results 1 - 25 of 31) sorted by relevance

12

/kernel/linux/linux-5.10/security/selinux/ss/
H A Dsymtab.c14 const char *p, *keyp; in symhash() local
19 keyp = key; in symhash()
20 size = strlen(keyp); in symhash()
21 for (p = keyp; (p - keyp) < size; p++) in symhash()
H A Davtab.c32 static inline int avtab_hash(struct avtab_key *keyp, u32 mask) in avtab_hash() argument
53 mix(keyp->target_class); in avtab_hash()
54 mix(keyp->target_type); in avtab_hash()
55 mix(keyp->source_type); in avtab_hash()
/kernel/linux/linux-6.6/security/selinux/ss/
H A Dsymtab.c14 const char *p, *keyp; in symhash() local
19 keyp = key; in symhash()
20 size = strlen(keyp); in symhash()
21 for (p = keyp; (p - keyp) < size; p++) in symhash()
H A Davtab.c32 static inline u32 avtab_hash(const struct avtab_key *keyp, u32 mask) in avtab_hash() argument
53 mix(keyp->target_class); in avtab_hash()
54 mix(keyp->target_type); in avtab_hash()
55 mix(keyp->source_type); in avtab_hash()
/kernel/linux/linux-5.10/fs/nilfs2/
H A Dbtree.c263 __u64 *keyp, __u64 *ptrp, int ncmax) in nilfs_btree_node_delete()
276 if (keyp != NULL) in nilfs_btree_node_delete()
277 *keyp = key; in nilfs_btree_node_delete()
610 __u64 *keyp, __u64 *ptrp) in nilfs_btree_do_lookup_last()
639 if (keyp != NULL) in nilfs_btree_do_lookup_last()
640 *keyp = nilfs_btree_node_get_key(node, index); in nilfs_btree_do_lookup_last()
811 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_do_insert()
820 *keyp, *ptrp, ncblk); in nilfs_btree_do_insert()
831 *keyp, *ptrp, in nilfs_btree_do_insert()
838 int level, __u64 *keyp, __u6 in nilfs_btree_carry_left()
262 nilfs_btree_node_delete(struct nilfs_btree_node *node, int index, __u64 *keyp, __u64 *ptrp, int ncmax) nilfs_btree_node_delete() argument
608 nilfs_btree_do_lookup_last(const struct nilfs_bmap *btree, struct nilfs_btree_path *path, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_lookup_last() argument
809 nilfs_btree_do_insert(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_insert() argument
836 nilfs_btree_carry_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_carry_left() argument
882 nilfs_btree_carry_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_carry_right() argument
929 nilfs_btree_split(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_split() argument
979 nilfs_btree_grow(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_grow() argument
1259 nilfs_btree_do_delete(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_delete() argument
1284 nilfs_btree_borrow_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_borrow_left() argument
1316 nilfs_btree_borrow_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_borrow_right() argument
1349 nilfs_btree_concat_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_concat_left() argument
1375 nilfs_btree_concat_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_concat_right() argument
1400 nilfs_btree_shrink(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_shrink() argument
1424 nilfs_btree_nop(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_nop() argument
1611 nilfs_btree_seek_key(const struct nilfs_bmap *btree, __u64 start, __u64 *keyp) nilfs_btree_seek_key() argument
1632 nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp) nilfs_btree_last_key() argument
[all...]
H A Ddirect.c165 __u64 *keyp) in nilfs_direct_seek_key()
172 *keyp = key; in nilfs_direct_seek_key()
179 static int nilfs_direct_last_key(const struct nilfs_bmap *direct, __u64 *keyp) in nilfs_direct_last_key() argument
192 *keyp = lastkey; in nilfs_direct_last_key()
164 nilfs_direct_seek_key(const struct nilfs_bmap *direct, __u64 start, __u64 *keyp) nilfs_direct_seek_key() argument
H A Dbmap.c191 * @keyp: place to store valid key
194 * starting from @start, and stores it to @keyp if found.
205 int nilfs_bmap_seek_key(struct nilfs_bmap *bmap, __u64 start, __u64 *keyp) in nilfs_bmap_seek_key() argument
210 ret = bmap->b_ops->bop_seek_key(bmap, start, keyp); in nilfs_bmap_seek_key()
218 int nilfs_bmap_last_key(struct nilfs_bmap *bmap, __u64 *keyp) in nilfs_bmap_last_key() argument
223 ret = bmap->b_ops->bop_last_key(bmap, keyp); in nilfs_bmap_last_key()
H A Dbmap.h151 int nilfs_bmap_seek_key(struct nilfs_bmap *bmap, __u64 start, __u64 *keyp);
152 int nilfs_bmap_last_key(struct nilfs_bmap *bmap, __u64 *keyp);
/kernel/linux/linux-6.6/fs/nilfs2/
H A Dbtree.c263 __u64 *keyp, __u64 *ptrp, int ncmax) in nilfs_btree_node_delete()
276 if (keyp != NULL) in nilfs_btree_node_delete()
277 *keyp = key; in nilfs_btree_node_delete()
610 __u64 *keyp, __u64 *ptrp) in nilfs_btree_do_lookup_last()
639 if (keyp != NULL) in nilfs_btree_do_lookup_last()
640 *keyp = nilfs_btree_node_get_key(node, index); in nilfs_btree_do_lookup_last()
810 int level, __u64 *keyp, __u64 *ptrp) in nilfs_btree_do_insert()
819 *keyp, *ptrp, ncblk); in nilfs_btree_do_insert()
830 *keyp, *ptrp, in nilfs_btree_do_insert()
837 int level, __u64 *keyp, __u6 in nilfs_btree_carry_left()
262 nilfs_btree_node_delete(struct nilfs_btree_node *node, int index, __u64 *keyp, __u64 *ptrp, int ncmax) nilfs_btree_node_delete() argument
608 nilfs_btree_do_lookup_last(const struct nilfs_bmap *btree, struct nilfs_btree_path *path, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_lookup_last() argument
808 nilfs_btree_do_insert(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_insert() argument
835 nilfs_btree_carry_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_carry_left() argument
881 nilfs_btree_carry_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_carry_right() argument
928 nilfs_btree_split(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_split() argument
978 nilfs_btree_grow(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_grow() argument
1258 nilfs_btree_do_delete(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_delete() argument
1283 nilfs_btree_borrow_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_borrow_left() argument
1315 nilfs_btree_borrow_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_borrow_right() argument
1348 nilfs_btree_concat_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_concat_left() argument
1374 nilfs_btree_concat_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_concat_right() argument
1399 nilfs_btree_shrink(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_shrink() argument
1423 nilfs_btree_nop(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_nop() argument
1610 nilfs_btree_seek_key(const struct nilfs_bmap *btree, __u64 start, __u64 *keyp) nilfs_btree_seek_key() argument
1631 nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp) nilfs_btree_last_key() argument
[all...]
H A Ddirect.c165 __u64 *keyp) in nilfs_direct_seek_key()
172 *keyp = key; in nilfs_direct_seek_key()
179 static int nilfs_direct_last_key(const struct nilfs_bmap *direct, __u64 *keyp) in nilfs_direct_last_key() argument
192 *keyp = lastkey; in nilfs_direct_last_key()
164 nilfs_direct_seek_key(const struct nilfs_bmap *direct, __u64 start, __u64 *keyp) nilfs_direct_seek_key() argument
H A Dbmap.c191 * @keyp: place to store valid key
194 * starting from @start, and stores it to @keyp if found.
205 int nilfs_bmap_seek_key(struct nilfs_bmap *bmap, __u64 start, __u64 *keyp) in nilfs_bmap_seek_key() argument
210 ret = bmap->b_ops->bop_seek_key(bmap, start, keyp); in nilfs_bmap_seek_key()
218 int nilfs_bmap_last_key(struct nilfs_bmap *bmap, __u64 *keyp) in nilfs_bmap_last_key() argument
223 ret = bmap->b_ops->bop_last_key(bmap, keyp); in nilfs_bmap_last_key()
H A Dbmap.h151 int nilfs_bmap_seek_key(struct nilfs_bmap *bmap, __u64 start, __u64 *keyp);
152 int nilfs_bmap_last_key(struct nilfs_bmap *bmap, __u64 *keyp);
/kernel/linux/linux-5.10/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()
/kernel/linux/linux-6.6/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()
/kernel/linux/linux-5.10/fs/xfs/scrub/
H A Dbtree.c132 union xfs_btree_key *keyp; in xchk_btree_rec() local
154 keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[1], keyblock); in xchk_btree_rec()
155 if (cur->bc_ops->diff_two_keys(cur, &key, keyp) < 0) in xchk_btree_rec()
163 keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[1], keyblock); in xchk_btree_rec()
164 if (cur->bc_ops->diff_two_keys(cur, keyp, &hkey) < 0) in xchk_btree_rec()
179 union xfs_btree_key *keyp; in xchk_btree_key() local
201 keyp = xfs_btree_key_addr(cur, cur->bc_ptrs[level + 1], keyblock); in xchk_btree_key()
202 if (cur->bc_ops->diff_two_keys(cur, key, keyp) < 0) in xchk_btree_key()
210 keyp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level + 1], keyblock); in xchk_btree_key()
211 if (cur->bc_ops->diff_two_keys(cur, keyp, ke in xchk_btree_key()
[all...]
/kernel/linux/linux-6.6/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, ke in xchk_btree_key()
[all...]
/kernel/linux/linux-5.10/crypto/
H A Dadiantum.c127 u8 *keyp; in adiantum_setkey() local
156 keyp = data->derived_keys; in adiantum_setkey()
163 err = crypto_cipher_setkey(tctx->blockcipher, keyp, in adiantum_setkey()
167 keyp += BLOCKCIPHER_KEY_SIZE; in adiantum_setkey()
170 poly1305_core_setkey(&tctx->header_hash_key, keyp); in adiantum_setkey()
171 keyp += POLY1305_BLOCK_SIZE; in adiantum_setkey()
176 err = crypto_shash_setkey(tctx->hash, keyp, NHPOLY1305_KEY_SIZE); in adiantum_setkey()
177 keyp += NHPOLY1305_KEY_SIZE; in adiantum_setkey()
178 WARN_ON(keyp != &data->derived_keys[ARRAY_SIZE(data->derived_keys)]); in adiantum_setkey()
/kernel/linux/linux-6.6/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()
/kernel/linux/linux-6.6/tools/testing/selftests/bpf/map_tests/
H A Dmap_percpu_stats.c111 void *keyp = keys + i*MAX_MAP_KEY_SIZE; in delete_all_elements() local
114 ret = bpf_map_delete_elem(map_fd, keyp); in delete_all_elements()
118 ret = bpf_map_lookup_and_delete_elem(map_fd, keyp, val); in delete_all_elements()
/kernel/linux/linux-5.10/tools/perf/ui/
H A Dutil.h8 int ui__popup_menu(int argc, char * const argv[], int *keyp);
/kernel/linux/linux-6.6/tools/perf/ui/
H A Dutil.h8 int ui__popup_menu(int argc, char * const argv[], int *keyp);
/kernel/linux/linux-5.10/fs/fuse/
H A Dcuse.c206 * @keyp: out parameter for key
210 * at @end - 1. This function parses one pair and set *@keyp to the
218 static int cuse_parse_one(char **pp, char *end, char **keyp, char **valp) in cuse_parse_one() argument
251 *keyp = key; in cuse_parse_one()
/kernel/linux/linux-6.6/fs/fuse/
H A Dcuse.c206 * @keyp: out parameter for key
210 * at @end - 1. This function parses one pair and set *@keyp to the
218 static int cuse_parse_one(char **pp, char *end, char **keyp, char **valp) in cuse_parse_one() argument
251 *keyp = key; in cuse_parse_one()
/kernel/linux/linux-5.10/security/smack/
H A Dsmack_lsm.c4299 struct key *keyp; in smack_key_permission() local
4329 keyp = key_ref_to_ptr(key_ref); in smack_key_permission()
4330 if (keyp == NULL) in smack_key_permission()
4336 if (keyp->security == NULL) in smack_key_permission()
4349 ad.a.u.key_struct.key = keyp->serial; in smack_key_permission()
4350 ad.a.u.key_struct.key_desc = keyp->description; in smack_key_permission()
4352 rc = smk_access(tkp, keyp->security, request, &ad); in smack_key_permission()
4353 rc = smk_bu_note("key access", tkp, keyp->security, request, rc); in smack_key_permission()
/kernel/linux/linux-6.6/security/smack/
H A Dsmack_lsm.c4436 struct key *keyp; in smack_key_permission() local
4466 keyp = key_ref_to_ptr(key_ref); in smack_key_permission()
4467 if (keyp == NULL) in smack_key_permission()
4473 if (keyp->security == NULL) in smack_key_permission()
4486 ad.a.u.key_struct.key = keyp->serial; in smack_key_permission()
4487 ad.a.u.key_struct.key_desc = keyp->description; in smack_key_permission()
4489 rc = smk_access(tkp, keyp->security, request, &ad); in smack_key_permission()
4490 rc = smk_bu_note("key access", tkp, keyp->security, request, rc); in smack_key_permission()

Completed in 30 milliseconds

12