| /kernel/linux/linux-5.10/fs/xfs/libxfs/ |
| H A D | xfs_inode_fork.h | 146 struct xfs_iext_cursor ncur = *cur; in xfs_iext_peek_next_extent() local
148 xfs_iext_next(ifp, &ncur); in xfs_iext_peek_next_extent()
149 return xfs_iext_get_extent(ifp, &ncur, gotp); in xfs_iext_peek_next_extent()
158 struct xfs_iext_cursor ncur = *cur; in xfs_iext_peek_prev_extent() local
160 xfs_iext_prev(ifp, &ncur); in xfs_iext_peek_prev_extent()
161 return xfs_iext_get_extent(ifp, &ncur, gotp); in xfs_iext_peek_prev_extent()
|
| H A D | xfs_btree.c | 395 xfs_btree_cur_t **ncur) /* output cursor */ in xfs_btree_dup_cursor()
431 *ncur = NULL; in xfs_btree_dup_cursor()
437 *ncur = new; in xfs_btree_dup_cursor()
3118 struct xfs_btree_cur **ncur, /* new btree cursor */ in xfs_btree_make_block_unfull()
3167 error = xfs_btree_split(cur, level, nptr, key, ncur, stat); in xfs_btree_make_block_unfull()
3193 struct xfs_btree_cur *ncur = NULL; /* new btree cursor */ in xfs_btree_insrec() local
3203 ncur = NULL; in xfs_btree_insrec()
3258 &optr, &ptr, &nptr, &ncur, lkey, stat); in xfs_btree_insrec()
3371 *curp = ncur; in xfs_btree_insrec()
3378 if (ncur) in xfs_btree_insrec()
393 xfs_btree_dup_cursor( xfs_btree_cur_t *cur, xfs_btree_cur_t **ncur) xfs_btree_dup_cursor() argument
3111 xfs_btree_make_block_unfull( struct xfs_btree_cur *cur, int level, int numrecs, int *oindex, int *index, union xfs_btree_ptr *nptr, struct xfs_btree_cur **ncur, union xfs_btree_key *key, int *stat) xfs_btree_make_block_unfull() argument
3399 struct xfs_btree_cur *ncur; /* new cursor (split result) */ xfs_btree_insert() local
[all...] |
| H A D | xfs_btree.h | 314 xfs_btree_cur_t **ncur);/* output cursor */
|
| /kernel/linux/linux-6.6/fs/xfs/libxfs/ |
| H A D | xfs_inode_fork.h | 229 struct xfs_iext_cursor ncur = *cur; in xfs_iext_peek_next_extent() local
231 xfs_iext_next(ifp, &ncur); in xfs_iext_peek_next_extent()
232 return xfs_iext_get_extent(ifp, &ncur, gotp); in xfs_iext_peek_next_extent()
241 struct xfs_iext_cursor ncur = *cur; in xfs_iext_peek_prev_extent() local
243 xfs_iext_prev(ifp, &ncur); in xfs_iext_peek_prev_extent()
244 return xfs_iext_get_extent(ifp, &ncur, gotp); in xfs_iext_peek_prev_extent()
|
| H A D | xfs_btree.c | 467 struct xfs_btree_cur **ncur) /* output cursor */ in xfs_btree_dup_cursor()
503 *ncur = NULL; in xfs_btree_dup_cursor()
509 *ncur = new; in xfs_btree_dup_cursor()
3210 struct xfs_btree_cur **ncur, /* new btree cursor */ in xfs_btree_make_block_unfull()
3259 error = xfs_btree_split(cur, level, nptr, key, ncur, stat); in xfs_btree_make_block_unfull()
3285 struct xfs_btree_cur *ncur = NULL; /* new btree cursor */ in xfs_btree_insrec() local
3295 ncur = NULL; in xfs_btree_insrec()
3350 &optr, &ptr, &nptr, &ncur, lkey, stat); in xfs_btree_insrec()
3463 *curp = ncur; in xfs_btree_insrec()
3470 if (ncur) in xfs_btree_insrec()
465 xfs_btree_dup_cursor( struct xfs_btree_cur *cur, struct xfs_btree_cur **ncur) xfs_btree_dup_cursor() argument
3203 xfs_btree_make_block_unfull( struct xfs_btree_cur *cur, int level, int numrecs, int *oindex, int *index, union xfs_btree_ptr *nptr, struct xfs_btree_cur **ncur, union xfs_btree_key *key, int *stat) xfs_btree_make_block_unfull() argument
3491 struct xfs_btree_cur *ncur; /* new cursor (split result) */ xfs_btree_insert() local
[all...] |
| H A D | xfs_btree.h | 380 struct xfs_btree_cur **ncur);/* output cursor */
|
| /kernel/linux/linux-5.10/fs/xfs/scrub/ |
| H A D | btree.c | 254 struct xfs_btree_cur *ncur = NULL; in xchk_btree_block_check_sibling() local
259 error = xfs_btree_dup_cursor(cur, &ncur); in xchk_btree_block_check_sibling()
261 !ncur) in xchk_btree_block_check_sibling()
270 error = xfs_btree_increment(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
272 error = xfs_btree_decrement(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
281 error = xfs_btree_increment(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
283 error = xfs_btree_decrement(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
292 pblock = xfs_btree_get_block(ncur, level + 1, &pbp); in xchk_btree_block_check_sibling()
293 pp = xfs_btree_ptr_addr(ncur, ncur in xchk_btree_block_check_sibling()
[all...] |
| /kernel/linux/linux-6.6/fs/xfs/scrub/ |
| H A D | btree.c | 268 struct xfs_btree_cur *ncur = NULL; in xchk_btree_block_check_sibling() local
273 error = xfs_btree_dup_cursor(cur, &ncur); in xchk_btree_block_check_sibling()
275 !ncur) in xchk_btree_block_check_sibling()
284 error = xfs_btree_increment(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
286 error = xfs_btree_decrement(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
295 error = xfs_btree_increment(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
297 error = xfs_btree_decrement(ncur, level + 1, &success); in xchk_btree_block_check_sibling()
306 pblock = xfs_btree_get_block(ncur, level + 1, &pbp); in xchk_btree_block_check_sibling()
307 pp = xfs_btree_ptr_addr(ncur, ncur in xchk_btree_block_check_sibling()
[all...] |
| /kernel/linux/linux-5.10/fs/xfs/ |
| H A D | xfs_iomap.c | 368 struct xfs_iext_cursor ncur = *icur; in xfs_iomap_prealloc_size() local
394 !xfs_iext_prev_extent(ifp, &ncur, &prev) || in xfs_iomap_prealloc_size()
404 while (xfs_iext_prev_extent(ifp, &ncur, &got)) { in xfs_iomap_prealloc_size()
|
| /kernel/linux/linux-6.6/fs/xfs/ |
| H A D | xfs_iomap.c | 415 struct xfs_iext_cursor ncur = *icur; in xfs_iomap_prealloc_size() local
441 !xfs_iext_prev_extent(ifp, &ncur, &prev) || in xfs_iomap_prealloc_size()
451 while (xfs_iext_prev_extent(ifp, &ncur, &got)) { in xfs_iomap_prealloc_size()
|