fs/btrfs/file.c

   1 // SPDX-License-Identifier: GPL-2.0
   2 /*
   3  * Copyright (C) 2007 Oracle.  All rights reserved.
   4  */
   5
   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>
  19 #include "ctree.h"
  20 #include "disk-io.h"
  21 #include "transaction.h"
  22 #include "btrfs_inode.h"
  23 #include "print-tree.h"
  24 #include "tree-log.h"
  25 #include "locking.h"
  26 #include "volumes.h"
  27 #include "qgroup.h"
  28 #include "compression.h"
  29 #include "delalloc-space.h"
  30 #include "reflink.h"
  31
  32 static struct kmem_cache *btrfs_inode_defrag_cachep;
  33 /*
  34  * when auto defrag is enabled we
  35  * queue up these defrag structs to remember which
  36  * inodes need defragging passes
  37  */
  38 struct inode_defrag {
  39         struct rb_node rb_node;
  40         /* objectid */
  41         u64 ino;
  42         /*
  43          * transid where the defrag was added, we search for
  44          * extents newer than this
  45          */
  46         u64 transid;
  47
  48         /* root objectid */
  49         u64 root;
  50
  51         /* last offset we were able to defrag */
  52         u64 last_offset;
  53
  54         /* if we've wrapped around back to zero once already */
  55         int cycled;
  56 };
  57
  58 static int __compare_inode_defrag(struct inode_defrag *defrag1,
  59                                   struct inode_defrag *defrag2)
  60 {
  61         if (defrag1->root > defrag2->root)
  62                 return 1;
  63         else if (defrag1->root < defrag2->root)
  64                 return -1;
  65         else if (defrag1->ino > defrag2->ino)
  66                 return 1;
  67         else if (defrag1->ino < defrag2->ino)
  68                 return -1;
  69         else
  70                 return 0;
  71 }
  72
  73 /* pop a record for an inode into the defrag tree.  The lock
  74  * must be held already
  75  *
  76  * If you're inserting a record for an older transid than an
  77  * existing record, the transid already in the tree is lowered
  78  *
  79  * If an existing record is found the defrag item you
  80  * pass in is freed
  81  */
  82 static int __btrfs_add_inode_defrag(struct btrfs_inode *inode,
  83                                     struct inode_defrag *defrag)
  84 {
  85         struct btrfs_fs_info *fs_info = inode->root->fs_info;
  86         struct inode_defrag *entry;
  87         struct rb_node **p;
  88         struct rb_node *parent = NULL;
  89         int ret;
  90
  91         p = &fs_info->defrag_inodes.rb_node;
  92         while (*p) {
  93                 parent = *p;
  94                 entry = rb_entry(parent, struct inode_defrag, rb_node);
  95
  96                 ret = __compare_inode_defrag(defrag, entry);
  97                 if (ret < 0)
  98                         p = &parent->rb_left;
  99                 else if (ret > 0)
 100                         p = &parent->rb_right;
 101                 else {
 102                         /* if we're reinserting an entry for
 103                          * an old defrag run, make sure to
 104                          * lower the transid of our existing record
 105                          */
 106                         if (defrag->transid < entry->transid)
 107                                 entry->transid = defrag->transid;
 108                         if (defrag->last_offset > entry->last_offset)
 109                                 entry->last_offset = defrag->last_offset;
 110                         return -EEXIST;
 111                 }
 112         }
 113         set_bit(BTRFS_INODE_IN_DEFRAG, &inode->runtime_flags);
 114         rb_link_node(&defrag->rb_node, parent, p);
 115         rb_insert_color(&defrag->rb_node, &fs_info->defrag_inodes);
 116         return 0;
 117 }
 118
 119 static inline int __need_auto_defrag(struct btrfs_fs_info *fs_info)
 120 {
 121         if (!btrfs_test_opt(fs_info, AUTO_DEFRAG))
 122                 return 0;
 123
 124         if (btrfs_fs_closing(fs_info))
 125                 return 0;
 126
 127         return 1;
 128 }
 129
 130 /*
 131  * insert a defrag record for this inode if auto defrag is
 132  * enabled
 133  */
 134 int btrfs_add_inode_defrag(struct btrfs_trans_handle *trans,
 135                            struct btrfs_inode *inode)
 136 {
 137         struct btrfs_root *root = inode->root;
 138         struct btrfs_fs_info *fs_info = root->fs_info;
 139         struct inode_defrag *defrag;
 140         u64 transid;
 141         int ret;
 142
 143         if (!__need_auto_defrag(fs_info))
 144                 return 0;
 145
 146         if (test_bit(BTRFS_INODE_IN_DEFRAG, &inode->runtime_flags))
 147                 return 0;
 148
 149         if (trans)
 150                 transid = trans->transid;
 151         else
 152                 transid = inode->root->last_trans;
 153
 154         defrag = kmem_cache_zalloc(btrfs_inode_defrag_cachep, GFP_NOFS);
 155         if (!defrag)
 156                 return -ENOMEM;
 157
 158         defrag->ino = btrfs_ino(inode);
 159         defrag->transid = transid;
 160         defrag->root = root->root_key.objectid;
 161
 162         spin_lock(&fs_info->defrag_inodes_lock);
 163         if (!test_bit(BTRFS_INODE_IN_DEFRAG, &inode->runtime_flags)) {
 164                 /*
 165                  * If we set IN_DEFRAG flag and evict the inode from memory,
 166                  * and then re-read this inode, this new inode doesn't have
 167                  * IN_DEFRAG flag. At the case, we may find the existed defrag.
 168                  */
 169                 ret = __btrfs_add_inode_defrag(inode, defrag);
 170                 if (ret)
 171                         kmem_cache_free(btrfs_inode_defrag_cachep, defrag);
 172         } else {
 173                 kmem_cache_free(btrfs_inode_defrag_cachep, defrag);
 174         }
 175         spin_unlock(&fs_info->defrag_inodes_lock);
 176         return 0;
 177 }
 178
 179 /*
 180  * Requeue the defrag object. If there is a defrag object that points to
 181  * the same inode in the tree, we will merge them together (by
 182  * __btrfs_add_inode_defrag()) and free the one that we want to requeue.
 183  */
 184 static void btrfs_requeue_inode_defrag(struct btrfs_inode *inode,
 185                                        struct inode_defrag *defrag)
 186 {
 187         struct btrfs_fs_info *fs_info = inode->root->fs_info;
 188         int ret;
 189
 190         if (!__need_auto_defrag(fs_info))
 191                 goto out;
 192
 193         /*
 194          * Here we don't check the IN_DEFRAG flag, because we need merge
 195          * them together.
 196          */
 197         spin_lock(&fs_info->defrag_inodes_lock);
 198         ret = __btrfs_add_inode_defrag(inode, defrag);
 199         spin_unlock(&fs_info->defrag_inodes_lock);
 200         if (ret)
 201                 goto out;
 202         return;
 203 out:
 204         kmem_cache_free(btrfs_inode_defrag_cachep, defrag);
 205 }
 206
 207 /*
 208  * pick the defragable inode that we want, if it doesn't exist, we will get
 209  * the next one.
 210  */
 211 static struct inode_defrag *
 212 btrfs_pick_defrag_inode(struct btrfs_fs_info *fs_info, u64 root, u64 ino)
 213 {
 214         struct inode_defrag *entry = NULL;
 215         struct inode_defrag tmp;
 216         struct rb_node *p;
 217         struct rb_node *parent = NULL;
 218         int ret;
 219
 220         tmp.ino = ino;
 221         tmp.root = root;
 222
 223         spin_lock(&fs_info->defrag_inodes_lock);
 224         p = fs_info->defrag_inodes.rb_node;
 225         while (p) {
 226                 parent = p;
 227                 entry = rb_entry(parent, struct inode_defrag, rb_node);
 228
 229                 ret = __compare_inode_defrag(&tmp, entry);
 230                 if (ret < 0)
 231                         p = parent->rb_left;
 232                 else if (ret > 0)
 233                         p = parent->rb_right;
 234                 else
 235                         goto out;
 236         }
 237
 238         if (parent && __compare_inode_defrag(&tmp, entry) > 0) {
 239                 parent = rb_next(parent);
 240                 if (parent)
 241                         entry = rb_entry(parent, struct inode_defrag, rb_node);
 242                 else
 243                         entry = NULL;
 244         }
 245 out:
 246         if (entry)
 247                 rb_erase(parent, &fs_info->defrag_inodes);
 248         spin_unlock(&fs_info->defrag_inodes_lock);
 249         return entry;
 250 }
 251
 252 void btrfs_cleanup_defrag_inodes(struct btrfs_fs_info *fs_info)
 253 {
 254         struct inode_defrag *defrag;
 255         struct rb_node *node;
 256
 257         spin_lock(&fs_info->defrag_inodes_lock);
 258         node = rb_first(&fs_info->defrag_inodes);
 259         while (node) {
 260                 rb_erase(node, &fs_info->defrag_inodes);
 261                 defrag = rb_entry(node, struct inode_defrag, rb_node);
 262                 kmem_cache_free(btrfs_inode_defrag_cachep, defrag);
 263
 264                 cond_resched_lock(&fs_info->defrag_inodes_lock);
 265
 266                 node = rb_first(&fs_info->defrag_inodes);
 267         }
 268         spin_unlock(&fs_info->defrag_inodes_lock);
 269 }
 270
 271 #define BTRFS_DEFRAG_BATCH      1024
 272
 273 static int __btrfs_run_defrag_inode(struct btrfs_fs_info *fs_info,
 274                                     struct inode_defrag *defrag)
 275 {
 276         struct btrfs_root *inode_root;
 277         struct inode *inode;
 278         struct btrfs_ioctl_defrag_range_args range;
 279         int num_defrag;
 280         int ret;
 281
 282         /* get the inode */
 283         inode_root = btrfs_get_fs_root(fs_info, defrag->root, true);
 284         if (IS_ERR(inode_root)) {
 285                 ret = PTR_ERR(inode_root);
 286                 goto cleanup;
 287         }
 288
 289         inode = btrfs_iget(fs_info->sb, defrag->ino, inode_root);
 290         btrfs_put_root(inode_root);
 291         if (IS_ERR(inode)) {
 292                 ret = PTR_ERR(inode);
 293                 goto cleanup;
 294         }
 295
 296         /* do a chunk of defrag */
 297         clear_bit(BTRFS_INODE_IN_DEFRAG, &BTRFS_I(inode)->runtime_flags);
 298         memset(&range, 0, sizeof(range));
 299         range.len = (u64)-1;
 300         range.start = defrag->last_offset;
 301
 302         sb_start_write(fs_info->sb);
 303         num_defrag = btrfs_defrag_file(inode, NULL, &range, defrag->transid,
 304                                        BTRFS_DEFRAG_BATCH);
 305         sb_end_write(fs_info->sb);
 306         /*
 307          * if we filled the whole defrag batch, there
 308          * must be more work to do.  Queue this defrag
 309          * again
 310          */
 311         if (num_defrag == BTRFS_DEFRAG_BATCH) {
 312                 defrag->last_offset = range.start;
 313                 btrfs_requeue_inode_defrag(BTRFS_I(inode), defrag);
 314         } else if (defrag->last_offset && !defrag->cycled) {
 315                 /*
 316                  * we didn't fill our defrag batch, but
 317                  * we didn't start at zero.  Make sure we loop
 318                  * around to the start of the file.
 319                  */
 320                 defrag->last_offset = 0;
 321                 defrag->cycled = 1;
 322                 btrfs_requeue_inode_defrag(BTRFS_I(inode), defrag);
 323         } else {
 324                 kmem_cache_free(btrfs_inode_defrag_cachep, defrag);
 325         }
 326
 327         iput(inode);
 328         return 0;
 329 cleanup:
 330         kmem_cache_free(btrfs_inode_defrag_cachep, defrag);
 331         return ret;
 332 }
 333
 334 /*
 335  * run through the list of inodes in the FS that need
 336  * defragging
 337  */
 338 int btrfs_run_defrag_inodes(struct btrfs_fs_info *fs_info)
 339 {
 340         struct inode_defrag *defrag;
 341         u64 first_ino = 0;
 342         u64 root_objectid = 0;
 343
 344         atomic_inc(&fs_info->defrag_running);
 345         while (1) {
 346                 /* Pause the auto defragger. */
 347                 if (test_bit(BTRFS_FS_STATE_REMOUNTING,
 348                              &fs_info->fs_state))
 349                         break;
 350
 351                 if (!__need_auto_defrag(fs_info))
 352                         break;
 353
 354                 /* find an inode to defrag */
 355                 defrag = btrfs_pick_defrag_inode(fs_info, root_objectid,
 356                                                  first_ino);
 357                 if (!defrag) {
 358                         if (root_objectid || first_ino) {
 359                                 root_objectid = 0;
 360                                 first_ino = 0;
 361                                 continue;
 362                         } else {
 363                                 break;
 364                         }
 365                 }
 366
 367                 first_ino = defrag->ino + 1;
 368                 root_objectid = defrag->root;
 369
 370                 __btrfs_run_defrag_inode(fs_info, defrag);
 371         }
 372         atomic_dec(&fs_info->defrag_running);
 373
 374         /*
 375          * during unmount, we use the transaction_wait queue to
 376          * wait for the defragger to stop
 377          */
 378         wake_up(&fs_info->transaction_wait);
 379         return 0;
 380 }
 381
 382 /* simple helper to fault in pages and copy.  This should go away
 383  * and be replaced with calls into generic code.
 384  */
 385 static noinline int btrfs_copy_from_user(loff_t pos, size_t write_bytes,
 386                                          struct page **prepared_pages,
 387                                          struct iov_iter *i)
 388 {
 389         size_t copied = 0;
 390         size_t total_copied = 0;
 391         int pg = 0;
 392         int offset = offset_in_page(pos);
 393
 394         while (write_bytes > 0) {
 395                 size_t count = min_t(size_t,
 396                                      PAGE_SIZE - offset, write_bytes);
 397                 struct page *page = prepared_pages[pg];
 398                 /*
 399                  * Copy data from userspace to the current page
 400                  */
 401                 copied = iov_iter_copy_from_user_atomic(page, i, offset, count);
 402
 403                 /* Flush processor's dcache for this page */
 404                 flush_dcache_page(page);
 405
 406                 /*
 407                  * if we get a partial write, we can end up with
 408                  * partially up to date pages.  These add
 409                  * a lot of complexity, so make sure they don't
 410                  * happen by forcing this copy to be retried.
 411                  *
 412                  * The rest of the btrfs_file_write code will fall
 413                  * back to page at a time copies after we return 0.
 414                  */
 415                 if (!PageUptodate(page) && copied < count)
 416                         copied = 0;
 417
 418                 iov_iter_advance(i, copied);
 419                 write_bytes -= copied;
 420                 total_copied += copied;
 421
 422                 /* Return to btrfs_file_write_iter to fault page */
 423                 if (unlikely(copied == 0))
 424                         break;
 425
 426                 if (copied < PAGE_SIZE - offset) {
 427                         offset += copied;
 428                 } else {
 429                         pg++;
 430                         offset = 0;
 431                 }
 432         }
 433         return total_copied;
 434 }
 435
 436 /*
 437  * unlocks pages after btrfs_file_write is done with them
 438  */
 439 static void btrfs_drop_pages(struct page **pages, size_t num_pages)
 440 {
 441         size_t i;
 442         for (i = 0; i < num_pages; i++) {
 443                 /* page checked is some magic around finding pages that
 444                  * have been modified without going through btrfs_set_page_dirty
 445                  * clear it here. There should be no need to mark the pages
 446                  * accessed as prepare_pages should have marked them accessed
 447                  * in prepare_pages via find_or_create_page()
 448                  */
 449                 ClearPageChecked(pages[i]);
 450                 unlock_page(pages[i]);
 451                 put_page(pages[i]);
 452         }
 453 }
 454
 455 /*
 456  * After btrfs_copy_from_user(), update the following things for delalloc:
 457  * - Mark newly dirtied pages as DELALLOC in the io tree.
 458  *   Used to advise which range is to be written back.
 459  * - Mark modified pages as Uptodate/Dirty and not needing COW fixup
 460  * - Update inode size for past EOF write
 461  */
 462 int btrfs_dirty_pages(struct btrfs_inode *inode, struct page **pages,
 463                       size_t num_pages, loff_t pos, size_t write_bytes,
 464                       struct extent_state **cached, bool noreserve)
 465 {
 466         struct btrfs_fs_info *fs_info = inode->root->fs_info;
 467         int err = 0;
 468         int i;
 469         u64 num_bytes;
 470         u64 start_pos;
 471         u64 end_of_last_block;
 472         u64 end_pos = pos + write_bytes;
 473         loff_t isize = i_size_read(&inode->vfs_inode);
 474         unsigned int extra_bits = 0;
 475
 476         if (write_bytes == 0)
 477                 return 0;
 478
 479         if (noreserve)
 480                 extra_bits |= EXTENT_NORESERVE;
 481
 482         start_pos = round_down(pos, fs_info->sectorsize);
 483         num_bytes = round_up(write_bytes + pos - start_pos,
 484                              fs_info->sectorsize);
 485
 486         end_of_last_block = start_pos + num_bytes - 1;
 487
 488         /*
 489          * The pages may have already been dirty, clear out old accounting so
 490          * we can set things up properly
 491          */
 492         clear_extent_bit(&inode->io_tree, start_pos, end_of_last_block,
 493                          EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
 494                          0, 0, cached);
 495
 496         err = btrfs_set_extent_delalloc(inode, start_pos, end_of_last_block,
 497                                         extra_bits, cached);
 498         if (err)
 499                 return err;
 500
 501         for (i = 0; i < num_pages; i++) {
 502                 struct page *p = pages[i];
 503                 SetPageUptodate(p);
 504                 ClearPageChecked(p);
 505                 set_page_dirty(p);
 506         }
 507
 508         /*
 509          * we've only changed i_size in ram, and we haven't updated
 510          * the disk i_size.  There is no need to log the inode
 511          * at this time.
 512          */
 513         if (end_pos > isize)
 514                 i_size_write(&inode->vfs_inode, end_pos);
 515         return 0;
 516 }
 517
 518 /*
 519  * this drops all the extents in the cache that intersect the range
 520  * [start, end].  Existing extents are split as required.
 521  */
 522 void btrfs_drop_extent_cache(struct btrfs_inode *inode, u64 start, u64 end,
 523                              int skip_pinned)
 524 {
 525         struct extent_map *em;
 526         struct extent_map *split = NULL;
 527         struct extent_map *split2 = NULL;
 528         struct extent_map_tree *em_tree = &inode->extent_tree;
 529         u64 len = end - start + 1;
 530         u64 gen;
 531         int ret;
 532         int testend = 1;
 533         unsigned long flags;
 534         int compressed = 0;
 535         bool modified;
 536
 537         WARN_ON(end < start);
 538         if (end == (u64)-1) {
 539                 len = (u64)-1;
 540                 testend = 0;
 541         }
 542         while (1) {
 543                 int no_splits = 0;
 544
 545                 modified = false;
 546                 if (!split)
 547                         split = alloc_extent_map();
 548                 if (!split2)
 549                         split2 = alloc_extent_map();
 550                 if (!split || !split2)
 551                         no_splits = 1;
 552
 553                 write_lock(&em_tree->lock);
 554                 em = lookup_extent_mapping(em_tree, start, len);
 555                 if (!em) {
 556                         write_unlock(&em_tree->lock);
 557                         break;
 558                 }
 559                 flags = em->flags;
 560                 gen = em->generation;
 561                 if (skip_pinned && test_bit(EXTENT_FLAG_PINNED, &em->flags)) {
 562                         if (testend && em->start + em->len >= start + len) {
 563                                 free_extent_map(em);
 564                                 write_unlock(&em_tree->lock);
 565                                 break;
 566                         }
 567                         start = em->start + em->len;
 568                         if (testend)
 569                                 len = start + len - (em->start + em->len);
 570                         free_extent_map(em);
 571                         write_unlock(&em_tree->lock);
 572                         continue;
 573                 }
 574                 compressed = test_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
 575                 clear_bit(EXTENT_FLAG_PINNED, &em->flags);
 576                 clear_bit(EXTENT_FLAG_LOGGING, &flags);
 577                 modified = !list_empty(&em->list);
 578                 if (no_splits)
 579                         goto next;
 580
 581                 if (em->start < start) {
 582                         split->start = em->start;
 583                         split->len = start - em->start;
 584
 585                         if (em->block_start < EXTENT_MAP_LAST_BYTE) {
 586                                 split->orig_start = em->orig_start;
 587                                 split->block_start = em->block_start;
 588
 589                                 if (compressed)
 590                                         split->block_len = em->block_len;
 591                                 else
 592                                         split->block_len = split->len;
 593                                 split->orig_block_len = max(split->block_len,
 594                                                 em->orig_block_len);
 595                                 split->ram_bytes = em->ram_bytes;
 596                         } else {
 597                                 split->orig_start = split->start;
 598                                 split->block_len = 0;
 599                                 split->block_start = em->block_start;
 600                                 split->orig_block_len = 0;
 601                                 split->ram_bytes = split->len;
 602                         }
 603
 604                         split->generation = gen;
 605                         split->flags = flags;
 606                         split->compress_type = em->compress_type;
 607                         replace_extent_mapping(em_tree, em, split, modified);
 608                         free_extent_map(split);
 609                         split = split2;
 610                         split2 = NULL;
 611                 }
 612                 if (testend && em->start + em->len > start + len) {
 613                         u64 diff = start + len - em->start;
 614
 615                         split->start = start + len;
 616                         split->len = em->start + em->len - (start + len);
 617                         split->flags = flags;
 618                         split->compress_type = em->compress_type;
 619                         split->generation = gen;
 620
 621                         if (em->block_start < EXTENT_MAP_LAST_BYTE) {
 622                                 split->orig_block_len = max(em->block_len,
 623                                                     em->orig_block_len);
 624
 625                                 split->ram_bytes = em->ram_bytes;
 626                                 if (compressed) {
 627                                         split->block_len = em->block_len;
 628                                         split->block_start = em->block_start;
 629                                         split->orig_start = em->orig_start;
 630                                 } else {
 631                                         split->block_len = split->len;
 632                                         split->block_start = em->block_start
 633                                                 + diff;
 634                                         split->orig_start = em->orig_start;
 635                                 }
 636                         } else {
 637                                 split->ram_bytes = split->len;
 638                                 split->orig_start = split->start;
 639                                 split->block_len = 0;
 640                                 split->block_start = em->block_start;
 641                                 split->orig_block_len = 0;
 642                         }
 643
 644                         if (extent_map_in_tree(em)) {
 645                                 replace_extent_mapping(em_tree, em, split,
 646                                                        modified);
 647                         } else {
 648                                 ret = add_extent_mapping(em_tree, split,
 649                                                          modified);
 650                                 ASSERT(ret == 0); /* Logic error */
 651                         }
 652                         free_extent_map(split);
 653                         split = NULL;
 654                 }
 655 next:
 656                 if (extent_map_in_tree(em))
 657                         remove_extent_mapping(em_tree, em);
 658                 write_unlock(&em_tree->lock);
 659
 660                 /* once for us */
 661                 free_extent_map(em);
 662                 /* once for the tree*/
 663                 free_extent_map(em);
 664         }
 665         if (split)
 666                 free_extent_map(split);
 667         if (split2)
 668                 free_extent_map(split2);
 669 }
 670
 671 /*
 672  * this is very complex, but the basic idea is to drop all extents
 673  * in the range start - end.  hint_block is filled in with a block number
 674  * that would be a good hint to the block allocator for this file.
 675  *
 676  * If an extent intersects the range but is not entirely inside the range
 677  * it is either truncated or split.  Anything entirely inside the range
 678  * is deleted from the tree.
 679  *
 680  * Note: the VFS' inode number of bytes is not updated, it's up to the caller
 681  * to deal with that. We set the field 'bytes_found' of the arguments structure
 682  * with the number of allocated bytes found in the target range, so that the
 683  * caller can update the inode's number of bytes in an atomic way when
 684  * replacing extents in a range to avoid races with stat(2).
 685  */
 686 int btrfs_drop_extents(struct btrfs_trans_handle *trans,
 687                        struct btrfs_root *root, struct btrfs_inode *inode,
 688                        struct btrfs_drop_extents_args *args)
 689 {
 690         struct btrfs_fs_info *fs_info = root->fs_info;
 691         struct extent_buffer *leaf;
 692         struct btrfs_file_extent_item *fi;
 693         struct btrfs_ref ref = { 0 };
 694         struct btrfs_key key;
 695         struct btrfs_key new_key;
 696         u64 ino = btrfs_ino(inode);
 697         u64 search_start = args->start;
 698         u64 disk_bytenr = 0;
 699         u64 num_bytes = 0;
 700         u64 extent_offset = 0;
 701         u64 extent_end = 0;
 702         u64 last_end = args->start;
 703         int del_nr = 0;
 704         int del_slot = 0;
 705         int extent_type;
 706         int recow;
 707         int ret;
 708         int modify_tree = -1;
 709         int update_refs;
 710         int found = 0;
 711         int leafs_visited = 0;
 712         struct btrfs_path *path = args->path;
 713
 714         args->bytes_found = 0;
 715         args->extent_inserted = false;
 716
 717         /* Must always have a path if ->replace_extent is true */
 718         ASSERT(!(args->replace_extent && !args->path));
 719
 720         if (!path) {
 721                 path = btrfs_alloc_path();
 722                 if (!path) {
 723                         ret = -ENOMEM;
 724                         goto out;
 725                 }
 726         }
 727
 728         if (args->drop_cache)
 729                 btrfs_drop_extent_cache(inode, args->start, args->end - 1, 0);
 730
 731         if (args->start >= inode->disk_i_size && !args->replace_extent)
 732                 modify_tree = 0;
 733
 734         update_refs = (test_bit(BTRFS_ROOT_SHAREABLE, &root->state) ||
 735                        root == fs_info->tree_root);
 736         while (1) {
 737                 recow = 0;
 738                 ret = btrfs_lookup_file_extent(trans, root, path, ino,
 739                                                search_start, modify_tree);
 740                 if (ret < 0)
 741                         break;
 742                 if (ret > 0 && path->slots[0] > 0 && search_start == args->start) {
 743                         leaf = path->nodes[0];
 744                         btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1);
 745                         if (key.objectid == ino &&
 746                             key.type == BTRFS_EXTENT_DATA_KEY)
 747                                 path->slots[0]--;
 748                 }
 749                 ret = 0;
 750                 leafs_visited++;
 751 next_slot:
 752                 leaf = path->nodes[0];
 753                 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
 754                         BUG_ON(del_nr > 0);
 755                         ret = btrfs_next_leaf(root, path);
 756                         if (ret < 0)
 757                                 break;
 758                         if (ret > 0) {
 759                                 ret = 0;
 760                                 break;
 761                         }
 762                         leafs_visited++;
 763                         leaf = path->nodes[0];
 764                         recow = 1;
 765                 }
 766
 767                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
 768
 769                 if (key.objectid > ino)
 770                         break;
 771                 if (WARN_ON_ONCE(key.objectid < ino) ||
 772                     key.type < BTRFS_EXTENT_DATA_KEY) {
 773                         ASSERT(del_nr == 0);
 774                         path->slots[0]++;
 775                         goto next_slot;
 776                 }
 777                 if (key.type > BTRFS_EXTENT_DATA_KEY || key.offset >= args->end)
 778                         break;
 779
 780                 fi = btrfs_item_ptr(leaf, path->slots[0],
 781                                     struct btrfs_file_extent_item);
 782                 extent_type = btrfs_file_extent_type(leaf, fi);
 783
 784                 if (extent_type == BTRFS_FILE_EXTENT_REG ||
 785                     extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
 786                         disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
 787                         num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi);
 788                         extent_offset = btrfs_file_extent_offset(leaf, fi);
 789                         extent_end = key.offset +
 790                                 btrfs_file_extent_num_bytes(leaf, fi);
 791                 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
 792                         extent_end = key.offset +
 793                                 btrfs_file_extent_ram_bytes(leaf, fi);
 794                 } else {
 795                         /* can't happen */
 796                         BUG();
 797                 }
 798
 799                 /*
 800                  * Don't skip extent items representing 0 byte lengths. They
 801                  * used to be created (bug) if while punching holes we hit
 802                  * -ENOSPC condition. So if we find one here, just ensure we
 803                  * delete it, otherwise we would insert a new file extent item
 804                  * with the same key (offset) as that 0 bytes length file
 805                  * extent item in the call to setup_items_for_insert() later
 806                  * in this function.
 807                  */
 808                 if (extent_end == key.offset && extent_end >= search_start) {
 809                         last_end = extent_end;
 810                         goto delete_extent_item;
 811                 }
 812
 813                 if (extent_end <= search_start) {
 814                         path->slots[0]++;
 815                         goto next_slot;
 816                 }
 817
 818                 found = 1;
 819                 search_start = max(key.offset, args->start);
 820                 if (recow || !modify_tree) {
 821                         modify_tree = -1;
 822                         btrfs_release_path(path);
 823                         continue;
 824                 }
 825
 826                 /*
 827                  *     | - range to drop - |
 828                  *  | -------- extent -------- |
 829                  */
 830                 if (args->start > key.offset && args->end < extent_end) {
 831                         BUG_ON(del_nr > 0);
 832                         if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
 833                                 ret = -EOPNOTSUPP;
 834                                 break;
 835                         }
 836
 837                         memcpy(&new_key, &key, sizeof(new_key));
 838                         new_key.offset = args->start;
 839                         ret = btrfs_duplicate_item(trans, root, path,
 840                                                    &new_key);
 841                         if (ret == -EAGAIN) {
 842                                 btrfs_release_path(path);
 843                                 continue;
 844                         }
 845                         if (ret < 0)
 846                                 break;
 847
 848                         leaf = path->nodes[0];
 849                         fi = btrfs_item_ptr(leaf, path->slots[0] - 1,
 850                                             struct btrfs_file_extent_item);
 851                         btrfs_set_file_extent_num_bytes(leaf, fi,
 852                                                         args->start - key.offset);
 853
 854                         fi = btrfs_item_ptr(leaf, path->slots[0],
 855                                             struct btrfs_file_extent_item);
 856
 857                         extent_offset += args->start - key.offset;
 858                         btrfs_set_file_extent_offset(leaf, fi, extent_offset);
 859                         btrfs_set_file_extent_num_bytes(leaf, fi,
 860                                                         extent_end - args->start);
 861                         btrfs_mark_buffer_dirty(leaf);
 862
 863                         if (update_refs && disk_bytenr > 0) {
 864                                 btrfs_init_generic_ref(&ref,
 865                                                 BTRFS_ADD_DELAYED_REF,
 866                                                 disk_bytenr, num_bytes, 0);
 867                                 btrfs_init_data_ref(&ref,
 868                                                 root->root_key.objectid,
 869                                                 new_key.objectid,
 870                                                 args->start - extent_offset);
 871                                 ret = btrfs_inc_extent_ref(trans, &ref);
 872                                 BUG_ON(ret); /* -ENOMEM */
 873                         }
 874                         key.offset = args->start;
 875                 }
 876                 /*
 877                  * From here on out we will have actually dropped something, so
 878                  * last_end can be updated.
 879                  */
 880                 last_end = extent_end;
 881
 882                 /*
 883                  *  | ---- range to drop ----- |
 884                  *      | -------- extent -------- |
 885                  */
 886                 if (args->start <= key.offset && args->end < extent_end) {
 887                         if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
 888                                 ret = -EOPNOTSUPP;
 889                                 break;
 890                         }
 891
 892                         memcpy(&new_key, &key, sizeof(new_key));
 893                         new_key.offset = args->end;
 894                         btrfs_set_item_key_safe(fs_info, path, &new_key);
 895
 896                         extent_offset += args->end - key.offset;
 897                         btrfs_set_file_extent_offset(leaf, fi, extent_offset);
 898                         btrfs_set_file_extent_num_bytes(leaf, fi,
 899                                                         extent_end - args->end);
 900                         btrfs_mark_buffer_dirty(leaf);
 901                         if (update_refs && disk_bytenr > 0)
 902                                 args->bytes_found += args->end - key.offset;
 903                         break;
 904                 }
 905
 906                 search_start = extent_end;
 907                 /*
 908                  *       | ---- range to drop ----- |
 909                  *  | -------- extent -------- |
 910                  */
 911                 if (args->start > key.offset && args->end >= extent_end) {
 912                         BUG_ON(del_nr > 0);
 913                         if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
 914                                 ret = -EOPNOTSUPP;
 915                                 break;
 916                         }
 917
 918                         btrfs_set_file_extent_num_bytes(leaf, fi,
 919                                                         args->start - key.offset);
 920                         btrfs_mark_buffer_dirty(leaf);
 921                         if (update_refs && disk_bytenr > 0)
 922                                 args->bytes_found += extent_end - args->start;
 923                         if (args->end == extent_end)
 924                                 break;
 925
 926                         path->slots[0]++;
 927                         goto next_slot;
 928                 }
 929
 930                 /*
 931                  *  | ---- range to drop ----- |
 932                  *    | ------ extent ------ |
 933                  */
 934                 if (args->start <= key.offset && args->end >= extent_end) {
 935 delete_extent_item:
 936                         if (del_nr == 0) {
 937                                 del_slot = path->slots[0];
 938                                 del_nr = 1;
 939                         } else {
 940                                 BUG_ON(del_slot + del_nr != path->slots[0]);
 941                                 del_nr++;
 942                         }
 943
 944                         if (update_refs &&
 945                             extent_type == BTRFS_FILE_EXTENT_INLINE) {
 946                                 args->bytes_found += extent_end - key.offset;
 947                                 extent_end = ALIGN(extent_end,
 948                                                    fs_info->sectorsize);
 949                         } else if (update_refs && disk_bytenr > 0) {
 950                                 btrfs_init_generic_ref(&ref,
 951                                                 BTRFS_DROP_DELAYED_REF,
 952                                                 disk_bytenr, num_bytes, 0);
 953                                 btrfs_init_data_ref(&ref,
 954                                                 root->root_key.objectid,
 955                                                 key.objectid,
 956                                                 key.offset - extent_offset);
 957                                 ret = btrfs_free_extent(trans, &ref);
 958                                 BUG_ON(ret); /* -ENOMEM */
 959                                 args->bytes_found += extent_end - key.offset;
 960                         }
 961
 962                         if (args->end == extent_end)
 963                                 break;
 964
 965                         if (path->slots[0] + 1 < btrfs_header_nritems(leaf)) {
 966                                 path->slots[0]++;
 967                                 goto next_slot;
 968                         }
 969
 970                         ret = btrfs_del_items(trans, root, path, del_slot,
 971                                               del_nr);
 972                         if (ret) {
 973                                 btrfs_abort_transaction(trans, ret);
 974                                 break;
 975                         }
 976
 977                         del_nr = 0;
 978                         del_slot = 0;
 979
 980                         btrfs_release_path(path);
 981                         continue;
 982                 }
 983
 984                 BUG();
 985         }
 986
 987         if (!ret && del_nr > 0) {
 988                 /*
 989                  * Set path->slots[0] to first slot, so that after the delete
 990                  * if items are move off from our leaf to its immediate left or
 991                  * right neighbor leafs, we end up with a correct and adjusted
 992                  * path->slots[0] for our insertion (if args->replace_extent).
 993                  */
 994                 path->slots[0] = del_slot;
 995                 ret = btrfs_del_items(trans, root, path, del_slot, del_nr);
 996                 if (ret)
 997                         btrfs_abort_transaction(trans, ret);
 998         }
 999
