Loading...
1/*
2 * Copyright (c) 2000-2003 Silicon Graphics, Inc.
3 * All Rights Reserved.
4 *
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
7 * published by the Free Software Foundation.
8 *
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.
13 *
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
17 */
18#include "xfs.h"
19#include "xfs_fs.h"
20#include "xfs_format.h"
21#include "xfs_log_format.h"
22#include "xfs_shared.h"
23#include "xfs_trans_resv.h"
24#include "xfs_bit.h"
25#include "xfs_mount.h"
26#include "xfs_inode.h"
27#include "xfs_bmap.h"
28#include "xfs_bmap_util.h"
29#include "xfs_alloc.h"
30#include "xfs_quota.h"
31#include "xfs_error.h"
32#include "xfs_trans.h"
33#include "xfs_buf_item.h"
34#include "xfs_trans_space.h"
35#include "xfs_trans_priv.h"
36#include "xfs_qm.h"
37#include "xfs_cksum.h"
38#include "xfs_trace.h"
39#include "xfs_log.h"
40#include "xfs_bmap_btree.h"
41
42/*
43 * Lock order:
44 *
45 * ip->i_lock
46 * qi->qi_tree_lock
47 * dquot->q_qlock (xfs_dqlock() and friends)
48 * dquot->q_flush (xfs_dqflock() and friends)
49 * qi->qi_lru_lock
50 *
51 * If two dquots need to be locked the order is user before group/project,
52 * otherwise by the lowest id first, see xfs_dqlock2.
53 */
54
55#ifdef DEBUG
56xfs_buftarg_t *xfs_dqerror_target;
57int xfs_do_dqerror;
58int xfs_dqreq_num;
59int xfs_dqerror_mod = 33;
60#endif
61
62struct kmem_zone *xfs_qm_dqtrxzone;
63static struct kmem_zone *xfs_qm_dqzone;
64
65static struct lock_class_key xfs_dquot_group_class;
66static struct lock_class_key xfs_dquot_project_class;
67
68/*
69 * This is called to free all the memory associated with a dquot
70 */
71void
72xfs_qm_dqdestroy(
73 xfs_dquot_t *dqp)
74{
75 ASSERT(list_empty(&dqp->q_lru));
76
77 mutex_destroy(&dqp->q_qlock);
78
79 XFS_STATS_DEC(dqp->q_mount, xs_qm_dquot);
80 kmem_zone_free(xfs_qm_dqzone, dqp);
81}
82
83/*
84 * If default limits are in force, push them into the dquot now.
85 * We overwrite the dquot limits only if they are zero and this
86 * is not the root dquot.
87 */
88void
89xfs_qm_adjust_dqlimits(
90 struct xfs_mount *mp,
91 struct xfs_dquot *dq)
92{
93 struct xfs_quotainfo *q = mp->m_quotainfo;
94 struct xfs_disk_dquot *d = &dq->q_core;
95 struct xfs_def_quota *defq;
96 int prealloc = 0;
97
98 ASSERT(d->d_id);
99 defq = xfs_get_defquota(dq, q);
100
101 if (defq->bsoftlimit && !d->d_blk_softlimit) {
102 d->d_blk_softlimit = cpu_to_be64(defq->bsoftlimit);
103 prealloc = 1;
104 }
105 if (defq->bhardlimit && !d->d_blk_hardlimit) {
106 d->d_blk_hardlimit = cpu_to_be64(defq->bhardlimit);
107 prealloc = 1;
108 }
109 if (defq->isoftlimit && !d->d_ino_softlimit)
110 d->d_ino_softlimit = cpu_to_be64(defq->isoftlimit);
111 if (defq->ihardlimit && !d->d_ino_hardlimit)
112 d->d_ino_hardlimit = cpu_to_be64(defq->ihardlimit);
113 if (defq->rtbsoftlimit && !d->d_rtb_softlimit)
114 d->d_rtb_softlimit = cpu_to_be64(defq->rtbsoftlimit);
115 if (defq->rtbhardlimit && !d->d_rtb_hardlimit)
116 d->d_rtb_hardlimit = cpu_to_be64(defq->rtbhardlimit);
117
118 if (prealloc)
119 xfs_dquot_set_prealloc_limits(dq);
120}
121
122/*
123 * Check the limits and timers of a dquot and start or reset timers
124 * if necessary.
125 * This gets called even when quota enforcement is OFF, which makes our
126 * life a little less complicated. (We just don't reject any quota
127 * reservations in that case, when enforcement is off).
128 * We also return 0 as the values of the timers in Q_GETQUOTA calls, when
129 * enforcement's off.
130 * In contrast, warnings are a little different in that they don't
131 * 'automatically' get started when limits get exceeded. They do
132 * get reset to zero, however, when we find the count to be under
133 * the soft limit (they are only ever set non-zero via userspace).
134 */
135void
136xfs_qm_adjust_dqtimers(
137 xfs_mount_t *mp,
138 xfs_disk_dquot_t *d)
139{
140 ASSERT(d->d_id);
141
142#ifdef DEBUG
143 if (d->d_blk_hardlimit)
144 ASSERT(be64_to_cpu(d->d_blk_softlimit) <=
145 be64_to_cpu(d->d_blk_hardlimit));
146 if (d->d_ino_hardlimit)
147 ASSERT(be64_to_cpu(d->d_ino_softlimit) <=
148 be64_to_cpu(d->d_ino_hardlimit));
149 if (d->d_rtb_hardlimit)
150 ASSERT(be64_to_cpu(d->d_rtb_softlimit) <=
151 be64_to_cpu(d->d_rtb_hardlimit));
152#endif
153
154 if (!d->d_btimer) {
155 if ((d->d_blk_softlimit &&
156 (be64_to_cpu(d->d_bcount) >
157 be64_to_cpu(d->d_blk_softlimit))) ||
158 (d->d_blk_hardlimit &&
159 (be64_to_cpu(d->d_bcount) >
160 be64_to_cpu(d->d_blk_hardlimit)))) {
161 d->d_btimer = cpu_to_be32(get_seconds() +
162 mp->m_quotainfo->qi_btimelimit);
163 } else {
164 d->d_bwarns = 0;
165 }
166 } else {
167 if ((!d->d_blk_softlimit ||
168 (be64_to_cpu(d->d_bcount) <=
169 be64_to_cpu(d->d_blk_softlimit))) &&
170 (!d->d_blk_hardlimit ||
171 (be64_to_cpu(d->d_bcount) <=
172 be64_to_cpu(d->d_blk_hardlimit)))) {
173 d->d_btimer = 0;
174 }
175 }
176
177 if (!d->d_itimer) {
178 if ((d->d_ino_softlimit &&
179 (be64_to_cpu(d->d_icount) >
180 be64_to_cpu(d->d_ino_softlimit))) ||
181 (d->d_ino_hardlimit &&
182 (be64_to_cpu(d->d_icount) >
183 be64_to_cpu(d->d_ino_hardlimit)))) {
184 d->d_itimer = cpu_to_be32(get_seconds() +
185 mp->m_quotainfo->qi_itimelimit);
186 } else {
187 d->d_iwarns = 0;
188 }
189 } else {
190 if ((!d->d_ino_softlimit ||
191 (be64_to_cpu(d->d_icount) <=
192 be64_to_cpu(d->d_ino_softlimit))) &&
193 (!d->d_ino_hardlimit ||
194 (be64_to_cpu(d->d_icount) <=
195 be64_to_cpu(d->d_ino_hardlimit)))) {
196 d->d_itimer = 0;
197 }
198 }
199
200 if (!d->d_rtbtimer) {
201 if ((d->d_rtb_softlimit &&
202 (be64_to_cpu(d->d_rtbcount) >
203 be64_to_cpu(d->d_rtb_softlimit))) ||
204 (d->d_rtb_hardlimit &&
205 (be64_to_cpu(d->d_rtbcount) >
206 be64_to_cpu(d->d_rtb_hardlimit)))) {
207 d->d_rtbtimer = cpu_to_be32(get_seconds() +
208 mp->m_quotainfo->qi_rtbtimelimit);
209 } else {
210 d->d_rtbwarns = 0;
211 }
212 } else {
213 if ((!d->d_rtb_softlimit ||
214 (be64_to_cpu(d->d_rtbcount) <=
215 be64_to_cpu(d->d_rtb_softlimit))) &&
216 (!d->d_rtb_hardlimit ||
217 (be64_to_cpu(d->d_rtbcount) <=
218 be64_to_cpu(d->d_rtb_hardlimit)))) {
219 d->d_rtbtimer = 0;
220 }
221 }
222}
223
224/*
225 * initialize a buffer full of dquots and log the whole thing
226 */
227STATIC void
228xfs_qm_init_dquot_blk(
229 xfs_trans_t *tp,
230 xfs_mount_t *mp,
231 xfs_dqid_t id,
232 uint type,
233 xfs_buf_t *bp)
234{
235 struct xfs_quotainfo *q = mp->m_quotainfo;
236 xfs_dqblk_t *d;
237 xfs_dqid_t curid;
238 int i;
239
240 ASSERT(tp);
241 ASSERT(xfs_buf_islocked(bp));
242
243 d = bp->b_addr;
244
245 /*
246 * ID of the first dquot in the block - id's are zero based.
247 */
248 curid = id - (id % q->qi_dqperchunk);
249 memset(d, 0, BBTOB(q->qi_dqchunklen));
250 for (i = 0; i < q->qi_dqperchunk; i++, d++, curid++) {
251 d->dd_diskdq.d_magic = cpu_to_be16(XFS_DQUOT_MAGIC);
252 d->dd_diskdq.d_version = XFS_DQUOT_VERSION;
253 d->dd_diskdq.d_id = cpu_to_be32(curid);
254 d->dd_diskdq.d_flags = type;
255 if (xfs_sb_version_hascrc(&mp->m_sb)) {
256 uuid_copy(&d->dd_uuid, &mp->m_sb.sb_meta_uuid);
257 xfs_update_cksum((char *)d, sizeof(struct xfs_dqblk),
258 XFS_DQUOT_CRC_OFF);
259 }
260 }
261
262 xfs_trans_dquot_buf(tp, bp,
263 (type & XFS_DQ_USER ? XFS_BLF_UDQUOT_BUF :
264 ((type & XFS_DQ_PROJ) ? XFS_BLF_PDQUOT_BUF :
265 XFS_BLF_GDQUOT_BUF)));
266 xfs_trans_log_buf(tp, bp, 0, BBTOB(q->qi_dqchunklen) - 1);
267}
268
269/*
270 * Initialize the dynamic speculative preallocation thresholds. The lo/hi
271 * watermarks correspond to the soft and hard limits by default. If a soft limit
272 * is not specified, we use 95% of the hard limit.
273 */
274void
275xfs_dquot_set_prealloc_limits(struct xfs_dquot *dqp)
276{
277 __uint64_t space;
278
279 dqp->q_prealloc_hi_wmark = be64_to_cpu(dqp->q_core.d_blk_hardlimit);
280 dqp->q_prealloc_lo_wmark = be64_to_cpu(dqp->q_core.d_blk_softlimit);
281 if (!dqp->q_prealloc_lo_wmark) {
282 dqp->q_prealloc_lo_wmark = dqp->q_prealloc_hi_wmark;
283 do_div(dqp->q_prealloc_lo_wmark, 100);
284 dqp->q_prealloc_lo_wmark *= 95;
285 }
286
287 space = dqp->q_prealloc_hi_wmark;
288
289 do_div(space, 100);
290 dqp->q_low_space[XFS_QLOWSP_1_PCNT] = space;
291 dqp->q_low_space[XFS_QLOWSP_3_PCNT] = space * 3;
292 dqp->q_low_space[XFS_QLOWSP_5_PCNT] = space * 5;
293}
294
295/*
296 * Allocate a block and fill it with dquots.
297 * This is called when the bmapi finds a hole.
298 */
299STATIC int
300xfs_qm_dqalloc(
301 xfs_trans_t **tpp,
302 xfs_mount_t *mp,
303 xfs_dquot_t *dqp,
304 xfs_inode_t *quotip,
305 xfs_fileoff_t offset_fsb,
306 xfs_buf_t **O_bpp)
307{
308 xfs_fsblock_t firstblock;
309 xfs_bmap_free_t flist;
310 xfs_bmbt_irec_t map;
311 int nmaps, error;
312 xfs_buf_t *bp;
313 xfs_trans_t *tp = *tpp;
314
315 ASSERT(tp != NULL);
316
317 trace_xfs_dqalloc(dqp);
318
319 /*
320 * Initialize the bmap freelist prior to calling bmapi code.
321 */
322 xfs_bmap_init(&flist, &firstblock);
323 xfs_ilock(quotip, XFS_ILOCK_EXCL);
324 /*
325 * Return if this type of quotas is turned off while we didn't
326 * have an inode lock
327 */
328 if (!xfs_this_quota_on(dqp->q_mount, dqp->dq_flags)) {
329 xfs_iunlock(quotip, XFS_ILOCK_EXCL);
330 return -ESRCH;
331 }
332
333 xfs_trans_ijoin(tp, quotip, XFS_ILOCK_EXCL);
334 nmaps = 1;
335 error = xfs_bmapi_write(tp, quotip, offset_fsb,
336 XFS_DQUOT_CLUSTER_SIZE_FSB, XFS_BMAPI_METADATA,
337 &firstblock, XFS_QM_DQALLOC_SPACE_RES(mp),
338 &map, &nmaps, &flist);
339 if (error)
340 goto error0;
341 ASSERT(map.br_blockcount == XFS_DQUOT_CLUSTER_SIZE_FSB);
342 ASSERT(nmaps == 1);
343 ASSERT((map.br_startblock != DELAYSTARTBLOCK) &&
344 (map.br_startblock != HOLESTARTBLOCK));
345
346 /*
347 * Keep track of the blkno to save a lookup later
348 */
349 dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock);
350
351 /* now we can just get the buffer (there's nothing to read yet) */
352 bp = xfs_trans_get_buf(tp, mp->m_ddev_targp,
353 dqp->q_blkno,
354 mp->m_quotainfo->qi_dqchunklen,
355 0);
356 if (!bp) {
357 error = -ENOMEM;
358 goto error1;
359 }
360 bp->b_ops = &xfs_dquot_buf_ops;
361
362 /*
363 * Make a chunk of dquots out of this buffer and log
364 * the entire thing.
365 */
366 xfs_qm_init_dquot_blk(tp, mp, be32_to_cpu(dqp->q_core.d_id),
367 dqp->dq_flags & XFS_DQ_ALLTYPES, bp);
368
369 /*
370 * xfs_bmap_finish() may commit the current transaction and
371 * start a second transaction if the freelist is not empty.
372 *
373 * Since we still want to modify this buffer, we need to
374 * ensure that the buffer is not released on commit of
375 * the first transaction and ensure the buffer is added to the
376 * second transaction.
377 *
378 * If there is only one transaction then don't stop the buffer
379 * from being released when it commits later on.
380 */
381
382 xfs_trans_bhold(tp, bp);
383
384 error = xfs_bmap_finish(tpp, &flist, NULL);
385 if (error)
386 goto error1;
387
388 /* Transaction was committed? */
389 if (*tpp != tp) {
390 tp = *tpp;
391 xfs_trans_bjoin(tp, bp);
392 } else {
393 xfs_trans_bhold_release(tp, bp);
394 }
395
396 *O_bpp = bp;
397 return 0;
398
399error1:
400 xfs_bmap_cancel(&flist);
401error0:
402 xfs_iunlock(quotip, XFS_ILOCK_EXCL);
403
404 return error;
405}
406
407STATIC int
408xfs_qm_dqrepair(
409 struct xfs_mount *mp,
410 struct xfs_trans *tp,
411 struct xfs_dquot *dqp,
412 xfs_dqid_t firstid,
413 struct xfs_buf **bpp)
414{
415 int error;
416 struct xfs_disk_dquot *ddq;
417 struct xfs_dqblk *d;
418 int i;
419
420 /*
421 * Read the buffer without verification so we get the corrupted
422 * buffer returned to us. make sure we verify it on write, though.
423 */
424 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, dqp->q_blkno,
425 mp->m_quotainfo->qi_dqchunklen,
426 0, bpp, NULL);
427
428 if (error) {
429 ASSERT(*bpp == NULL);
430 return error;
431 }
432 (*bpp)->b_ops = &xfs_dquot_buf_ops;
433
434 ASSERT(xfs_buf_islocked(*bpp));
435 d = (struct xfs_dqblk *)(*bpp)->b_addr;
436
437 /* Do the actual repair of dquots in this buffer */
438 for (i = 0; i < mp->m_quotainfo->qi_dqperchunk; i++) {
439 ddq = &d[i].dd_diskdq;
440 error = xfs_dqcheck(mp, ddq, firstid + i,
441 dqp->dq_flags & XFS_DQ_ALLTYPES,
442 XFS_QMOPT_DQREPAIR, "xfs_qm_dqrepair");
443 if (error) {
444 /* repair failed, we're screwed */
445 xfs_trans_brelse(tp, *bpp);
446 return -EIO;
447 }
448 }
449
450 return 0;
451}
452
453/*
454 * Maps a dquot to the buffer containing its on-disk version.
455 * This returns a ptr to the buffer containing the on-disk dquot
456 * in the bpp param, and a ptr to the on-disk dquot within that buffer
457 */
458STATIC int
459xfs_qm_dqtobp(
460 xfs_trans_t **tpp,
461 xfs_dquot_t *dqp,
462 xfs_disk_dquot_t **O_ddpp,
463 xfs_buf_t **O_bpp,
464 uint flags)
465{
466 struct xfs_bmbt_irec map;
467 int nmaps = 1, error;
468 struct xfs_buf *bp;
469 struct xfs_inode *quotip;
470 struct xfs_mount *mp = dqp->q_mount;
471 xfs_dqid_t id = be32_to_cpu(dqp->q_core.d_id);
472 struct xfs_trans *tp = (tpp ? *tpp : NULL);
473 uint lock_mode;
474
475 quotip = xfs_quota_inode(dqp->q_mount, dqp->dq_flags);
476 dqp->q_fileoffset = (xfs_fileoff_t)id / mp->m_quotainfo->qi_dqperchunk;
477
478 lock_mode = xfs_ilock_data_map_shared(quotip);
479 if (!xfs_this_quota_on(dqp->q_mount, dqp->dq_flags)) {
480 /*
481 * Return if this type of quotas is turned off while we
482 * didn't have the quota inode lock.
483 */
484 xfs_iunlock(quotip, lock_mode);
485 return -ESRCH;
486 }
487
488 /*
489 * Find the block map; no allocations yet
490 */
491 error = xfs_bmapi_read(quotip, dqp->q_fileoffset,
492 XFS_DQUOT_CLUSTER_SIZE_FSB, &map, &nmaps, 0);
493
494 xfs_iunlock(quotip, lock_mode);
495 if (error)
496 return error;
497
498 ASSERT(nmaps == 1);
499 ASSERT(map.br_blockcount == 1);
500
501 /*
502 * Offset of dquot in the (fixed sized) dquot chunk.
503 */
504 dqp->q_bufoffset = (id % mp->m_quotainfo->qi_dqperchunk) *
505 sizeof(xfs_dqblk_t);
506
507 ASSERT(map.br_startblock != DELAYSTARTBLOCK);
508 if (map.br_startblock == HOLESTARTBLOCK) {
509 /*
510 * We don't allocate unless we're asked to
511 */
512 if (!(flags & XFS_QMOPT_DQALLOC))
513 return -ENOENT;
514
515 ASSERT(tp);
516 error = xfs_qm_dqalloc(tpp, mp, dqp, quotip,
517 dqp->q_fileoffset, &bp);
518 if (error)
519 return error;
520 tp = *tpp;
521 } else {
522 trace_xfs_dqtobp_read(dqp);
523
524 /*
525 * store the blkno etc so that we don't have to do the
526 * mapping all the time
527 */
528 dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock);
529
530 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp,
531 dqp->q_blkno,
532 mp->m_quotainfo->qi_dqchunklen,
533 0, &bp, &xfs_dquot_buf_ops);
534
535 if (error == -EFSCORRUPTED && (flags & XFS_QMOPT_DQREPAIR)) {
536 xfs_dqid_t firstid = (xfs_dqid_t)map.br_startoff *
537 mp->m_quotainfo->qi_dqperchunk;
538 ASSERT(bp == NULL);
539 error = xfs_qm_dqrepair(mp, tp, dqp, firstid, &bp);
540 }
541
542 if (error) {
543 ASSERT(bp == NULL);
544 return error;
545 }
546 }
547
548 ASSERT(xfs_buf_islocked(bp));
549 *O_bpp = bp;
550 *O_ddpp = bp->b_addr + dqp->q_bufoffset;
551
552 return 0;
553}
554
555
556/*
557 * Read in the ondisk dquot using dqtobp() then copy it to an incore version,
558 * and release the buffer immediately.
559 *
560 * If XFS_QMOPT_DQALLOC is set, allocate a dquot on disk if it needed.
561 */
562int
563xfs_qm_dqread(
564 struct xfs_mount *mp,
565 xfs_dqid_t id,
566 uint type,
567 uint flags,
568 struct xfs_dquot **O_dqpp)
569{
570 struct xfs_dquot *dqp;
571 struct xfs_disk_dquot *ddqp;
572 struct xfs_buf *bp;
573 struct xfs_trans *tp = NULL;
574 int error;
575
576 dqp = kmem_zone_zalloc(xfs_qm_dqzone, KM_SLEEP);
577
578 dqp->dq_flags = type;
579 dqp->q_core.d_id = cpu_to_be32(id);
580 dqp->q_mount = mp;
581 INIT_LIST_HEAD(&dqp->q_lru);
582 mutex_init(&dqp->q_qlock);
583 init_waitqueue_head(&dqp->q_pinwait);
584
585 /*
586 * Because we want to use a counting completion, complete
587 * the flush completion once to allow a single access to
588 * the flush completion without blocking.
589 */
590 init_completion(&dqp->q_flush);
591 complete(&dqp->q_flush);
592
593 /*
594 * Make sure group quotas have a different lock class than user
595 * quotas.
596 */
597 switch (type) {
598 case XFS_DQ_USER:
599 /* uses the default lock class */
600 break;
601 case XFS_DQ_GROUP:
602 lockdep_set_class(&dqp->q_qlock, &xfs_dquot_group_class);
603 break;
604 case XFS_DQ_PROJ:
605 lockdep_set_class(&dqp->q_qlock, &xfs_dquot_project_class);
606 break;
607 default:
608 ASSERT(0);
609 break;
610 }
611
612 XFS_STATS_INC(mp, xs_qm_dquot);
613
614 trace_xfs_dqread(dqp);
615
616 if (flags & XFS_QMOPT_DQALLOC) {
617 tp = xfs_trans_alloc(mp, XFS_TRANS_QM_DQALLOC);
618 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_qm_dqalloc,
619 XFS_QM_DQALLOC_SPACE_RES(mp), 0);
620 if (error)
621 goto error1;
622 }
623
624 /*
625 * get a pointer to the on-disk dquot and the buffer containing it
626 * dqp already knows its own type (GROUP/USER).
627 */
628 error = xfs_qm_dqtobp(&tp, dqp, &ddqp, &bp, flags);
629 if (error) {
630 /*
631 * This can happen if quotas got turned off (ESRCH),
632 * or if the dquot didn't exist on disk and we ask to
633 * allocate (ENOENT).
634 */
635 trace_xfs_dqread_fail(dqp);
636 goto error1;
637 }
638
639 /* copy everything from disk dquot to the incore dquot */
640 memcpy(&dqp->q_core, ddqp, sizeof(xfs_disk_dquot_t));
641 xfs_qm_dquot_logitem_init(dqp);
642
643 /*
644 * Reservation counters are defined as reservation plus current usage
645 * to avoid having to add every time.
646 */
647 dqp->q_res_bcount = be64_to_cpu(ddqp->d_bcount);
648 dqp->q_res_icount = be64_to_cpu(ddqp->d_icount);
649 dqp->q_res_rtbcount = be64_to_cpu(ddqp->d_rtbcount);
650
651 /* initialize the dquot speculative prealloc thresholds */
652 xfs_dquot_set_prealloc_limits(dqp);
653
654 /* Mark the buf so that this will stay incore a little longer */
655 xfs_buf_set_ref(bp, XFS_DQUOT_REF);
656
657 /*
658 * We got the buffer with a xfs_trans_read_buf() (in dqtobp())
659 * So we need to release with xfs_trans_brelse().
660 * The strategy here is identical to that of inodes; we lock
661 * the dquot in xfs_qm_dqget() before making it accessible to
662 * others. This is because dquots, like inodes, need a good level of
663 * concurrency, and we don't want to take locks on the entire buffers
664 * for dquot accesses.
665 * Note also that the dquot buffer may even be dirty at this point, if
666 * this particular dquot was repaired. We still aren't afraid to
667 * brelse it because we have the changes incore.
668 */
669 ASSERT(xfs_buf_islocked(bp));
670 xfs_trans_brelse(tp, bp);
671
672 if (tp) {
673 error = xfs_trans_commit(tp);
674 if (error)
675 goto error0;
676 }
677
678 *O_dqpp = dqp;
679 return error;
680
681error1:
682 if (tp)
683 xfs_trans_cancel(tp);
684error0:
685 xfs_qm_dqdestroy(dqp);
686 *O_dqpp = NULL;
687 return error;
688}
689
690/*
691 * Advance to the next id in the current chunk, or if at the
692 * end of the chunk, skip ahead to first id in next allocated chunk
693 * using the SEEK_DATA interface.
694 */
695int
696xfs_dq_get_next_id(
697 xfs_mount_t *mp,
698 uint type,
699 xfs_dqid_t *id,
700 loff_t eof)
701{
702 struct xfs_inode *quotip;
703 xfs_fsblock_t start;
704 loff_t offset;
705 uint lock;
706 xfs_dqid_t next_id;
707 int error = 0;
708
709 /* Simple advance */
710 next_id = *id + 1;
711
712 /* If new ID is within the current chunk, advancing it sufficed */
713 if (next_id % mp->m_quotainfo->qi_dqperchunk) {
714 *id = next_id;
715 return 0;
716 }
717
718 /* Nope, next_id is now past the current chunk, so find the next one */
719 start = (xfs_fsblock_t)next_id / mp->m_quotainfo->qi_dqperchunk;
720
721 quotip = xfs_quota_inode(mp, type);
722 lock = xfs_ilock_data_map_shared(quotip);
723
724 offset = __xfs_seek_hole_data(VFS_I(quotip), XFS_FSB_TO_B(mp, start),
725 eof, SEEK_DATA);
726 if (offset < 0)
727 error = offset;
728
729 xfs_iunlock(quotip, lock);
730
731 /* -ENXIO is essentially "no more data" */
732 if (error)
733 return (error == -ENXIO ? -ENOENT: error);
734
735 /* Convert next data offset back to a quota id */
736 *id = XFS_B_TO_FSB(mp, offset) * mp->m_quotainfo->qi_dqperchunk;
737 return 0;
738}
739
740/*
741 * Given the file system, inode OR id, and type (UDQUOT/GDQUOT), return a
742 * a locked dquot, doing an allocation (if requested) as needed.
743 * When both an inode and an id are given, the inode's id takes precedence.
744 * That is, if the id changes while we don't hold the ilock inside this
745 * function, the new dquot is returned, not necessarily the one requested
746 * in the id argument.
747 */
748int
749xfs_qm_dqget(
750 xfs_mount_t *mp,
751 xfs_inode_t *ip, /* locked inode (optional) */
752 xfs_dqid_t id, /* uid/projid/gid depending on type */
753 uint type, /* XFS_DQ_USER/XFS_DQ_PROJ/XFS_DQ_GROUP */
754 uint flags, /* DQALLOC, DQSUSER, DQREPAIR, DOWARN */
755 xfs_dquot_t **O_dqpp) /* OUT : locked incore dquot */
756{
757 struct xfs_quotainfo *qi = mp->m_quotainfo;
758 struct radix_tree_root *tree = xfs_dquot_tree(qi, type);
759 struct xfs_dquot *dqp;
760 loff_t eof = 0;
761 int error;
762
763 ASSERT(XFS_IS_QUOTA_RUNNING(mp));
764 if ((! XFS_IS_UQUOTA_ON(mp) && type == XFS_DQ_USER) ||
765 (! XFS_IS_PQUOTA_ON(mp) && type == XFS_DQ_PROJ) ||
766 (! XFS_IS_GQUOTA_ON(mp) && type == XFS_DQ_GROUP)) {
767 return -ESRCH;
768 }
769
770#ifdef DEBUG
771 if (xfs_do_dqerror) {
772 if ((xfs_dqerror_target == mp->m_ddev_targp) &&
773 (xfs_dqreq_num++ % xfs_dqerror_mod) == 0) {
774 xfs_debug(mp, "Returning error in dqget");
775 return -EIO;
776 }
777 }
778
779 ASSERT(type == XFS_DQ_USER ||
780 type == XFS_DQ_PROJ ||
781 type == XFS_DQ_GROUP);
782 if (ip) {
783 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
784 ASSERT(xfs_inode_dquot(ip, type) == NULL);
785 }
786#endif
787
788 /* Get the end of the quota file if we need it */
789 if (flags & XFS_QMOPT_DQNEXT) {
790 struct xfs_inode *quotip;
791 xfs_fileoff_t last;
792 uint lock_mode;
793
794 quotip = xfs_quota_inode(mp, type);
795 lock_mode = xfs_ilock_data_map_shared(quotip);
796 error = xfs_bmap_last_offset(quotip, &last, XFS_DATA_FORK);
797 xfs_iunlock(quotip, lock_mode);
798 if (error)
799 return error;
800 eof = XFS_FSB_TO_B(mp, last);
801 }
802
803restart:
804 mutex_lock(&qi->qi_tree_lock);
805 dqp = radix_tree_lookup(tree, id);
806 if (dqp) {
807 xfs_dqlock(dqp);
808 if (dqp->dq_flags & XFS_DQ_FREEING) {
809 xfs_dqunlock(dqp);
810 mutex_unlock(&qi->qi_tree_lock);
811 trace_xfs_dqget_freeing(dqp);
812 delay(1);
813 goto restart;
814 }
815
816 /* uninit / unused quota found in radix tree, keep looking */
817 if (flags & XFS_QMOPT_DQNEXT) {
818 if (XFS_IS_DQUOT_UNINITIALIZED(dqp)) {
819 xfs_dqunlock(dqp);
820 mutex_unlock(&qi->qi_tree_lock);
821 error = xfs_dq_get_next_id(mp, type, &id, eof);
822 if (error)
823 return error;
824 goto restart;
825 }
826 }
827
828 dqp->q_nrefs++;
829 mutex_unlock(&qi->qi_tree_lock);
830
831 trace_xfs_dqget_hit(dqp);
832 XFS_STATS_INC(mp, xs_qm_dqcachehits);
833 *O_dqpp = dqp;
834 return 0;
835 }
836 mutex_unlock(&qi->qi_tree_lock);
837 XFS_STATS_INC(mp, xs_qm_dqcachemisses);
838
839 /*
840 * Dquot cache miss. We don't want to keep the inode lock across
841 * a (potential) disk read. Also we don't want to deal with the lock
842 * ordering between quotainode and this inode. OTOH, dropping the inode
843 * lock here means dealing with a chown that can happen before
844 * we re-acquire the lock.
845 */
846 if (ip)
847 xfs_iunlock(ip, XFS_ILOCK_EXCL);
848
849 error = xfs_qm_dqread(mp, id, type, flags, &dqp);
850
851 if (ip)
852 xfs_ilock(ip, XFS_ILOCK_EXCL);
853
854 /* If we are asked to find next active id, keep looking */
855 if (error == -ENOENT && (flags & XFS_QMOPT_DQNEXT)) {
856 error = xfs_dq_get_next_id(mp, type, &id, eof);
857 if (!error)
858 goto restart;
859 }
860
861 if (error)
862 return error;
863
864 if (ip) {
865 /*
866 * A dquot could be attached to this inode by now, since
867 * we had dropped the ilock.
868 */
869 if (xfs_this_quota_on(mp, type)) {
870 struct xfs_dquot *dqp1;
871
872 dqp1 = xfs_inode_dquot(ip, type);
873 if (dqp1) {
874 xfs_qm_dqdestroy(dqp);
875 dqp = dqp1;
876 xfs_dqlock(dqp);
877 goto dqret;
878 }
879 } else {
880 /* inode stays locked on return */
881 xfs_qm_dqdestroy(dqp);
882 return -ESRCH;
883 }
884 }
885
886 mutex_lock(&qi->qi_tree_lock);
887 error = radix_tree_insert(tree, id, dqp);
888 if (unlikely(error)) {
889 WARN_ON(error != -EEXIST);
890
891 /*
892 * Duplicate found. Just throw away the new dquot and start
893 * over.
894 */
895 mutex_unlock(&qi->qi_tree_lock);
896 trace_xfs_dqget_dup(dqp);
897 xfs_qm_dqdestroy(dqp);
898 XFS_STATS_INC(mp, xs_qm_dquot_dups);
899 goto restart;
900 }
901
902 /*
903 * We return a locked dquot to the caller, with a reference taken
904 */
905 xfs_dqlock(dqp);
906 dqp->q_nrefs = 1;
907
908 qi->qi_dquots++;
909 mutex_unlock(&qi->qi_tree_lock);
910
911 /* If we are asked to find next active id, keep looking */
912 if (flags & XFS_QMOPT_DQNEXT) {
913 if (XFS_IS_DQUOT_UNINITIALIZED(dqp)) {
914 xfs_qm_dqput(dqp);
915 error = xfs_dq_get_next_id(mp, type, &id, eof);
916 if (error)
917 return error;
918 goto restart;
919 }
920 }
921
922 dqret:
923 ASSERT((ip == NULL) || xfs_isilocked(ip, XFS_ILOCK_EXCL));
924 trace_xfs_dqget_miss(dqp);
925 *O_dqpp = dqp;
926 return 0;
927}
928
929/*
930 * Release a reference to the dquot (decrement ref-count) and unlock it.
931 *
932 * If there is a group quota attached to this dquot, carefully release that
933 * too without tripping over deadlocks'n'stuff.
934 */
935void
936xfs_qm_dqput(
937 struct xfs_dquot *dqp)
938{
939 ASSERT(dqp->q_nrefs > 0);
940 ASSERT(XFS_DQ_IS_LOCKED(dqp));
941
942 trace_xfs_dqput(dqp);
943
944 if (--dqp->q_nrefs == 0) {
945 struct xfs_quotainfo *qi = dqp->q_mount->m_quotainfo;
946 trace_xfs_dqput_free(dqp);
947
948 if (list_lru_add(&qi->qi_lru, &dqp->q_lru))
949 XFS_STATS_INC(dqp->q_mount, xs_qm_dquot_unused);
950 }
951 xfs_dqunlock(dqp);
952}
953
954/*
955 * Release a dquot. Flush it if dirty, then dqput() it.
956 * dquot must not be locked.
957 */
958void
959xfs_qm_dqrele(
960 xfs_dquot_t *dqp)
961{
962 if (!dqp)
963 return;
964
965 trace_xfs_dqrele(dqp);
966
967 xfs_dqlock(dqp);
968 /*
969 * We don't care to flush it if the dquot is dirty here.
970 * That will create stutters that we want to avoid.
971 * Instead we do a delayed write when we try to reclaim
972 * a dirty dquot. Also xfs_sync will take part of the burden...
973 */
974 xfs_qm_dqput(dqp);
975}
976
977/*
978 * This is the dquot flushing I/O completion routine. It is called
979 * from interrupt level when the buffer containing the dquot is
980 * flushed to disk. It is responsible for removing the dquot logitem
981 * from the AIL if it has not been re-logged, and unlocking the dquot's
982 * flush lock. This behavior is very similar to that of inodes..
983 */
984STATIC void
985xfs_qm_dqflush_done(
986 struct xfs_buf *bp,
987 struct xfs_log_item *lip)
988{
989 xfs_dq_logitem_t *qip = (struct xfs_dq_logitem *)lip;
990 xfs_dquot_t *dqp = qip->qli_dquot;
991 struct xfs_ail *ailp = lip->li_ailp;
992
993 /*
994 * We only want to pull the item from the AIL if its
995 * location in the log has not changed since we started the flush.
996 * Thus, we only bother if the dquot's lsn has
997 * not changed. First we check the lsn outside the lock
998 * since it's cheaper, and then we recheck while
999 * holding the lock before removing the dquot from the AIL.
1000 */
1001 if ((lip->li_flags & XFS_LI_IN_AIL) &&
1002 lip->li_lsn == qip->qli_flush_lsn) {
1003
1004 /* xfs_trans_ail_delete() drops the AIL lock. */
1005 spin_lock(&ailp->xa_lock);
1006 if (lip->li_lsn == qip->qli_flush_lsn)
1007 xfs_trans_ail_delete(ailp, lip, SHUTDOWN_CORRUPT_INCORE);
1008 else
1009 spin_unlock(&ailp->xa_lock);
1010 }
1011
1012 /*
1013 * Release the dq's flush lock since we're done with it.
1014 */
1015 xfs_dqfunlock(dqp);
1016}
1017
1018/*
1019 * Write a modified dquot to disk.
1020 * The dquot must be locked and the flush lock too taken by caller.
1021 * The flush lock will not be unlocked until the dquot reaches the disk,
1022 * but the dquot is free to be unlocked and modified by the caller
1023 * in the interim. Dquot is still locked on return. This behavior is
1024 * identical to that of inodes.
1025 */
1026int
1027xfs_qm_dqflush(
1028 struct xfs_dquot *dqp,
1029 struct xfs_buf **bpp)
1030{
1031 struct xfs_mount *mp = dqp->q_mount;
1032 struct xfs_buf *bp;
1033 struct xfs_disk_dquot *ddqp;
1034 int error;
1035
1036 ASSERT(XFS_DQ_IS_LOCKED(dqp));
1037 ASSERT(!completion_done(&dqp->q_flush));
1038
1039 trace_xfs_dqflush(dqp);
1040
1041 *bpp = NULL;
1042
1043 xfs_qm_dqunpin_wait(dqp);
1044
1045 /*
1046 * This may have been unpinned because the filesystem is shutting
1047 * down forcibly. If that's the case we must not write this dquot
1048 * to disk, because the log record didn't make it to disk.
1049 *
1050 * We also have to remove the log item from the AIL in this case,
1051 * as we wait for an emptry AIL as part of the unmount process.
1052 */
1053 if (XFS_FORCED_SHUTDOWN(mp)) {
1054 struct xfs_log_item *lip = &dqp->q_logitem.qli_item;
1055 dqp->dq_flags &= ~XFS_DQ_DIRTY;
1056
1057 xfs_trans_ail_remove(lip, SHUTDOWN_CORRUPT_INCORE);
1058
1059 error = -EIO;
1060 goto out_unlock;
1061 }
1062
1063 /*
1064 * Get the buffer containing the on-disk dquot
1065 */
1066 error = xfs_trans_read_buf(mp, NULL, mp->m_ddev_targp, dqp->q_blkno,
1067 mp->m_quotainfo->qi_dqchunklen, 0, &bp,
1068 &xfs_dquot_buf_ops);
1069 if (error)
1070 goto out_unlock;
1071
1072 /*
1073 * Calculate the location of the dquot inside the buffer.
1074 */
1075 ddqp = bp->b_addr + dqp->q_bufoffset;
1076
1077 /*
1078 * A simple sanity check in case we got a corrupted dquot..
1079 */
1080 error = xfs_dqcheck(mp, &dqp->q_core, be32_to_cpu(ddqp->d_id), 0,
1081 XFS_QMOPT_DOWARN, "dqflush (incore copy)");
1082 if (error) {
1083 xfs_buf_relse(bp);
1084 xfs_dqfunlock(dqp);
1085 xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE);
1086 return -EIO;
1087 }
1088
1089 /* This is the only portion of data that needs to persist */
1090 memcpy(ddqp, &dqp->q_core, sizeof(xfs_disk_dquot_t));
1091
1092 /*
1093 * Clear the dirty field and remember the flush lsn for later use.
1094 */
1095 dqp->dq_flags &= ~XFS_DQ_DIRTY;
1096
1097 xfs_trans_ail_copy_lsn(mp->m_ail, &dqp->q_logitem.qli_flush_lsn,
1098 &dqp->q_logitem.qli_item.li_lsn);
1099
1100 /*
1101 * copy the lsn into the on-disk dquot now while we have the in memory
1102 * dquot here. This can't be done later in the write verifier as we
1103 * can't get access to the log item at that point in time.
1104 *
1105 * We also calculate the CRC here so that the on-disk dquot in the
1106 * buffer always has a valid CRC. This ensures there is no possibility
1107 * of a dquot without an up-to-date CRC getting to disk.
1108 */
1109 if (xfs_sb_version_hascrc(&mp->m_sb)) {
1110 struct xfs_dqblk *dqb = (struct xfs_dqblk *)ddqp;
1111
1112 dqb->dd_lsn = cpu_to_be64(dqp->q_logitem.qli_item.li_lsn);
1113 xfs_update_cksum((char *)dqb, sizeof(struct xfs_dqblk),
1114 XFS_DQUOT_CRC_OFF);
1115 }
1116
1117 /*
1118 * Attach an iodone routine so that we can remove this dquot from the
1119 * AIL and release the flush lock once the dquot is synced to disk.
1120 */
1121 xfs_buf_attach_iodone(bp, xfs_qm_dqflush_done,
1122 &dqp->q_logitem.qli_item);
1123
1124 /*
1125 * If the buffer is pinned then push on the log so we won't
1126 * get stuck waiting in the write for too long.
1127 */
1128 if (xfs_buf_ispinned(bp)) {
1129 trace_xfs_dqflush_force(dqp);
1130 xfs_log_force(mp, 0);
1131 }
1132
1133 trace_xfs_dqflush_done(dqp);
1134 *bpp = bp;
1135 return 0;
1136
1137out_unlock:
1138 xfs_dqfunlock(dqp);
1139 return -EIO;
1140}
1141
1142/*
1143 * Lock two xfs_dquot structures.
1144 *
1145 * To avoid deadlocks we always lock the quota structure with
1146 * the lowerd id first.
1147 */
1148void
1149xfs_dqlock2(
1150 xfs_dquot_t *d1,
1151 xfs_dquot_t *d2)
1152{
1153 if (d1 && d2) {
1154 ASSERT(d1 != d2);
1155 if (be32_to_cpu(d1->q_core.d_id) >
1156 be32_to_cpu(d2->q_core.d_id)) {
1157 mutex_lock(&d2->q_qlock);
1158 mutex_lock_nested(&d1->q_qlock, XFS_QLOCK_NESTED);
1159 } else {
1160 mutex_lock(&d1->q_qlock);
1161 mutex_lock_nested(&d2->q_qlock, XFS_QLOCK_NESTED);
1162 }
1163 } else if (d1) {
1164 mutex_lock(&d1->q_qlock);
1165 } else if (d2) {
1166 mutex_lock(&d2->q_qlock);
1167 }
1168}
1169
1170int __init
1171xfs_qm_init(void)
1172{
1173 xfs_qm_dqzone =
1174 kmem_zone_init(sizeof(struct xfs_dquot), "xfs_dquot");
1175 if (!xfs_qm_dqzone)
1176 goto out;
1177
1178 xfs_qm_dqtrxzone =
1179 kmem_zone_init(sizeof(struct xfs_dquot_acct), "xfs_dqtrx");
1180 if (!xfs_qm_dqtrxzone)
1181 goto out_free_dqzone;
1182
1183 return 0;
1184
1185out_free_dqzone:
1186 kmem_zone_destroy(xfs_qm_dqzone);
1187out:
1188 return -ENOMEM;
1189}
1190
1191void
1192xfs_qm_exit(void)
1193{
1194 kmem_zone_destroy(xfs_qm_dqtrxzone);
1195 kmem_zone_destroy(xfs_qm_dqzone);
1196}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (c) 2000-2003 Silicon Graphics, Inc.
4 * All Rights Reserved.
5 */
6#include "xfs.h"
7#include "xfs_fs.h"
8#include "xfs_format.h"
9#include "xfs_log_format.h"
10#include "xfs_shared.h"
11#include "xfs_trans_resv.h"
12#include "xfs_bit.h"
13#include "xfs_mount.h"
14#include "xfs_defer.h"
15#include "xfs_inode.h"
16#include "xfs_bmap.h"
17#include "xfs_quota.h"
18#include "xfs_trans.h"
19#include "xfs_buf_item.h"
20#include "xfs_trans_space.h"
21#include "xfs_trans_priv.h"
22#include "xfs_qm.h"
23#include "xfs_trace.h"
24#include "xfs_log.h"
25#include "xfs_bmap_btree.h"
26#include "xfs_error.h"
27#include "xfs_health.h"
28
29/*
30 * Lock order:
31 *
32 * ip->i_lock
33 * qi->qi_tree_lock
34 * dquot->q_qlock (xfs_dqlock() and friends)
35 * dquot->q_flush (xfs_dqflock() and friends)
36 * qi->qi_lru_lock
37 *
38 * If two dquots need to be locked the order is user before group/project,
39 * otherwise by the lowest id first, see xfs_dqlock2.
40 */
41
42struct kmem_cache *xfs_dqtrx_cache;
43static struct kmem_cache *xfs_dquot_cache;
44
45static struct lock_class_key xfs_dquot_group_class;
46static struct lock_class_key xfs_dquot_project_class;
47
48/* Record observations of quota corruption with the health tracking system. */
49static void
50xfs_dquot_mark_sick(
51 struct xfs_dquot *dqp)
52{
53 struct xfs_mount *mp = dqp->q_mount;
54
55 switch (dqp->q_type) {
56 case XFS_DQTYPE_USER:
57 xfs_fs_mark_sick(mp, XFS_SICK_FS_UQUOTA);
58 break;
59 case XFS_DQTYPE_GROUP:
60 xfs_fs_mark_sick(mp, XFS_SICK_FS_GQUOTA);
61 break;
62 case XFS_DQTYPE_PROJ:
63 xfs_fs_mark_sick(mp, XFS_SICK_FS_PQUOTA);
64 break;
65 default:
66 ASSERT(0);
67 break;
68 }
69}
70
71/*
72 * Detach the dquot buffer if it's still attached, because we can get called
73 * through dqpurge after a log shutdown. Caller must hold the dqflock or have
74 * otherwise isolated the dquot.
75 */
76void
77xfs_dquot_detach_buf(
78 struct xfs_dquot *dqp)
79{
80 struct xfs_dq_logitem *qlip = &dqp->q_logitem;
81 struct xfs_buf *bp = NULL;
82
83 spin_lock(&qlip->qli_lock);
84 if (qlip->qli_item.li_buf) {
85 bp = qlip->qli_item.li_buf;
86 qlip->qli_item.li_buf = NULL;
87 }
88 spin_unlock(&qlip->qli_lock);
89 if (bp) {
90 xfs_buf_lock(bp);
91 list_del_init(&qlip->qli_item.li_bio_list);
92 xfs_buf_relse(bp);
93 }
94}
95
96/*
97 * This is called to free all the memory associated with a dquot
98 */
99void
100xfs_qm_dqdestroy(
101 struct xfs_dquot *dqp)
102{
103 ASSERT(list_empty(&dqp->q_lru));
104 ASSERT(dqp->q_logitem.qli_item.li_buf == NULL);
105
106 kvfree(dqp->q_logitem.qli_item.li_lv_shadow);
107 mutex_destroy(&dqp->q_qlock);
108
109 XFS_STATS_DEC(dqp->q_mount, xs_qm_dquot);
110 kmem_cache_free(xfs_dquot_cache, dqp);
111}
112
113/*
114 * If default limits are in force, push them into the dquot now.
115 * We overwrite the dquot limits only if they are zero and this
116 * is not the root dquot.
117 */
118void
119xfs_qm_adjust_dqlimits(
120 struct xfs_dquot *dq)
121{
122 struct xfs_mount *mp = dq->q_mount;
123 struct xfs_quotainfo *q = mp->m_quotainfo;
124 struct xfs_def_quota *defq;
125 int prealloc = 0;
126
127 ASSERT(dq->q_id);
128 defq = xfs_get_defquota(q, xfs_dquot_type(dq));
129
130 if (!dq->q_blk.softlimit) {
131 dq->q_blk.softlimit = defq->blk.soft;
132 prealloc = 1;
133 }
134 if (!dq->q_blk.hardlimit) {
135 dq->q_blk.hardlimit = defq->blk.hard;
136 prealloc = 1;
137 }
138 if (!dq->q_ino.softlimit)
139 dq->q_ino.softlimit = defq->ino.soft;
140 if (!dq->q_ino.hardlimit)
141 dq->q_ino.hardlimit = defq->ino.hard;
142 if (!dq->q_rtb.softlimit)
143 dq->q_rtb.softlimit = defq->rtb.soft;
144 if (!dq->q_rtb.hardlimit)
145 dq->q_rtb.hardlimit = defq->rtb.hard;
146
147 if (prealloc)
148 xfs_dquot_set_prealloc_limits(dq);
149}
150
151/* Set the expiration time of a quota's grace period. */
152time64_t
153xfs_dquot_set_timeout(
154 struct xfs_mount *mp,
155 time64_t timeout)
156{
157 struct xfs_quotainfo *qi = mp->m_quotainfo;
158
159 return clamp_t(time64_t, timeout, qi->qi_expiry_min,
160 qi->qi_expiry_max);
161}
162
163/* Set the length of the default grace period. */
164time64_t
165xfs_dquot_set_grace_period(
166 time64_t grace)
167{
168 return clamp_t(time64_t, grace, XFS_DQ_GRACE_MIN, XFS_DQ_GRACE_MAX);
169}
170
171/*
172 * Determine if this quota counter is over either limit and set the quota
173 * timers as appropriate.
174 */
175static inline void
176xfs_qm_adjust_res_timer(
177 struct xfs_mount *mp,
178 struct xfs_dquot_res *res,
179 struct xfs_quota_limits *qlim)
180{
181 ASSERT(res->hardlimit == 0 || res->softlimit <= res->hardlimit);
182
183 if ((res->softlimit && res->count > res->softlimit) ||
184 (res->hardlimit && res->count > res->hardlimit)) {
185 if (res->timer == 0)
186 res->timer = xfs_dquot_set_timeout(mp,
187 ktime_get_real_seconds() + qlim->time);
188 } else {
189 res->timer = 0;
190 }
191}
192
193/*
194 * Check the limits and timers of a dquot and start or reset timers
195 * if necessary.
196 * This gets called even when quota enforcement is OFF, which makes our
197 * life a little less complicated. (We just don't reject any quota
198 * reservations in that case, when enforcement is off).
199 * We also return 0 as the values of the timers in Q_GETQUOTA calls, when
200 * enforcement's off.
201 * In contrast, warnings are a little different in that they don't
202 * 'automatically' get started when limits get exceeded. They do
203 * get reset to zero, however, when we find the count to be under
204 * the soft limit (they are only ever set non-zero via userspace).
205 */
206void
207xfs_qm_adjust_dqtimers(
208 struct xfs_dquot *dq)
209{
210 struct xfs_mount *mp = dq->q_mount;
211 struct xfs_quotainfo *qi = mp->m_quotainfo;
212 struct xfs_def_quota *defq;
213
214 ASSERT(dq->q_id);
215 defq = xfs_get_defquota(qi, xfs_dquot_type(dq));
216
217 xfs_qm_adjust_res_timer(dq->q_mount, &dq->q_blk, &defq->blk);
218 xfs_qm_adjust_res_timer(dq->q_mount, &dq->q_ino, &defq->ino);
219 xfs_qm_adjust_res_timer(dq->q_mount, &dq->q_rtb, &defq->rtb);
220}
221
222/*
223 * initialize a buffer full of dquots and log the whole thing
224 */
225void
226xfs_qm_init_dquot_blk(
227 struct xfs_trans *tp,
228 xfs_dqid_t id,
229 xfs_dqtype_t type,
230 struct xfs_buf *bp)
231{
232 struct xfs_mount *mp = tp->t_mountp;
233 struct xfs_quotainfo *q = mp->m_quotainfo;
234 struct xfs_dqblk *d;
235 xfs_dqid_t curid;
236 unsigned int qflag;
237 unsigned int blftype;
238 int i;
239
240 ASSERT(tp);
241 ASSERT(xfs_buf_islocked(bp));
242
243 switch (type) {
244 case XFS_DQTYPE_USER:
245 qflag = XFS_UQUOTA_CHKD;
246 blftype = XFS_BLF_UDQUOT_BUF;
247 break;
248 case XFS_DQTYPE_PROJ:
249 qflag = XFS_PQUOTA_CHKD;
250 blftype = XFS_BLF_PDQUOT_BUF;
251 break;
252 case XFS_DQTYPE_GROUP:
253 qflag = XFS_GQUOTA_CHKD;
254 blftype = XFS_BLF_GDQUOT_BUF;
255 break;
256 default:
257 ASSERT(0);
258 return;
259 }
260
261 d = bp->b_addr;
262
263 /*
264 * ID of the first dquot in the block - id's are zero based.
265 */
266 curid = id - (id % q->qi_dqperchunk);
267 memset(d, 0, BBTOB(q->qi_dqchunklen));
268 for (i = 0; i < q->qi_dqperchunk; i++, d++, curid++) {
269 d->dd_diskdq.d_magic = cpu_to_be16(XFS_DQUOT_MAGIC);
270 d->dd_diskdq.d_version = XFS_DQUOT_VERSION;
271 d->dd_diskdq.d_id = cpu_to_be32(curid);
272 d->dd_diskdq.d_type = type;
273 if (curid > 0 && xfs_has_bigtime(mp))
274 d->dd_diskdq.d_type |= XFS_DQTYPE_BIGTIME;
275 if (xfs_has_crc(mp)) {
276 uuid_copy(&d->dd_uuid, &mp->m_sb.sb_meta_uuid);
277 xfs_update_cksum((char *)d, sizeof(struct xfs_dqblk),
278 XFS_DQUOT_CRC_OFF);
279 }
280 }
281
282 xfs_trans_dquot_buf(tp, bp, blftype);
283
284 /*
285 * quotacheck uses delayed writes to update all the dquots on disk in an
286 * efficient manner instead of logging the individual dquot changes as
287 * they are made. However if we log the buffer allocated here and crash
288 * after quotacheck while the logged initialisation is still in the
289 * active region of the log, log recovery can replay the dquot buffer
290 * initialisation over the top of the checked dquots and corrupt quota
291 * accounting.
292 *
293 * To avoid this problem, quotacheck cannot log the initialised buffer.
294 * We must still dirty the buffer and write it back before the
295 * allocation transaction clears the log. Therefore, mark the buffer as
296 * ordered instead of logging it directly. This is safe for quotacheck
297 * because it detects and repairs allocated but initialized dquot blocks
298 * in the quota inodes.
299 */
300 if (!(mp->m_qflags & qflag))
301 xfs_trans_ordered_buf(tp, bp);
302 else
303 xfs_trans_log_buf(tp, bp, 0, BBTOB(q->qi_dqchunklen) - 1);
304}
305
306static void
307xfs_dquot_set_prealloc(
308 struct xfs_dquot_pre *pre,
309 const struct xfs_dquot_res *res)
310{
311 xfs_qcnt_t space;
312
313 pre->q_prealloc_hi_wmark = res->hardlimit;
314 pre->q_prealloc_lo_wmark = res->softlimit;
315
316 space = div_u64(pre->q_prealloc_hi_wmark, 100);
317 if (!pre->q_prealloc_lo_wmark)
318 pre->q_prealloc_lo_wmark = space * 95;
319
320 pre->q_low_space[XFS_QLOWSP_1_PCNT] = space;
321 pre->q_low_space[XFS_QLOWSP_3_PCNT] = space * 3;
322 pre->q_low_space[XFS_QLOWSP_5_PCNT] = space * 5;
323}
324
325/*
326 * Initialize the dynamic speculative preallocation thresholds. The lo/hi
327 * watermarks correspond to the soft and hard limits by default. If a soft limit
328 * is not specified, we use 95% of the hard limit.
329 */
330void
331xfs_dquot_set_prealloc_limits(struct xfs_dquot *dqp)
332{
333 xfs_dquot_set_prealloc(&dqp->q_blk_prealloc, &dqp->q_blk);
334 xfs_dquot_set_prealloc(&dqp->q_rtb_prealloc, &dqp->q_rtb);
335}
336
337/*
338 * Ensure that the given in-core dquot has a buffer on disk backing it, and
339 * return the buffer locked and held. This is called when the bmapi finds a
340 * hole.
341 */
342STATIC int
343xfs_dquot_disk_alloc(
344 struct xfs_dquot *dqp,
345 struct xfs_buf **bpp)
346{
347 struct xfs_bmbt_irec map;
348 struct xfs_trans *tp;
349 struct xfs_mount *mp = dqp->q_mount;
350 struct xfs_buf *bp;
351 xfs_dqtype_t qtype = xfs_dquot_type(dqp);
352 struct xfs_inode *quotip = xfs_quota_inode(mp, qtype);
353 int nmaps = 1;
354 int error;
355
356 trace_xfs_dqalloc(dqp);
357
358 error = xfs_trans_alloc(mp, &M_RES(mp)->tr_qm_dqalloc,
359 XFS_QM_DQALLOC_SPACE_RES(mp), 0, 0, &tp);
360 if (error)
361 return error;
362
363 xfs_ilock(quotip, XFS_ILOCK_EXCL);
364 xfs_trans_ijoin(tp, quotip, 0);
365
366 if (!xfs_this_quota_on(dqp->q_mount, qtype)) {
367 /*
368 * Return if this type of quotas is turned off while we didn't
369 * have an inode lock
370 */
371 error = -ESRCH;
372 goto err_cancel;
373 }
374
375 error = xfs_iext_count_extend(tp, quotip, XFS_DATA_FORK,
376 XFS_IEXT_ADD_NOSPLIT_CNT);
377 if (error)
378 goto err_cancel;
379
380 /* Create the block mapping. */
381 error = xfs_bmapi_write(tp, quotip, dqp->q_fileoffset,
382 XFS_DQUOT_CLUSTER_SIZE_FSB, XFS_BMAPI_METADATA, 0, &map,
383 &nmaps);
384 if (error)
385 goto err_cancel;
386
387 ASSERT(map.br_blockcount == XFS_DQUOT_CLUSTER_SIZE_FSB);
388 ASSERT((map.br_startblock != DELAYSTARTBLOCK) &&
389 (map.br_startblock != HOLESTARTBLOCK));
390
391 /*
392 * Keep track of the blkno to save a lookup later
393 */
394 dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock);
395
396 /* now we can just get the buffer (there's nothing to read yet) */
397 error = xfs_trans_get_buf(tp, mp->m_ddev_targp, dqp->q_blkno,
398 mp->m_quotainfo->qi_dqchunklen, 0, &bp);
399 if (error)
400 goto err_cancel;
401 bp->b_ops = &xfs_dquot_buf_ops;
402
403 /*
404 * Make a chunk of dquots out of this buffer and log
405 * the entire thing.
406 */
407 xfs_qm_init_dquot_blk(tp, dqp->q_id, qtype, bp);
408 xfs_buf_set_ref(bp, XFS_DQUOT_REF);
409
410 /*
411 * Hold the buffer and join it to the dfops so that we'll still own
412 * the buffer when we return to the caller. The buffer disposal on
413 * error must be paid attention to very carefully, as it has been
414 * broken since commit efa092f3d4c6 "[XFS] Fixes a bug in the quota
415 * code when allocating a new dquot record" in 2005, and the later
416 * conversion to xfs_defer_ops in commit 310a75a3c6c747 failed to keep
417 * the buffer locked across the _defer_finish call. We can now do
418 * this correctly with xfs_defer_bjoin.
419 *
420 * Above, we allocated a disk block for the dquot information and used
421 * get_buf to initialize the dquot. If the _defer_finish fails, the old
422 * transaction is gone but the new buffer is not joined or held to any
423 * transaction, so we must _buf_relse it.
424 *
425 * If everything succeeds, the caller of this function is returned a
426 * buffer that is locked and held to the transaction. The caller
427 * is responsible for unlocking any buffer passed back, either
428 * manually or by committing the transaction. On error, the buffer is
429 * released and not passed back.
430 *
431 * Keep the quota inode ILOCKed until after the transaction commit to
432 * maintain the atomicity of bmap/rmap updates.
433 */
434 xfs_trans_bhold(tp, bp);
435 error = xfs_trans_commit(tp);
436 xfs_iunlock(quotip, XFS_ILOCK_EXCL);
437 if (error) {
438 xfs_buf_relse(bp);
439 return error;
440 }
441
442 *bpp = bp;
443 return 0;
444
445err_cancel:
446 xfs_trans_cancel(tp);
447 xfs_iunlock(quotip, XFS_ILOCK_EXCL);
448 return error;
449}
450
451/*
452 * Read in the in-core dquot's on-disk metadata and return the buffer.
453 * Returns ENOENT to signal a hole.
454 */
455STATIC int
456xfs_dquot_disk_read(
457 struct xfs_mount *mp,
458 struct xfs_dquot *dqp,
459 struct xfs_buf **bpp)
460{
461 struct xfs_bmbt_irec map;
462 struct xfs_buf *bp;
463 xfs_dqtype_t qtype = xfs_dquot_type(dqp);
464 struct xfs_inode *quotip = xfs_quota_inode(mp, qtype);
465 uint lock_mode;
466 int nmaps = 1;
467 int error;
468
469 lock_mode = xfs_ilock_data_map_shared(quotip);
470 if (!xfs_this_quota_on(mp, qtype)) {
471 /*
472 * Return if this type of quotas is turned off while we
473 * didn't have the quota inode lock.
474 */
475 xfs_iunlock(quotip, lock_mode);
476 return -ESRCH;
477 }
478
479 /*
480 * Find the block map; no allocations yet
481 */
482 error = xfs_bmapi_read(quotip, dqp->q_fileoffset,
483 XFS_DQUOT_CLUSTER_SIZE_FSB, &map, &nmaps, 0);
484 xfs_iunlock(quotip, lock_mode);
485 if (error)
486 return error;
487
488 ASSERT(nmaps == 1);
489 ASSERT(map.br_blockcount >= 1);
490 ASSERT(map.br_startblock != DELAYSTARTBLOCK);
491 if (map.br_startblock == HOLESTARTBLOCK)
492 return -ENOENT;
493
494 trace_xfs_dqtobp_read(dqp);
495
496 /*
497 * store the blkno etc so that we don't have to do the
498 * mapping all the time
499 */
500 dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock);
501
502 error = xfs_trans_read_buf(mp, NULL, mp->m_ddev_targp, dqp->q_blkno,
503 mp->m_quotainfo->qi_dqchunklen, 0, &bp,
504 &xfs_dquot_buf_ops);
505 if (xfs_metadata_is_sick(error))
506 xfs_dquot_mark_sick(dqp);
507 if (error) {
508 ASSERT(bp == NULL);
509 return error;
510 }
511
512 ASSERT(xfs_buf_islocked(bp));
513 xfs_buf_set_ref(bp, XFS_DQUOT_REF);
514 *bpp = bp;
515
516 return 0;
517}
518
519/* Allocate and initialize everything we need for an incore dquot. */
520STATIC struct xfs_dquot *
521xfs_dquot_alloc(
522 struct xfs_mount *mp,
523 xfs_dqid_t id,
524 xfs_dqtype_t type)
525{
526 struct xfs_dquot *dqp;
527
528 dqp = kmem_cache_zalloc(xfs_dquot_cache, GFP_KERNEL | __GFP_NOFAIL);
529
530 dqp->q_type = type;
531 dqp->q_id = id;
532 dqp->q_mount = mp;
533 INIT_LIST_HEAD(&dqp->q_lru);
534 mutex_init(&dqp->q_qlock);
535 init_waitqueue_head(&dqp->q_pinwait);
536 dqp->q_fileoffset = (xfs_fileoff_t)id / mp->m_quotainfo->qi_dqperchunk;
537 /*
538 * Offset of dquot in the (fixed sized) dquot chunk.
539 */
540 dqp->q_bufoffset = (id % mp->m_quotainfo->qi_dqperchunk) *
541 sizeof(struct xfs_dqblk);
542
543 /*
544 * Because we want to use a counting completion, complete
545 * the flush completion once to allow a single access to
546 * the flush completion without blocking.
547 */
548 init_completion(&dqp->q_flush);
549 complete(&dqp->q_flush);
550
551 /*
552 * Make sure group quotas have a different lock class than user
553 * quotas.
554 */
555 switch (type) {
556 case XFS_DQTYPE_USER:
557 /* uses the default lock class */
558 break;
559 case XFS_DQTYPE_GROUP:
560 lockdep_set_class(&dqp->q_qlock, &xfs_dquot_group_class);
561 break;
562 case XFS_DQTYPE_PROJ:
563 lockdep_set_class(&dqp->q_qlock, &xfs_dquot_project_class);
564 break;
565 default:
566 ASSERT(0);
567 break;
568 }
569
570 xfs_qm_dquot_logitem_init(dqp);
571
572 XFS_STATS_INC(mp, xs_qm_dquot);
573 return dqp;
574}
575
576/* Check the ondisk dquot's id and type match what the incore dquot expects. */
577static bool
578xfs_dquot_check_type(
579 struct xfs_dquot *dqp,
580 struct xfs_disk_dquot *ddqp)
581{
582 uint8_t ddqp_type;
583 uint8_t dqp_type;
584
585 ddqp_type = ddqp->d_type & XFS_DQTYPE_REC_MASK;
586 dqp_type = xfs_dquot_type(dqp);
587
588 if (be32_to_cpu(ddqp->d_id) != dqp->q_id)
589 return false;
590
591 /*
592 * V5 filesystems always expect an exact type match. V4 filesystems
593 * expect an exact match for user dquots and for non-root group and
594 * project dquots.
595 */
596 if (xfs_has_crc(dqp->q_mount) ||
597 dqp_type == XFS_DQTYPE_USER || dqp->q_id != 0)
598 return ddqp_type == dqp_type;
599
600 /*
601 * V4 filesystems support either group or project quotas, but not both
602 * at the same time. The non-user quota file can be switched between
603 * group and project quota uses depending on the mount options, which
604 * means that we can encounter the other type when we try to load quota
605 * defaults. Quotacheck will soon reset the entire quota file
606 * (including the root dquot) anyway, but don't log scary corruption
607 * reports to dmesg.
608 */
609 return ddqp_type == XFS_DQTYPE_GROUP || ddqp_type == XFS_DQTYPE_PROJ;
610}
611
612/* Copy the in-core quota fields in from the on-disk buffer. */
613STATIC int
614xfs_dquot_from_disk(
615 struct xfs_dquot *dqp,
616 struct xfs_buf *bp)
617{
618 struct xfs_dqblk *dqb = xfs_buf_offset(bp, dqp->q_bufoffset);
619 struct xfs_disk_dquot *ddqp = &dqb->dd_diskdq;
620
621 /*
622 * Ensure that we got the type and ID we were looking for.
623 * Everything else was checked by the dquot buffer verifier.
624 */
625 if (!xfs_dquot_check_type(dqp, ddqp)) {
626 xfs_alert_tag(bp->b_mount, XFS_PTAG_VERIFIER_ERROR,
627 "Metadata corruption detected at %pS, quota %u",
628 __this_address, dqp->q_id);
629 xfs_alert(bp->b_mount, "Unmount and run xfs_repair");
630 xfs_dquot_mark_sick(dqp);
631 return -EFSCORRUPTED;
632 }
633
634 /* copy everything from disk dquot to the incore dquot */
635 dqp->q_type = ddqp->d_type;
636 dqp->q_blk.hardlimit = be64_to_cpu(ddqp->d_blk_hardlimit);
637 dqp->q_blk.softlimit = be64_to_cpu(ddqp->d_blk_softlimit);
638 dqp->q_ino.hardlimit = be64_to_cpu(ddqp->d_ino_hardlimit);
639 dqp->q_ino.softlimit = be64_to_cpu(ddqp->d_ino_softlimit);
640 dqp->q_rtb.hardlimit = be64_to_cpu(ddqp->d_rtb_hardlimit);
641 dqp->q_rtb.softlimit = be64_to_cpu(ddqp->d_rtb_softlimit);
642
643 dqp->q_blk.count = be64_to_cpu(ddqp->d_bcount);
644 dqp->q_ino.count = be64_to_cpu(ddqp->d_icount);
645 dqp->q_rtb.count = be64_to_cpu(ddqp->d_rtbcount);
646
647 dqp->q_blk.timer = xfs_dquot_from_disk_ts(ddqp, ddqp->d_btimer);
648 dqp->q_ino.timer = xfs_dquot_from_disk_ts(ddqp, ddqp->d_itimer);
649 dqp->q_rtb.timer = xfs_dquot_from_disk_ts(ddqp, ddqp->d_rtbtimer);
650
651 /*
652 * Reservation counters are defined as reservation plus current usage
653 * to avoid having to add every time.
654 */
655 dqp->q_blk.reserved = dqp->q_blk.count;
656 dqp->q_ino.reserved = dqp->q_ino.count;
657 dqp->q_rtb.reserved = dqp->q_rtb.count;
658
659 /* initialize the dquot speculative prealloc thresholds */
660 xfs_dquot_set_prealloc_limits(dqp);
661 return 0;
662}
663
664/* Copy the in-core quota fields into the on-disk buffer. */
665void
666xfs_dquot_to_disk(
667 struct xfs_disk_dquot *ddqp,
668 struct xfs_dquot *dqp)
669{
670 ddqp->d_magic = cpu_to_be16(XFS_DQUOT_MAGIC);
671 ddqp->d_version = XFS_DQUOT_VERSION;
672 ddqp->d_type = dqp->q_type;
673 ddqp->d_id = cpu_to_be32(dqp->q_id);
674 ddqp->d_pad0 = 0;
675 ddqp->d_pad = 0;
676
677 ddqp->d_blk_hardlimit = cpu_to_be64(dqp->q_blk.hardlimit);
678 ddqp->d_blk_softlimit = cpu_to_be64(dqp->q_blk.softlimit);
679 ddqp->d_ino_hardlimit = cpu_to_be64(dqp->q_ino.hardlimit);
680 ddqp->d_ino_softlimit = cpu_to_be64(dqp->q_ino.softlimit);
681 ddqp->d_rtb_hardlimit = cpu_to_be64(dqp->q_rtb.hardlimit);
682 ddqp->d_rtb_softlimit = cpu_to_be64(dqp->q_rtb.softlimit);
683
684 ddqp->d_bcount = cpu_to_be64(dqp->q_blk.count);
685 ddqp->d_icount = cpu_to_be64(dqp->q_ino.count);
686 ddqp->d_rtbcount = cpu_to_be64(dqp->q_rtb.count);
687
688 ddqp->d_bwarns = 0;
689 ddqp->d_iwarns = 0;
690 ddqp->d_rtbwarns = 0;
691
692 ddqp->d_btimer = xfs_dquot_to_disk_ts(dqp, dqp->q_blk.timer);
693 ddqp->d_itimer = xfs_dquot_to_disk_ts(dqp, dqp->q_ino.timer);
694 ddqp->d_rtbtimer = xfs_dquot_to_disk_ts(dqp, dqp->q_rtb.timer);
695}
696
697/*
698 * Read in the ondisk dquot using dqtobp() then copy it to an incore version,
699 * and release the buffer immediately. If @can_alloc is true, fill any
700 * holes in the on-disk metadata.
701 */
702static int
703xfs_qm_dqread(
704 struct xfs_mount *mp,
705 xfs_dqid_t id,
706 xfs_dqtype_t type,
707 bool can_alloc,
708 struct xfs_dquot **dqpp)
709{
710 struct xfs_dquot *dqp;
711 struct xfs_buf *bp;
712 int error;
713
714 dqp = xfs_dquot_alloc(mp, id, type);
715 trace_xfs_dqread(dqp);
716
717 /* Try to read the buffer, allocating if necessary. */
718 error = xfs_dquot_disk_read(mp, dqp, &bp);
719 if (error == -ENOENT && can_alloc)
720 error = xfs_dquot_disk_alloc(dqp, &bp);
721 if (error)
722 goto err;
723
724 /*
725 * At this point we should have a clean locked buffer. Copy the data
726 * to the incore dquot and release the buffer since the incore dquot
727 * has its own locking protocol so we needn't tie up the buffer any
728 * further.
729 */
730 ASSERT(xfs_buf_islocked(bp));
731 error = xfs_dquot_from_disk(dqp, bp);
732 xfs_buf_relse(bp);
733 if (error)
734 goto err;
735
736 *dqpp = dqp;
737 return error;
738
739err:
740 trace_xfs_dqread_fail(dqp);
741 xfs_qm_dqdestroy(dqp);
742 *dqpp = NULL;
743 return error;
744}
745
746/*
747 * Advance to the next id in the current chunk, or if at the
748 * end of the chunk, skip ahead to first id in next allocated chunk
749 * using the SEEK_DATA interface.
750 */
751static int
752xfs_dq_get_next_id(
753 struct xfs_mount *mp,
754 xfs_dqtype_t type,
755 xfs_dqid_t *id)
756{
757 struct xfs_inode *quotip = xfs_quota_inode(mp, type);
758 xfs_dqid_t next_id = *id + 1; /* simple advance */
759 uint lock_flags;
760 struct xfs_bmbt_irec got;
761 struct xfs_iext_cursor cur;
762 xfs_fsblock_t start;
763 int error = 0;
764
765 /* If we'd wrap past the max ID, stop */
766 if (next_id < *id)
767 return -ENOENT;
768
769 /* If new ID is within the current chunk, advancing it sufficed */
770 if (next_id % mp->m_quotainfo->qi_dqperchunk) {
771 *id = next_id;
772 return 0;
773 }
774
775 /* Nope, next_id is now past the current chunk, so find the next one */
776 start = (xfs_fsblock_t)next_id / mp->m_quotainfo->qi_dqperchunk;
777
778 lock_flags = xfs_ilock_data_map_shared(quotip);
779 error = xfs_iread_extents(NULL, quotip, XFS_DATA_FORK);
780 if (error)
781 return error;
782
783 if (xfs_iext_lookup_extent(quotip, "ip->i_df, start, &cur, &got)) {
784 /* contiguous chunk, bump startoff for the id calculation */
785 if (got.br_startoff < start)
786 got.br_startoff = start;
787 *id = got.br_startoff * mp->m_quotainfo->qi_dqperchunk;
788 } else {
789 error = -ENOENT;
790 }
791
792 xfs_iunlock(quotip, lock_flags);
793
794 return error;
795}
796
797/*
798 * Look up the dquot in the in-core cache. If found, the dquot is returned
799 * locked and ready to go.
800 */
801static struct xfs_dquot *
802xfs_qm_dqget_cache_lookup(
803 struct xfs_mount *mp,
804 struct xfs_quotainfo *qi,
805 struct radix_tree_root *tree,
806 xfs_dqid_t id)
807{
808 struct xfs_dquot *dqp;
809
810restart:
811 mutex_lock(&qi->qi_tree_lock);
812 dqp = radix_tree_lookup(tree, id);
813 if (!dqp) {
814 mutex_unlock(&qi->qi_tree_lock);
815 XFS_STATS_INC(mp, xs_qm_dqcachemisses);
816 return NULL;
817 }
818
819 xfs_dqlock(dqp);
820 if (dqp->q_flags & XFS_DQFLAG_FREEING) {
821 xfs_dqunlock(dqp);
822 mutex_unlock(&qi->qi_tree_lock);
823 trace_xfs_dqget_freeing(dqp);
824 delay(1);
825 goto restart;
826 }
827
828 dqp->q_nrefs++;
829 mutex_unlock(&qi->qi_tree_lock);
830
831 trace_xfs_dqget_hit(dqp);
832 XFS_STATS_INC(mp, xs_qm_dqcachehits);
833 return dqp;
834}
835
836/*
837 * Try to insert a new dquot into the in-core cache. If an error occurs the
838 * caller should throw away the dquot and start over. Otherwise, the dquot
839 * is returned locked (and held by the cache) as if there had been a cache
840 * hit.
841 *
842 * The insert needs to be done under memalloc_nofs context because the radix
843 * tree can do memory allocation during insert. The qi->qi_tree_lock is taken in
844 * memory reclaim when freeing unused dquots, so we cannot have the radix tree
845 * node allocation recursing into filesystem reclaim whilst we hold the
846 * qi_tree_lock.
847 */
848static int
849xfs_qm_dqget_cache_insert(
850 struct xfs_mount *mp,
851 struct xfs_quotainfo *qi,
852 struct radix_tree_root *tree,
853 xfs_dqid_t id,
854 struct xfs_dquot *dqp)
855{
856 unsigned int nofs_flags;
857 int error;
858
859 nofs_flags = memalloc_nofs_save();
860 mutex_lock(&qi->qi_tree_lock);
861 error = radix_tree_insert(tree, id, dqp);
862 if (unlikely(error)) {
863 /* Duplicate found! Caller must try again. */
864 trace_xfs_dqget_dup(dqp);
865 goto out_unlock;
866 }
867
868 /* Return a locked dquot to the caller, with a reference taken. */
869 xfs_dqlock(dqp);
870 dqp->q_nrefs = 1;
871 qi->qi_dquots++;
872
873out_unlock:
874 mutex_unlock(&qi->qi_tree_lock);
875 memalloc_nofs_restore(nofs_flags);
876 return error;
877}
878
879/* Check our input parameters. */
880static int
881xfs_qm_dqget_checks(
882 struct xfs_mount *mp,
883 xfs_dqtype_t type)
884{
885 switch (type) {
886 case XFS_DQTYPE_USER:
887 if (!XFS_IS_UQUOTA_ON(mp))
888 return -ESRCH;
889 return 0;
890 case XFS_DQTYPE_GROUP:
891 if (!XFS_IS_GQUOTA_ON(mp))
892 return -ESRCH;
893 return 0;
894 case XFS_DQTYPE_PROJ:
895 if (!XFS_IS_PQUOTA_ON(mp))
896 return -ESRCH;
897 return 0;
898 default:
899 WARN_ON_ONCE(0);
900 return -EINVAL;
901 }
902}
903
904/*
905 * Given the file system, id, and type (UDQUOT/GDQUOT/PDQUOT), return a
906 * locked dquot, doing an allocation (if requested) as needed.
907 */
908int
909xfs_qm_dqget(
910 struct xfs_mount *mp,
911 xfs_dqid_t id,
912 xfs_dqtype_t type,
913 bool can_alloc,
914 struct xfs_dquot **O_dqpp)
915{
916 struct xfs_quotainfo *qi = mp->m_quotainfo;
917 struct radix_tree_root *tree = xfs_dquot_tree(qi, type);
918 struct xfs_dquot *dqp;
919 int error;
920
921 error = xfs_qm_dqget_checks(mp, type);
922 if (error)
923 return error;
924
925restart:
926 dqp = xfs_qm_dqget_cache_lookup(mp, qi, tree, id);
927 if (dqp) {
928 *O_dqpp = dqp;
929 return 0;
930 }
931
932 error = xfs_qm_dqread(mp, id, type, can_alloc, &dqp);
933 if (error)
934 return error;
935
936 error = xfs_qm_dqget_cache_insert(mp, qi, tree, id, dqp);
937 if (error) {
938 /*
939 * Duplicate found. Just throw away the new dquot and start
940 * over.
941 */
942 xfs_qm_dqdestroy(dqp);
943 XFS_STATS_INC(mp, xs_qm_dquot_dups);
944 goto restart;
945 }
946
947 trace_xfs_dqget_miss(dqp);
948 *O_dqpp = dqp;
949 return 0;
950}
951
952/*
953 * Given a dquot id and type, read and initialize a dquot from the on-disk
954 * metadata. This function is only for use during quota initialization so
955 * it ignores the dquot cache assuming that the dquot shrinker isn't set up.
956 * The caller is responsible for _qm_dqdestroy'ing the returned dquot.
957 */
958int
959xfs_qm_dqget_uncached(
960 struct xfs_mount *mp,
961 xfs_dqid_t id,
962 xfs_dqtype_t type,
963 struct xfs_dquot **dqpp)
964{
965 int error;
966
967 error = xfs_qm_dqget_checks(mp, type);
968 if (error)
969 return error;
970
971 return xfs_qm_dqread(mp, id, type, 0, dqpp);
972}
973
974/* Return the quota id for a given inode and type. */
975xfs_dqid_t
976xfs_qm_id_for_quotatype(
977 struct xfs_inode *ip,
978 xfs_dqtype_t type)
979{
980 switch (type) {
981 case XFS_DQTYPE_USER:
982 return i_uid_read(VFS_I(ip));
983 case XFS_DQTYPE_GROUP:
984 return i_gid_read(VFS_I(ip));
985 case XFS_DQTYPE_PROJ:
986 return ip->i_projid;
987 }
988 ASSERT(0);
989 return 0;
990}
991
992/*
993 * Return the dquot for a given inode and type. If @can_alloc is true, then
994 * allocate blocks if needed. The inode's ILOCK must be held and it must not
995 * have already had an inode attached.
996 */
997int
998xfs_qm_dqget_inode(
999 struct xfs_inode *ip,
1000 xfs_dqtype_t type,
1001 bool can_alloc,
1002 struct xfs_dquot **O_dqpp)
1003{
1004 struct xfs_mount *mp = ip->i_mount;
1005 struct xfs_quotainfo *qi = mp->m_quotainfo;
1006 struct radix_tree_root *tree = xfs_dquot_tree(qi, type);
1007 struct xfs_dquot *dqp;
1008 xfs_dqid_t id;
1009 int error;
1010
1011 error = xfs_qm_dqget_checks(mp, type);
1012 if (error)
1013 return error;
1014
1015 xfs_assert_ilocked(ip, XFS_ILOCK_EXCL);
1016 ASSERT(xfs_inode_dquot(ip, type) == NULL);
1017 ASSERT(!xfs_is_metadir_inode(ip));
1018
1019 id = xfs_qm_id_for_quotatype(ip, type);
1020
1021restart:
1022 dqp = xfs_qm_dqget_cache_lookup(mp, qi, tree, id);
1023 if (dqp) {
1024 *O_dqpp = dqp;
1025 return 0;
1026 }
1027
1028 /*
1029 * Dquot cache miss. We don't want to keep the inode lock across
1030 * a (potential) disk read. Also we don't want to deal with the lock
1031 * ordering between quotainode and this inode. OTOH, dropping the inode
1032 * lock here means dealing with a chown that can happen before
1033 * we re-acquire the lock.
1034 */
1035 xfs_iunlock(ip, XFS_ILOCK_EXCL);
1036 error = xfs_qm_dqread(mp, id, type, can_alloc, &dqp);
1037 xfs_ilock(ip, XFS_ILOCK_EXCL);
1038 if (error)
1039 return error;
1040
1041 /*
1042 * A dquot could be attached to this inode by now, since we had
1043 * dropped the ilock.
1044 */
1045 if (xfs_this_quota_on(mp, type)) {
1046 struct xfs_dquot *dqp1;
1047
1048 dqp1 = xfs_inode_dquot(ip, type);
1049 if (dqp1) {
1050 xfs_qm_dqdestroy(dqp);
1051 dqp = dqp1;
1052 xfs_dqlock(dqp);
1053 goto dqret;
1054 }
1055 } else {
1056 /* inode stays locked on return */
1057 xfs_qm_dqdestroy(dqp);
1058 return -ESRCH;
1059 }
1060
1061 error = xfs_qm_dqget_cache_insert(mp, qi, tree, id, dqp);
1062 if (error) {
1063 /*
1064 * Duplicate found. Just throw away the new dquot and start
1065 * over.
1066 */
1067 xfs_qm_dqdestroy(dqp);
1068 XFS_STATS_INC(mp, xs_qm_dquot_dups);
1069 goto restart;
1070 }
1071
1072dqret:
1073 xfs_assert_ilocked(ip, XFS_ILOCK_EXCL);
1074 trace_xfs_dqget_miss(dqp);
1075 *O_dqpp = dqp;
1076 return 0;
1077}
1078
1079/*
1080 * Starting at @id and progressing upwards, look for an initialized incore
1081 * dquot, lock it, and return it.
1082 */
1083int
1084xfs_qm_dqget_next(
1085 struct xfs_mount *mp,
1086 xfs_dqid_t id,
1087 xfs_dqtype_t type,
1088 struct xfs_dquot **dqpp)
1089{
1090 struct xfs_dquot *dqp;
1091 int error = 0;
1092
1093 *dqpp = NULL;
1094 for (; !error; error = xfs_dq_get_next_id(mp, type, &id)) {
1095 error = xfs_qm_dqget(mp, id, type, false, &dqp);
1096 if (error == -ENOENT)
1097 continue;
1098 else if (error != 0)
1099 break;
1100
1101 if (!XFS_IS_DQUOT_UNINITIALIZED(dqp)) {
1102 *dqpp = dqp;
1103 return 0;
1104 }
1105
1106 xfs_qm_dqput(dqp);
1107 }
1108
1109 return error;
1110}
1111
1112/*
1113 * Release a reference to the dquot (decrement ref-count) and unlock it.
1114 *
1115 * If there is a group quota attached to this dquot, carefully release that
1116 * too without tripping over deadlocks'n'stuff.
1117 */
1118void
1119xfs_qm_dqput(
1120 struct xfs_dquot *dqp)
1121{
1122 ASSERT(dqp->q_nrefs > 0);
1123 ASSERT(XFS_DQ_IS_LOCKED(dqp));
1124
1125 trace_xfs_dqput(dqp);
1126
1127 if (--dqp->q_nrefs == 0) {
1128 struct xfs_quotainfo *qi = dqp->q_mount->m_quotainfo;
1129 trace_xfs_dqput_free(dqp);
1130
1131 if (list_lru_add_obj(&qi->qi_lru, &dqp->q_lru))
1132 XFS_STATS_INC(dqp->q_mount, xs_qm_dquot_unused);
1133 }
1134 xfs_dqunlock(dqp);
1135}
1136
1137/*
1138 * Release a dquot. Flush it if dirty, then dqput() it.
1139 * dquot must not be locked.
1140 */
1141void
1142xfs_qm_dqrele(
1143 struct xfs_dquot *dqp)
1144{
1145 if (!dqp)
1146 return;
1147
1148 trace_xfs_dqrele(dqp);
1149
1150 xfs_dqlock(dqp);
1151 /*
1152 * We don't care to flush it if the dquot is dirty here.
1153 * That will create stutters that we want to avoid.
1154 * Instead we do a delayed write when we try to reclaim
1155 * a dirty dquot. Also xfs_sync will take part of the burden...
1156 */
1157 xfs_qm_dqput(dqp);
1158}
1159
1160/*
1161 * This is the dquot flushing I/O completion routine. It is called
1162 * from interrupt level when the buffer containing the dquot is
1163 * flushed to disk. It is responsible for removing the dquot logitem
1164 * from the AIL if it has not been re-logged, and unlocking the dquot's
1165 * flush lock. This behavior is very similar to that of inodes..
1166 */
1167static void
1168xfs_qm_dqflush_done(
1169 struct xfs_log_item *lip)
1170{
1171 struct xfs_dq_logitem *qlip =
1172 container_of(lip, struct xfs_dq_logitem, qli_item);
1173 struct xfs_dquot *dqp = qlip->qli_dquot;
1174 struct xfs_ail *ailp = lip->li_ailp;
1175 struct xfs_buf *bp = NULL;
1176 xfs_lsn_t tail_lsn;
1177
1178 /*
1179 * We only want to pull the item from the AIL if its
1180 * location in the log has not changed since we started the flush.
1181 * Thus, we only bother if the dquot's lsn has
1182 * not changed. First we check the lsn outside the lock
1183 * since it's cheaper, and then we recheck while
1184 * holding the lock before removing the dquot from the AIL.
1185 */
1186 if (test_bit(XFS_LI_IN_AIL, &lip->li_flags) &&
1187 (lip->li_lsn == qlip->qli_flush_lsn ||
1188 test_bit(XFS_LI_FAILED, &lip->li_flags))) {
1189
1190 spin_lock(&ailp->ail_lock);
1191 xfs_clear_li_failed(lip);
1192 if (lip->li_lsn == qlip->qli_flush_lsn) {
1193 /* xfs_ail_update_finish() drops the AIL lock */
1194 tail_lsn = xfs_ail_delete_one(ailp, lip);
1195 xfs_ail_update_finish(ailp, tail_lsn);
1196 } else {
1197 spin_unlock(&ailp->ail_lock);
1198 }
1199 }
1200
1201 /*
1202 * If this dquot hasn't been dirtied since initiating the last dqflush,
1203 * release the buffer reference. We already unlinked this dquot item
1204 * from the buffer.
1205 */
1206 spin_lock(&qlip->qli_lock);
1207 if (!qlip->qli_dirty) {
1208 bp = lip->li_buf;
1209 lip->li_buf = NULL;
1210 }
1211 spin_unlock(&qlip->qli_lock);
1212 if (bp)
1213 xfs_buf_rele(bp);
1214
1215 /*
1216 * Release the dq's flush lock since we're done with it.
1217 */
1218 xfs_dqfunlock(dqp);
1219}
1220
1221void
1222xfs_buf_dquot_iodone(
1223 struct xfs_buf *bp)
1224{
1225 struct xfs_log_item *lip, *n;
1226
1227 list_for_each_entry_safe(lip, n, &bp->b_li_list, li_bio_list) {
1228 list_del_init(&lip->li_bio_list);
1229 xfs_qm_dqflush_done(lip);
1230 }
1231}
1232
1233void
1234xfs_buf_dquot_io_fail(
1235 struct xfs_buf *bp)
1236{
1237 struct xfs_log_item *lip;
1238
1239 spin_lock(&bp->b_mount->m_ail->ail_lock);
1240 list_for_each_entry(lip, &bp->b_li_list, li_bio_list)
1241 set_bit(XFS_LI_FAILED, &lip->li_flags);
1242 spin_unlock(&bp->b_mount->m_ail->ail_lock);
1243}
1244
1245/* Check incore dquot for errors before we flush. */
1246static xfs_failaddr_t
1247xfs_qm_dqflush_check(
1248 struct xfs_dquot *dqp)
1249{
1250 xfs_dqtype_t type = xfs_dquot_type(dqp);
1251
1252 if (type != XFS_DQTYPE_USER &&
1253 type != XFS_DQTYPE_GROUP &&
1254 type != XFS_DQTYPE_PROJ)
1255 return __this_address;
1256
1257 if (dqp->q_id == 0)
1258 return NULL;
1259
1260 if (dqp->q_blk.softlimit && dqp->q_blk.count > dqp->q_blk.softlimit &&
1261 !dqp->q_blk.timer)
1262 return __this_address;
1263
1264 if (dqp->q_ino.softlimit && dqp->q_ino.count > dqp->q_ino.softlimit &&
1265 !dqp->q_ino.timer)
1266 return __this_address;
1267
1268 if (dqp->q_rtb.softlimit && dqp->q_rtb.count > dqp->q_rtb.softlimit &&
1269 !dqp->q_rtb.timer)
1270 return __this_address;
1271
1272 /* bigtime flag should never be set on root dquots */
1273 if (dqp->q_type & XFS_DQTYPE_BIGTIME) {
1274 if (!xfs_has_bigtime(dqp->q_mount))
1275 return __this_address;
1276 if (dqp->q_id == 0)
1277 return __this_address;
1278 }
1279
1280 return NULL;
1281}
1282
1283/*
1284 * Get the buffer containing the on-disk dquot.
1285 *
1286 * Requires dquot flush lock, will clear the dirty flag, delete the quota log
1287 * item from the AIL, and shut down the system if something goes wrong.
1288 */
1289static int
1290xfs_dquot_read_buf(
1291 struct xfs_trans *tp,
1292 struct xfs_dquot *dqp,
1293 struct xfs_buf **bpp)
1294{
1295 struct xfs_mount *mp = dqp->q_mount;
1296 struct xfs_buf *bp = NULL;
1297 int error;
1298
1299 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, dqp->q_blkno,
1300 mp->m_quotainfo->qi_dqchunklen, 0,
1301 &bp, &xfs_dquot_buf_ops);
1302 if (xfs_metadata_is_sick(error))
1303 xfs_dquot_mark_sick(dqp);
1304 if (error)
1305 goto out_abort;
1306
1307 *bpp = bp;
1308 return 0;
1309
1310out_abort:
1311 dqp->q_flags &= ~XFS_DQFLAG_DIRTY;
1312 xfs_trans_ail_delete(&dqp->q_logitem.qli_item, 0);
1313 xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE);
1314 return error;
1315}
1316
1317/*
1318 * Attach a dquot buffer to this dquot to avoid allocating a buffer during a
1319 * dqflush, since dqflush can be called from reclaim context. Caller must hold
1320 * the dqlock.
1321 */
1322int
1323xfs_dquot_attach_buf(
1324 struct xfs_trans *tp,
1325 struct xfs_dquot *dqp)
1326{
1327 struct xfs_dq_logitem *qlip = &dqp->q_logitem;
1328 struct xfs_log_item *lip = &qlip->qli_item;
1329 int error;
1330
1331 spin_lock(&qlip->qli_lock);
1332 if (!lip->li_buf) {
1333 struct xfs_buf *bp = NULL;
1334
1335 spin_unlock(&qlip->qli_lock);
1336 error = xfs_dquot_read_buf(tp, dqp, &bp);
1337 if (error)
1338 return error;
1339
1340 /*
1341 * Hold the dquot buffer so that we retain our ref to it after
1342 * detaching it from the transaction, then give that ref to the
1343 * dquot log item so that the AIL does not have to read the
1344 * dquot buffer to push this item.
1345 */
1346 xfs_buf_hold(bp);
1347 xfs_trans_brelse(tp, bp);
1348
1349 spin_lock(&qlip->qli_lock);
1350 lip->li_buf = bp;
1351 }
1352 qlip->qli_dirty = true;
1353 spin_unlock(&qlip->qli_lock);
1354
1355 return 0;
1356}
1357
1358/*
1359 * Get a new reference the dquot buffer attached to this dquot for a dqflush
1360 * operation.
1361 *
1362 * Returns 0 and a NULL bp if none was attached to the dquot; 0 and a locked
1363 * bp; or -EAGAIN if the buffer could not be locked.
1364 */
1365int
1366xfs_dquot_use_attached_buf(
1367 struct xfs_dquot *dqp,
1368 struct xfs_buf **bpp)
1369{
1370 struct xfs_buf *bp = dqp->q_logitem.qli_item.li_buf;
1371
1372 /*
1373 * A NULL buffer can happen if the dquot dirty flag was set but the
1374 * filesystem shut down before transaction commit happened. In that
1375 * case we're not going to flush anyway.
1376 */
1377 if (!bp) {
1378 ASSERT(xfs_is_shutdown(dqp->q_mount));
1379
1380 *bpp = NULL;
1381 return 0;
1382 }
1383
1384 if (!xfs_buf_trylock(bp))
1385 return -EAGAIN;
1386
1387 xfs_buf_hold(bp);
1388 *bpp = bp;
1389 return 0;
1390}
1391
1392/*
1393 * Write a modified dquot to disk.
1394 * The dquot must be locked and the flush lock too taken by caller.
1395 * The flush lock will not be unlocked until the dquot reaches the disk,
1396 * but the dquot is free to be unlocked and modified by the caller
1397 * in the interim. Dquot is still locked on return. This behavior is
1398 * identical to that of inodes.
1399 */
1400int
1401xfs_qm_dqflush(
1402 struct xfs_dquot *dqp,
1403 struct xfs_buf *bp)
1404{
1405 struct xfs_mount *mp = dqp->q_mount;
1406 struct xfs_dq_logitem *qlip = &dqp->q_logitem;
1407 struct xfs_log_item *lip = &qlip->qli_item;
1408 struct xfs_dqblk *dqblk;
1409 xfs_failaddr_t fa;
1410 int error;
1411
1412 ASSERT(XFS_DQ_IS_LOCKED(dqp));
1413 ASSERT(!completion_done(&dqp->q_flush));
1414
1415 trace_xfs_dqflush(dqp);
1416
1417 xfs_qm_dqunpin_wait(dqp);
1418
1419 fa = xfs_qm_dqflush_check(dqp);
1420 if (fa) {
1421 xfs_alert(mp, "corrupt dquot ID 0x%x in memory at %pS",
1422 dqp->q_id, fa);
1423 xfs_dquot_mark_sick(dqp);
1424 error = -EFSCORRUPTED;
1425 goto out_abort;
1426 }
1427
1428 /* Flush the incore dquot to the ondisk buffer. */
1429 dqblk = xfs_buf_offset(bp, dqp->q_bufoffset);
1430 xfs_dquot_to_disk(&dqblk->dd_diskdq, dqp);
1431
1432 /*
1433 * Clear the dirty field and remember the flush lsn for later use.
1434 */
1435 dqp->q_flags &= ~XFS_DQFLAG_DIRTY;
1436
1437 /*
1438 * We hold the dquot lock, so nobody can dirty it while we're
1439 * scheduling the write out. Clear the dirty-since-flush flag.
1440 */
1441 spin_lock(&qlip->qli_lock);
1442 qlip->qli_dirty = false;
1443 spin_unlock(&qlip->qli_lock);
1444
1445 xfs_trans_ail_copy_lsn(mp->m_ail, &qlip->qli_flush_lsn, &lip->li_lsn);
1446
1447 /*
1448 * copy the lsn into the on-disk dquot now while we have the in memory
1449 * dquot here. This can't be done later in the write verifier as we
1450 * can't get access to the log item at that point in time.
1451 *
1452 * We also calculate the CRC here so that the on-disk dquot in the
1453 * buffer always has a valid CRC. This ensures there is no possibility
1454 * of a dquot without an up-to-date CRC getting to disk.
1455 */
1456 if (xfs_has_crc(mp)) {
1457 dqblk->dd_lsn = cpu_to_be64(lip->li_lsn);
1458 xfs_update_cksum((char *)dqblk, sizeof(struct xfs_dqblk),
1459 XFS_DQUOT_CRC_OFF);
1460 }
1461
1462 /*
1463 * Attach the dquot to the buffer so that we can remove this dquot from
1464 * the AIL and release the flush lock once the dquot is synced to disk.
1465 */
1466 bp->b_flags |= _XBF_DQUOTS;
1467 list_add_tail(&lip->li_bio_list, &bp->b_li_list);
1468
1469 /*
1470 * If the buffer is pinned then push on the log so we won't
1471 * get stuck waiting in the write for too long.
1472 */
1473 if (xfs_buf_ispinned(bp)) {
1474 trace_xfs_dqflush_force(dqp);
1475 xfs_log_force(mp, 0);
1476 }
1477
1478 trace_xfs_dqflush_done(dqp);
1479 return 0;
1480
1481out_abort:
1482 dqp->q_flags &= ~XFS_DQFLAG_DIRTY;
1483 xfs_trans_ail_delete(lip, 0);
1484 xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE);
1485 xfs_dqfunlock(dqp);
1486 return error;
1487}
1488
1489/*
1490 * Lock two xfs_dquot structures.
1491 *
1492 * To avoid deadlocks we always lock the quota structure with
1493 * the lowerd id first.
1494 */
1495void
1496xfs_dqlock2(
1497 struct xfs_dquot *d1,
1498 struct xfs_dquot *d2)
1499{
1500 if (d1 && d2) {
1501 ASSERT(d1 != d2);
1502 if (d1->q_id > d2->q_id) {
1503 mutex_lock(&d2->q_qlock);
1504 mutex_lock_nested(&d1->q_qlock, XFS_QLOCK_NESTED);
1505 } else {
1506 mutex_lock(&d1->q_qlock);
1507 mutex_lock_nested(&d2->q_qlock, XFS_QLOCK_NESTED);
1508 }
1509 } else if (d1) {
1510 mutex_lock(&d1->q_qlock);
1511 } else if (d2) {
1512 mutex_lock(&d2->q_qlock);
1513 }
1514}
1515
1516static int
1517xfs_dqtrx_cmp(
1518 const void *a,
1519 const void *b)
1520{
1521 const struct xfs_dqtrx *qa = a;
1522 const struct xfs_dqtrx *qb = b;
1523
1524 if (qa->qt_dquot->q_id > qb->qt_dquot->q_id)
1525 return 1;
1526 if (qa->qt_dquot->q_id < qb->qt_dquot->q_id)
1527 return -1;
1528 return 0;
1529}
1530
1531void
1532xfs_dqlockn(
1533 struct xfs_dqtrx *q)
1534{
1535 unsigned int i;
1536
1537 BUILD_BUG_ON(XFS_QM_TRANS_MAXDQS > MAX_LOCKDEP_SUBCLASSES);
1538
1539 /* Sort in order of dquot id, do not allow duplicates */
1540 for (i = 0; i < XFS_QM_TRANS_MAXDQS && q[i].qt_dquot != NULL; i++) {
1541 unsigned int j;
1542
1543 for (j = 0; j < i; j++)
1544 ASSERT(q[i].qt_dquot != q[j].qt_dquot);
1545 }
1546 if (i == 0)
1547 return;
1548
1549 sort(q, i, sizeof(struct xfs_dqtrx), xfs_dqtrx_cmp, NULL);
1550
1551 mutex_lock(&q[0].qt_dquot->q_qlock);
1552 for (i = 1; i < XFS_QM_TRANS_MAXDQS && q[i].qt_dquot != NULL; i++)
1553 mutex_lock_nested(&q[i].qt_dquot->q_qlock,
1554 XFS_QLOCK_NESTED + i - 1);
1555}
1556
1557int __init
1558xfs_qm_init(void)
1559{
1560 xfs_dquot_cache = kmem_cache_create("xfs_dquot",
1561 sizeof(struct xfs_dquot),
1562 0, 0, NULL);
1563 if (!xfs_dquot_cache)
1564 goto out;
1565
1566 xfs_dqtrx_cache = kmem_cache_create("xfs_dqtrx",
1567 sizeof(struct xfs_dquot_acct),
1568 0, 0, NULL);
1569 if (!xfs_dqtrx_cache)
1570 goto out_free_dquot_cache;
1571
1572 return 0;
1573
1574out_free_dquot_cache:
1575 kmem_cache_destroy(xfs_dquot_cache);
1576out:
1577 return -ENOMEM;
1578}
1579
1580void
1581xfs_qm_exit(void)
1582{
1583 kmem_cache_destroy(xfs_dqtrx_cache);
1584 kmem_cache_destroy(xfs_dquot_cache);
1585}