inode.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446
  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. static void bfs_read_inode(struct inode *inode)
  30. {
  31. unsigned long ino = inode->i_ino;
  32. struct bfs_inode *di;
  33. struct buffer_head *bh;
  34. int block, off;
  35. if ((ino < BFS_ROOT_INO) || (ino > BFS_SB(inode->i_sb)->si_lasti)) {
  36. printf("Bad inode number %s:%08lx\n", inode->i_sb->s_id, ino);
  37. make_bad_inode(inode);
  38. return;
  39. }
  40. block = (ino - BFS_ROOT_INO) / BFS_INODES_PER_BLOCK + 1;
  41. bh = sb_bread(inode->i_sb, block);
  42. if (!bh) {
  43. printf("Unable to read inode %s:%08lx\n", inode->i_sb->s_id,
  44. ino);
  45. make_bad_inode(inode);
  46. return;
  47. }
  48. off = (ino - BFS_ROOT_INO) % BFS_INODES_PER_BLOCK;
  49. di = (struct bfs_inode *)bh->b_data + off;
  50. inode->i_mode = 0x0000FFFF & le32_to_cpu(di->i_mode);
  51. if (le32_to_cpu(di->i_vtype) == BFS_VDIR) {
  52. inode->i_mode |= S_IFDIR;
  53. inode->i_op = &bfs_dir_inops;
  54. inode->i_fop = &bfs_dir_operations;
  55. } else if (le32_to_cpu(di->i_vtype) == BFS_VREG) {
  56. inode->i_mode |= S_IFREG;
  57. inode->i_op = &bfs_file_inops;
  58. inode->i_fop = &bfs_file_operations;
  59. inode->i_mapping->a_ops = &bfs_aops;
  60. }
  61. BFS_I(inode)->i_sblock = le32_to_cpu(di->i_sblock);
  62. BFS_I(inode)->i_eblock = le32_to_cpu(di->i_eblock);
  63. BFS_I(inode)->i_dsk_ino = le16_to_cpu(di->i_ino);
  64. inode->i_uid = le32_to_cpu(di->i_uid);
  65. inode->i_gid = le32_to_cpu(di->i_gid);
  66. inode->i_nlink = le32_to_cpu(di->i_nlink);
  67. inode->i_size = BFS_FILESIZE(di);
  68. inode->i_blocks = BFS_FILEBLOCKS(di);
  69. inode->i_atime.tv_sec = le32_to_cpu(di->i_atime);
  70. inode->i_mtime.tv_sec = le32_to_cpu(di->i_mtime);
  71. inode->i_ctime.tv_sec = le32_to_cpu(di->i_ctime);
  72. inode->i_atime.tv_nsec = 0;
  73. inode->i_mtime.tv_nsec = 0;
  74. inode->i_ctime.tv_nsec = 0;
  75. brelse(bh);
  76. }
  77. static int bfs_write_inode(struct inode *inode, int unused)
  78. {
  79. unsigned int ino = (u16)inode->i_ino;
  80. unsigned long i_sblock;
  81. struct bfs_inode *di;
  82. struct buffer_head *bh;
  83. int block, off;
  84. dprintf("ino=%08x\n", ino);
  85. if ((ino < BFS_ROOT_INO) || (ino > BFS_SB(inode->i_sb)->si_lasti)) {
  86. printf("Bad inode number %s:%08x\n", inode->i_sb->s_id, ino);
  87. return -EIO;
  88. }
  89. lock_kernel();
  90. block = (ino - BFS_ROOT_INO) / BFS_INODES_PER_BLOCK + 1;
  91. bh = sb_bread(inode->i_sb, block);
  92. if (!bh) {
  93. printf("Unable to read inode %s:%08x\n",
  94. inode->i_sb->s_id, ino);
  95. unlock_kernel();
  96. return -EIO;
  97. }
  98. off = (ino - BFS_ROOT_INO) % BFS_INODES_PER_BLOCK;
  99. di = (struct bfs_inode *)bh->b_data + off;
  100. if (ino == BFS_ROOT_INO)
  101. di->i_vtype = cpu_to_le32(BFS_VDIR);
  102. else
  103. di->i_vtype = cpu_to_le32(BFS_VREG);
  104. di->i_ino = cpu_to_le16(ino);
  105. di->i_mode = cpu_to_le32(inode->i_mode);
  106. di->i_uid = cpu_to_le32(inode->i_uid);
  107. di->i_gid = cpu_to_le32(inode->i_gid);
  108. di->i_nlink = cpu_to_le32(inode->i_nlink);
  109. di->i_atime = cpu_to_le32(inode->i_atime.tv_sec);
  110. di->i_mtime = cpu_to_le32(inode->i_mtime.tv_sec);
  111. di->i_ctime = cpu_to_le32(inode->i_ctime.tv_sec);
  112. i_sblock = BFS_I(inode)->i_sblock;
  113. di->i_sblock = cpu_to_le32(i_sblock);
  114. di->i_eblock = cpu_to_le32(BFS_I(inode)->i_eblock);
  115. di->i_eoffset = cpu_to_le32(i_sblock * BFS_BSIZE + inode->i_size - 1);
  116. mark_buffer_dirty(bh);
  117. brelse(bh);
  118. unlock_kernel();
  119. return 0;
  120. }
  121. static void bfs_delete_inode(struct inode *inode)
  122. {
  123. unsigned long ino = inode->i_ino;
  124. struct bfs_inode *di;
  125. struct buffer_head *bh;
  126. int block, off;
  127. struct super_block *s = inode->i_sb;
  128. struct bfs_sb_info *info = BFS_SB(s);
  129. struct bfs_inode_info *bi = BFS_I(inode);
  130. dprintf("ino=%08lx\n", ino);
  131. truncate_inode_pages(&inode->i_data, 0);
  132. if ((ino < BFS_ROOT_INO) || (ino > info->si_lasti)) {
  133. printf("invalid ino=%08lx\n", ino);
  134. return;
  135. }
  136. inode->i_size = 0;
  137. inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME_SEC;
  138. lock_kernel();
  139. mark_inode_dirty(inode);
  140. block = (ino - BFS_ROOT_INO) / BFS_INODES_PER_BLOCK + 1;
  141. bh = sb_bread(s, block);
  142. if (!bh) {
  143. printf("Unable to read inode %s:%08lx\n",
  144. inode->i_sb->s_id, ino);
  145. unlock_kernel();
  146. return;
  147. }
  148. off = (ino - BFS_ROOT_INO) % BFS_INODES_PER_BLOCK;
  149. di = (struct bfs_inode *)bh->b_data + off;
  150. memset((void *)di, 0, sizeof(struct bfs_inode));
  151. mark_buffer_dirty(bh);
  152. brelse(bh);
  153. if (bi->i_dsk_ino) {
  154. if (bi->i_sblock)
  155. info->si_freeb += bi->i_eblock + 1 - bi->i_sblock;
  156. info->si_freei++;
  157. clear_bit(ino, info->si_imap);
  158. dump_imap("delete_inode", s);
  159. }
  160. /*
  161. * If this was the last file, make the previous block
  162. * "last block of the last file" even if there is no
  163. * real file there, saves us 1 gap.
  164. */
  165. if (info->si_lf_eblk == bi->i_eblock) {
  166. info->si_lf_eblk = bi->i_sblock - 1;
  167. mark_buffer_dirty(info->si_sbh);
  168. }
  169. unlock_kernel();
  170. clear_inode(inode);
  171. }
  172. static void bfs_put_super(struct super_block *s)
  173. {
  174. struct bfs_sb_info *info = BFS_SB(s);
  175. brelse(info->si_sbh);
  176. kfree(info->si_imap);
  177. kfree(info);
  178. s->s_fs_info = NULL;
  179. }
  180. static int bfs_statfs(struct dentry *dentry, struct kstatfs *buf)
  181. {
  182. struct super_block *s = dentry->d_sb;
  183. struct bfs_sb_info *info = BFS_SB(s);
  184. u64 id = huge_encode_dev(s->s_bdev->bd_dev);
  185. buf->f_type = BFS_MAGIC;
  186. buf->f_bsize = s->s_blocksize;
  187. buf->f_blocks = info->si_blocks;
  188. buf->f_bfree = buf->f_bavail = info->si_freeb;
  189. buf->f_files = info->si_lasti + 1 - BFS_ROOT_INO;
  190. buf->f_ffree = info->si_freei;
  191. buf->f_fsid.val[0] = (u32)id;
  192. buf->f_fsid.val[1] = (u32)(id >> 32);
  193. buf->f_namelen = BFS_NAMELEN;
  194. return 0;
  195. }
  196. static void bfs_write_super(struct super_block *s)
  197. {
  198. lock_kernel();
  199. if (!(s->s_flags & MS_RDONLY))
  200. mark_buffer_dirty(BFS_SB(s)->si_sbh);
  201. s->s_dirt = 0;
  202. unlock_kernel();
  203. }
  204. static struct kmem_cache *bfs_inode_cachep;
  205. static struct inode *bfs_alloc_inode(struct super_block *sb)
  206. {
  207. struct bfs_inode_info *bi;
  208. bi = kmem_cache_alloc(bfs_inode_cachep, GFP_KERNEL);
  209. if (!bi)
  210. return NULL;
  211. return &bi->vfs_inode;
  212. }
  213. static void bfs_destroy_inode(struct inode *inode)
  214. {
  215. kmem_cache_free(bfs_inode_cachep, BFS_I(inode));
  216. }
  217. static void init_once(struct kmem_cache *cachep, void *foo)
  218. {
  219. struct bfs_inode_info *bi = foo;
  220. inode_init_once(&bi->vfs_inode);
  221. }
  222. static int init_inodecache(void)
  223. {
  224. bfs_inode_cachep = kmem_cache_create("bfs_inode_cache",
  225. sizeof(struct bfs_inode_info),
  226. 0, (SLAB_RECLAIM_ACCOUNT|
  227. SLAB_MEM_SPREAD),
  228. init_once);
  229. if (bfs_inode_cachep == NULL)
  230. return -ENOMEM;
  231. return 0;
  232. }
  233. static void destroy_inodecache(void)
  234. {
  235. kmem_cache_destroy(bfs_inode_cachep);
  236. }
  237. static const struct super_operations bfs_sops = {
  238. .alloc_inode = bfs_alloc_inode,
  239. .destroy_inode = bfs_destroy_inode,
  240. .read_inode = bfs_read_inode,
  241. .write_inode = bfs_write_inode,
  242. .delete_inode = bfs_delete_inode,
  243. .put_super = bfs_put_super,
  244. .write_super = bfs_write_super,
  245. .statfs = bfs_statfs,
  246. };
  247. void dump_imap(const char *prefix, struct super_block *s)
  248. {
  249. #ifdef DEBUG
  250. int i;
  251. char *tmpbuf = (char *)get_zeroed_page(GFP_KERNEL);
  252. if (!tmpbuf)
  253. return;
  254. for (i = BFS_SB(s)->si_lasti; i >= 0; i--) {
  255. if (i > PAGE_SIZE - 100) break;
  256. if (test_bit(i, BFS_SB(s)->si_imap))
  257. strcat(tmpbuf, "1");
  258. else
  259. strcat(tmpbuf, "0");
  260. }
  261. printf("BFS-fs: %s: lasti=%08lx <%s>\n",
  262. prefix, BFS_SB(s)->si_lasti, tmpbuf);
  263. free_page((unsigned long)tmpbuf);
  264. #endif
  265. }
  266. static int bfs_fill_super(struct super_block *s, void *data, int silent)
  267. {
  268. struct buffer_head *bh;
  269. struct bfs_super_block *bfs_sb;
  270. struct inode *inode;
  271. unsigned i, imap_len;
  272. struct bfs_sb_info *info;
  273. info = kzalloc(sizeof(*info), GFP_KERNEL);
  274. if (!info)
  275. return -ENOMEM;
  276. s->s_fs_info = info;
  277. sb_set_blocksize(s, BFS_BSIZE);
  278. bh = sb_bread(s, 0);
  279. if(!bh)
  280. goto out;
  281. bfs_sb = (struct bfs_super_block *)bh->b_data;
  282. if (le32_to_cpu(bfs_sb->s_magic) != BFS_MAGIC) {
  283. if (!silent)
  284. printf("No BFS filesystem on %s (magic=%08x)\n",
  285. s->s_id, le32_to_cpu(bfs_sb->s_magic));
  286. goto out;
  287. }
  288. if (BFS_UNCLEAN(bfs_sb, s) && !silent)
  289. printf("%s is unclean, continuing\n", s->s_id);
  290. s->s_magic = BFS_MAGIC;
  291. info->si_sbh = bh;
  292. info->si_lasti = (le32_to_cpu(bfs_sb->s_start) - BFS_BSIZE) /
  293. sizeof(struct bfs_inode)
  294. + BFS_ROOT_INO - 1;
  295. imap_len = (info->si_lasti / 8) + 1;
  296. info->si_imap = kzalloc(imap_len, GFP_KERNEL);
  297. if (!info->si_imap)
  298. goto out;
  299. for (i = 0; i < BFS_ROOT_INO; i++)
  300. set_bit(i, info->si_imap);
  301. s->s_op = &bfs_sops;
  302. inode = iget(s, BFS_ROOT_INO);
  303. if (!inode) {
  304. kfree(info->si_imap);
  305. goto out;
  306. }
  307. s->s_root = d_alloc_root(inode);
  308. if (!s->s_root) {
  309. iput(inode);
  310. kfree(info->si_imap);
  311. goto out;
  312. }
  313. info->si_blocks = (le32_to_cpu(bfs_sb->s_end) + 1) >> BFS_BSIZE_BITS;
  314. info->si_freeb = (le32_to_cpu(bfs_sb->s_end) + 1
  315. - le32_to_cpu(bfs_sb->s_start)) >> BFS_BSIZE_BITS;
  316. info->si_freei = 0;
  317. info->si_lf_eblk = 0;
  318. bh = NULL;
  319. for (i = BFS_ROOT_INO; i <= info->si_lasti; i++) {
  320. struct bfs_inode *di;
  321. int block = (i - BFS_ROOT_INO) / BFS_INODES_PER_BLOCK + 1;
  322. int off = (i - BFS_ROOT_INO) % BFS_INODES_PER_BLOCK;
  323. unsigned long sblock, eblock;
  324. if (!off) {
  325. brelse(bh);
  326. bh = sb_bread(s, block);
  327. }
  328. if (!bh)
  329. continue;
  330. di = (struct bfs_inode *)bh->b_data + off;
  331. if (!di->i_ino) {
  332. info->si_freei++;
  333. continue;
  334. }
  335. set_bit(i, info->si_imap);
  336. info->si_freeb -= BFS_FILEBLOCKS(di);
  337. sblock = le32_to_cpu(di->i_sblock);
  338. eblock = le32_to_cpu(di->i_eblock);
  339. if (eblock > info->si_lf_eblk)
  340. info->si_lf_eblk = eblock;
  341. }
  342. brelse(bh);
  343. if (!(s->s_flags & MS_RDONLY)) {
  344. mark_buffer_dirty(info->si_sbh);
  345. s->s_dirt = 1;
  346. }
  347. dump_imap("read_super", s);
  348. return 0;
  349. out:
  350. brelse(bh);
  351. kfree(info);
  352. s->s_fs_info = NULL;
  353. return -EINVAL;
  354. }
  355. static int bfs_get_sb(struct file_system_type *fs_type,
  356. int flags, const char *dev_name, void *data, struct vfsmount *mnt)
  357. {
  358. return get_sb_bdev(fs_type, flags, dev_name, data, bfs_fill_super, mnt);
  359. }
  360. static struct file_system_type bfs_fs_type = {
  361. .owner = THIS_MODULE,
  362. .name = "bfs",
  363. .get_sb = bfs_get_sb,
  364. .kill_sb = kill_block_super,
  365. .fs_flags = FS_REQUIRES_DEV,
  366. };
  367. static int __init init_bfs_fs(void)
  368. {
  369. int err = init_inodecache();
  370. if (err)
  371. goto out1;
  372. err = register_filesystem(&bfs_fs_type);
  373. if (err)
  374. goto out;
  375. return 0;
  376. out:
  377. destroy_inodecache();
  378. out1:
  379. return err;
  380. }
  381. static void __exit exit_bfs_fs(void)
  382. {
  383. unregister_filesystem(&bfs_fs_type);
  384. destroy_inodecache();
  385. }
  386. module_init(init_bfs_fs)
  387. module_exit(exit_bfs_fs)