[linux-2.6-block.git] / fs / xfs / libxfs / 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_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 void
xfs_finobt_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_free_root = nptr->s;
	be32_add_cpu(&agi->agi_free_level, inc);
	xfs_ialloc_log_agi(cur->bc_tp, agbp,
			   XFS_AGI_FREE_ROOT | XFS_AGI_FREE_LEVEL);
}

STATIC int
xfs_inobt_alloc_block(
	struct xfs_btree_cur	*cur,
	union xfs_btree_ptr	*start,
	union xfs_btree_ptr	*new,
	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)
{
	return xfs_free_extent(cur->bc_tp,
			XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp)), 1);
}

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);
	if (xfs_sb_version_hassparseinodes(&cur->bc_mp->m_sb)) {
		rec->inobt.ir_u.sp.ir_holemask =
					cpu_to_be16(cur->bc_rec.i.ir_holemask);
		rec->inobt.ir_u.sp.ir_count = cur->bc_rec.i.ir_count;
		rec->inobt.ir_u.sp.ir_freecount = cur->bc_rec.i.ir_freecount;
	} else {
		/* ir_holemask/ir_count not supported on-disk */
		rec->inobt.ir_u.f.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 void
xfs_finobt_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_free_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);
	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):
	case cpu_to_be32(XFS_FIBT_CRC_MAGIC):
		if (!xfs_btree_sblock_v5hdr_verify(bp))
			return false;
		/* fall through */
	case cpu_to_be32(XFS_IBT_MAGIC):
	case cpu_to_be32(XFS_FIBT_MAGIC):
		break;
	default:
		return 0;
	}

	/* level verification */
	level = be16_to_cpu(block->bb_level);
	if (level >= mp->m_in_maxlevels)
		return false;

	return xfs_btree_sblock_verify(bp, mp->m_inobt_mxr[level != 0]);
}

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 = {
	.name = "xfs_inobt",
	.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
};

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

	.dup_cursor		= xfs_inobt_dup_cursor,
	.set_root		= xfs_finobt_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_finobt_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_btnum = btnum;
	if (btnum == XFS_BTNUM_INO) {
		cur->bc_nlevels = be32_to_cpu(agi->agi_level);
		cur->bc_ops = &xfs_inobt_ops;
	} else {
		cur->bc_nlevels = be32_to_cpu(agi->agi_free_level);
		cur->bc_ops = &xfs_finobt_ops;
	}

	cur->bc_blocklog = mp->m_sb.sb_blocklog;

	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));
}

/*
 * Convert the inode record holemask to an inode allocation bitmap. The inode
 * allocation bitmap is inode granularity and specifies whether an inode is
 * physically allocated on disk (not whether the inode is considered allocated
 * or free by the fs).
 *
 * A bit value of 1 means the inode is allocated, a value of 0 means it is free.
 */
uint64_t
xfs_inobt_irec_to_allocmask(
	struct xfs_inobt_rec_incore	*rec)
{
	uint64_t			bitmap = 0;
	uint64_t			inodespbit;
	int				nextbit;
	uint				allocbitmap;

	/*
	 * The holemask has 16-bits for a 64 inode record. Therefore each
	 * holemask bit represents multiple inodes. Create a mask of bits to set
	 * in the allocmask for each holemask bit.
	 */
	inodespbit = (1 << XFS_INODES_PER_HOLEMASK_BIT) - 1;

	/*
	 * Allocated inodes are represented by 0 bits in holemask. Invert the 0
	 * bits to 1 and convert to a uint so we can use xfs_next_bit(). Mask
	 * anything beyond the 16 holemask bits since this casts to a larger
	 * type.
	 */
	allocbitmap = ~rec->ir_holemask & ((1 << XFS_INOBT_HOLEMASK_BITS) - 1);

	/*
	 * allocbitmap is the inverted holemask so every set bit represents
	 * allocated inodes. To expand from 16-bit holemask granularity to
	 * 64-bit (e.g., bit-per-inode), set inodespbit bits in the target
	 * bitmap for every holemask bit.
	 */
	nextbit = xfs_next_bit(&allocbitmap, 1, 0);
	while (nextbit != -1) {
		ASSERT(nextbit < (sizeof(rec->ir_holemask) * NBBY));

		bitmap |= (inodespbit <<
			   (nextbit * XFS_INODES_PER_HOLEMASK_BIT));

		nextbit = xfs_next_bit(&allocbitmap, 1, nextbit + 1);
	}

