[deliverable/linux.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_shared.h"
#include "xfs_format.h"
#include "xfs_log_format.h"
#include "xfs_trans_resv.h"
#include "xfs_bit.h"
#include "xfs_sb.h"
#include "xfs_ag.h"
#include "xfs_mount.h"
#include "xfs_inode.h"
#include "xfs_btree.h"
#include "xfs_ialloc.h"
#include "xfs_ialloc_btree.h"
#include "xfs_alloc.h"
#include "xfs_error.h"
#include "xfs_trace.h"
#include "xfs_cksum.h"
#include "xfs_trans.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;
}

static int
xfs_inobt_verify(
	struct xfs_buf		*bp)
{
	struct xfs_mount	*mp = bp->b_target->bt_mount;
	struct xfs_btree_block	*block = XFS_BUF_TO_BLOCK(bp);
	struct xfs_perag	*pag = bp->b_pag;
	unsigned int		level;

	/*
	 * During growfs operations, we can't verify the exact owner as the
	 * perag is not fully initialised and hence not attached to the buffer.
	 *
	 * Similarly, during log recovery we will have a perag structure
	 * attached, but the agi information will not yet have been initialised
	 * from the on disk AGI. We don't currently use any of this information,
	 * but beware of the landmine (i.e. need to check pag->pagi_init) if we
	 * ever do.
	 */
	switch (block->bb_magic) {
	case cpu_to_be32(XFS_IBT_CRC_MAGIC):
		if (!xfs_sb_version_hascrc(&mp->m_sb))
			return false;
		if (!uuid_equal(&block->bb_u.s.bb_uuid, &mp->m_sb.sb_uuid))
			return false;
		if (block->bb_u.s.bb_blkno != cpu_to_be64(bp->b_bn))
			return false;
		if (pag &&
		    be32_to_cpu(block->bb_u.s.bb_owner) != pag->pag_agno)
			return false;
		/* fall through */
	case cpu_to_be32(XFS_IBT_MAGIC):
		break;
	default:
		return 0;
	}

	/* numrecs and level verification */
	level = be16_to_cpu(block->bb_level);
	if (level >= mp->m_in_maxlevels)
		return false;
	if (be16_to_cpu(block->bb_numrecs) > mp->m_inobt_mxr[level != 0])
		return false;

	/* sibling pointer verification */
	if (!block->bb_u.s.bb_leftsib ||
	    (be32_to_cpu(block->bb_u.s.bb_leftsib) >= mp->m_sb.sb_agblocks &&
	     block->bb_u.s.bb_leftsib != cpu_to_be32(NULLAGBLOCK)))
		return false;
	if (!block->bb_u.s.bb_rightsib ||
	    (be32_to_cpu(block->bb_u.s.bb_rightsib) >= mp->m_sb.sb_agblocks &&
	     block->bb_u.s.bb_rightsib != cpu_to_be32(NULLAGBLOCK)))
		return false;

	return true;
}

static void
xfs_inobt_read_verify(
	struct xfs_buf	*bp)
{
	if (!xfs_btree_sblock_verify_crc(bp))
		xfs_buf_ioerror(bp, EFSBADCRC);
	else if (!xfs_inobt_verify(bp))
		xfs_buf_ioerror(bp, EFSCORRUPTED);

	if (bp->b_error) {
		trace_xfs_btree_corrupt(bp, _RET_IP_);
		xfs_verifier_error(bp);
	}
}

static void
xfs_inobt_write_verify(
	struct xfs_buf	*bp)
{
	if (!xfs_inobt_verify(bp)) {
		trace_xfs_btree_corrupt(bp, _RET_IP_);
		xfs_buf_ioerror(bp, EFSCORRUPTED);
		xfs_verifier_error(bp);
		return;
	}
	xfs_btree_sblock_calc_crc(bp);

}

const struct xfs_buf_ops xfs_inobt_buf_ops = {
	.verify_read = xfs_inobt_read_verify,
	.verify_write = xfs_inobt_write_verify,
};

#if defined(DEBUG) || defined(XFS_WARN)
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 */

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,
	.buf_ops		= &xfs_inobt_buf_ops,
#if defined(DEBUG) || defined(XFS_WARN)
	.keys_inorder		= xfs_inobt_keys_inorder,
	.recs_inorder		= xfs_inobt_recs_inorder,
#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;
	if (xfs_sb_version_hascrc(&mp->m_sb))
		cur->bc_flags |= XFS_BTREE_CRC_BLOCKS;

	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"
