linuxvfs.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981
  1. /*
  2. * linux/fs/befs/linuxvfs.c
  3. *
  4. * Copyright (C) 2001 Will Dyson <will_dyson@pobox.com
  5. *
  6. */
  7. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  8. #include <linux/module.h>
  9. #include <linux/slab.h>
  10. #include <linux/fs.h>
  11. #include <linux/errno.h>
  12. #include <linux/stat.h>
  13. #include <linux/nls.h>
  14. #include <linux/buffer_head.h>
  15. #include <linux/vfs.h>
  16. #include <linux/parser.h>
  17. #include <linux/namei.h>
  18. #include <linux/sched.h>
  19. #include "befs.h"
  20. #include "btree.h"
  21. #include "inode.h"
  22. #include "datastream.h"
  23. #include "super.h"
  24. #include "io.h"
  25. MODULE_DESCRIPTION("BeOS File System (BeFS) driver");
  26. MODULE_AUTHOR("Will Dyson");
  27. MODULE_LICENSE("GPL");
  28. /* The units the vfs expects inode->i_blocks to be in */
  29. #define VFS_BLOCK_SIZE 512
  30. static int befs_readdir(struct file *, struct dir_context *);
  31. static int befs_get_block(struct inode *, sector_t, struct buffer_head *, int);
  32. static int befs_readpage(struct file *file, struct page *page);
  33. static sector_t befs_bmap(struct address_space *mapping, sector_t block);
  34. static struct dentry *befs_lookup(struct inode *, struct dentry *, unsigned int);
  35. static struct inode *befs_iget(struct super_block *, unsigned long);
  36. static struct inode *befs_alloc_inode(struct super_block *sb);
  37. static void befs_destroy_inode(struct inode *inode);
  38. static void befs_destroy_inodecache(void);
  39. static void *befs_follow_link(struct dentry *, struct nameidata *);
  40. static void *befs_fast_follow_link(struct dentry *, struct nameidata *);
  41. static int befs_utf2nls(struct super_block *sb, const char *in, int in_len,
  42. char **out, int *out_len);
  43. static int befs_nls2utf(struct super_block *sb, const char *in, int in_len,
  44. char **out, int *out_len);
  45. static void befs_put_super(struct super_block *);
  46. static int befs_remount(struct super_block *, int *, char *);
  47. static int befs_statfs(struct dentry *, struct kstatfs *);
  48. static int parse_options(char *, struct befs_mount_options *);
  49. static const struct super_operations befs_sops = {
  50. .alloc_inode = befs_alloc_inode, /* allocate a new inode */
  51. .destroy_inode = befs_destroy_inode, /* deallocate an inode */
  52. .put_super = befs_put_super, /* uninit super */
  53. .statfs = befs_statfs, /* statfs */
  54. .remount_fs = befs_remount,
  55. .show_options = generic_show_options,
  56. };
  57. /* slab cache for befs_inode_info objects */
  58. static struct kmem_cache *befs_inode_cachep;
  59. static const struct file_operations befs_dir_operations = {
  60. .read = generic_read_dir,
  61. .iterate = befs_readdir,
  62. .llseek = generic_file_llseek,
  63. };
  64. static const struct inode_operations befs_dir_inode_operations = {
  65. .lookup = befs_lookup,
  66. };
  67. static const struct address_space_operations befs_aops = {
  68. .readpage = befs_readpage,
  69. .bmap = befs_bmap,
  70. };
  71. static const struct inode_operations befs_fast_symlink_inode_operations = {
  72. .readlink = generic_readlink,
  73. .follow_link = befs_fast_follow_link,
  74. };
  75. static const struct inode_operations befs_symlink_inode_operations = {
  76. .readlink = generic_readlink,
  77. .follow_link = befs_follow_link,
  78. .put_link = kfree_put_link,
  79. };
  80. /*
  81. * Called by generic_file_read() to read a page of data
  82. *
  83. * In turn, simply calls a generic block read function and
  84. * passes it the address of befs_get_block, for mapping file
  85. * positions to disk blocks.
  86. */
  87. static int
  88. befs_readpage(struct file *file, struct page *page)
  89. {
  90. return block_read_full_page(page, befs_get_block);
  91. }
  92. static sector_t
  93. befs_bmap(struct address_space *mapping, sector_t block)
  94. {
  95. return generic_block_bmap(mapping, block, befs_get_block);
  96. }
  97. /*
  98. * Generic function to map a file position (block) to a
  99. * disk offset (passed back in bh_result).
  100. *
  101. * Used by many higher level functions.
  102. *
  103. * Calls befs_fblock2brun() in datastream.c to do the real work.
  104. *
  105. * -WD 10-26-01
  106. */
  107. static int
  108. befs_get_block(struct inode *inode, sector_t block,
  109. struct buffer_head *bh_result, int create)
  110. {
  111. struct super_block *sb = inode->i_sb;
  112. befs_data_stream *ds = &BEFS_I(inode)->i_data.ds;
  113. befs_block_run run = BAD_IADDR;
  114. int res = 0;
  115. ulong disk_off;
  116. befs_debug(sb, "---> befs_get_block() for inode %lu, block %ld",
  117. (unsigned long)inode->i_ino, (long)block);
  118. if (create) {
  119. befs_error(sb, "befs_get_block() was asked to write to "
  120. "block %ld in inode %lu", (long)block,
  121. (unsigned long)inode->i_ino);
  122. return -EPERM;
  123. }
  124. res = befs_fblock2brun(sb, ds, block, &run);
  125. if (res != BEFS_OK) {
  126. befs_error(sb,
  127. "<--- %s for inode %lu, block %ld ERROR",
  128. __func__, (unsigned long)inode->i_ino,
  129. (long)block);
  130. return -EFBIG;
  131. }
  132. disk_off = (ulong) iaddr2blockno(sb, &run);
  133. map_bh(bh_result, inode->i_sb, disk_off);
  134. befs_debug(sb, "<--- %s for inode %lu, block %ld, disk address %lu",
  135. __func__, (unsigned long)inode->i_ino, (long)block,
  136. (unsigned long)disk_off);
  137. return 0;
  138. }
  139. static struct dentry *
  140. befs_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
  141. {
  142. struct inode *inode = NULL;
  143. struct super_block *sb = dir->i_sb;
  144. befs_data_stream *ds = &BEFS_I(dir)->i_data.ds;
  145. befs_off_t offset;
  146. int ret;
  147. int utfnamelen;
  148. char *utfname;
  149. const char *name = dentry->d_name.name;
  150. befs_debug(sb, "---> %s name %pd inode %ld", __func__,
  151. dentry, dir->i_ino);
  152. /* Convert to UTF-8 */
  153. if (BEFS_SB(sb)->nls) {
  154. ret =
  155. befs_nls2utf(sb, name, strlen(name), &utfname, &utfnamelen);
  156. if (ret < 0) {
  157. befs_debug(sb, "<--- %s ERROR", __func__);
  158. return ERR_PTR(ret);
  159. }
  160. ret = befs_btree_find(sb, ds, utfname, &offset);
  161. kfree(utfname);
  162. } else {
  163. ret = befs_btree_find(sb, ds, dentry->d_name.name, &offset);
  164. }
  165. if (ret == BEFS_BT_NOT_FOUND) {
  166. befs_debug(sb, "<--- %s %pd not found", __func__, dentry);
  167. return ERR_PTR(-ENOENT);
  168. } else if (ret != BEFS_OK || offset == 0) {
  169. befs_warning(sb, "<--- %s Error", __func__);
  170. return ERR_PTR(-ENODATA);
  171. }
  172. inode = befs_iget(dir->i_sb, (ino_t) offset);
  173. if (IS_ERR(inode))
  174. return ERR_CAST(inode);
  175. d_add(dentry, inode);
  176. befs_debug(sb, "<--- %s", __func__);
  177. return NULL;
  178. }
  179. static int
  180. befs_readdir(struct file *file, struct dir_context *ctx)
  181. {
  182. struct inode *inode = file_inode(file);
  183. struct super_block *sb = inode->i_sb;
  184. befs_data_stream *ds = &BEFS_I(inode)->i_data.ds;
  185. befs_off_t value;
  186. int result;
  187. size_t keysize;
  188. unsigned char d_type;
  189. char keybuf[BEFS_NAME_LEN + 1];
  190. befs_debug(sb, "---> %s name %pD, inode %ld, ctx->pos %lld",
  191. __func__, file, inode->i_ino, ctx->pos);
  192. more:
  193. result = befs_btree_read(sb, ds, ctx->pos, BEFS_NAME_LEN + 1,
  194. keybuf, &keysize, &value);
  195. if (result == BEFS_ERR) {
  196. befs_debug(sb, "<--- %s ERROR", __func__);
  197. befs_error(sb, "IO error reading %pD (inode %lu)",
  198. file, inode->i_ino);
  199. return -EIO;
  200. } else if (result == BEFS_BT_END) {
  201. befs_debug(sb, "<--- %s END", __func__);
  202. return 0;
  203. } else if (result == BEFS_BT_EMPTY) {
  204. befs_debug(sb, "<--- %s Empty directory", __func__);
  205. return 0;
  206. }
  207. d_type = DT_UNKNOWN;
  208. /* Convert to NLS */
  209. if (BEFS_SB(sb)->nls) {
  210. char *nlsname;
  211. int nlsnamelen;
  212. result =
  213. befs_utf2nls(sb, keybuf, keysize, &nlsname, &nlsnamelen);
  214. if (result < 0) {
  215. befs_debug(sb, "<--- %s ERROR", __func__);
  216. return result;
  217. }
  218. if (!dir_emit(ctx, nlsname, nlsnamelen,
  219. (ino_t) value, d_type)) {
  220. kfree(nlsname);
  221. return 0;
  222. }
  223. kfree(nlsname);
  224. } else {
  225. if (!dir_emit(ctx, keybuf, keysize,
  226. (ino_t) value, d_type))
  227. return 0;
  228. }
  229. ctx->pos++;
  230. goto more;
  231. }
  232. static struct inode *
  233. befs_alloc_inode(struct super_block *sb)
  234. {
  235. struct befs_inode_info *bi;
  236. bi = kmem_cache_alloc(befs_inode_cachep, GFP_KERNEL);
  237. if (!bi)
  238. return NULL;
  239. return &bi->vfs_inode;
  240. }
  241. static void befs_i_callback(struct rcu_head *head)
  242. {
  243. struct inode *inode = container_of(head, struct inode, i_rcu);
  244. kmem_cache_free(befs_inode_cachep, BEFS_I(inode));
  245. }
  246. static void befs_destroy_inode(struct inode *inode)
  247. {
  248. call_rcu(&inode->i_rcu, befs_i_callback);
  249. }
  250. static void init_once(void *foo)
  251. {
  252. struct befs_inode_info *bi = (struct befs_inode_info *) foo;
  253. inode_init_once(&bi->vfs_inode);
  254. }
  255. static struct inode *befs_iget(struct super_block *sb, unsigned long ino)
  256. {
  257. struct buffer_head *bh = NULL;
  258. befs_inode *raw_inode = NULL;
  259. struct befs_sb_info *befs_sb = BEFS_SB(sb);
  260. struct befs_inode_info *befs_ino = NULL;
  261. struct inode *inode;
  262. long ret = -EIO;
  263. befs_debug(sb, "---> %s inode = %lu", __func__, ino);
  264. inode = iget_locked(sb, ino);
  265. if (!inode)
  266. return ERR_PTR(-ENOMEM);
  267. if (!(inode->i_state & I_NEW))
  268. return inode;
  269. befs_ino = BEFS_I(inode);
  270. /* convert from vfs's inode number to befs's inode number */
  271. befs_ino->i_inode_num = blockno2iaddr(sb, inode->i_ino);
  272. befs_debug(sb, " real inode number [%u, %hu, %hu]",
  273. befs_ino->i_inode_num.allocation_group,
  274. befs_ino->i_inode_num.start, befs_ino->i_inode_num.len);
  275. bh = befs_bread(sb, inode->i_ino);
  276. if (!bh) {
  277. befs_error(sb, "unable to read inode block - "
  278. "inode = %lu", inode->i_ino);
  279. goto unacquire_none;
  280. }
  281. raw_inode = (befs_inode *) bh->b_data;
  282. befs_dump_inode(sb, raw_inode);
  283. if (befs_check_inode(sb, raw_inode, inode->i_ino) != BEFS_OK) {
  284. befs_error(sb, "Bad inode: %lu", inode->i_ino);
  285. goto unacquire_bh;
  286. }
  287. inode->i_mode = (umode_t) fs32_to_cpu(sb, raw_inode->mode);
  288. /*
  289. * set uid and gid. But since current BeOS is single user OS, so
  290. * you can change by "uid" or "gid" options.
  291. */
  292. inode->i_uid = befs_sb->mount_opts.use_uid ?
  293. befs_sb->mount_opts.uid :
  294. make_kuid(&init_user_ns, fs32_to_cpu(sb, raw_inode->uid));
  295. inode->i_gid = befs_sb->mount_opts.use_gid ?
  296. befs_sb->mount_opts.gid :
  297. make_kgid(&init_user_ns, fs32_to_cpu(sb, raw_inode->gid));
  298. set_nlink(inode, 1);
  299. /*
  300. * BEFS's time is 64 bits, but current VFS is 32 bits...
  301. * BEFS don't have access time. Nor inode change time. VFS
  302. * doesn't have creation time.
  303. * Also, the lower 16 bits of the last_modified_time and
  304. * create_time are just a counter to help ensure uniqueness
  305. * for indexing purposes. (PFD, page 54)
  306. */
  307. inode->i_mtime.tv_sec =
  308. fs64_to_cpu(sb, raw_inode->last_modified_time) >> 16;
  309. inode->i_mtime.tv_nsec = 0; /* lower 16 bits are not a time */
  310. inode->i_ctime = inode->i_mtime;
  311. inode->i_atime = inode->i_mtime;
  312. befs_ino->i_inode_num = fsrun_to_cpu(sb, raw_inode->inode_num);
  313. befs_ino->i_parent = fsrun_to_cpu(sb, raw_inode->parent);
  314. befs_ino->i_attribute = fsrun_to_cpu(sb, raw_inode->attributes);
  315. befs_ino->i_flags = fs32_to_cpu(sb, raw_inode->flags);
  316. if (S_ISLNK(inode->i_mode) && !(befs_ino->i_flags & BEFS_LONG_SYMLINK)){
  317. inode->i_size = 0;
  318. inode->i_blocks = befs_sb->block_size / VFS_BLOCK_SIZE;
  319. strlcpy(befs_ino->i_data.symlink, raw_inode->data.symlink,
  320. BEFS_SYMLINK_LEN);
  321. } else {
  322. int num_blks;
  323. befs_ino->i_data.ds =
  324. fsds_to_cpu(sb, &raw_inode->data.datastream);
  325. num_blks = befs_count_blocks(sb, &befs_ino->i_data.ds);
  326. inode->i_blocks =
  327. num_blks * (befs_sb->block_size / VFS_BLOCK_SIZE);
  328. inode->i_size = befs_ino->i_data.ds.size;
  329. }
  330. inode->i_mapping->a_ops = &befs_aops;
  331. if (S_ISREG(inode->i_mode)) {
  332. inode->i_fop = &generic_ro_fops;
  333. } else if (S_ISDIR(inode->i_mode)) {
  334. inode->i_op = &befs_dir_inode_operations;
  335. inode->i_fop = &befs_dir_operations;
  336. } else if (S_ISLNK(inode->i_mode)) {
  337. if (befs_ino->i_flags & BEFS_LONG_SYMLINK)
  338. inode->i_op = &befs_symlink_inode_operations;
  339. else
  340. inode->i_op = &befs_fast_symlink_inode_operations;
  341. } else {
  342. befs_error(sb, "Inode %lu is not a regular file, "
  343. "directory or symlink. THAT IS WRONG! BeFS has no "
  344. "on disk special files", inode->i_ino);
  345. goto unacquire_bh;
  346. }
  347. brelse(bh);
  348. befs_debug(sb, "<--- %s", __func__);
  349. unlock_new_inode(inode);
  350. return inode;
  351. unacquire_bh:
  352. brelse(bh);
  353. unacquire_none:
  354. iget_failed(inode);
  355. befs_debug(sb, "<--- %s - Bad inode", __func__);
  356. return ERR_PTR(ret);
  357. }
  358. /* Initialize the inode cache. Called at fs setup.
  359. *
  360. * Taken from NFS implementation by Al Viro.
  361. */
  362. static int __init
  363. befs_init_inodecache(void)
  364. {
  365. befs_inode_cachep = kmem_cache_create("befs_inode_cache",
  366. sizeof (struct befs_inode_info),
  367. 0, (SLAB_RECLAIM_ACCOUNT|
  368. SLAB_MEM_SPREAD),
  369. init_once);
  370. if (befs_inode_cachep == NULL) {
  371. pr_err("%s: Couldn't initialize inode slabcache\n", __func__);
  372. return -ENOMEM;
  373. }
  374. return 0;
  375. }
  376. /* Called at fs teardown.
  377. *
  378. * Taken from NFS implementation by Al Viro.
  379. */
  380. static void
  381. befs_destroy_inodecache(void)
  382. {
  383. /*
  384. * Make sure all delayed rcu free inodes are flushed before we
  385. * destroy cache.
  386. */
  387. rcu_barrier();
  388. kmem_cache_destroy(befs_inode_cachep);
  389. }
  390. /*
  391. * The inode of symbolic link is different to data stream.
  392. * The data stream become link name. Unless the LONG_SYMLINK
  393. * flag is set.
  394. */
  395. static void *
  396. befs_follow_link(struct dentry *dentry, struct nameidata *nd)
  397. {
  398. struct super_block *sb = dentry->d_sb;
  399. struct befs_inode_info *befs_ino = BEFS_I(d_inode(dentry));
  400. befs_data_stream *data = &befs_ino->i_data.ds;
  401. befs_off_t len = data->size;
  402. char *link;
  403. if (len == 0) {
  404. befs_error(sb, "Long symlink with illegal length");
  405. link = ERR_PTR(-EIO);
  406. } else {
  407. befs_debug(sb, "Follow long symlink");
  408. link = kmalloc(len, GFP_NOFS);
  409. if (!link) {
  410. link = ERR_PTR(-ENOMEM);
  411. } else if (befs_read_lsymlink(sb, data, link, len) != len) {
  412. kfree(link);
  413. befs_error(sb, "Failed to read entire long symlink");
  414. link = ERR_PTR(-EIO);
  415. } else {
  416. link[len - 1] = '\0';
  417. }
  418. }
  419. nd_set_link(nd, link);
  420. return NULL;
  421. }
  422. static void *
  423. befs_fast_follow_link(struct dentry *dentry, struct nameidata *nd)
  424. {
  425. struct befs_inode_info *befs_ino = BEFS_I(d_inode(dentry));
  426. nd_set_link(nd, befs_ino->i_data.symlink);
  427. return NULL;
  428. }
  429. /*
  430. * UTF-8 to NLS charset convert routine
  431. *
  432. *
  433. * Changed 8/10/01 by Will Dyson. Now use uni2char() / char2uni() rather than
  434. * the nls tables directly
  435. */
  436. static int
  437. befs_utf2nls(struct super_block *sb, const char *in,
  438. int in_len, char **out, int *out_len)
  439. {
  440. struct nls_table *nls = BEFS_SB(sb)->nls;
  441. int i, o;
  442. unicode_t uni;
  443. int unilen, utflen;
  444. char *result;
  445. /* The utf8->nls conversion won't make the final nls string bigger
  446. * than the utf one, but if the string is pure ascii they'll have the
  447. * same width and an extra char is needed to save the additional \0
  448. */
  449. int maxlen = in_len + 1;
  450. befs_debug(sb, "---> %s", __func__);
  451. if (!nls) {
  452. befs_error(sb, "%s called with no NLS table loaded", __func__);
  453. return -EINVAL;
  454. }
  455. *out = result = kmalloc(maxlen, GFP_NOFS);
  456. if (!*out) {
  457. befs_error(sb, "%s cannot allocate memory", __func__);
  458. *out_len = 0;
  459. return -ENOMEM;
  460. }
  461. for (i = o = 0; i < in_len; i += utflen, o += unilen) {
  462. /* convert from UTF-8 to Unicode */
  463. utflen = utf8_to_utf32(&in[i], in_len - i, &uni);
  464. if (utflen < 0)
  465. goto conv_err;
  466. /* convert from Unicode to nls */
  467. if (uni > MAX_WCHAR_T)
  468. goto conv_err;
  469. unilen = nls->uni2char(uni, &result[o], in_len - o);
  470. if (unilen < 0)
  471. goto conv_err;
  472. }
  473. result[o] = '\0';
  474. *out_len = o;
  475. befs_debug(sb, "<--- %s", __func__);
  476. return o;
  477. conv_err:
  478. befs_error(sb, "Name using character set %s contains a character that "
  479. "cannot be converted to unicode.", nls->charset);
  480. befs_debug(sb, "<--- %s", __func__);
  481. kfree(result);
  482. return -EILSEQ;
  483. }
  484. /**
  485. * befs_nls2utf - Convert NLS string to utf8 encodeing
  486. * @sb: Superblock
  487. * @in: Input string buffer in NLS format
  488. * @in_len: Length of input string in bytes
  489. * @out: The output string in UTF-8 format
  490. * @out_len: Length of the output buffer
  491. *
  492. * Converts input string @in, which is in the format of the loaded NLS map,
  493. * into a utf8 string.
  494. *
  495. * The destination string @out is allocated by this function and the caller is
  496. * responsible for freeing it with kfree()
  497. *
  498. * On return, *@out_len is the length of @out in bytes.
  499. *
  500. * On success, the return value is the number of utf8 characters written to
  501. * the output buffer @out.
  502. *
  503. * On Failure, a negative number coresponding to the error code is returned.
  504. */
  505. static int
  506. befs_nls2utf(struct super_block *sb, const char *in,
  507. int in_len, char **out, int *out_len)
  508. {
  509. struct nls_table *nls = BEFS_SB(sb)->nls;
  510. int i, o;
  511. wchar_t uni;
  512. int unilen, utflen;
  513. char *result;
  514. /* There're nls characters that will translate to 3-chars-wide UTF-8
  515. * characters, a additional byte is needed to save the final \0
  516. * in special cases */
  517. int maxlen = (3 * in_len) + 1;
  518. befs_debug(sb, "---> %s\n", __func__);
  519. if (!nls) {
  520. befs_error(sb, "%s called with no NLS table loaded.",
  521. __func__);
  522. return -EINVAL;
  523. }
  524. *out = result = kmalloc(maxlen, GFP_NOFS);
  525. if (!*out) {
  526. befs_error(sb, "%s cannot allocate memory", __func__);
  527. *out_len = 0;
  528. return -ENOMEM;
  529. }
  530. for (i = o = 0; i < in_len; i += unilen, o += utflen) {
  531. /* convert from nls to unicode */
  532. unilen = nls->char2uni(&in[i], in_len - i, &uni);
  533. if (unilen < 0)
  534. goto conv_err;
  535. /* convert from unicode to UTF-8 */
  536. utflen = utf32_to_utf8(uni, &result[o], 3);
  537. if (utflen <= 0)
  538. goto conv_err;
  539. }
  540. result[o] = '\0';
  541. *out_len = o;
  542. befs_debug(sb, "<--- %s", __func__);
  543. return i;
  544. conv_err:
  545. befs_error(sb, "Name using charecter set %s contains a charecter that "
  546. "cannot be converted to unicode.", nls->charset);
  547. befs_debug(sb, "<--- %s", __func__);
  548. kfree(result);
  549. return -EILSEQ;
  550. }
  551. /**
  552. * Use the
  553. *
  554. */
  555. enum {
  556. Opt_uid, Opt_gid, Opt_charset, Opt_debug, Opt_err,
  557. };
  558. static const match_table_t befs_tokens = {
  559. {Opt_uid, "uid=%d"},
  560. {Opt_gid, "gid=%d"},
  561. {Opt_charset, "iocharset=%s"},
  562. {Opt_debug, "debug"},
  563. {Opt_err, NULL}
  564. };
  565. static int
  566. parse_options(char *options, struct befs_mount_options *opts)
  567. {
  568. char *p;
  569. substring_t args[MAX_OPT_ARGS];
  570. int option;
  571. kuid_t uid;
  572. kgid_t gid;
  573. /* Initialize options */
  574. opts->uid = GLOBAL_ROOT_UID;
  575. opts->gid = GLOBAL_ROOT_GID;
  576. opts->use_uid = 0;
  577. opts->use_gid = 0;
  578. opts->iocharset = NULL;
  579. opts->debug = 0;
  580. if (!options)
  581. return 1;
  582. while ((p = strsep(&options, ",")) != NULL) {
  583. int token;
  584. if (!*p)
  585. continue;
  586. token = match_token(p, befs_tokens, args);
  587. switch (token) {
  588. case Opt_uid:
  589. if (match_int(&args[0], &option))
  590. return 0;
  591. uid = INVALID_UID;
  592. if (option >= 0)
  593. uid = make_kuid(current_user_ns(), option);
  594. if (!uid_valid(uid)) {
  595. pr_err("Invalid uid %d, "
  596. "using default\n", option);
  597. break;
  598. }
  599. opts->uid = uid;
  600. opts->use_uid = 1;
  601. break;
  602. case Opt_gid:
  603. if (match_int(&args[0], &option))
  604. return 0;
  605. gid = INVALID_GID;
  606. if (option >= 0)
  607. gid = make_kgid(current_user_ns(), option);
  608. if (!gid_valid(gid)) {
  609. pr_err("Invalid gid %d, "
  610. "using default\n", option);
  611. break;
  612. }
  613. opts->gid = gid;
  614. opts->use_gid = 1;
  615. break;
  616. case Opt_charset:
  617. kfree(opts->iocharset);
  618. opts->iocharset = match_strdup(&args[0]);
  619. if (!opts->iocharset) {
  620. pr_err("allocation failure for "
  621. "iocharset string\n");
  622. return 0;
  623. }
  624. break;
  625. case Opt_debug:
  626. opts->debug = 1;
  627. break;
  628. default:
  629. pr_err("Unrecognized mount option \"%s\" "
  630. "or missing value\n", p);
  631. return 0;
  632. }
  633. }
  634. return 1;
  635. }
  636. /* This function has the responsibiltiy of getting the
  637. * filesystem ready for unmounting.
  638. * Basically, we free everything that we allocated in
  639. * befs_read_inode
  640. */
  641. static void
  642. befs_put_super(struct super_block *sb)
  643. {
  644. kfree(BEFS_SB(sb)->mount_opts.iocharset);
  645. BEFS_SB(sb)->mount_opts.iocharset = NULL;
  646. unload_nls(BEFS_SB(sb)->nls);
  647. kfree(sb->s_fs_info);
  648. sb->s_fs_info = NULL;
  649. }
  650. /* Allocate private field of the superblock, fill it.
  651. *
  652. * Finish filling the public superblock fields
  653. * Make the root directory
  654. * Load a set of NLS translations if needed.
  655. */
  656. static int
  657. befs_fill_super(struct super_block *sb, void *data, int silent)
  658. {
  659. struct buffer_head *bh;
  660. struct befs_sb_info *befs_sb;
  661. befs_super_block *disk_sb;
  662. struct inode *root;
  663. long ret = -EINVAL;
  664. const unsigned long sb_block = 0;
  665. const off_t x86_sb_off = 512;
  666. save_mount_options(sb, data);
  667. sb->s_fs_info = kzalloc(sizeof(*befs_sb), GFP_KERNEL);
  668. if (sb->s_fs_info == NULL) {
  669. pr_err("(%s): Unable to allocate memory for private "
  670. "portion of superblock. Bailing.\n", sb->s_id);
  671. goto unacquire_none;
  672. }
  673. befs_sb = BEFS_SB(sb);
  674. if (!parse_options((char *) data, &befs_sb->mount_opts)) {
  675. befs_error(sb, "cannot parse mount options");
  676. goto unacquire_priv_sbp;
  677. }
  678. befs_debug(sb, "---> %s", __func__);
  679. if (!(sb->s_flags & MS_RDONLY)) {
  680. befs_warning(sb,
  681. "No write support. Marking filesystem read-only");
  682. sb->s_flags |= MS_RDONLY;
  683. }
  684. /*
  685. * Set dummy blocksize to read super block.
  686. * Will be set to real fs blocksize later.
  687. *
  688. * Linux 2.4.10 and later refuse to read blocks smaller than
  689. * the hardsect size for the device. But we also need to read at
  690. * least 1k to get the second 512 bytes of the volume.
  691. * -WD 10-26-01
  692. */
  693. sb_min_blocksize(sb, 1024);
  694. if (!(bh = sb_bread(sb, sb_block))) {
  695. befs_error(sb, "unable to read superblock");
  696. goto unacquire_priv_sbp;
  697. }
  698. /* account for offset of super block on x86 */
  699. disk_sb = (befs_super_block *) bh->b_data;
  700. if ((disk_sb->magic1 == BEFS_SUPER_MAGIC1_LE) ||
  701. (disk_sb->magic1 == BEFS_SUPER_MAGIC1_BE)) {
  702. befs_debug(sb, "Using PPC superblock location");
  703. } else {
  704. befs_debug(sb, "Using x86 superblock location");
  705. disk_sb =
  706. (befs_super_block *) ((void *) bh->b_data + x86_sb_off);
  707. }
  708. if ((befs_load_sb(sb, disk_sb) != BEFS_OK) ||
  709. (befs_check_sb(sb) != BEFS_OK))
  710. goto unacquire_bh;
  711. befs_dump_super_block(sb, disk_sb);
  712. brelse(bh);
  713. if( befs_sb->num_blocks > ~((sector_t)0) ) {
  714. befs_error(sb, "blocks count: %llu "
  715. "is larger than the host can use",
  716. befs_sb->num_blocks);
  717. goto unacquire_priv_sbp;
  718. }
  719. /*
  720. * set up enough so that it can read an inode
  721. * Fill in kernel superblock fields from private sb
  722. */
  723. sb->s_magic = BEFS_SUPER_MAGIC;
  724. /* Set real blocksize of fs */
  725. sb_set_blocksize(sb, (ulong) befs_sb->block_size);
  726. sb->s_op = &befs_sops;
  727. root = befs_iget(sb, iaddr2blockno(sb, &(befs_sb->root_dir)));
  728. if (IS_ERR(root)) {
  729. ret = PTR_ERR(root);
  730. goto unacquire_priv_sbp;
  731. }
  732. sb->s_root = d_make_root(root);
  733. if (!sb->s_root) {
  734. befs_error(sb, "get root inode failed");
  735. goto unacquire_priv_sbp;
  736. }
  737. /* load nls library */
  738. if (befs_sb->mount_opts.iocharset) {
  739. befs_debug(sb, "Loading nls: %s",
  740. befs_sb->mount_opts.iocharset);
  741. befs_sb->nls = load_nls(befs_sb->mount_opts.iocharset);
  742. if (!befs_sb->nls) {
  743. befs_warning(sb, "Cannot load nls %s"
  744. " loading default nls",
  745. befs_sb->mount_opts.iocharset);
  746. befs_sb->nls = load_nls_default();
  747. }
  748. /* load default nls if none is specified in mount options */
  749. } else {
  750. befs_debug(sb, "Loading default nls");
  751. befs_sb->nls = load_nls_default();
  752. }
  753. return 0;
  754. /*****************/
  755. unacquire_bh:
  756. brelse(bh);
  757. unacquire_priv_sbp:
  758. kfree(befs_sb->mount_opts.iocharset);
  759. kfree(sb->s_fs_info);
  760. unacquire_none:
  761. sb->s_fs_info = NULL;
  762. return ret;
  763. }
  764. static int
  765. befs_remount(struct super_block *sb, int *flags, char *data)
  766. {
  767. sync_filesystem(sb);
  768. if (!(*flags & MS_RDONLY))
  769. return -EINVAL;
  770. return 0;
  771. }
  772. static int
  773. befs_statfs(struct dentry *dentry, struct kstatfs *buf)
  774. {
  775. struct super_block *sb = dentry->d_sb;
  776. u64 id = huge_encode_dev(sb->s_bdev->bd_dev);
  777. befs_debug(sb, "---> %s", __func__);
  778. buf->f_type = BEFS_SUPER_MAGIC;
  779. buf->f_bsize = sb->s_blocksize;
  780. buf->f_blocks = BEFS_SB(sb)->num_blocks;
  781. buf->f_bfree = BEFS_SB(sb)->num_blocks - BEFS_SB(sb)->used_blocks;
  782. buf->f_bavail = buf->f_bfree;
  783. buf->f_files = 0; /* UNKNOWN */
  784. buf->f_ffree = 0; /* UNKNOWN */
  785. buf->f_fsid.val[0] = (u32)id;
  786. buf->f_fsid.val[1] = (u32)(id >> 32);
  787. buf->f_namelen = BEFS_NAME_LEN;
  788. befs_debug(sb, "<--- %s", __func__);
  789. return 0;
  790. }
  791. static struct dentry *
  792. befs_mount(struct file_system_type *fs_type, int flags, const char *dev_name,
  793. void *data)
  794. {
  795. return mount_bdev(fs_type, flags, dev_name, data, befs_fill_super);
  796. }
  797. static struct file_system_type befs_fs_type = {
  798. .owner = THIS_MODULE,
  799. .name = "befs",
  800. .mount = befs_mount,
  801. .kill_sb = kill_block_super,
  802. .fs_flags = FS_REQUIRES_DEV,
  803. };
  804. MODULE_ALIAS_FS("befs");
  805. static int __init
  806. init_befs_fs(void)
  807. {
  808. int err;
  809. pr_info("version: %s\n", BEFS_VERSION);
  810. err = befs_init_inodecache();
  811. if (err)
  812. goto unacquire_none;
  813. err = register_filesystem(&befs_fs_type);
  814. if (err)
  815. goto unacquire_inodecache;
  816. return 0;
  817. unacquire_inodecache:
  818. befs_destroy_inodecache();
  819. unacquire_none:
  820. return err;
  821. }
  822. static void __exit
  823. exit_befs_fs(void)
  824. {
  825. befs_destroy_inodecache();
  826. unregister_filesystem(&befs_fs_type);
  827. }
  828. /*
  829. Macros that typecheck the init and exit functions,
  830. ensures that they are called at init and cleanup,
  831. and eliminates warnings about unused functions.
  832. */
  833. module_init(init_befs_fs)
  834. module_exit(exit_befs_fs)