[mirror_ubuntu-artful-kernel.git] / fs / xfs / quota / xfs_quota_priv.h

/*
 * Copyright (c) 2000-2003 Silicon Graphics, Inc.  All Rights Reserved.
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of version 2 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.
 *
 * Further, this software is distributed without any warranty that it is
 * free of the rightful claim of any third person regarding infringement
 * or the like.	 Any license provided herein, whether implied or
 * otherwise, applies only to this software file.  Patent licenses, if
 * any, provided herein do not apply to combinations of this program with
 * other software, or any other product whatsoever.
 *
 * You should have received a copy of the GNU General Public License along
 * with this program; if not, write the Free Software Foundation, Inc., 59
 * Temple Place - Suite 330, Boston MA 02111-1307, USA.
 *
 * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
 * Mountain View, CA  94043, or:
 *
 * http://www.sgi.com
 *
 * For further information regarding this notice, see:
 *
 * http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/
 */
#ifndef __XFS_QUOTA_PRIV_H__
#define __XFS_QUOTA_PRIV_H__

/*
 * Number of bmaps that we ask from bmapi when doing a quotacheck.
 * We make this restriction to keep the memory usage to a minimum.
 */
#define XFS_DQITER_MAP_SIZE	10

/* Number of dquots that fit in to a dquot block */
#define XFS_QM_DQPERBLK(mp)	((mp)->m_quotainfo->qi_dqperchunk)

#define XFS_ISLOCKED_INODE(ip)		(ismrlocked(&(ip)->i_lock, \
					    MR_UPDATE | MR_ACCESS) != 0)
#define XFS_ISLOCKED_INODE_EXCL(ip)	(ismrlocked(&(ip)->i_lock, \
					    MR_UPDATE) != 0)

#define XFS_DQ_IS_ADDEDTO_TRX(t, d)	((d)->q_transp == (t))

#define XFS_QI_MPLRECLAIMS(mp)	((mp)->m_quotainfo->qi_dqreclaims)
#define XFS_QI_UQIP(mp)		((mp)->m_quotainfo->qi_uquotaip)
#define XFS_QI_GQIP(mp)		((mp)->m_quotainfo->qi_gquotaip)
#define XFS_QI_DQCHUNKLEN(mp)	((mp)->m_quotainfo->qi_dqchunklen)
#define XFS_QI_BTIMELIMIT(mp)	((mp)->m_quotainfo->qi_btimelimit)
#define XFS_QI_RTBTIMELIMIT(mp) ((mp)->m_quotainfo->qi_rtbtimelimit)
#define XFS_QI_ITIMELIMIT(mp)	((mp)->m_quotainfo->qi_itimelimit)
#define XFS_QI_BWARNLIMIT(mp)	((mp)->m_quotainfo->qi_bwarnlimit)
#define XFS_QI_RTBWARNLIMIT(mp)	((mp)->m_quotainfo->qi_rtbwarnlimit)
#define XFS_QI_IWARNLIMIT(mp)	((mp)->m_quotainfo->qi_iwarnlimit)
#define XFS_QI_QOFFLOCK(mp)	((mp)->m_quotainfo->qi_quotaofflock)

#define XFS_QI_MPL_LIST(mp)	((mp)->m_quotainfo->qi_dqlist)
#define XFS_QI_MPLLOCK(mp)	((mp)->m_quotainfo->qi_dqlist.qh_lock)
#define XFS_QI_MPLNEXT(mp)	((mp)->m_quotainfo->qi_dqlist.qh_next)
#define XFS_QI_MPLNDQUOTS(mp)	((mp)->m_quotainfo->qi_dqlist.qh_nelems)

#define XQMLCK(h)			(mutex_lock(&((h)->qh_lock), PINOD))
#define XQMUNLCK(h)			(mutex_unlock(&((h)->qh_lock)))
#ifdef DEBUG
struct xfs_dqhash;
static inline int XQMISLCKD(struct xfs_dqhash *h)
{
	if (mutex_trylock(&h->qh_lock)) {
		mutex_unlock(&h->qh_lock);
		return 0;
	}
	return 1;
}
#endif

#define XFS_DQ_HASH_LOCK(h)		XQMLCK(h)
#define XFS_DQ_HASH_UNLOCK(h)		XQMUNLCK(h)
#define XFS_DQ_IS_HASH_LOCKED(h)	XQMISLCKD(h)

