the_nilfs.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640
  1. /*
  2. * the_nilfs.c - the_nilfs shared structure.
  3. *
  4. * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation.
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation; either version 2 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  19. *
  20. * Written by Ryusuke Konishi <ryusuke@osrg.net>
  21. *
  22. */
  23. #include <linux/buffer_head.h>
  24. #include <linux/slab.h>
  25. #include <linux/blkdev.h>
  26. #include <linux/backing-dev.h>
  27. #include <linux/crc32.h>
  28. #include "nilfs.h"
  29. #include "segment.h"
  30. #include "alloc.h"
  31. #include "cpfile.h"
  32. #include "sufile.h"
  33. #include "dat.h"
  34. #include "segbuf.h"
  35. void nilfs_set_last_segment(struct the_nilfs *nilfs,
  36. sector_t start_blocknr, u64 seq, __u64 cno)
  37. {
  38. spin_lock(&nilfs->ns_last_segment_lock);
  39. nilfs->ns_last_pseg = start_blocknr;
  40. nilfs->ns_last_seq = seq;
  41. nilfs->ns_last_cno = cno;
  42. spin_unlock(&nilfs->ns_last_segment_lock);
  43. }
  44. /**
  45. * alloc_nilfs - allocate the_nilfs structure
  46. * @bdev: block device to which the_nilfs is related
  47. *
  48. * alloc_nilfs() allocates memory for the_nilfs and
  49. * initializes its reference count and locks.
  50. *
  51. * Return Value: On success, pointer to the_nilfs is returned.
  52. * On error, NULL is returned.
  53. */
  54. struct the_nilfs *alloc_nilfs(struct block_device *bdev)
  55. {
  56. struct the_nilfs *nilfs;
  57. nilfs = kzalloc(sizeof(*nilfs), GFP_KERNEL);
  58. if (!nilfs)
  59. return NULL;
  60. nilfs->ns_bdev = bdev;
  61. atomic_set(&nilfs->ns_count, 1);
  62. atomic_set(&nilfs->ns_writer_refcount, -1);
  63. atomic_set(&nilfs->ns_ndirtyblks, 0);
  64. init_rwsem(&nilfs->ns_sem);
  65. mutex_init(&nilfs->ns_writer_mutex);
  66. INIT_LIST_HEAD(&nilfs->ns_supers);
  67. spin_lock_init(&nilfs->ns_last_segment_lock);
  68. nilfs->ns_gc_inodes_h = NULL;
  69. init_rwsem(&nilfs->ns_segctor_sem);
  70. return nilfs;
  71. }
  72. /**
  73. * put_nilfs - release a reference to the_nilfs
  74. * @nilfs: the_nilfs structure to be released
  75. *
  76. * put_nilfs() decrements a reference counter of the_nilfs.
  77. * If the reference count reaches zero, the_nilfs is freed.
  78. */
  79. void put_nilfs(struct the_nilfs *nilfs)
  80. {
  81. if (!atomic_dec_and_test(&nilfs->ns_count))
  82. return;
  83. /*
  84. * Increment of ns_count never occur below because the caller
  85. * of get_nilfs() holds at least one reference to the_nilfs.
  86. * Thus its exclusion control is not required here.
  87. */
  88. might_sleep();
  89. if (nilfs_loaded(nilfs)) {
  90. nilfs_mdt_clear(nilfs->ns_sufile);
  91. nilfs_mdt_destroy(nilfs->ns_sufile);
  92. nilfs_mdt_clear(nilfs->ns_cpfile);
  93. nilfs_mdt_destroy(nilfs->ns_cpfile);
  94. nilfs_mdt_clear(nilfs->ns_dat);
  95. nilfs_mdt_destroy(nilfs->ns_dat);
  96. /* XXX: how and when to clear nilfs->ns_gc_dat? */
  97. nilfs_mdt_destroy(nilfs->ns_gc_dat);
  98. }
  99. if (nilfs_init(nilfs)) {
  100. nilfs_destroy_gccache(nilfs);
  101. brelse(nilfs->ns_sbh[0]);
  102. brelse(nilfs->ns_sbh[1]);
  103. }
  104. kfree(nilfs);
  105. }
  106. static int nilfs_load_super_root(struct the_nilfs *nilfs,
  107. struct nilfs_sb_info *sbi, sector_t sr_block)
  108. {
  109. static struct lock_class_key dat_lock_key;
  110. struct buffer_head *bh_sr;
  111. struct nilfs_super_root *raw_sr;
  112. struct nilfs_super_block **sbp = nilfs->ns_sbp;
  113. unsigned dat_entry_size, segment_usage_size, checkpoint_size;
  114. unsigned inode_size;
  115. int err;
  116. err = nilfs_read_super_root_block(sbi->s_super, sr_block, &bh_sr, 1);
  117. if (unlikely(err))
  118. return err;
  119. down_read(&nilfs->ns_sem);
  120. dat_entry_size = le16_to_cpu(sbp[0]->s_dat_entry_size);
  121. checkpoint_size = le16_to_cpu(sbp[0]->s_checkpoint_size);
  122. segment_usage_size = le16_to_cpu(sbp[0]->s_segment_usage_size);
  123. up_read(&nilfs->ns_sem);
  124. inode_size = nilfs->ns_inode_size;
  125. err = -ENOMEM;
  126. nilfs->ns_dat = nilfs_mdt_new(
  127. nilfs, NULL, NILFS_DAT_INO, NILFS_DAT_GFP);
  128. if (unlikely(!nilfs->ns_dat))
  129. goto failed;
  130. nilfs->ns_gc_dat = nilfs_mdt_new(
  131. nilfs, NULL, NILFS_DAT_INO, NILFS_DAT_GFP);
  132. if (unlikely(!nilfs->ns_gc_dat))
  133. goto failed_dat;
  134. nilfs->ns_cpfile = nilfs_mdt_new(
  135. nilfs, NULL, NILFS_CPFILE_INO, NILFS_CPFILE_GFP);
  136. if (unlikely(!nilfs->ns_cpfile))
  137. goto failed_gc_dat;
  138. nilfs->ns_sufile = nilfs_mdt_new(
  139. nilfs, NULL, NILFS_SUFILE_INO, NILFS_SUFILE_GFP);
  140. if (unlikely(!nilfs->ns_sufile))
  141. goto failed_cpfile;
  142. err = nilfs_palloc_init_blockgroup(nilfs->ns_dat, dat_entry_size);
  143. if (unlikely(err))
  144. goto failed_sufile;
  145. err = nilfs_palloc_init_blockgroup(nilfs->ns_gc_dat, dat_entry_size);
  146. if (unlikely(err))
  147. goto failed_sufile;
  148. lockdep_set_class(&NILFS_MDT(nilfs->ns_dat)->mi_sem, &dat_lock_key);
  149. lockdep_set_class(&NILFS_MDT(nilfs->ns_gc_dat)->mi_sem, &dat_lock_key);
  150. nilfs_mdt_set_shadow(nilfs->ns_dat, nilfs->ns_gc_dat);
  151. nilfs_mdt_set_entry_size(nilfs->ns_cpfile, checkpoint_size,
  152. sizeof(struct nilfs_cpfile_header));
  153. nilfs_mdt_set_entry_size(nilfs->ns_sufile, segment_usage_size,
  154. sizeof(struct nilfs_sufile_header));
  155. err = nilfs_mdt_read_inode_direct(
  156. nilfs->ns_dat, bh_sr, NILFS_SR_DAT_OFFSET(inode_size));
  157. if (unlikely(err))
  158. goto failed_sufile;
  159. err = nilfs_mdt_read_inode_direct(
  160. nilfs->ns_cpfile, bh_sr, NILFS_SR_CPFILE_OFFSET(inode_size));
  161. if (unlikely(err))
  162. goto failed_sufile;
  163. err = nilfs_mdt_read_inode_direct(
  164. nilfs->ns_sufile, bh_sr, NILFS_SR_SUFILE_OFFSET(inode_size));
  165. if (unlikely(err))
  166. goto failed_sufile;
  167. raw_sr = (struct nilfs_super_root *)bh_sr->b_data;
  168. nilfs->ns_nongc_ctime = le64_to_cpu(raw_sr->sr_nongc_ctime);
  169. failed:
  170. brelse(bh_sr);
  171. return err;
  172. failed_sufile:
  173. nilfs_mdt_destroy(nilfs->ns_sufile);
  174. failed_cpfile:
  175. nilfs_mdt_destroy(nilfs->ns_cpfile);
  176. failed_gc_dat:
  177. nilfs_mdt_destroy(nilfs->ns_gc_dat);
  178. failed_dat:
  179. nilfs_mdt_destroy(nilfs->ns_dat);
  180. goto failed;
  181. }
  182. static void nilfs_init_recovery_info(struct nilfs_recovery_info *ri)
  183. {
  184. memset(ri, 0, sizeof(*ri));
  185. INIT_LIST_HEAD(&ri->ri_used_segments);
  186. }
  187. static void nilfs_clear_recovery_info(struct nilfs_recovery_info *ri)
  188. {
  189. nilfs_dispose_segment_list(&ri->ri_used_segments);
  190. }
  191. /**
  192. * load_nilfs - load and recover the nilfs
  193. * @nilfs: the_nilfs structure to be released
  194. * @sbi: nilfs_sb_info used to recover past segment
  195. *
  196. * load_nilfs() searches and load the latest super root,
  197. * attaches the last segment, and does recovery if needed.
  198. * The caller must call this exclusively for simultaneous mounts.
  199. */
  200. int load_nilfs(struct the_nilfs *nilfs, struct nilfs_sb_info *sbi)
  201. {
  202. struct nilfs_recovery_info ri;
  203. unsigned int s_flags = sbi->s_super->s_flags;
  204. int really_read_only = bdev_read_only(nilfs->ns_bdev);
  205. unsigned valid_fs;
  206. int err = 0;
  207. nilfs_init_recovery_info(&ri);
  208. down_write(&nilfs->ns_sem);
  209. valid_fs = (nilfs->ns_mount_state & NILFS_VALID_FS);
  210. up_write(&nilfs->ns_sem);
  211. if (!valid_fs && (s_flags & MS_RDONLY)) {
  212. printk(KERN_INFO "NILFS: INFO: recovery "
  213. "required for readonly filesystem.\n");
  214. if (really_read_only) {
  215. printk(KERN_ERR "NILFS: write access "
  216. "unavailable, cannot proceed.\n");
  217. err = -EROFS;
  218. goto failed;
  219. }
  220. printk(KERN_INFO "NILFS: write access will "
  221. "be enabled during recovery.\n");
  222. sbi->s_super->s_flags &= ~MS_RDONLY;
  223. }
  224. err = nilfs_search_super_root(nilfs, sbi, &ri);
  225. if (unlikely(err)) {
  226. printk(KERN_ERR "NILFS: error searching super root.\n");
  227. goto failed;
  228. }
  229. err = nilfs_load_super_root(nilfs, sbi, ri.ri_super_root);
  230. if (unlikely(err)) {
  231. printk(KERN_ERR "NILFS: error loading super root.\n");
  232. goto failed;
  233. }
  234. if (!valid_fs) {
  235. err = nilfs_recover_logical_segments(nilfs, sbi, &ri);
  236. if (unlikely(err)) {
  237. nilfs_mdt_destroy(nilfs->ns_cpfile);
  238. nilfs_mdt_destroy(nilfs->ns_sufile);
  239. nilfs_mdt_destroy(nilfs->ns_dat);
  240. goto failed;
  241. }
  242. if (ri.ri_need_recovery == NILFS_RECOVERY_SR_UPDATED)
  243. sbi->s_super->s_dirt = 1;
  244. }
  245. set_nilfs_loaded(nilfs);
  246. failed:
  247. nilfs_clear_recovery_info(&ri);
  248. sbi->s_super->s_flags = s_flags;
  249. return err;
  250. }
  251. static unsigned long long nilfs_max_size(unsigned int blkbits)
  252. {
  253. unsigned int max_bits;
  254. unsigned long long res = MAX_LFS_FILESIZE; /* page cache limit */
  255. max_bits = blkbits + NILFS_BMAP_KEY_BIT; /* bmap size limit */
  256. if (max_bits < 64)
  257. res = min_t(unsigned long long, res, (1ULL << max_bits) - 1);
  258. return res;
  259. }
  260. static int nilfs_store_disk_layout(struct the_nilfs *nilfs,
  261. struct nilfs_super_block *sbp)
  262. {
  263. if (le32_to_cpu(sbp->s_rev_level) != NILFS_CURRENT_REV) {
  264. printk(KERN_ERR "NILFS: revision mismatch "
  265. "(superblock rev.=%d.%d, current rev.=%d.%d). "
  266. "Please check the version of mkfs.nilfs.\n",
  267. le32_to_cpu(sbp->s_rev_level),
  268. le16_to_cpu(sbp->s_minor_rev_level),
  269. NILFS_CURRENT_REV, NILFS_MINOR_REV);
  270. return -EINVAL;
  271. }
  272. nilfs->ns_sbsize = le16_to_cpu(sbp->s_bytes);
  273. if (nilfs->ns_sbsize > BLOCK_SIZE)
  274. return -EINVAL;
  275. nilfs->ns_inode_size = le16_to_cpu(sbp->s_inode_size);
  276. nilfs->ns_first_ino = le32_to_cpu(sbp->s_first_ino);
  277. nilfs->ns_blocks_per_segment = le32_to_cpu(sbp->s_blocks_per_segment);
  278. if (nilfs->ns_blocks_per_segment < NILFS_SEG_MIN_BLOCKS) {
  279. printk(KERN_ERR "NILFS: too short segment. \n");
  280. return -EINVAL;
  281. }
  282. nilfs->ns_first_data_block = le64_to_cpu(sbp->s_first_data_block);
  283. nilfs->ns_nsegments = le64_to_cpu(sbp->s_nsegments);
  284. nilfs->ns_r_segments_percentage =
  285. le32_to_cpu(sbp->s_r_segments_percentage);
  286. nilfs->ns_nrsvsegs =
  287. max_t(unsigned long, NILFS_MIN_NRSVSEGS,
  288. DIV_ROUND_UP(nilfs->ns_nsegments *
  289. nilfs->ns_r_segments_percentage, 100));
  290. nilfs->ns_crc_seed = le32_to_cpu(sbp->s_crc_seed);
  291. return 0;
  292. }
  293. static int nilfs_valid_sb(struct nilfs_super_block *sbp)
  294. {
  295. static unsigned char sum[4];
  296. const int sumoff = offsetof(struct nilfs_super_block, s_sum);
  297. size_t bytes;
  298. u32 crc;
  299. if (!sbp || le16_to_cpu(sbp->s_magic) != NILFS_SUPER_MAGIC)
  300. return 0;
  301. bytes = le16_to_cpu(sbp->s_bytes);
  302. if (bytes > BLOCK_SIZE)
  303. return 0;
  304. crc = crc32_le(le32_to_cpu(sbp->s_crc_seed), (unsigned char *)sbp,
  305. sumoff);
  306. crc = crc32_le(crc, sum, 4);
  307. crc = crc32_le(crc, (unsigned char *)sbp + sumoff + 4,
  308. bytes - sumoff - 4);
  309. return crc == le32_to_cpu(sbp->s_sum);
  310. }
  311. static int nilfs_sb2_bad_offset(struct nilfs_super_block *sbp, u64 offset)
  312. {
  313. return offset < ((le64_to_cpu(sbp->s_nsegments) *
  314. le32_to_cpu(sbp->s_blocks_per_segment)) <<
  315. (le32_to_cpu(sbp->s_log_block_size) + 10));
  316. }
  317. static void nilfs_release_super_block(struct the_nilfs *nilfs)
  318. {
  319. int i;
  320. for (i = 0; i < 2; i++) {
  321. if (nilfs->ns_sbp[i]) {
  322. brelse(nilfs->ns_sbh[i]);
  323. nilfs->ns_sbh[i] = NULL;
  324. nilfs->ns_sbp[i] = NULL;
  325. }
  326. }
  327. }
  328. void nilfs_fall_back_super_block(struct the_nilfs *nilfs)
  329. {
  330. brelse(nilfs->ns_sbh[0]);
  331. nilfs->ns_sbh[0] = nilfs->ns_sbh[1];
  332. nilfs->ns_sbp[0] = nilfs->ns_sbp[1];
  333. nilfs->ns_sbh[1] = NULL;
  334. nilfs->ns_sbp[1] = NULL;
  335. }
  336. void nilfs_swap_super_block(struct the_nilfs *nilfs)
  337. {
  338. struct buffer_head *tsbh = nilfs->ns_sbh[0];
  339. struct nilfs_super_block *tsbp = nilfs->ns_sbp[0];
  340. nilfs->ns_sbh[0] = nilfs->ns_sbh[1];
  341. nilfs->ns_sbp[0] = nilfs->ns_sbp[1];
  342. nilfs->ns_sbh[1] = tsbh;
  343. nilfs->ns_sbp[1] = tsbp;
  344. }
  345. static int nilfs_load_super_block(struct the_nilfs *nilfs,
  346. struct super_block *sb, int blocksize,
  347. struct nilfs_super_block **sbpp)
  348. {
  349. struct nilfs_super_block **sbp = nilfs->ns_sbp;
  350. struct buffer_head **sbh = nilfs->ns_sbh;
  351. u64 sb2off = NILFS_SB2_OFFSET_BYTES(nilfs->ns_bdev->bd_inode->i_size);
  352. int valid[2], swp = 0;
  353. sbp[0] = nilfs_read_super_block(sb, NILFS_SB_OFFSET_BYTES, blocksize,
  354. &sbh[0]);
  355. sbp[1] = nilfs_read_super_block(sb, sb2off, blocksize, &sbh[1]);
  356. if (!sbp[0]) {
  357. if (!sbp[1]) {
  358. printk(KERN_ERR "NILFS: unable to read superblock\n");
  359. return -EIO;
  360. }
  361. printk(KERN_WARNING
  362. "NILFS warning: unable to read primary superblock\n");
  363. } else if (!sbp[1])
  364. printk(KERN_WARNING
  365. "NILFS warning: unable to read secondary superblock\n");
  366. valid[0] = nilfs_valid_sb(sbp[0]);
  367. valid[1] = nilfs_valid_sb(sbp[1]);
  368. swp = valid[1] &&
  369. (!valid[0] ||
  370. le64_to_cpu(sbp[1]->s_wtime) > le64_to_cpu(sbp[0]->s_wtime));
  371. if (valid[swp] && nilfs_sb2_bad_offset(sbp[swp], sb2off)) {
  372. brelse(sbh[1]);
  373. sbh[1] = NULL;
  374. sbp[1] = NULL;
  375. swp = 0;
  376. }
  377. if (!valid[swp]) {
  378. nilfs_release_super_block(nilfs);
  379. printk(KERN_ERR "NILFS: Can't find nilfs on dev %s.\n",
  380. sb->s_id);
  381. return -EINVAL;
  382. }
  383. if (swp) {
  384. printk(KERN_WARNING "NILFS warning: broken superblock. "
  385. "using spare superblock.\n");
  386. nilfs_swap_super_block(nilfs);
  387. }
  388. nilfs->ns_sbwtime[0] = le64_to_cpu(sbp[0]->s_wtime);
  389. nilfs->ns_sbwtime[1] = valid[!swp] ? le64_to_cpu(sbp[1]->s_wtime) : 0;
  390. nilfs->ns_prot_seq = le64_to_cpu(sbp[valid[1] & !swp]->s_last_seq);
  391. *sbpp = sbp[0];
  392. return 0;
  393. }
  394. /**
  395. * init_nilfs - initialize a NILFS instance.
  396. * @nilfs: the_nilfs structure
  397. * @sbi: nilfs_sb_info
  398. * @sb: super block
  399. * @data: mount options
  400. *
  401. * init_nilfs() performs common initialization per block device (e.g.
  402. * reading the super block, getting disk layout information, initializing
  403. * shared fields in the_nilfs). It takes on some portion of the jobs
  404. * typically done by a fill_super() routine. This division arises from
  405. * the nature that multiple NILFS instances may be simultaneously
  406. * mounted on a device.
  407. * For multiple mounts on the same device, only the first mount
  408. * invokes these tasks.
  409. *
  410. * Return Value: On success, 0 is returned. On error, a negative error
  411. * code is returned.
  412. */
  413. int init_nilfs(struct the_nilfs *nilfs, struct nilfs_sb_info *sbi, char *data)
  414. {
  415. struct super_block *sb = sbi->s_super;
  416. struct nilfs_super_block *sbp;
  417. struct backing_dev_info *bdi;
  418. int blocksize;
  419. int err;
  420. down_write(&nilfs->ns_sem);
  421. if (nilfs_init(nilfs)) {
  422. /* Load values from existing the_nilfs */
  423. sbp = nilfs->ns_sbp[0];
  424. err = nilfs_store_magic_and_option(sb, sbp, data);
  425. if (err)
  426. goto out;
  427. blocksize = BLOCK_SIZE << le32_to_cpu(sbp->s_log_block_size);
  428. if (sb->s_blocksize != blocksize &&
  429. !sb_set_blocksize(sb, blocksize)) {
  430. printk(KERN_ERR "NILFS: blocksize %d unfit to device\n",
  431. blocksize);
  432. err = -EINVAL;
  433. }
  434. sb->s_maxbytes = nilfs_max_size(sb->s_blocksize_bits);
  435. goto out;
  436. }
  437. blocksize = sb_min_blocksize(sb, BLOCK_SIZE);
  438. if (!blocksize) {
  439. printk(KERN_ERR "NILFS: unable to set blocksize\n");
  440. err = -EINVAL;
  441. goto out;
  442. }
  443. err = nilfs_load_super_block(nilfs, sb, blocksize, &sbp);
  444. if (err)
  445. goto out;
  446. err = nilfs_store_magic_and_option(sb, sbp, data);
  447. if (err)
  448. goto failed_sbh;
  449. blocksize = BLOCK_SIZE << le32_to_cpu(sbp->s_log_block_size);
  450. if (sb->s_blocksize != blocksize) {
  451. int hw_blocksize = bdev_hardsect_size(sb->s_bdev);
  452. if (blocksize < hw_blocksize) {
  453. printk(KERN_ERR
  454. "NILFS: blocksize %d too small for device "
  455. "(sector-size = %d).\n",
  456. blocksize, hw_blocksize);
  457. err = -EINVAL;
  458. goto failed_sbh;
  459. }
  460. nilfs_release_super_block(nilfs);
  461. sb_set_blocksize(sb, blocksize);
  462. err = nilfs_load_super_block(nilfs, sb, blocksize, &sbp);
  463. if (err)
  464. goto out;
  465. /* not failed_sbh; sbh is released automatically
  466. when reloading fails. */
  467. }
  468. nilfs->ns_blocksize_bits = sb->s_blocksize_bits;
  469. err = nilfs_store_disk_layout(nilfs, sbp);
  470. if (err)
  471. goto failed_sbh;
  472. sb->s_maxbytes = nilfs_max_size(sb->s_blocksize_bits);
  473. nilfs->ns_mount_state = le16_to_cpu(sbp->s_state);
  474. bdi = nilfs->ns_bdev->bd_inode_backing_dev_info;
  475. if (!bdi)
  476. bdi = nilfs->ns_bdev->bd_inode->i_mapping->backing_dev_info;
  477. nilfs->ns_bdi = bdi ? : &default_backing_dev_info;
  478. /* Finding last segment */
  479. nilfs->ns_last_pseg = le64_to_cpu(sbp->s_last_pseg);
  480. nilfs->ns_last_cno = le64_to_cpu(sbp->s_last_cno);
  481. nilfs->ns_last_seq = le64_to_cpu(sbp->s_last_seq);
  482. nilfs->ns_seg_seq = nilfs->ns_last_seq;
  483. nilfs->ns_segnum =
  484. nilfs_get_segnum_of_block(nilfs, nilfs->ns_last_pseg);
  485. nilfs->ns_cno = nilfs->ns_last_cno + 1;
  486. if (nilfs->ns_segnum >= nilfs->ns_nsegments) {
  487. printk(KERN_ERR "NILFS invalid last segment number.\n");
  488. err = -EINVAL;
  489. goto failed_sbh;
  490. }
  491. /* Dummy values */
  492. nilfs->ns_free_segments_count =
  493. nilfs->ns_nsegments - (nilfs->ns_segnum + 1);
  494. /* Initialize gcinode cache */
  495. err = nilfs_init_gccache(nilfs);
  496. if (err)
  497. goto failed_sbh;
  498. set_nilfs_init(nilfs);
  499. err = 0;
  500. out:
  501. up_write(&nilfs->ns_sem);
  502. return err;
  503. failed_sbh:
  504. nilfs_release_super_block(nilfs);
  505. goto out;
  506. }
  507. int nilfs_count_free_blocks(struct the_nilfs *nilfs, sector_t *nblocks)
  508. {
  509. struct inode *dat = nilfs_dat_inode(nilfs);
  510. unsigned long ncleansegs;
  511. int err;
  512. down_read(&NILFS_MDT(dat)->mi_sem); /* XXX */
  513. err = nilfs_sufile_get_ncleansegs(nilfs->ns_sufile, &ncleansegs);
  514. up_read(&NILFS_MDT(dat)->mi_sem); /* XXX */
  515. if (likely(!err))
  516. *nblocks = (sector_t)ncleansegs * nilfs->ns_blocks_per_segment;
  517. return err;
  518. }
  519. int nilfs_near_disk_full(struct the_nilfs *nilfs)
  520. {
  521. struct inode *sufile = nilfs->ns_sufile;
  522. unsigned long ncleansegs, nincsegs;
  523. int ret;
  524. ret = nilfs_sufile_get_ncleansegs(sufile, &ncleansegs);
  525. if (likely(!ret)) {
  526. nincsegs = atomic_read(&nilfs->ns_ndirtyblks) /
  527. nilfs->ns_blocks_per_segment + 1;
  528. if (ncleansegs <= nilfs->ns_nrsvsegs + nincsegs)
  529. ret++;
  530. }
  531. return ret;
  532. }
  533. int nilfs_checkpoint_is_mounted(struct the_nilfs *nilfs, __u64 cno,
  534. int snapshot_mount)
  535. {
  536. struct nilfs_sb_info *sbi;
  537. int ret = 0;
  538. down_read(&nilfs->ns_sem);
  539. if (cno == 0 || cno > nilfs->ns_cno)
  540. goto out_unlock;
  541. list_for_each_entry(sbi, &nilfs->ns_supers, s_list) {
  542. if (sbi->s_snapshot_cno == cno &&
  543. (!snapshot_mount || nilfs_test_opt(sbi, SNAPSHOT))) {
  544. /* exclude read-only mounts */
  545. ret++;
  546. break;
  547. }
  548. }
  549. /* for protecting recent checkpoints */
  550. if (cno >= nilfs_last_cno(nilfs))
  551. ret++;
  552. out_unlock:
  553. up_read(&nilfs->ns_sem);
  554. return ret;
  555. }