xfs_bmap_btree.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401
  1. /*
  2. * Copyright (c) 2000,2002-2004 Silicon Graphics, Inc. All Rights Reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or modify it
  5. * under the terms of version 2 of the GNU General Public License as
  6. * published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it would be useful, but
  9. * WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  11. *
  12. * Further, this software is distributed without any warranty that it is
  13. * free of the rightful claim of any third person regarding infringement
  14. * or the like. Any license provided herein, whether implied or
  15. * otherwise, applies only to this software file. Patent licenses, if
  16. * any, provided herein do not apply to combinations of this program with
  17. * other software, or any other product whatsoever.
  18. *
  19. * You should have received a copy of the GNU General Public License along
  20. * with this program; if not, write the Free Software Foundation, Inc., 59
  21. * Temple Place - Suite 330, Boston MA 02111-1307, USA.
  22. *
  23. * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
  24. * Mountain View, CA 94043, or:
  25. *
  26. * http://www.sgi.com
  27. *
  28. * For further information regarding this notice, see:
  29. *
  30. * http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/
  31. */
  32. #ifndef __XFS_BMAP_BTREE_H__
  33. #define __XFS_BMAP_BTREE_H__
  34. #define XFS_BMAP_MAGIC 0x424d4150 /* 'BMAP' */
  35. struct xfs_btree_cur;
  36. struct xfs_btree_lblock;
  37. struct xfs_mount;
  38. struct xfs_inode;
  39. /*
  40. * Bmap root header, on-disk form only.
  41. */
  42. typedef struct xfs_bmdr_block
  43. {
  44. __uint16_t bb_level; /* 0 is a leaf */
  45. __uint16_t bb_numrecs; /* current # of data records */
  46. } xfs_bmdr_block_t;
  47. /*
  48. * Bmap btree record and extent descriptor.
  49. * For 32-bit kernels,
  50. * l0:31 is an extent flag (value 1 indicates non-normal).
  51. * l0:0-30 and l1:9-31 are startoff.
  52. * l1:0-8, l2:0-31, and l3:21-31 are startblock.
  53. * l3:0-20 are blockcount.
  54. * For 64-bit kernels,
  55. * l0:63 is an extent flag (value 1 indicates non-normal).
  56. * l0:9-62 are startoff.
  57. * l0:0-8 and l1:21-63 are startblock.
  58. * l1:0-20 are blockcount.
  59. */
  60. #ifndef XFS_NATIVE_HOST
  61. #define BMBT_TOTAL_BITLEN 128 /* 128 bits, 16 bytes */
  62. #define BMBT_EXNTFLAG_BITOFF 0
  63. #define BMBT_EXNTFLAG_BITLEN 1
  64. #define BMBT_STARTOFF_BITOFF (BMBT_EXNTFLAG_BITOFF + BMBT_EXNTFLAG_BITLEN)
  65. #define BMBT_STARTOFF_BITLEN 54
  66. #define BMBT_STARTBLOCK_BITOFF (BMBT_STARTOFF_BITOFF + BMBT_STARTOFF_BITLEN)
  67. #define BMBT_STARTBLOCK_BITLEN 52
  68. #define BMBT_BLOCKCOUNT_BITOFF \
  69. (BMBT_STARTBLOCK_BITOFF + BMBT_STARTBLOCK_BITLEN)
  70. #define BMBT_BLOCKCOUNT_BITLEN (BMBT_TOTAL_BITLEN - BMBT_BLOCKCOUNT_BITOFF)
  71. #else
  72. #define BMBT_TOTAL_BITLEN 128 /* 128 bits, 16 bytes */
  73. #define BMBT_EXNTFLAG_BITOFF 63
  74. #define BMBT_EXNTFLAG_BITLEN 1
  75. #define BMBT_STARTOFF_BITOFF (BMBT_EXNTFLAG_BITOFF - BMBT_STARTOFF_BITLEN)
  76. #define BMBT_STARTOFF_BITLEN 54
  77. #define BMBT_STARTBLOCK_BITOFF 85 /* 128 - 43 (other 9 is in first word) */
  78. #define BMBT_STARTBLOCK_BITLEN 52
  79. #define BMBT_BLOCKCOUNT_BITOFF 64 /* Start of second 64 bit container */
  80. #define BMBT_BLOCKCOUNT_BITLEN 21
  81. #endif /* XFS_NATIVE_HOST */
  82. #define BMBT_USE_64 1
  83. typedef struct xfs_bmbt_rec_32
  84. {
  85. __uint32_t l0, l1, l2, l3;
  86. } xfs_bmbt_rec_32_t;
  87. typedef struct xfs_bmbt_rec_64
  88. {
  89. __uint64_t l0, l1;
  90. } xfs_bmbt_rec_64_t;
  91. typedef __uint64_t xfs_bmbt_rec_base_t; /* use this for casts */
  92. typedef xfs_bmbt_rec_64_t xfs_bmbt_rec_t, xfs_bmdr_rec_t;
  93. /*
  94. * Values and macros for delayed-allocation startblock fields.
  95. */
  96. #define STARTBLOCKVALBITS 17
  97. #define STARTBLOCKMASKBITS (15 + XFS_BIG_BLKNOS * 20)
  98. #define DSTARTBLOCKMASKBITS (15 + 20)
  99. #define STARTBLOCKMASK \
  100. (((((xfs_fsblock_t)1) << STARTBLOCKMASKBITS) - 1) << STARTBLOCKVALBITS)
  101. #define DSTARTBLOCKMASK \
  102. (((((xfs_dfsbno_t)1) << DSTARTBLOCKMASKBITS) - 1) << STARTBLOCKVALBITS)
  103. #define ISNULLSTARTBLOCK(x) isnullstartblock(x)
  104. static inline int isnullstartblock(xfs_fsblock_t x)
  105. {
  106. return ((x) & STARTBLOCKMASK) == STARTBLOCKMASK;
  107. }
  108. #define ISNULLDSTARTBLOCK(x) isnulldstartblock(x)
  109. static inline int isnulldstartblock(xfs_dfsbno_t x)
  110. {
  111. return ((x) & DSTARTBLOCKMASK) == DSTARTBLOCKMASK;
  112. }
  113. #define NULLSTARTBLOCK(k) nullstartblock(k)
  114. static inline xfs_fsblock_t nullstartblock(int k)
  115. {
  116. ASSERT(k < (1 << STARTBLOCKVALBITS));
  117. return STARTBLOCKMASK | (k);
  118. }
  119. #define STARTBLOCKVAL(x) startblockval(x)
  120. static inline xfs_filblks_t startblockval(xfs_fsblock_t x)
  121. {
  122. return (xfs_filblks_t)((x) & ~STARTBLOCKMASK);
  123. }
  124. /*
  125. * Possible extent formats.
  126. */
  127. typedef enum {
  128. XFS_EXTFMT_NOSTATE = 0,
  129. XFS_EXTFMT_HASSTATE
  130. } xfs_exntfmt_t;
  131. /*
  132. * Possible extent states.
  133. */
  134. typedef enum {
  135. XFS_EXT_NORM, XFS_EXT_UNWRITTEN,
  136. XFS_EXT_DMAPI_OFFLINE, XFS_EXT_INVALID
  137. } xfs_exntst_t;
  138. /*
  139. * Extent state and extent format macros.
  140. */
  141. #define XFS_EXTFMT_INODE(x) \
  142. (XFS_SB_VERSION_HASEXTFLGBIT(&((x)->i_mount->m_sb)) ? \
  143. XFS_EXTFMT_HASSTATE : XFS_EXTFMT_NOSTATE)
  144. #define ISUNWRITTEN(x) ((x)->br_state == XFS_EXT_UNWRITTEN)
  145. /*
  146. * Incore version of above.
  147. */
  148. typedef struct xfs_bmbt_irec
  149. {
  150. xfs_fileoff_t br_startoff; /* starting file offset */
  151. xfs_fsblock_t br_startblock; /* starting block number */
  152. xfs_filblks_t br_blockcount; /* number of blocks */
  153. xfs_exntst_t br_state; /* extent state */
  154. } xfs_bmbt_irec_t;
  155. /*
  156. * Key structure for non-leaf levels of the tree.
  157. */
  158. typedef struct xfs_bmbt_key
  159. {
  160. xfs_dfiloff_t br_startoff; /* starting file offset */
  161. } xfs_bmbt_key_t, xfs_bmdr_key_t;
  162. typedef xfs_dfsbno_t xfs_bmbt_ptr_t, xfs_bmdr_ptr_t; /* btree pointer type */
  163. /* btree block header type */
  164. typedef struct xfs_btree_lblock xfs_bmbt_block_t;
  165. #define XFS_BUF_TO_BMBT_BLOCK(bp) ((xfs_bmbt_block_t *)XFS_BUF_PTR(bp))
  166. #define XFS_BMAP_IBLOCK_SIZE(lev,cur) (1 << (cur)->bc_blocklog)
  167. #define XFS_BMAP_RBLOCK_DSIZE(lev,cur) ((cur)->bc_private.b.forksize)
  168. #define XFS_BMAP_RBLOCK_ISIZE(lev,cur) \
  169. ((int)XFS_IFORK_PTR((cur)->bc_private.b.ip, \
  170. (cur)->bc_private.b.whichfork)->if_broot_bytes)
  171. #define XFS_BMAP_BLOCK_DSIZE(lev,cur) \
  172. (((lev) == (cur)->bc_nlevels - 1 ? \
  173. XFS_BMAP_RBLOCK_DSIZE(lev,cur) : XFS_BMAP_IBLOCK_SIZE(lev,cur)))
  174. #define XFS_BMAP_BLOCK_ISIZE(lev,cur) \
  175. (((lev) == (cur)->bc_nlevels - 1 ? \
  176. XFS_BMAP_RBLOCK_ISIZE(lev,cur) : XFS_BMAP_IBLOCK_SIZE(lev,cur)))
  177. #define XFS_BMAP_BLOCK_DMAXRECS(lev,cur) \
  178. (((lev) == (cur)->bc_nlevels - 1 ? \
  179. XFS_BTREE_BLOCK_MAXRECS(XFS_BMAP_RBLOCK_DSIZE(lev,cur), \
  180. xfs_bmdr, (lev) == 0) : \
  181. ((cur)->bc_mp->m_bmap_dmxr[(lev) != 0])))
  182. #define XFS_BMAP_BLOCK_IMAXRECS(lev,cur) \
  183. (((lev) == (cur)->bc_nlevels - 1 ? \
  184. XFS_BTREE_BLOCK_MAXRECS(XFS_BMAP_RBLOCK_ISIZE(lev,cur),\
  185. xfs_bmbt, (lev) == 0) : \
  186. ((cur)->bc_mp->m_bmap_dmxr[(lev) != 0])))
  187. #define XFS_BMAP_BLOCK_DMINRECS(lev,cur) \
  188. (((lev) == (cur)->bc_nlevels - 1 ? \
  189. XFS_BTREE_BLOCK_MINRECS(XFS_BMAP_RBLOCK_DSIZE(lev,cur),\
  190. xfs_bmdr, (lev) == 0) : \
  191. ((cur)->bc_mp->m_bmap_dmnr[(lev) != 0])))
  192. #define XFS_BMAP_BLOCK_IMINRECS(lev,cur) \
  193. (((lev) == (cur)->bc_nlevels - 1 ? \
  194. XFS_BTREE_BLOCK_MINRECS(XFS_BMAP_RBLOCK_ISIZE(lev,cur),\
  195. xfs_bmbt, (lev) == 0) : \
  196. ((cur)->bc_mp->m_bmap_dmnr[(lev) != 0])))
  197. #define XFS_BMAP_REC_DADDR(bb,i,cur) \
  198. (XFS_BTREE_REC_ADDR(XFS_BMAP_BLOCK_DSIZE( \
  199. INT_GET((bb)->bb_level, ARCH_CONVERT), cur), \
  200. xfs_bmbt, bb, i, XFS_BMAP_BLOCK_DMAXRECS( \
  201. INT_GET((bb)->bb_level, ARCH_CONVERT), cur)))
  202. #define XFS_BMAP_REC_IADDR(bb,i,cur) \
  203. (XFS_BTREE_REC_ADDR(XFS_BMAP_BLOCK_ISIZE( \
  204. INT_GET((bb)->bb_level, ARCH_CONVERT), cur), \
  205. xfs_bmbt, bb, i, XFS_BMAP_BLOCK_IMAXRECS( \
  206. INT_GET((bb)->bb_level, ARCH_CONVERT), cur)))
  207. #define XFS_BMAP_KEY_DADDR(bb,i,cur) \
  208. (XFS_BTREE_KEY_ADDR(XFS_BMAP_BLOCK_DSIZE( \
  209. INT_GET((bb)->bb_level, ARCH_CONVERT), cur), \
  210. xfs_bmbt, bb, i, XFS_BMAP_BLOCK_DMAXRECS( \
  211. INT_GET((bb)->bb_level, ARCH_CONVERT), cur)))
  212. #define XFS_BMAP_KEY_IADDR(bb,i,cur) \
  213. (XFS_BTREE_KEY_ADDR(XFS_BMAP_BLOCK_ISIZE( \
  214. INT_GET((bb)->bb_level, ARCH_CONVERT), cur), \
  215. xfs_bmbt, bb, i, XFS_BMAP_BLOCK_IMAXRECS( \
  216. INT_GET((bb)->bb_level, ARCH_CONVERT), cur)))
  217. #define XFS_BMAP_PTR_DADDR(bb,i,cur) \
  218. (XFS_BTREE_PTR_ADDR(XFS_BMAP_BLOCK_DSIZE( \
  219. INT_GET((bb)->bb_level, ARCH_CONVERT), cur), \
  220. xfs_bmbt, bb, i, XFS_BMAP_BLOCK_DMAXRECS( \
  221. INT_GET((bb)->bb_level, ARCH_CONVERT), cur)))
  222. #define XFS_BMAP_PTR_IADDR(bb,i,cur) \
  223. (XFS_BTREE_PTR_ADDR(XFS_BMAP_BLOCK_ISIZE( \
  224. INT_GET((bb)->bb_level, ARCH_CONVERT), cur), \
  225. xfs_bmbt, bb, i, XFS_BMAP_BLOCK_IMAXRECS( \
  226. INT_GET((bb)->bb_level, ARCH_CONVERT), cur)))
  227. /*
  228. * These are to be used when we know the size of the block and
  229. * we don't have a cursor.
  230. */
  231. #define XFS_BMAP_BROOT_REC_ADDR(bb,i,sz) \
  232. (XFS_BTREE_REC_ADDR(sz,xfs_bmbt,bb,i,XFS_BMAP_BROOT_MAXRECS(sz)))
  233. #define XFS_BMAP_BROOT_KEY_ADDR(bb,i,sz) \
  234. (XFS_BTREE_KEY_ADDR(sz,xfs_bmbt,bb,i,XFS_BMAP_BROOT_MAXRECS(sz)))
  235. #define XFS_BMAP_BROOT_PTR_ADDR(bb,i,sz) \
  236. (XFS_BTREE_PTR_ADDR(sz,xfs_bmbt,bb,i,XFS_BMAP_BROOT_MAXRECS(sz)))
  237. #define XFS_BMAP_BROOT_NUMRECS(bb) INT_GET((bb)->bb_numrecs, ARCH_CONVERT)
  238. #define XFS_BMAP_BROOT_MAXRECS(sz) XFS_BTREE_BLOCK_MAXRECS(sz,xfs_bmbt,0)
  239. #define XFS_BMAP_BROOT_SPACE_CALC(nrecs) \
  240. (int)(sizeof(xfs_bmbt_block_t) + \
  241. ((nrecs) * (sizeof(xfs_bmbt_key_t) + sizeof(xfs_bmbt_ptr_t))))
  242. #define XFS_BMAP_BROOT_SPACE(bb) \
  243. (XFS_BMAP_BROOT_SPACE_CALC(INT_GET((bb)->bb_numrecs, ARCH_CONVERT)))
  244. #define XFS_BMDR_SPACE_CALC(nrecs) \
  245. (int)(sizeof(xfs_bmdr_block_t) + \
  246. ((nrecs) * (sizeof(xfs_bmbt_key_t) + sizeof(xfs_bmbt_ptr_t))))
  247. /*
  248. * Maximum number of bmap btree levels.
  249. */
  250. #define XFS_BM_MAXLEVELS(mp,w) ((mp)->m_bm_maxlevels[(w)])
  251. #define XFS_BMAP_SANITY_CHECK(mp,bb,level) \
  252. (INT_GET((bb)->bb_magic, ARCH_CONVERT) == XFS_BMAP_MAGIC && \
  253. INT_GET((bb)->bb_level, ARCH_CONVERT) == level && \
  254. INT_GET((bb)->bb_numrecs, ARCH_CONVERT) > 0 && \
  255. INT_GET((bb)->bb_numrecs, ARCH_CONVERT) <= \
  256. (mp)->m_bmap_dmxr[(level) != 0])
  257. #ifdef __KERNEL__
  258. #if defined(XFS_BMBT_TRACE)
  259. /*
  260. * Trace buffer entry types.
  261. */
  262. #define XFS_BMBT_KTRACE_ARGBI 1
  263. #define XFS_BMBT_KTRACE_ARGBII 2
  264. #define XFS_BMBT_KTRACE_ARGFFFI 3
  265. #define XFS_BMBT_KTRACE_ARGI 4
  266. #define XFS_BMBT_KTRACE_ARGIFK 5
  267. #define XFS_BMBT_KTRACE_ARGIFR 6
  268. #define XFS_BMBT_KTRACE_ARGIK 7
  269. #define XFS_BMBT_KTRACE_CUR 8
  270. #define XFS_BMBT_TRACE_SIZE 4096 /* size of global trace buffer */
  271. #define XFS_BMBT_KTRACE_SIZE 32 /* size of per-inode trace buffer */
  272. extern ktrace_t *xfs_bmbt_trace_buf;
  273. #endif
  274. /*
  275. * Prototypes for xfs_bmap.c to call.
  276. */
  277. extern void xfs_bmdr_to_bmbt(xfs_bmdr_block_t *, int, xfs_bmbt_block_t *, int);
  278. extern int xfs_bmbt_decrement(struct xfs_btree_cur *, int, int *);
  279. extern int xfs_bmbt_delete(struct xfs_btree_cur *, int *);
  280. extern void xfs_bmbt_get_all(xfs_bmbt_rec_t *r, xfs_bmbt_irec_t *s);
  281. extern xfs_bmbt_block_t *xfs_bmbt_get_block(struct xfs_btree_cur *cur,
  282. int, struct xfs_buf **bpp);
  283. extern xfs_filblks_t xfs_bmbt_get_blockcount(xfs_bmbt_rec_t *r);
  284. extern xfs_fsblock_t xfs_bmbt_get_startblock(xfs_bmbt_rec_t *r);
  285. extern xfs_fileoff_t xfs_bmbt_get_startoff(xfs_bmbt_rec_t *r);
  286. extern xfs_exntst_t xfs_bmbt_get_state(xfs_bmbt_rec_t *r);
  287. #ifndef XFS_NATIVE_HOST
  288. extern void xfs_bmbt_disk_get_all(xfs_bmbt_rec_t *r, xfs_bmbt_irec_t *s);
  289. extern xfs_exntst_t xfs_bmbt_disk_get_state(xfs_bmbt_rec_t *r);
  290. extern xfs_filblks_t xfs_bmbt_disk_get_blockcount(xfs_bmbt_rec_t *r);
  291. extern xfs_fsblock_t xfs_bmbt_disk_get_startblock(xfs_bmbt_rec_t *r);
  292. extern xfs_fileoff_t xfs_bmbt_disk_get_startoff(xfs_bmbt_rec_t *r);
  293. #else
  294. #define xfs_bmbt_disk_get_all(r, s) xfs_bmbt_get_all(r, s)
  295. #define xfs_bmbt_disk_get_state(r) xfs_bmbt_get_state(r)
  296. #define xfs_bmbt_disk_get_blockcount(r) xfs_bmbt_get_blockcount(r)
  297. #define xfs_bmbt_disk_get_startblock(r) xfs_bmbt_get_blockcount(r)
  298. #define xfs_bmbt_disk_get_startoff(r) xfs_bmbt_get_startoff(r)
  299. #endif /* XFS_NATIVE_HOST */
  300. extern int xfs_bmbt_increment(struct xfs_btree_cur *, int, int *);
  301. extern int xfs_bmbt_insert(struct xfs_btree_cur *, int *);
  302. extern void xfs_bmbt_log_block(struct xfs_btree_cur *, struct xfs_buf *, int);
  303. extern void xfs_bmbt_log_recs(struct xfs_btree_cur *, struct xfs_buf *, int,
  304. int);
  305. extern int xfs_bmbt_lookup_eq(struct xfs_btree_cur *, xfs_fileoff_t,
  306. xfs_fsblock_t, xfs_filblks_t, int *);
  307. extern int xfs_bmbt_lookup_ge(struct xfs_btree_cur *, xfs_fileoff_t,
  308. xfs_fsblock_t, xfs_filblks_t, int *);
  309. /*
  310. * Give the bmap btree a new root block. Copy the old broot contents
  311. * down into a real block and make the broot point to it.
  312. */
  313. extern int xfs_bmbt_newroot(struct xfs_btree_cur *cur, int *lflags, int *stat);
  314. extern void xfs_bmbt_set_all(xfs_bmbt_rec_t *r, xfs_bmbt_irec_t *s);
  315. extern void xfs_bmbt_set_allf(xfs_bmbt_rec_t *r, xfs_fileoff_t o,
  316. xfs_fsblock_t b, xfs_filblks_t c, xfs_exntst_t v);
  317. extern void xfs_bmbt_set_blockcount(xfs_bmbt_rec_t *r, xfs_filblks_t v);
  318. extern void xfs_bmbt_set_startblock(xfs_bmbt_rec_t *r, xfs_fsblock_t v);
  319. extern void xfs_bmbt_set_startoff(xfs_bmbt_rec_t *r, xfs_fileoff_t v);
  320. extern void xfs_bmbt_set_state(xfs_bmbt_rec_t *r, xfs_exntst_t v);
  321. #ifndef XFS_NATIVE_HOST
  322. extern void xfs_bmbt_disk_set_all(xfs_bmbt_rec_t *r, xfs_bmbt_irec_t *s);
  323. extern void xfs_bmbt_disk_set_allf(xfs_bmbt_rec_t *r, xfs_fileoff_t o,
  324. xfs_fsblock_t b, xfs_filblks_t c, xfs_exntst_t v);
  325. #else
  326. #define xfs_bmbt_disk_set_all(r, s) xfs_bmbt_set_all(r, s)
  327. #define xfs_bmbt_disk_set_allf(r, o, b, c, v) xfs_bmbt_set_allf(r, o, b, c, v)
  328. #endif /* XFS_NATIVE_HOST */
  329. extern void xfs_bmbt_to_bmdr(xfs_bmbt_block_t *, int, xfs_bmdr_block_t *, int);
  330. extern int xfs_bmbt_update(struct xfs_btree_cur *, xfs_fileoff_t,
  331. xfs_fsblock_t, xfs_filblks_t, xfs_exntst_t);
  332. #ifdef DEBUG
  333. /*
  334. * Get the data from the pointed-to record.
  335. */
  336. extern int xfs_bmbt_get_rec(struct xfs_btree_cur *, xfs_fileoff_t *,
  337. xfs_fsblock_t *, xfs_filblks_t *,
  338. xfs_exntst_t *, int *);
  339. #endif
  340. /*
  341. * Search an extent list for the extent which includes block
  342. * bno.
  343. */
  344. xfs_bmbt_rec_t *xfs_bmap_do_search_extents(xfs_bmbt_rec_t *,
  345. xfs_extnum_t, xfs_extnum_t, xfs_fileoff_t, int *,
  346. xfs_extnum_t *, xfs_bmbt_irec_t *, xfs_bmbt_irec_t *);
  347. #endif /* __KERNEL__ */
  348. #endif /* __XFS_BMAP_BTREE_H__ */