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