Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Copyright (c) 2000-2003 Silicon Graphics, Inc. All Rights Reserved. | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or modify it | |
5 | * under the terms of version 2 of the GNU General Public License as | |
6 | * published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it would be useful, but | |
9 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. | |
11 | * | |
12 | * Further, this software is distributed without any warranty that it is | |
13 | * free of the rightful claim of any third person regarding infringement | |
14 | * or the like. Any license provided herein, whether implied or | |
15 | * otherwise, applies only to this software file. Patent licenses, if | |
16 | * any, provided herein do not apply to combinations of this program with | |
17 | * other software, or any other product whatsoever. | |
18 | * | |
19 | * You should have received a copy of the GNU General Public License along | |
20 | * with this program; if not, write the Free Software Foundation, Inc., 59 | |
21 | * Temple Place - Suite 330, Boston MA 02111-1307, USA. | |
22 | * | |
23 | * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy, | |
24 | * Mountain View, CA 94043, or: | |
25 | * | |
26 | * http://www.sgi.com | |
27 | * | |
28 | * For further information regarding this notice, see: | |
29 | * | |
30 | * http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/ | |
31 | */ | |
32 | ||
33 | #include "xfs.h" | |
34 | #include "xfs_fs.h" | |
35 | #include "xfs_inum.h" | |
36 | #include "xfs_log.h" | |
37 | #include "xfs_trans.h" | |
38 | #include "xfs_sb.h" | |
39 | #include "xfs_ag.h" | |
40 | #include "xfs_dir.h" | |
41 | #include "xfs_dir2.h" | |
42 | #include "xfs_alloc.h" | |
43 | #include "xfs_dmapi.h" | |
44 | #include "xfs_quota.h" | |
45 | #include "xfs_mount.h" | |
46 | #include "xfs_alloc_btree.h" | |
47 | #include "xfs_bmap_btree.h" | |
48 | #include "xfs_ialloc_btree.h" | |
49 | #include "xfs_btree.h" | |
50 | #include "xfs_ialloc.h" | |
51 | #include "xfs_attr_sf.h" | |
52 | #include "xfs_dir_sf.h" | |
53 | #include "xfs_dir2_sf.h" | |
54 | #include "xfs_dinode.h" | |
55 | #include "xfs_inode.h" | |
56 | #include "xfs_bmap.h" | |
57 | #include "xfs_bit.h" | |
58 | #include "xfs_rtalloc.h" | |
59 | #include "xfs_error.h" | |
60 | #include "xfs_itable.h" | |
61 | #include "xfs_rw.h" | |
62 | #include "xfs_acl.h" | |
63 | #include "xfs_cap.h" | |
64 | #include "xfs_mac.h" | |
65 | #include "xfs_attr.h" | |
66 | #include "xfs_buf_item.h" | |
67 | #include "xfs_trans_space.h" | |
68 | #include "xfs_trans_priv.h" | |
69 | ||
70 | #include "xfs_qm.h" | |
71 | ||
72 | ||
73 | /* | |
74 | LOCK ORDER | |
75 | ||
76 | inode lock (ilock) | |
77 | dquot hash-chain lock (hashlock) | |
78 | xqm dquot freelist lock (freelistlock | |
79 | mount's dquot list lock (mplistlock) | |
80 | user dquot lock - lock ordering among dquots is based on the uid or gid | |
81 | group dquot lock - similar to udquots. Between the two dquots, the udquot | |
82 | has to be locked first. | |
83 | pin lock - the dquot lock must be held to take this lock. | |
84 | flush lock - ditto. | |
85 | */ | |
86 | ||
87 | STATIC void xfs_qm_dqflush_done(xfs_buf_t *, xfs_dq_logitem_t *); | |
88 | ||
89 | #ifdef DEBUG | |
90 | xfs_buftarg_t *xfs_dqerror_target; | |
91 | int xfs_do_dqerror; | |
92 | int xfs_dqreq_num; | |
93 | int xfs_dqerror_mod = 33; | |
94 | #endif | |
95 | ||
96 | /* | |
97 | * Allocate and initialize a dquot. We don't always allocate fresh memory; | |
98 | * we try to reclaim a free dquot if the number of incore dquots are above | |
99 | * a threshold. | |
100 | * The only field inside the core that gets initialized at this point | |
101 | * is the d_id field. The idea is to fill in the entire q_core | |
102 | * when we read in the on disk dquot. | |
103 | */ | |
104 | xfs_dquot_t * | |
105 | xfs_qm_dqinit( | |
106 | xfs_mount_t *mp, | |
107 | xfs_dqid_t id, | |
108 | uint type) | |
109 | { | |
110 | xfs_dquot_t *dqp; | |
111 | boolean_t brandnewdquot; | |
112 | ||
113 | brandnewdquot = xfs_qm_dqalloc_incore(&dqp); | |
114 | dqp->dq_flags = type; | |
115 | INT_SET(dqp->q_core.d_id, ARCH_CONVERT, id); | |
116 | dqp->q_mount = mp; | |
117 | ||
118 | /* | |
119 | * No need to re-initialize these if this is a reclaimed dquot. | |
120 | */ | |
121 | if (brandnewdquot) { | |
122 | dqp->dq_flnext = dqp->dq_flprev = dqp; | |
123 | mutex_init(&dqp->q_qlock, MUTEX_DEFAULT, "xdq"); | |
124 | initnsema(&dqp->q_flock, 1, "fdq"); | |
125 | sv_init(&dqp->q_pinwait, SV_DEFAULT, "pdq"); | |
126 | ||
127 | #ifdef XFS_DQUOT_TRACE | |
128 | dqp->q_trace = ktrace_alloc(DQUOT_TRACE_SIZE, KM_SLEEP); | |
129 | xfs_dqtrace_entry(dqp, "DQINIT"); | |
130 | #endif | |
131 | } else { | |
132 | /* | |
133 | * Only the q_core portion was zeroed in dqreclaim_one(). | |
134 | * So, we need to reset others. | |
135 | */ | |
136 | dqp->q_nrefs = 0; | |
137 | dqp->q_blkno = 0; | |
138 | dqp->MPL_NEXT = dqp->HL_NEXT = NULL; | |
139 | dqp->HL_PREVP = dqp->MPL_PREVP = NULL; | |
140 | dqp->q_bufoffset = 0; | |
141 | dqp->q_fileoffset = 0; | |
142 | dqp->q_transp = NULL; | |
143 | dqp->q_gdquot = NULL; | |
144 | dqp->q_res_bcount = 0; | |
145 | dqp->q_res_icount = 0; | |
146 | dqp->q_res_rtbcount = 0; | |
147 | dqp->q_pincount = 0; | |
148 | dqp->q_hash = NULL; | |
149 | ASSERT(dqp->dq_flnext == dqp->dq_flprev); | |
150 | ||
151 | #ifdef XFS_DQUOT_TRACE | |
152 | ASSERT(dqp->q_trace); | |
153 | xfs_dqtrace_entry(dqp, "DQRECLAIMED_INIT"); | |
154 | #endif | |
155 | } | |
156 | ||
157 | /* | |
158 | * log item gets initialized later | |
159 | */ | |
160 | return (dqp); | |
161 | } | |
162 | ||
163 | /* | |
164 | * This is called to free all the memory associated with a dquot | |
165 | */ | |
166 | void | |
167 | xfs_qm_dqdestroy( | |
168 | xfs_dquot_t *dqp) | |
169 | { | |
170 | ASSERT(! XFS_DQ_IS_ON_FREELIST(dqp)); | |
171 | ||
172 | mutex_destroy(&dqp->q_qlock); | |
173 | freesema(&dqp->q_flock); | |
174 | sv_destroy(&dqp->q_pinwait); | |
175 | ||
176 | #ifdef XFS_DQUOT_TRACE | |
177 | if (dqp->q_trace) | |
178 | ktrace_free(dqp->q_trace); | |
179 | dqp->q_trace = NULL; | |
180 | #endif | |
181 | kmem_zone_free(xfs_Gqm->qm_dqzone, dqp); | |
182 | atomic_dec(&xfs_Gqm->qm_totaldquots); | |
183 | } | |
184 | ||
185 | /* | |
186 | * This is what a 'fresh' dquot inside a dquot chunk looks like on disk. | |
187 | */ | |
188 | STATIC void | |
189 | xfs_qm_dqinit_core( | |
190 | xfs_dqid_t id, | |
191 | uint type, | |
192 | xfs_dqblk_t *d) | |
193 | { | |
194 | /* | |
195 | * Caller has zero'd the entire dquot 'chunk' already. | |
196 | */ | |
197 | INT_SET(d->dd_diskdq.d_magic, ARCH_CONVERT, XFS_DQUOT_MAGIC); | |
198 | INT_SET(d->dd_diskdq.d_version, ARCH_CONVERT, XFS_DQUOT_VERSION); | |
199 | INT_SET(d->dd_diskdq.d_id, ARCH_CONVERT, id); | |
200 | INT_SET(d->dd_diskdq.d_flags, ARCH_CONVERT, type); | |
201 | } | |
202 | ||
203 | ||
204 | #ifdef XFS_DQUOT_TRACE | |
205 | /* | |
206 | * Dquot tracing for debugging. | |
207 | */ | |
208 | /* ARGSUSED */ | |
209 | void | |
210 | __xfs_dqtrace_entry( | |
211 | xfs_dquot_t *dqp, | |
212 | char *func, | |
213 | void *retaddr, | |
214 | xfs_inode_t *ip) | |
215 | { | |
216 | xfs_dquot_t *udqp = NULL; | |
217 | xfs_ino_t ino = 0; | |
218 | ||
219 | ASSERT(dqp->q_trace); | |
220 | if (ip) { | |
221 | ino = ip->i_ino; | |
222 | udqp = ip->i_udquot; | |
223 | } | |
224 | ktrace_enter(dqp->q_trace, | |
225 | (void *)(__psint_t)DQUOT_KTRACE_ENTRY, | |
226 | (void *)func, | |
227 | (void *)(__psint_t)dqp->q_nrefs, | |
228 | (void *)(__psint_t)dqp->dq_flags, | |
229 | (void *)(__psint_t)dqp->q_res_bcount, | |
230 | (void *)(__psint_t)INT_GET(dqp->q_core.d_bcount, | |
231 | ARCH_CONVERT), | |
232 | (void *)(__psint_t)INT_GET(dqp->q_core.d_icount, | |
233 | ARCH_CONVERT), | |
234 | (void *)(__psint_t)INT_GET(dqp->q_core.d_blk_hardlimit, | |
235 | ARCH_CONVERT), | |
236 | (void *)(__psint_t)INT_GET(dqp->q_core.d_blk_softlimit, | |
237 | ARCH_CONVERT), | |
238 | (void *)(__psint_t)INT_GET(dqp->q_core.d_ino_hardlimit, | |
239 | ARCH_CONVERT), | |
240 | (void *)(__psint_t)INT_GET(dqp->q_core.d_ino_softlimit, | |
241 | ARCH_CONVERT), | |
242 | (void *)(__psint_t)INT_GET(dqp->q_core.d_id, ARCH_CONVERT), | |
243 | (void *)(__psint_t)current_pid(), | |
244 | (void *)(__psint_t)ino, | |
245 | (void *)(__psint_t)retaddr, | |
246 | (void *)(__psint_t)udqp); | |
247 | return; | |
248 | } | |
249 | #endif | |
250 | ||
251 | ||
252 | /* | |
253 | * If default limits are in force, push them into the dquot now. | |
254 | * We overwrite the dquot limits only if they are zero and this | |
255 | * is not the root dquot. | |
256 | */ | |
257 | void | |
258 | xfs_qm_adjust_dqlimits( | |
259 | xfs_mount_t *mp, | |
260 | xfs_disk_dquot_t *d) | |
261 | { | |
262 | xfs_quotainfo_t *q = mp->m_quotainfo; | |
263 | ||
264 | ASSERT(d->d_id); | |
265 | ||
266 | if (q->qi_bsoftlimit && !d->d_blk_softlimit) | |
267 | INT_SET(d->d_blk_softlimit, ARCH_CONVERT, q->qi_bsoftlimit); | |
268 | if (q->qi_bhardlimit && !d->d_blk_hardlimit) | |
269 | INT_SET(d->d_blk_hardlimit, ARCH_CONVERT, q->qi_bhardlimit); | |
270 | if (q->qi_isoftlimit && !d->d_ino_softlimit) | |
271 | INT_SET(d->d_ino_softlimit, ARCH_CONVERT, q->qi_isoftlimit); | |
272 | if (q->qi_ihardlimit && !d->d_ino_hardlimit) | |
273 | INT_SET(d->d_ino_hardlimit, ARCH_CONVERT, q->qi_ihardlimit); | |
274 | if (q->qi_rtbsoftlimit && !d->d_rtb_softlimit) | |
275 | INT_SET(d->d_rtb_softlimit, ARCH_CONVERT, q->qi_rtbsoftlimit); | |
276 | if (q->qi_rtbhardlimit && !d->d_rtb_hardlimit) | |
277 | INT_SET(d->d_rtb_hardlimit, ARCH_CONVERT, q->qi_rtbhardlimit); | |
278 | } | |
279 | ||
280 | /* | |
281 | * Check the limits and timers of a dquot and start or reset timers | |
282 | * if necessary. | |
283 | * This gets called even when quota enforcement is OFF, which makes our | |
284 | * life a little less complicated. (We just don't reject any quota | |
285 | * reservations in that case, when enforcement is off). | |
286 | * We also return 0 as the values of the timers in Q_GETQUOTA calls, when | |
287 | * enforcement's off. | |
288 | * In contrast, warnings are a little different in that they don't | |
289 | * 'automatically' get started when limits get exceeded. | |
290 | */ | |
291 | void | |
292 | xfs_qm_adjust_dqtimers( | |
293 | xfs_mount_t *mp, | |
294 | xfs_disk_dquot_t *d) | |
295 | { | |
296 | ASSERT(d->d_id); | |
297 | ||
298 | #ifdef QUOTADEBUG | |
299 | if (INT_GET(d->d_blk_hardlimit, ARCH_CONVERT)) | |
300 | ASSERT(INT_GET(d->d_blk_softlimit, ARCH_CONVERT) <= | |
301 | INT_GET(d->d_blk_hardlimit, ARCH_CONVERT)); | |
302 | if (INT_GET(d->d_ino_hardlimit, ARCH_CONVERT)) | |
303 | ASSERT(INT_GET(d->d_ino_softlimit, ARCH_CONVERT) <= | |
304 | INT_GET(d->d_ino_hardlimit, ARCH_CONVERT)); | |
305 | if (INT_GET(d->d_rtb_hardlimit, ARCH_CONVERT)) | |
306 | ASSERT(INT_GET(d->d_rtb_softlimit, ARCH_CONVERT) <= | |
307 | INT_GET(d->d_rtb_hardlimit, ARCH_CONVERT)); | |
308 | #endif | |
309 | if (!d->d_btimer) { | |
310 | if ((INT_GET(d->d_blk_softlimit, ARCH_CONVERT) && | |
311 | (INT_GET(d->d_bcount, ARCH_CONVERT) >= | |
312 | INT_GET(d->d_blk_softlimit, ARCH_CONVERT))) || | |
313 | (INT_GET(d->d_blk_hardlimit, ARCH_CONVERT) && | |
314 | (INT_GET(d->d_bcount, ARCH_CONVERT) >= | |
315 | INT_GET(d->d_blk_hardlimit, ARCH_CONVERT)))) { | |
316 | INT_SET(d->d_btimer, ARCH_CONVERT, | |
317 | get_seconds() + XFS_QI_BTIMELIMIT(mp)); | |
318 | } | |
319 | } else { | |
320 | if ((!d->d_blk_softlimit || | |
321 | (INT_GET(d->d_bcount, ARCH_CONVERT) < | |
322 | INT_GET(d->d_blk_softlimit, ARCH_CONVERT))) && | |
323 | (!d->d_blk_hardlimit || | |
324 | (INT_GET(d->d_bcount, ARCH_CONVERT) < | |
325 | INT_GET(d->d_blk_hardlimit, ARCH_CONVERT)))) { | |
326 | d->d_btimer = 0; | |
327 | } | |
328 | } | |
329 | ||
330 | if (!d->d_itimer) { | |
331 | if ((INT_GET(d->d_ino_softlimit, ARCH_CONVERT) && | |
332 | (INT_GET(d->d_icount, ARCH_CONVERT) >= | |
333 | INT_GET(d->d_ino_softlimit, ARCH_CONVERT))) || | |
334 | (INT_GET(d->d_ino_hardlimit, ARCH_CONVERT) && | |
335 | (INT_GET(d->d_icount, ARCH_CONVERT) >= | |
336 | INT_GET(d->d_ino_hardlimit, ARCH_CONVERT)))) { | |
337 | INT_SET(d->d_itimer, ARCH_CONVERT, | |
338 | get_seconds() + XFS_QI_ITIMELIMIT(mp)); | |
339 | } | |
340 | } else { | |
341 | if ((!d->d_ino_softlimit || | |
342 | (INT_GET(d->d_icount, ARCH_CONVERT) < | |
343 | INT_GET(d->d_ino_softlimit, ARCH_CONVERT))) && | |
344 | (!d->d_ino_hardlimit || | |
345 | (INT_GET(d->d_icount, ARCH_CONVERT) < | |
346 | INT_GET(d->d_ino_hardlimit, ARCH_CONVERT)))) { | |
347 | d->d_itimer = 0; | |
348 | } | |
349 | } | |
350 | ||
351 | if (!d->d_rtbtimer) { | |
352 | if ((INT_GET(d->d_rtb_softlimit, ARCH_CONVERT) && | |
353 | (INT_GET(d->d_rtbcount, ARCH_CONVERT) >= | |
354 | INT_GET(d->d_rtb_softlimit, ARCH_CONVERT))) || | |
355 | (INT_GET(d->d_rtb_hardlimit, ARCH_CONVERT) && | |
356 | (INT_GET(d->d_rtbcount, ARCH_CONVERT) >= | |
357 | INT_GET(d->d_rtb_hardlimit, ARCH_CONVERT)))) { | |
358 | INT_SET(d->d_rtbtimer, ARCH_CONVERT, | |
359 | get_seconds() + XFS_QI_RTBTIMELIMIT(mp)); | |
360 | } | |
361 | } else { | |
362 | if ((!d->d_rtb_softlimit || | |
363 | (INT_GET(d->d_rtbcount, ARCH_CONVERT) < | |
364 | INT_GET(d->d_rtb_softlimit, ARCH_CONVERT))) && | |
365 | (!d->d_rtb_hardlimit || | |
366 | (INT_GET(d->d_rtbcount, ARCH_CONVERT) < | |
367 | INT_GET(d->d_rtb_hardlimit, ARCH_CONVERT)))) { | |
368 | d->d_rtbtimer = 0; | |
369 | } | |
370 | } | |
371 | } | |
372 | ||
1da177e4 LT |
373 | /* |
374 | * initialize a buffer full of dquots and log the whole thing | |
375 | */ | |
376 | STATIC void | |
377 | xfs_qm_init_dquot_blk( | |
378 | xfs_trans_t *tp, | |
379 | xfs_mount_t *mp, | |
380 | xfs_dqid_t id, | |
381 | uint type, | |
382 | xfs_buf_t *bp) | |
383 | { | |
384 | xfs_dqblk_t *d; | |
385 | int curid, i; | |
386 | ||
387 | ASSERT(tp); | |
388 | ASSERT(XFS_BUF_ISBUSY(bp)); | |
389 | ASSERT(XFS_BUF_VALUSEMA(bp) <= 0); | |
390 | ||
391 | d = (xfs_dqblk_t *)XFS_BUF_PTR(bp); | |
392 | ||
393 | /* | |
394 | * ID of the first dquot in the block - id's are zero based. | |
395 | */ | |
396 | curid = id - (id % XFS_QM_DQPERBLK(mp)); | |
397 | ASSERT(curid >= 0); | |
398 | memset(d, 0, BBTOB(XFS_QI_DQCHUNKLEN(mp))); | |
399 | for (i = 0; i < XFS_QM_DQPERBLK(mp); i++, d++, curid++) | |
400 | xfs_qm_dqinit_core(curid, type, d); | |
401 | xfs_trans_dquot_buf(tp, bp, | |
402 | type & XFS_DQ_USER ? | |
403 | XFS_BLI_UDQUOT_BUF : | |
404 | XFS_BLI_GDQUOT_BUF); | |
405 | xfs_trans_log_buf(tp, bp, 0, BBTOB(XFS_QI_DQCHUNKLEN(mp)) - 1); | |
406 | } | |
407 | ||
408 | ||
409 | ||
410 | /* | |
411 | * Allocate a block and fill it with dquots. | |
412 | * This is called when the bmapi finds a hole. | |
413 | */ | |
414 | STATIC int | |
415 | xfs_qm_dqalloc( | |
416 | xfs_trans_t *tp, | |
417 | xfs_mount_t *mp, | |
418 | xfs_dquot_t *dqp, | |
419 | xfs_inode_t *quotip, | |
420 | xfs_fileoff_t offset_fsb, | |
421 | xfs_buf_t **O_bpp) | |
422 | { | |
423 | xfs_fsblock_t firstblock; | |
424 | xfs_bmap_free_t flist; | |
425 | xfs_bmbt_irec_t map; | |
426 | int nmaps, error, committed; | |
427 | xfs_buf_t *bp; | |
428 | ||
429 | ASSERT(tp != NULL); | |
430 | xfs_dqtrace_entry(dqp, "DQALLOC"); | |
431 | ||
432 | /* | |
433 | * Initialize the bmap freelist prior to calling bmapi code. | |
434 | */ | |
435 | XFS_BMAP_INIT(&flist, &firstblock); | |
436 | xfs_ilock(quotip, XFS_ILOCK_EXCL); | |
437 | /* | |
438 | * Return if this type of quotas is turned off while we didn't | |
439 | * have an inode lock | |
440 | */ | |
441 | if (XFS_IS_THIS_QUOTA_OFF(dqp)) { | |
442 | xfs_iunlock(quotip, XFS_ILOCK_EXCL); | |
443 | return (ESRCH); | |
444 | } | |
445 | ||
446 | /* | |
447 | * xfs_trans_commit normally decrements the vnode ref count | |
448 | * when it unlocks the inode. Since we want to keep the quota | |
449 | * inode around, we bump the vnode ref count now. | |
450 | */ | |
451 | VN_HOLD(XFS_ITOV(quotip)); | |
452 | ||
453 | xfs_trans_ijoin(tp, quotip, XFS_ILOCK_EXCL); | |
454 | nmaps = 1; | |
455 | if ((error = xfs_bmapi(tp, quotip, | |
456 | offset_fsb, XFS_DQUOT_CLUSTER_SIZE_FSB, | |
457 | XFS_BMAPI_METADATA | XFS_BMAPI_WRITE, | |
458 | &firstblock, | |
459 | XFS_QM_DQALLOC_SPACE_RES(mp), | |
460 | &map, &nmaps, &flist))) { | |
461 | goto error0; | |
462 | } | |
463 | ASSERT(map.br_blockcount == XFS_DQUOT_CLUSTER_SIZE_FSB); | |
464 | ASSERT(nmaps == 1); | |
465 | ASSERT((map.br_startblock != DELAYSTARTBLOCK) && | |
466 | (map.br_startblock != HOLESTARTBLOCK)); | |
467 | ||
468 | /* | |
469 | * Keep track of the blkno to save a lookup later | |
470 | */ | |
471 | dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock); | |
472 | ||
473 | /* now we can just get the buffer (there's nothing to read yet) */ | |
474 | bp = xfs_trans_get_buf(tp, mp->m_ddev_targp, | |
475 | dqp->q_blkno, | |
476 | XFS_QI_DQCHUNKLEN(mp), | |
477 | 0); | |
478 | if (!bp || (error = XFS_BUF_GETERROR(bp))) | |
479 | goto error1; | |
480 | /* | |
481 | * Make a chunk of dquots out of this buffer and log | |
482 | * the entire thing. | |
483 | */ | |
484 | xfs_qm_init_dquot_blk(tp, mp, INT_GET(dqp->q_core.d_id, ARCH_CONVERT), | |
485 | dqp->dq_flags & (XFS_DQ_USER|XFS_DQ_GROUP), | |
486 | bp); | |
487 | ||
488 | if ((error = xfs_bmap_finish(&tp, &flist, firstblock, &committed))) { | |
489 | goto error1; | |
490 | } | |
491 | ||
492 | *O_bpp = bp; | |
493 | return 0; | |
494 | ||
495 | error1: | |
496 | xfs_bmap_cancel(&flist); | |
497 | error0: | |
498 | xfs_iunlock(quotip, XFS_ILOCK_EXCL); | |
499 | ||
500 | return (error); | |
501 | } | |
502 | ||
503 | /* | |
504 | * Maps a dquot to the buffer containing its on-disk version. | |
505 | * This returns a ptr to the buffer containing the on-disk dquot | |
506 | * in the bpp param, and a ptr to the on-disk dquot within that buffer | |
507 | */ | |
508 | STATIC int | |
509 | xfs_qm_dqtobp( | |
510 | xfs_trans_t *tp, | |
511 | xfs_dquot_t *dqp, | |
512 | xfs_disk_dquot_t **O_ddpp, | |
513 | xfs_buf_t **O_bpp, | |
514 | uint flags) | |
515 | { | |
516 | xfs_bmbt_irec_t map; | |
517 | int nmaps, error; | |
518 | xfs_buf_t *bp; | |
519 | xfs_inode_t *quotip; | |
520 | xfs_mount_t *mp; | |
521 | xfs_disk_dquot_t *ddq; | |
522 | xfs_dqid_t id; | |
523 | boolean_t newdquot; | |
524 | ||
525 | mp = dqp->q_mount; | |
526 | id = INT_GET(dqp->q_core.d_id, ARCH_CONVERT); | |
527 | nmaps = 1; | |
528 | newdquot = B_FALSE; | |
529 | ||
530 | /* | |
531 | * If we don't know where the dquot lives, find out. | |
532 | */ | |
533 | if (dqp->q_blkno == (xfs_daddr_t) 0) { | |
534 | /* We use the id as an index */ | |
535 | dqp->q_fileoffset = (xfs_fileoff_t) ((uint)id / | |
536 | XFS_QM_DQPERBLK(mp)); | |
537 | nmaps = 1; | |
538 | quotip = XFS_DQ_TO_QIP(dqp); | |
539 | xfs_ilock(quotip, XFS_ILOCK_SHARED); | |
540 | /* | |
541 | * Return if this type of quotas is turned off while we didn't | |
542 | * have an inode lock | |
543 | */ | |
544 | if (XFS_IS_THIS_QUOTA_OFF(dqp)) { | |
545 | xfs_iunlock(quotip, XFS_ILOCK_SHARED); | |
546 | return (ESRCH); | |
547 | } | |
548 | /* | |
549 | * Find the block map; no allocations yet | |
550 | */ | |
551 | error = xfs_bmapi(NULL, quotip, dqp->q_fileoffset, | |
552 | XFS_DQUOT_CLUSTER_SIZE_FSB, | |
553 | XFS_BMAPI_METADATA, | |
554 | NULL, 0, &map, &nmaps, NULL); | |
555 | ||
556 | xfs_iunlock(quotip, XFS_ILOCK_SHARED); | |
557 | if (error) | |
558 | return (error); | |
559 | ASSERT(nmaps == 1); | |
560 | ASSERT(map.br_blockcount == 1); | |
561 | ||
562 | /* | |
563 | * offset of dquot in the (fixed sized) dquot chunk. | |
564 | */ | |
565 | dqp->q_bufoffset = (id % XFS_QM_DQPERBLK(mp)) * | |
566 | sizeof(xfs_dqblk_t); | |
567 | if (map.br_startblock == HOLESTARTBLOCK) { | |
568 | /* | |
569 | * We don't allocate unless we're asked to | |
570 | */ | |
571 | if (!(flags & XFS_QMOPT_DQALLOC)) | |
572 | return (ENOENT); | |
573 | ||
574 | ASSERT(tp); | |
575 | if ((error = xfs_qm_dqalloc(tp, mp, dqp, quotip, | |
576 | dqp->q_fileoffset, &bp))) | |
577 | return (error); | |
578 | newdquot = B_TRUE; | |
579 | } else { | |
580 | /* | |
581 | * store the blkno etc so that we don't have to do the | |
582 | * mapping all the time | |
583 | */ | |
584 | dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock); | |
585 | } | |
586 | } | |
587 | ASSERT(dqp->q_blkno != DELAYSTARTBLOCK); | |
588 | ASSERT(dqp->q_blkno != HOLESTARTBLOCK); | |
589 | ||
590 | /* | |
591 | * Read in the buffer, unless we've just done the allocation | |
592 | * (in which case we already have the buf). | |
593 | */ | |
594 | if (! newdquot) { | |
595 | xfs_dqtrace_entry(dqp, "DQTOBP READBUF"); | |
596 | if ((error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, | |
597 | dqp->q_blkno, | |
598 | XFS_QI_DQCHUNKLEN(mp), | |
599 | 0, &bp))) { | |
600 | return (error); | |
601 | } | |
602 | if (error || !bp) | |
603 | return XFS_ERROR(error); | |
604 | } | |
605 | ASSERT(XFS_BUF_ISBUSY(bp)); | |
606 | ASSERT(XFS_BUF_VALUSEMA(bp) <= 0); | |
607 | ||
608 | /* | |
609 | * calculate the location of the dquot inside the buffer. | |
610 | */ | |
611 | ddq = (xfs_disk_dquot_t *)((char *)XFS_BUF_PTR(bp) + dqp->q_bufoffset); | |
612 | ||
613 | /* | |
614 | * A simple sanity check in case we got a corrupted dquot... | |
615 | */ | |
616 | if (xfs_qm_dqcheck(ddq, id, | |
617 | dqp->dq_flags & (XFS_DQ_USER|XFS_DQ_GROUP), | |
618 | flags & (XFS_QMOPT_DQREPAIR|XFS_QMOPT_DOWARN), | |
619 | "dqtobp")) { | |
620 | if (!(flags & XFS_QMOPT_DQREPAIR)) { | |
621 | xfs_trans_brelse(tp, bp); | |
622 | return XFS_ERROR(EIO); | |
623 | } | |
624 | XFS_BUF_BUSY(bp); /* We dirtied this */ | |
625 | } | |
626 | ||
627 | *O_bpp = bp; | |
628 | *O_ddpp = ddq; | |
629 | ||
630 | return (0); | |
631 | } | |
632 | ||
633 | ||
634 | /* | |
635 | * Read in the ondisk dquot using dqtobp() then copy it to an incore version, | |
636 | * and release the buffer immediately. | |
637 | * | |
638 | */ | |
639 | /* ARGSUSED */ | |
640 | STATIC int | |
641 | xfs_qm_dqread( | |
642 | xfs_trans_t *tp, | |
643 | xfs_dqid_t id, | |
644 | xfs_dquot_t *dqp, /* dquot to get filled in */ | |
645 | uint flags) | |
646 | { | |
647 | xfs_disk_dquot_t *ddqp; | |
648 | xfs_buf_t *bp; | |
649 | int error; | |
650 | ||
651 | /* | |
652 | * get a pointer to the on-disk dquot and the buffer containing it | |
653 | * dqp already knows its own type (GROUP/USER). | |
654 | */ | |
655 | xfs_dqtrace_entry(dqp, "DQREAD"); | |
656 | if ((error = xfs_qm_dqtobp(tp, dqp, &ddqp, &bp, flags))) { | |
657 | return (error); | |
658 | } | |
659 | ||
660 | /* copy everything from disk dquot to the incore dquot */ | |
661 | memcpy(&dqp->q_core, ddqp, sizeof(xfs_disk_dquot_t)); | |
662 | ASSERT(INT_GET(dqp->q_core.d_id, ARCH_CONVERT) == id); | |
663 | xfs_qm_dquot_logitem_init(dqp); | |
664 | ||
665 | /* | |
666 | * Reservation counters are defined as reservation plus current usage | |
667 | * to avoid having to add everytime. | |
668 | */ | |
669 | dqp->q_res_bcount = INT_GET(ddqp->d_bcount, ARCH_CONVERT); | |
670 | dqp->q_res_icount = INT_GET(ddqp->d_icount, ARCH_CONVERT); | |
671 | dqp->q_res_rtbcount = INT_GET(ddqp->d_rtbcount, ARCH_CONVERT); | |
672 | ||
673 | /* Mark the buf so that this will stay incore a little longer */ | |
674 | XFS_BUF_SET_VTYPE_REF(bp, B_FS_DQUOT, XFS_DQUOT_REF); | |
675 | ||
676 | /* | |
677 | * We got the buffer with a xfs_trans_read_buf() (in dqtobp()) | |
678 | * So we need to release with xfs_trans_brelse(). | |
679 | * The strategy here is identical to that of inodes; we lock | |
680 | * the dquot in xfs_qm_dqget() before making it accessible to | |
681 | * others. This is because dquots, like inodes, need a good level of | |
682 | * concurrency, and we don't want to take locks on the entire buffers | |
683 | * for dquot accesses. | |
684 | * Note also that the dquot buffer may even be dirty at this point, if | |
685 | * this particular dquot was repaired. We still aren't afraid to | |
686 | * brelse it because we have the changes incore. | |
687 | */ | |
688 | ASSERT(XFS_BUF_ISBUSY(bp)); | |
689 | ASSERT(XFS_BUF_VALUSEMA(bp) <= 0); | |
690 | xfs_trans_brelse(tp, bp); | |
691 | ||
692 | return (error); | |
693 | } | |
694 | ||
695 | ||
696 | /* | |
697 | * allocate an incore dquot from the kernel heap, | |
698 | * and fill its core with quota information kept on disk. | |
699 | * If XFS_QMOPT_DQALLOC is set, it'll allocate a dquot on disk | |
700 | * if it wasn't already allocated. | |
701 | */ | |
702 | STATIC int | |
703 | xfs_qm_idtodq( | |
704 | xfs_mount_t *mp, | |
705 | xfs_dqid_t id, /* gid or uid, depending on type */ | |
706 | uint type, /* UDQUOT or GDQUOT */ | |
707 | uint flags, /* DQALLOC, DQREPAIR */ | |
708 | xfs_dquot_t **O_dqpp)/* OUT : incore dquot, not locked */ | |
709 | { | |
710 | xfs_dquot_t *dqp; | |
711 | int error; | |
712 | xfs_trans_t *tp; | |
713 | int cancelflags=0; | |
714 | ||
715 | dqp = xfs_qm_dqinit(mp, id, type); | |
716 | tp = NULL; | |
717 | if (flags & XFS_QMOPT_DQALLOC) { | |
718 | tp = xfs_trans_alloc(mp, XFS_TRANS_QM_DQALLOC); | |
719 | if ((error = xfs_trans_reserve(tp, | |
720 | XFS_QM_DQALLOC_SPACE_RES(mp), | |
721 | XFS_WRITE_LOG_RES(mp) + | |
722 | BBTOB(XFS_QI_DQCHUNKLEN(mp)) - 1 + | |
723 | 128, | |
724 | 0, | |
725 | XFS_TRANS_PERM_LOG_RES, | |
726 | XFS_WRITE_LOG_COUNT))) { | |
727 | cancelflags = 0; | |
728 | goto error0; | |
729 | } | |
730 | cancelflags = XFS_TRANS_RELEASE_LOG_RES; | |
731 | } | |
732 | ||
733 | /* | |
734 | * Read it from disk; xfs_dqread() takes care of | |
735 | * all the necessary initialization of dquot's fields (locks, etc) | |
736 | */ | |
737 | if ((error = xfs_qm_dqread(tp, id, dqp, flags))) { | |
738 | /* | |
739 | * This can happen if quotas got turned off (ESRCH), | |
740 | * or if the dquot didn't exist on disk and we ask to | |
741 | * allocate (ENOENT). | |
742 | */ | |
743 | xfs_dqtrace_entry(dqp, "DQREAD FAIL"); | |
744 | cancelflags |= XFS_TRANS_ABORT; | |
745 | goto error0; | |
746 | } | |
747 | if (tp) { | |
748 | if ((error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES, | |
749 | NULL))) | |
750 | goto error1; | |
751 | } | |
752 | ||
753 | *O_dqpp = dqp; | |
754 | return (0); | |
755 | ||
756 | error0: | |
757 | ASSERT(error); | |
758 | if (tp) | |
759 | xfs_trans_cancel(tp, cancelflags); | |
760 | error1: | |
761 | xfs_qm_dqdestroy(dqp); | |
762 | *O_dqpp = NULL; | |
763 | return (error); | |
764 | } | |
765 | ||
766 | /* | |
767 | * Lookup a dquot in the incore dquot hashtable. We keep two separate | |
768 | * hashtables for user and group dquots; and, these are global tables | |
769 | * inside the XQM, not per-filesystem tables. | |
770 | * The hash chain must be locked by caller, and it is left locked | |
771 | * on return. Returning dquot is locked. | |
772 | */ | |
773 | STATIC int | |
774 | xfs_qm_dqlookup( | |
775 | xfs_mount_t *mp, | |
776 | xfs_dqid_t id, | |
777 | xfs_dqhash_t *qh, | |
778 | xfs_dquot_t **O_dqpp) | |
779 | { | |
780 | xfs_dquot_t *dqp; | |
781 | uint flist_locked; | |
782 | xfs_dquot_t *d; | |
783 | ||
784 | ASSERT(XFS_DQ_IS_HASH_LOCKED(qh)); | |
785 | ||
786 | flist_locked = B_FALSE; | |
787 | ||
788 | /* | |
789 | * Traverse the hashchain looking for a match | |
790 | */ | |
791 | for (dqp = qh->qh_next; dqp != NULL; dqp = dqp->HL_NEXT) { | |
792 | /* | |
793 | * We already have the hashlock. We don't need the | |
794 | * dqlock to look at the id field of the dquot, since the | |
795 | * id can't be modified without the hashlock anyway. | |
796 | */ | |
797 | if (INT_GET(dqp->q_core.d_id, ARCH_CONVERT) == id && dqp->q_mount == mp) { | |
798 | xfs_dqtrace_entry(dqp, "DQFOUND BY LOOKUP"); | |
799 | /* | |
800 | * All in core dquots must be on the dqlist of mp | |
801 | */ | |
802 | ASSERT(dqp->MPL_PREVP != NULL); | |
803 | ||
804 | xfs_dqlock(dqp); | |
805 | if (dqp->q_nrefs == 0) { | |
806 | ASSERT (XFS_DQ_IS_ON_FREELIST(dqp)); | |
807 | if (! xfs_qm_freelist_lock_nowait(xfs_Gqm)) { | |
808 | xfs_dqtrace_entry(dqp, "DQLOOKUP: WANT"); | |
809 | ||
810 | /* | |
811 | * We may have raced with dqreclaim_one() | |
812 | * (and lost). So, flag that we don't | |
813 | * want the dquot to be reclaimed. | |
814 | */ | |
815 | dqp->dq_flags |= XFS_DQ_WANT; | |
816 | xfs_dqunlock(dqp); | |
817 | xfs_qm_freelist_lock(xfs_Gqm); | |
818 | xfs_dqlock(dqp); | |
819 | dqp->dq_flags &= ~(XFS_DQ_WANT); | |
820 | } | |
821 | flist_locked = B_TRUE; | |
822 | } | |
823 | ||
824 | /* | |
825 | * id couldn't have changed; we had the hashlock all | |
826 | * along | |
827 | */ | |
828 | ASSERT(INT_GET(dqp->q_core.d_id, ARCH_CONVERT) == id); | |
829 | ||
830 | if (flist_locked) { | |
831 | if (dqp->q_nrefs != 0) { | |
832 | xfs_qm_freelist_unlock(xfs_Gqm); | |
833 | flist_locked = B_FALSE; | |
834 | } else { | |
835 | /* | |
836 | * take it off the freelist | |
837 | */ | |
838 | xfs_dqtrace_entry(dqp, | |
839 | "DQLOOKUP: TAKEOFF FL"); | |
840 | XQM_FREELIST_REMOVE(dqp); | |
841 | /* xfs_qm_freelist_print(&(xfs_Gqm-> | |
842 | qm_dqfreelist), | |
843 | "after removal"); */ | |
844 | } | |
845 | } | |
846 | ||
847 | /* | |
848 | * grab a reference | |
849 | */ | |
850 | XFS_DQHOLD(dqp); | |
851 | ||
852 | if (flist_locked) | |
853 | xfs_qm_freelist_unlock(xfs_Gqm); | |
854 | /* | |
855 | * move the dquot to the front of the hashchain | |
856 | */ | |
857 | ASSERT(XFS_DQ_IS_HASH_LOCKED(qh)); | |
858 | if (dqp->HL_PREVP != &qh->qh_next) { | |
859 | xfs_dqtrace_entry(dqp, | |
860 | "DQLOOKUP: HASH MOVETOFRONT"); | |
861 | if ((d = dqp->HL_NEXT)) | |
862 | d->HL_PREVP = dqp->HL_PREVP; | |
863 | *(dqp->HL_PREVP) = d; | |
864 | d = qh->qh_next; | |
865 | d->HL_PREVP = &dqp->HL_NEXT; | |
866 | dqp->HL_NEXT = d; | |
867 | dqp->HL_PREVP = &qh->qh_next; | |
868 | qh->qh_next = dqp; | |
869 | } | |
870 | xfs_dqtrace_entry(dqp, "LOOKUP END"); | |
871 | *O_dqpp = dqp; | |
872 | ASSERT(XFS_DQ_IS_HASH_LOCKED(qh)); | |
873 | return (0); | |
874 | } | |
875 | } | |
876 | ||
877 | *O_dqpp = NULL; | |
878 | ASSERT(XFS_DQ_IS_HASH_LOCKED(qh)); | |
879 | return (1); | |
880 | } | |
881 | ||
882 | /* | |
883 | * Given the file system, inode OR id, and type (UDQUOT/GDQUOT), return a | |
884 | * a locked dquot, doing an allocation (if requested) as needed. | |
885 | * When both an inode and an id are given, the inode's id takes precedence. | |
886 | * That is, if the id changes while we don't hold the ilock inside this | |
887 | * function, the new dquot is returned, not necessarily the one requested | |
888 | * in the id argument. | |
889 | */ | |
890 | int | |
891 | xfs_qm_dqget( | |
892 | xfs_mount_t *mp, | |
893 | xfs_inode_t *ip, /* locked inode (optional) */ | |
894 | xfs_dqid_t id, /* gid or uid, depending on type */ | |
895 | uint type, /* UDQUOT or GDQUOT */ | |
896 | uint flags, /* DQALLOC, DQSUSER, DQREPAIR, DOWARN */ | |
897 | xfs_dquot_t **O_dqpp) /* OUT : locked incore dquot */ | |
898 | { | |
899 | xfs_dquot_t *dqp; | |
900 | xfs_dqhash_t *h; | |
901 | uint version; | |
902 | int error; | |
903 | ||
904 | ASSERT(XFS_IS_QUOTA_RUNNING(mp)); | |
905 | if ((! XFS_IS_UQUOTA_ON(mp) && type == XFS_DQ_USER) || | |
906 | (! XFS_IS_GQUOTA_ON(mp) && type == XFS_DQ_GROUP)) { | |
907 | return (ESRCH); | |
908 | } | |
909 | h = XFS_DQ_HASH(mp, id, type); | |
910 | ||
911 | #ifdef DEBUG | |
912 | if (xfs_do_dqerror) { | |
913 | if ((xfs_dqerror_target == mp->m_ddev_targp) && | |
914 | (xfs_dqreq_num++ % xfs_dqerror_mod) == 0) { | |
915 | cmn_err(CE_DEBUG, "Returning error in dqget"); | |
916 | return (EIO); | |
917 | } | |
918 | } | |
919 | #endif | |
920 | ||
921 | again: | |
922 | ||
923 | #ifdef DEBUG | |
924 | ASSERT(type == XFS_DQ_USER || type == XFS_DQ_GROUP); | |
925 | if (ip) { | |
926 | ASSERT(XFS_ISLOCKED_INODE_EXCL(ip)); | |
927 | if (type == XFS_DQ_USER) | |
928 | ASSERT(ip->i_udquot == NULL); | |
929 | else | |
930 | ASSERT(ip->i_gdquot == NULL); | |
931 | } | |
932 | #endif | |
933 | XFS_DQ_HASH_LOCK(h); | |
934 | ||
935 | /* | |
936 | * Look in the cache (hashtable). | |
937 | * The chain is kept locked during lookup. | |
938 | */ | |
939 | if (xfs_qm_dqlookup(mp, id, h, O_dqpp) == 0) { | |
940 | XQM_STATS_INC(xqmstats.xs_qm_dqcachehits); | |
941 | /* | |
942 | * The dquot was found, moved to the front of the chain, | |
943 | * taken off the freelist if it was on it, and locked | |
944 | * at this point. Just unlock the hashchain and return. | |
945 | */ | |
946 | ASSERT(*O_dqpp); | |
947 | ASSERT(XFS_DQ_IS_LOCKED(*O_dqpp)); | |
948 | XFS_DQ_HASH_UNLOCK(h); | |
949 | xfs_dqtrace_entry(*O_dqpp, "DQGET DONE (FROM CACHE)"); | |
950 | return (0); /* success */ | |
951 | } | |
952 | XQM_STATS_INC(xqmstats.xs_qm_dqcachemisses); | |
953 | ||
954 | /* | |
955 | * Dquot cache miss. We don't want to keep the inode lock across | |
956 | * a (potential) disk read. Also we don't want to deal with the lock | |
957 | * ordering between quotainode and this inode. OTOH, dropping the inode | |
958 | * lock here means dealing with a chown that can happen before | |
959 | * we re-acquire the lock. | |
960 | */ | |
961 | if (ip) | |
962 | xfs_iunlock(ip, XFS_ILOCK_EXCL); | |
963 | /* | |
964 | * Save the hashchain version stamp, and unlock the chain, so that | |
965 | * we don't keep the lock across a disk read | |
966 | */ | |
967 | version = h->qh_version; | |
968 | XFS_DQ_HASH_UNLOCK(h); | |
969 | ||
970 | /* | |
971 | * Allocate the dquot on the kernel heap, and read the ondisk | |
972 | * portion off the disk. Also, do all the necessary initialization | |
973 | * This can return ENOENT if dquot didn't exist on disk and we didn't | |
974 | * ask it to allocate; ESRCH if quotas got turned off suddenly. | |
975 | */ | |
976 | if ((error = xfs_qm_idtodq(mp, id, type, | |
977 | flags & (XFS_QMOPT_DQALLOC|XFS_QMOPT_DQREPAIR| | |
978 | XFS_QMOPT_DOWARN), | |
979 | &dqp))) { | |
980 | if (ip) | |
981 | xfs_ilock(ip, XFS_ILOCK_EXCL); | |
982 | return (error); | |
983 | } | |
984 | ||
985 | /* | |
986 | * See if this is mount code calling to look at the overall quota limits | |
987 | * which are stored in the id == 0 user or group's dquot. | |
988 | * Since we may not have done a quotacheck by this point, just return | |
989 | * the dquot without attaching it to any hashtables, lists, etc, or even | |
990 | * taking a reference. | |
991 | * The caller must dqdestroy this once done. | |
992 | */ | |
993 | if (flags & XFS_QMOPT_DQSUSER) { | |
994 | ASSERT(id == 0); | |
995 | ASSERT(! ip); | |
996 | goto dqret; | |
997 | } | |
998 | ||
999 | /* | |
1000 | * Dquot lock comes after hashlock in the lock ordering | |
1001 | */ | |
1002 | if (ip) { | |
1003 | xfs_ilock(ip, XFS_ILOCK_EXCL); | |
1004 | if (! XFS_IS_DQTYPE_ON(mp, type)) { | |
1005 | /* inode stays locked on return */ | |
1006 | xfs_qm_dqdestroy(dqp); | |
1007 | return XFS_ERROR(ESRCH); | |
1008 | } | |
1009 | /* | |
1010 | * A dquot could be attached to this inode by now, since | |
1011 | * we had dropped the ilock. | |
1012 | */ | |
1013 | if (type == XFS_DQ_USER) { | |
1014 | if (ip->i_udquot) { | |
1015 | xfs_qm_dqdestroy(dqp); | |
1016 | dqp = ip->i_udquot; | |
1017 | xfs_dqlock(dqp); | |
1018 | goto dqret; | |
1019 | } | |
1020 | } else { | |
1021 | if (ip->i_gdquot) { | |
1022 | xfs_qm_dqdestroy(dqp); | |
1023 | dqp = ip->i_gdquot; | |
1024 | xfs_dqlock(dqp); | |
1025 | goto dqret; | |
1026 | } | |
1027 | } | |
1028 | } | |
1029 | ||
1030 | /* | |
1031 | * Hashlock comes after ilock in lock order | |
1032 | */ | |
1033 | XFS_DQ_HASH_LOCK(h); | |
1034 | if (version != h->qh_version) { | |
1035 | xfs_dquot_t *tmpdqp; | |
1036 | /* | |
1037 | * Now, see if somebody else put the dquot in the | |
1038 | * hashtable before us. This can happen because we didn't | |
1039 | * keep the hashchain lock. We don't have to worry about | |
1040 | * lock order between the two dquots here since dqp isn't | |
1041 | * on any findable lists yet. | |
1042 | */ | |
1043 | if (xfs_qm_dqlookup(mp, id, h, &tmpdqp) == 0) { | |
1044 | /* | |
1045 | * Duplicate found. Just throw away the new dquot | |
1046 | * and start over. | |
1047 | */ | |
1048 | xfs_qm_dqput(tmpdqp); | |
1049 | XFS_DQ_HASH_UNLOCK(h); | |
1050 | xfs_qm_dqdestroy(dqp); | |
1051 | XQM_STATS_INC(xqmstats.xs_qm_dquot_dups); | |
1052 | goto again; | |
1053 | } | |
1054 | } | |
1055 | ||
1056 | /* | |
1057 | * Put the dquot at the beginning of the hash-chain and mp's list | |
1058 | * LOCK ORDER: hashlock, freelistlock, mplistlock, udqlock, gdqlock .. | |
1059 | */ | |
1060 | ASSERT(XFS_DQ_IS_HASH_LOCKED(h)); | |
1061 | dqp->q_hash = h; | |
1062 | XQM_HASHLIST_INSERT(h, dqp); | |
1063 | ||
1064 | /* | |
1065 | * Attach this dquot to this filesystem's list of all dquots, | |
1066 | * kept inside the mount structure in m_quotainfo field | |
1067 | */ | |
1068 | xfs_qm_mplist_lock(mp); | |
1069 | ||
1070 | /* | |
1071 | * We return a locked dquot to the caller, with a reference taken | |
1072 | */ | |
1073 | xfs_dqlock(dqp); | |
1074 | dqp->q_nrefs = 1; | |
1075 | ||
1076 | XQM_MPLIST_INSERT(&(XFS_QI_MPL_LIST(mp)), dqp); | |
1077 | ||
1078 | xfs_qm_mplist_unlock(mp); | |
1079 | XFS_DQ_HASH_UNLOCK(h); | |
1080 | dqret: | |
1081 | ASSERT((ip == NULL) || XFS_ISLOCKED_INODE_EXCL(ip)); | |
1082 | xfs_dqtrace_entry(dqp, "DQGET DONE"); | |
1083 | *O_dqpp = dqp; | |
1084 | return (0); | |
1085 | } | |
1086 | ||
1087 | ||
1088 | /* | |
1089 | * Release a reference to the dquot (decrement ref-count) | |
1090 | * and unlock it. If there is a group quota attached to this | |
1091 | * dquot, carefully release that too without tripping over | |
1092 | * deadlocks'n'stuff. | |
1093 | */ | |
1094 | void | |
1095 | xfs_qm_dqput( | |
1096 | xfs_dquot_t *dqp) | |
1097 | { | |
1098 | xfs_dquot_t *gdqp; | |
1099 | ||
1100 | ASSERT(dqp->q_nrefs > 0); | |
1101 | ASSERT(XFS_DQ_IS_LOCKED(dqp)); | |
1102 | xfs_dqtrace_entry(dqp, "DQPUT"); | |
1103 | ||
1104 | if (dqp->q_nrefs != 1) { | |
1105 | dqp->q_nrefs--; | |
1106 | xfs_dqunlock(dqp); | |
1107 | return; | |
1108 | } | |
1109 | ||
1110 | /* | |
1111 | * drop the dqlock and acquire the freelist and dqlock | |
1112 | * in the right order; but try to get it out-of-order first | |
1113 | */ | |
1114 | if (! xfs_qm_freelist_lock_nowait(xfs_Gqm)) { | |
1115 | xfs_dqtrace_entry(dqp, "DQPUT: FLLOCK-WAIT"); | |
1116 | xfs_dqunlock(dqp); | |
1117 | xfs_qm_freelist_lock(xfs_Gqm); | |
1118 | xfs_dqlock(dqp); | |
1119 | } | |
1120 | ||
1121 | while (1) { | |
1122 | gdqp = NULL; | |
1123 | ||
1124 | /* We can't depend on nrefs being == 1 here */ | |
1125 | if (--dqp->q_nrefs == 0) { | |
1126 | xfs_dqtrace_entry(dqp, "DQPUT: ON FREELIST"); | |
1127 | /* | |
1128 | * insert at end of the freelist. | |
1129 | */ | |
1130 | XQM_FREELIST_INSERT(&(xfs_Gqm->qm_dqfreelist), dqp); | |
1131 | ||
1132 | /* | |
1133 | * If we just added a udquot to the freelist, then | |
1134 | * we want to release the gdquot reference that | |
1135 | * it (probably) has. Otherwise it'll keep the | |
1136 | * gdquot from getting reclaimed. | |
1137 | */ | |
1138 | if ((gdqp = dqp->q_gdquot)) { | |
1139 | /* | |
1140 | * Avoid a recursive dqput call | |
1141 | */ | |
1142 | xfs_dqlock(gdqp); | |
1143 | dqp->q_gdquot = NULL; | |
1144 | } | |
1145 | ||
1146 | /* xfs_qm_freelist_print(&(xfs_Gqm->qm_dqfreelist), | |
1147 | "@@@@@++ Free list (after append) @@@@@+"); | |
1148 | */ | |
1149 | } | |
1150 | xfs_dqunlock(dqp); | |
1151 | ||
1152 | /* | |
1153 | * If we had a group quota inside the user quota as a hint, | |
1154 | * release it now. | |
1155 | */ | |
1156 | if (! gdqp) | |
1157 | break; | |
1158 | dqp = gdqp; | |
1159 | } | |
1160 | xfs_qm_freelist_unlock(xfs_Gqm); | |
1161 | } | |
1162 | ||
1163 | /* | |
1164 | * Release a dquot. Flush it if dirty, then dqput() it. | |
1165 | * dquot must not be locked. | |
1166 | */ | |
1167 | void | |
1168 | xfs_qm_dqrele( | |
1169 | xfs_dquot_t *dqp) | |
1170 | { | |
1171 | ASSERT(dqp); | |
1172 | xfs_dqtrace_entry(dqp, "DQRELE"); | |
1173 | ||
1174 | xfs_dqlock(dqp); | |
1175 | /* | |
1176 | * We don't care to flush it if the dquot is dirty here. | |
1177 | * That will create stutters that we want to avoid. | |
1178 | * Instead we do a delayed write when we try to reclaim | |
1179 | * a dirty dquot. Also xfs_sync will take part of the burden... | |
1180 | */ | |
1181 | xfs_qm_dqput(dqp); | |
1182 | } | |
1183 | ||
1184 | ||
1185 | /* | |
1186 | * Write a modified dquot to disk. | |
1187 | * The dquot must be locked and the flush lock too taken by caller. | |
1188 | * The flush lock will not be unlocked until the dquot reaches the disk, | |
1189 | * but the dquot is free to be unlocked and modified by the caller | |
1190 | * in the interim. Dquot is still locked on return. This behavior is | |
1191 | * identical to that of inodes. | |
1192 | */ | |
1193 | int | |
1194 | xfs_qm_dqflush( | |
1195 | xfs_dquot_t *dqp, | |
1196 | uint flags) | |
1197 | { | |
1198 | xfs_mount_t *mp; | |
1199 | xfs_buf_t *bp; | |
1200 | xfs_disk_dquot_t *ddqp; | |
1201 | int error; | |
1202 | SPLDECL(s); | |
1203 | ||
1204 | ASSERT(XFS_DQ_IS_LOCKED(dqp)); | |
1205 | ASSERT(XFS_DQ_IS_FLUSH_LOCKED(dqp)); | |
1206 | xfs_dqtrace_entry(dqp, "DQFLUSH"); | |
1207 | ||
1208 | /* | |
1209 | * If not dirty, nada. | |
1210 | */ | |
1211 | if (!XFS_DQ_IS_DIRTY(dqp)) { | |
1212 | xfs_dqfunlock(dqp); | |
1213 | return (0); | |
1214 | } | |
1215 | ||
1216 | /* | |
1217 | * Cant flush a pinned dquot. Wait for it. | |
1218 | */ | |
1219 | xfs_qm_dqunpin_wait(dqp); | |
1220 | ||
1221 | /* | |
1222 | * This may have been unpinned because the filesystem is shutting | |
1223 | * down forcibly. If that's the case we must not write this dquot | |
1224 | * to disk, because the log record didn't make it to disk! | |
1225 | */ | |
1226 | if (XFS_FORCED_SHUTDOWN(dqp->q_mount)) { | |
1227 | dqp->dq_flags &= ~(XFS_DQ_DIRTY); | |
1228 | xfs_dqfunlock(dqp); | |
1229 | return XFS_ERROR(EIO); | |
1230 | } | |
1231 | ||
1232 | /* | |
1233 | * Get the buffer containing the on-disk dquot | |
1234 | * We don't need a transaction envelope because we know that the | |
1235 | * the ondisk-dquot has already been allocated for. | |
1236 | */ | |
1237 | if ((error = xfs_qm_dqtobp(NULL, dqp, &ddqp, &bp, XFS_QMOPT_DOWARN))) { | |
1238 | xfs_dqtrace_entry(dqp, "DQTOBP FAIL"); | |
1239 | ASSERT(error != ENOENT); | |
1240 | /* | |
1241 | * Quotas could have gotten turned off (ESRCH) | |
1242 | */ | |
1243 | xfs_dqfunlock(dqp); | |
1244 | return (error); | |
1245 | } | |
1246 | ||
1247 | if (xfs_qm_dqcheck(&dqp->q_core, INT_GET(ddqp->d_id, ARCH_CONVERT), 0, XFS_QMOPT_DOWARN, | |
1248 | "dqflush (incore copy)")) { | |
1249 | xfs_force_shutdown(dqp->q_mount, XFS_CORRUPT_INCORE); | |
1250 | return XFS_ERROR(EIO); | |
1251 | } | |
1252 | ||
1253 | /* This is the only portion of data that needs to persist */ | |
1254 | memcpy(ddqp, &(dqp->q_core), sizeof(xfs_disk_dquot_t)); | |
1255 | ||
1256 | /* | |
1257 | * Clear the dirty field and remember the flush lsn for later use. | |
1258 | */ | |
1259 | dqp->dq_flags &= ~(XFS_DQ_DIRTY); | |
1260 | mp = dqp->q_mount; | |
1261 | ||
1262 | /* lsn is 64 bits */ | |
1263 | AIL_LOCK(mp, s); | |
1264 | dqp->q_logitem.qli_flush_lsn = dqp->q_logitem.qli_item.li_lsn; | |
1265 | AIL_UNLOCK(mp, s); | |
1266 | ||
1267 | /* | |
1268 | * Attach an iodone routine so that we can remove this dquot from the | |
1269 | * AIL and release the flush lock once the dquot is synced to disk. | |
1270 | */ | |
1271 | xfs_buf_attach_iodone(bp, (void(*)(xfs_buf_t *, xfs_log_item_t *)) | |
1272 | xfs_qm_dqflush_done, &(dqp->q_logitem.qli_item)); | |
1273 | /* | |
1274 | * If the buffer is pinned then push on the log so we won't | |
1275 | * get stuck waiting in the write for too long. | |
1276 | */ | |
1277 | if (XFS_BUF_ISPINNED(bp)) { | |
1278 | xfs_dqtrace_entry(dqp, "DQFLUSH LOG FORCE"); | |
1279 | xfs_log_force(mp, (xfs_lsn_t)0, XFS_LOG_FORCE); | |
1280 | } | |
1281 | ||
1282 | if (flags & XFS_QMOPT_DELWRI) { | |
1283 | xfs_bdwrite(mp, bp); | |
1284 | } else if (flags & XFS_QMOPT_ASYNC) { | |
1285 | xfs_bawrite(mp, bp); | |
1286 | } else { | |
1287 | error = xfs_bwrite(mp, bp); | |
1288 | } | |
1289 | xfs_dqtrace_entry(dqp, "DQFLUSH END"); | |
1290 | /* | |
1291 | * dqp is still locked, but caller is free to unlock it now. | |
1292 | */ | |
1293 | return (error); | |
1294 | ||
1295 | } | |
1296 | ||
1297 | /* | |
1298 | * This is the dquot flushing I/O completion routine. It is called | |
1299 | * from interrupt level when the buffer containing the dquot is | |
1300 | * flushed to disk. It is responsible for removing the dquot logitem | |
1301 | * from the AIL if it has not been re-logged, and unlocking the dquot's | |
1302 | * flush lock. This behavior is very similar to that of inodes.. | |
1303 | */ | |
1304 | /*ARGSUSED*/ | |
1305 | STATIC void | |
1306 | xfs_qm_dqflush_done( | |
1307 | xfs_buf_t *bp, | |
1308 | xfs_dq_logitem_t *qip) | |
1309 | { | |
1310 | xfs_dquot_t *dqp; | |
1311 | SPLDECL(s); | |
1312 | ||
1313 | dqp = qip->qli_dquot; | |
1314 | ||
1315 | /* | |
1316 | * We only want to pull the item from the AIL if its | |
1317 | * location in the log has not changed since we started the flush. | |
1318 | * Thus, we only bother if the dquot's lsn has | |
1319 | * not changed. First we check the lsn outside the lock | |
1320 | * since it's cheaper, and then we recheck while | |
1321 | * holding the lock before removing the dquot from the AIL. | |
1322 | */ | |
1323 | if ((qip->qli_item.li_flags & XFS_LI_IN_AIL) && | |
1324 | qip->qli_item.li_lsn == qip->qli_flush_lsn) { | |
1325 | ||
1326 | AIL_LOCK(dqp->q_mount, s); | |
1327 | /* | |
1328 | * xfs_trans_delete_ail() drops the AIL lock. | |
1329 | */ | |
1330 | if (qip->qli_item.li_lsn == qip->qli_flush_lsn) | |
1331 | xfs_trans_delete_ail(dqp->q_mount, | |
1332 | (xfs_log_item_t*)qip, s); | |
1333 | else | |
1334 | AIL_UNLOCK(dqp->q_mount, s); | |
1335 | } | |
1336 | ||
1337 | /* | |
1338 | * Release the dq's flush lock since we're done with it. | |
1339 | */ | |
1340 | xfs_dqfunlock(dqp); | |
1341 | } | |
1342 | ||
1343 | ||
1344 | int | |
1345 | xfs_qm_dqflock_nowait( | |
1346 | xfs_dquot_t *dqp) | |
1347 | { | |
1348 | int locked; | |
1349 | ||
1350 | locked = cpsema(&((dqp)->q_flock)); | |
1351 | ||
1352 | /* XXX ifdef these out */ | |
1353 | if (locked) | |
1354 | (dqp)->dq_flags |= XFS_DQ_FLOCKED; | |
1355 | return (locked); | |
1356 | } | |
1357 | ||
1358 | ||
1359 | int | |
1360 | xfs_qm_dqlock_nowait( | |
1361 | xfs_dquot_t *dqp) | |
1362 | { | |
1363 | return (mutex_trylock(&((dqp)->q_qlock))); | |
1364 | } | |
1365 | ||
1366 | void | |
1367 | xfs_dqlock( | |
1368 | xfs_dquot_t *dqp) | |
1369 | { | |
1370 | mutex_lock(&(dqp->q_qlock), PINOD); | |
1371 | } | |
1372 | ||
1373 | void | |
1374 | xfs_dqunlock( | |
1375 | xfs_dquot_t *dqp) | |
1376 | { | |
1377 | mutex_unlock(&(dqp->q_qlock)); | |
1378 | if (dqp->q_logitem.qli_dquot == dqp) { | |
1379 | /* Once was dqp->q_mount, but might just have been cleared */ | |
1380 | xfs_trans_unlocked_item(dqp->q_logitem.qli_item.li_mountp, | |
1381 | (xfs_log_item_t*)&(dqp->q_logitem)); | |
1382 | } | |
1383 | } | |
1384 | ||
1385 | ||
1386 | void | |
1387 | xfs_dqunlock_nonotify( | |
1388 | xfs_dquot_t *dqp) | |
1389 | { | |
1390 | mutex_unlock(&(dqp->q_qlock)); | |
1391 | } | |
1392 | ||
1393 | void | |
1394 | xfs_dqlock2( | |
1395 | xfs_dquot_t *d1, | |
1396 | xfs_dquot_t *d2) | |
1397 | { | |
1398 | if (d1 && d2) { | |
1399 | ASSERT(d1 != d2); | |
1400 | if (INT_GET(d1->q_core.d_id, ARCH_CONVERT) > INT_GET(d2->q_core.d_id, ARCH_CONVERT)) { | |
1401 | xfs_dqlock(d2); | |
1402 | xfs_dqlock(d1); | |
1403 | } else { | |
1404 | xfs_dqlock(d1); | |
1405 | xfs_dqlock(d2); | |
1406 | } | |
1407 | } else { | |
1408 | if (d1) { | |
1409 | xfs_dqlock(d1); | |
1410 | } else if (d2) { | |
1411 | xfs_dqlock(d2); | |
1412 | } | |
1413 | } | |
1414 | } | |
1415 | ||
1416 | ||
1417 | /* | |
1418 | * Take a dquot out of the mount's dqlist as well as the hashlist. | |
1419 | * This is called via unmount as well as quotaoff, and the purge | |
1420 | * will always succeed unless there are soft (temp) references | |
1421 | * outstanding. | |
1422 | * | |
1423 | * This returns 0 if it was purged, 1 if it wasn't. It's not an error code | |
1424 | * that we're returning! XXXsup - not cool. | |
1425 | */ | |
1426 | /* ARGSUSED */ | |
1427 | int | |
1428 | xfs_qm_dqpurge( | |
1429 | xfs_dquot_t *dqp, | |
1430 | uint flags) | |
1431 | { | |
1432 | xfs_dqhash_t *thishash; | |
1433 | xfs_mount_t *mp; | |
1434 | ||
1435 | mp = dqp->q_mount; | |
1436 | ||
1437 | ASSERT(XFS_QM_IS_MPLIST_LOCKED(mp)); | |
1438 | ASSERT(XFS_DQ_IS_HASH_LOCKED(dqp->q_hash)); | |
1439 | ||
1440 | xfs_dqlock(dqp); | |
1441 | /* | |
1442 | * We really can't afford to purge a dquot that is | |
1443 | * referenced, because these are hard refs. | |
1444 | * It shouldn't happen in general because we went thru _all_ inodes in | |
1445 | * dqrele_all_inodes before calling this and didn't let the mountlock go. | |
1446 | * However it is possible that we have dquots with temporary | |
1447 | * references that are not attached to an inode. e.g. see xfs_setattr(). | |
1448 | */ | |
1449 | if (dqp->q_nrefs != 0) { | |
1450 | xfs_dqunlock(dqp); | |
1451 | XFS_DQ_HASH_UNLOCK(dqp->q_hash); | |
1452 | return (1); | |
1453 | } | |
1454 | ||
1455 | ASSERT(XFS_DQ_IS_ON_FREELIST(dqp)); | |
1456 | ||
1457 | /* | |
1458 | * If we're turning off quotas, we have to make sure that, for | |
1459 | * example, we don't delete quota disk blocks while dquots are | |
1460 | * in the process of getting written to those disk blocks. | |
1461 | * This dquot might well be on AIL, and we can't leave it there | |
1462 | * if we're turning off quotas. Basically, we need this flush | |
1463 | * lock, and are willing to block on it. | |
1464 | */ | |
1465 | if (! xfs_qm_dqflock_nowait(dqp)) { | |
1466 | /* | |
1467 | * Block on the flush lock after nudging dquot buffer, | |
1468 | * if it is incore. | |
1469 | */ | |
1470 | xfs_qm_dqflock_pushbuf_wait(dqp); | |
1471 | } | |
1472 | ||
1473 | /* | |
1474 | * XXXIf we're turning this type of quotas off, we don't care | |
1475 | * about the dirty metadata sitting in this dquot. OTOH, if | |
1476 | * we're unmounting, we do care, so we flush it and wait. | |
1477 | */ | |
1478 | if (XFS_DQ_IS_DIRTY(dqp)) { | |
1479 | xfs_dqtrace_entry(dqp, "DQPURGE ->DQFLUSH: DQDIRTY"); | |
1480 | /* dqflush unlocks dqflock */ | |
1481 | /* | |
1482 | * Given that dqpurge is a very rare occurrence, it is OK | |
1483 | * that we're holding the hashlist and mplist locks | |
1484 | * across the disk write. But, ... XXXsup | |
1485 | * | |
1486 | * We don't care about getting disk errors here. We need | |
1487 | * to purge this dquot anyway, so we go ahead regardless. | |
1488 | */ | |
1489 | (void) xfs_qm_dqflush(dqp, XFS_QMOPT_SYNC); | |
1490 | xfs_dqflock(dqp); | |
1491 | } | |
1492 | ASSERT(dqp->q_pincount == 0); | |
1493 | ASSERT(XFS_FORCED_SHUTDOWN(mp) || | |
1494 | !(dqp->q_logitem.qli_item.li_flags & XFS_LI_IN_AIL)); | |
1495 | ||
1496 | thishash = dqp->q_hash; | |
1497 | XQM_HASHLIST_REMOVE(thishash, dqp); | |
1498 | XQM_MPLIST_REMOVE(&(XFS_QI_MPL_LIST(mp)), dqp); | |
1499 | /* | |
1500 | * XXX Move this to the front of the freelist, if we can get the | |
1501 | * freelist lock. | |
1502 | */ | |
1503 | ASSERT(XFS_DQ_IS_ON_FREELIST(dqp)); | |
1504 | ||
1505 | dqp->q_mount = NULL; | |
1506 | dqp->q_hash = NULL; | |
1507 | dqp->dq_flags = XFS_DQ_INACTIVE; | |
1508 | memset(&dqp->q_core, 0, sizeof(dqp->q_core)); | |
1509 | xfs_dqfunlock(dqp); | |
1510 | xfs_dqunlock(dqp); | |
1511 | XFS_DQ_HASH_UNLOCK(thishash); | |
1512 | return (0); | |
1513 | } | |
1514 | ||
1515 | ||
1516 | #ifdef QUOTADEBUG | |
1517 | void | |
1518 | xfs_qm_dqprint(xfs_dquot_t *dqp) | |
1519 | { | |
1520 | cmn_err(CE_DEBUG, "-----------KERNEL DQUOT----------------"); | |
1521 | cmn_err(CE_DEBUG, "---- dquotID = %d", | |
1522 | (int)INT_GET(dqp->q_core.d_id, ARCH_CONVERT)); | |
1523 | cmn_err(CE_DEBUG, "---- type = %s", | |
1524 | XFS_QM_ISUDQ(dqp) ? "USR" : "GRP"); | |
1525 | cmn_err(CE_DEBUG, "---- fs = 0x%p", dqp->q_mount); | |
1526 | cmn_err(CE_DEBUG, "---- blkno = 0x%x", (int) dqp->q_blkno); | |
1527 | cmn_err(CE_DEBUG, "---- boffset = 0x%x", (int) dqp->q_bufoffset); | |
1528 | cmn_err(CE_DEBUG, "---- blkhlimit = %Lu (0x%x)", | |
1529 | INT_GET(dqp->q_core.d_blk_hardlimit, ARCH_CONVERT), | |
1530 | (int) INT_GET(dqp->q_core.d_blk_hardlimit, ARCH_CONVERT)); | |
1531 | cmn_err(CE_DEBUG, "---- blkslimit = %Lu (0x%x)", | |
1532 | INT_GET(dqp->q_core.d_blk_softlimit, ARCH_CONVERT), | |
1533 | (int)INT_GET(dqp->q_core.d_blk_softlimit, ARCH_CONVERT)); | |
1534 | cmn_err(CE_DEBUG, "---- inohlimit = %Lu (0x%x)", | |
1535 | INT_GET(dqp->q_core.d_ino_hardlimit, ARCH_CONVERT), | |
1536 | (int)INT_GET(dqp->q_core.d_ino_hardlimit, ARCH_CONVERT)); | |
1537 | cmn_err(CE_DEBUG, "---- inoslimit = %Lu (0x%x)", | |
1538 | INT_GET(dqp->q_core.d_ino_softlimit, ARCH_CONVERT), | |
1539 | (int)INT_GET(dqp->q_core.d_ino_softlimit, ARCH_CONVERT)); | |
1540 | cmn_err(CE_DEBUG, "---- bcount = %Lu (0x%x)", | |
1541 | INT_GET(dqp->q_core.d_bcount, ARCH_CONVERT), | |
1542 | (int)INT_GET(dqp->q_core.d_bcount, ARCH_CONVERT)); | |
1543 | cmn_err(CE_DEBUG, "---- icount = %Lu (0x%x)", | |
1544 | INT_GET(dqp->q_core.d_icount, ARCH_CONVERT), | |
1545 | (int)INT_GET(dqp->q_core.d_icount, ARCH_CONVERT)); | |
1546 | cmn_err(CE_DEBUG, "---- btimer = %d", | |
1547 | (int)INT_GET(dqp->q_core.d_btimer, ARCH_CONVERT)); | |
1548 | cmn_err(CE_DEBUG, "---- itimer = %d", | |
1549 | (int)INT_GET(dqp->q_core.d_itimer, ARCH_CONVERT)); | |
1550 | cmn_err(CE_DEBUG, "---------------------------"); | |
1551 | } | |
1552 | #endif | |
1553 | ||
1554 | /* | |
1555 | * Give the buffer a little push if it is incore and | |
1556 | * wait on the flush lock. | |
1557 | */ | |
1558 | void | |
1559 | xfs_qm_dqflock_pushbuf_wait( | |
1560 | xfs_dquot_t *dqp) | |
1561 | { | |
1562 | xfs_buf_t *bp; | |
1563 | ||
1564 | /* | |
1565 | * Check to see if the dquot has been flushed delayed | |
1566 | * write. If so, grab its buffer and send it | |
1567 | * out immediately. We'll be able to acquire | |
1568 | * the flush lock when the I/O completes. | |
1569 | */ | |
1570 | bp = xfs_incore(dqp->q_mount->m_ddev_targp, dqp->q_blkno, | |
1571 | XFS_QI_DQCHUNKLEN(dqp->q_mount), | |
1572 | XFS_INCORE_TRYLOCK); | |
1573 | if (bp != NULL) { | |
1574 | if (XFS_BUF_ISDELAYWRITE(bp)) { | |
1575 | if (XFS_BUF_ISPINNED(bp)) { | |
1576 | xfs_log_force(dqp->q_mount, | |
1577 | (xfs_lsn_t)0, | |
1578 | XFS_LOG_FORCE); | |
1579 | } | |
1580 | xfs_bawrite(dqp->q_mount, bp); | |
1581 | } else { | |
1582 | xfs_buf_relse(bp); | |
1583 | } | |
1584 | } | |
1585 | xfs_dqflock(dqp); | |
1586 | } |