[thirdparty/xfsprogs-dev.git] / include / xfs_da_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_DA_BTREE_H__
#define	__XFS_DA_BTREE_H__

struct xfs_buf;
struct xfs_bmap_free;
struct xfs_inode;
struct xfs_mount;
struct xfs_trans;
struct zone;

/*========================================================================
 * Directory Structure when greater than XFS_LBSIZE(mp) bytes.
 *========================================================================*/

/*
 * This structure is common to both leaf nodes and non-leaf nodes in the Btree.
 *
 * Is is used to manage a doubly linked list of all blocks at the same
 * level in the Btree, and to identify which type of block this is.
 */
#define XFS_DA_NODE_MAGIC	0xfebe	/* magic number: non-leaf blocks */
#define XFS_DIR_LEAF_MAGIC	0xfeeb	/* magic number: directory leaf blks */
#define XFS_ATTR_LEAF_MAGIC	0xfbee	/* magic number: attribute leaf blks */
#define	XFS_DIR2_LEAF1_MAGIC	0xd2f1	/* magic number: v2 dirlf single blks */
#define	XFS_DIR2_LEAFN_MAGIC	0xd2ff	/* magic number: v2 dirlf multi blks */

#define	XFS_DIRX_LEAF_MAGIC(mp)	\
	(XFS_DIR_IS_V1(mp) ? XFS_DIR_LEAF_MAGIC : XFS_DIR2_LEAFN_MAGIC)

typedef struct xfs_da_blkinfo {
	xfs_dablk_t forw;			/* previous block in list */
	xfs_dablk_t back;			/* following block in list */
	__uint16_t magic;			/* validity check on block */
	__uint16_t pad;				/* unused */
} xfs_da_blkinfo_t;

/*
 * This is the structure of the root and intermediate nodes in the Btree.
 * The leaf nodes are defined above.
 *
 * Entries are not packed.
 *
 * Since we have duplicate keys, use a binary search but always follow
 * all match in the block, not just the first match found.
 */
#define	XFS_DA_NODE_MAXDEPTH	5	/* max depth of Btree */

typedef struct xfs_da_intnode {
	struct xfs_da_node_hdr {	/* constant-structure header block */
		xfs_da_blkinfo_t info;	/* block type, links, etc. */
		__uint16_t count;	/* count of active entries */
		__uint16_t level;	/* level above leaves (leaf == 0) */
	} hdr;
	struct xfs_da_node_entry {
		xfs_dahash_t hashval;	/* hash value for this descendant */
		xfs_dablk_t before;	/* Btree block before this key */
	} btree[1];			/* variable sized array of keys */
} xfs_da_intnode_t;
typedef struct xfs_da_node_hdr xfs_da_node_hdr_t;
typedef struct xfs_da_node_entry xfs_da_node_entry_t;

#define XFS_DA_MAXHASH	((xfs_dahash_t)-1) /* largest valid hash value */

#define	XFS_LBSIZE(mp)	(mp)->m_sb.sb_blocksize
#define	XFS_LBLOG(mp)	(mp)->m_sb.sb_blocklog

#define	XFS_DA_MAKE_BNOENTRY(mp,bno,entry)	\
	(((bno) << (mp)->m_dircook_elog) | (entry))
#define	XFS_DA_MAKE_COOKIE(mp,bno,entry,hash)	\
	(((xfs_off_t)XFS_DA_MAKE_BNOENTRY(mp, bno, entry) << 32) | (hash))
#define	XFS_DA_COOKIE_HASH(mp,cookie)		((xfs_dahash_t)cookie)
#define	XFS_DA_COOKIE_BNO(mp,cookie)		\
	((((xfs_off_t)(cookie) >> 31) == -1LL ? \
		(xfs_dablk_t)0 : \
		(xfs_dablk_t)((xfs_off_t)(cookie) >> \
				((mp)->m_dircook_elog + 32))))
