Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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 | */ |
Christoph Hellwig | ba0f32d | 2005-06-21 15:36:52 +1000 | [diff] [blame] | 104 | STATIC xfs_dquot_t * |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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 |
Nathan Scott | 754002b | 2005-06-21 15:49:06 +1000 | [diff] [blame^] | 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). |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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)); |
Nathan Scott | 754002b | 2005-06-21 15:49:06 +1000 | [diff] [blame^] | 320 | } else { |
| 321 | d->d_bwarns = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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)); |
Nathan Scott | 754002b | 2005-06-21 15:49:06 +1000 | [diff] [blame^] | 343 | } else { |
| 344 | d->d_iwarns = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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)); |
Nathan Scott | 754002b | 2005-06-21 15:49:06 +1000 | [diff] [blame^] | 366 | } else { |
| 367 | d->d_rtbwarns = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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 | |
| 381 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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, |
Nathan Scott | c8ad20f | 2005-06-21 15:38:48 +1000 | [diff] [blame] | 410 | (type & XFS_DQ_USER ? XFS_BLI_UDQUOT_BUF : |
| 411 | ((type & XFS_DQ_PROJ) ? XFS_BLI_PDQUOT_BUF : |
| 412 | XFS_BLI_GDQUOT_BUF))); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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), |
Nathan Scott | c8ad20f | 2005-06-21 15:38:48 +1000 | [diff] [blame] | 493 | dqp->dq_flags & XFS_DQ_ALLTYPES, bp); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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 | */ |
Nathan Scott | c8ad20f | 2005-06-21 15:38:48 +1000 | [diff] [blame] | 623 | if (xfs_qm_dqcheck(ddq, id, dqp->dq_flags & XFS_DQ_ALLTYPES, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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) */ |
Nathan Scott | c8ad20f | 2005-06-21 15:38:48 +1000 | [diff] [blame] | 900 | xfs_dqid_t id, /* uid/projid/gid depending on type */ |
| 901 | uint type, /* XFS_DQ_USER/XFS_DQ_PROJ/XFS_DQ_GROUP */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 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) || |
Nathan Scott | c8ad20f | 2005-06-21 15:38:48 +1000 | [diff] [blame] | 912 | (! XFS_IS_PQUOTA_ON(mp) && type == XFS_DQ_PROJ) || |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 913 | (! XFS_IS_GQUOTA_ON(mp) && type == XFS_DQ_GROUP)) { |
Nathan Scott | c8ad20f | 2005-06-21 15:38:48 +1000 | [diff] [blame] | 914 | printk("XQM: ESRCH1\n"); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 915 | return (ESRCH); |
| 916 | } |
| 917 | h = XFS_DQ_HASH(mp, id, type); |
| 918 | |
| 919 | #ifdef DEBUG |
| 920 | if (xfs_do_dqerror) { |
| 921 | if ((xfs_dqerror_target == mp->m_ddev_targp) && |
| 922 | (xfs_dqreq_num++ % xfs_dqerror_mod) == 0) { |
| 923 | cmn_err(CE_DEBUG, "Returning error in dqget"); |
| 924 | return (EIO); |
| 925 | } |
| 926 | } |
| 927 | #endif |
| 928 | |
| 929 | again: |
| 930 | |
| 931 | #ifdef DEBUG |
Nathan Scott | c8ad20f | 2005-06-21 15:38:48 +1000 | [diff] [blame] | 932 | ASSERT(type == XFS_DQ_USER || |
| 933 | type == XFS_DQ_PROJ || |
| 934 | type == XFS_DQ_GROUP); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 935 | if (ip) { |
| 936 | ASSERT(XFS_ISLOCKED_INODE_EXCL(ip)); |
| 937 | if (type == XFS_DQ_USER) |
| 938 | ASSERT(ip->i_udquot == NULL); |
| 939 | else |
| 940 | ASSERT(ip->i_gdquot == NULL); |
| 941 | } |
| 942 | #endif |
| 943 | XFS_DQ_HASH_LOCK(h); |
| 944 | |
| 945 | /* |
| 946 | * Look in the cache (hashtable). |
| 947 | * The chain is kept locked during lookup. |
| 948 | */ |
| 949 | if (xfs_qm_dqlookup(mp, id, h, O_dqpp) == 0) { |
| 950 | XQM_STATS_INC(xqmstats.xs_qm_dqcachehits); |
| 951 | /* |
| 952 | * The dquot was found, moved to the front of the chain, |
| 953 | * taken off the freelist if it was on it, and locked |
| 954 | * at this point. Just unlock the hashchain and return. |
| 955 | */ |
| 956 | ASSERT(*O_dqpp); |
| 957 | ASSERT(XFS_DQ_IS_LOCKED(*O_dqpp)); |
| 958 | XFS_DQ_HASH_UNLOCK(h); |
| 959 | xfs_dqtrace_entry(*O_dqpp, "DQGET DONE (FROM CACHE)"); |
| 960 | return (0); /* success */ |
| 961 | } |
| 962 | XQM_STATS_INC(xqmstats.xs_qm_dqcachemisses); |
| 963 | |
| 964 | /* |
| 965 | * Dquot cache miss. We don't want to keep the inode lock across |
| 966 | * a (potential) disk read. Also we don't want to deal with the lock |
| 967 | * ordering between quotainode and this inode. OTOH, dropping the inode |
| 968 | * lock here means dealing with a chown that can happen before |
| 969 | * we re-acquire the lock. |
| 970 | */ |
| 971 | if (ip) |
| 972 | xfs_iunlock(ip, XFS_ILOCK_EXCL); |
| 973 | /* |
| 974 | * Save the hashchain version stamp, and unlock the chain, so that |
| 975 | * we don't keep the lock across a disk read |
| 976 | */ |
| 977 | version = h->qh_version; |
| 978 | XFS_DQ_HASH_UNLOCK(h); |
| 979 | |
| 980 | /* |
| 981 | * Allocate the dquot on the kernel heap, and read the ondisk |
| 982 | * portion off the disk. Also, do all the necessary initialization |
| 983 | * This can return ENOENT if dquot didn't exist on disk and we didn't |
| 984 | * ask it to allocate; ESRCH if quotas got turned off suddenly. |
| 985 | */ |
| 986 | if ((error = xfs_qm_idtodq(mp, id, type, |
| 987 | flags & (XFS_QMOPT_DQALLOC|XFS_QMOPT_DQREPAIR| |
| 988 | XFS_QMOPT_DOWARN), |
| 989 | &dqp))) { |
| 990 | if (ip) |
| 991 | xfs_ilock(ip, XFS_ILOCK_EXCL); |
Nathan Scott | c8ad20f | 2005-06-21 15:38:48 +1000 | [diff] [blame] | 992 | if (error == ESRCH) printk("XQM: ESRCH2\n"); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 993 | return (error); |
| 994 | } |
| 995 | |
| 996 | /* |
| 997 | * See if this is mount code calling to look at the overall quota limits |
| 998 | * which are stored in the id == 0 user or group's dquot. |
| 999 | * Since we may not have done a quotacheck by this point, just return |
| 1000 | * the dquot without attaching it to any hashtables, lists, etc, or even |
| 1001 | * taking a reference. |
| 1002 | * The caller must dqdestroy this once done. |
| 1003 | */ |
| 1004 | if (flags & XFS_QMOPT_DQSUSER) { |
| 1005 | ASSERT(id == 0); |
| 1006 | ASSERT(! ip); |
| 1007 | goto dqret; |
| 1008 | } |
| 1009 | |
| 1010 | /* |
| 1011 | * Dquot lock comes after hashlock in the lock ordering |
| 1012 | */ |
| 1013 | if (ip) { |
| 1014 | xfs_ilock(ip, XFS_ILOCK_EXCL); |
| 1015 | if (! XFS_IS_DQTYPE_ON(mp, type)) { |
| 1016 | /* inode stays locked on return */ |
| 1017 | xfs_qm_dqdestroy(dqp); |
Nathan Scott | c8ad20f | 2005-06-21 15:38:48 +1000 | [diff] [blame] | 1018 | printk("XQM: ESRCH3\n"); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1019 | return XFS_ERROR(ESRCH); |
| 1020 | } |
| 1021 | /* |
| 1022 | * A dquot could be attached to this inode by now, since |
| 1023 | * we had dropped the ilock. |
| 1024 | */ |
| 1025 | if (type == XFS_DQ_USER) { |
| 1026 | if (ip->i_udquot) { |
| 1027 | xfs_qm_dqdestroy(dqp); |
| 1028 | dqp = ip->i_udquot; |
| 1029 | xfs_dqlock(dqp); |
| 1030 | goto dqret; |
| 1031 | } |
| 1032 | } else { |
| 1033 | if (ip->i_gdquot) { |
| 1034 | xfs_qm_dqdestroy(dqp); |
| 1035 | dqp = ip->i_gdquot; |
| 1036 | xfs_dqlock(dqp); |
| 1037 | goto dqret; |
| 1038 | } |
| 1039 | } |
| 1040 | } |
| 1041 | |
| 1042 | /* |
| 1043 | * Hashlock comes after ilock in lock order |
| 1044 | */ |
| 1045 | XFS_DQ_HASH_LOCK(h); |
| 1046 | if (version != h->qh_version) { |
| 1047 | xfs_dquot_t *tmpdqp; |
| 1048 | /* |
| 1049 | * Now, see if somebody else put the dquot in the |
| 1050 | * hashtable before us. This can happen because we didn't |
| 1051 | * keep the hashchain lock. We don't have to worry about |
| 1052 | * lock order between the two dquots here since dqp isn't |
| 1053 | * on any findable lists yet. |
| 1054 | */ |
| 1055 | if (xfs_qm_dqlookup(mp, id, h, &tmpdqp) == 0) { |
| 1056 | /* |
| 1057 | * Duplicate found. Just throw away the new dquot |
| 1058 | * and start over. |
| 1059 | */ |
| 1060 | xfs_qm_dqput(tmpdqp); |
| 1061 | XFS_DQ_HASH_UNLOCK(h); |
| 1062 | xfs_qm_dqdestroy(dqp); |
| 1063 | XQM_STATS_INC(xqmstats.xs_qm_dquot_dups); |
| 1064 | goto again; |
| 1065 | } |
| 1066 | } |
| 1067 | |
| 1068 | /* |
| 1069 | * Put the dquot at the beginning of the hash-chain and mp's list |
| 1070 | * LOCK ORDER: hashlock, freelistlock, mplistlock, udqlock, gdqlock .. |
| 1071 | */ |
| 1072 | ASSERT(XFS_DQ_IS_HASH_LOCKED(h)); |
| 1073 | dqp->q_hash = h; |
| 1074 | XQM_HASHLIST_INSERT(h, dqp); |
| 1075 | |
| 1076 | /* |
| 1077 | * Attach this dquot to this filesystem's list of all dquots, |
| 1078 | * kept inside the mount structure in m_quotainfo field |
| 1079 | */ |
| 1080 | xfs_qm_mplist_lock(mp); |
| 1081 | |
| 1082 | /* |
| 1083 | * We return a locked dquot to the caller, with a reference taken |
| 1084 | */ |
| 1085 | xfs_dqlock(dqp); |
| 1086 | dqp->q_nrefs = 1; |
| 1087 | |
| 1088 | XQM_MPLIST_INSERT(&(XFS_QI_MPL_LIST(mp)), dqp); |
| 1089 | |
| 1090 | xfs_qm_mplist_unlock(mp); |
| 1091 | XFS_DQ_HASH_UNLOCK(h); |
| 1092 | dqret: |
| 1093 | ASSERT((ip == NULL) || XFS_ISLOCKED_INODE_EXCL(ip)); |
| 1094 | xfs_dqtrace_entry(dqp, "DQGET DONE"); |
| 1095 | *O_dqpp = dqp; |
| 1096 | return (0); |
| 1097 | } |
| 1098 | |
| 1099 | |
| 1100 | /* |
| 1101 | * Release a reference to the dquot (decrement ref-count) |
| 1102 | * and unlock it. If there is a group quota attached to this |
| 1103 | * dquot, carefully release that too without tripping over |
| 1104 | * deadlocks'n'stuff. |
| 1105 | */ |
| 1106 | void |
| 1107 | xfs_qm_dqput( |
| 1108 | xfs_dquot_t *dqp) |
| 1109 | { |
| 1110 | xfs_dquot_t *gdqp; |
| 1111 | |
| 1112 | ASSERT(dqp->q_nrefs > 0); |
| 1113 | ASSERT(XFS_DQ_IS_LOCKED(dqp)); |
| 1114 | xfs_dqtrace_entry(dqp, "DQPUT"); |
| 1115 | |
| 1116 | if (dqp->q_nrefs != 1) { |
| 1117 | dqp->q_nrefs--; |
| 1118 | xfs_dqunlock(dqp); |
| 1119 | return; |
| 1120 | } |
| 1121 | |
| 1122 | /* |
| 1123 | * drop the dqlock and acquire the freelist and dqlock |
| 1124 | * in the right order; but try to get it out-of-order first |
| 1125 | */ |
| 1126 | if (! xfs_qm_freelist_lock_nowait(xfs_Gqm)) { |
| 1127 | xfs_dqtrace_entry(dqp, "DQPUT: FLLOCK-WAIT"); |
| 1128 | xfs_dqunlock(dqp); |
| 1129 | xfs_qm_freelist_lock(xfs_Gqm); |
| 1130 | xfs_dqlock(dqp); |
| 1131 | } |
| 1132 | |
| 1133 | while (1) { |
| 1134 | gdqp = NULL; |
| 1135 | |
| 1136 | /* We can't depend on nrefs being == 1 here */ |
| 1137 | if (--dqp->q_nrefs == 0) { |
| 1138 | xfs_dqtrace_entry(dqp, "DQPUT: ON FREELIST"); |
| 1139 | /* |
| 1140 | * insert at end of the freelist. |
| 1141 | */ |
| 1142 | XQM_FREELIST_INSERT(&(xfs_Gqm->qm_dqfreelist), dqp); |
| 1143 | |
| 1144 | /* |
| 1145 | * If we just added a udquot to the freelist, then |
| 1146 | * we want to release the gdquot reference that |
| 1147 | * it (probably) has. Otherwise it'll keep the |
| 1148 | * gdquot from getting reclaimed. |
| 1149 | */ |
| 1150 | if ((gdqp = dqp->q_gdquot)) { |
| 1151 | /* |
| 1152 | * Avoid a recursive dqput call |
| 1153 | */ |
| 1154 | xfs_dqlock(gdqp); |
| 1155 | dqp->q_gdquot = NULL; |
| 1156 | } |
| 1157 | |
| 1158 | /* xfs_qm_freelist_print(&(xfs_Gqm->qm_dqfreelist), |
| 1159 | "@@@@@++ Free list (after append) @@@@@+"); |
| 1160 | */ |
| 1161 | } |
| 1162 | xfs_dqunlock(dqp); |
| 1163 | |
| 1164 | /* |
| 1165 | * If we had a group quota inside the user quota as a hint, |
| 1166 | * release it now. |
| 1167 | */ |
| 1168 | if (! gdqp) |
| 1169 | break; |
| 1170 | dqp = gdqp; |
| 1171 | } |
| 1172 | xfs_qm_freelist_unlock(xfs_Gqm); |
| 1173 | } |
| 1174 | |
| 1175 | /* |
| 1176 | * Release a dquot. Flush it if dirty, then dqput() it. |
| 1177 | * dquot must not be locked. |
| 1178 | */ |
| 1179 | void |
| 1180 | xfs_qm_dqrele( |
| 1181 | xfs_dquot_t *dqp) |
| 1182 | { |
| 1183 | ASSERT(dqp); |
| 1184 | xfs_dqtrace_entry(dqp, "DQRELE"); |
| 1185 | |
| 1186 | xfs_dqlock(dqp); |
| 1187 | /* |
| 1188 | * We don't care to flush it if the dquot is dirty here. |
| 1189 | * That will create stutters that we want to avoid. |
| 1190 | * Instead we do a delayed write when we try to reclaim |
| 1191 | * a dirty dquot. Also xfs_sync will take part of the burden... |
| 1192 | */ |
| 1193 | xfs_qm_dqput(dqp); |
| 1194 | } |
| 1195 | |
| 1196 | |
| 1197 | /* |
| 1198 | * Write a modified dquot to disk. |
| 1199 | * The dquot must be locked and the flush lock too taken by caller. |
| 1200 | * The flush lock will not be unlocked until the dquot reaches the disk, |
| 1201 | * but the dquot is free to be unlocked and modified by the caller |
| 1202 | * in the interim. Dquot is still locked on return. This behavior is |
| 1203 | * identical to that of inodes. |
| 1204 | */ |
| 1205 | int |
| 1206 | xfs_qm_dqflush( |
| 1207 | xfs_dquot_t *dqp, |
| 1208 | uint flags) |
| 1209 | { |
| 1210 | xfs_mount_t *mp; |
| 1211 | xfs_buf_t *bp; |
| 1212 | xfs_disk_dquot_t *ddqp; |
| 1213 | int error; |
| 1214 | SPLDECL(s); |
| 1215 | |
| 1216 | ASSERT(XFS_DQ_IS_LOCKED(dqp)); |
| 1217 | ASSERT(XFS_DQ_IS_FLUSH_LOCKED(dqp)); |
| 1218 | xfs_dqtrace_entry(dqp, "DQFLUSH"); |
| 1219 | |
| 1220 | /* |
| 1221 | * If not dirty, nada. |
| 1222 | */ |
| 1223 | if (!XFS_DQ_IS_DIRTY(dqp)) { |
| 1224 | xfs_dqfunlock(dqp); |
| 1225 | return (0); |
| 1226 | } |
| 1227 | |
| 1228 | /* |
| 1229 | * Cant flush a pinned dquot. Wait for it. |
| 1230 | */ |
| 1231 | xfs_qm_dqunpin_wait(dqp); |
| 1232 | |
| 1233 | /* |
| 1234 | * This may have been unpinned because the filesystem is shutting |
| 1235 | * down forcibly. If that's the case we must not write this dquot |
| 1236 | * to disk, because the log record didn't make it to disk! |
| 1237 | */ |
| 1238 | if (XFS_FORCED_SHUTDOWN(dqp->q_mount)) { |
| 1239 | dqp->dq_flags &= ~(XFS_DQ_DIRTY); |
| 1240 | xfs_dqfunlock(dqp); |
| 1241 | return XFS_ERROR(EIO); |
| 1242 | } |
| 1243 | |
| 1244 | /* |
| 1245 | * Get the buffer containing the on-disk dquot |
| 1246 | * We don't need a transaction envelope because we know that the |
| 1247 | * the ondisk-dquot has already been allocated for. |
| 1248 | */ |
| 1249 | if ((error = xfs_qm_dqtobp(NULL, dqp, &ddqp, &bp, XFS_QMOPT_DOWARN))) { |
| 1250 | xfs_dqtrace_entry(dqp, "DQTOBP FAIL"); |
| 1251 | ASSERT(error != ENOENT); |
| 1252 | /* |
| 1253 | * Quotas could have gotten turned off (ESRCH) |
| 1254 | */ |
| 1255 | xfs_dqfunlock(dqp); |
| 1256 | return (error); |
| 1257 | } |
| 1258 | |
Nathan Scott | c8ad20f | 2005-06-21 15:38:48 +1000 | [diff] [blame] | 1259 | if (xfs_qm_dqcheck(&dqp->q_core, INT_GET(ddqp->d_id, ARCH_CONVERT), |
| 1260 | 0, XFS_QMOPT_DOWARN, "dqflush (incore copy)")) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1261 | xfs_force_shutdown(dqp->q_mount, XFS_CORRUPT_INCORE); |
| 1262 | return XFS_ERROR(EIO); |
| 1263 | } |
| 1264 | |
| 1265 | /* This is the only portion of data that needs to persist */ |
| 1266 | memcpy(ddqp, &(dqp->q_core), sizeof(xfs_disk_dquot_t)); |
| 1267 | |
| 1268 | /* |
| 1269 | * Clear the dirty field and remember the flush lsn for later use. |
| 1270 | */ |
| 1271 | dqp->dq_flags &= ~(XFS_DQ_DIRTY); |
| 1272 | mp = dqp->q_mount; |
| 1273 | |
| 1274 | /* lsn is 64 bits */ |
| 1275 | AIL_LOCK(mp, s); |
| 1276 | dqp->q_logitem.qli_flush_lsn = dqp->q_logitem.qli_item.li_lsn; |
| 1277 | AIL_UNLOCK(mp, s); |
| 1278 | |
| 1279 | /* |
| 1280 | * Attach an iodone routine so that we can remove this dquot from the |
| 1281 | * AIL and release the flush lock once the dquot is synced to disk. |
| 1282 | */ |
| 1283 | xfs_buf_attach_iodone(bp, (void(*)(xfs_buf_t *, xfs_log_item_t *)) |
| 1284 | xfs_qm_dqflush_done, &(dqp->q_logitem.qli_item)); |
| 1285 | /* |
| 1286 | * If the buffer is pinned then push on the log so we won't |
| 1287 | * get stuck waiting in the write for too long. |
| 1288 | */ |
| 1289 | if (XFS_BUF_ISPINNED(bp)) { |
| 1290 | xfs_dqtrace_entry(dqp, "DQFLUSH LOG FORCE"); |
| 1291 | xfs_log_force(mp, (xfs_lsn_t)0, XFS_LOG_FORCE); |
| 1292 | } |
| 1293 | |
| 1294 | if (flags & XFS_QMOPT_DELWRI) { |
| 1295 | xfs_bdwrite(mp, bp); |
| 1296 | } else if (flags & XFS_QMOPT_ASYNC) { |
| 1297 | xfs_bawrite(mp, bp); |
| 1298 | } else { |
| 1299 | error = xfs_bwrite(mp, bp); |
| 1300 | } |
| 1301 | xfs_dqtrace_entry(dqp, "DQFLUSH END"); |
| 1302 | /* |
| 1303 | * dqp is still locked, but caller is free to unlock it now. |
| 1304 | */ |
| 1305 | return (error); |
| 1306 | |
| 1307 | } |
| 1308 | |
| 1309 | /* |
| 1310 | * This is the dquot flushing I/O completion routine. It is called |
| 1311 | * from interrupt level when the buffer containing the dquot is |
| 1312 | * flushed to disk. It is responsible for removing the dquot logitem |
| 1313 | * from the AIL if it has not been re-logged, and unlocking the dquot's |
| 1314 | * flush lock. This behavior is very similar to that of inodes.. |
| 1315 | */ |
| 1316 | /*ARGSUSED*/ |
| 1317 | STATIC void |
| 1318 | xfs_qm_dqflush_done( |
| 1319 | xfs_buf_t *bp, |
| 1320 | xfs_dq_logitem_t *qip) |
| 1321 | { |
| 1322 | xfs_dquot_t *dqp; |
| 1323 | SPLDECL(s); |
| 1324 | |
| 1325 | dqp = qip->qli_dquot; |
| 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 | |
| 1338 | AIL_LOCK(dqp->q_mount, s); |
| 1339 | /* |
| 1340 | * xfs_trans_delete_ail() drops the AIL lock. |
| 1341 | */ |
| 1342 | if (qip->qli_item.li_lsn == qip->qli_flush_lsn) |
| 1343 | xfs_trans_delete_ail(dqp->q_mount, |
| 1344 | (xfs_log_item_t*)qip, s); |
| 1345 | else |
| 1346 | AIL_UNLOCK(dqp->q_mount, s); |
| 1347 | } |
| 1348 | |
| 1349 | /* |
| 1350 | * Release the dq's flush lock since we're done with it. |
| 1351 | */ |
| 1352 | xfs_dqfunlock(dqp); |
| 1353 | } |
| 1354 | |
| 1355 | |
| 1356 | int |
| 1357 | xfs_qm_dqflock_nowait( |
| 1358 | xfs_dquot_t *dqp) |
| 1359 | { |
| 1360 | int locked; |
| 1361 | |
| 1362 | locked = cpsema(&((dqp)->q_flock)); |
| 1363 | |
| 1364 | /* XXX ifdef these out */ |
| 1365 | if (locked) |
| 1366 | (dqp)->dq_flags |= XFS_DQ_FLOCKED; |
| 1367 | return (locked); |
| 1368 | } |
| 1369 | |
| 1370 | |
| 1371 | int |
| 1372 | xfs_qm_dqlock_nowait( |
| 1373 | xfs_dquot_t *dqp) |
| 1374 | { |
| 1375 | return (mutex_trylock(&((dqp)->q_qlock))); |
| 1376 | } |
| 1377 | |
| 1378 | void |
| 1379 | xfs_dqlock( |
| 1380 | xfs_dquot_t *dqp) |
| 1381 | { |
| 1382 | mutex_lock(&(dqp->q_qlock), PINOD); |
| 1383 | } |
| 1384 | |
| 1385 | void |
| 1386 | xfs_dqunlock( |
| 1387 | xfs_dquot_t *dqp) |
| 1388 | { |
| 1389 | mutex_unlock(&(dqp->q_qlock)); |
| 1390 | if (dqp->q_logitem.qli_dquot == dqp) { |
| 1391 | /* Once was dqp->q_mount, but might just have been cleared */ |
| 1392 | xfs_trans_unlocked_item(dqp->q_logitem.qli_item.li_mountp, |
| 1393 | (xfs_log_item_t*)&(dqp->q_logitem)); |
| 1394 | } |
| 1395 | } |
| 1396 | |
| 1397 | |
| 1398 | void |
| 1399 | xfs_dqunlock_nonotify( |
| 1400 | xfs_dquot_t *dqp) |
| 1401 | { |
| 1402 | mutex_unlock(&(dqp->q_qlock)); |
| 1403 | } |
| 1404 | |
| 1405 | void |
| 1406 | xfs_dqlock2( |
| 1407 | xfs_dquot_t *d1, |
| 1408 | xfs_dquot_t *d2) |
| 1409 | { |
| 1410 | if (d1 && d2) { |
| 1411 | ASSERT(d1 != d2); |
Nathan Scott | c8ad20f | 2005-06-21 15:38:48 +1000 | [diff] [blame] | 1412 | if (INT_GET(d1->q_core.d_id, ARCH_CONVERT) > |
| 1413 | INT_GET(d2->q_core.d_id, ARCH_CONVERT)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1414 | xfs_dqlock(d2); |
| 1415 | xfs_dqlock(d1); |
| 1416 | } else { |
| 1417 | xfs_dqlock(d1); |
| 1418 | xfs_dqlock(d2); |
| 1419 | } |
| 1420 | } else { |
| 1421 | if (d1) { |
| 1422 | xfs_dqlock(d1); |
| 1423 | } else if (d2) { |
| 1424 | xfs_dqlock(d2); |
| 1425 | } |
| 1426 | } |
| 1427 | } |
| 1428 | |
| 1429 | |
| 1430 | /* |
| 1431 | * Take a dquot out of the mount's dqlist as well as the hashlist. |
| 1432 | * This is called via unmount as well as quotaoff, and the purge |
| 1433 | * will always succeed unless there are soft (temp) references |
| 1434 | * outstanding. |
| 1435 | * |
| 1436 | * This returns 0 if it was purged, 1 if it wasn't. It's not an error code |
| 1437 | * that we're returning! XXXsup - not cool. |
| 1438 | */ |
| 1439 | /* ARGSUSED */ |
| 1440 | int |
| 1441 | xfs_qm_dqpurge( |
| 1442 | xfs_dquot_t *dqp, |
| 1443 | uint flags) |
| 1444 | { |
| 1445 | xfs_dqhash_t *thishash; |
| 1446 | xfs_mount_t *mp; |
| 1447 | |
| 1448 | mp = dqp->q_mount; |
| 1449 | |
| 1450 | ASSERT(XFS_QM_IS_MPLIST_LOCKED(mp)); |
| 1451 | ASSERT(XFS_DQ_IS_HASH_LOCKED(dqp->q_hash)); |
| 1452 | |
| 1453 | xfs_dqlock(dqp); |
| 1454 | /* |
| 1455 | * We really can't afford to purge a dquot that is |
| 1456 | * referenced, because these are hard refs. |
| 1457 | * It shouldn't happen in general because we went thru _all_ inodes in |
| 1458 | * dqrele_all_inodes before calling this and didn't let the mountlock go. |
| 1459 | * However it is possible that we have dquots with temporary |
| 1460 | * references that are not attached to an inode. e.g. see xfs_setattr(). |
| 1461 | */ |
| 1462 | if (dqp->q_nrefs != 0) { |
| 1463 | xfs_dqunlock(dqp); |
| 1464 | XFS_DQ_HASH_UNLOCK(dqp->q_hash); |
| 1465 | return (1); |
| 1466 | } |
| 1467 | |
| 1468 | ASSERT(XFS_DQ_IS_ON_FREELIST(dqp)); |
| 1469 | |
| 1470 | /* |
| 1471 | * If we're turning off quotas, we have to make sure that, for |
| 1472 | * example, we don't delete quota disk blocks while dquots are |
| 1473 | * in the process of getting written to those disk blocks. |
| 1474 | * This dquot might well be on AIL, and we can't leave it there |
| 1475 | * if we're turning off quotas. Basically, we need this flush |
| 1476 | * lock, and are willing to block on it. |
| 1477 | */ |
| 1478 | if (! xfs_qm_dqflock_nowait(dqp)) { |
| 1479 | /* |
| 1480 | * Block on the flush lock after nudging dquot buffer, |
| 1481 | * if it is incore. |
| 1482 | */ |
| 1483 | xfs_qm_dqflock_pushbuf_wait(dqp); |
| 1484 | } |
| 1485 | |
| 1486 | /* |
| 1487 | * XXXIf we're turning this type of quotas off, we don't care |
| 1488 | * about the dirty metadata sitting in this dquot. OTOH, if |
| 1489 | * we're unmounting, we do care, so we flush it and wait. |
| 1490 | */ |
| 1491 | if (XFS_DQ_IS_DIRTY(dqp)) { |
| 1492 | xfs_dqtrace_entry(dqp, "DQPURGE ->DQFLUSH: DQDIRTY"); |
| 1493 | /* dqflush unlocks dqflock */ |
| 1494 | /* |
| 1495 | * Given that dqpurge is a very rare occurrence, it is OK |
| 1496 | * that we're holding the hashlist and mplist locks |
| 1497 | * across the disk write. But, ... XXXsup |
| 1498 | * |
| 1499 | * We don't care about getting disk errors here. We need |
| 1500 | * to purge this dquot anyway, so we go ahead regardless. |
| 1501 | */ |
| 1502 | (void) xfs_qm_dqflush(dqp, XFS_QMOPT_SYNC); |
| 1503 | xfs_dqflock(dqp); |
| 1504 | } |
| 1505 | ASSERT(dqp->q_pincount == 0); |
| 1506 | ASSERT(XFS_FORCED_SHUTDOWN(mp) || |
| 1507 | !(dqp->q_logitem.qli_item.li_flags & XFS_LI_IN_AIL)); |
| 1508 | |
| 1509 | thishash = dqp->q_hash; |
| 1510 | XQM_HASHLIST_REMOVE(thishash, dqp); |
| 1511 | XQM_MPLIST_REMOVE(&(XFS_QI_MPL_LIST(mp)), dqp); |
| 1512 | /* |
| 1513 | * XXX Move this to the front of the freelist, if we can get the |
| 1514 | * freelist lock. |
| 1515 | */ |
| 1516 | ASSERT(XFS_DQ_IS_ON_FREELIST(dqp)); |
| 1517 | |
| 1518 | dqp->q_mount = NULL; |
| 1519 | dqp->q_hash = NULL; |
| 1520 | dqp->dq_flags = XFS_DQ_INACTIVE; |
| 1521 | memset(&dqp->q_core, 0, sizeof(dqp->q_core)); |
| 1522 | xfs_dqfunlock(dqp); |
| 1523 | xfs_dqunlock(dqp); |
| 1524 | XFS_DQ_HASH_UNLOCK(thishash); |
| 1525 | return (0); |
| 1526 | } |
| 1527 | |
| 1528 | |
| 1529 | #ifdef QUOTADEBUG |
| 1530 | void |
| 1531 | xfs_qm_dqprint(xfs_dquot_t *dqp) |
| 1532 | { |
| 1533 | cmn_err(CE_DEBUG, "-----------KERNEL DQUOT----------------"); |
| 1534 | cmn_err(CE_DEBUG, "---- dquotID = %d", |
| 1535 | (int)INT_GET(dqp->q_core.d_id, ARCH_CONVERT)); |
Nathan Scott | c8ad20f | 2005-06-21 15:38:48 +1000 | [diff] [blame] | 1536 | cmn_err(CE_DEBUG, "---- type = %s", DQFLAGTO_TYPESTR(dqp)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1537 | cmn_err(CE_DEBUG, "---- fs = 0x%p", dqp->q_mount); |
| 1538 | cmn_err(CE_DEBUG, "---- blkno = 0x%x", (int) dqp->q_blkno); |
| 1539 | cmn_err(CE_DEBUG, "---- boffset = 0x%x", (int) dqp->q_bufoffset); |
| 1540 | cmn_err(CE_DEBUG, "---- blkhlimit = %Lu (0x%x)", |
| 1541 | INT_GET(dqp->q_core.d_blk_hardlimit, ARCH_CONVERT), |
| 1542 | (int) INT_GET(dqp->q_core.d_blk_hardlimit, ARCH_CONVERT)); |
| 1543 | cmn_err(CE_DEBUG, "---- blkslimit = %Lu (0x%x)", |
| 1544 | INT_GET(dqp->q_core.d_blk_softlimit, ARCH_CONVERT), |
| 1545 | (int)INT_GET(dqp->q_core.d_blk_softlimit, ARCH_CONVERT)); |
| 1546 | cmn_err(CE_DEBUG, "---- inohlimit = %Lu (0x%x)", |
| 1547 | INT_GET(dqp->q_core.d_ino_hardlimit, ARCH_CONVERT), |
| 1548 | (int)INT_GET(dqp->q_core.d_ino_hardlimit, ARCH_CONVERT)); |
| 1549 | cmn_err(CE_DEBUG, "---- inoslimit = %Lu (0x%x)", |
| 1550 | INT_GET(dqp->q_core.d_ino_softlimit, ARCH_CONVERT), |
| 1551 | (int)INT_GET(dqp->q_core.d_ino_softlimit, ARCH_CONVERT)); |
| 1552 | cmn_err(CE_DEBUG, "---- bcount = %Lu (0x%x)", |
| 1553 | INT_GET(dqp->q_core.d_bcount, ARCH_CONVERT), |
| 1554 | (int)INT_GET(dqp->q_core.d_bcount, ARCH_CONVERT)); |
| 1555 | cmn_err(CE_DEBUG, "---- icount = %Lu (0x%x)", |
| 1556 | INT_GET(dqp->q_core.d_icount, ARCH_CONVERT), |
| 1557 | (int)INT_GET(dqp->q_core.d_icount, ARCH_CONVERT)); |
| 1558 | cmn_err(CE_DEBUG, "---- btimer = %d", |
| 1559 | (int)INT_GET(dqp->q_core.d_btimer, ARCH_CONVERT)); |
| 1560 | cmn_err(CE_DEBUG, "---- itimer = %d", |
| 1561 | (int)INT_GET(dqp->q_core.d_itimer, ARCH_CONVERT)); |
| 1562 | cmn_err(CE_DEBUG, "---------------------------"); |
| 1563 | } |
| 1564 | #endif |
| 1565 | |
| 1566 | /* |
| 1567 | * Give the buffer a little push if it is incore and |
| 1568 | * wait on the flush lock. |
| 1569 | */ |
| 1570 | void |
| 1571 | xfs_qm_dqflock_pushbuf_wait( |
| 1572 | xfs_dquot_t *dqp) |
| 1573 | { |
| 1574 | xfs_buf_t *bp; |
| 1575 | |
| 1576 | /* |
| 1577 | * Check to see if the dquot has been flushed delayed |
| 1578 | * write. If so, grab its buffer and send it |
| 1579 | * out immediately. We'll be able to acquire |
| 1580 | * the flush lock when the I/O completes. |
| 1581 | */ |
| 1582 | bp = xfs_incore(dqp->q_mount->m_ddev_targp, dqp->q_blkno, |
| 1583 | XFS_QI_DQCHUNKLEN(dqp->q_mount), |
| 1584 | XFS_INCORE_TRYLOCK); |
| 1585 | if (bp != NULL) { |
| 1586 | if (XFS_BUF_ISDELAYWRITE(bp)) { |
| 1587 | if (XFS_BUF_ISPINNED(bp)) { |
| 1588 | xfs_log_force(dqp->q_mount, |
| 1589 | (xfs_lsn_t)0, |
| 1590 | XFS_LOG_FORCE); |
| 1591 | } |
| 1592 | xfs_bawrite(dqp->q_mount, bp); |
| 1593 | } else { |
| 1594 | xfs_buf_relse(bp); |
| 1595 | } |
| 1596 | } |
| 1597 | xfs_dqflock(dqp); |
| 1598 | } |