xfs_fsops.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692
  1. /*
  2. * Copyright (c) 2000-2005 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_types.h"
  21. #include "xfs_bit.h"
  22. #include "xfs_inum.h"
  23. #include "xfs_log.h"
  24. #include "xfs_trans.h"
  25. #include "xfs_sb.h"
  26. #include "xfs_ag.h"
  27. #include "xfs_mount.h"
  28. #include "xfs_bmap_btree.h"
  29. #include "xfs_alloc_btree.h"
  30. #include "xfs_ialloc_btree.h"
  31. #include "xfs_dinode.h"
  32. #include "xfs_inode.h"
  33. #include "xfs_inode_item.h"
  34. #include "xfs_btree.h"
  35. #include "xfs_error.h"
  36. #include "xfs_alloc.h"
  37. #include "xfs_ialloc.h"
  38. #include "xfs_fsops.h"
  39. #include "xfs_itable.h"
  40. #include "xfs_trans_space.h"
  41. #include "xfs_rtalloc.h"
  42. #include "xfs_rw.h"
  43. #include "xfs_filestream.h"
  44. #include "xfs_trace.h"
  45. /*
  46. * File system operations
  47. */
  48. int
  49. xfs_fs_geometry(
  50. xfs_mount_t *mp,
  51. xfs_fsop_geom_t *geo,
  52. int new_version)
  53. {
  54. memset(geo, 0, sizeof(*geo));
  55. geo->blocksize = mp->m_sb.sb_blocksize;
  56. geo->rtextsize = mp->m_sb.sb_rextsize;
  57. geo->agblocks = mp->m_sb.sb_agblocks;
  58. geo->agcount = mp->m_sb.sb_agcount;
  59. geo->logblocks = mp->m_sb.sb_logblocks;
  60. geo->sectsize = mp->m_sb.sb_sectsize;
  61. geo->inodesize = mp->m_sb.sb_inodesize;
  62. geo->imaxpct = mp->m_sb.sb_imax_pct;
  63. geo->datablocks = mp->m_sb.sb_dblocks;
  64. geo->rtblocks = mp->m_sb.sb_rblocks;
  65. geo->rtextents = mp->m_sb.sb_rextents;
  66. geo->logstart = mp->m_sb.sb_logstart;
  67. ASSERT(sizeof(geo->uuid)==sizeof(mp->m_sb.sb_uuid));
  68. memcpy(geo->uuid, &mp->m_sb.sb_uuid, sizeof(mp->m_sb.sb_uuid));
  69. if (new_version >= 2) {
  70. geo->sunit = mp->m_sb.sb_unit;
  71. geo->swidth = mp->m_sb.sb_width;
  72. }
  73. if (new_version >= 3) {
  74. geo->version = XFS_FSOP_GEOM_VERSION;
  75. geo->flags =
  76. (xfs_sb_version_hasattr(&mp->m_sb) ?
  77. XFS_FSOP_GEOM_FLAGS_ATTR : 0) |
  78. (xfs_sb_version_hasnlink(&mp->m_sb) ?
  79. XFS_FSOP_GEOM_FLAGS_NLINK : 0) |
  80. (xfs_sb_version_hasquota(&mp->m_sb) ?
  81. XFS_FSOP_GEOM_FLAGS_QUOTA : 0) |
  82. (xfs_sb_version_hasalign(&mp->m_sb) ?
  83. XFS_FSOP_GEOM_FLAGS_IALIGN : 0) |
  84. (xfs_sb_version_hasdalign(&mp->m_sb) ?
  85. XFS_FSOP_GEOM_FLAGS_DALIGN : 0) |
  86. (xfs_sb_version_hasshared(&mp->m_sb) ?
  87. XFS_FSOP_GEOM_FLAGS_SHARED : 0) |
  88. (xfs_sb_version_hasextflgbit(&mp->m_sb) ?
  89. XFS_FSOP_GEOM_FLAGS_EXTFLG : 0) |
  90. (xfs_sb_version_hasdirv2(&mp->m_sb) ?
  91. XFS_FSOP_GEOM_FLAGS_DIRV2 : 0) |
  92. (xfs_sb_version_hassector(&mp->m_sb) ?
  93. XFS_FSOP_GEOM_FLAGS_SECTOR : 0) |
  94. (xfs_sb_version_hasasciici(&mp->m_sb) ?
  95. XFS_FSOP_GEOM_FLAGS_DIRV2CI : 0) |
  96. (xfs_sb_version_haslazysbcount(&mp->m_sb) ?
  97. XFS_FSOP_GEOM_FLAGS_LAZYSB : 0) |
  98. (xfs_sb_version_hasattr2(&mp->m_sb) ?
  99. XFS_FSOP_GEOM_FLAGS_ATTR2 : 0);
  100. geo->logsectsize = xfs_sb_version_hassector(&mp->m_sb) ?
  101. mp->m_sb.sb_logsectsize : BBSIZE;
  102. geo->rtsectsize = mp->m_sb.sb_blocksize;
  103. geo->dirblocksize = mp->m_dirblksize;
  104. }
  105. if (new_version >= 4) {
  106. geo->flags |=
  107. (xfs_sb_version_haslogv2(&mp->m_sb) ?
  108. XFS_FSOP_GEOM_FLAGS_LOGV2 : 0);
  109. geo->logsunit = mp->m_sb.sb_logsunit;
  110. }
  111. return 0;
  112. }
  113. static int
  114. xfs_growfs_data_private(
  115. xfs_mount_t *mp, /* mount point for filesystem */
  116. xfs_growfs_data_t *in) /* growfs data input struct */
  117. {
  118. xfs_agf_t *agf;
  119. xfs_agi_t *agi;
  120. xfs_agnumber_t agno;
  121. xfs_extlen_t agsize;
  122. xfs_extlen_t tmpsize;
  123. xfs_alloc_rec_t *arec;
  124. struct xfs_btree_block *block;
  125. xfs_buf_t *bp;
  126. int bucket;
  127. int dpct;
  128. int error;
  129. xfs_agnumber_t nagcount;
  130. xfs_agnumber_t nagimax = 0;
  131. xfs_rfsblock_t nb, nb_mod;
  132. xfs_rfsblock_t new;
  133. xfs_rfsblock_t nfree;
  134. xfs_agnumber_t oagcount;
  135. int pct;
  136. xfs_trans_t *tp;
  137. nb = in->newblocks;
  138. pct = in->imaxpct;
  139. if (nb < mp->m_sb.sb_dblocks || pct < 0 || pct > 100)
  140. return XFS_ERROR(EINVAL);
  141. if ((error = xfs_sb_validate_fsb_count(&mp->m_sb, nb)))
  142. return error;
  143. dpct = pct - mp->m_sb.sb_imax_pct;
  144. bp = xfs_buf_read_uncached(mp->m_ddev_targp,
  145. XFS_FSB_TO_BB(mp, nb) - XFS_FSS_TO_BB(mp, 1),
  146. XFS_FSS_TO_BB(mp, 1), 0);
  147. if (!bp)
  148. return EIO;
  149. xfs_buf_relse(bp);
  150. new = nb; /* use new as a temporary here */
  151. nb_mod = do_div(new, mp->m_sb.sb_agblocks);
  152. nagcount = new + (nb_mod != 0);
  153. if (nb_mod && nb_mod < XFS_MIN_AG_BLOCKS) {
  154. nagcount--;
  155. nb = (xfs_rfsblock_t)nagcount * mp->m_sb.sb_agblocks;
  156. if (nb < mp->m_sb.sb_dblocks)
  157. return XFS_ERROR(EINVAL);
  158. }
  159. new = nb - mp->m_sb.sb_dblocks;
  160. oagcount = mp->m_sb.sb_agcount;
  161. /* allocate the new per-ag structures */
  162. if (nagcount > oagcount) {
  163. error = xfs_initialize_perag(mp, nagcount, &nagimax);
  164. if (error)
  165. return error;
  166. }
  167. tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFS);
  168. tp->t_flags |= XFS_TRANS_RESERVE;
  169. if ((error = xfs_trans_reserve(tp, XFS_GROWFS_SPACE_RES(mp),
  170. XFS_GROWDATA_LOG_RES(mp), 0, 0, 0))) {
  171. xfs_trans_cancel(tp, 0);
  172. return error;
  173. }
  174. /*
  175. * Write new AG headers to disk. Non-transactional, but written
  176. * synchronously so they are completed prior to the growfs transaction
  177. * being logged.
  178. */
  179. nfree = 0;
  180. for (agno = nagcount - 1; agno >= oagcount; agno--, new -= agsize) {
  181. /*
  182. * AG freelist header block
  183. */
  184. bp = xfs_buf_get(mp->m_ddev_targp,
  185. XFS_AG_DADDR(mp, agno, XFS_AGF_DADDR(mp)),
  186. XFS_FSS_TO_BB(mp, 1), XBF_MAPPED);
  187. if (!bp) {
  188. error = ENOMEM;
  189. goto error0;
  190. }
  191. agf = XFS_BUF_TO_AGF(bp);
  192. memset(agf, 0, mp->m_sb.sb_sectsize);
  193. agf->agf_magicnum = cpu_to_be32(XFS_AGF_MAGIC);
  194. agf->agf_versionnum = cpu_to_be32(XFS_AGF_VERSION);
  195. agf->agf_seqno = cpu_to_be32(agno);
  196. if (agno == nagcount - 1)
  197. agsize =
  198. nb -
  199. (agno * (xfs_rfsblock_t)mp->m_sb.sb_agblocks);
  200. else
  201. agsize = mp->m_sb.sb_agblocks;
  202. agf->agf_length = cpu_to_be32(agsize);
  203. agf->agf_roots[XFS_BTNUM_BNOi] = cpu_to_be32(XFS_BNO_BLOCK(mp));
  204. agf->agf_roots[XFS_BTNUM_CNTi] = cpu_to_be32(XFS_CNT_BLOCK(mp));
  205. agf->agf_levels[XFS_BTNUM_BNOi] = cpu_to_be32(1);
  206. agf->agf_levels[XFS_BTNUM_CNTi] = cpu_to_be32(1);
  207. agf->agf_flfirst = 0;
  208. agf->agf_fllast = cpu_to_be32(XFS_AGFL_SIZE(mp) - 1);
  209. agf->agf_flcount = 0;
  210. tmpsize = agsize - XFS_PREALLOC_BLOCKS(mp);
  211. agf->agf_freeblks = cpu_to_be32(tmpsize);
  212. agf->agf_longest = cpu_to_be32(tmpsize);
  213. error = xfs_bwrite(bp);
  214. xfs_buf_relse(bp);
  215. if (error)
  216. goto error0;
  217. /*
  218. * AG inode header block
  219. */
  220. bp = xfs_buf_get(mp->m_ddev_targp,
  221. XFS_AG_DADDR(mp, agno, XFS_AGI_DADDR(mp)),
  222. XFS_FSS_TO_BB(mp, 1), XBF_MAPPED);
  223. if (!bp) {
  224. error = ENOMEM;
  225. goto error0;
  226. }
  227. agi = XFS_BUF_TO_AGI(bp);
  228. memset(agi, 0, mp->m_sb.sb_sectsize);
  229. agi->agi_magicnum = cpu_to_be32(XFS_AGI_MAGIC);
  230. agi->agi_versionnum = cpu_to_be32(XFS_AGI_VERSION);
  231. agi->agi_seqno = cpu_to_be32(agno);
  232. agi->agi_length = cpu_to_be32(agsize);
  233. agi->agi_count = 0;
  234. agi->agi_root = cpu_to_be32(XFS_IBT_BLOCK(mp));
  235. agi->agi_level = cpu_to_be32(1);
  236. agi->agi_freecount = 0;
  237. agi->agi_newino = cpu_to_be32(NULLAGINO);
  238. agi->agi_dirino = cpu_to_be32(NULLAGINO);
  239. for (bucket = 0; bucket < XFS_AGI_UNLINKED_BUCKETS; bucket++)
  240. agi->agi_unlinked[bucket] = cpu_to_be32(NULLAGINO);
  241. error = xfs_bwrite(bp);
  242. xfs_buf_relse(bp);
  243. if (error)
  244. goto error0;
  245. /*
  246. * BNO btree root block
  247. */
  248. bp = xfs_buf_get(mp->m_ddev_targp,
  249. XFS_AGB_TO_DADDR(mp, agno, XFS_BNO_BLOCK(mp)),
  250. BTOBB(mp->m_sb.sb_blocksize), XBF_MAPPED);
  251. if (!bp) {
  252. error = ENOMEM;
  253. goto error0;
  254. }
  255. block = XFS_BUF_TO_BLOCK(bp);
  256. memset(block, 0, mp->m_sb.sb_blocksize);
  257. block->bb_magic = cpu_to_be32(XFS_ABTB_MAGIC);
  258. block->bb_level = 0;
  259. block->bb_numrecs = cpu_to_be16(1);
  260. block->bb_u.s.bb_leftsib = cpu_to_be32(NULLAGBLOCK);
  261. block->bb_u.s.bb_rightsib = cpu_to_be32(NULLAGBLOCK);
  262. arec = XFS_ALLOC_REC_ADDR(mp, block, 1);
  263. arec->ar_startblock = cpu_to_be32(XFS_PREALLOC_BLOCKS(mp));
  264. arec->ar_blockcount = cpu_to_be32(
  265. agsize - be32_to_cpu(arec->ar_startblock));
  266. error = xfs_bwrite(bp);
  267. xfs_buf_relse(bp);
  268. if (error)
  269. goto error0;
  270. /*
  271. * CNT btree root block
  272. */
  273. bp = xfs_buf_get(mp->m_ddev_targp,
  274. XFS_AGB_TO_DADDR(mp, agno, XFS_CNT_BLOCK(mp)),
  275. BTOBB(mp->m_sb.sb_blocksize), XBF_MAPPED);
  276. if (!bp) {
  277. error = ENOMEM;
  278. goto error0;
  279. }
  280. block = XFS_BUF_TO_BLOCK(bp);
  281. memset(block, 0, mp->m_sb.sb_blocksize);
  282. block->bb_magic = cpu_to_be32(XFS_ABTC_MAGIC);
  283. block->bb_level = 0;
  284. block->bb_numrecs = cpu_to_be16(1);
  285. block->bb_u.s.bb_leftsib = cpu_to_be32(NULLAGBLOCK);
  286. block->bb_u.s.bb_rightsib = cpu_to_be32(NULLAGBLOCK);
  287. arec = XFS_ALLOC_REC_ADDR(mp, block, 1);
  288. arec->ar_startblock = cpu_to_be32(XFS_PREALLOC_BLOCKS(mp));
  289. arec->ar_blockcount = cpu_to_be32(
  290. agsize - be32_to_cpu(arec->ar_startblock));
  291. nfree += be32_to_cpu(arec->ar_blockcount);
  292. error = xfs_bwrite(bp);
  293. xfs_buf_relse(bp);
  294. if (error)
  295. goto error0;
  296. /*
  297. * INO btree root block
  298. */
  299. bp = xfs_buf_get(mp->m_ddev_targp,
  300. XFS_AGB_TO_DADDR(mp, agno, XFS_IBT_BLOCK(mp)),
  301. BTOBB(mp->m_sb.sb_blocksize), XBF_MAPPED);
  302. if (!bp) {
  303. error = ENOMEM;
  304. goto error0;
  305. }
  306. block = XFS_BUF_TO_BLOCK(bp);
  307. memset(block, 0, mp->m_sb.sb_blocksize);
  308. block->bb_magic = cpu_to_be32(XFS_IBT_MAGIC);
  309. block->bb_level = 0;
  310. block->bb_numrecs = 0;
  311. block->bb_u.s.bb_leftsib = cpu_to_be32(NULLAGBLOCK);
  312. block->bb_u.s.bb_rightsib = cpu_to_be32(NULLAGBLOCK);
  313. error = xfs_bwrite(bp);
  314. xfs_buf_relse(bp);
  315. if (error)
  316. goto error0;
  317. }
  318. xfs_trans_agblocks_delta(tp, nfree);
  319. /*
  320. * There are new blocks in the old last a.g.
  321. */
  322. if (new) {
  323. /*
  324. * Change the agi length.
  325. */
  326. error = xfs_ialloc_read_agi(mp, tp, agno, &bp);
  327. if (error) {
  328. goto error0;
  329. }
  330. ASSERT(bp);
  331. agi = XFS_BUF_TO_AGI(bp);
  332. be32_add_cpu(&agi->agi_length, new);
  333. ASSERT(nagcount == oagcount ||
  334. be32_to_cpu(agi->agi_length) == mp->m_sb.sb_agblocks);
  335. xfs_ialloc_log_agi(tp, bp, XFS_AGI_LENGTH);
  336. /*
  337. * Change agf length.
  338. */
  339. error = xfs_alloc_read_agf(mp, tp, agno, 0, &bp);
  340. if (error) {
  341. goto error0;
  342. }
  343. ASSERT(bp);
  344. agf = XFS_BUF_TO_AGF(bp);
  345. be32_add_cpu(&agf->agf_length, new);
  346. ASSERT(be32_to_cpu(agf->agf_length) ==
  347. be32_to_cpu(agi->agi_length));
  348. xfs_alloc_log_agf(tp, bp, XFS_AGF_LENGTH);
  349. /*
  350. * Free the new space.
  351. */
  352. error = xfs_free_extent(tp, XFS_AGB_TO_FSB(mp, agno,
  353. be32_to_cpu(agf->agf_length) - new), new);
  354. if (error) {
  355. goto error0;
  356. }
  357. }
  358. /*
  359. * Update changed superblock fields transactionally. These are not
  360. * seen by the rest of the world until the transaction commit applies
  361. * them atomically to the superblock.
  362. */
  363. if (nagcount > oagcount)
  364. xfs_trans_mod_sb(tp, XFS_TRANS_SB_AGCOUNT, nagcount - oagcount);
  365. if (nb > mp->m_sb.sb_dblocks)
  366. xfs_trans_mod_sb(tp, XFS_TRANS_SB_DBLOCKS,
  367. nb - mp->m_sb.sb_dblocks);
  368. if (nfree)
  369. xfs_trans_mod_sb(tp, XFS_TRANS_SB_FDBLOCKS, nfree);
  370. if (dpct)
  371. xfs_trans_mod_sb(tp, XFS_TRANS_SB_IMAXPCT, dpct);
  372. error = xfs_trans_commit(tp, 0);
  373. if (error)
  374. return error;
  375. /* New allocation groups fully initialized, so update mount struct */
  376. if (nagimax)
  377. mp->m_maxagi = nagimax;
  378. if (mp->m_sb.sb_imax_pct) {
  379. __uint64_t icount = mp->m_sb.sb_dblocks * mp->m_sb.sb_imax_pct;
  380. do_div(icount, 100);
  381. mp->m_maxicount = icount << mp->m_sb.sb_inopblog;
  382. } else
  383. mp->m_maxicount = 0;
  384. xfs_set_low_space_thresholds(mp);
  385. /* update secondary superblocks. */
  386. for (agno = 1; agno < nagcount; agno++) {
  387. error = xfs_trans_read_buf(mp, NULL, mp->m_ddev_targp,
  388. XFS_AGB_TO_DADDR(mp, agno, XFS_SB_BLOCK(mp)),
  389. XFS_FSS_TO_BB(mp, 1), 0, &bp);
  390. if (error) {
  391. xfs_warn(mp,
  392. "error %d reading secondary superblock for ag %d",
  393. error, agno);
  394. break;
  395. }
  396. xfs_sb_to_disk(XFS_BUF_TO_SBP(bp), &mp->m_sb, XFS_SB_ALL_BITS);
  397. /*
  398. * If we get an error writing out the alternate superblocks,
  399. * just issue a warning and continue. The real work is
  400. * already done and committed.
  401. */
  402. error = xfs_bwrite(bp);
  403. xfs_buf_relse(bp);
  404. if (error) {
  405. xfs_warn(mp,
  406. "write error %d updating secondary superblock for ag %d",
  407. error, agno);
  408. break; /* no point in continuing */
  409. }
  410. }
  411. return 0;
  412. error0:
  413. xfs_trans_cancel(tp, XFS_TRANS_ABORT);
  414. return error;
  415. }
  416. static int
  417. xfs_growfs_log_private(
  418. xfs_mount_t *mp, /* mount point for filesystem */
  419. xfs_growfs_log_t *in) /* growfs log input struct */
  420. {
  421. xfs_extlen_t nb;
  422. nb = in->newblocks;
  423. if (nb < XFS_MIN_LOG_BLOCKS || nb < XFS_B_TO_FSB(mp, XFS_MIN_LOG_BYTES))
  424. return XFS_ERROR(EINVAL);
  425. if (nb == mp->m_sb.sb_logblocks &&
  426. in->isint == (mp->m_sb.sb_logstart != 0))
  427. return XFS_ERROR(EINVAL);
  428. /*
  429. * Moving the log is hard, need new interfaces to sync
  430. * the log first, hold off all activity while moving it.
  431. * Can have shorter or longer log in the same space,
  432. * or transform internal to external log or vice versa.
  433. */
  434. return XFS_ERROR(ENOSYS);
  435. }
  436. /*
  437. * protected versions of growfs function acquire and release locks on the mount
  438. * point - exported through ioctls: XFS_IOC_FSGROWFSDATA, XFS_IOC_FSGROWFSLOG,
  439. * XFS_IOC_FSGROWFSRT
  440. */
  441. int
  442. xfs_growfs_data(
  443. xfs_mount_t *mp,
  444. xfs_growfs_data_t *in)
  445. {
  446. int error;
  447. if (!capable(CAP_SYS_ADMIN))
  448. return XFS_ERROR(EPERM);
  449. if (!mutex_trylock(&mp->m_growlock))
  450. return XFS_ERROR(EWOULDBLOCK);
  451. error = xfs_growfs_data_private(mp, in);
  452. mutex_unlock(&mp->m_growlock);
  453. return error;
  454. }
  455. int
  456. xfs_growfs_log(
  457. xfs_mount_t *mp,
  458. xfs_growfs_log_t *in)
  459. {
  460. int error;
  461. if (!capable(CAP_SYS_ADMIN))
  462. return XFS_ERROR(EPERM);
  463. if (!mutex_trylock(&mp->m_growlock))
  464. return XFS_ERROR(EWOULDBLOCK);
  465. error = xfs_growfs_log_private(mp, in);
  466. mutex_unlock(&mp->m_growlock);
  467. return error;
  468. }
  469. /*
  470. * exported through ioctl XFS_IOC_FSCOUNTS
  471. */
  472. int
  473. xfs_fs_counts(
  474. xfs_mount_t *mp,
  475. xfs_fsop_counts_t *cnt)
  476. {
  477. xfs_icsb_sync_counters(mp, XFS_ICSB_LAZY_COUNT);
  478. spin_lock(&mp->m_sb_lock);
  479. cnt->freedata = mp->m_sb.sb_fdblocks - XFS_ALLOC_SET_ASIDE(mp);
  480. cnt->freertx = mp->m_sb.sb_frextents;
  481. cnt->freeino = mp->m_sb.sb_ifree;
  482. cnt->allocino = mp->m_sb.sb_icount;
  483. spin_unlock(&mp->m_sb_lock);
  484. return 0;
  485. }
  486. /*
  487. * exported through ioctl XFS_IOC_SET_RESBLKS & XFS_IOC_GET_RESBLKS
  488. *
  489. * xfs_reserve_blocks is called to set m_resblks
  490. * in the in-core mount table. The number of unused reserved blocks
  491. * is kept in m_resblks_avail.
  492. *
  493. * Reserve the requested number of blocks if available. Otherwise return
  494. * as many as possible to satisfy the request. The actual number
  495. * reserved are returned in outval
  496. *
  497. * A null inval pointer indicates that only the current reserved blocks
  498. * available should be returned no settings are changed.
  499. */
  500. int
  501. xfs_reserve_blocks(
  502. xfs_mount_t *mp,
  503. __uint64_t *inval,
  504. xfs_fsop_resblks_t *outval)
  505. {
  506. __int64_t lcounter, delta, fdblks_delta;
  507. __uint64_t request;
  508. /* If inval is null, report current values and return */
  509. if (inval == (__uint64_t *)NULL) {
  510. if (!outval)
  511. return EINVAL;
  512. outval->resblks = mp->m_resblks;
  513. outval->resblks_avail = mp->m_resblks_avail;
  514. return 0;
  515. }
  516. request = *inval;
  517. /*
  518. * With per-cpu counters, this becomes an interesting
  519. * problem. we needto work out if we are freeing or allocation
  520. * blocks first, then we can do the modification as necessary.
  521. *
  522. * We do this under the m_sb_lock so that if we are near
  523. * ENOSPC, we will hold out any changes while we work out
  524. * what to do. This means that the amount of free space can
  525. * change while we do this, so we need to retry if we end up
  526. * trying to reserve more space than is available.
  527. *
  528. * We also use the xfs_mod_incore_sb() interface so that we
  529. * don't have to care about whether per cpu counter are
  530. * enabled, disabled or even compiled in....
  531. */
  532. retry:
  533. spin_lock(&mp->m_sb_lock);
  534. xfs_icsb_sync_counters_locked(mp, 0);
  535. /*
  536. * If our previous reservation was larger than the current value,
  537. * then move any unused blocks back to the free pool.
  538. */
  539. fdblks_delta = 0;
  540. if (mp->m_resblks > request) {
  541. lcounter = mp->m_resblks_avail - request;
  542. if (lcounter > 0) { /* release unused blocks */
  543. fdblks_delta = lcounter;
  544. mp->m_resblks_avail -= lcounter;
  545. }
  546. mp->m_resblks = request;
  547. } else {
  548. __int64_t free;
  549. free = mp->m_sb.sb_fdblocks - XFS_ALLOC_SET_ASIDE(mp);
  550. if (!free)
  551. goto out; /* ENOSPC and fdblks_delta = 0 */
  552. delta = request - mp->m_resblks;
  553. lcounter = free - delta;
  554. if (lcounter < 0) {
  555. /* We can't satisfy the request, just get what we can */
  556. mp->m_resblks += free;
  557. mp->m_resblks_avail += free;
  558. fdblks_delta = -free;
  559. } else {
  560. fdblks_delta = -delta;
  561. mp->m_resblks = request;
  562. mp->m_resblks_avail += delta;
  563. }
  564. }
  565. out:
  566. if (outval) {
  567. outval->resblks = mp->m_resblks;
  568. outval->resblks_avail = mp->m_resblks_avail;
  569. }
  570. spin_unlock(&mp->m_sb_lock);
  571. if (fdblks_delta) {
  572. /*
  573. * If we are putting blocks back here, m_resblks_avail is
  574. * already at its max so this will put it in the free pool.
  575. *
  576. * If we need space, we'll either succeed in getting it
  577. * from the free block count or we'll get an enospc. If
  578. * we get a ENOSPC, it means things changed while we were
  579. * calculating fdblks_delta and so we should try again to
  580. * see if there is anything left to reserve.
  581. *
  582. * Don't set the reserved flag here - we don't want to reserve
  583. * the extra reserve blocks from the reserve.....
  584. */
  585. int error;
  586. error = xfs_icsb_modify_counters(mp, XFS_SBS_FDBLOCKS,
  587. fdblks_delta, 0);
  588. if (error == ENOSPC)
  589. goto retry;
  590. }
  591. return 0;
  592. }
  593. /*
  594. * Dump a transaction into the log that contains no real change. This is needed
  595. * to be able to make the log dirty or stamp the current tail LSN into the log
  596. * during the covering operation.
  597. *
  598. * We cannot use an inode here for this - that will push dirty state back up
  599. * into the VFS and then periodic inode flushing will prevent log covering from
  600. * making progress. Hence we log a field in the superblock instead and use a
  601. * synchronous transaction to ensure the superblock is immediately unpinned
  602. * and can be written back.
  603. */
  604. int
  605. xfs_fs_log_dummy(
  606. xfs_mount_t *mp)
  607. {
  608. xfs_trans_t *tp;
  609. int error;
  610. tp = _xfs_trans_alloc(mp, XFS_TRANS_DUMMY1, KM_SLEEP);
  611. error = xfs_trans_reserve(tp, 0, mp->m_sb.sb_sectsize + 128, 0, 0,
  612. XFS_DEFAULT_LOG_COUNT);
  613. if (error) {
  614. xfs_trans_cancel(tp, 0);
  615. return error;
  616. }
  617. /* log the UUID because it is an unchanging field */
  618. xfs_mod_sb(tp, XFS_SB_UUID);
  619. xfs_trans_set_sync(tp);
  620. return xfs_trans_commit(tp, 0);
  621. }
  622. int
  623. xfs_fs_goingdown(
  624. xfs_mount_t *mp,
  625. __uint32_t inflags)
  626. {
  627. switch (inflags) {
  628. case XFS_FSOP_GOING_FLAGS_DEFAULT: {
  629. struct super_block *sb = freeze_bdev(mp->m_super->s_bdev);
  630. if (sb && !IS_ERR(sb)) {
  631. xfs_force_shutdown(mp, SHUTDOWN_FORCE_UMOUNT);
  632. thaw_bdev(sb->s_bdev, sb);
  633. }
  634. break;
  635. }
  636. case XFS_FSOP_GOING_FLAGS_LOGFLUSH:
  637. xfs_force_shutdown(mp, SHUTDOWN_FORCE_UMOUNT);
  638. break;
  639. case XFS_FSOP_GOING_FLAGS_NOLOGFLUSH:
  640. xfs_force_shutdown(mp,
  641. SHUTDOWN_FORCE_UMOUNT | SHUTDOWN_LOG_IO_ERROR);
  642. break;
  643. default:
  644. return XFS_ERROR(EINVAL);
  645. }
  646. return 0;
  647. }