[deliverable/linux.git] / fs / xfs / libxfs / xfs_alloc_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_sb.h"
#include "xfs_mount.h"
#include "xfs_btree.h"
#include "xfs_alloc_btree.h"
#include "xfs_alloc.h"
#include "xfs_extent_busy.h"
#include "xfs_error.h"
#include "xfs_trace.h"
#include "xfs_cksum.h"
#include "xfs_trans.h"


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

STATIC void
xfs_allocbt_set_root(
	struct xfs_btree_cur	*cur,
	union xfs_btree_ptr	*ptr,
	int			inc)
{
	struct xfs_buf		*agbp = cur->bc_private.a.agbp;
	struct xfs_agf		*agf = XFS_BUF_TO_AGF(agbp);
	xfs_agnumber_t		seqno = be32_to_cpu(agf->agf_seqno);
	int			btnum = cur->bc_btnum;
	struct xfs_perag	*pag = xfs_perag_get(cur->bc_mp, seqno);

	ASSERT(ptr->s != 0);

	agf->agf_roots[btnum] = ptr->s;
	be32_add_cpu(&agf->agf_levels[btnum], inc);
	pag->pagf_levels[btnum] += inc;
	xfs_perag_put(pag);

	xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS);
}

STATIC int
xfs_allocbt_alloc_block(
	struct xfs_btree_cur	*cur,
	union xfs_btree_ptr	*start,
	union xfs_btree_ptr	*new,
	int			*stat)
{
	int			error;
	xfs_agblock_t		bno;

	XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);

	/* Allocate the new block from the freelist. If we can't, give up.  */
	error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_private.a.agbp,
				       &bno, 1);
	if (error) {
		XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
		return error;
	}

	if (bno == NULLAGBLOCK) {
		XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
		*stat = 0;
		return 0;
	}

	xfs_extent_busy_reuse(cur->bc_mp, cur->bc_private.a.agno, bno, 1, false);

	xfs_trans_agbtree_delta(cur->bc_tp, 1);
	new->s = cpu_to_be32(bno);

	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	*stat = 1;
	return 0;
}

STATIC int
xfs_allocbt_free_block(
	struct xfs_btree_cur	*cur,
	struct xfs_buf		*bp)
{
	struct xfs_buf		*agbp = cur->bc_private.a.agbp;
	struct xfs_agf		*agf = XFS_BUF_TO_AGF(agbp);
	xfs_agblock_t		bno;
	int			error;

	bno = xfs_daddr_to_agbno(cur->bc_mp, XFS_BUF_ADDR(bp));
	error = xfs_alloc_put_freelist(cur->bc_tp, agbp, NULL, bno, 1);
	if (error)
		return error;

	xfs_extent_busy_insert(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1,
			      XFS_EXTENT_BUSY_SKIP_DISCARD);
	xfs_trans_agbtree_delta(cur->bc_tp, -1);

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

/*
 * Update the longest extent in the AGF
 */
STATIC void
xfs_allocbt_update_lastrec(
	struct xfs_btree_cur	*cur,
	struct xfs_btree_block	*block,
	union xfs_btree_rec	*rec,
	int			ptr,
	int			reason)
{
	struct xfs_agf		*agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
	xfs_agnumber_t		seqno = be32_to_cpu(agf->agf_seqno);
	struct xfs_perag	*pag;
	__be32			len;
	int			numrecs;

	ASSERT(cur->bc_btnum == XFS_BTNUM_CNT);

	switch (reason) {
	case LASTREC_UPDATE:
		/*
		 * If this is the last leaf block and it's the last record,
		 * then update the size of the longest extent in the AG.
		 */
		if (ptr != xfs_btree_get_numrecs(block))
			return;
		len = rec->alloc.ar_blockcount;
		break;
	case LASTREC_INSREC:
		if (be32_to_cpu(rec->alloc.ar_blockcount) <=
		    be32_to_cpu(agf->agf_longest))
			return;
		len = rec->alloc.ar_blockcount;
		break;
	case LASTREC_DELREC:
		numrecs = xfs_btree_get_numrecs(block);
		if (ptr <= numrecs)
			return;
		ASSERT(ptr == numrecs + 1);

		if (numrecs) {
			xfs_alloc_rec_t *rrp;

			rrp = XFS_ALLOC_REC_ADDR(cur->bc_mp, block, numrecs);
			len = rrp->ar_blockcount;
		} else {
			len = 0;
		}

		break;
	default:
		ASSERT(0);
		return;
	}

	agf->agf_longest = len;
	pag = xfs_perag_get(cur->bc_mp, seqno);
	pag->pagf_longest = be32_to_cpu(len);
	xfs_perag_put(pag);
	xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, XFS_AGF_LONGEST);
}

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

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

