[linux-2.6-block.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_bit.h"
#include "xfs_log.h"
#include "xfs_inum.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_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_alloc_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_alloc_busy_insert(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1,
			      XFS_ALLOC_BUSY_SKIP_DISCARD);
	xfs_trans_agbtree_delta(cur->bc_tp, -1);
	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;
}

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