	return bitmap;
}

#if defined(DEBUG) || defined(XFS_WARN)
/*
 * Verify that an in-core inode record has a valid inode count.
 */
int
xfs_inobt_rec_check_count(
	struct xfs_mount		*mp,
	struct xfs_inobt_rec_incore	*rec)
{
	int				inocount = 0;
	int				nextbit = 0;
	uint64_t			allocbmap;
	int				wordsz;

	wordsz = sizeof(allocbmap) / sizeof(unsigned int);
	allocbmap = xfs_inobt_irec_to_allocmask(rec);

	nextbit = xfs_next_bit((uint *) &allocbmap, wordsz, nextbit);
	while (nextbit != -1) {
		inocount++;
		nextbit = xfs_next_bit((uint *) &allocbmap, wordsz,
				       nextbit + 1);
	}

	if (inocount != rec->ir_count)
		return -EFSCORRUPTED;

	return 0;
}
#endif	/* DEBUG */
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	25	#include "xfs_mount.h"
a844f451	26	#include "xfs_inode.h"
1da177e4 LT	27	#include "xfs_btree.h"
1da177e4 LT	28	#include "xfs_ialloc.h"
a4fbe6ab	29	#include "xfs_ialloc_btree.h"
1da177e4 LT	30	#include "xfs_alloc.h"
1da177e4 LT	31	#include "xfs_error.h"
3d3e6f64	32	#include "xfs_trace.h"
ee1a47ab	33	#include "xfs_cksum.h"
239880ef	34	#include "xfs_trans.h"
1da177e4	35
1da177e4	36
91cca5df CH	37	STATIC int
	38	xfs_inobt_get_minrecs(
	39	struct xfs_btree_cur *cur,
	40	int level)
	41	{
	42	return cur->bc_mp->m_inobt_mnr[level != 0];
	43	}
1da177e4	44
561f7d17 CH	45	STATIC struct xfs_btree_cur *
	46	xfs_inobt_dup_cursor(
	47	struct xfs_btree_cur *cur)
	48	{
	49	return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
57bd3dbe BF	50	cur->bc_private.a.agbp, cur->bc_private.a.agno,
57bd3dbe BF	51	cur->bc_btnum);
561f7d17 CH	52	}
561f7d17 CH	53
344207ce CH	54	STATIC void
	55	xfs_inobt_set_root(
	56	struct xfs_btree_cur *cur,
	57	union xfs_btree_ptr *nptr,
	58	int inc) /* level change */
	59	{
	60	struct xfs_buf *agbp = cur->bc_private.a.agbp;
	61	struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
	62
	63	agi->agi_root = nptr->s;
	64	be32_add_cpu(&agi->agi_level, inc);
	65	xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT \| XFS_AGI_LEVEL);
	66	}
	67
aafc3c24 BF	68	STATIC void
	69	xfs_finobt_set_root(
	70	struct xfs_btree_cur *cur,
	71	union xfs_btree_ptr *nptr,
	72	int inc) /* level change */
	73	{
	74	struct xfs_buf *agbp = cur->bc_private.a.agbp;
	75	struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
	76
	77	agi->agi_free_root = nptr->s;
	78	be32_add_cpu(&agi->agi_free_level, inc);
	79	xfs_ialloc_log_agi(cur->bc_tp, agbp,
	80	XFS_AGI_FREE_ROOT \| XFS_AGI_FREE_LEVEL);
	81	}
	82