STATIC void
xfs_allocbt_init_key_from_rec(
	union xfs_btree_key	*key,
	union xfs_btree_rec	*rec)
{
	ASSERT(rec->alloc.ar_startblock != 0);

	key->alloc.ar_startblock = rec->alloc.ar_startblock;
	key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
}

STATIC void
xfs_allocbt_init_rec_from_key(
	union xfs_btree_key	*key,
	union xfs_btree_rec	*rec)
{
	ASSERT(key->alloc.ar_startblock != 0);

	rec->alloc.ar_startblock = key->alloc.ar_startblock;
	rec->alloc.ar_blockcount = key->alloc.ar_blockcount;
}

STATIC void
xfs_allocbt_init_rec_from_cur(
	struct xfs_btree_cur	*cur,
	union xfs_btree_rec	*rec)
{
	ASSERT(cur->bc_rec.a.ar_startblock != 0);

	rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
	rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
}

STATIC void
xfs_allocbt_init_ptr_from_cur(
	struct xfs_btree_cur	*cur,
	union xfs_btree_ptr	*ptr)
{
	struct xfs_agf		*agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);

	ASSERT(cur->bc_private.a.agno == be32_to_cpu(agf->agf_seqno));
	ASSERT(agf->agf_roots[cur->bc_btnum] != 0);

	ptr->s = agf->agf_roots[cur->bc_btnum];
}

STATIC __int64_t
xfs_allocbt_key_diff(
	struct xfs_btree_cur	*cur,
	union xfs_btree_key	*key)
{
	xfs_alloc_rec_incore_t	*rec = &cur->bc_rec.a;
	xfs_alloc_key_t		*kp = &key->alloc;
	__int64_t		diff;

	if (cur->bc_btnum == XFS_BTNUM_BNO) {
		return (__int64_t)be32_to_cpu(kp->ar_startblock) -
				rec->ar_startblock;
	}

