[net-next-2.6.git] / fs / xfs / xfs_ialloc_btree.c

/*
 * Copyright (c) 2000-2001,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
 */
#include "xfs.h"
#include "xfs_fs.h"
#include "xfs_types.h"
#include "xfs_bit.h"
#include "xfs_log.h"
#include "xfs_inum.h"
#include "xfs_trans.h"
#include "xfs_sb.h"
#include "xfs_ag.h"
#include "xfs_mount.h"
#include "xfs_bmap_btree.h"
#include "xfs_alloc_btree.h"
#include "xfs_ialloc_btree.h"
#include "xfs_dinode.h"
#include "xfs_inode.h"
#include "xfs_btree.h"
#include "xfs_btree_trace.h"
#include "xfs_ialloc.h"
#include "xfs_alloc.h"
#include "xfs_error.h"


STATIC int
xfs_inobt_get_minrecs(
	struct xfs_btree_cur	*cur,
	int			level)
{
	return cur->bc_mp->m_inobt_mnr[level != 0];
}

STATIC struct xfs_btree_cur *
xfs_inobt_dup_cursor(
	struct xfs_btree_cur	*cur)
{
	return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
			cur->bc_private.a.agbp, cur->bc_private.a.agno);
}

STATIC void
xfs_inobt_set_root(
	struct xfs_btree_cur	*cur,
	union xfs_btree_ptr	*nptr,
	int			inc)	/* level change */
{
	struct xfs_buf		*agbp = cur->bc_private.a.agbp;
	struct xfs_agi		*agi = XFS_BUF_TO_AGI(agbp);

	agi->agi_root = nptr->s;
	be32_add_cpu(&agi->agi_level, inc);
	xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL);
}

STATIC int
xfs_inobt_alloc_block(
	struct xfs_btree_cur	*cur,
	union xfs_btree_ptr	*start,
	union xfs_btree_ptr	*new,
	int			length,
	int			*stat)
{
	xfs_alloc_arg_t		args;		/* block allocation args */
	int			error;		/* error return value */
	xfs_agblock_t		sbno = be32_to_cpu(start->s);

	XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);

	memset(&args, 0, sizeof(args));
	args.tp = cur->bc_tp;
	args.mp = cur->bc_mp;
	args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
	args.minlen = 1;
	args.maxlen = 1;
	args.prod = 1;
	args.type = XFS_ALLOCTYPE_NEAR_BNO;

	error = xfs_alloc_vextent(&args);
	if (error) {
		XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
		return error;
	}
	if (args.fsbno == NULLFSBLOCK) {
		XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
		*stat = 0;
		return 0;
	}
	ASSERT(args.len == 1);
	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);

	new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
	*stat = 1;
	return 0;
}

STATIC int
xfs_inobt_free_block(
	struct xfs_btree_cur	*cur,
	struct xfs_buf		*bp)
{
	xfs_fsblock_t		fsbno;
	int			error;

	fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp));
	error = xfs_free_extent(cur->bc_tp, fsbno, 1);
	if (error)
		return error;

	xfs_trans_binval(cur->bc_tp, bp);
	return error;
}

STATIC int
xfs_inobt_get_maxrecs(
	struct xfs_btree_cur	*cur,
	int			level)
{
	return cur->bc_mp->m_inobt_mxr[level != 0];
}

STATIC void
xfs_inobt_init_key_from_rec(
	union xfs_btree_key	*key,
	union xfs_btree_rec	*rec)
{
	key->inobt.ir_startino = rec->inobt.ir_startino;
}

STATIC void
xfs_inobt_init_rec_from_key(
	union xfs_btree_key	*key,
	union xfs_btree_rec	*rec)
{
	rec->inobt.ir_startino = key->inobt.ir_startino;
}

STATIC void
xfs_inobt_init_rec_from_cur(
	struct xfs_btree_cur	*cur,
	union xfs_btree_rec	*rec)
{
	rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
	rec->inobt.ir_freecount = cpu_to_be32(cur->bc_rec.i.ir_freecount);
	rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
}

/*
 * initial value of ptr for lookup
 */
STATIC void
xfs_inobt_init_ptr_from_cur(
	struct xfs_btree_cur	*cur,
	union xfs_btree_ptr	*ptr)
{
	struct xfs_agi		*agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);

	ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));

	ptr->s = agi->agi_root;
}

STATIC __int64_t
xfs_inobt_key_diff(
	struct xfs_btree_cur	*cur,
	union xfs_btree_key	*key)
{
	return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
			  cur->bc_rec.i.ir_startino;
}

