[GitHub/mt8127/android_kernel_alcatel_ttab.git] / fs / xfs / xfs_ag.h

/*
 * Copyright (c) 2000-2003,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_AG_H__
#define	__XFS_AG_H__

/*
 * Allocation group header
 * This is divided into three structures, placed in sequential 512-byte
 * buffers after a copy of the superblock (also in a 512-byte buffer).
 */

struct xfs_buf;
struct xfs_mount;
struct xfs_trans;

#define	XFS_AGF_MAGIC	0x58414746	/* 'XAGF' */
#define	XFS_AGI_MAGIC	0x58414749	/* 'XAGI' */
#define	XFS_AGFL_MAGIC	0x5841464c	/* 'XAFL' */
#define	XFS_AGF_VERSION	1
#define	XFS_AGI_VERSION	1

#define	XFS_AGF_GOOD_VERSION(v)	((v) == XFS_AGF_VERSION)
#define	XFS_AGI_GOOD_VERSION(v)	((v) == XFS_AGI_VERSION)

/*
 * Btree number 0 is bno, 1 is cnt.  This value gives the size of the
 * arrays below.
 */
#define	XFS_BTNUM_AGF	((int)XFS_BTNUM_CNTi + 1)

/*
 * The second word of agf_levels in the first a.g. overlaps the EFS
 * superblock's magic number.  Since the magic numbers valid for EFS
 * are > 64k, our value cannot be confused for an EFS superblock's.
 */

typedef struct xfs_agf {
	/*
	 * Common allocation group header information
	 */
	__be32		agf_magicnum;	/* magic number == XFS_AGF_MAGIC */
	__be32		agf_versionnum;	/* header version == XFS_AGF_VERSION */
	__be32		agf_seqno;	/* sequence # starting from 0 */
	__be32		agf_length;	/* size in blocks of a.g. */
	/*
	 * Freespace information
	 */
	__be32		agf_roots[XFS_BTNUM_AGF];	/* root blocks */
	__be32		agf_spare0;	/* spare field */
	__be32		agf_levels[XFS_BTNUM_AGF];	/* btree levels */
	__be32		agf_spare1;	/* spare field */

	__be32		agf_flfirst;	/* first freelist block's index */
	__be32		agf_fllast;	/* last freelist block's index */
	__be32		agf_flcount;	/* count of blocks in freelist */
	__be32		agf_freeblks;	/* total free blocks */

	__be32		agf_longest;	/* longest free space */
	__be32		agf_btreeblks;	/* # of blocks held in AGF btrees */
	uuid_t		agf_uuid;	/* uuid of filesystem */

	/*
	 * reserve some contiguous space for future logged fields before we add
	 * the unlogged fields. This makes the range logging via flags and
	 * structure offsets much simpler.
	 */
	__be64		agf_spare64[16];

	/* unlogged fields, written during buffer writeback. */
	__be64		agf_lsn;	/* last write sequence */
	__be32		agf_crc;	/* crc of agf sector */
	__be32		agf_spare2;

	/* structure must be padded to 64 bit alignment */
} xfs_agf_t;

#define	XFS_AGF_MAGICNUM	0x00000001
#define	XFS_AGF_VERSIONNUM	0x00000002
#define	XFS_AGF_SEQNO		0x00000004
#define	XFS_AGF_LENGTH		0x00000008
#define	XFS_AGF_ROOTS		0x00000010
#define	XFS_AGF_LEVELS		0x00000020
#define	XFS_AGF_FLFIRST		0x00000040
#define	XFS_AGF_FLLAST		0x00000080
#define	XFS_AGF_FLCOUNT		0x00000100
#define	XFS_AGF_FREEBLKS	0x00000200
#define	XFS_AGF_LONGEST		0x00000400
#define	XFS_AGF_BTREEBLKS	0x00000800
#define	XFS_AGF_UUID		0x00001000
#define	XFS_AGF_NUM_BITS	13
#define	XFS_AGF_ALL_BITS	((1 << XFS_AGF_NUM_BITS) - 1)

