inode.c 12 KB

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