#define	XFS_DA_COOKIE_ENTRY(mp,cookie)		\
	((((xfs_off_t)(cookie) >> 31) == -1LL ?	\
		(xfs_dablk_t)0 : \
		(xfs_dablk_t)(((xfs_off_t)(cookie) >> 32) & \
				((1 << (mp)->m_dircook_elog) - 1))))


/*========================================================================
 * Btree searching and modification structure definitions.
 *========================================================================*/

/*
 * Structure to ease passing around component names.
 */
typedef struct xfs_da_args {
	const uchar_t	*name;		/* string (maybe not NULL terminated) */
	int		namelen;	/* length of string (maybe no NULL) */
	uchar_t		*value;		/* set of bytes (maybe contain NULLs) */
	int		valuelen;	/* length of value */
	int		flags;		/* argument flags (eg: ATTR_NOCREATE) */
	xfs_dahash_t	hashval;	/* hash value of name */
	xfs_ino_t	inumber;	/* input/output inode number */
	struct xfs_inode *dp;		/* directory inode to manipulate */
	xfs_fsblock_t	*firstblock;	/* ptr to firstblock for bmap calls */
	struct xfs_bmap_free *flist;	/* ptr to freelist for bmap_finish */
	struct xfs_trans *trans;	/* current trans (changes over time) */
	xfs_extlen_t	total;		/* total blocks needed, for 1st bmap */
	int		whichfork;	/* data or attribute fork */
	xfs_dablk_t	blkno;		/* blkno of attr leaf of interest */
	int		index;		/* index of attr of interest in blk */
	xfs_dablk_t	rmtblkno;	/* remote attr value starting blkno */
	int		rmtblkcnt;	/* remote attr value block count */
	xfs_dablk_t	blkno2;		/* blkno of 2nd attr leaf of interest */
	int		index2;		/* index of 2nd attr in blk */
	xfs_dablk_t	rmtblkno2;	/* remote attr value starting blkno */
	int		rmtblkcnt2;	/* remote attr value block count */
	unsigned char	justcheck;	/* T/F: check for ok with no space */
	unsigned char	rename;		/* T/F: this is an atomic rename op */
	unsigned char	addname;	/* T/F: this is an add operation */
	unsigned char	oknoent;	/* T/F: ok to return ENOENT, else die */
} xfs_da_args_t;

/*
 * Structure to describe buffer(s) for a block.
 * This is needed in the directory version 2 format case, when
 * multiple non-contiguous fsblocks might be needed to cover one
 * logical directory block.
 * If the buffer count is 1 then the data pointer points to the
 * same place as the b_addr field for the buffer, else to kmem_alloced memory.
 */
typedef struct xfs_dabuf {
	int		nbuf;		/* number of buffer pointers present */
	short		dirty;		/* data needs to be copied back */
	short		bbcount;	/* how large is data in bbs */
	void		*data;		/* pointer for buffers' data */
#ifdef XFS_DABUF_DEBUG
	inst_t		*ra;		/* return address of caller to make */
	struct xfs_dabuf *next;		/* next in global chain */
	struct xfs_dabuf *prev;		/* previous in global chain */
	struct xfs_buftarg *target;	/* device for buffer */
	xfs_daddr_t	blkno;		/* daddr first in bps[0] */
#endif
	struct xfs_buf	*bps[1];	/* actually nbuf of these */
} xfs_dabuf_t;
#define	XFS_DA_BUF_SIZE(n)	\
	(sizeof(xfs_dabuf_t) + sizeof(struct xfs_buf *) * ((n) - 1))

#ifdef XFS_DABUF_DEBUG
extern xfs_dabuf_t	*xfs_dabuf_global_list;
#endif

/*
 * Storage for holding state during Btree searches and split/join ops.
 *
 * Only need space for 5 intermediate nodes.  With a minimum of 62-way
 * fanout to the Btree, we can support over 900 million directory blocks,
 * which is slightly more than enough.
 */
