xfs_fsops.c 18 KB

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