[net-next-2.6.git] / fs / xfs / xfs_bmap_btree.h

/*
 * Copyright (c) 2000,2002-2005 Silicon Graphics, Inc.
 * All Rights Reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it would be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write the Free Software Foundation,
 * Inc.,  51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 */
#ifndef __XFS_BMAP_BTREE_H__
#define __XFS_BMAP_BTREE_H__

#define XFS_BMAP_MAGIC	0x424d4150	/* 'BMAP' */

struct xfs_btree_cur;
struct xfs_btree_lblock;
struct xfs_mount;
struct xfs_inode;

/*
 * Bmap root header, on-disk form only.
 */
typedef struct xfs_bmdr_block
{
	__uint16_t	bb_level;	/* 0 is a leaf */
	__uint16_t	bb_numrecs;	/* current # of data records */
} xfs_bmdr_block_t;

/*
 * Bmap btree record and extent descriptor.
 * For 32-bit kernels,
 *  l0:31 is an extent flag (value 1 indicates non-normal).
 *  l0:0-30 and l1:9-31 are startoff.
 *  l1:0-8, l2:0-31, and l3:21-31 are startblock.
 *  l3:0-20 are blockcount.
 * For 64-bit kernels,
 *  l0:63 is an extent flag (value 1 indicates non-normal).
 *  l0:9-62 are startoff.
 *  l0:0-8 and l1:21-63 are startblock.
 *  l1:0-20 are blockcount.
 */

#ifndef XFS_NATIVE_HOST

#define BMBT_TOTAL_BITLEN	128	/* 128 bits, 16 bytes */
#define BMBT_EXNTFLAG_BITOFF	0
#define BMBT_EXNTFLAG_BITLEN	1
#define BMBT_STARTOFF_BITOFF	(BMBT_EXNTFLAG_BITOFF + BMBT_EXNTFLAG_BITLEN)
#define BMBT_STARTOFF_BITLEN	54
#define BMBT_STARTBLOCK_BITOFF	(BMBT_STARTOFF_BITOFF + BMBT_STARTOFF_BITLEN)
#define BMBT_STARTBLOCK_BITLEN	52
#define BMBT_BLOCKCOUNT_BITOFF	\
	(BMBT_STARTBLOCK_BITOFF + BMBT_STARTBLOCK_BITLEN)
#define BMBT_BLOCKCOUNT_BITLEN	(BMBT_TOTAL_BITLEN - BMBT_BLOCKCOUNT_BITOFF)

#else

#define BMBT_TOTAL_BITLEN	128	/* 128 bits, 16 bytes */
#define BMBT_EXNTFLAG_BITOFF	63
#define BMBT_EXNTFLAG_BITLEN	1
#define BMBT_STARTOFF_BITOFF	(BMBT_EXNTFLAG_BITOFF - BMBT_STARTOFF_BITLEN)
#define BMBT_STARTOFF_BITLEN	54
#define BMBT_STARTBLOCK_BITOFF	85 /* 128 - 43 (other 9 is in first word) */
#define BMBT_STARTBLOCK_BITLEN	52
#define BMBT_BLOCKCOUNT_BITOFF	64 /* Start of second 64 bit container */
#define BMBT_BLOCKCOUNT_BITLEN	21

#endif /* XFS_NATIVE_HOST */


#define BMBT_USE_64	1

typedef struct xfs_bmbt_rec_32
{
	__uint32_t		l0, l1, l2, l3;
} xfs_bmbt_rec_32_t;
typedef struct xfs_bmbt_rec_64
{
	__uint64_t		l0, l1;
} xfs_bmbt_rec_64_t;

typedef __uint64_t	xfs_bmbt_rec_base_t;	/* use this for casts */
typedef xfs_bmbt_rec_64_t xfs_bmbt_rec_t, xfs_bmdr_rec_t;

/*
 * Values and macros for delayed-allocation startblock fields.
 */
#define STARTBLOCKVALBITS	17
#define STARTBLOCKMASKBITS	(15 + XFS_BIG_BLKNOS * 20)
#define DSTARTBLOCKMASKBITS	(15 + 20)
#define STARTBLOCKMASK		\
	(((((xfs_fsblock_t)1) << STARTBLOCKMASKBITS) - 1) << STARTBLOCKVALBITS)
#define DSTARTBLOCKMASK		\
	(((((xfs_dfsbno_t)1) << DSTARTBLOCKMASKBITS) - 1) << STARTBLOCKVALBITS)

