[deliverable/linux.git] / fs / xfs / 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_types.h"
#include "xfs_log.h"
#include "xfs_trans.h"
#include "xfs_sb.h"
#include "xfs_ag.h"
#include "xfs_mount.h"
#include "xfs_bmap_btree.h"
#include "xfs_alloc_btree.h"
#include "xfs_ialloc_btree.h"
#include "xfs_dinode.h"
#include "xfs_inode.h"
#include "xfs_btree.h"
#include "xfs_alloc.h"
#include "xfs_extent_busy.h"
#include "xfs_error.h"
#include "xfs_trace.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			length,
	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 void
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;
	int			sblock_ok; /* block passes checks */

	/*
	 * magic number and level verification
	 *
	 * During growfs operations, we can't verify the exact level as the
	 * perag is not fully initialised and hence not attached to the buffer.
	 * In this case, check against the maximum tree depth.
	 */
	level = be16_to_cpu(block->bb_level);
	switch (block->bb_magic) {
	case cpu_to_be32(XFS_ABTB_MAGIC):
		if (pag)
			sblock_ok = level < pag->pagf_levels[XFS_BTNUM_BNOi];
		else
			sblock_ok = level < mp->m_ag_maxlevels;
		break;
	case cpu_to_be32(XFS_ABTC_MAGIC):
		if (pag)
			sblock_ok = level < pag->pagf_levels[XFS_BTNUM_CNTi];
		else
			sblock_ok = level < mp->m_ag_maxlevels;
		break;
	default:
		sblock_ok = 0;
		break;
	}

	/* numrecs verification */
	sblock_ok = sblock_ok &&
		be16_to_cpu(block->bb_numrecs) <= mp->m_alloc_mxr[level != 0];

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

	if (!sblock_ok) {
		trace_xfs_btree_corrupt(bp, _RET_IP_);
		XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, mp, block);
		xfs_buf_ioerror(bp, EFSCORRUPTED);
	}
}

static void
xfs_allocbt_read_verify(
	struct xfs_buf	*bp)
{
	xfs_allocbt_verify(bp);
}

static void
xfs_allocbt_write_verify(
	struct xfs_buf	*bp)
{
	xfs_allocbt_verify(bp);
}

const struct xfs_buf_ops xfs_allocbt_buf_ops = {
	.verify_read = xfs_allocbt_read_verify,
	.verify_write = xfs_allocbt_write_verify,
};


#ifdef DEBUG
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,
#ifdef DEBUG
	.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;

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