1000         leaf = path->nodes[0];
1001         /*
1002          * If btrfs_del_items() was called, it might have deleted a leaf, in
1003          * which case it unlocked our path, so check path->locks[0] matches a
1004          * write lock.
1005          */
1006         if (!ret && args->replace_extent && leafs_visited == 1 &&
1007             path->locks[0] == BTRFS_WRITE_LOCK &&
1008             btrfs_leaf_free_space(leaf) >=
1009             sizeof(struct btrfs_item) + args->extent_item_size) {
1010
1011                 key.objectid = ino;
1012                 key.type = BTRFS_EXTENT_DATA_KEY;
1013                 key.offset = args->start;
1014                 if (!del_nr && path->slots[0] < btrfs_header_nritems(leaf)) {
1015                         struct btrfs_key slot_key;
1016
1017                         btrfs_item_key_to_cpu(leaf, &slot_key, path->slots[0]);
1018                         if (btrfs_comp_cpu_keys(&key, &slot_key) > 0)
1019                                 path->slots[0]++;
1020                 }
1021                 setup_items_for_insert(root, path, &key,
1022                                        &args->extent_item_size, 1);
1023                 args->extent_inserted = true;
1024         }
1025
1026         if (!args->path)
1027                 btrfs_free_path(path);
1028         else if (!args->extent_inserted)
1029                 btrfs_release_path(path);
1030 out:
1031         args->drop_end = found ? min(args->end, last_end) : args->end;
1032
1033         return ret;
1034 }
1035
1036 static int extent_mergeable(struct extent_buffer *leaf, int slot,
1037                             u64 objectid, u64 bytenr, u64 orig_offset,
1038                             u64 *start, u64 *end)
1039 {
1040         struct btrfs_file_extent_item *fi;
1041         struct btrfs_key key;
1042         u64 extent_end;
1043
1044         if (slot < 0 || slot >= btrfs_header_nritems(leaf))
1045                 return 0;
1046
1047         btrfs_item_key_to_cpu(leaf, &key, slot);
1048         if (key.objectid != objectid || key.type != BTRFS_EXTENT_DATA_KEY)
1049                 return 0;
1050
1051         fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
1052         if (btrfs_file_extent_type(leaf, fi) != BTRFS_FILE_EXTENT_REG ||
1053             btrfs_file_extent_disk_bytenr(leaf, fi) != bytenr ||
1054             btrfs_file_extent_offset(leaf, fi) != key.offset - orig_offset ||
1055             btrfs_file_extent_compression(leaf, fi) ||
1056             btrfs_file_extent_encryption(leaf, fi) ||
1057             btrfs_file_extent_other_encoding(leaf, fi))
1058                 return 0;
1059
1060         extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi);
1061         if ((*start && *start != key.offset) || (*end && *end != extent_end))
1062                 return 0;
1063
1064         *start = key.offset;
1065         *end = extent_end;
1066         return 1;
1067 }
1068
1069 /*
1070  * Mark extent in the range start - end as written.
1071  *
1072  * This changes extent type from 'pre-allocated' to 'regular'. If only
1073  * part of extent is marked as written, the extent will be split into
1074  * two or three.
1075  */
1076 int btrfs_mark_extent_written(struct btrfs_trans_handle *trans,
1077                               struct btrfs_inode *inode, u64 start, u64 end)
1078 {
1079         struct btrfs_fs_info *fs_info = trans->fs_info;
1080         struct btrfs_root *root = inode->root;
1081         struct extent_buffer *leaf;
1082         struct btrfs_path *path;
1083         struct btrfs_file_extent_item *fi;
1084         struct btrfs_ref ref = { 0 };
1085         struct btrfs_key key;
1086         struct btrfs_key new_key;
1087         u64 bytenr;
1088         u64 num_bytes;
1089         u64 extent_end;
1090         u64 orig_offset;
1091         u64 other_start;
1092         u64 other_end;
1093         u64 split;
1094         int del_nr = 0;
1095         int del_slot = 0;
1096         int recow;
1097         int ret;
1098         u64 ino = btrfs_ino(inode);
1099
1100         path = btrfs_alloc_path();
1101         if (!path)
1102                 return -ENOMEM;
1103 again:
1104         recow = 0;
1105         split = start;
1106         key.objectid = ino;
1107         key.type = BTRFS_EXTENT_DATA_KEY;
1108         key.offset = split;
1109
1110         ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1111         if (ret < 0)
1112                 goto out;
1113         if (ret > 0 && path->slots[0] > 0)
1114                 path->slots[0]--;
1115
1116         leaf = path->nodes[0];
1117         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1118         if (key.objectid != ino ||
1119             key.type != BTRFS_EXTENT_DATA_KEY) {
1120                 ret = -EINVAL;
1121                 btrfs_abort_transaction(trans, ret);
1122                 goto out;
1123         }
1124         fi = btrfs_item_ptr(leaf, path->slots[0],
1125                             struct btrfs_file_extent_item);
1126         if (btrfs_file_extent_type(leaf, fi) != BTRFS_FILE_EXTENT_PREALLOC) {
1127                 ret = -EINVAL;
1128                 btrfs_abort_transaction(trans, ret);
1129                 goto out;
1130         }
1131         extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi);
1132         if (key.offset > start || extent_end < end) {
1133                 ret = -EINVAL;
1134                 btrfs_abort_transaction(trans, ret);
1135                 goto out;
1136         }
1137
1138         bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1139         num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi);
1140         orig_offset = key.offset - btrfs_file_extent_offset(leaf, fi);
1141         memcpy(&new_key, &key, sizeof(new_key));
1142
1143         if (start == key.offset && end < extent_end) {
1144                 other_start = 0;
1145                 other_end = start;
1146                 if (extent_mergeable(leaf, path->slots[0] - 1,
1147                                      ino, bytenr, orig_offset,
1148                                      &other_start, &other_end)) {
1149                         new_key.offset = end;
1150                         btrfs_set_item_key_safe(fs_info, path, &new_key);
1151                         fi = btrfs_item_ptr(leaf, path->slots[0],
1152                                             struct btrfs_file_extent_item);
1153                         btrfs_set_file_extent_generation(leaf, fi,
1154                                                          trans->transid);
1155                         btrfs_set_file_extent_num_bytes(leaf, fi,
1156                                                         extent_end - end);
1157                         btrfs_set_file_extent_offset(leaf, fi,
1158                                                      end - orig_offset);
1159                         fi = btrfs_item_ptr(leaf, path->slots[0] - 1,
1160                                             struct btrfs_file_extent_item);
1161                         btrfs_set_file_extent_generation(leaf, fi,
1162                                                          trans->transid);
1163                         btrfs_set_file_extent_num_bytes(leaf, fi,
1164                                                         end - other_start);
1165                         btrfs_mark_buffer_dirty(leaf);
1166                         goto out;
1167                 }
1168         }
1169
1170         if (start > key.offset && end == extent_end) {
1171                 other_start = end;
1172                 other_end = 0;
1173                 if (extent_mergeable(leaf, path->slots[0] + 1,
1174                                      ino, bytenr, orig_offset,
1175                                      &other_start, &other_end)) {
1176                         fi = btrfs_item_ptr(leaf, path->slots[0],
1177                                             struct btrfs_file_extent_item);
1178                         btrfs_set_file_extent_num_bytes(leaf, fi,
1179                                                         start - key.offset);
1180                         btrfs_set_file_extent_generation(leaf, fi,
1181                                                          trans->transid);
1182                         path->slots[0]++;
1183                         new_key.offset = start;
1184                         btrfs_set_item_key_safe(fs_info, path, &new_key);
1185
1186                         fi = btrfs_item_ptr(leaf, path->slots[0],
1187                                             struct btrfs_file_extent_item);
1188                         btrfs_set_file_extent_generation(leaf, fi,
1189                                                          trans->transid);
1190                         btrfs_set_file_extent_num_bytes(leaf, fi,
1191                                                         other_end - start);
1192                         btrfs_set_file_extent_offset(leaf, fi,
1193                                                      start - orig_offset);
1194                         btrfs_mark_buffer_dirty(leaf);
1195                         goto out;
1196                 }
1197         }
1198
1199         while (start > key.offset || end < extent_end) {
1200                 if (key.offset == start)
1201                         split = end;
1202
1203                 new_key.offset = split;
1204                 ret = btrfs_duplicate_item(trans, root, path, &new_key);
1205                 if (ret == -EAGAIN) {
1206                         btrfs_release_path(path);
1207                         goto again;
1208                 }
1209                 if (ret < 0) {
1210                         btrfs_abort_transaction(trans, ret);
1211                         goto out;
1212                 }
1213
1214                 leaf = path->nodes[0];
1215                 fi = btrfs_item_ptr(leaf, path->slots[0] - 1,
1216                                     struct btrfs_file_extent_item);
1217                 btrfs_set_file_extent_generation(leaf, fi, trans->transid);
1218                 btrfs_set_file_extent_num_bytes(leaf, fi,
1219                                                 split - key.offset);
1220
1221                 fi = btrfs_item_ptr(leaf, path->slots[0],
1222                                     struct btrfs_file_extent_item);
1223
1224                 btrfs_set_file_extent_generation(leaf, fi, trans->transid);
1225                 btrfs_set_file_extent_offset(leaf, fi, split - orig_offset);
1226                 btrfs_set_file_extent_num_bytes(leaf, fi,
1227                                                 extent_end - split);
1228                 btrfs_mark_buffer_dirty(leaf);
1229
1230                 btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF, bytenr,
1231                                        num_bytes, 0);
1232                 btrfs_init_data_ref(&ref, root->root_key.objectid, ino,
1233                                     orig_offset);
1234                 ret = btrfs_inc_extent_ref(trans, &ref);
1235                 if (ret) {
1236                         btrfs_abort_transaction(trans, ret);
1237                         goto out;
1238                 }
1239
1240                 if (split == start) {
1241                         key.offset = start;
1242                 } else {
1243                         if (start != key.offset) {
1244                                 ret = -EINVAL;
1245                                 btrfs_abort_transaction(trans, ret);
1246                                 goto out;
1247                         }
1248                         path->slots[0]--;
1249                         extent_end = end;
1250                 }
1251                 recow = 1;
1252         }
1253
1254         other_start = end;
1255         other_end = 0;
1256         btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF, bytenr,
1257                                num_bytes, 0);
1258         btrfs_init_data_ref(&ref, root->root_key.objectid, ino, orig_offset);
1259         if (extent_mergeable(leaf, path->slots[0] + 1,
1260                              ino, bytenr, orig_offset,
1261                              &other_start, &other_end)) {
1262                 if (recow) {
1263                         btrfs_release_path(path);
1264                         goto again;
1265                 }
1266                 extent_end = other_end;
1267                 del_slot = path->slots[0] + 1;
1268                 del_nr++;
1269                 ret = btrfs_free_extent(trans, &ref);
1270                 if (ret) {
1271                         btrfs_abort_transaction(trans, ret);
1272                         goto out;
1273                 }
1274         }
1275         other_start = 0;
1276         other_end = start;
1277         if (extent_mergeable(leaf, path->slots[0] - 1,
1278                              ino, bytenr, orig_offset,
1279                              &other_start, &other_end)) {
1280                 if (recow) {
1281                         btrfs_release_path(path);
1282                         goto again;
1283                 }
1284                 key.offset = other_start;
1285                 del_slot = path->slots[0];
1286                 del_nr++;
1287                 ret = btrfs_free_extent(trans, &ref);
1288                 if (ret) {
1289                         btrfs_abort_transaction(trans, ret);
1290                         goto out;
1291                 }
1292         }
1293         if (del_nr == 0) {
1294                 fi = btrfs_item_ptr(leaf, path->slots[0],
1295                            struct btrfs_file_extent_item);
1296                 btrfs_set_file_extent_type(leaf, fi,
1297                                            BTRFS_FILE_EXTENT_REG);
1298                 btrfs_set_file_extent_generation(leaf, fi, trans->transid);
1299                 btrfs_mark_buffer_dirty(leaf);
1300         } else {
1301                 fi = btrfs_item_ptr(leaf, del_slot - 1,
1302                            struct btrfs_file_extent_item);
1303                 btrfs_set_file_extent_type(leaf, fi,
1304                                            BTRFS_FILE_EXTENT_REG);
1305                 btrfs_set_file_extent_generation(leaf, fi, trans->transid);
1306                 btrfs_set_file_extent_num_bytes(leaf, fi,
1307                                                 extent_end - key.offset);
1308                 btrfs_mark_buffer_dirty(leaf);
1309
1310                 ret = btrfs_del_items(trans, root, path, del_slot, del_nr);
1311                 if (ret < 0) {
1312                         btrfs_abort_transaction(trans, ret);
1313                         goto out;
1314                 }
1315         }
1316 out:
1317         btrfs_free_path(path);
1318         return 0;
1319 }
1320
1321 /*
1322  * on error we return an unlocked page and the error value
1323  * on success we return a locked page and 0
1324  */
1325 static int prepare_uptodate_page(struct inode *inode,
1326                                  struct page *page, u64 pos,
1327                                  bool force_uptodate)
1328 {
1329         int ret = 0;
1330
1331         if (((pos & (PAGE_SIZE - 1)) || force_uptodate) &&
1332             !PageUptodate(page)) {
1333                 ret = btrfs_readpage(NULL, page);
1334                 if (ret)
1335                         return ret;
1336                 lock_page(page);
1337                 if (!PageUptodate(page)) {
1338                         unlock_page(page);
1339                         return -EIO;
1340                 }
1341                 if (page->mapping != inode->i_mapping) {
1342                         unlock_page(page);
1343                         return -EAGAIN;
1344                 }
1345         }
1346         return 0;
1347 }
1348
1349 /*
1350  * this just gets pages into the page cache and locks them down.
1351  */
1352 static noinline int prepare_pages(struct inode *inode, struct page **pages,
1353                                   size_t num_pages, loff_t pos,
1354                                   size_t write_bytes, bool force_uptodate)
1355 {
1356         int i;
1357         unsigned long index = pos >> PAGE_SHIFT;
1358         gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping);
1359         int err = 0;
1360         int faili;
1361
1362         for (i = 0; i < num_pages; i++) {
1363 again:
1364                 pages[i] = find_or_create_page(inode->i_mapping, index + i,
1365                                                mask | __GFP_WRITE);
1366                 if (!pages[i]) {
1367                         faili = i - 1;
1368                         err = -ENOMEM;
1369                         goto fail;
1370                 }
1371
1372                 err = set_page_extent_mapped(pages[i]);
1373                 if (err < 0) {
1374                         faili = i;
1375                         goto fail;
1376                 }
1377
1378                 if (i == 0)
1379                         err = prepare_uptodate_page(inode, pages[i], pos,
1380                                                     force_uptodate);
1381                 if (!err && i == num_pages - 1)
1382                         err = prepare_uptodate_page(inode, pages[i],
1383                                                     pos + write_bytes, false);
1384                 if (err) {
1385                         put_page(pages[i]);
1386                         if (err == -EAGAIN) {
1387                                 err = 0;
1388                                 goto again;
1389                         }
1390                         faili = i - 1;
1391                         goto fail;
1392                 }
1393                 wait_on_page_writeback(pages[i]);
1394         }
1395
1396         return 0;
1397 fail:
1398         while (faili >= 0) {
1399                 unlock_page(pages[faili]);
1400                 put_page(pages[faili]);
1401                 faili--;
1402         }
1403         return err;
1404
1405 }
1406
1407 /*
1408  * This function locks the extent and properly waits for data=ordered extents
1409  * to finish before allowing the pages to be modified if need.
1410  *
1411  * The return value:
1412  * 1 - the extent is locked
1413  * 0 - the extent is not locked, and everything is OK
1414  * -EAGAIN - need re-prepare the pages
1415  * the other < 0 number - Something wrong happens
1416  */
1417 static noinline int
1418 lock_and_cleanup_extent_if_need(struct btrfs_inode *inode, struct page **pages,
1419                                 size_t num_pages, loff_t pos,
1420                                 size_t write_bytes,
1421                                 u64 *lockstart, u64 *lockend,
1422                                 struct extent_state **cached_state)
1423 {
1424         struct btrfs_fs_info *fs_info = inode->root->fs_info;
1425         u64 start_pos;
1426         u64 last_pos;
1427         int i;
1428         int ret = 0;
1429
1430         start_pos = round_down(pos, fs_info->sectorsize);
1431         last_pos = round_up(pos + write_bytes, fs_info->sectorsize) - 1;
1432
1433         if (start_pos < inode->vfs_inode.i_size) {
1434                 struct btrfs_ordered_extent *ordered;
1435
1436                 lock_extent_bits(&inode->io_tree, start_pos, last_pos,
1437                                 cached_state);
1438                 ordered = btrfs_lookup_ordered_range(inode, start_pos,
1439                                                      last_pos - start_pos + 1);
1440                 if (ordered &&
1441                     ordered->file_offset + ordered->num_bytes > start_pos &&
1442                     ordered->file_offset <= last_pos) {
1443                         unlock_extent_cached(&inode->io_tree, start_pos,
1444                                         last_pos, cached_state);
1445                         for (i = 0; i < num_pages; i++) {
1446                                 unlock_page(pages[i]);
1447                                 put_page(pages[i]);
1448                         }
1449                         btrfs_start_ordered_extent(ordered, 1);
1450                         btrfs_put_ordered_extent(ordered);
1451                         return -EAGAIN;
1452                 }
1453                 if (ordered)
1454                         btrfs_put_ordered_extent(ordered);
1455
1456                 *lockstart = start_pos;
1457                 *lockend = last_pos;
1458                 ret = 1;
1459         }
1460
1461         /*
1462          * We should be called after prepare_pages() which should have locked
1463          * all pages in the range.
1464          */
1465         for (i = 0; i < num_pages; i++)
1466                 WARN_ON(!PageLocked(pages[i]));
1467
1468         return ret;
1469 }
1470
1471 static int check_can_nocow(struct btrfs_inode *inode, loff_t pos,
1472                            size_t *write_bytes, bool nowait)
1473 {
1474         struct btrfs_fs_info *fs_info = inode->root->fs_info;
1475         struct btrfs_root *root = inode->root;
1476         u64 lockstart, lockend;
1477         u64 num_bytes;
1478         int ret;
1479
1480         if (!(inode->flags & (BTRFS_INODE_NODATACOW | BTRFS_INODE_PREALLOC)))
1481                 return 0;
1482
1483         if (!nowait && !btrfs_drew_try_write_lock(&root->snapshot_lock))
1484                 return -EAGAIN;
1485
1486         lockstart = round_down(pos, fs_info->sectorsize);
1487         lockend = round_up(pos + *write_bytes,
1488                            fs_info->sectorsize) - 1;
1489         num_bytes = lockend - lockstart + 1;
1490
1491         if (nowait) {
1492                 struct btrfs_ordered_extent *ordered;
1493
1494                 if (!try_lock_extent(&inode->io_tree, lockstart, lockend))
1495                         return -EAGAIN;
1496
1497                 ordered = btrfs_lookup_ordered_range(inode, lockstart,
1498                                                      num_bytes);
1499                 if (ordered) {
1500                         btrfs_put_ordered_extent(ordered);
1501                         ret = -EAGAIN;
1502                         goto out_unlock;
1503                 }
1504         } else {
1505                 btrfs_lock_and_flush_ordered_range(inode, lockstart,
1506                                                    lockend, NULL);
1507         }
1508
1509         ret = can_nocow_extent(&inode->vfs_inode, lockstart, &num_bytes,
1510                         NULL, NULL, NULL, false);
1511         if (ret <= 0) {
1512                 ret = 0;
1513                 if (!nowait)
1514                         btrfs_drew_write_unlock(&root->snapshot_lock);
1515         } else {
1516                 *write_bytes = min_t(size_t, *write_bytes ,
1517                                      num_bytes - pos + lockstart);
1518         }
1519 out_unlock:
1520         unlock_extent(&inode->io_tree, lockstart, lockend);
1521
1522         return ret;
1523 }
1524
1525 static int check_nocow_nolock(struct btrfs_inode *inode, loff_t pos,
1526                               size_t *write_bytes)
1527 {
1528         return check_can_nocow(inode, pos, write_bytes, true);
1529 }
1530
1531 /*
1532  * Check if we can do nocow write into the range [@pos, @pos + @write_bytes)
1533  *
1534  * @pos:         File offset
1535  * @write_bytes: The length to write, will be updated to the nocow writeable
1536  *               range
1537  *
1538  * This function will flush ordered extents in the range to ensure proper
1539  * nocow checks.
1540  *
1541  * Return:
1542  * >0           and update @write_bytes if we can do nocow write
1543  *  0           if we can't do nocow write
1544  * -EAGAIN      if we can't get the needed lock or there are ordered extents
1545  *              for * (nowait == true) case
1546  * <0           if other error happened
1547  *
1548  * NOTE: Callers need to release the lock by btrfs_check_nocow_unlock().
1549  */
1550 int btrfs_check_nocow_lock(struct btrfs_inode *inode, loff_t pos,
1551                            size_t *write_bytes)
1552 {
1553         return check_can_nocow(inode, pos, write_bytes, false);
1554 }
1555
1556 void btrfs_check_nocow_unlock(struct btrfs_inode *inode)
1557 {
1558         btrfs_drew_write_unlock(&inode->root->snapshot_lock);
1559 }
1560
1561 static void update_time_for_write(struct inode *inode)
1562 {
1563         struct timespec64 now;
1564
1565         if (IS_NOCMTIME(inode))
1566                 return;
1567
1568         now = current_time(inode);
1569         if (!timespec64_equal(&inode->i_mtime, &now))
1570                 inode->i_mtime = now;
1571
1572         if (!timespec64_equal(&inode->i_ctime, &now))
1573                 inode->i_ctime = now;
1574
1575         if (IS_I_VERSION(inode))
1576                 inode_inc_iversion(inode);
1577 }
1578
1579 static int btrfs_write_check(struct kiocb *iocb, struct iov_iter *from,
1580                              size_t count)
1581 {
1582         struct file *file = iocb->ki_filp;
1583         struct inode *inode = file_inode(file);
1584         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1585         loff_t pos = iocb->ki_pos;
1586         int ret;
1587         loff_t oldsize;
1588         loff_t start_pos;
1589
1590         if (iocb->ki_flags & IOCB_NOWAIT) {
1591                 size_t nocow_bytes = count;
1592
1593                 /* We will allocate space in case nodatacow is not set, so bail */
1594                 if (check_nocow_nolock(BTRFS_I(inode), pos, &nocow_bytes) <= 0)
1595                         return -EAGAIN;
1596                 /*
1597                  * There are holes in the range or parts of the range that must
1598                  * be COWed (shared extents, RO block groups, etc), so just bail
1599                  * out.
1600                  */
1601                 if (nocow_bytes < count)
1602                         return -EAGAIN;
1603         }
1604
1605         current->backing_dev_info = inode_to_bdi(inode);
1606         ret = file_remove_privs(file);
1607         if (ret)
1608                 return ret;
1609
1610         /*
1611          * We reserve space for updating the inode when we reserve space for the
1612          * extent we are going to write, so we will enospc out there.  We don't
1613          * need to start yet another transaction to update the inode as we will
1614          * update the inode when we finish writing whatever data we write.
1615          */
1616         update_time_for_write(inode);
1617
1618         start_pos = round_down(pos, fs_info->sectorsize);
1619         oldsize = i_size_read(inode);
1620         if (start_pos > oldsize) {
1621                 /* Expand hole size to cover write data, preventing empty gap */
1622                 loff_t end_pos = round_up(pos + count, fs_info->sectorsize);
1623
1624                 ret = btrfs_cont_expand(BTRFS_I(inode), oldsize, end_pos);
1625                 if (ret) {
1626                         current->backing_dev_info = NULL;
1627                         return ret;
1628                 }
1629         }
1630
1631         return 0;
1632 }
1633
1634 static noinline ssize_t btrfs_buffered_write(struct kiocb *iocb,
1635                                                struct iov_iter *i)
1636 {
1637         struct file *file = iocb->ki_filp;
1638         loff_t pos;
1639         struct inode *inode = file_inode(file);
1640         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1641         struct page **pages = NULL;
1642         struct extent_changeset *data_reserved = NULL;
1643         u64 release_bytes = 0;
1644         u64 lockstart;
1645         u64 lockend;
1646         size_t num_written = 0;
1647         int nrptrs;
1648         ssize_t ret;
1649         bool only_release_metadata = false;
1650         bool force_page_uptodate = false;
1651         loff_t old_isize = i_size_read(inode);
1652         unsigned int ilock_flags = 0;
1653
1654         if (iocb->ki_flags & IOCB_NOWAIT)
1655                 ilock_flags |= BTRFS_ILOCK_TRY;
1656
1657         ret = btrfs_inode_lock(inode, ilock_flags);
1658         if (ret < 0)
1659                 return ret;
1660
1661         ret = generic_write_checks(iocb, i);
1662         if (ret <= 0)
1663                 goto out;
1664
1665         ret = btrfs_write_check(iocb, i, ret);
1666         if (ret < 0)
1667                 goto out;
1668
1669         pos = iocb->ki_pos;
1670         nrptrs = min(DIV_ROUND_UP(iov_iter_count(i), PAGE_SIZE),
1671                         PAGE_SIZE / (sizeof(struct page *)));
1672         nrptrs = min(nrptrs, current->nr_dirtied_pause - current->nr_dirtied);
1673         nrptrs = max(nrptrs, 8);
1674         pages = kmalloc_array(nrptrs, sizeof(struct page *), GFP_KERNEL);
1675         if (!pages) {
1676                 ret = -ENOMEM;
1677                 goto out;
1678         }
1679
1680         while (iov_iter_count(i) > 0) {
1681                 struct extent_state *cached_state = NULL;
1682                 size_t offset = offset_in_page(pos);
1683                 size_t sector_offset;
1684                 size_t write_bytes = min(iov_iter_count(i),
1685                                          nrptrs * (size_t)PAGE_SIZE -
1686                                          offset);
1687                 size_t num_pages;
1688                 size_t reserve_bytes;
1689                 size_t dirty_pages;
1690                 size_t copied;
1691                 size_t dirty_sectors;
1692                 size_t num_sectors;
1693                 int extents_locked;
1694
1695                 /*
1696                  * Fault pages before locking them in prepare_pages
1697                  * to avoid recursive lock
1698                  */
1699                 if (unlikely(iov_iter_fault_in_readable(i, write_bytes))) {
1700                         ret = -EFAULT;
1701                         break;
1702                 }
1703
1704                 only_release_metadata = false;
1705                 sector_offset = pos & (fs_info->sectorsize - 1);
1706
1707                 extent_changeset_release(data_reserved);
1708                 ret = btrfs_check_data_free_space(BTRFS_I(inode),
1709                                                   &data_reserved, pos,
1710                                                   write_bytes);
1711                 if (ret < 0) {
1712                         /*
1713                          * If we don't have to COW at the offset, reserve
1714                          * metadata only. write_bytes may get smaller than
1715                          * requested here.
1716                          */
1717                         if (btrfs_check_nocow_lock(BTRFS_I(inode), pos,
1718                                                    &write_bytes) > 0)
1719                                 only_release_metadata = true;
1720                         else
1721                                 break;
1722                 }
1723
1724                 num_pages = DIV_ROUND_UP(write_bytes + offset, PAGE_SIZE);
1725                 WARN_ON(num_pages > nrptrs);
1726                 reserve_bytes = round_up(write_bytes + sector_offset,
1727                                          fs_info->sectorsize);
1728                 WARN_ON(reserve_bytes == 0);
1729                 ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode),
1730                                 reserve_bytes);
1731                 if (ret) {
1732                         if (!only_release_metadata)
1733                                 btrfs_free_reserved_data_space(BTRFS_I(inode),
1734                                                 data_reserved, pos,
1735                                                 write_bytes);
1736                         else
1737                                 btrfs_check_nocow_unlock(BTRFS_I(inode));
1738                         break;
1739                 }
1740
1741                 release_bytes = reserve_bytes;
1742 again:
1743                 /*
1744                  * This is going to setup the pages array with the number of
1745                  * pages we want, so we don't really need to worry about the
1746                  * contents of pages from loop to loop
1747                  */
1748                 ret = prepare_pages(inode, pages, num_pages,
1749                                     pos, write_bytes,
1750                                     force_page_uptodate);
1751                 if (ret) {
1752                         btrfs_delalloc_release_extents(BTRFS_I(inode),
1753                                                        reserve_bytes);
1754                         break;
1755                 }
1756
1757                 extents_locked = lock_and_cleanup_extent_if_need(
1758                                 BTRFS_I(inode), pages,
1759                                 num_pages, pos, write_bytes, &lockstart,
1760                                 &lockend, &cached_state);
1761                 if (extents_locked < 0) {
1762                         if (extents_locked == -EAGAIN)
1763                                 goto again;
1764                         btrfs_delalloc_release_extents(BTRFS_I(inode),
1765                                                        reserve_bytes);
1766                         ret = extents_locked;
1767                         break;
1768                 }
1769
1770                 copied = btrfs_copy_from_user(pos, write_bytes, pages, i);
1771
1772                 num_sectors = BTRFS_BYTES_TO_BLKS(fs_info, reserve_bytes);
1773                 dirty_sectors = round_up(copied + sector_offset,
1774                                         fs_info->sectorsize);
1775                 dirty_sectors = BTRFS_BYTES_TO_BLKS(fs_info, dirty_sectors);
1776
1777                 /*
1778                  * if we have trouble faulting in the pages, fall
1779                  * back to one page at a time
1780                  */
1781                 if (copied < write_bytes)
1782                         nrptrs = 1;
1783
1784                 if (copied == 0) {
1785                         force_page_uptodate = true;
1786                         dirty_sectors = 0;
1787                         dirty_pages = 0;
1788                 } else {
1789                         force_page_uptodate = false;
1790                         dirty_pages = DIV_ROUND_UP(copied + offset,
1791                                                    PAGE_SIZE);
1792                 }
1793
1794                 if (num_sectors > dirty_sectors) {
1795                         /* release everything except the sectors we dirtied */
1796                         release_bytes -= dirty_sectors << fs_info->sectorsize_bits;
1797                         if (only_release_metadata) {
1798                                 btrfs_delalloc_release_metadata(BTRFS_I(inode),
1799                                                         release_bytes, true);
1800                         } else {
1801                                 u64 __pos;
1802
1803                                 __pos = round_down(pos,
1804                                                    fs_info->sectorsize) +
1805                                         (dirty_pages << PAGE_SHIFT);
1806                                 btrfs_delalloc_release_space(BTRFS_I(inode),
1807                                                 data_reserved, __pos,
1808                                                 release_bytes, true);
1809                         }
1810                 }
1811
1812                 release_bytes = round_up(copied + sector_offset,
1813                                         fs_info->sectorsize);
1814
1815                 ret = btrfs_dirty_pages(BTRFS_I(inode), pages,
1816                                         dirty_pages, pos, copied,
1817                                         &cached_state, only_release_metadata);
1818
1819                 /*
1820                  * If we have not locked the extent range, because the range's
1821                  * start offset is >= i_size, we might still have a non-NULL
1822                  * cached extent state, acquired while marking the extent range
1823                  * as delalloc through btrfs_dirty_pages(). Therefore free any
1824                  * possible cached extent state to avoid a memory leak.
1825                  */
1826                 if (extents_locked)
1827                         unlock_extent_cached(&BTRFS_I(inode)->io_tree,
1828                                              lockstart, lockend, &cached_state);
1829                 else
1830                         free_extent_state(cached_state);
1831
1832                 btrfs_delalloc_release_extents(BTRFS_I(inode), reserve_bytes);
1833                 if (ret) {
1834                         btrfs_drop_pages(pages, num_pages);
1835                         break;
1836                 }
1837
1838                 release_bytes = 0;
1839                 if (only_release_metadata)
1840                         btrfs_check_nocow_unlock(BTRFS_I(inode));
1841
1842                 btrfs_drop_pages(pages, num_pages);
1843
1844                 cond_resched();
1845
1846                 balance_dirty_pages_ratelimited(inode->i_mapping);
1847
1848                 pos += copied;
1849                 num_written += copied;
1850         }
1851
1852         kfree(pages);
1853
1854         if (release_bytes) {
1855                 if (only_release_metadata) {
1856                         btrfs_check_nocow_unlock(BTRFS_I(inode));
1857                         btrfs_delalloc_release_metadata(BTRFS_I(inode),
1858                                         release_bytes, true);
1859                 } else {
1860                         btrfs_delalloc_release_space(BTRFS_I(inode),
1861                                         data_reserved,
1862                                         round_down(pos, fs_info->sectorsize),
1863                                         release_bytes, true);
1864                 }
1865         }
1866
1867         extent_changeset_free(data_reserved);
1868         if (num_written > 0) {
1869                 pagecache_isize_extended(inode, old_isize, iocb->ki_pos);
1870                 iocb->ki_pos += num_written;
1871         }
1872 out:
1873         btrfs_inode_unlock(inode, ilock_flags);
1874         return num_written ? num_written : ret;
1875 }
1876
1877 static ssize_t check_direct_IO(struct btrfs_fs_info *fs_info,
1878                                const struct iov_iter *iter, loff_t offset)
1879 {
1880         const u32 blocksize_mask = fs_info->sectorsize - 1;
1881
1882         if (offset & blocksize_mask)
1883                 return -EINVAL;
1884
1885         if (iov_iter_alignment(iter) & blocksize_mask)
1886                 return -EINVAL;
1887
1888         return 0;
1889 }
1890
1891 static ssize_t btrfs_direct_write(struct kiocb *iocb, struct iov_iter *from)
1892 {
1893         struct file *file = iocb->ki_filp;
1894         struct inode *inode = file_inode(file);
1895         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1896         loff_t pos;
1897         ssize_t written = 0;
1898         ssize_t written_buffered;
1899         loff_t endbyte;
1900         ssize_t err;
1901         unsigned int ilock_flags = 0;
1902         struct iomap_dio *dio = NULL;
1903
1904         if (iocb->ki_flags & IOCB_NOWAIT)
1905                 ilock_flags |= BTRFS_ILOCK_TRY;
1906
1907         /* If the write DIO is within EOF, use a shared lock */
1908         if (iocb->ki_pos + iov_iter_count(from) <= i_size_read(inode))
1909                 ilock_flags |= BTRFS_ILOCK_SHARED;
1910
1911 relock:
1912         err = btrfs_inode_lock(inode, ilock_flags);
1913         if (err < 0)
1914                 return err;
1915
1916         err = generic_write_checks(iocb, from);
1917         if (err <= 0) {
1918                 btrfs_inode_unlock(inode, ilock_flags);
1919                 return err;
1920         }
1921
1922         err = btrfs_write_check(iocb, from, err);
1923         if (err < 0) {
1924                 btrfs_inode_unlock(inode, ilock_flags);
1925                 goto out;
1926         }
1927
1928         pos = iocb->ki_pos;
1929         /*
1930          * Re-check since file size may have changed just before taking the
1931          * lock or pos may have changed because of O_APPEND in generic_write_check()
1932          */
1933         if ((ilock_flags & BTRFS_ILOCK_SHARED) &&
1934             pos + iov_iter_count(from) > i_size_read(inode)) {
1935                 btrfs_inode_unlock(inode, ilock_flags);
1936                 ilock_flags &= ~BTRFS_ILOCK_SHARED;
1937                 goto relock;
1938         }
1939
1940         if (check_direct_IO(fs_info, from, pos)) {
1941                 btrfs_inode_unlock(inode, ilock_flags);
1942                 goto buffered;
1943         }
1944
1945         dio = __iomap_dio_rw(iocb, from, &btrfs_dio_iomap_ops, &btrfs_dio_ops,
1946                              0);
1947
1948         btrfs_inode_unlock(inode, ilock_flags);
1949
1950         if (IS_ERR_OR_NULL(dio)) {
1951                 err = PTR_ERR_OR_ZERO(dio);
1952                 if (err < 0 && err != -ENOTBLK)
1953                         goto out;
1954         } else {
1955                 written = iomap_dio_complete(dio);
1956         }
1957
1958         if (written < 0 || !iov_iter_count(from)) {
1959                 err = written;
1960                 goto out;
1961         }
1962
1963 buffered:
1964         pos = iocb->ki_pos;
1965         written_buffered = btrfs_buffered_write(iocb, from);
1966         if (written_buffered < 0) {
1967                 err = written_buffered;
1968                 goto out;
1969         }
1970         /*
1971          * Ensure all data is persisted. We want the next direct IO read to be
1972          * able to read what was just written.
1973          */
1974         endbyte = pos + written_buffered - 1;
1975         err = btrfs_fdatawrite_range(inode, pos, endbyte);
1976         if (err)
1977                 goto out;
1978         err = filemap_fdatawait_range(inode->i_mapping, pos, endbyte);
1979         if (err)
1980                 goto out;
1981         written += written_buffered;
1982         iocb->ki_pos = pos + written_buffered;
1983         invalidate_mapping_pages(file->f_mapping, pos >> PAGE_SHIFT,
1984                                  endbyte >> PAGE_SHIFT);
1985 out:
1986         return written ? written : err;
1987 }
1988
1989 static ssize_t btrfs_file_write_iter(struct kiocb *iocb,
1990                                     struct iov_iter *from)
1991 {
1992         struct file *file = iocb->ki_filp;
1993         struct btrfs_inode *inode = BTRFS_I(file_inode(file));
1994         ssize_t num_written = 0;
1995         const bool sync = iocb->ki_flags & IOCB_DSYNC;
1996
1997         /*
1998          * If the fs flips readonly due to some impossible error, although we
1999          * have opened a file as writable, we have to stop this write operation
2000          * to ensure consistency.
2001          */
2002         if (test_bit(BTRFS_FS_STATE_ERROR, &inode->root->fs_info->fs_state))
2003                 return -EROFS;
2004
2005         if (!(iocb->ki_flags & IOCB_DIRECT) &&
2006             (iocb->ki_flags & IOCB_NOWAIT))
2007                 return -EOPNOTSUPP;
2008
2009         if (sync)
2010                 atomic_inc(&inode->sync_writers);
2011
2012         if (iocb->ki_flags & IOCB_DIRECT)
2013                 num_written = btrfs_direct_write(iocb, from);
2014         else
2015                 num_written = btrfs_buffered_write(iocb, from);
2016
2017         btrfs_set_inode_last_sub_trans(inode);
2018
2019         if (num_written > 0)
2020                 num_written = generic_write_sync(iocb, num_written);
2021
2022         if (sync)
2023                 atomic_dec(&inode->sync_writers);
2024
2025         current->backing_dev_info = NULL;
2026         return num_written;
2027 }
2028
2029 int btrfs_release_file(struct inode *inode, struct file *filp)
2030 {
2031         struct btrfs_file_private *private = filp->private_data;
2032
2033         if (private && private->filldir_buf)
2034                 kfree(private->filldir_buf);
2035         kfree(private);
2036         filp->private_data = NULL;
2037
2038         /*
2039          * Set by setattr when we are about to truncate a file from a non-zero
2040          * size to a zero size.  This tries to flush down new bytes that may
2041          * have been written if the application were using truncate to replace
2042          * a file in place.
2043          */
2044         if (test_and_clear_bit(BTRFS_INODE_FLUSH_ON_CLOSE,
2045                                &BTRFS_I(inode)->runtime_flags))
2046                         filemap_flush(inode->i_mapping);
2047         return 0;
2048 }
2049
2050 static int start_ordered_ops(struct inode *inode, loff_t start, loff_t end)
2051 {
2052         int ret;
2053         struct blk_plug plug;
2054
2055         /*
2056          * This is only called in fsync, which would do synchronous writes, so
2057          * a plug can merge adjacent IOs as much as possible.  Esp. in case of
2058          * multiple disks using raid profile, a large IO can be split to
2059          * several segments of stripe length (currently 64K).
2060          */
2061         blk_start_plug(&plug);
2062         atomic_inc(&BTRFS_I(inode)->sync_writers);
2063         ret = btrfs_fdatawrite_range(inode, start, end);
2064         atomic_dec(&BTRFS_I(inode)->sync_writers);
2065         blk_finish_plug(&plug);
2066
2067         return ret;
2068 }
2069
2070 static inline bool skip_inode_logging(const struct btrfs_log_ctx *ctx)
2071 {
2072         struct btrfs_inode *inode = BTRFS_I(ctx->inode);
2073         struct btrfs_fs_info *fs_info = inode->root->fs_info;
2074
2075         if (btrfs_inode_in_log(inode, fs_info->generation) &&
2076             list_empty(&ctx->ordered_extents))
2077                 return true;
2078
2079         /*
2080          * If we are doing a fast fsync we can not bail out if the inode's
2081          * last_trans is <= then the last committed transaction, because we only
2082          * update the last_trans of the inode during ordered extent completion,
2083          * and for a fast fsync we don't wait for that, we only wait for the
2084          * writeback to complete.
2085          */
2086         if (inode->last_trans <= fs_info->last_trans_committed &&
2087             (test_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &inode->runtime_flags) ||
2088              list_empty(&ctx->ordered_extents)))
2089                 return true;
2090
2091         return false;
2092 }
2093
2094 /*
2095  * fsync call for both files and directories.  This logs the inode into
2096  * the tree log instead of forcing full commits whenever possible.
2097  *
2098  * It needs to call filemap_fdatawait so that all ordered extent updates are
2099  * in the metadata btree are up to date for copying to the log.
2100  *
2101  * It drops the inode mutex before doing the tree log commit.  This is an
2102  * important optimization for directories because holding the mutex prevents
2103  * new operations on the dir while we write to disk.
2104  */
2105 int btrfs_sync_file(struct file *file, loff_t start, loff_t end, int datasync)
2106 {
2107         struct dentry *dentry = file_dentry(file);
2108         struct inode *inode = d_inode(dentry);
2109         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2110         struct btrfs_root *root = BTRFS_I(inode)->root;
2111         struct btrfs_trans_handle *trans;
2112         struct btrfs_log_ctx ctx;
2113         int ret = 0, err;
2114         u64 len;
2115         bool full_sync;
2116
2117         trace_btrfs_sync_file(file, datasync);
2118
2119         btrfs_init_log_ctx(&ctx, inode);
2120
2121         /*
2122          * Always set the range to a full range, otherwise we can get into
2123          * several problems, from missing file extent items to represent holes
2124          * when not using the NO_HOLES feature, to log tree corruption due to
2125          * races between hole detection during logging and completion of ordered
2126          * extents outside the range, to missing checksums due to ordered extents
2127          * for which we flushed only a subset of their pages.
2128          */
2129         start = 0;
2130         end = LLONG_MAX;
2131         len = (u64)LLONG_MAX + 1;
2132
2133         /*
2134          * We write the dirty pages in the range and wait until they complete
2135          * out of the ->i_mutex. If so, we can flush the dirty pages by
2136          * multi-task, and make the performance up.  See
2137          * btrfs_wait_ordered_range for an explanation of the ASYNC check.
2138          */
2139         ret = start_ordered_ops(inode, start, end);
2140         if (ret)
2141                 goto out;
2142
2143         btrfs_inode_lock(inode, BTRFS_ILOCK_MMAP);
2144
2145         atomic_inc(&root->log_batch);
2146
2147         /*
2148          * Always check for the full sync flag while holding the inode's lock,
2149          * to avoid races with other tasks. The flag must be either set all the
2150          * time during logging or always off all the time while logging.
2151          */
2152         full_sync = test_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
2153                              &BTRFS_I(inode)->runtime_flags);
2154
2155         /*
2156          * Before we acquired the inode's lock and the mmap lock, someone may
2157          * have dirtied more pages in the target range. We need to make sure
2158          * that writeback for any such pages does not start while we are logging
2159          * the inode, because if it does, any of the following might happen when
2160          * we are not doing a full inode sync:
2161          *
2162          * 1) We log an extent after its writeback finishes but before its
2163          *    checksums are added to the csum tree, leading to -EIO errors
2164          *    when attempting to read the extent after a log replay.
2165          *
2166          * 2) We can end up logging an extent before its writeback finishes.
2167          *    Therefore after the log replay we will have a file extent item
2168          *    pointing to an unwritten extent (and no data checksums as well).
2169          *
2170          * So trigger writeback for any eventual new dirty pages and then we
2171          * wait for all ordered extents to complete below.
2172          */
2173         ret = start_ordered_ops(inode, start, end);
2174         if (ret) {
2175                 btrfs_inode_unlock(inode, BTRFS_ILOCK_MMAP);
2176                 goto out;
2177         }
2178
2179         /*
2180          * We have to do this here to avoid the priority inversion of waiting on
2181          * IO of a lower priority task while holding a transaction open.
2182          *
2183          * For a full fsync we wait for the ordered extents to complete while
2184          * for a fast fsync we wait just for writeback to complete, and then
2185          * attach the ordered extents to the transaction so that a transaction
2186          * commit waits for their completion, to avoid data loss if we fsync,
2187          * the current transaction commits before the ordered extents complete
2188          * and a power failure happens right after that.
2189          *
2190          * For zoned filesystem, if a write IO uses a ZONE_APPEND command, the
2191          * logical address recorded in the ordered extent may change. We need
2192          * to wait for the IO to stabilize the logical address.
2193          */
2194         if (full_sync || btrfs_is_zoned(fs_info)) {
2195                 ret = btrfs_wait_ordered_range(inode, start, len);
2196         } else {
2197                 /*
2198                  * Get our ordered extents as soon as possible to avoid doing
2199                  * checksum lookups in the csum tree, and use instead the
2200                  * checksums attached to the ordered extents.
2201                  */
2202                 btrfs_get_ordered_extents_for_logging(BTRFS_I(inode),
2203                                                       &ctx.ordered_extents);
2204                 ret = filemap_fdatawait_range(inode->i_mapping, start, end);
2205         }
2206
2207         if (ret)
2208                 goto out_release_extents;
2209
2210         atomic_inc(&root->log_batch);
2211
2212         smp_mb();
2213         if (skip_inode_logging(&ctx)) {
2214                 /*
2215                  * We've had everything committed since the last time we were
2216                  * modified so clear this flag in case it was set for whatever
2217                  * reason, it's no longer relevant.
2218                  */
2219                 clear_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
2220                           &BTRFS_I(inode)->runtime_flags);
2221                 /*
2222                  * An ordered extent might have started before and completed
2223                  * already with io errors, in which case the inode was not
2224                  * updated and we end up here. So check the inode's mapping
2225                  * for any errors that might have happened since we last
2226                  * checked called fsync.
2227                  */
2228                 ret = filemap_check_wb_err(inode->i_mapping, file->f_wb_err);
2229                 goto out_release_extents;
2230         }
2231
2232         /*
2233          * We use start here because we will need to wait on the IO to complete
2234          * in btrfs_sync_log, which could require joining a transaction (for
2235          * example checking cross references in the nocow path).  If we use join
2236          * here we could get into a situation where we're waiting on IO to
2237          * happen that is blocked on a transaction trying to commit.  With start
2238          * we inc the extwriter counter, so we wait for all extwriters to exit
2239          * before we start blocking joiners.  This comment is to keep somebody
2240          * from thinking they are super smart and changing this to
2241          * btrfs_join_transaction *cough*Josef*cough*.
2242          */
2243         trans = btrfs_start_transaction(root, 0);
2244         if (IS_ERR(trans)) {
2245                 ret = PTR_ERR(trans);
2246                 goto out_release_extents;
2247         }
2248         trans->in_fsync = true;
2249
2250         ret = btrfs_log_dentry_safe(trans, dentry, &ctx);
2251         btrfs_release_log_ctx_extents(&ctx);
2252         if (ret < 0) {
2253                 /* Fallthrough and commit/free transaction. */
2254                 ret = 1;
2255         }
2256
2257         /* we've logged all the items and now have a consistent
2258          * version of the file in the log.  It is possible that
2259          * someone will come in and modify the file, but that's
2260          * fine because the log is consistent on disk, and we
2261          * have references to all of the file's extents
2262          *
2263          * It is possible that someone will come in and log the
2264          * file again, but that will end up using the synchronization
2265          * inside btrfs_sync_log to keep things safe.
2266          */
2267         btrfs_inode_unlock(inode, BTRFS_ILOCK_MMAP);
2268
2269         if (ret != BTRFS_NO_LOG_SYNC) {
2270                 if (!ret) {
2271                         ret = btrfs_sync_log(trans, root, &ctx);
2272                         if (!ret) {
2273                                 ret = btrfs_end_transaction(trans);
2274                                 goto out;
2275                         }
2276                 }
2277                 if (!full_sync) {
2278                         ret = btrfs_wait_ordered_range(inode, start, len);
2279                         if (ret) {
2280                                 btrfs_end_transaction(trans);
2281                                 goto out;
2282                         }
2283                 }
2284                 ret = btrfs_commit_transaction(trans);
2285         } else {
2286                 ret = btrfs_end_transaction(trans);
2287         }
2288 out:
2289         ASSERT(list_empty(&ctx.list));
2290         err = file_check_and_advance_wb_err(file);
2291         if (!ret)
2292                 ret = err;
2293         return ret > 0 ? -EIO : ret;
2294
2295 out_release_extents:
2296         btrfs_release_log_ctx_extents(&ctx);
2297         btrfs_inode_unlock(inode, BTRFS_ILOCK_MMAP);
2298         goto out;
2299 }
2300
2301 static const struct vm_operations_struct btrfs_file_vm_ops = {
2302         .fault          = filemap_fault,
2303         .map_pages      = filemap_map_pages,
2304         .page_mkwrite   = btrfs_page_mkwrite,
2305 };
2306
2307 static int btrfs_file_mmap(struct file  *filp, struct vm_area_struct *vma)
2308 {
2309         struct address_space *mapping = filp->f_mapping;
2310
2311         if (!mapping->a_ops->readpage)
2312                 return -ENOEXEC;
2313
2314         file_accessed(filp);
2315         vma->vm_ops = &btrfs_file_vm_ops;
2316
2317         return 0;
2318 }
2319
2320 static int hole_mergeable(struct btrfs_inode *inode, struct extent_buffer *leaf,
2321                           int slot, u64 start, u64 end)
2322 {
2323         struct btrfs_file_extent_item *fi;
2324         struct btrfs_key key;
2325
2326         if (slot < 0 || slot >= btrfs_header_nritems(leaf))
2327                 return 0;
2328
2329         btrfs_item_key_to_cpu(leaf, &key, slot);
2330         if (key.objectid != btrfs_ino(inode) ||
2331             key.type != BTRFS_EXTENT_DATA_KEY)
2332                 return 0;
2333
2334         fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
2335
2336         if (btrfs_file_extent_type(leaf, fi) != BTRFS_FILE_EXTENT_REG)
2337                 return 0;
2338
2339         if (btrfs_file_extent_disk_bytenr(leaf, fi))
2340                 return 0;
2341
2342         if (key.offset == end)
2343                 return 1;
2344         if (key.offset + btrfs_file_extent_num_bytes(leaf, fi) == start)
2345                 return 1;
2346         return 0;
2347 }
2348
2349 static int fill_holes(struct btrfs_trans_handle *trans,
2350                 struct btrfs_inode *inode,
2351                 struct btrfs_path *path, u64 offset, u64 end)
2352 {
2353         struct btrfs_fs_info *fs_info = trans->fs_info;
2354         struct btrfs_root *root = inode->root;
2355         struct extent_buffer *leaf;
2356         struct btrfs_file_extent_item *fi;
2357         struct extent_map *hole_em;
2358         struct extent_map_tree *em_tree = &inode->extent_tree;
2359         struct btrfs_key key;
2360         int ret;
2361
2362         if (btrfs_fs_incompat(fs_info, NO_HOLES))
2363                 goto out;
2364
2365         key.objectid = btrfs_ino(inode);
2366         key.type = BTRFS_EXTENT_DATA_KEY;
2367         key.offset = offset;
2368
2369         ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2370         if (ret <= 0) {
2371                 /*
2372                  * We should have dropped this offset, so if we find it then
2373                  * something has gone horribly wrong.
2374                  */
2375                 if (ret == 0)
2376                         ret = -EINVAL;
2377                 return ret;
2378         }
2379
2380         leaf = path->nodes[0];
2381         if (hole_mergeable(inode, leaf, path->slots[0] - 1, offset, end)) {
2382                 u64 num_bytes;
2383
2384                 path->slots[0]--;
2385                 fi = btrfs_item_ptr(leaf, path->slots[0],
2386                                     struct btrfs_file_extent_item);
2387                 num_bytes = btrfs_file_extent_num_bytes(leaf, fi) +
2388                         end - offset;
2389                 btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes);
2390                 btrfs_set_file_extent_ram_bytes(leaf, fi, num_bytes);
2391                 btrfs_set_file_extent_offset(leaf, fi, 0);
2392                 btrfs_mark_buffer_dirty(leaf);
2393                 goto out;
2394         }
2395
2396         if (hole_mergeable(inode, leaf, path->slots[0], offset, end)) {
2397                 u64 num_bytes;
2398
2399                 key.offset = offset;
2400                 btrfs_set_item_key_safe(fs_info, path, &key);
2401                 fi = btrfs_item_ptr(leaf, path->slots[0],
2402                                     struct btrfs_file_extent_item);
2403                 num_bytes = btrfs_file_extent_num_bytes(leaf, fi) + end -
2404                         offset;
2405                 btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes);
2406                 btrfs_set_file_extent_ram_bytes(leaf, fi, num_bytes);
2407                 btrfs_set_file_extent_offset(leaf, fi, 0);
2408                 btrfs_mark_buffer_dirty(leaf);
2409                 goto out;
2410         }
2411         btrfs_release_path(path);
2412
2413         ret = btrfs_insert_file_extent(trans, root, btrfs_ino(inode),
2414                         offset, 0, 0, end - offset, 0, end - offset, 0, 0, 0);
2415         if (ret)
2416                 return ret;
2417
2418 out:
2419         btrfs_release_path(path);
2420
2421         hole_em = alloc_extent_map();
2422         if (!hole_em) {
2423                 btrfs_drop_extent_cache(inode, offset, end - 1, 0);
2424                 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &inode->runtime_flags);
2425         } else {
2426                 hole_em->start = offset;
2427                 hole_em->len = end - offset;
2428                 hole_em->ram_bytes = hole_em->len;
2429                 hole_em->orig_start = offset;
2430
2431                 hole_em->block_start = EXTENT_MAP_HOLE;
2432                 hole_em->block_len = 0;
2433                 hole_em->orig_block_len = 0;
2434                 hole_em->compress_type = BTRFS_COMPRESS_NONE;
2435                 hole_em->generation = trans->transid;
2436
2437                 do {
2438                         btrfs_drop_extent_cache(inode, offset, end - 1, 0);
2439                         write_lock(&em_tree->lock);
2440                         ret = add_extent_mapping(em_tree, hole_em, 1);
2441                         write_unlock(&em_tree->lock);
2442                 } while (ret == -EEXIST);
2443                 free_extent_map(hole_em);
2444                 if (ret)
2445                         set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
2446                                         &inode->runtime_flags);
2447         }
2448
2449         return 0;
2450 }
2451
2452 /*
2453  * Find a hole extent on given inode and change start/len to the end of hole
2454  * extent.(hole/vacuum extent whose em->start <= start &&
2455  *         em->start + em->len > start)
2456  * When a hole extent is found, return 1 and modify start/len.
2457  */
2458 static int find_first_non_hole(struct btrfs_inode *inode, u64 *start, u64 *len)
2459 {
2460         struct btrfs_fs_info *fs_info = inode->root->fs_info;
2461         struct extent_map *em;
2462         int ret = 0;
2463
2464         em = btrfs_get_extent(inode, NULL, 0,
2465                               round_down(*start, fs_info->sectorsize),
2466                               round_up(*len, fs_info->sectorsize));
2467         if (IS_ERR(em))
2468                 return PTR_ERR(em);
2469
2470         /* Hole or vacuum extent(only exists in no-hole mode) */
2471         if (em->block_start == EXTENT_MAP_HOLE) {
2472                 ret = 1;
2473                 *len = em->start + em->len > *start + *len ?
2474                        0 : *start + *len - em->start - em->len;
2475                 *start = em->start + em->len;
2476         }
2477         free_extent_map(em);
2478         return ret;
2479 }
2480
2481 static int btrfs_punch_hole_lock_range(struct inode *inode,
2482                                        const u64 lockstart,
2483                                        const u64 lockend,
2484                                        struct extent_state **cached_state)
2485 {
2486         while (1) {
2487                 struct btrfs_ordered_extent *ordered;
2488                 int ret;
2489
2490                 truncate_pagecache_range(inode, lockstart, lockend);
2491
2492                 lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend,
2493                                  cached_state);
2494                 ordered = btrfs_lookup_first_ordered_extent(BTRFS_I(inode),
2495                                                             lockend);
2496
2497                 /*
2498                  * We need to make sure we have no ordered extents in this range
2499                  * and nobody raced in and read a page in this range, if we did
2500                  * we need to try again.
2501                  */
2502                 if ((!ordered ||
2503                     (ordered->file_offset + ordered->num_bytes <= lockstart ||
2504                      ordered->file_offset > lockend)) &&
2505                      !filemap_range_has_page(inode->i_mapping,
2506                                              lockstart, lockend)) {
2507                         if (ordered)
2508                                 btrfs_put_ordered_extent(ordered);
2509                         break;
2510                 }
2511                 if (ordered)
2512                         btrfs_put_ordered_extent(ordered);
2513                 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart,
2514                                      lockend, cached_state);
2515                 ret = btrfs_wait_ordered_range(inode, lockstart,
2516                                                lockend - lockstart + 1);
2517                 if (ret)
2518                         return ret;
2519         }
2520         return 0;
2521 }
2522
2523 static int btrfs_insert_replace_extent(struct btrfs_trans_handle *trans,
2524                                      struct btrfs_inode *inode,
2525                                      struct btrfs_path *path,
2526                                      struct btrfs_replace_extent_info *extent_info,
2527                                      const u64 replace_len,
2528                                      const u64 bytes_to_drop)
2529 {
2530         struct btrfs_fs_info *fs_info = trans->fs_info;
2531         struct btrfs_root *root = inode->root;
2532         struct btrfs_file_extent_item *extent;
2533         struct extent_buffer *leaf;
2534         struct btrfs_key key;
2535         int slot;
2536         struct btrfs_ref ref = { 0 };
2537         int ret;
2538
2539         if (replace_len == 0)
2540                 return 0;
2541
2542         if (extent_info->disk_offset == 0 &&
2543             btrfs_fs_incompat(fs_info, NO_HOLES)) {
2544                 btrfs_update_inode_bytes(inode, 0, bytes_to_drop);
2545                 return 0;
2546         }
2547
2548         key.objectid = btrfs_ino(inode);
2549         key.type = BTRFS_EXTENT_DATA_KEY;
2550         key.offset = extent_info->file_offset;
2551         ret = btrfs_insert_empty_item(trans, root, path, &key,
2552                                       sizeof(struct btrfs_file_extent_item));
2553         if (ret)
2554                 return ret;
2555         leaf = path->nodes[0];
2556         slot = path->slots[0];
2557         write_extent_buffer(leaf, extent_info->extent_buf,
2558                             btrfs_item_ptr_offset(leaf, slot),
2559                             sizeof(struct btrfs_file_extent_item));
2560         extent = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
2561         ASSERT(btrfs_file_extent_type(leaf, extent) != BTRFS_FILE_EXTENT_INLINE);
2562         btrfs_set_file_extent_offset(leaf, extent, extent_info->data_offset);
2563         btrfs_set_file_extent_num_bytes(leaf, extent, replace_len);
2564         if (extent_info->is_new_extent)
2565                 btrfs_set_file_extent_generation(leaf, extent, trans->transid);
2566         btrfs_mark_buffer_dirty(leaf);
2567         btrfs_release_path(path);
2568
2569         ret = btrfs_inode_set_file_extent_range(inode, extent_info->file_offset,
2570                                                 replace_len);
2571         if (ret)
2572                 return ret;
2573
2574         /* If it's a hole, nothing more needs to be done. */
2575         if (extent_info->disk_offset == 0) {
2576                 btrfs_update_inode_bytes(inode, 0, bytes_to_drop);
2577                 return 0;
2578         }
2579
2580         btrfs_update_inode_bytes(inode, replace_len, bytes_to_drop);
2581
2582         if (extent_info->is_new_extent && extent_info->insertions == 0) {
2583                 key.objectid = extent_info->disk_offset;
2584                 key.type = BTRFS_EXTENT_ITEM_KEY;
2585                 key.offset = extent_info->disk_len;
2586                 ret = btrfs_alloc_reserved_file_extent(trans, root,
2587                                                        btrfs_ino(inode),
2588                                                        extent_info->file_offset,
2589                                                        extent_info->qgroup_reserved,
2590                                                        &key);
2591         } else {
2592                 u64 ref_offset;
2593
2594                 btrfs_init_generic_ref(&ref, BTRFS_ADD_DELAYED_REF,
2595                                        extent_info->disk_offset,
2596                                        extent_info->disk_len, 0);
2597                 ref_offset = extent_info->file_offset - extent_info->data_offset;
2598                 btrfs_init_data_ref(&ref, root->root_key.objectid,
2599                                     btrfs_ino(inode), ref_offset);
2600                 ret = btrfs_inc_extent_ref(trans, &ref);
2601         }
2602
2603         extent_info->insertions++;
2604
2605         return ret;
2606 }
2607
2608 /*
2609  * The respective range must have been previously locked, as well as the inode.
2610  * The end offset is inclusive (last byte of the range).
2611  * @extent_info is NULL for fallocate's hole punching and non-NULL when replacing
2612  * the file range with an extent.
2613  * When not punching a hole, we don't want to end up in a state where we dropped
2614  * extents without inserting a new one, so we must abort the transaction to avoid
2615  * a corruption.
2616  */
2617 int btrfs_replace_file_extents(struct btrfs_inode *inode,
2618                                struct btrfs_path *path, const u64 start,
2619                                const u64 end,
2620                                struct btrfs_replace_extent_info *extent_info,
2621                                struct btrfs_trans_handle **trans_out)
2622 {
2623         struct btrfs_drop_extents_args drop_args = { 0 };
2624         struct btrfs_root *root = inode->root;
2625         struct btrfs_fs_info *fs_info = root->fs_info;
2626         u64 min_size = btrfs_calc_insert_metadata_size(fs_info, 1);
2627         u64 ino_size = round_up(inode->vfs_inode.i_size, fs_info->sectorsize);
2628         struct btrfs_trans_handle *trans = NULL;
2629         struct btrfs_block_rsv *rsv;
2630         unsigned int rsv_count;
2631         u64 cur_offset;
2632         u64 len = end - start;
2633         int ret = 0;
2634
2635         if (end <= start)
2636                 return -EINVAL;
2637
2638         rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP);
2639         if (!rsv) {
2640                 ret = -ENOMEM;
2641                 goto out;
2642         }
2643         rsv->size = btrfs_calc_insert_metadata_size(fs_info, 1);
2644         rsv->failfast = 1;
2645
2646         /*
2647          * 1 - update the inode
2648          * 1 - removing the extents in the range
2649          * 1 - adding the hole extent if no_holes isn't set or if we are
2650          *     replacing the range with a new extent
2651          */
2652         if (!btrfs_fs_incompat(fs_info, NO_HOLES) || extent_info)
2653                 rsv_count = 3;
2654         else
2655                 rsv_count = 2;
2656
2657         trans = btrfs_start_transaction(root, rsv_count);
2658         if (IS_ERR(trans)) {
2659                 ret = PTR_ERR(trans);
2660                 trans = NULL;
2661                 goto out_free;
2662         }
2663
2664         ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv, rsv,
2665                                       min_size, false);
2666         BUG_ON(ret);
2667         trans->block_rsv = rsv;
2668
2669         cur_offset = start;
2670         drop_args.path = path;
2671         drop_args.end = end + 1;
2672         drop_args.drop_cache = true;
2673         while (cur_offset < end) {
2674                 drop_args.start = cur_offset;
2675                 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
2676                 /* If we are punching a hole decrement the inode's byte count */
2677                 if (!extent_info)
2678                         btrfs_update_inode_bytes(inode, 0,
2679                                                  drop_args.bytes_found);
2680                 if (ret != -ENOSPC) {
2681                         /*
2682                          * When cloning we want to avoid transaction aborts when
2683                          * nothing was done and we are attempting to clone parts
2684                          * of inline extents, in such cases -EOPNOTSUPP is
2685                          * returned by __btrfs_drop_extents() without having
2686                          * changed anything in the file.
2687                          */
2688                         if (extent_info && !extent_info->is_new_extent &&
2689                             ret && ret != -EOPNOTSUPP)
2690                                 btrfs_abort_transaction(trans, ret);
2691                         break;
2692                 }
2693
2694                 trans->block_rsv = &fs_info->trans_block_rsv;
2695
2696                 if (!extent_info && cur_offset < drop_args.drop_end &&
2697                     cur_offset < ino_size) {
2698                         ret = fill_holes(trans, inode, path, cur_offset,
2699                                          drop_args.drop_end);
2700                         if (ret) {
2701                                 /*
2702                                  * If we failed then we didn't insert our hole
2703                                  * entries for the area we dropped, so now the
2704                                  * fs is corrupted, so we must abort the
2705                                  * transaction.
2706                                  */
2707                                 btrfs_abort_transaction(trans, ret);
2708                                 break;
2709                         }
2710                 } else if (!extent_info && cur_offset < drop_args.drop_end) {
2711                         /*
2712                          * We are past the i_size here, but since we didn't
2713                          * insert holes we need to clear the mapped area so we
2714                          * know to not set disk_i_size in this area until a new
2715                          * file extent is inserted here.
2716                          */
2717                         ret = btrfs_inode_clear_file_extent_range(inode,
2718                                         cur_offset,
2719                                         drop_args.drop_end - cur_offset);
2720                         if (ret) {
2721                                 /*
2722                                  * We couldn't clear our area, so we could
2723                                  * presumably adjust up and corrupt the fs, so
2724                                  * we need to abort.
2725                                  */
2726                                 btrfs_abort_transaction(trans, ret);
2727                                 break;
2728                         }
2729                 }
2730
2731                 if (extent_info &&
2732                     drop_args.drop_end > extent_info->file_offset) {
2733                         u64 replace_len = drop_args.drop_end -
2734                                           extent_info->file_offset;
2735
2736                         ret = btrfs_insert_replace_extent(trans, inode, path,
2737                                         extent_info, replace_len,
2738                                         drop_args.bytes_found);
2739                         if (ret) {
2740                                 btrfs_abort_transaction(trans, ret);
2741                                 break;
2742                         }
2743                         extent_info->data_len -= replace_len;
2744                         extent_info->data_offset += replace_len;
2745                         extent_info->file_offset += replace_len;
2746                 }
2747
2748                 ret = btrfs_update_inode(trans, root, inode);
2749                 if (ret)
2750                         break;
2751
2752                 btrfs_end_transaction(trans);
2753                 btrfs_btree_balance_dirty(fs_info);
2754
2755                 trans = btrfs_start_transaction(root, rsv_count);
2756                 if (IS_ERR(trans)) {
2757                         ret = PTR_ERR(trans);
2758                         trans = NULL;
2759                         break;
2760                 }
2761
2762                 ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv,
2763                                               rsv, min_size, false);
2764                 BUG_ON(ret);    /* shouldn't happen */
2765                 trans->block_rsv = rsv;
2766
2767                 cur_offset = drop_args.drop_end;
2768                 len = end - cur_offset;
2769                 if (!extent_info && len) {
2770                         ret = find_first_non_hole(inode, &cur_offset, &len);
2771                         if (unlikely(ret < 0))
2772                                 break;
2773                         if (ret && !len) {
2774                                 ret = 0;
2775                                 break;
2776                         }
2777                 }
2778         }
2779
2780         /*
2781          * If we were cloning, force the next fsync to be a full one since we
2782          * we replaced (or just dropped in the case of cloning holes when
2783          * NO_HOLES is enabled) file extent items and did not setup new extent
2784          * maps for the replacement extents (or holes).
2785          */
2786         if (extent_info && !extent_info->is_new_extent)
2787                 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &inode->runtime_flags);
2788
2789         if (ret)
2790                 goto out_trans;
2791
2792         trans->block_rsv = &fs_info->trans_block_rsv;
2793         /*
2794          * If we are using the NO_HOLES feature we might have had already an
2795          * hole that overlaps a part of the region [lockstart, lockend] and
2796          * ends at (or beyond) lockend. Since we have no file extent items to
2797          * represent holes, drop_end can be less than lockend and so we must
2798          * make sure we have an extent map representing the existing hole (the
2799          * call to __btrfs_drop_extents() might have dropped the existing extent
2800          * map representing the existing hole), otherwise the fast fsync path
2801          * will not record the existence of the hole region
2802          * [existing_hole_start, lockend].
2803          */
2804         if (drop_args.drop_end <= end)
2805                 drop_args.drop_end = end + 1;
2806         /*
2807          * Don't insert file hole extent item if it's for a range beyond eof
2808          * (because it's useless) or if it represents a 0 bytes range (when
2809          * cur_offset == drop_end).
2810          */
2811         if (!extent_info && cur_offset < ino_size &&
2812             cur_offset < drop_args.drop_end) {
2813                 ret = fill_holes(trans, inode, path, cur_offset,
2814                                  drop_args.drop_end);
2815                 if (ret) {
2816                         /* Same comment as above. */
2817                         btrfs_abort_transaction(trans, ret);
2818                         goto out_trans;
2819                 }
2820         } else if (!extent_info && cur_offset < drop_args.drop_end) {
2821                 /* See the comment in the loop above for the reasoning here. */
2822                 ret = btrfs_inode_clear_file_extent_range(inode, cur_offset,
2823                                         drop_args.drop_end - cur_offset);
2824                 if (ret) {
2825                         btrfs_abort_transaction(trans, ret);
2826                         goto out_trans;
2827                 }
2828
2829         }
2830         if (extent_info) {
2831                 ret = btrfs_insert_replace_extent(trans, inode, path,
2832                                 extent_info, extent_info->data_len,
2833                                 drop_args.bytes_found);
2834                 if (ret) {
2835                         btrfs_abort_transaction(trans, ret);
2836                         goto out_trans;
2837                 }
2838         }
2839
2840 out_trans:
2841         if (!trans)
2842                 goto out_free;
2843
2844         trans->block_rsv = &fs_info->trans_block_rsv;
2845         if (ret)
2846                 btrfs_end_transaction(trans);
2847         else
2848                 *trans_out = trans;
2849 out_free:
2850         btrfs_free_block_rsv(fs_info, rsv);
2851 out:
2852         return ret;
2853 }
2854
2855 static int btrfs_punch_hole(struct inode *inode, loff_t offset, loff_t len)
2856 {
2857         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2858         struct btrfs_root *root = BTRFS_I(inode)->root;
2859         struct extent_state *cached_state = NULL;
2860         struct btrfs_path *path;
2861         struct btrfs_trans_handle *trans = NULL;
2862         u64 lockstart;
2863         u64 lockend;
2864         u64 tail_start;
2865         u64 tail_len;
2866         u64 orig_start = offset;
2867         int ret = 0;
2868         bool same_block;
2869         u64 ino_size;
2870         bool truncated_block = false;
2871         bool updated_inode = false;
2872
2873         ret = btrfs_wait_ordered_range(inode, offset, len);
2874         if (ret)
2875                 return ret;
2876
2877         btrfs_inode_lock(inode, BTRFS_ILOCK_MMAP);
2878         ino_size = round_up(inode->i_size, fs_info->sectorsize);
2879         ret = find_first_non_hole(BTRFS_I(inode), &offset, &len);
2880         if (ret < 0)
2881                 goto out_only_mutex;
2882         if (ret && !len) {
2883                 /* Already in a large hole */
2884                 ret = 0;
2885                 goto out_only_mutex;
2886         }
2887
2888         lockstart = round_up(offset, btrfs_inode_sectorsize(BTRFS_I(inode)));
2889         lockend = round_down(offset + len,
2890                              btrfs_inode_sectorsize(BTRFS_I(inode))) - 1;
2891         same_block = (BTRFS_BYTES_TO_BLKS(fs_info, offset))
2892                 == (BTRFS_BYTES_TO_BLKS(fs_info, offset + len - 1));
2893         /*
2894          * We needn't truncate any block which is beyond the end of the file
2895          * because we are sure there is no data there.
2896          */
2897         /*
2898          * Only do this if we are in the same block and we aren't doing the
2899          * entire block.
2900          */
2901         if (same_block && len < fs_info->sectorsize) {
2902                 if (offset < ino_size) {
2903                         truncated_block = true;
2904                         ret = btrfs_truncate_block(BTRFS_I(inode), offset, len,
2905                                                    0);
2906                 } else {
2907                         ret = 0;
2908                 }
2909                 goto out_only_mutex;
2910         }
2911
2912         /* zero back part of the first block */
2913         if (offset < ino_size) {
2914                 truncated_block = true;
2915                 ret = btrfs_truncate_block(BTRFS_I(inode), offset, 0, 0);
2916                 if (ret) {
2917                         btrfs_inode_unlock(inode, BTRFS_ILOCK_MMAP);
2918                         return ret;
2919                 }
2920         }
2921
2922         /* Check the aligned pages after the first unaligned page,
2923          * if offset != orig_start, which means the first unaligned page
2924          * including several following pages are already in holes,
2925          * the extra check can be skipped */
2926         if (offset == orig_start) {
2927                 /* after truncate page, check hole again */
2928                 len = offset + len - lockstart;
2929                 offset = lockstart;
2930                 ret = find_first_non_hole(BTRFS_I(inode), &offset, &len);
2931                 if (ret < 0)
2932                         goto out_only_mutex;
2933                 if (ret && !len) {
2934                         ret = 0;
2935                         goto out_only_mutex;
2936                 }
2937                 lockstart = offset;
2938         }
2939
2940         /* Check the tail unaligned part is in a hole */
2941         tail_start = lockend + 1;
2942         tail_len = offset + len - tail_start;
2943         if (tail_len) {
2944                 ret = find_first_non_hole(BTRFS_I(inode), &tail_start, &tail_len);
2945                 if (unlikely(ret < 0))
2946                         goto out_only_mutex;
2947                 if (!ret) {
2948                         /* zero the front end of the last page */
2949                         if (tail_start + tail_len < ino_size) {
2950                                 truncated_block = true;
2951                                 ret = btrfs_truncate_block(BTRFS_I(inode),
2952                                                         tail_start + tail_len,
2953                                                         0, 1);
2954                                 if (ret)
2955                                         goto out_only_mutex;
2956                         }
2957                 }
2958         }
2959
2960         if (lockend < lockstart) {
2961                 ret = 0;
2962                 goto out_only_mutex;
2963         }
2964
2965         ret = btrfs_punch_hole_lock_range(inode, lockstart, lockend,
2966                                           &cached_state);
2967         if (ret)
2968                 goto out_only_mutex;
2969
2970         path = btrfs_alloc_path();
2971         if (!path) {
2972                 ret = -ENOMEM;
2973                 goto out;
2974         }
2975
2976         ret = btrfs_replace_file_extents(BTRFS_I(inode), path, lockstart,
2977                                          lockend, NULL, &trans);
2978         btrfs_free_path(path);
2979         if (ret)
2980                 goto out;
2981
2982         ASSERT(trans != NULL);
2983         inode_inc_iversion(inode);
2984         inode->i_mtime = inode->i_ctime = current_time(inode);
2985         ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
2986         updated_inode = true;
2987         btrfs_end_transaction(trans);
2988         btrfs_btree_balance_dirty(fs_info);
2989 out:
2990         unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend,
2991                              &cached_state);
2992 out_only_mutex:
2993         if (!updated_inode && truncated_block && !ret) {
2994                 /*
2995                  * If we only end up zeroing part of a page, we still need to
2996                  * update the inode item, so that all the time fields are
2997                  * updated as well as the necessary btrfs inode in memory fields
2998                  * for detecting, at fsync time, if the inode isn't yet in the
2999                  * log tree or it's there but not up to date.
3000                  */
3001                 struct timespec64 now = current_time(inode);
3002
3003                 inode_inc_iversion(inode);
3004                 inode->i_mtime = now;
3005                 inode->i_ctime = now;
3006                 trans = btrfs_start_transaction(root, 1);
3007                 if (IS_ERR(trans)) {
3008                         ret = PTR_ERR(trans);
3009                 } else {
3010                         int ret2;
3011
3012                         ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
3013                         ret2 = btrfs_end_transaction(trans);
3014                         if (!ret)
3015                                 ret = ret2;
3016                 }
3017         }
3018         btrfs_inode_unlock(inode, BTRFS_ILOCK_MMAP);
3019         return ret;
3020 }
3021
3022 /* Helper structure to record which range is already reserved */
3023 struct falloc_range {
3024         struct list_head list;
3025         u64 start;
3026         u64 len;
3027 };
3028
3029 /*
3030  * Helper function to add falloc range
3031  *
3032  * Caller should have locked the larger range of extent containing
3033  * [start, len)
3034  */
3035 static int add_falloc_range(struct list_head *head, u64 start, u64 len)
3036 {
3037         struct falloc_range *prev = NULL;
3038         struct falloc_range *range = NULL;
3039
3040         if (list_empty(head))
3041                 goto insert;
3042
3043         /*
3044          * As fallocate iterate by bytenr order, we only need to check
3045          * the last range.
3046          */
3047         prev = list_entry(head->prev, struct falloc_range, list);
3048         if (prev->start + prev->len == start) {
3049                 prev->len += len;
3050                 return 0;
3051         }
3052 insert:
3053         range = kmalloc(sizeof(*range), GFP_KERNEL);
3054         if (!range)
3055                 return -ENOMEM;
3056         range->start = start;
3057         range->len = len;
3058         list_add_tail(&range->list, head);
3059         return 0;
3060 }
3061
3062 static int btrfs_fallocate_update_isize(struct inode *inode,
3063                                         const u64 end,
3064                                         const int mode)
3065 {
3066         struct btrfs_trans_handle *trans;
3067         struct btrfs_root *root = BTRFS_I(inode)->root;
3068         int ret;
3069         int ret2;
3070
3071         if (mode & FALLOC_FL_KEEP_SIZE || end <= i_size_read(inode))
3072                 return 0;
3073
3074         trans = btrfs_start_transaction(root, 1);
3075         if (IS_ERR(trans))
3076                 return PTR_ERR(trans);
3077
3078         inode->i_ctime = current_time(inode);
3079         i_size_write(inode, end);
3080         btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
3081         ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
3082         ret2 = btrfs_end_transaction(trans);
3083
3084         return ret ? ret : ret2;
3085 }
3086
3087 enum {
3088         RANGE_BOUNDARY_WRITTEN_EXTENT,
3089         RANGE_BOUNDARY_PREALLOC_EXTENT,
3090         RANGE_BOUNDARY_HOLE,
3091 };
3092
3093 static int btrfs_zero_range_check_range_boundary(struct btrfs_inode *inode,
3094                                                  u64 offset)
3095 {
3096         const u64 sectorsize = btrfs_inode_sectorsize(inode);
3097         struct extent_map *em;
3098         int ret;
3099
3100         offset = round_down(offset, sectorsize);
3101         em = btrfs_get_extent(inode, NULL, 0, offset, sectorsize);
3102         if (IS_ERR(em))
3103                 return PTR_ERR(em);
3104
3105         if (em->block_start == EXTENT_MAP_HOLE)
3106                 ret = RANGE_BOUNDARY_HOLE;
3107         else if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
3108                 ret = RANGE_BOUNDARY_PREALLOC_EXTENT;
3109         else
3110                 ret = RANGE_BOUNDARY_WRITTEN_EXTENT;
3111
3112         free_extent_map(em);
3113         return ret;
3114 }
3115
3116 static int btrfs_zero_range(struct inode *inode,
3117                             loff_t offset,
3118                             loff_t len,
3119                             const int mode)
3120 {
3121         struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
3122         struct extent_map *em;
3123         struct extent_changeset *data_reserved = NULL;
3124         int ret;
3125         u64 alloc_hint = 0;
3126         const u64 sectorsize = btrfs_inode_sectorsize(BTRFS_I(inode));
3127         u64 alloc_start = round_down(offset, sectorsize);
3128         u64 alloc_end = round_up(offset + len, sectorsize);
3129         u64 bytes_to_reserve = 0;
3130         bool space_reserved = false;
3131
3132         inode_dio_wait(inode);
3133
3134         em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, alloc_start,
3135                               alloc_end - alloc_start);
3136         if (IS_ERR(em)) {
3137                 ret = PTR_ERR(em);
3138                 goto out;
3139         }
3140
3141         /*
3142          * Avoid hole punching and extent allocation for some cases. More cases
3143          * could be considered, but these are unlikely common and we keep things
3144          * as simple as possible for now. Also, intentionally, if the target
3145          * range contains one or more prealloc extents together with regular
3146          * extents and holes, we drop all the existing extents and allocate a
3147          * new prealloc extent, so that we get a larger contiguous disk extent.
3148          */
3149         if (em->start <= alloc_start &&
3150             test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
3151                 const u64 em_end = em->start + em->len;
3152
3153                 if (em_end >= offset + len) {
3154                         /*
3155                          * The whole range is already a prealloc extent,
3156                          * do nothing except updating the inode's i_size if
3157                          * needed.
3158                          */
3159                         free_extent_map(em);
3160                         ret = btrfs_fallocate_update_isize(inode, offset + len,
3161                                                            mode);
3162                         goto out;
3163                 }
3164                 /*
3165                  * Part of the range is already a prealloc extent, so operate
3166                  * only on the remaining part of the range.
3167                  */
3168                 alloc_start = em_end;
3169                 ASSERT(IS_ALIGNED(alloc_start, sectorsize));
3170                 len = offset + len - alloc_start;
3171                 offset = alloc_start;
3172                 alloc_hint = em->block_start + em->len;
3173         }
3174         free_extent_map(em);
3175
3176         if (BTRFS_BYTES_TO_BLKS(fs_info, offset) ==
3177             BTRFS_BYTES_TO_BLKS(fs_info, offset + len - 1)) {
3178                 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, alloc_start,
3179                                       sectorsize);
3180                 if (IS_ERR(em)) {
3181                         ret = PTR_ERR(em);
3182                         goto out;
3183                 }
3184
3185                 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
3186                         free_extent_map(em);
3187                         ret = btrfs_fallocate_update_isize(inode, offset + len,
3188                                                            mode);
3189                         goto out;
3190                 }
3191                 if (len < sectorsize && em->block_start != EXTENT_MAP_HOLE) {
3192                         free_extent_map(em);
3193                         ret = btrfs_truncate_block(BTRFS_I(inode), offset, len,
3194                                                    0);
3195                         if (!ret)
3196                                 ret = btrfs_fallocate_update_isize(inode,
3197                                                                    offset + len,
3198                                                                    mode);
3199                         return ret;
3200                 }
3201                 free_extent_map(em);
3202                 alloc_start = round_down(offset, sectorsize);
3203                 alloc_end = alloc_start + sectorsize;
3204                 goto reserve_space;
3205         }
3206
3207         alloc_start = round_up(offset, sectorsize);
3208         alloc_end = round_down(offset + len, sectorsize);
3209
3210         /*
3211          * For unaligned ranges, check the pages at the boundaries, they might
3212          * map to an extent, in which case we need to partially zero them, or
3213          * they might map to a hole, in which case we need our allocation range
3214          * to cover them.
3215          */
3216         if (!IS_ALIGNED(offset, sectorsize)) {
3217                 ret = btrfs_zero_range_check_range_boundary(BTRFS_I(inode),
3218                                                             offset);
3219                 if (ret < 0)
3220                         goto out;
3221                 if (ret == RANGE_BOUNDARY_HOLE) {
3222                         alloc_start = round_down(offset, sectorsize);
3223                         ret = 0;
3224                 } else if (ret == RANGE_BOUNDARY_WRITTEN_EXTENT) {
3225                         ret = btrfs_truncate_block(BTRFS_I(inode), offset, 0, 0);
3226                         if (ret)
3227                                 goto out;
3228                 } else {
3229                         ret = 0;
3230                 }
3231         }
3232
3233         if (!IS_ALIGNED(offset + len, sectorsize)) {
3234                 ret = btrfs_zero_range_check_range_boundary(BTRFS_I(inode),
3235                                                             offset + len);
3236                 if (ret < 0)
3237                         goto out;
3238                 if (ret == RANGE_BOUNDARY_HOLE) {
3239                         alloc_end = round_up(offset + len, sectorsize);
3240                         ret = 0;
3241                 } else if (ret == RANGE_BOUNDARY_WRITTEN_EXTENT) {
3242                         ret = btrfs_truncate_block(BTRFS_I(inode), offset + len,
3243                                                    0, 1);
3244                         if (ret)
3245                                 goto out;
3246                 } else {
3247                         ret = 0;
3248                 }
3249         }
3250
3251 reserve_space:
3252         if (alloc_start < alloc_end) {
3253                 struct extent_state *cached_state = NULL;
3254                 const u64 lockstart = alloc_start;
3255                 const u64 lockend = alloc_end - 1;
3256
3257                 bytes_to_reserve = alloc_end - alloc_start;
3258                 ret = btrfs_alloc_data_chunk_ondemand(BTRFS_I(inode),
3259                                                       bytes_to_reserve);
3260                 if (ret < 0)
3261                         goto out;
3262                 space_reserved = true;
3263                 ret = btrfs_punch_hole_lock_range(inode, lockstart, lockend,
3264                                                   &cached_state);
3265                 if (ret)
3266                         goto out;
3267                 ret = btrfs_qgroup_reserve_data(BTRFS_I(inode), &data_reserved,
3268                                                 alloc_start, bytes_to_reserve);
3269                 if (ret) {
3270                         unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart,
3271                                              lockend, &cached_state);
3272                         goto out;
3273                 }
3274                 ret = btrfs_prealloc_file_range(inode, mode, alloc_start,
3275                                                 alloc_end - alloc_start,
3276                                                 i_blocksize(inode),
3277                                                 offset + len, &alloc_hint);
3278                 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart,
3279                                      lockend, &cached_state);
3280                 /* btrfs_prealloc_file_range releases reserved space on error */
3281                 if (ret) {
3282                         space_reserved = false;
3283                         goto out;
3284                 }
3285         }
3286         ret = btrfs_fallocate_update_isize(inode, offset + len, mode);
3287  out:
3288         if (ret && space_reserved)
3289                 btrfs_free_reserved_data_space(BTRFS_I(inode), data_reserved,
3290                                                alloc_start, bytes_to_reserve);
3291         extent_changeset_free(data_reserved);
3292
3293         return ret;
3294 }
3295
3296 static long btrfs_fallocate(struct file *file, int mode,
3297                             loff_t offset, loff_t len)
3298 {
3299         struct inode *inode = file_inode(file);
3300         struct extent_state *cached_state = NULL;
3301         struct extent_changeset *data_reserved = NULL;
3302         struct falloc_range *range;
3303         struct falloc_range *tmp;
3304         struct list_head reserve_list;
3305         u64 cur_offset;
3306         u64 last_byte;
3307         u64 alloc_start;
3308         u64 alloc_end;
3309         u64 alloc_hint = 0;
3310         u64 locked_end;
3311         u64 actual_end = 0;
3312         struct extent_map *em;
3313         int blocksize = btrfs_inode_sectorsize(BTRFS_I(inode));
3314         int ret;
3315
3316         /* Do not allow fallocate in ZONED mode */
3317         if (btrfs_is_zoned(btrfs_sb(inode->i_sb)))
3318                 return -EOPNOTSUPP;
3319
3320         alloc_start = round_down(offset, blocksize);
3321         alloc_end = round_up(offset + len, blocksize);
3322         cur_offset = alloc_start;
3323
3324         /* Make sure we aren't being give some crap mode */
3325         if (mode & ~(FALLOC_FL_KEEP_SIZE | FALLOC_FL_PUNCH_HOLE |
3326                      FALLOC_FL_ZERO_RANGE))
3327                 return -EOPNOTSUPP;
3328
3329         if (mode & FALLOC_FL_PUNCH_HOLE)
3330                 return btrfs_punch_hole(inode, offset, len);
3331
3332         /*
3333          * Only trigger disk allocation, don't trigger qgroup reserve
3334          *
3335          * For qgroup space, it will be checked later.
3336          */
3337         if (!(mode & FALLOC_FL_ZERO_RANGE)) {
3338                 ret = btrfs_alloc_data_chunk_ondemand(BTRFS_I(inode),
3339                                                       alloc_end - alloc_start);
3340                 if (ret < 0)
3341                         return ret;
3342         }
3343
3344         btrfs_inode_lock(inode, BTRFS_ILOCK_MMAP);
3345
3346         if (!(mode & FALLOC_FL_KEEP_SIZE) && offset + len > inode->i_size) {
3347                 ret = inode_newsize_ok(inode, offset + len);
3348                 if (ret)
3349                         goto out;
3350         }
3351
3352         /*
3353          * TODO: Move these two operations after we have checked
3354          * accurate reserved space, or fallocate can still fail but
3355          * with page truncated or size expanded.
3356          *
3357          * But that's a minor problem and won't do much harm BTW.
3358          */
3359         if (alloc_start > inode->i_size) {
3360                 ret = btrfs_cont_expand(BTRFS_I(inode), i_size_read(inode),
3361                                         alloc_start);
3362                 if (ret)
3363                         goto out;
3364         } else if (offset + len > inode->i_size) {
3365                 /*
3366                  * If we are fallocating from the end of the file onward we
3367                  * need to zero out the end of the block if i_size lands in the
3368                  * middle of a block.
3369                  */
3370                 ret = btrfs_truncate_block(BTRFS_I(inode), inode->i_size, 0, 0);
3371                 if (ret)
3372                         goto out;
3373         }
3374
3375         /*
3376          * wait for ordered IO before we have any locks.  We'll loop again
3377          * below with the locks held.
3378          */
3379         ret = btrfs_wait_ordered_range(inode, alloc_start,
3380                                        alloc_end - alloc_start);
3381         if (ret)
3382                 goto out;
3383
3384         if (mode & FALLOC_FL_ZERO_RANGE) {
3385                 ret = btrfs_zero_range(inode, offset, len, mode);
3386                 btrfs_inode_unlock(inode, BTRFS_ILOCK_MMAP);
3387                 return ret;
3388         }
3389
3390         locked_end = alloc_end - 1;
3391         while (1) {
3392                 struct btrfs_ordered_extent *ordered;
3393
3394                 /* the extent lock is ordered inside the running
3395                  * transaction
3396                  */
3397                 lock_extent_bits(&BTRFS_I(inode)->io_tree, alloc_start,
3398                                  locked_end, &cached_state);
3399                 ordered = btrfs_lookup_first_ordered_extent(BTRFS_I(inode),
3400                                                             locked_end);
3401
3402                 if (ordered &&
3403                     ordered->file_offset + ordered->num_bytes > alloc_start &&
3404                     ordered->file_offset < alloc_end) {
3405                         btrfs_put_ordered_extent(ordered);
3406                         unlock_extent_cached(&BTRFS_I(inode)->io_tree,
3407                                              alloc_start, locked_end,
3408                                              &cached_state);
3409                         /*
3410                          * we can't wait on the range with the transaction
3411                          * running or with the extent lock held
3412                          */
3413                         ret = btrfs_wait_ordered_range(inode, alloc_start,
3414                                                        alloc_end - alloc_start);
3415                         if (ret)
3416                                 goto out;
3417                 } else {
3418                         if (ordered)
3419                                 btrfs_put_ordered_extent(ordered);
3420                         break;
3421                 }
3422         }
3423
3424         /* First, check if we exceed the qgroup limit */
3425         INIT_LIST_HEAD(&reserve_list);
3426         while (cur_offset < alloc_end) {
3427                 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, cur_offset,
3428                                       alloc_end - cur_offset);
3429                 if (IS_ERR(em)) {
3430                         ret = PTR_ERR(em);
3431                         break;
3432                 }
3433                 last_byte = min(extent_map_end(em), alloc_end);
3434                 actual_end = min_t(u64, extent_map_end(em), offset + len);
3435                 last_byte = ALIGN(last_byte, blocksize);
3436                 if (em->block_start == EXTENT_MAP_HOLE ||
3437                     (cur_offset >= inode->i_size &&
3438                      !test_bit(EXTENT_FLAG_PREALLOC, &em->flags))) {
3439                         ret = add_falloc_range(&reserve_list, cur_offset,
3440                                                last_byte - cur_offset);
3441                         if (ret < 0) {
3442                                 free_extent_map(em);
3443                                 break;
3444                         }
3445                         ret = btrfs_qgroup_reserve_data(BTRFS_I(inode),
3446                                         &data_reserved, cur_offset,
3447                                         last_byte - cur_offset);
3448                         if (ret < 0) {
3449                                 cur_offset = last_byte;
3450                                 free_extent_map(em);
3451                                 break;
3452                         }
3453                 } else {
3454                         /*
3455                          * Do not need to reserve unwritten extent for this
3456                          * range, free reserved data space first, otherwise
3457                          * it'll result in false ENOSPC error.
3458                          */
3459                         btrfs_free_reserved_data_space(BTRFS_I(inode),
3460                                 data_reserved, cur_offset,
3461                                 last_byte - cur_offset);
3462                 }
3463                 free_extent_map(em);
3464                 cur_offset = last_byte;
3465         }
3466
3467         /*
3468          * If ret is still 0, means we're OK to fallocate.
3469          * Or just cleanup the list and exit.
3470          */
3471         list_for_each_entry_safe(range, tmp, &reserve_list, list) {
3472                 if (!ret)
3473                         ret = btrfs_prealloc_file_range(inode, mode,
3474                                         range->start,
3475                                         range->len, i_blocksize(inode),
3476                                         offset + len, &alloc_hint);
3477                 else
3478                         btrfs_free_reserved_data_space(BTRFS_I(inode),
3479                                         data_reserved, range->start,
3480                                         range->len);
3481                 list_del(&range->list);
3482                 kfree(range);
3483         }
3484         if (ret < 0)
3485                 goto out_unlock;
3486
3487         /*
3488          * We didn't need to allocate any more space, but we still extended the
3489          * size of the file so we need to update i_size and the inode item.
3490          */
3491         ret = btrfs_fallocate_update_isize(inode, actual_end, mode);
3492 out_unlock:
3493         unlock_extent_cached(&BTRFS_I(inode)->io_tree, alloc_start, locked_end,
3494                              &cached_state);
3495 out:
3496         btrfs_inode_unlock(inode, BTRFS_ILOCK_MMAP);
3497         /* Let go of our reservation. */
3498         if (ret != 0 && !(mode & FALLOC_FL_ZERO_RANGE))
3499                 btrfs_free_reserved_data_space(BTRFS_I(inode), data_reserved,
3500                                 cur_offset, alloc_end - cur_offset);
3501         extent_changeset_free(data_reserved);
3502         return ret;
3503 }
3504
3505 static loff_t find_desired_extent(struct btrfs_inode *inode, loff_t offset,
3506                                   int whence)
3507 {
3508         struct btrfs_fs_info *fs_info = inode->root->fs_info;
3509         struct extent_map *em = NULL;
3510         struct extent_state *cached_state = NULL;
3511         loff_t i_size = inode->vfs_inode.i_size;
3512         u64 lockstart;
3513         u64 lockend;
3514         u64 start;
3515         u64 len;
3516         int ret = 0;
3517
3518         if (i_size == 0 || offset >= i_size)
3519                 return -ENXIO;
3520
3521         /*
3522          * offset can be negative, in this case we start finding DATA/HOLE from
3523          * the very start of the file.
3524          */
3525         start = max_t(loff_t, 0, offset);
3526
3527         lockstart = round_down(start, fs_info->sectorsize);
3528         lockend = round_up(i_size, fs_info->sectorsize);
3529         if (lockend <= lockstart)
3530                 lockend = lockstart + fs_info->sectorsize;
3531         lockend--;
3532         len = lockend - lockstart + 1;
3533
3534         lock_extent_bits(&inode->io_tree, lockstart, lockend, &cached_state);
3535
3536         while (start < i_size) {
3537                 em = btrfs_get_extent_fiemap(inode, start, len);
3538                 if (IS_ERR(em)) {
3539                         ret = PTR_ERR(em);
3540                         em = NULL;
3541                         break;
3542                 }
3543
3544                 if (whence == SEEK_HOLE &&
3545                     (em->block_start == EXTENT_MAP_HOLE ||
3546                      test_bit(EXTENT_FLAG_PREALLOC, &em->flags)))
3547                         break;
3548                 else if (whence == SEEK_DATA &&
3549                            (em->block_start != EXTENT_MAP_HOLE &&
3550                             !test_bit(EXTENT_FLAG_PREALLOC, &em->flags)))
3551                         break;
3552
3553                 start = em->start + em->len;
3554                 free_extent_map(em);
3555                 em = NULL;
3556                 cond_resched();
3557         }
3558         free_extent_map(em);
3559         unlock_extent_cached(&inode->io_tree, lockstart, lockend,
3560                              &cached_state);
3561         if (ret) {
3562                 offset = ret;
3563         } else {
3564                 if (whence == SEEK_DATA && start >= i_size)
3565                         offset = -ENXIO;
3566                 else
3567                         offset = min_t(loff_t, start, i_size);
3568         }
3569
3570         return offset;
3571 }
3572
3573 static loff_t btrfs_file_llseek(struct file *file, loff_t offset, int whence)
3574 {
3575         struct inode *inode = file->f_mapping->host;
3576
3577         switch (whence) {
3578         default:
3579                 return generic_file_llseek(file, offset, whence);
3580         case SEEK_DATA:
3581         case SEEK_HOLE:
3582                 btrfs_inode_lock(inode, BTRFS_ILOCK_SHARED);
3583                 offset = find_desired_extent(BTRFS_I(inode), offset, whence);
3584                 btrfs_inode_unlock(inode, BTRFS_ILOCK_SHARED);
3585                 break;
3586         }
3587
3588         if (offset < 0)
3589                 return offset;
3590
3591         return vfs_setpos(file, offset, inode->i_sb->s_maxbytes);
3592 }
3593
3594 static int btrfs_file_open(struct inode *inode, struct file *filp)
3595 {
3596         filp->f_mode |= FMODE_NOWAIT | FMODE_BUF_RASYNC;
3597         return generic_file_open(inode, filp);
3598 }
3599
3600 static int check_direct_read(struct btrfs_fs_info *fs_info,
3601                              const struct iov_iter *iter, loff_t offset)
3602 {
3603         int ret;
3604         int i, seg;
3605
3606         ret = check_direct_IO(fs_info, iter, offset);
3607         if (ret < 0)
3608                 return ret;
3609
3610         if (!iter_is_iovec(iter))
3611                 return 0;
3612
3613         for (seg = 0; seg < iter->nr_segs; seg++)
3614                 for (i = seg + 1; i < iter->nr_segs; i++)
3615                         if (iter->iov[seg].iov_base == iter->iov[i].iov_base)
3616                                 return -EINVAL;
3617         return 0;
3618 }
3619
3620 static ssize_t btrfs_direct_read(struct kiocb *iocb, struct iov_iter *to)
3621 {
3622         struct inode *inode = file_inode(iocb->ki_filp);
3623         ssize_t ret;
3624
3625         if (check_direct_read(btrfs_sb(inode->i_sb), to, iocb->ki_pos))
3626                 return 0;
3627
3628         btrfs_inode_lock(inode, BTRFS_ILOCK_SHARED);
3629         ret = iomap_dio_rw(iocb, to, &btrfs_dio_iomap_ops, &btrfs_dio_ops, 0);
3630         btrfs_inode_unlock(inode, BTRFS_ILOCK_SHARED);
3631         return ret;
3632 }
3633
3634 static ssize_t btrfs_file_read_iter(struct kiocb *iocb, struct iov_iter *to)
3635 {
3636         ssize_t ret = 0;
3637
3638         if (iocb->ki_flags & IOCB_DIRECT) {
3639                 ret = btrfs_direct_read(iocb, to);
3640                 if (ret < 0 || !iov_iter_count(to) ||
3641                     iocb->ki_pos >= i_size_read(file_inode(iocb->ki_filp)))
3642                         return ret;
3643         }
3644
3645         return filemap_read(iocb, to, ret);
3646 }
3647
3648 const struct file_operations btrfs_file_operations = {
3649         .llseek         = btrfs_file_llseek,
3650         .read_iter      = btrfs_file_read_iter,
3651         .splice_read    = generic_file_splice_read,
3652         .write_iter     = btrfs_file_write_iter,
3653         .splice_write   = iter_file_splice_write,
3654         .mmap           = btrfs_file_mmap,
3655         .open           = btrfs_file_open,
3656         .release        = btrfs_release_file,
3657         .fsync          = btrfs_sync_file,
3658         .fallocate      = btrfs_fallocate,
3659         .unlocked_ioctl = btrfs_ioctl,
3660 #ifdef CONFIG_COMPAT
3661         .compat_ioctl   = btrfs_compat_ioctl,
3662 #endif
3663         .remap_file_range = btrfs_remap_file_range,
3664 };
3665
3666 void __cold btrfs_auto_defrag_exit(void)
3667 {
3668         kmem_cache_destroy(btrfs_inode_defrag_cachep);
3669 }
3670
3671 int __init btrfs_auto_defrag_init(void)
3672 {
3673         btrfs_inode_defrag_cachep = kmem_cache_create("btrfs_inode_defrag",
3674                                         sizeof(struct inode_defrag), 0,
3675                                         SLAB_MEM_SPREAD,
3676                                         NULL);
3677         if (!btrfs_inode_defrag_cachep)
3678                 return -ENOMEM;
3679
3680         return 0;
3681 }
3682
3683 int btrfs_fdatawrite_range(struct inode *inode, loff_t start, loff_t end)
3684 {
3685         int ret;
3686
3687         /*
3688          * So with compression we will find and lock a dirty page and clear the
3689          * first one as dirty, setup an async extent, and immediately return
3690          * with the entire range locked but with nobody actually marked with
3691          * writeback.  So we can't just filemap_write_and_wait_range() and
3692          * expect it to work since it will just kick off a thread to do the
3693          * actual work.  So we need to call filemap_fdatawrite_range _again_
3694          * since it will wait on the page lock, which won't be unlocked until
3695          * after the pages have been marked as writeback and so we're good to go
3696          * from there.  We have to do this otherwise we'll miss the ordered
3697          * extents and that results in badness.  Please Josef, do not think you
3698          * know better and pull this out at some point in the future, it is
3699          * right and you are wrong.
3700          */
3701         ret = filemap_fdatawrite_range(inode->i_mapping, start, end);
3702         if (!ret && test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
3703                              &BTRFS_I(inode)->runtime_flags))
3704                 ret = filemap_fdatawrite_range(inode->i_mapping, start, end);
3705
3706         return ret;
3707 }