#define XFS_AGF_FLAGS \
	{ XFS_AGF_MAGICNUM,	"MAGICNUM" }, \
	{ XFS_AGF_VERSIONNUM,	"VERSIONNUM" }, \
	{ XFS_AGF_SEQNO,	"SEQNO" }, \
	{ XFS_AGF_LENGTH,	"LENGTH" }, \
	{ XFS_AGF_ROOTS,	"ROOTS" }, \
	{ XFS_AGF_LEVELS,	"LEVELS" }, \
	{ XFS_AGF_FLFIRST,	"FLFIRST" }, \
	{ XFS_AGF_FLLAST,	"FLLAST" }, \
	{ XFS_AGF_FLCOUNT,	"FLCOUNT" }, \
	{ XFS_AGF_FREEBLKS,	"FREEBLKS" }, \
	{ XFS_AGF_LONGEST,	"LONGEST" }, \
	{ XFS_AGF_BTREEBLKS,	"BTREEBLKS" }, \
	{ XFS_AGF_UUID,		"UUID" }

/* disk block (xfs_daddr_t) in the AG */
#define XFS_AGF_DADDR(mp)	((xfs_daddr_t)(1 << (mp)->m_sectbb_log))
#define	XFS_AGF_BLOCK(mp)	XFS_HDR_BLOCK(mp, XFS_AGF_DADDR(mp))
#define	XFS_BUF_TO_AGF(bp)	((xfs_agf_t *)((bp)->b_addr))

extern int xfs_read_agf(struct xfs_mount *mp, struct xfs_trans *tp,
			xfs_agnumber_t agno, int flags, struct xfs_buf **bpp);

extern const struct xfs_buf_ops xfs_agf_buf_ops;

/*
 * Size of the unlinked inode hash table in the agi.
 */
#define	XFS_AGI_UNLINKED_BUCKETS	64

typedef struct xfs_agi {
	/*
	 * Common allocation group header information
	 */
	__be32		agi_magicnum;	/* magic number == XFS_AGI_MAGIC */
	__be32		agi_versionnum;	/* header version == XFS_AGI_VERSION */
	__be32		agi_seqno;	/* sequence # starting from 0 */
	__be32		agi_length;	/* size in blocks of a.g. */
	/*
	 * Inode information
	 * Inodes are mapped by interpreting the inode number, so no
	 * mapping data is needed here.
	 */
	__be32		agi_count;	/* count of allocated inodes */
	__be32		agi_root;	/* root of inode btree */
	__be32		agi_level;	/* levels in inode btree */
	__be32		agi_freecount;	/* number of free inodes */

	__be32		agi_newino;	/* new inode just allocated */
	__be32		agi_dirino;	/* last directory inode chunk */
	/*
	 * Hash table of inodes which have been unlinked but are
	 * still being referenced.
	 */
	__be32		agi_unlinked[XFS_AGI_UNLINKED_BUCKETS];

	uuid_t		agi_uuid;	/* uuid of filesystem */
	__be32		agi_crc;	/* crc of agi sector */
	__be32		agi_pad32;
	__be64		agi_lsn;	/* last write sequence */

	/* structure must be padded to 64 bit alignment */
} xfs_agi_t;

#define	XFS_AGI_MAGICNUM	0x00000001
#define	XFS_AGI_VERSIONNUM	0x00000002
#define	XFS_AGI_SEQNO		0x00000004
#define	XFS_AGI_LENGTH		0x00000008
#define	XFS_AGI_COUNT		0x00000010
#define	XFS_AGI_ROOT		0x00000020
#define	XFS_AGI_LEVEL		0x00000040
#define	XFS_AGI_FREECOUNT	0x00000080
#define	XFS_AGI_NEWINO		0x00000100
#define	XFS_AGI_DIRINO		0x00000200
#define	XFS_AGI_UNLINKED	0x00000400
#define	XFS_AGI_NUM_BITS	11
#define	XFS_AGI_ALL_BITS	((1 << XFS_AGI_NUM_BITS) - 1)

/* disk block (xfs_daddr_t) in the AG */
#define XFS_AGI_DADDR(mp)	((xfs_daddr_t)(2 << (mp)->m_sectbb_log))
#define	XFS_AGI_BLOCK(mp)	XFS_HDR_BLOCK(mp, XFS_AGI_DADDR(mp))
#define	XFS_BUF_TO_AGI(bp)	((xfs_agi_t *)((bp)->b_addr))

extern int xfs_read_agi(struct xfs_mount *mp, struct xfs_trans *tp,
				xfs_agnumber_t agno, struct xfs_buf **bpp);

extern const struct xfs_buf_ops xfs_agi_buf_ops;

/*
 * The third a.g. block contains the a.g. freelist, an array
 * of block pointers to blocks owned by the allocation btree code.
 */