632b89e8	20	#include "xfs_shared.h"
a4fbe6ab	21	#include "xfs_format.h"
239880ef DC	22	#include "xfs_log_format.h"
239880ef DC	23	#include "xfs_trans_resv.h"
a844f451	24	#include "xfs_bit.h"
1da177e4 LT	25	#include "xfs_sb.h"
1da177e4 LT	26	#include "xfs_ag.h"
1da177e4	27	#include "xfs_mount.h"
a844f451	28	#include "xfs_inode.h"
1da177e4 LT	29	#include "xfs_btree.h"
1da177e4 LT	30	#include "xfs_ialloc.h"
a4fbe6ab	31	#include "xfs_ialloc_btree.h"
1da177e4 LT	32	#include "xfs_alloc.h"
1da177e4 LT	33	#include "xfs_error.h"
3d3e6f64	34	#include "xfs_trace.h"
ee1a47ab	35	#include "xfs_cksum.h"
239880ef	36	#include "xfs_trans.h"
1da177e4	37
1da177e4	38
91cca5df CH	39	STATIC int
	40	xfs_inobt_get_minrecs(
	41	struct xfs_btree_cur *cur,
	42	int level)
	43	{
	44	return cur->bc_mp->m_inobt_mnr[level != 0];
	45	}
1da177e4	46
561f7d17 CH	47	STATIC struct xfs_btree_cur *
	48	xfs_inobt_dup_cursor(
	49	struct xfs_btree_cur *cur)
	50	{
	51	return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
	52	cur->bc_private.a.agbp, cur->bc_private.a.agno);
	53	}
	54
344207ce CH	55	STATIC void
	56	xfs_inobt_set_root(
	57	struct xfs_btree_cur *cur,
	58	union xfs_btree_ptr *nptr,
	59	int inc) /* level change */
	60	{
	61	struct xfs_buf *agbp = cur->bc_private.a.agbp;
	62	struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
	63
	64	agi->agi_root = nptr->s;
	65	be32_add_cpu(&agi->agi_level, inc);
	66	xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT \| XFS_AGI_LEVEL);
	67	}
	68
f5eb8e7c CH	69	STATIC int
	70	xfs_inobt_alloc_block(
	71	struct xfs_btree_cur *cur,
	72	union xfs_btree_ptr *start,
	73	union xfs_btree_ptr *new,
	74	int length,
	75	int *stat)
	76	{
	77	xfs_alloc_arg_t args; /* block allocation args */
	78	int error; /* error return value */
	79	xfs_agblock_t sbno = be32_to_cpu(start->s);
	80
	81	XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
	82
	83	memset(&args, 0, sizeof(args));
	84	args.tp = cur->bc_tp;
	85	args.mp = cur->bc_mp;
	86	args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
	87	args.minlen = 1;
	88	args.maxlen = 1;
	89	args.prod = 1;
	90	args.type = XFS_ALLOCTYPE_NEAR_BNO;
	91
	92	error = xfs_alloc_vextent(&args);
	93	if (error) {
	94	XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
	95	return error;
	96	}
	97	if (args.fsbno == NULLFSBLOCK) {
	98	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	99	*stat = 0;
	100	return 0;
	101	}
	102	ASSERT(args.len == 1);
	103	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	104
	105	new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
	106	*stat = 1;
	107	return 0;
	108	}
	109
d4b3a4b7 CH	110	STATIC int
	111	xfs_inobt_free_block(
	112	struct xfs_btree_cur *cur,
	113	struct xfs_buf *bp)
	114	{
	115	xfs_fsblock_t fsbno;
	116	int error;
	117
	118	fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp));
	119	error = xfs_free_extent(cur->bc_tp, fsbno, 1);
	120	if (error)
	121	return error;
	122
	123	xfs_trans_binval(cur->bc_tp, bp);
	124	return error;
	125	}
f5eb8e7c	126
ce5e42db CH	127	STATIC int
	128	xfs_inobt_get_maxrecs(
	129	struct xfs_btree_cur *cur,
	130	int level)
	131	{
	132	return cur->bc_mp->m_inobt_mxr[level != 0];
	133	}
	134
fe033cc8 CH	135	STATIC void
	136	xfs_inobt_init_key_from_rec(
	137	union xfs_btree_key *key,
	138	union xfs_btree_rec *rec)
	139	{
	140	key->inobt.ir_startino = rec->inobt.ir_startino;
	141	}
	142
4b22a571 CH	143	STATIC void
	144	xfs_inobt_init_rec_from_key(
	145	union xfs_btree_key *key,
	146	union xfs_btree_rec *rec)
	147	{
	148	rec->inobt.ir_startino = key->inobt.ir_startino;
	149	}
	150
	151	STATIC void
	152	xfs_inobt_init_rec_from_cur(
	153	struct xfs_btree_cur *cur,
	154	union xfs_btree_rec *rec)
	155	{
	156	rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
	157	rec->inobt.ir_freecount = cpu_to_be32(cur->bc_rec.i.ir_freecount);
	158	rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
	159	}
	160