f5eb8e7c CH	83	STATIC int
	84	xfs_inobt_alloc_block(
	85	struct xfs_btree_cur *cur,
	86	union xfs_btree_ptr *start,
	87	union xfs_btree_ptr *new,
f5eb8e7c CH	88	int *stat)
	89	{
	90	xfs_alloc_arg_t args; /* block allocation args */
	91	int error; /* error return value */
	92	xfs_agblock_t sbno = be32_to_cpu(start->s);
	93
	94	XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
	95
	96	memset(&args, 0, sizeof(args));
	97	args.tp = cur->bc_tp;
	98	args.mp = cur->bc_mp;
	99	args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
	100	args.minlen = 1;
	101	args.maxlen = 1;
	102	args.prod = 1;
	103	args.type = XFS_ALLOCTYPE_NEAR_BNO;
	104
	105	error = xfs_alloc_vextent(&args);
	106	if (error) {
	107	XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
	108	return error;
	109	}
	110	if (args.fsbno == NULLFSBLOCK) {
	111	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	112	*stat = 0;
	113	return 0;
	114	}
	115	ASSERT(args.len == 1);
	116	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	117
	118	new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
	119	*stat = 1;
	120	return 0;
	121	}
	122
d4b3a4b7 CH	123	STATIC int
	124	xfs_inobt_free_block(
	125	struct xfs_btree_cur *cur,
	126	struct xfs_buf *bp)
	127	{
edfd9dd5 CH	128	return xfs_free_extent(cur->bc_tp,
edfd9dd5 CH	129	XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp)), 1);
d4b3a4b7	130	}
f5eb8e7c	131
ce5e42db CH	132	STATIC int
	133	xfs_inobt_get_maxrecs(
	134	struct xfs_btree_cur *cur,
	135	int level)
	136	{
	137	return cur->bc_mp->m_inobt_mxr[level != 0];
	138	}
	139
fe033cc8 CH	140	STATIC void
	141	xfs_inobt_init_key_from_rec(
	142	union xfs_btree_key *key,
	143	union xfs_btree_rec *rec)
	144	{
	145	key->inobt.ir_startino = rec->inobt.ir_startino;
	146	}
	147
4b22a571 CH	148	STATIC void
	149	xfs_inobt_init_rec_from_key(
	150	union xfs_btree_key *key,
	151	union xfs_btree_rec *rec)
	152	{
	153	rec->inobt.ir_startino = key->inobt.ir_startino;
	154	}
	155
	156	STATIC void
	157	xfs_inobt_init_rec_from_cur(
	158	struct xfs_btree_cur *cur,
	159	union xfs_btree_rec *rec)
	160	{
	161	rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
5419040f BF	162	if (xfs_sb_version_hassparseinodes(&cur->bc_mp->m_sb)) {
	163	rec->inobt.ir_u.sp.ir_holemask =
	164	cpu_to_be16(cur->bc_rec.i.ir_holemask);
	165	rec->inobt.ir_u.sp.ir_count = cur->bc_rec.i.ir_count;
	166	rec->inobt.ir_u.sp.ir_freecount = cur->bc_rec.i.ir_freecount;
	167	} else {
	168	/* ir_holemask/ir_count not supported on-disk */
	169	rec->inobt.ir_u.f.ir_freecount =
	170	cpu_to_be32(cur->bc_rec.i.ir_freecount);
	171	}
4b22a571 CH	172	rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
	173	}
	174
fe033cc8	175	/*
9da096fd	176	* initial value of ptr for lookup
fe033cc8 CH	177	*/
	178	STATIC void
	179	xfs_inobt_init_ptr_from_cur(
	180	struct xfs_btree_cur *cur,
	181	union xfs_btree_ptr *ptr)
	182	{
	183	struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
	184
	185	ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
	186
	187	ptr->s = agi->agi_root;
	188	}
	189
aafc3c24 BF	190	STATIC void
	191	xfs_finobt_init_ptr_from_cur(
	192	struct xfs_btree_cur *cur,
	193	union xfs_btree_ptr *ptr)
	194	{
	195	struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
	196
	197	ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
	198	ptr->s = agi->agi_free_root;
	199	}
	200
fe033cc8 CH	201	STATIC __int64_t
	202	xfs_inobt_key_diff(
	203	struct xfs_btree_cur *cur,
	204	union xfs_btree_key *key)
	205	{
	206	return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
	207	cur->bc_rec.i.ir_startino;
	208	}
	209