#define XFS_AGFL_DADDR(mp)	((xfs_daddr_t)(3 << (mp)->m_sectbb_log))
#define	XFS_AGFL_BLOCK(mp)	XFS_HDR_BLOCK(mp, XFS_AGFL_DADDR(mp))
#define	XFS_BUF_TO_AGFL(bp)	((xfs_agfl_t *)((bp)->b_addr))

#define XFS_BUF_TO_AGFL_BNO(mp, bp) \
	(xfs_sb_version_hascrc(&((mp)->m_sb)) ? \
		&(XFS_BUF_TO_AGFL(bp)->agfl_bno[0]) : \
		(__be32 *)(bp)->b_addr)

/*
 * Size of the AGFL.  For CRC-enabled filesystes we steal a couple of
 * slots in the beginning of the block for a proper header with the
 * location information and CRC.
 */
#define XFS_AGFL_SIZE(mp) \
	(((mp)->m_sb.sb_sectsize - \
	 (xfs_sb_version_hascrc(&((mp)->m_sb)) ? \
		sizeof(struct xfs_agfl) : 0)) / \
	  sizeof(xfs_agblock_t))

typedef struct xfs_agfl {
	__be32		agfl_magicnum;
	__be32		agfl_seqno;
	uuid_t		agfl_uuid;
	__be64		agfl_lsn;
	__be32		agfl_crc;
	__be32		agfl_bno[];	/* actually XFS_AGFL_SIZE(mp) */
} xfs_agfl_t;

/*
 * Per-ag incore structure, copies of information in agf and agi,
 * to improve the performance of allocation group selection.
 */
#define XFS_PAGB_NUM_SLOTS	128

typedef struct xfs_perag {
	struct xfs_mount *pag_mount;	/* owner filesystem */
	xfs_agnumber_t	pag_agno;	/* AG this structure belongs to */
	atomic_t	pag_ref;	/* perag reference count */
	char		pagf_init;	/* this agf's entry is initialized */
	char		pagi_init;	/* this agi's entry is initialized */
	char		pagf_metadata;	/* the agf is preferred to be metadata */
	char		pagi_inodeok;	/* The agi is ok for inodes */
	__uint8_t	pagf_levels[XFS_BTNUM_AGF];
					/* # of levels in bno & cnt btree */
	__uint32_t	pagf_flcount;	/* count of blocks in freelist */
	xfs_extlen_t	pagf_freeblks;	/* total free blocks */
	xfs_extlen_t	pagf_longest;	/* longest free space */
	__uint32_t	pagf_btreeblks;	/* # of blocks held in AGF btrees */
	xfs_agino_t	pagi_freecount;	/* number of free inodes */
	xfs_agino_t	pagi_count;	/* number of allocated inodes */

	/*
	 * Inode allocation search lookup optimisation.
	 * If the pagino matches, the search for new inodes
	 * doesn't need to search the near ones again straight away
	 */
	xfs_agino_t	pagl_pagino;
	xfs_agino_t	pagl_leftrec;
	xfs_agino_t	pagl_rightrec;
#ifdef __KERNEL__
	spinlock_t	pagb_lock;	/* lock for pagb_tree */
	struct rb_root	pagb_tree;	/* ordered tree of busy extents */

	atomic_t        pagf_fstrms;    /* # of filestreams active in this AG */

	spinlock_t	pag_ici_lock;	/* incore inode cache lock */
	struct radix_tree_root pag_ici_root;	/* incore inode cache root */
	int		pag_ici_reclaimable;	/* reclaimable inodes */
	struct mutex	pag_ici_reclaim_lock;	/* serialisation point */
	unsigned long	pag_ici_reclaim_cursor;	/* reclaim restart point */

	/* buffer cache index */
	spinlock_t	pag_buf_lock;	/* lock for pag_buf_tree */
	struct rb_root	pag_buf_tree;	/* ordered tree of active buffers */

	/* for rcu-safe freeing */
	struct rcu_head	rcu_head;
#endif
	int		pagb_count;	/* pagb slots in use */
} xfs_perag_t;

/*
 * tags for inode radix tree
 */
#define XFS_ICI_NO_TAG		(-1)	/* special flag for an untagged lookup
					   in xfs_inode_ag_iterator */
