file.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636
  1. /*
  2. * linux/fs/ext4/file.c
  3. *
  4. * Copyright (C) 1992, 1993, 1994, 1995
  5. * Remy Card (card@masi.ibp.fr)
  6. * Laboratoire MASI - Institut Blaise Pascal
  7. * Universite Pierre et Marie Curie (Paris VI)
  8. *
  9. * from
  10. *
  11. * linux/fs/minix/file.c
  12. *
  13. * Copyright (C) 1991, 1992 Linus Torvalds
  14. *
  15. * ext4 fs regular file handling primitives
  16. *
  17. * 64-bit file support on 64-bit platforms by Jakub Jelinek
  18. * (jj@sunsite.ms.mff.cuni.cz)
  19. */
  20. #include <linux/time.h>
  21. #include <linux/fs.h>
  22. #include <linux/jbd2.h>
  23. #include <linux/mount.h>
  24. #include <linux/path.h>
  25. #include <linux/aio.h>
  26. #include <linux/quotaops.h>
  27. #include <linux/pagevec.h>
  28. #include "ext4.h"
  29. #include "ext4_jbd2.h"
  30. #include "xattr.h"
  31. #include "acl.h"
  32. /*
  33. * Called when an inode is released. Note that this is different
  34. * from ext4_file_open: open gets called at every open, but release
  35. * gets called only when /all/ the files are closed.
  36. */
  37. static int ext4_release_file(struct inode *inode, struct file *filp)
  38. {
  39. if (ext4_test_inode_state(inode, EXT4_STATE_DA_ALLOC_CLOSE)) {
  40. ext4_alloc_da_blocks(inode);
  41. ext4_clear_inode_state(inode, EXT4_STATE_DA_ALLOC_CLOSE);
  42. }
  43. /* if we are the last writer on the inode, drop the block reservation */
  44. if ((filp->f_mode & FMODE_WRITE) &&
  45. (atomic_read(&inode->i_writecount) == 1) &&
  46. !EXT4_I(inode)->i_reserved_data_blocks)
  47. {
  48. down_write(&EXT4_I(inode)->i_data_sem);
  49. ext4_discard_preallocations(inode);
  50. up_write(&EXT4_I(inode)->i_data_sem);
  51. }
  52. if (is_dx(inode) && filp->private_data)
  53. ext4_htree_free_dir_info(filp->private_data);
  54. return 0;
  55. }
  56. static void ext4_unwritten_wait(struct inode *inode)
  57. {
  58. wait_queue_head_t *wq = ext4_ioend_wq(inode);
  59. wait_event(*wq, (atomic_read(&EXT4_I(inode)->i_unwritten) == 0));
  60. }
  61. /*
  62. * This tests whether the IO in question is block-aligned or not.
  63. * Ext4 utilizes unwritten extents when hole-filling during direct IO, and they
  64. * are converted to written only after the IO is complete. Until they are
  65. * mapped, these blocks appear as holes, so dio_zero_block() will assume that
  66. * it needs to zero out portions of the start and/or end block. If 2 AIO
  67. * threads are at work on the same unwritten block, they must be synchronized
  68. * or one thread will zero the other's data, causing corruption.
  69. */
  70. static int
  71. ext4_unaligned_aio(struct inode *inode, struct iov_iter *from, loff_t pos)
  72. {
  73. struct super_block *sb = inode->i_sb;
  74. int blockmask = sb->s_blocksize - 1;
  75. if (pos >= i_size_read(inode))
  76. return 0;
  77. if ((pos | iov_iter_alignment(from)) & blockmask)
  78. return 1;
  79. return 0;
  80. }
  81. static ssize_t
  82. ext4_file_write_iter(struct kiocb *iocb, struct iov_iter *from)
  83. {
  84. struct file *file = iocb->ki_filp;
  85. struct inode *inode = file_inode(iocb->ki_filp);
  86. struct mutex *aio_mutex = NULL;
  87. struct blk_plug plug;
  88. int o_direct = file->f_flags & O_DIRECT;
  89. int overwrite = 0;
  90. size_t length = iov_iter_count(from);
  91. ssize_t ret;
  92. loff_t pos = iocb->ki_pos;
  93. /*
  94. * Unaligned direct AIO must be serialized; see comment above
  95. * In the case of O_APPEND, assume that we must always serialize
  96. */
  97. if (o_direct &&
  98. ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS) &&
  99. !is_sync_kiocb(iocb) &&
  100. (file->f_flags & O_APPEND ||
  101. ext4_unaligned_aio(inode, from, pos))) {
  102. aio_mutex = ext4_aio_mutex(inode);
  103. mutex_lock(aio_mutex);
  104. ext4_unwritten_wait(inode);
  105. }
  106. mutex_lock(&inode->i_mutex);
  107. if (file->f_flags & O_APPEND)
  108. iocb->ki_pos = pos = i_size_read(inode);
  109. /*
  110. * If we have encountered a bitmap-format file, the size limit
  111. * is smaller than s_maxbytes, which is for extent-mapped files.
  112. */
  113. if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS))) {
  114. struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
  115. if ((pos > sbi->s_bitmap_maxbytes) ||
  116. (pos == sbi->s_bitmap_maxbytes && length > 0)) {
  117. mutex_unlock(&inode->i_mutex);
  118. ret = -EFBIG;
  119. goto errout;
  120. }
  121. if (pos + length > sbi->s_bitmap_maxbytes)
  122. iov_iter_truncate(from, sbi->s_bitmap_maxbytes - pos);
  123. }
  124. iocb->private = &overwrite;
  125. if (o_direct) {
  126. blk_start_plug(&plug);
  127. /* check whether we do a DIO overwrite or not */
  128. if (ext4_should_dioread_nolock(inode) && !aio_mutex &&
  129. !file->f_mapping->nrpages && pos + length <= i_size_read(inode)) {
  130. struct ext4_map_blocks map;
  131. unsigned int blkbits = inode->i_blkbits;
  132. int err, len;
  133. map.m_lblk = pos >> blkbits;
  134. map.m_len = (EXT4_BLOCK_ALIGN(pos + length, blkbits) >> blkbits)
  135. - map.m_lblk;
  136. len = map.m_len;
  137. err = ext4_map_blocks(NULL, inode, &map, 0);
  138. /*
  139. * 'err==len' means that all of blocks has
  140. * been preallocated no matter they are
  141. * initialized or not. For excluding
  142. * unwritten extents, we need to check
  143. * m_flags. There are two conditions that
  144. * indicate for initialized extents. 1) If we
  145. * hit extent cache, EXT4_MAP_MAPPED flag is
  146. * returned; 2) If we do a real lookup,
  147. * non-flags are returned. So we should check
  148. * these two conditions.
  149. */
  150. if (err == len && (map.m_flags & EXT4_MAP_MAPPED))
  151. overwrite = 1;
  152. }
  153. }
  154. ret = __generic_file_write_iter(iocb, from);
  155. mutex_unlock(&inode->i_mutex);
  156. if (ret > 0) {
  157. ssize_t err;
  158. err = generic_write_sync(file, iocb->ki_pos - ret, ret);
  159. if (err < 0)
  160. ret = err;
  161. }
  162. if (o_direct)
  163. blk_finish_plug(&plug);
  164. errout:
  165. if (aio_mutex)
  166. mutex_unlock(aio_mutex);
  167. return ret;
  168. }
  169. static const struct vm_operations_struct ext4_file_vm_ops = {
  170. .fault = filemap_fault,
  171. #if 0
  172. .map_pages = filemap_map_pages,
  173. #endif
  174. .page_mkwrite = ext4_page_mkwrite,
  175. .remap_pages = generic_file_remap_pages,
  176. };
  177. static int ext4_file_mmap(struct file *file, struct vm_area_struct *vma)
  178. {
  179. struct inode *inode = file->f_mapping->host;
  180. if (ext4_encrypted_inode(inode)) {
  181. int err = ext4_get_encryption_info(inode);
  182. if (err)
  183. return 0;
  184. if (ext4_encryption_info(inode) == NULL)
  185. return -ENOKEY;
  186. }
  187. file_accessed(file);
  188. vma->vm_ops = &ext4_file_vm_ops;
  189. return 0;
  190. }
  191. static int ext4_file_open(struct inode * inode, struct file * filp)
  192. {
  193. struct super_block *sb = inode->i_sb;
  194. struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
  195. struct vfsmount *mnt = filp->f_path.mnt;
  196. struct path path;
  197. char buf[64], *cp;
  198. int ret;
  199. if (unlikely(!(sbi->s_mount_flags & EXT4_MF_MNTDIR_SAMPLED) &&
  200. !(sb->s_flags & MS_RDONLY))) {
  201. sbi->s_mount_flags |= EXT4_MF_MNTDIR_SAMPLED;
  202. /*
  203. * Sample where the filesystem has been mounted and
  204. * store it in the superblock for sysadmin convenience
  205. * when trying to sort through large numbers of block
  206. * devices or filesystem images.
  207. */
  208. memset(buf, 0, sizeof(buf));
  209. path.mnt = mnt;
  210. path.dentry = mnt->mnt_root;
  211. cp = d_path(&path, buf, sizeof(buf));
  212. if (!IS_ERR(cp)) {
  213. handle_t *handle;
  214. int err;
  215. handle = ext4_journal_start_sb(sb, EXT4_HT_MISC, 1);
  216. if (IS_ERR(handle))
  217. return PTR_ERR(handle);
  218. BUFFER_TRACE(sbi->s_sbh, "get_write_access");
  219. err = ext4_journal_get_write_access(handle, sbi->s_sbh);
  220. if (err) {
  221. ext4_journal_stop(handle);
  222. return err;
  223. }
  224. strlcpy(sbi->s_es->s_last_mounted, cp,
  225. sizeof(sbi->s_es->s_last_mounted));
  226. ext4_handle_dirty_super(handle, sb);
  227. ext4_journal_stop(handle);
  228. }
  229. }
  230. if (ext4_encrypted_inode(inode)) {
  231. ret = ext4_get_encryption_info(inode);
  232. if (ret)
  233. return -EACCES;
  234. if (ext4_encryption_info(inode) == NULL)
  235. return -ENOKEY;
  236. }
  237. /*
  238. * Set up the jbd2_inode if we are opening the inode for
  239. * writing and the journal is present
  240. */
  241. if (filp->f_mode & FMODE_WRITE) {
  242. ret = ext4_inode_attach_jinode(inode);
  243. if (ret < 0)
  244. return ret;
  245. }
  246. return dquot_file_open(inode, filp);
  247. }
  248. /*
  249. * Here we use ext4_map_blocks() to get a block mapping for a extent-based
  250. * file rather than ext4_ext_walk_space() because we can introduce
  251. * SEEK_DATA/SEEK_HOLE for block-mapped and extent-mapped file at the same
  252. * function. When extent status tree has been fully implemented, it will
  253. * track all extent status for a file and we can directly use it to
  254. * retrieve the offset for SEEK_DATA/SEEK_HOLE.
  255. */
  256. /*
  257. * When we retrieve the offset for SEEK_DATA/SEEK_HOLE, we would need to
  258. * lookup page cache to check whether or not there has some data between
  259. * [startoff, endoff] because, if this range contains an unwritten extent,
  260. * we determine this extent as a data or a hole according to whether the
  261. * page cache has data or not.
  262. */
  263. static int ext4_find_unwritten_pgoff(struct inode *inode,
  264. int whence,
  265. struct ext4_map_blocks *map,
  266. loff_t *offset)
  267. {
  268. struct pagevec pvec;
  269. unsigned int blkbits;
  270. pgoff_t index;
  271. pgoff_t end;
  272. loff_t endoff;
  273. loff_t startoff;
  274. loff_t lastoff;
  275. int found = 0;
  276. blkbits = inode->i_sb->s_blocksize_bits;
  277. startoff = *offset;
  278. lastoff = startoff;
  279. endoff = (loff_t)(map->m_lblk + map->m_len) << blkbits;
  280. index = startoff >> PAGE_CACHE_SHIFT;
  281. end = endoff >> PAGE_CACHE_SHIFT;
  282. pagevec_init(&pvec, 0);
  283. do {
  284. int i, num;
  285. unsigned long nr_pages;
  286. num = min_t(pgoff_t, end - index, PAGEVEC_SIZE);
  287. nr_pages = pagevec_lookup(&pvec, inode->i_mapping, index,
  288. (pgoff_t)num);
  289. if (nr_pages == 0) {
  290. if (whence == SEEK_DATA)
  291. break;
  292. BUG_ON(whence != SEEK_HOLE);
  293. /*
  294. * If this is the first time to go into the loop and
  295. * offset is not beyond the end offset, it will be a
  296. * hole at this offset
  297. */
  298. if (lastoff == startoff || lastoff < endoff)
  299. found = 1;
  300. break;
  301. }
  302. /*
  303. * If this is the first time to go into the loop and
  304. * offset is smaller than the first page offset, it will be a
  305. * hole at this offset.
  306. */
  307. if (lastoff == startoff && whence == SEEK_HOLE &&
  308. lastoff < page_offset(pvec.pages[0])) {
  309. found = 1;
  310. break;
  311. }
  312. for (i = 0; i < nr_pages; i++) {
  313. struct page *page = pvec.pages[i];
  314. struct buffer_head *bh, *head;
  315. /*
  316. * If the current offset is not beyond the end of given
  317. * range, it will be a hole.
  318. */
  319. if (lastoff < endoff && whence == SEEK_HOLE &&
  320. page->index > end) {
  321. found = 1;
  322. *offset = lastoff;
  323. goto out;
  324. }
  325. lock_page(page);
  326. if (unlikely(page->mapping != inode->i_mapping)) {
  327. unlock_page(page);
  328. continue;
  329. }
  330. if (!page_has_buffers(page)) {
  331. unlock_page(page);
  332. continue;
  333. }
  334. if (page_has_buffers(page)) {
  335. lastoff = page_offset(page);
  336. bh = head = page_buffers(page);
  337. do {
  338. if (buffer_uptodate(bh) ||
  339. buffer_unwritten(bh)) {
  340. if (whence == SEEK_DATA)
  341. found = 1;
  342. } else {
  343. if (whence == SEEK_HOLE)
  344. found = 1;
  345. }
  346. if (found) {
  347. *offset = max_t(loff_t,
  348. startoff, lastoff);
  349. unlock_page(page);
  350. goto out;
  351. }
  352. lastoff += bh->b_size;
  353. bh = bh->b_this_page;
  354. } while (bh != head);
  355. }
  356. lastoff = page_offset(page) + PAGE_SIZE;
  357. unlock_page(page);
  358. }
  359. /*
  360. * The no. of pages is less than our desired, that would be a
  361. * hole in there.
  362. */
  363. if (nr_pages < num && whence == SEEK_HOLE) {
  364. found = 1;
  365. *offset = lastoff;
  366. break;
  367. }
  368. index = pvec.pages[i - 1]->index + 1;
  369. pagevec_release(&pvec);
  370. } while (index <= end);
  371. out:
  372. pagevec_release(&pvec);
  373. return found;
  374. }
  375. /*
  376. * ext4_seek_data() retrieves the offset for SEEK_DATA.
  377. */
  378. static loff_t ext4_seek_data(struct file *file, loff_t offset, loff_t maxsize)
  379. {
  380. struct inode *inode = file->f_mapping->host;
  381. struct ext4_map_blocks map;
  382. struct extent_status es;
  383. ext4_lblk_t start, last, end;
  384. loff_t dataoff, isize;
  385. int blkbits;
  386. int ret = 0;
  387. mutex_lock(&inode->i_mutex);
  388. isize = i_size_read(inode);
  389. if (offset >= isize) {
  390. mutex_unlock(&inode->i_mutex);
  391. return -ENXIO;
  392. }
  393. blkbits = inode->i_sb->s_blocksize_bits;
  394. start = offset >> blkbits;
  395. last = start;
  396. end = isize >> blkbits;
  397. dataoff = offset;
  398. do {
  399. map.m_lblk = last;
  400. map.m_len = end - last + 1;
  401. ret = ext4_map_blocks(NULL, inode, &map, 0);
  402. if (ret > 0 && !(map.m_flags & EXT4_MAP_UNWRITTEN)) {
  403. if (last != start)
  404. dataoff = (loff_t)last << blkbits;
  405. break;
  406. }
  407. /*
  408. * If there is a delay extent at this offset,
  409. * it will be as a data.
  410. */
  411. ext4_es_find_delayed_extent_range(inode, last, last, &es);
  412. if (es.es_len != 0 && in_range(last, es.es_lblk, es.es_len)) {
  413. if (last != start)
  414. dataoff = (loff_t)last << blkbits;
  415. break;
  416. }
  417. /*
  418. * If there is a unwritten extent at this offset,
  419. * it will be as a data or a hole according to page
  420. * cache that has data or not.
  421. */
  422. if (map.m_flags & EXT4_MAP_UNWRITTEN) {
  423. int unwritten;
  424. unwritten = ext4_find_unwritten_pgoff(inode, SEEK_DATA,
  425. &map, &dataoff);
  426. if (unwritten)
  427. break;
  428. }
  429. last++;
  430. dataoff = (loff_t)last << blkbits;
  431. } while (last <= end);
  432. mutex_unlock(&inode->i_mutex);
  433. if (dataoff > isize)
  434. return -ENXIO;
  435. return vfs_setpos(file, dataoff, maxsize);
  436. }
  437. /*
  438. * ext4_seek_hole() retrieves the offset for SEEK_HOLE.
  439. */
  440. static loff_t ext4_seek_hole(struct file *file, loff_t offset, loff_t maxsize)
  441. {
  442. struct inode *inode = file->f_mapping->host;
  443. struct ext4_map_blocks map;
  444. struct extent_status es;
  445. ext4_lblk_t start, last, end;
  446. loff_t holeoff, isize;
  447. int blkbits;
  448. int ret = 0;
  449. mutex_lock(&inode->i_mutex);
  450. isize = i_size_read(inode);
  451. if (offset >= isize) {
  452. mutex_unlock(&inode->i_mutex);
  453. return -ENXIO;
  454. }
  455. blkbits = inode->i_sb->s_blocksize_bits;
  456. start = offset >> blkbits;
  457. last = start;
  458. end = isize >> blkbits;
  459. holeoff = offset;
  460. do {
  461. map.m_lblk = last;
  462. map.m_len = end - last + 1;
  463. ret = ext4_map_blocks(NULL, inode, &map, 0);
  464. if (ret > 0 && !(map.m_flags & EXT4_MAP_UNWRITTEN)) {
  465. last += ret;
  466. holeoff = (loff_t)last << blkbits;
  467. continue;
  468. }
  469. /*
  470. * If there is a delay extent at this offset,
  471. * we will skip this extent.
  472. */
  473. ext4_es_find_delayed_extent_range(inode, last, last, &es);
  474. if (es.es_len != 0 && in_range(last, es.es_lblk, es.es_len)) {
  475. last = es.es_lblk + es.es_len;
  476. holeoff = (loff_t)last << blkbits;
  477. continue;
  478. }
  479. /*
  480. * If there is a unwritten extent at this offset,
  481. * it will be as a data or a hole according to page
  482. * cache that has data or not.
  483. */
  484. if (map.m_flags & EXT4_MAP_UNWRITTEN) {
  485. int unwritten;
  486. unwritten = ext4_find_unwritten_pgoff(inode, SEEK_HOLE,
  487. &map, &holeoff);
  488. if (!unwritten) {
  489. last += ret;
  490. holeoff = (loff_t)last << blkbits;
  491. continue;
  492. }
  493. }
  494. /* find a hole */
  495. break;
  496. } while (last <= end);
  497. mutex_unlock(&inode->i_mutex);
  498. if (holeoff > isize)
  499. holeoff = isize;
  500. return vfs_setpos(file, holeoff, maxsize);
  501. }
  502. /*
  503. * ext4_llseek() handles both block-mapped and extent-mapped maxbytes values
  504. * by calling generic_file_llseek_size() with the appropriate maxbytes
  505. * value for each.
  506. */
  507. loff_t ext4_llseek(struct file *file, loff_t offset, int whence)
  508. {
  509. struct inode *inode = file->f_mapping->host;
  510. loff_t maxbytes;
  511. if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS)))
  512. maxbytes = EXT4_SB(inode->i_sb)->s_bitmap_maxbytes;
  513. else
  514. maxbytes = inode->i_sb->s_maxbytes;
  515. switch (whence) {
  516. case SEEK_SET:
  517. case SEEK_CUR:
  518. case SEEK_END:
  519. return generic_file_llseek_size(file, offset, whence,
  520. maxbytes, i_size_read(inode));
  521. case SEEK_DATA:
  522. return ext4_seek_data(file, offset, maxbytes);
  523. case SEEK_HOLE:
  524. return ext4_seek_hole(file, offset, maxbytes);
  525. }
  526. return -EINVAL;
  527. }
  528. const struct file_operations ext4_file_operations = {
  529. .llseek = ext4_llseek,
  530. .read = new_sync_read,
  531. .write = new_sync_write,
  532. .read_iter = generic_file_read_iter,
  533. .write_iter = ext4_file_write_iter,
  534. .unlocked_ioctl = ext4_ioctl,
  535. #ifdef CONFIG_COMPAT
  536. .compat_ioctl = ext4_compat_ioctl,
  537. #endif
  538. .mmap = ext4_file_mmap,
  539. .open = ext4_file_open,
  540. .release = ext4_release_file,
  541. .fsync = ext4_sync_file,
  542. .splice_read = generic_file_splice_read,
  543. .splice_write = iter_file_splice_write,
  544. .fallocate = ext4_fallocate,
  545. };
  546. const struct inode_operations ext4_file_inode_operations = {
  547. .setattr = ext4_setattr,
  548. .getattr = ext4_getattr,
  549. .setxattr = generic_setxattr,
  550. .getxattr = generic_getxattr,
  551. .listxattr = ext4_listxattr,
  552. .removexattr = generic_removexattr,
  553. .get_acl = ext4_get_acl,
  554. #if 0
  555. .set_acl = ext4_set_acl,
  556. #endif
  557. .fiemap = ext4_fiemap,
  558. };