Lines Matching refs:cur
88 #define XFS_BTREE_STATS_INC(cur, stat) \ argument
89 XFS_STATS_INC_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat)
90 #define XFS_BTREE_STATS_ADD(cur, stat, val) \ argument
91 XFS_STATS_ADD_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat, val)
104 void (*set_root)(struct xfs_btree_cur *cur,
108 int (*alloc_block)(struct xfs_btree_cur *cur,
112 int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp);
115 void (*update_lastrec)(struct xfs_btree_cur *cur,
121 int (*get_minrecs)(struct xfs_btree_cur *cur, int level);
122 int (*get_maxrecs)(struct xfs_btree_cur *cur, int level);
125 int (*get_dmaxrecs)(struct xfs_btree_cur *cur, int level);
130 void (*init_rec_from_cur)(struct xfs_btree_cur *cur,
132 void (*init_ptr_from_cur)(struct xfs_btree_cur *cur,
138 int64_t (*key_diff)(struct xfs_btree_cur *cur,
145 int64_t (*diff_two_keys)(struct xfs_btree_cur *cur,
152 int (*keys_inorder)(struct xfs_btree_cur *cur,
157 int (*recs_inorder)(struct xfs_btree_cur *cur,
292 xfs_failaddr_t __xfs_btree_check_lblock(struct xfs_btree_cur *cur,
294 xfs_failaddr_t __xfs_btree_check_sblock(struct xfs_btree_cur *cur,
302 struct xfs_btree_cur *cur, /* btree cursor */
312 struct xfs_btree_cur *cur, /* btree cursor */
321 struct xfs_btree_cur *cur, /* btree cursor */
330 struct xfs_btree_cur *cur, /* btree cursor */
339 struct xfs_btree_cur *cur, /* input cursor */
424 int xfs_btree_change_owner(struct xfs_btree_cur *cur, uint64_t new_owner,
495 typedef int (*xfs_btree_query_range_fn)(struct xfs_btree_cur *cur,
498 int xfs_btree_query_range(struct xfs_btree_cur *cur,
502 int xfs_btree_query_all(struct xfs_btree_cur *cur, xfs_btree_query_range_fn fn,
505 typedef int (*xfs_btree_visit_blocks_fn)(struct xfs_btree_cur *cur, int level,
514 int xfs_btree_visit_blocks(struct xfs_btree_cur *cur,
517 int xfs_btree_count_blocks(struct xfs_btree_cur *cur, xfs_extlen_t *blocks);
519 union xfs_btree_rec *xfs_btree_rec_addr(struct xfs_btree_cur *cur, int n,
521 union xfs_btree_key *xfs_btree_key_addr(struct xfs_btree_cur *cur, int n,
523 union xfs_btree_key *xfs_btree_high_key_addr(struct xfs_btree_cur *cur, int n,
525 union xfs_btree_ptr *xfs_btree_ptr_addr(struct xfs_btree_cur *cur, int n,
527 int xfs_btree_lookup_get_block(struct xfs_btree_cur *cur, int level,
529 struct xfs_btree_block *xfs_btree_get_block(struct xfs_btree_cur *cur,
531 bool xfs_btree_ptr_is_null(struct xfs_btree_cur *cur,
533 int64_t xfs_btree_diff_two_ptrs(struct xfs_btree_cur *cur,
536 void xfs_btree_get_sibling(struct xfs_btree_cur *cur,
539 void xfs_btree_get_keys(struct xfs_btree_cur *cur,
541 union xfs_btree_key *xfs_btree_high_key_from_key(struct xfs_btree_cur *cur,
543 int xfs_btree_has_record(struct xfs_btree_cur *cur,
546 bool xfs_btree_has_more_records(struct xfs_btree_cur *cur);
547 struct xfs_ifork *xfs_btree_ifork_ptr(struct xfs_btree_cur *cur);
552 struct xfs_btree_cur *cur, in xfs_btree_islastblock() argument
558 block = xfs_btree_get_block(cur, level, &bp); in xfs_btree_islastblock()
559 ASSERT(block && xfs_btree_check_block(cur, block, level, bp) == 0); in xfs_btree_islastblock()
561 if (cur->bc_flags & XFS_BTREE_LONG_PTRS) in xfs_btree_islastblock()
566 void xfs_btree_set_ptr_null(struct xfs_btree_cur *cur,
568 int xfs_btree_get_buf_block(struct xfs_btree_cur *cur,
571 void xfs_btree_set_sibling(struct xfs_btree_cur *cur,
574 void xfs_btree_init_block_cur(struct xfs_btree_cur *cur,
576 void xfs_btree_copy_ptrs(struct xfs_btree_cur *cur,
579 void xfs_btree_copy_keys(struct xfs_btree_cur *cur,
591 struct xfs_btree_cur *cur; in xfs_btree_alloc_cursor() local
593 cur = kmem_cache_zalloc(cache, GFP_NOFS | __GFP_NOFAIL); in xfs_btree_alloc_cursor()
594 cur->bc_tp = tp; in xfs_btree_alloc_cursor()
595 cur->bc_mp = mp; in xfs_btree_alloc_cursor()
596 cur->bc_btnum = btnum; in xfs_btree_alloc_cursor()
597 cur->bc_maxlevels = maxlevels; in xfs_btree_alloc_cursor()
598 cur->bc_cache = cache; in xfs_btree_alloc_cursor()
600 return cur; in xfs_btree_alloc_cursor()