xfs_dquot.c 27 KB

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