184be0ffcSDave Chinner /* 284be0ffcSDave Chinner * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc. 384be0ffcSDave Chinner * All Rights Reserved. 484be0ffcSDave Chinner * 584be0ffcSDave Chinner * This program is free software; you can redistribute it and/or 684be0ffcSDave Chinner * modify it under the terms of the GNU General Public License as 784be0ffcSDave Chinner * published by the Free Software Foundation. 884be0ffcSDave Chinner * 984be0ffcSDave Chinner * This program is distributed in the hope that it would be useful, 1084be0ffcSDave Chinner * but WITHOUT ANY WARRANTY; without even the implied warranty of 1184be0ffcSDave Chinner * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 1284be0ffcSDave Chinner * GNU General Public License for more details. 1384be0ffcSDave Chinner * 1484be0ffcSDave Chinner * You should have received a copy of the GNU General Public License 1584be0ffcSDave Chinner * along with this program; if not, write the Free Software Foundation, 1684be0ffcSDave Chinner * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 1784be0ffcSDave Chinner */ 1884be0ffcSDave Chinner #ifndef __XFS_BTREE_H__ 1984be0ffcSDave Chinner #define __XFS_BTREE_H__ 2084be0ffcSDave Chinner 2184be0ffcSDave Chinner struct xfs_buf; 22310a75a3SDarrick J. Wong struct xfs_defer_ops; 2384be0ffcSDave Chinner struct xfs_inode; 2484be0ffcSDave Chinner struct xfs_mount; 2584be0ffcSDave Chinner struct xfs_trans; 2684be0ffcSDave Chinner 2784be0ffcSDave Chinner extern kmem_zone_t *xfs_btree_cur_zone; 2884be0ffcSDave Chinner 2984be0ffcSDave Chinner /* 3084be0ffcSDave Chinner * Generic key, ptr and record wrapper structures. 3184be0ffcSDave Chinner * 3284be0ffcSDave Chinner * These are disk format structures, and are converted where necessary 3384be0ffcSDave Chinner * by the btree specific code that needs to interpret them. 3484be0ffcSDave Chinner */ 3584be0ffcSDave Chinner union xfs_btree_ptr { 3684be0ffcSDave Chinner __be32 s; /* short form ptr */ 3784be0ffcSDave Chinner __be64 l; /* long form ptr */ 3884be0ffcSDave Chinner }; 3984be0ffcSDave Chinner 40a1d46cffSDarrick J. Wong /* 41a1d46cffSDarrick J. Wong * The in-core btree key. Overlapping btrees actually store two keys 42a1d46cffSDarrick J. Wong * per pointer, so we reserve enough memory to hold both. The __*bigkey 43a1d46cffSDarrick J. Wong * items should never be accessed directly. 44a1d46cffSDarrick J. Wong */ 4584be0ffcSDave Chinner union xfs_btree_key { 46035e00acSDarrick J. Wong struct xfs_bmbt_key bmbt; 4784be0ffcSDave Chinner xfs_bmdr_key_t bmbr; /* bmbt root block */ 4884be0ffcSDave Chinner xfs_alloc_key_t alloc; 49035e00acSDarrick J. Wong struct xfs_inobt_key inobt; 50035e00acSDarrick J. Wong struct xfs_rmap_key rmap; 51a1d46cffSDarrick J. Wong struct xfs_rmap_key __rmap_bigkey[2]; 522c813ad6SDarrick J. Wong }; 532c813ad6SDarrick J. Wong 5484be0ffcSDave Chinner union xfs_btree_rec { 55035e00acSDarrick J. Wong struct xfs_bmbt_rec bmbt; 5684be0ffcSDave Chinner xfs_bmdr_rec_t bmbr; /* bmbt root block */ 57035e00acSDarrick J. Wong struct xfs_alloc_rec alloc; 58035e00acSDarrick J. Wong struct xfs_inobt_rec inobt; 59035e00acSDarrick J. Wong struct xfs_rmap_rec rmap; 6084be0ffcSDave Chinner }; 6184be0ffcSDave Chinner 6284be0ffcSDave Chinner /* 6384be0ffcSDave Chinner * This nonsense is to make -wlint happy. 6484be0ffcSDave Chinner */ 6584be0ffcSDave Chinner #define XFS_LOOKUP_EQ ((xfs_lookup_t)XFS_LOOKUP_EQi) 6684be0ffcSDave Chinner #define XFS_LOOKUP_LE ((xfs_lookup_t)XFS_LOOKUP_LEi) 6784be0ffcSDave Chinner #define XFS_LOOKUP_GE ((xfs_lookup_t)XFS_LOOKUP_GEi) 6884be0ffcSDave Chinner 6984be0ffcSDave Chinner #define XFS_BTNUM_BNO ((xfs_btnum_t)XFS_BTNUM_BNOi) 7084be0ffcSDave Chinner #define XFS_BTNUM_CNT ((xfs_btnum_t)XFS_BTNUM_CNTi) 7184be0ffcSDave Chinner #define XFS_BTNUM_BMAP ((xfs_btnum_t)XFS_BTNUM_BMAPi) 7284be0ffcSDave Chinner #define XFS_BTNUM_INO ((xfs_btnum_t)XFS_BTNUM_INOi) 7384be0ffcSDave Chinner #define XFS_BTNUM_FINO ((xfs_btnum_t)XFS_BTNUM_FINOi) 74b8704944SDarrick J. Wong #define XFS_BTNUM_RMAP ((xfs_btnum_t)XFS_BTNUM_RMAPi) 7584be0ffcSDave Chinner 7684be0ffcSDave Chinner /* 7784be0ffcSDave Chinner * For logging record fields. 7884be0ffcSDave Chinner */ 7984be0ffcSDave Chinner #define XFS_BB_MAGIC (1 << 0) 8084be0ffcSDave Chinner #define XFS_BB_LEVEL (1 << 1) 8184be0ffcSDave Chinner #define XFS_BB_NUMRECS (1 << 2) 8284be0ffcSDave Chinner #define XFS_BB_LEFTSIB (1 << 3) 8384be0ffcSDave Chinner #define XFS_BB_RIGHTSIB (1 << 4) 8484be0ffcSDave Chinner #define XFS_BB_BLKNO (1 << 5) 8584be0ffcSDave Chinner #define XFS_BB_LSN (1 << 6) 8684be0ffcSDave Chinner #define XFS_BB_UUID (1 << 7) 8784be0ffcSDave Chinner #define XFS_BB_OWNER (1 << 8) 8884be0ffcSDave Chinner #define XFS_BB_NUM_BITS 5 8984be0ffcSDave Chinner #define XFS_BB_ALL_BITS ((1 << XFS_BB_NUM_BITS) - 1) 9084be0ffcSDave Chinner #define XFS_BB_NUM_BITS_CRC 9 9184be0ffcSDave Chinner #define XFS_BB_ALL_BITS_CRC ((1 << XFS_BB_NUM_BITS_CRC) - 1) 9284be0ffcSDave Chinner 9384be0ffcSDave Chinner /* 9484be0ffcSDave Chinner * Generic stats interface 9584be0ffcSDave Chinner */ 96ff6d6af2SBill O'Donnell #define __XFS_BTREE_STATS_INC(mp, type, stat) \ 97ff6d6af2SBill O'Donnell XFS_STATS_INC(mp, xs_ ## type ## _2_ ## stat) 9884be0ffcSDave Chinner #define XFS_BTREE_STATS_INC(cur, stat) \ 9984be0ffcSDave Chinner do { \ 100ff6d6af2SBill O'Donnell struct xfs_mount *__mp = cur->bc_mp; \ 10184be0ffcSDave Chinner switch (cur->bc_btnum) { \ 102ff6d6af2SBill O'Donnell case XFS_BTNUM_BNO: __XFS_BTREE_STATS_INC(__mp, abtb, stat); break; \ 103ff6d6af2SBill O'Donnell case XFS_BTNUM_CNT: __XFS_BTREE_STATS_INC(__mp, abtc, stat); break; \ 104ff6d6af2SBill O'Donnell case XFS_BTNUM_BMAP: __XFS_BTREE_STATS_INC(__mp, bmbt, stat); break; \ 105ff6d6af2SBill O'Donnell case XFS_BTNUM_INO: __XFS_BTREE_STATS_INC(__mp, ibt, stat); break; \ 106ff6d6af2SBill O'Donnell case XFS_BTNUM_FINO: __XFS_BTREE_STATS_INC(__mp, fibt, stat); break; \ 10700f4e4f9SDarrick J. Wong case XFS_BTNUM_RMAP: __XFS_BTREE_STATS_INC(__mp, rmap, stat); break; \ 10884be0ffcSDave Chinner case XFS_BTNUM_MAX: ASSERT(0); /* fucking gcc */ ; break; \ 10984be0ffcSDave Chinner } \ 11084be0ffcSDave Chinner } while (0) 11184be0ffcSDave Chinner 112ff6d6af2SBill O'Donnell #define __XFS_BTREE_STATS_ADD(mp, type, stat, val) \ 113ff6d6af2SBill O'Donnell XFS_STATS_ADD(mp, xs_ ## type ## _2_ ## stat, val) 11484be0ffcSDave Chinner #define XFS_BTREE_STATS_ADD(cur, stat, val) \ 11584be0ffcSDave Chinner do { \ 116ff6d6af2SBill O'Donnell struct xfs_mount *__mp = cur->bc_mp; \ 11784be0ffcSDave Chinner switch (cur->bc_btnum) { \ 118ff6d6af2SBill O'Donnell case XFS_BTNUM_BNO: \ 119ff6d6af2SBill O'Donnell __XFS_BTREE_STATS_ADD(__mp, abtb, stat, val); break; \ 120ff6d6af2SBill O'Donnell case XFS_BTNUM_CNT: \ 121ff6d6af2SBill O'Donnell __XFS_BTREE_STATS_ADD(__mp, abtc, stat, val); break; \ 122ff6d6af2SBill O'Donnell case XFS_BTNUM_BMAP: \ 123ff6d6af2SBill O'Donnell __XFS_BTREE_STATS_ADD(__mp, bmbt, stat, val); break; \ 124ff6d6af2SBill O'Donnell case XFS_BTNUM_INO: \ 125ff6d6af2SBill O'Donnell __XFS_BTREE_STATS_ADD(__mp, ibt, stat, val); break; \ 126ff6d6af2SBill O'Donnell case XFS_BTNUM_FINO: \ 127ff6d6af2SBill O'Donnell __XFS_BTREE_STATS_ADD(__mp, fibt, stat, val); break; \ 12800f4e4f9SDarrick J. Wong case XFS_BTNUM_RMAP: \ 12900f4e4f9SDarrick J. Wong __XFS_BTREE_STATS_ADD(__mp, rmap, stat, val); break; \ 13084be0ffcSDave Chinner case XFS_BTNUM_MAX: ASSERT(0); /* fucking gcc */ ; break; \ 13184be0ffcSDave Chinner } \ 13284be0ffcSDave Chinner } while (0) 13384be0ffcSDave Chinner 134df3954ffSDarrick J. Wong #define XFS_BTREE_MAXLEVELS 9 /* max of all btrees */ 13584be0ffcSDave Chinner 13684be0ffcSDave Chinner struct xfs_btree_ops { 13784be0ffcSDave Chinner /* size of the key and record structures */ 13884be0ffcSDave Chinner size_t key_len; 13984be0ffcSDave Chinner size_t rec_len; 14084be0ffcSDave Chinner 14184be0ffcSDave Chinner /* cursor operations */ 14284be0ffcSDave Chinner struct xfs_btree_cur *(*dup_cursor)(struct xfs_btree_cur *); 14384be0ffcSDave Chinner void (*update_cursor)(struct xfs_btree_cur *src, 14484be0ffcSDave Chinner struct xfs_btree_cur *dst); 14584be0ffcSDave Chinner 14684be0ffcSDave Chinner /* update btree root pointer */ 14784be0ffcSDave Chinner void (*set_root)(struct xfs_btree_cur *cur, 14884be0ffcSDave Chinner union xfs_btree_ptr *nptr, int level_change); 14984be0ffcSDave Chinner 15084be0ffcSDave Chinner /* block allocation / freeing */ 15184be0ffcSDave Chinner int (*alloc_block)(struct xfs_btree_cur *cur, 15284be0ffcSDave Chinner union xfs_btree_ptr *start_bno, 15384be0ffcSDave Chinner union xfs_btree_ptr *new_bno, 15484be0ffcSDave Chinner int *stat); 15584be0ffcSDave Chinner int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp); 15684be0ffcSDave Chinner 15784be0ffcSDave Chinner /* update last record information */ 15884be0ffcSDave Chinner void (*update_lastrec)(struct xfs_btree_cur *cur, 15984be0ffcSDave Chinner struct xfs_btree_block *block, 16084be0ffcSDave Chinner union xfs_btree_rec *rec, 16184be0ffcSDave Chinner int ptr, int reason); 16284be0ffcSDave Chinner 16384be0ffcSDave Chinner /* records in block/level */ 16484be0ffcSDave Chinner int (*get_minrecs)(struct xfs_btree_cur *cur, int level); 16584be0ffcSDave Chinner int (*get_maxrecs)(struct xfs_btree_cur *cur, int level); 16684be0ffcSDave Chinner 16784be0ffcSDave Chinner /* records on disk. Matter for the root in inode case. */ 16884be0ffcSDave Chinner int (*get_dmaxrecs)(struct xfs_btree_cur *cur, int level); 16984be0ffcSDave Chinner 17084be0ffcSDave Chinner /* init values of btree structures */ 17184be0ffcSDave Chinner void (*init_key_from_rec)(union xfs_btree_key *key, 17284be0ffcSDave Chinner union xfs_btree_rec *rec); 17384be0ffcSDave Chinner void (*init_rec_from_cur)(struct xfs_btree_cur *cur, 17484be0ffcSDave Chinner union xfs_btree_rec *rec); 17584be0ffcSDave Chinner void (*init_ptr_from_cur)(struct xfs_btree_cur *cur, 17684be0ffcSDave Chinner union xfs_btree_ptr *ptr); 1772c813ad6SDarrick J. Wong void (*init_high_key_from_rec)(union xfs_btree_key *key, 1782c813ad6SDarrick J. Wong union xfs_btree_rec *rec); 17984be0ffcSDave Chinner 18084be0ffcSDave Chinner /* difference between key value and cursor value */ 18184be0ffcSDave Chinner __int64_t (*key_diff)(struct xfs_btree_cur *cur, 18284be0ffcSDave Chinner union xfs_btree_key *key); 18384be0ffcSDave Chinner 1842c813ad6SDarrick J. Wong /* 1852c813ad6SDarrick J. Wong * Difference between key2 and key1 -- positive if key1 > key2, 1862c813ad6SDarrick J. Wong * negative if key1 < key2, and zero if equal. 1872c813ad6SDarrick J. Wong */ 1882c813ad6SDarrick J. Wong __int64_t (*diff_two_keys)(struct xfs_btree_cur *cur, 1892c813ad6SDarrick J. Wong union xfs_btree_key *key1, 1902c813ad6SDarrick J. Wong union xfs_btree_key *key2); 1912c813ad6SDarrick J. Wong 19284be0ffcSDave Chinner const struct xfs_buf_ops *buf_ops; 19384be0ffcSDave Chinner 19484be0ffcSDave Chinner #if defined(DEBUG) || defined(XFS_WARN) 19584be0ffcSDave Chinner /* check that k1 is lower than k2 */ 19684be0ffcSDave Chinner int (*keys_inorder)(struct xfs_btree_cur *cur, 19784be0ffcSDave Chinner union xfs_btree_key *k1, 19884be0ffcSDave Chinner union xfs_btree_key *k2); 19984be0ffcSDave Chinner 20084be0ffcSDave Chinner /* check that r1 is lower than r2 */ 20184be0ffcSDave Chinner int (*recs_inorder)(struct xfs_btree_cur *cur, 20284be0ffcSDave Chinner union xfs_btree_rec *r1, 20384be0ffcSDave Chinner union xfs_btree_rec *r2); 20484be0ffcSDave Chinner #endif 20584be0ffcSDave Chinner }; 20684be0ffcSDave Chinner 20784be0ffcSDave Chinner /* 20884be0ffcSDave Chinner * Reasons for the update_lastrec method to be called. 20984be0ffcSDave Chinner */ 21084be0ffcSDave Chinner #define LASTREC_UPDATE 0 21184be0ffcSDave Chinner #define LASTREC_INSREC 1 21284be0ffcSDave Chinner #define LASTREC_DELREC 2 21384be0ffcSDave Chinner 21484be0ffcSDave Chinner 215105f7d83SDarrick J. Wong union xfs_btree_irec { 216105f7d83SDarrick J. Wong struct xfs_alloc_rec_incore a; 217105f7d83SDarrick J. Wong struct xfs_bmbt_irec b; 218105f7d83SDarrick J. Wong struct xfs_inobt_rec_incore i; 2194b8ed677SDarrick J. Wong struct xfs_rmap_irec r; 220105f7d83SDarrick J. Wong }; 221105f7d83SDarrick J. Wong 22284be0ffcSDave Chinner /* 22384be0ffcSDave Chinner * Btree cursor structure. 22484be0ffcSDave Chinner * This collects all information needed by the btree code in one place. 22584be0ffcSDave Chinner */ 22684be0ffcSDave Chinner typedef struct xfs_btree_cur 22784be0ffcSDave Chinner { 22884be0ffcSDave Chinner struct xfs_trans *bc_tp; /* transaction we're in, if any */ 22984be0ffcSDave Chinner struct xfs_mount *bc_mp; /* file system mount struct */ 23084be0ffcSDave Chinner const struct xfs_btree_ops *bc_ops; 23184be0ffcSDave Chinner uint bc_flags; /* btree features - below */ 232105f7d83SDarrick J. Wong union xfs_btree_irec bc_rec; /* current insert/search record value */ 23384be0ffcSDave Chinner struct xfs_buf *bc_bufs[XFS_BTREE_MAXLEVELS]; /* buf ptr per level */ 23484be0ffcSDave Chinner int bc_ptrs[XFS_BTREE_MAXLEVELS]; /* key/record # */ 23584be0ffcSDave Chinner __uint8_t bc_ra[XFS_BTREE_MAXLEVELS]; /* readahead bits */ 23684be0ffcSDave Chinner #define XFS_BTCUR_LEFTRA 1 /* left sibling has been read-ahead */ 23784be0ffcSDave Chinner #define XFS_BTCUR_RIGHTRA 2 /* right sibling has been read-ahead */ 23884be0ffcSDave Chinner __uint8_t bc_nlevels; /* number of levels in the tree */ 23984be0ffcSDave Chinner __uint8_t bc_blocklog; /* log2(blocksize) of btree blocks */ 24084be0ffcSDave Chinner xfs_btnum_t bc_btnum; /* identifies which btree type */ 24184be0ffcSDave Chinner union { 24284be0ffcSDave Chinner struct { /* needed for BNO, CNT, INO */ 24384be0ffcSDave Chinner struct xfs_buf *agbp; /* agf/agi buffer pointer */ 2442c3234d1SDarrick J. Wong struct xfs_defer_ops *dfops; /* deferred updates */ 24584be0ffcSDave Chinner xfs_agnumber_t agno; /* ag number */ 24684be0ffcSDave Chinner } a; 24784be0ffcSDave Chinner struct { /* needed for BMAP */ 24884be0ffcSDave Chinner struct xfs_inode *ip; /* pointer to our inode */ 2492c3234d1SDarrick J. Wong struct xfs_defer_ops *dfops; /* deferred updates */ 25084be0ffcSDave Chinner xfs_fsblock_t firstblock; /* 1st blk allocated */ 25184be0ffcSDave Chinner int allocated; /* count of alloced */ 25284be0ffcSDave Chinner short forksize; /* fork's inode space */ 25384be0ffcSDave Chinner char whichfork; /* data or attr fork */ 25484be0ffcSDave Chinner char flags; /* flags */ 25584be0ffcSDave Chinner #define XFS_BTCUR_BPRV_WASDEL 1 /* was delayed */ 25684be0ffcSDave Chinner } b; 25784be0ffcSDave Chinner } bc_private; /* per-btree type data */ 25884be0ffcSDave Chinner } xfs_btree_cur_t; 25984be0ffcSDave Chinner 26084be0ffcSDave Chinner /* cursor flags */ 26184be0ffcSDave Chinner #define XFS_BTREE_LONG_PTRS (1<<0) /* pointers are 64bits long */ 26284be0ffcSDave Chinner #define XFS_BTREE_ROOT_IN_INODE (1<<1) /* root may be variable size */ 26384be0ffcSDave Chinner #define XFS_BTREE_LASTREC_UPDATE (1<<2) /* track last rec externally */ 26484be0ffcSDave Chinner #define XFS_BTREE_CRC_BLOCKS (1<<3) /* uses extended btree blocks */ 2652c813ad6SDarrick J. Wong #define XFS_BTREE_OVERLAPPING (1<<4) /* overlapping intervals */ 26684be0ffcSDave Chinner 26784be0ffcSDave Chinner 26884be0ffcSDave Chinner #define XFS_BTREE_NOERROR 0 26984be0ffcSDave Chinner #define XFS_BTREE_ERROR 1 27084be0ffcSDave Chinner 27184be0ffcSDave Chinner /* 27284be0ffcSDave Chinner * Convert from buffer to btree block header. 27384be0ffcSDave Chinner */ 27484be0ffcSDave Chinner #define XFS_BUF_TO_BLOCK(bp) ((struct xfs_btree_block *)((bp)->b_addr)) 27584be0ffcSDave Chinner 27684be0ffcSDave Chinner 27784be0ffcSDave Chinner /* 27884be0ffcSDave Chinner * Check that block header is ok. 27984be0ffcSDave Chinner */ 28084be0ffcSDave Chinner int 28184be0ffcSDave Chinner xfs_btree_check_block( 28284be0ffcSDave Chinner struct xfs_btree_cur *cur, /* btree cursor */ 28384be0ffcSDave Chinner struct xfs_btree_block *block, /* generic btree block pointer */ 28484be0ffcSDave Chinner int level, /* level of the btree block */ 28584be0ffcSDave Chinner struct xfs_buf *bp); /* buffer containing block, if any */ 28684be0ffcSDave Chinner 28784be0ffcSDave Chinner /* 28884be0ffcSDave Chinner * Check that (long) pointer is ok. 28984be0ffcSDave Chinner */ 29084be0ffcSDave Chinner int /* error (0 or EFSCORRUPTED) */ 29184be0ffcSDave Chinner xfs_btree_check_lptr( 29284be0ffcSDave Chinner struct xfs_btree_cur *cur, /* btree cursor */ 293d5cf09baSChristoph Hellwig xfs_fsblock_t ptr, /* btree block disk address */ 29484be0ffcSDave Chinner int level); /* btree block level */ 29584be0ffcSDave Chinner 29684be0ffcSDave Chinner /* 29784be0ffcSDave Chinner * Delete the btree cursor. 29884be0ffcSDave Chinner */ 29984be0ffcSDave Chinner void 30084be0ffcSDave Chinner xfs_btree_del_cursor( 30184be0ffcSDave Chinner xfs_btree_cur_t *cur, /* btree cursor */ 30284be0ffcSDave Chinner int error); /* del because of error */ 30384be0ffcSDave Chinner 30484be0ffcSDave Chinner /* 30584be0ffcSDave Chinner * Duplicate the btree cursor. 30684be0ffcSDave Chinner * Allocate a new one, copy the record, re-get the buffers. 30784be0ffcSDave Chinner */ 30884be0ffcSDave Chinner int /* error */ 30984be0ffcSDave Chinner xfs_btree_dup_cursor( 31084be0ffcSDave Chinner xfs_btree_cur_t *cur, /* input cursor */ 31184be0ffcSDave Chinner xfs_btree_cur_t **ncur);/* output cursor */ 31284be0ffcSDave Chinner 31384be0ffcSDave Chinner /* 31484be0ffcSDave Chinner * Get a buffer for the block, return it with no data read. 31584be0ffcSDave Chinner * Long-form addressing. 31684be0ffcSDave Chinner */ 31784be0ffcSDave Chinner struct xfs_buf * /* buffer for fsbno */ 31884be0ffcSDave Chinner xfs_btree_get_bufl( 31984be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 32084be0ffcSDave Chinner struct xfs_trans *tp, /* transaction pointer */ 32184be0ffcSDave Chinner xfs_fsblock_t fsbno, /* file system block number */ 32284be0ffcSDave Chinner uint lock); /* lock flags for get_buf */ 32384be0ffcSDave Chinner 32484be0ffcSDave Chinner /* 32584be0ffcSDave Chinner * Get a buffer for the block, return it with no data read. 32684be0ffcSDave Chinner * Short-form addressing. 32784be0ffcSDave Chinner */ 32884be0ffcSDave Chinner struct xfs_buf * /* buffer for agno/agbno */ 32984be0ffcSDave Chinner xfs_btree_get_bufs( 33084be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 33184be0ffcSDave Chinner struct xfs_trans *tp, /* transaction pointer */ 33284be0ffcSDave Chinner xfs_agnumber_t agno, /* allocation group number */ 33384be0ffcSDave Chinner xfs_agblock_t agbno, /* allocation group block number */ 33484be0ffcSDave Chinner uint lock); /* lock flags for get_buf */ 33584be0ffcSDave Chinner 33684be0ffcSDave Chinner /* 33784be0ffcSDave Chinner * Check for the cursor referring to the last block at the given level. 33884be0ffcSDave Chinner */ 33984be0ffcSDave Chinner int /* 1=is last block, 0=not last block */ 34084be0ffcSDave Chinner xfs_btree_islastblock( 34184be0ffcSDave Chinner xfs_btree_cur_t *cur, /* btree cursor */ 34284be0ffcSDave Chinner int level); /* level to check */ 34384be0ffcSDave Chinner 34484be0ffcSDave Chinner /* 34584be0ffcSDave Chinner * Compute first and last byte offsets for the fields given. 34684be0ffcSDave Chinner * Interprets the offsets table, which contains struct field offsets. 34784be0ffcSDave Chinner */ 34884be0ffcSDave Chinner void 34984be0ffcSDave Chinner xfs_btree_offsets( 35084be0ffcSDave Chinner __int64_t fields, /* bitmask of fields */ 35184be0ffcSDave Chinner const short *offsets,/* table of field offsets */ 35284be0ffcSDave Chinner int nbits, /* number of bits to inspect */ 35384be0ffcSDave Chinner int *first, /* output: first byte offset */ 35484be0ffcSDave Chinner int *last); /* output: last byte offset */ 35584be0ffcSDave Chinner 35684be0ffcSDave Chinner /* 35784be0ffcSDave Chinner * Get a buffer for the block, return it read in. 35884be0ffcSDave Chinner * Long-form addressing. 35984be0ffcSDave Chinner */ 36084be0ffcSDave Chinner int /* error */ 36184be0ffcSDave Chinner xfs_btree_read_bufl( 36284be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 36384be0ffcSDave Chinner struct xfs_trans *tp, /* transaction pointer */ 36484be0ffcSDave Chinner xfs_fsblock_t fsbno, /* file system block number */ 36584be0ffcSDave Chinner uint lock, /* lock flags for read_buf */ 36684be0ffcSDave Chinner struct xfs_buf **bpp, /* buffer for fsbno */ 36784be0ffcSDave Chinner int refval, /* ref count value for buffer */ 36884be0ffcSDave Chinner const struct xfs_buf_ops *ops); 36984be0ffcSDave Chinner 37084be0ffcSDave Chinner /* 37184be0ffcSDave Chinner * Read-ahead the block, don't wait for it, don't return a buffer. 37284be0ffcSDave Chinner * Long-form addressing. 37384be0ffcSDave Chinner */ 37484be0ffcSDave Chinner void /* error */ 37584be0ffcSDave Chinner xfs_btree_reada_bufl( 37684be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 37784be0ffcSDave Chinner xfs_fsblock_t fsbno, /* file system block number */ 37884be0ffcSDave Chinner xfs_extlen_t count, /* count of filesystem blocks */ 37984be0ffcSDave Chinner const struct xfs_buf_ops *ops); 38084be0ffcSDave Chinner 38184be0ffcSDave Chinner /* 38284be0ffcSDave Chinner * Read-ahead the block, don't wait for it, don't return a buffer. 38384be0ffcSDave Chinner * Short-form addressing. 38484be0ffcSDave Chinner */ 38584be0ffcSDave Chinner void /* error */ 38684be0ffcSDave Chinner xfs_btree_reada_bufs( 38784be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 38884be0ffcSDave Chinner xfs_agnumber_t agno, /* allocation group number */ 38984be0ffcSDave Chinner xfs_agblock_t agbno, /* allocation group block number */ 39084be0ffcSDave Chinner xfs_extlen_t count, /* count of filesystem blocks */ 39184be0ffcSDave Chinner const struct xfs_buf_ops *ops); 39284be0ffcSDave Chinner 39384be0ffcSDave Chinner /* 39484be0ffcSDave Chinner * Initialise a new btree block header 39584be0ffcSDave Chinner */ 39684be0ffcSDave Chinner void 39784be0ffcSDave Chinner xfs_btree_init_block( 39884be0ffcSDave Chinner struct xfs_mount *mp, 39984be0ffcSDave Chinner struct xfs_buf *bp, 40084be0ffcSDave Chinner __u32 magic, 40184be0ffcSDave Chinner __u16 level, 40284be0ffcSDave Chinner __u16 numrecs, 40384be0ffcSDave Chinner __u64 owner, 40484be0ffcSDave Chinner unsigned int flags); 40584be0ffcSDave Chinner 40684be0ffcSDave Chinner void 40784be0ffcSDave Chinner xfs_btree_init_block_int( 40884be0ffcSDave Chinner struct xfs_mount *mp, 40984be0ffcSDave Chinner struct xfs_btree_block *buf, 41084be0ffcSDave Chinner xfs_daddr_t blkno, 41184be0ffcSDave Chinner __u32 magic, 41284be0ffcSDave Chinner __u16 level, 41384be0ffcSDave Chinner __u16 numrecs, 41484be0ffcSDave Chinner __u64 owner, 41584be0ffcSDave Chinner unsigned int flags); 41684be0ffcSDave Chinner 41784be0ffcSDave Chinner /* 41884be0ffcSDave Chinner * Common btree core entry points. 41984be0ffcSDave Chinner */ 42084be0ffcSDave Chinner int xfs_btree_increment(struct xfs_btree_cur *, int, int *); 42184be0ffcSDave Chinner int xfs_btree_decrement(struct xfs_btree_cur *, int, int *); 42284be0ffcSDave Chinner int xfs_btree_lookup(struct xfs_btree_cur *, xfs_lookup_t, int *); 42384be0ffcSDave Chinner int xfs_btree_update(struct xfs_btree_cur *, union xfs_btree_rec *); 42484be0ffcSDave Chinner int xfs_btree_new_iroot(struct xfs_btree_cur *, int *, int *); 42584be0ffcSDave Chinner int xfs_btree_insert(struct xfs_btree_cur *, int *); 42684be0ffcSDave Chinner int xfs_btree_delete(struct xfs_btree_cur *, int *); 42784be0ffcSDave Chinner int xfs_btree_get_rec(struct xfs_btree_cur *, union xfs_btree_rec **, int *); 42884be0ffcSDave Chinner int xfs_btree_change_owner(struct xfs_btree_cur *cur, __uint64_t new_owner, 42984be0ffcSDave Chinner struct list_head *buffer_list); 43084be0ffcSDave Chinner 43184be0ffcSDave Chinner /* 43284be0ffcSDave Chinner * btree block CRC helpers 43384be0ffcSDave Chinner */ 43484be0ffcSDave Chinner void xfs_btree_lblock_calc_crc(struct xfs_buf *); 43584be0ffcSDave Chinner bool xfs_btree_lblock_verify_crc(struct xfs_buf *); 43684be0ffcSDave Chinner void xfs_btree_sblock_calc_crc(struct xfs_buf *); 43784be0ffcSDave Chinner bool xfs_btree_sblock_verify_crc(struct xfs_buf *); 43884be0ffcSDave Chinner 43984be0ffcSDave Chinner /* 44084be0ffcSDave Chinner * Internal btree helpers also used by xfs_bmap.c. 44184be0ffcSDave Chinner */ 44284be0ffcSDave Chinner void xfs_btree_log_block(struct xfs_btree_cur *, struct xfs_buf *, int); 44384be0ffcSDave Chinner void xfs_btree_log_recs(struct xfs_btree_cur *, struct xfs_buf *, int, int); 44484be0ffcSDave Chinner 44584be0ffcSDave Chinner /* 44684be0ffcSDave Chinner * Helpers. 44784be0ffcSDave Chinner */ 44884be0ffcSDave Chinner static inline int xfs_btree_get_numrecs(struct xfs_btree_block *block) 44984be0ffcSDave Chinner { 45084be0ffcSDave Chinner return be16_to_cpu(block->bb_numrecs); 45184be0ffcSDave Chinner } 45284be0ffcSDave Chinner 45384be0ffcSDave Chinner static inline void xfs_btree_set_numrecs(struct xfs_btree_block *block, 45484be0ffcSDave Chinner __uint16_t numrecs) 45584be0ffcSDave Chinner { 45684be0ffcSDave Chinner block->bb_numrecs = cpu_to_be16(numrecs); 45784be0ffcSDave Chinner } 45884be0ffcSDave Chinner 45984be0ffcSDave Chinner static inline int xfs_btree_get_level(struct xfs_btree_block *block) 46084be0ffcSDave Chinner { 46184be0ffcSDave Chinner return be16_to_cpu(block->bb_level); 46284be0ffcSDave Chinner } 46384be0ffcSDave Chinner 46484be0ffcSDave Chinner 46584be0ffcSDave Chinner /* 46684be0ffcSDave Chinner * Min and max functions for extlen, agblock, fileoff, and filblks types. 46784be0ffcSDave Chinner */ 46884be0ffcSDave Chinner #define XFS_EXTLEN_MIN(a,b) min_t(xfs_extlen_t, (a), (b)) 46984be0ffcSDave Chinner #define XFS_EXTLEN_MAX(a,b) max_t(xfs_extlen_t, (a), (b)) 47084be0ffcSDave Chinner #define XFS_AGBLOCK_MIN(a,b) min_t(xfs_agblock_t, (a), (b)) 47184be0ffcSDave Chinner #define XFS_AGBLOCK_MAX(a,b) max_t(xfs_agblock_t, (a), (b)) 47284be0ffcSDave Chinner #define XFS_FILEOFF_MIN(a,b) min_t(xfs_fileoff_t, (a), (b)) 47384be0ffcSDave Chinner #define XFS_FILEOFF_MAX(a,b) max_t(xfs_fileoff_t, (a), (b)) 47484be0ffcSDave Chinner #define XFS_FILBLKS_MIN(a,b) min_t(xfs_filblks_t, (a), (b)) 47584be0ffcSDave Chinner #define XFS_FILBLKS_MAX(a,b) max_t(xfs_filblks_t, (a), (b)) 47684be0ffcSDave Chinner 47784be0ffcSDave Chinner #define XFS_FSB_SANITY_CHECK(mp,fsb) \ 47884be0ffcSDave Chinner (XFS_FSB_TO_AGNO(mp, fsb) < mp->m_sb.sb_agcount && \ 47984be0ffcSDave Chinner XFS_FSB_TO_AGBNO(mp, fsb) < mp->m_sb.sb_agblocks) 48084be0ffcSDave Chinner 48184be0ffcSDave Chinner /* 48284be0ffcSDave Chinner * Trace hooks. Currently not implemented as they need to be ported 48384be0ffcSDave Chinner * over to the generic tracing functionality, which is some effort. 48484be0ffcSDave Chinner * 48584be0ffcSDave Chinner * i,j = integer (32 bit) 48684be0ffcSDave Chinner * b = btree block buffer (xfs_buf_t) 48784be0ffcSDave Chinner * p = btree ptr 48884be0ffcSDave Chinner * r = btree record 48984be0ffcSDave Chinner * k = btree key 49084be0ffcSDave Chinner */ 49184be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGBI(c, b, i) 49284be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGBII(c, b, i, j) 49384be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGI(c, i) 49484be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGIPK(c, i, p, s) 49584be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGIPR(c, i, p, r) 49684be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGIK(c, i, k) 49784be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGR(c, r) 49884be0ffcSDave Chinner #define XFS_BTREE_TRACE_CURSOR(c, t) 49984be0ffcSDave Chinner 500c5ab131bSDarrick J. Wong bool xfs_btree_sblock_v5hdr_verify(struct xfs_buf *bp); 501c5ab131bSDarrick J. Wong bool xfs_btree_sblock_verify(struct xfs_buf *bp, unsigned int max_recs); 50219b54ee6SDarrick J. Wong uint xfs_btree_compute_maxlevels(struct xfs_mount *mp, uint *limits, 50319b54ee6SDarrick J. Wong unsigned long len); 5044ed3f687SDarrick J. Wong xfs_extlen_t xfs_btree_calc_size(struct xfs_mount *mp, uint *limits, 5054ed3f687SDarrick J. Wong unsigned long long len); 506c5ab131bSDarrick J. Wong 507105f7d83SDarrick J. Wong /* return codes */ 508105f7d83SDarrick J. Wong #define XFS_BTREE_QUERY_RANGE_CONTINUE 0 /* keep iterating */ 509105f7d83SDarrick J. Wong #define XFS_BTREE_QUERY_RANGE_ABORT 1 /* stop iterating */ 510105f7d83SDarrick J. Wong typedef int (*xfs_btree_query_range_fn)(struct xfs_btree_cur *cur, 511105f7d83SDarrick J. Wong union xfs_btree_rec *rec, void *priv); 512105f7d83SDarrick J. Wong 513105f7d83SDarrick J. Wong int xfs_btree_query_range(struct xfs_btree_cur *cur, 514105f7d83SDarrick J. Wong union xfs_btree_irec *low_rec, union xfs_btree_irec *high_rec, 515105f7d83SDarrick J. Wong xfs_btree_query_range_fn fn, void *priv); 516105f7d83SDarrick J. Wong 51728a89567SDarrick J. Wong typedef int (*xfs_btree_visit_blocks_fn)(struct xfs_btree_cur *cur, int level, 51828a89567SDarrick J. Wong void *data); 51928a89567SDarrick J. Wong int xfs_btree_visit_blocks(struct xfs_btree_cur *cur, 52028a89567SDarrick J. Wong xfs_btree_visit_blocks_fn fn, void *data); 52128a89567SDarrick J. Wong 522c611cc03SDarrick J. Wong int xfs_btree_count_blocks(struct xfs_btree_cur *cur, xfs_extlen_t *blocks); 523c611cc03SDarrick J. Wong 52484be0ffcSDave Chinner #endif /* __XFS_BTREE_H__ */ 525