super.c 21 KB

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