file.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760
  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/mount.h>
  23. #include <linux/path.h>
  24. #include <linux/dax.h>
  25. #include <linux/quotaops.h>
  26. #include <linux/pagevec.h>
  27. #include <linux/uio.h>
  28. #include "ext4.h"
  29. #include "ext4_jbd2.h"
  30. #include "xattr.h"
  31. #include "acl.h"
  32. #ifdef CONFIG_FS_DAX
  33. static ssize_t ext4_dax_read_iter(struct kiocb *iocb, struct iov_iter *to)
  34. {
  35. struct inode *inode = file_inode(iocb->ki_filp);
  36. ssize_t ret;
  37. if (!inode_trylock_shared(inode)) {
  38. if (iocb->ki_flags & IOCB_NOWAIT)
  39. return -EAGAIN;
  40. inode_lock_shared(inode);
  41. }
  42. /*
  43. * Recheck under inode lock - at this point we are sure it cannot
  44. * change anymore
  45. */
  46. if (!IS_DAX(inode)) {
  47. inode_unlock_shared(inode);
  48. /* Fallback to buffered IO in case we cannot support DAX */
  49. return generic_file_read_iter(iocb, to);
  50. }
  51. ret = dax_iomap_rw(iocb, to, &ext4_iomap_ops);
  52. inode_unlock_shared(inode);
  53. file_accessed(iocb->ki_filp);
  54. return ret;
  55. }
  56. #endif
  57. static ssize_t ext4_file_read_iter(struct kiocb *iocb, struct iov_iter *to)
  58. {
  59. if (unlikely(ext4_forced_shutdown(EXT4_SB(file_inode(iocb->ki_filp)->i_sb))))
  60. return -EIO;
  61. if (!iov_iter_count(to))
  62. return 0; /* skip atime */
  63. #ifdef CONFIG_FS_DAX
  64. if (IS_DAX(file_inode(iocb->ki_filp)))
  65. return ext4_dax_read_iter(iocb, to);
  66. #endif
  67. return generic_file_read_iter(iocb, to);
  68. }
  69. /*
  70. * Called when an inode is released. Note that this is different
  71. * from ext4_file_open: open gets called at every open, but release
  72. * gets called only when /all/ the files are closed.
  73. */
  74. static int ext4_release_file(struct inode *inode, struct file *filp)
  75. {
  76. if (ext4_test_inode_state(inode, EXT4_STATE_DA_ALLOC_CLOSE)) {
  77. ext4_alloc_da_blocks(inode);
  78. ext4_clear_inode_state(inode, EXT4_STATE_DA_ALLOC_CLOSE);
  79. }
  80. /* if we are the last writer on the inode, drop the block reservation */
  81. if ((filp->f_mode & FMODE_WRITE) &&
  82. (atomic_read(&inode->i_writecount) == 1) &&
  83. !EXT4_I(inode)->i_reserved_data_blocks)
  84. {
  85. down_write(&EXT4_I(inode)->i_data_sem);
  86. ext4_discard_preallocations(inode);
  87. up_write(&EXT4_I(inode)->i_data_sem);
  88. }
  89. if (is_dx(inode) && filp->private_data)
  90. ext4_htree_free_dir_info(filp->private_data);
  91. return 0;
  92. }
  93. static void ext4_unwritten_wait(struct inode *inode)
  94. {
  95. wait_queue_head_t *wq = ext4_ioend_wq(inode);
  96. wait_event(*wq, (atomic_read(&EXT4_I(inode)->i_unwritten) == 0));
  97. }
  98. /*
  99. * This tests whether the IO in question is block-aligned or not.
  100. * Ext4 utilizes unwritten extents when hole-filling during direct IO, and they
  101. * are converted to written only after the IO is complete. Until they are
  102. * mapped, these blocks appear as holes, so dio_zero_block() will assume that
  103. * it needs to zero out portions of the start and/or end block. If 2 AIO
  104. * threads are at work on the same unwritten block, they must be synchronized
  105. * or one thread will zero the other's data, causing corruption.
  106. */
  107. static int
  108. ext4_unaligned_aio(struct inode *inode, struct iov_iter *from, loff_t pos)
  109. {
  110. struct super_block *sb = inode->i_sb;
  111. int blockmask = sb->s_blocksize - 1;
  112. if (pos >= i_size_read(inode))
  113. return 0;
  114. if ((pos | iov_iter_alignment(from)) & blockmask)
  115. return 1;
  116. return 0;
  117. }
  118. /* Is IO overwriting allocated and initialized blocks? */
  119. static bool ext4_overwrite_io(struct inode *inode, loff_t pos, loff_t len)
  120. {
  121. struct ext4_map_blocks map;
  122. unsigned int blkbits = inode->i_blkbits;
  123. int err, blklen;
  124. if (pos + len > i_size_read(inode))
  125. return false;
  126. map.m_lblk = pos >> blkbits;
  127. map.m_len = EXT4_MAX_BLOCKS(len, pos, blkbits);
  128. blklen = map.m_len;
  129. err = ext4_map_blocks(NULL, inode, &map, 0);
  130. /*
  131. * 'err==len' means that all of the blocks have been preallocated,
  132. * regardless of whether they have been initialized or not. To exclude
  133. * unwritten extents, we need to check m_flags.
  134. */
  135. return err == blklen && (map.m_flags & EXT4_MAP_MAPPED);
  136. }
  137. static ssize_t ext4_write_checks(struct kiocb *iocb, struct iov_iter *from)
  138. {
  139. struct inode *inode = file_inode(iocb->ki_filp);
  140. ssize_t ret;
  141. ret = generic_write_checks(iocb, from);
  142. if (ret <= 0)
  143. return ret;
  144. /*
  145. * If we have encountered a bitmap-format file, the size limit
  146. * is smaller than s_maxbytes, which is for extent-mapped files.
  147. */
  148. if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS))) {
  149. struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
  150. if (iocb->ki_pos >= sbi->s_bitmap_maxbytes)
  151. return -EFBIG;
  152. iov_iter_truncate(from, sbi->s_bitmap_maxbytes - iocb->ki_pos);
  153. }
  154. return iov_iter_count(from);
  155. }
  156. #ifdef CONFIG_FS_DAX
  157. static ssize_t
  158. ext4_dax_write_iter(struct kiocb *iocb, struct iov_iter *from)
  159. {
  160. struct inode *inode = file_inode(iocb->ki_filp);
  161. ssize_t ret;
  162. if (!inode_trylock(inode)) {
  163. if (iocb->ki_flags & IOCB_NOWAIT)
  164. return -EAGAIN;
  165. inode_lock(inode);
  166. }
  167. ret = ext4_write_checks(iocb, from);
  168. if (ret <= 0)
  169. goto out;
  170. ret = file_remove_privs(iocb->ki_filp);
  171. if (ret)
  172. goto out;
  173. ret = file_update_time(iocb->ki_filp);
  174. if (ret)
  175. goto out;
  176. ret = dax_iomap_rw(iocb, from, &ext4_iomap_ops);
  177. out:
  178. inode_unlock(inode);
  179. if (ret > 0)
  180. ret = generic_write_sync(iocb, ret);
  181. return ret;
  182. }
  183. #endif
  184. static ssize_t
  185. ext4_file_write_iter(struct kiocb *iocb, struct iov_iter *from)
  186. {
  187. struct inode *inode = file_inode(iocb->ki_filp);
  188. int o_direct = iocb->ki_flags & IOCB_DIRECT;
  189. int unaligned_aio = 0;
  190. int overwrite = 0;
  191. ssize_t ret;
  192. if (unlikely(ext4_forced_shutdown(EXT4_SB(inode->i_sb))))
  193. return -EIO;
  194. #ifdef CONFIG_FS_DAX
  195. if (IS_DAX(inode))
  196. return ext4_dax_write_iter(iocb, from);
  197. #endif
  198. if (!inode_trylock(inode)) {
  199. if (iocb->ki_flags & IOCB_NOWAIT)
  200. return -EAGAIN;
  201. inode_lock(inode);
  202. }
  203. ret = ext4_write_checks(iocb, from);
  204. if (ret <= 0)
  205. goto out;
  206. /*
  207. * Unaligned direct AIO must be serialized among each other as zeroing
  208. * of partial blocks of two competing unaligned AIOs can result in data
  209. * corruption.
  210. */
  211. if (o_direct && ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS) &&
  212. !is_sync_kiocb(iocb) &&
  213. ext4_unaligned_aio(inode, from, iocb->ki_pos)) {
  214. unaligned_aio = 1;
  215. ext4_unwritten_wait(inode);
  216. }
  217. iocb->private = &overwrite;
  218. /* Check whether we do a DIO overwrite or not */
  219. if (o_direct && !unaligned_aio) {
  220. if (ext4_overwrite_io(inode, iocb->ki_pos, iov_iter_count(from))) {
  221. if (ext4_should_dioread_nolock(inode))
  222. overwrite = 1;
  223. } else if (iocb->ki_flags & IOCB_NOWAIT) {
  224. ret = -EAGAIN;
  225. goto out;
  226. }
  227. }
  228. ret = __generic_file_write_iter(iocb, from);
  229. inode_unlock(inode);
  230. if (ret > 0)
  231. ret = generic_write_sync(iocb, ret);
  232. return ret;
  233. out:
  234. inode_unlock(inode);
  235. return ret;
  236. }
  237. #ifdef CONFIG_FS_DAX
  238. static int ext4_dax_huge_fault(struct vm_fault *vmf,
  239. enum page_entry_size pe_size)
  240. {
  241. int result;
  242. handle_t *handle = NULL;
  243. struct inode *inode = file_inode(vmf->vma->vm_file);
  244. struct super_block *sb = inode->i_sb;
  245. bool write = vmf->flags & FAULT_FLAG_WRITE;
  246. if (write) {
  247. sb_start_pagefault(sb);
  248. file_update_time(vmf->vma->vm_file);
  249. down_read(&EXT4_I(inode)->i_mmap_sem);
  250. handle = ext4_journal_start_sb(sb, EXT4_HT_WRITE_PAGE,
  251. EXT4_DATA_TRANS_BLOCKS(sb));
  252. } else {
  253. down_read(&EXT4_I(inode)->i_mmap_sem);
  254. }
  255. if (!IS_ERR(handle))
  256. result = dax_iomap_fault(vmf, pe_size, &ext4_iomap_ops);
  257. else
  258. result = VM_FAULT_SIGBUS;
  259. if (write) {
  260. if (!IS_ERR(handle))
  261. ext4_journal_stop(handle);
  262. up_read(&EXT4_I(inode)->i_mmap_sem);
  263. sb_end_pagefault(sb);
  264. } else {
  265. up_read(&EXT4_I(inode)->i_mmap_sem);
  266. }
  267. return result;
  268. }
  269. static int ext4_dax_fault(struct vm_fault *vmf)
  270. {
  271. return ext4_dax_huge_fault(vmf, PE_SIZE_PTE);
  272. }
  273. /*
  274. * Handle write fault for VM_MIXEDMAP mappings. Similarly to ext4_dax_fault()
  275. * handler we check for races agaist truncate. Note that since we cycle through
  276. * i_mmap_sem, we are sure that also any hole punching that began before we
  277. * were called is finished by now and so if it included part of the file we
  278. * are working on, our pte will get unmapped and the check for pte_same() in
  279. * wp_pfn_shared() fails. Thus fault gets retried and things work out as
  280. * desired.
  281. */
  282. static int ext4_dax_pfn_mkwrite(struct vm_fault *vmf)
  283. {
  284. struct inode *inode = file_inode(vmf->vma->vm_file);
  285. struct super_block *sb = inode->i_sb;
  286. loff_t size;
  287. int ret;
  288. sb_start_pagefault(sb);
  289. file_update_time(vmf->vma->vm_file);
  290. down_read(&EXT4_I(inode)->i_mmap_sem);
  291. size = (i_size_read(inode) + PAGE_SIZE - 1) >> PAGE_SHIFT;
  292. if (vmf->pgoff >= size)
  293. ret = VM_FAULT_SIGBUS;
  294. else
  295. ret = dax_pfn_mkwrite(vmf);
  296. up_read(&EXT4_I(inode)->i_mmap_sem);
  297. sb_end_pagefault(sb);
  298. return ret;
  299. }
  300. static const struct vm_operations_struct ext4_dax_vm_ops = {
  301. .fault = ext4_dax_fault,
  302. .huge_fault = ext4_dax_huge_fault,
  303. .page_mkwrite = ext4_dax_fault,
  304. .pfn_mkwrite = ext4_dax_pfn_mkwrite,
  305. };
  306. #else
  307. #define ext4_dax_vm_ops ext4_file_vm_ops
  308. #endif
  309. static const struct vm_operations_struct ext4_file_vm_ops = {
  310. .fault = ext4_filemap_fault,
  311. .map_pages = filemap_map_pages,
  312. .page_mkwrite = ext4_page_mkwrite,
  313. };
  314. static int ext4_file_mmap(struct file *file, struct vm_area_struct *vma)
  315. {
  316. struct inode *inode = file->f_mapping->host;
  317. if (unlikely(ext4_forced_shutdown(EXT4_SB(inode->i_sb))))
  318. return -EIO;
  319. file_accessed(file);
  320. if (IS_DAX(file_inode(file))) {
  321. vma->vm_ops = &ext4_dax_vm_ops;
  322. vma->vm_flags |= VM_MIXEDMAP | VM_HUGEPAGE;
  323. } else {
  324. vma->vm_ops = &ext4_file_vm_ops;
  325. }
  326. return 0;
  327. }
  328. static int ext4_file_open(struct inode * inode, struct file * filp)
  329. {
  330. struct super_block *sb = inode->i_sb;
  331. struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
  332. struct vfsmount *mnt = filp->f_path.mnt;
  333. struct dentry *dir;
  334. struct path path;
  335. char buf[64], *cp;
  336. int ret;
  337. if (unlikely(ext4_forced_shutdown(EXT4_SB(inode->i_sb))))
  338. return -EIO;
  339. if (unlikely(!(sbi->s_mount_flags & EXT4_MF_MNTDIR_SAMPLED) &&
  340. !sb_rdonly(sb))) {
  341. sbi->s_mount_flags |= EXT4_MF_MNTDIR_SAMPLED;
  342. /*
  343. * Sample where the filesystem has been mounted and
  344. * store it in the superblock for sysadmin convenience
  345. * when trying to sort through large numbers of block
  346. * devices or filesystem images.
  347. */
  348. memset(buf, 0, sizeof(buf));
  349. path.mnt = mnt;
  350. path.dentry = mnt->mnt_root;
  351. cp = d_path(&path, buf, sizeof(buf));
  352. if (!IS_ERR(cp)) {
  353. handle_t *handle;
  354. int err;
  355. handle = ext4_journal_start_sb(sb, EXT4_HT_MISC, 1);
  356. if (IS_ERR(handle))
  357. return PTR_ERR(handle);
  358. BUFFER_TRACE(sbi->s_sbh, "get_write_access");
  359. err = ext4_journal_get_write_access(handle, sbi->s_sbh);
  360. if (err) {
  361. ext4_journal_stop(handle);
  362. return err;
  363. }
  364. strlcpy(sbi->s_es->s_last_mounted, cp,
  365. sizeof(sbi->s_es->s_last_mounted));
  366. ext4_handle_dirty_super(handle, sb);
  367. ext4_journal_stop(handle);
  368. }
  369. }
  370. if (ext4_encrypted_inode(inode)) {
  371. ret = fscrypt_get_encryption_info(inode);
  372. if (ret)
  373. return -EACCES;
  374. if (!fscrypt_has_encryption_key(inode))
  375. return -ENOKEY;
  376. }
  377. dir = dget_parent(file_dentry(filp));
  378. if (ext4_encrypted_inode(d_inode(dir)) &&
  379. !fscrypt_has_permitted_context(d_inode(dir), inode)) {
  380. ext4_warning(inode->i_sb,
  381. "Inconsistent encryption contexts: %lu/%lu",
  382. (unsigned long) d_inode(dir)->i_ino,
  383. (unsigned long) inode->i_ino);
  384. dput(dir);
  385. return -EPERM;
  386. }
  387. dput(dir);
  388. /*
  389. * Set up the jbd2_inode if we are opening the inode for
  390. * writing and the journal is present
  391. */
  392. if (filp->f_mode & FMODE_WRITE) {
  393. ret = ext4_inode_attach_jinode(inode);
  394. if (ret < 0)
  395. return ret;
  396. }
  397. /* Set the flags to support nowait AIO */
  398. filp->f_mode |= FMODE_AIO_NOWAIT;
  399. return dquot_file_open(inode, filp);
  400. }
  401. /*
  402. * Here we use ext4_map_blocks() to get a block mapping for a extent-based
  403. * file rather than ext4_ext_walk_space() because we can introduce
  404. * SEEK_DATA/SEEK_HOLE for block-mapped and extent-mapped file at the same
  405. * function. When extent status tree has been fully implemented, it will
  406. * track all extent status for a file and we can directly use it to
  407. * retrieve the offset for SEEK_DATA/SEEK_HOLE.
  408. */
  409. /*
  410. * When we retrieve the offset for SEEK_DATA/SEEK_HOLE, we would need to
  411. * lookup page cache to check whether or not there has some data between
  412. * [startoff, endoff] because, if this range contains an unwritten extent,
  413. * we determine this extent as a data or a hole according to whether the
  414. * page cache has data or not.
  415. */
  416. static int ext4_find_unwritten_pgoff(struct inode *inode,
  417. int whence,
  418. ext4_lblk_t end_blk,
  419. loff_t *offset)
  420. {
  421. struct pagevec pvec;
  422. unsigned int blkbits;
  423. pgoff_t index;
  424. pgoff_t end;
  425. loff_t endoff;
  426. loff_t startoff;
  427. loff_t lastoff;
  428. int found = 0;
  429. blkbits = inode->i_sb->s_blocksize_bits;
  430. startoff = *offset;
  431. lastoff = startoff;
  432. endoff = (loff_t)end_blk << blkbits;
  433. index = startoff >> PAGE_SHIFT;
  434. end = (endoff - 1) >> PAGE_SHIFT;
  435. pagevec_init(&pvec, 0);
  436. do {
  437. int i, num;
  438. unsigned long nr_pages;
  439. num = min_t(pgoff_t, end - index, PAGEVEC_SIZE - 1) + 1;
  440. nr_pages = pagevec_lookup(&pvec, inode->i_mapping, index,
  441. (pgoff_t)num);
  442. if (nr_pages == 0)
  443. break;
  444. for (i = 0; i < nr_pages; i++) {
  445. struct page *page = pvec.pages[i];
  446. struct buffer_head *bh, *head;
  447. /*
  448. * If current offset is smaller than the page offset,
  449. * there is a hole at this offset.
  450. */
  451. if (whence == SEEK_HOLE && lastoff < endoff &&
  452. lastoff < page_offset(pvec.pages[i])) {
  453. found = 1;
  454. *offset = lastoff;
  455. goto out;
  456. }
  457. if (page->index > end)
  458. goto out;
  459. lock_page(page);
  460. if (unlikely(page->mapping != inode->i_mapping)) {
  461. unlock_page(page);
  462. continue;
  463. }
  464. if (!page_has_buffers(page)) {
  465. unlock_page(page);
  466. continue;
  467. }
  468. if (page_has_buffers(page)) {
  469. lastoff = page_offset(page);
  470. bh = head = page_buffers(page);
  471. do {
  472. if (buffer_uptodate(bh) ||
  473. buffer_unwritten(bh)) {
  474. if (whence == SEEK_DATA)
  475. found = 1;
  476. } else {
  477. if (whence == SEEK_HOLE)
  478. found = 1;
  479. }
  480. if (found) {
  481. *offset = max_t(loff_t,
  482. startoff, lastoff);
  483. unlock_page(page);
  484. goto out;
  485. }
  486. lastoff += bh->b_size;
  487. bh = bh->b_this_page;
  488. } while (bh != head);
  489. }
  490. lastoff = page_offset(page) + PAGE_SIZE;
  491. unlock_page(page);
  492. }
  493. /* The no. of pages is less than our desired, we are done. */
  494. if (nr_pages < num)
  495. break;
  496. index = pvec.pages[i - 1]->index + 1;
  497. pagevec_release(&pvec);
  498. } while (index <= end);
  499. if (whence == SEEK_HOLE && lastoff < endoff) {
  500. found = 1;
  501. *offset = lastoff;
  502. }
  503. out:
  504. pagevec_release(&pvec);
  505. return found;
  506. }
  507. /*
  508. * ext4_seek_data() retrieves the offset for SEEK_DATA.
  509. */
  510. static loff_t ext4_seek_data(struct file *file, loff_t offset, loff_t maxsize)
  511. {
  512. struct inode *inode = file->f_mapping->host;
  513. struct extent_status es;
  514. ext4_lblk_t start, last, end;
  515. loff_t dataoff, isize;
  516. int blkbits;
  517. int ret;
  518. inode_lock(inode);
  519. isize = i_size_read(inode);
  520. if (offset >= isize) {
  521. inode_unlock(inode);
  522. return -ENXIO;
  523. }
  524. blkbits = inode->i_sb->s_blocksize_bits;
  525. start = offset >> blkbits;
  526. last = start;
  527. end = isize >> blkbits;
  528. dataoff = offset;
  529. do {
  530. ret = ext4_get_next_extent(inode, last, end - last + 1, &es);
  531. if (ret <= 0) {
  532. /* No extent found -> no data */
  533. if (ret == 0)
  534. ret = -ENXIO;
  535. inode_unlock(inode);
  536. return ret;
  537. }
  538. last = es.es_lblk;
  539. if (last != start)
  540. dataoff = (loff_t)last << blkbits;
  541. if (!ext4_es_is_unwritten(&es))
  542. break;
  543. /*
  544. * If there is a unwritten extent at this offset,
  545. * it will be as a data or a hole according to page
  546. * cache that has data or not.
  547. */
  548. if (ext4_find_unwritten_pgoff(inode, SEEK_DATA,
  549. es.es_lblk + es.es_len, &dataoff))
  550. break;
  551. last += es.es_len;
  552. dataoff = (loff_t)last << blkbits;
  553. cond_resched();
  554. } while (last <= end);
  555. inode_unlock(inode);
  556. if (dataoff > isize)
  557. return -ENXIO;
  558. return vfs_setpos(file, dataoff, maxsize);
  559. }
  560. /*
  561. * ext4_seek_hole() retrieves the offset for SEEK_HOLE.
  562. */
  563. static loff_t ext4_seek_hole(struct file *file, loff_t offset, loff_t maxsize)
  564. {
  565. struct inode *inode = file->f_mapping->host;
  566. struct extent_status es;
  567. ext4_lblk_t start, last, end;
  568. loff_t holeoff, isize;
  569. int blkbits;
  570. int ret;
  571. inode_lock(inode);
  572. isize = i_size_read(inode);
  573. if (offset >= isize) {
  574. inode_unlock(inode);
  575. return -ENXIO;
  576. }
  577. blkbits = inode->i_sb->s_blocksize_bits;
  578. start = offset >> blkbits;
  579. last = start;
  580. end = isize >> blkbits;
  581. holeoff = offset;
  582. do {
  583. ret = ext4_get_next_extent(inode, last, end - last + 1, &es);
  584. if (ret < 0) {
  585. inode_unlock(inode);
  586. return ret;
  587. }
  588. /* Found a hole? */
  589. if (ret == 0 || es.es_lblk > last) {
  590. if (last != start)
  591. holeoff = (loff_t)last << blkbits;
  592. break;
  593. }
  594. /*
  595. * If there is a unwritten extent at this offset,
  596. * it will be as a data or a hole according to page
  597. * cache that has data or not.
  598. */
  599. if (ext4_es_is_unwritten(&es) &&
  600. ext4_find_unwritten_pgoff(inode, SEEK_HOLE,
  601. last + es.es_len, &holeoff))
  602. break;
  603. last += es.es_len;
  604. holeoff = (loff_t)last << blkbits;
  605. cond_resched();
  606. } while (last <= end);
  607. inode_unlock(inode);
  608. if (holeoff > isize)
  609. holeoff = isize;
  610. return vfs_setpos(file, holeoff, maxsize);
  611. }
  612. /*
  613. * ext4_llseek() handles both block-mapped and extent-mapped maxbytes values
  614. * by calling generic_file_llseek_size() with the appropriate maxbytes
  615. * value for each.
  616. */
  617. loff_t ext4_llseek(struct file *file, loff_t offset, int whence)
  618. {
  619. struct inode *inode = file->f_mapping->host;
  620. loff_t maxbytes;
  621. if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS)))
  622. maxbytes = EXT4_SB(inode->i_sb)->s_bitmap_maxbytes;
  623. else
  624. maxbytes = inode->i_sb->s_maxbytes;
  625. switch (whence) {
  626. case SEEK_SET:
  627. case SEEK_CUR:
  628. case SEEK_END:
  629. return generic_file_llseek_size(file, offset, whence,
  630. maxbytes, i_size_read(inode));
  631. case SEEK_DATA:
  632. return ext4_seek_data(file, offset, maxbytes);
  633. case SEEK_HOLE:
  634. return ext4_seek_hole(file, offset, maxbytes);
  635. }
  636. return -EINVAL;
  637. }
  638. const struct file_operations ext4_file_operations = {
  639. .llseek = ext4_llseek,
  640. .read_iter = ext4_file_read_iter,
  641. .write_iter = ext4_file_write_iter,
  642. .unlocked_ioctl = ext4_ioctl,
  643. #ifdef CONFIG_COMPAT
  644. .compat_ioctl = ext4_compat_ioctl,
  645. #endif
  646. .mmap = ext4_file_mmap,
  647. .open = ext4_file_open,
  648. .release = ext4_release_file,
  649. .fsync = ext4_sync_file,
  650. .get_unmapped_area = thp_get_unmapped_area,
  651. .splice_read = generic_file_splice_read,
  652. .splice_write = iter_file_splice_write,
  653. .fallocate = ext4_fallocate,
  654. };
  655. const struct inode_operations ext4_file_inode_operations = {
  656. .setattr = ext4_setattr,
  657. .getattr = ext4_file_getattr,
  658. .listxattr = ext4_listxattr,
  659. .get_acl = ext4_get_acl,
  660. .set_acl = ext4_set_acl,
  661. .fiemap = ext4_fiemap,
  662. };