super.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928
  1. /*
  2. * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
  3. * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
  4. *
  5. * This copyrighted material is made available to anyone wishing to use,
  6. * modify, copy, or redistribute it subject to the terms and conditions
  7. * of the GNU General Public License v.2.
  8. */
  9. #include <linux/sched.h>
  10. #include <linux/slab.h>
  11. #include <linux/spinlock.h>
  12. #include <linux/completion.h>
  13. #include <linux/buffer_head.h>
  14. #include <linux/crc32.h>
  15. #include <linux/gfs2_ondisk.h>
  16. #include "gfs2.h"
  17. #include "lm_interface.h"
  18. #include "incore.h"
  19. #include "bmap.h"
  20. #include "dir.h"
  21. #include "format.h"
  22. #include "glock.h"
  23. #include "glops.h"
  24. #include "inode.h"
  25. #include "log.h"
  26. #include "meta_io.h"
  27. #include "quota.h"
  28. #include "recovery.h"
  29. #include "rgrp.h"
  30. #include "super.h"
  31. #include "trans.h"
  32. #include "util.h"
  33. /**
  34. * gfs2_tune_init - Fill a gfs2_tune structure with default values
  35. * @gt: tune
  36. *
  37. */
  38. void gfs2_tune_init(struct gfs2_tune *gt)
  39. {
  40. spin_lock_init(&gt->gt_spin);
  41. gt->gt_ilimit = 100;
  42. gt->gt_ilimit_tries = 3;
  43. gt->gt_ilimit_min = 1;
  44. gt->gt_demote_secs = 300;
  45. gt->gt_incore_log_blocks = 1024;
  46. gt->gt_log_flush_secs = 60;
  47. gt->gt_jindex_refresh_secs = 60;
  48. gt->gt_scand_secs = 15;
  49. gt->gt_recoverd_secs = 60;
  50. gt->gt_logd_secs = 1;
  51. gt->gt_quotad_secs = 5;
  52. gt->gt_quota_simul_sync = 64;
  53. gt->gt_quota_warn_period = 10;
  54. gt->gt_quota_scale_num = 1;
  55. gt->gt_quota_scale_den = 1;
  56. gt->gt_quota_cache_secs = 300;
  57. gt->gt_quota_quantum = 60;
  58. gt->gt_atime_quantum = 3600;
  59. gt->gt_new_files_jdata = 0;
  60. gt->gt_new_files_directio = 0;
  61. gt->gt_max_atomic_write = 4 << 20;
  62. gt->gt_max_readahead = 1 << 18;
  63. gt->gt_lockdump_size = 131072;
  64. gt->gt_stall_secs = 600;
  65. gt->gt_complain_secs = 10;
  66. gt->gt_reclaim_limit = 5000;
  67. gt->gt_entries_per_readdir = 32;
  68. gt->gt_prefetch_secs = 10;
  69. gt->gt_greedy_default = HZ / 10;
  70. gt->gt_greedy_quantum = HZ / 40;
  71. gt->gt_greedy_max = HZ / 4;
  72. gt->gt_statfs_quantum = 30;
  73. gt->gt_statfs_slow = 0;
  74. }
  75. /**
  76. * gfs2_check_sb - Check superblock
  77. * @sdp: the filesystem
  78. * @sb: The superblock
  79. * @silent: Don't print a message if the check fails
  80. *
  81. * Checks the version code of the FS is one that we understand how to
  82. * read and that the sizes of the various on-disk structures have not
  83. * changed.
  84. */
  85. int gfs2_check_sb(struct gfs2_sbd *sdp, struct gfs2_sb *sb, int silent)
  86. {
  87. unsigned int x;
  88. if (sb->sb_header.mh_magic != GFS2_MAGIC ||
  89. sb->sb_header.mh_type != GFS2_METATYPE_SB) {
  90. if (!silent)
  91. printk(KERN_WARNING "GFS2: not a GFS2 filesystem\n");
  92. return -EINVAL;
  93. }
  94. /* If format numbers match exactly, we're done. */
  95. if (sb->sb_fs_format == GFS2_FORMAT_FS &&
  96. sb->sb_multihost_format == GFS2_FORMAT_MULTI)
  97. return 0;
  98. if (sb->sb_fs_format != GFS2_FORMAT_FS) {
  99. for (x = 0; gfs2_old_fs_formats[x]; x++)
  100. if (gfs2_old_fs_formats[x] == sb->sb_fs_format)
  101. break;
  102. if (!gfs2_old_fs_formats[x]) {
  103. printk(KERN_WARNING
  104. "GFS2: code version (%u, %u) is incompatible "
  105. "with ondisk format (%u, %u)\n",
  106. GFS2_FORMAT_FS, GFS2_FORMAT_MULTI,
  107. sb->sb_fs_format, sb->sb_multihost_format);
  108. printk(KERN_WARNING
  109. "GFS2: I don't know how to upgrade this FS\n");
  110. return -EINVAL;
  111. }
  112. }
  113. if (sb->sb_multihost_format != GFS2_FORMAT_MULTI) {
  114. for (x = 0; gfs2_old_multihost_formats[x]; x++)
  115. if (gfs2_old_multihost_formats[x] ==
  116. sb->sb_multihost_format)
  117. break;
  118. if (!gfs2_old_multihost_formats[x]) {
  119. printk(KERN_WARNING
  120. "GFS2: code version (%u, %u) is incompatible "
  121. "with ondisk format (%u, %u)\n",
  122. GFS2_FORMAT_FS, GFS2_FORMAT_MULTI,
  123. sb->sb_fs_format, sb->sb_multihost_format);
  124. printk(KERN_WARNING
  125. "GFS2: I don't know how to upgrade this FS\n");
  126. return -EINVAL;
  127. }
  128. }
  129. if (!sdp->sd_args.ar_upgrade) {
  130. printk(KERN_WARNING
  131. "GFS2: code version (%u, %u) is incompatible "
  132. "with ondisk format (%u, %u)\n",
  133. GFS2_FORMAT_FS, GFS2_FORMAT_MULTI,
  134. sb->sb_fs_format, sb->sb_multihost_format);
  135. printk(KERN_INFO
  136. "GFS2: Use the \"upgrade\" mount option to upgrade "
  137. "the FS\n");
  138. printk(KERN_INFO "GFS2: See the manual for more details\n");
  139. return -EINVAL;
  140. }
  141. return 0;
  142. }
  143. /**
  144. * gfs2_read_sb - Read super block
  145. * @sdp: The GFS2 superblock
  146. * @gl: the glock for the superblock (assumed to be held)
  147. * @silent: Don't print message if mount fails
  148. *
  149. */
  150. int gfs2_read_sb(struct gfs2_sbd *sdp, struct gfs2_glock *gl, int silent)
  151. {
  152. struct buffer_head *bh;
  153. uint32_t hash_blocks, ind_blocks, leaf_blocks;
  154. uint32_t tmp_blocks;
  155. unsigned int x;
  156. int error;
  157. error = gfs2_meta_read(gl, GFS2_SB_ADDR >> sdp->sd_fsb2bb_shift,
  158. DIO_FORCE | DIO_START | DIO_WAIT, &bh);
  159. if (error) {
  160. if (!silent)
  161. fs_err(sdp, "can't read superblock\n");
  162. return error;
  163. }
  164. gfs2_assert(sdp, sizeof(struct gfs2_sb) <= bh->b_size);
  165. gfs2_sb_in(&sdp->sd_sb, bh->b_data);
  166. brelse(bh);
  167. error = gfs2_check_sb(sdp, &sdp->sd_sb, silent);
  168. if (error)
  169. return error;
  170. sdp->sd_fsb2bb_shift = sdp->sd_sb.sb_bsize_shift -
  171. GFS2_BASIC_BLOCK_SHIFT;
  172. sdp->sd_fsb2bb = 1 << sdp->sd_fsb2bb_shift;
  173. sdp->sd_diptrs = (sdp->sd_sb.sb_bsize -
  174. sizeof(struct gfs2_dinode)) / sizeof(uint64_t);
  175. sdp->sd_inptrs = (sdp->sd_sb.sb_bsize -
  176. sizeof(struct gfs2_meta_header)) / sizeof(uint64_t);
  177. sdp->sd_jbsize = sdp->sd_sb.sb_bsize - sizeof(struct gfs2_meta_header);
  178. sdp->sd_hash_bsize = sdp->sd_sb.sb_bsize / 2;
  179. sdp->sd_hash_bsize_shift = sdp->sd_sb.sb_bsize_shift - 1;
  180. sdp->sd_hash_ptrs = sdp->sd_hash_bsize / sizeof(uint64_t);
  181. sdp->sd_qc_per_block = (sdp->sd_sb.sb_bsize -
  182. sizeof(struct gfs2_meta_header)) /
  183. sizeof(struct gfs2_quota_change);
  184. /* Compute maximum reservation required to add a entry to a directory */
  185. hash_blocks = DIV_ROUND_UP(sizeof(uint64_t) * (1 << GFS2_DIR_MAX_DEPTH),
  186. sdp->sd_jbsize);
  187. ind_blocks = 0;
  188. for (tmp_blocks = hash_blocks; tmp_blocks > sdp->sd_diptrs;) {
  189. tmp_blocks = DIV_ROUND_UP(tmp_blocks, sdp->sd_inptrs);
  190. ind_blocks += tmp_blocks;
  191. }
  192. leaf_blocks = 2 + GFS2_DIR_MAX_DEPTH;
  193. sdp->sd_max_dirres = hash_blocks + ind_blocks + leaf_blocks;
  194. sdp->sd_heightsize[0] = sdp->sd_sb.sb_bsize -
  195. sizeof(struct gfs2_dinode);
  196. sdp->sd_heightsize[1] = sdp->sd_sb.sb_bsize * sdp->sd_diptrs;
  197. for (x = 2;; x++) {
  198. uint64_t space, d;
  199. uint32_t m;
  200. space = sdp->sd_heightsize[x - 1] * sdp->sd_inptrs;
  201. d = space;
  202. m = do_div(d, sdp->sd_inptrs);
  203. if (d != sdp->sd_heightsize[x - 1] || m)
  204. break;
  205. sdp->sd_heightsize[x] = space;
  206. }
  207. sdp->sd_max_height = x;
  208. gfs2_assert(sdp, sdp->sd_max_height <= GFS2_MAX_META_HEIGHT);
  209. sdp->sd_jheightsize[0] = sdp->sd_sb.sb_bsize -
  210. sizeof(struct gfs2_dinode);
  211. sdp->sd_jheightsize[1] = sdp->sd_jbsize * sdp->sd_diptrs;
  212. for (x = 2;; x++) {
  213. uint64_t space, d;
  214. uint32_t m;
  215. space = sdp->sd_jheightsize[x - 1] * sdp->sd_inptrs;
  216. d = space;
  217. m = do_div(d, sdp->sd_inptrs);
  218. if (d != sdp->sd_jheightsize[x - 1] || m)
  219. break;
  220. sdp->sd_jheightsize[x] = space;
  221. }
  222. sdp->sd_max_jheight = x;
  223. gfs2_assert(sdp, sdp->sd_max_jheight <= GFS2_MAX_META_HEIGHT);
  224. return 0;
  225. }
  226. /**
  227. * gfs2_jindex_hold - Grab a lock on the jindex
  228. * @sdp: The GFS2 superblock
  229. * @ji_gh: the holder for the jindex glock
  230. *
  231. * This is very similar to the gfs2_rindex_hold() function, except that
  232. * in general we hold the jindex lock for longer periods of time and
  233. * we grab it far less frequently (in general) then the rgrp lock.
  234. *
  235. * Returns: errno
  236. */
  237. int gfs2_jindex_hold(struct gfs2_sbd *sdp, struct gfs2_holder *ji_gh)
  238. {
  239. struct gfs2_inode *dip = GFS2_I(sdp->sd_jindex);
  240. struct qstr name;
  241. char buf[20];
  242. struct gfs2_jdesc *jd;
  243. int error;
  244. name.name = buf;
  245. mutex_lock(&sdp->sd_jindex_mutex);
  246. for (;;) {
  247. error = gfs2_glock_nq_init(dip->i_gl, LM_ST_SHARED,
  248. GL_LOCAL_EXCL, ji_gh);
  249. if (error)
  250. break;
  251. name.len = sprintf(buf, "journal%u", sdp->sd_journals);
  252. name.hash = gfs2_disk_hash(name.name, name.len);
  253. error = gfs2_dir_search(sdp->sd_jindex, &name, NULL, NULL);
  254. if (error == -ENOENT) {
  255. error = 0;
  256. break;
  257. }
  258. gfs2_glock_dq_uninit(ji_gh);
  259. if (error)
  260. break;
  261. error = -ENOMEM;
  262. jd = kzalloc(sizeof(struct gfs2_jdesc), GFP_KERNEL);
  263. if (!jd)
  264. break;
  265. jd->jd_inode = gfs2_lookupi(sdp->sd_jindex, &name, 1, NULL);
  266. if (!jd->jd_inode || IS_ERR(jd->jd_inode)) {
  267. if (!jd->jd_inode)
  268. error = -ENOENT;
  269. else
  270. error = PTR_ERR(jd->jd_inode);
  271. kfree(jd);
  272. break;
  273. }
  274. spin_lock(&sdp->sd_jindex_spin);
  275. jd->jd_jid = sdp->sd_journals++;
  276. list_add_tail(&jd->jd_list, &sdp->sd_jindex_list);
  277. spin_unlock(&sdp->sd_jindex_spin);
  278. }
  279. mutex_unlock(&sdp->sd_jindex_mutex);
  280. return error;
  281. }
  282. /**
  283. * gfs2_jindex_free - Clear all the journal index information
  284. * @sdp: The GFS2 superblock
  285. *
  286. */
  287. void gfs2_jindex_free(struct gfs2_sbd *sdp)
  288. {
  289. struct list_head list;
  290. struct gfs2_jdesc *jd;
  291. spin_lock(&sdp->sd_jindex_spin);
  292. list_add(&list, &sdp->sd_jindex_list);
  293. list_del_init(&sdp->sd_jindex_list);
  294. sdp->sd_journals = 0;
  295. spin_unlock(&sdp->sd_jindex_spin);
  296. while (!list_empty(&list)) {
  297. jd = list_entry(list.next, struct gfs2_jdesc, jd_list);
  298. list_del(&jd->jd_list);
  299. iput(jd->jd_inode);
  300. kfree(jd);
  301. }
  302. }
  303. static struct gfs2_jdesc *jdesc_find_i(struct list_head *head, unsigned int jid)
  304. {
  305. struct gfs2_jdesc *jd;
  306. int found = 0;
  307. list_for_each_entry(jd, head, jd_list) {
  308. if (jd->jd_jid == jid) {
  309. found = 1;
  310. break;
  311. }
  312. }
  313. if (!found)
  314. jd = NULL;
  315. return jd;
  316. }
  317. struct gfs2_jdesc *gfs2_jdesc_find(struct gfs2_sbd *sdp, unsigned int jid)
  318. {
  319. struct gfs2_jdesc *jd;
  320. spin_lock(&sdp->sd_jindex_spin);
  321. jd = jdesc_find_i(&sdp->sd_jindex_list, jid);
  322. spin_unlock(&sdp->sd_jindex_spin);
  323. return jd;
  324. }
  325. void gfs2_jdesc_make_dirty(struct gfs2_sbd *sdp, unsigned int jid)
  326. {
  327. struct gfs2_jdesc *jd;
  328. spin_lock(&sdp->sd_jindex_spin);
  329. jd = jdesc_find_i(&sdp->sd_jindex_list, jid);
  330. if (jd)
  331. jd->jd_dirty = 1;
  332. spin_unlock(&sdp->sd_jindex_spin);
  333. }
  334. struct gfs2_jdesc *gfs2_jdesc_find_dirty(struct gfs2_sbd *sdp)
  335. {
  336. struct gfs2_jdesc *jd;
  337. int found = 0;
  338. spin_lock(&sdp->sd_jindex_spin);
  339. list_for_each_entry(jd, &sdp->sd_jindex_list, jd_list) {
  340. if (jd->jd_dirty) {
  341. jd->jd_dirty = 0;
  342. found = 1;
  343. break;
  344. }
  345. }
  346. spin_unlock(&sdp->sd_jindex_spin);
  347. if (!found)
  348. jd = NULL;
  349. return jd;
  350. }
  351. int gfs2_jdesc_check(struct gfs2_jdesc *jd)
  352. {
  353. struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
  354. struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode);
  355. int ar;
  356. int error;
  357. if (ip->i_di.di_size < (8 << 20) || ip->i_di.di_size > (1 << 30) ||
  358. (ip->i_di.di_size & (sdp->sd_sb.sb_bsize - 1))) {
  359. gfs2_consist_inode(ip);
  360. return -EIO;
  361. }
  362. jd->jd_blocks = ip->i_di.di_size >> sdp->sd_sb.sb_bsize_shift;
  363. error = gfs2_write_alloc_required(ip, 0, ip->i_di.di_size, &ar);
  364. if (!error && ar) {
  365. gfs2_consist_inode(ip);
  366. error = -EIO;
  367. }
  368. return error;
  369. }
  370. /**
  371. * gfs2_make_fs_rw - Turn a Read-Only FS into a Read-Write one
  372. * @sdp: the filesystem
  373. *
  374. * Returns: errno
  375. */
  376. int gfs2_make_fs_rw(struct gfs2_sbd *sdp)
  377. {
  378. struct gfs2_inode *ip = GFS2_I(sdp->sd_jdesc->jd_inode);
  379. struct gfs2_glock *j_gl = ip->i_gl;
  380. struct gfs2_holder t_gh;
  381. struct gfs2_log_header head;
  382. int error;
  383. error = gfs2_glock_nq_init(sdp->sd_trans_gl, LM_ST_SHARED,
  384. GL_LOCAL_EXCL, &t_gh);
  385. if (error)
  386. return error;
  387. gfs2_meta_cache_flush(ip);
  388. j_gl->gl_ops->go_inval(j_gl, DIO_METADATA | DIO_DATA);
  389. error = gfs2_find_jhead(sdp->sd_jdesc, &head);
  390. if (error)
  391. goto fail;
  392. if (!(head.lh_flags & GFS2_LOG_HEAD_UNMOUNT)) {
  393. gfs2_consist(sdp);
  394. error = -EIO;
  395. goto fail;
  396. }
  397. /* Initialize some head of the log stuff */
  398. sdp->sd_log_sequence = head.lh_sequence + 1;
  399. gfs2_log_pointers_init(sdp, head.lh_blkno);
  400. error = gfs2_quota_init(sdp);
  401. if (error)
  402. goto fail_unlinked;
  403. set_bit(SDF_JOURNAL_LIVE, &sdp->sd_flags);
  404. gfs2_glock_dq_uninit(&t_gh);
  405. return 0;
  406. fail_unlinked:
  407. fail:
  408. t_gh.gh_flags |= GL_NOCACHE;
  409. gfs2_glock_dq_uninit(&t_gh);
  410. return error;
  411. }
  412. /**
  413. * gfs2_make_fs_ro - Turn a Read-Write FS into a Read-Only one
  414. * @sdp: the filesystem
  415. *
  416. * Returns: errno
  417. */
  418. int gfs2_make_fs_ro(struct gfs2_sbd *sdp)
  419. {
  420. struct gfs2_holder t_gh;
  421. int error;
  422. gfs2_quota_sync(sdp);
  423. gfs2_statfs_sync(sdp);
  424. error = gfs2_glock_nq_init(sdp->sd_trans_gl, LM_ST_SHARED,
  425. GL_LOCAL_EXCL | GL_NOCACHE,
  426. &t_gh);
  427. if (error && !test_bit(SDF_SHUTDOWN, &sdp->sd_flags))
  428. return error;
  429. gfs2_meta_syncfs(sdp);
  430. gfs2_log_shutdown(sdp);
  431. clear_bit(SDF_JOURNAL_LIVE, &sdp->sd_flags);
  432. if (t_gh.gh_gl)
  433. gfs2_glock_dq_uninit(&t_gh);
  434. gfs2_quota_cleanup(sdp);
  435. return error;
  436. }
  437. int gfs2_statfs_init(struct gfs2_sbd *sdp)
  438. {
  439. struct gfs2_inode *m_ip = GFS2_I(sdp->sd_statfs_inode);
  440. struct gfs2_statfs_change *m_sc = &sdp->sd_statfs_master;
  441. struct gfs2_inode *l_ip = GFS2_I(sdp->sd_sc_inode);
  442. struct gfs2_statfs_change *l_sc = &sdp->sd_statfs_local;
  443. struct buffer_head *m_bh, *l_bh;
  444. struct gfs2_holder gh;
  445. int error;
  446. error = gfs2_glock_nq_init(m_ip->i_gl, LM_ST_EXCLUSIVE, GL_NOCACHE,
  447. &gh);
  448. if (error)
  449. return error;
  450. error = gfs2_meta_inode_buffer(m_ip, &m_bh);
  451. if (error)
  452. goto out;
  453. if (sdp->sd_args.ar_spectator) {
  454. spin_lock(&sdp->sd_statfs_spin);
  455. gfs2_statfs_change_in(m_sc, m_bh->b_data +
  456. sizeof(struct gfs2_dinode));
  457. spin_unlock(&sdp->sd_statfs_spin);
  458. } else {
  459. error = gfs2_meta_inode_buffer(l_ip, &l_bh);
  460. if (error)
  461. goto out_m_bh;
  462. spin_lock(&sdp->sd_statfs_spin);
  463. gfs2_statfs_change_in(m_sc, m_bh->b_data +
  464. sizeof(struct gfs2_dinode));
  465. gfs2_statfs_change_in(l_sc, l_bh->b_data +
  466. sizeof(struct gfs2_dinode));
  467. spin_unlock(&sdp->sd_statfs_spin);
  468. brelse(l_bh);
  469. }
  470. out_m_bh:
  471. brelse(m_bh);
  472. out:
  473. gfs2_glock_dq_uninit(&gh);
  474. return 0;
  475. }
  476. void gfs2_statfs_change(struct gfs2_sbd *sdp, int64_t total, int64_t free,
  477. int64_t dinodes)
  478. {
  479. struct gfs2_inode *l_ip = GFS2_I(sdp->sd_sc_inode);
  480. struct gfs2_statfs_change *l_sc = &sdp->sd_statfs_local;
  481. struct buffer_head *l_bh;
  482. int error;
  483. error = gfs2_meta_inode_buffer(l_ip, &l_bh);
  484. if (error)
  485. return;
  486. mutex_lock(&sdp->sd_statfs_mutex);
  487. gfs2_trans_add_bh(l_ip->i_gl, l_bh, 1);
  488. mutex_unlock(&sdp->sd_statfs_mutex);
  489. spin_lock(&sdp->sd_statfs_spin);
  490. l_sc->sc_total += total;
  491. l_sc->sc_free += free;
  492. l_sc->sc_dinodes += dinodes;
  493. gfs2_statfs_change_out(l_sc, l_bh->b_data +
  494. sizeof(struct gfs2_dinode));
  495. spin_unlock(&sdp->sd_statfs_spin);
  496. brelse(l_bh);
  497. }
  498. int gfs2_statfs_sync(struct gfs2_sbd *sdp)
  499. {
  500. struct gfs2_inode *m_ip = GFS2_I(sdp->sd_statfs_inode);
  501. struct gfs2_inode *l_ip = GFS2_I(sdp->sd_sc_inode);
  502. struct gfs2_statfs_change *m_sc = &sdp->sd_statfs_master;
  503. struct gfs2_statfs_change *l_sc = &sdp->sd_statfs_local;
  504. struct gfs2_holder gh;
  505. struct buffer_head *m_bh, *l_bh;
  506. int error;
  507. error = gfs2_glock_nq_init(m_ip->i_gl, LM_ST_EXCLUSIVE, GL_NOCACHE,
  508. &gh);
  509. if (error)
  510. return error;
  511. error = gfs2_meta_inode_buffer(m_ip, &m_bh);
  512. if (error)
  513. goto out;
  514. spin_lock(&sdp->sd_statfs_spin);
  515. gfs2_statfs_change_in(m_sc, m_bh->b_data +
  516. sizeof(struct gfs2_dinode));
  517. if (!l_sc->sc_total && !l_sc->sc_free && !l_sc->sc_dinodes) {
  518. spin_unlock(&sdp->sd_statfs_spin);
  519. goto out_bh;
  520. }
  521. spin_unlock(&sdp->sd_statfs_spin);
  522. error = gfs2_meta_inode_buffer(l_ip, &l_bh);
  523. if (error)
  524. goto out_bh;
  525. error = gfs2_trans_begin(sdp, 2 * RES_DINODE, 0);
  526. if (error)
  527. goto out_bh2;
  528. mutex_lock(&sdp->sd_statfs_mutex);
  529. gfs2_trans_add_bh(l_ip->i_gl, l_bh, 1);
  530. mutex_unlock(&sdp->sd_statfs_mutex);
  531. spin_lock(&sdp->sd_statfs_spin);
  532. m_sc->sc_total += l_sc->sc_total;
  533. m_sc->sc_free += l_sc->sc_free;
  534. m_sc->sc_dinodes += l_sc->sc_dinodes;
  535. memset(l_sc, 0, sizeof(struct gfs2_statfs_change));
  536. memset(l_bh->b_data + sizeof(struct gfs2_dinode),
  537. 0, sizeof(struct gfs2_statfs_change));
  538. spin_unlock(&sdp->sd_statfs_spin);
  539. gfs2_trans_add_bh(m_ip->i_gl, m_bh, 1);
  540. gfs2_statfs_change_out(m_sc, m_bh->b_data + sizeof(struct gfs2_dinode));
  541. gfs2_trans_end(sdp);
  542. out_bh2:
  543. brelse(l_bh);
  544. out_bh:
  545. brelse(m_bh);
  546. out:
  547. gfs2_glock_dq_uninit(&gh);
  548. return error;
  549. }
  550. /**
  551. * gfs2_statfs_i - Do a statfs
  552. * @sdp: the filesystem
  553. * @sg: the sg structure
  554. *
  555. * Returns: errno
  556. */
  557. int gfs2_statfs_i(struct gfs2_sbd *sdp, struct gfs2_statfs_change *sc)
  558. {
  559. struct gfs2_statfs_change *m_sc = &sdp->sd_statfs_master;
  560. struct gfs2_statfs_change *l_sc = &sdp->sd_statfs_local;
  561. spin_lock(&sdp->sd_statfs_spin);
  562. *sc = *m_sc;
  563. sc->sc_total += l_sc->sc_total;
  564. sc->sc_free += l_sc->sc_free;
  565. sc->sc_dinodes += l_sc->sc_dinodes;
  566. spin_unlock(&sdp->sd_statfs_spin);
  567. if (sc->sc_free < 0)
  568. sc->sc_free = 0;
  569. if (sc->sc_free > sc->sc_total)
  570. sc->sc_free = sc->sc_total;
  571. if (sc->sc_dinodes < 0)
  572. sc->sc_dinodes = 0;
  573. return 0;
  574. }
  575. /**
  576. * statfs_fill - fill in the sg for a given RG
  577. * @rgd: the RG
  578. * @sc: the sc structure
  579. *
  580. * Returns: 0 on success, -ESTALE if the LVB is invalid
  581. */
  582. static int statfs_slow_fill(struct gfs2_rgrpd *rgd,
  583. struct gfs2_statfs_change *sc)
  584. {
  585. gfs2_rgrp_verify(rgd);
  586. sc->sc_total += rgd->rd_ri.ri_data;
  587. sc->sc_free += rgd->rd_rg.rg_free;
  588. sc->sc_dinodes += rgd->rd_rg.rg_dinodes;
  589. return 0;
  590. }
  591. /**
  592. * gfs2_statfs_slow - Stat a filesystem using asynchronous locking
  593. * @sdp: the filesystem
  594. * @sc: the sc info that will be returned
  595. *
  596. * Any error (other than a signal) will cause this routine to fall back
  597. * to the synchronous version.
  598. *
  599. * FIXME: This really shouldn't busy wait like this.
  600. *
  601. * Returns: errno
  602. */
  603. int gfs2_statfs_slow(struct gfs2_sbd *sdp, struct gfs2_statfs_change *sc)
  604. {
  605. struct gfs2_holder ri_gh;
  606. struct gfs2_rgrpd *rgd_next;
  607. struct gfs2_holder *gha, *gh;
  608. unsigned int slots = 64;
  609. unsigned int x;
  610. int done;
  611. int error = 0, err;
  612. memset(sc, 0, sizeof(struct gfs2_statfs_change));
  613. gha = kcalloc(slots, sizeof(struct gfs2_holder), GFP_KERNEL);
  614. if (!gha)
  615. return -ENOMEM;
  616. error = gfs2_rindex_hold(sdp, &ri_gh);
  617. if (error)
  618. goto out;
  619. rgd_next = gfs2_rgrpd_get_first(sdp);
  620. for (;;) {
  621. done = 1;
  622. for (x = 0; x < slots; x++) {
  623. gh = gha + x;
  624. if (gh->gh_gl && gfs2_glock_poll(gh)) {
  625. err = gfs2_glock_wait(gh);
  626. if (err) {
  627. gfs2_holder_uninit(gh);
  628. error = err;
  629. } else {
  630. if (!error)
  631. error = statfs_slow_fill(
  632. gh->gh_gl->gl_object, sc);
  633. gfs2_glock_dq_uninit(gh);
  634. }
  635. }
  636. if (gh->gh_gl)
  637. done = 0;
  638. else if (rgd_next && !error) {
  639. error = gfs2_glock_nq_init(rgd_next->rd_gl,
  640. LM_ST_SHARED,
  641. GL_ASYNC,
  642. gh);
  643. rgd_next = gfs2_rgrpd_get_next(rgd_next);
  644. done = 0;
  645. }
  646. if (signal_pending(current))
  647. error = -ERESTARTSYS;
  648. }
  649. if (done)
  650. break;
  651. yield();
  652. }
  653. gfs2_glock_dq_uninit(&ri_gh);
  654. out:
  655. kfree(gha);
  656. return error;
  657. }
  658. struct lfcc {
  659. struct list_head list;
  660. struct gfs2_holder gh;
  661. };
  662. /**
  663. * gfs2_lock_fs_check_clean - Stop all writes to the FS and check that all
  664. * journals are clean
  665. * @sdp: the file system
  666. * @state: the state to put the transaction lock into
  667. * @t_gh: the hold on the transaction lock
  668. *
  669. * Returns: errno
  670. */
  671. static int gfs2_lock_fs_check_clean(struct gfs2_sbd *sdp,
  672. struct gfs2_holder *t_gh)
  673. {
  674. struct gfs2_inode *ip;
  675. struct gfs2_holder ji_gh;
  676. struct gfs2_jdesc *jd;
  677. struct lfcc *lfcc;
  678. LIST_HEAD(list);
  679. struct gfs2_log_header lh;
  680. int error;
  681. error = gfs2_jindex_hold(sdp, &ji_gh);
  682. if (error)
  683. return error;
  684. list_for_each_entry(jd, &sdp->sd_jindex_list, jd_list) {
  685. lfcc = kmalloc(sizeof(struct lfcc), GFP_KERNEL);
  686. if (!lfcc) {
  687. error = -ENOMEM;
  688. goto out;
  689. }
  690. ip = GFS2_I(jd->jd_inode);
  691. error = gfs2_glock_nq_init(ip->i_gl, LM_ST_SHARED, 0, &lfcc->gh);
  692. if (error) {
  693. kfree(lfcc);
  694. goto out;
  695. }
  696. list_add(&lfcc->list, &list);
  697. }
  698. error = gfs2_glock_nq_init(sdp->sd_trans_gl, LM_ST_DEFERRED,
  699. LM_FLAG_PRIORITY | GL_NOCACHE,
  700. t_gh);
  701. list_for_each_entry(jd, &sdp->sd_jindex_list, jd_list) {
  702. error = gfs2_jdesc_check(jd);
  703. if (error)
  704. break;
  705. error = gfs2_find_jhead(jd, &lh);
  706. if (error)
  707. break;
  708. if (!(lh.lh_flags & GFS2_LOG_HEAD_UNMOUNT)) {
  709. error = -EBUSY;
  710. break;
  711. }
  712. }
  713. if (error)
  714. gfs2_glock_dq_uninit(t_gh);
  715. out:
  716. while (!list_empty(&list)) {
  717. lfcc = list_entry(list.next, struct lfcc, list);
  718. list_del(&lfcc->list);
  719. gfs2_glock_dq_uninit(&lfcc->gh);
  720. kfree(lfcc);
  721. }
  722. gfs2_glock_dq_uninit(&ji_gh);
  723. return error;
  724. }
  725. /**
  726. * gfs2_freeze_fs - freezes the file system
  727. * @sdp: the file system
  728. *
  729. * This function flushes data and meta data for all machines by
  730. * aquiring the transaction log exclusively. All journals are
  731. * ensured to be in a clean state as well.
  732. *
  733. * Returns: errno
  734. */
  735. int gfs2_freeze_fs(struct gfs2_sbd *sdp)
  736. {
  737. int error = 0;
  738. mutex_lock(&sdp->sd_freeze_lock);
  739. if (!sdp->sd_freeze_count++) {
  740. error = gfs2_lock_fs_check_clean(sdp, &sdp->sd_freeze_gh);
  741. if (error)
  742. sdp->sd_freeze_count--;
  743. }
  744. mutex_unlock(&sdp->sd_freeze_lock);
  745. return error;
  746. }
  747. /**
  748. * gfs2_unfreeze_fs - unfreezes the file system
  749. * @sdp: the file system
  750. *
  751. * This function allows the file system to proceed by unlocking
  752. * the exclusively held transaction lock. Other GFS2 nodes are
  753. * now free to acquire the lock shared and go on with their lives.
  754. *
  755. */
  756. void gfs2_unfreeze_fs(struct gfs2_sbd *sdp)
  757. {
  758. mutex_lock(&sdp->sd_freeze_lock);
  759. if (sdp->sd_freeze_count && !--sdp->sd_freeze_count)
  760. gfs2_glock_dq_uninit(&sdp->sd_freeze_gh);
  761. mutex_unlock(&sdp->sd_freeze_lock);
  762. }