#define XFS_ICI_RECLAIM_TAG	0	/* inode is to be reclaimed */
#define XFS_ICI_EOFBLOCKS_TAG	1	/* inode has blocks beyond EOF */

#define	XFS_AG_MAXLEVELS(mp)		((mp)->m_ag_maxlevels)
#define	XFS_MIN_FREELIST_RAW(bl,cl,mp)	\
	(MIN(bl + 1, XFS_AG_MAXLEVELS(mp)) + MIN(cl + 1, XFS_AG_MAXLEVELS(mp)))
#define	XFS_MIN_FREELIST(a,mp)		\
	(XFS_MIN_FREELIST_RAW(		\
		be32_to_cpu((a)->agf_levels[XFS_BTNUM_BNOi]), \
		be32_to_cpu((a)->agf_levels[XFS_BTNUM_CNTi]), mp))
#define	XFS_MIN_FREELIST_PAG(pag,mp)	\
	(XFS_MIN_FREELIST_RAW(		\
		(unsigned int)(pag)->pagf_levels[XFS_BTNUM_BNOi], \
		(unsigned int)(pag)->pagf_levels[XFS_BTNUM_CNTi], mp))

#define XFS_AGB_TO_FSB(mp,agno,agbno)	\
	(((xfs_fsblock_t)(agno) << (mp)->m_sb.sb_agblklog) | (agbno))
#define	XFS_FSB_TO_AGNO(mp,fsbno)	\
	((xfs_agnumber_t)((fsbno) >> (mp)->m_sb.sb_agblklog))
#define	XFS_FSB_TO_AGBNO(mp,fsbno)	\
	((xfs_agblock_t)((fsbno) & xfs_mask32lo((mp)->m_sb.sb_agblklog)))
#define	XFS_AGB_TO_DADDR(mp,agno,agbno)	\
	((xfs_daddr_t)XFS_FSB_TO_BB(mp, \
		(xfs_fsblock_t)(agno) * (mp)->m_sb.sb_agblocks + (agbno)))
#define	XFS_AG_DADDR(mp,agno,d)		(XFS_AGB_TO_DADDR(mp, agno, 0) + (d))

/*
 * For checking for bad ranges of xfs_daddr_t's, covering multiple
 * allocation groups or a single xfs_daddr_t that's a superblock copy.
 */
#define	XFS_AG_CHECK_DADDR(mp,d,len)	\
	((len) == 1 ? \
	    ASSERT((d) == XFS_SB_DADDR || \
		   xfs_daddr_to_agbno(mp, d) != XFS_SB_DADDR) : \
	    ASSERT(xfs_daddr_to_agno(mp, d) == \
		   xfs_daddr_to_agno(mp, (d) + (len) - 1)))

#endif	/* __XFS_AG_H__ */
Commit	Line	Data
1da177e4	1	/*
7b718769 NS	2	* Copyright (c) 2000-2003,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_AG_H__
	19	#define __XFS_AG_H__
	20
	21	/*
	22	* Allocation group header
	23	* This is divided into three structures, placed in sequential 512-byte
	24	* buffers after a copy of the superblock (also in a 512-byte buffer).
	25	*/
	26
	27	struct xfs_buf;
	28	struct xfs_mount;
	29	struct xfs_trans;
	30
	31	#define XFS_AGF_MAGIC 0x58414746 /* 'XAGF' */
	32	#define XFS_AGI_MAGIC 0x58414749 /* 'XAGI' */
77c95bba	33	#define XFS_AGFL_MAGIC 0x5841464c /* 'XAFL' */
1da177e4 LT	34	#define XFS_AGF_VERSION 1
1da177e4 LT	35	#define XFS_AGI_VERSION 1
a844f451 NS	36
	37	#define XFS_AGF_GOOD_VERSION(v) ((v) == XFS_AGF_VERSION)
	38	#define XFS_AGI_GOOD_VERSION(v) ((v) == XFS_AGI_VERSION)
1da177e4 LT	39
	40	/*
	41	* Btree number 0 is bno, 1 is cnt. This value gives the size of the
	42	* arrays below.
	43	*/
	44	#define XFS_BTNUM_AGF ((int)XFS_BTNUM_CNTi + 1)
	45
	46	/*
	47	* The second word of agf_levels in the first a.g. overlaps the EFS
	48	* superblock's magic number. Since the magic numbers valid for EFS
	49	* are > 64k, our value cannot be confused for an EFS superblock's.
	50	*/
	51
