[linux-2.6-block.git] / fs / xfs / xfs_dir2_node.h

/*
 * Copyright (c) 2000,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
 */
#ifndef __XFS_DIR2_NODE_H__
#define	__XFS_DIR2_NODE_H__

/*
 * Directory version 2, btree node format structures
 */

struct uio;
struct xfs_dabuf;
struct xfs_da_args;
struct xfs_da_state;
struct xfs_da_state_blk;
struct xfs_inode;
struct xfs_trans;

/*
 * Offset of the freespace index.
 */
#define	XFS_DIR2_FREE_SPACE	2
#define	XFS_DIR2_FREE_OFFSET	(XFS_DIR2_FREE_SPACE * XFS_DIR2_SPACE_SIZE)
#define	XFS_DIR2_FREE_FIRSTDB(mp)	\
	xfs_dir2_byte_to_db(mp, XFS_DIR2_FREE_OFFSET)

#define	XFS_DIR2_FREE_MAGIC	0x58443246	/* XD2F */

typedef	struct xfs_dir2_free_hdr {
	__be32			magic;		/* XFS_DIR2_FREE_MAGIC */
	__be32			firstdb;	/* db of first entry */
	__be32			nvalid;		/* count of valid entries */
	__be32			nused;		/* count of used entries */
} xfs_dir2_free_hdr_t;

typedef struct xfs_dir2_free {
	xfs_dir2_free_hdr_t	hdr;		/* block header */
	__be16			bests[1];	/* best free counts */
						/* unused entries are -1 */
} xfs_dir2_free_t;

#define	XFS_DIR2_MAX_FREE_BESTS(mp)	\
	(((mp)->m_dirblksize - (uint)sizeof(xfs_dir2_free_hdr_t)) / \
	 (uint)sizeof(xfs_dir2_data_off_t))

/*
 * Convert data space db to the corresponding free db.
 */
static inline xfs_dir2_db_t
xfs_dir2_db_to_fdb(struct xfs_mount *mp, xfs_dir2_db_t db)
{
	return (XFS_DIR2_FREE_FIRSTDB(mp) + (db) / XFS_DIR2_MAX_FREE_BESTS(mp));
}

/*
 * Convert data space db to the corresponding index in a free db.
 */
static inline int
xfs_dir2_db_to_fdindex(struct xfs_mount *mp, xfs_dir2_db_t db)
{
	return ((db) % XFS_DIR2_MAX_FREE_BESTS(mp));
}

extern void xfs_dir2_free_log_bests(struct xfs_trans *tp, struct xfs_dabuf *bp,
				    int first, int last);
extern int xfs_dir2_leaf_to_node(struct xfs_da_args *args,
				 struct xfs_dabuf *lbp);
extern xfs_dahash_t xfs_dir2_leafn_lasthash(struct xfs_dabuf *bp, int *count);
extern int xfs_dir2_leafn_lookup_int(struct xfs_dabuf *bp,
				     struct xfs_da_args *args, int *indexp,
				     struct xfs_da_state *state);
extern int xfs_dir2_leafn_order(struct xfs_dabuf *leaf1_bp,
				struct xfs_dabuf *leaf2_bp);
extern int xfs_dir2_leafn_split(struct xfs_da_state *state,
				struct xfs_da_state_blk *oldblk,
				struct xfs_da_state_blk *newblk);
extern int xfs_dir2_leafn_toosmall(struct xfs_da_state *state, int *action);
extern void xfs_dir2_leafn_unbalance(struct xfs_da_state *state,
				     struct xfs_da_state_blk *drop_blk,
				     struct xfs_da_state_blk *save_blk);
extern int xfs_dir2_node_addname(struct xfs_da_args *args);
extern int xfs_dir2_node_lookup(struct xfs_da_args *args);
extern int xfs_dir2_node_removename(struct xfs_da_args *args);
extern int xfs_dir2_node_replace(struct xfs_da_args *args);
extern int xfs_dir2_node_trim_free(struct xfs_da_args *args, xfs_fileoff_t fo,
				   int *rvalp);

#endif	/* __XFS_DIR2_NODE_H__ */
Commit	Line	Data
1da177e4	1	/*
7b718769 NS	2	* Copyright (c) 2000,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 LT	17	*/
	18	#ifndef __XFS_DIR2_NODE_H__
	19	#define __XFS_DIR2_NODE_H__
	20
	21	/*
	22	* Directory version 2, btree node format structures
	23	*/
	24
	25	struct uio;
	26	struct xfs_dabuf;
	27	struct xfs_da_args;
	28	struct xfs_da_state;
	29	struct xfs_da_state_blk;
	30	struct xfs_inode;
	31	struct xfs_trans;
	32