#ifdef DEBUG
STATIC int
xfs_inobt_keys_inorder(
	struct xfs_btree_cur	*cur,
	union xfs_btree_key	*k1,
	union xfs_btree_key	*k2)
{
	return be32_to_cpu(k1->inobt.ir_startino) <
		be32_to_cpu(k2->inobt.ir_startino);
}

STATIC int
xfs_inobt_recs_inorder(
	struct xfs_btree_cur	*cur,
	union xfs_btree_rec	*r1,
	union xfs_btree_rec	*r2)
{
	return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
		be32_to_cpu(r2->inobt.ir_startino);
}
#endif	/* DEBUG */

#ifdef XFS_BTREE_TRACE
ktrace_t	*xfs_inobt_trace_buf;

STATIC void
xfs_inobt_trace_enter(
	struct xfs_btree_cur	*cur,
	const char		*func,
	char			*s,
	int			type,
	int			line,
	__psunsigned_t		a0,
	__psunsigned_t		a1,
	__psunsigned_t		a2,
	__psunsigned_t		a3,
	__psunsigned_t		a4,
	__psunsigned_t		a5,
	__psunsigned_t		a6,
	__psunsigned_t		a7,
	__psunsigned_t		a8,
	__psunsigned_t		a9,
	__psunsigned_t		a10)
{
	ktrace_enter(xfs_inobt_trace_buf, (void *)(__psint_t)type,
		(void *)func, (void *)s, NULL, (void *)cur,
		(void *)a0, (void *)a1, (void *)a2, (void *)a3,
		(void *)a4, (void *)a5, (void *)a6, (void *)a7,
		(void *)a8, (void *)a9, (void *)a10);
}

STATIC void
xfs_inobt_trace_cursor(
	struct xfs_btree_cur	*cur,
	__uint32_t		*s0,
	__uint64_t		*l0,
	__uint64_t		*l1)
{
	*s0 = cur->bc_private.a.agno;
	*l0 = cur->bc_rec.i.ir_startino;
	*l1 = cur->bc_rec.i.ir_free;
}

STATIC void
xfs_inobt_trace_key(
	struct xfs_btree_cur	*cur,
	union xfs_btree_key	*key,
	__uint64_t		*l0,
	__uint64_t		*l1)
{
	*l0 = be32_to_cpu(key->inobt.ir_startino);
	*l1 = 0;
}

STATIC void
xfs_inobt_trace_record(
	struct xfs_btree_cur	*cur,
	union xfs_btree_rec	*rec,
	__uint64_t		*l0,
	__uint64_t		*l1,
	__uint64_t		*l2)
{
	*l0 = be32_to_cpu(rec->inobt.ir_startino);
	*l1 = be32_to_cpu(rec->inobt.ir_freecount);
	*l2 = be64_to_cpu(rec->inobt.ir_free);
}
#endif /* XFS_BTREE_TRACE */

static const struct xfs_btree_ops xfs_inobt_ops = {
	.rec_len		= sizeof(xfs_inobt_rec_t),
	.key_len		= sizeof(xfs_inobt_key_t),

	.dup_cursor		= xfs_inobt_dup_cursor,
	.set_root		= xfs_inobt_set_root,
	.alloc_block		= xfs_inobt_alloc_block,
	.free_block		= xfs_inobt_free_block,
	.get_minrecs		= xfs_inobt_get_minrecs,
	.get_maxrecs		= xfs_inobt_get_maxrecs,
	.init_key_from_rec	= xfs_inobt_init_key_from_rec,
	.init_rec_from_key	= xfs_inobt_init_rec_from_key,
	.init_rec_from_cur	= xfs_inobt_init_rec_from_cur,
	.init_ptr_from_cur	= xfs_inobt_init_ptr_from_cur,
	.key_diff		= xfs_inobt_key_diff,

#ifdef DEBUG
	.keys_inorder		= xfs_inobt_keys_inorder,
	.recs_inorder		= xfs_inobt_recs_inorder,
#endif

#ifdef XFS_BTREE_TRACE
	.trace_enter		= xfs_inobt_trace_enter,
	.trace_cursor		= xfs_inobt_trace_cursor,
	.trace_key		= xfs_inobt_trace_key,
	.trace_record		= xfs_inobt_trace_record,
#endif
};

/*
 * Allocate a new inode btree cursor.
 */
