Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
4ce3121f NS |
2 | * Copyright (c) 2000-2003 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
1da177e4 | 4 | * |
4ce3121f NS |
5 | * This program is free software; you can redistribute it and/or |
6 | * modify it under the terms of the GNU General Public License as | |
1da177e4 LT |
7 | * published by the Free Software Foundation. |
8 | * | |
4ce3121f NS |
9 | * This program is distributed in the hope that it would be useful, |
10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
12 | * GNU General Public License for more details. | |
1da177e4 | 13 | * |
4ce3121f NS |
14 | * You should have received a copy of the GNU General Public License |
15 | * along with this program; if not, write the Free Software Foundation, | |
16 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
1da177e4 | 17 | */ |
1da177e4 LT |
18 | #include "xfs.h" |
19 | #include "xfs_fs.h" | |
a844f451 | 20 | #include "xfs_bit.h" |
1da177e4 | 21 | #include "xfs_log.h" |
a844f451 | 22 | #include "xfs_inum.h" |
1da177e4 LT |
23 | #include "xfs_trans.h" |
24 | #include "xfs_sb.h" | |
25 | #include "xfs_ag.h" | |
1da177e4 | 26 | #include "xfs_alloc.h" |
1da177e4 LT |
27 | #include "xfs_quota.h" |
28 | #include "xfs_mount.h" | |
1da177e4 | 29 | #include "xfs_bmap_btree.h" |
1da177e4 LT |
30 | #include "xfs_inode.h" |
31 | #include "xfs_bmap.h" | |
1da177e4 LT |
32 | #include "xfs_rtalloc.h" |
33 | #include "xfs_error.h" | |
34 | #include "xfs_itable.h" | |
1da177e4 LT |
35 | #include "xfs_attr.h" |
36 | #include "xfs_buf_item.h" | |
37 | #include "xfs_trans_space.h" | |
38 | #include "xfs_trans_priv.h" | |
1da177e4 | 39 | #include "xfs_qm.h" |
0b1b213f | 40 | #include "xfs_trace.h" |
1da177e4 | 41 | |
1da177e4 | 42 | /* |
bf72de31 CH |
43 | * Lock order: |
44 | * | |
45 | * ip->i_lock | |
9f920f11 | 46 | * qi->qi_tree_lock |
b84a3a96 CH |
47 | * dquot->q_qlock (xfs_dqlock() and friends) |
48 | * dquot->q_flush (xfs_dqflock() and friends) | |
49 | * qi->qi_lru_lock | |
bf72de31 CH |
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 | */ | |
1da177e4 | 54 | |
1da177e4 LT |
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 | ||
98b8c7a0 CH |
62 | static struct lock_class_key xfs_dquot_other_class; |
63 | ||
1da177e4 LT |
64 | /* |
65 | * This is called to free all the memory associated with a dquot | |
66 | */ | |
67 | void | |
68 | xfs_qm_dqdestroy( | |
69 | xfs_dquot_t *dqp) | |
70 | { | |
f8739c3c | 71 | ASSERT(list_empty(&dqp->q_lru)); |
1da177e4 LT |
72 | |
73 | mutex_destroy(&dqp->q_qlock); | |
1da177e4 | 74 | kmem_zone_free(xfs_Gqm->qm_dqzone, dqp); |
0b1b213f | 75 | |
48776fd2 | 76 | XFS_STATS_DEC(xs_qm_dquot); |
1da177e4 LT |
77 | } |
78 | ||
1da177e4 LT |
79 | /* |
80 | * If default limits are in force, push them into the dquot now. | |
81 | * We overwrite the dquot limits only if they are zero and this | |
82 | * is not the root dquot. | |
83 | */ | |
84 | void | |
85 | xfs_qm_adjust_dqlimits( | |
86 | xfs_mount_t *mp, | |
87 | xfs_disk_dquot_t *d) | |
88 | { | |
89 | xfs_quotainfo_t *q = mp->m_quotainfo; | |
90 | ||
91 | ASSERT(d->d_id); | |
92 | ||
93 | if (q->qi_bsoftlimit && !d->d_blk_softlimit) | |
1149d96a | 94 | d->d_blk_softlimit = cpu_to_be64(q->qi_bsoftlimit); |
1da177e4 | 95 | if (q->qi_bhardlimit && !d->d_blk_hardlimit) |
1149d96a | 96 | d->d_blk_hardlimit = cpu_to_be64(q->qi_bhardlimit); |
1da177e4 | 97 | if (q->qi_isoftlimit && !d->d_ino_softlimit) |
1149d96a | 98 | d->d_ino_softlimit = cpu_to_be64(q->qi_isoftlimit); |
1da177e4 | 99 | if (q->qi_ihardlimit && !d->d_ino_hardlimit) |
1149d96a | 100 | d->d_ino_hardlimit = cpu_to_be64(q->qi_ihardlimit); |
1da177e4 | 101 | if (q->qi_rtbsoftlimit && !d->d_rtb_softlimit) |
1149d96a | 102 | d->d_rtb_softlimit = cpu_to_be64(q->qi_rtbsoftlimit); |
1da177e4 | 103 | if (q->qi_rtbhardlimit && !d->d_rtb_hardlimit) |
1149d96a | 104 | d->d_rtb_hardlimit = cpu_to_be64(q->qi_rtbhardlimit); |
1da177e4 LT |
105 | } |
106 | ||
107 | /* | |
108 | * Check the limits and timers of a dquot and start or reset timers | |
109 | * if necessary. | |
110 | * This gets called even when quota enforcement is OFF, which makes our | |
111 | * life a little less complicated. (We just don't reject any quota | |
112 | * reservations in that case, when enforcement is off). | |
113 | * We also return 0 as the values of the timers in Q_GETQUOTA calls, when | |
114 | * enforcement's off. | |
115 | * In contrast, warnings are a little different in that they don't | |
754002b4 NS |
116 | * 'automatically' get started when limits get exceeded. They do |
117 | * get reset to zero, however, when we find the count to be under | |
118 | * the soft limit (they are only ever set non-zero via userspace). | |
1da177e4 LT |
119 | */ |
120 | void | |
121 | xfs_qm_adjust_dqtimers( | |
122 | xfs_mount_t *mp, | |
123 | xfs_disk_dquot_t *d) | |
124 | { | |
125 | ASSERT(d->d_id); | |
126 | ||
ea15ab3c | 127 | #ifdef DEBUG |
1149d96a CH |
128 | if (d->d_blk_hardlimit) |
129 | ASSERT(be64_to_cpu(d->d_blk_softlimit) <= | |
130 | be64_to_cpu(d->d_blk_hardlimit)); | |
131 | if (d->d_ino_hardlimit) | |
132 | ASSERT(be64_to_cpu(d->d_ino_softlimit) <= | |
133 | be64_to_cpu(d->d_ino_hardlimit)); | |
134 | if (d->d_rtb_hardlimit) | |
135 | ASSERT(be64_to_cpu(d->d_rtb_softlimit) <= | |
136 | be64_to_cpu(d->d_rtb_hardlimit)); | |
1da177e4 | 137 | #endif |
ea15ab3c | 138 | |
1da177e4 | 139 | if (!d->d_btimer) { |
1149d96a | 140 | if ((d->d_blk_softlimit && |
d0a3fe67 | 141 | (be64_to_cpu(d->d_bcount) > |
1149d96a CH |
142 | be64_to_cpu(d->d_blk_softlimit))) || |
143 | (d->d_blk_hardlimit && | |
d0a3fe67 | 144 | (be64_to_cpu(d->d_bcount) > |
1149d96a CH |
145 | be64_to_cpu(d->d_blk_hardlimit)))) { |
146 | d->d_btimer = cpu_to_be32(get_seconds() + | |
8a7b8a89 | 147 | mp->m_quotainfo->qi_btimelimit); |
754002b4 NS |
148 | } else { |
149 | d->d_bwarns = 0; | |
1da177e4 LT |
150 | } |
151 | } else { | |
152 | if ((!d->d_blk_softlimit || | |
d0a3fe67 | 153 | (be64_to_cpu(d->d_bcount) <= |
1149d96a | 154 | be64_to_cpu(d->d_blk_softlimit))) && |
1da177e4 | 155 | (!d->d_blk_hardlimit || |
d0a3fe67 | 156 | (be64_to_cpu(d->d_bcount) <= |
1149d96a | 157 | be64_to_cpu(d->d_blk_hardlimit)))) { |
1da177e4 LT |
158 | d->d_btimer = 0; |
159 | } | |
160 | } | |
161 | ||
162 | if (!d->d_itimer) { | |
1149d96a | 163 | if ((d->d_ino_softlimit && |
d0a3fe67 | 164 | (be64_to_cpu(d->d_icount) > |
1149d96a CH |
165 | be64_to_cpu(d->d_ino_softlimit))) || |
166 | (d->d_ino_hardlimit && | |
d0a3fe67 | 167 | (be64_to_cpu(d->d_icount) > |
1149d96a CH |
168 | be64_to_cpu(d->d_ino_hardlimit)))) { |
169 | d->d_itimer = cpu_to_be32(get_seconds() + | |
8a7b8a89 | 170 | mp->m_quotainfo->qi_itimelimit); |
754002b4 NS |
171 | } else { |
172 | d->d_iwarns = 0; | |
1da177e4 LT |
173 | } |
174 | } else { | |
175 | if ((!d->d_ino_softlimit || | |
d0a3fe67 | 176 | (be64_to_cpu(d->d_icount) <= |
1149d96a | 177 | be64_to_cpu(d->d_ino_softlimit))) && |
1da177e4 | 178 | (!d->d_ino_hardlimit || |
d0a3fe67 | 179 | (be64_to_cpu(d->d_icount) <= |
1149d96a | 180 | be64_to_cpu(d->d_ino_hardlimit)))) { |
1da177e4 LT |
181 | d->d_itimer = 0; |
182 | } | |
183 | } | |
184 | ||
185 | if (!d->d_rtbtimer) { | |
1149d96a | 186 | if ((d->d_rtb_softlimit && |
d0a3fe67 | 187 | (be64_to_cpu(d->d_rtbcount) > |
1149d96a CH |
188 | be64_to_cpu(d->d_rtb_softlimit))) || |
189 | (d->d_rtb_hardlimit && | |
d0a3fe67 | 190 | (be64_to_cpu(d->d_rtbcount) > |
1149d96a CH |
191 | be64_to_cpu(d->d_rtb_hardlimit)))) { |
192 | d->d_rtbtimer = cpu_to_be32(get_seconds() + | |
8a7b8a89 | 193 | mp->m_quotainfo->qi_rtbtimelimit); |
754002b4 NS |
194 | } else { |
195 | d->d_rtbwarns = 0; | |
1da177e4 LT |
196 | } |
197 | } else { | |
198 | if ((!d->d_rtb_softlimit || | |
d0a3fe67 | 199 | (be64_to_cpu(d->d_rtbcount) <= |
1149d96a | 200 | be64_to_cpu(d->d_rtb_softlimit))) && |
1da177e4 | 201 | (!d->d_rtb_hardlimit || |
d0a3fe67 | 202 | (be64_to_cpu(d->d_rtbcount) <= |
1149d96a | 203 | be64_to_cpu(d->d_rtb_hardlimit)))) { |
1da177e4 LT |
204 | d->d_rtbtimer = 0; |
205 | } | |
206 | } | |
207 | } | |
208 | ||
1da177e4 LT |
209 | /* |
210 | * initialize a buffer full of dquots and log the whole thing | |
211 | */ | |
212 | STATIC void | |
213 | xfs_qm_init_dquot_blk( | |
214 | xfs_trans_t *tp, | |
215 | xfs_mount_t *mp, | |
216 | xfs_dqid_t id, | |
217 | uint type, | |
218 | xfs_buf_t *bp) | |
219 | { | |
8a7b8a89 | 220 | struct xfs_quotainfo *q = mp->m_quotainfo; |
1da177e4 LT |
221 | xfs_dqblk_t *d; |
222 | int curid, i; | |
223 | ||
224 | ASSERT(tp); | |
0c842ad4 | 225 | ASSERT(xfs_buf_islocked(bp)); |
1da177e4 | 226 | |
62926044 | 227 | d = bp->b_addr; |
1da177e4 LT |
228 | |
229 | /* | |
230 | * ID of the first dquot in the block - id's are zero based. | |
231 | */ | |
8a7b8a89 | 232 | curid = id - (id % q->qi_dqperchunk); |
1da177e4 | 233 | ASSERT(curid >= 0); |
8a7b8a89 | 234 | memset(d, 0, BBTOB(q->qi_dqchunklen)); |
49d35a5c CH |
235 | for (i = 0; i < q->qi_dqperchunk; i++, d++, curid++) { |
236 | d->dd_diskdq.d_magic = cpu_to_be16(XFS_DQUOT_MAGIC); | |
237 | d->dd_diskdq.d_version = XFS_DQUOT_VERSION; | |
238 | d->dd_diskdq.d_id = cpu_to_be32(curid); | |
239 | d->dd_diskdq.d_flags = type; | |
240 | } | |
241 | ||
1da177e4 | 242 | xfs_trans_dquot_buf(tp, bp, |
c1155410 DC |
243 | (type & XFS_DQ_USER ? XFS_BLF_UDQUOT_BUF : |
244 | ((type & XFS_DQ_PROJ) ? XFS_BLF_PDQUOT_BUF : | |
245 | XFS_BLF_GDQUOT_BUF))); | |
8a7b8a89 | 246 | xfs_trans_log_buf(tp, bp, 0, BBTOB(q->qi_dqchunklen) - 1); |
1da177e4 LT |
247 | } |
248 | ||
249 | ||
250 | ||
251 | /* | |
252 | * Allocate a block and fill it with dquots. | |
253 | * This is called when the bmapi finds a hole. | |
254 | */ | |
255 | STATIC int | |
256 | xfs_qm_dqalloc( | |
efa092f3 | 257 | xfs_trans_t **tpp, |
1da177e4 LT |
258 | xfs_mount_t *mp, |
259 | xfs_dquot_t *dqp, | |
260 | xfs_inode_t *quotip, | |
261 | xfs_fileoff_t offset_fsb, | |
262 | xfs_buf_t **O_bpp) | |
263 | { | |
264 | xfs_fsblock_t firstblock; | |
265 | xfs_bmap_free_t flist; | |
266 | xfs_bmbt_irec_t map; | |
267 | int nmaps, error, committed; | |
268 | xfs_buf_t *bp; | |
efa092f3 | 269 | xfs_trans_t *tp = *tpp; |
1da177e4 LT |
270 | |
271 | ASSERT(tp != NULL); | |
0b1b213f CH |
272 | |
273 | trace_xfs_dqalloc(dqp); | |
1da177e4 LT |
274 | |
275 | /* | |
276 | * Initialize the bmap freelist prior to calling bmapi code. | |
277 | */ | |
9d87c319 | 278 | xfs_bmap_init(&flist, &firstblock); |
1da177e4 LT |
279 | xfs_ilock(quotip, XFS_ILOCK_EXCL); |
280 | /* | |
281 | * Return if this type of quotas is turned off while we didn't | |
282 | * have an inode lock | |
283 | */ | |
6967b964 | 284 | if (!xfs_this_quota_on(dqp->q_mount, dqp->dq_flags)) { |
1da177e4 LT |
285 | xfs_iunlock(quotip, XFS_ILOCK_EXCL); |
286 | return (ESRCH); | |
287 | } | |
288 | ||
ddc3415a | 289 | xfs_trans_ijoin(tp, quotip, XFS_ILOCK_EXCL); |
1da177e4 | 290 | nmaps = 1; |
c0dc7828 DC |
291 | error = xfs_bmapi_write(tp, quotip, offset_fsb, |
292 | XFS_DQUOT_CLUSTER_SIZE_FSB, XFS_BMAPI_METADATA, | |
293 | &firstblock, XFS_QM_DQALLOC_SPACE_RES(mp), | |
294 | &map, &nmaps, &flist); | |
295 | if (error) | |
1da177e4 | 296 | goto error0; |
1da177e4 LT |
297 | ASSERT(map.br_blockcount == XFS_DQUOT_CLUSTER_SIZE_FSB); |
298 | ASSERT(nmaps == 1); | |
299 | ASSERT((map.br_startblock != DELAYSTARTBLOCK) && | |
300 | (map.br_startblock != HOLESTARTBLOCK)); | |
301 | ||
302 | /* | |
303 | * Keep track of the blkno to save a lookup later | |
304 | */ | |
305 | dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock); | |
306 | ||
307 | /* now we can just get the buffer (there's nothing to read yet) */ | |
308 | bp = xfs_trans_get_buf(tp, mp->m_ddev_targp, | |
309 | dqp->q_blkno, | |
8a7b8a89 | 310 | mp->m_quotainfo->qi_dqchunklen, |
1da177e4 | 311 | 0); |
2a30f36d CS |
312 | |
313 | error = xfs_buf_geterror(bp); | |
314 | if (error) | |
1da177e4 | 315 | goto error1; |
2a30f36d | 316 | |
1da177e4 LT |
317 | /* |
318 | * Make a chunk of dquots out of this buffer and log | |
319 | * the entire thing. | |
320 | */ | |
1149d96a | 321 | xfs_qm_init_dquot_blk(tp, mp, be32_to_cpu(dqp->q_core.d_id), |
c8ad20ff | 322 | dqp->dq_flags & XFS_DQ_ALLTYPES, bp); |
1da177e4 | 323 | |
efa092f3 TS |
324 | /* |
325 | * xfs_bmap_finish() may commit the current transaction and | |
326 | * start a second transaction if the freelist is not empty. | |
327 | * | |
328 | * Since we still want to modify this buffer, we need to | |
329 | * ensure that the buffer is not released on commit of | |
330 | * the first transaction and ensure the buffer is added to the | |
331 | * second transaction. | |
332 | * | |
333 | * If there is only one transaction then don't stop the buffer | |
334 | * from being released when it commits later on. | |
335 | */ | |
336 | ||
337 | xfs_trans_bhold(tp, bp); | |
338 | ||
f7c99b6f | 339 | if ((error = xfs_bmap_finish(tpp, &flist, &committed))) { |
1da177e4 LT |
340 | goto error1; |
341 | } | |
342 | ||
efa092f3 TS |
343 | if (committed) { |
344 | tp = *tpp; | |
345 | xfs_trans_bjoin(tp, bp); | |
346 | } else { | |
347 | xfs_trans_bhold_release(tp, bp); | |
348 | } | |
349 | ||
1da177e4 LT |
350 | *O_bpp = bp; |
351 | return 0; | |
352 | ||
353 | error1: | |
354 | xfs_bmap_cancel(&flist); | |
355 | error0: | |
356 | xfs_iunlock(quotip, XFS_ILOCK_EXCL); | |
357 | ||
358 | return (error); | |
359 | } | |
360 | ||
361 | /* | |
362 | * Maps a dquot to the buffer containing its on-disk version. | |
363 | * This returns a ptr to the buffer containing the on-disk dquot | |
364 | * in the bpp param, and a ptr to the on-disk dquot within that buffer | |
365 | */ | |
366 | STATIC int | |
367 | xfs_qm_dqtobp( | |
efa092f3 | 368 | xfs_trans_t **tpp, |
1da177e4 LT |
369 | xfs_dquot_t *dqp, |
370 | xfs_disk_dquot_t **O_ddpp, | |
371 | xfs_buf_t **O_bpp, | |
372 | uint flags) | |
373 | { | |
374 | xfs_bmbt_irec_t map; | |
acecf1b5 | 375 | int nmaps = 1, error; |
1da177e4 | 376 | xfs_buf_t *bp; |
acecf1b5 CH |
377 | xfs_inode_t *quotip = XFS_DQ_TO_QIP(dqp); |
378 | xfs_mount_t *mp = dqp->q_mount; | |
1da177e4 | 379 | xfs_disk_dquot_t *ddq; |
acecf1b5 | 380 | xfs_dqid_t id = be32_to_cpu(dqp->q_core.d_id); |
efa092f3 | 381 | xfs_trans_t *tp = (tpp ? *tpp : NULL); |
1da177e4 | 382 | |
acecf1b5 | 383 | dqp->q_fileoffset = (xfs_fileoff_t)id / mp->m_quotainfo->qi_dqperchunk; |
1da177e4 | 384 | |
acecf1b5 | 385 | xfs_ilock(quotip, XFS_ILOCK_SHARED); |
6967b964 | 386 | if (!xfs_this_quota_on(dqp->q_mount, dqp->dq_flags)) { |
1da177e4 | 387 | /* |
acecf1b5 CH |
388 | * Return if this type of quotas is turned off while we |
389 | * didn't have the quota inode lock. | |
1da177e4 | 390 | */ |
acecf1b5 CH |
391 | xfs_iunlock(quotip, XFS_ILOCK_SHARED); |
392 | return ESRCH; | |
393 | } | |
394 | ||
395 | /* | |
396 | * Find the block map; no allocations yet | |
397 | */ | |
5c8ed202 DC |
398 | error = xfs_bmapi_read(quotip, dqp->q_fileoffset, |
399 | XFS_DQUOT_CLUSTER_SIZE_FSB, &map, &nmaps, 0); | |
acecf1b5 CH |
400 | |
401 | xfs_iunlock(quotip, XFS_ILOCK_SHARED); | |
402 | if (error) | |
403 | return error; | |
404 | ||
405 | ASSERT(nmaps == 1); | |
406 | ASSERT(map.br_blockcount == 1); | |
407 | ||
408 | /* | |
409 | * Offset of dquot in the (fixed sized) dquot chunk. | |
410 | */ | |
411 | dqp->q_bufoffset = (id % mp->m_quotainfo->qi_dqperchunk) * | |
412 | sizeof(xfs_dqblk_t); | |
413 | ||
414 | ASSERT(map.br_startblock != DELAYSTARTBLOCK); | |
415 | if (map.br_startblock == HOLESTARTBLOCK) { | |
1da177e4 | 416 | /* |
acecf1b5 | 417 | * We don't allocate unless we're asked to |
1da177e4 | 418 | */ |
acecf1b5 CH |
419 | if (!(flags & XFS_QMOPT_DQALLOC)) |
420 | return ENOENT; | |
1da177e4 | 421 | |
acecf1b5 CH |
422 | ASSERT(tp); |
423 | error = xfs_qm_dqalloc(tpp, mp, dqp, quotip, | |
424 | dqp->q_fileoffset, &bp); | |
1da177e4 | 425 | if (error) |
acecf1b5 CH |
426 | return error; |
427 | tp = *tpp; | |
428 | } else { | |
429 | trace_xfs_dqtobp_read(dqp); | |
1da177e4 LT |
430 | |
431 | /* | |
acecf1b5 CH |
432 | * store the blkno etc so that we don't have to do the |
433 | * mapping all the time | |
1da177e4 | 434 | */ |
acecf1b5 | 435 | dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock); |
0b1b213f | 436 | |
8a7b8a89 CH |
437 | error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, |
438 | dqp->q_blkno, | |
439 | mp->m_quotainfo->qi_dqchunklen, | |
440 | 0, &bp); | |
1da177e4 LT |
441 | if (error || !bp) |
442 | return XFS_ERROR(error); | |
443 | } | |
acecf1b5 | 444 | |
0c842ad4 | 445 | ASSERT(xfs_buf_islocked(bp)); |
1da177e4 LT |
446 | |
447 | /* | |
448 | * calculate the location of the dquot inside the buffer. | |
449 | */ | |
62926044 | 450 | ddq = bp->b_addr + dqp->q_bufoffset; |
1da177e4 LT |
451 | |
452 | /* | |
453 | * A simple sanity check in case we got a corrupted dquot... | |
454 | */ | |
a0fa2b67 | 455 | error = xfs_qm_dqcheck(mp, ddq, id, dqp->dq_flags & XFS_DQ_ALLTYPES, |
1da177e4 | 456 | flags & (XFS_QMOPT_DQREPAIR|XFS_QMOPT_DOWARN), |
a0fa2b67 DC |
457 | "dqtobp"); |
458 | if (error) { | |
1da177e4 LT |
459 | if (!(flags & XFS_QMOPT_DQREPAIR)) { |
460 | xfs_trans_brelse(tp, bp); | |
461 | return XFS_ERROR(EIO); | |
462 | } | |
1da177e4 LT |
463 | } |
464 | ||
465 | *O_bpp = bp; | |
466 | *O_ddpp = ddq; | |
467 | ||
468 | return (0); | |
469 | } | |
470 | ||
471 | ||
472 | /* | |
473 | * Read in the ondisk dquot using dqtobp() then copy it to an incore version, | |
474 | * and release the buffer immediately. | |
475 | * | |
97e7ade5 | 476 | * If XFS_QMOPT_DQALLOC is set, allocate a dquot on disk if it needed. |
1da177e4 | 477 | */ |
7ae44407 | 478 | int |
1da177e4 | 479 | xfs_qm_dqread( |
97e7ade5 CH |
480 | struct xfs_mount *mp, |
481 | xfs_dqid_t id, | |
482 | uint type, | |
483 | uint flags, | |
484 | struct xfs_dquot **O_dqpp) | |
1da177e4 | 485 | { |
97e7ade5 CH |
486 | struct xfs_dquot *dqp; |
487 | struct xfs_disk_dquot *ddqp; | |
488 | struct xfs_buf *bp; | |
489 | struct xfs_trans *tp = NULL; | |
490 | int error; | |
491 | int cancelflags = 0; | |
efa092f3 | 492 | |
92b2e5b3 CH |
493 | |
494 | dqp = kmem_zone_zalloc(xfs_Gqm->qm_dqzone, KM_SLEEP); | |
495 | ||
496 | dqp->dq_flags = type; | |
497 | dqp->q_core.d_id = cpu_to_be32(id); | |
498 | dqp->q_mount = mp; | |
f8739c3c | 499 | INIT_LIST_HEAD(&dqp->q_lru); |
92b2e5b3 CH |
500 | mutex_init(&dqp->q_qlock); |
501 | init_waitqueue_head(&dqp->q_pinwait); | |
502 | ||
503 | /* | |
504 | * Because we want to use a counting completion, complete | |
505 | * the flush completion once to allow a single access to | |
506 | * the flush completion without blocking. | |
507 | */ | |
508 | init_completion(&dqp->q_flush); | |
509 | complete(&dqp->q_flush); | |
510 | ||
511 | /* | |
512 | * Make sure group quotas have a different lock class than user | |
513 | * quotas. | |
514 | */ | |
515 | if (!(type & XFS_DQ_USER)) | |
516 | lockdep_set_class(&dqp->q_qlock, &xfs_dquot_other_class); | |
517 | ||
48776fd2 | 518 | XFS_STATS_INC(xs_qm_dquot); |
1da177e4 | 519 | |
0b1b213f CH |
520 | trace_xfs_dqread(dqp); |
521 | ||
97e7ade5 CH |
522 | if (flags & XFS_QMOPT_DQALLOC) { |
523 | tp = xfs_trans_alloc(mp, XFS_TRANS_QM_DQALLOC); | |
524 | error = xfs_trans_reserve(tp, XFS_QM_DQALLOC_SPACE_RES(mp), | |
525 | XFS_WRITE_LOG_RES(mp) + | |
526 | /* | |
527 | * Round the chunklen up to the next multiple | |
528 | * of 128 (buf log item chunk size)). | |
529 | */ | |
530 | BBTOB(mp->m_quotainfo->qi_dqchunklen) - 1 + 128, | |
531 | 0, | |
532 | XFS_TRANS_PERM_LOG_RES, | |
533 | XFS_WRITE_LOG_COUNT); | |
534 | if (error) | |
535 | goto error1; | |
536 | cancelflags = XFS_TRANS_RELEASE_LOG_RES; | |
537 | } | |
538 | ||
1da177e4 LT |
539 | /* |
540 | * get a pointer to the on-disk dquot and the buffer containing it | |
541 | * dqp already knows its own type (GROUP/USER). | |
542 | */ | |
97e7ade5 CH |
543 | error = xfs_qm_dqtobp(&tp, dqp, &ddqp, &bp, flags); |
544 | if (error) { | |
545 | /* | |
546 | * This can happen if quotas got turned off (ESRCH), | |
547 | * or if the dquot didn't exist on disk and we ask to | |
548 | * allocate (ENOENT). | |
549 | */ | |
550 | trace_xfs_dqread_fail(dqp); | |
551 | cancelflags |= XFS_TRANS_ABORT; | |
552 | goto error1; | |
1da177e4 LT |
553 | } |
554 | ||
555 | /* copy everything from disk dquot to the incore dquot */ | |
556 | memcpy(&dqp->q_core, ddqp, sizeof(xfs_disk_dquot_t)); | |
1da177e4 LT |
557 | xfs_qm_dquot_logitem_init(dqp); |
558 | ||
559 | /* | |
560 | * Reservation counters are defined as reservation plus current usage | |
25985edc | 561 | * to avoid having to add every time. |
1da177e4 | 562 | */ |
1149d96a CH |
563 | dqp->q_res_bcount = be64_to_cpu(ddqp->d_bcount); |
564 | dqp->q_res_icount = be64_to_cpu(ddqp->d_icount); | |
565 | dqp->q_res_rtbcount = be64_to_cpu(ddqp->d_rtbcount); | |
1da177e4 LT |
566 | |
567 | /* Mark the buf so that this will stay incore a little longer */ | |
38f23232 | 568 | xfs_buf_set_ref(bp, XFS_DQUOT_REF); |
1da177e4 LT |
569 | |
570 | /* | |
571 | * We got the buffer with a xfs_trans_read_buf() (in dqtobp()) | |
572 | * So we need to release with xfs_trans_brelse(). | |
573 | * The strategy here is identical to that of inodes; we lock | |
574 | * the dquot in xfs_qm_dqget() before making it accessible to | |
575 | * others. This is because dquots, like inodes, need a good level of | |
576 | * concurrency, and we don't want to take locks on the entire buffers | |
577 | * for dquot accesses. | |
578 | * Note also that the dquot buffer may even be dirty at this point, if | |
579 | * this particular dquot was repaired. We still aren't afraid to | |
580 | * brelse it because we have the changes incore. | |
581 | */ | |
0c842ad4 | 582 | ASSERT(xfs_buf_islocked(bp)); |
1da177e4 LT |
583 | xfs_trans_brelse(tp, bp); |
584 | ||
1da177e4 | 585 | if (tp) { |
97e7ade5 CH |
586 | error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES); |
587 | if (error) | |
588 | goto error0; | |
1da177e4 LT |
589 | } |
590 | ||
591 | *O_dqpp = dqp; | |
97e7ade5 | 592 | return error; |
1da177e4 | 593 | |
97e7ade5 | 594 | error1: |
1da177e4 LT |
595 | if (tp) |
596 | xfs_trans_cancel(tp, cancelflags); | |
97e7ade5 | 597 | error0: |
1da177e4 LT |
598 | xfs_qm_dqdestroy(dqp); |
599 | *O_dqpp = NULL; | |
97e7ade5 | 600 | return error; |
1da177e4 LT |
601 | } |
602 | ||
1da177e4 LT |
603 | /* |
604 | * Given the file system, inode OR id, and type (UDQUOT/GDQUOT), return a | |
605 | * a locked dquot, doing an allocation (if requested) as needed. | |
606 | * When both an inode and an id are given, the inode's id takes precedence. | |
607 | * That is, if the id changes while we don't hold the ilock inside this | |
608 | * function, the new dquot is returned, not necessarily the one requested | |
609 | * in the id argument. | |
610 | */ | |
611 | int | |
612 | xfs_qm_dqget( | |
613 | xfs_mount_t *mp, | |
614 | xfs_inode_t *ip, /* locked inode (optional) */ | |
c8ad20ff NS |
615 | xfs_dqid_t id, /* uid/projid/gid depending on type */ |
616 | uint type, /* XFS_DQ_USER/XFS_DQ_PROJ/XFS_DQ_GROUP */ | |
1da177e4 LT |
617 | uint flags, /* DQALLOC, DQSUSER, DQREPAIR, DOWARN */ |
618 | xfs_dquot_t **O_dqpp) /* OUT : locked incore dquot */ | |
619 | { | |
9f920f11 CH |
620 | struct xfs_quotainfo *qi = mp->m_quotainfo; |
621 | struct radix_tree_root *tree = XFS_DQUOT_TREE(qi, type); | |
622 | struct xfs_dquot *dqp; | |
623 | int error; | |
1da177e4 LT |
624 | |
625 | ASSERT(XFS_IS_QUOTA_RUNNING(mp)); | |
626 | if ((! XFS_IS_UQUOTA_ON(mp) && type == XFS_DQ_USER) || | |
c8ad20ff | 627 | (! XFS_IS_PQUOTA_ON(mp) && type == XFS_DQ_PROJ) || |
1da177e4 LT |
628 | (! XFS_IS_GQUOTA_ON(mp) && type == XFS_DQ_GROUP)) { |
629 | return (ESRCH); | |
630 | } | |
1da177e4 LT |
631 | |
632 | #ifdef DEBUG | |
633 | if (xfs_do_dqerror) { | |
634 | if ((xfs_dqerror_target == mp->m_ddev_targp) && | |
635 | (xfs_dqreq_num++ % xfs_dqerror_mod) == 0) { | |
0b932ccc | 636 | xfs_debug(mp, "Returning error in dqget"); |
1da177e4 LT |
637 | return (EIO); |
638 | } | |
639 | } | |
1da177e4 | 640 | |
c8ad20ff NS |
641 | ASSERT(type == XFS_DQ_USER || |
642 | type == XFS_DQ_PROJ || | |
643 | type == XFS_DQ_GROUP); | |
1da177e4 | 644 | if (ip) { |
579aa9ca | 645 | ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL)); |
36731410 | 646 | ASSERT(xfs_inode_dquot(ip, type) == NULL); |
1da177e4 LT |
647 | } |
648 | #endif | |
92678554 CH |
649 | |
650 | restart: | |
9f920f11 CH |
651 | mutex_lock(&qi->qi_tree_lock); |
652 | dqp = radix_tree_lookup(tree, id); | |
653 | if (dqp) { | |
654 | xfs_dqlock(dqp); | |
655 | if (dqp->dq_flags & XFS_DQ_FREEING) { | |
656 | xfs_dqunlock(dqp); | |
657 | mutex_unlock(&qi->qi_tree_lock); | |
658 | trace_xfs_dqget_freeing(dqp); | |
659 | delay(1); | |
660 | goto restart; | |
661 | } | |
1da177e4 | 662 | |
9f920f11 CH |
663 | dqp->q_nrefs++; |
664 | mutex_unlock(&qi->qi_tree_lock); | |
665 | ||
666 | trace_xfs_dqget_hit(dqp); | |
48776fd2 | 667 | XFS_STATS_INC(xs_qm_dqcachehits); |
9f920f11 CH |
668 | *O_dqpp = dqp; |
669 | return 0; | |
1da177e4 | 670 | } |
9f920f11 CH |
671 | mutex_unlock(&qi->qi_tree_lock); |
672 | XFS_STATS_INC(xs_qm_dqcachemisses); | |
1da177e4 LT |
673 | |
674 | /* | |
675 | * Dquot cache miss. We don't want to keep the inode lock across | |
676 | * a (potential) disk read. Also we don't want to deal with the lock | |
677 | * ordering between quotainode and this inode. OTOH, dropping the inode | |
678 | * lock here means dealing with a chown that can happen before | |
679 | * we re-acquire the lock. | |
680 | */ | |
681 | if (ip) | |
682 | xfs_iunlock(ip, XFS_ILOCK_EXCL); | |
1da177e4 | 683 | |
97e7ade5 | 684 | error = xfs_qm_dqread(mp, id, type, flags, &dqp); |
1da177e4 | 685 | |
7ae44407 CH |
686 | if (ip) |
687 | xfs_ilock(ip, XFS_ILOCK_EXCL); | |
688 | ||
689 | if (error) | |
690 | return error; | |
1da177e4 | 691 | |
1da177e4 | 692 | if (ip) { |
1da177e4 LT |
693 | /* |
694 | * A dquot could be attached to this inode by now, since | |
695 | * we had dropped the ilock. | |
696 | */ | |
36731410 | 697 | if (xfs_this_quota_on(mp, type)) { |
9f920f11 CH |
698 | struct xfs_dquot *dqp1; |
699 | ||
36731410 CS |
700 | dqp1 = xfs_inode_dquot(ip, type); |
701 | if (dqp1) { | |
1da177e4 | 702 | xfs_qm_dqdestroy(dqp); |
36731410 | 703 | dqp = dqp1; |
1da177e4 LT |
704 | xfs_dqlock(dqp); |
705 | goto dqret; | |
706 | } | |
707 | } else { | |
36731410 CS |
708 | /* inode stays locked on return */ |
709 | xfs_qm_dqdestroy(dqp); | |
710 | return XFS_ERROR(ESRCH); | |
1da177e4 LT |
711 | } |
712 | } | |
713 | ||
9f920f11 CH |
714 | mutex_lock(&qi->qi_tree_lock); |
715 | error = -radix_tree_insert(tree, id, dqp); | |
716 | if (unlikely(error)) { | |
717 | WARN_ON(error != EEXIST); | |
718 | ||
1da177e4 | 719 | /* |
9f920f11 CH |
720 | * Duplicate found. Just throw away the new dquot and start |
721 | * over. | |
1da177e4 | 722 | */ |
9f920f11 CH |
723 | mutex_unlock(&qi->qi_tree_lock); |
724 | trace_xfs_dqget_dup(dqp); | |
725 | xfs_qm_dqdestroy(dqp); | |
726 | XFS_STATS_INC(xs_qm_dquot_dups); | |
727 | goto restart; | |
1da177e4 LT |
728 | } |
729 | ||
1da177e4 LT |
730 | /* |
731 | * We return a locked dquot to the caller, with a reference taken | |
732 | */ | |
733 | xfs_dqlock(dqp); | |
734 | dqp->q_nrefs = 1; | |
735 | ||
9f920f11 | 736 | qi->qi_dquots++; |
9f920f11 CH |
737 | mutex_unlock(&qi->qi_tree_lock); |
738 | ||
1da177e4 | 739 | dqret: |
579aa9ca | 740 | ASSERT((ip == NULL) || xfs_isilocked(ip, XFS_ILOCK_EXCL)); |
0b1b213f | 741 | trace_xfs_dqget_miss(dqp); |
1da177e4 LT |
742 | *O_dqpp = dqp; |
743 | return (0); | |
744 | } | |
745 | ||
746 | ||
f8739c3c CH |
747 | STATIC void |
748 | xfs_qm_dqput_final( | |
bf72de31 | 749 | struct xfs_dquot *dqp) |
1da177e4 | 750 | { |
f8739c3c | 751 | struct xfs_quotainfo *qi = dqp->q_mount->m_quotainfo; |
bf72de31 | 752 | struct xfs_dquot *gdqp; |
1da177e4 | 753 | |
bf72de31 CH |
754 | trace_xfs_dqput_free(dqp); |
755 | ||
f8739c3c CH |
756 | mutex_lock(&qi->qi_lru_lock); |
757 | if (list_empty(&dqp->q_lru)) { | |
758 | list_add_tail(&dqp->q_lru, &qi->qi_lru_list); | |
759 | qi->qi_lru_count++; | |
48776fd2 | 760 | XFS_STATS_INC(xs_qm_dquot_unused); |
bf72de31 | 761 | } |
f8739c3c | 762 | mutex_unlock(&qi->qi_lru_lock); |
bf72de31 | 763 | |
1da177e4 | 764 | /* |
bf72de31 CH |
765 | * If we just added a udquot to the freelist, then we want to release |
766 | * the gdquot reference that it (probably) has. Otherwise it'll keep | |
767 | * the gdquot from getting reclaimed. | |
1da177e4 | 768 | */ |
bf72de31 CH |
769 | gdqp = dqp->q_gdquot; |
770 | if (gdqp) { | |
771 | xfs_dqlock(gdqp); | |
772 | dqp->q_gdquot = NULL; | |
1da177e4 | 773 | } |
bf72de31 | 774 | xfs_dqunlock(dqp); |
1da177e4 | 775 | |
bf72de31 CH |
776 | /* |
777 | * If we had a group quota hint, release it now. | |
778 | */ | |
f8739c3c CH |
779 | if (gdqp) |
780 | xfs_qm_dqput(gdqp); | |
781 | } | |
782 | ||
783 | /* | |
784 | * Release a reference to the dquot (decrement ref-count) and unlock it. | |
785 | * | |
786 | * If there is a group quota attached to this dquot, carefully release that | |
787 | * too without tripping over deadlocks'n'stuff. | |
788 | */ | |
789 | void | |
790 | xfs_qm_dqput( | |
791 | struct xfs_dquot *dqp) | |
792 | { | |
793 | ASSERT(dqp->q_nrefs > 0); | |
794 | ASSERT(XFS_DQ_IS_LOCKED(dqp)); | |
795 | ||
796 | trace_xfs_dqput(dqp); | |
797 | ||
798 | if (--dqp->q_nrefs > 0) | |
799 | xfs_dqunlock(dqp); | |
800 | else | |
801 | xfs_qm_dqput_final(dqp); | |
1da177e4 LT |
802 | } |
803 | ||
804 | /* | |
805 | * Release a dquot. Flush it if dirty, then dqput() it. | |
806 | * dquot must not be locked. | |
807 | */ | |
808 | void | |
809 | xfs_qm_dqrele( | |
810 | xfs_dquot_t *dqp) | |
811 | { | |
7d095257 CH |
812 | if (!dqp) |
813 | return; | |
814 | ||
0b1b213f | 815 | trace_xfs_dqrele(dqp); |
1da177e4 LT |
816 | |
817 | xfs_dqlock(dqp); | |
818 | /* | |
819 | * We don't care to flush it if the dquot is dirty here. | |
820 | * That will create stutters that we want to avoid. | |
821 | * Instead we do a delayed write when we try to reclaim | |
822 | * a dirty dquot. Also xfs_sync will take part of the burden... | |
823 | */ | |
824 | xfs_qm_dqput(dqp); | |
825 | } | |
826 | ||
ca30b2a7 CH |
827 | /* |
828 | * This is the dquot flushing I/O completion routine. It is called | |
829 | * from interrupt level when the buffer containing the dquot is | |
830 | * flushed to disk. It is responsible for removing the dquot logitem | |
831 | * from the AIL if it has not been re-logged, and unlocking the dquot's | |
832 | * flush lock. This behavior is very similar to that of inodes.. | |
833 | */ | |
834 | STATIC void | |
835 | xfs_qm_dqflush_done( | |
836 | struct xfs_buf *bp, | |
837 | struct xfs_log_item *lip) | |
838 | { | |
839 | xfs_dq_logitem_t *qip = (struct xfs_dq_logitem *)lip; | |
840 | xfs_dquot_t *dqp = qip->qli_dquot; | |
841 | struct xfs_ail *ailp = lip->li_ailp; | |
842 | ||
843 | /* | |
844 | * We only want to pull the item from the AIL if its | |
845 | * location in the log has not changed since we started the flush. | |
846 | * Thus, we only bother if the dquot's lsn has | |
847 | * not changed. First we check the lsn outside the lock | |
848 | * since it's cheaper, and then we recheck while | |
849 | * holding the lock before removing the dquot from the AIL. | |
850 | */ | |
851 | if ((lip->li_flags & XFS_LI_IN_AIL) && | |
852 | lip->li_lsn == qip->qli_flush_lsn) { | |
853 | ||
854 | /* xfs_trans_ail_delete() drops the AIL lock. */ | |
855 | spin_lock(&ailp->xa_lock); | |
856 | if (lip->li_lsn == qip->qli_flush_lsn) | |
857 | xfs_trans_ail_delete(ailp, lip); | |
858 | else | |
859 | spin_unlock(&ailp->xa_lock); | |
860 | } | |
861 | ||
862 | /* | |
863 | * Release the dq's flush lock since we're done with it. | |
864 | */ | |
865 | xfs_dqfunlock(dqp); | |
866 | } | |
1da177e4 LT |
867 | |
868 | /* | |
869 | * Write a modified dquot to disk. | |
870 | * The dquot must be locked and the flush lock too taken by caller. | |
871 | * The flush lock will not be unlocked until the dquot reaches the disk, | |
872 | * but the dquot is free to be unlocked and modified by the caller | |
873 | * in the interim. Dquot is still locked on return. This behavior is | |
874 | * identical to that of inodes. | |
875 | */ | |
876 | int | |
877 | xfs_qm_dqflush( | |
878 | xfs_dquot_t *dqp, | |
879 | uint flags) | |
880 | { | |
acecf1b5 CH |
881 | struct xfs_mount *mp = dqp->q_mount; |
882 | struct xfs_buf *bp; | |
883 | struct xfs_disk_dquot *ddqp; | |
1da177e4 | 884 | int error; |
1da177e4 LT |
885 | |
886 | ASSERT(XFS_DQ_IS_LOCKED(dqp)); | |
e1f49cf2 | 887 | ASSERT(!completion_done(&dqp->q_flush)); |
acecf1b5 | 888 | |
0b1b213f | 889 | trace_xfs_dqflush(dqp); |
1da177e4 LT |
890 | |
891 | /* | |
acecf1b5 | 892 | * If not dirty, or it's pinned and we are not supposed to block, nada. |
1da177e4 | 893 | */ |
2f8a3ce1 | 894 | if (!XFS_DQ_IS_DIRTY(dqp) || |
fdedf28b | 895 | ((flags & SYNC_TRYLOCK) && atomic_read(&dqp->q_pincount) > 0)) { |
1da177e4 | 896 | xfs_dqfunlock(dqp); |
2f8a3ce1 | 897 | return 0; |
1da177e4 | 898 | } |
1da177e4 LT |
899 | xfs_qm_dqunpin_wait(dqp); |
900 | ||
901 | /* | |
902 | * This may have been unpinned because the filesystem is shutting | |
903 | * down forcibly. If that's the case we must not write this dquot | |
904 | * to disk, because the log record didn't make it to disk! | |
905 | */ | |
acecf1b5 CH |
906 | if (XFS_FORCED_SHUTDOWN(mp)) { |
907 | dqp->dq_flags &= ~XFS_DQ_DIRTY; | |
1da177e4 LT |
908 | xfs_dqfunlock(dqp); |
909 | return XFS_ERROR(EIO); | |
910 | } | |
911 | ||
912 | /* | |
913 | * Get the buffer containing the on-disk dquot | |
1da177e4 | 914 | */ |
acecf1b5 CH |
915 | error = xfs_trans_read_buf(mp, NULL, mp->m_ddev_targp, dqp->q_blkno, |
916 | mp->m_quotainfo->qi_dqchunklen, 0, &bp); | |
917 | if (error) { | |
1da177e4 | 918 | ASSERT(error != ENOENT); |
1da177e4 | 919 | xfs_dqfunlock(dqp); |
acecf1b5 | 920 | return error; |
1da177e4 LT |
921 | } |
922 | ||
acecf1b5 CH |
923 | /* |
924 | * Calculate the location of the dquot inside the buffer. | |
925 | */ | |
62926044 | 926 | ddqp = bp->b_addr + dqp->q_bufoffset; |
acecf1b5 CH |
927 | |
928 | /* | |
929 | * A simple sanity check in case we got a corrupted dquot.. | |
930 | */ | |
a0fa2b67 DC |
931 | error = xfs_qm_dqcheck(mp, &dqp->q_core, be32_to_cpu(ddqp->d_id), 0, |
932 | XFS_QMOPT_DOWARN, "dqflush (incore copy)"); | |
933 | if (error) { | |
acecf1b5 CH |
934 | xfs_buf_relse(bp); |
935 | xfs_dqfunlock(dqp); | |
936 | xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE); | |
1da177e4 LT |
937 | return XFS_ERROR(EIO); |
938 | } | |
939 | ||
940 | /* This is the only portion of data that needs to persist */ | |
acecf1b5 | 941 | memcpy(ddqp, &dqp->q_core, sizeof(xfs_disk_dquot_t)); |
1da177e4 LT |
942 | |
943 | /* | |
944 | * Clear the dirty field and remember the flush lsn for later use. | |
945 | */ | |
acecf1b5 | 946 | dqp->dq_flags &= ~XFS_DQ_DIRTY; |
1da177e4 | 947 | |
7b2e2a31 DC |
948 | xfs_trans_ail_copy_lsn(mp->m_ail, &dqp->q_logitem.qli_flush_lsn, |
949 | &dqp->q_logitem.qli_item.li_lsn); | |
1da177e4 LT |
950 | |
951 | /* | |
952 | * Attach an iodone routine so that we can remove this dquot from the | |
953 | * AIL and release the flush lock once the dquot is synced to disk. | |
954 | */ | |
ca30b2a7 CH |
955 | xfs_buf_attach_iodone(bp, xfs_qm_dqflush_done, |
956 | &dqp->q_logitem.qli_item); | |
957 | ||
1da177e4 LT |
958 | /* |
959 | * If the buffer is pinned then push on the log so we won't | |
960 | * get stuck waiting in the write for too long. | |
961 | */ | |
811e64c7 | 962 | if (xfs_buf_ispinned(bp)) { |
0b1b213f | 963 | trace_xfs_dqflush_force(dqp); |
a14a348b | 964 | xfs_log_force(mp, 0); |
1da177e4 LT |
965 | } |
966 | ||
20026d92 | 967 | if (flags & SYNC_WAIT) |
c2b006c1 CH |
968 | error = xfs_bwrite(bp); |
969 | else | |
61551f1e | 970 | xfs_buf_delwri_queue(bp); |
c2b006c1 CH |
971 | |
972 | xfs_buf_relse(bp); | |
0b1b213f CH |
973 | |
974 | trace_xfs_dqflush_done(dqp); | |
975 | ||
1da177e4 LT |
976 | /* |
977 | * dqp is still locked, but caller is free to unlock it now. | |
978 | */ | |
20026d92 | 979 | return error; |
1da177e4 LT |
980 | |
981 | } | |
982 | ||
5bb87a33 CH |
983 | /* |
984 | * Lock two xfs_dquot structures. | |
985 | * | |
986 | * To avoid deadlocks we always lock the quota structure with | |
987 | * the lowerd id first. | |
988 | */ | |
1da177e4 LT |
989 | void |
990 | xfs_dqlock2( | |
991 | xfs_dquot_t *d1, | |
992 | xfs_dquot_t *d2) | |
993 | { | |
994 | if (d1 && d2) { | |
995 | ASSERT(d1 != d2); | |
1149d96a CH |
996 | if (be32_to_cpu(d1->q_core.d_id) > |
997 | be32_to_cpu(d2->q_core.d_id)) { | |
5bb87a33 CH |
998 | mutex_lock(&d2->q_qlock); |
999 | mutex_lock_nested(&d1->q_qlock, XFS_QLOCK_NESTED); | |
1da177e4 | 1000 | } else { |
5bb87a33 CH |
1001 | mutex_lock(&d1->q_qlock); |
1002 | mutex_lock_nested(&d2->q_qlock, XFS_QLOCK_NESTED); | |
1da177e4 | 1003 | } |
5bb87a33 CH |
1004 | } else if (d1) { |
1005 | mutex_lock(&d1->q_qlock); | |
1006 | } else if (d2) { | |
1007 | mutex_lock(&d2->q_qlock); | |
1da177e4 LT |
1008 | } |
1009 | } | |
1010 | ||
1da177e4 LT |
1011 | /* |
1012 | * Give the buffer a little push if it is incore and | |
1013 | * wait on the flush lock. | |
1014 | */ | |
1015 | void | |
800b484e | 1016 | xfs_dqflock_pushbuf_wait( |
1da177e4 LT |
1017 | xfs_dquot_t *dqp) |
1018 | { | |
8a7b8a89 | 1019 | xfs_mount_t *mp = dqp->q_mount; |
1da177e4 LT |
1020 | xfs_buf_t *bp; |
1021 | ||
1022 | /* | |
1023 | * Check to see if the dquot has been flushed delayed | |
1024 | * write. If so, grab its buffer and send it | |
1025 | * out immediately. We'll be able to acquire | |
1026 | * the flush lock when the I/O completes. | |
1027 | */ | |
8a7b8a89 CH |
1028 | bp = xfs_incore(mp->m_ddev_targp, dqp->q_blkno, |
1029 | mp->m_quotainfo->qi_dqchunklen, XBF_TRYLOCK); | |
7d6a7bde DC |
1030 | if (!bp) |
1031 | goto out_lock; | |
1032 | ||
1033 | if (XFS_BUF_ISDELAYWRITE(bp)) { | |
811e64c7 | 1034 | if (xfs_buf_ispinned(bp)) |
8a7b8a89 | 1035 | xfs_log_force(mp, 0); |
7d6a7bde DC |
1036 | xfs_buf_delwri_promote(bp); |
1037 | wake_up_process(bp->b_target->bt_task); | |
1da177e4 | 1038 | } |
7d6a7bde DC |
1039 | xfs_buf_relse(bp); |
1040 | out_lock: | |
1da177e4 LT |
1041 | xfs_dqflock(dqp); |
1042 | } |