super.c 24 KB

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