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

/linux-4.4.14/security/selinux/ss/
H A Dsymtab.c13 const char *p, *keyp; symhash() local
18 keyp = key; symhash()
19 size = strlen(keyp); symhash()
20 for (p = keyp; (p - keyp) < size; p++) symhash()
H A Davtab.c32 static inline int avtab_hash(struct avtab_key *keyp, u32 mask) avtab_hash() argument
53 mix(keyp->target_class); avtab_hash()
54 mix(keyp->target_type); avtab_hash()
55 mix(keyp->source_type); avtab_hash()
/linux-4.4.14/fs/nilfs2/
H A Dbtree.c275 __u64 *keyp, __u64 *ptrp, int ncmax) nilfs_btree_node_delete()
288 if (keyp != NULL) nilfs_btree_node_delete()
289 *keyp = key; nilfs_btree_node_delete()
599 __u64 *keyp, __u64 *ptrp) nilfs_btree_do_lookup_last()
628 if (keyp != NULL) nilfs_btree_do_lookup_last()
629 *keyp = nilfs_btree_node_get_key(node, index); nilfs_btree_do_lookup_last()
799 int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_insert()
808 *keyp, *ptrp, ncblk); nilfs_btree_do_insert()
819 *keyp, *ptrp, nilfs_btree_do_insert()
826 int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_carry_left()
867 nilfs_btree_do_insert(btree, path, level, keyp, ptrp); nilfs_btree_carry_left()
872 int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_carry_right()
914 nilfs_btree_do_insert(btree, path, level, keyp, ptrp); nilfs_btree_carry_right()
919 int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_split()
946 *keyp, *ptrp, ncblk); nilfs_btree_split()
948 *keyp = nilfs_btree_node_get_key(right, 0); nilfs_btree_split()
955 nilfs_btree_do_insert(btree, path, level, keyp, ptrp); nilfs_btree_split()
957 *keyp = nilfs_btree_node_get_key(right, 0); nilfs_btree_split()
969 int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_grow()
990 nilfs_btree_do_insert(btree, path, level, keyp, ptrp); nilfs_btree_grow()
992 *keyp = nilfs_btree_node_get_key(child, 0); nilfs_btree_grow()
1249 int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_delete()
1258 keyp, ptrp, ncblk); nilfs_btree_do_delete()
1267 keyp, ptrp, nilfs_btree_do_delete()
1274 int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_borrow_left()
1279 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); nilfs_btree_borrow_left()
1306 int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_borrow_right()
1311 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); nilfs_btree_borrow_right()
1339 int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_concat_left()
1344 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); nilfs_btree_concat_left()
1365 int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_concat_right()
1370 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); nilfs_btree_concat_right()
1390 int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_shrink()
1395 nilfs_btree_do_delete(btree, path, level, keyp, ptrp); nilfs_btree_shrink()
1414 int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_nop()
1600 __u64 *keyp) nilfs_btree_seek_key()
1612 *keyp = start; nilfs_btree_seek_key()
1614 ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp); nilfs_btree_seek_key()
1620 static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp) nilfs_btree_last_key() argument
1629 ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL); nilfs_btree_last_key()
274 nilfs_btree_node_delete(struct nilfs_btree_node *node, int index, __u64 *keyp, __u64 *ptrp, int ncmax) nilfs_btree_node_delete() argument
597 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
797 nilfs_btree_do_insert(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_insert() argument
824 nilfs_btree_carry_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_carry_left() argument
870 nilfs_btree_carry_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_carry_right() argument
917 nilfs_btree_split(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_split() argument
967 nilfs_btree_grow(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_grow() argument
1247 nilfs_btree_do_delete(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_do_delete() argument
1272 nilfs_btree_borrow_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_borrow_left() argument
1304 nilfs_btree_borrow_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_borrow_right() argument
1337 nilfs_btree_concat_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_concat_left() argument
1363 nilfs_btree_concat_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_concat_right() argument
1388 nilfs_btree_shrink(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_shrink() argument
1412 nilfs_btree_nop(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) nilfs_btree_nop() argument
1599 nilfs_btree_seek_key(const struct nilfs_bmap *btree, __u64 start, __u64 *keyp) nilfs_btree_seek_key() argument
H A Ddirect.c177 __u64 *keyp) nilfs_direct_seek_key()
184 *keyp = key; nilfs_direct_seek_key()
191 static int nilfs_direct_last_key(const struct nilfs_bmap *direct, __u64 *keyp) nilfs_direct_last_key() argument
204 *keyp = lastkey; nilfs_direct_last_key()
176 nilfs_direct_seek_key(const struct nilfs_bmap *direct, __u64 start, __u64 *keyp) nilfs_direct_seek_key() argument
H A Dbmap.c196 * @keyp: place to store valid key
199 * starting from @start, and stores it to @keyp if found.
210 int nilfs_bmap_seek_key(struct nilfs_bmap *bmap, __u64 start, __u64 *keyp) nilfs_bmap_seek_key() argument
215 ret = bmap->b_ops->bop_seek_key(bmap, start, keyp); nilfs_bmap_seek_key()
223 int nilfs_bmap_last_key(struct nilfs_bmap *bmap, __u64 *keyp) nilfs_bmap_last_key() argument
228 ret = bmap->b_ops->bop_last_key(bmap, keyp); nilfs_bmap_last_key()
H A Dbmap.h160 int nilfs_bmap_seek_key(struct nilfs_bmap *bmap, __u64 start, __u64 *keyp);
161 int nilfs_bmap_last_key(struct nilfs_bmap *bmap, __u64 *keyp);
/linux-4.4.14/fs/fuse/
H A Dcuse.c203 * @keyp: out parameter for key
207 * at @end - 1. This function parses one pair and set *@keyp to the
215 static int cuse_parse_one(char **pp, char *end, char **keyp, char **valp) cuse_parse_one() argument
248 *keyp = key; cuse_parse_one()
/linux-4.4.14/drivers/net/hyperv/
H A Drndis_filter.c716 u8 *keyp; rndis_filter_set_rss_param() local
752 keyp = (u8 *)((unsigned long)rssp + rssp->kashkey_offset); rndis_filter_set_rss_param()
754 keyp[i] = netvsc_hash_key[i]; rndis_filter_set_rss_param()
/linux-4.4.14/security/smack/
H A Dsmack_lsm.c4312 struct key *keyp; smack_key_permission() local
4318 keyp = key_ref_to_ptr(key_ref); smack_key_permission()
4319 if (keyp == NULL) smack_key_permission()
4325 if (keyp->security == NULL) smack_key_permission()
4334 ad.a.u.key_struct.key = keyp->serial; smack_key_permission()
4335 ad.a.u.key_struct.key_desc = keyp->description; smack_key_permission()
4341 rc = smk_access(tkp, keyp->security, request, &ad); smack_key_permission()
4342 rc = smk_bu_note("key access", tkp, keyp->security, request, rc); smack_key_permission()
/linux-4.4.14/fs/xfs/libxfs/
H A Dxfs_btree.c1873 union xfs_btree_key *keyp, xfs_btree_updkey()
1882 XFS_BTREE_TRACE_ARGIK(cur, level, keyp); xfs_btree_updkey()
1906 xfs_btree_copy_keys(cur, kp, keyp, 1); xfs_btree_updkey()
3373 union xfs_btree_key key; /* storage for keyp */ xfs_btree_delrec()
3374 union xfs_btree_key *keyp = &key; /* passed to the next level */ xfs_btree_delrec() local
3451 keyp = xfs_btree_key_addr(cur, 1, block); xfs_btree_delrec()
3468 keyp = &key; xfs_btree_delrec()
3537 error = xfs_btree_updkey(cur, keyp, level + 1); xfs_btree_delrec()
1871 xfs_btree_updkey( struct xfs_btree_cur *cur, union xfs_btree_key *keyp, int level) xfs_btree_updkey() argument
H A Dxfs_bmap.c287 xfs_bmbt_key_t *prevp, *keyp; xfs_check_block() local
294 keyp = XFS_BMBT_KEY_ADDR(mp, block, i); xfs_check_block()
298 be64_to_cpu(keyp->br_startoff)); xfs_check_block()
300 prevp = keyp; xfs_check_block()

Completed in 372 milliseconds