[linux.git] / fs / xfs / xfs_ialloc_btree.c

/*
 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
 * All Rights Reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it would be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write the Free Software Foundation,
 * Inc.,  51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 */
#include "xfs.h"
#include "xfs_fs.h"
#include "xfs_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_ialloc.h"
#include "xfs_alloc.h"
#include "xfs_error.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);
}

STATIC void
xfs_inobt_set_root(
	struct xfs_btree_cur	*cur,
	union xfs_btree_ptr	*nptr,
	int			inc)	/* level change */
{
	struct xfs_buf		*agbp = cur->bc_private.a.agbp;
	struct xfs_agi		*agi = XFS_BUF_TO_AGI(agbp);

	agi->agi_root = nptr->s;
	be32_add_cpu(&agi->agi_level, inc);
	xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL);
}

STATIC int
xfs_inobt_alloc_block(
	struct xfs_btree_cur	*cur,
	union xfs_btree_ptr	*start,
	union xfs_btree_ptr	*new,
	int			length,
	int			*stat)
{
	xfs_alloc_arg_t		args;		/* block allocation args */
	int			error;		/* error return value */
	xfs_agblock_t		sbno = be32_to_cpu(start->s);

	XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);

	memset(&args, 0, sizeof(args));
	args.tp = cur->bc_tp;
	args.mp = cur->bc_mp;
	args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
	args.minlen = 1;
	args.maxlen = 1;
	args.prod = 1;
	args.type = XFS_ALLOCTYPE_NEAR_BNO;

	error = xfs_alloc_vextent(&args);
	if (error) {
		XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
		return error;
	}
	if (args.fsbno == NULLFSBLOCK) {
		XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
		*stat = 0;
		return 0;
	}
	ASSERT(args.len == 1);
	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);

	new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
	*stat = 1;
	return 0;
}

STATIC int
xfs_inobt_free_block(
	struct xfs_btree_cur	*cur,
	struct xfs_buf		*bp)
{
	xfs_fsblock_t		fsbno;
	int			error;

	fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp));
	error = xfs_free_extent(cur->bc_tp, fsbno, 1);
	if (error)
		return error;

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

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

STATIC void
xfs_inobt_init_key_from_rec(
	union xfs_btree_key	*key,
	union xfs_btree_rec	*rec)
{
	key->inobt.ir_startino = rec->inobt.ir_startino;
}

STATIC void
xfs_inobt_init_rec_from_key(
	union xfs_btree_key	*key,
	union xfs_btree_rec	*rec)
{
	rec->inobt.ir_startino = key->inobt.ir_startino;
}

STATIC void
xfs_inobt_init_rec_from_cur(
	struct xfs_btree_cur	*cur,
	union xfs_btree_rec	*rec)
{
	rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
	rec->inobt.ir_freecount = cpu_to_be32(cur->bc_rec.i.ir_freecount);
	rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
}

/*
 * initial value of ptr for lookup
 */
STATIC void
xfs_inobt_init_ptr_from_cur(
	struct xfs_btree_cur	*cur,
	union xfs_btree_ptr	*ptr)
{
	struct xfs_agi		*agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);

	ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));

	ptr->s = agi->agi_root;
}

STATIC __int64_t
xfs_inobt_key_diff(
	struct xfs_btree_cur	*cur,
	union xfs_btree_key	*key)
{
	return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
			  cur->bc_rec.i.ir_startino;
}

#ifdef DEBUG
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,
#ifdef DEBUG
	.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 */
{
	struct xfs_agi		*agi = XFS_BUF_TO_AGI(agbp);
	struct xfs_btree_cur	*cur;

	cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);

	cur->bc_tp = tp;
	cur->bc_mp = mp;
	cur->bc_nlevels = be32_to_cpu(agi->agi_level);
	cur->bc_btnum = XFS_BTNUM_INO;
	cur->bc_blocklog = mp->m_sb.sb_blocklog;

	cur->bc_ops = &xfs_inobt_ops;

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

	return cur;
}

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

	if (leaf)
		return blocklen / sizeof(xfs_inobt_rec_t);
	return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
}
Commit	Line	Data
1da177e4	1	/*
7b718769 NS	2	* Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
7b718769 NS	3	* All Rights Reserved.
1da177e4	4	*
7b718769 NS	5	* This program is free software; you can redistribute it and/or
7b718769 NS	6	* modify it under the terms of the GNU General Public License as
1da177e4 LT	7	* published by the Free Software Foundation.
1da177e4 LT	8	*
7b718769 NS	9	* This program is distributed in the hope that it would be useful,
	10	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	11	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	12	* GNU General Public License for more details.
1da177e4	13	*
7b718769 NS	14	* You should have received a copy of the GNU General Public License
	15	* along with this program; if not, write the Free Software Foundation,
	16	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
1da177e4	17	*/
1da177e4	18	#include "xfs.h"
a844f451	19	#include "xfs_fs.h"
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"
1da177e4	28	#include "xfs_bmap_btree.h"
a844f451	29	#include "xfs_alloc_btree.h"
1da177e4	30	#include "xfs_ialloc_btree.h"
a844f451 NS	31	#include "xfs_dinode.h"
a844f451 NS	32	#include "xfs_inode.h"
1da177e4 LT	33	#include "xfs_btree.h"
	34	#include "xfs_ialloc.h"
	35	#include "xfs_alloc.h"
	36	#include "xfs_error.h"
	37
