xfs_dquot.c 31 KB

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