struct xfs_btree_cur *				/* new inode btree cursor */
xfs_inobt_init_cursor(
	struct xfs_mount	*mp,		/* file system mount point */
	struct xfs_trans	*tp,		/* transaction pointer */
	struct xfs_buf		*agbp,		/* buffer for agi structure */
	xfs_agnumber_t		agno)		/* allocation group number */
{
	struct xfs_agi		*agi = XFS_BUF_TO_AGI(agbp);
	struct xfs_btree_cur	*cur;

	cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);

	cur->bc_tp = tp;
	cur->bc_mp = mp;
	cur->bc_nlevels = be32_to_cpu(agi->agi_level);
	cur->bc_btnum = XFS_BTNUM_INO;
	cur->bc_blocklog = mp->m_sb.sb_blocklog;

	cur->bc_ops = &xfs_inobt_ops;

	cur->bc_private.a.agbp = agbp;
	cur->bc_private.a.agno = agno;

	return cur;
}

/*
 * Calculate number of records in an inobt btree block.
 */
int
xfs_inobt_maxrecs(
	struct xfs_mount	*mp,
	int			blocklen,
	int			leaf)
{
	blocklen -= XFS_INOBT_BLOCK_LEN(mp);

	if (leaf)
		return blocklen / sizeof(xfs_inobt_rec_t);
	return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
}
Commit	Line	Data
1da177e4	1	/*
7b718769 NS	2	* Copyright (c) 2000-2001,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	17	*/
1da177e4	18	#include "xfs.h"
a844f451	19	#include "xfs_fs.h"
1da177e4	20	#include "xfs_types.h"
a844f451	21	#include "xfs_bit.h"
1da177e4	22	#include "xfs_log.h"
a844f451	23	#include "xfs_inum.h"
1da177e4 LT	24	#include "xfs_trans.h"
	25	#include "xfs_sb.h"
	26	#include "xfs_ag.h"
1da177e4	27	#include "xfs_mount.h"
1da177e4	28	#include "xfs_bmap_btree.h"
a844f451	29	#include "xfs_alloc_btree.h"
1da177e4	30	#include "xfs_ialloc_btree.h"
a844f451 NS	31	#include "xfs_dinode.h"
a844f451 NS	32	#include "xfs_inode.h"
1da177e4	33	#include "xfs_btree.h"
f5eb8e7c	34	#include "xfs_btree_trace.h"
1da177e4 LT	35	#include "xfs_ialloc.h"
	36	#include "xfs_alloc.h"
	37	#include "xfs_error.h"
	38
1da177e4	39
91cca5df CH	40	STATIC int
	41	xfs_inobt_get_minrecs(
	42	struct xfs_btree_cur *cur,
	43	int level)
	44	{
	45	return cur->bc_mp->m_inobt_mnr[level != 0];
	46	}
1da177e4	47
561f7d17 CH	48	STATIC struct xfs_btree_cur *
	49	xfs_inobt_dup_cursor(
	50	struct xfs_btree_cur *cur)
	51	{
	52	return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
	53	cur->bc_private.a.agbp, cur->bc_private.a.agno);
	54	}
	55
344207ce CH	56	STATIC void
	57	xfs_inobt_set_root(
	58	struct xfs_btree_cur *cur,
	59	union xfs_btree_ptr *nptr,
	60	int inc) /* level change */
	61	{
	62	struct xfs_buf *agbp = cur->bc_private.a.agbp;
	63	struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
	64
	65	agi->agi_root = nptr->s;
	66	be32_add_cpu(&agi->agi_level, inc);
	67	xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT \| XFS_AGI_LEVEL);
	68	}
	69
f5eb8e7c CH	70	STATIC int
	71	xfs_inobt_alloc_block(
	72	struct xfs_btree_cur *cur,
	73	union xfs_btree_ptr *start,
	74	union xfs_btree_ptr *new,
	75	int length,
	76	int *stat)
	77	{
	78	xfs_alloc_arg_t args; /* block allocation args */
	79	int error; /* error return value */
	80	xfs_agblock_t sbno = be32_to_cpu(start->s);
	81
	82	XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
	83
	84	memset(&args, 0, sizeof(args));
	85	args.tp = cur->bc_tp;
	86	args.mp = cur->bc_mp;
	87	args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
	88	args.minlen = 1;
	89	args.maxlen = 1;
	90	args.prod = 1;
	91	args.type = XFS_ALLOCTYPE_NEAR_BNO;
	92
	93	error = xfs_alloc_vextent(&args);
	94	if (error) {
	95	XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
	96	return error;
	97	}
	98	if (args.fsbno == NULLFSBLOCK) {
	99	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	100	*stat = 0;
	101	return 0;
	102	}
	103	ASSERT(args.len == 1);
	104	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	105
	106	new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
	107	*stat = 1;
	108	return 0;
	109	}
	110
