the_nilfs.c 20 KB

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