the_nilfs.c 17 KB

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