d4b3a4b7 CH	111	STATIC int
	112	xfs_inobt_free_block(
	113	struct xfs_btree_cur *cur,
	114	struct xfs_buf *bp)
	115	{
	116	xfs_fsblock_t fsbno;
	117	int error;
	118
	119	fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp));
	120	error = xfs_free_extent(cur->bc_tp, fsbno, 1);
	121	if (error)
	122	return error;
	123
	124	xfs_trans_binval(cur->bc_tp, bp);
	125	return error;
	126	}
f5eb8e7c	127
ce5e42db CH	128	STATIC int
	129	xfs_inobt_get_maxrecs(
	130	struct xfs_btree_cur *cur,
	131	int level)
	132	{
	133	return cur->bc_mp->m_inobt_mxr[level != 0];
	134	}
	135
fe033cc8 CH	136	STATIC void
	137	xfs_inobt_init_key_from_rec(
	138	union xfs_btree_key *key,
	139	union xfs_btree_rec *rec)
	140	{
	141	key->inobt.ir_startino = rec->inobt.ir_startino;
	142	}
	143
4b22a571 CH	144	STATIC void
	145	xfs_inobt_init_rec_from_key(
	146	union xfs_btree_key *key,
	147	union xfs_btree_rec *rec)
	148	{
	149	rec->inobt.ir_startino = key->inobt.ir_startino;
	150	}
	151
	152	STATIC void
	153	xfs_inobt_init_rec_from_cur(
	154	struct xfs_btree_cur *cur,
	155	union xfs_btree_rec *rec)
	156	{
	157	rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
	158	rec->inobt.ir_freecount = cpu_to_be32(cur->bc_rec.i.ir_freecount);
	159	rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
	160	}
	161
fe033cc8	162	/*
9da096fd	163	* initial value of ptr for lookup
fe033cc8 CH	164	*/
	165	STATIC void
	166	xfs_inobt_init_ptr_from_cur(
	167	struct xfs_btree_cur *cur,
	168	union xfs_btree_ptr *ptr)
	169	{
	170	struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
	171
	172	ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
	173
	174	ptr->s = agi->agi_root;
	175	}
	176
	177	STATIC __int64_t
	178	xfs_inobt_key_diff(
	179	struct xfs_btree_cur *cur,
	180	union xfs_btree_key *key)
	181	{
	182	return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
	183	cur->bc_rec.i.ir_startino;
	184	}
	185
4a26e66e CH	186	#ifdef DEBUG
	187	STATIC int
	188	xfs_inobt_keys_inorder(
	189	struct xfs_btree_cur *cur,
	190	union xfs_btree_key *k1,
	191	union xfs_btree_key *k2)
	192	{
	193	return be32_to_cpu(k1->inobt.ir_startino) <
	194	be32_to_cpu(k2->inobt.ir_startino);
	195	}
	196
	197	STATIC int
	198	xfs_inobt_recs_inorder(
	199	struct xfs_btree_cur *cur,
	200	union xfs_btree_rec *r1,
	201	union xfs_btree_rec *r2)
	202	{
	203	return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
	204	be32_to_cpu(r2->inobt.ir_startino);
	205	}
	206	#endif /* DEBUG */
	207
8c4ed633 CH	208	#ifdef XFS_BTREE_TRACE
	209	ktrace_t *xfs_inobt_trace_buf;
	210
	211	STATIC void
	212	xfs_inobt_trace_enter(
	213	struct xfs_btree_cur *cur,
	214	const char *func,
	215	char *s,
	216	int type,
	217	int line,
	218	__psunsigned_t a0,
	219	__psunsigned_t a1,
	220	__psunsigned_t a2,
	221	__psunsigned_t a3,
	222	__psunsigned_t a4,
	223	__psunsigned_t a5,
	224	__psunsigned_t a6,
	225	__psunsigned_t a7,
	226	__psunsigned_t a8,
	227	__psunsigned_t a9,
	228	__psunsigned_t a10)
	229	{
	230	ktrace_enter(xfs_inobt_trace_buf, (void *)(__psint_t)type,
	231	(void )func, (void )s, NULL, (void *)cur,
	232	(void )a0, (void )a1, (void )a2, (void )a3,
	233	(void )a4, (void )a5, (void )a6, (void )a7,
	234	(void )a8, (void )a9, (void *)a10);
	235	}
	236
	237	STATIC void
	238	xfs_inobt_trace_cursor(
	239	struct xfs_btree_cur *cur,
	240	__uint32_t *s0,
	241	__uint64_t *l0,
	242	__uint64_t *l1)
	243	{
	244	*s0 = cur->bc_private.a.agno;
	245	*l0 = cur->bc_rec.i.ir_startino;
	246	*l1 = cur->bc_rec.i.ir_free;
	247	}
	248
	249	STATIC void
	250	xfs_inobt_trace_key(
	251	struct xfs_btree_cur *cur,
	252	union xfs_btree_key *key,
	253	__uint64_t *l0,
	254	__uint64_t *l1)
	255	{
	256	*l0 = be32_to_cpu(key->inobt.ir_startino);
	257	*l1 = 0;
	258	}
	259
	260	STATIC void
	261	xfs_inobt_trace_record(
	262	struct xfs_btree_cur *cur,
	263	union xfs_btree_rec *rec,
	264	__uint64_t *l0,
	265	__uint64_t *l1,
	266	__uint64_t *l2)
	267	{
	268	*l0 = be32_to_cpu(rec->inobt.ir_startino);
	269	*l1 = be32_to_cpu(rec->inobt.ir_freecount);
	270	*l2 = be64_to_cpu(rec->inobt.ir_free);
	271	}
