]>
Commit | Line | Data |
---|---|---|
0b61f8a4 | 1 | // SPDX-License-Identifier: GPL-2.0 |
1da177e4 | 2 | /* |
4ce3121f NS |
3 | * Copyright (c) 2000-2003 Silicon Graphics, Inc. |
4 | * All Rights Reserved. | |
1da177e4 | 5 | */ |
1da177e4 LT |
6 | #include "xfs.h" |
7 | #include "xfs_fs.h" | |
6ca1c906 | 8 | #include "xfs_format.h" |
239880ef | 9 | #include "xfs_log_format.h" |
70a9883c | 10 | #include "xfs_shared.h" |
239880ef | 11 | #include "xfs_trans_resv.h" |
a844f451 | 12 | #include "xfs_bit.h" |
1da177e4 | 13 | #include "xfs_mount.h" |
3ab78df2 | 14 | #include "xfs_defer.h" |
1da177e4 LT |
15 | #include "xfs_inode.h" |
16 | #include "xfs_bmap.h" | |
239880ef | 17 | #include "xfs_quota.h" |
239880ef | 18 | #include "xfs_trans.h" |
1da177e4 LT |
19 | #include "xfs_buf_item.h" |
20 | #include "xfs_trans_space.h" | |
21 | #include "xfs_trans_priv.h" | |
1da177e4 | 22 | #include "xfs_qm.h" |
0b1b213f | 23 | #include "xfs_trace.h" |
239880ef | 24 | #include "xfs_log.h" |
a4fbe6ab | 25 | #include "xfs_bmap_btree.h" |
afeda600 | 26 | #include "xfs_error.h" |
1da177e4 | 27 | |
1da177e4 | 28 | /* |
bf72de31 CH |
29 | * Lock order: |
30 | * | |
31 | * ip->i_lock | |
9f920f11 | 32 | * qi->qi_tree_lock |
b84a3a96 CH |
33 | * dquot->q_qlock (xfs_dqlock() and friends) |
34 | * dquot->q_flush (xfs_dqflock() and friends) | |
35 | * qi->qi_lru_lock | |
bf72de31 CH |
36 | * |
37 | * If two dquots need to be locked the order is user before group/project, | |
38 | * otherwise by the lowest id first, see xfs_dqlock2. | |
39 | */ | |
1da177e4 | 40 | |
a05931ce CH |
41 | struct kmem_zone *xfs_qm_dqtrxzone; |
42 | static struct kmem_zone *xfs_qm_dqzone; | |
43 | ||
f112a049 DC |
44 | static struct lock_class_key xfs_dquot_group_class; |
45 | static struct lock_class_key xfs_dquot_project_class; | |
98b8c7a0 | 46 | |
1da177e4 LT |
47 | /* |
48 | * This is called to free all the memory associated with a dquot | |
49 | */ | |
50 | void | |
51 | xfs_qm_dqdestroy( | |
aefe69a4 | 52 | struct xfs_dquot *dqp) |
1da177e4 | 53 | { |
f8739c3c | 54 | ASSERT(list_empty(&dqp->q_lru)); |
1da177e4 | 55 | |
b1c5ebb2 | 56 | kmem_free(dqp->q_logitem.qli_item.li_lv_shadow); |
1da177e4 | 57 | mutex_destroy(&dqp->q_qlock); |
0b1b213f | 58 | |
ff6d6af2 | 59 | XFS_STATS_DEC(dqp->q_mount, xs_qm_dquot); |
377bcd5f | 60 | kmem_cache_free(xfs_qm_dqzone, dqp); |
1da177e4 LT |
61 | } |
62 | ||
1da177e4 LT |
63 | /* |
64 | * If default limits are in force, push them into the dquot now. | |
65 | * We overwrite the dquot limits only if they are zero and this | |
66 | * is not the root dquot. | |
67 | */ | |
68 | void | |
69 | xfs_qm_adjust_dqlimits( | |
4b6eae2e | 70 | struct xfs_dquot *dq) |
1da177e4 | 71 | { |
c8c753e1 | 72 | struct xfs_mount *mp = dq->q_mount; |
4b6eae2e | 73 | struct xfs_quotainfo *q = mp->m_quotainfo; |
be607946 | 74 | struct xfs_def_quota *defq; |
b1366451 | 75 | int prealloc = 0; |
1da177e4 | 76 | |
c51df733 | 77 | ASSERT(dq->q_id); |
ce6e7e79 | 78 | defq = xfs_get_defquota(q, xfs_dquot_type(dq)); |
1da177e4 | 79 | |
12d720fb | 80 | if (!dq->q_blk.softlimit) { |
438769e3 | 81 | dq->q_blk.softlimit = defq->blk.soft; |
b1366451 BF |
82 | prealloc = 1; |
83 | } | |
12d720fb | 84 | if (!dq->q_blk.hardlimit) { |
438769e3 | 85 | dq->q_blk.hardlimit = defq->blk.hard; |
b1366451 BF |
86 | prealloc = 1; |
87 | } | |
12d720fb | 88 | if (!dq->q_ino.softlimit) |
438769e3 | 89 | dq->q_ino.softlimit = defq->ino.soft; |
12d720fb | 90 | if (!dq->q_ino.hardlimit) |
438769e3 | 91 | dq->q_ino.hardlimit = defq->ino.hard; |
12d720fb | 92 | if (!dq->q_rtb.softlimit) |
438769e3 | 93 | dq->q_rtb.softlimit = defq->rtb.soft; |
12d720fb | 94 | if (!dq->q_rtb.hardlimit) |
438769e3 | 95 | dq->q_rtb.hardlimit = defq->rtb.hard; |
b1366451 BF |
96 | |
97 | if (prealloc) | |
98 | xfs_dquot_set_prealloc_limits(dq); | |
1da177e4 LT |
99 | } |
100 | ||
11d8a919 DW |
101 | /* Set the expiration time of a quota's grace period. */ |
102 | time64_t | |
103 | xfs_dquot_set_timeout( | |
104 | struct xfs_mount *mp, | |
105 | time64_t timeout) | |
106 | { | |
107 | struct xfs_quotainfo *qi = mp->m_quotainfo; | |
108 | ||
109 | return clamp_t(time64_t, timeout, qi->qi_expiry_min, | |
110 | qi->qi_expiry_max); | |
111 | } | |
112 | ||
ccc8e771 DW |
113 | /* Set the length of the default grace period. */ |
114 | time64_t | |
115 | xfs_dquot_set_grace_period( | |
116 | time64_t grace) | |
117 | { | |
118 | return clamp_t(time64_t, grace, XFS_DQ_GRACE_MIN, XFS_DQ_GRACE_MAX); | |
119 | } | |
120 | ||
ea0cc6fa DW |
121 | /* |
122 | * Determine if this quota counter is over either limit and set the quota | |
123 | * timers as appropriate. | |
124 | */ | |
125 | static inline void | |
126 | xfs_qm_adjust_res_timer( | |
11d8a919 | 127 | struct xfs_mount *mp, |
ea0cc6fa DW |
128 | struct xfs_dquot_res *res, |
129 | struct xfs_quota_limits *qlim) | |
130 | { | |
131 | ASSERT(res->hardlimit == 0 || res->softlimit <= res->hardlimit); | |
132 | ||
133 | if ((res->softlimit && res->count > res->softlimit) || | |
134 | (res->hardlimit && res->count > res->hardlimit)) { | |
135 | if (res->timer == 0) | |
11d8a919 DW |
136 | res->timer = xfs_dquot_set_timeout(mp, |
137 | ktime_get_real_seconds() + qlim->time); | |
ea0cc6fa DW |
138 | } else { |
139 | if (res->timer == 0) | |
140 | res->warnings = 0; | |
141 | else | |
142 | res->timer = 0; | |
143 | } | |
144 | } | |
145 | ||
1da177e4 LT |
146 | /* |
147 | * Check the limits and timers of a dquot and start or reset timers | |
148 | * if necessary. | |
149 | * This gets called even when quota enforcement is OFF, which makes our | |
150 | * life a little less complicated. (We just don't reject any quota | |
151 | * reservations in that case, when enforcement is off). | |
152 | * We also return 0 as the values of the timers in Q_GETQUOTA calls, when | |
153 | * enforcement's off. | |
154 | * In contrast, warnings are a little different in that they don't | |
754002b4 NS |
155 | * 'automatically' get started when limits get exceeded. They do |
156 | * get reset to zero, however, when we find the count to be under | |
157 | * the soft limit (they are only ever set non-zero via userspace). | |
1da177e4 LT |
158 | */ |
159 | void | |
160 | xfs_qm_adjust_dqtimers( | |
3dbb9aa3 | 161 | struct xfs_dquot *dq) |
1da177e4 | 162 | { |
c8c753e1 | 163 | struct xfs_mount *mp = dq->q_mount; |
e850301f | 164 | struct xfs_quotainfo *qi = mp->m_quotainfo; |
e850301f ES |
165 | struct xfs_def_quota *defq; |
166 | ||
c51df733 | 167 | ASSERT(dq->q_id); |
e850301f | 168 | defq = xfs_get_defquota(qi, xfs_dquot_type(dq)); |
1da177e4 | 169 | |
11d8a919 DW |
170 | xfs_qm_adjust_res_timer(dq->q_mount, &dq->q_blk, &defq->blk); |
171 | xfs_qm_adjust_res_timer(dq->q_mount, &dq->q_ino, &defq->ino); | |
172 | xfs_qm_adjust_res_timer(dq->q_mount, &dq->q_rtb, &defq->rtb); | |
1da177e4 LT |
173 | } |
174 | ||
1da177e4 LT |
175 | /* |
176 | * initialize a buffer full of dquots and log the whole thing | |
177 | */ | |
178 | STATIC void | |
179 | xfs_qm_init_dquot_blk( | |
78bba5c8 DW |
180 | struct xfs_trans *tp, |
181 | struct xfs_mount *mp, | |
182 | xfs_dqid_t id, | |
1a7ed271 | 183 | xfs_dqtype_t type, |
78bba5c8 | 184 | struct xfs_buf *bp) |
1da177e4 | 185 | { |
8a7b8a89 | 186 | struct xfs_quotainfo *q = mp->m_quotainfo; |
78bba5c8 DW |
187 | struct xfs_dqblk *d; |
188 | xfs_dqid_t curid; | |
189 | unsigned int qflag; | |
190 | unsigned int blftype; | |
191 | int i; | |
1da177e4 LT |
192 | |
193 | ASSERT(tp); | |
0c842ad4 | 194 | ASSERT(xfs_buf_islocked(bp)); |
1da177e4 | 195 | |
e6eb603c DW |
196 | switch (type) { |
197 | case XFS_DQTYPE_USER: | |
198 | qflag = XFS_UQUOTA_CHKD; | |
199 | blftype = XFS_BLF_UDQUOT_BUF; | |
200 | break; | |
201 | case XFS_DQTYPE_PROJ: | |
202 | qflag = XFS_PQUOTA_CHKD; | |
203 | blftype = XFS_BLF_PDQUOT_BUF; | |
204 | break; | |
205 | case XFS_DQTYPE_GROUP: | |
206 | qflag = XFS_GQUOTA_CHKD; | |
207 | blftype = XFS_BLF_GDQUOT_BUF; | |
208 | break; | |
209 | default: | |
210 | ASSERT(0); | |
211 | return; | |
212 | } | |
213 | ||
62926044 | 214 | d = bp->b_addr; |
1da177e4 LT |
215 | |
216 | /* | |
217 | * ID of the first dquot in the block - id's are zero based. | |
218 | */ | |
8a7b8a89 | 219 | curid = id - (id % q->qi_dqperchunk); |
8a7b8a89 | 220 | memset(d, 0, BBTOB(q->qi_dqchunklen)); |
49d35a5c CH |
221 | for (i = 0; i < q->qi_dqperchunk; i++, d++, curid++) { |
222 | d->dd_diskdq.d_magic = cpu_to_be16(XFS_DQUOT_MAGIC); | |
223 | d->dd_diskdq.d_version = XFS_DQUOT_VERSION; | |
224 | d->dd_diskdq.d_id = cpu_to_be32(curid); | |
d8c1af0d | 225 | d->dd_diskdq.d_type = type; |
38c26bfd | 226 | if (curid > 0 && xfs_has_bigtime(mp)) |
4ea1ff3b | 227 | d->dd_diskdq.d_type |= XFS_DQTYPE_BIGTIME; |
38c26bfd | 228 | if (xfs_has_crc(mp)) { |
92863451 | 229 | uuid_copy(&d->dd_uuid, &mp->m_sb.sb_meta_uuid); |
6fcdc59d DC |
230 | xfs_update_cksum((char *)d, sizeof(struct xfs_dqblk), |
231 | XFS_DQUOT_CRC_OFF); | |
232 | } | |
49d35a5c CH |
233 | } |
234 | ||
78bba5c8 DW |
235 | xfs_trans_dquot_buf(tp, bp, blftype); |
236 | ||
237 | /* | |
238 | * quotacheck uses delayed writes to update all the dquots on disk in an | |
239 | * efficient manner instead of logging the individual dquot changes as | |
240 | * they are made. However if we log the buffer allocated here and crash | |
241 | * after quotacheck while the logged initialisation is still in the | |
242 | * active region of the log, log recovery can replay the dquot buffer | |
243 | * initialisation over the top of the checked dquots and corrupt quota | |
244 | * accounting. | |
245 | * | |
246 | * To avoid this problem, quotacheck cannot log the initialised buffer. | |
247 | * We must still dirty the buffer and write it back before the | |
248 | * allocation transaction clears the log. Therefore, mark the buffer as | |
249 | * ordered instead of logging it directly. This is safe for quotacheck | |
250 | * because it detects and repairs allocated but initialized dquot blocks | |
251 | * in the quota inodes. | |
252 | */ | |
253 | if (!(mp->m_qflags & qflag)) | |
254 | xfs_trans_ordered_buf(tp, bp); | |
255 | else | |
256 | xfs_trans_log_buf(tp, bp, 0, BBTOB(q->qi_dqchunklen) - 1); | |
1da177e4 LT |
257 | } |
258 | ||
b1366451 BF |
259 | /* |
260 | * Initialize the dynamic speculative preallocation thresholds. The lo/hi | |
261 | * watermarks correspond to the soft and hard limits by default. If a soft limit | |
262 | * is not specified, we use 95% of the hard limit. | |
263 | */ | |
264 | void | |
265 | xfs_dquot_set_prealloc_limits(struct xfs_dquot *dqp) | |
266 | { | |
c8ce540d | 267 | uint64_t space; |
b1366451 | 268 | |
d3537cf9 DW |
269 | dqp->q_prealloc_hi_wmark = dqp->q_blk.hardlimit; |
270 | dqp->q_prealloc_lo_wmark = dqp->q_blk.softlimit; | |
b1366451 BF |
271 | if (!dqp->q_prealloc_lo_wmark) { |
272 | dqp->q_prealloc_lo_wmark = dqp->q_prealloc_hi_wmark; | |
273 | do_div(dqp->q_prealloc_lo_wmark, 100); | |
274 | dqp->q_prealloc_lo_wmark *= 95; | |
275 | } | |
276 | ||
277 | space = dqp->q_prealloc_hi_wmark; | |
278 | ||
279 | do_div(space, 100); | |
280 | dqp->q_low_space[XFS_QLOWSP_1_PCNT] = space; | |
281 | dqp->q_low_space[XFS_QLOWSP_3_PCNT] = space * 3; | |
282 | dqp->q_low_space[XFS_QLOWSP_5_PCNT] = space * 5; | |
283 | } | |
284 | ||
1da177e4 | 285 | /* |
d63192c8 | 286 | * Ensure that the given in-core dquot has a buffer on disk backing it, and |
710d707d DW |
287 | * return the buffer locked and held. This is called when the bmapi finds a |
288 | * hole. | |
1da177e4 LT |
289 | */ |
290 | STATIC int | |
d63192c8 DW |
291 | xfs_dquot_disk_alloc( |
292 | struct xfs_trans **tpp, | |
293 | struct xfs_dquot *dqp, | |
294 | struct xfs_buf **bpp) | |
1da177e4 | 295 | { |
d63192c8 | 296 | struct xfs_bmbt_irec map; |
2ba13721 BF |
297 | struct xfs_trans *tp = *tpp; |
298 | struct xfs_mount *mp = tp->t_mountp; | |
d63192c8 | 299 | struct xfs_buf *bp; |
1a7ed271 | 300 | xfs_dqtype_t qtype = xfs_dquot_type(dqp); |
0b04dd5d | 301 | struct xfs_inode *quotip = xfs_quota_inode(mp, qtype); |
d63192c8 DW |
302 | int nmaps = 1; |
303 | int error; | |
0b1b213f CH |
304 | |
305 | trace_xfs_dqalloc(dqp); | |
1da177e4 | 306 | |
1da177e4 | 307 | xfs_ilock(quotip, XFS_ILOCK_EXCL); |
0b04dd5d | 308 | if (!xfs_this_quota_on(dqp->q_mount, qtype)) { |
d63192c8 DW |
309 | /* |
310 | * Return if this type of quotas is turned off while we didn't | |
311 | * have an inode lock | |
312 | */ | |
1da177e4 | 313 | xfs_iunlock(quotip, XFS_ILOCK_EXCL); |
2451337d | 314 | return -ESRCH; |
1da177e4 LT |
315 | } |
316 | ||
2ba13721 | 317 | xfs_trans_ijoin(tp, quotip, XFS_ILOCK_EXCL); |
727e1acd CB |
318 | |
319 | error = xfs_iext_count_may_overflow(quotip, XFS_DATA_FORK, | |
320 | XFS_IEXT_ADD_NOSPLIT_CNT); | |
321 | if (error) | |
322 | return error; | |
323 | ||
324 | /* Create the block mapping. */ | |
2ba13721 | 325 | error = xfs_bmapi_write(tp, quotip, dqp->q_fileoffset, |
da781e64 BF |
326 | XFS_DQUOT_CLUSTER_SIZE_FSB, XFS_BMAPI_METADATA, 0, &map, |
327 | &nmaps); | |
c0dc7828 | 328 | if (error) |
73971b17 | 329 | return error; |
1da177e4 LT |
330 | ASSERT(map.br_blockcount == XFS_DQUOT_CLUSTER_SIZE_FSB); |
331 | ASSERT(nmaps == 1); | |
332 | ASSERT((map.br_startblock != DELAYSTARTBLOCK) && | |
333 | (map.br_startblock != HOLESTARTBLOCK)); | |
334 | ||
335 | /* | |
336 | * Keep track of the blkno to save a lookup later | |
337 | */ | |
338 | dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock); | |
339 | ||
340 | /* now we can just get the buffer (there's nothing to read yet) */ | |
ce92464c DW |
341 | error = xfs_trans_get_buf(tp, mp->m_ddev_targp, dqp->q_blkno, |
342 | mp->m_quotainfo->qi_dqchunklen, 0, &bp); | |
343 | if (error) | |
344 | return error; | |
1813dd64 | 345 | bp->b_ops = &xfs_dquot_buf_ops; |
2a30f36d | 346 | |
1da177e4 LT |
347 | /* |
348 | * Make a chunk of dquots out of this buffer and log | |
349 | * the entire thing. | |
350 | */ | |
0b04dd5d | 351 | xfs_qm_init_dquot_blk(tp, mp, dqp->q_id, qtype, bp); |
d63192c8 | 352 | xfs_buf_set_ref(bp, XFS_DQUOT_REF); |
1da177e4 | 353 | |
efa092f3 | 354 | /* |
7b6b50f5 DW |
355 | * Hold the buffer and join it to the dfops so that we'll still own |
356 | * the buffer when we return to the caller. The buffer disposal on | |
357 | * error must be paid attention to very carefully, as it has been | |
358 | * broken since commit efa092f3d4c6 "[XFS] Fixes a bug in the quota | |
359 | * code when allocating a new dquot record" in 2005, and the later | |
360 | * conversion to xfs_defer_ops in commit 310a75a3c6c747 failed to keep | |
361 | * the buffer locked across the _defer_finish call. We can now do | |
362 | * this correctly with xfs_defer_bjoin. | |
efa092f3 | 363 | * |
73971b17 BF |
364 | * Above, we allocated a disk block for the dquot information and used |
365 | * get_buf to initialize the dquot. If the _defer_finish fails, the old | |
7b6b50f5 DW |
366 | * transaction is gone but the new buffer is not joined or held to any |
367 | * transaction, so we must _buf_relse it. | |
efa092f3 | 368 | * |
7b6b50f5 | 369 | * If everything succeeds, the caller of this function is returned a |
d63192c8 | 370 | * buffer that is locked and held to the transaction. The caller |
7b6b50f5 | 371 | * is responsible for unlocking any buffer passed back, either |
710d707d DW |
372 | * manually or by committing the transaction. On error, the buffer is |
373 | * released and not passed back. | |
efa092f3 | 374 | */ |
2ba13721 | 375 | xfs_trans_bhold(tp, bp); |
9e28a242 | 376 | error = xfs_defer_finish(tpp); |
7b6b50f5 | 377 | if (error) { |
710d707d DW |
378 | xfs_trans_bhold_release(*tpp, bp); |
379 | xfs_trans_brelse(*tpp, bp); | |
73971b17 | 380 | return error; |
efa092f3 | 381 | } |
d63192c8 | 382 | *bpp = bp; |
1da177e4 | 383 | return 0; |
1da177e4 | 384 | } |
9aede1d8 | 385 | |
1da177e4 | 386 | /* |
d63192c8 DW |
387 | * Read in the in-core dquot's on-disk metadata and return the buffer. |
388 | * Returns ENOENT to signal a hole. | |
1da177e4 LT |
389 | */ |
390 | STATIC int | |
d63192c8 DW |
391 | xfs_dquot_disk_read( |
392 | struct xfs_mount *mp, | |
393 | struct xfs_dquot *dqp, | |
394 | struct xfs_buf **bpp) | |
1da177e4 | 395 | { |
113a5683 | 396 | struct xfs_bmbt_irec map; |
113a5683 | 397 | struct xfs_buf *bp; |
1a7ed271 | 398 | xfs_dqtype_t qtype = xfs_dquot_type(dqp); |
0b04dd5d | 399 | struct xfs_inode *quotip = xfs_quota_inode(mp, qtype); |
0891f997 | 400 | uint lock_mode; |
d63192c8 DW |
401 | int nmaps = 1; |
402 | int error; | |
1da177e4 | 403 | |
0891f997 | 404 | lock_mode = xfs_ilock_data_map_shared(quotip); |
0b04dd5d | 405 | if (!xfs_this_quota_on(mp, qtype)) { |
1da177e4 | 406 | /* |
acecf1b5 CH |
407 | * Return if this type of quotas is turned off while we |
408 | * didn't have the quota inode lock. | |
1da177e4 | 409 | */ |
0891f997 | 410 | xfs_iunlock(quotip, lock_mode); |
2451337d | 411 | return -ESRCH; |
acecf1b5 CH |
412 | } |
413 | ||
414 | /* | |
415 | * Find the block map; no allocations yet | |
416 | */ | |
5c8ed202 | 417 | error = xfs_bmapi_read(quotip, dqp->q_fileoffset, |
d63192c8 | 418 | XFS_DQUOT_CLUSTER_SIZE_FSB, &map, &nmaps, 0); |
0891f997 | 419 | xfs_iunlock(quotip, lock_mode); |
acecf1b5 CH |
420 | if (error) |
421 | return error; | |
422 | ||
423 | ASSERT(nmaps == 1); | |
d63192c8 DW |
424 | ASSERT(map.br_blockcount >= 1); |
425 | ASSERT(map.br_startblock != DELAYSTARTBLOCK); | |
426 | if (map.br_startblock == HOLESTARTBLOCK) | |
427 | return -ENOENT; | |
428 | ||
429 | trace_xfs_dqtobp_read(dqp); | |
acecf1b5 CH |
430 | |
431 | /* | |
d63192c8 DW |
432 | * store the blkno etc so that we don't have to do the |
433 | * mapping all the time | |
acecf1b5 | 434 | */ |
d63192c8 | 435 | dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock); |
1da177e4 | 436 | |
d63192c8 DW |
437 | error = xfs_trans_read_buf(mp, NULL, mp->m_ddev_targp, dqp->q_blkno, |
438 | mp->m_quotainfo->qi_dqchunklen, 0, &bp, | |
439 | &xfs_dquot_buf_ops); | |
440 | if (error) { | |
441 | ASSERT(bp == NULL); | |
442 | return error; | |
1da177e4 LT |
443 | } |
444 | ||
c6319198 | 445 | ASSERT(xfs_buf_islocked(bp)); |
d63192c8 DW |
446 | xfs_buf_set_ref(bp, XFS_DQUOT_REF); |
447 | *bpp = bp; | |
1da177e4 | 448 | |
d99831ff | 449 | return 0; |
1da177e4 LT |
450 | } |
451 | ||
617cd5c1 DW |
452 | /* Allocate and initialize everything we need for an incore dquot. */ |
453 | STATIC struct xfs_dquot * | |
454 | xfs_dquot_alloc( | |
97e7ade5 CH |
455 | struct xfs_mount *mp, |
456 | xfs_dqid_t id, | |
1a7ed271 | 457 | xfs_dqtype_t type) |
1da177e4 | 458 | { |
97e7ade5 | 459 | struct xfs_dquot *dqp; |
92b2e5b3 | 460 | |
32a2b11f | 461 | dqp = kmem_cache_zalloc(xfs_qm_dqzone, GFP_KERNEL | __GFP_NOFAIL); |
92b2e5b3 | 462 | |
1a7ed271 | 463 | dqp->q_type = type; |
c51df733 | 464 | dqp->q_id = id; |
92b2e5b3 | 465 | dqp->q_mount = mp; |
f8739c3c | 466 | INIT_LIST_HEAD(&dqp->q_lru); |
92b2e5b3 CH |
467 | mutex_init(&dqp->q_qlock); |
468 | init_waitqueue_head(&dqp->q_pinwait); | |
d63192c8 DW |
469 | dqp->q_fileoffset = (xfs_fileoff_t)id / mp->m_quotainfo->qi_dqperchunk; |
470 | /* | |
471 | * Offset of dquot in the (fixed sized) dquot chunk. | |
472 | */ | |
473 | dqp->q_bufoffset = (id % mp->m_quotainfo->qi_dqperchunk) * | |
474 | sizeof(xfs_dqblk_t); | |
92b2e5b3 CH |
475 | |
476 | /* | |
477 | * Because we want to use a counting completion, complete | |
478 | * the flush completion once to allow a single access to | |
479 | * the flush completion without blocking. | |
480 | */ | |
481 | init_completion(&dqp->q_flush); | |
482 | complete(&dqp->q_flush); | |
483 | ||
484 | /* | |
485 | * Make sure group quotas have a different lock class than user | |
486 | * quotas. | |
487 | */ | |
f112a049 | 488 | switch (type) { |
8cd4901d | 489 | case XFS_DQTYPE_USER: |
f112a049 DC |
490 | /* uses the default lock class */ |
491 | break; | |
8cd4901d | 492 | case XFS_DQTYPE_GROUP: |
f112a049 DC |
493 | lockdep_set_class(&dqp->q_qlock, &xfs_dquot_group_class); |
494 | break; | |
8cd4901d | 495 | case XFS_DQTYPE_PROJ: |
f112a049 DC |
496 | lockdep_set_class(&dqp->q_qlock, &xfs_dquot_project_class); |
497 | break; | |
498 | default: | |
499 | ASSERT(0); | |
500 | break; | |
501 | } | |
92b2e5b3 | 502 | |
617cd5c1 DW |
503 | xfs_qm_dquot_logitem_init(dqp); |
504 | ||
ff6d6af2 | 505 | XFS_STATS_INC(mp, xs_qm_dquot); |
617cd5c1 DW |
506 | return dqp; |
507 | } | |
508 | ||
45068063 DW |
509 | /* Check the ondisk dquot's id and type match what the incore dquot expects. */ |
510 | static bool | |
511 | xfs_dquot_check_type( | |
512 | struct xfs_dquot *dqp, | |
513 | struct xfs_disk_dquot *ddqp) | |
514 | { | |
515 | uint8_t ddqp_type; | |
516 | uint8_t dqp_type; | |
517 | ||
518 | ddqp_type = ddqp->d_type & XFS_DQTYPE_REC_MASK; | |
519 | dqp_type = xfs_dquot_type(dqp); | |
520 | ||
521 | if (be32_to_cpu(ddqp->d_id) != dqp->q_id) | |
522 | return false; | |
523 | ||
524 | /* | |
525 | * V5 filesystems always expect an exact type match. V4 filesystems | |
526 | * expect an exact match for user dquots and for non-root group and | |
527 | * project dquots. | |
528 | */ | |
38c26bfd | 529 | if (xfs_has_crc(dqp->q_mount) || |
45068063 DW |
530 | dqp_type == XFS_DQTYPE_USER || dqp->q_id != 0) |
531 | return ddqp_type == dqp_type; | |
532 | ||
533 | /* | |
534 | * V4 filesystems support either group or project quotas, but not both | |
535 | * at the same time. The non-user quota file can be switched between | |
536 | * group and project quota uses depending on the mount options, which | |
537 | * means that we can encounter the other type when we try to load quota | |
538 | * defaults. Quotacheck will soon reset the the entire quota file | |
539 | * (including the root dquot) anyway, but don't log scary corruption | |
540 | * reports to dmesg. | |
541 | */ | |
542 | return ddqp_type == XFS_DQTYPE_GROUP || ddqp_type == XFS_DQTYPE_PROJ; | |
543 | } | |
544 | ||
617cd5c1 | 545 | /* Copy the in-core quota fields in from the on-disk buffer. */ |
afeda600 | 546 | STATIC int |
617cd5c1 DW |
547 | xfs_dquot_from_disk( |
548 | struct xfs_dquot *dqp, | |
d63192c8 | 549 | struct xfs_buf *bp) |
617cd5c1 | 550 | { |
d63192c8 DW |
551 | struct xfs_disk_dquot *ddqp = bp->b_addr + dqp->q_bufoffset; |
552 | ||
afeda600 DW |
553 | /* |
554 | * Ensure that we got the type and ID we were looking for. | |
555 | * Everything else was checked by the dquot buffer verifier. | |
556 | */ | |
45068063 | 557 | if (!xfs_dquot_check_type(dqp, ddqp)) { |
afeda600 DW |
558 | xfs_alert_tag(bp->b_mount, XFS_PTAG_VERIFIER_ERROR, |
559 | "Metadata corruption detected at %pS, quota %u", | |
c51df733 | 560 | __this_address, dqp->q_id); |
afeda600 DW |
561 | xfs_alert(bp->b_mount, "Unmount and run xfs_repair"); |
562 | return -EFSCORRUPTED; | |
563 | } | |
564 | ||
617cd5c1 | 565 | /* copy everything from disk dquot to the incore dquot */ |
d8c1af0d | 566 | dqp->q_type = ddqp->d_type; |
d3537cf9 DW |
567 | dqp->q_blk.hardlimit = be64_to_cpu(ddqp->d_blk_hardlimit); |
568 | dqp->q_blk.softlimit = be64_to_cpu(ddqp->d_blk_softlimit); | |
569 | dqp->q_ino.hardlimit = be64_to_cpu(ddqp->d_ino_hardlimit); | |
570 | dqp->q_ino.softlimit = be64_to_cpu(ddqp->d_ino_softlimit); | |
571 | dqp->q_rtb.hardlimit = be64_to_cpu(ddqp->d_rtb_hardlimit); | |
572 | dqp->q_rtb.softlimit = be64_to_cpu(ddqp->d_rtb_softlimit); | |
617cd5c1 | 573 | |
be37d40c DW |
574 | dqp->q_blk.count = be64_to_cpu(ddqp->d_bcount); |
575 | dqp->q_ino.count = be64_to_cpu(ddqp->d_icount); | |
576 | dqp->q_rtb.count = be64_to_cpu(ddqp->d_rtbcount); | |
577 | ||
c8c45fb2 DW |
578 | dqp->q_blk.warnings = be16_to_cpu(ddqp->d_bwarns); |
579 | dqp->q_ino.warnings = be16_to_cpu(ddqp->d_iwarns); | |
580 | dqp->q_rtb.warnings = be16_to_cpu(ddqp->d_rtbwarns); | |
581 | ||
9f99c8fe DW |
582 | dqp->q_blk.timer = xfs_dquot_from_disk_ts(ddqp, ddqp->d_btimer); |
583 | dqp->q_ino.timer = xfs_dquot_from_disk_ts(ddqp, ddqp->d_itimer); | |
584 | dqp->q_rtb.timer = xfs_dquot_from_disk_ts(ddqp, ddqp->d_rtbtimer); | |
19dce7ea | 585 | |
617cd5c1 DW |
586 | /* |
587 | * Reservation counters are defined as reservation plus current usage | |
588 | * to avoid having to add every time. | |
589 | */ | |
be37d40c DW |
590 | dqp->q_blk.reserved = dqp->q_blk.count; |
591 | dqp->q_ino.reserved = dqp->q_ino.count; | |
592 | dqp->q_rtb.reserved = dqp->q_rtb.count; | |
617cd5c1 DW |
593 | |
594 | /* initialize the dquot speculative prealloc thresholds */ | |
595 | xfs_dquot_set_prealloc_limits(dqp); | |
afeda600 | 596 | return 0; |
617cd5c1 | 597 | } |
1da177e4 | 598 | |
0b0fa1d1 DW |
599 | /* Copy the in-core quota fields into the on-disk buffer. */ |
600 | void | |
601 | xfs_dquot_to_disk( | |
602 | struct xfs_disk_dquot *ddqp, | |
603 | struct xfs_dquot *dqp) | |
604 | { | |
51dbb1be DW |
605 | ddqp->d_magic = cpu_to_be16(XFS_DQUOT_MAGIC); |
606 | ddqp->d_version = XFS_DQUOT_VERSION; | |
d8c1af0d | 607 | ddqp->d_type = dqp->q_type; |
51dbb1be DW |
608 | ddqp->d_id = cpu_to_be32(dqp->q_id); |
609 | ddqp->d_pad0 = 0; | |
610 | ddqp->d_pad = 0; | |
611 | ||
d3537cf9 DW |
612 | ddqp->d_blk_hardlimit = cpu_to_be64(dqp->q_blk.hardlimit); |
613 | ddqp->d_blk_softlimit = cpu_to_be64(dqp->q_blk.softlimit); | |
614 | ddqp->d_ino_hardlimit = cpu_to_be64(dqp->q_ino.hardlimit); | |
615 | ddqp->d_ino_softlimit = cpu_to_be64(dqp->q_ino.softlimit); | |
616 | ddqp->d_rtb_hardlimit = cpu_to_be64(dqp->q_rtb.hardlimit); | |
617 | ddqp->d_rtb_softlimit = cpu_to_be64(dqp->q_rtb.softlimit); | |
be37d40c DW |
618 | |
619 | ddqp->d_bcount = cpu_to_be64(dqp->q_blk.count); | |
620 | ddqp->d_icount = cpu_to_be64(dqp->q_ino.count); | |
621 | ddqp->d_rtbcount = cpu_to_be64(dqp->q_rtb.count); | |
c8c45fb2 DW |
622 | |
623 | ddqp->d_bwarns = cpu_to_be16(dqp->q_blk.warnings); | |
624 | ddqp->d_iwarns = cpu_to_be16(dqp->q_ino.warnings); | |
625 | ddqp->d_rtbwarns = cpu_to_be16(dqp->q_rtb.warnings); | |
19dce7ea | 626 | |
9f99c8fe DW |
627 | ddqp->d_btimer = xfs_dquot_to_disk_ts(dqp, dqp->q_blk.timer); |
628 | ddqp->d_itimer = xfs_dquot_to_disk_ts(dqp, dqp->q_ino.timer); | |
629 | ddqp->d_rtbtimer = xfs_dquot_to_disk_ts(dqp, dqp->q_rtb.timer); | |
0b0fa1d1 DW |
630 | } |
631 | ||
d63192c8 DW |
632 | /* Allocate and initialize the dquot buffer for this in-core dquot. */ |
633 | static int | |
634 | xfs_qm_dqread_alloc( | |
635 | struct xfs_mount *mp, | |
636 | struct xfs_dquot *dqp, | |
637 | struct xfs_buf **bpp) | |
638 | { | |
639 | struct xfs_trans *tp; | |
d63192c8 DW |
640 | int error; |
641 | ||
642 | error = xfs_trans_alloc(mp, &M_RES(mp)->tr_qm_dqalloc, | |
643 | XFS_QM_DQALLOC_SPACE_RES(mp), 0, 0, &tp); | |
644 | if (error) | |
645 | goto err; | |
646 | ||
710d707d | 647 | error = xfs_dquot_disk_alloc(&tp, dqp, bpp); |
d63192c8 DW |
648 | if (error) |
649 | goto err_cancel; | |
650 | ||
651 | error = xfs_trans_commit(tp); | |
652 | if (error) { | |
653 | /* | |
654 | * Buffer was held to the transaction, so we have to unlock it | |
655 | * manually here because we're not passing it back. | |
656 | */ | |
710d707d DW |
657 | xfs_buf_relse(*bpp); |
658 | *bpp = NULL; | |
d63192c8 DW |
659 | goto err; |
660 | } | |
d63192c8 DW |
661 | return 0; |
662 | ||
663 | err_cancel: | |
664 | xfs_trans_cancel(tp); | |
665 | err: | |
666 | return error; | |
667 | } | |
668 | ||
617cd5c1 DW |
669 | /* |
670 | * Read in the ondisk dquot using dqtobp() then copy it to an incore version, | |
30ab2dcf DW |
671 | * and release the buffer immediately. If @can_alloc is true, fill any |
672 | * holes in the on-disk metadata. | |
617cd5c1 | 673 | */ |
114e73cc | 674 | static int |
617cd5c1 DW |
675 | xfs_qm_dqread( |
676 | struct xfs_mount *mp, | |
677 | xfs_dqid_t id, | |
1a7ed271 | 678 | xfs_dqtype_t type, |
30ab2dcf | 679 | bool can_alloc, |
d63192c8 | 680 | struct xfs_dquot **dqpp) |
617cd5c1 DW |
681 | { |
682 | struct xfs_dquot *dqp; | |
617cd5c1 | 683 | struct xfs_buf *bp; |
617cd5c1 DW |
684 | int error; |
685 | ||
686 | dqp = xfs_dquot_alloc(mp, id, type); | |
0b1b213f CH |
687 | trace_xfs_dqread(dqp); |
688 | ||
d63192c8 DW |
689 | /* Try to read the buffer, allocating if necessary. */ |
690 | error = xfs_dquot_disk_read(mp, dqp, &bp); | |
30ab2dcf | 691 | if (error == -ENOENT && can_alloc) |
d63192c8 DW |
692 | error = xfs_qm_dqread_alloc(mp, dqp, &bp); |
693 | if (error) | |
694 | goto err; | |
1da177e4 LT |
695 | |
696 | /* | |
d63192c8 DW |
697 | * At this point we should have a clean locked buffer. Copy the data |
698 | * to the incore dquot and release the buffer since the incore dquot | |
699 | * has its own locking protocol so we needn't tie up the buffer any | |
700 | * further. | |
1da177e4 | 701 | */ |
0c842ad4 | 702 | ASSERT(xfs_buf_islocked(bp)); |
afeda600 | 703 | error = xfs_dquot_from_disk(dqp, bp); |
d63192c8 | 704 | xfs_buf_relse(bp); |
afeda600 DW |
705 | if (error) |
706 | goto err; | |
707 | ||
d63192c8 | 708 | *dqpp = dqp; |
97e7ade5 | 709 | return error; |
1da177e4 | 710 | |
d63192c8 DW |
711 | err: |
712 | trace_xfs_dqread_fail(dqp); | |
1da177e4 | 713 | xfs_qm_dqdestroy(dqp); |
d63192c8 | 714 | *dqpp = NULL; |
97e7ade5 | 715 | return error; |
1da177e4 LT |
716 | } |
717 | ||
296c24e2 ES |
718 | /* |
719 | * Advance to the next id in the current chunk, or if at the | |
720 | * end of the chunk, skip ahead to first id in next allocated chunk | |
721 | * using the SEEK_DATA interface. | |
722 | */ | |
6e3e6d55 | 723 | static int |
296c24e2 | 724 | xfs_dq_get_next_id( |
bda250db | 725 | struct xfs_mount *mp, |
1a7ed271 | 726 | xfs_dqtype_t type, |
bda250db | 727 | xfs_dqid_t *id) |
296c24e2 | 728 | { |
bda250db CH |
729 | struct xfs_inode *quotip = xfs_quota_inode(mp, type); |
730 | xfs_dqid_t next_id = *id + 1; /* simple advance */ | |
731 | uint lock_flags; | |
732 | struct xfs_bmbt_irec got; | |
b2b1712a | 733 | struct xfs_iext_cursor cur; |
296c24e2 | 734 | xfs_fsblock_t start; |
296c24e2 ES |
735 | int error = 0; |
736 | ||
657bdfb7 ES |
737 | /* If we'd wrap past the max ID, stop */ |
738 | if (next_id < *id) | |
739 | return -ENOENT; | |
740 | ||
296c24e2 ES |
741 | /* If new ID is within the current chunk, advancing it sufficed */ |
742 | if (next_id % mp->m_quotainfo->qi_dqperchunk) { | |
743 | *id = next_id; | |
744 | return 0; | |
745 | } | |
746 | ||
747 | /* Nope, next_id is now past the current chunk, so find the next one */ | |
748 | start = (xfs_fsblock_t)next_id / mp->m_quotainfo->qi_dqperchunk; | |
749 | ||
bda250db | 750 | lock_flags = xfs_ilock_data_map_shared(quotip); |
862a804a CH |
751 | error = xfs_iread_extents(NULL, quotip, XFS_DATA_FORK); |
752 | if (error) | |
753 | return error; | |
296c24e2 | 754 | |
b2b1712a | 755 | if (xfs_iext_lookup_extent(quotip, "ip->i_df, start, &cur, &got)) { |
2192b0ba BF |
756 | /* contiguous chunk, bump startoff for the id calculation */ |
757 | if (got.br_startoff < start) | |
758 | got.br_startoff = start; | |
bda250db | 759 | *id = got.br_startoff * mp->m_quotainfo->qi_dqperchunk; |
2192b0ba | 760 | } else { |
bda250db | 761 | error = -ENOENT; |
2192b0ba BF |
762 | } |
763 | ||
bda250db | 764 | xfs_iunlock(quotip, lock_flags); |
296c24e2 | 765 | |
bda250db | 766 | return error; |
296c24e2 ES |
767 | } |
768 | ||
cc2047c4 DW |
769 | /* |
770 | * Look up the dquot in the in-core cache. If found, the dquot is returned | |
771 | * locked and ready to go. | |
772 | */ | |
773 | static struct xfs_dquot * | |
774 | xfs_qm_dqget_cache_lookup( | |
775 | struct xfs_mount *mp, | |
776 | struct xfs_quotainfo *qi, | |
777 | struct radix_tree_root *tree, | |
778 | xfs_dqid_t id) | |
779 | { | |
780 | struct xfs_dquot *dqp; | |
781 | ||
782 | restart: | |
783 | mutex_lock(&qi->qi_tree_lock); | |
784 | dqp = radix_tree_lookup(tree, id); | |
785 | if (!dqp) { | |
786 | mutex_unlock(&qi->qi_tree_lock); | |
787 | XFS_STATS_INC(mp, xs_qm_dqcachemisses); | |
788 | return NULL; | |
789 | } | |
790 | ||
791 | xfs_dqlock(dqp); | |
985a78fd | 792 | if (dqp->q_flags & XFS_DQFLAG_FREEING) { |
cc2047c4 DW |
793 | xfs_dqunlock(dqp); |
794 | mutex_unlock(&qi->qi_tree_lock); | |
795 | trace_xfs_dqget_freeing(dqp); | |
796 | delay(1); | |
797 | goto restart; | |
798 | } | |
799 | ||
800 | dqp->q_nrefs++; | |
801 | mutex_unlock(&qi->qi_tree_lock); | |
802 | ||
803 | trace_xfs_dqget_hit(dqp); | |
804 | XFS_STATS_INC(mp, xs_qm_dqcachehits); | |
805 | return dqp; | |
806 | } | |
807 | ||
808 | /* | |
809 | * Try to insert a new dquot into the in-core cache. If an error occurs the | |
810 | * caller should throw away the dquot and start over. Otherwise, the dquot | |
811 | * is returned locked (and held by the cache) as if there had been a cache | |
812 | * hit. | |
813 | */ | |
814 | static int | |
815 | xfs_qm_dqget_cache_insert( | |
816 | struct xfs_mount *mp, | |
817 | struct xfs_quotainfo *qi, | |
818 | struct radix_tree_root *tree, | |
819 | xfs_dqid_t id, | |
820 | struct xfs_dquot *dqp) | |
821 | { | |
822 | int error; | |
823 | ||
824 | mutex_lock(&qi->qi_tree_lock); | |
825 | error = radix_tree_insert(tree, id, dqp); | |
826 | if (unlikely(error)) { | |
827 | /* Duplicate found! Caller must try again. */ | |
828 | WARN_ON(error != -EEXIST); | |
829 | mutex_unlock(&qi->qi_tree_lock); | |
830 | trace_xfs_dqget_dup(dqp); | |
831 | return error; | |
832 | } | |
833 | ||
834 | /* Return a locked dquot to the caller, with a reference taken. */ | |
835 | xfs_dqlock(dqp); | |
836 | dqp->q_nrefs = 1; | |
837 | ||
838 | qi->qi_dquots++; | |
839 | mutex_unlock(&qi->qi_tree_lock); | |
840 | ||
841 | return 0; | |
842 | } | |
843 | ||
d7103eeb DW |
844 | /* Check our input parameters. */ |
845 | static int | |
846 | xfs_qm_dqget_checks( | |
847 | struct xfs_mount *mp, | |
1a7ed271 | 848 | xfs_dqtype_t type) |
d7103eeb | 849 | { |
d7103eeb | 850 | switch (type) { |
8cd4901d | 851 | case XFS_DQTYPE_USER: |
d7103eeb DW |
852 | if (!XFS_IS_UQUOTA_ON(mp)) |
853 | return -ESRCH; | |
854 | return 0; | |
8cd4901d | 855 | case XFS_DQTYPE_GROUP: |
d7103eeb DW |
856 | if (!XFS_IS_GQUOTA_ON(mp)) |
857 | return -ESRCH; | |
858 | return 0; | |
8cd4901d | 859 | case XFS_DQTYPE_PROJ: |
d7103eeb DW |
860 | if (!XFS_IS_PQUOTA_ON(mp)) |
861 | return -ESRCH; | |
862 | return 0; | |
863 | default: | |
864 | WARN_ON_ONCE(0); | |
865 | return -EINVAL; | |
866 | } | |
867 | } | |
868 | ||
1da177e4 | 869 | /* |
a647d109 KX |
870 | * Given the file system, id, and type (UDQUOT/GDQUOT/PDQUOT), return a |
871 | * locked dquot, doing an allocation (if requested) as needed. | |
1da177e4 LT |
872 | */ |
873 | int | |
874 | xfs_qm_dqget( | |
4882c19d DW |
875 | struct xfs_mount *mp, |
876 | xfs_dqid_t id, | |
1a7ed271 | 877 | xfs_dqtype_t type, |
30ab2dcf | 878 | bool can_alloc, |
4882c19d | 879 | struct xfs_dquot **O_dqpp) |
1da177e4 | 880 | { |
9f920f11 | 881 | struct xfs_quotainfo *qi = mp->m_quotainfo; |
4882c19d | 882 | struct radix_tree_root *tree = xfs_dquot_tree(qi, type); |
9f920f11 CH |
883 | struct xfs_dquot *dqp; |
884 | int error; | |
1da177e4 | 885 | |
d7103eeb DW |
886 | error = xfs_qm_dqget_checks(mp, type); |
887 | if (error) | |
888 | return error; | |
1da177e4 | 889 | |
4882c19d DW |
890 | restart: |
891 | dqp = xfs_qm_dqget_cache_lookup(mp, qi, tree, id); | |
892 | if (dqp) { | |
893 | *O_dqpp = dqp; | |
894 | return 0; | |
895 | } | |
896 | ||
30ab2dcf | 897 | error = xfs_qm_dqread(mp, id, type, can_alloc, &dqp); |
4882c19d DW |
898 | if (error) |
899 | return error; | |
900 | ||
901 | error = xfs_qm_dqget_cache_insert(mp, qi, tree, id, dqp); | |
902 | if (error) { | |
903 | /* | |
904 | * Duplicate found. Just throw away the new dquot and start | |
905 | * over. | |
906 | */ | |
907 | xfs_qm_dqdestroy(dqp); | |
908 | XFS_STATS_INC(mp, xs_qm_dquot_dups); | |
909 | goto restart; | |
910 | } | |
911 | ||
912 | trace_xfs_dqget_miss(dqp); | |
913 | *O_dqpp = dqp; | |
914 | return 0; | |
915 | } | |
916 | ||
114e73cc DW |
917 | /* |
918 | * Given a dquot id and type, read and initialize a dquot from the on-disk | |
919 | * metadata. This function is only for use during quota initialization so | |
920 | * it ignores the dquot cache assuming that the dquot shrinker isn't set up. | |
921 | * The caller is responsible for _qm_dqdestroy'ing the returned dquot. | |
922 | */ | |
923 | int | |
924 | xfs_qm_dqget_uncached( | |
925 | struct xfs_mount *mp, | |
926 | xfs_dqid_t id, | |
1a7ed271 | 927 | xfs_dqtype_t type, |
114e73cc DW |
928 | struct xfs_dquot **dqpp) |
929 | { | |
930 | int error; | |
931 | ||
932 | error = xfs_qm_dqget_checks(mp, type); | |
933 | if (error) | |
934 | return error; | |
935 | ||
936 | return xfs_qm_dqread(mp, id, type, 0, dqpp); | |
937 | } | |
938 | ||
4882c19d DW |
939 | /* Return the quota id for a given inode and type. */ |
940 | xfs_dqid_t | |
941 | xfs_qm_id_for_quotatype( | |
942 | struct xfs_inode *ip, | |
1a7ed271 | 943 | xfs_dqtype_t type) |
4882c19d DW |
944 | { |
945 | switch (type) { | |
8cd4901d | 946 | case XFS_DQTYPE_USER: |
ba8adad5 | 947 | return i_uid_read(VFS_I(ip)); |
8cd4901d | 948 | case XFS_DQTYPE_GROUP: |
ba8adad5 | 949 | return i_gid_read(VFS_I(ip)); |
8cd4901d | 950 | case XFS_DQTYPE_PROJ: |
ceaf603c | 951 | return ip->i_projid; |
1da177e4 | 952 | } |
4882c19d DW |
953 | ASSERT(0); |
954 | return 0; | |
955 | } | |
956 | ||
957 | /* | |
958 | * Return the dquot for a given inode and type. If @can_alloc is true, then | |
959 | * allocate blocks if needed. The inode's ILOCK must be held and it must not | |
960 | * have already had an inode attached. | |
961 | */ | |
962 | int | |
963 | xfs_qm_dqget_inode( | |
964 | struct xfs_inode *ip, | |
1a7ed271 | 965 | xfs_dqtype_t type, |
4882c19d DW |
966 | bool can_alloc, |
967 | struct xfs_dquot **O_dqpp) | |
968 | { | |
969 | struct xfs_mount *mp = ip->i_mount; | |
970 | struct xfs_quotainfo *qi = mp->m_quotainfo; | |
971 | struct radix_tree_root *tree = xfs_dquot_tree(qi, type); | |
972 | struct xfs_dquot *dqp; | |
973 | xfs_dqid_t id; | |
4882c19d DW |
974 | int error; |
975 | ||
976 | error = xfs_qm_dqget_checks(mp, type); | |
977 | if (error) | |
978 | return error; | |
979 | ||
4882c19d DW |
980 | ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL)); |
981 | ASSERT(xfs_inode_dquot(ip, type) == NULL); | |
982 | ||
983 | id = xfs_qm_id_for_quotatype(ip, type); | |
92678554 CH |
984 | |
985 | restart: | |
cc2047c4 | 986 | dqp = xfs_qm_dqget_cache_lookup(mp, qi, tree, id); |
9f920f11 | 987 | if (dqp) { |
9f920f11 CH |
988 | *O_dqpp = dqp; |
989 | return 0; | |
1da177e4 | 990 | } |
1da177e4 LT |
991 | |
992 | /* | |
993 | * Dquot cache miss. We don't want to keep the inode lock across | |
994 | * a (potential) disk read. Also we don't want to deal with the lock | |
995 | * ordering between quotainode and this inode. OTOH, dropping the inode | |
996 | * lock here means dealing with a chown that can happen before | |
997 | * we re-acquire the lock. | |
998 | */ | |
4882c19d | 999 | xfs_iunlock(ip, XFS_ILOCK_EXCL); |
30ab2dcf | 1000 | error = xfs_qm_dqread(mp, id, type, can_alloc, &dqp); |
4882c19d | 1001 | xfs_ilock(ip, XFS_ILOCK_EXCL); |
7ae44407 CH |
1002 | if (error) |
1003 | return error; | |
1da177e4 | 1004 | |
4882c19d DW |
1005 | /* |
1006 | * A dquot could be attached to this inode by now, since we had | |
1007 | * dropped the ilock. | |
1008 | */ | |
1009 | if (xfs_this_quota_on(mp, type)) { | |
1010 | struct xfs_dquot *dqp1; | |
1011 | ||
1012 | dqp1 = xfs_inode_dquot(ip, type); | |
1013 | if (dqp1) { | |
36731410 | 1014 | xfs_qm_dqdestroy(dqp); |
4882c19d DW |
1015 | dqp = dqp1; |
1016 | xfs_dqlock(dqp); | |
1017 | goto dqret; | |
1da177e4 | 1018 | } |
4882c19d DW |
1019 | } else { |
1020 | /* inode stays locked on return */ | |
1021 | xfs_qm_dqdestroy(dqp); | |
1022 | return -ESRCH; | |
1da177e4 LT |
1023 | } |
1024 | ||
cc2047c4 DW |
1025 | error = xfs_qm_dqget_cache_insert(mp, qi, tree, id, dqp); |
1026 | if (error) { | |
1da177e4 | 1027 | /* |
9f920f11 CH |
1028 | * Duplicate found. Just throw away the new dquot and start |
1029 | * over. | |
1da177e4 | 1030 | */ |
9f920f11 | 1031 | xfs_qm_dqdestroy(dqp); |
ff6d6af2 | 1032 | XFS_STATS_INC(mp, xs_qm_dquot_dups); |
9f920f11 | 1033 | goto restart; |
1da177e4 LT |
1034 | } |
1035 | ||
4882c19d DW |
1036 | dqret: |
1037 | ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL)); | |
0b1b213f | 1038 | trace_xfs_dqget_miss(dqp); |
1da177e4 | 1039 | *O_dqpp = dqp; |
d99831ff | 1040 | return 0; |
1da177e4 LT |
1041 | } |
1042 | ||
2e330e76 DW |
1043 | /* |
1044 | * Starting at @id and progressing upwards, look for an initialized incore | |
1045 | * dquot, lock it, and return it. | |
1046 | */ | |
1047 | int | |
1048 | xfs_qm_dqget_next( | |
1049 | struct xfs_mount *mp, | |
1050 | xfs_dqid_t id, | |
1a7ed271 | 1051 | xfs_dqtype_t type, |
2e330e76 DW |
1052 | struct xfs_dquot **dqpp) |
1053 | { | |
1054 | struct xfs_dquot *dqp; | |
1055 | int error = 0; | |
1056 | ||
1057 | *dqpp = NULL; | |
1058 | for (; !error; error = xfs_dq_get_next_id(mp, type, &id)) { | |
30ab2dcf | 1059 | error = xfs_qm_dqget(mp, id, type, false, &dqp); |
2e330e76 DW |
1060 | if (error == -ENOENT) |
1061 | continue; | |
1062 | else if (error != 0) | |
1063 | break; | |
1064 | ||
1065 | if (!XFS_IS_DQUOT_UNINITIALIZED(dqp)) { | |
1066 | *dqpp = dqp; | |
1067 | return 0; | |
1068 | } | |
1069 | ||
1070 | xfs_qm_dqput(dqp); | |
1071 | } | |
1072 | ||
1073 | return error; | |
1074 | } | |
1075 | ||
f8739c3c CH |
1076 | /* |
1077 | * Release a reference to the dquot (decrement ref-count) and unlock it. | |
1078 | * | |
1079 | * If there is a group quota attached to this dquot, carefully release that | |
1080 | * too without tripping over deadlocks'n'stuff. | |
1081 | */ | |
1082 | void | |
1083 | xfs_qm_dqput( | |
1084 | struct xfs_dquot *dqp) | |
1085 | { | |
1086 | ASSERT(dqp->q_nrefs > 0); | |
1087 | ASSERT(XFS_DQ_IS_LOCKED(dqp)); | |
1088 | ||
1089 | trace_xfs_dqput(dqp); | |
1090 | ||
3c353375 DC |
1091 | if (--dqp->q_nrefs == 0) { |
1092 | struct xfs_quotainfo *qi = dqp->q_mount->m_quotainfo; | |
1093 | trace_xfs_dqput_free(dqp); | |
1094 | ||
1095 | if (list_lru_add(&qi->qi_lru, &dqp->q_lru)) | |
ff6d6af2 | 1096 | XFS_STATS_INC(dqp->q_mount, xs_qm_dquot_unused); |
3c353375 DC |
1097 | } |
1098 | xfs_dqunlock(dqp); | |
1da177e4 LT |
1099 | } |
1100 | ||
1101 | /* | |
1102 | * Release a dquot. Flush it if dirty, then dqput() it. | |
1103 | * dquot must not be locked. | |
1104 | */ | |
1105 | void | |
1106 | xfs_qm_dqrele( | |
aefe69a4 | 1107 | struct xfs_dquot *dqp) |
1da177e4 | 1108 | { |
7d095257 CH |
1109 | if (!dqp) |
1110 | return; | |
1111 | ||
0b1b213f | 1112 | trace_xfs_dqrele(dqp); |
1da177e4 LT |
1113 | |
1114 | xfs_dqlock(dqp); | |
1115 | /* | |
1116 | * We don't care to flush it if the dquot is dirty here. | |
1117 | * That will create stutters that we want to avoid. | |
1118 | * Instead we do a delayed write when we try to reclaim | |
1119 | * a dirty dquot. Also xfs_sync will take part of the burden... | |
1120 | */ | |
1121 | xfs_qm_dqput(dqp); | |
1122 | } | |
1123 | ||
ca30b2a7 CH |
1124 | /* |
1125 | * This is the dquot flushing I/O completion routine. It is called | |
1126 | * from interrupt level when the buffer containing the dquot is | |
1127 | * flushed to disk. It is responsible for removing the dquot logitem | |
1128 | * from the AIL if it has not been re-logged, and unlocking the dquot's | |
1129 | * flush lock. This behavior is very similar to that of inodes.. | |
1130 | */ | |
6f5de180 | 1131 | static void |
ca30b2a7 | 1132 | xfs_qm_dqflush_done( |
ca30b2a7 CH |
1133 | struct xfs_log_item *lip) |
1134 | { | |
fd8b81db | 1135 | struct xfs_dq_logitem *qip = (struct xfs_dq_logitem *)lip; |
aefe69a4 | 1136 | struct xfs_dquot *dqp = qip->qli_dquot; |
ca30b2a7 | 1137 | struct xfs_ail *ailp = lip->li_ailp; |
849274c1 | 1138 | xfs_lsn_t tail_lsn; |
ca30b2a7 CH |
1139 | |
1140 | /* | |
1141 | * We only want to pull the item from the AIL if its | |
1142 | * location in the log has not changed since we started the flush. | |
1143 | * Thus, we only bother if the dquot's lsn has | |
1144 | * not changed. First we check the lsn outside the lock | |
1145 | * since it's cheaper, and then we recheck while | |
1146 | * holding the lock before removing the dquot from the AIL. | |
1147 | */ | |
22525c17 | 1148 | if (test_bit(XFS_LI_IN_AIL, &lip->li_flags) && |
373b0589 | 1149 | ((lip->li_lsn == qip->qli_flush_lsn) || |
22525c17 | 1150 | test_bit(XFS_LI_FAILED, &lip->li_flags))) { |
ca30b2a7 | 1151 | |
57e80956 | 1152 | spin_lock(&ailp->ail_lock); |
e98084b8 | 1153 | xfs_clear_li_failed(lip); |
373b0589 | 1154 | if (lip->li_lsn == qip->qli_flush_lsn) { |
849274c1 BF |
1155 | /* xfs_ail_update_finish() drops the AIL lock */ |
1156 | tail_lsn = xfs_ail_delete_one(ailp, lip); | |
1157 | xfs_ail_update_finish(ailp, tail_lsn); | |
373b0589 | 1158 | } else { |
57e80956 | 1159 | spin_unlock(&ailp->ail_lock); |
373b0589 | 1160 | } |
ca30b2a7 CH |
1161 | } |
1162 | ||
1163 | /* | |
1164 | * Release the dq's flush lock since we're done with it. | |
1165 | */ | |
1166 | xfs_dqfunlock(dqp); | |
1167 | } | |
1da177e4 | 1168 | |
6f5de180 | 1169 | void |
664ffb8a | 1170 | xfs_buf_dquot_iodone( |
6f5de180 DC |
1171 | struct xfs_buf *bp) |
1172 | { | |
1173 | struct xfs_log_item *lip, *n; | |
1174 | ||
1175 | list_for_each_entry_safe(lip, n, &bp->b_li_list, li_bio_list) { | |
1176 | list_del_init(&lip->li_bio_list); | |
1177 | xfs_qm_dqflush_done(lip); | |
1178 | } | |
1179 | } | |
1180 | ||
664ffb8a CH |
1181 | void |
1182 | xfs_buf_dquot_io_fail( | |
1183 | struct xfs_buf *bp) | |
1184 | { | |
1185 | struct xfs_log_item *lip; | |
1186 | ||
1187 | spin_lock(&bp->b_mount->m_ail->ail_lock); | |
1188 | list_for_each_entry(lip, &bp->b_li_list, li_bio_list) | |
1189 | xfs_set_li_failed(lip, bp); | |
1190 | spin_unlock(&bp->b_mount->m_ail->ail_lock); | |
1191 | } | |
1192 | ||
0b0fa1d1 DW |
1193 | /* Check incore dquot for errors before we flush. */ |
1194 | static xfs_failaddr_t | |
1195 | xfs_qm_dqflush_check( | |
1196 | struct xfs_dquot *dqp) | |
1197 | { | |
1a7ed271 | 1198 | xfs_dqtype_t type = xfs_dquot_type(dqp); |
0b0fa1d1 | 1199 | |
8cd4901d DW |
1200 | if (type != XFS_DQTYPE_USER && |
1201 | type != XFS_DQTYPE_GROUP && | |
1202 | type != XFS_DQTYPE_PROJ) | |
0b0fa1d1 DW |
1203 | return __this_address; |
1204 | ||
d3537cf9 DW |
1205 | if (dqp->q_id == 0) |
1206 | return NULL; | |
1207 | ||
be37d40c | 1208 | if (dqp->q_blk.softlimit && dqp->q_blk.count > dqp->q_blk.softlimit && |
19dce7ea | 1209 | !dqp->q_blk.timer) |
d3537cf9 DW |
1210 | return __this_address; |
1211 | ||
be37d40c | 1212 | if (dqp->q_ino.softlimit && dqp->q_ino.count > dqp->q_ino.softlimit && |
19dce7ea | 1213 | !dqp->q_ino.timer) |
d3537cf9 DW |
1214 | return __this_address; |
1215 | ||
be37d40c | 1216 | if (dqp->q_rtb.softlimit && dqp->q_rtb.count > dqp->q_rtb.softlimit && |
19dce7ea | 1217 | !dqp->q_rtb.timer) |
d3537cf9 DW |
1218 | return __this_address; |
1219 | ||
4ea1ff3b DW |
1220 | /* bigtime flag should never be set on root dquots */ |
1221 | if (dqp->q_type & XFS_DQTYPE_BIGTIME) { | |
38c26bfd | 1222 | if (!xfs_has_bigtime(dqp->q_mount)) |
4ea1ff3b DW |
1223 | return __this_address; |
1224 | if (dqp->q_id == 0) | |
1225 | return __this_address; | |
1226 | } | |
1227 | ||
0b0fa1d1 DW |
1228 | return NULL; |
1229 | } | |
1230 | ||
1da177e4 LT |
1231 | /* |
1232 | * Write a modified dquot to disk. | |
1233 | * The dquot must be locked and the flush lock too taken by caller. | |
1234 | * The flush lock will not be unlocked until the dquot reaches the disk, | |
1235 | * but the dquot is free to be unlocked and modified by the caller | |
1236 | * in the interim. Dquot is still locked on return. This behavior is | |
1237 | * identical to that of inodes. | |
1238 | */ | |
1239 | int | |
1240 | xfs_qm_dqflush( | |
fe7257fd CH |
1241 | struct xfs_dquot *dqp, |
1242 | struct xfs_buf **bpp) | |
1da177e4 | 1243 | { |
acecf1b5 | 1244 | struct xfs_mount *mp = dqp->q_mount; |
b707fffd | 1245 | struct xfs_log_item *lip = &dqp->q_logitem.qli_item; |
acecf1b5 | 1246 | struct xfs_buf *bp; |
51dbb1be | 1247 | struct xfs_dqblk *dqblk; |
eebf3cab | 1248 | xfs_failaddr_t fa; |
1da177e4 | 1249 | int error; |
1da177e4 LT |
1250 | |
1251 | ASSERT(XFS_DQ_IS_LOCKED(dqp)); | |
e1f49cf2 | 1252 | ASSERT(!completion_done(&dqp->q_flush)); |
acecf1b5 | 1253 | |
0b1b213f | 1254 | trace_xfs_dqflush(dqp); |
1da177e4 | 1255 | |
fe7257fd CH |
1256 | *bpp = NULL; |
1257 | ||
1da177e4 LT |
1258 | xfs_qm_dqunpin_wait(dqp); |
1259 | ||
1da177e4 LT |
1260 | /* |
1261 | * Get the buffer containing the on-disk dquot | |
1da177e4 | 1262 | */ |
acecf1b5 | 1263 | error = xfs_trans_read_buf(mp, NULL, mp->m_ddev_targp, dqp->q_blkno, |
8d3d7e2b BF |
1264 | mp->m_quotainfo->qi_dqchunklen, XBF_TRYLOCK, |
1265 | &bp, &xfs_dquot_buf_ops); | |
b707fffd | 1266 | if (error == -EAGAIN) |
fe7257fd | 1267 | goto out_unlock; |
b707fffd BF |
1268 | if (error) |
1269 | goto out_abort; | |
1da177e4 | 1270 | |
0b0fa1d1 DW |
1271 | fa = xfs_qm_dqflush_check(dqp); |
1272 | if (fa) { | |
1273 | xfs_alert(mp, "corrupt dquot ID 0x%x in memory at %pS", | |
c51df733 | 1274 | dqp->q_id, fa); |
0b0fa1d1 DW |
1275 | xfs_buf_relse(bp); |
1276 | error = -EFSCORRUPTED; | |
1277 | goto out_abort; | |
1278 | } | |
1279 | ||
51dbb1be DW |
1280 | /* Flush the incore dquot to the ondisk buffer. */ |
1281 | dqblk = bp->b_addr + dqp->q_bufoffset; | |
1282 | xfs_dquot_to_disk(&dqblk->dd_diskdq, dqp); | |
1da177e4 LT |
1283 | |
1284 | /* | |
1285 | * Clear the dirty field and remember the flush lsn for later use. | |
1286 | */ | |
985a78fd | 1287 | dqp->q_flags &= ~XFS_DQFLAG_DIRTY; |
1da177e4 | 1288 | |
7b2e2a31 DC |
1289 | xfs_trans_ail_copy_lsn(mp->m_ail, &dqp->q_logitem.qli_flush_lsn, |
1290 | &dqp->q_logitem.qli_item.li_lsn); | |
1da177e4 | 1291 | |
3fe58f30 CH |
1292 | /* |
1293 | * copy the lsn into the on-disk dquot now while we have the in memory | |
1294 | * dquot here. This can't be done later in the write verifier as we | |
1295 | * can't get access to the log item at that point in time. | |
6fcdc59d DC |
1296 | * |
1297 | * We also calculate the CRC here so that the on-disk dquot in the | |
1298 | * buffer always has a valid CRC. This ensures there is no possibility | |
1299 | * of a dquot without an up-to-date CRC getting to disk. | |
3fe58f30 | 1300 | */ |
38c26bfd | 1301 | if (xfs_has_crc(mp)) { |
51dbb1be DW |
1302 | dqblk->dd_lsn = cpu_to_be64(dqp->q_logitem.qli_item.li_lsn); |
1303 | xfs_update_cksum((char *)dqblk, sizeof(struct xfs_dqblk), | |
6fcdc59d | 1304 | XFS_DQUOT_CRC_OFF); |
3fe58f30 CH |
1305 | } |
1306 | ||
1da177e4 | 1307 | /* |
2ef3f7f5 DC |
1308 | * Attach the dquot to the buffer so that we can remove this dquot from |
1309 | * the AIL and release the flush lock once the dquot is synced to disk. | |
1da177e4 | 1310 | */ |
0c7e5afb | 1311 | bp->b_flags |= _XBF_DQUOTS; |
2ef3f7f5 | 1312 | list_add_tail(&dqp->q_logitem.qli_item.li_bio_list, &bp->b_li_list); |
ca30b2a7 | 1313 | |
1da177e4 LT |
1314 | /* |
1315 | * If the buffer is pinned then push on the log so we won't | |
1316 | * get stuck waiting in the write for too long. | |
1317 | */ | |
811e64c7 | 1318 | if (xfs_buf_ispinned(bp)) { |
0b1b213f | 1319 | trace_xfs_dqflush_force(dqp); |
a14a348b | 1320 | xfs_log_force(mp, 0); |
1da177e4 LT |
1321 | } |
1322 | ||
0b1b213f | 1323 | trace_xfs_dqflush_done(dqp); |
fe7257fd CH |
1324 | *bpp = bp; |
1325 | return 0; | |
0b1b213f | 1326 | |
b707fffd | 1327 | out_abort: |
985a78fd | 1328 | dqp->q_flags &= ~XFS_DQFLAG_DIRTY; |
2b3cf093 | 1329 | xfs_trans_ail_delete(lip, 0); |
b707fffd | 1330 | xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE); |
fe7257fd CH |
1331 | out_unlock: |
1332 | xfs_dqfunlock(dqp); | |
8d3d7e2b | 1333 | return error; |
1da177e4 LT |
1334 | } |
1335 | ||
5bb87a33 CH |
1336 | /* |
1337 | * Lock two xfs_dquot structures. | |
1338 | * | |
1339 | * To avoid deadlocks we always lock the quota structure with | |
1340 | * the lowerd id first. | |
1341 | */ | |
1da177e4 LT |
1342 | void |
1343 | xfs_dqlock2( | |
aefe69a4 PR |
1344 | struct xfs_dquot *d1, |
1345 | struct xfs_dquot *d2) | |
1da177e4 LT |
1346 | { |
1347 | if (d1 && d2) { | |
1348 | ASSERT(d1 != d2); | |
c51df733 | 1349 | if (d1->q_id > d2->q_id) { |
5bb87a33 CH |
1350 | mutex_lock(&d2->q_qlock); |
1351 | mutex_lock_nested(&d1->q_qlock, XFS_QLOCK_NESTED); | |
1da177e4 | 1352 | } else { |
5bb87a33 CH |
1353 | mutex_lock(&d1->q_qlock); |
1354 | mutex_lock_nested(&d2->q_qlock, XFS_QLOCK_NESTED); | |
1da177e4 | 1355 | } |
5bb87a33 CH |
1356 | } else if (d1) { |
1357 | mutex_lock(&d1->q_qlock); | |
1358 | } else if (d2) { | |
1359 | mutex_lock(&d2->q_qlock); | |
1da177e4 LT |
1360 | } |
1361 | } | |
1362 | ||
a05931ce CH |
1363 | int __init |
1364 | xfs_qm_init(void) | |
1365 | { | |
b1231760 CM |
1366 | xfs_qm_dqzone = kmem_cache_create("xfs_dquot", |
1367 | sizeof(struct xfs_dquot), | |
1368 | 0, 0, NULL); | |
a05931ce CH |
1369 | if (!xfs_qm_dqzone) |
1370 | goto out; | |
1371 | ||
b1231760 CM |
1372 | xfs_qm_dqtrxzone = kmem_cache_create("xfs_dqtrx", |
1373 | sizeof(struct xfs_dquot_acct), | |
1374 | 0, 0, NULL); | |
a05931ce CH |
1375 | if (!xfs_qm_dqtrxzone) |
1376 | goto out_free_dqzone; | |
1377 | ||
1378 | return 0; | |
1379 | ||
1380 | out_free_dqzone: | |
aaf54eb8 | 1381 | kmem_cache_destroy(xfs_qm_dqzone); |
a05931ce CH |
1382 | out: |
1383 | return -ENOMEM; | |
1384 | } | |
1385 | ||
1c2ccc66 | 1386 | void |
a05931ce CH |
1387 | xfs_qm_exit(void) |
1388 | { | |
aaf54eb8 CM |
1389 | kmem_cache_destroy(xfs_qm_dqtrxzone); |
1390 | kmem_cache_destroy(xfs_qm_dqzone); | |
a05931ce | 1391 | } |
554ba965 DW |
1392 | |
1393 | /* | |
1394 | * Iterate every dquot of a particular type. The caller must ensure that the | |
1395 | * particular quota type is active. iter_fn can return negative error codes, | |
e7ee96df | 1396 | * or -ECANCELED to indicate that it wants to stop iterating. |
554ba965 DW |
1397 | */ |
1398 | int | |
1399 | xfs_qm_dqiterate( | |
1400 | struct xfs_mount *mp, | |
1a7ed271 | 1401 | xfs_dqtype_t type, |
554ba965 DW |
1402 | xfs_qm_dqiterate_fn iter_fn, |
1403 | void *priv) | |
1404 | { | |
1405 | struct xfs_dquot *dq; | |
1406 | xfs_dqid_t id = 0; | |
1407 | int error; | |
1408 | ||
1409 | do { | |
1a7ed271 | 1410 | error = xfs_qm_dqget_next(mp, id, type, &dq); |
554ba965 DW |
1411 | if (error == -ENOENT) |
1412 | return 0; | |
1413 | if (error) | |
1414 | return error; | |
1415 | ||
1a7ed271 | 1416 | error = iter_fn(dq, type, priv); |
c51df733 | 1417 | id = dq->q_id; |
554ba965 | 1418 | xfs_qm_dqput(dq); |
554ba965 DW |
1419 | } while (error == 0 && id != 0); |
1420 | ||
1421 | return error; | |
1422 | } |