inode.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508
  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/smp_lock.h>
  15. #include <linux/buffer_head.h>
  16. #include <linux/vfs.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. void dump_imap(const char *prefix, struct super_block *s);
  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 (IS_ERR(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. inode->i_uid = le32_to_cpu(di->i_uid);
  68. inode->i_gid = le32_to_cpu(di->i_gid);
  69. inode->i_nlink = 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 int bfs_write_inode(struct inode *inode, int unused)
  86. {
  87. unsigned int ino = (u16)inode->i_ino;
  88. unsigned long i_sblock;
  89. struct bfs_inode *di;
  90. struct buffer_head *bh;
  91. int block, off;
  92. struct bfs_sb_info *info = BFS_SB(inode->i_sb);
  93. dprintf("ino=%08x\n", ino);
  94. if ((ino < BFS_ROOT_INO) || (ino > BFS_SB(inode->i_sb)->si_lasti)) {
  95. printf("Bad inode number %s:%08x\n", inode->i_sb->s_id, ino);
  96. return -EIO;
  97. }
  98. mutex_lock(&info->bfs_lock);
  99. block = (ino - BFS_ROOT_INO) / BFS_INODES_PER_BLOCK + 1;
  100. bh = sb_bread(inode->i_sb, block);
  101. if (!bh) {
  102. printf("Unable to read inode %s:%08x\n",
  103. inode->i_sb->s_id, ino);
  104. mutex_unlock(&info->bfs_lock);
  105. return -EIO;
  106. }
  107. off = (ino - BFS_ROOT_INO) % BFS_INODES_PER_BLOCK;
  108. di = (struct bfs_inode *)bh->b_data + off;
  109. if (ino == BFS_ROOT_INO)
  110. di->i_vtype = cpu_to_le32(BFS_VDIR);
  111. else
  112. di->i_vtype = cpu_to_le32(BFS_VREG);
  113. di->i_ino = cpu_to_le16(ino);
  114. di->i_mode = cpu_to_le32(inode->i_mode);
  115. di->i_uid = cpu_to_le32(inode->i_uid);
  116. di->i_gid = cpu_to_le32(inode->i_gid);
  117. di->i_nlink = cpu_to_le32(inode->i_nlink);
  118. di->i_atime = cpu_to_le32(inode->i_atime.tv_sec);
  119. di->i_mtime = cpu_to_le32(inode->i_mtime.tv_sec);
  120. di->i_ctime = cpu_to_le32(inode->i_ctime.tv_sec);
  121. i_sblock = BFS_I(inode)->i_sblock;
  122. di->i_sblock = cpu_to_le32(i_sblock);
  123. di->i_eblock = cpu_to_le32(BFS_I(inode)->i_eblock);
  124. di->i_eoffset = cpu_to_le32(i_sblock * BFS_BSIZE + inode->i_size - 1);
  125. mark_buffer_dirty(bh);
  126. brelse(bh);
  127. mutex_unlock(&info->bfs_lock);
  128. return 0;
  129. }
  130. static void bfs_delete_inode(struct inode *inode)
  131. {
  132. unsigned long ino = inode->i_ino;
  133. struct bfs_inode *di;
  134. struct buffer_head *bh;
  135. int block, off;
  136. struct super_block *s = inode->i_sb;
  137. struct bfs_sb_info *info = BFS_SB(s);
  138. struct bfs_inode_info *bi = BFS_I(inode);
  139. dprintf("ino=%08lx\n", ino);
  140. truncate_inode_pages(&inode->i_data, 0);
  141. if ((ino < BFS_ROOT_INO) || (ino > info->si_lasti)) {
  142. printf("invalid ino=%08lx\n", ino);
  143. return;
  144. }
  145. inode->i_size = 0;
  146. inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME_SEC;
  147. mutex_lock(&info->bfs_lock);
  148. mark_inode_dirty(inode);
  149. block = (ino - BFS_ROOT_INO) / BFS_INODES_PER_BLOCK + 1;
  150. bh = sb_bread(s, block);
  151. if (!bh) {
  152. printf("Unable to read inode %s:%08lx\n",
  153. inode->i_sb->s_id, ino);
  154. mutex_unlock(&info->bfs_lock);
  155. return;
  156. }
  157. off = (ino - BFS_ROOT_INO) % BFS_INODES_PER_BLOCK;
  158. di = (struct bfs_inode *)bh->b_data + off;
  159. memset((void *)di, 0, sizeof(struct bfs_inode));
  160. mark_buffer_dirty(bh);
  161. brelse(bh);
  162. if (bi->i_dsk_ino) {
  163. if (bi->i_sblock)
  164. info->si_freeb += bi->i_eblock + 1 - bi->i_sblock;
  165. info->si_freei++;
  166. clear_bit(ino, info->si_imap);
  167. dump_imap("delete_inode", s);
  168. }
  169. /*
  170. * If this was the last file, make the previous block
  171. * "last block of the last file" even if there is no
  172. * real file there, saves us 1 gap.
  173. */
  174. if (info->si_lf_eblk == bi->i_eblock) {
  175. info->si_lf_eblk = bi->i_sblock - 1;
  176. mark_buffer_dirty(info->si_sbh);
  177. }
  178. mutex_unlock(&info->bfs_lock);
  179. clear_inode(inode);
  180. }
  181. static void bfs_put_super(struct super_block *s)
  182. {
  183. struct bfs_sb_info *info = BFS_SB(s);
  184. if (!info)
  185. return;
  186. brelse(info->si_sbh);
  187. mutex_destroy(&info->bfs_lock);
  188. kfree(info->si_imap);
  189. kfree(info);
  190. s->s_fs_info = NULL;
  191. }
  192. static int bfs_statfs(struct dentry *dentry, struct kstatfs *buf)
  193. {
  194. struct super_block *s = dentry->d_sb;
  195. struct bfs_sb_info *info = BFS_SB(s);
  196. u64 id = huge_encode_dev(s->s_bdev->bd_dev);
  197. buf->f_type = BFS_MAGIC;
  198. buf->f_bsize = s->s_blocksize;
  199. buf->f_blocks = info->si_blocks;
  200. buf->f_bfree = buf->f_bavail = info->si_freeb;
  201. buf->f_files = info->si_lasti + 1 - BFS_ROOT_INO;
  202. buf->f_ffree = info->si_freei;
  203. buf->f_fsid.val[0] = (u32)id;
  204. buf->f_fsid.val[1] = (u32)(id >> 32);
  205. buf->f_namelen = BFS_NAMELEN;
  206. return 0;
  207. }
  208. static void bfs_write_super(struct super_block *s)
  209. {
  210. struct bfs_sb_info *info = BFS_SB(s);
  211. mutex_lock(&info->bfs_lock);
  212. if (!(s->s_flags & MS_RDONLY))
  213. mark_buffer_dirty(info->si_sbh);
  214. s->s_dirt = 0;
  215. mutex_unlock(&info->bfs_lock);
  216. }
  217. static struct kmem_cache *bfs_inode_cachep;
  218. static struct inode *bfs_alloc_inode(struct super_block *sb)
  219. {
  220. struct bfs_inode_info *bi;
  221. bi = kmem_cache_alloc(bfs_inode_cachep, GFP_KERNEL);
  222. if (!bi)
  223. return NULL;
  224. return &bi->vfs_inode;
  225. }
  226. static void bfs_destroy_inode(struct inode *inode)
  227. {
  228. kmem_cache_free(bfs_inode_cachep, BFS_I(inode));
  229. }
  230. static void init_once(void *foo)
  231. {
  232. struct bfs_inode_info *bi = foo;
  233. inode_init_once(&bi->vfs_inode);
  234. }
  235. static int init_inodecache(void)
  236. {
  237. bfs_inode_cachep = kmem_cache_create("bfs_inode_cache",
  238. sizeof(struct bfs_inode_info),
  239. 0, (SLAB_RECLAIM_ACCOUNT|
  240. SLAB_MEM_SPREAD),
  241. init_once);
  242. if (bfs_inode_cachep == NULL)
  243. return -ENOMEM;
  244. return 0;
  245. }
  246. static void destroy_inodecache(void)
  247. {
  248. kmem_cache_destroy(bfs_inode_cachep);
  249. }
  250. static const struct super_operations bfs_sops = {
  251. .alloc_inode = bfs_alloc_inode,
  252. .destroy_inode = bfs_destroy_inode,
  253. .write_inode = bfs_write_inode,
  254. .delete_inode = bfs_delete_inode,
  255. .put_super = bfs_put_super,
  256. .write_super = bfs_write_super,
  257. .statfs = bfs_statfs,
  258. };
  259. void dump_imap(const char *prefix, struct super_block *s)
  260. {
  261. #ifdef DEBUG
  262. int i;
  263. char *tmpbuf = (char *)get_zeroed_page(GFP_KERNEL);
  264. if (!tmpbuf)
  265. return;
  266. for (i = BFS_SB(s)->si_lasti; i >= 0; i--) {
  267. if (i > PAGE_SIZE - 100) break;
  268. if (test_bit(i, BFS_SB(s)->si_imap))
  269. strcat(tmpbuf, "1");
  270. else
  271. strcat(tmpbuf, "0");
  272. }
  273. printf("BFS-fs: %s: lasti=%08lx <%s>\n",
  274. prefix, BFS_SB(s)->si_lasti, tmpbuf);
  275. free_page((unsigned long)tmpbuf);
  276. #endif
  277. }
  278. static int bfs_fill_super(struct super_block *s, void *data, int silent)
  279. {
  280. struct buffer_head *bh;
  281. struct bfs_super_block *bfs_sb;
  282. struct inode *inode;
  283. unsigned i, imap_len;
  284. struct bfs_sb_info *info;
  285. long ret = -EINVAL;
  286. unsigned long i_sblock, i_eblock, i_eoff, s_size;
  287. info = kzalloc(sizeof(*info), GFP_KERNEL);
  288. if (!info)
  289. return -ENOMEM;
  290. s->s_fs_info = info;
  291. sb_set_blocksize(s, BFS_BSIZE);
  292. bh = sb_bread(s, 0);
  293. if(!bh)
  294. goto out;
  295. bfs_sb = (struct bfs_super_block *)bh->b_data;
  296. if (le32_to_cpu(bfs_sb->s_magic) != BFS_MAGIC) {
  297. if (!silent)
  298. printf("No BFS filesystem on %s (magic=%08x)\n",
  299. s->s_id, le32_to_cpu(bfs_sb->s_magic));
  300. goto out;
  301. }
  302. if (BFS_UNCLEAN(bfs_sb, s) && !silent)
  303. printf("%s is unclean, continuing\n", s->s_id);
  304. s->s_magic = BFS_MAGIC;
  305. info->si_sbh = bh;
  306. if (le32_to_cpu(bfs_sb->s_start) > le32_to_cpu(bfs_sb->s_end)) {
  307. printf("Superblock is corrupted\n");
  308. goto out;
  309. }
  310. info->si_lasti = (le32_to_cpu(bfs_sb->s_start) - BFS_BSIZE) /
  311. sizeof(struct bfs_inode)
  312. + BFS_ROOT_INO - 1;
  313. imap_len = (info->si_lasti / 8) + 1;
  314. info->si_imap = kzalloc(imap_len, GFP_KERNEL);
  315. if (!info->si_imap)
  316. goto out;
  317. for (i = 0; i < BFS_ROOT_INO; i++)
  318. set_bit(i, info->si_imap);
  319. s->s_op = &bfs_sops;
  320. inode = bfs_iget(s, BFS_ROOT_INO);
  321. if (IS_ERR(inode)) {
  322. ret = PTR_ERR(inode);
  323. kfree(info->si_imap);
  324. goto out;
  325. }
  326. s->s_root = d_alloc_root(inode);
  327. if (!s->s_root) {
  328. iput(inode);
  329. ret = -ENOMEM;
  330. kfree(info->si_imap);
  331. goto out;
  332. }
  333. info->si_blocks = (le32_to_cpu(bfs_sb->s_end) + 1) >> BFS_BSIZE_BITS;
  334. info->si_freeb = (le32_to_cpu(bfs_sb->s_end) + 1
  335. - le32_to_cpu(bfs_sb->s_start)) >> BFS_BSIZE_BITS;
  336. info->si_freei = 0;
  337. info->si_lf_eblk = 0;
  338. /* can we read the last block? */
  339. bh = sb_bread(s, info->si_blocks - 1);
  340. if (!bh) {
  341. printf("Last block not available: %lu\n", info->si_blocks - 1);
  342. iput(inode);
  343. ret = -EIO;
  344. kfree(info->si_imap);
  345. goto out;
  346. }
  347. brelse(bh);
  348. bh = NULL;
  349. for (i = BFS_ROOT_INO; i <= info->si_lasti; i++) {
  350. struct bfs_inode *di;
  351. int block = (i - BFS_ROOT_INO) / BFS_INODES_PER_BLOCK + 1;
  352. int off = (i - BFS_ROOT_INO) % BFS_INODES_PER_BLOCK;
  353. unsigned long eblock;
  354. if (!off) {
  355. brelse(bh);
  356. bh = sb_bread(s, block);
  357. }
  358. if (!bh)
  359. continue;
  360. di = (struct bfs_inode *)bh->b_data + off;
  361. /* test if filesystem is not corrupted */
  362. i_eoff = le32_to_cpu(di->i_eoffset);
  363. i_sblock = le32_to_cpu(di->i_sblock);
  364. i_eblock = le32_to_cpu(di->i_eblock);
  365. s_size = le32_to_cpu(bfs_sb->s_end);
  366. if (i_sblock > info->si_blocks ||
  367. i_eblock > info->si_blocks ||
  368. i_sblock > i_eblock ||
  369. i_eoff > s_size ||
  370. i_sblock * BFS_BSIZE > i_eoff) {
  371. printf("Inode 0x%08x corrupted\n", i);
  372. brelse(bh);
  373. s->s_root = NULL;
  374. kfree(info->si_imap);
  375. kfree(info);
  376. s->s_fs_info = NULL;
  377. return -EIO;
  378. }
  379. if (!di->i_ino) {
  380. info->si_freei++;
  381. continue;
  382. }
  383. set_bit(i, info->si_imap);
  384. info->si_freeb -= BFS_FILEBLOCKS(di);
  385. eblock = le32_to_cpu(di->i_eblock);
  386. if (eblock > info->si_lf_eblk)
  387. info->si_lf_eblk = eblock;
  388. }
  389. brelse(bh);
  390. if (!(s->s_flags & MS_RDONLY)) {
  391. mark_buffer_dirty(info->si_sbh);
  392. s->s_dirt = 1;
  393. }
  394. dump_imap("read_super", s);
  395. mutex_init(&info->bfs_lock);
  396. return 0;
  397. out:
  398. brelse(bh);
  399. kfree(info);
  400. s->s_fs_info = NULL;
  401. return ret;
  402. }
  403. static int bfs_get_sb(struct file_system_type *fs_type,
  404. int flags, const char *dev_name, void *data, struct vfsmount *mnt)
  405. {
  406. return get_sb_bdev(fs_type, flags, dev_name, data, bfs_fill_super, mnt);
  407. }
  408. static struct file_system_type bfs_fs_type = {
  409. .owner = THIS_MODULE,
  410. .name = "bfs",
  411. .get_sb = bfs_get_sb,
  412. .kill_sb = kill_block_super,
  413. .fs_flags = FS_REQUIRES_DEV,
  414. };
  415. static int __init init_bfs_fs(void)
  416. {
  417. int err = init_inodecache();
  418. if (err)
  419. goto out1;
  420. err = register_filesystem(&bfs_fs_type);
  421. if (err)
  422. goto out;
  423. return 0;
  424. out:
  425. destroy_inodecache();
  426. out1:
  427. return err;
  428. }
  429. static void __exit exit_bfs_fs(void)
  430. {
  431. unregister_filesystem(&bfs_fs_type);
  432. destroy_inodecache();
  433. }
  434. module_init(init_bfs_fs)
  435. module_exit(exit_bfs_fs)