typedef struct xfs_da_state_blk {
	xfs_dabuf_t	*bp;		/* buffer containing block */
	xfs_dablk_t	blkno;		/* filesystem blkno of buffer */
	xfs_daddr_t	disk_blkno;	/* on-disk blkno (in BBs) of buffer */
	int		index;		/* relevant index into block */
	xfs_dahash_t	hashval;	/* last hash value in block */
	int		magic;		/* blk's magic number, ie: blk type */
} xfs_da_state_blk_t;

typedef struct xfs_da_state_path {
	int			active;		/* number of active levels */
	xfs_da_state_blk_t	blk[XFS_DA_NODE_MAXDEPTH];
} xfs_da_state_path_t;

typedef struct xfs_da_state {
	xfs_da_args_t		*args;		/* filename arguments */
	struct xfs_mount	*mp;		/* filesystem mount point */
	unsigned int		blocksize;	/* logical block size */
	unsigned int		node_ents;	/* how many entries in danode */
	xfs_da_state_path_t	path;		/* search/split paths */
	xfs_da_state_path_t	altpath;	/* alternate path for join */
	unsigned char		inleaf;		/* insert into 1->lf, 0->splf */
	unsigned char		extravalid;	/* T/F: extrablk is in use */
	unsigned char		extraafter;	/* T/F: extrablk is after new */
	xfs_da_state_blk_t	extrablk;	/* for double-splits on leafs */
						/* for dirv2 extrablk is data */
} xfs_da_state_t;

/*
 * Utility macros to aid in logging changed structure fields.
 */
#define XFS_DA_LOGOFF(BASE, ADDR)	((char *)(ADDR) - (char *)(BASE))
#define XFS_DA_LOGRANGE(BASE, ADDR, SIZE)	\
		(uint)(XFS_DA_LOGOFF(BASE, ADDR)), \
		(uint)(XFS_DA_LOGOFF(BASE, ADDR)+(SIZE)-1)


#ifdef __KERNEL__
/*========================================================================
 * Function prototypes for the kernel.
 *========================================================================*/

/*
 * Routines used for growing the Btree.
 */
int	xfs_da_node_create(xfs_da_args_t *args, xfs_dablk_t blkno, int level,
					 xfs_dabuf_t **bpp, int whichfork);
int	xfs_da_split(xfs_da_state_t *state);

/*
 * Routines used for shrinking the Btree.
 */
int	xfs_da_join(xfs_da_state_t *state);
void	xfs_da_fixhashpath(xfs_da_state_t *state,
					  xfs_da_state_path_t *path_to_to_fix);

/*
 * Routines used for finding things in the Btree.
 */
int	xfs_da_node_lookup_int(xfs_da_state_t *state, int *result);
int	xfs_da_path_shift(xfs_da_state_t *state, xfs_da_state_path_t *path,
					 int forward, int release, int *result);
/*
 * Utility routines.
 */
int	xfs_da_blk_link(xfs_da_state_t *state, xfs_da_state_blk_t *old_blk,
				       xfs_da_state_blk_t *new_blk);

/*
 * Utility routines.
 */
int	xfs_da_grow_inode(xfs_da_args_t *args, xfs_dablk_t *new_blkno);
int	xfs_da_get_buf(struct xfs_trans *trans, struct xfs_inode *dp,
			      xfs_dablk_t bno, xfs_daddr_t mappedbno,
			      xfs_dabuf_t **bp, int whichfork);
int	xfs_da_read_buf(struct xfs_trans *trans, struct xfs_inode *dp,
			       xfs_dablk_t bno, xfs_daddr_t mappedbno,
			       xfs_dabuf_t **bpp, int whichfork);
xfs_daddr_t	xfs_da_reada_buf(struct xfs_trans *trans, struct xfs_inode *dp,
			xfs_dablk_t bno, int whichfork);
int	xfs_da_shrink_inode(xfs_da_args_t *args, xfs_dablk_t dead_blkno,
					  xfs_dabuf_t *dead_buf);

uint xfs_da_hashname(const uchar_t *name_string, int name_length);
uint xfs_da_log2_roundup(uint i);
xfs_da_state_t *xfs_da_state_alloc(void);
void xfs_da_state_free(xfs_da_state_t *state);

