file.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662
  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/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. /*
  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 = io_is_direct(file);
  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. iov_iter_truncate(from, sbi->s_bitmap_maxbytes - pos);
  122. length = iov_iter_count(from);
  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_write_checks(file, &iocb->ki_pos, &length, 0);
  155. if (ret)
  156. goto out;
  157. if (length == 0)
  158. goto out;
  159. iov_iter_truncate(from, length);
  160. ret = __generic_file_write_iter(iocb, from);
  161. out:
  162. mutex_unlock(&inode->i_mutex);
  163. if (ret > 0) {
  164. ssize_t err;
  165. err = generic_write_sync(file, iocb->ki_pos - ret, ret);
  166. if (err < 0)
  167. ret = err;
  168. }
  169. if (o_direct)
  170. blk_finish_plug(&plug);
  171. errout:
  172. if (aio_mutex)
  173. mutex_unlock(aio_mutex);
  174. return ret;
  175. }
  176. #ifdef CONFIG_FS_DAX
  177. static int ext4_dax_fault(struct vm_area_struct *vma, struct vm_fault *vmf)
  178. {
  179. return dax_fault(vma, vmf, ext4_get_block);
  180. /* Is this the right get_block? */
  181. }
  182. static int ext4_dax_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf)
  183. {
  184. return dax_mkwrite(vma, vmf, ext4_get_block);
  185. }
  186. static const struct vm_operations_struct ext4_dax_vm_ops = {
  187. .fault = ext4_dax_fault,
  188. .page_mkwrite = ext4_dax_mkwrite,
  189. };
  190. #else
  191. #define ext4_dax_vm_ops ext4_file_vm_ops
  192. #endif
  193. static const struct vm_operations_struct ext4_file_vm_ops = {
  194. .fault = filemap_fault,
  195. .map_pages = filemap_map_pages,
  196. .page_mkwrite = ext4_page_mkwrite,
  197. };
  198. static int ext4_file_mmap(struct file *file, struct vm_area_struct *vma)
  199. {
  200. file_accessed(file);
  201. if (IS_DAX(file_inode(file))) {
  202. vma->vm_ops = &ext4_dax_vm_ops;
  203. vma->vm_flags |= VM_MIXEDMAP;
  204. } else {
  205. vma->vm_ops = &ext4_file_vm_ops;
  206. }
  207. return 0;
  208. }
  209. static int ext4_file_open(struct inode * inode, struct file * filp)
  210. {
  211. struct super_block *sb = inode->i_sb;
  212. struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb);
  213. struct vfsmount *mnt = filp->f_path.mnt;
  214. struct path path;
  215. char buf[64], *cp;
  216. if (unlikely(!(sbi->s_mount_flags & EXT4_MF_MNTDIR_SAMPLED) &&
  217. !(sb->s_flags & MS_RDONLY))) {
  218. sbi->s_mount_flags |= EXT4_MF_MNTDIR_SAMPLED;
  219. /*
  220. * Sample where the filesystem has been mounted and
  221. * store it in the superblock for sysadmin convenience
  222. * when trying to sort through large numbers of block
  223. * devices or filesystem images.
  224. */
  225. memset(buf, 0, sizeof(buf));
  226. path.mnt = mnt;
  227. path.dentry = mnt->mnt_root;
  228. cp = d_path(&path, buf, sizeof(buf));
  229. if (!IS_ERR(cp)) {
  230. handle_t *handle;
  231. int err;
  232. handle = ext4_journal_start_sb(sb, EXT4_HT_MISC, 1);
  233. if (IS_ERR(handle))
  234. return PTR_ERR(handle);
  235. BUFFER_TRACE(sbi->s_sbh, "get_write_access");
  236. err = ext4_journal_get_write_access(handle, sbi->s_sbh);
  237. if (err) {
  238. ext4_journal_stop(handle);
  239. return err;
  240. }
  241. strlcpy(sbi->s_es->s_last_mounted, cp,
  242. sizeof(sbi->s_es->s_last_mounted));
  243. ext4_handle_dirty_super(handle, sb);
  244. ext4_journal_stop(handle);
  245. }
  246. }
  247. /*
  248. * Set up the jbd2_inode if we are opening the inode for
  249. * writing and the journal is present
  250. */
  251. if (filp->f_mode & FMODE_WRITE) {
  252. int ret = ext4_inode_attach_jinode(inode);
  253. if (ret < 0)
  254. return ret;
  255. }
  256. return dquot_file_open(inode, filp);
  257. }
  258. /*
  259. * Here we use ext4_map_blocks() to get a block mapping for a extent-based
  260. * file rather than ext4_ext_walk_space() because we can introduce
  261. * SEEK_DATA/SEEK_HOLE for block-mapped and extent-mapped file at the same
  262. * function. When extent status tree has been fully implemented, it will
  263. * track all extent status for a file and we can directly use it to
  264. * retrieve the offset for SEEK_DATA/SEEK_HOLE.
  265. */
  266. /*
  267. * When we retrieve the offset for SEEK_DATA/SEEK_HOLE, we would need to
  268. * lookup page cache to check whether or not there has some data between
  269. * [startoff, endoff] because, if this range contains an unwritten extent,
  270. * we determine this extent as a data or a hole according to whether the
  271. * page cache has data or not.
  272. */
  273. static int ext4_find_unwritten_pgoff(struct inode *inode,
  274. int whence,
  275. struct ext4_map_blocks *map,
  276. loff_t *offset)
  277. {
  278. struct pagevec pvec;
  279. unsigned int blkbits;
  280. pgoff_t index;
  281. pgoff_t end;
  282. loff_t endoff;
  283. loff_t startoff;
  284. loff_t lastoff;
  285. int found = 0;
  286. blkbits = inode->i_sb->s_blocksize_bits;
  287. startoff = *offset;
  288. lastoff = startoff;
  289. endoff = (loff_t)(map->m_lblk + map->m_len) << blkbits;
  290. index = startoff >> PAGE_CACHE_SHIFT;
  291. end = endoff >> PAGE_CACHE_SHIFT;
  292. pagevec_init(&pvec, 0);
  293. do {
  294. int i, num;
  295. unsigned long nr_pages;
  296. num = min_t(pgoff_t, end - index, PAGEVEC_SIZE);
  297. nr_pages = pagevec_lookup(&pvec, inode->i_mapping, index,
  298. (pgoff_t)num);
  299. if (nr_pages == 0) {
  300. if (whence == SEEK_DATA)
  301. break;
  302. BUG_ON(whence != SEEK_HOLE);
  303. /*
  304. * If this is the first time to go into the loop and
  305. * offset is not beyond the end offset, it will be a
  306. * hole at this offset
  307. */
  308. if (lastoff == startoff || lastoff < endoff)
  309. found = 1;
  310. break;
  311. }
  312. /*
  313. * If this is the first time to go into the loop and
  314. * offset is smaller than the first page offset, it will be a
  315. * hole at this offset.
  316. */
  317. if (lastoff == startoff && whence == SEEK_HOLE &&
  318. lastoff < page_offset(pvec.pages[0])) {
  319. found = 1;
  320. break;
  321. }
  322. for (i = 0; i < nr_pages; i++) {
  323. struct page *page = pvec.pages[i];
  324. struct buffer_head *bh, *head;
  325. /*
  326. * If the current offset is not beyond the end of given
  327. * range, it will be a hole.
  328. */
  329. if (lastoff < endoff && whence == SEEK_HOLE &&
  330. page->index > end) {
  331. found = 1;
  332. *offset = lastoff;
  333. goto out;
  334. }
  335. lock_page(page);
  336. if (unlikely(page->mapping != inode->i_mapping)) {
  337. unlock_page(page);
  338. continue;
  339. }
  340. if (!page_has_buffers(page)) {
  341. unlock_page(page);
  342. continue;
  343. }
  344. if (page_has_buffers(page)) {
  345. lastoff = page_offset(page);
  346. bh = head = page_buffers(page);
  347. do {
  348. if (buffer_uptodate(bh) ||
  349. buffer_unwritten(bh)) {
  350. if (whence == SEEK_DATA)
  351. found = 1;
  352. } else {
  353. if (whence == SEEK_HOLE)
  354. found = 1;
  355. }
  356. if (found) {
  357. *offset = max_t(loff_t,
  358. startoff, lastoff);
  359. unlock_page(page);
  360. goto out;
  361. }
  362. lastoff += bh->b_size;
  363. bh = bh->b_this_page;
  364. } while (bh != head);
  365. }
  366. lastoff = page_offset(page) + PAGE_SIZE;
  367. unlock_page(page);
  368. }
  369. /*
  370. * The no. of pages is less than our desired, that would be a
  371. * hole in there.
  372. */
  373. if (nr_pages < num && whence == SEEK_HOLE) {
  374. found = 1;
  375. *offset = lastoff;
  376. break;
  377. }
  378. index = pvec.pages[i - 1]->index + 1;
  379. pagevec_release(&pvec);
  380. } while (index <= end);
  381. out:
  382. pagevec_release(&pvec);
  383. return found;
  384. }
  385. /*
  386. * ext4_seek_data() retrieves the offset for SEEK_DATA.
  387. */
  388. static loff_t ext4_seek_data(struct file *file, loff_t offset, loff_t maxsize)
  389. {
  390. struct inode *inode = file->f_mapping->host;
  391. struct ext4_map_blocks map;
  392. struct extent_status es;
  393. ext4_lblk_t start, last, end;
  394. loff_t dataoff, isize;
  395. int blkbits;
  396. int ret = 0;
  397. mutex_lock(&inode->i_mutex);
  398. isize = i_size_read(inode);
  399. if (offset >= isize) {
  400. mutex_unlock(&inode->i_mutex);
  401. return -ENXIO;
  402. }
  403. blkbits = inode->i_sb->s_blocksize_bits;
  404. start = offset >> blkbits;
  405. last = start;
  406. end = isize >> blkbits;
  407. dataoff = offset;
  408. do {
  409. map.m_lblk = last;
  410. map.m_len = end - last + 1;
  411. ret = ext4_map_blocks(NULL, inode, &map, 0);
  412. if (ret > 0 && !(map.m_flags & EXT4_MAP_UNWRITTEN)) {
  413. if (last != start)
  414. dataoff = (loff_t)last << blkbits;
  415. break;
  416. }
  417. /*
  418. * If there is a delay extent at this offset,
  419. * it will be as a data.
  420. */
  421. ext4_es_find_delayed_extent_range(inode, last, last, &es);
  422. if (es.es_len != 0 && in_range(last, es.es_lblk, es.es_len)) {
  423. if (last != start)
  424. dataoff = (loff_t)last << blkbits;
  425. break;
  426. }
  427. /*
  428. * If there is a unwritten extent at this offset,
  429. * it will be as a data or a hole according to page
  430. * cache that has data or not.
  431. */
  432. if (map.m_flags & EXT4_MAP_UNWRITTEN) {
  433. int unwritten;
  434. unwritten = ext4_find_unwritten_pgoff(inode, SEEK_DATA,
  435. &map, &dataoff);
  436. if (unwritten)
  437. break;
  438. }
  439. last++;
  440. dataoff = (loff_t)last << blkbits;
  441. } while (last <= end);
  442. mutex_unlock(&inode->i_mutex);
  443. if (dataoff > isize)
  444. return -ENXIO;
  445. return vfs_setpos(file, dataoff, maxsize);
  446. }
  447. /*
  448. * ext4_seek_hole() retrieves the offset for SEEK_HOLE.
  449. */
  450. static loff_t ext4_seek_hole(struct file *file, loff_t offset, loff_t maxsize)
  451. {
  452. struct inode *inode = file->f_mapping->host;
  453. struct ext4_map_blocks map;
  454. struct extent_status es;
  455. ext4_lblk_t start, last, end;
  456. loff_t holeoff, isize;
  457. int blkbits;
  458. int ret = 0;
  459. mutex_lock(&inode->i_mutex);
  460. isize = i_size_read(inode);
  461. if (offset >= isize) {
  462. mutex_unlock(&inode->i_mutex);
  463. return -ENXIO;
  464. }
  465. blkbits = inode->i_sb->s_blocksize_bits;
  466. start = offset >> blkbits;
  467. last = start;
  468. end = isize >> blkbits;
  469. holeoff = offset;
  470. do {
  471. map.m_lblk = last;
  472. map.m_len = end - last + 1;
  473. ret = ext4_map_blocks(NULL, inode, &map, 0);
  474. if (ret > 0 && !(map.m_flags & EXT4_MAP_UNWRITTEN)) {
  475. last += ret;
  476. holeoff = (loff_t)last << blkbits;
  477. continue;
  478. }
  479. /*
  480. * If there is a delay extent at this offset,
  481. * we will skip this extent.
  482. */
  483. ext4_es_find_delayed_extent_range(inode, last, last, &es);
  484. if (es.es_len != 0 && in_range(last, es.es_lblk, es.es_len)) {
  485. last = es.es_lblk + es.es_len;
  486. holeoff = (loff_t)last << blkbits;
  487. continue;
  488. }
  489. /*
  490. * If there is a unwritten extent at this offset,
  491. * it will be as a data or a hole according to page
  492. * cache that has data or not.
  493. */
  494. if (map.m_flags & EXT4_MAP_UNWRITTEN) {
  495. int unwritten;
  496. unwritten = ext4_find_unwritten_pgoff(inode, SEEK_HOLE,
  497. &map, &holeoff);
  498. if (!unwritten) {
  499. last += ret;
  500. holeoff = (loff_t)last << blkbits;
  501. continue;
  502. }
  503. }
  504. /* find a hole */
  505. break;
  506. } while (last <= end);
  507. mutex_unlock(&inode->i_mutex);
  508. if (holeoff > isize)
  509. holeoff = isize;
  510. return vfs_setpos(file, holeoff, maxsize);
  511. }
  512. /*
  513. * ext4_llseek() handles both block-mapped and extent-mapped maxbytes values
  514. * by calling generic_file_llseek_size() with the appropriate maxbytes
  515. * value for each.
  516. */
  517. loff_t ext4_llseek(struct file *file, loff_t offset, int whence)
  518. {
  519. struct inode *inode = file->f_mapping->host;
  520. loff_t maxbytes;
  521. if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS)))
  522. maxbytes = EXT4_SB(inode->i_sb)->s_bitmap_maxbytes;
  523. else
  524. maxbytes = inode->i_sb->s_maxbytes;
  525. switch (whence) {
  526. case SEEK_SET:
  527. case SEEK_CUR:
  528. case SEEK_END:
  529. return generic_file_llseek_size(file, offset, whence,
  530. maxbytes, i_size_read(inode));
  531. case SEEK_DATA:
  532. return ext4_seek_data(file, offset, maxbytes);
  533. case SEEK_HOLE:
  534. return ext4_seek_hole(file, offset, maxbytes);
  535. }
  536. return -EINVAL;
  537. }
  538. const struct file_operations ext4_file_operations = {
  539. .llseek = ext4_llseek,
  540. .read_iter = generic_file_read_iter,
  541. .write_iter = ext4_file_write_iter,
  542. .unlocked_ioctl = ext4_ioctl,
  543. #ifdef CONFIG_COMPAT
  544. .compat_ioctl = ext4_compat_ioctl,
  545. #endif
  546. .mmap = ext4_file_mmap,
  547. .open = ext4_file_open,
  548. .release = ext4_release_file,
  549. .fsync = ext4_sync_file,
  550. .splice_read = generic_file_splice_read,
  551. .splice_write = iter_file_splice_write,
  552. .fallocate = ext4_fallocate,
  553. };
  554. #ifdef CONFIG_FS_DAX
  555. const struct file_operations ext4_dax_file_operations = {
  556. .llseek = ext4_llseek,
  557. .read_iter = generic_file_read_iter,
  558. .write_iter = ext4_file_write_iter,
  559. .unlocked_ioctl = ext4_ioctl,
  560. #ifdef CONFIG_COMPAT
  561. .compat_ioctl = ext4_compat_ioctl,
  562. #endif
  563. .mmap = ext4_file_mmap,
  564. .open = ext4_file_open,
  565. .release = ext4_release_file,
  566. .fsync = ext4_sync_file,
  567. /* Splice not yet supported with DAX */
  568. .fallocate = ext4_fallocate,
  569. };
  570. #endif
  571. const struct inode_operations ext4_file_inode_operations = {
  572. .setattr = ext4_setattr,
  573. .getattr = ext4_getattr,
  574. .setxattr = generic_setxattr,
  575. .getxattr = generic_getxattr,
  576. .listxattr = ext4_listxattr,
  577. .removexattr = generic_removexattr,
  578. .get_acl = ext4_get_acl,
  579. .set_acl = ext4_set_acl,
  580. .fiemap = ext4_fiemap,
  581. };