16259e7d	52	typedef struct xfs_agf {
1da177e4 LT	53	/*
	54	* Common allocation group header information
	55	*/
16259e7d CH	56	__be32 agf_magicnum; /* magic number == XFS_AGF_MAGIC */
	57	__be32 agf_versionnum; /* header version == XFS_AGF_VERSION */
	58	__be32 agf_seqno; /* sequence # starting from 0 */
	59	__be32 agf_length; /* size in blocks of a.g. */
1da177e4 LT	60	/*
	61	* Freespace information
	62	*/
16259e7d CH	63	__be32 agf_roots[XFS_BTNUM_AGF]; /* root blocks */
	64	__be32 agf_spare0; /* spare field */
	65	__be32 agf_levels[XFS_BTNUM_AGF]; /* btree levels */
	66	__be32 agf_spare1; /* spare field */
4e0e6040	67
16259e7d CH	68	__be32 agf_flfirst; /* first freelist block's index */
	69	__be32 agf_fllast; /* last freelist block's index */
	70	__be32 agf_flcount; /* count of blocks in freelist */
	71	__be32 agf_freeblks; /* total free blocks */
4e0e6040	72
16259e7d	73	__be32 agf_longest; /* longest free space */
92821e2b	74	__be32 agf_btreeblks; /* # of blocks held in AGF btrees */
4e0e6040 DC	75	uuid_t agf_uuid; /* uuid of filesystem */
	76
	77	/*
	78	* reserve some contiguous space for future logged fields before we add
	79	* the unlogged fields. This makes the range logging via flags and
	80	* structure offsets much simpler.
	81	*/
	82	__be64 agf_spare64[16];
	83
	84	/* unlogged fields, written during buffer writeback. */
	85	__be64 agf_lsn; /* last write sequence */
	86	__be32 agf_crc; /* crc of agf sector */
	87	__be32 agf_spare2;
	88
	89	/* structure must be padded to 64 bit alignment */
1da177e4 LT	90	} xfs_agf_t;
	91
	92	#define XFS_AGF_MAGICNUM 0x00000001
	93	#define XFS_AGF_VERSIONNUM 0x00000002
	94	#define XFS_AGF_SEQNO 0x00000004
	95	#define XFS_AGF_LENGTH 0x00000008
	96	#define XFS_AGF_ROOTS 0x00000010
	97	#define XFS_AGF_LEVELS 0x00000020
	98	#define XFS_AGF_FLFIRST 0x00000040
	99	#define XFS_AGF_FLLAST 0x00000080
	100	#define XFS_AGF_FLCOUNT 0x00000100
	101	#define XFS_AGF_FREEBLKS 0x00000200
	102	#define XFS_AGF_LONGEST 0x00000400
92821e2b	103	#define XFS_AGF_BTREEBLKS 0x00000800
4e0e6040 DC	104	#define XFS_AGF_UUID 0x00001000
4e0e6040 DC	105	#define XFS_AGF_NUM_BITS 13
1da177e4 LT	106	#define XFS_AGF_ALL_BITS ((1 << XFS_AGF_NUM_BITS) - 1)
1da177e4 LT	107
0b1b213f CH	108	#define XFS_AGF_FLAGS \
	109	{ XFS_AGF_MAGICNUM, "MAGICNUM" }, \
	110	{ XFS_AGF_VERSIONNUM, "VERSIONNUM" }, \
	111	{ XFS_AGF_SEQNO, "SEQNO" }, \
	112	{ XFS_AGF_LENGTH, "LENGTH" }, \
	113	{ XFS_AGF_ROOTS, "ROOTS" }, \
	114	{ XFS_AGF_LEVELS, "LEVELS" }, \
	115	{ XFS_AGF_FLFIRST, "FLFIRST" }, \
	116	{ XFS_AGF_FLLAST, "FLLAST" }, \
	117	{ XFS_AGF_FLCOUNT, "FLCOUNT" }, \
	118	{ XFS_AGF_FREEBLKS, "FREEBLKS" }, \
	119	{ XFS_AGF_LONGEST, "LONGEST" }, \