ee1a47ab	210	static int
612cfbfe	211	xfs_inobt_verify(
3d3e6f64 DC	212	struct xfs_buf *bp)
	213	{
	214	struct xfs_mount *mp = bp->b_target->bt_mount;
	215	struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
	216	unsigned int level;
3d3e6f64	217
ee1a47ab CH	218	/*
	219	* During growfs operations, we can't verify the exact owner as the
	220	* perag is not fully initialised and hence not attached to the buffer.
	221	*
	222	* Similarly, during log recovery we will have a perag structure
	223	* attached, but the agi information will not yet have been initialised
	224	* from the on disk AGI. We don't currently use any of this information,
	225	* but beware of the landmine (i.e. need to check pag->pagi_init) if we
	226	* ever do.
	227	*/
	228	switch (block->bb_magic) {
	229	case cpu_to_be32(XFS_IBT_CRC_MAGIC):
aafc3c24	230	case cpu_to_be32(XFS_FIBT_CRC_MAGIC):
c5ab131b	231	if (!xfs_btree_sblock_v5hdr_verify(bp))
ee1a47ab CH	232	return false;
	233	/* fall through */
	234	case cpu_to_be32(XFS_IBT_MAGIC):
aafc3c24	235	case cpu_to_be32(XFS_FIBT_MAGIC):
ee1a47ab CH	236	break;
	237	default:
	238	return 0;
	239	}
3d3e6f64	240
c5ab131b	241	/* level verification */
ee1a47ab CH	242	level = be16_to_cpu(block->bb_level);
	243	if (level >= mp->m_in_maxlevels)
	244	return false;
ee1a47ab	245
c5ab131b	246	return xfs_btree_sblock_verify(bp, mp->m_inobt_mxr[level != 0]);
612cfbfe DC	247	}
	248
	249	static void
1813dd64	250	xfs_inobt_read_verify(
612cfbfe DC	251	struct xfs_buf *bp)
612cfbfe DC	252	{
ce5028cf	253	if (!xfs_btree_sblock_verify_crc(bp))
2451337d	254	xfs_buf_ioerror(bp, -EFSBADCRC);
ce5028cf	255	else if (!xfs_inobt_verify(bp))
2451337d	256	xfs_buf_ioerror(bp, -EFSCORRUPTED);
ce5028cf ES	257
	258	if (bp->b_error) {
	259	trace_xfs_btree_corrupt(bp, _RET_IP_);
	260	xfs_verifier_error(bp);
ee1a47ab	261	}
612cfbfe	262	}
3d3e6f64	263
1813dd64 DC	264	static void
1813dd64 DC	265	xfs_inobt_write_verify(
612cfbfe DC	266	struct xfs_buf *bp)
612cfbfe DC	267	{
ee1a47ab CH	268	if (!xfs_inobt_verify(bp)) {
ee1a47ab CH	269	trace_xfs_btree_corrupt(bp, _RET_IP_);
2451337d	270	xfs_buf_ioerror(bp, -EFSCORRUPTED);
ce5028cf	271	xfs_verifier_error(bp);
e0d2c23a	272	return;
ee1a47ab CH	273	}
	274	xfs_btree_sblock_calc_crc(bp);
	275
3d3e6f64 DC	276	}
3d3e6f64 DC	277
1813dd64	278	const struct xfs_buf_ops xfs_inobt_buf_ops = {
233135b7	279	.name = "xfs_inobt",
1813dd64 DC	280	.verify_read = xfs_inobt_read_verify,
	281	.verify_write = xfs_inobt_write_verify,
	282	};
	283
742ae1e3	284	#if defined(DEBUG) \|\| defined(XFS_WARN)
4a26e66e CH	285	STATIC int
	286	xfs_inobt_keys_inorder(
	287	struct xfs_btree_cur *cur,
	288	union xfs_btree_key *k1,
	289	union xfs_btree_key *k2)
	290	{
	291	return be32_to_cpu(k1->inobt.ir_startino) <
	292	be32_to_cpu(k2->inobt.ir_startino);
	293	}
	294
	295	STATIC int
	296	xfs_inobt_recs_inorder(
	297	struct xfs_btree_cur *cur,
	298	union xfs_btree_rec *r1,
	299	union xfs_btree_rec *r2)
	300	{
	301	return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
	302	be32_to_cpu(r2->inobt.ir_startino);
	303	}
	304	#endif /* DEBUG */
	305