void xfs_da_buf_done(xfs_dabuf_t *dabuf);
void xfs_da_log_buf(struct xfs_trans *tp, xfs_dabuf_t *dabuf, uint first,
			   uint last);
void xfs_da_brelse(struct xfs_trans *tp, xfs_dabuf_t *dabuf);
void xfs_da_binval(struct xfs_trans *tp, xfs_dabuf_t *dabuf);
xfs_daddr_t xfs_da_blkno(xfs_dabuf_t *dabuf);

extern struct kmem_zone *xfs_da_state_zone;
#endif	/* __KERNEL__ */

#endif	/* __XFS_DA_BTREE_H__ */
Commit	Line	Data
2bd0ea18	1	/*
f302e9e4 NS	2	* Copyright (c) 2000,2002,2005 Silicon Graphics, Inc.
f302e9e4 NS	3	* All Rights Reserved.
5000d01d	4	*
f302e9e4 NS	5	* This program is free software; you can redistribute it and/or
f302e9e4 NS	6	* modify it under the terms of the GNU General Public License as
2bd0ea18	7	* published by the Free Software Foundation.
5000d01d	8	*
f302e9e4 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.
5000d01d	13	*
f302e9e4 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
2bd0ea18 NS	17	*/
2bd0ea18 NS	18	#ifndef __XFS_DA_BTREE_H__
dfc130f3	19	#define __XFS_DA_BTREE_H__
2bd0ea18 NS	20
	21	struct xfs_buf;
	22	struct xfs_bmap_free;
	23	struct xfs_inode;
	24	struct xfs_mount;
	25	struct xfs_trans;
	26	struct zone;
	27
	28	/*========================================================================
	29	* Directory Structure when greater than XFS_LBSIZE(mp) bytes.
	30	========================================================================/
	31
	32	/*
	33	* This structure is common to both leaf nodes and non-leaf nodes in the Btree.
	34	*
	35	* Is is used to manage a doubly linked list of all blocks at the same
	36	* level in the Btree, and to identify which type of block this is.
	37	*/
	38	#define XFS_DA_NODE_MAGIC 0xfebe /* magic number: non-leaf blocks */
	39	#define XFS_DIR_LEAF_MAGIC 0xfeeb /* magic number: directory leaf blks */
	40	#define XFS_ATTR_LEAF_MAGIC 0xfbee /* magic number: attribute leaf blks */
dfc130f3 RC	41	#define XFS_DIR2_LEAF1_MAGIC 0xd2f1 /* magic number: v2 dirlf single blks */
dfc130f3 RC	42	#define XFS_DIR2_LEAFN_MAGIC 0xd2ff /* magic number: v2 dirlf multi blks */
2bd0ea18	43
dfc130f3	44	#define XFS_DIRX_LEAF_MAGIC(mp) \
2bd0ea18 NS	45	(XFS_DIR_IS_V1(mp) ? XFS_DIR_LEAF_MAGIC : XFS_DIR2_LEAFN_MAGIC)
	46
	47	typedef struct xfs_da_blkinfo {
	48	xfs_dablk_t forw; /* previous block in list */
	49	xfs_dablk_t back; /* following block in list */
	50	__uint16_t magic; /* validity check on block */
	51	__uint16_t pad; /* unused */
	52	} xfs_da_blkinfo_t;
	53
	54	/*
	55	* This is the structure of the root and intermediate nodes in the Btree.
	56	* The leaf nodes are defined above.
	57	*
	58	* Entries are not packed.
	59	*
	60	* Since we have duplicate keys, use a binary search but always follow
	61	* all match in the block, not just the first match found.
	62	*/
