inode.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498
  1. /*
  2. * fs/bfs/inode.c
  3. * BFS superblock and inode operations.
  4. * Copyright (C) 1999-2006 Tigran Aivazian <tigran@aivazian.fsnet.co.uk>
  5. * From fs/minix, Copyright (C) 1991, 1992 Linus Torvalds.
  6. *
  7. * Made endianness-clean by Andrew Stribblehill <ads@wompom.org>, 2005.
  8. */
  9. #include <linux/module.h>
  10. #include <linux/mm.h>
  11. #include <linux/slab.h>
  12. #include <linux/init.h>
  13. #include <linux/fs.h>
  14. #include <linux/buffer_head.h>
  15. #include <linux/vfs.h>
  16. #include <linux/writeback.h>
  17. #include <asm/uaccess.h>
  18. #include "bfs.h"
  19. MODULE_AUTHOR("Tigran Aivazian <tigran@aivazian.fsnet.co.uk>");
  20. MODULE_DESCRIPTION("SCO UnixWare BFS filesystem for Linux");
  21. MODULE_LICENSE("GPL");
  22. #undef DEBUG
  23. #ifdef DEBUG
  24. #define dprintf(x...) printf(x)
  25. #else
  26. #define dprintf(x...)
  27. #endif
  28. struct inode *bfs_iget(struct super_block *sb, unsigned long ino)
  29. {
  30. struct bfs_inode *di;
  31. struct inode *inode;
  32. struct buffer_head *bh;
  33. int block, off;
  34. inode = iget_locked(sb, ino);
  35. if (!inode)
  36. return ERR_PTR(-ENOMEM);
  37. if (!(inode->i_state & I_NEW))
  38. return inode;
  39. if ((ino < BFS_ROOT_INO) || (ino > BFS_SB(inode->i_sb)->si_lasti)) {
  40. printf("Bad inode number %s:%08lx\n", inode->i_sb->s_id, ino);
  41. goto error;
  42. }
  43. block = (ino - BFS_ROOT_INO) / BFS_INODES_PER_BLOCK + 1;
  44. bh = sb_bread(inode->i_sb, block);
  45. if (!bh) {
  46. printf("Unable to read inode %s:%08lx\n", inode->i_sb->s_id,
  47. ino);
  48. goto error;
  49. }
  50. off = (ino - BFS_ROOT_INO) % BFS_INODES_PER_BLOCK;
  51. di = (struct bfs_inode *)bh->b_data + off;
  52. inode->i_mode = 0x0000FFFF & le32_to_cpu(di->i_mode);
  53. if (le32_to_cpu(di->i_vtype) == BFS_VDIR) {
  54. inode->i_mode |= S_IFDIR;
  55. inode->i_op = &bfs_dir_inops;
  56. inode->i_fop = &bfs_dir_operations;
  57. } else if (le32_to_cpu(di->i_vtype) == BFS_VREG) {
  58. inode->i_mode |= S_IFREG;
  59. inode->i_op = &bfs_file_inops;
  60. inode->i_fop = &bfs_file_operations;
  61. inode->i_mapping->a_ops = &bfs_aops;
  62. }
  63. BFS_I(inode)->i_sblock = le32_to_cpu(di->i_sblock);
  64. BFS_I(inode)->i_eblock = le32_to_cpu(di->i_eblock);
  65. BFS_I(inode)->i_dsk_ino = le16_to_cpu(di->i_ino);
  66. i_uid_write(inode, le32_to_cpu(di->i_uid));
  67. i_gid_write(inode, le32_to_cpu(di->i_gid));
  68. set_nlink(inode, le32_to_cpu(di->i_nlink));
  69. inode->i_size = BFS_FILESIZE(di);
  70. inode->i_blocks = BFS_FILEBLOCKS(di);
  71. inode->i_atime.tv_sec = le32_to_cpu(di->i_atime);
  72. inode->i_mtime.tv_sec = le32_to_cpu(di->i_mtime);
  73. inode->i_ctime.tv_sec = le32_to_cpu(di->i_ctime);
  74. inode->i_atime.tv_nsec = 0;
  75. inode->i_mtime.tv_nsec = 0;
  76. inode->i_ctime.tv_nsec = 0;
  77. brelse(bh);
  78. unlock_new_inode(inode);
  79. return inode;
  80. error:
  81. iget_failed(inode);
  82. return ERR_PTR(-EIO);
  83. }
  84. static struct bfs_inode *find_inode(struct super_block *sb, u16 ino, struct buffer_head **p)
  85. {
  86. if ((ino < BFS_ROOT_INO) || (ino > BFS_SB(sb)->si_lasti)) {
  87. printf("Bad inode number %s:%08x\n", sb->s_id, ino);
  88. return ERR_PTR(-EIO);
  89. }
  90. ino -= BFS_ROOT_INO;
  91. *p = sb_bread(sb, 1 + ino / BFS_INODES_PER_BLOCK);
  92. if (!*p) {
  93. printf("Unable to read inode %s:%08x\n", sb->s_id, ino);
  94. return ERR_PTR(-EIO);
  95. }
  96. return (struct bfs_inode *)(*p)->b_data + ino % BFS_INODES_PER_BLOCK;
  97. }
  98. static int bfs_write_inode(struct inode *inode, struct writeback_control *wbc)
  99. {
  100. struct bfs_sb_info *info = BFS_SB(inode->i_sb);
  101. unsigned int ino = (u16)inode->i_ino;
  102. unsigned long i_sblock;
  103. struct bfs_inode *di;
  104. struct buffer_head *bh;
  105. int err = 0;
  106. dprintf("ino=%08x\n", ino);
  107. di = find_inode(inode->i_sb, ino, &bh);
  108. if (IS_ERR(di))
  109. return PTR_ERR(di);
  110. mutex_lock(&info->bfs_lock);
  111. if (ino == BFS_ROOT_INO)
  112. di->i_vtype = cpu_to_le32(BFS_VDIR);
  113. else
  114. di->i_vtype = cpu_to_le32(BFS_VREG);
  115. di->i_ino = cpu_to_le16(ino);
  116. di->i_mode = cpu_to_le32(inode->i_mode);
  117. di->i_uid = cpu_to_le32(i_uid_read(inode));
  118. di->i_gid = cpu_to_le32(i_gid_read(inode));
  119. di->i_nlink = cpu_to_le32(inode->i_nlink);
  120. di->i_atime = cpu_to_le32(inode->i_atime.tv_sec);
  121. di->i_mtime = cpu_to_le32(inode->i_mtime.tv_sec);
  122. di->i_ctime = cpu_to_le32(inode->i_ctime.tv_sec);
  123. i_sblock = BFS_I(inode)->i_sblock;
  124. di->i_sblock = cpu_to_le32(i_sblock);
  125. di->i_eblock = cpu_to_le32(BFS_I(inode)->i_eblock);
  126. di->i_eoffset = cpu_to_le32(i_sblock * BFS_BSIZE + inode->i_size - 1);
  127. mark_buffer_dirty(bh);
  128. if (wbc->sync_mode == WB_SYNC_ALL) {
  129. sync_dirty_buffer(bh);
  130. if (buffer_req(bh) && !buffer_uptodate(bh))
  131. err = -EIO;
  132. }
  133. brelse(bh);
  134. mutex_unlock(&info->bfs_lock);
  135. return err;
  136. }
  137. static void bfs_evict_inode(struct inode *inode)
  138. {
  139. unsigned long ino = inode->i_ino;
  140. struct bfs_inode *di;
  141. struct buffer_head *bh;
  142. struct super_block *s = inode->i_sb;
  143. struct bfs_sb_info *info = BFS_SB(s);
  144. struct bfs_inode_info *bi = BFS_I(inode);
  145. dprintf("ino=%08lx\n", ino);
  146. truncate_inode_pages_final(&inode->i_data);
  147. invalidate_inode_buffers(inode);
  148. clear_inode(inode);
  149. if (inode->i_nlink)
  150. return;
  151. di = find_inode(s, inode->i_ino, &bh);
  152. if (IS_ERR(di))
  153. return;
  154. mutex_lock(&info->bfs_lock);
  155. /* clear on-disk inode */
  156. memset(di, 0, sizeof(struct bfs_inode));
  157. mark_buffer_dirty(bh);
  158. brelse(bh);
  159. if (bi->i_dsk_ino) {
  160. if (bi->i_sblock)
  161. info->si_freeb += bi->i_eblock + 1 - bi->i_sblock;
  162. info->si_freei++;
  163. clear_bit(ino, info->si_imap);
  164. bfs_dump_imap("delete_inode", s);
  165. }
  166. /*
  167. * If this was the last file, make the previous block
  168. * "last block of the last file" even if there is no
  169. * real file there, saves us 1 gap.
  170. */
  171. if (info->si_lf_eblk == bi->i_eblock)
  172. info->si_lf_eblk = bi->i_sblock - 1;
  173. mutex_unlock(&info->bfs_lock);
  174. }
  175. static void bfs_put_super(struct super_block *s)
  176. {
  177. struct bfs_sb_info *info = BFS_SB(s);
  178. if (!info)
  179. return;
  180. mutex_destroy(&info->bfs_lock);
  181. kfree(info->si_imap);
  182. kfree(info);
  183. s->s_fs_info = NULL;
  184. }
  185. static int bfs_statfs(struct dentry *dentry, struct kstatfs *buf)
  186. {
  187. struct super_block *s = dentry->d_sb;
  188. struct bfs_sb_info *info = BFS_SB(s);
  189. u64 id = huge_encode_dev(s->s_bdev->bd_dev);
  190. buf->f_type = BFS_MAGIC;
  191. buf->f_bsize = s->s_blocksize;
  192. buf->f_blocks = info->si_blocks;
  193. buf->f_bfree = buf->f_bavail = info->si_freeb;
  194. buf->f_files = info->si_lasti + 1 - BFS_ROOT_INO;
  195. buf->f_ffree = info->si_freei;
  196. buf->f_fsid.val[0] = (u32)id;
  197. buf->f_fsid.val[1] = (u32)(id >> 32);
  198. buf->f_namelen = BFS_NAMELEN;
  199. return 0;
  200. }
  201. static struct kmem_cache *bfs_inode_cachep;
  202. static struct inode *bfs_alloc_inode(struct super_block *sb)
  203. {
  204. struct bfs_inode_info *bi;
  205. bi = kmem_cache_alloc(bfs_inode_cachep, GFP_KERNEL);
  206. if (!bi)
  207. return NULL;
  208. return &bi->vfs_inode;
  209. }
  210. static void bfs_i_callback(struct rcu_head *head)
  211. {
  212. struct inode *inode = container_of(head, struct inode, i_rcu);
  213. kmem_cache_free(bfs_inode_cachep, BFS_I(inode));
  214. }
  215. static void bfs_destroy_inode(struct inode *inode)
  216. {
  217. call_rcu(&inode->i_rcu, bfs_i_callback);
  218. }
  219. static void init_once(void *foo)
  220. {
  221. struct bfs_inode_info *bi = foo;
  222. inode_init_once(&bi->vfs_inode);
  223. }
  224. static int __init init_inodecache(void)
  225. {
  226. bfs_inode_cachep = kmem_cache_create("bfs_inode_cache",
  227. sizeof(struct bfs_inode_info),
  228. 0, (SLAB_RECLAIM_ACCOUNT|
  229. SLAB_MEM_SPREAD),
  230. init_once);
  231. if (bfs_inode_cachep == NULL)
  232. return -ENOMEM;
  233. return 0;
  234. }
  235. static void destroy_inodecache(void)
  236. {
  237. /*
  238. * Make sure all delayed rcu free inodes are flushed before we
  239. * destroy cache.
  240. */
  241. rcu_barrier();
  242. kmem_cache_destroy(bfs_inode_cachep);
  243. }
  244. static const struct super_operations bfs_sops = {
  245. .alloc_inode = bfs_alloc_inode,
  246. .destroy_inode = bfs_destroy_inode,
  247. .write_inode = bfs_write_inode,
  248. .evict_inode = bfs_evict_inode,
  249. .put_super = bfs_put_super,
  250. .statfs = bfs_statfs,
  251. };
  252. void bfs_dump_imap(const char *prefix, struct super_block *s)
  253. {
  254. #ifdef DEBUG
  255. int i;
  256. char *tmpbuf = (char *)get_zeroed_page(GFP_KERNEL);
  257. if (!tmpbuf)
  258. return;
  259. for (i = BFS_SB(s)->si_lasti; i >= 0; i--) {
  260. if (i > PAGE_SIZE - 100) break;
  261. if (test_bit(i, BFS_SB(s)->si_imap))
  262. strcat(tmpbuf, "1");
  263. else
  264. strcat(tmpbuf, "0");
  265. }
  266. printf("BFS-fs: %s: lasti=%08lx <%s>\n",
  267. prefix, BFS_SB(s)->si_lasti, tmpbuf);
  268. free_page((unsigned long)tmpbuf);
  269. #endif
  270. }
  271. static int bfs_fill_super(struct super_block *s, void *data, int silent)
  272. {
  273. struct buffer_head *bh, *sbh;
  274. struct bfs_super_block *bfs_sb;
  275. struct inode *inode;
  276. unsigned i, imap_len;
  277. struct bfs_sb_info *info;
  278. int ret = -EINVAL;
  279. unsigned long i_sblock, i_eblock, i_eoff, s_size;
  280. info = kzalloc(sizeof(*info), GFP_KERNEL);
  281. if (!info)
  282. return -ENOMEM;
  283. mutex_init(&info->bfs_lock);
  284. s->s_fs_info = info;
  285. sb_set_blocksize(s, BFS_BSIZE);
  286. sbh = sb_bread(s, 0);
  287. if (!sbh)
  288. goto out;
  289. bfs_sb = (struct bfs_super_block *)sbh->b_data;
  290. if (le32_to_cpu(bfs_sb->s_magic) != BFS_MAGIC) {
  291. if (!silent)
  292. printf("No BFS filesystem on %s (magic=%08x)\n",
  293. s->s_id, le32_to_cpu(bfs_sb->s_magic));
  294. goto out1;
  295. }
  296. if (BFS_UNCLEAN(bfs_sb, s) && !silent)
  297. printf("%s is unclean, continuing\n", s->s_id);
  298. s->s_magic = BFS_MAGIC;
  299. if (le32_to_cpu(bfs_sb->s_start) > le32_to_cpu(bfs_sb->s_end)) {
  300. printf("Superblock is corrupted\n");
  301. goto out1;
  302. }
  303. info->si_lasti = (le32_to_cpu(bfs_sb->s_start) - BFS_BSIZE) /
  304. sizeof(struct bfs_inode)
  305. + BFS_ROOT_INO - 1;
  306. imap_len = (info->si_lasti / 8) + 1;
  307. info->si_imap = kzalloc(imap_len, GFP_KERNEL);
  308. if (!info->si_imap)
  309. goto out1;
  310. for (i = 0; i < BFS_ROOT_INO; i++)
  311. set_bit(i, info->si_imap);
  312. s->s_op = &bfs_sops;
  313. inode = bfs_iget(s, BFS_ROOT_INO);
  314. if (IS_ERR(inode)) {
  315. ret = PTR_ERR(inode);
  316. goto out2;
  317. }
  318. s->s_root = d_make_root(inode);
  319. if (!s->s_root) {
  320. ret = -ENOMEM;
  321. goto out2;
  322. }
  323. info->si_blocks = (le32_to_cpu(bfs_sb->s_end) + 1) >> BFS_BSIZE_BITS;
  324. info->si_freeb = (le32_to_cpu(bfs_sb->s_end) + 1
  325. - le32_to_cpu(bfs_sb->s_start)) >> BFS_BSIZE_BITS;
  326. info->si_freei = 0;
  327. info->si_lf_eblk = 0;
  328. /* can we read the last block? */
  329. bh = sb_bread(s, info->si_blocks - 1);
  330. if (!bh) {
  331. printf("Last block not available: %lu\n", info->si_blocks - 1);
  332. ret = -EIO;
  333. goto out3;
  334. }
  335. brelse(bh);
  336. bh = NULL;
  337. for (i = BFS_ROOT_INO; i <= info->si_lasti; i++) {
  338. struct bfs_inode *di;
  339. int block = (i - BFS_ROOT_INO) / BFS_INODES_PER_BLOCK + 1;
  340. int off = (i - BFS_ROOT_INO) % BFS_INODES_PER_BLOCK;
  341. unsigned long eblock;
  342. if (!off) {
  343. brelse(bh);
  344. bh = sb_bread(s, block);
  345. }
  346. if (!bh)
  347. continue;
  348. di = (struct bfs_inode *)bh->b_data + off;
  349. /* test if filesystem is not corrupted */
  350. i_eoff = le32_to_cpu(di->i_eoffset);
  351. i_sblock = le32_to_cpu(di->i_sblock);
  352. i_eblock = le32_to_cpu(di->i_eblock);
  353. s_size = le32_to_cpu(bfs_sb->s_end);
  354. if (i_sblock > info->si_blocks ||
  355. i_eblock > info->si_blocks ||
  356. i_sblock > i_eblock ||
  357. i_eoff > s_size ||
  358. i_sblock * BFS_BSIZE > i_eoff) {
  359. printf("Inode 0x%08x corrupted\n", i);
  360. brelse(bh);
  361. ret = -EIO;
  362. goto out3;
  363. }
  364. if (!di->i_ino) {
  365. info->si_freei++;
  366. continue;
  367. }
  368. set_bit(i, info->si_imap);
  369. info->si_freeb -= BFS_FILEBLOCKS(di);
  370. eblock = le32_to_cpu(di->i_eblock);
  371. if (eblock > info->si_lf_eblk)
  372. info->si_lf_eblk = eblock;
  373. }
  374. brelse(bh);
  375. brelse(sbh);
  376. bfs_dump_imap("read_super", s);
  377. return 0;
  378. out3:
  379. dput(s->s_root);
  380. s->s_root = NULL;
  381. out2:
  382. kfree(info->si_imap);
  383. out1:
  384. brelse(sbh);
  385. out:
  386. mutex_destroy(&info->bfs_lock);
  387. kfree(info);
  388. s->s_fs_info = NULL;
  389. return ret;
  390. }
  391. static struct dentry *bfs_mount(struct file_system_type *fs_type,
  392. int flags, const char *dev_name, void *data)
  393. {
  394. return mount_bdev(fs_type, flags, dev_name, data, bfs_fill_super);
  395. }
  396. static struct file_system_type bfs_fs_type = {
  397. .owner = THIS_MODULE,
  398. .name = "bfs",
  399. .mount = bfs_mount,
  400. .kill_sb = kill_block_super,
  401. .fs_flags = FS_REQUIRES_DEV,
  402. };
  403. MODULE_ALIAS_FS("bfs");
  404. static int __init init_bfs_fs(void)
  405. {
  406. int err = init_inodecache();
  407. if (err)
  408. goto out1;
  409. err = register_filesystem(&bfs_fs_type);
  410. if (err)
  411. goto out;
  412. return 0;
  413. out:
  414. destroy_inodecache();
  415. out1:
  416. return err;
  417. }
  418. static void __exit exit_bfs_fs(void)
  419. {
  420. unregister_filesystem(&bfs_fs_type);
  421. destroy_inodecache();
  422. }
  423. module_init(init_bfs_fs)
  424. module_exit(exit_bfs_fs)