| blob | 0529736205957973d502f2329960e5f18ed81933 |
1 /*
2 * Copyright (C) 2007 Oracle. All rights reserved.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
12 *
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
17 */
19 #include <linux/fs.h>
20 #include <linux/pagemap.h>
21 #include <linux/highmem.h>
22 #include <linux/time.h>
23 #include <linux/init.h>
24 #include <linux/string.h>
25 #include <linux/backing-dev.h>
26 #include <linux/mpage.h>
27 #include <linux/falloc.h>
28 #include <linux/swap.h>
29 #include <linux/writeback.h>
30 #include <linux/statfs.h>
31 #include <linux/compat.h>
32 #include <linux/slab.h>
33 #include <linux/btrfs.h>
34 #include <linux/uio.h>
46 /*
47 * when auto defrag is enabled we
48 * queue up these defrag structs to remember which
49 * inodes need defragging passes
50 */
53 /* objectid */
54 u64 ino;
55 /*
56 * transid where the defrag was added, we search for
57 * extents newer than this
58 */
59 u64 transid;
61 /* root objectid */
62 u64 root;
64 /* last offset we were able to defrag */
65 u64 last_offset;
67 /* if we've wrapped around back to zero once already */
69 };
73 {
82 else
84 }
86 /* pop a record for an inode into the defrag tree. The lock
87 * must be held already
88 *
89 * If you're inserting a record for an older transid than an
90 * existing record, the transid already in the tree is lowered
91 *
92 * If an existing record is found the defrag item you
93 * pass in is freed
94 */
97 {
115 /* if we're reinserting an entry for
116 * an old defrag run, make sure to
117 * lower the transid of our existing record
118 */
124 }
125 }
130 }
133 {
141 }
143 /*
144 * insert a defrag record for this inode if auto defrag is
145 * enabled
146 */
149 {
152 u64 transid;
163 else
176 /*
177 * If we set IN_DEFRAG flag and evict the inode from memory,
178 * and then re-read this inode, this new inode doesn't have
179 * IN_DEFRAG flag. At the case, we may find the existed defrag.
180 */
186 }
189 }
191 /*
192 * Requeue the defrag object. If there is a defrag object that points to
193 * the same inode in the tree, we will merge them together (by
194 * __btrfs_add_inode_defrag()) and free the one that we want to requeue.
195 */
198 {
205 /*
206 * Here we don't check the IN_DEFRAG flag, because we need merge
207 * them together.
208 */
215 out:
217 }
219 /*
220 * pick the defragable inode that we want, if it doesn't exist, we will get
221 * the next one.
222 */
225 {
246 else
248 }
254 else
256 }
257 out:
262 }
265 {
279 }
281 }
283 #define BTRFS_DEFRAG_BATCH 1024
287 {
296 /* get the inode */
307 }
316 }
319 /* do a chunk of defrag */
327 BTRFS_DEFRAG_BATCH);
329 /*
330 * if we filled the whole defrag batch, there
331 * must be more work to do. Queue this defrag
332 * again
333 */
338 /*
339 * we didn't fill our defrag batch, but
340 * we didn't start at zero. Make sure we loop
341 * around to the start of the file.
342 */
348 }
352 cleanup:
356 }
358 /*
359 * run through the list of inodes in the FS that need
360 * defragging
361 */
363 {
370 /* Pause the auto defragger. */
378 /* find an inode to defrag */
380 first_ino);
388 }
389 }
395 }
398 /*
399 * during unmount, we use the transaction_wait queue to
400 * wait for the defragger to stop
401 */
404 }
406 /* simple helper to fault in pages and copy. This should go away
407 * and be replaced with calls into generic code.
408 */
413 {
423 /*
424 * Copy data from userspace to the current page
425 */
428 /* Flush processor's dcache for this page */
431 /*
432 * if we get a partial write, we can end up with
433 * partially up to date pages. These add
434 * a lot of complexity, so make sure they don't
435 * happen by forcing this copy to be retried.
436 *
437 * The rest of the btrfs_file_write code will fall
438 * back to page at a time copies after we return 0.
439 */
447 /* Return to btrfs_file_write_iter to fault page */
454 pg++;
456 }
457 }
459 }
461 /*
462 * unlocks pages after btrfs_file_write is done with them
463 */
465 {
468 /* page checked is some magic around finding pages that
469 * have been modified without going through btrfs_set_page_dirty
470 * clear it here. There should be no need to mark the pages
471 * accessed as prepare_pages should have marked them accessed
472 * in prepare_pages via find_or_create_page()
473 */
477 }
478 }
480 /*
481 * after copy_from_user, pages need to be dirtied and we need to make
482 * sure holes are created between the current EOF and the start of
483 * any next extents (if required).
484 *
485 * this also makes the decision about creating an inline extent vs
486 * doing real data extents, marking pages dirty and delalloc as required.
487 */
492 {
495 u64 num_bytes;
496 u64 start_pos;
497 u64 end_of_last_block;
506 cached);
515 }
517 /*
518 * we've only changed i_size in ram, and we haven't updated
519 * the disk i_size. There is no need to log the inode
520 * at this time.
521 */
525 }
527 /*
528 * this drops all the extents in the cache that intersect the range
529 * [start, end]. Existing extents are split as required.
530 */
533 {
539 u64 gen;
550 }
567 }
575 }
582 }
600 else
611 }
621 }
646 }
653 }
657 modified);
660 modified);
662 }
665 }
666 next:
671 /* once for us */
673 /* once for the tree*/
675 }
680 }
682 /*
683 * this is very complex, but the basic idea is to drop all extents
684 * in the range start - end. hint_block is filled in with a block number
685 * that would be a good hint to the block allocator for this file.
686 *
687 * If an extent intersects the range but is not entirely inside the range
688 * it is either truncated or split. Anything entirely inside the range
689 * is deleted from the tree.
690 */
696 u32 extent_item_size,
698 {
739 }
741 leafs_visited++;
742 next_slot:
752 }
753 leafs_visited++;
756 }
767 }
787 /* can't happen */
789 }
791 /*
792 * Don't skip extent items representing 0 byte lengths. They
793 * used to be created (bug) if while punching holes we hit
794 * -ENOSPC condition. So if we find one here, just ensure we
795 * delete it, otherwise we would insert a new file extent item
796 * with the same key (offset) as that 0 bytes length file
797 * extent item in the call to setup_items_for_insert() later
798 * in this function.
799 */
806 }
814 }
816 /*
817 * | - range to drop - |
818 * | -------- extent -------- |
819 */
825 }
834 }
860 }
862 }
863 /*
864 * | ---- range to drop ----- |
865 * | -------- extent -------- |
866 */
871 }
885 }
888 /*
889 * | ---- range to drop ----- |
890 * | -------- extent -------- |
891 */
897 }
909 }
911 /*
912 * | ---- range to drop ----- |
913 * | ------ extent ------ |
914 */
916 delete_extent_item:
922 del_nr++;
923 }
936 extent_offset);
940 }
948 }
951 del_nr);
955 }
962 }
965 }
968 /*
969 * Set path->slots[0] to first slot, so that after the delete
970 * if items are move off from our leaf to its immediate left or
971 * right neighbor leafs, we end up with a correct and adjusted
972 * path->slots[0] for our insertion (if replace_extent != 0).
973 */
978 }
981 /*
982 * If btrfs_del_items() was called, it might have deleted a leaf, in
983 * which case it unlocked our path, so check path->locks[0] matches a
984 * write lock.
985 */
1001 }
1004 extent_item_size,
1008 }
1015 }
1020 {
1031 }
1036 {
1039 u64 extent_end;
1064 }
1066 /*
1067 * Mark extent in the range start - end as written.
1068 *
1069 * This changes extent type from 'pre-allocated' to 'regular'. If only
1070 * part of extent is marked as written, the extent will be split into
1071 * two or three.
1072 */
1075 {
1082 u64 bytenr;
1083 u64 num_bytes;
1084 u64 extent_end;
1085 u64 orig_offset;
1086 u64 other_start;
1087 u64 other_end;
1088 u64 split;
1098 again:
1117 BTRFS_FILE_EXTENT_PREALLOC);
1150 }
1151 }
1179 }
1180 }
1191 }
1195 }
1224 }
1226 }
1236 }
1239 del_nr++;
1244 }
1253 }
1256 del_nr++;
1261 }
1266 BTRFS_FILE_EXTENT_REG);
1273 BTRFS_FILE_EXTENT_REG);
1283 }
1284 }
1285 out:
1288 }
1290 /*
1291 * on error we return an unlocked page and the error value
1292 * on success we return a locked page and 0
1293 */
1297 {
1309 }
1313 }
1314 }
1316 }
1318 /*
1319 * this just gets pages into the page cache and locks them down.
1320 */
1324 {
1332 again:
1339 }
1343 force_uptodate);
1352 }
1355 }
1357 }
1360 fail:
1364 faili--;
1365 }
1368 }
1370 /*
1371 * This function locks the extent and properly waits for data=ordered extents
1372 * to finish before allowing the pages to be modified if need.
1373 *
1374 * The return value:
1375 * 1 - the extent is locked
1376 * 0 - the extent is not locked, and everything is OK
1377 * -EAGAIN - need re-prepare the pages
1378 * the other < 0 number - Something wrong happens
1379 */
1385 {
1386 u64 start_pos;
1387 u64 last_pos;
1409 }
1413 }
1424 }
1431 }
1434 }
1438 {
1442 u64 num_bytes;
1458 }
1462 }
1472 }
1477 }
1481 loff_t pos)
1482 {
1488 u64 lockstart;
1489 u64 lockend;
1509 offset);
1511 PAGE_CACHE_SIZE);
1518 /*
1519 * Fault pages before locking them in prepare_pages
1520 * to avoid recursive lock
1521 */
1525 }
1530 BTRFS_INODE_PREALLOC)) &&
1532 /*
1533 * For nodata cow case, no need to reserve
1534 * data space.
1535 */
1537 /*
1538 * our prealloc extent may be smaller than
1539 * write_bytes, so scale down.
1540 */
1542 PAGE_CACHE_SIZE);
1545 }
1551 reserve_metadata:
1556 write_bytes);
1557 else
1560 }
1564 again:
1565 /*
1566 * This is going to setup the pages array with the number of
1567 * pages we want, so we don't really need to worry about the
1568 * contents of pages from loop to loop
1569 */
1572 force_page_uptodate);
1586 }
1591 /*
1592 * if we have trouble faulting in the pages, fall
1593 * back to one page at a time
1594 */
1604 PAGE_CACHE_SIZE);
1605 }
1607 /*
1608 * If we had a short copy we need to release the excess delaloc
1609 * bytes we reserved. We need to increment outstanding_extents
1610 * because btrfs_delalloc_release_space will decrement it, but
1611 * we still have an outstanding extent for the chunk we actually
1612 * managed to copy.
1613 */
1616 PAGE_CACHE_SHIFT;
1621 }
1624 release_bytes);
1626 u64 __pos;
1631 release_bytes);
1632 }
1633 }
1640 NULL);
1644 GFP_NOFS);
1648 }
1663 }
1675 }
1685 }
1686 }
1689 }
1693 loff_t pos)
1694 {
1697 ssize_t written;
1698 ssize_t written_buffered;
1699 loff_t endbyte;
1712 }
1713 /*
1714 * Ensure all data is persisted. We want the next direct IO read to be
1715 * able to read what was just written.
1716 */
1728 out:
1730 }
1733 {
1748 }
1752 {
1756 u64 start_pos;
1757 u64 end_pos;
1760 ssize_t err;
1761 loff_t pos;
1769 }
1776 }
1778 /*
1779 * If BTRFS flips readonly due to some impossible error
1780 * (fs_info->fs_state now has BTRFS_SUPER_FLAG_ERROR),
1781 * although we have opened a file as writable, we have
1782 * to stop this write operation to ensure FS consistency.
1783 */
1788 }
1790 /*
1791 * We reserve space for updating the inode when we reserve space for the
1792 * extent we are going to write, so we will enospc out there. We don't
1793 * need to start yet another transaction to update the inode as we will
1794 * update the inode when we finish writing whatever data we write.
1795 */
1802 /* Expand hole size to cover write data, preventing empty gap */
1808 }
1809 }
1820 }
1824 /*
1825 * We also have to set last_sub_trans to the current log transid,
1826 * otherwise subsequent syncs to a file that's been synced in this
1827 * transaction will appear to have already occured.
1828 */
1836 }
1840 out:
1843 }
1846 {
1849 /*
1850 * ordered_data_close is set by settattr when we are about to truncate
1851 * a file from a non-zero size to a zero size. This tries to
1852 * flush down new bytes that may have been written if the
1853 * application were using truncate to replace a file in place.
1854 */
1859 }
1862 {
1866 /*
1867 * This is only called in fsync, which would do synchronous writes, so
1868 * a plug can merge adjacent IOs as much as possible. Esp. in case of
1869 * multiple disks using raid profile, a large IO can be split to
1870 * several segments of stripe length (currently 64K).
1871 */
1879 }
1881 /*
1882 * fsync call for both files and directories. This logs the inode into
1883 * the tree log instead of forcing full commits whenever possible.
1884 *
1885 * It needs to call filemap_fdatawait so that all ordered extent updates are
1886 * in the metadata btree are up to date for copying to the log.
1887 *
1888 * It drops the inode mutex before doing the tree log commit. This is an
1889 * important optimization for directories because holding the mutex prevents
1890 * new operations on the dir while we write to disk.
1891 */
1893 {
1901 u64 len;
1903 /*
1904 * The range length can be represented by u64, we have to do the typecasts
1905 * to avoid signed overflow if it's [0, LLONG_MAX] eg. from fsync()
1906 */
1910 /*
1911 * We write the dirty pages in the range and wait until they complete
1912 * out of the ->i_mutex. If so, we can flush the dirty pages by
1913 * multi-task, and make the performance up. See
1914 * btrfs_wait_ordered_range for an explanation of the ASYNC check.
1915 */
1924 /*
1925 * We might have have had more pages made dirty after calling
1926 * start_ordered_ops and before acquiring the inode's i_mutex.
1927 */
1929 /*
1930 * For a full sync, we need to make sure any ordered operations
1931 * start and finish before we start logging the inode, so that
1932 * all extents are persisted and the respective file extent
1933 * items are in the fs/subvol btree.
1934 */
1937 /*
1938 * Start any new ordered operations before starting to log the
1939 * inode. We will wait for them to finish in btrfs_sync_log().
1940 *
1941 * Right before acquiring the inode's mutex, we might have new
1942 * writes dirtying pages, which won't immediately start the
1943 * respective ordered operations - that is done through the
1944 * fill_delalloc callbacks invoked from the writepage and
1945 * writepages address space operations. So make sure we start
1946 * all ordered operations before starting to log our inode. Not
1947 * doing this means that while logging the inode, writeback
1948 * could start and invoke writepage/writepages, which would call
1949 * the fill_delalloc callbacks (cow_file_range,
1950 * submit_compressed_extents). These callbacks add first an
1951 * extent map to the modified list of extents and then create
1952 * the respective ordered operation, which means in
1953 * tree-log.c:btrfs_log_inode() we might capture all existing
1954 * ordered operations (with btrfs_get_logged_extents()) before
1955 * the fill_delalloc callback adds its ordered operation, and by
1956 * the time we visit the modified list of extent maps (with
1957 * btrfs_log_changed_extents()), we see and process the extent
1958 * map they created. We then use the extent map to construct a
1959 * file extent item for logging without waiting for the
1960 * respective ordered operation to finish - this file extent
1961 * item points to a disk location that might not have yet been
1962 * written to, containing random data - so after a crash a log
1963 * replay will make our inode have file extent items that point
1964 * to disk locations containing invalid data, as we returned
1965 * success to userspace without waiting for the respective
1966 * ordered operation to finish, because it wasn't captured by
1967 * btrfs_get_logged_extents().
1968 */
1970 }
1974 }
1977 /*
1978 * If the last transaction that changed this file was before the current
1979 * transaction and we have the full sync flag set in our inode, we can
1980 * bail out now without any syncing.
1981 *
1982 * Note that we can't bail out if the full sync flag isn't set. This is
1983 * because when the full sync flag is set we start all ordered extents
1984 * and wait for them to fully complete - when they complete they update
1985 * the inode's last_trans field through:
1986 *
1987 * btrfs_finish_ordered_io() ->
1988 * btrfs_update_inode_fallback() ->
1989 * btrfs_update_inode() ->
1990 * btrfs_set_inode_last_trans()
1991 *
1992 * So we are sure that last_trans is up to date and can do this check to
1993 * bail out safely. For the fast path, when the full sync flag is not
1994 * set in our inode, we can not do it because we start only our ordered
1995 * extents and don't wait for them to complete (that is when
1996 * btrfs_finish_ordered_io runs), so here at this point their last_trans
1997 * value might be less than or equals to fs_info->last_trans_committed,
1998 * and setting a speculative last_trans for an inode when a buffered
1999 * write is made (such as fs_info->generation + 1 for example) would not
2000 * be reliable since after setting the value and before fsync is called
2001 * any number of transactions can start and commit (transaction kthread
2002 * commits the current transaction periodically), and a transaction
2003 * commit does not start nor waits for ordered extents to complete.
2004 */
2011 /*
2012 * We'v had everything committed since the last time we were
2013 * modified so clear this flag in case it was set for whatever
2014 * reason, it's no longer relevant.
2015 */
2020 }
2022 /*
2023 * ok we haven't committed the transaction yet, lets do a commit
2024 */
2028 /*
2029 * We use start here because we will need to wait on the IO to complete
2030 * in btrfs_sync_log, which could require joining a transaction (for
2031 * example checking cross references in the nocow path). If we use join
2032 * here we could get into a situation where we're waiting on IO to
2033 * happen that is blocked on a transaction trying to commit. With start
2034 * we inc the extwriter counter, so we wait for all extwriters to exit
2035 * before we start blocking join'ers. This comment is to keep somebody
2036 * from thinking they are super smart and changing this to
2037 * btrfs_join_transaction *cough*Josef*cough*.
2038 */
2044 }
2051 /* Fallthrough and commit/free transaction. */
2053 }
2055 /* we've logged all the items and now have a consistent
2056 * version of the file in the log. It is possible that
2057 * someone will come in and modify the file, but that's
2058 * fine because the log is consistent on disk, and we
2059 * have references to all of the file's extents
2060 *
2061 * It is possible that someone will come in and log the
2062 * file again, but that will end up using the synchronization
2063 * inside btrfs_sync_log to keep things safe.
2064 */
2067 /*
2068 * If any of the ordered extents had an error, just return it to user
2069 * space, so that the application knows some writes didn't succeed and
2070 * can take proper action (retry for e.g.). Blindly committing the
2071 * transaction in this case, would fool userspace that everything was
2072 * successful. And we also want to make sure our log doesn't contain
2073 * file extent items pointing to extents that weren't fully written to -
2074 * just like in the non fast fsync path, where we check for the ordered
2075 * operation's error flag before writing to the log tree and return -EIO
2076 * if any of them had this flag set (btrfs_wait_ordered_range) -
2077 * therefore we need to check for errors in the ordered operations,
2078 * which are indicated by ctx.io_err.
2079 */
2084 }
2092 }
2093 }
2099 }
2100 }
2104 }
2105 out:
2107 }
2113 };
2116 {
2126 }
2130 {
2155 }
2159 {
2182 u64 num_bytes;
2194 }
2197 u64 num_bytes;
2204 offset;
2210 }
2219 out:
2250 }
2253 }
2255 /*
2256 * Find a hole extent on given inode and change start/len to the end of hole
2257 * extent.(hole/vacuum extent whose em->start <= start &&
2258 * em->start + em->len > start)
2259 * When a hole extent is found, return 1 and modify start/len.
2260 */
2262 {
2270 else
2273 }
2275 /* Hole or vacuum extent(only exists in no-hole mode) */
2281 }
2284 }
2287 {
2293 u64 lockstart;
2294 u64 lockend;
2295 u64 tail_start;
2296 u64 tail_len;
2298 u64 cur_offset;
2300 u64 drop_end;
2306 u64 ino_size;
2320 /* Already in a large hole */
2323 }
2331 /*
2332 * We needn't truncate any page which is beyond the end of the file
2333 * because we are sure there is no data there.
2334 */
2335 /*
2336 * Only do this if we are in the same page and we aren't doing the
2337 * entire page.
2338 */
2345 }
2347 }
2349 /* zero back part of the first page */
2356 }
2357 }
2359 /* Check the aligned pages after the first unaligned page,
2360 * if offset != orig_start, which means the first unaligned page
2361 * including serveral following pages are already in holes,
2362 * the extra check can be skipped */
2364 /* after truncate page, check hole again */
2373 }
2375 }
2377 /* Check the tail unaligned part is in a hole */
2385 /* zero the front end of the last page */
2392 }
2393 }
2394 }
2399 }
2410 /*
2411 * We need to make sure we have no ordered extents in this range
2412 * and nobody raced in and read a page in this range, if we did
2413 * we need to try again.
2414 */
2422 }
2432 }
2433 }
2439 }
2445 }
2449 /*
2450 * 1 - update the inode
2451 * 1 - removing the extents in the range
2452 * 1 - adding the hole extent if no_holes isn't set
2453 */
2459 }
2462 min_size);
2479 drop_end);
2483 }
2484 }
2492 }
2502 }
2515 }
2516 }
2521 }
2524 /*
2525 * If we are using the NO_HOLES feature we might have had already an
2526 * hole that overlaps a part of the region [lockstart, lockend] and
2527 * ends at (or beyond) lockend. Since we have no file extent items to
2528 * represent holes, drop_end can be less than lockend and so we must
2529 * make sure we have an extent map representing the existing hole (the
2530 * call to __btrfs_drop_extents() might have dropped the existing extent
2531 * map representing the existing hole), otherwise the fast fsync path
2532 * will not record the existence of the hole region
2533 * [existing_hole_start, lockend].
2534 */
2537 /*
2538 * Don't insert file hole extent item if it's for a range beyond eof
2539 * (because it's useless) or if it represents a 0 bytes range (when
2540 * cur_offset == drop_end).
2541 */
2547 }
2548 }
2550 out_trans:
2562 out_free:
2565 out:
2568 out_only_mutex:
2570 /*
2571 * If we only end up zeroing part of a page, we still need to
2572 * update the inode item, so that all the time fields are
2573 * updated as well as the necessary btrfs inode in memory fields
2574 * for detecting, at fsync time, if the inode isn't yet in the
2575 * log tree or it's there but not up to date.
2576 */
2583 }
2584 }
2589 }
2591 /* Helper structure to record which range is already reserved */
2594 u64 start;
2595 u64 len;
2596 };
2598 /*
2599 * Helper function to add falloc range
2600 *
2601 * Caller should have locked the larger range of extent containing
2602 * [start, len)
2603 */
2605 {
2612 /*
2613 * As fallocate iterate by bytenr order, we only need to check
2614 * the last range.
2615 */
2620 }
2621 insert:
2629 }
2633 {
2639 u64 cur_offset;
2640 u64 last_byte;
2641 u64 alloc_start;
2642 u64 alloc_end;
2644 u64 locked_end;
2653 /* Make sure we aren't being give some crap mode */
2660 /*
2661 * Only trigger disk allocation, don't trigger qgroup reserve
2662 *
2663 * For qgroup space, it will be checked later.
2664 */
2674 /*
2675 * TODO: Move these two operations after we have checked
2676 * accurate reserved space, or fallocate can still fail but
2677 * with page truncated or size expanded.
2678 *
2679 * But that's a minor problem and won't do much harm BTW.
2680 */
2683 alloc_start);
2687 /*
2688 * If we are fallocating from the end of the file onward we
2689 * need to zero out the end of the page if i_size lands in the
2690 * middle of a page.
2691 */
2695 }
2697 /*
2698 * wait for ordered IO before we have any locks. We'll loop again
2699 * below with the locks held.
2700 */
2710 /* the extent lock is ordered inside the running
2711 * transaction
2712 */
2724 /*
2725 * we can't wait on the range with the transaction
2726 * running or with the extent lock held
2727 */
2736 }
2737 }
2739 /* First, check if we exceed the qgroup limit */
2748 else
2751 }
2763 }
2768 }
2773 }
2775 /*
2776 * If ret is still 0, means we're OK to fallocate.
2777 * Or just cleanup the list and exit.
2778 */
2787 }
2796 /*
2797 * We didn't need to allocate any more space, but we
2798 * still extended the size of the file so we need to
2799 * update i_size and the inode item.
2800 */
2811 else
2813 }
2814 }
2815 out_unlock:
2818 out:
2819 /*
2820 * As we waited the extent range, the data_rsv_map must be empty
2821 * in the range, as written data range will be released from it.
2822 * And for prealloacted extent, it will also be released when
2823 * its metadata is written.
2824 * So this is completely used as cleanup.
2825 */
2828 /* Let go of our reservation. */
2832 }
2835 {
2839 u64 lockstart;
2840 u64 lockend;
2841 u64 start;
2842 u64 len;
2848 /*
2849 * *offset can be negative, in this case we start finding DATA/HOLE from
2850 * the very start of the file.
2851 */
2858 lockend--;
2870 }
2885 }
2890 else
2892 }
2896 }
2899 {
2914 }
2920 }
2921 }
2924 out:
2927 }
2940 #ifdef CONFIG_COMPAT
2942 #endif
2943 };
2946 {
2949 }
2952 {
2956 NULL);
2961 }
2964 {
2967 /*
2968 * So with compression we will find and lock a dirty page and clear the
2969 * first one as dirty, setup an async extent, and immediately return
2970 * with the entire range locked but with nobody actually marked with
2971 * writeback. So we can't just filemap_write_and_wait_range() and
2972 * expect it to work since it will just kick off a thread to do the
2973 * actual work. So we need to call filemap_fdatawrite_range _again_
2974 * since it will wait on the page lock, which won't be unlocked until
2975 * after the pages have been marked as writeback and so we're good to go
2976 * from there. We have to do this otherwise we'll miss the ordered
2977 * extents and that results in badness. Please Josef, do not think you
2978 * know better and pull this out at some point in the future, it is
2979 * right and you are wrong.
2980 */
2987 }