	diff = (__int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount;
	if (diff)
		return diff;

	return (__int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
}

static bool
xfs_allocbt_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;

	/*
	 * magic number and level verification
	 *
	 * During growfs operations, we can't verify the exact level or owner as
	 * the perag is not fully initialised and hence not attached to the
	 * buffer.  In this case, check against the maximum tree depth.
	 *
	 * Similarly, during log recovery we will have a perag structure
	 * attached, but the agf information will not yet have been initialised
	 * from the on disk AGF. Again, we can only check against maximum limits
	 * in this case.
	 */
	level = be16_to_cpu(block->bb_level);
	switch (block->bb_magic) {
	case cpu_to_be32(XFS_ABTB_CRC_MAGIC):
		if (!xfs_btree_sblock_v5hdr_verify(bp))
			return false;
		/* fall through */
	case cpu_to_be32(XFS_ABTB_MAGIC):
		if (pag && pag->pagf_init) {
			if (level >= pag->pagf_levels[XFS_BTNUM_BNOi])
				return false;
		} else if (level >= mp->m_ag_maxlevels)
			return false;
		break;
	case cpu_to_be32(XFS_ABTC_CRC_MAGIC):
		if (!xfs_btree_sblock_v5hdr_verify(bp))
			return false;
		/* fall through */
	case cpu_to_be32(XFS_ABTC_MAGIC):
		if (pag && pag->pagf_init) {
			if (level >= pag->pagf_levels[XFS_BTNUM_CNTi])
				return false;
		} else if (level >= mp->m_ag_maxlevels)
			return false;
		break;
	default:
		return false;
	}

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

static void
xfs_allocbt_read_verify(
	struct xfs_buf	*bp)
{
	if (!xfs_btree_sblock_verify_crc(bp))
		xfs_buf_ioerror(bp, -EFSBADCRC);
	else if (!xfs_allocbt_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_allocbt_write_verify(
	struct xfs_buf	*bp)
{
	if (!xfs_allocbt_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_allocbt_buf_ops = {
	.name = "xfs_allocbt",
	.verify_read = xfs_allocbt_read_verify,
	.verify_write = xfs_allocbt_write_verify,
};


#if defined(DEBUG) || defined(XFS_WARN)
STATIC int
xfs_allocbt_keys_inorder(
	struct xfs_btree_cur	*cur,
	union xfs_btree_key	*k1,
	union xfs_btree_key	*k2)
{
	if (cur->bc_btnum == XFS_BTNUM_BNO) {
		return be32_to_cpu(k1->alloc.ar_startblock) <
		       be32_to_cpu(k2->alloc.ar_startblock);
	} else {
		return be32_to_cpu(k1->alloc.ar_blockcount) <
			be32_to_cpu(k2->alloc.ar_blockcount) ||
			(k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
			 be32_to_cpu(k1->alloc.ar_startblock) <
			 be32_to_cpu(k2->alloc.ar_startblock));
	}
}

STATIC int
xfs_allocbt_recs_inorder(
	struct xfs_btree_cur	*cur,
	union xfs_btree_rec	*r1,
	union xfs_btree_rec	*r2)
{
	if (cur->bc_btnum == XFS_BTNUM_BNO) {
		return be32_to_cpu(r1->alloc.ar_startblock) +
			be32_to_cpu(r1->alloc.ar_blockcount) <=
			be32_to_cpu(r2->alloc.ar_startblock);
	} else {
		return be32_to_cpu(r1->alloc.ar_blockcount) <
			be32_to_cpu(r2->alloc.ar_blockcount) ||
			(r1->alloc.ar_blockcount == r2->alloc.ar_blockcount &&
			 be32_to_cpu(r1->alloc.ar_startblock) <
			 be32_to_cpu(r2->alloc.ar_startblock));
	}
}
#endif	/* DEBUG */

static const struct xfs_btree_ops xfs_allocbt_ops = {
	.rec_len		= sizeof(xfs_alloc_rec_t),
	.key_len		= sizeof(xfs_alloc_key_t),

	.dup_cursor		= xfs_allocbt_dup_cursor,
	.set_root		= xfs_allocbt_set_root,
	.alloc_block		= xfs_allocbt_alloc_block,
	.free_block		= xfs_allocbt_free_block,
	.update_lastrec		= xfs_allocbt_update_lastrec,
	.get_minrecs		= xfs_allocbt_get_minrecs,
	.get_maxrecs		= xfs_allocbt_get_maxrecs,
	.init_key_from_rec	= xfs_allocbt_init_key_from_rec,
	.init_rec_from_key	= xfs_allocbt_init_rec_from_key,
	.init_rec_from_cur	= xfs_allocbt_init_rec_from_cur,
	.init_ptr_from_cur	= xfs_allocbt_init_ptr_from_cur,
	.key_diff		= xfs_allocbt_key_diff,
	.buf_ops		= &xfs_allocbt_buf_ops,
#if defined(DEBUG) || defined(XFS_WARN)
	.keys_inorder		= xfs_allocbt_keys_inorder,
	.recs_inorder		= xfs_allocbt_recs_inorder,
#endif
};

/*
 * Allocate a new allocation btree cursor.
 */
struct xfs_btree_cur *			/* new alloc btree cursor */
xfs_allocbt_init_cursor(
	struct xfs_mount	*mp,		/* file system mount point */
	struct xfs_trans	*tp,		/* transaction pointer */
	struct xfs_buf		*agbp,		/* buffer for agf structure */
	xfs_agnumber_t		agno,		/* allocation group number */
	xfs_btnum_t		btnum)		/* btree identifier */
{
	struct xfs_agf		*agf = XFS_BUF_TO_AGF(agbp);
	struct xfs_btree_cur	*cur;

	ASSERT(btnum == XFS_BTNUM_BNO || btnum == XFS_BTNUM_CNT);

	cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);

	cur->bc_tp = tp;
	cur->bc_mp = mp;
	cur->bc_btnum = btnum;
	cur->bc_blocklog = mp->m_sb.sb_blocklog;
	cur->bc_ops = &xfs_allocbt_ops;

	if (btnum == XFS_BTNUM_CNT) {
		cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]);
		cur->bc_flags = XFS_BTREE_LASTREC_UPDATE;
	} else {
		cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]);
	}

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

	if (xfs_sb_version_hascrc(&mp->m_sb))
		cur->bc_flags |= XFS_BTREE_CRC_BLOCKS;

	return cur;
}

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