dfc130f3	63	#define XFS_DA_NODE_MAXDEPTH 5 /* max depth of Btree */
2bd0ea18 NS	64
	65	typedef struct xfs_da_intnode {
	66	struct xfs_da_node_hdr { /* constant-structure header block */
	67	xfs_da_blkinfo_t info; /* block type, links, etc. */
	68	__uint16_t count; /* count of active entries */
	69	__uint16_t level; /* level above leaves (leaf == 0) */
	70	} hdr;
	71	struct xfs_da_node_entry {
	72	xfs_dahash_t hashval; /* hash value for this descendant */
	73	xfs_dablk_t before; /* Btree block before this key */
	74	} btree[1]; /* variable sized array of keys */
	75	} xfs_da_intnode_t;
	76	typedef struct xfs_da_node_hdr xfs_da_node_hdr_t;
	77	typedef struct xfs_da_node_entry xfs_da_node_entry_t;
	78
5000d01d	79	#define XFS_DA_MAXHASH ((xfs_dahash_t)-1) /* largest valid hash value */
2bd0ea18	80
f302e9e4 NS	81	#define XFS_LBSIZE(mp) (mp)->m_sb.sb_blocksize
f302e9e4 NS	82	#define XFS_LBLOG(mp) (mp)->m_sb.sb_blocklog
2bd0ea18	83
dfc130f3	84	#define XFS_DA_MAKE_BNOENTRY(mp,bno,entry) \
2bd0ea18	85	(((bno) << (mp)->m_dircook_elog) \| (entry))
dfc130f3	86	#define XFS_DA_MAKE_COOKIE(mp,bno,entry,hash) \
2bd0ea18	87	(((xfs_off_t)XFS_DA_MAKE_BNOENTRY(mp, bno, entry) << 32) \| (hash))
f302e9e4 NS	88	#define XFS_DA_COOKIE_HASH(mp,cookie) ((xfs_dahash_t)cookie)
	89	#define XFS_DA_COOKIE_BNO(mp,cookie) \
	90	((((xfs_off_t)(cookie) >> 31) == -1LL ? \
2bd0ea18	91	(xfs_dablk_t)0 : \
f302e9e4 NS	92	(xfs_dablk_t)((xfs_off_t)(cookie) >> \
	93	((mp)->m_dircook_elog + 32))))
	94	#define XFS_DA_COOKIE_ENTRY(mp,cookie) \
	95	((((xfs_off_t)(cookie) >> 31) == -1LL ? \
2bd0ea18 NS	96	(xfs_dablk_t)0 : \
2bd0ea18 NS	97	(xfs_dablk_t)(((xfs_off_t)(cookie) >> 32) & \
f302e9e4	98	((1 << (mp)->m_dircook_elog) - 1))))
2bd0ea18 NS	99
	100
	101	/*========================================================================
	102	* Btree searching and modification structure definitions.
	103	========================================================================/
	104
	105	/*
	106	* Structure to ease passing around component names.
	107	*/
	108	typedef struct xfs_da_args {
6239071d	109	const uchar_t name; / string (maybe not NULL terminated) */
2bd0ea18	110	int namelen; /* length of string (maybe no NULL) */
43a8fc1e	111	uchar_t value; / set of bytes (maybe contain NULLs) */
2bd0ea18 NS	112	int valuelen; /* length of value */
	113	int flags; /* argument flags (eg: ATTR_NOCREATE) */
	114	xfs_dahash_t hashval; /* hash value of name */
	115	xfs_ino_t inumber; /* input/output inode number */
	116	struct xfs_inode dp; / directory inode to manipulate */
	117	xfs_fsblock_t firstblock; / ptr to firstblock for bmap calls */
	118	struct xfs_bmap_free flist; / ptr to freelist for bmap_finish */
	119	struct xfs_trans trans; / current trans (changes over time) */
	120	xfs_extlen_t total; /* total blocks needed, for 1st bmap */
	121	int whichfork; /* data or attribute fork */
	122	xfs_dablk_t blkno; /* blkno of attr leaf of interest */
	123	int index; /* index of attr of interest in blk */
	124	xfs_dablk_t rmtblkno; /* remote attr value starting blkno */
	125	int rmtblkcnt; /* remote attr value block count */
2bd0ea18 NS	126	xfs_dablk_t blkno2; /* blkno of 2nd attr leaf of interest */
	127	int index2; /* index of 2nd attr in blk */
	128	xfs_dablk_t rmtblkno2; /* remote attr value starting blkno */
	129	int rmtblkcnt2; /* remote attr value block count */
32a82561 NS	130	unsigned char justcheck; /* T/F: check for ok with no space */
	131	unsigned char rename; /* T/F: this is an atomic rename op */
	132	unsigned char addname; /* T/F: this is an add operation */
	133	unsigned char oknoent; /* T/F: ok to return ENOENT, else die */
2bd0ea18 NS	134	} xfs_da_args_t;
	135
	136	/*
	137	* Structure to describe buffer(s) for a block.
5000d01d	138	* This is needed in the directory version 2 format case, when
2bd0ea18 NS	139	* multiple non-contiguous fsblocks might be needed to cover one
	140	* logical directory block.
	141	* If the buffer count is 1 then the data pointer points to the
	142	* same place as the b_addr field for the buffer, else to kmem_alloced memory.
	143	*/
	144	typedef struct xfs_dabuf {
	145	int nbuf; /* number of buffer pointers present */
	146	short dirty; /* data needs to be copied back */
	147	short bbcount; /* how large is data in bbs */
	148	void data; / pointer for buffers' data */
	149	#ifdef XFS_DABUF_DEBUG
	150	inst_t ra; / return address of caller to make */
	151	struct xfs_dabuf next; / next in global chain */
	152	struct xfs_dabuf prev; / previous in global chain */
23aab3f9	153	struct xfs_buftarg target; / device for buffer */
9911e5dc	154	xfs_daddr_t blkno; /* daddr first in bps[0] */
2bd0ea18 NS	155	#endif
	156	struct xfs_buf bps[1]; / actually nbuf of these */
	157	} xfs_dabuf_t;
