[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,
			cur->bc_btnum);
}

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 */
	xfs_btnum_t		btnum)		/* ialloc or free ino btree */
{
	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 = btnum;
	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,
57bd3dbe BF	52	cur->bc_private.a.agbp, cur->bc_private.a.agno,
57bd3dbe BF	53	cur->bc_btnum);
561f7d17 CH	54	}
561f7d17 CH	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
ee1a47ab	186	static int
612cfbfe	187	xfs_inobt_verify(
3d3e6f64 DC	188	struct xfs_buf *bp)
	189	{
	190	struct xfs_mount *mp = bp->b_target->bt_mount;
	191	struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
ee1a47ab	192	struct xfs_perag *pag = bp->b_pag;
3d3e6f64	193	unsigned int level;
3d3e6f64	194
ee1a47ab CH	195	/*
	196	* During growfs operations, we can't verify the exact owner as the
	197	* perag is not fully initialised and hence not attached to the buffer.
	198	*
	199	* Similarly, during log recovery we will have a perag structure
	200	* attached, but the agi information will not yet have been initialised
	201	* from the on disk AGI. We don't currently use any of this information,
	202	* but beware of the landmine (i.e. need to check pag->pagi_init) if we
	203	* ever do.
	204	*/
	205	switch (block->bb_magic) {
	206	case cpu_to_be32(XFS_IBT_CRC_MAGIC):
	207	if (!xfs_sb_version_hascrc(&mp->m_sb))
	208	return false;
	209	if (!uuid_equal(&block->bb_u.s.bb_uuid, &mp->m_sb.sb_uuid))
	210	return false;
	211	if (block->bb_u.s.bb_blkno != cpu_to_be64(bp->b_bn))
	212	return false;
	213	if (pag &&
	214	be32_to_cpu(block->bb_u.s.bb_owner) != pag->pag_agno)
	215	return false;
	216	/* fall through */
	217	case cpu_to_be32(XFS_IBT_MAGIC):
	218	break;
	219	default:
	220	return 0;
	221	}
3d3e6f64	222
ee1a47ab CH	223	/* numrecs and level verification */
	224	level = be16_to_cpu(block->bb_level);
	225	if (level >= mp->m_in_maxlevels)
	226	return false;
	227	if (be16_to_cpu(block->bb_numrecs) > mp->m_inobt_mxr[level != 0])
	228	return false;
3d3e6f64 DC	229
3d3e6f64 DC	230	/* sibling pointer verification */
ee1a47ab CH	231	if (!block->bb_u.s.bb_leftsib \|\|
	232	(be32_to_cpu(block->bb_u.s.bb_leftsib) >= mp->m_sb.sb_agblocks &&
	233	block->bb_u.s.bb_leftsib != cpu_to_be32(NULLAGBLOCK)))
	234	return false;
	235	if (!block->bb_u.s.bb_rightsib \|\|
	236	(be32_to_cpu(block->bb_u.s.bb_rightsib) >= mp->m_sb.sb_agblocks &&
	237	block->bb_u.s.bb_rightsib != cpu_to_be32(NULLAGBLOCK)))
	238	return false;
	239
	240	return true;
612cfbfe DC	241	}
	242
	243	static void
1813dd64	244	xfs_inobt_read_verify(
612cfbfe DC	245	struct xfs_buf *bp)
612cfbfe DC	246	{
ce5028cf ES	247	if (!xfs_btree_sblock_verify_crc(bp))
	248	xfs_buf_ioerror(bp, EFSBADCRC);
	249	else if (!xfs_inobt_verify(bp))
ee1a47ab	250	xfs_buf_ioerror(bp, EFSCORRUPTED);
ce5028cf ES	251
	252	if (bp->b_error) {
	253	trace_xfs_btree_corrupt(bp, _RET_IP_);
	254	xfs_verifier_error(bp);
ee1a47ab	255	}
612cfbfe	256	}
3d3e6f64	257
1813dd64 DC	258	static void
1813dd64 DC	259	xfs_inobt_write_verify(
612cfbfe DC	260	struct xfs_buf *bp)
612cfbfe DC	261	{
ee1a47ab CH	262	if (!xfs_inobt_verify(bp)) {
ee1a47ab CH	263	trace_xfs_btree_corrupt(bp, _RET_IP_);
ee1a47ab	264	xfs_buf_ioerror(bp, EFSCORRUPTED);
ce5028cf	265	xfs_verifier_error(bp);
e0d2c23a	266	return;
ee1a47ab CH	267	}
	268	xfs_btree_sblock_calc_crc(bp);
	269
3d3e6f64 DC	270	}
3d3e6f64 DC	271
1813dd64 DC	272	const struct xfs_buf_ops xfs_inobt_buf_ops = {
	273	.verify_read = xfs_inobt_read_verify,
	274	.verify_write = xfs_inobt_write_verify,
	275	};
	276