fe033cc8	161	/*
9da096fd	162	* initial value of ptr for lookup
fe033cc8 CH	163	*/
	164	STATIC void
	165	xfs_inobt_init_ptr_from_cur(
	166	struct xfs_btree_cur *cur,
	167	union xfs_btree_ptr *ptr)
	168	{
	169	struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
	170
	171	ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
	172
	173	ptr->s = agi->agi_root;
	174	}
	175
	176	STATIC __int64_t
	177	xfs_inobt_key_diff(
	178	struct xfs_btree_cur *cur,
	179	union xfs_btree_key *key)
	180	{
	181	return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
	182	cur->bc_rec.i.ir_startino;
	183	}
	184
ee1a47ab	185	static int
612cfbfe	186	xfs_inobt_verify(
3d3e6f64 DC	187	struct xfs_buf *bp)
	188	{
	189	struct xfs_mount *mp = bp->b_target->bt_mount;
	190	struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
ee1a47ab	191	struct xfs_perag *pag = bp->b_pag;
3d3e6f64	192	unsigned int level;
3d3e6f64	193
ee1a47ab CH	194	/*
	195	* During growfs operations, we can't verify the exact owner as the
	196	* perag is not fully initialised and hence not attached to the buffer.
	197	*
	198	* Similarly, during log recovery we will have a perag structure
	199	* attached, but the agi information will not yet have been initialised
	200	* from the on disk AGI. We don't currently use any of this information,
	201	* but beware of the landmine (i.e. need to check pag->pagi_init) if we
	202	* ever do.
	203	*/
	204	switch (block->bb_magic) {
	205	case cpu_to_be32(XFS_IBT_CRC_MAGIC):
	206	if (!xfs_sb_version_hascrc(&mp->m_sb))
	207	return false;
	208	if (!uuid_equal(&block->bb_u.s.bb_uuid, &mp->m_sb.sb_uuid))
	209	return false;
	210	if (block->bb_u.s.bb_blkno != cpu_to_be64(bp->b_bn))
	211	return false;
	212	if (pag &&
	213	be32_to_cpu(block->bb_u.s.bb_owner) != pag->pag_agno)
	214	return false;
	215	/* fall through */
	216	case cpu_to_be32(XFS_IBT_MAGIC):
	217	break;
	218	default:
	219	return 0;
	220	}
3d3e6f64	221
ee1a47ab CH	222	/* numrecs and level verification */
	223	level = be16_to_cpu(block->bb_level);
	224	if (level >= mp->m_in_maxlevels)
	225	return false;
	226	if (be16_to_cpu(block->bb_numrecs) > mp->m_inobt_mxr[level != 0])
	227	return false;
3d3e6f64 DC	228
3d3e6f64 DC	229	/* sibling pointer verification */
ee1a47ab CH	230	if (!block->bb_u.s.bb_leftsib \|\|
	231	(be32_to_cpu(block->bb_u.s.bb_leftsib) >= mp->m_sb.sb_agblocks &&
	232	block->bb_u.s.bb_leftsib != cpu_to_be32(NULLAGBLOCK)))
	233	return false;
	234	if (!block->bb_u.s.bb_rightsib \|\|
	235	(be32_to_cpu(block->bb_u.s.bb_rightsib) >= mp->m_sb.sb_agblocks &&
	236	block->bb_u.s.bb_rightsib != cpu_to_be32(NULLAGBLOCK)))
	237	return false;
	238
	239	return true;
612cfbfe DC	240	}
	241
	242	static void
1813dd64	243	xfs_inobt_read_verify(
612cfbfe DC	244	struct xfs_buf *bp)
612cfbfe DC	245	{
ce5028cf ES	246	if (!xfs_btree_sblock_verify_crc(bp))
	247	xfs_buf_ioerror(bp, EFSBADCRC);
	248	else if (!xfs_inobt_verify(bp))
ee1a47ab	249	xfs_buf_ioerror(bp, EFSCORRUPTED);
ce5028cf ES	250
	251	if (bp->b_error) {
	252	trace_xfs_btree_corrupt(bp, _RET_IP_);
	253	xfs_verifier_error(bp);
ee1a47ab	254	}
612cfbfe	255	}
3d3e6f64	256
1813dd64 DC	257	static void
1813dd64 DC	258	xfs_inobt_write_verify(
612cfbfe DC	259	struct xfs_buf *bp)
612cfbfe DC	260	{
ee1a47ab CH	261	if (!xfs_inobt_verify(bp)) {
ee1a47ab CH	262	trace_xfs_btree_corrupt(bp, _RET_IP_);
ee1a47ab	263	xfs_buf_ioerror(bp, EFSCORRUPTED);
ce5028cf	264	xfs_verifier_error(bp);
e0d2c23a	265	return;
ee1a47ab CH	266	}
	267	xfs_btree_sblock_calc_crc(bp);
	268
3d3e6f64 DC	269	}
3d3e6f64 DC	270
1813dd64 DC	271	const struct xfs_buf_ops xfs_inobt_buf_ops = {
	272	.verify_read = xfs_inobt_read_verify,
	273	.verify_write = xfs_inobt_write_verify,
	274	};
	275