#define ISNULLSTARTBLOCK(x)	isnullstartblock(x)
static inline int isnullstartblock(xfs_fsblock_t x)
{
	return ((x) & STARTBLOCKMASK) == STARTBLOCKMASK;
}

#define ISNULLDSTARTBLOCK(x)	isnulldstartblock(x)
static inline int isnulldstartblock(xfs_dfsbno_t x)
{
	return ((x) & DSTARTBLOCKMASK) == DSTARTBLOCKMASK;
}

#define NULLSTARTBLOCK(k)	nullstartblock(k)
static inline xfs_fsblock_t nullstartblock(int k)
{
	ASSERT(k < (1 << STARTBLOCKVALBITS));
	return STARTBLOCKMASK | (k);
}

#define STARTBLOCKVAL(x)	startblockval(x)
static inline xfs_filblks_t startblockval(xfs_fsblock_t x)
{
	return (xfs_filblks_t)((x) & ~STARTBLOCKMASK);
}

/*
 * Possible extent formats.
 */
typedef enum {
	XFS_EXTFMT_NOSTATE = 0,
	XFS_EXTFMT_HASSTATE
} xfs_exntfmt_t;

/*
 * Possible extent states.
 */
typedef enum {
	XFS_EXT_NORM, XFS_EXT_UNWRITTEN,
	XFS_EXT_DMAPI_OFFLINE, XFS_EXT_INVALID
} xfs_exntst_t;

/*
 * Extent state and extent format macros.
 */
#define XFS_EXTFMT_INODE(x)	\
	(XFS_SB_VERSION_HASEXTFLGBIT(&((x)->i_mount->m_sb)) ? \
		XFS_EXTFMT_HASSTATE : XFS_EXTFMT_NOSTATE)
#define ISUNWRITTEN(x)	((x)->br_state == XFS_EXT_UNWRITTEN)

/*
 * Incore version of above.
 */
typedef struct xfs_bmbt_irec
{
	xfs_fileoff_t	br_startoff;	/* starting file offset */
	xfs_fsblock_t	br_startblock;	/* starting block number */
	xfs_filblks_t	br_blockcount;	/* number of blocks */
	xfs_exntst_t	br_state;	/* extent state */
} xfs_bmbt_irec_t;

/*
 * Key structure for non-leaf levels of the tree.
 */
typedef struct xfs_bmbt_key
{
	xfs_dfiloff_t	br_startoff;	/* starting file offset */
} xfs_bmbt_key_t, xfs_bmdr_key_t;

typedef xfs_dfsbno_t xfs_bmbt_ptr_t, xfs_bmdr_ptr_t;	/* btree pointer type */
					/* btree block header type */
typedef struct xfs_btree_lblock xfs_bmbt_block_t;

#define XFS_BUF_TO_BMBT_BLOCK(bp)	((xfs_bmbt_block_t *)XFS_BUF_PTR(bp))

#define XFS_BMAP_IBLOCK_SIZE(lev,cur)	(1 << (cur)->bc_blocklog)
#define XFS_BMAP_RBLOCK_DSIZE(lev,cur)	((cur)->bc_private.b.forksize)
#define XFS_BMAP_RBLOCK_ISIZE(lev,cur)	\
	((int)XFS_IFORK_PTR((cur)->bc_private.b.ip, \
		    (cur)->bc_private.b.whichfork)->if_broot_bytes)

#define XFS_BMAP_BLOCK_DSIZE(lev,cur)	\
	(((lev) == (cur)->bc_nlevels - 1 ? \
		XFS_BMAP_RBLOCK_DSIZE(lev,cur) : XFS_BMAP_IBLOCK_SIZE(lev,cur)))
#define XFS_BMAP_BLOCK_ISIZE(lev,cur)	\
	(((lev) == (cur)->bc_nlevels - 1 ? \
		XFS_BMAP_RBLOCK_ISIZE(lev,cur) : XFS_BMAP_IBLOCK_SIZE(lev,cur)))

#define XFS_BMAP_BLOCK_DMAXRECS(lev,cur) \
	(((lev) == (cur)->bc_nlevels - 1 ? \
		XFS_BTREE_BLOCK_MAXRECS(XFS_BMAP_RBLOCK_DSIZE(lev,cur), \
			xfs_bmdr, (lev) == 0) : \
		((cur)->bc_mp->m_bmap_dmxr[(lev) != 0])))
