| /linux-master/fs/nilfs2/ |
| H A D | btree.c | 263 __u64 *keyp, __u64 *ptrp, int ncmax)
278 if (ptrp != NULL)
279 *ptrp = ptr;
548 __u64 key, __u64 *ptrp, int minlevel,
602 if (ptrp != NULL)
603 *ptrp = ptr;
610 __u64 *keyp, __u64 *ptrp)
641 if (ptrp != NULL)
642 *ptrp = ptr;
686 __u64 key, int level, __u64 *ptrp)
262 nilfs_btree_node_delete(struct nilfs_btree_node *node, int index, __u64 *keyp, __u64 *ptrp, int ncmax) argument
546 nilfs_btree_do_lookup(const struct nilfs_bmap *btree, struct nilfs_btree_path *path, __u64 key, __u64 *ptrp, int minlevel, int readahead) argument
608 nilfs_btree_do_lookup_last(const struct nilfs_bmap *btree, struct nilfs_btree_path *path, __u64 *keyp, __u64 *ptrp) argument
685 nilfs_btree_lookup(const struct nilfs_bmap *btree, __u64 key, int level, __u64 *ptrp) argument
702 nilfs_btree_lookup_contig(const struct nilfs_bmap *btree, __u64 key, __u64 *ptrp, unsigned int maxblocks) argument
813 nilfs_btree_do_insert(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) argument
840 nilfs_btree_carry_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) argument
886 nilfs_btree_carry_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) argument
933 nilfs_btree_split(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) argument
983 nilfs_btree_grow(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) argument
1263 nilfs_btree_do_delete(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) argument
1288 nilfs_btree_borrow_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) argument
1320 nilfs_btree_borrow_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) argument
1353 nilfs_btree_concat_left(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) argument
1379 nilfs_btree_concat_right(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) argument
1404 nilfs_btree_shrink(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) argument
1428 nilfs_btree_nop(struct nilfs_bmap *btree, struct nilfs_btree_path *path, int level, __u64 *keyp, __u64 *ptrp) argument
[all...] |
| H A D | bmap.c | 47 * @ptrp: place to store the value associated to @key
53 * is stored in the place pointed by @ptrp. On error, one of the following
63 __u64 *ptrp)
69 ret = bmap->b_ops->bop_lookup(bmap, key, level, ptrp);
74 ret = nilfs_dat_translate(nilfs_bmap_get_dat(bmap), *ptrp,
77 *ptrp = blocknr;
94 int nilfs_bmap_lookup_contig(struct nilfs_bmap *bmap, __u64 key, __u64 *ptrp, argument
100 ret = bmap->b_ops->bop_lookup_contig(bmap, key, ptrp, maxblocks);
62 nilfs_bmap_lookup_at_level(struct nilfs_bmap *bmap, __u64 key, int level, __u64 *ptrp) argument
|
| H A D | direct.c | 36 __u64 key, int level, __u64 *ptrp)
46 *ptrp = ptr;
51 __u64 key, __u64 *ptrp,
88 *ptrp = ptr;
35 nilfs_direct_lookup(const struct nilfs_bmap *direct, __u64 key, int level, __u64 *ptrp) argument
50 nilfs_direct_lookup_contig(const struct nilfs_bmap *direct, __u64 key, __u64 *ptrp, unsigned int maxblocks) argument
|
| /linux-master/fs/xfs/libxfs/ |
| H A D | xfs_btree_staging.c | 277 * The caller should ensure that ptrp, bpp, and blockp refer to the left
278 * sibling of the new block, if there is any. On exit, ptrp, bpp, and blockp
288 union xfs_btree_ptr *ptrp, /* in/out */
315 xfs_btree_set_ptr_null(cur, ptrp);
344 xfs_btree_set_sibling(cur, new_block, ptrp, XFS_BB_LEFTSIB);
349 xfs_btree_copy_ptrs(cur, ptrp, &new_ptr, 1);
282 xfs_btree_bload_prep_block( struct xfs_btree_cur *cur, struct xfs_btree_bload *bbl, struct list_head *buffers_list, unsigned int level, unsigned int nr_this_block, union xfs_btree_ptr *ptrp, struct xfs_buf **bpp, struct xfs_btree_block **blockp, void *priv) argument
|
| H A D | xfs_btree.c | 1758 union xfs_btree_ptr *ptrp; local
1760 ptrp = xfs_btree_ptr_addr(cur, cur->bc_levels[lev].ptr, block);
1762 error = xfs_btree_read_buf_block(cur, ptrp, 0, &block, &bp);
1852 union xfs_btree_ptr *ptrp; local
1854 ptrp = xfs_btree_ptr_addr(cur, cur->bc_levels[lev].ptr, block);
1856 error = xfs_btree_read_buf_block(cur, ptrp, 0, &block, &bp);
2845 union xfs_btree_ptr *ptrp,
3011 *ptrp = rptr;
3026 union xfs_btree_ptr *ptrp; member in struct:xfs_btree_split_args
3060 args->result = __xfs_btree_split(args->cur, args->level, args->ptrp,
2842 __xfs_btree_split( struct xfs_btree_cur *cur, int level, union xfs_btree_ptr *ptrp, union xfs_btree_key *key, struct xfs_btree_cur **curp, int *stat) argument
3093 xfs_btree_split( struct xfs_btree_cur *cur, int level, union xfs_btree_ptr *ptrp, union xfs_btree_key *key, struct xfs_btree_cur **curp, int *stat) argument
3446 xfs_btree_insrec( struct xfs_btree_cur *cur, int level, union xfs_btree_ptr *ptrp, union xfs_btree_rec *rec, union xfs_btree_key *key, struct xfs_btree_cur **curp, int *stat) argument
[all...] |
| /linux-master/fs/xfs/scrub/ |
| H A D | xfarray.c | 808 void **ptrp)
855 *ptrp = temp;
860 *ptrp = folio_address(si->folio) + offset_in_folio(si->folio, idx_pos);
805 xfarray_sort_scan( struct xfarray_sortinfo *si, xfarray_idx_t idx, void **ptrp) argument
|
| /linux-master/drivers/android/ |
| H A D | binder.c | 4272 void __user **ptrp,
4278 void __user *ptr = *ptrp;
4297 *ptrp = ptr;
4270 binder_put_node_cmd(struct binder_proc *proc, struct binder_thread *thread, void __user **ptrp, binder_uintptr_t node_ptr, binder_uintptr_t node_cookie, int node_debug_id, uint32_t cmd, const char *cmd_name) argument
|