742ae1e3	276	#if defined(DEBUG) \|\| defined(XFS_WARN)
4a26e66e CH	277	STATIC int
	278	xfs_inobt_keys_inorder(
	279	struct xfs_btree_cur *cur,
	280	union xfs_btree_key *k1,
	281	union xfs_btree_key *k2)
	282	{
	283	return be32_to_cpu(k1->inobt.ir_startino) <
	284	be32_to_cpu(k2->inobt.ir_startino);
	285	}
	286
	287	STATIC int
	288	xfs_inobt_recs_inorder(
	289	struct xfs_btree_cur *cur,
	290	union xfs_btree_rec *r1,
	291	union xfs_btree_rec *r2)
	292	{
	293	return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
	294	be32_to_cpu(r2->inobt.ir_startino);
	295	}
	296	#endif /* DEBUG */
	297
561f7d17	298	static const struct xfs_btree_ops xfs_inobt_ops = {
65f1eaea CH	299	.rec_len = sizeof(xfs_inobt_rec_t),
	300	.key_len = sizeof(xfs_inobt_key_t),
	301
561f7d17	302	.dup_cursor = xfs_inobt_dup_cursor,
344207ce	303	.set_root = xfs_inobt_set_root,
f5eb8e7c	304	.alloc_block = xfs_inobt_alloc_block,
d4b3a4b7	305	.free_block = xfs_inobt_free_block,
91cca5df	306	.get_minrecs = xfs_inobt_get_minrecs,
ce5e42db	307	.get_maxrecs = xfs_inobt_get_maxrecs,
fe033cc8	308	.init_key_from_rec = xfs_inobt_init_key_from_rec,
4b22a571 CH	309	.init_rec_from_key = xfs_inobt_init_rec_from_key,
4b22a571 CH	310	.init_rec_from_cur = xfs_inobt_init_rec_from_cur,
fe033cc8 CH	311	.init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
fe033cc8 CH	312	.key_diff = xfs_inobt_key_diff,
1813dd64	313	.buf_ops = &xfs_inobt_buf_ops,
742ae1e3	314	#if defined(DEBUG) \|\| defined(XFS_WARN)
4a26e66e CH	315	.keys_inorder = xfs_inobt_keys_inorder,
	316	.recs_inorder = xfs_inobt_recs_inorder,
	317	#endif
561f7d17 CH	318	};
	319
	320	/*
	321	* Allocate a new inode btree cursor.
	322	*/
	323	struct xfs_btree_cur * /* new inode btree cursor */
	324	xfs_inobt_init_cursor(
	325	struct xfs_mount mp, / file system mount point */
	326	struct xfs_trans tp, / transaction pointer */
	327	struct xfs_buf agbp, / buffer for agi structure */
	328	xfs_agnumber_t agno) /* allocation group number */
	329	{
	330	struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
	331	struct xfs_btree_cur *cur;
	332
	333	cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
	334
	335	cur->bc_tp = tp;
	336	cur->bc_mp = mp;
	337	cur->bc_nlevels = be32_to_cpu(agi->agi_level);
	338	cur->bc_btnum = XFS_BTNUM_INO;
	339	cur->bc_blocklog = mp->m_sb.sb_blocklog;
	340
	341	cur->bc_ops = &xfs_inobt_ops;
ee1a47ab CH	342	if (xfs_sb_version_hascrc(&mp->m_sb))
ee1a47ab CH	343	cur->bc_flags \|= XFS_BTREE_CRC_BLOCKS;
561f7d17 CH	344
	345	cur->bc_private.a.agbp = agbp;
	346	cur->bc_private.a.agno = agno;
	347
	348	return cur;
	349	}
60197e8d CH	350
	351	/*
	352	* Calculate number of records in an inobt btree block.
	353	*/
	354	int
	355	xfs_inobt_maxrecs(
	356	struct xfs_mount *mp,
	357	int blocklen,
	358	int leaf)
	359	{
7cc95a82	360	blocklen -= XFS_INOBT_BLOCK_LEN(mp);
60197e8d CH	361
	362	if (leaf)
	363	return blocklen / sizeof(xfs_inobt_rec_t);
	364	return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
	365	}