xfs_dquot.c 28 KB

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