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; 2284be0ffcSDave Chinner struct xfs_bmap_free; 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 4084be0ffcSDave Chinner union xfs_btree_key { 4184be0ffcSDave Chinner xfs_bmbt_key_t bmbt; 4284be0ffcSDave Chinner xfs_bmdr_key_t bmbr; /* bmbt root block */ 4384be0ffcSDave Chinner xfs_alloc_key_t alloc; 4484be0ffcSDave Chinner xfs_inobt_key_t inobt; 4584be0ffcSDave Chinner }; 4684be0ffcSDave Chinner 4784be0ffcSDave Chinner union xfs_btree_rec { 4884be0ffcSDave Chinner xfs_bmbt_rec_t bmbt; 4984be0ffcSDave Chinner xfs_bmdr_rec_t bmbr; /* bmbt root block */ 5084be0ffcSDave Chinner xfs_alloc_rec_t alloc; 5184be0ffcSDave Chinner xfs_inobt_rec_t inobt; 5284be0ffcSDave Chinner }; 5384be0ffcSDave Chinner 5484be0ffcSDave Chinner /* 5584be0ffcSDave Chinner * This nonsense is to make -wlint happy. 5684be0ffcSDave Chinner */ 5784be0ffcSDave Chinner #define XFS_LOOKUP_EQ ((xfs_lookup_t)XFS_LOOKUP_EQi) 5884be0ffcSDave Chinner #define XFS_LOOKUP_LE ((xfs_lookup_t)XFS_LOOKUP_LEi) 5984be0ffcSDave Chinner #define XFS_LOOKUP_GE ((xfs_lookup_t)XFS_LOOKUP_GEi) 6084be0ffcSDave Chinner 6184be0ffcSDave Chinner #define XFS_BTNUM_BNO ((xfs_btnum_t)XFS_BTNUM_BNOi) 6284be0ffcSDave Chinner #define XFS_BTNUM_CNT ((xfs_btnum_t)XFS_BTNUM_CNTi) 6384be0ffcSDave Chinner #define XFS_BTNUM_BMAP ((xfs_btnum_t)XFS_BTNUM_BMAPi) 6484be0ffcSDave Chinner #define XFS_BTNUM_INO ((xfs_btnum_t)XFS_BTNUM_INOi) 6584be0ffcSDave Chinner #define XFS_BTNUM_FINO ((xfs_btnum_t)XFS_BTNUM_FINOi) 6684be0ffcSDave Chinner 6784be0ffcSDave Chinner /* 6884be0ffcSDave Chinner * For logging record fields. 6984be0ffcSDave Chinner */ 7084be0ffcSDave Chinner #define XFS_BB_MAGIC (1 << 0) 7184be0ffcSDave Chinner #define XFS_BB_LEVEL (1 << 1) 7284be0ffcSDave Chinner #define XFS_BB_NUMRECS (1 << 2) 7384be0ffcSDave Chinner #define XFS_BB_LEFTSIB (1 << 3) 7484be0ffcSDave Chinner #define XFS_BB_RIGHTSIB (1 << 4) 7584be0ffcSDave Chinner #define XFS_BB_BLKNO (1 << 5) 7684be0ffcSDave Chinner #define XFS_BB_LSN (1 << 6) 7784be0ffcSDave Chinner #define XFS_BB_UUID (1 << 7) 7884be0ffcSDave Chinner #define XFS_BB_OWNER (1 << 8) 7984be0ffcSDave Chinner #define XFS_BB_NUM_BITS 5 8084be0ffcSDave Chinner #define XFS_BB_ALL_BITS ((1 << XFS_BB_NUM_BITS) - 1) 8184be0ffcSDave Chinner #define XFS_BB_NUM_BITS_CRC 9 8284be0ffcSDave Chinner #define XFS_BB_ALL_BITS_CRC ((1 << XFS_BB_NUM_BITS_CRC) - 1) 8384be0ffcSDave Chinner 8484be0ffcSDave Chinner /* 8584be0ffcSDave Chinner * Generic stats interface 8684be0ffcSDave Chinner */ 87ff6d6af2SBill O'Donnell #define __XFS_BTREE_STATS_INC(mp, type, stat) \ 88ff6d6af2SBill O'Donnell XFS_STATS_INC(mp, xs_ ## type ## _2_ ## stat) 8984be0ffcSDave Chinner #define XFS_BTREE_STATS_INC(cur, stat) \ 9084be0ffcSDave Chinner do { \ 91ff6d6af2SBill O'Donnell struct xfs_mount *__mp = cur->bc_mp; \ 9284be0ffcSDave Chinner switch (cur->bc_btnum) { \ 93ff6d6af2SBill O'Donnell case XFS_BTNUM_BNO: __XFS_BTREE_STATS_INC(__mp, abtb, stat); break; \ 94ff6d6af2SBill O'Donnell case XFS_BTNUM_CNT: __XFS_BTREE_STATS_INC(__mp, abtc, stat); break; \ 95ff6d6af2SBill O'Donnell case XFS_BTNUM_BMAP: __XFS_BTREE_STATS_INC(__mp, bmbt, stat); break; \ 96ff6d6af2SBill O'Donnell case XFS_BTNUM_INO: __XFS_BTREE_STATS_INC(__mp, ibt, stat); break; \ 97ff6d6af2SBill O'Donnell case XFS_BTNUM_FINO: __XFS_BTREE_STATS_INC(__mp, fibt, stat); break; \ 9884be0ffcSDave Chinner case XFS_BTNUM_MAX: ASSERT(0); /* fucking gcc */ ; break; \ 9984be0ffcSDave Chinner } \ 10084be0ffcSDave Chinner } while (0) 10184be0ffcSDave Chinner 102ff6d6af2SBill O'Donnell #define __XFS_BTREE_STATS_ADD(mp, type, stat, val) \ 103ff6d6af2SBill O'Donnell XFS_STATS_ADD(mp, xs_ ## type ## _2_ ## stat, val) 10484be0ffcSDave Chinner #define XFS_BTREE_STATS_ADD(cur, stat, val) \ 10584be0ffcSDave Chinner do { \ 106ff6d6af2SBill O'Donnell struct xfs_mount *__mp = cur->bc_mp; \ 10784be0ffcSDave Chinner switch (cur->bc_btnum) { \ 108ff6d6af2SBill O'Donnell case XFS_BTNUM_BNO: \ 109ff6d6af2SBill O'Donnell __XFS_BTREE_STATS_ADD(__mp, abtb, stat, val); break; \ 110ff6d6af2SBill O'Donnell case XFS_BTNUM_CNT: \ 111ff6d6af2SBill O'Donnell __XFS_BTREE_STATS_ADD(__mp, abtc, stat, val); break; \ 112ff6d6af2SBill O'Donnell case XFS_BTNUM_BMAP: \ 113ff6d6af2SBill O'Donnell __XFS_BTREE_STATS_ADD(__mp, bmbt, stat, val); break; \ 114ff6d6af2SBill O'Donnell case XFS_BTNUM_INO: \ 115ff6d6af2SBill O'Donnell __XFS_BTREE_STATS_ADD(__mp, ibt, stat, val); break; \ 116ff6d6af2SBill O'Donnell case XFS_BTNUM_FINO: \ 117ff6d6af2SBill O'Donnell __XFS_BTREE_STATS_ADD(__mp, fibt, stat, val); break; \ 11884be0ffcSDave Chinner case XFS_BTNUM_MAX: ASSERT(0); /* fucking gcc */ ; break; \ 11984be0ffcSDave Chinner } \ 12084be0ffcSDave Chinner } while (0) 12184be0ffcSDave Chinner 12284be0ffcSDave Chinner #define XFS_BTREE_MAXLEVELS 8 /* max of all btrees */ 12384be0ffcSDave Chinner 12484be0ffcSDave Chinner struct xfs_btree_ops { 12584be0ffcSDave Chinner /* size of the key and record structures */ 12684be0ffcSDave Chinner size_t key_len; 12784be0ffcSDave Chinner size_t rec_len; 12884be0ffcSDave Chinner 12984be0ffcSDave Chinner /* cursor operations */ 13084be0ffcSDave Chinner struct xfs_btree_cur *(*dup_cursor)(struct xfs_btree_cur *); 13184be0ffcSDave Chinner void (*update_cursor)(struct xfs_btree_cur *src, 13284be0ffcSDave Chinner struct xfs_btree_cur *dst); 13384be0ffcSDave Chinner 13484be0ffcSDave Chinner /* update btree root pointer */ 13584be0ffcSDave Chinner void (*set_root)(struct xfs_btree_cur *cur, 13684be0ffcSDave Chinner union xfs_btree_ptr *nptr, int level_change); 13784be0ffcSDave Chinner 13884be0ffcSDave Chinner /* block allocation / freeing */ 13984be0ffcSDave Chinner int (*alloc_block)(struct xfs_btree_cur *cur, 14084be0ffcSDave Chinner union xfs_btree_ptr *start_bno, 14184be0ffcSDave Chinner union xfs_btree_ptr *new_bno, 14284be0ffcSDave Chinner int *stat); 14384be0ffcSDave Chinner int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp); 14484be0ffcSDave Chinner 14584be0ffcSDave Chinner /* update last record information */ 14684be0ffcSDave Chinner void (*update_lastrec)(struct xfs_btree_cur *cur, 14784be0ffcSDave Chinner struct xfs_btree_block *block, 14884be0ffcSDave Chinner union xfs_btree_rec *rec, 14984be0ffcSDave Chinner int ptr, int reason); 15084be0ffcSDave Chinner 15184be0ffcSDave Chinner /* records in block/level */ 15284be0ffcSDave Chinner int (*get_minrecs)(struct xfs_btree_cur *cur, int level); 15384be0ffcSDave Chinner int (*get_maxrecs)(struct xfs_btree_cur *cur, int level); 15484be0ffcSDave Chinner 15584be0ffcSDave Chinner /* records on disk. Matter for the root in inode case. */ 15684be0ffcSDave Chinner int (*get_dmaxrecs)(struct xfs_btree_cur *cur, int level); 15784be0ffcSDave Chinner 15884be0ffcSDave Chinner /* init values of btree structures */ 15984be0ffcSDave Chinner void (*init_key_from_rec)(union xfs_btree_key *key, 16084be0ffcSDave Chinner union xfs_btree_rec *rec); 16184be0ffcSDave Chinner void (*init_rec_from_key)(union xfs_btree_key *key, 16284be0ffcSDave Chinner union xfs_btree_rec *rec); 16384be0ffcSDave Chinner void (*init_rec_from_cur)(struct xfs_btree_cur *cur, 16484be0ffcSDave Chinner union xfs_btree_rec *rec); 16584be0ffcSDave Chinner void (*init_ptr_from_cur)(struct xfs_btree_cur *cur, 16684be0ffcSDave Chinner union xfs_btree_ptr *ptr); 16784be0ffcSDave Chinner 16884be0ffcSDave Chinner /* difference between key value and cursor value */ 16984be0ffcSDave Chinner __int64_t (*key_diff)(struct xfs_btree_cur *cur, 17084be0ffcSDave Chinner union xfs_btree_key *key); 17184be0ffcSDave Chinner 17284be0ffcSDave Chinner const struct xfs_buf_ops *buf_ops; 17384be0ffcSDave Chinner 17484be0ffcSDave Chinner #if defined(DEBUG) || defined(XFS_WARN) 17584be0ffcSDave Chinner /* check that k1 is lower than k2 */ 17684be0ffcSDave Chinner int (*keys_inorder)(struct xfs_btree_cur *cur, 17784be0ffcSDave Chinner union xfs_btree_key *k1, 17884be0ffcSDave Chinner 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, 18284be0ffcSDave Chinner union xfs_btree_rec *r1, 18384be0ffcSDave Chinner union xfs_btree_rec *r2); 18484be0ffcSDave Chinner #endif 18584be0ffcSDave Chinner }; 18684be0ffcSDave Chinner 18784be0ffcSDave Chinner /* 18884be0ffcSDave Chinner * Reasons for the update_lastrec method to be called. 18984be0ffcSDave Chinner */ 19084be0ffcSDave Chinner #define LASTREC_UPDATE 0 19184be0ffcSDave Chinner #define LASTREC_INSREC 1 19284be0ffcSDave Chinner #define LASTREC_DELREC 2 19384be0ffcSDave Chinner 19484be0ffcSDave Chinner 19584be0ffcSDave Chinner /* 19684be0ffcSDave Chinner * Btree cursor structure. 19784be0ffcSDave Chinner * This collects all information needed by the btree code in one place. 19884be0ffcSDave Chinner */ 19984be0ffcSDave Chinner typedef struct xfs_btree_cur 20084be0ffcSDave Chinner { 20184be0ffcSDave Chinner struct xfs_trans *bc_tp; /* transaction we're in, if any */ 20284be0ffcSDave Chinner struct xfs_mount *bc_mp; /* file system mount struct */ 20384be0ffcSDave Chinner const struct xfs_btree_ops *bc_ops; 20484be0ffcSDave Chinner uint bc_flags; /* btree features - below */ 20584be0ffcSDave Chinner union { 20684be0ffcSDave Chinner xfs_alloc_rec_incore_t a; 20784be0ffcSDave Chinner xfs_bmbt_irec_t b; 20884be0ffcSDave Chinner xfs_inobt_rec_incore_t i; 20984be0ffcSDave Chinner } bc_rec; /* current insert/search record value */ 21084be0ffcSDave Chinner struct xfs_buf *bc_bufs[XFS_BTREE_MAXLEVELS]; /* buf ptr per level */ 21184be0ffcSDave Chinner int bc_ptrs[XFS_BTREE_MAXLEVELS]; /* key/record # */ 21284be0ffcSDave Chinner __uint8_t bc_ra[XFS_BTREE_MAXLEVELS]; /* readahead bits */ 21384be0ffcSDave Chinner #define XFS_BTCUR_LEFTRA 1 /* left sibling has been read-ahead */ 21484be0ffcSDave Chinner #define XFS_BTCUR_RIGHTRA 2 /* right sibling has been read-ahead */ 21584be0ffcSDave Chinner __uint8_t bc_nlevels; /* number of levels in the tree */ 21684be0ffcSDave Chinner __uint8_t bc_blocklog; /* log2(blocksize) of btree blocks */ 21784be0ffcSDave Chinner xfs_btnum_t bc_btnum; /* identifies which btree type */ 21884be0ffcSDave Chinner union { 21984be0ffcSDave Chinner struct { /* needed for BNO, CNT, INO */ 22084be0ffcSDave Chinner struct xfs_buf *agbp; /* agf/agi buffer pointer */ 22184be0ffcSDave Chinner xfs_agnumber_t agno; /* ag number */ 22284be0ffcSDave Chinner } a; 22384be0ffcSDave Chinner struct { /* needed for BMAP */ 22484be0ffcSDave Chinner struct xfs_inode *ip; /* pointer to our inode */ 22584be0ffcSDave Chinner struct xfs_bmap_free *flist; /* list to free after */ 22684be0ffcSDave Chinner xfs_fsblock_t firstblock; /* 1st blk allocated */ 22784be0ffcSDave Chinner int allocated; /* count of alloced */ 22884be0ffcSDave Chinner short forksize; /* fork's inode space */ 22984be0ffcSDave Chinner char whichfork; /* data or attr fork */ 23084be0ffcSDave Chinner char flags; /* flags */ 23184be0ffcSDave Chinner #define XFS_BTCUR_BPRV_WASDEL 1 /* was delayed */ 23284be0ffcSDave Chinner } b; 23384be0ffcSDave Chinner } bc_private; /* per-btree type data */ 23484be0ffcSDave Chinner } xfs_btree_cur_t; 23584be0ffcSDave Chinner 23684be0ffcSDave Chinner /* cursor flags */ 23784be0ffcSDave Chinner #define XFS_BTREE_LONG_PTRS (1<<0) /* pointers are 64bits long */ 23884be0ffcSDave Chinner #define XFS_BTREE_ROOT_IN_INODE (1<<1) /* root may be variable size */ 23984be0ffcSDave Chinner #define XFS_BTREE_LASTREC_UPDATE (1<<2) /* track last rec externally */ 24084be0ffcSDave Chinner #define XFS_BTREE_CRC_BLOCKS (1<<3) /* uses extended btree blocks */ 24184be0ffcSDave Chinner 24284be0ffcSDave Chinner 24384be0ffcSDave Chinner #define XFS_BTREE_NOERROR 0 24484be0ffcSDave Chinner #define XFS_BTREE_ERROR 1 24584be0ffcSDave Chinner 24684be0ffcSDave Chinner /* 24784be0ffcSDave Chinner * Convert from buffer to btree block header. 24884be0ffcSDave Chinner */ 24984be0ffcSDave Chinner #define XFS_BUF_TO_BLOCK(bp) ((struct xfs_btree_block *)((bp)->b_addr)) 25084be0ffcSDave Chinner 25184be0ffcSDave Chinner 25284be0ffcSDave Chinner /* 25384be0ffcSDave Chinner * Check that block header is ok. 25484be0ffcSDave Chinner */ 25584be0ffcSDave Chinner int 25684be0ffcSDave Chinner xfs_btree_check_block( 25784be0ffcSDave Chinner struct xfs_btree_cur *cur, /* btree cursor */ 25884be0ffcSDave Chinner struct xfs_btree_block *block, /* generic btree block pointer */ 25984be0ffcSDave Chinner int level, /* level of the btree block */ 26084be0ffcSDave Chinner struct xfs_buf *bp); /* buffer containing block, if any */ 26184be0ffcSDave Chinner 26284be0ffcSDave Chinner /* 26384be0ffcSDave Chinner * Check that (long) pointer is ok. 26484be0ffcSDave Chinner */ 26584be0ffcSDave Chinner int /* error (0 or EFSCORRUPTED) */ 26684be0ffcSDave Chinner xfs_btree_check_lptr( 26784be0ffcSDave Chinner struct xfs_btree_cur *cur, /* btree cursor */ 268d5cf09baSChristoph Hellwig xfs_fsblock_t ptr, /* btree block disk address */ 26984be0ffcSDave Chinner int level); /* btree block level */ 27084be0ffcSDave Chinner 27184be0ffcSDave Chinner /* 27284be0ffcSDave Chinner * Delete the btree cursor. 27384be0ffcSDave Chinner */ 27484be0ffcSDave Chinner void 27584be0ffcSDave Chinner xfs_btree_del_cursor( 27684be0ffcSDave Chinner xfs_btree_cur_t *cur, /* btree cursor */ 27784be0ffcSDave Chinner int error); /* del because of error */ 27884be0ffcSDave Chinner 27984be0ffcSDave Chinner /* 28084be0ffcSDave Chinner * Duplicate the btree cursor. 28184be0ffcSDave Chinner * Allocate a new one, copy the record, re-get the buffers. 28284be0ffcSDave Chinner */ 28384be0ffcSDave Chinner int /* error */ 28484be0ffcSDave Chinner xfs_btree_dup_cursor( 28584be0ffcSDave Chinner xfs_btree_cur_t *cur, /* input cursor */ 28684be0ffcSDave Chinner xfs_btree_cur_t **ncur);/* output cursor */ 28784be0ffcSDave Chinner 28884be0ffcSDave Chinner /* 28984be0ffcSDave Chinner * Get a buffer for the block, return it with no data read. 29084be0ffcSDave Chinner * Long-form addressing. 29184be0ffcSDave Chinner */ 29284be0ffcSDave Chinner struct xfs_buf * /* buffer for fsbno */ 29384be0ffcSDave Chinner xfs_btree_get_bufl( 29484be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 29584be0ffcSDave Chinner struct xfs_trans *tp, /* transaction pointer */ 29684be0ffcSDave Chinner xfs_fsblock_t fsbno, /* file system block number */ 29784be0ffcSDave Chinner uint lock); /* lock flags for get_buf */ 29884be0ffcSDave Chinner 29984be0ffcSDave Chinner /* 30084be0ffcSDave Chinner * Get a buffer for the block, return it with no data read. 30184be0ffcSDave Chinner * Short-form addressing. 30284be0ffcSDave Chinner */ 30384be0ffcSDave Chinner struct xfs_buf * /* buffer for agno/agbno */ 30484be0ffcSDave Chinner xfs_btree_get_bufs( 30584be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 30684be0ffcSDave Chinner struct xfs_trans *tp, /* transaction pointer */ 30784be0ffcSDave Chinner xfs_agnumber_t agno, /* allocation group number */ 30884be0ffcSDave Chinner xfs_agblock_t agbno, /* allocation group block number */ 30984be0ffcSDave Chinner uint lock); /* lock flags for get_buf */ 31084be0ffcSDave Chinner 31184be0ffcSDave Chinner /* 31284be0ffcSDave Chinner * Check for the cursor referring to the last block at the given level. 31384be0ffcSDave Chinner */ 31484be0ffcSDave Chinner int /* 1=is last block, 0=not last block */ 31584be0ffcSDave Chinner xfs_btree_islastblock( 31684be0ffcSDave Chinner xfs_btree_cur_t *cur, /* btree cursor */ 31784be0ffcSDave Chinner int level); /* level to check */ 31884be0ffcSDave Chinner 31984be0ffcSDave Chinner /* 32084be0ffcSDave Chinner * Compute first and last byte offsets for the fields given. 32184be0ffcSDave Chinner * Interprets the offsets table, which contains struct field offsets. 32284be0ffcSDave Chinner */ 32384be0ffcSDave Chinner void 32484be0ffcSDave Chinner xfs_btree_offsets( 32584be0ffcSDave Chinner __int64_t fields, /* bitmask of fields */ 32684be0ffcSDave Chinner const short *offsets,/* table of field offsets */ 32784be0ffcSDave Chinner int nbits, /* number of bits to inspect */ 32884be0ffcSDave Chinner int *first, /* output: first byte offset */ 32984be0ffcSDave Chinner int *last); /* output: last byte offset */ 33084be0ffcSDave Chinner 33184be0ffcSDave Chinner /* 33284be0ffcSDave Chinner * Get a buffer for the block, return it read in. 33384be0ffcSDave Chinner * Long-form addressing. 33484be0ffcSDave Chinner */ 33584be0ffcSDave Chinner int /* error */ 33684be0ffcSDave Chinner xfs_btree_read_bufl( 33784be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 33884be0ffcSDave Chinner struct xfs_trans *tp, /* transaction pointer */ 33984be0ffcSDave Chinner xfs_fsblock_t fsbno, /* file system block number */ 34084be0ffcSDave Chinner uint lock, /* lock flags for read_buf */ 34184be0ffcSDave Chinner struct xfs_buf **bpp, /* buffer for fsbno */ 34284be0ffcSDave Chinner int refval, /* ref count value for buffer */ 34384be0ffcSDave Chinner const struct xfs_buf_ops *ops); 34484be0ffcSDave Chinner 34584be0ffcSDave Chinner /* 34684be0ffcSDave Chinner * Read-ahead the block, don't wait for it, don't return a buffer. 34784be0ffcSDave Chinner * Long-form addressing. 34884be0ffcSDave Chinner */ 34984be0ffcSDave Chinner void /* error */ 35084be0ffcSDave Chinner xfs_btree_reada_bufl( 35184be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 35284be0ffcSDave Chinner xfs_fsblock_t fsbno, /* file system block number */ 35384be0ffcSDave Chinner xfs_extlen_t count, /* count of filesystem blocks */ 35484be0ffcSDave Chinner const struct xfs_buf_ops *ops); 35584be0ffcSDave Chinner 35684be0ffcSDave Chinner /* 35784be0ffcSDave Chinner * Read-ahead the block, don't wait for it, don't return a buffer. 35884be0ffcSDave Chinner * Short-form addressing. 35984be0ffcSDave Chinner */ 36084be0ffcSDave Chinner void /* error */ 36184be0ffcSDave Chinner xfs_btree_reada_bufs( 36284be0ffcSDave Chinner struct xfs_mount *mp, /* file system mount point */ 36384be0ffcSDave Chinner xfs_agnumber_t agno, /* allocation group number */ 36484be0ffcSDave Chinner xfs_agblock_t agbno, /* allocation group block number */ 36584be0ffcSDave Chinner xfs_extlen_t count, /* count of filesystem blocks */ 36684be0ffcSDave Chinner const struct xfs_buf_ops *ops); 36784be0ffcSDave Chinner 36884be0ffcSDave Chinner /* 36984be0ffcSDave Chinner * Initialise a new btree block header 37084be0ffcSDave Chinner */ 37184be0ffcSDave Chinner void 37284be0ffcSDave Chinner xfs_btree_init_block( 37384be0ffcSDave Chinner struct xfs_mount *mp, 37484be0ffcSDave Chinner struct xfs_buf *bp, 37584be0ffcSDave Chinner __u32 magic, 37684be0ffcSDave Chinner __u16 level, 37784be0ffcSDave Chinner __u16 numrecs, 37884be0ffcSDave Chinner __u64 owner, 37984be0ffcSDave Chinner unsigned int flags); 38084be0ffcSDave Chinner 38184be0ffcSDave Chinner void 38284be0ffcSDave Chinner xfs_btree_init_block_int( 38384be0ffcSDave Chinner struct xfs_mount *mp, 38484be0ffcSDave Chinner struct xfs_btree_block *buf, 38584be0ffcSDave Chinner xfs_daddr_t blkno, 38684be0ffcSDave Chinner __u32 magic, 38784be0ffcSDave Chinner __u16 level, 38884be0ffcSDave Chinner __u16 numrecs, 38984be0ffcSDave Chinner __u64 owner, 39084be0ffcSDave Chinner unsigned int flags); 39184be0ffcSDave Chinner 39284be0ffcSDave Chinner /* 39384be0ffcSDave Chinner * Common btree core entry points. 39484be0ffcSDave Chinner */ 39584be0ffcSDave Chinner int xfs_btree_increment(struct xfs_btree_cur *, int, int *); 39684be0ffcSDave Chinner int xfs_btree_decrement(struct xfs_btree_cur *, int, int *); 39784be0ffcSDave Chinner int xfs_btree_lookup(struct xfs_btree_cur *, xfs_lookup_t, int *); 39884be0ffcSDave Chinner int xfs_btree_update(struct xfs_btree_cur *, union xfs_btree_rec *); 39984be0ffcSDave Chinner int xfs_btree_new_iroot(struct xfs_btree_cur *, int *, int *); 40084be0ffcSDave Chinner int xfs_btree_insert(struct xfs_btree_cur *, int *); 40184be0ffcSDave Chinner int xfs_btree_delete(struct xfs_btree_cur *, int *); 40284be0ffcSDave Chinner int xfs_btree_get_rec(struct xfs_btree_cur *, union xfs_btree_rec **, int *); 40384be0ffcSDave Chinner int xfs_btree_change_owner(struct xfs_btree_cur *cur, __uint64_t new_owner, 40484be0ffcSDave Chinner struct list_head *buffer_list); 40584be0ffcSDave Chinner 40684be0ffcSDave Chinner /* 40784be0ffcSDave Chinner * btree block CRC helpers 40884be0ffcSDave Chinner */ 40984be0ffcSDave Chinner void xfs_btree_lblock_calc_crc(struct xfs_buf *); 41084be0ffcSDave Chinner bool xfs_btree_lblock_verify_crc(struct xfs_buf *); 41184be0ffcSDave Chinner void xfs_btree_sblock_calc_crc(struct xfs_buf *); 41284be0ffcSDave Chinner bool xfs_btree_sblock_verify_crc(struct xfs_buf *); 41384be0ffcSDave Chinner 41484be0ffcSDave Chinner /* 41584be0ffcSDave Chinner * Internal btree helpers also used by xfs_bmap.c. 41684be0ffcSDave Chinner */ 41784be0ffcSDave Chinner void xfs_btree_log_block(struct xfs_btree_cur *, struct xfs_buf *, int); 41884be0ffcSDave Chinner void xfs_btree_log_recs(struct xfs_btree_cur *, struct xfs_buf *, int, int); 41984be0ffcSDave Chinner 42084be0ffcSDave Chinner /* 42184be0ffcSDave Chinner * Helpers. 42284be0ffcSDave Chinner */ 42384be0ffcSDave Chinner static inline int xfs_btree_get_numrecs(struct xfs_btree_block *block) 42484be0ffcSDave Chinner { 42584be0ffcSDave Chinner return be16_to_cpu(block->bb_numrecs); 42684be0ffcSDave Chinner } 42784be0ffcSDave Chinner 42884be0ffcSDave Chinner static inline void xfs_btree_set_numrecs(struct xfs_btree_block *block, 42984be0ffcSDave Chinner __uint16_t numrecs) 43084be0ffcSDave Chinner { 43184be0ffcSDave Chinner block->bb_numrecs = cpu_to_be16(numrecs); 43284be0ffcSDave Chinner } 43384be0ffcSDave Chinner 43484be0ffcSDave Chinner static inline int xfs_btree_get_level(struct xfs_btree_block *block) 43584be0ffcSDave Chinner { 43684be0ffcSDave Chinner return be16_to_cpu(block->bb_level); 43784be0ffcSDave Chinner } 43884be0ffcSDave Chinner 43984be0ffcSDave Chinner 44084be0ffcSDave Chinner /* 44184be0ffcSDave Chinner * Min and max functions for extlen, agblock, fileoff, and filblks types. 44284be0ffcSDave Chinner */ 44384be0ffcSDave Chinner #define XFS_EXTLEN_MIN(a,b) min_t(xfs_extlen_t, (a), (b)) 44484be0ffcSDave Chinner #define XFS_EXTLEN_MAX(a,b) max_t(xfs_extlen_t, (a), (b)) 44584be0ffcSDave Chinner #define XFS_AGBLOCK_MIN(a,b) min_t(xfs_agblock_t, (a), (b)) 44684be0ffcSDave Chinner #define XFS_AGBLOCK_MAX(a,b) max_t(xfs_agblock_t, (a), (b)) 44784be0ffcSDave Chinner #define XFS_FILEOFF_MIN(a,b) min_t(xfs_fileoff_t, (a), (b)) 44884be0ffcSDave Chinner #define XFS_FILEOFF_MAX(a,b) max_t(xfs_fileoff_t, (a), (b)) 44984be0ffcSDave Chinner #define XFS_FILBLKS_MIN(a,b) min_t(xfs_filblks_t, (a), (b)) 45084be0ffcSDave Chinner #define XFS_FILBLKS_MAX(a,b) max_t(xfs_filblks_t, (a), (b)) 45184be0ffcSDave Chinner 45284be0ffcSDave Chinner #define XFS_FSB_SANITY_CHECK(mp,fsb) \ 45384be0ffcSDave Chinner (XFS_FSB_TO_AGNO(mp, fsb) < mp->m_sb.sb_agcount && \ 45484be0ffcSDave Chinner XFS_FSB_TO_AGBNO(mp, fsb) < mp->m_sb.sb_agblocks) 45584be0ffcSDave Chinner 45684be0ffcSDave Chinner /* 45784be0ffcSDave Chinner * Trace hooks. Currently not implemented as they need to be ported 45884be0ffcSDave Chinner * over to the generic tracing functionality, which is some effort. 45984be0ffcSDave Chinner * 46084be0ffcSDave Chinner * i,j = integer (32 bit) 46184be0ffcSDave Chinner * b = btree block buffer (xfs_buf_t) 46284be0ffcSDave Chinner * p = btree ptr 46384be0ffcSDave Chinner * r = btree record 46484be0ffcSDave Chinner * k = btree key 46584be0ffcSDave Chinner */ 46684be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGBI(c, b, i) 46784be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGBII(c, b, i, j) 46884be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGI(c, i) 46984be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGIPK(c, i, p, s) 47084be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGIPR(c, i, p, r) 47184be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGIK(c, i, k) 47284be0ffcSDave Chinner #define XFS_BTREE_TRACE_ARGR(c, r) 47384be0ffcSDave Chinner #define XFS_BTREE_TRACE_CURSOR(c, t) 47484be0ffcSDave Chinner 475c5ab131bSDarrick J. Wong bool xfs_btree_sblock_v5hdr_verify(struct xfs_buf *bp); 476c5ab131bSDarrick J. Wong bool xfs_btree_sblock_verify(struct xfs_buf *bp, unsigned int max_recs); 477c5ab131bSDarrick J. Wong 47884be0ffcSDave Chinner #endif /* __XFS_BTREE_H__ */ 479