super.c 23 KB

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