1da177e4	38
91cca5df CH	39	STATIC int
	40	xfs_inobt_get_minrecs(
	41	struct xfs_btree_cur *cur,
	42	int level)
	43	{
	44	return cur->bc_mp->m_inobt_mnr[level != 0];
	45	}
1da177e4	46
561f7d17 CH	47	STATIC struct xfs_btree_cur *
	48	xfs_inobt_dup_cursor(
	49	struct xfs_btree_cur *cur)
	50	{
	51	return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
	52	cur->bc_private.a.agbp, cur->bc_private.a.agno);
	53	}
	54
344207ce CH	55	STATIC void
	56	xfs_inobt_set_root(
	57	struct xfs_btree_cur *cur,
	58	union xfs_btree_ptr *nptr,
	59	int inc) /* level change */
	60	{
	61	struct xfs_buf *agbp = cur->bc_private.a.agbp;
	62	struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
	63
	64	agi->agi_root = nptr->s;
	65	be32_add_cpu(&agi->agi_level, inc);
	66	xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT \| XFS_AGI_LEVEL);
	67	}
	68
f5eb8e7c CH	69	STATIC int
	70	xfs_inobt_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	xfs_alloc_arg_t args; /* block allocation args */
	78	int error; /* error return value */
	79	xfs_agblock_t sbno = be32_to_cpu(start->s);
	80
	81	XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
	82
	83	memset(&args, 0, sizeof(args));
	84	args.tp = cur->bc_tp;
	85	args.mp = cur->bc_mp;
	86	args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
	87	args.minlen = 1;
	88	args.maxlen = 1;
	89	args.prod = 1;
	90	args.type = XFS_ALLOCTYPE_NEAR_BNO;
	91
	92	error = xfs_alloc_vextent(&args);
	93	if (error) {
	94	XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
	95	return error;
	96	}
	97	if (args.fsbno == NULLFSBLOCK) {
	98	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	99	*stat = 0;
	100	return 0;
	101	}
	102	ASSERT(args.len == 1);
	103	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	104
	105	new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
	106	*stat = 1;
	107	return 0;
	108	}
	109
d4b3a4b7 CH	110	STATIC int
	111	xfs_inobt_free_block(
	112	struct xfs_btree_cur *cur,
	113	struct xfs_buf *bp)
	114	{
	115	xfs_fsblock_t fsbno;
	116	int error;
	117
	118	fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp));
	119	error = xfs_free_extent(cur->bc_tp, fsbno, 1);
	120	if (error)
	121	return error;
	122
	123	xfs_trans_binval(cur->bc_tp, bp);
	124	return error;
	125	}
f5eb8e7c	126
ce5e42db CH	127	STATIC int
	128	xfs_inobt_get_maxrecs(
	129	struct xfs_btree_cur *cur,
	130	int level)
	131	{
	132	return cur->bc_mp->m_inobt_mxr[level != 0];
	133	}
	134
fe033cc8 CH	135	STATIC void
	136	xfs_inobt_init_key_from_rec(
	137	union xfs_btree_key *key,
	138	union xfs_btree_rec *rec)
	139	{
	140	key->inobt.ir_startino = rec->inobt.ir_startino;
	141	}
	142
4b22a571 CH	143	STATIC void
	144	xfs_inobt_init_rec_from_key(
	145	union xfs_btree_key *key,
	146	union xfs_btree_rec *rec)
	147	{
	148	rec->inobt.ir_startino = key->inobt.ir_startino;
	149	}
	150
	151	STATIC void
	152	xfs_inobt_init_rec_from_cur(
	153	struct xfs_btree_cur *cur,
	154	union xfs_btree_rec *rec)
	155	{
	156	rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
	157	rec->inobt.ir_freecount = cpu_to_be32(cur->bc_rec.i.ir_freecount);
	158	rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
	159	}
	160
