super.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509
  1. /*
  2. * linux/fs/adfs/super.c
  3. *
  4. * Copyright (C) 1997-1999 Russell King
  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 version 2 as
  8. * published by the Free Software Foundation.
  9. */
  10. #include <linux/module.h>
  11. #include <linux/errno.h>
  12. #include <linux/fs.h>
  13. #include <linux/adfs_fs.h>
  14. #include <linux/slab.h>
  15. #include <linux/time.h>
  16. #include <linux/stat.h>
  17. #include <linux/string.h>
  18. #include <linux/init.h>
  19. #include <linux/buffer_head.h>
  20. #include <linux/vfs.h>
  21. #include <linux/parser.h>
  22. #include <linux/bitops.h>
  23. #include <asm/uaccess.h>
  24. #include <asm/system.h>
  25. #include <stdarg.h>
  26. #include "adfs.h"
  27. #include "dir_f.h"
  28. #include "dir_fplus.h"
  29. void __adfs_error(struct super_block *sb, const char *function, const char *fmt, ...)
  30. {
  31. char error_buf[128];
  32. va_list args;
  33. va_start(args, fmt);
  34. vsprintf(error_buf, fmt, args);
  35. va_end(args);
  36. printk(KERN_CRIT "ADFS-fs error (device %s)%s%s: %s\n",
  37. sb->s_id, function ? ": " : "",
  38. function ? function : "", error_buf);
  39. }
  40. static int adfs_checkdiscrecord(struct adfs_discrecord *dr)
  41. {
  42. int i;
  43. /* sector size must be 256, 512 or 1024 bytes */
  44. if (dr->log2secsize != 8 &&
  45. dr->log2secsize != 9 &&
  46. dr->log2secsize != 10)
  47. return 1;
  48. /* idlen must be at least log2secsize + 3 */
  49. if (dr->idlen < dr->log2secsize + 3)
  50. return 1;
  51. /* we cannot have such a large disc that we
  52. * are unable to represent sector offsets in
  53. * 32 bits. This works out at 2.0 TB.
  54. */
  55. if (le32_to_cpu(dr->disc_size_high) >> dr->log2secsize)
  56. return 1;
  57. /* idlen must be no greater than 19 v2 [1.0] */
  58. if (dr->idlen > 19)
  59. return 1;
  60. /* reserved bytes should be zero */
  61. for (i = 0; i < sizeof(dr->unused52); i++)
  62. if (dr->unused52[i] != 0)
  63. return 1;
  64. return 0;
  65. }
  66. static unsigned char adfs_calczonecheck(struct super_block *sb, unsigned char *map)
  67. {
  68. unsigned int v0, v1, v2, v3;
  69. int i;
  70. v0 = v1 = v2 = v3 = 0;
  71. for (i = sb->s_blocksize - 4; i; i -= 4) {
  72. v0 += map[i] + (v3 >> 8);
  73. v3 &= 0xff;
  74. v1 += map[i + 1] + (v0 >> 8);
  75. v0 &= 0xff;
  76. v2 += map[i + 2] + (v1 >> 8);
  77. v1 &= 0xff;
  78. v3 += map[i + 3] + (v2 >> 8);
  79. v2 &= 0xff;
  80. }
  81. v0 += v3 >> 8;
  82. v1 += map[1] + (v0 >> 8);
  83. v2 += map[2] + (v1 >> 8);
  84. v3 += map[3] + (v2 >> 8);
  85. return v0 ^ v1 ^ v2 ^ v3;
  86. }
  87. static int adfs_checkmap(struct super_block *sb, struct adfs_discmap *dm)
  88. {
  89. unsigned char crosscheck = 0, zonecheck = 1;
  90. int i;
  91. for (i = 0; i < ADFS_SB(sb)->s_map_size; i++) {
  92. unsigned char *map;
  93. map = dm[i].dm_bh->b_data;
  94. if (adfs_calczonecheck(sb, map) != map[0]) {
  95. adfs_error(sb, "zone %d fails zonecheck", i);
  96. zonecheck = 0;
  97. }
  98. crosscheck ^= map[3];
  99. }
  100. if (crosscheck != 0xff)
  101. adfs_error(sb, "crosscheck != 0xff");
  102. return crosscheck == 0xff && zonecheck;
  103. }
  104. static void adfs_put_super(struct super_block *sb)
  105. {
  106. int i;
  107. struct adfs_sb_info *asb = ADFS_SB(sb);
  108. for (i = 0; i < asb->s_map_size; i++)
  109. brelse(asb->s_map[i].dm_bh);
  110. kfree(asb->s_map);
  111. kfree(asb);
  112. sb->s_fs_info = NULL;
  113. }
  114. enum {Opt_uid, Opt_gid, Opt_ownmask, Opt_othmask, Opt_err};
  115. static match_table_t tokens = {
  116. {Opt_uid, "uid=%u"},
  117. {Opt_gid, "gid=%u"},
  118. {Opt_ownmask, "ownmask=%o"},
  119. {Opt_othmask, "othmask=%o"},
  120. {Opt_err, NULL}
  121. };
  122. static int parse_options(struct super_block *sb, char *options)
  123. {
  124. char *p;
  125. struct adfs_sb_info *asb = ADFS_SB(sb);
  126. int option;
  127. if (!options)
  128. return 0;
  129. while ((p = strsep(&options, ",")) != NULL) {
  130. substring_t args[MAX_OPT_ARGS];
  131. int token;
  132. if (!*p)
  133. continue;
  134. token = match_token(p, tokens, args);
  135. switch (token) {
  136. case Opt_uid:
  137. if (match_int(args, &option))
  138. return -EINVAL;
  139. asb->s_uid = option;
  140. break;
  141. case Opt_gid:
  142. if (match_int(args, &option))
  143. return -EINVAL;
  144. asb->s_gid = option;
  145. break;
  146. case Opt_ownmask:
  147. if (match_octal(args, &option))
  148. return -EINVAL;
  149. asb->s_owner_mask = option;
  150. break;
  151. case Opt_othmask:
  152. if (match_octal(args, &option))
  153. return -EINVAL;
  154. asb->s_other_mask = option;
  155. break;
  156. default:
  157. printk("ADFS-fs: unrecognised mount option \"%s\" "
  158. "or missing value\n", p);
  159. return -EINVAL;
  160. }
  161. }
  162. return 0;
  163. }
  164. static int adfs_remount(struct super_block *sb, int *flags, char *data)
  165. {
  166. *flags |= MS_NODIRATIME;
  167. return parse_options(sb, data);
  168. }
  169. static int adfs_statfs(struct super_block *sb, struct kstatfs *buf)
  170. {
  171. struct adfs_sb_info *asb = ADFS_SB(sb);
  172. buf->f_type = ADFS_SUPER_MAGIC;
  173. buf->f_namelen = asb->s_namelen;
  174. buf->f_bsize = sb->s_blocksize;
  175. buf->f_blocks = asb->s_size;
  176. buf->f_files = asb->s_ids_per_zone * asb->s_map_size;
  177. buf->f_bavail =
  178. buf->f_bfree = adfs_map_free(sb);
  179. buf->f_ffree = (long)(buf->f_bfree * buf->f_files) / (long)buf->f_blocks;
  180. return 0;
  181. }
  182. static kmem_cache_t *adfs_inode_cachep;
  183. static struct inode *adfs_alloc_inode(struct super_block *sb)
  184. {
  185. struct adfs_inode_info *ei;
  186. ei = (struct adfs_inode_info *)kmem_cache_alloc(adfs_inode_cachep, SLAB_KERNEL);
  187. if (!ei)
  188. return NULL;
  189. return &ei->vfs_inode;
  190. }
  191. static void adfs_destroy_inode(struct inode *inode)
  192. {
  193. kmem_cache_free(adfs_inode_cachep, ADFS_I(inode));
  194. }
  195. static void init_once(void * foo, kmem_cache_t * cachep, unsigned long flags)
  196. {
  197. struct adfs_inode_info *ei = (struct adfs_inode_info *) foo;
  198. if ((flags & (SLAB_CTOR_VERIFY|SLAB_CTOR_CONSTRUCTOR)) ==
  199. SLAB_CTOR_CONSTRUCTOR)
  200. inode_init_once(&ei->vfs_inode);
  201. }
  202. static int init_inodecache(void)
  203. {
  204. adfs_inode_cachep = kmem_cache_create("adfs_inode_cache",
  205. sizeof(struct adfs_inode_info),
  206. 0, (SLAB_RECLAIM_ACCOUNT|
  207. SLAB_MEM_SPREAD),
  208. init_once, NULL);
  209. if (adfs_inode_cachep == NULL)
  210. return -ENOMEM;
  211. return 0;
  212. }
  213. static void destroy_inodecache(void)
  214. {
  215. if (kmem_cache_destroy(adfs_inode_cachep))
  216. printk(KERN_INFO "adfs_inode_cache: not all structures were freed\n");
  217. }
  218. static struct super_operations adfs_sops = {
  219. .alloc_inode = adfs_alloc_inode,
  220. .destroy_inode = adfs_destroy_inode,
  221. .write_inode = adfs_write_inode,
  222. .put_super = adfs_put_super,
  223. .statfs = adfs_statfs,
  224. .remount_fs = adfs_remount,
  225. };
  226. static struct adfs_discmap *adfs_read_map(struct super_block *sb, struct adfs_discrecord *dr)
  227. {
  228. struct adfs_discmap *dm;
  229. unsigned int map_addr, zone_size, nzones;
  230. int i, zone;
  231. struct adfs_sb_info *asb = ADFS_SB(sb);
  232. nzones = asb->s_map_size;
  233. zone_size = (8 << dr->log2secsize) - le16_to_cpu(dr->zone_spare);
  234. map_addr = (nzones >> 1) * zone_size -
  235. ((nzones > 1) ? ADFS_DR_SIZE_BITS : 0);
  236. map_addr = signed_asl(map_addr, asb->s_map2blk);
  237. asb->s_ids_per_zone = zone_size / (asb->s_idlen + 1);
  238. dm = kmalloc(nzones * sizeof(*dm), GFP_KERNEL);
  239. if (dm == NULL) {
  240. adfs_error(sb, "not enough memory");
  241. return NULL;
  242. }
  243. for (zone = 0; zone < nzones; zone++, map_addr++) {
  244. dm[zone].dm_startbit = 0;
  245. dm[zone].dm_endbit = zone_size;
  246. dm[zone].dm_startblk = zone * zone_size - ADFS_DR_SIZE_BITS;
  247. dm[zone].dm_bh = sb_bread(sb, map_addr);
  248. if (!dm[zone].dm_bh) {
  249. adfs_error(sb, "unable to read map");
  250. goto error_free;
  251. }
  252. }
  253. /* adjust the limits for the first and last map zones */
  254. i = zone - 1;
  255. dm[0].dm_startblk = 0;
  256. dm[0].dm_startbit = ADFS_DR_SIZE_BITS;
  257. dm[i].dm_endbit = (le32_to_cpu(dr->disc_size_high) << (32 - dr->log2bpmb)) +
  258. (le32_to_cpu(dr->disc_size) >> dr->log2bpmb) +
  259. (ADFS_DR_SIZE_BITS - i * zone_size);
  260. if (adfs_checkmap(sb, dm))
  261. return dm;
  262. adfs_error(sb, NULL, "map corrupted");
  263. error_free:
  264. while (--zone >= 0)
  265. brelse(dm[zone].dm_bh);
  266. kfree(dm);
  267. return NULL;
  268. }
  269. static inline unsigned long adfs_discsize(struct adfs_discrecord *dr, int block_bits)
  270. {
  271. unsigned long discsize;
  272. discsize = le32_to_cpu(dr->disc_size_high) << (32 - block_bits);
  273. discsize |= le32_to_cpu(dr->disc_size) >> block_bits;
  274. return discsize;
  275. }
  276. static int adfs_fill_super(struct super_block *sb, void *data, int silent)
  277. {
  278. struct adfs_discrecord *dr;
  279. struct buffer_head *bh;
  280. struct object_info root_obj;
  281. unsigned char *b_data;
  282. struct adfs_sb_info *asb;
  283. struct inode *root;
  284. sb->s_flags |= MS_NODIRATIME;
  285. asb = kmalloc(sizeof(*asb), GFP_KERNEL);
  286. if (!asb)
  287. return -ENOMEM;
  288. sb->s_fs_info = asb;
  289. memset(asb, 0, sizeof(*asb));
  290. /* set default options */
  291. asb->s_uid = 0;
  292. asb->s_gid = 0;
  293. asb->s_owner_mask = S_IRWXU;
  294. asb->s_other_mask = S_IRWXG | S_IRWXO;
  295. if (parse_options(sb, data))
  296. goto error;
  297. sb_set_blocksize(sb, BLOCK_SIZE);
  298. if (!(bh = sb_bread(sb, ADFS_DISCRECORD / BLOCK_SIZE))) {
  299. adfs_error(sb, "unable to read superblock");
  300. goto error;
  301. }
  302. b_data = bh->b_data + (ADFS_DISCRECORD % BLOCK_SIZE);
  303. if (adfs_checkbblk(b_data)) {
  304. if (!silent)
  305. printk("VFS: Can't find an adfs filesystem on dev "
  306. "%s.\n", sb->s_id);
  307. goto error_free_bh;
  308. }
  309. dr = (struct adfs_discrecord *)(b_data + ADFS_DR_OFFSET);
  310. /*
  311. * Do some sanity checks on the ADFS disc record
  312. */
  313. if (adfs_checkdiscrecord(dr)) {
  314. if (!silent)
  315. printk("VPS: Can't find an adfs filesystem on dev "
  316. "%s.\n", sb->s_id);
  317. goto error_free_bh;
  318. }
  319. brelse(bh);
  320. if (sb_set_blocksize(sb, 1 << dr->log2secsize)) {
  321. bh = sb_bread(sb, ADFS_DISCRECORD / sb->s_blocksize);
  322. if (!bh) {
  323. adfs_error(sb, "couldn't read superblock on "
  324. "2nd try.");
  325. goto error;
  326. }
  327. b_data = bh->b_data + (ADFS_DISCRECORD % sb->s_blocksize);
  328. if (adfs_checkbblk(b_data)) {
  329. adfs_error(sb, "disc record mismatch, very weird!");
  330. goto error_free_bh;
  331. }
  332. dr = (struct adfs_discrecord *)(b_data + ADFS_DR_OFFSET);
  333. } else {
  334. if (!silent)
  335. printk(KERN_ERR "VFS: Unsupported blocksize on dev "
  336. "%s.\n", sb->s_id);
  337. goto error;
  338. }
  339. /*
  340. * blocksize on this device should now be set to the ADFS log2secsize
  341. */
  342. sb->s_magic = ADFS_SUPER_MAGIC;
  343. asb->s_idlen = dr->idlen;
  344. asb->s_map_size = dr->nzones | (dr->nzones_high << 8);
  345. asb->s_map2blk = dr->log2bpmb - dr->log2secsize;
  346. asb->s_size = adfs_discsize(dr, sb->s_blocksize_bits);
  347. asb->s_version = dr->format_version;
  348. asb->s_log2sharesize = dr->log2sharesize;
  349. asb->s_map = adfs_read_map(sb, dr);
  350. if (!asb->s_map)
  351. goto error_free_bh;
  352. brelse(bh);
  353. /*
  354. * set up enough so that we can read an inode
  355. */
  356. sb->s_op = &adfs_sops;
  357. dr = (struct adfs_discrecord *)(asb->s_map[0].dm_bh->b_data + 4);
  358. root_obj.parent_id = root_obj.file_id = le32_to_cpu(dr->root);
  359. root_obj.name_len = 0;
  360. root_obj.loadaddr = 0;
  361. root_obj.execaddr = 0;
  362. root_obj.size = ADFS_NEWDIR_SIZE;
  363. root_obj.attr = ADFS_NDA_DIRECTORY | ADFS_NDA_OWNER_READ |
  364. ADFS_NDA_OWNER_WRITE | ADFS_NDA_PUBLIC_READ;
  365. /*
  366. * If this is a F+ disk with variable length directories,
  367. * get the root_size from the disc record.
  368. */
  369. if (asb->s_version) {
  370. root_obj.size = le32_to_cpu(dr->root_size);
  371. asb->s_dir = &adfs_fplus_dir_ops;
  372. asb->s_namelen = ADFS_FPLUS_NAME_LEN;
  373. } else {
  374. asb->s_dir = &adfs_f_dir_ops;
  375. asb->s_namelen = ADFS_F_NAME_LEN;
  376. }
  377. root = adfs_iget(sb, &root_obj);
  378. sb->s_root = d_alloc_root(root);
  379. if (!sb->s_root) {
  380. int i;
  381. iput(root);
  382. for (i = 0; i < asb->s_map_size; i++)
  383. brelse(asb->s_map[i].dm_bh);
  384. kfree(asb->s_map);
  385. adfs_error(sb, "get root inode failed\n");
  386. goto error;
  387. } else
  388. sb->s_root->d_op = &adfs_dentry_operations;
  389. return 0;
  390. error_free_bh:
  391. brelse(bh);
  392. error:
  393. sb->s_fs_info = NULL;
  394. kfree(asb);
  395. return -EINVAL;
  396. }
  397. static struct super_block *adfs_get_sb(struct file_system_type *fs_type,
  398. int flags, const char *dev_name, void *data)
  399. {
  400. return get_sb_bdev(fs_type, flags, dev_name, data, adfs_fill_super);
  401. }
  402. static struct file_system_type adfs_fs_type = {
  403. .owner = THIS_MODULE,
  404. .name = "adfs",
  405. .get_sb = adfs_get_sb,
  406. .kill_sb = kill_block_super,
  407. .fs_flags = FS_REQUIRES_DEV,
  408. };
  409. static int __init init_adfs_fs(void)
  410. {
  411. int err = init_inodecache();
  412. if (err)
  413. goto out1;
  414. err = register_filesystem(&adfs_fs_type);
  415. if (err)
  416. goto out;
  417. return 0;
  418. out:
  419. destroy_inodecache();
  420. out1:
  421. return err;
  422. }
  423. static void __exit exit_adfs_fs(void)
  424. {
  425. unregister_filesystem(&adfs_fs_type);
  426. destroy_inodecache();
  427. }
  428. module_init(init_adfs_fs)
  429. module_exit(exit_adfs_fs)