	if (leaf)
		return blocklen / sizeof(xfs_alloc_rec_t);
	return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_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"
1da177e4	24	#include "xfs_sb.h"
1da177e4	25	#include "xfs_mount.h"
1da177e4	26	#include "xfs_btree.h"
a4fbe6ab	27	#include "xfs_alloc_btree.h"
1da177e4	28	#include "xfs_alloc.h"
efc27b52	29	#include "xfs_extent_busy.h"
1da177e4	30	#include "xfs_error.h"
0b1b213f	31	#include "xfs_trace.h"
ee1a47ab	32	#include "xfs_cksum.h"
239880ef	33	#include "xfs_trans.h"
1da177e4	34
1da177e4	35
278d0ca1 CH	36	STATIC struct xfs_btree_cur *
	37	xfs_allocbt_dup_cursor(
	38	struct xfs_btree_cur *cur)
	39	{
	40	return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp,
	41	cur->bc_private.a.agbp, cur->bc_private.a.agno,
	42	cur->bc_btnum);
	43	}
	44
344207ce CH	45	STATIC void
	46	xfs_allocbt_set_root(
	47	struct xfs_btree_cur *cur,
	48	union xfs_btree_ptr *ptr,
	49	int inc)
	50	{
	51	struct xfs_buf *agbp = cur->bc_private.a.agbp;
	52	struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
	53	xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno);
	54	int btnum = cur->bc_btnum;
a862e0fd	55	struct xfs_perag *pag = xfs_perag_get(cur->bc_mp, seqno);
344207ce CH	56
	57	ASSERT(ptr->s != 0);
	58
	59	agf->agf_roots[btnum] = ptr->s;
	60	be32_add_cpu(&agf->agf_levels[btnum], inc);
a862e0fd DC	61	pag->pagf_levels[btnum] += inc;
a862e0fd DC	62	xfs_perag_put(pag);
344207ce CH	63
	64	xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS \| XFS_AGF_LEVELS);
	65	}
	66
f5eb8e7c CH	67	STATIC int
	68	xfs_allocbt_alloc_block(
	69	struct xfs_btree_cur *cur,
	70	union xfs_btree_ptr *start,
	71	union xfs_btree_ptr *new,
f5eb8e7c CH	72	int *stat)
	73	{
	74	int error;
	75	xfs_agblock_t bno;
	76
	77	XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
	78
	79	/* Allocate the new block from the freelist. If we can't, give up. */
	80	error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_private.a.agbp,
	81	&bno, 1);
	82	if (error) {
	83	XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
	84	return error;
	85	}
	86
	87	if (bno == NULLAGBLOCK) {
	88	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	89	*stat = 0;
	90	return 0;
	91	}
97d3ac75	92
4ecbfe63	93	xfs_extent_busy_reuse(cur->bc_mp, cur->bc_private.a.agno, bno, 1, false);
f5eb8e7c CH	94
	95	xfs_trans_agbtree_delta(cur->bc_tp, 1);
	96	new->s = cpu_to_be32(bno);
	97
	98	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	99	*stat = 1;
	100	return 0;
	101	}
	102