4e0e6040 DC	120	{ XFS_AGF_BTREEBLKS, "BTREEBLKS" }, \
4e0e6040 DC	121	{ XFS_AGF_UUID, "UUID" }
0b1b213f	122
1da177e4 LT	123	/* disk block (xfs_daddr_t) in the AG */
1da177e4 LT	124	#define XFS_AGF_DADDR(mp) ((xfs_daddr_t)(1 << (mp)->m_sectbb_log))
a844f451	125	#define XFS_AGF_BLOCK(mp) XFS_HDR_BLOCK(mp, XFS_AGF_DADDR(mp))
62926044	126	#define XFS_BUF_TO_AGF(bp) ((xfs_agf_t *)((bp)->b_addr))
a844f451	127
fef1111e ES	128	extern int xfs_read_agf(struct xfs_mount mp, struct xfs_trans tp,
	129	xfs_agnumber_t agno, int flags, struct xfs_buf **bpp);
	130
1813dd64 DC	131	extern const struct xfs_buf_ops xfs_agf_buf_ops;
1813dd64 DC	132
1da177e4 LT	133	/*
	134	* Size of the unlinked inode hash table in the agi.
	135	*/
	136	#define XFS_AGI_UNLINKED_BUCKETS 64
	137
16259e7d	138	typedef struct xfs_agi {
1da177e4 LT	139	/*
	140	* Common allocation group header information
	141	*/
16259e7d CH	142	__be32 agi_magicnum; /* magic number == XFS_AGI_MAGIC */
	143	__be32 agi_versionnum; /* header version == XFS_AGI_VERSION */
	144	__be32 agi_seqno; /* sequence # starting from 0 */
	145	__be32 agi_length; /* size in blocks of a.g. */
1da177e4 LT	146	/*
	147	* Inode information
	148	* Inodes are mapped by interpreting the inode number, so no
	149	* mapping data is needed here.
	150	*/
16259e7d CH	151	__be32 agi_count; /* count of allocated inodes */
	152	__be32 agi_root; /* root of inode btree */
	153	__be32 agi_level; /* levels in inode btree */
	154	__be32 agi_freecount; /* number of free inodes */
983d09ff	155
16259e7d CH	156	__be32 agi_newino; /* new inode just allocated */
16259e7d CH	157	__be32 agi_dirino; /* last directory inode chunk */
1da177e4 LT	158	/*
	159	* Hash table of inodes which have been unlinked but are
	160	* still being referenced.
	161	*/
16259e7d	162	__be32 agi_unlinked[XFS_AGI_UNLINKED_BUCKETS];
983d09ff DC	163
	164	uuid_t agi_uuid; /* uuid of filesystem */
	165	__be32 agi_crc; /* crc of agi sector */
	166	__be32 agi_pad32;
	167	__be64 agi_lsn; /* last write sequence */
	168
	169	/* structure must be padded to 64 bit alignment */
1da177e4 LT	170	} xfs_agi_t;
	171
	172	#define XFS_AGI_MAGICNUM 0x00000001
	173	#define XFS_AGI_VERSIONNUM 0x00000002
	174	#define XFS_AGI_SEQNO 0x00000004
	175	#define XFS_AGI_LENGTH 0x00000008
	176	#define XFS_AGI_COUNT 0x00000010
	177	#define XFS_AGI_ROOT 0x00000020
	178	#define XFS_AGI_LEVEL 0x00000040
	179	#define XFS_AGI_FREECOUNT 0x00000080
	180	#define XFS_AGI_NEWINO 0x00000100
	181	#define XFS_AGI_DIRINO 0x00000200
	182	#define XFS_AGI_UNLINKED 0x00000400
	183	#define XFS_AGI_NUM_BITS 11
	184	#define XFS_AGI_ALL_BITS ((1 << XFS_AGI_NUM_BITS) - 1)
	185
	186	/* disk block (xfs_daddr_t) in the AG */
	187	#define XFS_AGI_DADDR(mp) ((xfs_daddr_t)(2 << (mp)->m_sectbb_log))
a844f451	188	#define XFS_AGI_BLOCK(mp) XFS_HDR_BLOCK(mp, XFS_AGI_DADDR(mp))
62926044	189	#define XFS_BUF_TO_AGI(bp) ((xfs_agi_t *)((bp)->b_addr))
1da177e4	190
5e1be0fb CH	191	extern int xfs_read_agi(struct xfs_mount mp, struct xfs_trans tp,
	192	xfs_agnumber_t agno, struct xfs_buf **bpp);
	193