#define xfs_qm_mplist_lock(mp)		XQMLCK(&(XFS_QI_MPL_LIST(mp)))
#define xfs_qm_mplist_unlock(mp)	XQMUNLCK(&(XFS_QI_MPL_LIST(mp)))
#define XFS_QM_IS_MPLIST_LOCKED(mp)	XQMISLCKD(&(XFS_QI_MPL_LIST(mp)))

#define xfs_qm_freelist_lock(qm)	XQMLCK(&((qm)->qm_dqfreelist))
#define xfs_qm_freelist_unlock(qm)	XQMUNLCK(&((qm)->qm_dqfreelist))
#define XFS_QM_IS_FREELIST_LOCKED(qm)	XQMISLCKD(&((qm)->qm_dqfreelist))

/*
 * Hash into a bucket in the dquot hash table, based on <mp, id>.
 */
#define XFS_DQ_HASHVAL(mp, id) (((__psunsigned_t)(mp) + \
				 (__psunsigned_t)(id)) & \
				(xfs_Gqm->qm_dqhashmask - 1))
#define XFS_DQ_HASH(mp, id, type)   (type == XFS_DQ_USER ? \
				     (xfs_Gqm->qm_usr_dqhtable + \
				      XFS_DQ_HASHVAL(mp, id)) : \
				     (xfs_Gqm->qm_grp_dqhtable + \
				      XFS_DQ_HASHVAL(mp, id)))
#define XFS_IS_DQTYPE_ON(mp, type)   (type == XFS_DQ_USER ? \
					XFS_IS_UQUOTA_ON(mp) : \
					XFS_IS_OQUOTA_ON(mp))
#define XFS_IS_DQUOT_UNINITIALIZED(dqp) ( \
	!dqp->q_core.d_blk_hardlimit && \
	!dqp->q_core.d_blk_softlimit && \
	!dqp->q_core.d_rtb_hardlimit && \
	!dqp->q_core.d_rtb_softlimit && \
	!dqp->q_core.d_ino_hardlimit && \
	!dqp->q_core.d_ino_softlimit && \
	!dqp->q_core.d_bcount && \
	!dqp->q_core.d_rtbcount && \
	!dqp->q_core.d_icount)

#define HL_PREVP	dq_hashlist.ql_prevp
#define HL_NEXT		dq_hashlist.ql_next
#define MPL_PREVP	dq_mplist.ql_prevp
#define MPL_NEXT	dq_mplist.ql_next


#define _LIST_REMOVE(h, dqp, PVP, NXT)				\
	{							\
		 xfs_dquot_t *d;				\
		 if (((d) = (dqp)->NXT))				\
			 (d)->PVP = (dqp)->PVP;			\
		 *((dqp)->PVP) = d;				\
		 (dqp)->NXT = NULL;				\
		 (dqp)->PVP = NULL;				\
		 (h)->qh_version++;				\
		 (h)->qh_nelems--;				\
	}

#define _LIST_INSERT(h, dqp, PVP, NXT)				\
	{							\
		 xfs_dquot_t *d;				\
		 if (((d) = (h)->qh_next))			\
			 (d)->PVP = &((dqp)->NXT);		\
		 (dqp)->NXT = d;				\
		 (dqp)->PVP = &((h)->qh_next);			\
		 (h)->qh_next = dqp;				\
		 (h)->qh_version++;				\
		 (h)->qh_nelems++;				\
	 }

#define FOREACH_DQUOT_IN_MP(dqp, mp) \
	for ((dqp) = XFS_QI_MPLNEXT(mp); (dqp) != NULL; (dqp) = (dqp)->MPL_NEXT)

#define FOREACH_DQUOT_IN_FREELIST(dqp, qlist)	\
for ((dqp) = (qlist)->qh_next; (dqp) != (xfs_dquot_t *)(qlist); \
     (dqp) = (dqp)->dq_flnext)

#define XQM_HASHLIST_INSERT(h, dqp)	\
	 _LIST_INSERT(h, dqp, HL_PREVP, HL_NEXT)

#define XQM_FREELIST_INSERT(h, dqp)	\
	 xfs_qm_freelist_append(h, dqp)

#define XQM_MPLIST_INSERT(h, dqp)	\
	 _LIST_INSERT(h, dqp, MPL_PREVP, MPL_NEXT)

#define XQM_HASHLIST_REMOVE(h, dqp)	\
	 _LIST_REMOVE(h, dqp, HL_PREVP, HL_NEXT)
