libfs.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999
  1. /*
  2. * fs/libfs.c
  3. * Library for filesystems writers.
  4. */
  5. #include <linux/module.h>
  6. #include <linux/pagemap.h>
  7. #include <linux/slab.h>
  8. #include <linux/mount.h>
  9. #include <linux/vfs.h>
  10. #include <linux/quotaops.h>
  11. #include <linux/mutex.h>
  12. #include <linux/exportfs.h>
  13. #include <linux/writeback.h>
  14. #include <linux/buffer_head.h>
  15. #include <asm/uaccess.h>
  16. int simple_getattr(struct vfsmount *mnt, struct dentry *dentry,
  17. struct kstat *stat)
  18. {
  19. struct inode *inode = dentry->d_inode;
  20. generic_fillattr(inode, stat);
  21. stat->blocks = inode->i_mapping->nrpages << (PAGE_CACHE_SHIFT - 9);
  22. return 0;
  23. }
  24. int simple_statfs(struct dentry *dentry, struct kstatfs *buf)
  25. {
  26. buf->f_type = dentry->d_sb->s_magic;
  27. buf->f_bsize = PAGE_CACHE_SIZE;
  28. buf->f_namelen = NAME_MAX;
  29. return 0;
  30. }
  31. /*
  32. * Retaining negative dentries for an in-memory filesystem just wastes
  33. * memory and lookup time: arrange for them to be deleted immediately.
  34. */
  35. static int simple_delete_dentry(struct dentry *dentry)
  36. {
  37. return 1;
  38. }
  39. /*
  40. * Lookup the data. This is trivial - if the dentry didn't already
  41. * exist, we know it is negative. Set d_op to delete negative dentries.
  42. */
  43. struct dentry *simple_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd)
  44. {
  45. static const struct dentry_operations simple_dentry_operations = {
  46. .d_delete = simple_delete_dentry,
  47. };
  48. if (dentry->d_name.len > NAME_MAX)
  49. return ERR_PTR(-ENAMETOOLONG);
  50. dentry->d_op = &simple_dentry_operations;
  51. d_add(dentry, NULL);
  52. return NULL;
  53. }
  54. int dcache_dir_open(struct inode *inode, struct file *file)
  55. {
  56. static struct qstr cursor_name = {.len = 1, .name = "."};
  57. file->private_data = d_alloc(file->f_path.dentry, &cursor_name);
  58. return file->private_data ? 0 : -ENOMEM;
  59. }
  60. int dcache_dir_close(struct inode *inode, struct file *file)
  61. {
  62. dput(file->private_data);
  63. return 0;
  64. }
  65. loff_t dcache_dir_lseek(struct file *file, loff_t offset, int origin)
  66. {
  67. mutex_lock(&file->f_path.dentry->d_inode->i_mutex);
  68. switch (origin) {
  69. case 1:
  70. offset += file->f_pos;
  71. case 0:
  72. if (offset >= 0)
  73. break;
  74. default:
  75. mutex_unlock(&file->f_path.dentry->d_inode->i_mutex);
  76. return -EINVAL;
  77. }
  78. if (offset != file->f_pos) {
  79. file->f_pos = offset;
  80. if (file->f_pos >= 2) {
  81. struct list_head *p;
  82. struct dentry *cursor = file->private_data;
  83. loff_t n = file->f_pos - 2;
  84. spin_lock(&dcache_lock);
  85. list_del(&cursor->d_u.d_child);
  86. p = file->f_path.dentry->d_subdirs.next;
  87. while (n && p != &file->f_path.dentry->d_subdirs) {
  88. struct dentry *next;
  89. next = list_entry(p, struct dentry, d_u.d_child);
  90. if (!d_unhashed(next) && next->d_inode)
  91. n--;
  92. p = p->next;
  93. }
  94. list_add_tail(&cursor->d_u.d_child, p);
  95. spin_unlock(&dcache_lock);
  96. }
  97. }
  98. mutex_unlock(&file->f_path.dentry->d_inode->i_mutex);
  99. return offset;
  100. }
  101. /* Relationship between i_mode and the DT_xxx types */
  102. static inline unsigned char dt_type(struct inode *inode)
  103. {
  104. return (inode->i_mode >> 12) & 15;
  105. }
  106. /*
  107. * Directory is locked and all positive dentries in it are safe, since
  108. * for ramfs-type trees they can't go away without unlink() or rmdir(),
  109. * both impossible due to the lock on directory.
  110. */
  111. int dcache_readdir(struct file * filp, void * dirent, filldir_t filldir)
  112. {
  113. struct dentry *dentry = filp->f_path.dentry;
  114. struct dentry *cursor = filp->private_data;
  115. struct list_head *p, *q = &cursor->d_u.d_child;
  116. ino_t ino;
  117. int i = filp->f_pos;
  118. switch (i) {
  119. case 0:
  120. ino = dentry->d_inode->i_ino;
  121. if (filldir(dirent, ".", 1, i, ino, DT_DIR) < 0)
  122. break;
  123. filp->f_pos++;
  124. i++;
  125. /* fallthrough */
  126. case 1:
  127. ino = parent_ino(dentry);
  128. if (filldir(dirent, "..", 2, i, ino, DT_DIR) < 0)
  129. break;
  130. filp->f_pos++;
  131. i++;
  132. /* fallthrough */
  133. default:
  134. spin_lock(&dcache_lock);
  135. if (filp->f_pos == 2)
  136. list_move(q, &dentry->d_subdirs);
  137. for (p=q->next; p != &dentry->d_subdirs; p=p->next) {
  138. struct dentry *next;
  139. next = list_entry(p, struct dentry, d_u.d_child);
  140. if (d_unhashed(next) || !next->d_inode)
  141. continue;
  142. spin_unlock(&dcache_lock);
  143. if (filldir(dirent, next->d_name.name,
  144. next->d_name.len, filp->f_pos,
  145. next->d_inode->i_ino,
  146. dt_type(next->d_inode)) < 0)
  147. return 0;
  148. spin_lock(&dcache_lock);
  149. /* next is still alive */
  150. list_move(q, p);
  151. p = q;
  152. filp->f_pos++;
  153. }
  154. spin_unlock(&dcache_lock);
  155. }
  156. return 0;
  157. }
  158. ssize_t generic_read_dir(struct file *filp, char __user *buf, size_t siz, loff_t *ppos)
  159. {
  160. return -EISDIR;
  161. }
  162. const struct file_operations simple_dir_operations = {
  163. .open = dcache_dir_open,
  164. .release = dcache_dir_close,
  165. .llseek = dcache_dir_lseek,
  166. .read = generic_read_dir,
  167. .readdir = dcache_readdir,
  168. .fsync = noop_fsync,
  169. };
  170. const struct inode_operations simple_dir_inode_operations = {
  171. .lookup = simple_lookup,
  172. };
  173. static const struct super_operations simple_super_operations = {
  174. .statfs = simple_statfs,
  175. };
  176. /*
  177. * Common helper for pseudo-filesystems (sockfs, pipefs, bdev - stuff that
  178. * will never be mountable)
  179. */
  180. int get_sb_pseudo(struct file_system_type *fs_type, char *name,
  181. const struct super_operations *ops, unsigned long magic,
  182. struct vfsmount *mnt)
  183. {
  184. struct super_block *s = sget(fs_type, NULL, set_anon_super, NULL);
  185. struct dentry *dentry;
  186. struct inode *root;
  187. struct qstr d_name = {.name = name, .len = strlen(name)};
  188. if (IS_ERR(s))
  189. return PTR_ERR(s);
  190. s->s_flags = MS_NOUSER;
  191. s->s_maxbytes = MAX_LFS_FILESIZE;
  192. s->s_blocksize = PAGE_SIZE;
  193. s->s_blocksize_bits = PAGE_SHIFT;
  194. s->s_magic = magic;
  195. s->s_op = ops ? ops : &simple_super_operations;
  196. s->s_time_gran = 1;
  197. root = new_inode(s);
  198. if (!root)
  199. goto Enomem;
  200. /*
  201. * since this is the first inode, make it number 1. New inodes created
  202. * after this must take care not to collide with it (by passing
  203. * max_reserved of 1 to iunique).
  204. */
  205. root->i_ino = 1;
  206. root->i_mode = S_IFDIR | S_IRUSR | S_IWUSR;
  207. root->i_atime = root->i_mtime = root->i_ctime = CURRENT_TIME;
  208. dentry = d_alloc(NULL, &d_name);
  209. if (!dentry) {
  210. iput(root);
  211. goto Enomem;
  212. }
  213. dentry->d_sb = s;
  214. dentry->d_parent = dentry;
  215. d_instantiate(dentry, root);
  216. s->s_root = dentry;
  217. s->s_flags |= MS_ACTIVE;
  218. simple_set_mnt(mnt, s);
  219. return 0;
  220. Enomem:
  221. deactivate_locked_super(s);
  222. return -ENOMEM;
  223. }
  224. int simple_link(struct dentry *old_dentry, struct inode *dir, struct dentry *dentry)
  225. {
  226. struct inode *inode = old_dentry->d_inode;
  227. inode->i_ctime = dir->i_ctime = dir->i_mtime = CURRENT_TIME;
  228. inc_nlink(inode);
  229. atomic_inc(&inode->i_count);
  230. dget(dentry);
  231. d_instantiate(dentry, inode);
  232. return 0;
  233. }
  234. static inline int simple_positive(struct dentry *dentry)
  235. {
  236. return dentry->d_inode && !d_unhashed(dentry);
  237. }
  238. int simple_empty(struct dentry *dentry)
  239. {
  240. struct dentry *child;
  241. int ret = 0;
  242. spin_lock(&dcache_lock);
  243. list_for_each_entry(child, &dentry->d_subdirs, d_u.d_child)
  244. if (simple_positive(child))
  245. goto out;
  246. ret = 1;
  247. out:
  248. spin_unlock(&dcache_lock);
  249. return ret;
  250. }
  251. int simple_unlink(struct inode *dir, struct dentry *dentry)
  252. {
  253. struct inode *inode = dentry->d_inode;
  254. inode->i_ctime = dir->i_ctime = dir->i_mtime = CURRENT_TIME;
  255. drop_nlink(inode);
  256. dput(dentry);
  257. return 0;
  258. }
  259. int simple_rmdir(struct inode *dir, struct dentry *dentry)
  260. {
  261. if (!simple_empty(dentry))
  262. return -ENOTEMPTY;
  263. drop_nlink(dentry->d_inode);
  264. simple_unlink(dir, dentry);
  265. drop_nlink(dir);
  266. return 0;
  267. }
  268. int simple_rename(struct inode *old_dir, struct dentry *old_dentry,
  269. struct inode *new_dir, struct dentry *new_dentry)
  270. {
  271. struct inode *inode = old_dentry->d_inode;
  272. int they_are_dirs = S_ISDIR(old_dentry->d_inode->i_mode);
  273. if (!simple_empty(new_dentry))
  274. return -ENOTEMPTY;
  275. if (new_dentry->d_inode) {
  276. simple_unlink(new_dir, new_dentry);
  277. if (they_are_dirs)
  278. drop_nlink(old_dir);
  279. } else if (they_are_dirs) {
  280. drop_nlink(old_dir);
  281. inc_nlink(new_dir);
  282. }
  283. old_dir->i_ctime = old_dir->i_mtime = new_dir->i_ctime =
  284. new_dir->i_mtime = inode->i_ctime = CURRENT_TIME;
  285. return 0;
  286. }
  287. /**
  288. * simple_setsize - handle core mm and vfs requirements for file size change
  289. * @inode: inode
  290. * @newsize: new file size
  291. *
  292. * Returns 0 on success, -error on failure.
  293. *
  294. * simple_setsize must be called with inode_mutex held.
  295. *
  296. * simple_setsize will check that the requested new size is OK (see
  297. * inode_newsize_ok), and then will perform the necessary i_size update
  298. * and pagecache truncation (if necessary). It will be typically be called
  299. * from the filesystem's setattr function when ATTR_SIZE is passed in.
  300. *
  301. * The inode itself must have correct permissions and attributes to allow
  302. * i_size to be changed, this function then just checks that the new size
  303. * requested is valid.
  304. *
  305. * In the case of simple in-memory filesystems with inodes stored solely
  306. * in the inode cache, and file data in the pagecache, nothing more needs
  307. * to be done to satisfy a truncate request. Filesystems with on-disk
  308. * blocks for example will need to free them in the case of truncate, in
  309. * that case it may be easier not to use simple_setsize (but each of its
  310. * components will likely be required at some point to update pagecache
  311. * and inode etc).
  312. */
  313. int simple_setsize(struct inode *inode, loff_t newsize)
  314. {
  315. loff_t oldsize;
  316. int error;
  317. error = inode_newsize_ok(inode, newsize);
  318. if (error)
  319. return error;
  320. oldsize = inode->i_size;
  321. i_size_write(inode, newsize);
  322. truncate_pagecache(inode, oldsize, newsize);
  323. return error;
  324. }
  325. EXPORT_SYMBOL(simple_setsize);
  326. /**
  327. * simple_setattr - setattr for simple in-memory filesystem
  328. * @dentry: dentry
  329. * @iattr: iattr structure
  330. *
  331. * Returns 0 on success, -error on failure.
  332. *
  333. * simple_setattr implements setattr for an in-memory filesystem which
  334. * does not store its own file data or metadata (eg. uses the page cache
  335. * and inode cache as its data store).
  336. */
  337. int simple_setattr(struct dentry *dentry, struct iattr *iattr)
  338. {
  339. struct inode *inode = dentry->d_inode;
  340. int error;
  341. error = inode_change_ok(inode, iattr);
  342. if (error)
  343. return error;
  344. if (iattr->ia_valid & ATTR_SIZE) {
  345. error = simple_setsize(inode, iattr->ia_size);
  346. if (error)
  347. return error;
  348. }
  349. generic_setattr(inode, iattr);
  350. return error;
  351. }
  352. EXPORT_SYMBOL(simple_setattr);
  353. int simple_readpage(struct file *file, struct page *page)
  354. {
  355. clear_highpage(page);
  356. flush_dcache_page(page);
  357. SetPageUptodate(page);
  358. unlock_page(page);
  359. return 0;
  360. }
  361. int simple_write_begin(struct file *file, struct address_space *mapping,
  362. loff_t pos, unsigned len, unsigned flags,
  363. struct page **pagep, void **fsdata)
  364. {
  365. struct page *page;
  366. pgoff_t index;
  367. index = pos >> PAGE_CACHE_SHIFT;
  368. page = grab_cache_page_write_begin(mapping, index, flags);
  369. if (!page)
  370. return -ENOMEM;
  371. *pagep = page;
  372. if (!PageUptodate(page) && (len != PAGE_CACHE_SIZE)) {
  373. unsigned from = pos & (PAGE_CACHE_SIZE - 1);
  374. zero_user_segments(page, 0, from, from + len, PAGE_CACHE_SIZE);
  375. }
  376. return 0;
  377. }
  378. /**
  379. * simple_write_end - .write_end helper for non-block-device FSes
  380. * @available: See .write_end of address_space_operations
  381. * @file: "
  382. * @mapping: "
  383. * @pos: "
  384. * @len: "
  385. * @copied: "
  386. * @page: "
  387. * @fsdata: "
  388. *
  389. * simple_write_end does the minimum needed for updating a page after writing is
  390. * done. It has the same API signature as the .write_end of
  391. * address_space_operations vector. So it can just be set onto .write_end for
  392. * FSes that don't need any other processing. i_mutex is assumed to be held.
  393. * Block based filesystems should use generic_write_end().
  394. * NOTE: Even though i_size might get updated by this function, mark_inode_dirty
  395. * is not called, so a filesystem that actually does store data in .write_inode
  396. * should extend on what's done here with a call to mark_inode_dirty() in the
  397. * case that i_size has changed.
  398. */
  399. int simple_write_end(struct file *file, struct address_space *mapping,
  400. loff_t pos, unsigned len, unsigned copied,
  401. struct page *page, void *fsdata)
  402. {
  403. struct inode *inode = page->mapping->host;
  404. loff_t last_pos = pos + copied;
  405. /* zero the stale part of the page if we did a short copy */
  406. if (copied < len) {
  407. unsigned from = pos & (PAGE_CACHE_SIZE - 1);
  408. zero_user(page, from + copied, len - copied);
  409. }
  410. if (!PageUptodate(page))
  411. SetPageUptodate(page);
  412. /*
  413. * No need to use i_size_read() here, the i_size
  414. * cannot change under us because we hold the i_mutex.
  415. */
  416. if (last_pos > inode->i_size)
  417. i_size_write(inode, last_pos);
  418. set_page_dirty(page);
  419. unlock_page(page);
  420. page_cache_release(page);
  421. return copied;
  422. }
  423. /*
  424. * the inodes created here are not hashed. If you use iunique to generate
  425. * unique inode values later for this filesystem, then you must take care
  426. * to pass it an appropriate max_reserved value to avoid collisions.
  427. */
  428. int simple_fill_super(struct super_block *s, unsigned long magic,
  429. struct tree_descr *files)
  430. {
  431. struct inode *inode;
  432. struct dentry *root;
  433. struct dentry *dentry;
  434. int i;
  435. s->s_blocksize = PAGE_CACHE_SIZE;
  436. s->s_blocksize_bits = PAGE_CACHE_SHIFT;
  437. s->s_magic = magic;
  438. s->s_op = &simple_super_operations;
  439. s->s_time_gran = 1;
  440. inode = new_inode(s);
  441. if (!inode)
  442. return -ENOMEM;
  443. /*
  444. * because the root inode is 1, the files array must not contain an
  445. * entry at index 1
  446. */
  447. inode->i_ino = 1;
  448. inode->i_mode = S_IFDIR | 0755;
  449. inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME;
  450. inode->i_op = &simple_dir_inode_operations;
  451. inode->i_fop = &simple_dir_operations;
  452. inode->i_nlink = 2;
  453. root = d_alloc_root(inode);
  454. if (!root) {
  455. iput(inode);
  456. return -ENOMEM;
  457. }
  458. for (i = 0; !files->name || files->name[0]; i++, files++) {
  459. if (!files->name)
  460. continue;
  461. /* warn if it tries to conflict with the root inode */
  462. if (unlikely(i == 1))
  463. printk(KERN_WARNING "%s: %s passed in a files array"
  464. "with an index of 1!\n", __func__,
  465. s->s_type->name);
  466. dentry = d_alloc_name(root, files->name);
  467. if (!dentry)
  468. goto out;
  469. inode = new_inode(s);
  470. if (!inode)
  471. goto out;
  472. inode->i_mode = S_IFREG | files->mode;
  473. inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME;
  474. inode->i_fop = files->ops;
  475. inode->i_ino = i;
  476. d_add(dentry, inode);
  477. }
  478. s->s_root = root;
  479. return 0;
  480. out:
  481. d_genocide(root);
  482. dput(root);
  483. return -ENOMEM;
  484. }
  485. static DEFINE_SPINLOCK(pin_fs_lock);
  486. int simple_pin_fs(struct file_system_type *type, struct vfsmount **mount, int *count)
  487. {
  488. struct vfsmount *mnt = NULL;
  489. spin_lock(&pin_fs_lock);
  490. if (unlikely(!*mount)) {
  491. spin_unlock(&pin_fs_lock);
  492. mnt = vfs_kern_mount(type, 0, type->name, NULL);
  493. if (IS_ERR(mnt))
  494. return PTR_ERR(mnt);
  495. spin_lock(&pin_fs_lock);
  496. if (!*mount)
  497. *mount = mnt;
  498. }
  499. mntget(*mount);
  500. ++*count;
  501. spin_unlock(&pin_fs_lock);
  502. mntput(mnt);
  503. return 0;
  504. }
  505. void simple_release_fs(struct vfsmount **mount, int *count)
  506. {
  507. struct vfsmount *mnt;
  508. spin_lock(&pin_fs_lock);
  509. mnt = *mount;
  510. if (!--*count)
  511. *mount = NULL;
  512. spin_unlock(&pin_fs_lock);
  513. mntput(mnt);
  514. }
  515. /**
  516. * simple_read_from_buffer - copy data from the buffer to user space
  517. * @to: the user space buffer to read to
  518. * @count: the maximum number of bytes to read
  519. * @ppos: the current position in the buffer
  520. * @from: the buffer to read from
  521. * @available: the size of the buffer
  522. *
  523. * The simple_read_from_buffer() function reads up to @count bytes from the
  524. * buffer @from at offset @ppos into the user space address starting at @to.
  525. *
  526. * On success, the number of bytes read is returned and the offset @ppos is
  527. * advanced by this number, or negative value is returned on error.
  528. **/
  529. ssize_t simple_read_from_buffer(void __user *to, size_t count, loff_t *ppos,
  530. const void *from, size_t available)
  531. {
  532. loff_t pos = *ppos;
  533. size_t ret;
  534. if (pos < 0)
  535. return -EINVAL;
  536. if (pos >= available || !count)
  537. return 0;
  538. if (count > available - pos)
  539. count = available - pos;
  540. ret = copy_to_user(to, from + pos, count);
  541. if (ret == count)
  542. return -EFAULT;
  543. count -= ret;
  544. *ppos = pos + count;
  545. return count;
  546. }
  547. /**
  548. * simple_write_to_buffer - copy data from user space to the buffer
  549. * @to: the buffer to write to
  550. * @available: the size of the buffer
  551. * @ppos: the current position in the buffer
  552. * @from: the user space buffer to read from
  553. * @count: the maximum number of bytes to read
  554. *
  555. * The simple_write_to_buffer() function reads up to @count bytes from the user
  556. * space address starting at @from into the buffer @to at offset @ppos.
  557. *
  558. * On success, the number of bytes written is returned and the offset @ppos is
  559. * advanced by this number, or negative value is returned on error.
  560. **/
  561. ssize_t simple_write_to_buffer(void *to, size_t available, loff_t *ppos,
  562. const void __user *from, size_t count)
  563. {
  564. loff_t pos = *ppos;
  565. size_t res;
  566. if (pos < 0)
  567. return -EINVAL;
  568. if (pos >= available || !count)
  569. return 0;
  570. if (count > available - pos)
  571. count = available - pos;
  572. res = copy_from_user(to + pos, from, count);
  573. if (res == count)
  574. return -EFAULT;
  575. count -= res;
  576. *ppos = pos + count;
  577. return count;
  578. }
  579. /**
  580. * memory_read_from_buffer - copy data from the buffer
  581. * @to: the kernel space buffer to read to
  582. * @count: the maximum number of bytes to read
  583. * @ppos: the current position in the buffer
  584. * @from: the buffer to read from
  585. * @available: the size of the buffer
  586. *
  587. * The memory_read_from_buffer() function reads up to @count bytes from the
  588. * buffer @from at offset @ppos into the kernel space address starting at @to.
  589. *
  590. * On success, the number of bytes read is returned and the offset @ppos is
  591. * advanced by this number, or negative value is returned on error.
  592. **/
  593. ssize_t memory_read_from_buffer(void *to, size_t count, loff_t *ppos,
  594. const void *from, size_t available)
  595. {
  596. loff_t pos = *ppos;
  597. if (pos < 0)
  598. return -EINVAL;
  599. if (pos >= available)
  600. return 0;
  601. if (count > available - pos)
  602. count = available - pos;
  603. memcpy(to, from + pos, count);
  604. *ppos = pos + count;
  605. return count;
  606. }
  607. /*
  608. * Transaction based IO.
  609. * The file expects a single write which triggers the transaction, and then
  610. * possibly a read which collects the result - which is stored in a
  611. * file-local buffer.
  612. */
  613. void simple_transaction_set(struct file *file, size_t n)
  614. {
  615. struct simple_transaction_argresp *ar = file->private_data;
  616. BUG_ON(n > SIMPLE_TRANSACTION_LIMIT);
  617. /*
  618. * The barrier ensures that ar->size will really remain zero until
  619. * ar->data is ready for reading.
  620. */
  621. smp_mb();
  622. ar->size = n;
  623. }
  624. char *simple_transaction_get(struct file *file, const char __user *buf, size_t size)
  625. {
  626. struct simple_transaction_argresp *ar;
  627. static DEFINE_SPINLOCK(simple_transaction_lock);
  628. if (size > SIMPLE_TRANSACTION_LIMIT - 1)
  629. return ERR_PTR(-EFBIG);
  630. ar = (struct simple_transaction_argresp *)get_zeroed_page(GFP_KERNEL);
  631. if (!ar)
  632. return ERR_PTR(-ENOMEM);
  633. spin_lock(&simple_transaction_lock);
  634. /* only one write allowed per open */
  635. if (file->private_data) {
  636. spin_unlock(&simple_transaction_lock);
  637. free_page((unsigned long)ar);
  638. return ERR_PTR(-EBUSY);
  639. }
  640. file->private_data = ar;
  641. spin_unlock(&simple_transaction_lock);
  642. if (copy_from_user(ar->data, buf, size))
  643. return ERR_PTR(-EFAULT);
  644. return ar->data;
  645. }
  646. ssize_t simple_transaction_read(struct file *file, char __user *buf, size_t size, loff_t *pos)
  647. {
  648. struct simple_transaction_argresp *ar = file->private_data;
  649. if (!ar)
  650. return 0;
  651. return simple_read_from_buffer(buf, size, pos, ar->data, ar->size);
  652. }
  653. int simple_transaction_release(struct inode *inode, struct file *file)
  654. {
  655. free_page((unsigned long)file->private_data);
  656. return 0;
  657. }
  658. /* Simple attribute files */
  659. struct simple_attr {
  660. int (*get)(void *, u64 *);
  661. int (*set)(void *, u64);
  662. char get_buf[24]; /* enough to store a u64 and "\n\0" */
  663. char set_buf[24];
  664. void *data;
  665. const char *fmt; /* format for read operation */
  666. struct mutex mutex; /* protects access to these buffers */
  667. };
  668. /* simple_attr_open is called by an actual attribute open file operation
  669. * to set the attribute specific access operations. */
  670. int simple_attr_open(struct inode *inode, struct file *file,
  671. int (*get)(void *, u64 *), int (*set)(void *, u64),
  672. const char *fmt)
  673. {
  674. struct simple_attr *attr;
  675. attr = kmalloc(sizeof(*attr), GFP_KERNEL);
  676. if (!attr)
  677. return -ENOMEM;
  678. attr->get = get;
  679. attr->set = set;
  680. attr->data = inode->i_private;
  681. attr->fmt = fmt;
  682. mutex_init(&attr->mutex);
  683. file->private_data = attr;
  684. return nonseekable_open(inode, file);
  685. }
  686. int simple_attr_release(struct inode *inode, struct file *file)
  687. {
  688. kfree(file->private_data);
  689. return 0;
  690. }
  691. /* read from the buffer that is filled with the get function */
  692. ssize_t simple_attr_read(struct file *file, char __user *buf,
  693. size_t len, loff_t *ppos)
  694. {
  695. struct simple_attr *attr;
  696. size_t size;
  697. ssize_t ret;
  698. attr = file->private_data;
  699. if (!attr->get)
  700. return -EACCES;
  701. ret = mutex_lock_interruptible(&attr->mutex);
  702. if (ret)
  703. return ret;
  704. if (*ppos) { /* continued read */
  705. size = strlen(attr->get_buf);
  706. } else { /* first read */
  707. u64 val;
  708. ret = attr->get(attr->data, &val);
  709. if (ret)
  710. goto out;
  711. size = scnprintf(attr->get_buf, sizeof(attr->get_buf),
  712. attr->fmt, (unsigned long long)val);
  713. }
  714. ret = simple_read_from_buffer(buf, len, ppos, attr->get_buf, size);
  715. out:
  716. mutex_unlock(&attr->mutex);
  717. return ret;
  718. }
  719. /* interpret the buffer as a number to call the set function with */
  720. ssize_t simple_attr_write(struct file *file, const char __user *buf,
  721. size_t len, loff_t *ppos)
  722. {
  723. struct simple_attr *attr;
  724. u64 val;
  725. size_t size;
  726. ssize_t ret;
  727. attr = file->private_data;
  728. if (!attr->set)
  729. return -EACCES;
  730. ret = mutex_lock_interruptible(&attr->mutex);
  731. if (ret)
  732. return ret;
  733. ret = -EFAULT;
  734. size = min(sizeof(attr->set_buf) - 1, len);
  735. if (copy_from_user(attr->set_buf, buf, size))
  736. goto out;
  737. attr->set_buf[size] = '\0';
  738. val = simple_strtol(attr->set_buf, NULL, 0);
  739. ret = attr->set(attr->data, val);
  740. if (ret == 0)
  741. ret = len; /* on success, claim we got the whole input */
  742. out:
  743. mutex_unlock(&attr->mutex);
  744. return ret;
  745. }
  746. /**
  747. * generic_fh_to_dentry - generic helper for the fh_to_dentry export operation
  748. * @sb: filesystem to do the file handle conversion on
  749. * @fid: file handle to convert
  750. * @fh_len: length of the file handle in bytes
  751. * @fh_type: type of file handle
  752. * @get_inode: filesystem callback to retrieve inode
  753. *
  754. * This function decodes @fid as long as it has one of the well-known
  755. * Linux filehandle types and calls @get_inode on it to retrieve the
  756. * inode for the object specified in the file handle.
  757. */
  758. struct dentry *generic_fh_to_dentry(struct super_block *sb, struct fid *fid,
  759. int fh_len, int fh_type, struct inode *(*get_inode)
  760. (struct super_block *sb, u64 ino, u32 gen))
  761. {
  762. struct inode *inode = NULL;
  763. if (fh_len < 2)
  764. return NULL;
  765. switch (fh_type) {
  766. case FILEID_INO32_GEN:
  767. case FILEID_INO32_GEN_PARENT:
  768. inode = get_inode(sb, fid->i32.ino, fid->i32.gen);
  769. break;
  770. }
  771. return d_obtain_alias(inode);
  772. }
  773. EXPORT_SYMBOL_GPL(generic_fh_to_dentry);
  774. /**
  775. * generic_fh_to_dentry - generic helper for the fh_to_parent export operation
  776. * @sb: filesystem to do the file handle conversion on
  777. * @fid: file handle to convert
  778. * @fh_len: length of the file handle in bytes
  779. * @fh_type: type of file handle
  780. * @get_inode: filesystem callback to retrieve inode
  781. *
  782. * This function decodes @fid as long as it has one of the well-known
  783. * Linux filehandle types and calls @get_inode on it to retrieve the
  784. * inode for the _parent_ object specified in the file handle if it
  785. * is specified in the file handle, or NULL otherwise.
  786. */
  787. struct dentry *generic_fh_to_parent(struct super_block *sb, struct fid *fid,
  788. int fh_len, int fh_type, struct inode *(*get_inode)
  789. (struct super_block *sb, u64 ino, u32 gen))
  790. {
  791. struct inode *inode = NULL;
  792. if (fh_len <= 2)
  793. return NULL;
  794. switch (fh_type) {
  795. case FILEID_INO32_GEN_PARENT:
  796. inode = get_inode(sb, fid->i32.parent_ino,
  797. (fh_len > 3 ? fid->i32.parent_gen : 0));
  798. break;
  799. }
  800. return d_obtain_alias(inode);
  801. }
  802. EXPORT_SYMBOL_GPL(generic_fh_to_parent);
  803. /**
  804. * generic_file_fsync - generic fsync implementation for simple filesystems
  805. * @file: file to synchronize
  806. * @datasync: only synchronize essential metadata if true
  807. *
  808. * This is a generic implementation of the fsync method for simple
  809. * filesystems which track all non-inode metadata in the buffers list
  810. * hanging off the address_space structure.
  811. */
  812. int generic_file_fsync(struct file *file, int datasync)
  813. {
  814. struct writeback_control wbc = {
  815. .sync_mode = WB_SYNC_ALL,
  816. .nr_to_write = 0, /* metadata-only; caller takes care of data */
  817. };
  818. struct inode *inode = file->f_mapping->host;
  819. int err;
  820. int ret;
  821. ret = sync_mapping_buffers(inode->i_mapping);
  822. if (!(inode->i_state & I_DIRTY))
  823. return ret;
  824. if (datasync && !(inode->i_state & I_DIRTY_DATASYNC))
  825. return ret;
  826. err = sync_inode(inode, &wbc);
  827. if (ret == 0)
  828. ret = err;
  829. return ret;
  830. }
  831. EXPORT_SYMBOL(generic_file_fsync);
  832. /*
  833. * No-op implementation of ->fsync for in-memory filesystems.
  834. */
  835. int noop_fsync(struct file *file, int datasync)
  836. {
  837. return 0;
  838. }
  839. EXPORT_SYMBOL(dcache_dir_close);
  840. EXPORT_SYMBOL(dcache_dir_lseek);
  841. EXPORT_SYMBOL(dcache_dir_open);
  842. EXPORT_SYMBOL(dcache_readdir);
  843. EXPORT_SYMBOL(generic_read_dir);
  844. EXPORT_SYMBOL(get_sb_pseudo);
  845. EXPORT_SYMBOL(simple_write_begin);
  846. EXPORT_SYMBOL(simple_write_end);
  847. EXPORT_SYMBOL(simple_dir_inode_operations);
  848. EXPORT_SYMBOL(simple_dir_operations);
  849. EXPORT_SYMBOL(simple_empty);
  850. EXPORT_SYMBOL(simple_fill_super);
  851. EXPORT_SYMBOL(simple_getattr);
  852. EXPORT_SYMBOL(simple_link);
  853. EXPORT_SYMBOL(simple_lookup);
  854. EXPORT_SYMBOL(simple_pin_fs);
  855. EXPORT_SYMBOL(simple_readpage);
  856. EXPORT_SYMBOL(simple_release_fs);
  857. EXPORT_SYMBOL(simple_rename);
  858. EXPORT_SYMBOL(simple_rmdir);
  859. EXPORT_SYMBOL(simple_statfs);
  860. EXPORT_SYMBOL(noop_fsync);
  861. EXPORT_SYMBOL(simple_unlink);
  862. EXPORT_SYMBOL(simple_read_from_buffer);
  863. EXPORT_SYMBOL(simple_write_to_buffer);
  864. EXPORT_SYMBOL(memory_read_from_buffer);
  865. EXPORT_SYMBOL(simple_transaction_set);
  866. EXPORT_SYMBOL(simple_transaction_get);
  867. EXPORT_SYMBOL(simple_transaction_read);
  868. EXPORT_SYMBOL(simple_transaction_release);
  869. EXPORT_SYMBOL_GPL(simple_attr_open);
  870. EXPORT_SYMBOL_GPL(simple_attr_release);
  871. EXPORT_SYMBOL_GPL(simple_attr_read);
  872. EXPORT_SYMBOL_GPL(simple_attr_write);