[deliverable/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_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 LT	22	#include "xfs_log.h"
	23	#include "xfs_trans.h"
	24	#include "xfs_sb.h"
	25	#include "xfs_ag.h"
1da177e4	26	#include "xfs_mount.h"
1da177e4	27	#include "xfs_bmap_btree.h"
a844f451	28	#include "xfs_alloc_btree.h"
1da177e4	29	#include "xfs_ialloc_btree.h"
a844f451 NS	30	#include "xfs_dinode.h"
a844f451 NS	31	#include "xfs_inode.h"
1da177e4 LT	32	#include "xfs_btree.h"
	33	#include "xfs_ialloc.h"
	34	#include "xfs_alloc.h"
	35	#include "xfs_error.h"
	36
1da177e4	37
91cca5df CH	38	STATIC int
	39	xfs_inobt_get_minrecs(
	40	struct xfs_btree_cur *cur,
	41	int level)
	42	{
	43	return cur->bc_mp->m_inobt_mnr[level != 0];
	44	}
1da177e4	45
561f7d17 CH	46	STATIC struct xfs_btree_cur *
	47	xfs_inobt_dup_cursor(
	48	struct xfs_btree_cur *cur)
	49	{
	50	return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
	51	cur->bc_private.a.agbp, cur->bc_private.a.agno);
	52	}
	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
f5eb8e7c CH	68	STATIC int
	69	xfs_inobt_alloc_block(
	70	struct xfs_btree_cur *cur,
	71	union xfs_btree_ptr *start,
	72	union xfs_btree_ptr *new,
	73	int length,
	74	int *stat)
	75	{
	76	xfs_alloc_arg_t args; /* block allocation args */
	77	int error; /* error return value */
	78	xfs_agblock_t sbno = be32_to_cpu(start->s);
	79
	80	XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
	81
	82	memset(&args, 0, sizeof(args));
	83	args.tp = cur->bc_tp;
	84	args.mp = cur->bc_mp;
	85	args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
	86	args.minlen = 1;
	87	args.maxlen = 1;
	88	args.prod = 1;
	89	args.type = XFS_ALLOCTYPE_NEAR_BNO;
	90
	91	error = xfs_alloc_vextent(&args);
	92	if (error) {
	93	XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
	94	return error;
	95	}
	96	if (args.fsbno == NULLFSBLOCK) {
	97	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	98	*stat = 0;
	99	return 0;
	100	}
	101	ASSERT(args.len == 1);
	102	XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
	103
	104	new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
	105	*stat = 1;
	106	return 0;
	107	}
	108
d4b3a4b7 CH	109	STATIC int
	110	xfs_inobt_free_block(
	111	struct xfs_btree_cur *cur,
	112	struct xfs_buf *bp)
	113	{
	114	xfs_fsblock_t fsbno;
	115	int error;
	116
	117	fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp));
	118	error = xfs_free_extent(cur->bc_tp, fsbno, 1);
	119	if (error)
	120	return error;
	121
	122	xfs_trans_binval(cur->bc_tp, bp);
	123	return error;
	124	}
f5eb8e7c	125
ce5e42db CH	126	STATIC int
	127	xfs_inobt_get_maxrecs(
	128	struct xfs_btree_cur *cur,
	129	int level)
	130	{
	131	return cur->bc_mp->m_inobt_mxr[level != 0];
	132	}
	133
fe033cc8 CH	134	STATIC void
	135	xfs_inobt_init_key_from_rec(
	136	union xfs_btree_key *key,
	137	union xfs_btree_rec *rec)
	138	{
	139	key->inobt.ir_startino = rec->inobt.ir_startino;
	140	}
	141
4b22a571 CH	142	STATIC void
	143	xfs_inobt_init_rec_from_key(
	144	union xfs_btree_key *key,
	145	union xfs_btree_rec *rec)
	146	{
	147	rec->inobt.ir_startino = key->inobt.ir_startino;
	148	}
	149
	150	STATIC void
	151	xfs_inobt_init_rec_from_cur(
	152	struct xfs_btree_cur *cur,
	153	union xfs_btree_rec *rec)
	154	{
	155	rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
	156	rec->inobt.ir_freecount = cpu_to_be32(cur->bc_rec.i.ir_freecount);
	157	rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
	158	}
	159
