1508578f2SNishad Kamdar /* SPDX-License-Identifier: GPL-2.0 */ 284be0ffcSDave Chinner /* 384be0ffcSDave Chinner * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc. 484be0ffcSDave Chinner * All Rights Reserved. 584be0ffcSDave Chinner */ 684be0ffcSDave Chinner #ifndef __XFS_BTREE_H__ 784be0ffcSDave Chinner #define __XFS_BTREE_H__ 884be0ffcSDave Chinner 984be0ffcSDave Chinner struct xfs_buf; 1084be0ffcSDave Chinner struct xfs_inode; 1184be0ffcSDave Chinner struct xfs_mount; 1284be0ffcSDave Chinner struct xfs_trans; 13349e1c03SDarrick J. Wong struct xfs_ifork; 14be9fb17dSDave Chinner struct xfs_perag; 1584be0ffcSDave Chinner 1684be0ffcSDave Chinner /* 1784be0ffcSDave Chinner * Generic key, ptr and record wrapper structures. 1884be0ffcSDave Chinner * 1984be0ffcSDave Chinner * These are disk format structures, and are converted where necessary 2084be0ffcSDave Chinner * by the btree specific code that needs to interpret them. 2184be0ffcSDave Chinner */ 2284be0ffcSDave Chinner union xfs_btree_ptr { 2384be0ffcSDave Chinner __be32 s; /* short form ptr */ 2484be0ffcSDave Chinner __be64 l; /* long form ptr */ 2584be0ffcSDave Chinner }; 2684be0ffcSDave Chinner 27a1d46cffSDarrick J. Wong /* 28a1d46cffSDarrick J. Wong * The in-core btree key. Overlapping btrees actually store two keys 29a1d46cffSDarrick J. Wong * per pointer, so we reserve enough memory to hold both. The __*bigkey 30a1d46cffSDarrick J. Wong * items should never be accessed directly. 31a1d46cffSDarrick J. Wong */ 3284be0ffcSDave Chinner union xfs_btree_key { 33035e00acSDarrick J. Wong struct xfs_bmbt_key bmbt; 3484be0ffcSDave Chinner xfs_bmdr_key_t bmbr; /* bmbt root block */ 3584be0ffcSDave Chinner xfs_alloc_key_t alloc; 36035e00acSDarrick J. Wong struct xfs_inobt_key inobt; 37035e00acSDarrick J. Wong struct xfs_rmap_key rmap; 38a1d46cffSDarrick J. Wong struct xfs_rmap_key __rmap_bigkey[2]; 391946b91cSDarrick J. Wong struct xfs_refcount_key refc; 402c813ad6SDarrick J. Wong }; 412c813ad6SDarrick J. Wong 4284be0ffcSDave Chinner union xfs_btree_rec { 43035e00acSDarrick J. Wong struct xfs_bmbt_rec bmbt; 4484be0ffcSDave Chinner xfs_bmdr_rec_t bmbr; /* bmbt root block */ 45035e00acSDarrick J. Wong struct xfs_alloc_rec alloc; 46035e00acSDarrick J. Wong struct xfs_inobt_rec inobt; 47035e00acSDarrick J. Wong struct xfs_rmap_rec rmap; 481946b91cSDarrick J. Wong struct xfs_refcount_rec refc; 4984be0ffcSDave Chinner }; 5084be0ffcSDave Chinner 5184be0ffcSDave Chinner /* 5284be0ffcSDave Chinner * This nonsense is to make -wlint happy. 5384be0ffcSDave Chinner */ 5484be0ffcSDave Chinner #define XFS_LOOKUP_EQ ((xfs_lookup_t)XFS_LOOKUP_EQi) 5584be0ffcSDave Chinner #define XFS_LOOKUP_LE ((xfs_lookup_t)XFS_LOOKUP_LEi) 5684be0ffcSDave Chinner #define XFS_LOOKUP_GE ((xfs_lookup_t)XFS_LOOKUP_GEi) 5784be0ffcSDave Chinner 5884be0ffcSDave Chinner #define XFS_BTNUM_BNO ((xfs_btnum_t)XFS_BTNUM_BNOi) 5984be0ffcSDave Chinner #define XFS_BTNUM_CNT ((xfs_btnum_t)XFS_BTNUM_CNTi) 6084be0ffcSDave Chinner #define XFS_BTNUM_BMAP ((xfs_btnum_t)XFS_BTNUM_BMAPi) 6184be0ffcSDave Chinner #define XFS_BTNUM_INO ((xfs_btnum_t)XFS_BTNUM_INOi) 6284be0ffcSDave Chinner #define XFS_BTNUM_FINO ((xfs_btnum_t)XFS_BTNUM_FINOi) 63b8704944SDarrick J. Wong #define XFS_BTNUM_RMAP ((xfs_btnum_t)XFS_BTNUM_RMAPi) 6446eeb521SDarrick J. Wong #define XFS_BTNUM_REFC ((xfs_btnum_t)XFS_BTNUM_REFCi) 6584be0ffcSDave Chinner 66c8ce540dSDarrick J. Wong uint32_t xfs_btree_magic(int crc, xfs_btnum_t btnum); 67af7d20fdSEric Sandeen 6884be0ffcSDave Chinner /* 6984be0ffcSDave Chinner * For logging record fields. 7084be0ffcSDave Chinner */ 71722db70fSDave Chinner #define XFS_BB_MAGIC (1u << 0) 72722db70fSDave Chinner #define XFS_BB_LEVEL (1u << 1) 73722db70fSDave Chinner #define XFS_BB_NUMRECS (1u << 2) 74722db70fSDave Chinner #define XFS_BB_LEFTSIB (1u << 3) 75722db70fSDave Chinner #define XFS_BB_RIGHTSIB (1u << 4) 76722db70fSDave Chinner #define XFS_BB_BLKNO (1u << 5) 77722db70fSDave Chinner #define XFS_BB_LSN (1u << 6) 78722db70fSDave Chinner #define XFS_BB_UUID (1u << 7) 79722db70fSDave Chinner #define XFS_BB_OWNER (1u << 8) 8084be0ffcSDave Chinner #define XFS_BB_NUM_BITS 5 81722db70fSDave Chinner #define XFS_BB_ALL_BITS ((1u << XFS_BB_NUM_BITS) - 1) 8284be0ffcSDave Chinner #define XFS_BB_NUM_BITS_CRC 9 83722db70fSDave Chinner #define XFS_BB_ALL_BITS_CRC ((1u << XFS_BB_NUM_BITS_CRC) - 1) 8484be0ffcSDave Chinner 8584be0ffcSDave Chinner /* 8684be0ffcSDave Chinner * Generic stats interface 8784be0ffcSDave Chinner */ 8884be0ffcSDave Chinner #define XFS_BTREE_STATS_INC(cur, stat) \ 8911ef38afSDave Chinner XFS_STATS_INC_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat) 9084be0ffcSDave Chinner #define XFS_BTREE_STATS_ADD(cur, stat, val) \ 9111ef38afSDave Chinner XFS_STATS_ADD_OFF((cur)->bc_mp, (cur)->bc_statoff + __XBTS_ ## stat, val) 9284be0ffcSDave Chinner 936abc7aefSDarrick J. Wong enum xbtree_key_contig { 946abc7aefSDarrick J. Wong XBTREE_KEY_GAP = 0, 956abc7aefSDarrick J. Wong XBTREE_KEY_CONTIGUOUS, 966abc7aefSDarrick J. Wong XBTREE_KEY_OVERLAP, 976abc7aefSDarrick J. Wong }; 986abc7aefSDarrick J. Wong 996abc7aefSDarrick J. Wong /* 1006abc7aefSDarrick J. Wong * Decide if these two numeric btree key fields are contiguous, overlapping, 1016abc7aefSDarrick J. Wong * or if there's a gap between them. @x should be the field from the high 1026abc7aefSDarrick J. Wong * key and @y should be the field from the low key. 1036abc7aefSDarrick J. Wong */ 1046abc7aefSDarrick J. Wong static inline enum xbtree_key_contig xbtree_key_contig(uint64_t x, uint64_t y) 1056abc7aefSDarrick J. Wong { 1066abc7aefSDarrick J. Wong x++; 1076abc7aefSDarrick J. Wong if (x < y) 1086abc7aefSDarrick J. Wong return XBTREE_KEY_GAP; 1096abc7aefSDarrick J. Wong if (x == y) 1106abc7aefSDarrick J. Wong return XBTREE_KEY_CONTIGUOUS; 1116abc7aefSDarrick J. Wong return XBTREE_KEY_OVERLAP; 1126abc7aefSDarrick J. Wong } 1136abc7aefSDarrick J. Wong 11484be0ffcSDave Chinner struct xfs_btree_ops { 11584be0ffcSDave Chinner /* size of the key and record structures */ 11684be0ffcSDave Chinner size_t key_len; 11784be0ffcSDave Chinner size_t rec_len; 11884be0ffcSDave Chinner 11984be0ffcSDave Chinner /* cursor operations */ 12084be0ffcSDave Chinner struct xfs_btree_cur *(*dup_cursor)(struct xfs_btree_cur *); 12184be0ffcSDave Chinner void (*update_cursor)(struct xfs_btree_cur *src, 12284be0ffcSDave Chinner struct xfs_btree_cur *dst); 12384be0ffcSDave Chinner 12484be0ffcSDave Chinner /* update btree root pointer */ 12584be0ffcSDave Chinner void (*set_root)(struct xfs_btree_cur *cur, 126b5a6e5feSDarrick J. Wong const union xfs_btree_ptr *nptr, int level_change); 12784be0ffcSDave Chinner 12884be0ffcSDave Chinner /* block allocation / freeing */ 12984be0ffcSDave Chinner int (*alloc_block)(struct xfs_btree_cur *cur, 130deb06b9aSDarrick J. Wong const union xfs_btree_ptr *start_bno, 13184be0ffcSDave Chinner union xfs_btree_ptr *new_bno, 13284be0ffcSDave Chinner int *stat); 13384be0ffcSDave Chinner int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp); 13484be0ffcSDave Chinner 13584be0ffcSDave Chinner /* update last record information */ 13684be0ffcSDave Chinner void (*update_lastrec)(struct xfs_btree_cur *cur, 13760e265f7SDarrick J. Wong const struct xfs_btree_block *block, 13860e265f7SDarrick J. Wong const union xfs_btree_rec *rec, 13984be0ffcSDave Chinner int ptr, int reason); 14084be0ffcSDave Chinner 14184be0ffcSDave Chinner /* records in block/level */ 14284be0ffcSDave Chinner int (*get_minrecs)(struct xfs_btree_cur *cur, int level); 14384be0ffcSDave Chinner int (*get_maxrecs)(struct xfs_btree_cur *cur, int level); 14484be0ffcSDave Chinner 14584be0ffcSDave Chinner /* records on disk. Matter for the root in inode case. */ 14684be0ffcSDave Chinner int (*get_dmaxrecs)(struct xfs_btree_cur *cur, int level); 14784be0ffcSDave Chinner 14884be0ffcSDave Chinner /* init values of btree structures */ 14984be0ffcSDave Chinner void (*init_key_from_rec)(union xfs_btree_key *key, 15023825cd1SDarrick J. Wong const union xfs_btree_rec *rec); 15184be0ffcSDave Chinner void (*init_rec_from_cur)(struct xfs_btree_cur *cur, 15284be0ffcSDave Chinner union xfs_btree_rec *rec); 15384be0ffcSDave Chinner void (*init_ptr_from_cur)(struct xfs_btree_cur *cur, 15484be0ffcSDave Chinner union xfs_btree_ptr *ptr); 1552c813ad6SDarrick J. Wong void (*init_high_key_from_rec)(union xfs_btree_key *key, 15623825cd1SDarrick J. Wong const union xfs_btree_rec *rec); 15784be0ffcSDave Chinner 15884be0ffcSDave Chinner /* difference between key value and cursor value */ 159c8ce540dSDarrick J. Wong int64_t (*key_diff)(struct xfs_btree_cur *cur, 160d29d5577SDarrick J. Wong const union xfs_btree_key *key); 16184be0ffcSDave Chinner 1622c813ad6SDarrick J. Wong /* 1632c813ad6SDarrick J. Wong * Difference between key2 and key1 -- positive if key1 > key2, 164*4a200a09SDarrick J. Wong * negative if key1 < key2, and zero if equal. If the @mask parameter 165*4a200a09SDarrick J. Wong * is non NULL, each key field to be used in the comparison must 166*4a200a09SDarrick J. Wong * contain a nonzero value. 1672c813ad6SDarrick J. Wong */ 168c8ce540dSDarrick J. Wong int64_t (*diff_two_keys)(struct xfs_btree_cur *cur, 169d29d5577SDarrick J. Wong const union xfs_btree_key *key1, 170*4a200a09SDarrick J. Wong const union xfs_btree_key *key2, 171*4a200a09SDarrick J. Wong const union xfs_btree_key *mask); 1722c813ad6SDarrick J. Wong 17384be0ffcSDave Chinner const struct xfs_buf_ops *buf_ops; 17484be0ffcSDave Chinner 17584be0ffcSDave Chinner /* check that k1 is lower than k2 */ 17684be0ffcSDave Chinner int (*keys_inorder)(struct xfs_btree_cur *cur, 1778e38dc88SDarrick J. Wong const union xfs_btree_key *k1, 1788e38dc88SDarrick J. Wong const union xfs_btree_key *k2); 17984be0ffcSDave Chinner 18084be0ffcSDave Chinner /* check that r1 is lower than r2 */ 18184be0ffcSDave Chinner int (*recs_inorder)(struct xfs_btree_cur *cur, 1828e38dc88SDarrick J. Wong const union xfs_btree_rec *r1, 1838e38dc88SDarrick J. Wong const union xfs_btree_rec *r2); 1846abc7aefSDarrick J. Wong 1856abc7aefSDarrick J. Wong /* 1866abc7aefSDarrick J. Wong * Are these two btree keys immediately adjacent? 1876abc7aefSDarrick J. Wong * 1886abc7aefSDarrick J. Wong * Given two btree keys @key1 and @key2, decide if it is impossible for 1896abc7aefSDarrick J. Wong * there to be a third btree key K satisfying the relationship 1906abc7aefSDarrick J. Wong * @key1 < K < @key2. To determine if two btree records are 1916abc7aefSDarrick J. Wong * immediately adjacent, @key1 should be the high key of the first 1926abc7aefSDarrick J. Wong * record and @key2 should be the low key of the second record. 193*4a200a09SDarrick J. Wong * If the @mask parameter is non NULL, each key field to be used in the 194*4a200a09SDarrick J. Wong * comparison must contain a nonzero value. 1956abc7aefSDarrick J. Wong */ 1966abc7aefSDarrick J. Wong enum xbtree_key_contig (*keys_contiguous)(struct xfs_btree_cur *cur, 1976abc7aefSDarrick J. Wong const union xfs_btree_key *key1, 198*4a200a09SDarrick J. Wong const union xfs_btree_key *key2, 199*4a200a09SDarrick J. Wong const union xfs_btree_key *mask); 20084be0ffcSDave Chinner }; 20184be0ffcSDave Chinner 20284be0ffcSDave Chinner /* 20384be0ffcSDave Chinner * Reasons for the update_lastrec method to be called. 20484be0ffcSDave Chinner */ 20584be0ffcSDave Chinner #define LASTREC_UPDATE 0 20684be0ffcSDave Chinner #define LASTREC_INSREC 1 20784be0ffcSDave Chinner #define LASTREC_DELREC 2 20884be0ffcSDave Chinner 20984be0ffcSDave Chinner 210105f7d83SDarrick J. Wong union xfs_btree_irec { 211105f7d83SDarrick J. Wong struct xfs_alloc_rec_incore a; 212105f7d83SDarrick J. Wong struct xfs_bmbt_irec b; 213105f7d83SDarrick J. Wong struct xfs_inobt_rec_incore i; 2144b8ed677SDarrick J. Wong struct xfs_rmap_irec r; 2151946b91cSDarrick J. Wong struct xfs_refcount_irec rc; 2161946b91cSDarrick J. Wong }; 2171946b91cSDarrick J. Wong 218c4aa10d0SDave Chinner /* Per-AG btree information. */ 219c4aa10d0SDave Chinner struct xfs_btree_cur_ag { 220be9fb17dSDave Chinner struct xfs_perag *pag; 221e06536a6SDarrick J. Wong union { 222c4aa10d0SDave Chinner struct xfs_buf *agbp; 223e06536a6SDarrick J. Wong struct xbtree_afakeroot *afake; /* for staging cursor */ 224e06536a6SDarrick J. Wong }; 225c4aa10d0SDave Chinner union { 2261946b91cSDarrick J. Wong struct { 227efb79ea3SDarrick J. Wong unsigned int nr_ops; /* # record updates */ 228efb79ea3SDarrick J. Wong unsigned int shape_changes; /* # of extent splits */ 2291946b91cSDarrick J. Wong } refc; 230f6b428a4SBrian Foster struct { 231f6b428a4SBrian Foster bool active; /* allocation cursor state */ 232f6b428a4SBrian Foster } abt; 233105f7d83SDarrick J. Wong }; 23468422d90SDave Chinner }; 23568422d90SDave Chinner 23668422d90SDave Chinner /* Btree-in-inode cursor information */ 23768422d90SDave Chinner struct xfs_btree_cur_ino { 23868422d90SDave Chinner struct xfs_inode *ip; 239349e1c03SDarrick J. Wong struct xbtree_ifakeroot *ifake; /* for staging cursor */ 24068422d90SDave Chinner int allocated; 24168422d90SDave Chinner short forksize; 24268422d90SDave Chinner char whichfork; 24368422d90SDave Chinner char flags; 24468422d90SDave Chinner /* We are converting a delalloc reservation */ 24568422d90SDave Chinner #define XFS_BTCUR_BMBT_WASDEL (1 << 0) 24668422d90SDave Chinner 24768422d90SDave Chinner /* For extent swap, ignore owner check in verifier */ 24868422d90SDave Chinner #define XFS_BTCUR_BMBT_INVALID_OWNER (1 << 1) 24968422d90SDave Chinner }; 25068422d90SDave Chinner 2516ca444cfSDarrick J. Wong struct xfs_btree_level { 2526ca444cfSDarrick J. Wong /* buffer pointer */ 2536ca444cfSDarrick J. Wong struct xfs_buf *bp; 2546ca444cfSDarrick J. Wong 2556ca444cfSDarrick J. Wong /* key/record number */ 2566ca444cfSDarrick J. Wong uint16_t ptr; 2576ca444cfSDarrick J. Wong 2586ca444cfSDarrick J. Wong /* readahead info */ 2596ca444cfSDarrick J. Wong #define XFS_BTCUR_LEFTRA (1 << 0) /* left sibling has been read-ahead */ 2606ca444cfSDarrick J. Wong #define XFS_BTCUR_RIGHTRA (1 << 1) /* right sibling has been read-ahead */ 2616ca444cfSDarrick J. Wong uint16_t ra; 2626ca444cfSDarrick J. Wong }; 2636ca444cfSDarrick J. Wong 26484be0ffcSDave Chinner /* 26584be0ffcSDave Chinner * Btree cursor structure. 26684be0ffcSDave Chinner * This collects all information needed by the btree code in one place. 26784be0ffcSDave Chinner */ 268ae127f08SDarrick J. Wong struct xfs_btree_cur 26984be0ffcSDave Chinner { 27084be0ffcSDave Chinner struct xfs_trans *bc_tp; /* transaction we're in, if any */ 27184be0ffcSDave Chinner struct xfs_mount *bc_mp; /* file system mount struct */ 27284be0ffcSDave Chinner const struct xfs_btree_ops *bc_ops; 273e7720afaSDarrick J. Wong struct kmem_cache *bc_cache; /* cursor cache */ 27469724d92SDarrick J. Wong unsigned int bc_flags; /* btree features - below */ 27569724d92SDarrick J. Wong xfs_btnum_t bc_btnum; /* identifies which btree type */ 276105f7d83SDarrick J. Wong union xfs_btree_irec bc_rec; /* current insert/search record value */ 277c8ce540dSDarrick J. Wong uint8_t bc_nlevels; /* number of levels in the tree */ 278c0643f6fSDarrick J. Wong uint8_t bc_maxlevels; /* maximum levels for this btree type */ 27969724d92SDarrick J. Wong int bc_statoff; /* offset of btree stats array */ 280be9fb17dSDave Chinner 281be9fb17dSDave Chinner /* 282be9fb17dSDave Chinner * Short btree pointers need an agno to be able to turn the pointers 283be9fb17dSDave Chinner * into physical addresses for IO, so the btree cursor switches between 284be9fb17dSDave Chinner * bc_ino and bc_ag based on whether XFS_BTREE_LONG_PTRS is set for the 285be9fb17dSDave Chinner * cursor. 286be9fb17dSDave Chinner */ 28784be0ffcSDave Chinner union { 28868422d90SDave Chinner struct xfs_btree_cur_ag bc_ag; 28968422d90SDave Chinner struct xfs_btree_cur_ino bc_ino; 29068422d90SDave Chinner }; 2916ca444cfSDarrick J. Wong 2926ca444cfSDarrick J. Wong /* Must be at the end of the struct! */ 2936ca444cfSDarrick J. Wong struct xfs_btree_level bc_levels[]; 294ae127f08SDarrick J. Wong }; 29584be0ffcSDave Chinner 2966ca444cfSDarrick J. Wong /* 2976ca444cfSDarrick J. Wong * Compute the size of a btree cursor that can handle a btree of a given 2986ca444cfSDarrick J. Wong * height. The bc_levels array handles node and leaf blocks, so its size 2996ca444cfSDarrick J. Wong * is exactly nlevels. 3006ca444cfSDarrick J. Wong */ 3016ca444cfSDarrick J. Wong static inline size_t 3026ca444cfSDarrick J. Wong xfs_btree_cur_sizeof(unsigned int nlevels) 3036ca444cfSDarrick J. Wong { 3046ca444cfSDarrick J. Wong return struct_size((struct xfs_btree_cur *)NULL, bc_levels, nlevels); 3056ca444cfSDarrick J. Wong } 3066ca444cfSDarrick J. Wong 30784be0ffcSDave Chinner /* cursor flags */ 30884be0ffcSDave Chinner #define XFS_BTREE_LONG_PTRS (1<<0) /* pointers are 64bits long */ 30984be0ffcSDave Chinner #define XFS_BTREE_ROOT_IN_INODE (1<<1) /* root may be variable size */ 31084be0ffcSDave Chinner #define XFS_BTREE_LASTREC_UPDATE (1<<2) /* track last rec externally */ 31184be0ffcSDave Chinner #define XFS_BTREE_CRC_BLOCKS (1<<3) /* uses extended btree blocks */ 3122c813ad6SDarrick J. Wong #define XFS_BTREE_OVERLAPPING (1<<4) /* overlapping intervals */ 313e06536a6SDarrick J. Wong /* 314e06536a6SDarrick J. Wong * The root of this btree is a fakeroot structure so that we can stage a btree 315e06536a6SDarrick J. Wong * rebuild without leaving it accessible via primary metadata. The ops struct 316e06536a6SDarrick J. Wong * is dynamically allocated and must be freed when the cursor is deleted. 317e06536a6SDarrick J. Wong */ 318e06536a6SDarrick J. Wong #define XFS_BTREE_STAGING (1<<5) 31984be0ffcSDave Chinner 32084be0ffcSDave Chinner #define XFS_BTREE_NOERROR 0 32184be0ffcSDave Chinner #define XFS_BTREE_ERROR 1 32284be0ffcSDave Chinner 32384be0ffcSDave Chinner /* 32484be0ffcSDave Chinner * Convert from buffer to btree block header. 32584be0ffcSDave Chinner */ 32684be0ffcSDave Chinner #define XFS_BUF_TO_BLOCK(bp) ((struct xfs_btree_block *)((bp)->b_addr)) 32784be0ffcSDave Chinner 32852c732eeSDarrick J. Wong /* 32952c732eeSDarrick J. Wong * Internal long and short btree block checks. They return NULL if the 33052c732eeSDarrick J. Wong * block is ok or the address of the failed check otherwise. 33152c732eeSDarrick J. Wong */ 33252c732eeSDarrick J. Wong xfs_failaddr_t __xfs_btree_check_lblock(struct xfs_btree_cur *cur, 33352c732eeSDarrick J. Wong struct xfs_btree_block *block, int level, struct xfs_buf *bp); 33452c732eeSDarrick J. Wong xfs_failaddr_t __xfs_btree_check_sblock(struct xfs_btree_cur *cur, 33552c732eeSDarrick J. Wong struct xfs_btree_block *block, int level, struct xfs_buf *bp); 33684be0ffcSDave Chinner 33784be0ffcSDave Chinner /* 33884be0ffcSDave Chinner * Check that block header is ok. 33984be0ffcSDave Chinner */ 34084be0ffcSDave Chinner int 34184be0ffcSDave Chinner xfs_btree_check_block( 34284be0ffcSDave Chinner struct xfs_btree_cur *cur, /* btree cursor */ 34384be0ffcSDave Chinner struct xfs_btree_block *block, /* generic btree block pointer */ 34484be0ffcSDave Chinner int level, /* level of the btree block */ 34584be0ffcSDave Chinner struct xfs_buf *bp); /* buffer containing block, if any */ 34684be0ffcSDave Chinner 34784be0ffcSDave Chinner /* 34884be0ffcSDave Chinner * Check that (long) pointer is ok. 34984be0ffcSDave Chinner */ 350f135761aSDarrick J. Wong bool /* error (0 or EFSCORRUPTED) */ 35184be0ffcSDave Chinner xfs_btree_check_lptr( 35284be0ffcSDave Chinner struct xfs_btree_cur *cur, /* btree cursor */ 353f135761aSDarrick J. Wong xfs_fsblock_t fsbno, /* btree block disk address */ 354f135761aSDarrick J. Wong int level); /* btree block level */ 355f135761aSDarrick J. Wong 356f135761aSDarrick J. Wong /* 357f135761aSDarrick J. Wong * Check that (short) pointer is ok. 358f135761aSDarrick J. Wong */ 359f135761aSDarrick J. Wong bool /* error (0 or EFSCORRUPTED) */ 360f135761aSDarrick J. Wong xfs_btree_check_sptr( 361f135761aSDarrick J. Wong struct xfs_btree_cur *cur, /* btree cursor */ 362f135761aSDarrick J. Wong xfs_agblock_t agbno, /* btree block disk address */ 36384be0ffcSDave Chinner int level); /* btree block level */ 36484be0ffcSDave Chinner 36584be0ffcSDave Chinner /* 36684be0ffcSDave Chinner * Delete the btree cursor. 36784be0ffcSDave Chinner */ 36884be0ffcSDave Chinner void 36984be0ffcSDave Chinner xfs_btree_del_cursor( 370ae127f08SDarrick J. Wong struct xfs_btree_cur *cur, /* btree cursor */ 37184be0ffcSDave Chinner int error); /* del because of error */ 37284be0ffcSDave Chinner 37384be0ffcSDave Chinner /* 37484be0ffcSDave Chinner * Duplicate the btree cursor. 37584be0ffcSDave Chinner * Allocate a new one, copy the record, re-get the buffers. 37684be0ffcSDave Chinner */ 37784be0ffcSDave Chinner int /* error */ 37884be0ffcSDave Chinner xfs_btree_dup_cursor( 379ae127f08SDarrick J. Wong struct xfs_btree_cur *cur, /* input cursor */ 380ae127f08SDarrick J. Wong struct xfs_btree_cur **ncur);/* output cursor */ 38184be0ffcSDave Chinner 38284be0ffcSDave Chinner /* 38384be0ffcSDave Chinner * Compute first and last byte offsets for the fields given. 38484be0ffcSDave Chinner * Interprets the offsets table, which contains struct field offsets. 38584be0ffcSDave Chinner */ 38684be0ffcSDave Chinner void 38784be0ffcSDave Chinner xfs_btree_offsets( 388722db70fSDave Chinner uint32_t fields, /* bitmask of fields */ 38984be0ffcSDave Chinner const short *offsets,/* table of field offsets */ 39084be0ffcSDave Chinner int nbits, /* number of bits to inspect */ 39184be0ffcSDave Chinner int *first, /* output: first byte offset */ 39284be0ffcSDave Chinner int *last); /* output: last byte offset */ 39384be0ffcSDave Chinner 39484be0ffcSDave Chinner /* 39584be0ffcSDave Chinner * Get a buffer for the block, return it read in. 39684be0ffcSDave Chinner * Long-form addressing. 39784be0ffcSDave Chinner */ 39884be0ffcSDave Chinner int /* error */ 39984be0ffcSDave Chinner xfs_btree_read_bufl( 40084be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 40184be0ffcSDave Chinner struct xfs_trans *tp, /* transaction pointer */ 40284be0ffcSDave Chinner xfs_fsblock_t fsbno, /* file system block number */ 40384be0ffcSDave Chinner struct xfs_buf **bpp, /* buffer for fsbno */ 40484be0ffcSDave Chinner int refval, /* ref count value for buffer */ 40584be0ffcSDave Chinner const struct xfs_buf_ops *ops); 40684be0ffcSDave Chinner 40784be0ffcSDave Chinner /* 40884be0ffcSDave Chinner * Read-ahead the block, don't wait for it, don't return a buffer. 40984be0ffcSDave Chinner * Long-form addressing. 41084be0ffcSDave Chinner */ 41184be0ffcSDave Chinner void /* error */ 41284be0ffcSDave Chinner xfs_btree_reada_bufl( 41384be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 41484be0ffcSDave Chinner xfs_fsblock_t fsbno, /* file system block number */ 41584be0ffcSDave Chinner xfs_extlen_t count, /* count of filesystem blocks */ 41684be0ffcSDave Chinner const struct xfs_buf_ops *ops); 41784be0ffcSDave Chinner 41884be0ffcSDave Chinner /* 41984be0ffcSDave Chinner * Read-ahead the block, don't wait for it, don't return a buffer. 42084be0ffcSDave Chinner * Short-form addressing. 42184be0ffcSDave Chinner */ 42284be0ffcSDave Chinner void /* error */ 42384be0ffcSDave Chinner xfs_btree_reada_bufs( 42484be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 42584be0ffcSDave Chinner xfs_agnumber_t agno, /* allocation group number */ 42684be0ffcSDave Chinner xfs_agblock_t agbno, /* allocation group block number */ 42784be0ffcSDave Chinner xfs_extlen_t count, /* count of filesystem blocks */ 42884be0ffcSDave Chinner const struct xfs_buf_ops *ops); 42984be0ffcSDave Chinner 43084be0ffcSDave Chinner /* 43184be0ffcSDave Chinner * Initialise a new btree block header 43284be0ffcSDave Chinner */ 43384be0ffcSDave Chinner void 43484be0ffcSDave Chinner xfs_btree_init_block( 43584be0ffcSDave Chinner struct xfs_mount *mp, 43684be0ffcSDave Chinner struct xfs_buf *bp, 437b6f41e44SEric Sandeen xfs_btnum_t btnum, 43884be0ffcSDave Chinner __u16 level, 43984be0ffcSDave Chinner __u16 numrecs, 440f5b999c0SEric Sandeen __u64 owner); 44184be0ffcSDave Chinner 44284be0ffcSDave Chinner void 44384be0ffcSDave Chinner xfs_btree_init_block_int( 44484be0ffcSDave Chinner struct xfs_mount *mp, 44584be0ffcSDave Chinner struct xfs_btree_block *buf, 44684be0ffcSDave Chinner xfs_daddr_t blkno, 447b6f41e44SEric Sandeen xfs_btnum_t btnum, 44884be0ffcSDave Chinner __u16 level, 44984be0ffcSDave Chinner __u16 numrecs, 45084be0ffcSDave Chinner __u64 owner, 45184be0ffcSDave Chinner unsigned int flags); 45284be0ffcSDave Chinner 45384be0ffcSDave Chinner /* 45484be0ffcSDave Chinner * Common btree core entry points. 45584be0ffcSDave Chinner */ 45684be0ffcSDave Chinner int xfs_btree_increment(struct xfs_btree_cur *, int, int *); 45784be0ffcSDave Chinner int xfs_btree_decrement(struct xfs_btree_cur *, int, int *); 45884be0ffcSDave Chinner int xfs_btree_lookup(struct xfs_btree_cur *, xfs_lookup_t, int *); 45984be0ffcSDave Chinner int xfs_btree_update(struct xfs_btree_cur *, union xfs_btree_rec *); 46084be0ffcSDave Chinner int xfs_btree_new_iroot(struct xfs_btree_cur *, int *, int *); 46184be0ffcSDave Chinner int xfs_btree_insert(struct xfs_btree_cur *, int *); 46284be0ffcSDave Chinner int xfs_btree_delete(struct xfs_btree_cur *, int *); 46384be0ffcSDave Chinner int xfs_btree_get_rec(struct xfs_btree_cur *, union xfs_btree_rec **, int *); 464c8ce540dSDarrick J. Wong int xfs_btree_change_owner(struct xfs_btree_cur *cur, uint64_t new_owner, 46584be0ffcSDave Chinner struct list_head *buffer_list); 46684be0ffcSDave Chinner 46784be0ffcSDave Chinner /* 46884be0ffcSDave Chinner * btree block CRC helpers 46984be0ffcSDave Chinner */ 47084be0ffcSDave Chinner void xfs_btree_lblock_calc_crc(struct xfs_buf *); 47184be0ffcSDave Chinner bool xfs_btree_lblock_verify_crc(struct xfs_buf *); 47284be0ffcSDave Chinner void xfs_btree_sblock_calc_crc(struct xfs_buf *); 47384be0ffcSDave Chinner bool xfs_btree_sblock_verify_crc(struct xfs_buf *); 47484be0ffcSDave Chinner 47584be0ffcSDave Chinner /* 47684be0ffcSDave Chinner * Internal btree helpers also used by xfs_bmap.c. 47784be0ffcSDave Chinner */ 478722db70fSDave Chinner void xfs_btree_log_block(struct xfs_btree_cur *, struct xfs_buf *, uint32_t); 47984be0ffcSDave Chinner void xfs_btree_log_recs(struct xfs_btree_cur *, struct xfs_buf *, int, int); 48084be0ffcSDave Chinner 48184be0ffcSDave Chinner /* 48284be0ffcSDave Chinner * Helpers. 48384be0ffcSDave Chinner */ 48460e265f7SDarrick J. Wong static inline int xfs_btree_get_numrecs(const struct xfs_btree_block *block) 48584be0ffcSDave Chinner { 48684be0ffcSDave Chinner return be16_to_cpu(block->bb_numrecs); 48784be0ffcSDave Chinner } 48884be0ffcSDave Chinner 48984be0ffcSDave Chinner static inline void xfs_btree_set_numrecs(struct xfs_btree_block *block, 490c8ce540dSDarrick J. Wong uint16_t numrecs) 49184be0ffcSDave Chinner { 49284be0ffcSDave Chinner block->bb_numrecs = cpu_to_be16(numrecs); 49384be0ffcSDave Chinner } 49484be0ffcSDave Chinner 49560e265f7SDarrick J. Wong static inline int xfs_btree_get_level(const struct xfs_btree_block *block) 49684be0ffcSDave Chinner { 49784be0ffcSDave Chinner return be16_to_cpu(block->bb_level); 49884be0ffcSDave Chinner } 49984be0ffcSDave Chinner 50084be0ffcSDave Chinner 50184be0ffcSDave Chinner /* 50284be0ffcSDave Chinner * Min and max functions for extlen, agblock, fileoff, and filblks types. 50384be0ffcSDave Chinner */ 50484be0ffcSDave Chinner #define XFS_EXTLEN_MIN(a,b) min_t(xfs_extlen_t, (a), (b)) 50584be0ffcSDave Chinner #define XFS_EXTLEN_MAX(a,b) max_t(xfs_extlen_t, (a), (b)) 50684be0ffcSDave Chinner #define XFS_AGBLOCK_MIN(a,b) min_t(xfs_agblock_t, (a), (b)) 50784be0ffcSDave Chinner #define XFS_AGBLOCK_MAX(a,b) max_t(xfs_agblock_t, (a), (b)) 50884be0ffcSDave Chinner #define XFS_FILEOFF_MIN(a,b) min_t(xfs_fileoff_t, (a), (b)) 50984be0ffcSDave Chinner #define XFS_FILEOFF_MAX(a,b) max_t(xfs_fileoff_t, (a), (b)) 51084be0ffcSDave Chinner #define XFS_FILBLKS_MIN(a,b) min_t(xfs_filblks_t, (a), (b)) 51184be0ffcSDave Chinner #define XFS_FILBLKS_MAX(a,b) max_t(xfs_filblks_t, (a), (b)) 51284be0ffcSDave Chinner 513a6a781a5SDarrick J. Wong xfs_failaddr_t xfs_btree_sblock_v5hdr_verify(struct xfs_buf *bp); 514a6a781a5SDarrick J. Wong xfs_failaddr_t xfs_btree_sblock_verify(struct xfs_buf *bp, 515a6a781a5SDarrick J. Wong unsigned int max_recs); 516a6a781a5SDarrick J. Wong xfs_failaddr_t xfs_btree_lblock_v5hdr_verify(struct xfs_buf *bp, 517a6a781a5SDarrick J. Wong uint64_t owner); 518a6a781a5SDarrick J. Wong xfs_failaddr_t xfs_btree_lblock_verify(struct xfs_buf *bp, 519a6a781a5SDarrick J. Wong unsigned int max_recs); 5208368a601SDarrick J. Wong 5211b236ad7SDarrick J. Wong unsigned int xfs_btree_compute_maxlevels(const unsigned int *limits, 5221b236ad7SDarrick J. Wong unsigned long long records); 5231b236ad7SDarrick J. Wong unsigned long long xfs_btree_calc_size(const unsigned int *limits, 5241b236ad7SDarrick J. Wong unsigned long long records); 5259ec69120SDarrick J. Wong unsigned int xfs_btree_space_to_height(const unsigned int *limits, 5269ec69120SDarrick J. Wong unsigned long long blocks); 527c5ab131bSDarrick J. Wong 528e7ee96dfSDarrick J. Wong /* 529e7ee96dfSDarrick J. Wong * Return codes for the query range iterator function are 0 to continue 530e7ee96dfSDarrick J. Wong * iterating, and non-zero to stop iterating. Any non-zero value will be 531e7ee96dfSDarrick J. Wong * passed up to the _query_range caller. The special value -ECANCELED can be 532e7ee96dfSDarrick J. Wong * used to stop iteration, because _query_range never generates that error 533e7ee96dfSDarrick J. Wong * code on its own. 534e7ee96dfSDarrick J. Wong */ 535105f7d83SDarrick J. Wong typedef int (*xfs_btree_query_range_fn)(struct xfs_btree_cur *cur, 536159eb69dSDarrick J. Wong const union xfs_btree_rec *rec, void *priv); 537105f7d83SDarrick J. Wong 538105f7d83SDarrick J. Wong int xfs_btree_query_range(struct xfs_btree_cur *cur, 53904dcb474SDarrick J. Wong const union xfs_btree_irec *low_rec, 54004dcb474SDarrick J. Wong const union xfs_btree_irec *high_rec, 541105f7d83SDarrick J. Wong xfs_btree_query_range_fn fn, void *priv); 542e9a2599aSDarrick J. Wong int xfs_btree_query_all(struct xfs_btree_cur *cur, xfs_btree_query_range_fn fn, 543e9a2599aSDarrick J. Wong void *priv); 544105f7d83SDarrick J. Wong 54528a89567SDarrick J. Wong typedef int (*xfs_btree_visit_blocks_fn)(struct xfs_btree_cur *cur, int level, 54628a89567SDarrick J. Wong void *data); 547e992ae8aSDarrick J. Wong /* Visit record blocks. */ 548e992ae8aSDarrick J. Wong #define XFS_BTREE_VISIT_RECORDS (1 << 0) 549e992ae8aSDarrick J. Wong /* Visit leaf blocks. */ 550e992ae8aSDarrick J. Wong #define XFS_BTREE_VISIT_LEAVES (1 << 1) 551e992ae8aSDarrick J. Wong /* Visit all blocks. */ 552e992ae8aSDarrick J. Wong #define XFS_BTREE_VISIT_ALL (XFS_BTREE_VISIT_RECORDS | \ 553e992ae8aSDarrick J. Wong XFS_BTREE_VISIT_LEAVES) 55428a89567SDarrick J. Wong int xfs_btree_visit_blocks(struct xfs_btree_cur *cur, 555e992ae8aSDarrick J. Wong xfs_btree_visit_blocks_fn fn, unsigned int flags, void *data); 55628a89567SDarrick J. Wong 557c611cc03SDarrick J. Wong int xfs_btree_count_blocks(struct xfs_btree_cur *cur, xfs_extlen_t *blocks); 558c611cc03SDarrick J. Wong 55926788097SDarrick J. Wong union xfs_btree_rec *xfs_btree_rec_addr(struct xfs_btree_cur *cur, int n, 56026788097SDarrick J. Wong struct xfs_btree_block *block); 56126788097SDarrick J. Wong union xfs_btree_key *xfs_btree_key_addr(struct xfs_btree_cur *cur, int n, 56226788097SDarrick J. Wong struct xfs_btree_block *block); 56326788097SDarrick J. Wong union xfs_btree_key *xfs_btree_high_key_addr(struct xfs_btree_cur *cur, int n, 56426788097SDarrick J. Wong struct xfs_btree_block *block); 56526788097SDarrick J. Wong union xfs_btree_ptr *xfs_btree_ptr_addr(struct xfs_btree_cur *cur, int n, 56626788097SDarrick J. Wong struct xfs_btree_block *block); 56726788097SDarrick J. Wong int xfs_btree_lookup_get_block(struct xfs_btree_cur *cur, int level, 56832816fd7SDarrick J. Wong const union xfs_btree_ptr *pp, struct xfs_btree_block **blkp); 56926788097SDarrick J. Wong struct xfs_btree_block *xfs_btree_get_block(struct xfs_btree_cur *cur, 57026788097SDarrick J. Wong int level, struct xfs_buf **bpp); 57132816fd7SDarrick J. Wong bool xfs_btree_ptr_is_null(struct xfs_btree_cur *cur, 57232816fd7SDarrick J. Wong const union xfs_btree_ptr *ptr); 573cc3e0948SDarrick J. Wong int64_t xfs_btree_diff_two_ptrs(struct xfs_btree_cur *cur, 574cc3e0948SDarrick J. Wong const union xfs_btree_ptr *a, 575cc3e0948SDarrick J. Wong const union xfs_btree_ptr *b); 576cc3e0948SDarrick J. Wong void xfs_btree_get_sibling(struct xfs_btree_cur *cur, 577cc3e0948SDarrick J. Wong struct xfs_btree_block *block, 578cc3e0948SDarrick J. Wong union xfs_btree_ptr *ptr, int lr); 5792fdbec5cSDarrick J. Wong void xfs_btree_get_keys(struct xfs_btree_cur *cur, 5802fdbec5cSDarrick J. Wong struct xfs_btree_block *block, union xfs_btree_key *key); 5812fdbec5cSDarrick J. Wong union xfs_btree_key *xfs_btree_high_key_from_key(struct xfs_btree_cur *cur, 5822fdbec5cSDarrick J. Wong union xfs_btree_key *key); 5836abc7aefSDarrick J. Wong typedef bool (*xfs_btree_key_gap_fn)(struct xfs_btree_cur *cur, 5846abc7aefSDarrick J. Wong const union xfs_btree_key *key1, 5856abc7aefSDarrick J. Wong const union xfs_btree_key *key2); 5866abc7aefSDarrick J. Wong 5876abc7aefSDarrick J. Wong int xfs_btree_has_records(struct xfs_btree_cur *cur, 58832816fd7SDarrick J. Wong const union xfs_btree_irec *low, 5896abc7aefSDarrick J. Wong const union xfs_btree_irec *high, 590*4a200a09SDarrick J. Wong const union xfs_btree_key *mask, 5916abc7aefSDarrick J. Wong enum xbtree_recpacking *outcome); 5926abc7aefSDarrick J. Wong 59308daa3ccSDarrick J. Wong bool xfs_btree_has_more_records(struct xfs_btree_cur *cur); 594349e1c03SDarrick J. Wong struct xfs_ifork *xfs_btree_ifork_ptr(struct xfs_btree_cur *cur); 59526788097SDarrick J. Wong 596bd7e7951SDarrick J. Wong /* Key comparison helpers */ 597bd7e7951SDarrick J. Wong static inline bool 598bd7e7951SDarrick J. Wong xfs_btree_keycmp_lt( 599bd7e7951SDarrick J. Wong struct xfs_btree_cur *cur, 600bd7e7951SDarrick J. Wong const union xfs_btree_key *key1, 601bd7e7951SDarrick J. Wong const union xfs_btree_key *key2) 602bd7e7951SDarrick J. Wong { 603*4a200a09SDarrick J. Wong return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) < 0; 604bd7e7951SDarrick J. Wong } 605bd7e7951SDarrick J. Wong 606bd7e7951SDarrick J. Wong static inline bool 607bd7e7951SDarrick J. Wong xfs_btree_keycmp_gt( 608bd7e7951SDarrick J. Wong struct xfs_btree_cur *cur, 609bd7e7951SDarrick J. Wong const union xfs_btree_key *key1, 610bd7e7951SDarrick J. Wong const union xfs_btree_key *key2) 611bd7e7951SDarrick J. Wong { 612*4a200a09SDarrick J. Wong return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) > 0; 613bd7e7951SDarrick J. Wong } 614bd7e7951SDarrick J. Wong 615bd7e7951SDarrick J. Wong static inline bool 616bd7e7951SDarrick J. Wong xfs_btree_keycmp_eq( 617bd7e7951SDarrick J. Wong struct xfs_btree_cur *cur, 618bd7e7951SDarrick J. Wong const union xfs_btree_key *key1, 619bd7e7951SDarrick J. Wong const union xfs_btree_key *key2) 620bd7e7951SDarrick J. Wong { 621*4a200a09SDarrick J. Wong return cur->bc_ops->diff_two_keys(cur, key1, key2, NULL) == 0; 622bd7e7951SDarrick J. Wong } 623bd7e7951SDarrick J. Wong 624bd7e7951SDarrick J. Wong static inline bool 625bd7e7951SDarrick J. Wong xfs_btree_keycmp_le( 626bd7e7951SDarrick J. Wong struct xfs_btree_cur *cur, 627bd7e7951SDarrick J. Wong const union xfs_btree_key *key1, 628bd7e7951SDarrick J. Wong const union xfs_btree_key *key2) 629bd7e7951SDarrick J. Wong { 630bd7e7951SDarrick J. Wong return !xfs_btree_keycmp_gt(cur, key1, key2); 631bd7e7951SDarrick J. Wong } 632bd7e7951SDarrick J. Wong 633bd7e7951SDarrick J. Wong static inline bool 634bd7e7951SDarrick J. Wong xfs_btree_keycmp_ge( 635bd7e7951SDarrick J. Wong struct xfs_btree_cur *cur, 636bd7e7951SDarrick J. Wong const union xfs_btree_key *key1, 637bd7e7951SDarrick J. Wong const union xfs_btree_key *key2) 638bd7e7951SDarrick J. Wong { 639bd7e7951SDarrick J. Wong return !xfs_btree_keycmp_lt(cur, key1, key2); 640bd7e7951SDarrick J. Wong } 641bd7e7951SDarrick J. Wong 642bd7e7951SDarrick J. Wong static inline bool 643bd7e7951SDarrick J. Wong xfs_btree_keycmp_ne( 644bd7e7951SDarrick J. Wong struct xfs_btree_cur *cur, 645bd7e7951SDarrick J. Wong const union xfs_btree_key *key1, 646bd7e7951SDarrick J. Wong const union xfs_btree_key *key2) 647bd7e7951SDarrick J. Wong { 648bd7e7951SDarrick J. Wong return !xfs_btree_keycmp_eq(cur, key1, key2); 649bd7e7951SDarrick J. Wong } 650bd7e7951SDarrick J. Wong 651*4a200a09SDarrick J. Wong /* Masked key comparison helpers */ 652*4a200a09SDarrick J. Wong static inline bool 653*4a200a09SDarrick J. Wong xfs_btree_masked_keycmp_lt( 654*4a200a09SDarrick J. Wong struct xfs_btree_cur *cur, 655*4a200a09SDarrick J. Wong const union xfs_btree_key *key1, 656*4a200a09SDarrick J. Wong const union xfs_btree_key *key2, 657*4a200a09SDarrick J. Wong const union xfs_btree_key *mask) 658*4a200a09SDarrick J. Wong { 659*4a200a09SDarrick J. Wong return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) < 0; 660*4a200a09SDarrick J. Wong } 661*4a200a09SDarrick J. Wong 662*4a200a09SDarrick J. Wong static inline bool 663*4a200a09SDarrick J. Wong xfs_btree_masked_keycmp_gt( 664*4a200a09SDarrick J. Wong struct xfs_btree_cur *cur, 665*4a200a09SDarrick J. Wong const union xfs_btree_key *key1, 666*4a200a09SDarrick J. Wong const union xfs_btree_key *key2, 667*4a200a09SDarrick J. Wong const union xfs_btree_key *mask) 668*4a200a09SDarrick J. Wong { 669*4a200a09SDarrick J. Wong return cur->bc_ops->diff_two_keys(cur, key1, key2, mask) > 0; 670*4a200a09SDarrick J. Wong } 671*4a200a09SDarrick J. Wong 672*4a200a09SDarrick J. Wong static inline bool 673*4a200a09SDarrick J. Wong xfs_btree_masked_keycmp_ge( 674*4a200a09SDarrick J. Wong struct xfs_btree_cur *cur, 675*4a200a09SDarrick J. Wong const union xfs_btree_key *key1, 676*4a200a09SDarrick J. Wong const union xfs_btree_key *key2, 677*4a200a09SDarrick J. Wong const union xfs_btree_key *mask) 678*4a200a09SDarrick J. Wong { 679*4a200a09SDarrick J. Wong return !xfs_btree_masked_keycmp_lt(cur, key1, key2, mask); 680*4a200a09SDarrick J. Wong } 681*4a200a09SDarrick J. Wong 68227d9ee57SDarrick J. Wong /* Does this cursor point to the last block in the given level? */ 68327d9ee57SDarrick J. Wong static inline bool 68427d9ee57SDarrick J. Wong xfs_btree_islastblock( 685ae127f08SDarrick J. Wong struct xfs_btree_cur *cur, 68627d9ee57SDarrick J. Wong int level) 68727d9ee57SDarrick J. Wong { 68827d9ee57SDarrick J. Wong struct xfs_btree_block *block; 68927d9ee57SDarrick J. Wong struct xfs_buf *bp; 69027d9ee57SDarrick J. Wong 69127d9ee57SDarrick J. Wong block = xfs_btree_get_block(cur, level, &bp); 69227d9ee57SDarrick J. Wong 69327d9ee57SDarrick J. Wong if (cur->bc_flags & XFS_BTREE_LONG_PTRS) 69427d9ee57SDarrick J. Wong return block->bb_u.l.bb_rightsib == cpu_to_be64(NULLFSBLOCK); 69527d9ee57SDarrick J. Wong return block->bb_u.s.bb_rightsib == cpu_to_be32(NULLAGBLOCK); 69627d9ee57SDarrick J. Wong } 69727d9ee57SDarrick J. Wong 69860e3d707SDarrick J. Wong void xfs_btree_set_ptr_null(struct xfs_btree_cur *cur, 69960e3d707SDarrick J. Wong union xfs_btree_ptr *ptr); 70032816fd7SDarrick J. Wong int xfs_btree_get_buf_block(struct xfs_btree_cur *cur, 70132816fd7SDarrick J. Wong const union xfs_btree_ptr *ptr, struct xfs_btree_block **block, 70232816fd7SDarrick J. Wong struct xfs_buf **bpp); 70360e3d707SDarrick J. Wong void xfs_btree_set_sibling(struct xfs_btree_cur *cur, 70432816fd7SDarrick J. Wong struct xfs_btree_block *block, const union xfs_btree_ptr *ptr, 70560e3d707SDarrick J. Wong int lr); 70660e3d707SDarrick J. Wong void xfs_btree_init_block_cur(struct xfs_btree_cur *cur, 70760e3d707SDarrick J. Wong struct xfs_buf *bp, int level, int numrecs); 70860e3d707SDarrick J. Wong void xfs_btree_copy_ptrs(struct xfs_btree_cur *cur, 70960e3d707SDarrick J. Wong union xfs_btree_ptr *dst_ptr, 71060e3d707SDarrick J. Wong const union xfs_btree_ptr *src_ptr, int numptrs); 71160e3d707SDarrick J. Wong void xfs_btree_copy_keys(struct xfs_btree_cur *cur, 71232816fd7SDarrick J. Wong union xfs_btree_key *dst_key, 71332816fd7SDarrick J. Wong const union xfs_btree_key *src_key, int numkeys); 71460e3d707SDarrick J. Wong 71556370ea6SDarrick J. Wong static inline struct xfs_btree_cur * 71656370ea6SDarrick J. Wong xfs_btree_alloc_cursor( 71756370ea6SDarrick J. Wong struct xfs_mount *mp, 71856370ea6SDarrick J. Wong struct xfs_trans *tp, 719c940a0c5SDarrick J. Wong xfs_btnum_t btnum, 7209fa47bdcSDarrick J. Wong uint8_t maxlevels, 721e7720afaSDarrick J. Wong struct kmem_cache *cache) 72256370ea6SDarrick J. Wong { 72356370ea6SDarrick J. Wong struct xfs_btree_cur *cur; 72456370ea6SDarrick J. Wong 7259fa47bdcSDarrick J. Wong cur = kmem_cache_zalloc(cache, GFP_NOFS | __GFP_NOFAIL); 72656370ea6SDarrick J. Wong cur->bc_tp = tp; 72756370ea6SDarrick J. Wong cur->bc_mp = mp; 72856370ea6SDarrick J. Wong cur->bc_btnum = btnum; 729c940a0c5SDarrick J. Wong cur->bc_maxlevels = maxlevels; 7309fa47bdcSDarrick J. Wong cur->bc_cache = cache; 73156370ea6SDarrick J. Wong 73256370ea6SDarrick J. Wong return cur; 73356370ea6SDarrick J. Wong } 73456370ea6SDarrick J. Wong 7359fa47bdcSDarrick J. Wong int __init xfs_btree_init_cur_caches(void); 7369fa47bdcSDarrick J. Wong void xfs_btree_destroy_cur_caches(void); 7379fa47bdcSDarrick J. Wong 73884be0ffcSDave Chinner #endif /* __XFS_BTREE_H__ */ 739