super.c 23 KB

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