561f7d17	306	static const struct xfs_btree_ops xfs_inobt_ops = {
65f1eaea CH	307	.rec_len = sizeof(xfs_inobt_rec_t),
	308	.key_len = sizeof(xfs_inobt_key_t),
	309
561f7d17	310	.dup_cursor = xfs_inobt_dup_cursor,
344207ce	311	.set_root = xfs_inobt_set_root,
f5eb8e7c	312	.alloc_block = xfs_inobt_alloc_block,
d4b3a4b7	313	.free_block = xfs_inobt_free_block,
91cca5df	314	.get_minrecs = xfs_inobt_get_minrecs,
ce5e42db	315	.get_maxrecs = xfs_inobt_get_maxrecs,
fe033cc8	316	.init_key_from_rec = xfs_inobt_init_key_from_rec,
4b22a571 CH	317	.init_rec_from_key = xfs_inobt_init_rec_from_key,
4b22a571 CH	318	.init_rec_from_cur = xfs_inobt_init_rec_from_cur,
fe033cc8 CH	319	.init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
fe033cc8 CH	320	.key_diff = xfs_inobt_key_diff,
1813dd64	321	.buf_ops = &xfs_inobt_buf_ops,
742ae1e3	322	#if defined(DEBUG) \|\| defined(XFS_WARN)
4a26e66e CH	323	.keys_inorder = xfs_inobt_keys_inorder,
	324	.recs_inorder = xfs_inobt_recs_inorder,
	325	#endif
561f7d17 CH	326	};
561f7d17 CH	327
aafc3c24 BF	328	static const struct xfs_btree_ops xfs_finobt_ops = {
	329	.rec_len = sizeof(xfs_inobt_rec_t),
	330	.key_len = sizeof(xfs_inobt_key_t),
	331
	332	.dup_cursor = xfs_inobt_dup_cursor,
	333	.set_root = xfs_finobt_set_root,
	334	.alloc_block = xfs_inobt_alloc_block,
	335	.free_block = xfs_inobt_free_block,
	336	.get_minrecs = xfs_inobt_get_minrecs,
	337	.get_maxrecs = xfs_inobt_get_maxrecs,
	338	.init_key_from_rec = xfs_inobt_init_key_from_rec,
	339	.init_rec_from_key = xfs_inobt_init_rec_from_key,
	340	.init_rec_from_cur = xfs_inobt_init_rec_from_cur,
	341	.init_ptr_from_cur = xfs_finobt_init_ptr_from_cur,
	342	.key_diff = xfs_inobt_key_diff,
	343	.buf_ops = &xfs_inobt_buf_ops,
	344	#if defined(DEBUG) \|\| defined(XFS_WARN)
	345	.keys_inorder = xfs_inobt_keys_inorder,
	346	.recs_inorder = xfs_inobt_recs_inorder,
	347	#endif
	348	};
	349
561f7d17 CH	350	/*
	351	* Allocate a new inode btree cursor.
	352	*/
	353	struct xfs_btree_cur * /* new inode btree cursor */
	354	xfs_inobt_init_cursor(
	355	struct xfs_mount mp, / file system mount point */
	356	struct xfs_trans tp, / transaction pointer */
	357	struct xfs_buf agbp, / buffer for agi structure */
57bd3dbe BF	358	xfs_agnumber_t agno, /* allocation group number */
57bd3dbe BF	359	xfs_btnum_t btnum) /* ialloc or free ino btree */
561f7d17 CH	360	{
	361	struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
	362	struct xfs_btree_cur *cur;
	363
	364	cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
	365
	366	cur->bc_tp = tp;
	367	cur->bc_mp = mp;
57bd3dbe	368	cur->bc_btnum = btnum;
aafc3c24 BF	369	if (btnum == XFS_BTNUM_INO) {
	370	cur->bc_nlevels = be32_to_cpu(agi->agi_level);
	371	cur->bc_ops = &xfs_inobt_ops;
	372	} else {
	373	cur->bc_nlevels = be32_to_cpu(agi->agi_free_level);
	374	cur->bc_ops = &xfs_finobt_ops;
	375	}
	376
561f7d17 CH	377	cur->bc_blocklog = mp->m_sb.sb_blocklog;
561f7d17 CH	378
ee1a47ab CH	379	if (xfs_sb_version_hascrc(&mp->m_sb))
ee1a47ab CH	380	cur->bc_flags \|= XFS_BTREE_CRC_BLOCKS;
561f7d17 CH	381
	382	cur->bc_private.a.agbp = agbp;
	383	cur->bc_private.a.agno = agno;
	384
	385	return cur;
	386	}
