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