#define XQM_FREELIST_REMOVE(dqp)	\
	 xfs_qm_freelist_unlink(dqp)
#define XQM_MPLIST_REMOVE(h, dqp)	\
	{ _LIST_REMOVE(h, dqp, MPL_PREVP, MPL_NEXT); \
	  XFS_QI_MPLRECLAIMS((dqp)->q_mount)++; }

#define XFS_DQ_IS_LOGITEM_INITD(dqp)	((dqp)->q_logitem.qli_dquot == (dqp))

#define XFS_QM_DQP_TO_DQACCT(tp, dqp)	(XFS_QM_ISUDQ(dqp) ? \
					 (tp)->t_dqinfo->dqa_usrdquots : \
					 (tp)->t_dqinfo->dqa_grpdquots)
#define XFS_IS_SUSER_DQUOT(dqp)		\
	(!((dqp)->q_core.d_id))

#define XFS_PURGE_INODE(ip)		\
	IRELE(ip);

#define DQFLAGTO_TYPESTR(d)	(((d)->dq_flags & XFS_DQ_USER) ? "USR" : \
				 (((d)->dq_flags & XFS_DQ_GROUP) ? "GRP" : \
				 (((d)->dq_flags & XFS_DQ_PROJ) ? "PRJ":"???")))
#define DQFLAGTO_DIRTYSTR(d)	(XFS_DQ_IS_DIRTY(d) ? "DIRTY" : "NOTDIRTY")

#endif	/* __XFS_QUOTA_PRIV_H__ */
Commit	Line	Data
1da177e4 LT	1	/*
	2	* Copyright (c) 2000-2003 Silicon Graphics, Inc. All Rights Reserved.
	3	*
	4	* This program is free software; you can redistribute it and/or modify it
	5	* under the terms of version 2 of the GNU General Public License as
	6	* published by the Free Software Foundation.
	7	*
	8	* This program is distributed in the hope that it would be useful, but
	9	* WITHOUT ANY WARRANTY; without even the implied warranty of
	10	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
	11	*
	12	* Further, this software is distributed without any warranty that it is
	13	* free of the rightful claim of any third person regarding infringement
	14	* or the like. Any license provided herein, whether implied or
	15	* otherwise, applies only to this software file. Patent licenses, if
	16	* any, provided herein do not apply to combinations of this program with
	17	* other software, or any other product whatsoever.
	18	*
	19	* You should have received a copy of the GNU General Public License along
	20	* with this program; if not, write the Free Software Foundation, Inc., 59
	21	* Temple Place - Suite 330, Boston MA 02111-1307, USA.
	22	*
	23	* Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
	24	* Mountain View, CA 94043, or:
	25	*
	26	* http://www.sgi.com
	27	*
	28	* For further information regarding this notice, see:
	29	*
	30	* http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/
	31	*/
	32	#ifndef __XFS_QUOTA_PRIV_H__
	33	#define __XFS_QUOTA_PRIV_H__
	34
	35	/*
	36	* Number of bmaps that we ask from bmapi when doing a quotacheck.
	37	* We make this restriction to keep the memory usage to a minimum.
	38	*/
	39	#define XFS_DQITER_MAP_SIZE 10
	40
	41	/* Number of dquots that fit in to a dquot block */
	42	#define XFS_QM_DQPERBLK(mp) ((mp)->m_quotainfo->qi_dqperchunk)
	43
	44	#define XFS_ISLOCKED_INODE(ip) (ismrlocked(&(ip)->i_lock, \
	45	MR_UPDATE \| MR_ACCESS) != 0)
	46	#define XFS_ISLOCKED_INODE_EXCL(ip) (ismrlocked(&(ip)->i_lock, \
	47	MR_UPDATE) != 0)
	48
	49	#define XFS_DQ_IS_ADDEDTO_TRX(t, d) ((d)->q_transp == (t))
	50
	51	#define XFS_QI_MPLRECLAIMS(mp) ((mp)->m_quotainfo->qi_dqreclaims)
	52	#define XFS_QI_UQIP(mp) ((mp)->m_quotainfo->qi_uquotaip)
	53	#define XFS_QI_GQIP(mp) ((mp)->m_quotainfo->qi_gquotaip)
	54	#define XFS_QI_DQCHUNKLEN(mp) ((mp)->m_quotainfo->qi_dqchunklen)
	55	#define XFS_QI_BTIMELIMIT(mp) ((mp)->m_quotainfo->qi_btimelimit)
	56	#define XFS_QI_RTBTIMELIMIT(mp) ((mp)->m_quotainfo->qi_rtbtimelimit)
	57	#define XFS_QI_ITIMELIMIT(mp) ((mp)->m_quotainfo->qi_itimelimit)
	58	#define XFS_QI_BWARNLIMIT(mp) ((mp)->m_quotainfo->qi_bwarnlimit)
