1 /* 2 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc. 3 * All Rights Reserved. 4 * 5 * This program is free software; you can redistribute it and/or 6 * modify it under the terms of the GNU General Public License as 7 * published by the Free Software Foundation. 8 * 9 * This program is distributed in the hope that it would be useful, 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 * GNU General Public License for more details. 13 * 14 * You should have received a copy of the GNU General Public License 15 * along with this program; if not, write the Free Software Foundation, 16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 17 */ 18 #ifndef __XFS_BTREE_H__ 19 #define __XFS_BTREE_H__ 20 21 struct xfs_buf; 22 struct xfs_defer_ops; 23 struct xfs_inode; 24 struct xfs_mount; 25 struct xfs_trans; 26 27 extern kmem_zone_t *xfs_btree_cur_zone; 28 29 /* 30 * Generic key, ptr and record wrapper structures. 31 * 32 * These are disk format structures, and are converted where necessary 33 * by the btree specific code that needs to interpret them. 34 */ 35 union xfs_btree_ptr { 36 __be32 s; /* short form ptr */ 37 __be64 l; /* long form ptr */ 38 }; 39 40 union xfs_btree_key { 41 xfs_bmbt_key_t bmbt; 42 xfs_bmdr_key_t bmbr; /* bmbt root block */ 43 xfs_alloc_key_t alloc; 44 xfs_inobt_key_t inobt; 45 }; 46 47 /* 48 * In-core key that holds both low and high keys for overlapped btrees. 49 * The two keys are packed next to each other on disk, so do the same 50 * in memory. Preserve the existing xfs_btree_key as a single key to 51 * avoid the mental model breakage that would happen if we passed a 52 * bigkey into a function that operates on a single key. 53 */ 54 union xfs_btree_bigkey { 55 struct xfs_bmbt_key bmbt; 56 xfs_bmdr_key_t bmbr; /* bmbt root block */ 57 xfs_alloc_key_t alloc; 58 struct xfs_inobt_key inobt; 59 }; 60 61 union xfs_btree_rec { 62 xfs_bmbt_rec_t bmbt; 63 xfs_bmdr_rec_t bmbr; /* bmbt root block */ 64 xfs_alloc_rec_t alloc; 65 xfs_inobt_rec_t inobt; 66 }; 67 68 /* 69 * This nonsense is to make -wlint happy. 70 */ 71 #define XFS_LOOKUP_EQ ((xfs_lookup_t)XFS_LOOKUP_EQi) 72 #define XFS_LOOKUP_LE ((xfs_lookup_t)XFS_LOOKUP_LEi) 73 #define XFS_LOOKUP_GE ((xfs_lookup_t)XFS_LOOKUP_GEi) 74 75 #define XFS_BTNUM_BNO ((xfs_btnum_t)XFS_BTNUM_BNOi) 76 #define XFS_BTNUM_CNT ((xfs_btnum_t)XFS_BTNUM_CNTi) 77 #define XFS_BTNUM_BMAP ((xfs_btnum_t)XFS_BTNUM_BMAPi) 78 #define XFS_BTNUM_INO ((xfs_btnum_t)XFS_BTNUM_INOi) 79 #define XFS_BTNUM_FINO ((xfs_btnum_t)XFS_BTNUM_FINOi) 80 #define XFS_BTNUM_RMAP ((xfs_btnum_t)XFS_BTNUM_RMAPi) 81 82 /* 83 * For logging record fields. 84 */ 85 #define XFS_BB_MAGIC (1 << 0) 86 #define XFS_BB_LEVEL (1 << 1) 87 #define XFS_BB_NUMRECS (1 << 2) 88 #define XFS_BB_LEFTSIB (1 << 3) 89 #define XFS_BB_RIGHTSIB (1 << 4) 90 #define XFS_BB_BLKNO (1 << 5) 91 #define XFS_BB_LSN (1 << 6) 92 #define XFS_BB_UUID (1 << 7) 93 #define XFS_BB_OWNER (1 << 8) 94 #define XFS_BB_NUM_BITS 5 95 #define XFS_BB_ALL_BITS ((1 << XFS_BB_NUM_BITS) - 1) 96 #define XFS_BB_NUM_BITS_CRC 9 97 #define XFS_BB_ALL_BITS_CRC ((1 << XFS_BB_NUM_BITS_CRC) - 1) 98 99 /* 100 * Generic stats interface 101 */ 102 #define __XFS_BTREE_STATS_INC(mp, type, stat) \ 103 XFS_STATS_INC(mp, xs_ ## type ## _2_ ## stat) 104 #define XFS_BTREE_STATS_INC(cur, stat) \ 105 do { \ 106 struct xfs_mount *__mp = cur->bc_mp; \ 107 switch (cur->bc_btnum) { \ 108 case XFS_BTNUM_BNO: __XFS_BTREE_STATS_INC(__mp, abtb, stat); break; \ 109 case XFS_BTNUM_CNT: __XFS_BTREE_STATS_INC(__mp, abtc, stat); break; \ 110 case XFS_BTNUM_BMAP: __XFS_BTREE_STATS_INC(__mp, bmbt, stat); break; \ 111 case XFS_BTNUM_INO: __XFS_BTREE_STATS_INC(__mp, ibt, stat); break; \ 112 case XFS_BTNUM_FINO: __XFS_BTREE_STATS_INC(__mp, fibt, stat); break; \ 113 case XFS_BTNUM_RMAP: break; \ 114 case XFS_BTNUM_MAX: ASSERT(0); /* fucking gcc */ ; break; \ 115 } \ 116 } while (0) 117 118 #define __XFS_BTREE_STATS_ADD(mp, type, stat, val) \ 119 XFS_STATS_ADD(mp, xs_ ## type ## _2_ ## stat, val) 120 #define XFS_BTREE_STATS_ADD(cur, stat, val) \ 121 do { \ 122 struct xfs_mount *__mp = cur->bc_mp; \ 123 switch (cur->bc_btnum) { \ 124 case XFS_BTNUM_BNO: \ 125 __XFS_BTREE_STATS_ADD(__mp, abtb, stat, val); break; \ 126 case XFS_BTNUM_CNT: \ 127 __XFS_BTREE_STATS_ADD(__mp, abtc, stat, val); break; \ 128 case XFS_BTNUM_BMAP: \ 129 __XFS_BTREE_STATS_ADD(__mp, bmbt, stat, val); break; \ 130 case XFS_BTNUM_INO: \ 131 __XFS_BTREE_STATS_ADD(__mp, ibt, stat, val); break; \ 132 case XFS_BTNUM_FINO: \ 133 __XFS_BTREE_STATS_ADD(__mp, fibt, stat, val); break; \ 134 case XFS_BTNUM_RMAP: break; \ 135 case XFS_BTNUM_MAX: ASSERT(0); /* fucking gcc */ ; break; \ 136 } \ 137 } while (0) 138 139 #define XFS_BTREE_MAXLEVELS 9 /* max of all btrees */ 140 141 struct xfs_btree_ops { 142 /* size of the key and record structures */ 143 size_t key_len; 144 size_t rec_len; 145 146 /* cursor operations */ 147 struct xfs_btree_cur *(*dup_cursor)(struct xfs_btree_cur *); 148 void (*update_cursor)(struct xfs_btree_cur *src, 149 struct xfs_btree_cur *dst); 150 151 /* update btree root pointer */ 152 void (*set_root)(struct xfs_btree_cur *cur, 153 union xfs_btree_ptr *nptr, int level_change); 154 155 /* block allocation / freeing */ 156 int (*alloc_block)(struct xfs_btree_cur *cur, 157 union xfs_btree_ptr *start_bno, 158 union xfs_btree_ptr *new_bno, 159 int *stat); 160 int (*free_block)(struct xfs_btree_cur *cur, struct xfs_buf *bp); 161 162 /* update last record information */ 163 void (*update_lastrec)(struct xfs_btree_cur *cur, 164 struct xfs_btree_block *block, 165 union xfs_btree_rec *rec, 166 int ptr, int reason); 167 168 /* records in block/level */ 169 int (*get_minrecs)(struct xfs_btree_cur *cur, int level); 170 int (*get_maxrecs)(struct xfs_btree_cur *cur, int level); 171 172 /* records on disk. Matter for the root in inode case. */ 173 int (*get_dmaxrecs)(struct xfs_btree_cur *cur, int level); 174 175 /* init values of btree structures */ 176 void (*init_key_from_rec)(union xfs_btree_key *key, 177 union xfs_btree_rec *rec); 178 void (*init_rec_from_cur)(struct xfs_btree_cur *cur, 179 union xfs_btree_rec *rec); 180 void (*init_ptr_from_cur)(struct xfs_btree_cur *cur, 181 union xfs_btree_ptr *ptr); 182 void (*init_high_key_from_rec)(union xfs_btree_key *key, 183 union xfs_btree_rec *rec); 184 185 /* difference between key value and cursor value */ 186 __int64_t (*key_diff)(struct xfs_btree_cur *cur, 187 union xfs_btree_key *key); 188 189 /* 190 * Difference between key2 and key1 -- positive if key1 > key2, 191 * negative if key1 < key2, and zero if equal. 192 */ 193 __int64_t (*diff_two_keys)(struct xfs_btree_cur *cur, 194 union xfs_btree_key *key1, 195 union xfs_btree_key *key2); 196 197 const struct xfs_buf_ops *buf_ops; 198 199 #if defined(DEBUG) || defined(XFS_WARN) 200 /* check that k1 is lower than k2 */ 201 int (*keys_inorder)(struct xfs_btree_cur *cur, 202 union xfs_btree_key *k1, 203 union xfs_btree_key *k2); 204 205 /* check that r1 is lower than r2 */ 206 int (*recs_inorder)(struct xfs_btree_cur *cur, 207 union xfs_btree_rec *r1, 208 union xfs_btree_rec *r2); 209 #endif 210 211 /* derive the low & high keys from the records in a leaf block */ 212 void (*get_leaf_keys)(struct xfs_btree_cur *cur, 213 struct xfs_btree_block *block, 214 union xfs_btree_key *key); 215 216 /* derive the low & high keys from the keys in a node block */ 217 void (*get_node_keys)(struct xfs_btree_cur *cur, 218 struct xfs_btree_block *block, 219 union xfs_btree_key *key); 220 221 /* update the parent keys of given btree level */ 222 int (*update_keys)(struct xfs_btree_cur *cur, int level); 223 }; 224 225 /* 226 * Reasons for the update_lastrec method to be called. 227 */ 228 #define LASTREC_UPDATE 0 229 #define LASTREC_INSREC 1 230 #define LASTREC_DELREC 2 231 232 233 union xfs_btree_irec { 234 struct xfs_alloc_rec_incore a; 235 struct xfs_bmbt_irec b; 236 struct xfs_inobt_rec_incore i; 237 }; 238 239 /* 240 * Btree cursor structure. 241 * This collects all information needed by the btree code in one place. 242 */ 243 typedef struct xfs_btree_cur 244 { 245 struct xfs_trans *bc_tp; /* transaction we're in, if any */ 246 struct xfs_mount *bc_mp; /* file system mount struct */ 247 const struct xfs_btree_ops *bc_ops; 248 uint bc_flags; /* btree features - below */ 249 union xfs_btree_irec bc_rec; /* current insert/search record value */ 250 struct xfs_buf *bc_bufs[XFS_BTREE_MAXLEVELS]; /* buf ptr per level */ 251 int bc_ptrs[XFS_BTREE_MAXLEVELS]; /* key/record # */ 252 __uint8_t bc_ra[XFS_BTREE_MAXLEVELS]; /* readahead bits */ 253 #define XFS_BTCUR_LEFTRA 1 /* left sibling has been read-ahead */ 254 #define XFS_BTCUR_RIGHTRA 2 /* right sibling has been read-ahead */ 255 __uint8_t bc_nlevels; /* number of levels in the tree */ 256 __uint8_t bc_blocklog; /* log2(blocksize) of btree blocks */ 257 xfs_btnum_t bc_btnum; /* identifies which btree type */ 258 union { 259 struct { /* needed for BNO, CNT, INO */ 260 struct xfs_buf *agbp; /* agf/agi buffer pointer */ 261 struct xfs_defer_ops *dfops; /* deferred updates */ 262 xfs_agnumber_t agno; /* ag number */ 263 } a; 264 struct { /* needed for BMAP */ 265 struct xfs_inode *ip; /* pointer to our inode */ 266 struct xfs_defer_ops *dfops; /* deferred updates */ 267 xfs_fsblock_t firstblock; /* 1st blk allocated */ 268 int allocated; /* count of alloced */ 269 short forksize; /* fork's inode space */ 270 char whichfork; /* data or attr fork */ 271 char flags; /* flags */ 272 #define XFS_BTCUR_BPRV_WASDEL 1 /* was delayed */ 273 } b; 274 } bc_private; /* per-btree type data */ 275 } xfs_btree_cur_t; 276 277 /* cursor flags */ 278 #define XFS_BTREE_LONG_PTRS (1<<0) /* pointers are 64bits long */ 279 #define XFS_BTREE_ROOT_IN_INODE (1<<1) /* root may be variable size */ 280 #define XFS_BTREE_LASTREC_UPDATE (1<<2) /* track last rec externally */ 281 #define XFS_BTREE_CRC_BLOCKS (1<<3) /* uses extended btree blocks */ 282 #define XFS_BTREE_OVERLAPPING (1<<4) /* overlapping intervals */ 283 284 285 #define XFS_BTREE_NOERROR 0 286 #define XFS_BTREE_ERROR 1 287 288 /* 289 * Convert from buffer to btree block header. 290 */ 291 #define XFS_BUF_TO_BLOCK(bp) ((struct xfs_btree_block *)((bp)->b_addr)) 292 293 294 /* 295 * Check that block header is ok. 296 */ 297 int 298 xfs_btree_check_block( 299 struct xfs_btree_cur *cur, /* btree cursor */ 300 struct xfs_btree_block *block, /* generic btree block pointer */ 301 int level, /* level of the btree block */ 302 struct xfs_buf *bp); /* buffer containing block, if any */ 303 304 /* 305 * Check that (long) pointer is ok. 306 */ 307 int /* error (0 or EFSCORRUPTED) */ 308 xfs_btree_check_lptr( 309 struct xfs_btree_cur *cur, /* btree cursor */ 310 xfs_fsblock_t ptr, /* btree block disk address */ 311 int level); /* btree block level */ 312 313 /* 314 * Delete the btree cursor. 315 */ 316 void 317 xfs_btree_del_cursor( 318 xfs_btree_cur_t *cur, /* btree cursor */ 319 int error); /* del because of error */ 320 321 /* 322 * Duplicate the btree cursor. 323 * Allocate a new one, copy the record, re-get the buffers. 324 */ 325 int /* error */ 326 xfs_btree_dup_cursor( 327 xfs_btree_cur_t *cur, /* input cursor */ 328 xfs_btree_cur_t **ncur);/* output cursor */ 329 330 /* 331 * Get a buffer for the block, return it with no data read. 332 * Long-form addressing. 333 */ 334 struct xfs_buf * /* buffer for fsbno */ 335 xfs_btree_get_bufl( 336 struct xfs_mount *mp, /* file system mount point */ 337 struct xfs_trans *tp, /* transaction pointer */ 338 xfs_fsblock_t fsbno, /* file system block number */ 339 uint lock); /* lock flags for get_buf */ 340 341 /* 342 * Get a buffer for the block, return it with no data read. 343 * Short-form addressing. 344 */ 345 struct xfs_buf * /* buffer for agno/agbno */ 346 xfs_btree_get_bufs( 347 struct xfs_mount *mp, /* file system mount point */ 348 struct xfs_trans *tp, /* transaction pointer */ 349 xfs_agnumber_t agno, /* allocation group number */ 350 xfs_agblock_t agbno, /* allocation group block number */ 351 uint lock); /* lock flags for get_buf */ 352 353 /* 354 * Check for the cursor referring to the last block at the given level. 355 */ 356 int /* 1=is last block, 0=not last block */ 357 xfs_btree_islastblock( 358 xfs_btree_cur_t *cur, /* btree cursor */ 359 int level); /* level to check */ 360 361 /* 362 * Compute first and last byte offsets for the fields given. 363 * Interprets the offsets table, which contains struct field offsets. 364 */ 365 void 366 xfs_btree_offsets( 367 __int64_t fields, /* bitmask of fields */ 368 const short *offsets,/* table of field offsets */ 369 int nbits, /* number of bits to inspect */ 370 int *first, /* output: first byte offset */ 371 int *last); /* output: last byte offset */ 372 373 /* 374 * Get a buffer for the block, return it read in. 375 * Long-form addressing. 376 */ 377 int /* error */ 378 xfs_btree_read_bufl( 379 struct xfs_mount *mp, /* file system mount point */ 380 struct xfs_trans *tp, /* transaction pointer */ 381 xfs_fsblock_t fsbno, /* file system block number */ 382 uint lock, /* lock flags for read_buf */ 383 struct xfs_buf **bpp, /* buffer for fsbno */ 384 int refval, /* ref count value for buffer */ 385 const struct xfs_buf_ops *ops); 386 387 /* 388 * Read-ahead the block, don't wait for it, don't return a buffer. 389 * Long-form addressing. 390 */ 391 void /* error */ 392 xfs_btree_reada_bufl( 393 struct xfs_mount *mp, /* file system mount point */ 394 xfs_fsblock_t fsbno, /* file system block number */ 395 xfs_extlen_t count, /* count of filesystem blocks */ 396 const struct xfs_buf_ops *ops); 397 398 /* 399 * Read-ahead the block, don't wait for it, don't return a buffer. 400 * Short-form addressing. 401 */ 402 void /* error */ 403 xfs_btree_reada_bufs( 404 struct xfs_mount *mp, /* file system mount point */ 405 xfs_agnumber_t agno, /* allocation group number */ 406 xfs_agblock_t agbno, /* allocation group block number */ 407 xfs_extlen_t count, /* count of filesystem blocks */ 408 const struct xfs_buf_ops *ops); 409 410 /* 411 * Initialise a new btree block header 412 */ 413 void 414 xfs_btree_init_block( 415 struct xfs_mount *mp, 416 struct xfs_buf *bp, 417 __u32 magic, 418 __u16 level, 419 __u16 numrecs, 420 __u64 owner, 421 unsigned int flags); 422 423 void 424 xfs_btree_init_block_int( 425 struct xfs_mount *mp, 426 struct xfs_btree_block *buf, 427 xfs_daddr_t blkno, 428 __u32 magic, 429 __u16 level, 430 __u16 numrecs, 431 __u64 owner, 432 unsigned int flags); 433 434 /* 435 * Common btree core entry points. 436 */ 437 int xfs_btree_increment(struct xfs_btree_cur *, int, int *); 438 int xfs_btree_decrement(struct xfs_btree_cur *, int, int *); 439 int xfs_btree_lookup(struct xfs_btree_cur *, xfs_lookup_t, int *); 440 int xfs_btree_update(struct xfs_btree_cur *, union xfs_btree_rec *); 441 int xfs_btree_new_iroot(struct xfs_btree_cur *, int *, int *); 442 int xfs_btree_insert(struct xfs_btree_cur *, int *); 443 int xfs_btree_delete(struct xfs_btree_cur *, int *); 444 int xfs_btree_get_rec(struct xfs_btree_cur *, union xfs_btree_rec **, int *); 445 int xfs_btree_change_owner(struct xfs_btree_cur *cur, __uint64_t new_owner, 446 struct list_head *buffer_list); 447 448 /* 449 * btree block CRC helpers 450 */ 451 void xfs_btree_lblock_calc_crc(struct xfs_buf *); 452 bool xfs_btree_lblock_verify_crc(struct xfs_buf *); 453 void xfs_btree_sblock_calc_crc(struct xfs_buf *); 454 bool xfs_btree_sblock_verify_crc(struct xfs_buf *); 455 456 /* 457 * Internal btree helpers also used by xfs_bmap.c. 458 */ 459 void xfs_btree_log_block(struct xfs_btree_cur *, struct xfs_buf *, int); 460 void xfs_btree_log_recs(struct xfs_btree_cur *, struct xfs_buf *, int, int); 461 462 /* 463 * Helpers. 464 */ 465 static inline int xfs_btree_get_numrecs(struct xfs_btree_block *block) 466 { 467 return be16_to_cpu(block->bb_numrecs); 468 } 469 470 static inline void xfs_btree_set_numrecs(struct xfs_btree_block *block, 471 __uint16_t numrecs) 472 { 473 block->bb_numrecs = cpu_to_be16(numrecs); 474 } 475 476 static inline int xfs_btree_get_level(struct xfs_btree_block *block) 477 { 478 return be16_to_cpu(block->bb_level); 479 } 480 481 482 /* 483 * Min and max functions for extlen, agblock, fileoff, and filblks types. 484 */ 485 #define XFS_EXTLEN_MIN(a,b) min_t(xfs_extlen_t, (a), (b)) 486 #define XFS_EXTLEN_MAX(a,b) max_t(xfs_extlen_t, (a), (b)) 487 #define XFS_AGBLOCK_MIN(a,b) min_t(xfs_agblock_t, (a), (b)) 488 #define XFS_AGBLOCK_MAX(a,b) max_t(xfs_agblock_t, (a), (b)) 489 #define XFS_FILEOFF_MIN(a,b) min_t(xfs_fileoff_t, (a), (b)) 490 #define XFS_FILEOFF_MAX(a,b) max_t(xfs_fileoff_t, (a), (b)) 491 #define XFS_FILBLKS_MIN(a,b) min_t(xfs_filblks_t, (a), (b)) 492 #define XFS_FILBLKS_MAX(a,b) max_t(xfs_filblks_t, (a), (b)) 493 494 #define XFS_FSB_SANITY_CHECK(mp,fsb) \ 495 (XFS_FSB_TO_AGNO(mp, fsb) < mp->m_sb.sb_agcount && \ 496 XFS_FSB_TO_AGBNO(mp, fsb) < mp->m_sb.sb_agblocks) 497 498 /* 499 * Trace hooks. Currently not implemented as they need to be ported 500 * over to the generic tracing functionality, which is some effort. 501 * 502 * i,j = integer (32 bit) 503 * b = btree block buffer (xfs_buf_t) 504 * p = btree ptr 505 * r = btree record 506 * k = btree key 507 */ 508 #define XFS_BTREE_TRACE_ARGBI(c, b, i) 509 #define XFS_BTREE_TRACE_ARGBII(c, b, i, j) 510 #define XFS_BTREE_TRACE_ARGI(c, i) 511 #define XFS_BTREE_TRACE_ARGIPK(c, i, p, s) 512 #define XFS_BTREE_TRACE_ARGIPR(c, i, p, r) 513 #define XFS_BTREE_TRACE_ARGIK(c, i, k) 514 #define XFS_BTREE_TRACE_ARGR(c, r) 515 #define XFS_BTREE_TRACE_CURSOR(c, t) 516 517 bool xfs_btree_sblock_v5hdr_verify(struct xfs_buf *bp); 518 bool xfs_btree_sblock_verify(struct xfs_buf *bp, unsigned int max_recs); 519 uint xfs_btree_compute_maxlevels(struct xfs_mount *mp, uint *limits, 520 unsigned long len); 521 522 void xfs_btree_get_leaf_keys(struct xfs_btree_cur *cur, 523 struct xfs_btree_block *block, union xfs_btree_key *key); 524 void xfs_btree_get_node_keys(struct xfs_btree_cur *cur, 525 struct xfs_btree_block *block, union xfs_btree_key *key); 526 int xfs_btree_update_keys(struct xfs_btree_cur *cur, int level); 527 void xfs_btree_get_leaf_keys_overlapped(struct xfs_btree_cur *cur, 528 struct xfs_btree_block *block, union xfs_btree_key *key); 529 void xfs_btree_get_node_keys_overlapped(struct xfs_btree_cur *cur, 530 struct xfs_btree_block *block, union xfs_btree_key *key); 531 int xfs_btree_update_keys_overlapped(struct xfs_btree_cur *cur, int level); 532 533 /* return codes */ 534 #define XFS_BTREE_QUERY_RANGE_CONTINUE 0 /* keep iterating */ 535 #define XFS_BTREE_QUERY_RANGE_ABORT 1 /* stop iterating */ 536 typedef int (*xfs_btree_query_range_fn)(struct xfs_btree_cur *cur, 537 union xfs_btree_rec *rec, void *priv); 538 539 int xfs_btree_query_range(struct xfs_btree_cur *cur, 540 union xfs_btree_irec *low_rec, union xfs_btree_irec *high_rec, 541 xfs_btree_query_range_fn fn, void *priv); 542 543 typedef int (*xfs_btree_visit_blocks_fn)(struct xfs_btree_cur *cur, int level, 544 void *data); 545 int xfs_btree_visit_blocks(struct xfs_btree_cur *cur, 546 xfs_btree_visit_blocks_fn fn, void *data); 547 548 #endif /* __XFS_BTREE_H__ */ 549