1813dd64 DC	194	extern const struct xfs_buf_ops xfs_agi_buf_ops;
1813dd64 DC	195
1da177e4 LT	196	/*
	197	* The third a.g. block contains the a.g. freelist, an array
	198	* of block pointers to blocks owned by the allocation btree code.
	199	*/
	200	#define XFS_AGFL_DADDR(mp) ((xfs_daddr_t)(3 << (mp)->m_sectbb_log))
a844f451	201	#define XFS_AGFL_BLOCK(mp) XFS_HDR_BLOCK(mp, XFS_AGFL_DADDR(mp))
62926044	202	#define XFS_BUF_TO_AGFL(bp) ((xfs_agfl_t *)((bp)->b_addr))
1da177e4	203
77c95bba CH	204	#define XFS_BUF_TO_AGFL_BNO(mp, bp) \
	205	(xfs_sb_version_hascrc(&((mp)->m_sb)) ? \
	206	&(XFS_BUF_TO_AGFL(bp)->agfl_bno[0]) : \
	207	(__be32 *)(bp)->b_addr)
	208
	209	/*
	210	* Size of the AGFL. For CRC-enabled filesystes we steal a couple of
	211	* slots in the beginning of the block for a proper header with the
	212	* location information and CRC.
	213	*/
	214	#define XFS_AGFL_SIZE(mp) \
	215	(((mp)->m_sb.sb_sectsize - \
	216	(xfs_sb_version_hascrc(&((mp)->m_sb)) ? \
	217	sizeof(struct xfs_agfl) : 0)) / \
	218	sizeof(xfs_agblock_t))
	219
1da177e4	220	typedef struct xfs_agfl {
77c95bba CH	221	__be32 agfl_magicnum;
	222	__be32 agfl_seqno;
	223	uuid_t agfl_uuid;
	224	__be64 agfl_lsn;
	225	__be32 agfl_crc;
	226	__be32 agfl_bno[]; /* actually XFS_AGFL_SIZE(mp) */
1da177e4 LT	227	} xfs_agfl_t;
1da177e4 LT	228
1da177e4 LT	229	/*
	230	* Per-ag incore structure, copies of information in agf and agi,
	231	* to improve the performance of allocation group selection.
1da177e4	232	*/
1da177e4	233	#define XFS_PAGB_NUM_SLOTS 128
1da177e4	234
aed3bb90	235	typedef struct xfs_perag {
0fa800fb DC	236	struct xfs_mount pag_mount; / owner filesystem */
0fa800fb DC	237	xfs_agnumber_t pag_agno; /* AG this structure belongs to */
aed3bb90	238	atomic_t pag_ref; /* perag reference count */
1da177e4 LT	239	char pagf_init; /* this agf's entry is initialized */
1da177e4 LT	240	char pagi_init; /* this agi's entry is initialized */
c41564b5	241	char pagf_metadata; /* the agf is preferred to be metadata */
1da177e4 LT	242	char pagi_inodeok; /* The agi is ok for inodes */
	243	__uint8_t pagf_levels[XFS_BTNUM_AGF];
	244	/* # of levels in bno & cnt btree */
	245	__uint32_t pagf_flcount; /* count of blocks in freelist */
	246	xfs_extlen_t pagf_freeblks; /* total free blocks */
	247	xfs_extlen_t pagf_longest; /* longest free space */
92821e2b	248	__uint32_t pagf_btreeblks; /* # of blocks held in AGF btrees */
1da177e4	249	xfs_agino_t pagi_freecount; /* number of free inodes */
92821e2b	250	xfs_agino_t pagi_count; /* number of allocated inodes */
bd169565 DC	251
	252	/*
	253	* Inode allocation search lookup optimisation.
	254	* If the pagino matches, the search for new inodes
	255	* doesn't need to search the near ones again straight away
	256	*/
	257	xfs_agino_t pagl_pagino;
	258	xfs_agino_t pagl_leftrec;
	259	xfs_agino_t pagl_rightrec;
1da177e4	260	#ifdef __KERNEL__
ed3b4d6c DC	261	spinlock_t pagb_lock; /* lock for pagb_tree */
ed3b4d6c DC	262	struct rb_root pagb_tree; /* ordered tree of busy extents */
847fff5c	263
2a82b8be	264	atomic_t pagf_fstrms; /* # of filestreams active in this AG */
da353b0d	265
1a427ab0	266	spinlock_t pag_ici_lock; /* incore inode cache lock */
da353b0d	267	struct radix_tree_root pag_ici_root; /* incore inode cache root */
9bf729c0	268	int pag_ici_reclaimable; /* reclaimable inodes */
69b491c2 DC	269	struct mutex pag_ici_reclaim_lock; /* serialisation point */
69b491c2 DC	270	unsigned long pag_ici_reclaim_cursor; /* reclaim restart point */
e176579e	271
74f75a0c DC	272	/* buffer cache index */
	273	spinlock_t pag_buf_lock; /* lock for pag_buf_tree */
	274	struct rb_root pag_buf_tree; /* ordered tree of active buffers */
	275
e176579e DC	276	/* for rcu-safe freeing */
e176579e DC	277	struct rcu_head rcu_head;
847fff5c	278	#endif
e57336ff	279	int pagb_count; /* pagb slots in use */
1da177e4 LT	280	} xfs_perag_t;
1da177e4 LT	281
396beb85 DC	282	/*
	283	* tags for inode radix tree
	284	*/
