super.c 21 KB

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