xfs_dquot.c 28 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142
  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. error = xfs_buf_geterror(bp);
  325. if (error)
  326. goto error1;
  327. bp->b_ops = &xfs_dquot_buf_ops;
  328. /*
  329. * Make a chunk of dquots out of this buffer and log
  330. * the entire thing.
  331. */
  332. xfs_qm_init_dquot_blk(tp, mp, be32_to_cpu(dqp->q_core.d_id),
  333. dqp->dq_flags & XFS_DQ_ALLTYPES, bp);
  334. /*
  335. * xfs_bmap_finish() may commit the current transaction and
  336. * start a second transaction if the freelist is not empty.
  337. *
  338. * Since we still want to modify this buffer, we need to
  339. * ensure that the buffer is not released on commit of
  340. * the first transaction and ensure the buffer is added to the
  341. * second transaction.
  342. *
  343. * If there is only one transaction then don't stop the buffer
  344. * from being released when it commits later on.
  345. */
  346. xfs_trans_bhold(tp, bp);
  347. if ((error = xfs_bmap_finish(tpp, &flist, &committed))) {
  348. goto error1;
  349. }
  350. if (committed) {
  351. tp = *tpp;
  352. xfs_trans_bjoin(tp, bp);
  353. } else {
  354. xfs_trans_bhold_release(tp, bp);
  355. }
  356. *O_bpp = bp;
  357. return 0;
  358. error1:
  359. xfs_bmap_cancel(&flist);
  360. error0:
  361. xfs_iunlock(quotip, XFS_ILOCK_EXCL);
  362. return (error);
  363. }
  364. STATIC int
  365. xfs_qm_dqrepair(
  366. struct xfs_mount *mp,
  367. struct xfs_trans *tp,
  368. struct xfs_dquot *dqp,
  369. xfs_dqid_t firstid,
  370. struct xfs_buf **bpp)
  371. {
  372. int error;
  373. struct xfs_disk_dquot *ddq;
  374. struct xfs_dqblk *d;
  375. int i;
  376. /*
  377. * Read the buffer without verification so we get the corrupted
  378. * buffer returned to us. make sure we verify it on write, though.
  379. */
  380. error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, dqp->q_blkno,
  381. mp->m_quotainfo->qi_dqchunklen,
  382. 0, bpp, NULL);
  383. if (error) {
  384. ASSERT(*bpp == NULL);
  385. return XFS_ERROR(error);
  386. }
  387. (*bpp)->b_ops = &xfs_dquot_buf_ops;
  388. ASSERT(xfs_buf_islocked(*bpp));
  389. d = (struct xfs_dqblk *)(*bpp)->b_addr;
  390. /* Do the actual repair of dquots in this buffer */
  391. for (i = 0; i < mp->m_quotainfo->qi_dqperchunk; i++) {
  392. ddq = &d[i].dd_diskdq;
  393. error = xfs_dqcheck(mp, ddq, firstid + i,
  394. dqp->dq_flags & XFS_DQ_ALLTYPES,
  395. XFS_QMOPT_DQREPAIR, "xfs_qm_dqrepair");
  396. if (error) {
  397. /* repair failed, we're screwed */
  398. xfs_trans_brelse(tp, *bpp);
  399. return XFS_ERROR(EIO);
  400. }
  401. }
  402. return 0;
  403. }
  404. /*
  405. * Maps a dquot to the buffer containing its on-disk version.
  406. * This returns a ptr to the buffer containing the on-disk dquot
  407. * in the bpp param, and a ptr to the on-disk dquot within that buffer
  408. */
  409. STATIC int
  410. xfs_qm_dqtobp(
  411. xfs_trans_t **tpp,
  412. xfs_dquot_t *dqp,
  413. xfs_disk_dquot_t **O_ddpp,
  414. xfs_buf_t **O_bpp,
  415. uint flags)
  416. {
  417. struct xfs_bmbt_irec map;
  418. int nmaps = 1, error;
  419. struct xfs_buf *bp;
  420. struct xfs_inode *quotip = xfs_dq_to_quota_inode(dqp);
  421. struct xfs_mount *mp = dqp->q_mount;
  422. xfs_dqid_t id = be32_to_cpu(dqp->q_core.d_id);
  423. struct xfs_trans *tp = (tpp ? *tpp : NULL);
  424. uint lock_mode;
  425. dqp->q_fileoffset = (xfs_fileoff_t)id / mp->m_quotainfo->qi_dqperchunk;
  426. lock_mode = xfs_ilock_data_map_shared(quotip);
  427. if (!xfs_this_quota_on(dqp->q_mount, dqp->dq_flags)) {
  428. /*
  429. * Return if this type of quotas is turned off while we
  430. * didn't have the quota inode lock.
  431. */
  432. xfs_iunlock(quotip, lock_mode);
  433. return ESRCH;
  434. }
  435. /*
  436. * Find the block map; no allocations yet
  437. */
  438. error = xfs_bmapi_read(quotip, dqp->q_fileoffset,
  439. XFS_DQUOT_CLUSTER_SIZE_FSB, &map, &nmaps, 0);
  440. xfs_iunlock(quotip, lock_mode);
  441. if (error)
  442. return error;
  443. ASSERT(nmaps == 1);
  444. ASSERT(map.br_blockcount == 1);
  445. /*
  446. * Offset of dquot in the (fixed sized) dquot chunk.
  447. */
  448. dqp->q_bufoffset = (id % mp->m_quotainfo->qi_dqperchunk) *
  449. sizeof(xfs_dqblk_t);
  450. ASSERT(map.br_startblock != DELAYSTARTBLOCK);
  451. if (map.br_startblock == HOLESTARTBLOCK) {
  452. /*
  453. * We don't allocate unless we're asked to
  454. */
  455. if (!(flags & XFS_QMOPT_DQALLOC))
  456. return ENOENT;
  457. ASSERT(tp);
  458. error = xfs_qm_dqalloc(tpp, mp, dqp, quotip,
  459. dqp->q_fileoffset, &bp);
  460. if (error)
  461. return error;
  462. tp = *tpp;
  463. } else {
  464. trace_xfs_dqtobp_read(dqp);
  465. /*
  466. * store the blkno etc so that we don't have to do the
  467. * mapping all the time
  468. */
  469. dqp->q_blkno = XFS_FSB_TO_DADDR(mp, map.br_startblock);
  470. error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp,
  471. dqp->q_blkno,
  472. mp->m_quotainfo->qi_dqchunklen,
  473. 0, &bp, &xfs_dquot_buf_ops);
  474. if (error == EFSCORRUPTED && (flags & XFS_QMOPT_DQREPAIR)) {
  475. xfs_dqid_t firstid = (xfs_dqid_t)map.br_startoff *
  476. mp->m_quotainfo->qi_dqperchunk;
  477. ASSERT(bp == NULL);
  478. error = xfs_qm_dqrepair(mp, tp, dqp, firstid, &bp);
  479. }
  480. if (error) {
  481. ASSERT(bp == NULL);
  482. return XFS_ERROR(error);
  483. }
  484. }
  485. ASSERT(xfs_buf_islocked(bp));
  486. *O_bpp = bp;
  487. *O_ddpp = bp->b_addr + dqp->q_bufoffset;
  488. return (0);
  489. }
  490. /*
  491. * Read in the ondisk dquot using dqtobp() then copy it to an incore version,
  492. * and release the buffer immediately.
  493. *
  494. * If XFS_QMOPT_DQALLOC is set, allocate a dquot on disk if it needed.
  495. */
  496. int
  497. xfs_qm_dqread(
  498. struct xfs_mount *mp,
  499. xfs_dqid_t id,
  500. uint type,
  501. uint flags,
  502. struct xfs_dquot **O_dqpp)
  503. {
  504. struct xfs_dquot *dqp;
  505. struct xfs_disk_dquot *ddqp;
  506. struct xfs_buf *bp;
  507. struct xfs_trans *tp = NULL;
  508. int error;
  509. int cancelflags = 0;
  510. dqp = kmem_zone_zalloc(xfs_qm_dqzone, KM_SLEEP);
  511. dqp->dq_flags = type;
  512. dqp->q_core.d_id = cpu_to_be32(id);
  513. dqp->q_mount = mp;
  514. INIT_LIST_HEAD(&dqp->q_lru);
  515. mutex_init(&dqp->q_qlock);
  516. init_waitqueue_head(&dqp->q_pinwait);
  517. /*
  518. * Because we want to use a counting completion, complete
  519. * the flush completion once to allow a single access to
  520. * the flush completion without blocking.
  521. */
  522. init_completion(&dqp->q_flush);
  523. complete(&dqp->q_flush);
  524. /*
  525. * Make sure group quotas have a different lock class than user
  526. * quotas.
  527. */
  528. switch (type) {
  529. case XFS_DQ_USER:
  530. /* uses the default lock class */
  531. break;
  532. case XFS_DQ_GROUP:
  533. lockdep_set_class(&dqp->q_qlock, &xfs_dquot_group_class);
  534. break;
  535. case XFS_DQ_PROJ:
  536. lockdep_set_class(&dqp->q_qlock, &xfs_dquot_project_class);
  537. break;
  538. default:
  539. ASSERT(0);
  540. break;
  541. }
  542. XFS_STATS_INC(xs_qm_dquot);
  543. trace_xfs_dqread(dqp);
  544. if (flags & XFS_QMOPT_DQALLOC) {
  545. tp = xfs_trans_alloc(mp, XFS_TRANS_QM_DQALLOC);
  546. error = xfs_trans_reserve(tp, &M_RES(mp)->tr_qm_dqalloc,
  547. XFS_QM_DQALLOC_SPACE_RES(mp), 0);
  548. if (error)
  549. goto error1;
  550. cancelflags = XFS_TRANS_RELEASE_LOG_RES;
  551. }
  552. /*
  553. * get a pointer to the on-disk dquot and the buffer containing it
  554. * dqp already knows its own type (GROUP/USER).
  555. */
  556. error = xfs_qm_dqtobp(&tp, dqp, &ddqp, &bp, flags);
  557. if (error) {
  558. /*
  559. * This can happen if quotas got turned off (ESRCH),
  560. * or if the dquot didn't exist on disk and we ask to
  561. * allocate (ENOENT).
  562. */
  563. trace_xfs_dqread_fail(dqp);
  564. cancelflags |= XFS_TRANS_ABORT;
  565. goto error1;
  566. }
  567. /* copy everything from disk dquot to the incore dquot */
  568. memcpy(&dqp->q_core, ddqp, sizeof(xfs_disk_dquot_t));
  569. xfs_qm_dquot_logitem_init(dqp);
  570. /*
  571. * Reservation counters are defined as reservation plus current usage
  572. * to avoid having to add every time.
  573. */
  574. dqp->q_res_bcount = be64_to_cpu(ddqp->d_bcount);
  575. dqp->q_res_icount = be64_to_cpu(ddqp->d_icount);
  576. dqp->q_res_rtbcount = be64_to_cpu(ddqp->d_rtbcount);
  577. /* initialize the dquot speculative prealloc thresholds */
  578. xfs_dquot_set_prealloc_limits(dqp);
  579. /* Mark the buf so that this will stay incore a little longer */
  580. xfs_buf_set_ref(bp, XFS_DQUOT_REF);
  581. /*
  582. * We got the buffer with a xfs_trans_read_buf() (in dqtobp())
  583. * So we need to release with xfs_trans_brelse().
  584. * The strategy here is identical to that of inodes; we lock
  585. * the dquot in xfs_qm_dqget() before making it accessible to
  586. * others. This is because dquots, like inodes, need a good level of
  587. * concurrency, and we don't want to take locks on the entire buffers
  588. * for dquot accesses.
  589. * Note also that the dquot buffer may even be dirty at this point, if
  590. * this particular dquot was repaired. We still aren't afraid to
  591. * brelse it because we have the changes incore.
  592. */
  593. ASSERT(xfs_buf_islocked(bp));
  594. xfs_trans_brelse(tp, bp);
  595. if (tp) {
  596. error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES);
  597. if (error)
  598. goto error0;
  599. }
  600. *O_dqpp = dqp;
  601. return error;
  602. error1:
  603. if (tp)
  604. xfs_trans_cancel(tp, cancelflags);
  605. error0:
  606. xfs_qm_dqdestroy(dqp);
  607. *O_dqpp = NULL;
  608. return error;
  609. }
  610. /*
  611. * Given the file system, inode OR id, and type (UDQUOT/GDQUOT), return a
  612. * a locked dquot, doing an allocation (if requested) as needed.
  613. * When both an inode and an id are given, the inode's id takes precedence.
  614. * That is, if the id changes while we don't hold the ilock inside this
  615. * function, the new dquot is returned, not necessarily the one requested
  616. * in the id argument.
  617. */
  618. int
  619. xfs_qm_dqget(
  620. xfs_mount_t *mp,
  621. xfs_inode_t *ip, /* locked inode (optional) */
  622. xfs_dqid_t id, /* uid/projid/gid depending on type */
  623. uint type, /* XFS_DQ_USER/XFS_DQ_PROJ/XFS_DQ_GROUP */
  624. uint flags, /* DQALLOC, DQSUSER, DQREPAIR, DOWARN */
  625. xfs_dquot_t **O_dqpp) /* OUT : locked incore dquot */
  626. {
  627. struct xfs_quotainfo *qi = mp->m_quotainfo;
  628. struct radix_tree_root *tree = xfs_dquot_tree(qi, type);
  629. struct xfs_dquot *dqp;
  630. int error;
  631. ASSERT(XFS_IS_QUOTA_RUNNING(mp));
  632. if ((! XFS_IS_UQUOTA_ON(mp) && type == XFS_DQ_USER) ||
  633. (! XFS_IS_PQUOTA_ON(mp) && type == XFS_DQ_PROJ) ||
  634. (! XFS_IS_GQUOTA_ON(mp) && type == XFS_DQ_GROUP)) {
  635. return (ESRCH);
  636. }
  637. #ifdef DEBUG
  638. if (xfs_do_dqerror) {
  639. if ((xfs_dqerror_target == mp->m_ddev_targp) &&
  640. (xfs_dqreq_num++ % xfs_dqerror_mod) == 0) {
  641. xfs_debug(mp, "Returning error in dqget");
  642. return (EIO);
  643. }
  644. }
  645. ASSERT(type == XFS_DQ_USER ||
  646. type == XFS_DQ_PROJ ||
  647. type == XFS_DQ_GROUP);
  648. if (ip) {
  649. ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL));
  650. ASSERT(xfs_inode_dquot(ip, type) == NULL);
  651. }
  652. #endif
  653. restart:
  654. mutex_lock(&qi->qi_tree_lock);
  655. dqp = radix_tree_lookup(tree, id);
  656. if (dqp) {
  657. xfs_dqlock(dqp);
  658. if (dqp->dq_flags & XFS_DQ_FREEING) {
  659. xfs_dqunlock(dqp);
  660. mutex_unlock(&qi->qi_tree_lock);
  661. trace_xfs_dqget_freeing(dqp);
  662. delay(1);
  663. goto restart;
  664. }
  665. dqp->q_nrefs++;
  666. mutex_unlock(&qi->qi_tree_lock);
  667. trace_xfs_dqget_hit(dqp);
  668. XFS_STATS_INC(xs_qm_dqcachehits);
  669. *O_dqpp = dqp;
  670. return 0;
  671. }
  672. mutex_unlock(&qi->qi_tree_lock);
  673. XFS_STATS_INC(xs_qm_dqcachemisses);
  674. /*
  675. * Dquot cache miss. We don't want to keep the inode lock across
  676. * a (potential) disk read. Also we don't want to deal with the lock
  677. * ordering between quotainode and this inode. OTOH, dropping the inode
  678. * lock here means dealing with a chown that can happen before
  679. * we re-acquire the lock.
  680. */
  681. if (ip)
  682. xfs_iunlock(ip, XFS_ILOCK_EXCL);
  683. error = xfs_qm_dqread(mp, id, type, flags, &dqp);
  684. if (ip)
  685. xfs_ilock(ip, XFS_ILOCK_EXCL);
  686. if (error)
  687. return error;
  688. if (ip) {
  689. /*
  690. * A dquot could be attached to this inode by now, since
  691. * we had dropped the ilock.
  692. */
  693. if (xfs_this_quota_on(mp, type)) {
  694. struct xfs_dquot *dqp1;
  695. dqp1 = xfs_inode_dquot(ip, type);
  696. if (dqp1) {
  697. xfs_qm_dqdestroy(dqp);
  698. dqp = dqp1;
  699. xfs_dqlock(dqp);
  700. goto dqret;
  701. }
  702. } else {
  703. /* inode stays locked on return */
  704. xfs_qm_dqdestroy(dqp);
  705. return XFS_ERROR(ESRCH);
  706. }
  707. }
  708. mutex_lock(&qi->qi_tree_lock);
  709. error = -radix_tree_insert(tree, id, dqp);
  710. if (unlikely(error)) {
  711. WARN_ON(error != EEXIST);
  712. /*
  713. * Duplicate found. Just throw away the new dquot and start
  714. * over.
  715. */
  716. mutex_unlock(&qi->qi_tree_lock);
  717. trace_xfs_dqget_dup(dqp);
  718. xfs_qm_dqdestroy(dqp);
  719. XFS_STATS_INC(xs_qm_dquot_dups);
  720. goto restart;
  721. }
  722. /*
  723. * We return a locked dquot to the caller, with a reference taken
  724. */
  725. xfs_dqlock(dqp);
  726. dqp->q_nrefs = 1;
  727. qi->qi_dquots++;
  728. mutex_unlock(&qi->qi_tree_lock);
  729. dqret:
  730. ASSERT((ip == NULL) || xfs_isilocked(ip, XFS_ILOCK_EXCL));
  731. trace_xfs_dqget_miss(dqp);
  732. *O_dqpp = dqp;
  733. return (0);
  734. }
  735. STATIC void
  736. xfs_qm_dqput_final(
  737. struct xfs_dquot *dqp)
  738. {
  739. struct xfs_quotainfo *qi = dqp->q_mount->m_quotainfo;
  740. struct xfs_dquot *gdqp;
  741. struct xfs_dquot *pdqp;
  742. trace_xfs_dqput_free(dqp);
  743. if (list_lru_add(&qi->qi_lru, &dqp->q_lru))
  744. XFS_STATS_INC(xs_qm_dquot_unused);
  745. /*
  746. * If we just added a udquot to the freelist, then we want to release
  747. * the gdquot/pdquot reference that it (probably) has. Otherwise it'll
  748. * keep the gdquot/pdquot from getting reclaimed.
  749. */
  750. gdqp = dqp->q_gdquot;
  751. if (gdqp) {
  752. xfs_dqlock(gdqp);
  753. dqp->q_gdquot = NULL;
  754. }
  755. pdqp = dqp->q_pdquot;
  756. if (pdqp) {
  757. xfs_dqlock(pdqp);
  758. dqp->q_pdquot = NULL;
  759. }
  760. xfs_dqunlock(dqp);
  761. /*
  762. * If we had a group/project quota hint, release it now.
  763. */
  764. if (gdqp)
  765. xfs_qm_dqput(gdqp);
  766. if (pdqp)
  767. xfs_qm_dqput(pdqp);
  768. }
  769. /*
  770. * Release a reference to the dquot (decrement ref-count) and unlock it.
  771. *
  772. * If there is a group quota attached to this dquot, carefully release that
  773. * too without tripping over deadlocks'n'stuff.
  774. */
  775. void
  776. xfs_qm_dqput(
  777. struct xfs_dquot *dqp)
  778. {
  779. ASSERT(dqp->q_nrefs > 0);
  780. ASSERT(XFS_DQ_IS_LOCKED(dqp));
  781. trace_xfs_dqput(dqp);
  782. if (--dqp->q_nrefs > 0)
  783. xfs_dqunlock(dqp);
  784. else
  785. xfs_qm_dqput_final(dqp);
  786. }
  787. /*
  788. * Release a dquot. Flush it if dirty, then dqput() it.
  789. * dquot must not be locked.
  790. */
  791. void
  792. xfs_qm_dqrele(
  793. xfs_dquot_t *dqp)
  794. {
  795. if (!dqp)
  796. return;
  797. trace_xfs_dqrele(dqp);
  798. xfs_dqlock(dqp);
  799. /*
  800. * We don't care to flush it if the dquot is dirty here.
  801. * That will create stutters that we want to avoid.
  802. * Instead we do a delayed write when we try to reclaim
  803. * a dirty dquot. Also xfs_sync will take part of the burden...
  804. */
  805. xfs_qm_dqput(dqp);
  806. }
  807. /*
  808. * This is the dquot flushing I/O completion routine. It is called
  809. * from interrupt level when the buffer containing the dquot is
  810. * flushed to disk. It is responsible for removing the dquot logitem
  811. * from the AIL if it has not been re-logged, and unlocking the dquot's
  812. * flush lock. This behavior is very similar to that of inodes..
  813. */
  814. STATIC void
  815. xfs_qm_dqflush_done(
  816. struct xfs_buf *bp,
  817. struct xfs_log_item *lip)
  818. {
  819. xfs_dq_logitem_t *qip = (struct xfs_dq_logitem *)lip;
  820. xfs_dquot_t *dqp = qip->qli_dquot;
  821. struct xfs_ail *ailp = lip->li_ailp;
  822. /*
  823. * We only want to pull the item from the AIL if its
  824. * location in the log has not changed since we started the flush.
  825. * Thus, we only bother if the dquot's lsn has
  826. * not changed. First we check the lsn outside the lock
  827. * since it's cheaper, and then we recheck while
  828. * holding the lock before removing the dquot from the AIL.
  829. */
  830. if ((lip->li_flags & XFS_LI_IN_AIL) &&
  831. lip->li_lsn == qip->qli_flush_lsn) {
  832. /* xfs_trans_ail_delete() drops the AIL lock. */
  833. spin_lock(&ailp->xa_lock);
  834. if (lip->li_lsn == qip->qli_flush_lsn)
  835. xfs_trans_ail_delete(ailp, lip, SHUTDOWN_CORRUPT_INCORE);
  836. else
  837. spin_unlock(&ailp->xa_lock);
  838. }
  839. /*
  840. * Release the dq's flush lock since we're done with it.
  841. */
  842. xfs_dqfunlock(dqp);
  843. }
  844. /*
  845. * Write a modified dquot to disk.
  846. * The dquot must be locked and the flush lock too taken by caller.
  847. * The flush lock will not be unlocked until the dquot reaches the disk,
  848. * but the dquot is free to be unlocked and modified by the caller
  849. * in the interim. Dquot is still locked on return. This behavior is
  850. * identical to that of inodes.
  851. */
  852. int
  853. xfs_qm_dqflush(
  854. struct xfs_dquot *dqp,
  855. struct xfs_buf **bpp)
  856. {
  857. struct xfs_mount *mp = dqp->q_mount;
  858. struct xfs_buf *bp;
  859. struct xfs_disk_dquot *ddqp;
  860. int error;
  861. ASSERT(XFS_DQ_IS_LOCKED(dqp));
  862. ASSERT(!completion_done(&dqp->q_flush));
  863. trace_xfs_dqflush(dqp);
  864. *bpp = NULL;
  865. xfs_qm_dqunpin_wait(dqp);
  866. /*
  867. * This may have been unpinned because the filesystem is shutting
  868. * down forcibly. If that's the case we must not write this dquot
  869. * to disk, because the log record didn't make it to disk.
  870. *
  871. * We also have to remove the log item from the AIL in this case,
  872. * as we wait for an emptry AIL as part of the unmount process.
  873. */
  874. if (XFS_FORCED_SHUTDOWN(mp)) {
  875. struct xfs_log_item *lip = &dqp->q_logitem.qli_item;
  876. dqp->dq_flags &= ~XFS_DQ_DIRTY;
  877. spin_lock(&mp->m_ail->xa_lock);
  878. if (lip->li_flags & XFS_LI_IN_AIL)
  879. xfs_trans_ail_delete(mp->m_ail, lip,
  880. SHUTDOWN_CORRUPT_INCORE);
  881. else
  882. spin_unlock(&mp->m_ail->xa_lock);
  883. error = XFS_ERROR(EIO);
  884. goto out_unlock;
  885. }
  886. /*
  887. * Get the buffer containing the on-disk dquot
  888. */
  889. error = xfs_trans_read_buf(mp, NULL, mp->m_ddev_targp, dqp->q_blkno,
  890. mp->m_quotainfo->qi_dqchunklen, 0, &bp, NULL);
  891. if (error)
  892. goto out_unlock;
  893. /*
  894. * Calculate the location of the dquot inside the buffer.
  895. */
  896. ddqp = bp->b_addr + dqp->q_bufoffset;
  897. /*
  898. * A simple sanity check in case we got a corrupted dquot..
  899. */
  900. error = xfs_dqcheck(mp, &dqp->q_core, be32_to_cpu(ddqp->d_id), 0,
  901. XFS_QMOPT_DOWARN, "dqflush (incore copy)");
  902. if (error) {
  903. xfs_buf_relse(bp);
  904. xfs_dqfunlock(dqp);
  905. xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE);
  906. return XFS_ERROR(EIO);
  907. }
  908. /* This is the only portion of data that needs to persist */
  909. memcpy(ddqp, &dqp->q_core, sizeof(xfs_disk_dquot_t));
  910. /*
  911. * Clear the dirty field and remember the flush lsn for later use.
  912. */
  913. dqp->dq_flags &= ~XFS_DQ_DIRTY;
  914. xfs_trans_ail_copy_lsn(mp->m_ail, &dqp->q_logitem.qli_flush_lsn,
  915. &dqp->q_logitem.qli_item.li_lsn);
  916. /*
  917. * copy the lsn into the on-disk dquot now while we have the in memory
  918. * dquot here. This can't be done later in the write verifier as we
  919. * can't get access to the log item at that point in time.
  920. *
  921. * We also calculate the CRC here so that the on-disk dquot in the
  922. * buffer always has a valid CRC. This ensures there is no possibility
  923. * of a dquot without an up-to-date CRC getting to disk.
  924. */
  925. if (xfs_sb_version_hascrc(&mp->m_sb)) {
  926. struct xfs_dqblk *dqb = (struct xfs_dqblk *)ddqp;
  927. dqb->dd_lsn = cpu_to_be64(dqp->q_logitem.qli_item.li_lsn);
  928. xfs_update_cksum((char *)dqb, sizeof(struct xfs_dqblk),
  929. XFS_DQUOT_CRC_OFF);
  930. }
  931. /*
  932. * Attach an iodone routine so that we can remove this dquot from the
  933. * AIL and release the flush lock once the dquot is synced to disk.
  934. */
  935. xfs_buf_attach_iodone(bp, xfs_qm_dqflush_done,
  936. &dqp->q_logitem.qli_item);
  937. /*
  938. * If the buffer is pinned then push on the log so we won't
  939. * get stuck waiting in the write for too long.
  940. */
  941. if (xfs_buf_ispinned(bp)) {
  942. trace_xfs_dqflush_force(dqp);
  943. xfs_log_force(mp, 0);
  944. }
  945. trace_xfs_dqflush_done(dqp);
  946. *bpp = bp;
  947. return 0;
  948. out_unlock:
  949. xfs_dqfunlock(dqp);
  950. return XFS_ERROR(EIO);
  951. }
  952. /*
  953. * Lock two xfs_dquot structures.
  954. *
  955. * To avoid deadlocks we always lock the quota structure with
  956. * the lowerd id first.
  957. */
  958. void
  959. xfs_dqlock2(
  960. xfs_dquot_t *d1,
  961. xfs_dquot_t *d2)
  962. {
  963. if (d1 && d2) {
  964. ASSERT(d1 != d2);
  965. if (be32_to_cpu(d1->q_core.d_id) >
  966. be32_to_cpu(d2->q_core.d_id)) {
  967. mutex_lock(&d2->q_qlock);
  968. mutex_lock_nested(&d1->q_qlock, XFS_QLOCK_NESTED);
  969. } else {
  970. mutex_lock(&d1->q_qlock);
  971. mutex_lock_nested(&d2->q_qlock, XFS_QLOCK_NESTED);
  972. }
  973. } else if (d1) {
  974. mutex_lock(&d1->q_qlock);
  975. } else if (d2) {
  976. mutex_lock(&d2->q_qlock);
  977. }
  978. }
  979. int __init
  980. xfs_qm_init(void)
  981. {
  982. xfs_qm_dqzone =
  983. kmem_zone_init(sizeof(struct xfs_dquot), "xfs_dquot");
  984. if (!xfs_qm_dqzone)
  985. goto out;
  986. xfs_qm_dqtrxzone =
  987. kmem_zone_init(sizeof(struct xfs_dquot_acct), "xfs_dqtrx");
  988. if (!xfs_qm_dqtrxzone)
  989. goto out_free_dqzone;
  990. return 0;
  991. out_free_dqzone:
  992. kmem_zone_destroy(xfs_qm_dqzone);
  993. out:
  994. return -ENOMEM;
  995. }
  996. void
  997. xfs_qm_exit(void)
  998. {
  999. kmem_zone_destroy(xfs_qm_dqtrxzone);
  1000. kmem_zone_destroy(xfs_qm_dqzone);
  1001. }