dfc130f3	158	#define XFS_DA_BUF_SIZE(n) \
2bd0ea18 NS	159	(sizeof(xfs_dabuf_t) + sizeof(struct xfs_buf ) ((n) - 1))
	160
	161	#ifdef XFS_DABUF_DEBUG
	162	extern xfs_dabuf_t *xfs_dabuf_global_list;
	163	#endif
	164
	165	/*
	166	* Storage for holding state during Btree searches and split/join ops.
	167	*
	168	* Only need space for 5 intermediate nodes. With a minimum of 62-way
	169	* fanout to the Btree, we can support over 900 million directory blocks,
	170	* which is slightly more than enough.
	171	*/
	172	typedef struct xfs_da_state_blk {
	173	xfs_dabuf_t bp; / buffer containing block */
	174	xfs_dablk_t blkno; /* filesystem blkno of buffer */
6bef826c	175	xfs_daddr_t disk_blkno; /* on-disk blkno (in BBs) of buffer */
2bd0ea18 NS	176	int index; /* relevant index into block */
	177	xfs_dahash_t hashval; /* last hash value in block */
	178	int magic; /* blk's magic number, ie: blk type */
	179	} xfs_da_state_blk_t;
	180
	181	typedef struct xfs_da_state_path {
	182	int active; /* number of active levels */
	183	xfs_da_state_blk_t blk[XFS_DA_NODE_MAXDEPTH];
	184	} xfs_da_state_path_t;
	185
	186	typedef struct xfs_da_state {
	187	xfs_da_args_t args; / filename arguments */
	188	struct xfs_mount mp; / filesystem mount point */
6bef826c NS	189	unsigned int blocksize; /* logical block size */
6bef826c NS	190	unsigned int node_ents; /* how many entries in danode */
2bd0ea18 NS	191	xfs_da_state_path_t path; /* search/split paths */
2bd0ea18 NS	192	xfs_da_state_path_t altpath; /* alternate path for join */
32a82561 NS	193	unsigned char inleaf; /* insert into 1->lf, 0->splf */
	194	unsigned char extravalid; /* T/F: extrablk is in use */
	195	unsigned char extraafter; /* T/F: extrablk is after new */
2bd0ea18 NS	196	xfs_da_state_blk_t extrablk; /* for double-splits on leafs */
	197	/* for dirv2 extrablk is data */
	198	} xfs_da_state_t;
	199
	200	/*
	201	* Utility macros to aid in logging changed structure fields.
	202	*/
	203	#define XFS_DA_LOGOFF(BASE, ADDR) ((char )(ADDR) - (char )(BASE))
	204	#define XFS_DA_LOGRANGE(BASE, ADDR, SIZE) \
	205	(uint)(XFS_DA_LOGOFF(BASE, ADDR)), \
	206	(uint)(XFS_DA_LOGOFF(BASE, ADDR)+(SIZE)-1)
	207