75f3cb13 DC	285	#define XFS_ICI_NO_TAG (-1) /* special flag for an untagged lookup
75f3cb13 DC	286	in xfs_inode_ag_iterator */
396beb85	287	#define XFS_ICI_RECLAIM_TAG 0 /* inode is to be reclaimed */
27b52867	288	#define XFS_ICI_EOFBLOCKS_TAG 1 /* inode has blocks beyond EOF */
396beb85	289
a844f451 NS	290	#define XFS_AG_MAXLEVELS(mp) ((mp)->m_ag_maxlevels)
	291	#define XFS_MIN_FREELIST_RAW(bl,cl,mp) \
	292	(MIN(bl + 1, XFS_AG_MAXLEVELS(mp)) + MIN(cl + 1, XFS_AG_MAXLEVELS(mp)))
	293	#define XFS_MIN_FREELIST(a,mp) \
	294	(XFS_MIN_FREELIST_RAW( \
16259e7d CH	295	be32_to_cpu((a)->agf_levels[XFS_BTNUM_BNOi]), \
16259e7d CH	296	be32_to_cpu((a)->agf_levels[XFS_BTNUM_CNTi]), mp))
1da177e4	297	#define XFS_MIN_FREELIST_PAG(pag,mp) \
a844f451	298	(XFS_MIN_FREELIST_RAW( \
a5687787 CH	299	(unsigned int)(pag)->pagf_levels[XFS_BTNUM_BNOi], \
a5687787 CH	300	(unsigned int)(pag)->pagf_levels[XFS_BTNUM_CNTi], mp))
1da177e4	301
a844f451	302	#define XFS_AGB_TO_FSB(mp,agno,agbno) \
1da177e4	303	(((xfs_fsblock_t)(agno) << (mp)->m_sb.sb_agblklog) \| (agbno))
a844f451	304	#define XFS_FSB_TO_AGNO(mp,fsbno) \
1da177e4	305	((xfs_agnumber_t)((fsbno) >> (mp)->m_sb.sb_agblklog))
a844f451	306	#define XFS_FSB_TO_AGBNO(mp,fsbno) \
fb82557f	307	((xfs_agblock_t)((fsbno) & xfs_mask32lo((mp)->m_sb.sb_agblklog)))
a844f451 NS	308	#define XFS_AGB_TO_DADDR(mp,agno,agbno) \
	309	((xfs_daddr_t)XFS_FSB_TO_BB(mp, \
	310	(xfs_fsblock_t)(agno) * (mp)->m_sb.sb_agblocks + (agbno)))
	311	#define XFS_AG_DADDR(mp,agno,d) (XFS_AGB_TO_DADDR(mp, agno, 0) + (d))
1da177e4 LT	312
	313	/*
	314	* For checking for bad ranges of xfs_daddr_t's, covering multiple
	315	* allocation groups or a single xfs_daddr_t that's a superblock copy.
	316	*/
1da177e4 LT	317	#define XFS_AG_CHECK_DADDR(mp,d,len) \
	318	((len) == 1 ? \
	319	ASSERT((d) == XFS_SB_DADDR \|\| \
9d87c319 ES	320	xfs_daddr_to_agbno(mp, d) != XFS_SB_DADDR) : \
	321	ASSERT(xfs_daddr_to_agno(mp, d) == \
	322	xfs_daddr_to_agno(mp, (d) + (len) - 1)))
1da177e4 LT	323
1da177e4 LT	324	#endif /* __XFS_AG_H__ */