d4b3a4b7 CH	103	STATIC int
	104	xfs_allocbt_free_block(
	105	struct xfs_btree_cur *cur,
	106	struct xfs_buf *bp)
	107	{
	108	struct xfs_buf *agbp = cur->bc_private.a.agbp;
	109	struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
	110	xfs_agblock_t bno;
	111	int error;
	112
b6e32227	113	bno = xfs_daddr_to_agbno(cur->bc_mp, XFS_BUF_ADDR(bp));
d4b3a4b7 CH	114	error = xfs_alloc_put_freelist(cur->bc_tp, agbp, NULL, bno, 1);
	115	if (error)
	116	return error;
	117
4ecbfe63 DC	118	xfs_extent_busy_insert(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1,
4ecbfe63 DC	119	XFS_EXTENT_BUSY_SKIP_DISCARD);
d4b3a4b7	120	xfs_trans_agbtree_delta(cur->bc_tp, -1);
4c05f9ad DC	121
4c05f9ad DC	122	xfs_trans_binval(cur->bc_tp, bp);
d4b3a4b7 CH	123	return 0;
	124	}
	125
1da177e4	126	/*
278d0ca1	127	* Update the longest extent in the AGF
1da177e4	128	*/
278d0ca1 CH	129	STATIC void
	130	xfs_allocbt_update_lastrec(
	131	struct xfs_btree_cur *cur,
	132	struct xfs_btree_block *block,
	133	union xfs_btree_rec *rec,
	134	int ptr,
	135	int reason)
1da177e4	136	{
278d0ca1 CH	137	struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
278d0ca1 CH	138	xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno);
a862e0fd	139	struct xfs_perag *pag;
278d0ca1	140	__be32 len;
91cca5df	141	int numrecs;
1da177e4	142
278d0ca1	143	ASSERT(cur->bc_btnum == XFS_BTNUM_CNT);
1da177e4	144
278d0ca1 CH	145	switch (reason) {
278d0ca1 CH	146	case LASTREC_UPDATE:
1da177e4	147	/*
278d0ca1 CH	148	* If this is the last leaf block and it's the last record,
278d0ca1 CH	149	* then update the size of the longest extent in the AG.
1da177e4	150	*/
278d0ca1 CH	151	if (ptr != xfs_btree_get_numrecs(block))
	152	return;
	153	len = rec->alloc.ar_blockcount;
	154	break;
4b22a571 CH	155	case LASTREC_INSREC:
	156	if (be32_to_cpu(rec->alloc.ar_blockcount) <=
	157	be32_to_cpu(agf->agf_longest))
	158	return;
	159	len = rec->alloc.ar_blockcount;
91cca5df CH	160	break;
	161	case LASTREC_DELREC:
	162	numrecs = xfs_btree_get_numrecs(block);
	163	if (ptr <= numrecs)
	164	return;
	165	ASSERT(ptr == numrecs + 1);
	166
	167	if (numrecs) {
	168	xfs_alloc_rec_t *rrp;
	169
136341b4	170	rrp = XFS_ALLOC_REC_ADDR(cur->bc_mp, block, numrecs);
91cca5df CH	171	len = rrp->ar_blockcount;
	172	} else {
	173	len = 0;
	174	}
	175
4b22a571	176	break;
278d0ca1 CH	177	default:
	178	ASSERT(0);
	179	return;
1da177e4	180	}
561f7d17	181
278d0ca1	182	agf->agf_longest = len;
a862e0fd DC	183	pag = xfs_perag_get(cur->bc_mp, seqno);
	184	pag->pagf_longest = be32_to_cpu(len);
	185	xfs_perag_put(pag);
278d0ca1	186	xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, XFS_AGF_LONGEST);
561f7d17 CH	187	}
561f7d17 CH	188
91cca5df CH	189	STATIC int
	190	xfs_allocbt_get_minrecs(
	191	struct xfs_btree_cur *cur,
	192	int level)
	193	{
	194	return cur->bc_mp->m_alloc_mnr[level != 0];
	195	}
	196
ce5e42db CH	197	STATIC int
	198	xfs_allocbt_get_maxrecs(
	199	struct xfs_btree_cur *cur,
	200	int level)
	201	{
	202	return cur->bc_mp->m_alloc_mxr[level != 0];
	203	}
	204
