file.c 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333
  1. /*
  2. * JFFS2 -- Journalling Flash File System, Version 2.
  3. *
  4. * Copyright © 2001-2007 Red Hat, Inc.
  5. * Copyright © 2004-2010 David Woodhouse <dwmw2@infradead.org>
  6. *
  7. * Created by David Woodhouse <dwmw2@infradead.org>
  8. *
  9. * For licensing information, see the file 'LICENCE' in this directory.
  10. *
  11. */
  12. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  13. #include <linux/kernel.h>
  14. #include <linux/fs.h>
  15. #include <linux/time.h>
  16. #include <linux/pagemap.h>
  17. #include <linux/highmem.h>
  18. #include <linux/crc32.h>
  19. #include <linux/jffs2.h>
  20. #include "nodelist.h"
  21. static int jffs2_write_end(struct file *filp, struct address_space *mapping,
  22. loff_t pos, unsigned len, unsigned copied,
  23. struct page *pg, void *fsdata);
  24. static int jffs2_write_begin(struct file *filp, struct address_space *mapping,
  25. loff_t pos, unsigned len, unsigned flags,
  26. struct page **pagep, void **fsdata);
  27. static int jffs2_readpage (struct file *filp, struct page *pg);
  28. int jffs2_fsync(struct file *filp, loff_t start, loff_t end, int datasync)
  29. {
  30. struct inode *inode = filp->f_mapping->host;
  31. struct jffs2_sb_info *c = JFFS2_SB_INFO(inode->i_sb);
  32. int ret;
  33. ret = filemap_write_and_wait_range(inode->i_mapping, start, end);
  34. if (ret)
  35. return ret;
  36. inode_lock(inode);
  37. /* Trigger GC to flush any pending writes for this inode */
  38. jffs2_flush_wbuf_gc(c, inode->i_ino);
  39. inode_unlock(inode);
  40. return 0;
  41. }
  42. const struct file_operations jffs2_file_operations =
  43. {
  44. .llseek = generic_file_llseek,
  45. .open = generic_file_open,
  46. .read_iter = generic_file_read_iter,
  47. .write_iter = generic_file_write_iter,
  48. .unlocked_ioctl=jffs2_ioctl,
  49. .mmap = generic_file_readonly_mmap,
  50. .fsync = jffs2_fsync,
  51. .splice_read = generic_file_splice_read,
  52. };
  53. /* jffs2_file_inode_operations */
  54. const struct inode_operations jffs2_file_inode_operations =
  55. {
  56. .get_acl = jffs2_get_acl,
  57. .set_acl = jffs2_set_acl,
  58. .setattr = jffs2_setattr,
  59. .listxattr = jffs2_listxattr,
  60. };
  61. const struct address_space_operations jffs2_file_address_operations =
  62. {
  63. .readpage = jffs2_readpage,
  64. .write_begin = jffs2_write_begin,
  65. .write_end = jffs2_write_end,
  66. };
  67. static int jffs2_do_readpage_nolock (struct inode *inode, struct page *pg)
  68. {
  69. struct jffs2_inode_info *f = JFFS2_INODE_INFO(inode);
  70. struct jffs2_sb_info *c = JFFS2_SB_INFO(inode->i_sb);
  71. unsigned char *pg_buf;
  72. int ret;
  73. jffs2_dbg(2, "%s(): ino #%lu, page at offset 0x%lx\n",
  74. __func__, inode->i_ino, pg->index << PAGE_SHIFT);
  75. BUG_ON(!PageLocked(pg));
  76. pg_buf = kmap(pg);
  77. /* FIXME: Can kmap fail? */
  78. ret = jffs2_read_inode_range(c, f, pg_buf, pg->index << PAGE_SHIFT,
  79. PAGE_SIZE);
  80. if (ret) {
  81. ClearPageUptodate(pg);
  82. SetPageError(pg);
  83. } else {
  84. SetPageUptodate(pg);
  85. ClearPageError(pg);
  86. }
  87. flush_dcache_page(pg);
  88. kunmap(pg);
  89. jffs2_dbg(2, "readpage finished\n");
  90. return ret;
  91. }
  92. int jffs2_do_readpage_unlock(struct inode *inode, struct page *pg)
  93. {
  94. int ret = jffs2_do_readpage_nolock(inode, pg);
  95. unlock_page(pg);
  96. return ret;
  97. }
  98. static int jffs2_readpage (struct file *filp, struct page *pg)
  99. {
  100. struct jffs2_inode_info *f = JFFS2_INODE_INFO(pg->mapping->host);
  101. int ret;
  102. mutex_lock(&f->sem);
  103. ret = jffs2_do_readpage_unlock(pg->mapping->host, pg);
  104. mutex_unlock(&f->sem);
  105. return ret;
  106. }
  107. static int jffs2_write_begin(struct file *filp, struct address_space *mapping,
  108. loff_t pos, unsigned len, unsigned flags,
  109. struct page **pagep, void **fsdata)
  110. {
  111. struct page *pg;
  112. struct inode *inode = mapping->host;
  113. struct jffs2_inode_info *f = JFFS2_INODE_INFO(inode);
  114. pgoff_t index = pos >> PAGE_SHIFT;
  115. uint32_t pageofs = index << PAGE_SHIFT;
  116. int ret = 0;
  117. pg = grab_cache_page_write_begin(mapping, index, flags);
  118. if (!pg)
  119. return -ENOMEM;
  120. *pagep = pg;
  121. jffs2_dbg(1, "%s()\n", __func__);
  122. if (pageofs > inode->i_size) {
  123. /* Make new hole frag from old EOF to new page */
  124. struct jffs2_sb_info *c = JFFS2_SB_INFO(inode->i_sb);
  125. struct jffs2_raw_inode ri;
  126. struct jffs2_full_dnode *fn;
  127. uint32_t alloc_len;
  128. jffs2_dbg(1, "Writing new hole frag 0x%x-0x%x between current EOF and new page\n",
  129. (unsigned int)inode->i_size, pageofs);
  130. ret = jffs2_reserve_space(c, sizeof(ri), &alloc_len,
  131. ALLOC_NORMAL, JFFS2_SUMMARY_INODE_SIZE);
  132. if (ret)
  133. goto out_page;
  134. mutex_lock(&f->sem);
  135. memset(&ri, 0, sizeof(ri));
  136. ri.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
  137. ri.nodetype = cpu_to_je16(JFFS2_NODETYPE_INODE);
  138. ri.totlen = cpu_to_je32(sizeof(ri));
  139. ri.hdr_crc = cpu_to_je32(crc32(0, &ri, sizeof(struct jffs2_unknown_node)-4));
  140. ri.ino = cpu_to_je32(f->inocache->ino);
  141. ri.version = cpu_to_je32(++f->highest_version);
  142. ri.mode = cpu_to_jemode(inode->i_mode);
  143. ri.uid = cpu_to_je16(i_uid_read(inode));
  144. ri.gid = cpu_to_je16(i_gid_read(inode));
  145. ri.isize = cpu_to_je32(max((uint32_t)inode->i_size, pageofs));
  146. ri.atime = ri.ctime = ri.mtime = cpu_to_je32(get_seconds());
  147. ri.offset = cpu_to_je32(inode->i_size);
  148. ri.dsize = cpu_to_je32(pageofs - inode->i_size);
  149. ri.csize = cpu_to_je32(0);
  150. ri.compr = JFFS2_COMPR_ZERO;
  151. ri.node_crc = cpu_to_je32(crc32(0, &ri, sizeof(ri)-8));
  152. ri.data_crc = cpu_to_je32(0);
  153. fn = jffs2_write_dnode(c, f, &ri, NULL, 0, ALLOC_NORMAL);
  154. if (IS_ERR(fn)) {
  155. ret = PTR_ERR(fn);
  156. jffs2_complete_reservation(c);
  157. mutex_unlock(&f->sem);
  158. goto out_page;
  159. }
  160. ret = jffs2_add_full_dnode_to_inode(c, f, fn);
  161. if (f->metadata) {
  162. jffs2_mark_node_obsolete(c, f->metadata->raw);
  163. jffs2_free_full_dnode(f->metadata);
  164. f->metadata = NULL;
  165. }
  166. if (ret) {
  167. jffs2_dbg(1, "Eep. add_full_dnode_to_inode() failed in write_begin, returned %d\n",
  168. ret);
  169. jffs2_mark_node_obsolete(c, fn->raw);
  170. jffs2_free_full_dnode(fn);
  171. jffs2_complete_reservation(c);
  172. mutex_unlock(&f->sem);
  173. goto out_page;
  174. }
  175. jffs2_complete_reservation(c);
  176. inode->i_size = pageofs;
  177. mutex_unlock(&f->sem);
  178. }
  179. /*
  180. * Read in the page if it wasn't already present. Cannot optimize away
  181. * the whole page write case until jffs2_write_end can handle the
  182. * case of a short-copy.
  183. */
  184. if (!PageUptodate(pg)) {
  185. mutex_lock(&f->sem);
  186. ret = jffs2_do_readpage_nolock(inode, pg);
  187. mutex_unlock(&f->sem);
  188. if (ret)
  189. goto out_page;
  190. }
  191. jffs2_dbg(1, "end write_begin(). pg->flags %lx\n", pg->flags);
  192. return ret;
  193. out_page:
  194. unlock_page(pg);
  195. put_page(pg);
  196. return ret;
  197. }
  198. static int jffs2_write_end(struct file *filp, struct address_space *mapping,
  199. loff_t pos, unsigned len, unsigned copied,
  200. struct page *pg, void *fsdata)
  201. {
  202. /* Actually commit the write from the page cache page we're looking at.
  203. * For now, we write the full page out each time. It sucks, but it's simple
  204. */
  205. struct inode *inode = mapping->host;
  206. struct jffs2_inode_info *f = JFFS2_INODE_INFO(inode);
  207. struct jffs2_sb_info *c = JFFS2_SB_INFO(inode->i_sb);
  208. struct jffs2_raw_inode *ri;
  209. unsigned start = pos & (PAGE_SIZE - 1);
  210. unsigned end = start + copied;
  211. unsigned aligned_start = start & ~3;
  212. int ret = 0;
  213. uint32_t writtenlen = 0;
  214. jffs2_dbg(1, "%s(): ino #%lu, page at 0x%lx, range %d-%d, flags %lx\n",
  215. __func__, inode->i_ino, pg->index << PAGE_SHIFT,
  216. start, end, pg->flags);
  217. /* We need to avoid deadlock with page_cache_read() in
  218. jffs2_garbage_collect_pass(). So the page must be
  219. up to date to prevent page_cache_read() from trying
  220. to re-lock it. */
  221. BUG_ON(!PageUptodate(pg));
  222. if (end == PAGE_SIZE) {
  223. /* When writing out the end of a page, write out the
  224. _whole_ page. This helps to reduce the number of
  225. nodes in files which have many short writes, like
  226. syslog files. */
  227. aligned_start = 0;
  228. }
  229. ri = jffs2_alloc_raw_inode();
  230. if (!ri) {
  231. jffs2_dbg(1, "%s(): Allocation of raw inode failed\n",
  232. __func__);
  233. unlock_page(pg);
  234. put_page(pg);
  235. return -ENOMEM;
  236. }
  237. /* Set the fields that the generic jffs2_write_inode_range() code can't find */
  238. ri->ino = cpu_to_je32(inode->i_ino);
  239. ri->mode = cpu_to_jemode(inode->i_mode);
  240. ri->uid = cpu_to_je16(i_uid_read(inode));
  241. ri->gid = cpu_to_je16(i_gid_read(inode));
  242. ri->isize = cpu_to_je32((uint32_t)inode->i_size);
  243. ri->atime = ri->ctime = ri->mtime = cpu_to_je32(get_seconds());
  244. /* In 2.4, it was already kmapped by generic_file_write(). Doesn't
  245. hurt to do it again. The alternative is ifdefs, which are ugly. */
  246. kmap(pg);
  247. ret = jffs2_write_inode_range(c, f, ri, page_address(pg) + aligned_start,
  248. (pg->index << PAGE_SHIFT) + aligned_start,
  249. end - aligned_start, &writtenlen);
  250. kunmap(pg);
  251. if (ret) {
  252. /* There was an error writing. */
  253. SetPageError(pg);
  254. }
  255. /* Adjust writtenlen for the padding we did, so we don't confuse our caller */
  256. writtenlen -= min(writtenlen, (start - aligned_start));
  257. if (writtenlen) {
  258. if (inode->i_size < pos + writtenlen) {
  259. inode->i_size = pos + writtenlen;
  260. inode->i_blocks = (inode->i_size + 511) >> 9;
  261. inode->i_ctime = inode->i_mtime = ITIME(je32_to_cpu(ri->ctime));
  262. }
  263. }
  264. jffs2_free_raw_inode(ri);
  265. if (start+writtenlen < end) {
  266. /* generic_file_write has written more to the page cache than we've
  267. actually written to the medium. Mark the page !Uptodate so that
  268. it gets reread */
  269. jffs2_dbg(1, "%s(): Not all bytes written. Marking page !uptodate\n",
  270. __func__);
  271. SetPageError(pg);
  272. ClearPageUptodate(pg);
  273. }
  274. jffs2_dbg(1, "%s() returning %d\n",
  275. __func__, writtenlen > 0 ? writtenlen : ret);
  276. unlock_page(pg);
  277. put_page(pg);
  278. return writtenlen > 0 ? writtenlen : ret;
  279. }