Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
4ce3121f NS |
2 | * Copyright (c) 2000-2003 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
1da177e4 | 4 | * |
4ce3121f NS |
5 | * This program is free software; you can redistribute it and/or |
6 | * modify it under the terms of the GNU General Public License as | |
1da177e4 LT |
7 | * published by the Free Software Foundation. |
8 | * | |
4ce3121f 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 | * |
4ce3121f 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_QUOTA_PRIV_H__ | |
19 | #define __XFS_QUOTA_PRIV_H__ | |
20 | ||
21 | /* | |
22 | * Number of bmaps that we ask from bmapi when doing a quotacheck. | |
23 | * We make this restriction to keep the memory usage to a minimum. | |
24 | */ | |
25 | #define XFS_DQITER_MAP_SIZE 10 | |
26 | ||
27 | /* Number of dquots that fit in to a dquot block */ | |
28 | #define XFS_QM_DQPERBLK(mp) ((mp)->m_quotainfo->qi_dqperchunk) | |
29 | ||
1da177e4 LT |
30 | #define XFS_DQ_IS_ADDEDTO_TRX(t, d) ((d)->q_transp == (t)) |
31 | ||
32 | #define XFS_QI_MPLRECLAIMS(mp) ((mp)->m_quotainfo->qi_dqreclaims) | |
33 | #define XFS_QI_UQIP(mp) ((mp)->m_quotainfo->qi_uquotaip) | |
34 | #define XFS_QI_GQIP(mp) ((mp)->m_quotainfo->qi_gquotaip) | |
35 | #define XFS_QI_DQCHUNKLEN(mp) ((mp)->m_quotainfo->qi_dqchunklen) | |
36 | #define XFS_QI_BTIMELIMIT(mp) ((mp)->m_quotainfo->qi_btimelimit) | |
37 | #define XFS_QI_RTBTIMELIMIT(mp) ((mp)->m_quotainfo->qi_rtbtimelimit) | |
38 | #define XFS_QI_ITIMELIMIT(mp) ((mp)->m_quotainfo->qi_itimelimit) | |
39 | #define XFS_QI_BWARNLIMIT(mp) ((mp)->m_quotainfo->qi_bwarnlimit) | |
06d10dd9 | 40 | #define XFS_QI_RTBWARNLIMIT(mp) ((mp)->m_quotainfo->qi_rtbwarnlimit) |
1da177e4 LT |
41 | #define XFS_QI_IWARNLIMIT(mp) ((mp)->m_quotainfo->qi_iwarnlimit) |
42 | #define XFS_QI_QOFFLOCK(mp) ((mp)->m_quotainfo->qi_quotaofflock) | |
43 | ||
44 | #define XFS_QI_MPL_LIST(mp) ((mp)->m_quotainfo->qi_dqlist) | |
45 | #define XFS_QI_MPLLOCK(mp) ((mp)->m_quotainfo->qi_dqlist.qh_lock) | |
46 | #define XFS_QI_MPLNEXT(mp) ((mp)->m_quotainfo->qi_dqlist.qh_next) | |
47 | #define XFS_QI_MPLNDQUOTS(mp) ((mp)->m_quotainfo->qi_dqlist.qh_nelems) | |
48 | ||
794ee1ba | 49 | #define XQMLCK(h) (mutex_lock(&((h)->qh_lock))) |
1da177e4 LT |
50 | #define XQMUNLCK(h) (mutex_unlock(&((h)->qh_lock))) |
51 | #ifdef DEBUG | |
52 | struct xfs_dqhash; | |
53 | static inline int XQMISLCKD(struct xfs_dqhash *h) | |
54 | { | |
55 | if (mutex_trylock(&h->qh_lock)) { | |
56 | mutex_unlock(&h->qh_lock); | |
57 | return 0; | |
58 | } | |
59 | return 1; | |
60 | } | |
61 | #endif | |
62 | ||
63 | #define XFS_DQ_HASH_LOCK(h) XQMLCK(h) | |
64 | #define XFS_DQ_HASH_UNLOCK(h) XQMUNLCK(h) | |
65 | #define XFS_DQ_IS_HASH_LOCKED(h) XQMISLCKD(h) | |
66 | ||
67 | #define xfs_qm_mplist_lock(mp) XQMLCK(&(XFS_QI_MPL_LIST(mp))) | |
68 | #define xfs_qm_mplist_unlock(mp) XQMUNLCK(&(XFS_QI_MPL_LIST(mp))) | |
69 | #define XFS_QM_IS_MPLIST_LOCKED(mp) XQMISLCKD(&(XFS_QI_MPL_LIST(mp))) | |
70 | ||
71 | #define xfs_qm_freelist_lock(qm) XQMLCK(&((qm)->qm_dqfreelist)) | |
72 | #define xfs_qm_freelist_unlock(qm) XQMUNLCK(&((qm)->qm_dqfreelist)) | |
1da177e4 LT |
73 | |
74 | /* | |
75 | * Hash into a bucket in the dquot hash table, based on <mp, id>. | |
76 | */ | |
77 | #define XFS_DQ_HASHVAL(mp, id) (((__psunsigned_t)(mp) + \ | |
78 | (__psunsigned_t)(id)) & \ | |
79 | (xfs_Gqm->qm_dqhashmask - 1)) | |
80 | #define XFS_DQ_HASH(mp, id, type) (type == XFS_DQ_USER ? \ | |
81 | (xfs_Gqm->qm_usr_dqhtable + \ | |
82 | XFS_DQ_HASHVAL(mp, id)) : \ | |
83 | (xfs_Gqm->qm_grp_dqhtable + \ | |
84 | XFS_DQ_HASHVAL(mp, id))) | |
85 | #define XFS_IS_DQTYPE_ON(mp, type) (type == XFS_DQ_USER ? \ | |
c8ad20ff NS |
86 | XFS_IS_UQUOTA_ON(mp) : \ |
87 | XFS_IS_OQUOTA_ON(mp)) | |
1da177e4 LT |
88 | #define XFS_IS_DQUOT_UNINITIALIZED(dqp) ( \ |
89 | !dqp->q_core.d_blk_hardlimit && \ | |
90 | !dqp->q_core.d_blk_softlimit && \ | |
91 | !dqp->q_core.d_rtb_hardlimit && \ | |
92 | !dqp->q_core.d_rtb_softlimit && \ | |
93 | !dqp->q_core.d_ino_hardlimit && \ | |
94 | !dqp->q_core.d_ino_softlimit && \ | |
95 | !dqp->q_core.d_bcount && \ | |
96 | !dqp->q_core.d_rtbcount && \ | |
97 | !dqp->q_core.d_icount) | |
98 | ||
99 | #define HL_PREVP dq_hashlist.ql_prevp | |
100 | #define HL_NEXT dq_hashlist.ql_next | |
101 | #define MPL_PREVP dq_mplist.ql_prevp | |
102 | #define MPL_NEXT dq_mplist.ql_next | |
103 | ||
104 | ||
105 | #define _LIST_REMOVE(h, dqp, PVP, NXT) \ | |
106 | { \ | |
107 | xfs_dquot_t *d; \ | |
108 | if (((d) = (dqp)->NXT)) \ | |
109 | (d)->PVP = (dqp)->PVP; \ | |
110 | *((dqp)->PVP) = d; \ | |
111 | (dqp)->NXT = NULL; \ | |
112 | (dqp)->PVP = NULL; \ | |
113 | (h)->qh_version++; \ | |
114 | (h)->qh_nelems--; \ | |
115 | } | |
116 | ||
117 | #define _LIST_INSERT(h, dqp, PVP, NXT) \ | |
118 | { \ | |
119 | xfs_dquot_t *d; \ | |
120 | if (((d) = (h)->qh_next)) \ | |
121 | (d)->PVP = &((dqp)->NXT); \ | |
122 | (dqp)->NXT = d; \ | |
123 | (dqp)->PVP = &((h)->qh_next); \ | |
124 | (h)->qh_next = dqp; \ | |
125 | (h)->qh_version++; \ | |
126 | (h)->qh_nelems++; \ | |
127 | } | |
128 | ||
129 | #define FOREACH_DQUOT_IN_MP(dqp, mp) \ | |
130 | for ((dqp) = XFS_QI_MPLNEXT(mp); (dqp) != NULL; (dqp) = (dqp)->MPL_NEXT) | |
131 | ||
132 | #define FOREACH_DQUOT_IN_FREELIST(dqp, qlist) \ | |
133 | for ((dqp) = (qlist)->qh_next; (dqp) != (xfs_dquot_t *)(qlist); \ | |
134 | (dqp) = (dqp)->dq_flnext) | |
135 | ||
136 | #define XQM_HASHLIST_INSERT(h, dqp) \ | |
137 | _LIST_INSERT(h, dqp, HL_PREVP, HL_NEXT) | |
138 | ||
139 | #define XQM_FREELIST_INSERT(h, dqp) \ | |
140 | xfs_qm_freelist_append(h, dqp) | |
141 | ||
142 | #define XQM_MPLIST_INSERT(h, dqp) \ | |
143 | _LIST_INSERT(h, dqp, MPL_PREVP, MPL_NEXT) | |
144 | ||
145 | #define XQM_HASHLIST_REMOVE(h, dqp) \ | |
146 | _LIST_REMOVE(h, dqp, HL_PREVP, HL_NEXT) | |
147 | #define XQM_FREELIST_REMOVE(dqp) \ | |
148 | xfs_qm_freelist_unlink(dqp) | |
149 | #define XQM_MPLIST_REMOVE(h, dqp) \ | |
150 | { _LIST_REMOVE(h, dqp, MPL_PREVP, MPL_NEXT); \ | |
151 | XFS_QI_MPLRECLAIMS((dqp)->q_mount)++; } | |
152 | ||
153 | #define XFS_DQ_IS_LOGITEM_INITD(dqp) ((dqp)->q_logitem.qli_dquot == (dqp)) | |
154 | ||
155 | #define XFS_QM_DQP_TO_DQACCT(tp, dqp) (XFS_QM_ISUDQ(dqp) ? \ | |
156 | (tp)->t_dqinfo->dqa_usrdquots : \ | |
157 | (tp)->t_dqinfo->dqa_grpdquots) | |
158 | #define XFS_IS_SUSER_DQUOT(dqp) \ | |
159 | (!((dqp)->q_core.d_id)) | |
160 | ||
161 | #define XFS_PURGE_INODE(ip) \ | |
66f58d23 | 162 | IRELE(ip); |
1da177e4 LT |
163 | |
164 | #define DQFLAGTO_TYPESTR(d) (((d)->dq_flags & XFS_DQ_USER) ? "USR" : \ | |
c8ad20ff NS |
165 | (((d)->dq_flags & XFS_DQ_GROUP) ? "GRP" : \ |
166 | (((d)->dq_flags & XFS_DQ_PROJ) ? "PRJ":"???"))) | |
1da177e4 LT |
167 | |
168 | #endif /* __XFS_QUOTA_PRIV_H__ */ |