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