#define XFS_BMAP_BLOCK_IMAXRECS(lev,cur) \
	(((lev) == (cur)->bc_nlevels - 1 ? \
			XFS_BTREE_BLOCK_MAXRECS(XFS_BMAP_RBLOCK_ISIZE(lev,cur),\
				xfs_bmbt, (lev) == 0) : \
			((cur)->bc_mp->m_bmap_dmxr[(lev) != 0])))

#define XFS_BMAP_BLOCK_DMINRECS(lev,cur) \
	(((lev) == (cur)->bc_nlevels - 1 ? \
			XFS_BTREE_BLOCK_MINRECS(XFS_BMAP_RBLOCK_DSIZE(lev,cur),\
				xfs_bmdr, (lev) == 0) : \
			((cur)->bc_mp->m_bmap_dmnr[(lev) != 0])))
#define XFS_BMAP_BLOCK_IMINRECS(lev,cur) \
	(((lev) == (cur)->bc_nlevels - 1 ? \
			XFS_BTREE_BLOCK_MINRECS(XFS_BMAP_RBLOCK_ISIZE(lev,cur),\
				xfs_bmbt, (lev) == 0) : \
			((cur)->bc_mp->m_bmap_dmnr[(lev) != 0])))

#define XFS_BMAP_REC_DADDR(bb,i,cur)	\
	(XFS_BTREE_REC_ADDR(XFS_BMAP_BLOCK_DSIZE(			\
			INT_GET((bb)->bb_level, ARCH_CONVERT), cur),	\
			xfs_bmbt, bb, i, XFS_BMAP_BLOCK_DMAXRECS(	\
				INT_GET((bb)->bb_level, ARCH_CONVERT), cur)))
#define XFS_BMAP_REC_IADDR(bb,i,cur)	\
	(XFS_BTREE_REC_ADDR(XFS_BMAP_BLOCK_ISIZE(			\
			INT_GET((bb)->bb_level, ARCH_CONVERT), cur),	\
			xfs_bmbt, bb, i, XFS_BMAP_BLOCK_IMAXRECS(	\
				INT_GET((bb)->bb_level, ARCH_CONVERT), cur)))

#define XFS_BMAP_KEY_DADDR(bb,i,cur)	\
	(XFS_BTREE_KEY_ADDR(XFS_BMAP_BLOCK_DSIZE(			\
			INT_GET((bb)->bb_level, ARCH_CONVERT), cur),	\
			xfs_bmbt, bb, i, XFS_BMAP_BLOCK_DMAXRECS(	\
				INT_GET((bb)->bb_level, ARCH_CONVERT), cur)))
#define XFS_BMAP_KEY_IADDR(bb,i,cur)	\
	(XFS_BTREE_KEY_ADDR(XFS_BMAP_BLOCK_ISIZE(			\
			INT_GET((bb)->bb_level, ARCH_CONVERT), cur),	\
			xfs_bmbt, bb, i, XFS_BMAP_BLOCK_IMAXRECS(	\
				INT_GET((bb)->bb_level, ARCH_CONVERT), cur)))

#define XFS_BMAP_PTR_DADDR(bb,i,cur)	\
	(XFS_BTREE_PTR_ADDR(XFS_BMAP_BLOCK_DSIZE(			\
			INT_GET((bb)->bb_level, ARCH_CONVERT), cur),	\
			xfs_bmbt, bb, i, XFS_BMAP_BLOCK_DMAXRECS(	\
				INT_GET((bb)->bb_level, ARCH_CONVERT), cur)))
#define XFS_BMAP_PTR_IADDR(bb,i,cur)	\
	(XFS_BTREE_PTR_ADDR(XFS_BMAP_BLOCK_ISIZE(			\
			INT_GET((bb)->bb_level, ARCH_CONVERT), cur),	\
			xfs_bmbt, bb, i, XFS_BMAP_BLOCK_IMAXRECS(	\
				INT_GET((bb)->bb_level, ARCH_CONVERT), cur)))

/*
 * These are to be used when we know the size of the block and
 * we don't have a cursor.
 */
#define XFS_BMAP_BROOT_REC_ADDR(bb,i,sz) \
	(XFS_BTREE_REC_ADDR(sz,xfs_bmbt,bb,i,XFS_BMAP_BROOT_MAXRECS(sz)))