60197e8d CH	387
	388	/*
	389	* Calculate number of records in an inobt btree block.
	390	*/
	391	int
	392	xfs_inobt_maxrecs(
	393	struct xfs_mount *mp,
	394	int blocklen,
	395	int leaf)
	396	{
7cc95a82	397	blocklen -= XFS_INOBT_BLOCK_LEN(mp);
60197e8d CH	398
	399	if (leaf)
	400	return blocklen / sizeof(xfs_inobt_rec_t);
	401	return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
	402	}
4148c347 BF	403
	404	/*
	405	* Convert the inode record holemask to an inode allocation bitmap. The inode
	406	* allocation bitmap is inode granularity and specifies whether an inode is
	407	* physically allocated on disk (not whether the inode is considered allocated
	408	* or free by the fs).
	409	*
	410	* A bit value of 1 means the inode is allocated, a value of 0 means it is free.
	411	*/
	412	uint64_t
	413	xfs_inobt_irec_to_allocmask(
	414	struct xfs_inobt_rec_incore *rec)
	415	{
	416	uint64_t bitmap = 0;
	417	uint64_t inodespbit;
	418	int nextbit;
	419	uint allocbitmap;
	420
	421	/*
	422	* The holemask has 16-bits for a 64 inode record. Therefore each
	423	* holemask bit represents multiple inodes. Create a mask of bits to set
	424	* in the allocmask for each holemask bit.
	425	*/
	426	inodespbit = (1 << XFS_INODES_PER_HOLEMASK_BIT) - 1;
	427
	428	/*
	429	* Allocated inodes are represented by 0 bits in holemask. Invert the 0
	430	* bits to 1 and convert to a uint so we can use xfs_next_bit(). Mask
	431	* anything beyond the 16 holemask bits since this casts to a larger
	432	* type.
	433	*/
	434	allocbitmap = ~rec->ir_holemask & ((1 << XFS_INOBT_HOLEMASK_BITS) - 1);
	435
	436	/*
	437	* allocbitmap is the inverted holemask so every set bit represents
	438	* allocated inodes. To expand from 16-bit holemask granularity to
	439	* 64-bit (e.g., bit-per-inode), set inodespbit bits in the target
	440	* bitmap for every holemask bit.
	441	*/
	442	nextbit = xfs_next_bit(&allocbitmap, 1, 0);
	443	while (nextbit != -1) {
	444	ASSERT(nextbit < (sizeof(rec->ir_holemask) * NBBY));
	445
	446	bitmap \|= (inodespbit <<
	447	(nextbit * XFS_INODES_PER_HOLEMASK_BIT));
	448
	449	nextbit = xfs_next_bit(&allocbitmap, 1, nextbit + 1);
	450	}
	451
	452	return bitmap;
	453	}
56d1115c BF	454
	455	#if defined(DEBUG) \|\| defined(XFS_WARN)
	456	/*
	457	* Verify that an in-core inode record has a valid inode count.
	458	*/
	459	int
	460	xfs_inobt_rec_check_count(
	461	struct xfs_mount *mp,
	462	struct xfs_inobt_rec_incore *rec)
	463	{
	464	int inocount = 0;
	465	int nextbit = 0;
	466	uint64_t allocbmap;
	467	int wordsz;
	468
	469	wordsz = sizeof(allocbmap) / sizeof(unsigned int);
	470	allocbmap = xfs_inobt_irec_to_allocmask(rec);
	471
	472	nextbit = xfs_next_bit((uint *) &allocbmap, wordsz, nextbit);
	473	while (nextbit != -1) {
	474	inocount++;
	475	nextbit = xfs_next_bit((uint *) &allocbmap, wordsz,
	476	nextbit + 1);
	477	}
	478
	479	if (inocount != rec->ir_count)
	480	return -EFSCORRUPTED;
	481
	482	return 0;
	483	}
	484	#endif /* DEBUG */