xfs: get quota inode from mp & flags rather than dqp
[deliverable/linux.git] / fs / xfs / xfs_dquot.c
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
56 xfs_buftarg_t *xfs_dqerror_target;
57 int xfs_do_dqerror;
58 int xfs_dqreq_num;
59 int xfs_dqerror_mod = 33;
60 #endif
61
62 struct kmem_zone *xfs_qm_dqtrxzone;
63 static struct kmem_zone *xfs_qm_dqzone;
64
65 static struct lock_class_key xfs_dquot_group_class;
66 static struct lock_class_key xfs_dquot_project_class;
67
68 /*
69 * This is called to free all the memory associated with a dquot
70 */
71 void
72 xfs_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 */
88 void
89 xfs_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 int prealloc = 0;
96
97 ASSERT(d->d_id);
98
99 if (q->qi_bsoftlimit && !d->d_blk_softlimit) {
100 d->d_blk_softlimit = cpu_to_be64(q->qi_bsoftlimit);
101 prealloc = 1;
102 }
103 if (q->qi_bhardlimit && !d->d_blk_hardlimit) {
104 d->d_blk_hardlimit = cpu_to_be64(q->qi_bhardlimit);
105 prealloc = 1;
106 }
107 if (q->qi_isoftlimit && !d->d_ino_softlimit)
108 d->d_ino_softlimit = cpu_to_be64(q->qi_isoftlimit);
109 if (q->qi_ihardlimit && !d->d_ino_hardlimit)
110 d->d_ino_hardlimit = cpu_to_be64(q->qi_ihardlimit);
111 if (q->qi_rtbsoftlimit && !d->d_rtb_softlimit)
112 d->d_rtb_softlimit = cpu_to_be64(q->qi_rtbsoftlimit);
113 if (q->qi_rtbhardlimit && !d->d_rtb_hardlimit)
114 d->d_rtb_hardlimit = cpu_to_be64(q->qi_rtbhardlimit);
115
116 if (prealloc)
117 xfs_dquot_set_prealloc_limits(dq);
118 }
119
120 /*
121 * Check the limits and timers of a dquot and start or reset timers
122 * if necessary.
123 * This gets called even when quota enforcement is OFF, which makes our
124 * life a little less complicated. (We just don't reject any quota
125 * reservations in that case, when enforcement is off).
126 * We also return 0 as the values of the timers in Q_GETQUOTA calls, when
127 * enforcement's off.
128 * In contrast, warnings are a little different in that they don't
129 * 'automatically' get started when limits get exceeded. They do
130 * get reset to zero, however, when we find the count to be under
131 * the soft limit (they are only ever set non-zero via userspace).
132 */
133 void
134 xfs_qm_adjust_dqtimers(
135 xfs_mount_t *mp,
136 xfs_disk_dquot_t *d)
137 {
138 ASSERT(d->d_id);
139
140 #ifdef DEBUG
141 if (d->d_blk_hardlimit)
142 ASSERT(be64_to_cpu(d->d_blk_softlimit) <=
143 be64_to_cpu(d->d_blk_hardlimit));
144 if (d->d_ino_hardlimit)
145 ASSERT(be64_to_cpu(d->d_ino_softlimit) <=
146 be64_to_cpu(d->d_ino_hardlimit));
147 if (d->d_rtb_hardlimit)
148 ASSERT(be64_to_cpu(d->d_rtb_softlimit) <=
149 be64_to_cpu(d->d_rtb_hardlimit));
150 #endif
151
152 if (!d->d_btimer) {
153 if ((d->d_blk_softlimit &&
154 (be64_to_cpu(d->d_bcount) >
155 be64_to_cpu(d->d_blk_softlimit))) ||
156 (d->d_blk_hardlimit &&
157 (be64_to_cpu(d->d_bcount) >
158 be64_to_cpu(d->d_blk_hardlimit)))) {
159 d->d_btimer = cpu_to_be32(get_seconds() +
160 mp->m_quotainfo->qi_btimelimit);
161 } else {
162 d->d_bwarns = 0;
163 }
164 } else {
165 if ((!d->d_blk_softlimit ||
166 (be64_to_cpu(d->d_bcount) <=
167 be64_to_cpu(d->d_blk_softlimit))) &&
168 (!d->d_blk_hardlimit ||
169 (be64_to_cpu(d->d_bcount) <=
170 be64_to_cpu(d->d_blk_hardlimit)))) {
171 d->d_btimer = 0;
172 }
173 }
174
175 if (!d->d_itimer) {
176 if ((d->d_ino_softlimit &&
177 (be64_to_cpu(d->d_icount) >
178 be64_to_cpu(d->d_ino_softlimit))) ||
179 (d->d_ino_hardlimit &&
180 (be64_to_cpu(d->d_icount) >
181 be64_to_cpu(d->d_ino_hardlimit)))) {
182 d->d_itimer = cpu_to_be32(get_seconds() +
183 mp->m_quotainfo->qi_itimelimit);
184 } else {
185 d->d_iwarns = 0;
186 }
187 } else {
188 if ((!d->d_ino_softlimit ||
189 (be64_to_cpu(d->d_icount) <=
190 be64_to_cpu(d->d_ino_softlimit))) &&
191 (!d->d_ino_hardlimit ||
192 (be64_to_cpu(d->d_icount) <=
193 be64_to_cpu(d->d_ino_hardlimit)))) {
194 d->d_itimer = 0;
195 }
196 }
197
198 if (!d->d_rtbtimer) {
199 if ((d->d_rtb_softlimit &&
200 (be64_to_cpu(d->d_rtbcount) >
201 be64_to_cpu(d->d_rtb_softlimit))) ||
202 (d->d_rtb_hardlimit &&
203 (be64_to_cpu(d->d_rtbcount) >
204 be64_to_cpu(d->d_rtb_hardlimit)))) {
205 d->d_rtbtimer = cpu_to_be32(get_seconds() +
206 mp->m_quotainfo->qi_rtbtimelimit);
207 } else {
208 d->d_rtbwarns = 0;
209 }
210 } else {
211 if ((!d->d_rtb_softlimit ||
212 (be64_to_cpu(d->d_rtbcount) <=
213 be64_to_cpu(d->d_rtb_softlimit))) &&
214 (!d->d_rtb_hardlimit ||
215 (be64_to_cpu(d->d_rtbcount) <=
216 be64_to_cpu(d->d_rtb_hardlimit)))) {
217 d->d_rtbtimer = 0;
218 }
219 }
220 }
221
222 /*
223 * initialize a buffer full of dquots and log the whole thing
224 */
225 STATIC void
226 xfs_qm_init_dquot_blk(
227 xfs_trans_t *tp,
228 xfs_mount_t *mp,
229 xfs_dqid_t id,
230 uint type,
231 xfs_buf_t *bp)
232 {
233 struct xfs_quotainfo *q = mp->m_quotainfo;
234 xfs_dqblk_t *d;
235 xfs_dqid_t curid;
236 int i;
237
238 ASSERT(tp);
239 ASSERT(xfs_buf_islocked(bp));
240
241 d = bp->b_addr;
242
243 /*
244 * ID of the first dquot in the block - id's are zero based.
245 */
246 curid = id - (id % q->qi_dqperchunk);
247 memset(d, 0, BBTOB(q->qi_dqchunklen));
248 for (i = 0; i < q->qi_dqperchunk; i++, d++, curid++) {
249 d->dd_diskdq.d_magic = cpu_to_be16(XFS_DQUOT_MAGIC);
250 d->dd_diskdq.d_version = XFS_DQUOT_VERSION;
251 d->dd_diskdq.d_id = cpu_to_be32(curid);
252 d->dd_diskdq.d_flags = type;
253 if (xfs_sb_version_hascrc(&mp->m_sb)) {
254 uuid_copy(&d->dd_uuid, &mp->m_sb.sb_meta_uuid);
255 xfs_update_cksum((char *)d, sizeof(struct xfs_dqblk),
256 XFS_DQUOT_CRC_OFF);
257 }
258 }
259
260 xfs_trans_dquot_buf(tp, bp,
261 (type & XFS_DQ_USER ? XFS_BLF_UDQUOT_BUF :
262 ((type & XFS_DQ_PROJ) ? XFS_BLF_PDQUOT_BUF :
263 XFS_BLF_GDQUOT_BUF)));
264 xfs_trans_log_buf(tp, bp, 0, BBTOB(q->qi_dqchunklen) - 1);
265 }
266
267 /*
268 * Initialize the dynamic speculative preallocation thresholds. The lo/hi
269 * watermarks correspond to the soft and hard limits by default. If a soft limit
270 * is not specified, we use 95% of the hard limit.
271 */
272 void
273 xfs_dquot_set_prealloc_limits(struct xfs_dquot *dqp)
274 {
275 __uint64_t space;
276
277 dqp->q_prealloc_hi_wmark = be64_to_cpu(dqp->q_core.d_blk_hardlimit);
278 dqp->q_prealloc_lo_wmark = be64_to_cpu(dqp->q_core.d_blk_softlimit);
279 if (!dqp->q_prealloc_lo_wmark) {
280 dqp->q_prealloc_lo_wmark = dqp->q_prealloc_hi_wmark;
281 do_div(dqp->q_prealloc_lo_wmark, 100);
282 dqp->q_prealloc_lo_wmark *= 95;
283 }
284
285 space = dqp->q_prealloc_hi_wmark;
286
287 do_div(space, 100);
288 dqp->q_low_space[XFS_QLOWSP_1_PCNT] = space;
289 dqp->q_low_space[XFS_QLOWSP_3_PCNT] = space * 3;
290 dqp->q_low_space[XFS_QLOWSP_5_PCNT] = space * 5;
291 }
292
293 /*
294 * Allocate a block and fill it with dquots.
295 * This is called when the bmapi finds a hole.
296 */
297 STATIC int
298 xfs_qm_dqalloc(
299 xfs_trans_t **tpp,
300 xfs_mount_t *mp,
301 xfs_dquot_t *dqp,
302 xfs_inode_t *quotip,
303 xfs_fileoff_t offset_fsb,
304 xfs_buf_t **O_bpp)
305 {
306 xfs_fsblock_t firstblock;
307 xfs_bmap_free_t flist;
308 xfs_bmbt_irec_t map;
309 int nmaps, error;
310 xfs_buf_t *bp;
311 xfs_trans_t *tp = *tpp;
312
313 ASSERT(tp != NULL);
314
315 trace_xfs_dqalloc(dqp);
316
317 /*
318 * Initialize the bmap freelist prior to calling bmapi code.
319 */
320 xfs_bmap_init(&flist, &firstblock);
321 xfs_ilock(quotip, XFS_ILOCK_EXCL);
322 /*
323 * Return if this type of quotas is turned off while we didn't
324 * have an inode lock
325 */
326 if (!xfs_this_quota_on(dqp->q_mount, dqp->dq_flags)) {
327 xfs_iunlock(quotip, XFS_ILOCK_EXCL);
328 return -ESRCH;
329 }
330
331 xfs_trans_ijoin(tp, quotip, XFS_ILOCK_EXCL);
332 nmaps = 1;
333 error = xfs_bmapi_write(tp, quotip, offset_fsb,
334 XFS_DQUOT_CLUSTER_SIZE_FSB, XFS_BMAPI_METADATA,
335 &firstblock, XFS_QM_DQALLOC_SPACE_RES(mp),
336 &map, &nmaps, &flist);
337 if (error)
338 goto error0;
339 ASSERT(map.br_blockcount == XFS_DQUOT_CLUSTER_SIZE_FSB);
340 ASSERT(nmaps == 1);
341 ASSERT((map.br_startblock != DELAYSTARTBLOCK) &&
342 (map.br_startblock != HOLESTARTBLOCK));
343
344 /*
345 * Keep track of the blkno to save a lookup later
346 */
347 dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock);
348
349 /* now we can just get the buffer (there's nothing to read yet) */
350 bp = xfs_trans_get_buf(tp, mp->m_ddev_targp,
351 dqp->q_blkno,
352 mp->m_quotainfo->qi_dqchunklen,
353 0);
354 if (!bp) {
355 error = -ENOMEM;
356 goto error1;
357 }
358 bp->b_ops = &xfs_dquot_buf_ops;
359
360 /*
361 * Make a chunk of dquots out of this buffer and log
362 * the entire thing.
363 */
364 xfs_qm_init_dquot_blk(tp, mp, be32_to_cpu(dqp->q_core.d_id),
365 dqp->dq_flags & XFS_DQ_ALLTYPES, bp);
366
367 /*
368 * xfs_bmap_finish() may commit the current transaction and
369 * start a second transaction if the freelist is not empty.
370 *
371 * Since we still want to modify this buffer, we need to
372 * ensure that the buffer is not released on commit of
373 * the first transaction and ensure the buffer is added to the
374 * second transaction.
375 *
376 * If there is only one transaction then don't stop the buffer
377 * from being released when it commits later on.
378 */
379
380 xfs_trans_bhold(tp, bp);
381
382 error = xfs_bmap_finish(tpp, &flist, NULL);
383 if (error)
384 goto error1;
385
386 /* Transaction was committed? */
387 if (*tpp != tp) {
388 tp = *tpp;
389 xfs_trans_bjoin(tp, bp);
390 } else {
391 xfs_trans_bhold_release(tp, bp);
392 }
393
394 *O_bpp = bp;
395 return 0;
396
397 error1:
398 xfs_bmap_cancel(&flist);
399 error0:
400 xfs_iunlock(quotip, XFS_ILOCK_EXCL);
401
402 return error;
403 }
404
405 STATIC int
406 xfs_qm_dqrepair(
407 struct xfs_mount *mp,
408 struct xfs_trans *tp,
409 struct xfs_dquot *dqp,
410 xfs_dqid_t firstid,
411 struct xfs_buf **bpp)
412 {
413 int error;
414 struct xfs_disk_dquot *ddq;
415 struct xfs_dqblk *d;
416 int i;
417
418 /*
419 * Read the buffer without verification so we get the corrupted
420 * buffer returned to us. make sure we verify it on write, though.
421 */
422 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, dqp->q_blkno,
423 mp->m_quotainfo->qi_dqchunklen,
424 0, bpp, NULL);
425
426 if (error) {
427 ASSERT(*bpp == NULL);
428 return error;
429 }
430 (*bpp)->b_ops = &xfs_dquot_buf_ops;
431
432 ASSERT(xfs_buf_islocked(*bpp));
433 d = (struct xfs_dqblk *)(*bpp)->b_addr;
434
435 /* Do the actual repair of dquots in this buffer */
436 for (i = 0; i < mp->m_quotainfo->qi_dqperchunk; i++) {
437 ddq = &d[i].dd_diskdq;
438 error = xfs_dqcheck(mp, ddq, firstid + i,
439 dqp->dq_flags & XFS_DQ_ALLTYPES,
440 XFS_QMOPT_DQREPAIR, "xfs_qm_dqrepair");
441 if (error) {
442 /* repair failed, we're screwed */
443 xfs_trans_brelse(tp, *bpp);
444 return -EIO;
445 }
446 }
447
448 return 0;
449 }
450
451 /*
452 * Maps a dquot to the buffer containing its on-disk version.
453 * This returns a ptr to the buffer containing the on-disk dquot
454 * in the bpp param, and a ptr to the on-disk dquot within that buffer
455 */
456 STATIC int
457 xfs_qm_dqtobp(
458 xfs_trans_t **tpp,
459 xfs_dquot_t *dqp,
460 xfs_disk_dquot_t **O_ddpp,
461 xfs_buf_t **O_bpp,
462 uint flags)
463 {
464 struct xfs_bmbt_irec map;
465 int nmaps = 1, error;
466 struct xfs_buf *bp;
467 struct xfs_inode *quotip;
468 struct xfs_mount *mp = dqp->q_mount;
469 xfs_dqid_t id = be32_to_cpu(dqp->q_core.d_id);
470 struct xfs_trans *tp = (tpp ? *tpp : NULL);
471 uint lock_mode;
472
473 quotip = xfs_quota_inode(dqp->q_mount, dqp->dq_flags);
474 dqp->q_fileoffset = (xfs_fileoff_t)id / mp->m_quotainfo->qi_dqperchunk;
475
476 lock_mode = xfs_ilock_data_map_shared(quotip);
477 if (!xfs_this_quota_on(dqp->q_mount, dqp->dq_flags)) {
478 /*
479 * Return if this type of quotas is turned off while we
480 * didn't have the quota inode lock.
481 */
482 xfs_iunlock(quotip, lock_mode);
483 return -ESRCH;
484 }
485
486 /*
487 * Find the block map; no allocations yet
488 */
489 error = xfs_bmapi_read(quotip, dqp->q_fileoffset,
490 XFS_DQUOT_CLUSTER_SIZE_FSB, &map, &nmaps, 0);
491
492 xfs_iunlock(quotip, lock_mode);
493 if (error)
494 return error;
495
496 ASSERT(nmaps == 1);
497 ASSERT(map.br_blockcount == 1);
498
499 /*
500 * Offset of dquot in the (fixed sized) dquot chunk.
501 */
502 dqp->q_bufoffset = (id % mp->m_quotainfo->qi_dqperchunk) *
503 sizeof(xfs_dqblk_t);
504
505 ASSERT(map.br_startblock != DELAYSTARTBLOCK);
506 if (map.br_startblock == HOLESTARTBLOCK) {
507 /*
508 * We don't allocate unless we're asked to
509 */
510 if (!(flags & XFS_QMOPT_DQALLOC))
511 return -ENOENT;
512
513 ASSERT(tp);
514 error = xfs_qm_dqalloc(tpp, mp, dqp, quotip,
515 dqp->q_fileoffset, &bp);
516 if (error)
517 return error;
518 tp = *tpp;
519 } else {
520 trace_xfs_dqtobp_read(dqp);
521
522 /*
523 * store the blkno etc so that we don't have to do the
524 * mapping all the time
525 */
526 dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock);
527
528 error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp,
529 dqp->q_blkno,
530 mp->m_quotainfo->qi_dqchunklen,
531 0, &bp, &xfs_dquot_buf_ops);
532
533 if (error == -EFSCORRUPTED && (flags & XFS_QMOPT_DQREPAIR)) {
534 xfs_dqid_t firstid = (xfs_dqid_t)map.br_startoff *
535 mp->m_quotainfo->qi_dqperchunk;
536 ASSERT(bp == NULL);
537 error = xfs_qm_dqrepair(mp, tp, dqp, firstid, &bp);
538 }
539
540 if (error) {
541 ASSERT(bp == NULL);
542 return error;
543 }
544 }
545
546 ASSERT(xfs_buf_islocked(bp));
547 *O_bpp = bp;
548 *O_ddpp = bp->b_addr + dqp->q_bufoffset;
549
550 return 0;
551 }
552
553
554 /*
555 * Read in the ondisk dquot using dqtobp() then copy it to an incore version,
556 * and release the buffer immediately.
557 *
558 * If XFS_QMOPT_DQALLOC is set, allocate a dquot on disk if it needed.
559 */
560 int
561 xfs_qm_dqread(
562 struct xfs_mount *mp,
563 xfs_dqid_t id,
564 uint type,
565 uint flags,
566 struct xfs_dquot **O_dqpp)
567 {
568 struct xfs_dquot *dqp;
569 struct xfs_disk_dquot *ddqp;
570 struct xfs_buf *bp;
571 struct xfs_trans *tp = NULL;
572 int error;
573
574 dqp = kmem_zone_zalloc(xfs_qm_dqzone, KM_SLEEP);
575
576 dqp->dq_flags = type;
577 dqp->q_core.d_id = cpu_to_be32(id);
578 dqp->q_mount = mp;
579 INIT_LIST_HEAD(&dqp->q_lru);
580 mutex_init(&dqp->q_qlock);
581 init_waitqueue_head(&dqp->q_pinwait);
582
583 /*
584 * Because we want to use a counting completion, complete
585 * the flush completion once to allow a single access to
586 * the flush completion without blocking.
587 */
588 init_completion(&dqp->q_flush);
589 complete(&dqp->q_flush);
590
591 /*
592 * Make sure group quotas have a different lock class than user
593 * quotas.
594 */
595 switch (type) {
596 case XFS_DQ_USER:
597 /* uses the default lock class */
598 break;
599 case XFS_DQ_GROUP:
600 lockdep_set_class(&dqp->q_qlock, &xfs_dquot_group_class);
601 break;
602 case XFS_DQ_PROJ:
603 lockdep_set_class(&dqp->q_qlock, &xfs_dquot_project_class);
604 break;
605 default:
606 ASSERT(0);
607 break;
608 }
609
610 XFS_STATS_INC(mp, xs_qm_dquot);
611
612 trace_xfs_dqread(dqp);
613
614 if (flags & XFS_QMOPT_DQALLOC) {
615 tp = xfs_trans_alloc(mp, XFS_TRANS_QM_DQALLOC);
616 error = xfs_trans_reserve(tp, &M_RES(mp)->tr_qm_dqalloc,
617 XFS_QM_DQALLOC_SPACE_RES(mp), 0);
618 if (error)
619 goto error1;
620 }
621
622 /*
623 * get a pointer to the on-disk dquot and the buffer containing it
624 * dqp already knows its own type (GROUP/USER).
625 */
626 error = xfs_qm_dqtobp(&tp, dqp, &ddqp, &bp, flags);
627 if (error) {
628 /*
629 * This can happen if quotas got turned off (ESRCH),
630 * or if the dquot didn't exist on disk and we ask to
631 * allocate (ENOENT).
632 */
633 trace_xfs_dqread_fail(dqp);
634 goto error1;
635 }
636
637 /* copy everything from disk dquot to the incore dquot */
638 memcpy(&dqp->q_core, ddqp, sizeof(xfs_disk_dquot_t));
639 xfs_qm_dquot_logitem_init(dqp);
640
641 /*
642 * Reservation counters are defined as reservation plus current usage
643 * to avoid having to add every time.
644 */
645 dqp->q_res_bcount = be64_to_cpu(ddqp->d_bcount);
646 dqp->q_res_icount = be64_to_cpu(ddqp->d_icount);
647 dqp->q_res_rtbcount = be64_to_cpu(ddqp->d_rtbcount);
648
649 /* initialize the dquot speculative prealloc thresholds */
650 xfs_dquot_set_prealloc_limits(dqp);
651
652 /* Mark the buf so that this will stay incore a little longer */
653 xfs_buf_set_ref(bp, XFS_DQUOT_REF);
654
655 /*
656 * We got the buffer with a xfs_trans_read_buf() (in dqtobp())
657 * So we need to release with xfs_trans_brelse().
658 * The strategy here is identical to that of inodes; we lock
659 * the dquot in xfs_qm_dqget() before making it accessible to
660 * others. This is because dquots, like inodes, need a good level of
661 * concurrency, and we don't want to take locks on the entire buffers
662 * for dquot accesses.
663 * Note also that the dquot buffer may even be dirty at this point, if
664 * this particular dquot was repaired. We still aren't afraid to
665 * brelse it because we have the changes incore.
666 */
667 ASSERT(xfs_buf_islocked(bp));
668 xfs_trans_brelse(tp, bp);
669
670 if (tp) {
671 error = xfs_trans_commit(tp);
672 if (error)
673 goto error0;
674 }
675
676 *O_dqpp = dqp;
677 return error;
678
679 error1:
680 if (tp)
681 xfs_trans_cancel(tp);
682 error0:
683 xfs_qm_dqdestroy(dqp);
684 *O_dqpp = NULL;
685 return error;
686 }
687
688 /*
689 * Given the file system, inode OR id, and type (UDQUOT/GDQUOT), return a
690 * a locked dquot, doing an allocation (if requested) as needed.
691 * When both an inode and an id are given, the inode's id takes precedence.
692 * That is, if the id changes while we don't hold the ilock inside this
693 * function, the new dquot is returned, not necessarily the one requested
694 * in the id argument.
695 */
696 int
697 xfs_qm_dqget(
698 xfs_mount_t *mp,
699 xfs_inode_t *ip, /* locked inode (optional) */
700 xfs_dqid_t id, /* uid/projid/gid depending on type */
701 uint type, /* XFS_DQ_USER/XFS_DQ_PROJ/XFS_DQ_GROUP */
702 uint flags, /* DQALLOC, DQSUSER, DQREPAIR, DOWARN */
703 xfs_dquot_t **O_dqpp) /* OUT : locked incore dquot */
704 {
705 struct xfs_quotainfo *qi = mp->m_quotainfo;
706 struct radix_tree_root *tree = xfs_dquot_tree(qi, type);
707 struct xfs_dquot *dqp;
708 int error;
709
710 ASSERT(XFS_IS_QUOTA_RUNNING(mp));
711 if ((! XFS_IS_UQUOTA_ON(mp) && type == XFS_DQ_USER) ||
712 (! XFS_IS_PQUOTA_ON(mp) && type == XFS_DQ_PROJ) ||
713 (! XFS_IS_GQUOTA_ON(mp) && type == XFS_DQ_GROUP)) {
714 return -ESRCH;
715 }
716
717 #ifdef DEBUG
718 if (xfs_do_dqerror) {
719 if ((xfs_dqerror_target == mp->m_ddev_targp) &&
720 (xfs_dqreq_num++ % xfs_dqerror_mod) == 0) {
721 xfs_debug(mp, "Returning error in dqget");
722 return -EIO;
723 }
724 }
725
726 ASSERT(type == XFS_DQ_USER ||
727 type == XFS_DQ_PROJ ||
728 type == XFS_DQ_GROUP);
729 if (ip) {
730 ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
731 ASSERT(xfs_inode_dquot(ip, type) == NULL);
732 }
733 #endif
734
735 restart:
736 mutex_lock(&qi->qi_tree_lock);
737 dqp = radix_tree_lookup(tree, id);
738 if (dqp) {
739 xfs_dqlock(dqp);
740 if (dqp->dq_flags & XFS_DQ_FREEING) {
741 xfs_dqunlock(dqp);
742 mutex_unlock(&qi->qi_tree_lock);
743 trace_xfs_dqget_freeing(dqp);
744 delay(1);
745 goto restart;
746 }
747
748 dqp->q_nrefs++;
749 mutex_unlock(&qi->qi_tree_lock);
750
751 trace_xfs_dqget_hit(dqp);
752 XFS_STATS_INC(mp, xs_qm_dqcachehits);
753 *O_dqpp = dqp;
754 return 0;
755 }
756 mutex_unlock(&qi->qi_tree_lock);
757 XFS_STATS_INC(mp, xs_qm_dqcachemisses);
758
759 /*
760 * Dquot cache miss. We don't want to keep the inode lock across
761 * a (potential) disk read. Also we don't want to deal with the lock
762 * ordering between quotainode and this inode. OTOH, dropping the inode
763 * lock here means dealing with a chown that can happen before
764 * we re-acquire the lock.
765 */
766 if (ip)
767 xfs_iunlock(ip, XFS_ILOCK_EXCL);
768
769 error = xfs_qm_dqread(mp, id, type, flags, &dqp);
770
771 if (ip)
772 xfs_ilock(ip, XFS_ILOCK_EXCL);
773
774 if (error)
775 return error;
776
777 if (ip) {
778 /*
779 * A dquot could be attached to this inode by now, since
780 * we had dropped the ilock.
781 */
782 if (xfs_this_quota_on(mp, type)) {
783 struct xfs_dquot *dqp1;
784
785 dqp1 = xfs_inode_dquot(ip, type);
786 if (dqp1) {
787 xfs_qm_dqdestroy(dqp);
788 dqp = dqp1;
789 xfs_dqlock(dqp);
790 goto dqret;
791 }
792 } else {
793 /* inode stays locked on return */
794 xfs_qm_dqdestroy(dqp);
795 return -ESRCH;
796 }
797 }
798
799 mutex_lock(&qi->qi_tree_lock);
800 error = radix_tree_insert(tree, id, dqp);
801 if (unlikely(error)) {
802 WARN_ON(error != -EEXIST);
803
804 /*
805 * Duplicate found. Just throw away the new dquot and start
806 * over.
807 */
808 mutex_unlock(&qi->qi_tree_lock);
809 trace_xfs_dqget_dup(dqp);
810 xfs_qm_dqdestroy(dqp);
811 XFS_STATS_INC(mp, xs_qm_dquot_dups);
812 goto restart;
813 }
814
815 /*
816 * We return a locked dquot to the caller, with a reference taken
817 */
818 xfs_dqlock(dqp);
819 dqp->q_nrefs = 1;
820
821 qi->qi_dquots++;
822 mutex_unlock(&qi->qi_tree_lock);
823
824 dqret:
825 ASSERT((ip == NULL) || xfs_isilocked(ip, XFS_ILOCK_EXCL));
826 trace_xfs_dqget_miss(dqp);
827 *O_dqpp = dqp;
828 return 0;
829 }
830
831 /*
832 * Release a reference to the dquot (decrement ref-count) and unlock it.
833 *
834 * If there is a group quota attached to this dquot, carefully release that
835 * too without tripping over deadlocks'n'stuff.
836 */
837 void
838 xfs_qm_dqput(
839 struct xfs_dquot *dqp)
840 {
841 ASSERT(dqp->q_nrefs > 0);
842 ASSERT(XFS_DQ_IS_LOCKED(dqp));
843
844 trace_xfs_dqput(dqp);
845
846 if (--dqp->q_nrefs == 0) {
847 struct xfs_quotainfo *qi = dqp->q_mount->m_quotainfo;
848 trace_xfs_dqput_free(dqp);
849
850 if (list_lru_add(&qi->qi_lru, &dqp->q_lru))
851 XFS_STATS_INC(dqp->q_mount, xs_qm_dquot_unused);
852 }
853 xfs_dqunlock(dqp);
854 }
855
856 /*
857 * Release a dquot. Flush it if dirty, then dqput() it.
858 * dquot must not be locked.
859 */
860 void
861 xfs_qm_dqrele(
862 xfs_dquot_t *dqp)
863 {
864 if (!dqp)
865 return;
866
867 trace_xfs_dqrele(dqp);
868
869 xfs_dqlock(dqp);
870 /*
871 * We don't care to flush it if the dquot is dirty here.
872 * That will create stutters that we want to avoid.
873 * Instead we do a delayed write when we try to reclaim
874 * a dirty dquot. Also xfs_sync will take part of the burden...
875 */
876 xfs_qm_dqput(dqp);
877 }
878
879 /*
880 * This is the dquot flushing I/O completion routine. It is called
881 * from interrupt level when the buffer containing the dquot is
882 * flushed to disk. It is responsible for removing the dquot logitem
883 * from the AIL if it has not been re-logged, and unlocking the dquot's
884 * flush lock. This behavior is very similar to that of inodes..
885 */
886 STATIC void
887 xfs_qm_dqflush_done(
888 struct xfs_buf *bp,
889 struct xfs_log_item *lip)
890 {
891 xfs_dq_logitem_t *qip = (struct xfs_dq_logitem *)lip;
892 xfs_dquot_t *dqp = qip->qli_dquot;
893 struct xfs_ail *ailp = lip->li_ailp;
894
895 /*
896 * We only want to pull the item from the AIL if its
897 * location in the log has not changed since we started the flush.
898 * Thus, we only bother if the dquot's lsn has
899 * not changed. First we check the lsn outside the lock
900 * since it's cheaper, and then we recheck while
901 * holding the lock before removing the dquot from the AIL.
902 */
903 if ((lip->li_flags & XFS_LI_IN_AIL) &&
904 lip->li_lsn == qip->qli_flush_lsn) {
905
906 /* xfs_trans_ail_delete() drops the AIL lock. */
907 spin_lock(&ailp->xa_lock);
908 if (lip->li_lsn == qip->qli_flush_lsn)
909 xfs_trans_ail_delete(ailp, lip, SHUTDOWN_CORRUPT_INCORE);
910 else
911 spin_unlock(&ailp->xa_lock);
912 }
913
914 /*
915 * Release the dq's flush lock since we're done with it.
916 */
917 xfs_dqfunlock(dqp);
918 }
919
920 /*
921 * Write a modified dquot to disk.
922 * The dquot must be locked and the flush lock too taken by caller.
923 * The flush lock will not be unlocked until the dquot reaches the disk,
924 * but the dquot is free to be unlocked and modified by the caller
925 * in the interim. Dquot is still locked on return. This behavior is
926 * identical to that of inodes.
927 */
928 int
929 xfs_qm_dqflush(
930 struct xfs_dquot *dqp,
931 struct xfs_buf **bpp)
932 {
933 struct xfs_mount *mp = dqp->q_mount;
934 struct xfs_buf *bp;
935 struct xfs_disk_dquot *ddqp;
936 int error;
937
938 ASSERT(XFS_DQ_IS_LOCKED(dqp));
939 ASSERT(!completion_done(&dqp->q_flush));
940
941 trace_xfs_dqflush(dqp);
942
943 *bpp = NULL;
944
945 xfs_qm_dqunpin_wait(dqp);
946
947 /*
948 * This may have been unpinned because the filesystem is shutting
949 * down forcibly. If that's the case we must not write this dquot
950 * to disk, because the log record didn't make it to disk.
951 *
952 * We also have to remove the log item from the AIL in this case,
953 * as we wait for an emptry AIL as part of the unmount process.
954 */
955 if (XFS_FORCED_SHUTDOWN(mp)) {
956 struct xfs_log_item *lip = &dqp->q_logitem.qli_item;
957 dqp->dq_flags &= ~XFS_DQ_DIRTY;
958
959 xfs_trans_ail_remove(lip, SHUTDOWN_CORRUPT_INCORE);
960
961 error = -EIO;
962 goto out_unlock;
963 }
964
965 /*
966 * Get the buffer containing the on-disk dquot
967 */
968 error = xfs_trans_read_buf(mp, NULL, mp->m_ddev_targp, dqp->q_blkno,
969 mp->m_quotainfo->qi_dqchunklen, 0, &bp,
970 &xfs_dquot_buf_ops);
971 if (error)
972 goto out_unlock;
973
974 /*
975 * Calculate the location of the dquot inside the buffer.
976 */
977 ddqp = bp->b_addr + dqp->q_bufoffset;
978
979 /*
980 * A simple sanity check in case we got a corrupted dquot..
981 */
982 error = xfs_dqcheck(mp, &dqp->q_core, be32_to_cpu(ddqp->d_id), 0,
983 XFS_QMOPT_DOWARN, "dqflush (incore copy)");
984 if (error) {
985 xfs_buf_relse(bp);
986 xfs_dqfunlock(dqp);
987 xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE);
988 return -EIO;
989 }
990
991 /* This is the only portion of data that needs to persist */
992 memcpy(ddqp, &dqp->q_core, sizeof(xfs_disk_dquot_t));
993
994 /*
995 * Clear the dirty field and remember the flush lsn for later use.
996 */
997 dqp->dq_flags &= ~XFS_DQ_DIRTY;
998
999 xfs_trans_ail_copy_lsn(mp->m_ail, &dqp->q_logitem.qli_flush_lsn,
1000 &dqp->q_logitem.qli_item.li_lsn);
1001
1002 /*
1003 * copy the lsn into the on-disk dquot now while we have the in memory
1004 * dquot here. This can't be done later in the write verifier as we
1005 * can't get access to the log item at that point in time.
1006 *
1007 * We also calculate the CRC here so that the on-disk dquot in the
1008 * buffer always has a valid CRC. This ensures there is no possibility
1009 * of a dquot without an up-to-date CRC getting to disk.
1010 */
1011 if (xfs_sb_version_hascrc(&mp->m_sb)) {
1012 struct xfs_dqblk *dqb = (struct xfs_dqblk *)ddqp;
1013
1014 dqb->dd_lsn = cpu_to_be64(dqp->q_logitem.qli_item.li_lsn);
1015 xfs_update_cksum((char *)dqb, sizeof(struct xfs_dqblk),
1016 XFS_DQUOT_CRC_OFF);
1017 }
1018
1019 /*
1020 * Attach an iodone routine so that we can remove this dquot from the
1021 * AIL and release the flush lock once the dquot is synced to disk.
1022 */
1023 xfs_buf_attach_iodone(bp, xfs_qm_dqflush_done,
1024 &dqp->q_logitem.qli_item);
1025
1026 /*
1027 * If the buffer is pinned then push on the log so we won't
1028 * get stuck waiting in the write for too long.
1029 */
1030 if (xfs_buf_ispinned(bp)) {
1031 trace_xfs_dqflush_force(dqp);
1032 xfs_log_force(mp, 0);
1033 }
1034
1035 trace_xfs_dqflush_done(dqp);
1036 *bpp = bp;
1037 return 0;
1038
1039 out_unlock:
1040 xfs_dqfunlock(dqp);
1041 return -EIO;
1042 }
1043
1044 /*
1045 * Lock two xfs_dquot structures.
1046 *
1047 * To avoid deadlocks we always lock the quota structure with
1048 * the lowerd id first.
1049 */
1050 void
1051 xfs_dqlock2(
1052 xfs_dquot_t *d1,
1053 xfs_dquot_t *d2)
1054 {
1055 if (d1 && d2) {
1056 ASSERT(d1 != d2);
1057 if (be32_to_cpu(d1->q_core.d_id) >
1058 be32_to_cpu(d2->q_core.d_id)) {
1059 mutex_lock(&d2->q_qlock);
1060 mutex_lock_nested(&d1->q_qlock, XFS_QLOCK_NESTED);
1061 } else {
1062 mutex_lock(&d1->q_qlock);
1063 mutex_lock_nested(&d2->q_qlock, XFS_QLOCK_NESTED);
1064 }
1065 } else if (d1) {
1066 mutex_lock(&d1->q_qlock);
1067 } else if (d2) {
1068 mutex_lock(&d2->q_qlock);
1069 }
1070 }
1071
1072 int __init
1073 xfs_qm_init(void)
1074 {
1075 xfs_qm_dqzone =
1076 kmem_zone_init(sizeof(struct xfs_dquot), "xfs_dquot");
1077 if (!xfs_qm_dqzone)
1078 goto out;
1079
1080 xfs_qm_dqtrxzone =
1081 kmem_zone_init(sizeof(struct xfs_dquot_acct), "xfs_dqtrx");
1082 if (!xfs_qm_dqtrxzone)
1083 goto out_free_dqzone;
1084
1085 return 0;
1086
1087 out_free_dqzone:
1088 kmem_zone_destroy(xfs_qm_dqzone);
1089 out:
1090 return -ENOMEM;
1091 }
1092
1093 void
1094 xfs_qm_exit(void)
1095 {
1096 kmem_zone_destroy(xfs_qm_dqtrxzone);
1097 kmem_zone_destroy(xfs_qm_dqzone);
1098 }
This page took 0.053304 seconds and 5 git commands to generate.