06d10dd9	59	#define XFS_QI_RTBWARNLIMIT(mp) ((mp)->m_quotainfo->qi_rtbwarnlimit)
1da177e4 LT	60	#define XFS_QI_IWARNLIMIT(mp) ((mp)->m_quotainfo->qi_iwarnlimit)
	61	#define XFS_QI_QOFFLOCK(mp) ((mp)->m_quotainfo->qi_quotaofflock)
	62
	63	#define XFS_QI_MPL_LIST(mp) ((mp)->m_quotainfo->qi_dqlist)
	64	#define XFS_QI_MPLLOCK(mp) ((mp)->m_quotainfo->qi_dqlist.qh_lock)
	65	#define XFS_QI_MPLNEXT(mp) ((mp)->m_quotainfo->qi_dqlist.qh_next)
	66	#define XFS_QI_MPLNDQUOTS(mp) ((mp)->m_quotainfo->qi_dqlist.qh_nelems)
	67
	68	#define XQMLCK(h) (mutex_lock(&((h)->qh_lock), PINOD))
	69	#define XQMUNLCK(h) (mutex_unlock(&((h)->qh_lock)))
	70	#ifdef DEBUG
	71	struct xfs_dqhash;
	72	static inline int XQMISLCKD(struct xfs_dqhash *h)
	73	{
	74	if (mutex_trylock(&h->qh_lock)) {
	75	mutex_unlock(&h->qh_lock);
	76	return 0;
	77	}
	78	return 1;
	79	}
	80	#endif
	81
	82	#define XFS_DQ_HASH_LOCK(h) XQMLCK(h)
	83	#define XFS_DQ_HASH_UNLOCK(h) XQMUNLCK(h)
	84	#define XFS_DQ_IS_HASH_LOCKED(h) XQMISLCKD(h)
	85
	86	#define xfs_qm_mplist_lock(mp) XQMLCK(&(XFS_QI_MPL_LIST(mp)))
	87	#define xfs_qm_mplist_unlock(mp) XQMUNLCK(&(XFS_QI_MPL_LIST(mp)))
	88	#define XFS_QM_IS_MPLIST_LOCKED(mp) XQMISLCKD(&(XFS_QI_MPL_LIST(mp)))
	89
	90	#define xfs_qm_freelist_lock(qm) XQMLCK(&((qm)->qm_dqfreelist))
	91	#define xfs_qm_freelist_unlock(qm) XQMUNLCK(&((qm)->qm_dqfreelist))
	92	#define XFS_QM_IS_FREELIST_LOCKED(qm) XQMISLCKD(&((qm)->qm_dqfreelist))
	93
	94	/*
	95	* Hash into a bucket in the dquot hash table, based on <mp, id>.
	96	*/
	97	#define XFS_DQ_HASHVAL(mp, id) (((__psunsigned_t)(mp) + \
	98	(__psunsigned_t)(id)) & \
	99	(xfs_Gqm->qm_dqhashmask - 1))
	100	#define XFS_DQ_HASH(mp, id, type) (type == XFS_DQ_USER ? \
	101	(xfs_Gqm->qm_usr_dqhtable + \
	102	XFS_DQ_HASHVAL(mp, id)) : \
	103	(xfs_Gqm->qm_grp_dqhtable + \
	104	XFS_DQ_HASHVAL(mp, id)))
	105	#define XFS_IS_DQTYPE_ON(mp, type) (type == XFS_DQ_USER ? \