fe033cc8	161	/*
9da096fd	162	* initial value of ptr for lookup
fe033cc8 CH	163	*/
	164	STATIC void
	165	xfs_inobt_init_ptr_from_cur(
	166	struct xfs_btree_cur *cur,
	167	union xfs_btree_ptr *ptr)
	168	{
	169	struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
	170
	171	ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
	172
	173	ptr->s = agi->agi_root;
	174	}
	175
	176	STATIC __int64_t
	177	xfs_inobt_key_diff(
	178	struct xfs_btree_cur *cur,
	179	union xfs_btree_key *key)
	180	{
	181	return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
	182	cur->bc_rec.i.ir_startino;
	183	}
	184
4a26e66e CH	185	#ifdef DEBUG
	186	STATIC int
	187	xfs_inobt_keys_inorder(
	188	struct xfs_btree_cur *cur,
	189	union xfs_btree_key *k1,
	190	union xfs_btree_key *k2)
	191	{
	192	return be32_to_cpu(k1->inobt.ir_startino) <
	193	be32_to_cpu(k2->inobt.ir_startino);
	194	}
	195
	196	STATIC int
	197	xfs_inobt_recs_inorder(
	198	struct xfs_btree_cur *cur,
	199	union xfs_btree_rec *r1,
	200	union xfs_btree_rec *r2)
	201	{
	202	return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
	203	be32_to_cpu(r2->inobt.ir_startino);
	204	}
	205	#endif /* DEBUG */
	206
561f7d17	207	static const struct xfs_btree_ops xfs_inobt_ops = {
65f1eaea CH	208	.rec_len = sizeof(xfs_inobt_rec_t),
	209	.key_len = sizeof(xfs_inobt_key_t),
	210
561f7d17	211	.dup_cursor = xfs_inobt_dup_cursor,
344207ce	212	.set_root = xfs_inobt_set_root,
f5eb8e7c	213	.alloc_block = xfs_inobt_alloc_block,
d4b3a4b7	214	.free_block = xfs_inobt_free_block,
91cca5df	215	.get_minrecs = xfs_inobt_get_minrecs,
ce5e42db	216	.get_maxrecs = xfs_inobt_get_maxrecs,
fe033cc8	217	.init_key_from_rec = xfs_inobt_init_key_from_rec,
4b22a571 CH	218	.init_rec_from_key = xfs_inobt_init_rec_from_key,
4b22a571 CH	219	.init_rec_from_cur = xfs_inobt_init_rec_from_cur,
fe033cc8 CH	220	.init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
fe033cc8 CH	221	.key_diff = xfs_inobt_key_diff,
4a26e66e CH	222	#ifdef DEBUG
	223	.keys_inorder = xfs_inobt_keys_inorder,
	224	.recs_inorder = xfs_inobt_recs_inorder,
	225	#endif
561f7d17 CH	226	};
	227
	228	/*
	229	* Allocate a new inode btree cursor.
	230	*/
	231	struct xfs_btree_cur * /* new inode btree cursor */
	232	xfs_inobt_init_cursor(
	233	struct xfs_mount mp, / file system mount point */
	234	struct xfs_trans tp, / transaction pointer */
	235	struct xfs_buf agbp, / buffer for agi structure */
	236	xfs_agnumber_t agno) /* allocation group number */
	237	{
	238	struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
	239	struct xfs_btree_cur *cur;
	240
	241	cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
	242
	243	cur->bc_tp = tp;
	244	cur->bc_mp = mp;
	245	cur->bc_nlevels = be32_to_cpu(agi->agi_level);
	246	cur->bc_btnum = XFS_BTNUM_INO;
	247	cur->bc_blocklog = mp->m_sb.sb_blocklog;
	248
	249	cur->bc_ops = &xfs_inobt_ops;
	250
	251	cur->bc_private.a.agbp = agbp;
	252	cur->bc_private.a.agno = agno;
	253
	254	return cur;
	255	}
60197e8d CH	256
	257	/*
	258	* Calculate number of records in an inobt btree block.
	259	*/
	260	int
	261	xfs_inobt_maxrecs(
	262	struct xfs_mount *mp,
	263	int blocklen,
	264	int leaf)
	265	{
7cc95a82	266	blocklen -= XFS_INOBT_BLOCK_LEN(mp);
60197e8d CH	267
	268	if (leaf)
	269	return blocklen / sizeof(xfs_inobt_rec_t);
	270	return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
	271	}