742ae1e3	277	#if defined(DEBUG) \|\| defined(XFS_WARN)
4a26e66e CH	278	STATIC int
	279	xfs_inobt_keys_inorder(
	280	struct xfs_btree_cur *cur,
	281	union xfs_btree_key *k1,
	282	union xfs_btree_key *k2)
	283	{
	284	return be32_to_cpu(k1->inobt.ir_startino) <
	285	be32_to_cpu(k2->inobt.ir_startino);
	286	}
	287
	288	STATIC int
	289	xfs_inobt_recs_inorder(
	290	struct xfs_btree_cur *cur,
	291	union xfs_btree_rec *r1,
	292	union xfs_btree_rec *r2)
	293	{
	294	return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
	295	be32_to_cpu(r2->inobt.ir_startino);
	296	}
	297	#endif /* DEBUG */
	298
561f7d17	299	static const struct xfs_btree_ops xfs_inobt_ops = {
65f1eaea CH	300	.rec_len = sizeof(xfs_inobt_rec_t),
	301	.key_len = sizeof(xfs_inobt_key_t),
	302
561f7d17	303	.dup_cursor = xfs_inobt_dup_cursor,
344207ce	304	.set_root = xfs_inobt_set_root,
f5eb8e7c	305	.alloc_block = xfs_inobt_alloc_block,
d4b3a4b7	306	.free_block = xfs_inobt_free_block,
91cca5df	307	.get_minrecs = xfs_inobt_get_minrecs,
ce5e42db	308	.get_maxrecs = xfs_inobt_get_maxrecs,
fe033cc8	309	.init_key_from_rec = xfs_inobt_init_key_from_rec,
4b22a571 CH	310	.init_rec_from_key = xfs_inobt_init_rec_from_key,
4b22a571 CH	311	.init_rec_from_cur = xfs_inobt_init_rec_from_cur,
fe033cc8 CH	312	.init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
fe033cc8 CH	313	.key_diff = xfs_inobt_key_diff,
1813dd64	314	.buf_ops = &xfs_inobt_buf_ops,
742ae1e3	315	#if defined(DEBUG) \|\| defined(XFS_WARN)
4a26e66e CH	316	.keys_inorder = xfs_inobt_keys_inorder,
	317	.recs_inorder = xfs_inobt_recs_inorder,
	318	#endif
561f7d17 CH	319	};
	320
	321	/*
	322	* Allocate a new inode btree cursor.
	323	*/
	324	struct xfs_btree_cur * /* new inode btree cursor */
	325	xfs_inobt_init_cursor(
	326	struct xfs_mount mp, / file system mount point */
	327	struct xfs_trans tp, / transaction pointer */
	328	struct xfs_buf agbp, / buffer for agi structure */
57bd3dbe BF	329	xfs_agnumber_t agno, /* allocation group number */
57bd3dbe BF	330	xfs_btnum_t btnum) /* ialloc or free ino btree */
561f7d17 CH	331	{
	332	struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
	333	struct xfs_btree_cur *cur;
	334
	335	cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
	336
	337	cur->bc_tp = tp;
	338	cur->bc_mp = mp;
	339	cur->bc_nlevels = be32_to_cpu(agi->agi_level);
57bd3dbe	340	cur->bc_btnum = btnum;
561f7d17 CH	341	cur->bc_blocklog = mp->m_sb.sb_blocklog;
	342
	343	cur->bc_ops = &xfs_inobt_ops;
ee1a47ab CH	344	if (xfs_sb_version_hascrc(&mp->m_sb))
ee1a47ab CH	345	cur->bc_flags \|= XFS_BTREE_CRC_BLOCKS;
561f7d17 CH	346
	347	cur->bc_private.a.agbp = agbp;
	348	cur->bc_private.a.agno = agno;
	349
	350	return cur;
	351	}
60197e8d CH	352
	353	/*
	354	* Calculate number of records in an inobt btree block.
	355	*/
	356	int
	357	xfs_inobt_maxrecs(
	358	struct xfs_mount *mp,
	359	int blocklen,
	360	int leaf)
	361	{
7cc95a82	362	blocklen -= XFS_INOBT_BLOCK_LEN(mp);
60197e8d CH	363
	364	if (leaf)
	365	return blocklen / sizeof(xfs_inobt_rec_t);
	366	return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
	367	}