fe033cc8	160	/*
9da096fd	161	* initial value of ptr for lookup
fe033cc8 CH	162	*/
	163	STATIC void
	164	xfs_inobt_init_ptr_from_cur(
	165	struct xfs_btree_cur *cur,
	166	union xfs_btree_ptr *ptr)
	167	{
	168	struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
	169
	170	ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
	171
	172	ptr->s = agi->agi_root;
	173	}
	174
	175	STATIC __int64_t
	176	xfs_inobt_key_diff(
	177	struct xfs_btree_cur *cur,
	178	union xfs_btree_key *key)
	179	{
	180	return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
	181	cur->bc_rec.i.ir_startino;
	182	}
	183
4a26e66e CH	184	#ifdef DEBUG
	185	STATIC int
	186	xfs_inobt_keys_inorder(
	187	struct xfs_btree_cur *cur,
	188	union xfs_btree_key *k1,
	189	union xfs_btree_key *k2)
	190	{
	191	return be32_to_cpu(k1->inobt.ir_startino) <
	192	be32_to_cpu(k2->inobt.ir_startino);
	193	}
	194
	195	STATIC int
	196	xfs_inobt_recs_inorder(
	197	struct xfs_btree_cur *cur,
	198	union xfs_btree_rec *r1,
	199	union xfs_btree_rec *r2)
	200	{
	201	return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
	202	be32_to_cpu(r2->inobt.ir_startino);
	203	}
	204	#endif /* DEBUG */
	205
561f7d17	206	static const struct xfs_btree_ops xfs_inobt_ops = {
65f1eaea CH	207	.rec_len = sizeof(xfs_inobt_rec_t),
	208	.key_len = sizeof(xfs_inobt_key_t),
	209
561f7d17	210	.dup_cursor = xfs_inobt_dup_cursor,
344207ce	211	.set_root = xfs_inobt_set_root,
f5eb8e7c	212	.alloc_block = xfs_inobt_alloc_block,
d4b3a4b7	213	.free_block = xfs_inobt_free_block,
91cca5df	214	.get_minrecs = xfs_inobt_get_minrecs,
ce5e42db	215	.get_maxrecs = xfs_inobt_get_maxrecs,
fe033cc8	216	.init_key_from_rec = xfs_inobt_init_key_from_rec,
4b22a571 CH	217	.init_rec_from_key = xfs_inobt_init_rec_from_key,
4b22a571 CH	218	.init_rec_from_cur = xfs_inobt_init_rec_from_cur,
fe033cc8 CH	219	.init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
fe033cc8 CH	220	.key_diff = xfs_inobt_key_diff,
4a26e66e CH	221	#ifdef DEBUG
	222	.keys_inorder = xfs_inobt_keys_inorder,
	223	.recs_inorder = xfs_inobt_recs_inorder,
	224	#endif
561f7d17 CH	225	};
	226
	227	/*
	228	* Allocate a new inode btree cursor.
	229	*/
	230	struct xfs_btree_cur * /* new inode btree cursor */
	231	xfs_inobt_init_cursor(
	232	struct xfs_mount mp, / file system mount point */
	233	struct xfs_trans tp, / transaction pointer */
	234	struct xfs_buf agbp, / buffer for agi structure */
	235	xfs_agnumber_t agno) /* allocation group number */
	236	{
	237	struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
	238	struct xfs_btree_cur *cur;
	239
	240	cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
	241
	242	cur->bc_tp = tp;
	243	cur->bc_mp = mp;
	244	cur->bc_nlevels = be32_to_cpu(agi->agi_level);
	245	cur->bc_btnum = XFS_BTNUM_INO;
	246	cur->bc_blocklog = mp->m_sb.sb_blocklog;
	247
	248	cur->bc_ops = &xfs_inobt_ops;
	249
	250	cur->bc_private.a.agbp = agbp;
	251	cur->bc_private.a.agno = agno;
	252
	253	return cur;
	254	}
60197e8d CH	255
	256	/*
	257	* Calculate number of records in an inobt btree block.
	258	*/
	259	int
	260	xfs_inobt_maxrecs(
	261	struct xfs_mount *mp,
	262	int blocklen,
	263	int leaf)
	264	{
7cc95a82	265	blocklen -= XFS_INOBT_BLOCK_LEN(mp);
60197e8d CH	266
	267	if (leaf)
	268	return blocklen / sizeof(xfs_inobt_rec_t);
	269	return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
	270	}