xfs_fsops.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654
  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. xfs_filestream_flush(mp);
  166. down_write(&mp->m_peraglock);
  167. mp->m_perag = kmem_realloc(mp->m_perag,
  168. sizeof(xfs_perag_t) * nagcount,
  169. sizeof(xfs_perag_t) * oagcount,
  170. KM_SLEEP);
  171. memset(&mp->m_perag[oagcount], 0,
  172. (nagcount - oagcount) * sizeof(xfs_perag_t));
  173. mp->m_flags |= XFS_MOUNT_32BITINODES;
  174. nagimax = xfs_initialize_perag(mp, nagcount);
  175. up_write(&mp->m_peraglock);
  176. }
  177. tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFS);
  178. tp->t_flags |= XFS_TRANS_RESERVE;
  179. if ((error = xfs_trans_reserve(tp, XFS_GROWFS_SPACE_RES(mp),
  180. XFS_GROWDATA_LOG_RES(mp), 0, 0, 0))) {
  181. xfs_trans_cancel(tp, 0);
  182. return error;
  183. }
  184. nfree = 0;
  185. for (agno = nagcount - 1; agno >= oagcount; agno--, new -= agsize) {
  186. /*
  187. * AG freelist header block
  188. */
  189. bp = xfs_buf_get(mp->m_ddev_targp,
  190. XFS_AG_DADDR(mp, agno, XFS_AGF_DADDR(mp)),
  191. XFS_FSS_TO_BB(mp, 1), 0);
  192. agf = XFS_BUF_TO_AGF(bp);
  193. memset(agf, 0, mp->m_sb.sb_sectsize);
  194. agf->agf_magicnum = cpu_to_be32(XFS_AGF_MAGIC);
  195. agf->agf_versionnum = cpu_to_be32(XFS_AGF_VERSION);
  196. agf->agf_seqno = cpu_to_be32(agno);
  197. if (agno == nagcount - 1)
  198. agsize =
  199. nb -
  200. (agno * (xfs_rfsblock_t)mp->m_sb.sb_agblocks);
  201. else
  202. agsize = mp->m_sb.sb_agblocks;
  203. agf->agf_length = cpu_to_be32(agsize);
  204. agf->agf_roots[XFS_BTNUM_BNOi] = cpu_to_be32(XFS_BNO_BLOCK(mp));
  205. agf->agf_roots[XFS_BTNUM_CNTi] = cpu_to_be32(XFS_CNT_BLOCK(mp));
  206. agf->agf_levels[XFS_BTNUM_BNOi] = cpu_to_be32(1);
  207. agf->agf_levels[XFS_BTNUM_CNTi] = cpu_to_be32(1);
  208. agf->agf_flfirst = 0;
  209. agf->agf_fllast = cpu_to_be32(XFS_AGFL_SIZE(mp) - 1);
  210. agf->agf_flcount = 0;
  211. tmpsize = agsize - XFS_PREALLOC_BLOCKS(mp);
  212. agf->agf_freeblks = cpu_to_be32(tmpsize);
  213. agf->agf_longest = cpu_to_be32(tmpsize);
  214. error = xfs_bwrite(mp, bp);
  215. if (error) {
  216. goto error0;
  217. }
  218. /*
  219. * AG inode header block
  220. */
  221. bp = xfs_buf_get(mp->m_ddev_targp,
  222. XFS_AG_DADDR(mp, agno, XFS_AGI_DADDR(mp)),
  223. XFS_FSS_TO_BB(mp, 1), 0);
  224. agi = XFS_BUF_TO_AGI(bp);
  225. memset(agi, 0, mp->m_sb.sb_sectsize);
  226. agi->agi_magicnum = cpu_to_be32(XFS_AGI_MAGIC);
  227. agi->agi_versionnum = cpu_to_be32(XFS_AGI_VERSION);
  228. agi->agi_seqno = cpu_to_be32(agno);
  229. agi->agi_length = cpu_to_be32(agsize);
  230. agi->agi_count = 0;
  231. agi->agi_root = cpu_to_be32(XFS_IBT_BLOCK(mp));
  232. agi->agi_level = cpu_to_be32(1);
  233. agi->agi_freecount = 0;
  234. agi->agi_newino = cpu_to_be32(NULLAGINO);
  235. agi->agi_dirino = cpu_to_be32(NULLAGINO);
  236. for (bucket = 0; bucket < XFS_AGI_UNLINKED_BUCKETS; bucket++)
  237. agi->agi_unlinked[bucket] = cpu_to_be32(NULLAGINO);
  238. error = xfs_bwrite(mp, bp);
  239. if (error) {
  240. goto error0;
  241. }
  242. /*
  243. * BNO btree root block
  244. */
  245. bp = xfs_buf_get(mp->m_ddev_targp,
  246. XFS_AGB_TO_DADDR(mp, agno, XFS_BNO_BLOCK(mp)),
  247. BTOBB(mp->m_sb.sb_blocksize), 0);
  248. block = XFS_BUF_TO_BLOCK(bp);
  249. memset(block, 0, mp->m_sb.sb_blocksize);
  250. block->bb_magic = cpu_to_be32(XFS_ABTB_MAGIC);
  251. block->bb_level = 0;
  252. block->bb_numrecs = cpu_to_be16(1);
  253. block->bb_u.s.bb_leftsib = cpu_to_be32(NULLAGBLOCK);
  254. block->bb_u.s.bb_rightsib = cpu_to_be32(NULLAGBLOCK);
  255. arec = XFS_ALLOC_REC_ADDR(mp, block, 1);
  256. arec->ar_startblock = cpu_to_be32(XFS_PREALLOC_BLOCKS(mp));
  257. arec->ar_blockcount = cpu_to_be32(
  258. agsize - be32_to_cpu(arec->ar_startblock));
  259. error = xfs_bwrite(mp, bp);
  260. if (error) {
  261. goto error0;
  262. }
  263. /*
  264. * CNT btree root block
  265. */
  266. bp = xfs_buf_get(mp->m_ddev_targp,
  267. XFS_AGB_TO_DADDR(mp, agno, XFS_CNT_BLOCK(mp)),
  268. BTOBB(mp->m_sb.sb_blocksize), 0);
  269. block = XFS_BUF_TO_BLOCK(bp);
  270. memset(block, 0, mp->m_sb.sb_blocksize);
  271. block->bb_magic = cpu_to_be32(XFS_ABTC_MAGIC);
  272. block->bb_level = 0;
  273. block->bb_numrecs = cpu_to_be16(1);
  274. block->bb_u.s.bb_leftsib = cpu_to_be32(NULLAGBLOCK);
  275. block->bb_u.s.bb_rightsib = cpu_to_be32(NULLAGBLOCK);
  276. arec = XFS_ALLOC_REC_ADDR(mp, block, 1);
  277. arec->ar_startblock = cpu_to_be32(XFS_PREALLOC_BLOCKS(mp));
  278. arec->ar_blockcount = cpu_to_be32(
  279. agsize - be32_to_cpu(arec->ar_startblock));
  280. nfree += be32_to_cpu(arec->ar_blockcount);
  281. error = xfs_bwrite(mp, bp);
  282. if (error) {
  283. goto error0;
  284. }
  285. /*
  286. * INO btree root block
  287. */
  288. bp = xfs_buf_get(mp->m_ddev_targp,
  289. XFS_AGB_TO_DADDR(mp, agno, XFS_IBT_BLOCK(mp)),
  290. BTOBB(mp->m_sb.sb_blocksize), 0);
  291. block = XFS_BUF_TO_BLOCK(bp);
  292. memset(block, 0, mp->m_sb.sb_blocksize);
  293. block->bb_magic = cpu_to_be32(XFS_IBT_MAGIC);
  294. block->bb_level = 0;
  295. block->bb_numrecs = 0;
  296. block->bb_u.s.bb_leftsib = cpu_to_be32(NULLAGBLOCK);
  297. block->bb_u.s.bb_rightsib = cpu_to_be32(NULLAGBLOCK);
  298. error = xfs_bwrite(mp, bp);
  299. if (error) {
  300. goto error0;
  301. }
  302. }
  303. xfs_trans_agblocks_delta(tp, nfree);
  304. /*
  305. * There are new blocks in the old last a.g.
  306. */
  307. if (new) {
  308. /*
  309. * Change the agi length.
  310. */
  311. error = xfs_ialloc_read_agi(mp, tp, agno, &bp);
  312. if (error) {
  313. goto error0;
  314. }
  315. ASSERT(bp);
  316. agi = XFS_BUF_TO_AGI(bp);
  317. be32_add_cpu(&agi->agi_length, new);
  318. ASSERT(nagcount == oagcount ||
  319. be32_to_cpu(agi->agi_length) == mp->m_sb.sb_agblocks);
  320. xfs_ialloc_log_agi(tp, bp, XFS_AGI_LENGTH);
  321. /*
  322. * Change agf length.
  323. */
  324. error = xfs_alloc_read_agf(mp, tp, agno, 0, &bp);
  325. if (error) {
  326. goto error0;
  327. }
  328. ASSERT(bp);
  329. agf = XFS_BUF_TO_AGF(bp);
  330. be32_add_cpu(&agf->agf_length, new);
  331. ASSERT(be32_to_cpu(agf->agf_length) ==
  332. be32_to_cpu(agi->agi_length));
  333. xfs_alloc_log_agf(tp, bp, XFS_AGF_LENGTH);
  334. /*
  335. * Free the new space.
  336. */
  337. error = xfs_free_extent(tp, XFS_AGB_TO_FSB(mp, agno,
  338. be32_to_cpu(agf->agf_length) - new), new);
  339. if (error) {
  340. goto error0;
  341. }
  342. }
  343. if (nagcount > oagcount)
  344. xfs_trans_mod_sb(tp, XFS_TRANS_SB_AGCOUNT, nagcount - oagcount);
  345. if (nb > mp->m_sb.sb_dblocks)
  346. xfs_trans_mod_sb(tp, XFS_TRANS_SB_DBLOCKS,
  347. nb - mp->m_sb.sb_dblocks);
  348. if (nfree)
  349. xfs_trans_mod_sb(tp, XFS_TRANS_SB_FDBLOCKS, nfree);
  350. if (dpct)
  351. xfs_trans_mod_sb(tp, XFS_TRANS_SB_IMAXPCT, dpct);
  352. error = xfs_trans_commit(tp, 0);
  353. if (error) {
  354. return error;
  355. }
  356. /* New allocation groups fully initialized, so update mount struct */
  357. if (nagimax)
  358. mp->m_maxagi = nagimax;
  359. if (mp->m_sb.sb_imax_pct) {
  360. __uint64_t icount = mp->m_sb.sb_dblocks * mp->m_sb.sb_imax_pct;
  361. do_div(icount, 100);
  362. mp->m_maxicount = icount << mp->m_sb.sb_inopblog;
  363. } else
  364. mp->m_maxicount = 0;
  365. for (agno = 1; agno < nagcount; agno++) {
  366. error = xfs_read_buf(mp, mp->m_ddev_targp,
  367. XFS_AGB_TO_DADDR(mp, agno, XFS_SB_BLOCK(mp)),
  368. XFS_FSS_TO_BB(mp, 1), 0, &bp);
  369. if (error) {
  370. xfs_fs_cmn_err(CE_WARN, mp,
  371. "error %d reading secondary superblock for ag %d",
  372. error, agno);
  373. break;
  374. }
  375. xfs_sb_to_disk(XFS_BUF_TO_SBP(bp), &mp->m_sb, XFS_SB_ALL_BITS);
  376. /*
  377. * If we get an error writing out the alternate superblocks,
  378. * just issue a warning and continue. The real work is
  379. * already done and committed.
  380. */
  381. if (!(error = xfs_bwrite(mp, bp))) {
  382. continue;
  383. } else {
  384. xfs_fs_cmn_err(CE_WARN, mp,
  385. "write error %d updating secondary superblock for ag %d",
  386. error, agno);
  387. break; /* no point in continuing */
  388. }
  389. }
  390. return 0;
  391. error0:
  392. xfs_trans_cancel(tp, XFS_TRANS_ABORT);
  393. return error;
  394. }
  395. static int
  396. xfs_growfs_log_private(
  397. xfs_mount_t *mp, /* mount point for filesystem */
  398. xfs_growfs_log_t *in) /* growfs log input struct */
  399. {
  400. xfs_extlen_t nb;
  401. nb = in->newblocks;
  402. if (nb < XFS_MIN_LOG_BLOCKS || nb < XFS_B_TO_FSB(mp, XFS_MIN_LOG_BYTES))
  403. return XFS_ERROR(EINVAL);
  404. if (nb == mp->m_sb.sb_logblocks &&
  405. in->isint == (mp->m_sb.sb_logstart != 0))
  406. return XFS_ERROR(EINVAL);
  407. /*
  408. * Moving the log is hard, need new interfaces to sync
  409. * the log first, hold off all activity while moving it.
  410. * Can have shorter or longer log in the same space,
  411. * or transform internal to external log or vice versa.
  412. */
  413. return XFS_ERROR(ENOSYS);
  414. }
  415. /*
  416. * protected versions of growfs function acquire and release locks on the mount
  417. * point - exported through ioctls: XFS_IOC_FSGROWFSDATA, XFS_IOC_FSGROWFSLOG,
  418. * XFS_IOC_FSGROWFSRT
  419. */
  420. int
  421. xfs_growfs_data(
  422. xfs_mount_t *mp,
  423. xfs_growfs_data_t *in)
  424. {
  425. int error;
  426. if (!capable(CAP_SYS_ADMIN))
  427. return XFS_ERROR(EPERM);
  428. if (!mutex_trylock(&mp->m_growlock))
  429. return XFS_ERROR(EWOULDBLOCK);
  430. error = xfs_growfs_data_private(mp, in);
  431. mutex_unlock(&mp->m_growlock);
  432. return error;
  433. }
  434. int
  435. xfs_growfs_log(
  436. xfs_mount_t *mp,
  437. xfs_growfs_log_t *in)
  438. {
  439. int error;
  440. if (!capable(CAP_SYS_ADMIN))
  441. return XFS_ERROR(EPERM);
  442. if (!mutex_trylock(&mp->m_growlock))
  443. return XFS_ERROR(EWOULDBLOCK);
  444. error = xfs_growfs_log_private(mp, in);
  445. mutex_unlock(&mp->m_growlock);
  446. return error;
  447. }
  448. /*
  449. * exported through ioctl XFS_IOC_FSCOUNTS
  450. */
  451. int
  452. xfs_fs_counts(
  453. xfs_mount_t *mp,
  454. xfs_fsop_counts_t *cnt)
  455. {
  456. xfs_icsb_sync_counters(mp, XFS_ICSB_LAZY_COUNT);
  457. spin_lock(&mp->m_sb_lock);
  458. cnt->freedata = mp->m_sb.sb_fdblocks - XFS_ALLOC_SET_ASIDE(mp);
  459. cnt->freertx = mp->m_sb.sb_frextents;
  460. cnt->freeino = mp->m_sb.sb_ifree;
  461. cnt->allocino = mp->m_sb.sb_icount;
  462. spin_unlock(&mp->m_sb_lock);
  463. return 0;
  464. }
  465. /*
  466. * exported through ioctl XFS_IOC_SET_RESBLKS & XFS_IOC_GET_RESBLKS
  467. *
  468. * xfs_reserve_blocks is called to set m_resblks
  469. * in the in-core mount table. The number of unused reserved blocks
  470. * is kept in m_resblks_avail.
  471. *
  472. * Reserve the requested number of blocks if available. Otherwise return
  473. * as many as possible to satisfy the request. The actual number
  474. * reserved are returned in outval
  475. *
  476. * A null inval pointer indicates that only the current reserved blocks
  477. * available should be returned no settings are changed.
  478. */
  479. int
  480. xfs_reserve_blocks(
  481. xfs_mount_t *mp,
  482. __uint64_t *inval,
  483. xfs_fsop_resblks_t *outval)
  484. {
  485. __int64_t lcounter, delta, fdblks_delta;
  486. __uint64_t request;
  487. /* If inval is null, report current values and return */
  488. if (inval == (__uint64_t *)NULL) {
  489. if (!outval)
  490. return EINVAL;
  491. outval->resblks = mp->m_resblks;
  492. outval->resblks_avail = mp->m_resblks_avail;
  493. return 0;
  494. }
  495. request = *inval;
  496. /*
  497. * With per-cpu counters, this becomes an interesting
  498. * problem. we needto work out if we are freeing or allocation
  499. * blocks first, then we can do the modification as necessary.
  500. *
  501. * We do this under the m_sb_lock so that if we are near
  502. * ENOSPC, we will hold out any changes while we work out
  503. * what to do. This means that the amount of free space can
  504. * change while we do this, so we need to retry if we end up
  505. * trying to reserve more space than is available.
  506. *
  507. * We also use the xfs_mod_incore_sb() interface so that we
  508. * don't have to care about whether per cpu counter are
  509. * enabled, disabled or even compiled in....
  510. */
  511. retry:
  512. spin_lock(&mp->m_sb_lock);
  513. xfs_icsb_sync_counters_locked(mp, 0);
  514. /*
  515. * If our previous reservation was larger than the current value,
  516. * then move any unused blocks back to the free pool.
  517. */
  518. fdblks_delta = 0;
  519. if (mp->m_resblks > request) {
  520. lcounter = mp->m_resblks_avail - request;
  521. if (lcounter > 0) { /* release unused blocks */
  522. fdblks_delta = lcounter;
  523. mp->m_resblks_avail -= lcounter;
  524. }
  525. mp->m_resblks = request;
  526. } else {
  527. __int64_t free;
  528. free = mp->m_sb.sb_fdblocks - XFS_ALLOC_SET_ASIDE(mp);
  529. if (!free)
  530. goto out; /* ENOSPC and fdblks_delta = 0 */
  531. delta = request - mp->m_resblks;
  532. lcounter = free - delta;
  533. if (lcounter < 0) {
  534. /* We can't satisfy the request, just get what we can */
  535. mp->m_resblks += free;
  536. mp->m_resblks_avail += free;
  537. fdblks_delta = -free;
  538. } else {
  539. fdblks_delta = -delta;
  540. mp->m_resblks = request;
  541. mp->m_resblks_avail += delta;
  542. }
  543. }
  544. out:
  545. if (outval) {
  546. outval->resblks = mp->m_resblks;
  547. outval->resblks_avail = mp->m_resblks_avail;
  548. }
  549. spin_unlock(&mp->m_sb_lock);
  550. if (fdblks_delta) {
  551. /*
  552. * If we are putting blocks back here, m_resblks_avail is
  553. * already at its max so this will put it in the free pool.
  554. *
  555. * If we need space, we'll either succeed in getting it
  556. * from the free block count or we'll get an enospc. If
  557. * we get a ENOSPC, it means things changed while we were
  558. * calculating fdblks_delta and so we should try again to
  559. * see if there is anything left to reserve.
  560. *
  561. * Don't set the reserved flag here - we don't want to reserve
  562. * the extra reserve blocks from the reserve.....
  563. */
  564. int error;
  565. error = xfs_mod_incore_sb(mp, XFS_SBS_FDBLOCKS, fdblks_delta, 0);
  566. if (error == ENOSPC)
  567. goto retry;
  568. }
  569. return 0;
  570. }
  571. int
  572. xfs_fs_log_dummy(
  573. xfs_mount_t *mp)
  574. {
  575. xfs_trans_t *tp;
  576. xfs_inode_t *ip;
  577. int error;
  578. tp = _xfs_trans_alloc(mp, XFS_TRANS_DUMMY1);
  579. error = xfs_trans_reserve(tp, 0, XFS_ICHANGE_LOG_RES(mp), 0, 0, 0);
  580. if (error) {
  581. xfs_trans_cancel(tp, 0);
  582. return error;
  583. }
  584. ip = mp->m_rootip;
  585. xfs_ilock(ip, XFS_ILOCK_EXCL);
  586. xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL);
  587. xfs_trans_ihold(tp, ip);
  588. xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
  589. xfs_trans_set_sync(tp);
  590. error = xfs_trans_commit(tp, 0);
  591. xfs_iunlock(ip, XFS_ILOCK_EXCL);
  592. return error;
  593. }
  594. int
  595. xfs_fs_goingdown(
  596. xfs_mount_t *mp,
  597. __uint32_t inflags)
  598. {
  599. switch (inflags) {
  600. case XFS_FSOP_GOING_FLAGS_DEFAULT: {
  601. struct super_block *sb = freeze_bdev(mp->m_super->s_bdev);
  602. if (sb && !IS_ERR(sb)) {
  603. xfs_force_shutdown(mp, SHUTDOWN_FORCE_UMOUNT);
  604. thaw_bdev(sb->s_bdev, sb);
  605. }
  606. break;
  607. }
  608. case XFS_FSOP_GOING_FLAGS_LOGFLUSH:
  609. xfs_force_shutdown(mp, SHUTDOWN_FORCE_UMOUNT);
  610. break;
  611. case XFS_FSOP_GOING_FLAGS_NOLOGFLUSH:
  612. xfs_force_shutdown(mp,
  613. SHUTDOWN_FORCE_UMOUNT | SHUTDOWN_LOG_IO_ERROR);
  614. break;
  615. default:
  616. return XFS_ERROR(EINVAL);
  617. }
  618. return 0;
  619. }