fe033cc8 CH	205	STATIC void
	206	xfs_allocbt_init_key_from_rec(
	207	union xfs_btree_key *key,
	208	union xfs_btree_rec *rec)
	209	{
	210	ASSERT(rec->alloc.ar_startblock != 0);
	211
	212	key->alloc.ar_startblock = rec->alloc.ar_startblock;
	213	key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
	214	}
	215
4b22a571 CH	216	STATIC void
	217	xfs_allocbt_init_rec_from_key(
	218	union xfs_btree_key *key,
	219	union xfs_btree_rec *rec)
	220	{
	221	ASSERT(key->alloc.ar_startblock != 0);
	222
	223	rec->alloc.ar_startblock = key->alloc.ar_startblock;
	224	rec->alloc.ar_blockcount = key->alloc.ar_blockcount;
	225	}
	226
	227	STATIC void
	228	xfs_allocbt_init_rec_from_cur(
	229	struct xfs_btree_cur *cur,
	230	union xfs_btree_rec *rec)
	231	{
	232	ASSERT(cur->bc_rec.a.ar_startblock != 0);
	233
	234	rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
	235	rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
	236	}
	237
fe033cc8 CH	238	STATIC void
	239	xfs_allocbt_init_ptr_from_cur(
	240	struct xfs_btree_cur *cur,
	241	union xfs_btree_ptr *ptr)
	242	{
	243	struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
	244
	245	ASSERT(cur->bc_private.a.agno == be32_to_cpu(agf->agf_seqno));
	246	ASSERT(agf->agf_roots[cur->bc_btnum] != 0);
	247
	248	ptr->s = agf->agf_roots[cur->bc_btnum];
	249	}
	250
	251	STATIC __int64_t
	252	xfs_allocbt_key_diff(
	253	struct xfs_btree_cur *cur,
	254	union xfs_btree_key *key)
	255	{
	256	xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a;
	257	xfs_alloc_key_t *kp = &key->alloc;
	258	__int64_t diff;
	259
	260	if (cur->bc_btnum == XFS_BTNUM_BNO) {
	261	return (__int64_t)be32_to_cpu(kp->ar_startblock) -
	262	rec->ar_startblock;
	263	}
	264
	265	diff = (__int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount;
	266	if (diff)
	267	return diff;
	268
	269	return (__int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
	270	}
	271
ee1a47ab	272	static bool
612cfbfe	273	xfs_allocbt_verify(
3d3e6f64 DC	274	struct xfs_buf *bp)
	275	{
	276	struct xfs_mount *mp = bp->b_target->bt_mount;
	277	struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
	278	struct xfs_perag *pag = bp->b_pag;
	279	unsigned int level;
3d3e6f64 DC	280
	281	/*
	282	* magic number and level verification
	283	*
ee1a47ab CH	284	* During growfs operations, we can't verify the exact level or owner as
	285	* the perag is not fully initialised and hence not attached to the
	286	* buffer. In this case, check against the maximum tree depth.
	287	*
	288	* Similarly, during log recovery we will have a perag structure
	289	* attached, but the agf information will not yet have been initialised
	290	* from the on disk AGF. Again, we can only check against maximum limits
	291	* in this case.
3d3e6f64 DC	292	*/
	293	level = be16_to_cpu(block->bb_level);
	294	switch (block->bb_magic) {
ee1a47ab	295	case cpu_to_be32(XFS_ABTB_CRC_MAGIC):
c5ab131b	296	if (!xfs_btree_sblock_v5hdr_verify(bp))
ee1a47ab CH	297	return false;
ee1a47ab CH	298	/* fall through */
3d3e6f64	299	case cpu_to_be32(XFS_ABTB_MAGIC):
ee1a47ab CH	300	if (pag && pag->pagf_init) {
	301	if (level >= pag->pagf_levels[XFS_BTNUM_BNOi])
	302	return false;
	303	} else if (level >= mp->m_ag_maxlevels)
	304	return false;
3d3e6f64	305	break;
ee1a47ab	306	case cpu_to_be32(XFS_ABTC_CRC_MAGIC):
c5ab131b	307	if (!xfs_btree_sblock_v5hdr_verify(bp))
ee1a47ab CH	308	return false;
ee1a47ab CH	309	/* fall through */
3d3e6f64	310	case cpu_to_be32(XFS_ABTC_MAGIC):
ee1a47ab CH	311	if (pag && pag->pagf_init) {
	312	if (level >= pag->pagf_levels[XFS_BTNUM_CNTi])
	313	return false;
	314	} else if (level >= mp->m_ag_maxlevels)
	315	return false;
3d3e6f64 DC	316	break;
3d3e6f64 DC	317	default:
ee1a47ab	318	return false;
3d3e6f64 DC	319	}
3d3e6f64 DC	320
c5ab131b	321	return xfs_btree_sblock_verify(bp, mp->m_alloc_mxr[level != 0]);
612cfbfe	322	}
3d3e6f64	323
612cfbfe	324	static void
1813dd64	325	xfs_allocbt_read_verify(
612cfbfe DC	326	struct xfs_buf *bp)
612cfbfe DC	327	{
ce5028cf	328	if (!xfs_btree_sblock_verify_crc(bp))
2451337d	329	xfs_buf_ioerror(bp, -EFSBADCRC);
ce5028cf	330	else if (!xfs_allocbt_verify(bp))
2451337d	331	xfs_buf_ioerror(bp, -EFSCORRUPTED);
ce5028cf ES	332
	333	if (bp->b_error) {
	334	trace_xfs_btree_corrupt(bp, _RET_IP_);
	335	xfs_verifier_error(bp);
ee1a47ab	336	}
612cfbfe DC	337	}
612cfbfe DC	338
1813dd64 DC	339	static void
1813dd64 DC	340	xfs_allocbt_write_verify(
612cfbfe DC	341	struct xfs_buf *bp)
612cfbfe DC	342	{
ee1a47ab CH	343	if (!xfs_allocbt_verify(bp)) {
ee1a47ab CH	344	trace_xfs_btree_corrupt(bp, _RET_IP_);
2451337d	345	xfs_buf_ioerror(bp, -EFSCORRUPTED);
ce5028cf	346	xfs_verifier_error(bp);
e0d2c23a	347	return;
ee1a47ab CH	348	}
	349	xfs_btree_sblock_calc_crc(bp);
	350
3d3e6f64 DC	351	}
3d3e6f64 DC	352
1813dd64	353	const struct xfs_buf_ops xfs_allocbt_buf_ops = {
233135b7	354	.name = "xfs_allocbt",
1813dd64 DC	355	.verify_read = xfs_allocbt_read_verify,
	356	.verify_write = xfs_allocbt_write_verify,
	357	};
	358
	359
742ae1e3	360	#if defined(DEBUG) \|\| defined(XFS_WARN)
4a26e66e CH	361	STATIC int
	362	xfs_allocbt_keys_inorder(
	363	struct xfs_btree_cur *cur,
	364	union xfs_btree_key *k1,
	365	union xfs_btree_key *k2)
	366	{
	367	if (cur->bc_btnum == XFS_BTNUM_BNO) {
	368	return be32_to_cpu(k1->alloc.ar_startblock) <
	369	be32_to_cpu(k2->alloc.ar_startblock);
	370	} else {
	371	return be32_to_cpu(k1->alloc.ar_blockcount) <
	372	be32_to_cpu(k2->alloc.ar_blockcount) \|\|
	373	(k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
	374	be32_to_cpu(k1->alloc.ar_startblock) <
	375	be32_to_cpu(k2->alloc.ar_startblock));
	376	}
	377	}
	378
	379	STATIC int
	380	xfs_allocbt_recs_inorder(
	381	struct xfs_btree_cur *cur,
	382	union xfs_btree_rec *r1,
	383	union xfs_btree_rec *r2)
	384	{
	385	if (cur->bc_btnum == XFS_BTNUM_BNO) {
	386	return be32_to_cpu(r1->alloc.ar_startblock) +
	387	be32_to_cpu(r1->alloc.ar_blockcount) <=
	388	be32_to_cpu(r2->alloc.ar_startblock);
	389	} else {
	390	return be32_to_cpu(r1->alloc.ar_blockcount) <
	391	be32_to_cpu(r2->alloc.ar_blockcount) \|\|
	392	(r1->alloc.ar_blockcount == r2->alloc.ar_blockcount &&
	393	be32_to_cpu(r1->alloc.ar_startblock) <
	394	be32_to_cpu(r2->alloc.ar_startblock));
	395	}
	396	}
	397	#endif /* DEBUG */
	398
561f7d17	399	static const struct xfs_btree_ops xfs_allocbt_ops = {
65f1eaea CH	400	.rec_len = sizeof(xfs_alloc_rec_t),
	401	.key_len = sizeof(xfs_alloc_key_t),
	402
561f7d17	403	.dup_cursor = xfs_allocbt_dup_cursor,
344207ce	404	.set_root = xfs_allocbt_set_root,
f5eb8e7c	405	.alloc_block = xfs_allocbt_alloc_block,
d4b3a4b7	406	.free_block = xfs_allocbt_free_block,
278d0ca1	407	.update_lastrec = xfs_allocbt_update_lastrec,
91cca5df	408	.get_minrecs = xfs_allocbt_get_minrecs,
ce5e42db	409	.get_maxrecs = xfs_allocbt_get_maxrecs,
fe033cc8	410	.init_key_from_rec = xfs_allocbt_init_key_from_rec,
4b22a571 CH	411	.init_rec_from_key = xfs_allocbt_init_rec_from_key,
4b22a571 CH	412	.init_rec_from_cur = xfs_allocbt_init_rec_from_cur,
fe033cc8 CH	413	.init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur,
fe033cc8 CH	414	.key_diff = xfs_allocbt_key_diff,
1813dd64	415	.buf_ops = &xfs_allocbt_buf_ops,
742ae1e3	416	#if defined(DEBUG) \|\| defined(XFS_WARN)
4a26e66e CH	417	.keys_inorder = xfs_allocbt_keys_inorder,
	418	.recs_inorder = xfs_allocbt_recs_inorder,
	419	#endif
561f7d17 CH	420	};
	421
	422	/*
	423	* Allocate a new allocation btree cursor.
	424	*/
	425	struct xfs_btree_cur * /* new alloc btree cursor */
	426	xfs_allocbt_init_cursor(
	427	struct xfs_mount mp, / file system mount point */
	428	struct xfs_trans tp, / transaction pointer */
	429	struct xfs_buf agbp, / buffer for agf structure */
	430	xfs_agnumber_t agno, /* allocation group number */
	431	xfs_btnum_t btnum) /* btree identifier */
	432	{
	433	struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
	434	struct xfs_btree_cur *cur;
	435
	436	ASSERT(btnum == XFS_BTNUM_BNO \|\| btnum == XFS_BTNUM_CNT);
	437
	438	cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
	439
	440	cur->bc_tp = tp;
	441	cur->bc_mp = mp;
561f7d17 CH	442	cur->bc_btnum = btnum;
561f7d17 CH	443	cur->bc_blocklog = mp->m_sb.sb_blocklog;
561f7d17	444	cur->bc_ops = &xfs_allocbt_ops;
dec58f1d CH	445
	446	if (btnum == XFS_BTNUM_CNT) {
	447	cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]);
278d0ca1	448	cur->bc_flags = XFS_BTREE_LASTREC_UPDATE;
dec58f1d CH	449	} else {
	450	cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]);
	451	}
561f7d17 CH	452
	453	cur->bc_private.a.agbp = agbp;
	454	cur->bc_private.a.agno = agno;
	455
ee1a47ab CH	456	if (xfs_sb_version_hascrc(&mp->m_sb))
	457	cur->bc_flags \|= XFS_BTREE_CRC_BLOCKS;
	458
561f7d17 CH	459	return cur;
561f7d17 CH	460	}
60197e8d CH	461
	462	/*
	463	* Calculate number of records in an alloc btree block.
	464	*/
	465	int
	466	xfs_allocbt_maxrecs(
	467	struct xfs_mount *mp,
	468	int blocklen,
	469	int leaf)
	470	{
7cc95a82	471	blocklen -= XFS_ALLOC_BLOCK_LEN(mp);
60197e8d CH	472
	473	if (leaf)
	474	return blocklen / sizeof(xfs_alloc_rec_t);
	475	return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_ptr_t));
	476	}