#define XFS_BMAP_BROOT_KEY_ADDR(bb,i,sz) \
	(XFS_BTREE_KEY_ADDR(sz,xfs_bmbt,bb,i,XFS_BMAP_BROOT_MAXRECS(sz)))
#define XFS_BMAP_BROOT_PTR_ADDR(bb,i,sz) \
	(XFS_BTREE_PTR_ADDR(sz,xfs_bmbt,bb,i,XFS_BMAP_BROOT_MAXRECS(sz)))

#define XFS_BMAP_BROOT_NUMRECS(bb)	INT_GET((bb)->bb_numrecs, ARCH_CONVERT)
#define XFS_BMAP_BROOT_MAXRECS(sz)	XFS_BTREE_BLOCK_MAXRECS(sz,xfs_bmbt,0)

#define XFS_BMAP_BROOT_SPACE_CALC(nrecs) \
	(int)(sizeof(xfs_bmbt_block_t) + \
	       ((nrecs) * (sizeof(xfs_bmbt_key_t) + sizeof(xfs_bmbt_ptr_t))))

#define XFS_BMAP_BROOT_SPACE(bb) \
	(XFS_BMAP_BROOT_SPACE_CALC(INT_GET((bb)->bb_numrecs, ARCH_CONVERT)))
#define XFS_BMDR_SPACE_CALC(nrecs) \
	(int)(sizeof(xfs_bmdr_block_t) + \
	       ((nrecs) * (sizeof(xfs_bmbt_key_t) + sizeof(xfs_bmbt_ptr_t))))

/*
 * Maximum number of bmap btree levels.
 */
#define XFS_BM_MAXLEVELS(mp,w)		((mp)->m_bm_maxlevels[(w)])

#define XFS_BMAP_SANITY_CHECK(mp,bb,level) \
	(INT_GET((bb)->bb_magic, ARCH_CONVERT) == XFS_BMAP_MAGIC && \
	 INT_GET((bb)->bb_level, ARCH_CONVERT) == level && \
	 INT_GET((bb)->bb_numrecs, ARCH_CONVERT) > 0 && \
	 INT_GET((bb)->bb_numrecs, ARCH_CONVERT) <= \
			 (mp)->m_bmap_dmxr[(level) != 0])


#ifdef __KERNEL__

#if defined(XFS_BMBT_TRACE)
/*
 * Trace buffer entry types.
 */
#define XFS_BMBT_KTRACE_ARGBI	1
#define XFS_BMBT_KTRACE_ARGBII	2
#define XFS_BMBT_KTRACE_ARGFFFI 3
#define XFS_BMBT_KTRACE_ARGI	4
#define XFS_BMBT_KTRACE_ARGIFK	5
#define XFS_BMBT_KTRACE_ARGIFR	6
#define XFS_BMBT_KTRACE_ARGIK	7
#define XFS_BMBT_KTRACE_CUR	8

#define XFS_BMBT_TRACE_SIZE	4096	/* size of global trace buffer */
#define XFS_BMBT_KTRACE_SIZE	32	/* size of per-inode trace buffer */
extern ktrace_t	*xfs_bmbt_trace_buf;
#endif

/*
 * Prototypes for xfs_bmap.c to call.
 */
extern void xfs_bmdr_to_bmbt(xfs_bmdr_block_t *, int, xfs_bmbt_block_t *, int);
extern int xfs_bmbt_decrement(struct xfs_btree_cur *, int, int *);
extern int xfs_bmbt_delete(struct xfs_btree_cur *, int *);
extern void xfs_bmbt_get_all(xfs_bmbt_rec_t *r, xfs_bmbt_irec_t *s);
extern xfs_bmbt_block_t *xfs_bmbt_get_block(struct xfs_btree_cur *cur,
						int, struct xfs_buf **bpp);
extern xfs_filblks_t xfs_bmbt_get_blockcount(xfs_bmbt_rec_t *r);
extern xfs_fsblock_t xfs_bmbt_get_startblock(xfs_bmbt_rec_t *r);
extern xfs_fileoff_t xfs_bmbt_get_startoff(xfs_bmbt_rec_t *r);
extern xfs_exntst_t xfs_bmbt_get_state(xfs_bmbt_rec_t *r);

