super.c 22 KB

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