272	#endif /* XFS_BTREE_TRACE */
273
561f7d17	274	static const struct xfs_btree_ops xfs_inobt_ops = {
65f1eaea CH	275	.rec_len = sizeof(xfs_inobt_rec_t),
	276	.key_len = sizeof(xfs_inobt_key_t),
	277
561f7d17	278	.dup_cursor = xfs_inobt_dup_cursor,
344207ce	279	.set_root = xfs_inobt_set_root,
f5eb8e7c	280	.alloc_block = xfs_inobt_alloc_block,
d4b3a4b7	281	.free_block = xfs_inobt_free_block,
91cca5df	282	.get_minrecs = xfs_inobt_get_minrecs,
ce5e42db	283	.get_maxrecs = xfs_inobt_get_maxrecs,
fe033cc8	284	.init_key_from_rec = xfs_inobt_init_key_from_rec,
4b22a571 CH	285	.init_rec_from_key = xfs_inobt_init_rec_from_key,
4b22a571 CH	286	.init_rec_from_cur = xfs_inobt_init_rec_from_cur,
fe033cc8 CH	287	.init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
fe033cc8 CH	288	.key_diff = xfs_inobt_key_diff,
8c4ed633	289
4a26e66e CH	290	#ifdef DEBUG
	291	.keys_inorder = xfs_inobt_keys_inorder,
	292	.recs_inorder = xfs_inobt_recs_inorder,
	293	#endif
	294
8c4ed633 CH	295	#ifdef XFS_BTREE_TRACE
	296	.trace_enter = xfs_inobt_trace_enter,
	297	.trace_cursor = xfs_inobt_trace_cursor,
	298	.trace_key = xfs_inobt_trace_key,
	299	.trace_record = xfs_inobt_trace_record,
	300	#endif
561f7d17 CH	301	};
	302
	303	/*
	304	* Allocate a new inode btree cursor.
	305	*/
	306	struct xfs_btree_cur * /* new inode btree cursor */
	307	xfs_inobt_init_cursor(
	308	struct xfs_mount mp, / file system mount point */
	309	struct xfs_trans tp, / transaction pointer */
	310	struct xfs_buf agbp, / buffer for agi structure */
	311	xfs_agnumber_t agno) /* allocation group number */
	312	{
	313	struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
	314	struct xfs_btree_cur *cur;
	315
	316	cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
	317
	318	cur->bc_tp = tp;
	319	cur->bc_mp = mp;
	320	cur->bc_nlevels = be32_to_cpu(agi->agi_level);
	321	cur->bc_btnum = XFS_BTNUM_INO;
	322	cur->bc_blocklog = mp->m_sb.sb_blocklog;
	323
	324	cur->bc_ops = &xfs_inobt_ops;
	325
	326	cur->bc_private.a.agbp = agbp;
	327	cur->bc_private.a.agno = agno;
	328
	329	return cur;
	330	}
60197e8d CH	331
	332	/*
	333	* Calculate number of records in an inobt btree block.
	334	*/
	335	int
	336	xfs_inobt_maxrecs(
	337	struct xfs_mount *mp,
	338	int blocklen,
	339	int leaf)
	340	{
7cc95a82	341	blocklen -= XFS_INOBT_BLOCK_LEN(mp);
60197e8d CH	342
	343	if (leaf)
	344	return blocklen / sizeof(xfs_inobt_rec_t);
	345	return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
	346	}