the_nilfs.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801
  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/random.h>
  28. #include <linux/crc32.h>
  29. #include "nilfs.h"
  30. #include "segment.h"
  31. #include "alloc.h"
  32. #include "cpfile.h"
  33. #include "sufile.h"
  34. #include "dat.h"
  35. #include "segbuf.h"
  36. static int nilfs_valid_sb(struct nilfs_super_block *sbp);
  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. if (!nilfs_sb_dirty(nilfs)) {
  45. if (nilfs->ns_prev_seq == nilfs->ns_last_seq)
  46. goto stay_cursor;
  47. set_nilfs_sb_dirty(nilfs);
  48. }
  49. nilfs->ns_prev_seq = nilfs->ns_last_seq;
  50. stay_cursor:
  51. spin_unlock(&nilfs->ns_last_segment_lock);
  52. }
  53. /**
  54. * alloc_nilfs - allocate a nilfs object
  55. * @bdev: block device to which the_nilfs is related
  56. *
  57. * Return Value: On success, pointer to the_nilfs is returned.
  58. * On error, NULL is returned.
  59. */
  60. struct the_nilfs *alloc_nilfs(struct block_device *bdev)
  61. {
  62. struct the_nilfs *nilfs;
  63. nilfs = kzalloc(sizeof(*nilfs), GFP_KERNEL);
  64. if (!nilfs)
  65. return NULL;
  66. nilfs->ns_bdev = bdev;
  67. atomic_set(&nilfs->ns_ndirtyblks, 0);
  68. init_rwsem(&nilfs->ns_sem);
  69. mutex_init(&nilfs->ns_snapshot_mount_mutex);
  70. INIT_LIST_HEAD(&nilfs->ns_dirty_files);
  71. INIT_LIST_HEAD(&nilfs->ns_gc_inodes);
  72. spin_lock_init(&nilfs->ns_inode_lock);
  73. spin_lock_init(&nilfs->ns_next_gen_lock);
  74. spin_lock_init(&nilfs->ns_last_segment_lock);
  75. nilfs->ns_cptree = RB_ROOT;
  76. spin_lock_init(&nilfs->ns_cptree_lock);
  77. init_rwsem(&nilfs->ns_segctor_sem);
  78. return nilfs;
  79. }
  80. /**
  81. * destroy_nilfs - destroy nilfs object
  82. * @nilfs: nilfs object to be released
  83. */
  84. void destroy_nilfs(struct the_nilfs *nilfs)
  85. {
  86. might_sleep();
  87. if (nilfs_init(nilfs)) {
  88. brelse(nilfs->ns_sbh[0]);
  89. brelse(nilfs->ns_sbh[1]);
  90. }
  91. kfree(nilfs);
  92. }
  93. static int nilfs_load_super_root(struct the_nilfs *nilfs,
  94. struct super_block *sb, sector_t sr_block)
  95. {
  96. struct buffer_head *bh_sr;
  97. struct nilfs_super_root *raw_sr;
  98. struct nilfs_super_block **sbp = nilfs->ns_sbp;
  99. struct nilfs_inode *rawi;
  100. unsigned dat_entry_size, segment_usage_size, checkpoint_size;
  101. unsigned inode_size;
  102. int err;
  103. err = nilfs_read_super_root_block(nilfs, sr_block, &bh_sr, 1);
  104. if (unlikely(err))
  105. return err;
  106. down_read(&nilfs->ns_sem);
  107. dat_entry_size = le16_to_cpu(sbp[0]->s_dat_entry_size);
  108. checkpoint_size = le16_to_cpu(sbp[0]->s_checkpoint_size);
  109. segment_usage_size = le16_to_cpu(sbp[0]->s_segment_usage_size);
  110. up_read(&nilfs->ns_sem);
  111. inode_size = nilfs->ns_inode_size;
  112. rawi = (void *)bh_sr->b_data + NILFS_SR_DAT_OFFSET(inode_size);
  113. err = nilfs_dat_read(sb, dat_entry_size, rawi, &nilfs->ns_dat);
  114. if (err)
  115. goto failed;
  116. rawi = (void *)bh_sr->b_data + NILFS_SR_CPFILE_OFFSET(inode_size);
  117. err = nilfs_cpfile_read(sb, checkpoint_size, rawi, &nilfs->ns_cpfile);
  118. if (err)
  119. goto failed_dat;
  120. rawi = (void *)bh_sr->b_data + NILFS_SR_SUFILE_OFFSET(inode_size);
  121. err = nilfs_sufile_read(sb, segment_usage_size, rawi,
  122. &nilfs->ns_sufile);
  123. if (err)
  124. goto failed_cpfile;
  125. raw_sr = (struct nilfs_super_root *)bh_sr->b_data;
  126. nilfs->ns_nongc_ctime = le64_to_cpu(raw_sr->sr_nongc_ctime);
  127. failed:
  128. brelse(bh_sr);
  129. return err;
  130. failed_cpfile:
  131. iput(nilfs->ns_cpfile);
  132. failed_dat:
  133. iput(nilfs->ns_dat);
  134. goto failed;
  135. }
  136. static void nilfs_init_recovery_info(struct nilfs_recovery_info *ri)
  137. {
  138. memset(ri, 0, sizeof(*ri));
  139. INIT_LIST_HEAD(&ri->ri_used_segments);
  140. }
  141. static void nilfs_clear_recovery_info(struct nilfs_recovery_info *ri)
  142. {
  143. nilfs_dispose_segment_list(&ri->ri_used_segments);
  144. }
  145. /**
  146. * nilfs_store_log_cursor - load log cursor from a super block
  147. * @nilfs: nilfs object
  148. * @sbp: buffer storing super block to be read
  149. *
  150. * nilfs_store_log_cursor() reads the last position of the log
  151. * containing a super root from a given super block, and initializes
  152. * relevant information on the nilfs object preparatory for log
  153. * scanning and recovery.
  154. */
  155. static int nilfs_store_log_cursor(struct the_nilfs *nilfs,
  156. struct nilfs_super_block *sbp)
  157. {
  158. int ret = 0;
  159. nilfs->ns_last_pseg = le64_to_cpu(sbp->s_last_pseg);
  160. nilfs->ns_last_cno = le64_to_cpu(sbp->s_last_cno);
  161. nilfs->ns_last_seq = le64_to_cpu(sbp->s_last_seq);
  162. nilfs->ns_prev_seq = nilfs->ns_last_seq;
  163. nilfs->ns_seg_seq = nilfs->ns_last_seq;
  164. nilfs->ns_segnum =
  165. nilfs_get_segnum_of_block(nilfs, nilfs->ns_last_pseg);
  166. nilfs->ns_cno = nilfs->ns_last_cno + 1;
  167. if (nilfs->ns_segnum >= nilfs->ns_nsegments) {
  168. printk(KERN_ERR "NILFS invalid last segment number.\n");
  169. ret = -EINVAL;
  170. }
  171. return ret;
  172. }
  173. /**
  174. * load_nilfs - load and recover the nilfs
  175. * @nilfs: the_nilfs structure to be released
  176. * @sb: super block isntance used to recover past segment
  177. *
  178. * load_nilfs() searches and load the latest super root,
  179. * attaches the last segment, and does recovery if needed.
  180. * The caller must call this exclusively for simultaneous mounts.
  181. */
  182. int load_nilfs(struct the_nilfs *nilfs, struct super_block *sb)
  183. {
  184. struct nilfs_recovery_info ri;
  185. unsigned int s_flags = sb->s_flags;
  186. int really_read_only = bdev_read_only(nilfs->ns_bdev);
  187. int valid_fs = nilfs_valid_fs(nilfs);
  188. int err;
  189. if (!valid_fs) {
  190. printk(KERN_WARNING "NILFS warning: mounting unchecked fs\n");
  191. if (s_flags & MS_RDONLY) {
  192. printk(KERN_INFO "NILFS: INFO: recovery "
  193. "required for readonly filesystem.\n");
  194. printk(KERN_INFO "NILFS: write access will "
  195. "be enabled during recovery.\n");
  196. }
  197. }
  198. nilfs_init_recovery_info(&ri);
  199. err = nilfs_search_super_root(nilfs, &ri);
  200. if (unlikely(err)) {
  201. struct nilfs_super_block **sbp = nilfs->ns_sbp;
  202. int blocksize;
  203. if (err != -EINVAL)
  204. goto scan_error;
  205. if (!nilfs_valid_sb(sbp[1])) {
  206. printk(KERN_WARNING
  207. "NILFS warning: unable to fall back to spare"
  208. "super block\n");
  209. goto scan_error;
  210. }
  211. printk(KERN_INFO
  212. "NILFS: try rollback from an earlier position\n");
  213. /*
  214. * restore super block with its spare and reconfigure
  215. * relevant states of the nilfs object.
  216. */
  217. memcpy(sbp[0], sbp[1], nilfs->ns_sbsize);
  218. nilfs->ns_crc_seed = le32_to_cpu(sbp[0]->s_crc_seed);
  219. nilfs->ns_sbwtime = le64_to_cpu(sbp[0]->s_wtime);
  220. /* verify consistency between two super blocks */
  221. blocksize = BLOCK_SIZE << le32_to_cpu(sbp[0]->s_log_block_size);
  222. if (blocksize != nilfs->ns_blocksize) {
  223. printk(KERN_WARNING
  224. "NILFS warning: blocksize differs between "
  225. "two super blocks (%d != %d)\n",
  226. blocksize, nilfs->ns_blocksize);
  227. goto scan_error;
  228. }
  229. err = nilfs_store_log_cursor(nilfs, sbp[0]);
  230. if (err)
  231. goto scan_error;
  232. /* drop clean flag to allow roll-forward and recovery */
  233. nilfs->ns_mount_state &= ~NILFS_VALID_FS;
  234. valid_fs = 0;
  235. err = nilfs_search_super_root(nilfs, &ri);
  236. if (err)
  237. goto scan_error;
  238. }
  239. err = nilfs_load_super_root(nilfs, sb, ri.ri_super_root);
  240. if (unlikely(err)) {
  241. printk(KERN_ERR "NILFS: error loading super root.\n");
  242. goto failed;
  243. }
  244. if (valid_fs)
  245. goto skip_recovery;
  246. if (s_flags & MS_RDONLY) {
  247. __u64 features;
  248. if (nilfs_test_opt(nilfs, NORECOVERY)) {
  249. printk(KERN_INFO "NILFS: norecovery option specified. "
  250. "skipping roll-forward recovery\n");
  251. goto skip_recovery;
  252. }
  253. features = le64_to_cpu(nilfs->ns_sbp[0]->s_feature_compat_ro) &
  254. ~NILFS_FEATURE_COMPAT_RO_SUPP;
  255. if (features) {
  256. printk(KERN_ERR "NILFS: couldn't proceed with "
  257. "recovery because of unsupported optional "
  258. "features (%llx)\n",
  259. (unsigned long long)features);
  260. err = -EROFS;
  261. goto failed_unload;
  262. }
  263. if (really_read_only) {
  264. printk(KERN_ERR "NILFS: write access "
  265. "unavailable, cannot proceed.\n");
  266. err = -EROFS;
  267. goto failed_unload;
  268. }
  269. sb->s_flags &= ~MS_RDONLY;
  270. } else if (nilfs_test_opt(nilfs, NORECOVERY)) {
  271. printk(KERN_ERR "NILFS: recovery cancelled because norecovery "
  272. "option was specified for a read/write mount\n");
  273. err = -EINVAL;
  274. goto failed_unload;
  275. }
  276. err = nilfs_salvage_orphan_logs(nilfs, sb, &ri);
  277. if (err)
  278. goto failed_unload;
  279. down_write(&nilfs->ns_sem);
  280. nilfs->ns_mount_state |= NILFS_VALID_FS; /* set "clean" flag */
  281. err = nilfs_cleanup_super(sb);
  282. up_write(&nilfs->ns_sem);
  283. if (err) {
  284. printk(KERN_ERR "NILFS: failed to update super block. "
  285. "recovery unfinished.\n");
  286. goto failed_unload;
  287. }
  288. printk(KERN_INFO "NILFS: recovery complete.\n");
  289. skip_recovery:
  290. nilfs_clear_recovery_info(&ri);
  291. sb->s_flags = s_flags;
  292. return 0;
  293. scan_error:
  294. printk(KERN_ERR "NILFS: error searching super root.\n");
  295. goto failed;
  296. failed_unload:
  297. iput(nilfs->ns_cpfile);
  298. iput(nilfs->ns_sufile);
  299. iput(nilfs->ns_dat);
  300. failed:
  301. nilfs_clear_recovery_info(&ri);
  302. sb->s_flags = s_flags;
  303. return err;
  304. }
  305. static unsigned long long nilfs_max_size(unsigned int blkbits)
  306. {
  307. unsigned int max_bits;
  308. unsigned long long res = MAX_LFS_FILESIZE; /* page cache limit */
  309. max_bits = blkbits + NILFS_BMAP_KEY_BIT; /* bmap size limit */
  310. if (max_bits < 64)
  311. res = min_t(unsigned long long, res, (1ULL << max_bits) - 1);
  312. return res;
  313. }
  314. /**
  315. * nilfs_nrsvsegs - calculate the number of reserved segments
  316. * @nilfs: nilfs object
  317. * @nsegs: total number of segments
  318. */
  319. unsigned long nilfs_nrsvsegs(struct the_nilfs *nilfs, unsigned long nsegs)
  320. {
  321. return max_t(unsigned long, NILFS_MIN_NRSVSEGS,
  322. DIV_ROUND_UP(nsegs * nilfs->ns_r_segments_percentage,
  323. 100));
  324. }
  325. void nilfs_set_nsegments(struct the_nilfs *nilfs, unsigned long nsegs)
  326. {
  327. nilfs->ns_nsegments = nsegs;
  328. nilfs->ns_nrsvsegs = nilfs_nrsvsegs(nilfs, nsegs);
  329. }
  330. static int nilfs_store_disk_layout(struct the_nilfs *nilfs,
  331. struct nilfs_super_block *sbp)
  332. {
  333. if (le32_to_cpu(sbp->s_rev_level) < NILFS_MIN_SUPP_REV) {
  334. printk(KERN_ERR "NILFS: unsupported revision "
  335. "(superblock rev.=%d.%d, current rev.=%d.%d). "
  336. "Please check the version of mkfs.nilfs.\n",
  337. le32_to_cpu(sbp->s_rev_level),
  338. le16_to_cpu(sbp->s_minor_rev_level),
  339. NILFS_CURRENT_REV, NILFS_MINOR_REV);
  340. return -EINVAL;
  341. }
  342. nilfs->ns_sbsize = le16_to_cpu(sbp->s_bytes);
  343. if (nilfs->ns_sbsize > BLOCK_SIZE)
  344. return -EINVAL;
  345. nilfs->ns_inode_size = le16_to_cpu(sbp->s_inode_size);
  346. if (nilfs->ns_inode_size > nilfs->ns_blocksize) {
  347. printk(KERN_ERR "NILFS: too large inode size: %d bytes.\n",
  348. nilfs->ns_inode_size);
  349. return -EINVAL;
  350. } else if (nilfs->ns_inode_size < NILFS_MIN_INODE_SIZE) {
  351. printk(KERN_ERR "NILFS: too small inode size: %d bytes.\n",
  352. nilfs->ns_inode_size);
  353. return -EINVAL;
  354. }
  355. nilfs->ns_first_ino = le32_to_cpu(sbp->s_first_ino);
  356. nilfs->ns_blocks_per_segment = le32_to_cpu(sbp->s_blocks_per_segment);
  357. if (nilfs->ns_blocks_per_segment < NILFS_SEG_MIN_BLOCKS) {
  358. printk(KERN_ERR "NILFS: too short segment.\n");
  359. return -EINVAL;
  360. }
  361. nilfs->ns_first_data_block = le64_to_cpu(sbp->s_first_data_block);
  362. nilfs->ns_r_segments_percentage =
  363. le32_to_cpu(sbp->s_r_segments_percentage);
  364. if (nilfs->ns_r_segments_percentage < 1 ||
  365. nilfs->ns_r_segments_percentage > 99) {
  366. printk(KERN_ERR "NILFS: invalid reserved segments percentage.\n");
  367. return -EINVAL;
  368. }
  369. nilfs_set_nsegments(nilfs, le64_to_cpu(sbp->s_nsegments));
  370. nilfs->ns_crc_seed = le32_to_cpu(sbp->s_crc_seed);
  371. return 0;
  372. }
  373. static int nilfs_valid_sb(struct nilfs_super_block *sbp)
  374. {
  375. static unsigned char sum[4];
  376. const int sumoff = offsetof(struct nilfs_super_block, s_sum);
  377. size_t bytes;
  378. u32 crc;
  379. if (!sbp || le16_to_cpu(sbp->s_magic) != NILFS_SUPER_MAGIC)
  380. return 0;
  381. bytes = le16_to_cpu(sbp->s_bytes);
  382. if (bytes > BLOCK_SIZE)
  383. return 0;
  384. crc = crc32_le(le32_to_cpu(sbp->s_crc_seed), (unsigned char *)sbp,
  385. sumoff);
  386. crc = crc32_le(crc, sum, 4);
  387. crc = crc32_le(crc, (unsigned char *)sbp + sumoff + 4,
  388. bytes - sumoff - 4);
  389. return crc == le32_to_cpu(sbp->s_sum);
  390. }
  391. static int nilfs_sb2_bad_offset(struct nilfs_super_block *sbp, u64 offset)
  392. {
  393. return offset < ((le64_to_cpu(sbp->s_nsegments) *
  394. le32_to_cpu(sbp->s_blocks_per_segment)) <<
  395. (le32_to_cpu(sbp->s_log_block_size) + 10));
  396. }
  397. static void nilfs_release_super_block(struct the_nilfs *nilfs)
  398. {
  399. int i;
  400. for (i = 0; i < 2; i++) {
  401. if (nilfs->ns_sbp[i]) {
  402. brelse(nilfs->ns_sbh[i]);
  403. nilfs->ns_sbh[i] = NULL;
  404. nilfs->ns_sbp[i] = NULL;
  405. }
  406. }
  407. }
  408. void nilfs_fall_back_super_block(struct the_nilfs *nilfs)
  409. {
  410. brelse(nilfs->ns_sbh[0]);
  411. nilfs->ns_sbh[0] = nilfs->ns_sbh[1];
  412. nilfs->ns_sbp[0] = nilfs->ns_sbp[1];
  413. nilfs->ns_sbh[1] = NULL;
  414. nilfs->ns_sbp[1] = NULL;
  415. }
  416. void nilfs_swap_super_block(struct the_nilfs *nilfs)
  417. {
  418. struct buffer_head *tsbh = nilfs->ns_sbh[0];
  419. struct nilfs_super_block *tsbp = nilfs->ns_sbp[0];
  420. nilfs->ns_sbh[0] = nilfs->ns_sbh[1];
  421. nilfs->ns_sbp[0] = nilfs->ns_sbp[1];
  422. nilfs->ns_sbh[1] = tsbh;
  423. nilfs->ns_sbp[1] = tsbp;
  424. }
  425. static int nilfs_load_super_block(struct the_nilfs *nilfs,
  426. struct super_block *sb, int blocksize,
  427. struct nilfs_super_block **sbpp)
  428. {
  429. struct nilfs_super_block **sbp = nilfs->ns_sbp;
  430. struct buffer_head **sbh = nilfs->ns_sbh;
  431. u64 sb2off = NILFS_SB2_OFFSET_BYTES(nilfs->ns_bdev->bd_inode->i_size);
  432. int valid[2], swp = 0;
  433. sbp[0] = nilfs_read_super_block(sb, NILFS_SB_OFFSET_BYTES, blocksize,
  434. &sbh[0]);
  435. sbp[1] = nilfs_read_super_block(sb, sb2off, blocksize, &sbh[1]);
  436. if (!sbp[0]) {
  437. if (!sbp[1]) {
  438. printk(KERN_ERR "NILFS: unable to read superblock\n");
  439. return -EIO;
  440. }
  441. printk(KERN_WARNING
  442. "NILFS warning: unable to read primary superblock "
  443. "(blocksize = %d)\n", blocksize);
  444. } else if (!sbp[1]) {
  445. printk(KERN_WARNING
  446. "NILFS warning: unable to read secondary superblock "
  447. "(blocksize = %d)\n", blocksize);
  448. }
  449. /*
  450. * Compare two super blocks and set 1 in swp if the secondary
  451. * super block is valid and newer. Otherwise, set 0 in swp.
  452. */
  453. valid[0] = nilfs_valid_sb(sbp[0]);
  454. valid[1] = nilfs_valid_sb(sbp[1]);
  455. swp = valid[1] && (!valid[0] ||
  456. le64_to_cpu(sbp[1]->s_last_cno) >
  457. le64_to_cpu(sbp[0]->s_last_cno));
  458. if (valid[swp] && nilfs_sb2_bad_offset(sbp[swp], sb2off)) {
  459. brelse(sbh[1]);
  460. sbh[1] = NULL;
  461. sbp[1] = NULL;
  462. valid[1] = 0;
  463. swp = 0;
  464. }
  465. if (!valid[swp]) {
  466. nilfs_release_super_block(nilfs);
  467. printk(KERN_ERR "NILFS: Can't find nilfs on dev %s.\n",
  468. sb->s_id);
  469. return -EINVAL;
  470. }
  471. if (!valid[!swp])
  472. printk(KERN_WARNING "NILFS warning: broken superblock. "
  473. "using spare superblock (blocksize = %d).\n", blocksize);
  474. if (swp)
  475. nilfs_swap_super_block(nilfs);
  476. nilfs->ns_sbwcount = 0;
  477. nilfs->ns_sbwtime = le64_to_cpu(sbp[0]->s_wtime);
  478. nilfs->ns_prot_seq = le64_to_cpu(sbp[valid[1] & !swp]->s_last_seq);
  479. *sbpp = sbp[0];
  480. return 0;
  481. }
  482. /**
  483. * init_nilfs - initialize a NILFS instance.
  484. * @nilfs: the_nilfs structure
  485. * @sb: super block
  486. * @data: mount options
  487. *
  488. * init_nilfs() performs common initialization per block device (e.g.
  489. * reading the super block, getting disk layout information, initializing
  490. * shared fields in the_nilfs).
  491. *
  492. * Return Value: On success, 0 is returned. On error, a negative error
  493. * code is returned.
  494. */
  495. int init_nilfs(struct the_nilfs *nilfs, struct super_block *sb, char *data)
  496. {
  497. struct nilfs_super_block *sbp;
  498. int blocksize;
  499. int err;
  500. down_write(&nilfs->ns_sem);
  501. blocksize = sb_min_blocksize(sb, NILFS_MIN_BLOCK_SIZE);
  502. if (!blocksize) {
  503. printk(KERN_ERR "NILFS: unable to set blocksize\n");
  504. err = -EINVAL;
  505. goto out;
  506. }
  507. err = nilfs_load_super_block(nilfs, sb, blocksize, &sbp);
  508. if (err)
  509. goto out;
  510. err = nilfs_store_magic_and_option(sb, sbp, data);
  511. if (err)
  512. goto failed_sbh;
  513. err = nilfs_check_feature_compatibility(sb, sbp);
  514. if (err)
  515. goto failed_sbh;
  516. blocksize = BLOCK_SIZE << le32_to_cpu(sbp->s_log_block_size);
  517. if (blocksize < NILFS_MIN_BLOCK_SIZE ||
  518. blocksize > NILFS_MAX_BLOCK_SIZE) {
  519. printk(KERN_ERR "NILFS: couldn't mount because of unsupported "
  520. "filesystem blocksize %d\n", blocksize);
  521. err = -EINVAL;
  522. goto failed_sbh;
  523. }
  524. if (sb->s_blocksize != blocksize) {
  525. int hw_blocksize = bdev_logical_block_size(sb->s_bdev);
  526. if (blocksize < hw_blocksize) {
  527. printk(KERN_ERR
  528. "NILFS: blocksize %d too small for device "
  529. "(sector-size = %d).\n",
  530. blocksize, hw_blocksize);
  531. err = -EINVAL;
  532. goto failed_sbh;
  533. }
  534. nilfs_release_super_block(nilfs);
  535. sb_set_blocksize(sb, blocksize);
  536. err = nilfs_load_super_block(nilfs, sb, blocksize, &sbp);
  537. if (err)
  538. goto out;
  539. /* not failed_sbh; sbh is released automatically
  540. when reloading fails. */
  541. }
  542. nilfs->ns_blocksize_bits = sb->s_blocksize_bits;
  543. nilfs->ns_blocksize = blocksize;
  544. get_random_bytes(&nilfs->ns_next_generation,
  545. sizeof(nilfs->ns_next_generation));
  546. err = nilfs_store_disk_layout(nilfs, sbp);
  547. if (err)
  548. goto failed_sbh;
  549. sb->s_maxbytes = nilfs_max_size(sb->s_blocksize_bits);
  550. nilfs->ns_mount_state = le16_to_cpu(sbp->s_state);
  551. err = nilfs_store_log_cursor(nilfs, sbp);
  552. if (err)
  553. goto failed_sbh;
  554. set_nilfs_init(nilfs);
  555. err = 0;
  556. out:
  557. up_write(&nilfs->ns_sem);
  558. return err;
  559. failed_sbh:
  560. nilfs_release_super_block(nilfs);
  561. goto out;
  562. }
  563. int nilfs_discard_segments(struct the_nilfs *nilfs, __u64 *segnump,
  564. size_t nsegs)
  565. {
  566. sector_t seg_start, seg_end;
  567. sector_t start = 0, nblocks = 0;
  568. unsigned int sects_per_block;
  569. __u64 *sn;
  570. int ret = 0;
  571. sects_per_block = (1 << nilfs->ns_blocksize_bits) /
  572. bdev_logical_block_size(nilfs->ns_bdev);
  573. for (sn = segnump; sn < segnump + nsegs; sn++) {
  574. nilfs_get_segment_range(nilfs, *sn, &seg_start, &seg_end);
  575. if (!nblocks) {
  576. start = seg_start;
  577. nblocks = seg_end - seg_start + 1;
  578. } else if (start + nblocks == seg_start) {
  579. nblocks += seg_end - seg_start + 1;
  580. } else {
  581. ret = blkdev_issue_discard(nilfs->ns_bdev,
  582. start * sects_per_block,
  583. nblocks * sects_per_block,
  584. GFP_NOFS, 0);
  585. if (ret < 0)
  586. return ret;
  587. nblocks = 0;
  588. }
  589. }
  590. if (nblocks)
  591. ret = blkdev_issue_discard(nilfs->ns_bdev,
  592. start * sects_per_block,
  593. nblocks * sects_per_block,
  594. GFP_NOFS, 0);
  595. return ret;
  596. }
  597. int nilfs_count_free_blocks(struct the_nilfs *nilfs, sector_t *nblocks)
  598. {
  599. unsigned long ncleansegs;
  600. down_read(&NILFS_MDT(nilfs->ns_dat)->mi_sem);
  601. ncleansegs = nilfs_sufile_get_ncleansegs(nilfs->ns_sufile);
  602. up_read(&NILFS_MDT(nilfs->ns_dat)->mi_sem);
  603. *nblocks = (sector_t)ncleansegs * nilfs->ns_blocks_per_segment;
  604. return 0;
  605. }
  606. int nilfs_near_disk_full(struct the_nilfs *nilfs)
  607. {
  608. unsigned long ncleansegs, nincsegs;
  609. ncleansegs = nilfs_sufile_get_ncleansegs(nilfs->ns_sufile);
  610. nincsegs = atomic_read(&nilfs->ns_ndirtyblks) /
  611. nilfs->ns_blocks_per_segment + 1;
  612. return ncleansegs <= nilfs->ns_nrsvsegs + nincsegs;
  613. }
  614. struct nilfs_root *nilfs_lookup_root(struct the_nilfs *nilfs, __u64 cno)
  615. {
  616. struct rb_node *n;
  617. struct nilfs_root *root;
  618. spin_lock(&nilfs->ns_cptree_lock);
  619. n = nilfs->ns_cptree.rb_node;
  620. while (n) {
  621. root = rb_entry(n, struct nilfs_root, rb_node);
  622. if (cno < root->cno) {
  623. n = n->rb_left;
  624. } else if (cno > root->cno) {
  625. n = n->rb_right;
  626. } else {
  627. atomic_inc(&root->count);
  628. spin_unlock(&nilfs->ns_cptree_lock);
  629. return root;
  630. }
  631. }
  632. spin_unlock(&nilfs->ns_cptree_lock);
  633. return NULL;
  634. }
  635. struct nilfs_root *
  636. nilfs_find_or_create_root(struct the_nilfs *nilfs, __u64 cno)
  637. {
  638. struct rb_node **p, *parent;
  639. struct nilfs_root *root, *new;
  640. root = nilfs_lookup_root(nilfs, cno);
  641. if (root)
  642. return root;
  643. new = kmalloc(sizeof(*root), GFP_KERNEL);
  644. if (!new)
  645. return NULL;
  646. spin_lock(&nilfs->ns_cptree_lock);
  647. p = &nilfs->ns_cptree.rb_node;
  648. parent = NULL;
  649. while (*p) {
  650. parent = *p;
  651. root = rb_entry(parent, struct nilfs_root, rb_node);
  652. if (cno < root->cno) {
  653. p = &(*p)->rb_left;
  654. } else if (cno > root->cno) {
  655. p = &(*p)->rb_right;
  656. } else {
  657. atomic_inc(&root->count);
  658. spin_unlock(&nilfs->ns_cptree_lock);
  659. kfree(new);
  660. return root;
  661. }
  662. }
  663. new->cno = cno;
  664. new->ifile = NULL;
  665. new->nilfs = nilfs;
  666. atomic_set(&new->count, 1);
  667. atomic64_set(&new->inodes_count, 0);
  668. atomic64_set(&new->blocks_count, 0);
  669. rb_link_node(&new->rb_node, parent, p);
  670. rb_insert_color(&new->rb_node, &nilfs->ns_cptree);
  671. spin_unlock(&nilfs->ns_cptree_lock);
  672. return new;
  673. }
  674. void nilfs_put_root(struct nilfs_root *root)
  675. {
  676. if (atomic_dec_and_test(&root->count)) {
  677. struct the_nilfs *nilfs = root->nilfs;
  678. spin_lock(&nilfs->ns_cptree_lock);
  679. rb_erase(&root->rb_node, &nilfs->ns_cptree);
  680. spin_unlock(&nilfs->ns_cptree_lock);
  681. if (root->ifile)
  682. iput(root->ifile);
  683. kfree(root);
  684. }
  685. }