c8ad20ff NS	106	XFS_IS_UQUOTA_ON(mp) : \
c8ad20ff NS	107	XFS_IS_OQUOTA_ON(mp))
1da177e4 LT	108	#define XFS_IS_DQUOT_UNINITIALIZED(dqp) ( \
	109	!dqp->q_core.d_blk_hardlimit && \
	110	!dqp->q_core.d_blk_softlimit && \
	111	!dqp->q_core.d_rtb_hardlimit && \
	112	!dqp->q_core.d_rtb_softlimit && \
	113	!dqp->q_core.d_ino_hardlimit && \
	114	!dqp->q_core.d_ino_softlimit && \
	115	!dqp->q_core.d_bcount && \
	116	!dqp->q_core.d_rtbcount && \
	117	!dqp->q_core.d_icount)
	118
	119	#define HL_PREVP dq_hashlist.ql_prevp
	120	#define HL_NEXT dq_hashlist.ql_next
	121	#define MPL_PREVP dq_mplist.ql_prevp
	122	#define MPL_NEXT dq_mplist.ql_next
	123
	124
	125	#define _LIST_REMOVE(h, dqp, PVP, NXT) \
	126	{ \
	127	xfs_dquot_t *d; \
	128	if (((d) = (dqp)->NXT)) \
	129	(d)->PVP = (dqp)->PVP; \
	130	*((dqp)->PVP) = d; \
	131	(dqp)->NXT = NULL; \
	132	(dqp)->PVP = NULL; \
	133	(h)->qh_version++; \
	134	(h)->qh_nelems--; \
	135	}
	136
	137	#define _LIST_INSERT(h, dqp, PVP, NXT) \
	138	{ \
	139	xfs_dquot_t *d; \
	140	if (((d) = (h)->qh_next)) \
	141	(d)->PVP = &((dqp)->NXT); \
	142	(dqp)->NXT = d; \
	143	(dqp)->PVP = &((h)->qh_next); \
	144	(h)->qh_next = dqp; \
	145	(h)->qh_version++; \
	146	(h)->qh_nelems++; \
	147	}
	148
	149	#define FOREACH_DQUOT_IN_MP(dqp, mp) \
	150	for ((dqp) = XFS_QI_MPLNEXT(mp); (dqp) != NULL; (dqp) = (dqp)->MPL_NEXT)
	151
	152	#define FOREACH_DQUOT_IN_FREELIST(dqp, qlist) \
	153	for ((dqp) = (qlist)->qh_next; (dqp) != (xfs_dquot_t *)(qlist); \
	154	(dqp) = (dqp)->dq_flnext)
	155
	156	#define XQM_HASHLIST_INSERT(h, dqp) \
	157	_LIST_INSERT(h, dqp, HL_PREVP, HL_NEXT)
	158
	159	#define XQM_FREELIST_INSERT(h, dqp) \
	160	xfs_qm_freelist_append(h, dqp)
	161
	162	#define XQM_MPLIST_INSERT(h, dqp) \
	163	_LIST_INSERT(h, dqp, MPL_PREVP, MPL_NEXT)
	164
	165	#define XQM_HASHLIST_REMOVE(h, dqp) \
	166	_LIST_REMOVE(h, dqp, HL_PREVP, HL_NEXT)
	167	#define XQM_FREELIST_REMOVE(dqp) \
	168	xfs_qm_freelist_unlink(dqp)
	169	#define XQM_MPLIST_REMOVE(h, dqp) \
	170	{ _LIST_REMOVE(h, dqp, MPL_PREVP, MPL_NEXT); \
	171	XFS_QI_MPLRECLAIMS((dqp)->q_mount)++; }
172
173	#define XFS_DQ_IS_LOGITEM_INITD(dqp) ((dqp)->q_logitem.qli_dquot == (dqp))
174
175	#define XFS_QM_DQP_TO_DQACCT(tp, dqp) (XFS_QM_ISUDQ(dqp) ? \
176	(tp)->t_dqinfo->dqa_usrdquots : \
177	(tp)->t_dqinfo->dqa_grpdquots)
178	#define XFS_IS_SUSER_DQUOT(dqp) \
179	(!((dqp)->q_core.d_id))
180
181	#define XFS_PURGE_INODE(ip) \
66f58d23	182	IRELE(ip);
1da177e4 LT	183
1da177e4 LT	184	#define DQFLAGTO_TYPESTR(d) (((d)->dq_flags & XFS_DQ_USER) ? "USR" : \
c8ad20ff NS	185	(((d)->dq_flags & XFS_DQ_GROUP) ? "GRP" : \
c8ad20ff NS	186	(((d)->dq_flags & XFS_DQ_PROJ) ? "PRJ":"???")))
1da177e4 LT	187	#define DQFLAGTO_DIRTYSTR(d) (XFS_DQ_IS_DIRTY(d) ? "DIRTY" : "NOTDIRTY")
	188
	189	#endif /* __XFS_QUOTA_PRIV_H__ */