Home
last modified time | relevance | path

Searched refs:ptrp (Results 1 – 6 of 6) sorted by relevance

/linux/fs/nilfs2/
H A Dbtree.c263 __u64 *keyp, __u64 *ptrp, int ncmax) in nilfs_btree_node_delete() argument
278 if (ptrp != NULL) in nilfs_btree_node_delete()
279 *ptrp = ptr; in nilfs_btree_node_delete()
549 __u64 key, __u64 *ptrp, int minlevel, in nilfs_btree_do_lookup() argument
603 if (ptrp != NULL) in nilfs_btree_do_lookup()
604 *ptrp = ptr; in nilfs_btree_do_lookup()
611 __u64 *keyp, __u64 *ptrp) in nilfs_btree_do_lookup_last() argument
642 if (ptrp != NULL) in nilfs_btree_do_lookup_last()
643 *ptrp = ptr; in nilfs_btree_do_lookup_last()
686 __u64 key, int level, __u64 *ptrp) in nilfs_btree_lookup()
687 nilfs_btree_lookup(const struct nilfs_bmap * btree,__u64 key,int level,__u64 * ptrp) nilfs_btree_lookup() argument
704 nilfs_btree_lookup_contig(const struct nilfs_bmap * btree,__u64 key,__u64 * ptrp,unsigned int maxblocks) nilfs_btree_lookup_contig() argument
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
[all...]
H A Dbmap.c47 * @ptrp: place to store the value associated to @key
51 * with @key is stored in the place pointed to by @ptrp.
60 __u64 *ptrp)
66 ret = bmap->b_ops->bop_lookup(bmap, key, level, ptrp); in nilfs_bmap_lookup_at_level()
71 ret = nilfs_dat_translate(nilfs_bmap_get_dat(bmap), *ptrp, in nilfs_bmap_lookup_at_level()
74 *ptrp = blocknr; in nilfs_bmap_lookup_at_level()
91 int nilfs_bmap_lookup_contig(struct nilfs_bmap *bmap, __u64 key, __u64 *ptrp, in nilfs_bmap_lookup_at_level()
97 ret = bmap->b_ops->bop_lookup_contig(bmap, key, ptrp, maxblocks); in nilfs_bmap_lookup_contig()
63 nilfs_bmap_lookup_at_level(struct nilfs_bmap * bmap,__u64 key,int level,__u64 * ptrp) nilfs_bmap_lookup_at_level() argument
94 nilfs_bmap_lookup_contig(struct nilfs_bmap * bmap,__u64 key,__u64 * ptrp,unsigned int maxblocks) nilfs_bmap_lookup_contig() argument
H A Ddirect.c36 __u64 key, int level, __u64 *ptrp) in nilfs_direct_lookup() argument
46 *ptrp = ptr; in nilfs_direct_lookup()
51 __u64 key, __u64 *ptrp, in nilfs_direct_lookup_contig() argument
88 *ptrp = ptr; in nilfs_direct_lookup_contig()
/linux/fs/xfs/libxfs/
H A Dxfs_btree_staging.c289 union xfs_btree_ptr *ptrp, /* in/out */ in xfs_btree_bload_prep_block() argument
316 xfs_btree_set_ptr_null(cur, ptrp); in xfs_btree_bload_prep_block()
345 xfs_btree_set_sibling(cur, new_block, ptrp, XFS_BB_LEFTSIB); in xfs_btree_bload_prep_block()
350 xfs_btree_copy_ptrs(cur, ptrp, &new_ptr, 1); in xfs_btree_bload_prep_block()
H A Dxfs_btree.c1732 union xfs_btree_ptr *ptrp; in xfs_btree_increment() local
1734 ptrp = xfs_btree_ptr_addr(cur, cur->bc_levels[lev].ptr, block); in xfs_btree_increment()
1736 error = xfs_btree_read_buf_block(cur, ptrp, 0, &block, &bp); in xfs_btree_increment()
1826 union xfs_btree_ptr *ptrp; in xfs_btree_decrement() local
1828 ptrp = xfs_btree_ptr_addr(cur, cur->bc_levels[lev].ptr, block); in xfs_btree_decrement()
1830 error = xfs_btree_read_buf_block(cur, ptrp, 0, &block, &bp); in xfs_btree_decrement()
2810 union xfs_btree_ptr *ptrp, in __xfs_btree_split() argument
2976 *ptrp = rptr; in __xfs_btree_split()
2991 union xfs_btree_ptr *ptrp; member
3025 args->result = __xfs_btree_split(args->cur, args->level, args->ptrp, in xfs_btree_split_worker()
[all …]
/linux/fs/xfs/scrub/
H A Dxfarray.c808 void **ptrp) in xfarray_sort_scan() argument
857 *ptrp = temp; in xfarray_sort_scan()
862 *ptrp = folio_address(si->folio) + offset_in_folio(si->folio, idx_pos); in xfarray_sort_scan()