#ifndef XFS_NATIVE_HOST
extern void xfs_bmbt_disk_get_all(xfs_bmbt_rec_t *r, xfs_bmbt_irec_t *s);
extern xfs_exntst_t xfs_bmbt_disk_get_state(xfs_bmbt_rec_t *r);
extern xfs_filblks_t xfs_bmbt_disk_get_blockcount(xfs_bmbt_rec_t *r);
extern xfs_fsblock_t xfs_bmbt_disk_get_startblock(xfs_bmbt_rec_t *r);
extern xfs_fileoff_t xfs_bmbt_disk_get_startoff(xfs_bmbt_rec_t *r);
#else
#define xfs_bmbt_disk_get_all(r, s)	xfs_bmbt_get_all(r, s)
#define xfs_bmbt_disk_get_state(r)	xfs_bmbt_get_state(r)
#define xfs_bmbt_disk_get_blockcount(r)	xfs_bmbt_get_blockcount(r)
#define xfs_bmbt_disk_get_startblock(r)	xfs_bmbt_get_blockcount(r)
#define xfs_bmbt_disk_get_startoff(r)	xfs_bmbt_get_startoff(r)
#endif /* XFS_NATIVE_HOST */

extern int xfs_bmbt_increment(struct xfs_btree_cur *, int, int *);
extern int xfs_bmbt_insert(struct xfs_btree_cur *, int *);
extern void xfs_bmbt_log_block(struct xfs_btree_cur *, struct xfs_buf *, int);
extern void xfs_bmbt_log_recs(struct xfs_btree_cur *, struct xfs_buf *, int,
				int);
extern int xfs_bmbt_lookup_eq(struct xfs_btree_cur *, xfs_fileoff_t,
				xfs_fsblock_t, xfs_filblks_t, int *);
extern int xfs_bmbt_lookup_ge(struct xfs_btree_cur *, xfs_fileoff_t,
				xfs_fsblock_t, xfs_filblks_t, int *);

/*
 * Give the bmap btree a new root block.  Copy the old broot contents
 * down into a real block and make the broot point to it.
 */
extern int xfs_bmbt_newroot(struct xfs_btree_cur *cur, int *lflags, int *stat);

extern void xfs_bmbt_set_all(xfs_bmbt_rec_t *r, xfs_bmbt_irec_t *s);
extern void xfs_bmbt_set_allf(xfs_bmbt_rec_t *r, xfs_fileoff_t o,
			xfs_fsblock_t b, xfs_filblks_t c, xfs_exntst_t v);
extern void xfs_bmbt_set_blockcount(xfs_bmbt_rec_t *r, xfs_filblks_t v);
extern void xfs_bmbt_set_startblock(xfs_bmbt_rec_t *r, xfs_fsblock_t v);
extern void xfs_bmbt_set_startoff(xfs_bmbt_rec_t *r, xfs_fileoff_t v);
extern void xfs_bmbt_set_state(xfs_bmbt_rec_t *r, xfs_exntst_t v);

#ifndef XFS_NATIVE_HOST
extern void xfs_bmbt_disk_set_all(xfs_bmbt_rec_t *r, xfs_bmbt_irec_t *s);
extern void xfs_bmbt_disk_set_allf(xfs_bmbt_rec_t *r, xfs_fileoff_t o,
			xfs_fsblock_t b, xfs_filblks_t c, xfs_exntst_t v);
#else
#define xfs_bmbt_disk_set_all(r, s)		xfs_bmbt_set_all(r, s)
#define xfs_bmbt_disk_set_allf(r, o, b, c, v)	xfs_bmbt_set_allf(r, o, b, c, v)
#endif /* XFS_NATIVE_HOST */

extern void xfs_bmbt_to_bmdr(xfs_bmbt_block_t *, int, xfs_bmdr_block_t *, int);
extern int xfs_bmbt_update(struct xfs_btree_cur *, xfs_fileoff_t,
				xfs_fsblock_t, xfs_filblks_t, xfs_exntst_t);

#ifdef DEBUG
/*
 * Get the data from the pointed-to record.
 */
extern int xfs_bmbt_get_rec(struct xfs_btree_cur *, xfs_fileoff_t *,
				xfs_fsblock_t *, xfs_filblks_t *,
				xfs_exntst_t *, int *);
#endif

/*
 * Search an extent list for the extent which includes block
 * bno.
 */
xfs_bmbt_rec_t *xfs_bmap_do_search_extents(xfs_bmbt_rec_t *,
			xfs_extnum_t, xfs_extnum_t, xfs_fileoff_t, int *,
			xfs_extnum_t *, xfs_bmbt_irec_t *, xfs_bmbt_irec_t *);

#endif	/* __KERNEL__ */

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