| blob | 58e93bce30362dc0584c212ba18822ed13fde723 |
1 // SPDX-License-Identifier: GPL-2.0
2 /*
3 * Copyright (C) 2007 Oracle. All rights reserved.
4 */
6 #include <linux/fs.h>
7 #include <linux/pagemap.h>
8 #include <linux/time.h>
9 #include <linux/init.h>
10 #include <linux/string.h>
11 #include <linux/backing-dev.h>
12 #include <linux/falloc.h>
13 #include <linux/writeback.h>
14 #include <linux/compat.h>
15 #include <linux/slab.h>
16 #include <linux/btrfs.h>
17 #include <linux/uio.h>
18 #include <linux/iversion.h>
31 /*
32 * when auto defrag is enabled we
33 * queue up these defrag structs to remember which
34 * inodes need defragging passes
35 */
38 /* objectid */
39 u64 ino;
40 /*
41 * transid where the defrag was added, we search for
42 * extents newer than this
43 */
44 u64 transid;
46 /* root objectid */
47 u64 root;
49 /* last offset we were able to defrag */
50 u64 last_offset;
52 /* if we've wrapped around back to zero once already */
54 };
58 {
67 else
69 }
71 /* pop a record for an inode into the defrag tree. The lock
72 * must be held already
73 *
74 * If you're inserting a record for an older transid than an
75 * existing record, the transid already in the tree is lowered
76 *
77 * If an existing record is found the defrag item you
78 * pass in is freed
79 */
82 {
100 /* if we're reinserting an entry for
101 * an old defrag run, make sure to
102 * lower the transid of our existing record
103 */
109 }
110 }
115 }
118 {
126 }
128 /*
129 * insert a defrag record for this inode if auto defrag is
130 * enabled
131 */
134 {
138 u64 transid;
149 else
162 /*
163 * If we set IN_DEFRAG flag and evict the inode from memory,
164 * and then re-read this inode, this new inode doesn't have
165 * IN_DEFRAG flag. At the case, we may find the existed defrag.
166 */
172 }
175 }
177 /*
178 * Requeue the defrag object. If there is a defrag object that points to
179 * the same inode in the tree, we will merge them together (by
180 * __btrfs_add_inode_defrag()) and free the one that we want to requeue.
181 */
184 {
191 /*
192 * Here we don't check the IN_DEFRAG flag, because we need merge
193 * them together.
194 */
201 out:
203 }
205 /*
206 * pick the defragable inode that we want, if it doesn't exist, we will get
207 * the next one.
208 */
211 {
232 else
234 }
240 else
242 }
243 out:
248 }
251 {
265 }
267 }
269 #define BTRFS_DEFRAG_BATCH 1024
273 {
282 /* get the inode */
293 }
302 }
305 /* do a chunk of defrag */
313 BTRFS_DEFRAG_BATCH);
315 /*
316 * if we filled the whole defrag batch, there
317 * must be more work to do. Queue this defrag
318 * again
319 */
324 /*
325 * we didn't fill our defrag batch, but
326 * we didn't start at zero. Make sure we loop
327 * around to the start of the file.
328 */
334 }
338 cleanup:
342 }
344 /*
345 * run through the list of inodes in the FS that need
346 * defragging
347 */
349 {
356 /* Pause the auto defragger. */
364 /* find an inode to defrag */
366 first_ino);
374 }
375 }
381 }
384 /*
385 * during unmount, we use the transaction_wait queue to
386 * wait for the defragger to stop
387 */
390 }
392 /* simple helper to fault in pages and copy. This should go away
393 * and be replaced with calls into generic code.
394 */
398 {
408 /*
409 * Copy data from userspace to the current page
410 */
413 /* Flush processor's dcache for this page */
416 /*
417 * if we get a partial write, we can end up with
418 * partially up to date pages. These add
419 * a lot of complexity, so make sure they don't
420 * happen by forcing this copy to be retried.
421 *
422 * The rest of the btrfs_file_write code will fall
423 * back to page at a time copies after we return 0.
424 */
432 /* Return to btrfs_file_write_iter to fault page */
439 pg++;
441 }
442 }
444 }
446 /*
447 * unlocks pages after btrfs_file_write is done with them
448 */
450 {
453 /* page checked is some magic around finding pages that
454 * have been modified without going through btrfs_set_page_dirty
455 * clear it here. There should be no need to mark the pages
456 * accessed as prepare_pages should have marked them accessed
457 * in prepare_pages via find_or_create_page()
458 */
462 }
463 }
469 {
476 u64 em_len;
495 EXTENT_DELALLOC_NEW,
497 next:
502 }
504 }
506 /*
507 * after copy_from_user, pages need to be dirtied and we need to make
508 * sure holes are created between the current EOF and the start of
509 * any next extents (if required).
510 *
511 * this also makes the decision about creating an inline extent vs
512 * doing real data extents, marking pages dirty and delalloc as required.
513 */
517 {
521 u64 num_bytes;
522 u64 start_pos;
523 u64 end_of_last_block;
534 /*
535 * The pages may have already been dirty, clear out old accounting so
536 * we can set things up properly
537 */
545 /*
546 * There can't be any extents following eof in this case
547 * so just set the delalloc new bit for the range
548 * directly.
549 */
553 start_pos,
557 }
558 }
570 }
572 /*
573 * we've only changed i_size in ram, and we haven't updated
574 * the disk i_size. There is no need to log the inode
575 * at this time.
576 */
580 }
582 /*
583 * this drops all the extents in the cache that intersect the range
584 * [start, end]. Existing extents are split as required.
585 */
588 {
594 u64 gen;
605 }
622 }
630 }
637 }
655 else
666 }
676 }
701 }
708 }
712 modified);
715 modified);
717 }
720 }
721 next:
726 /* once for us */
728 /* once for the tree*/
730 }
735 }
737 /*
738 * this is very complex, but the basic idea is to drop all extents
739 * in the range start - end. hint_block is filled in with a block number
740 * that would be a good hint to the block allocator for this file.
741 *
742 * If an extent intersects the range but is not entirely inside the range
743 * it is either truncated or split. Anything entirely inside the range
744 * is deleted from the tree.
745 */
751 u32 extent_item_size,
753 {
796 }
798 leafs_visited++;
799 next_slot:
809 }
810 leafs_visited++;
813 }
824 }
843 /* can't happen */
845 }
847 /*
848 * Don't skip extent items representing 0 byte lengths. They
849 * used to be created (bug) if while punching holes we hit
850 * -ENOSPC condition. So if we find one here, just ensure we
851 * delete it, otherwise we would insert a new file extent item
852 * with the same key (offset) as that 0 bytes length file
853 * extent item in the call to setup_items_for_insert() later
854 * in this function.
855 */
859 }
864 }
872 }
874 /*
875 * | - range to drop - |
876 * | -------- extent -------- |
877 */
883 }
892 }
918 }
920 }
921 /*
922 * From here on out we will have actually dropped something, so
923 * last_end can be updated.
924 */
927 /*
928 * | ---- range to drop ----- |
929 * | -------- extent -------- |
930 */
935 }
949 }
952 /*
953 * | ---- range to drop ----- |
954 * | -------- extent -------- |
955 */
961 }
973 }
975 /*
976 * | ---- range to drop ----- |
977 * | ------ extent ------ |
978 */
980 delete_extent_item:
986 del_nr++;
987 }
1000 extent_offset);
1004 }
1012 }
1015 del_nr);
1019 }
1026 }
1029 }
1032 /*
1033 * Set path->slots[0] to first slot, so that after the delete
1034 * if items are move off from our leaf to its immediate left or
1035 * right neighbor leafs, we end up with a correct and adjusted
1036 * path->slots[0] for our insertion (if replace_extent != 0).
1037 */
1042 }
1045 /*
1046 * If btrfs_del_items() was called, it might have deleted a leaf, in
1047 * which case it unlocked our path, so check path->locks[0] matches a
1048 * write lock.
1049 */
1065 }
1068 extent_item_size,
1072 }
1079 }
1084 {
1095 }
1100 {
1103 u64 extent_end;
1128 }
1130 /*
1131 * Mark extent in the range start - end as written.
1132 *
1133 * This changes extent type from 'pre-allocated' to 'regular'. If only
1134 * part of extent is marked as written, the extent will be split into
1135 * two or three.
1136 */
1139 {
1147 u64 bytenr;
1148 u64 num_bytes;
1149 u64 extent_end;
1150 u64 orig_offset;
1151 u64 other_start;
1152 u64 other_end;
1153 u64 split;
1163 again:
1183 }
1190 }
1196 }
1227 }
1228 }
1256 }
1257 }
1268 }
1272 }
1296 }
1305 }
1308 }
1310 }
1320 }
1323 del_nr++;
1330 }
1331 }
1340 }
1343 del_nr++;
1350 }
1351 }
1356 BTRFS_FILE_EXTENT_REG);
1363 BTRFS_FILE_EXTENT_REG);
1373 }
1374 }
1375 out:
1378 }
1380 /*
1381 * on error we return an unlocked page and the error value
1382 * on success we return a locked page and 0
1383 */
1387 {
1399 }
1403 }
1404 }
1406 }
1408 /*
1409 * this just gets pages into the page cache and locks them down.
1410 */
1414 {
1422 again:
1429 }
1433 force_uptodate);
1442 }
1445 }
1447 }
1450 fail:
1454 faili--;
1455 }
1458 }
1460 /*
1461 * This function locks the extent and properly waits for data=ordered extents
1462 * to finish before allowing the pages to be modified if need.
1463 *
1464 * The return value:
1465 * 1 - the extent is locked
1466 * 0 - the extent is not locked, and everything is OK
1467 * -EAGAIN - need re-prepare the pages
1468 * the other < 0 number - Something wrong happens
1469 */
1476 {
1478 u64 start_pos;
1479 u64 last_pos;
1484 last_pos = start_pos
1492 cached_state);
1503 }
1508 }
1515 }
1517 /*
1518 * It's possible the pages are dirty right now, but we don't want
1519 * to clean them yet because copy_from_user may catch a page fault
1520 * and we might have to fall back to one page at a time. If that
1521 * happens, we'll unlock these pages and we'd have a window where
1522 * reclaim could sneak in and drop the once-dirty page on the floor
1523 * without writing it.
1524 *
1525 * We have the pages locked and the extent range locked, so there's
1526 * no way someone can start IO on any dirty pages in this range.
1527 *
1528 * We'll call btrfs_dirty_pages() later on, and that will flip around
1529 * delalloc bits and dirty the pages as required.
1530 */
1534 }
1537 }
1541 {
1546 u64 num_bytes;
1563 }
1567 }
1578 }
1583 }
1587 {
1597 u64 lockstart;
1598 u64 lockend;
1618 offset);
1620 PAGE_SIZE);
1630 /*
1631 * Fault pages before locking them in prepare_pages
1632 * to avoid recursive lock
1633 */
1637 }
1645 write_bytes);
1648 BTRFS_INODE_PREALLOC)) &&
1651 /*
1652 * For nodata cow case, no need to reserve
1653 * data space.
1654 */
1656 /*
1657 * our prealloc extent may be smaller than
1658 * write_bytes, so scale down.
1659 */
1661 PAGE_SIZE);
1663 sector_offset,
1667 }
1668 }
1672 reserve_bytes);
1677 write_bytes);
1678 else
1681 }
1684 again:
1685 /*
1686 * This is going to setup the pages array with the number of
1687 * pages we want, so we don't really need to worry about the
1688 * contents of pages from loop to loop
1689 */
1692 force_page_uptodate);
1697 }
1710 }
1719 /*
1720 * if we have trouble faulting in the pages, fall
1721 * back to one page at a time
1722 */
1733 PAGE_SIZE);
1734 }
1737 /* release everything except the sectors we dirtied */
1744 u64 __pos;
1752 }
1753 }
1769 }
1785 }
1797 }
1810 }
1811 }
1815 }
1818 {
1821 loff_t pos;
1822 ssize_t written;
1823 ssize_t written_buffered;
1824 loff_t endbyte;
1837 }
1838 /*
1839 * Ensure all data is persisted. We want the next direct IO read to be
1840 * able to read what was just written.
1841 */
1853 out:
1855 }
1858 {
1873 }
1877 {
1882 u64 start_pos;
1883 u64 end_pos;
1886 ssize_t err;
1887 loff_t pos;
1889 loff_t oldsize;
1900 }
1906 }
1910 /*
1911 * We will allocate space in case nodatacow is not set,
1912 * so bail
1913 */
1915 BTRFS_INODE_PREALLOC)) ||
1919 }
1920 }
1927 }
1929 /*
1930 * If BTRFS flips readonly due to some impossible error
1931 * (fs_info->fs_state now has BTRFS_SUPER_FLAG_ERROR),
1932 * although we have opened a file as writable, we have
1933 * to stop this write operation to ensure FS consistency.
1934 */
1939 }
1941 /*
1942 * We reserve space for updating the inode when we reserve space for the
1943 * extent we are going to write, so we will enospc out there. We don't
1944 * need to start yet another transaction to update the inode as we will
1945 * update the inode when we finish writing whatever data we write.
1946 */
1952 /* Expand hole size to cover write data, preventing empty gap */
1959 }
1962 }
1976 }
1980 /*
1981 * We also have to set last_sub_trans to the current log transid,
1982 * otherwise subsequent syncs to a file that's been synced in this
1983 * transaction will appear to have already occurred.
1984 */
1993 out:
1996 }
1999 {
2007 /*
2008 * ordered_data_close is set by settattr when we are about to truncate
2009 * a file from a non-zero size to a zero size. This tries to
2010 * flush down new bytes that may have been written if the
2011 * application were using truncate to replace a file in place.
2012 */
2017 }
2020 {
2024 /*
2025 * This is only called in fsync, which would do synchronous writes, so
2026 * a plug can merge adjacent IOs as much as possible. Esp. in case of
2027 * multiple disks using raid profile, a large IO can be split to
2028 * several segments of stripe length (currently 64K).
2029 */
2037 }
2039 /*
2040 * fsync call for both files and directories. This logs the inode into
2041 * the tree log instead of forcing full commits whenever possible.
2042 *
2043 * It needs to call filemap_fdatawait so that all ordered extent updates are
2044 * in the metadata btree are up to date for copying to the log.
2045 *
2046 * It drops the inode mutex before doing the tree log commit. This is an
2047 * important optimization for directories because holding the mutex prevents
2048 * new operations on the dir while we write to disk.
2049 */
2051 {
2059 u64 len;
2061 /*
2062 * The range length can be represented by u64, we have to do the typecasts
2063 * to avoid signed overflow if it's [0, LLONG_MAX] eg. from fsync()
2064 */
2070 /*
2071 * We write the dirty pages in the range and wait until they complete
2072 * out of the ->i_mutex. If so, we can flush the dirty pages by
2073 * multi-task, and make the performance up. See
2074 * btrfs_wait_ordered_range for an explanation of the ASYNC check.
2075 */
2082 /*
2083 * We take the dio_sem here because the tree log stuff can race with
2084 * lockless dio writes and get an extent map logged for an extent we
2085 * never waited on. We need it this high up for lockdep reasons.
2086 */
2091 /*
2092 * Before we acquired the inode's lock, someone may have dirtied more
2093 * pages in the target range. We need to make sure that writeback for
2094 * any such pages does not start while we are logging the inode, because
2095 * if it does, any of the following might happen when we are not doing a
2096 * full inode sync:
2097 *
2098 * 1) We log an extent after its writeback finishes but before its
2099 * checksums are added to the csum tree, leading to -EIO errors
2100 * when attempting to read the extent after a log replay.
2101 *
2102 * 2) We can end up logging an extent before its writeback finishes.
2103 * Therefore after the log replay we will have a file extent item
2104 * pointing to an unwritten extent (and no data checksums as well).
2105 *
2106 * So trigger writeback for any eventual new dirty pages and then we
2107 * wait for all ordered extents to complete below.
2108 */
2113 }
2115 /*
2116 * We have to do this here to avoid the priority inversion of waiting on
2117 * IO of a lower priority task while holding a transaciton open.
2118 */
2124 }
2130 /*
2131 * We've had everything committed since the last time we were
2132 * modified so clear this flag in case it was set for whatever
2133 * reason, it's no longer relevant.
2134 */
2137 /*
2138 * An ordered extent might have started before and completed
2139 * already with io errors, in which case the inode was not
2140 * updated and we end up here. So check the inode's mapping
2141 * for any errors that might have happened since we last
2142 * checked called fsync.
2143 */
2148 }
2150 /*
2151 * We use start here because we will need to wait on the IO to complete
2152 * in btrfs_sync_log, which could require joining a transaction (for
2153 * example checking cross references in the nocow path). If we use join
2154 * here we could get into a situation where we're waiting on IO to
2155 * happen that is blocked on a transaction trying to commit. With start
2156 * we inc the extwriter counter, so we wait for all extwriters to exit
2157 * before we start blocking join'ers. This comment is to keep somebody
2158 * from thinking they are super smart and changing this to
2159 * btrfs_join_transaction *cough*Josef*cough*.
2160 */
2167 }
2172 /* Fallthrough and commit/free transaction. */
2174 }
2176 /* we've logged all the items and now have a consistent
2177 * version of the file in the log. It is possible that
2178 * someone will come in and modify the file, but that's
2179 * fine because the log is consistent on disk, and we
2180 * have references to all of the file's extents
2181 *
2182 * It is possible that someone will come in and log the
2183 * file again, but that will end up using the synchronization
2184 * inside btrfs_sync_log to keep things safe.
2185 */
2189 /*
2190 * If any of the ordered extents had an error, just return it to user
2191 * space, so that the application knows some writes didn't succeed and
2192 * can take proper action (retry for e.g.). Blindly committing the
2193 * transaction in this case, would fool userspace that everything was
2194 * successful. And we also want to make sure our log doesn't contain
2195 * file extent items pointing to extents that weren't fully written to -
2196 * just like in the non fast fsync path, where we check for the ordered
2197 * operation's error flag before writing to the log tree and return -EIO
2198 * if any of them had this flag set (btrfs_wait_ordered_range) -
2199 * therefore we need to check for errors in the ordered operations,
2200 * which are indicated by ctx.io_err.
2201 */
2206 }
2214 }
2215 }
2219 }
2220 out:
2226 }
2232 };
2235 {
2245 }
2249 {
2274 }
2279 {
2298 /*
2299 * We should have dropped this offset, so if we find it then
2300 * something has gone horribly wrong.
2301 */
2305 }
2309 u64 num_bytes;
2321 }
2324 u64 num_bytes;
2331 offset;
2337 }
2345 out:
2375 }
2378 }
2380 /*
2381 * Find a hole extent on given inode and change start/len to the end of hole
2382 * extent.(hole/vacuum extent whose em->start <= start &&
2383 * em->start + em->len > start)
2384 * When a hole extent is found, return 1 and modify start/len.
2385 */
2387 {
2398 /* Hole or vacuum extent(only exists in no-hole mode) */
2404 }
2407 }
2413 {
2421 cached_state);
2424 /*
2425 * We need to make sure we have no ordered extents in this range
2426 * and nobody raced in and read a page in this range, if we did
2427 * we need to try again.
2428 */
2437 }
2446 }
2448 }
2451 {
2458 u64 lockstart;
2459 u64 lockend;
2460 u64 tail_start;
2461 u64 tail_len;
2463 u64 cur_offset;
2465 u64 drop_end;
2471 u64 ino_size;
2485 /* Already in a large hole */
2488 }
2495 /*
2496 * We needn't truncate any block which is beyond the end of the file
2497 * because we are sure there is no data there.
2498 */
2499 /*
2500 * Only do this if we are in the same block and we aren't doing the
2501 * entire block.
2502 */
2509 }
2511 }
2513 /* zero back part of the first block */
2520 }
2521 }
2523 /* Check the aligned pages after the first unaligned page,
2524 * if offset != orig_start, which means the first unaligned page
2525 * including several following pages are already in holes,
2526 * the extra check can be skipped */
2528 /* after truncate page, check hole again */
2537 }
2539 }
2541 /* Check the tail unaligned part is in a hole */
2549 /* zero the front end of the last page */
2557 }
2558 }
2559 }
2564 }
2571 }
2577 }
2583 }
2587 /*
2588 * 1 - update the inode
2589 * 1 - removing the extents in the range
2590 * 1 - adding the hole extent if no_holes isn't set
2591 */
2597 }
2619 /*
2620 * If we failed then we didn't insert our hole
2621 * entries for the area we dropped, so now the
2622 * fs is corrupted, so we must abort the
2623 * transaction.
2624 */
2628 }
2629 }
2637 }
2647 }
2660 }
2661 }
2666 }
2669 /*
2670 * If we are using the NO_HOLES feature we might have had already an
2671 * hole that overlaps a part of the region [lockstart, lockend] and
2672 * ends at (or beyond) lockend. Since we have no file extent items to
2673 * represent holes, drop_end can be less than lockend and so we must
2674 * make sure we have an extent map representing the existing hole (the
2675 * call to __btrfs_drop_extents() might have dropped the existing extent
2676 * map representing the existing hole), otherwise the fast fsync path
2677 * will not record the existence of the hole region
2678 * [existing_hole_start, lockend].
2679 */
2682 /*
2683 * Don't insert file hole extent item if it's for a range beyond eof
2684 * (because it's useless) or if it represents a 0 bytes range (when
2685 * cur_offset == drop_end).
2686 */
2691 /* Same comment as above. */
2695 }
2696 }
2698 out_trans:
2710 out_free:
2713 out:
2716 out_only_mutex:
2718 /*
2719 * If we only end up zeroing part of a page, we still need to
2720 * update the inode item, so that all the time fields are
2721 * updated as well as the necessary btrfs inode in memory fields
2722 * for detecting, at fsync time, if the inode isn't yet in the
2723 * log tree or it's there but not up to date.
2724 */
2731 }
2732 }
2737 }
2739 /* Helper structure to record which range is already reserved */
2742 u64 start;
2743 u64 len;
2744 };
2746 /*
2747 * Helper function to add falloc range
2748 *
2749 * Caller should have locked the larger range of extent containing
2750 * [start, len)
2751 */
2753 {
2760 /*
2761 * As fallocate iterate by bytenr order, we only need to check
2762 * the last range.
2763 */
2768 }
2769 insert:
2777 }
2782 {
2802 }
2808 };
2811 u64 offset)
2812 {
2826 else
2831 }
2834 loff_t offset,
2835 loff_t len,
2837 {
2856 }
2858 /*
2859 * Avoid hole punching and extent allocation for some cases. More cases
2860 * could be considered, but these are unlikely common and we keep things
2861 * as simple as possible for now. Also, intentionally, if the target
2862 * range contains one or more prealloc extents together with regular
2863 * extents and holes, we drop all the existing extents and allocate a
2864 * new prealloc extent, so that we get a larger contiguous disk extent.
2865 */
2871 /*
2872 * The whole range is already a prealloc extent,
2873 * do nothing except updating the inode's i_size if
2874 * needed.
2875 */
2878 mode);
2880 }
2881 /*
2882 * Part of the range is already a prealloc extent, so operate
2883 * only on the remaining part of the range.
2884 */
2890 }
2900 }
2905 mode);
2907 }
2914 mode);
2916 }
2921 }
2926 /*
2927 * For unaligned ranges, check the pages at the boundaries, they might
2928 * map to an extent, in which case we need to partially zero them, or
2929 * they might map to a hole, in which case we need our allocation range
2930 * to cover them.
2931 */
2945 }
2946 }
2962 }
2963 }
2965 reserve_space:
2973 bytes_to_reserve);
2991 /* btrfs_prealloc_file_range releases reserved space on error */
2995 }
2996 }
2998 out:
3005 }
3009 {
3016 u64 cur_offset;
3017 u64 last_byte;
3018 u64 alloc_start;
3019 u64 alloc_end;
3021 u64 locked_end;
3031 /* Make sure we aren't being give some crap mode */
3033 FALLOC_FL_ZERO_RANGE))
3039 /*
3040 * Only trigger disk allocation, don't trigger qgroup reserve
3041 *
3042 * For qgroup space, it will be checked later.
3043 */
3049 }
3057 }
3059 /*
3060 * TODO: Move these two operations after we have checked
3061 * accurate reserved space, or fallocate can still fail but
3062 * with page truncated or size expanded.
3063 *
3064 * But that's a minor problem and won't do much harm BTW.
3065 */
3068 alloc_start);
3072 /*
3073 * If we are fallocating from the end of the file onward we
3074 * need to zero out the end of the block if i_size lands in the
3075 * middle of a block.
3076 */
3080 }
3082 /*
3083 * wait for ordered IO before we have any locks. We'll loop again
3084 * below with the locks held.
3085 */
3095 }
3101 /* the extent lock is ordered inside the running
3102 * transaction
3103 */
3115 /*
3116 * we can't wait on the range with the transaction
3117 * running or with the extent lock held
3118 */
3127 }
3128 }
3130 /* First, check if we exceed the qgroup limit */
3138 }
3150 }
3156 }
3158 /*
3159 * Do not need to reserve unwritten extent for this
3160 * range, free reserved data space first, otherwise
3161 * it'll result in false ENOSPC error.
3162 */
3165 }
3168 }
3170 /*
3171 * If ret is still 0, means we're OK to fallocate.
3172 * Or just cleanup the list and exit.
3173 */
3180 else
3186 }
3190 /*
3191 * We didn't need to allocate any more space, but we still extended the
3192 * size of the file so we need to update i_size and the inode item.
3193 */
3195 out_unlock:
3198 out:
3200 /* Let go of our reservation. */
3206 }
3209 {
3213 u64 lockstart;
3214 u64 lockend;
3215 u64 start;
3216 u64 len;
3222 /*
3223 * *offset can be negative, in this case we start finding DATA/HOLE from
3224 * the very start of the file.
3225 */
3233 lockend--;
3246 }
3261 }
3266 else
3268 }
3272 }
3275 {
3290 }
3296 }
3297 }
3300 out:
3303 }
3306 {
3309 }
3322 #ifdef CONFIG_COMPAT
3324 #endif
3326 };
3329 {
3331 }
3334 {
3337 SLAB_MEM_SPREAD,
3338 NULL);
3343 }
3346 {
3349 /*
3350 * So with compression we will find and lock a dirty page and clear the
3351 * first one as dirty, setup an async extent, and immediately return
3352 * with the entire range locked but with nobody actually marked with
3353 * writeback. So we can't just filemap_write_and_wait_range() and
3354 * expect it to work since it will just kick off a thread to do the
3355 * actual work. So we need to call filemap_fdatawrite_range _again_
3356 * since it will wait on the page lock, which won't be unlocked until
3357 * after the pages have been marked as writeback and so we're good to go
3358 * from there. We have to do this otherwise we'll miss the ordered
3359 * extents and that results in badness. Please Josef, do not think you
3360 * know better and pull this out at some point in the future, it is
3361 * right and you are wrong.
3362 */
3369 }