1da177e4 LT	33	/*
	34	* Offset of the freespace index.
	35	*/
	36	#define XFS_DIR2_FREE_SPACE 2
	37	#define XFS_DIR2_FREE_OFFSET (XFS_DIR2_FREE_SPACE * XFS_DIR2_SPACE_SIZE)
	38	#define XFS_DIR2_FREE_FIRSTDB(mp) \
bbaaf538	39	xfs_dir2_byte_to_db(mp, XFS_DIR2_FREE_OFFSET)
1da177e4 LT	40
	41	#define XFS_DIR2_FREE_MAGIC 0x58443246 /* XD2F */
	42
1da177e4	43	typedef struct xfs_dir2_free_hdr {
0ba962ef NS	44	__be32 magic; /* XFS_DIR2_FREE_MAGIC */
	45	__be32 firstdb; /* db of first entry */
	46	__be32 nvalid; /* count of valid entries */
	47	__be32 nused; /* count of used entries */
1da177e4 LT	48	} xfs_dir2_free_hdr_t;
	49
	50	typedef struct xfs_dir2_free {
	51	xfs_dir2_free_hdr_t hdr; /* block header */
0ba962ef	52	__be16 bests[1]; /* best free counts */
1da177e4 LT	53	/* unused entries are -1 */
1da177e4 LT	54	} xfs_dir2_free_t;
a844f451	55
1da177e4 LT	56	#define XFS_DIR2_MAX_FREE_BESTS(mp) \
	57	(((mp)->m_dirblksize - (uint)sizeof(xfs_dir2_free_hdr_t)) / \
	58	(uint)sizeof(xfs_dir2_data_off_t))
	59
1da177e4 LT	60	/*
	61	* Convert data space db to the corresponding free db.
	62	*/
a844f451 NS	63	static inline xfs_dir2_db_t
	64	xfs_dir2_db_to_fdb(struct xfs_mount *mp, xfs_dir2_db_t db)
	65	{
	66	return (XFS_DIR2_FREE_FIRSTDB(mp) + (db) / XFS_DIR2_MAX_FREE_BESTS(mp));
	67	}
1da177e4 LT	68
	69	/*
	70	* Convert data space db to the corresponding index in a free db.
	71	*/
a844f451 NS	72	static inline int
	73	xfs_dir2_db_to_fdindex(struct xfs_mount *mp, xfs_dir2_db_t db)
	74	{
	75	return ((db) % XFS_DIR2_MAX_FREE_BESTS(mp));
	76	}
	77
	78	extern void xfs_dir2_free_log_bests(struct xfs_trans tp, struct xfs_dabuf bp,
	79	int first, int last);
	80	extern int xfs_dir2_leaf_to_node(struct xfs_da_args *args,
	81	struct xfs_dabuf *lbp);
	82	extern xfs_dahash_t xfs_dir2_leafn_lasthash(struct xfs_dabuf bp, int count);
	83	extern int xfs_dir2_leafn_lookup_int(struct xfs_dabuf *bp,
	84	struct xfs_da_args args, int indexp,
	85	struct xfs_da_state *state);
	86	extern int xfs_dir2_leafn_order(struct xfs_dabuf *leaf1_bp,
	87	struct xfs_dabuf *leaf2_bp);
	88	extern int xfs_dir2_leafn_split(struct xfs_da_state *state,
	89	struct xfs_da_state_blk *oldblk,
	90	struct xfs_da_state_blk *newblk);
	91	extern int xfs_dir2_leafn_toosmall(struct xfs_da_state state, int action);
	92	extern void xfs_dir2_leafn_unbalance(struct xfs_da_state *state,
	93	struct xfs_da_state_blk *drop_blk,
	94	struct xfs_da_state_blk *save_blk);
	95	extern int xfs_dir2_node_addname(struct xfs_da_args *args);
	96	extern int xfs_dir2_node_lookup(struct xfs_da_args *args);
	97	extern int xfs_dir2_node_removename(struct xfs_da_args *args);
	98	extern int xfs_dir2_node_replace(struct xfs_da_args *args);
	99	extern int xfs_dir2_node_trim_free(struct xfs_da_args *args, xfs_fileoff_t fo,
	100	int *rvalp);
1da177e4 LT	101
1da177e4 LT	102	#endif /* __XFS_DIR2_NODE_H__ */