836f654f NS	208
836f654f NS	209	#ifdef __KERNEL__
2bd0ea18 NS	210	/*========================================================================
	211	* Function prototypes for the kernel.
	212	========================================================================/
	213
	214	/*
	215	* Routines used for growing the Btree.
	216	*/
	217	int xfs_da_node_create(xfs_da_args_t *args, xfs_dablk_t blkno, int level,
	218	xfs_dabuf_t **bpp, int whichfork);
	219	int xfs_da_split(xfs_da_state_t *state);
	220
	221	/*
	222	* Routines used for shrinking the Btree.
	223	*/
	224	int xfs_da_join(xfs_da_state_t *state);
	225	void xfs_da_fixhashpath(xfs_da_state_t *state,
	226	xfs_da_state_path_t *path_to_to_fix);
	227
	228	/*
	229	* Routines used for finding things in the Btree.
	230	*/
	231	int xfs_da_node_lookup_int(xfs_da_state_t state, int result);
	232	int xfs_da_path_shift(xfs_da_state_t state, xfs_da_state_path_t path,
	233	int forward, int release, int *result);
	234	/*
	235	* Utility routines.
	236	*/
2bd0ea18 NS	237	int xfs_da_blk_link(xfs_da_state_t state, xfs_da_state_blk_t old_blk,
	238	xfs_da_state_blk_t *new_blk);
	239
	240	/*
	241	* Utility routines.
	242	*/
	243	int xfs_da_grow_inode(xfs_da_args_t args, xfs_dablk_t new_blkno);
	244	int xfs_da_get_buf(struct xfs_trans trans, struct xfs_inode dp,
	245	xfs_dablk_t bno, xfs_daddr_t mappedbno,
	246	xfs_dabuf_t **bp, int whichfork);
	247	int xfs_da_read_buf(struct xfs_trans trans, struct xfs_inode dp,
	248	xfs_dablk_t bno, xfs_daddr_t mappedbno,
	249	xfs_dabuf_t **bpp, int whichfork);
	250	xfs_daddr_t xfs_da_reada_buf(struct xfs_trans trans, struct xfs_inode dp,
	251	xfs_dablk_t bno, int whichfork);
	252	int xfs_da_shrink_inode(xfs_da_args_t *args, xfs_dablk_t dead_blkno,
	253	xfs_dabuf_t *dead_buf);
	254
80ce5460	255	uint xfs_da_hashname(const uchar_t *name_string, int name_length);
2bd0ea18 NS	256	uint xfs_da_log2_roundup(uint i);
	257	xfs_da_state_t *xfs_da_state_alloc(void);
	258	void xfs_da_state_free(xfs_da_state_t *state);
2bd0ea18 NS	259
	260	void xfs_da_buf_done(xfs_dabuf_t *dabuf);
	261	void xfs_da_log_buf(struct xfs_trans tp, xfs_dabuf_t dabuf, uint first,
	262	uint last);
	263	void xfs_da_brelse(struct xfs_trans tp, xfs_dabuf_t dabuf);
	264	void xfs_da_binval(struct xfs_trans tp, xfs_dabuf_t dabuf);
	265	xfs_daddr_t xfs_da_blkno(xfs_dabuf_t *dabuf);
	266
836f654f NS	267	extern struct kmem_zone *xfs_da_state_zone;
836f654f NS	268	#endif /* __KERNEL__ */
2bd0ea18 NS	269
2bd0ea18 NS	270	#endif /* __XFS_DA_BTREE_H__ */