fs/btrfs/inode.c

   1 /*
   2  * Copyright (C) 2007 Oracle.  All rights reserved.
   3  *
   4  * This program is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU General Public
   6  * License v2 as published by the Free Software Foundation.
   7  *
   8  * This program is distributed in the hope that it will be useful,
   9  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  11  * General Public License for more details.
  12  *
  13  * You should have received a copy of the GNU General Public
  14  * License along with this program; if not, write to the
  15  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16  * Boston, MA 021110-1307, USA.
  17  */
  18
  19 #include <linux/kernel.h>
  20 #include <linux/bio.h>
  21 #include <linux/buffer_head.h>
  22 #include <linux/file.h>
  23 #include <linux/fs.h>
  24 #include <linux/pagemap.h>
  25 #include <linux/highmem.h>
  26 #include <linux/time.h>
  27 #include <linux/init.h>
  28 #include <linux/string.h>
  29 #include <linux/backing-dev.h>
  30 #include <linux/mpage.h>
  31 #include <linux/swap.h>
  32 #include <linux/writeback.h>
  33 #include <linux/statfs.h>
  34 #include <linux/compat.h>
  35 #include <linux/bit_spinlock.h>
  36 #include <linux/xattr.h>
  37 #include <linux/posix_acl.h>
  38 #include <linux/falloc.h>
  39 #include <linux/slab.h>
  40 #include <linux/ratelimit.h>
  41 #include <linux/mount.h>
  42 #include "compat.h"
  43 #include "ctree.h"
  44 #include "disk-io.h"
  45 #include "transaction.h"
  46 #include "btrfs_inode.h"
  47 #include "ioctl.h"
  48 #include "print-tree.h"
  49 #include "ordered-data.h"
  50 #include "xattr.h"
  51 #include "tree-log.h"
  52 #include "volumes.h"
  53 #include "compression.h"
  54 #include "locking.h"
  55 #include "free-space-cache.h"
  56 #include "inode-map.h"
  57
  58 struct btrfs_iget_args {
  59         u64 ino;
  60         struct btrfs_root *root;
  61 };
  62
  63 static const struct inode_operations btrfs_dir_inode_operations;
  64 static const struct inode_operations btrfs_symlink_inode_operations;
  65 static const struct inode_operations btrfs_dir_ro_inode_operations;
  66 static const struct inode_operations btrfs_special_inode_operations;
  67 static const struct inode_operations btrfs_file_inode_operations;
  68 static const struct address_space_operations btrfs_aops;
  69 static const struct address_space_operations btrfs_symlink_aops;
  70 static const struct file_operations btrfs_dir_file_operations;
  71 static struct extent_io_ops btrfs_extent_io_ops;
  72
  73 static struct kmem_cache *btrfs_inode_cachep;
  74 static struct kmem_cache *btrfs_delalloc_work_cachep;
  75 struct kmem_cache *btrfs_trans_handle_cachep;
  76 struct kmem_cache *btrfs_transaction_cachep;
  77 struct kmem_cache *btrfs_path_cachep;
  78 struct kmem_cache *btrfs_free_space_cachep;
  79
  80 #define S_SHIFT 12
  81 static unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = {
  82         [S_IFREG >> S_SHIFT]    = BTRFS_FT_REG_FILE,
  83         [S_IFDIR >> S_SHIFT]    = BTRFS_FT_DIR,
  84         [S_IFCHR >> S_SHIFT]    = BTRFS_FT_CHRDEV,
  85         [S_IFBLK >> S_SHIFT]    = BTRFS_FT_BLKDEV,
  86         [S_IFIFO >> S_SHIFT]    = BTRFS_FT_FIFO,
  87         [S_IFSOCK >> S_SHIFT]   = BTRFS_FT_SOCK,
  88         [S_IFLNK >> S_SHIFT]    = BTRFS_FT_SYMLINK,
  89 };
  90
  91 static int btrfs_setsize(struct inode *inode, loff_t newsize);
  92 static int btrfs_truncate(struct inode *inode);
  93 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent);
  94 static noinline int cow_file_range(struct inode *inode,
  95                                    struct page *locked_page,
  96                                    u64 start, u64 end, int *page_started,
  97                                    unsigned long *nr_written, int unlock);
  98 static struct extent_map *create_pinned_em(struct inode *inode, u64 start,
  99                                            u64 len, u64 orig_start,
 100                                            u64 block_start, u64 block_len,
 101                                            u64 orig_block_len, int type);
 102
 103 static int btrfs_init_inode_security(struct btrfs_trans_handle *trans,
 104                                      struct inode *inode,  struct inode *dir,
 105                                      const struct qstr *qstr)
 106 {
 107         int err;
 108
 109         err = btrfs_init_acl(trans, inode, dir);
 110         if (!err)
 111                 err = btrfs_xattr_security_init(trans, inode, dir, qstr);
 112         return err;
 113 }
 114
 115 /*
 116  * this does all the hard work for inserting an inline extent into
 117  * the btree.  The caller should have done a btrfs_drop_extents so that
 118  * no overlapping inline items exist in the btree
 119  */
 120 static noinline int insert_inline_extent(struct btrfs_trans_handle *trans,
 121                                 struct btrfs_root *root, struct inode *inode,
 122                                 u64 start, size_t size, size_t compressed_size,
 123                                 int compress_type,
 124                                 struct page **compressed_pages)
 125 {
 126         struct btrfs_key key;
 127         struct btrfs_path *path;
 128         struct extent_buffer *leaf;
 129         struct page *page = NULL;
 130         char *kaddr;
 131         unsigned long ptr;
 132         struct btrfs_file_extent_item *ei;
 133         int err = 0;
 134         int ret;
 135         size_t cur_size = size;
 136         size_t datasize;
 137         unsigned long offset;
 138
 139         if (compressed_size && compressed_pages)
 140                 cur_size = compressed_size;
 141
 142         path = btrfs_alloc_path();
 143         if (!path)
 144                 return -ENOMEM;
 145
 146         path->leave_spinning = 1;
 147
 148         key.objectid = btrfs_ino(inode);
 149         key.offset = start;
 150         btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY);
 151         datasize = btrfs_file_extent_calc_inline_size(cur_size);
 152
 153         inode_add_bytes(inode, size);
 154         ret = btrfs_insert_empty_item(trans, root, path, &key,
 155                                       datasize);
 156         if (ret) {
 157                 err = ret;
 158                 goto fail;
 159         }
 160         leaf = path->nodes[0];
 161         ei = btrfs_item_ptr(leaf, path->slots[0],
 162                             struct btrfs_file_extent_item);
 163         btrfs_set_file_extent_generation(leaf, ei, trans->transid);
 164         btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
 165         btrfs_set_file_extent_encryption(leaf, ei, 0);
 166         btrfs_set_file_extent_other_encoding(leaf, ei, 0);
 167         btrfs_set_file_extent_ram_bytes(leaf, ei, size);
 168         ptr = btrfs_file_extent_inline_start(ei);
 169
 170         if (compress_type != BTRFS_COMPRESS_NONE) {
 171                 struct page *cpage;
 172                 int i = 0;
 173                 while (compressed_size > 0) {
 174                         cpage = compressed_pages[i];
 175                         cur_size = min_t(unsigned long, compressed_size,
 176                                        PAGE_CACHE_SIZE);
 177
 178                         kaddr = kmap_atomic(cpage);
 179                         write_extent_buffer(leaf, kaddr, ptr, cur_size);
 180                         kunmap_atomic(kaddr);
 181
 182                         i++;
 183                         ptr += cur_size;
 184                         compressed_size -= cur_size;
 185                 }
 186                 btrfs_set_file_extent_compression(leaf, ei,
 187                                                   compress_type);
 188         } else {
 189                 page = find_get_page(inode->i_mapping,
 190                                      start >> PAGE_CACHE_SHIFT);
 191                 btrfs_set_file_extent_compression(leaf, ei, 0);
 192                 kaddr = kmap_atomic(page);
 193                 offset = start & (PAGE_CACHE_SIZE - 1);
 194                 write_extent_buffer(leaf, kaddr + offset, ptr, size);
 195                 kunmap_atomic(kaddr);
 196                 page_cache_release(page);
 197         }
 198         btrfs_mark_buffer_dirty(leaf);
 199         btrfs_free_path(path);
 200
 201         /*
 202          * we're an inline extent, so nobody can
 203          * extend the file past i_size without locking
 204          * a page we already have locked.
 205          *
 206          * We must do any isize and inode updates
 207          * before we unlock the pages.  Otherwise we
 208          * could end up racing with unlink.
 209          */
 210         BTRFS_I(inode)->disk_i_size = inode->i_size;
 211         ret = btrfs_update_inode(trans, root, inode);
 212
 213         return ret;
 214 fail:
 215         btrfs_free_path(path);
 216         return err;
 217 }
 218
 219
 220 /*
 221  * conditionally insert an inline extent into the file.  This
 222  * does the checks required to make sure the data is small enough
 223  * to fit as an inline extent.
 224  */
 225 static noinline int cow_file_range_inline(struct btrfs_trans_handle *trans,
 226                                  struct btrfs_root *root,
 227                                  struct inode *inode, u64 start, u64 end,
 228                                  size_t compressed_size, int compress_type,
 229                                  struct page **compressed_pages)
 230 {
 231         u64 isize = i_size_read(inode);
 232         u64 actual_end = min(end + 1, isize);
 233         u64 inline_len = actual_end - start;
 234         u64 aligned_end = (end + root->sectorsize - 1) &
 235                         ~((u64)root->sectorsize - 1);
 236         u64 data_len = inline_len;
 237         int ret;
 238
 239         if (compressed_size)
 240                 data_len = compressed_size;
 241
 242         if (start > 0 ||
 243             actual_end >= PAGE_CACHE_SIZE ||
 244             data_len >= BTRFS_MAX_INLINE_DATA_SIZE(root) ||
 245             (!compressed_size &&
 246             (actual_end & (root->sectorsize - 1)) == 0) ||
 247             end + 1 < isize ||
 248             data_len > root->fs_info->max_inline) {
 249                 return 1;
 250         }
 251
 252         ret = btrfs_drop_extents(trans, root, inode, start, aligned_end, 1);
 253         if (ret)
 254                 return ret;
 255
 256         if (isize > actual_end)
 257                 inline_len = min_t(u64, isize, actual_end);
 258         ret = insert_inline_extent(trans, root, inode, start,
 259                                    inline_len, compressed_size,
 260                                    compress_type, compressed_pages);
 261         if (ret && ret != -ENOSPC) {
 262                 btrfs_abort_transaction(trans, root, ret);
 263                 return ret;
 264         } else if (ret == -ENOSPC) {
 265                 return 1;
 266         }
 267
 268         btrfs_delalloc_release_metadata(inode, end + 1 - start);
 269         btrfs_drop_extent_cache(inode, start, aligned_end - 1, 0);
 270         return 0;
 271 }
 272
 273 struct async_extent {
 274         u64 start;
 275         u64 ram_size;
 276         u64 compressed_size;
 277         struct page **pages;
 278         unsigned long nr_pages;
 279         int compress_type;
 280         struct list_head list;
 281 };
 282
 283 struct async_cow {
 284         struct inode *inode;
 285         struct btrfs_root *root;
 286         struct page *locked_page;
 287         u64 start;
 288         u64 end;
 289         struct list_head extents;
 290         struct btrfs_work work;
 291 };
 292
 293 static noinline int add_async_extent(struct async_cow *cow,
 294                                      u64 start, u64 ram_size,
 295                                      u64 compressed_size,
 296                                      struct page **pages,
 297                                      unsigned long nr_pages,
 298                                      int compress_type)
 299 {
 300         struct async_extent *async_extent;
 301
 302         async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS);
 303         BUG_ON(!async_extent); /* -ENOMEM */
 304         async_extent->start = start;
 305         async_extent->ram_size = ram_size;
 306         async_extent->compressed_size = compressed_size;
 307         async_extent->pages = pages;
 308         async_extent->nr_pages = nr_pages;
 309         async_extent->compress_type = compress_type;
 310         list_add_tail(&async_extent->list, &cow->extents);
 311         return 0;
 312 }
 313
 314 /*
 315  * we create compressed extents in two phases.  The first
 316  * phase compresses a range of pages that have already been
 317  * locked (both pages and state bits are locked).
 318  *
 319  * This is done inside an ordered work queue, and the compression
 320  * is spread across many cpus.  The actual IO submission is step
 321  * two, and the ordered work queue takes care of making sure that
 322  * happens in the same order things were put onto the queue by
 323  * writepages and friends.
 324  *
 325  * If this code finds it can't get good compression, it puts an
 326  * entry onto the work queue to write the uncompressed bytes.  This
 327  * makes sure that both compressed inodes and uncompressed inodes
 328  * are written in the same order that the flusher thread sent them
 329  * down.
 330  */
 331 static noinline int compress_file_range(struct inode *inode,
 332                                         struct page *locked_page,
 333                                         u64 start, u64 end,
 334                                         struct async_cow *async_cow,
 335                                         int *num_added)
 336 {
 337         struct btrfs_root *root = BTRFS_I(inode)->root;
 338         struct btrfs_trans_handle *trans;
 339         u64 num_bytes;
 340         u64 blocksize = root->sectorsize;
 341         u64 actual_end;
 342         u64 isize = i_size_read(inode);
 343         int ret = 0;
 344         struct page **pages = NULL;
 345         unsigned long nr_pages;
 346         unsigned long nr_pages_ret = 0;
 347         unsigned long total_compressed = 0;
 348         unsigned long total_in = 0;
 349         unsigned long max_compressed = 128 * 1024;
 350         unsigned long max_uncompressed = 128 * 1024;
 351         int i;
 352         int will_compress;
 353         int compress_type = root->fs_info->compress_type;
 354
 355         /* if this is a small write inside eof, kick off a defrag */
 356         if ((end - start + 1) < 16 * 1024 &&
 357             (start > 0 || end + 1 < BTRFS_I(inode)->disk_i_size))
 358                 btrfs_add_inode_defrag(NULL, inode);
 359
 360         actual_end = min_t(u64, isize, end + 1);
 361 again:
 362         will_compress = 0;
 363         nr_pages = (end >> PAGE_CACHE_SHIFT) - (start >> PAGE_CACHE_SHIFT) + 1;
 364         nr_pages = min(nr_pages, (128 * 1024UL) / PAGE_CACHE_SIZE);
 365
 366         /*
 367          * we don't want to send crud past the end of i_size through
 368          * compression, that's just a waste of CPU time.  So, if the
 369          * end of the file is before the start of our current
 370          * requested range of bytes, we bail out to the uncompressed
 371          * cleanup code that can deal with all of this.
 372          *
 373          * It isn't really the fastest way to fix things, but this is a
 374          * very uncommon corner.
 375          */
 376         if (actual_end <= start)
 377                 goto cleanup_and_bail_uncompressed;
 378
 379         total_compressed = actual_end - start;
 380
 381         /* we want to make sure that amount of ram required to uncompress
 382          * an extent is reasonable, so we limit the total size in ram
 383          * of a compressed extent to 128k.  This is a crucial number
 384          * because it also controls how easily we can spread reads across
 385          * cpus for decompression.
 386          *
 387          * We also want to make sure the amount of IO required to do
 388          * a random read is reasonably small, so we limit the size of
 389          * a compressed extent to 128k.
 390          */
 391         total_compressed = min(total_compressed, max_uncompressed);
 392         num_bytes = (end - start + blocksize) & ~(blocksize - 1);
 393         num_bytes = max(blocksize,  num_bytes);
 394         total_in = 0;
 395         ret = 0;
 396
 397         /*
 398          * we do compression for mount -o compress and when the
 399          * inode has not been flagged as nocompress.  This flag can
 400          * change at any time if we discover bad compression ratios.
 401          */
 402         if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS) &&
 403             (btrfs_test_opt(root, COMPRESS) ||
 404              (BTRFS_I(inode)->force_compress) ||
 405              (BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS))) {
 406                 WARN_ON(pages);
 407                 pages = kzalloc(sizeof(struct page *) * nr_pages, GFP_NOFS);
 408                 if (!pages) {
 409                         /* just bail out to the uncompressed code */
 410                         goto cont;
 411                 }
 412
 413                 if (BTRFS_I(inode)->force_compress)
 414                         compress_type = BTRFS_I(inode)->force_compress;
 415
 416                 ret = btrfs_compress_pages(compress_type,
 417                                            inode->i_mapping, start,
 418                                            total_compressed, pages,
 419                                            nr_pages, &nr_pages_ret,
 420                                            &total_in,
 421                                            &total_compressed,
 422                                            max_compressed);
 423
 424                 if (!ret) {
 425                         unsigned long offset = total_compressed &
 426                                 (PAGE_CACHE_SIZE - 1);
 427                         struct page *page = pages[nr_pages_ret - 1];
 428                         char *kaddr;
 429
 430                         /* zero the tail end of the last page, we might be
 431                          * sending it down to disk
 432                          */
 433                         if (offset) {
 434                                 kaddr = kmap_atomic(page);
 435                                 memset(kaddr + offset, 0,
 436                                        PAGE_CACHE_SIZE - offset);
 437                                 kunmap_atomic(kaddr);
 438                         }
 439                         will_compress = 1;
 440                 }
 441         }
 442 cont:
 443         if (start == 0) {
 444                 trans = btrfs_join_transaction(root);
 445                 if (IS_ERR(trans)) {
 446                         ret = PTR_ERR(trans);
 447                         trans = NULL;
 448                         goto cleanup_and_out;
 449                 }
 450                 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
 451
 452                 /* lets try to make an inline extent */
 453                 if (ret || total_in < (actual_end - start)) {
 454                         /* we didn't compress the entire range, try
 455                          * to make an uncompressed inline extent.
 456                          */
 457                         ret = cow_file_range_inline(trans, root, inode,
 458                                                     start, end, 0, 0, NULL);
 459                 } else {
 460                         /* try making a compressed inline extent */
 461                         ret = cow_file_range_inline(trans, root, inode,
 462                                                     start, end,
 463                                                     total_compressed,
 464                                                     compress_type, pages);
 465                 }
 466                 if (ret <= 0) {
 467                         /*
 468                          * inline extent creation worked or returned error,
 469                          * we don't need to create any more async work items.
 470                          * Unlock and free up our temp pages.
 471                          */
 472                         extent_clear_unlock_delalloc(inode,
 473                              &BTRFS_I(inode)->io_tree,
 474                              start, end, NULL,
 475                              EXTENT_CLEAR_UNLOCK_PAGE | EXTENT_CLEAR_DIRTY |
 476                              EXTENT_CLEAR_DELALLOC |
 477                              EXTENT_SET_WRITEBACK | EXTENT_END_WRITEBACK);
 478
 479                         btrfs_end_transaction(trans, root);
 480                         goto free_pages_out;
 481                 }
 482                 btrfs_end_transaction(trans, root);
 483         }
 484
 485         if (will_compress) {
 486                 /*
 487                  * we aren't doing an inline extent round the compressed size
 488                  * up to a block size boundary so the allocator does sane
 489                  * things
 490                  */
 491                 total_compressed = (total_compressed + blocksize - 1) &
 492                         ~(blocksize - 1);
 493
 494                 /*
 495                  * one last check to make sure the compression is really a
 496                  * win, compare the page count read with the blocks on disk
 497                  */
 498                 total_in = (total_in + PAGE_CACHE_SIZE - 1) &
 499                         ~(PAGE_CACHE_SIZE - 1);
 500                 if (total_compressed >= total_in) {
 501                         will_compress = 0;
 502                 } else {
 503                         num_bytes = total_in;
 504                 }
 505         }
 506         if (!will_compress && pages) {
 507                 /*
 508                  * the compression code ran but failed to make things smaller,
 509                  * free any pages it allocated and our page pointer array
 510                  */
 511                 for (i = 0; i < nr_pages_ret; i++) {
 512                         WARN_ON(pages[i]->mapping);
 513                         page_cache_release(pages[i]);
 514                 }
 515                 kfree(pages);
 516                 pages = NULL;
 517                 total_compressed = 0;
 518                 nr_pages_ret = 0;
 519
 520                 /* flag the file so we don't compress in the future */
 521                 if (!btrfs_test_opt(root, FORCE_COMPRESS) &&
 522                     !(BTRFS_I(inode)->force_compress)) {
 523                         BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
 524                 }
 525         }
 526         if (will_compress) {
 527                 *num_added += 1;
 528
 529                 /* the async work queues will take care of doing actual
 530                  * allocation on disk for these compressed pages,
 531                  * and will submit them to the elevator.
 532                  */
 533                 add_async_extent(async_cow, start, num_bytes,
 534                                  total_compressed, pages, nr_pages_ret,
 535                                  compress_type);
 536
 537                 if (start + num_bytes < end) {
 538                         start += num_bytes;
 539                         pages = NULL;
 540                         cond_resched();
 541                         goto again;
 542                 }
 543         } else {
 544 cleanup_and_bail_uncompressed:
 545                 /*
 546                  * No compression, but we still need to write the pages in
 547                  * the file we've been given so far.  redirty the locked
 548                  * page if it corresponds to our extent and set things up
 549                  * for the async work queue to run cow_file_range to do
 550                  * the normal delalloc dance
 551                  */
 552                 if (page_offset(locked_page) >= start &&
 553                     page_offset(locked_page) <= end) {
 554                         __set_page_dirty_nobuffers(locked_page);
 555                         /* unlocked later on in the async handlers */
 556                 }
 557                 add_async_extent(async_cow, start, end - start + 1,
 558                                  0, NULL, 0, BTRFS_COMPRESS_NONE);
 559                 *num_added += 1;
 560         }
 561
 562 out:
 563         return ret;
 564
 565 free_pages_out:
 566         for (i = 0; i < nr_pages_ret; i++) {
 567                 WARN_ON(pages[i]->mapping);
 568                 page_cache_release(pages[i]);
 569         }
 570         kfree(pages);
 571
 572         goto out;
 573
 574 cleanup_and_out:
 575         extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree,
 576                                      start, end, NULL,
 577                                      EXTENT_CLEAR_UNLOCK_PAGE |
 578                                      EXTENT_CLEAR_DIRTY |
 579                                      EXTENT_CLEAR_DELALLOC |
 580                                      EXTENT_SET_WRITEBACK |
 581                                      EXTENT_END_WRITEBACK);
 582         if (!trans || IS_ERR(trans))
 583                 btrfs_error(root->fs_info, ret, "Failed to join transaction");
 584         else
 585                 btrfs_abort_transaction(trans, root, ret);
 586         goto free_pages_out;
 587 }
 588
 589 /*
 590  * phase two of compressed writeback.  This is the ordered portion
 591  * of the code, which only gets called in the order the work was
 592  * queued.  We walk all the async extents created by compress_file_range
 593  * and send them down to the disk.
 594  */
 595 static noinline int submit_compressed_extents(struct inode *inode,
 596                                               struct async_cow *async_cow)
 597 {
 598         struct async_extent *async_extent;
 599         u64 alloc_hint = 0;
 600         struct btrfs_trans_handle *trans;
 601         struct btrfs_key ins;
 602         struct extent_map *em;
 603         struct btrfs_root *root = BTRFS_I(inode)->root;
 604         struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
 605         struct extent_io_tree *io_tree;
 606         int ret = 0;
 607
 608         if (list_empty(&async_cow->extents))
 609                 return 0;
 610
 611
 612         while (!list_empty(&async_cow->extents)) {
 613                 async_extent = list_entry(async_cow->extents.next,
 614                                           struct async_extent, list);
 615                 list_del(&async_extent->list);
 616
 617                 io_tree = &BTRFS_I(inode)->io_tree;
 618
 619 retry:
 620                 /* did the compression code fall back to uncompressed IO? */
 621                 if (!async_extent->pages) {
 622                         int page_started = 0;
 623                         unsigned long nr_written = 0;
 624
 625                         lock_extent(io_tree, async_extent->start,
 626                                          async_extent->start +
 627                                          async_extent->ram_size - 1);
 628
 629                         /* allocate blocks */
 630                         ret = cow_file_range(inode, async_cow->locked_page,
 631                                              async_extent->start,
 632                                              async_extent->start +
 633                                              async_extent->ram_size - 1,
 634                                              &page_started, &nr_written, 0);
 635
 636                         /* JDM XXX */
 637
 638                         /*
 639                          * if page_started, cow_file_range inserted an
 640                          * inline extent and took care of all the unlocking
 641                          * and IO for us.  Otherwise, we need to submit
 642                          * all those pages down to the drive.
 643                          */
 644                         if (!page_started && !ret)
 645                                 extent_write_locked_range(io_tree,
 646                                                   inode, async_extent->start,
 647                                                   async_extent->start +
 648                                                   async_extent->ram_size - 1,
 649                                                   btrfs_get_extent,
 650                                                   WB_SYNC_ALL);
 651                         kfree(async_extent);
 652                         cond_resched();
 653                         continue;
 654                 }
 655
 656                 lock_extent(io_tree, async_extent->start,
 657                             async_extent->start + async_extent->ram_size - 1);
 658
 659                 trans = btrfs_join_transaction(root);
 660                 if (IS_ERR(trans)) {
 661                         ret = PTR_ERR(trans);
 662                 } else {
 663                         trans->block_rsv = &root->fs_info->delalloc_block_rsv;
 664                         ret = btrfs_reserve_extent(trans, root,
 665                                            async_extent->compressed_size,
 666                                            async_extent->compressed_size,
 667                                            0, alloc_hint, &ins, 1);
 668                         if (ret && ret != -ENOSPC)
 669                                 btrfs_abort_transaction(trans, root, ret);
 670                         btrfs_end_transaction(trans, root);
 671                 }
 672
 673                 if (ret) {
 674                         int i;
 675                         for (i = 0; i < async_extent->nr_pages; i++) {
 676                                 WARN_ON(async_extent->pages[i]->mapping);
 677                                 page_cache_release(async_extent->pages[i]);
 678                         }
 679                         kfree(async_extent->pages);
 680                         async_extent->nr_pages = 0;
 681                         async_extent->pages = NULL;
 682                         unlock_extent(io_tree, async_extent->start,
 683                                       async_extent->start +
 684                                       async_extent->ram_size - 1);
 685                         if (ret == -ENOSPC)
 686                                 goto retry;
 687                         goto out_free; /* JDM: Requeue? */
 688                 }
 689
 690                 /*
 691                  * here we're doing allocation and writeback of the
 692                  * compressed pages
 693                  */
 694                 btrfs_drop_extent_cache(inode, async_extent->start,
 695                                         async_extent->start +
 696                                         async_extent->ram_size - 1, 0);
 697
 698                 em = alloc_extent_map();
 699                 BUG_ON(!em); /* -ENOMEM */
 700                 em->start = async_extent->start;
 701                 em->len = async_extent->ram_size;
 702                 em->orig_start = em->start;
 703
 704                 em->block_start = ins.objectid;
 705                 em->block_len = ins.offset;
 706                 em->orig_block_len = ins.offset;
 707                 em->bdev = root->fs_info->fs_devices->latest_bdev;
 708                 em->compress_type = async_extent->compress_type;
 709                 set_bit(EXTENT_FLAG_PINNED, &em->flags);
 710                 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
 711                 em->generation = -1;
 712
 713                 while (1) {
 714                         write_lock(&em_tree->lock);
 715                         ret = add_extent_mapping(em_tree, em);
 716                         if (!ret)
 717                                 list_move(&em->list,
 718                                           &em_tree->modified_extents);
 719                         write_unlock(&em_tree->lock);
 720                         if (ret != -EEXIST) {
 721                                 free_extent_map(em);
 722                                 break;
 723                         }
 724                         btrfs_drop_extent_cache(inode, async_extent->start,
 725                                                 async_extent->start +
 726                                                 async_extent->ram_size - 1, 0);
 727                 }
 728
 729                 ret = btrfs_add_ordered_extent_compress(inode,
 730                                                 async_extent->start,
 731                                                 ins.objectid,
 732                                                 async_extent->ram_size,
 733                                                 ins.offset,
 734                                                 BTRFS_ORDERED_COMPRESSED,
 735                                                 async_extent->compress_type);
 736                 BUG_ON(ret); /* -ENOMEM */
 737
 738                 /*
 739                  * clear dirty, set writeback and unlock the pages.
 740                  */
 741                 extent_clear_unlock_delalloc(inode,
 742                                 &BTRFS_I(inode)->io_tree,
 743                                 async_extent->start,
 744                                 async_extent->start +
 745                                 async_extent->ram_size - 1,
 746                                 NULL, EXTENT_CLEAR_UNLOCK_PAGE |
 747                                 EXTENT_CLEAR_UNLOCK |
 748                                 EXTENT_CLEAR_DELALLOC |
 749                                 EXTENT_CLEAR_DIRTY | EXTENT_SET_WRITEBACK);
 750
 751                 ret = btrfs_submit_compressed_write(inode,
 752                                     async_extent->start,
 753                                     async_extent->ram_size,
 754                                     ins.objectid,
 755                                     ins.offset, async_extent->pages,
 756                                     async_extent->nr_pages);
 757
 758                 BUG_ON(ret); /* -ENOMEM */
 759                 alloc_hint = ins.objectid + ins.offset;
 760                 kfree(async_extent);
 761                 cond_resched();
 762         }
 763         ret = 0;
 764 out:
 765         return ret;
 766 out_free:
 767         kfree(async_extent);
 768         goto out;
 769 }
 770
 771 static u64 get_extent_allocation_hint(struct inode *inode, u64 start,
 772                                       u64 num_bytes)
 773 {
 774         struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
 775         struct extent_map *em;
 776         u64 alloc_hint = 0;
 777
 778         read_lock(&em_tree->lock);
 779         em = search_extent_mapping(em_tree, start, num_bytes);
 780         if (em) {
 781                 /*
 782                  * if block start isn't an actual block number then find the
 783                  * first block in this inode and use that as a hint.  If that
 784                  * block is also bogus then just don't worry about it.
 785                  */
 786                 if (em->block_start >= EXTENT_MAP_LAST_BYTE) {
 787                         free_extent_map(em);
 788                         em = search_extent_mapping(em_tree, 0, 0);
 789                         if (em && em->block_start < EXTENT_MAP_LAST_BYTE)
 790                                 alloc_hint = em->block_start;
 791                         if (em)
 792                                 free_extent_map(em);
 793                 } else {
 794                         alloc_hint = em->block_start;
 795                         free_extent_map(em);
 796                 }
 797         }
 798         read_unlock(&em_tree->lock);
 799
 800         return alloc_hint;
 801 }
 802
 803 /*
 804  * when extent_io.c finds a delayed allocation range in the file,
 805  * the call backs end up in this code.  The basic idea is to
 806  * allocate extents on disk for the range, and create ordered data structs
 807  * in ram to track those extents.
 808  *
 809  * locked_page is the page that writepage had locked already.  We use
 810  * it to make sure we don't do extra locks or unlocks.
 811  *
 812  * *page_started is set to one if we unlock locked_page and do everything
 813  * required to start IO on it.  It may be clean and already done with
 814  * IO when we return.
 815  */
 816 static noinline int __cow_file_range(struct btrfs_trans_handle *trans,
 817                                      struct inode *inode,
 818                                      struct btrfs_root *root,
 819                                      struct page *locked_page,
 820                                      u64 start, u64 end, int *page_started,
 821                                      unsigned long *nr_written,
 822                                      int unlock)
 823 {
 824         u64 alloc_hint = 0;
 825         u64 num_bytes;
 826         unsigned long ram_size;
 827         u64 disk_num_bytes;
 828         u64 cur_alloc_size;
 829         u64 blocksize = root->sectorsize;
 830         struct btrfs_key ins;
 831         struct extent_map *em;
 832         struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
 833         int ret = 0;
 834
 835         BUG_ON(btrfs_is_free_space_inode(inode));
 836
 837         num_bytes = (end - start + blocksize) & ~(blocksize - 1);
 838         num_bytes = max(blocksize,  num_bytes);
 839         disk_num_bytes = num_bytes;
 840
 841         /* if this is a small write inside eof, kick off defrag */
 842         if (num_bytes < 64 * 1024 &&
 843             (start > 0 || end + 1 < BTRFS_I(inode)->disk_i_size))
 844                 btrfs_add_inode_defrag(trans, inode);
 845
 846         if (start == 0) {
 847                 /* lets try to make an inline extent */
 848                 ret = cow_file_range_inline(trans, root, inode,
 849                                             start, end, 0, 0, NULL);
 850                 if (ret == 0) {
 851                         extent_clear_unlock_delalloc(inode,
 852                                      &BTRFS_I(inode)->io_tree,
 853                                      start, end, NULL,
 854                                      EXTENT_CLEAR_UNLOCK_PAGE |
 855                                      EXTENT_CLEAR_UNLOCK |
 856                                      EXTENT_CLEAR_DELALLOC |
 857                                      EXTENT_CLEAR_DIRTY |
 858                                      EXTENT_SET_WRITEBACK |
 859                                      EXTENT_END_WRITEBACK);
 860
 861                         *nr_written = *nr_written +
 862                              (end - start + PAGE_CACHE_SIZE) / PAGE_CACHE_SIZE;
 863                         *page_started = 1;
 864                         goto out;
 865                 } else if (ret < 0) {
 866                         btrfs_abort_transaction(trans, root, ret);
 867                         goto out_unlock;
 868                 }
 869         }
 870
 871         BUG_ON(disk_num_bytes >
 872                btrfs_super_total_bytes(root->fs_info->super_copy));
 873
 874         alloc_hint = get_extent_allocation_hint(inode, start, num_bytes);
 875         btrfs_drop_extent_cache(inode, start, start + num_bytes - 1, 0);
 876
 877         while (disk_num_bytes > 0) {
 878                 unsigned long op;
 879
 880                 cur_alloc_size = disk_num_bytes;
 881                 ret = btrfs_reserve_extent(trans, root, cur_alloc_size,
 882                                            root->sectorsize, 0, alloc_hint,
 883                                            &ins, 1);
 884                 if (ret < 0) {
 885                         btrfs_abort_transaction(trans, root, ret);
 886                         goto out_unlock;
 887                 }
 888
 889                 em = alloc_extent_map();
 890                 BUG_ON(!em); /* -ENOMEM */
 891                 em->start = start;
 892                 em->orig_start = em->start;
 893                 ram_size = ins.offset;
 894                 em->len = ins.offset;
 895
 896                 em->block_start = ins.objectid;
 897                 em->block_len = ins.offset;
 898                 em->orig_block_len = ins.offset;
 899                 em->bdev = root->fs_info->fs_devices->latest_bdev;
 900                 set_bit(EXTENT_FLAG_PINNED, &em->flags);
 901                 em->generation = -1;
 902
 903                 while (1) {
 904                         write_lock(&em_tree->lock);
 905                         ret = add_extent_mapping(em_tree, em);
 906                         if (!ret)
 907                                 list_move(&em->list,
 908                                           &em_tree->modified_extents);
 909                         write_unlock(&em_tree->lock);
 910                         if (ret != -EEXIST) {
 911                                 free_extent_map(em);
 912                                 break;
 913                         }
 914                         btrfs_drop_extent_cache(inode, start,
 915                                                 start + ram_size - 1, 0);
 916                 }
 917
 918                 cur_alloc_size = ins.offset;
 919                 ret = btrfs_add_ordered_extent(inode, start, ins.objectid,
 920                                                ram_size, cur_alloc_size, 0);
 921                 BUG_ON(ret); /* -ENOMEM */
 922
 923                 if (root->root_key.objectid ==
 924                     BTRFS_DATA_RELOC_TREE_OBJECTID) {
 925                         ret = btrfs_reloc_clone_csums(inode, start,
 926                                                       cur_alloc_size);
 927                         if (ret) {
 928                                 btrfs_abort_transaction(trans, root, ret);
 929                                 goto out_unlock;
 930                         }
 931                 }
 932
 933                 if (disk_num_bytes < cur_alloc_size)
 934                         break;
 935
 936                 /* we're not doing compressed IO, don't unlock the first
 937                  * page (which the caller expects to stay locked), don't
 938                  * clear any dirty bits and don't set any writeback bits
 939                  *
 940                  * Do set the Private2 bit so we know this page was properly
 941                  * setup for writepage
 942                  */
 943                 op = unlock ? EXTENT_CLEAR_UNLOCK_PAGE : 0;
 944                 op |= EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC |
 945                         EXTENT_SET_PRIVATE2;
 946
 947                 extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree,
 948                                              start, start + ram_size - 1,
 949                                              locked_page, op);
 950                 disk_num_bytes -= cur_alloc_size;
 951                 num_bytes -= cur_alloc_size;
 952                 alloc_hint = ins.objectid + ins.offset;
 953                 start += cur_alloc_size;
 954         }
 955 out:
 956         return ret;
 957
 958 out_unlock:
 959         extent_clear_unlock_delalloc(inode,
 960                      &BTRFS_I(inode)->io_tree,
 961                      start, end, locked_page,
 962                      EXTENT_CLEAR_UNLOCK_PAGE |
 963                      EXTENT_CLEAR_UNLOCK |
 964                      EXTENT_CLEAR_DELALLOC |
 965                      EXTENT_CLEAR_DIRTY |
 966                      EXTENT_SET_WRITEBACK |
 967                      EXTENT_END_WRITEBACK);
 968
 969         goto out;
 970 }
 971
 972 static noinline int cow_file_range(struct inode *inode,
 973                                    struct page *locked_page,
 974                                    u64 start, u64 end, int *page_started,
 975                                    unsigned long *nr_written,
 976                                    int unlock)
 977 {
 978         struct btrfs_trans_handle *trans;
 979         struct btrfs_root *root = BTRFS_I(inode)->root;
 980         int ret;
 981
 982         trans = btrfs_join_transaction(root);
 983         if (IS_ERR(trans)) {
 984                 extent_clear_unlock_delalloc(inode,
 985                              &BTRFS_I(inode)->io_tree,
 986                              start, end, locked_page,
 987                              EXTENT_CLEAR_UNLOCK_PAGE |
 988                              EXTENT_CLEAR_UNLOCK |
 989                              EXTENT_CLEAR_DELALLOC |
 990                              EXTENT_CLEAR_DIRTY |
 991                              EXTENT_SET_WRITEBACK |
 992                              EXTENT_END_WRITEBACK);
 993                 return PTR_ERR(trans);
 994         }
 995         trans->block_rsv = &root->fs_info->delalloc_block_rsv;
 996
 997         ret = __cow_file_range(trans, inode, root, locked_page, start, end,
 998                                page_started, nr_written, unlock);
 999
1000         btrfs_end_transaction(trans, root);
1001
1002         return ret;
1003 }
1004
1005 /*
1006  * work queue call back to started compression on a file and pages
1007  */
1008 static noinline void async_cow_start(struct btrfs_work *work)
1009 {
1010         struct async_cow *async_cow;
1011         int num_added = 0;
1012         async_cow = container_of(work, struct async_cow, work);
1013
1014         compress_file_range(async_cow->inode, async_cow->locked_page,
1015                             async_cow->start, async_cow->end, async_cow,
1016                             &num_added);
1017         if (num_added == 0) {
1018                 btrfs_add_delayed_iput(async_cow->inode);
1019                 async_cow->inode = NULL;
1020         }
1021 }
1022
1023 /*
1024  * work queue call back to submit previously compressed pages
1025  */
1026 static noinline void async_cow_submit(struct btrfs_work *work)
1027 {
1028         struct async_cow *async_cow;
1029         struct btrfs_root *root;
1030         unsigned long nr_pages;
1031
1032         async_cow = container_of(work, struct async_cow, work);
1033
1034         root = async_cow->root;
1035         nr_pages = (async_cow->end - async_cow->start + PAGE_CACHE_SIZE) >>
1036                 PAGE_CACHE_SHIFT;
1037
1038         if (atomic_sub_return(nr_pages, &root->fs_info->async_delalloc_pages) <
1039             5 * 1024 * 1024 &&
1040             waitqueue_active(&root->fs_info->async_submit_wait))
1041                 wake_up(&root->fs_info->async_submit_wait);
1042
1043         if (async_cow->inode)
1044                 submit_compressed_extents(async_cow->inode, async_cow);
1045 }
1046
1047 static noinline void async_cow_free(struct btrfs_work *work)
1048 {
1049         struct async_cow *async_cow;
1050         async_cow = container_of(work, struct async_cow, work);
1051         if (async_cow->inode)
1052                 btrfs_add_delayed_iput(async_cow->inode);
1053         kfree(async_cow);
1054 }
1055
1056 static int cow_file_range_async(struct inode *inode, struct page *locked_page,
1057                                 u64 start, u64 end, int *page_started,
1058                                 unsigned long *nr_written)
1059 {
1060         struct async_cow *async_cow;
1061         struct btrfs_root *root = BTRFS_I(inode)->root;
1062         unsigned long nr_pages;
1063         u64 cur_end;
1064         int limit = 10 * 1024 * 1024;
1065
1066         clear_extent_bit(&BTRFS_I(inode)->io_tree, start, end, EXTENT_LOCKED,
1067                          1, 0, NULL, GFP_NOFS);
1068         while (start < end) {
1069                 async_cow = kmalloc(sizeof(*async_cow), GFP_NOFS);
1070                 BUG_ON(!async_cow); /* -ENOMEM */
1071                 async_cow->inode = igrab(inode);
1072                 async_cow->root = root;
1073                 async_cow->locked_page = locked_page;
1074                 async_cow->start = start;
1075
1076                 if (BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS)
1077                         cur_end = end;
1078                 else
1079                         cur_end = min(end, start + 512 * 1024 - 1);
1080
1081                 async_cow->end = cur_end;
1082                 INIT_LIST_HEAD(&async_cow->extents);
1083
1084                 async_cow->work.func = async_cow_start;
1085                 async_cow->work.ordered_func = async_cow_submit;
1086                 async_cow->work.ordered_free = async_cow_free;
1087                 async_cow->work.flags = 0;
1088
1089                 nr_pages = (cur_end - start + PAGE_CACHE_SIZE) >>
1090                         PAGE_CACHE_SHIFT;
1091                 atomic_add(nr_pages, &root->fs_info->async_delalloc_pages);
1092
1093                 btrfs_queue_worker(&root->fs_info->delalloc_workers,
1094                                    &async_cow->work);
1095
1096                 if (atomic_read(&root->fs_info->async_delalloc_pages) > limit) {
1097                         wait_event(root->fs_info->async_submit_wait,
1098                            (atomic_read(&root->fs_info->async_delalloc_pages) <
1099                             limit));
1100                 }
1101
1102                 while (atomic_read(&root->fs_info->async_submit_draining) &&
1103                       atomic_read(&root->fs_info->async_delalloc_pages)) {
1104                         wait_event(root->fs_info->async_submit_wait,
1105                           (atomic_read(&root->fs_info->async_delalloc_pages) ==
1106                            0));
1107                 }
1108
1109                 *nr_written += nr_pages;
1110                 start = cur_end + 1;
1111         }
1112         *page_started = 1;
1113         return 0;
1114 }
1115
1116 static noinline int csum_exist_in_range(struct btrfs_root *root,
1117                                         u64 bytenr, u64 num_bytes)
1118 {
1119         int ret;
1120         struct btrfs_ordered_sum *sums;
1121         LIST_HEAD(list);
1122
1123         ret = btrfs_lookup_csums_range(root->fs_info->csum_root, bytenr,
1124                                        bytenr + num_bytes - 1, &list, 0);
1125         if (ret == 0 && list_empty(&list))
1126                 return 0;
1127
1128         while (!list_empty(&list)) {
1129                 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
1130                 list_del(&sums->list);
1131                 kfree(sums);
1132         }
1133         return 1;
1134 }
1135
1136 /*
1137  * when nowcow writeback call back.  This checks for snapshots or COW copies
1138  * of the extents that exist in the file, and COWs the file as required.
1139  *
1140  * If no cow copies or snapshots exist, we write directly to the existing
1141  * blocks on disk
1142  */
1143 static noinline int run_delalloc_nocow(struct inode *inode,
1144                                        struct page *locked_page,
1145                               u64 start, u64 end, int *page_started, int force,
1146                               unsigned long *nr_written)
1147 {
1148         struct btrfs_root *root = BTRFS_I(inode)->root;
1149         struct btrfs_trans_handle *trans;
1150         struct extent_buffer *leaf;
1151         struct btrfs_path *path;
1152         struct btrfs_file_extent_item *fi;
1153         struct btrfs_key found_key;
1154         u64 cow_start;
1155         u64 cur_offset;
1156         u64 extent_end;
1157         u64 extent_offset;
1158         u64 disk_bytenr;
1159         u64 num_bytes;
1160         u64 disk_num_bytes;
1161         int extent_type;
1162         int ret, err;
1163         int type;
1164         int nocow;
1165         int check_prev = 1;
1166         bool nolock;
1167         u64 ino = btrfs_ino(inode);
1168
1169         path = btrfs_alloc_path();
1170         if (!path) {
1171                 extent_clear_unlock_delalloc(inode,
1172                              &BTRFS_I(inode)->io_tree,
1173                              start, end, locked_page,
1174                              EXTENT_CLEAR_UNLOCK_PAGE |
1175                              EXTENT_CLEAR_UNLOCK |
1176                              EXTENT_CLEAR_DELALLOC |
1177                              EXTENT_CLEAR_DIRTY |
1178                              EXTENT_SET_WRITEBACK |
1179                              EXTENT_END_WRITEBACK);
1180                 return -ENOMEM;
1181         }
1182
1183         nolock = btrfs_is_free_space_inode(inode);
1184
1185         if (nolock)
1186                 trans = btrfs_join_transaction_nolock(root);
1187         else
1188                 trans = btrfs_join_transaction(root);
1189
1190         if (IS_ERR(trans)) {
1191                 extent_clear_unlock_delalloc(inode,
1192                              &BTRFS_I(inode)->io_tree,
1193                              start, end, locked_page,
1194                              EXTENT_CLEAR_UNLOCK_PAGE |
1195                              EXTENT_CLEAR_UNLOCK |
1196                              EXTENT_CLEAR_DELALLOC |
1197                              EXTENT_CLEAR_DIRTY |
1198                              EXTENT_SET_WRITEBACK |
1199                              EXTENT_END_WRITEBACK);
1200                 btrfs_free_path(path);
1201                 return PTR_ERR(trans);
1202         }
1203
1204         trans->block_rsv = &root->fs_info->delalloc_block_rsv;
1205
1206         cow_start = (u64)-1;
1207         cur_offset = start;
1208         while (1) {
1209                 ret = btrfs_lookup_file_extent(trans, root, path, ino,
1210                                                cur_offset, 0);
1211                 if (ret < 0) {
1212                         btrfs_abort_transaction(trans, root, ret);
1213                         goto error;
1214                 }
1215                 if (ret > 0 && path->slots[0] > 0 && check_prev) {
1216                         leaf = path->nodes[0];
1217                         btrfs_item_key_to_cpu(leaf, &found_key,
1218                                               path->slots[0] - 1);
1219                         if (found_key.objectid == ino &&
1220                             found_key.type == BTRFS_EXTENT_DATA_KEY)
1221                                 path->slots[0]--;
1222                 }
1223                 check_prev = 0;
1224 next_slot:
1225                 leaf = path->nodes[0];
1226                 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
1227                         ret = btrfs_next_leaf(root, path);
1228                         if (ret < 0) {
1229                                 btrfs_abort_transaction(trans, root, ret);
1230                                 goto error;
1231                         }
1232                         if (ret > 0)
1233                                 break;
1234                         leaf = path->nodes[0];
1235                 }
1236
1237                 nocow = 0;
1238                 disk_bytenr = 0;
1239                 num_bytes = 0;
1240                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1241
1242                 if (found_key.objectid > ino ||
1243                     found_key.type > BTRFS_EXTENT_DATA_KEY ||
1244                     found_key.offset > end)
1245                         break;
1246
1247                 if (found_key.offset > cur_offset) {
1248                         extent_end = found_key.offset;
1249                         extent_type = 0;
1250                         goto out_check;
1251                 }
1252
1253                 fi = btrfs_item_ptr(leaf, path->slots[0],
1254                                     struct btrfs_file_extent_item);
1255                 extent_type = btrfs_file_extent_type(leaf, fi);
1256
1257                 if (extent_type == BTRFS_FILE_EXTENT_REG ||
1258                     extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1259                         disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1260                         extent_offset = btrfs_file_extent_offset(leaf, fi);
1261                         extent_end = found_key.offset +
1262                                 btrfs_file_extent_num_bytes(leaf, fi);
1263                         disk_num_bytes =
1264                                 btrfs_file_extent_disk_num_bytes(leaf, fi);
1265                         if (extent_end <= start) {
1266                                 path->slots[0]++;
1267                                 goto next_slot;
1268                         }
1269                         if (disk_bytenr == 0)
1270                                 goto out_check;
1271                         if (btrfs_file_extent_compression(leaf, fi) ||
1272                             btrfs_file_extent_encryption(leaf, fi) ||
1273                             btrfs_file_extent_other_encoding(leaf, fi))
1274                                 goto out_check;
1275                         if (extent_type == BTRFS_FILE_EXTENT_REG && !force)
1276                                 goto out_check;
1277                         if (btrfs_extent_readonly(root, disk_bytenr))
1278                                 goto out_check;
1279                         if (btrfs_cross_ref_exist(trans, root, ino,
1280                                                   found_key.offset -
1281                                                   extent_offset, disk_bytenr))
1282                                 goto out_check;
1283                         disk_bytenr += extent_offset;
1284                         disk_bytenr += cur_offset - found_key.offset;
1285                         num_bytes = min(end + 1, extent_end) - cur_offset;
1286                         /*
1287                          * force cow if csum exists in the range.
1288                          * this ensure that csum for a given extent are
1289                          * either valid or do not exist.
1290                          */
1291                         if (csum_exist_in_range(root, disk_bytenr, num_bytes))
1292                                 goto out_check;
1293                         nocow = 1;
1294                 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
1295                         extent_end = found_key.offset +
1296                                 btrfs_file_extent_inline_len(leaf, fi);
1297                         extent_end = ALIGN(extent_end, root->sectorsize);
1298                 } else {
1299                         BUG_ON(1);
1300                 }
1301 out_check:
1302                 if (extent_end <= start) {
1303                         path->slots[0]++;
1304                         goto next_slot;
1305                 }
1306                 if (!nocow) {
1307                         if (cow_start == (u64)-1)
1308                                 cow_start = cur_offset;
1309                         cur_offset = extent_end;
1310                         if (cur_offset > end)
1311                                 break;
1312                         path->slots[0]++;
1313                         goto next_slot;
1314                 }
1315
1316                 btrfs_release_path(path);
1317                 if (cow_start != (u64)-1) {
1318                         ret = __cow_file_range(trans, inode, root, locked_page,
1319                                                cow_start, found_key.offset - 1,
1320                                                page_started, nr_written, 1);
1321                         if (ret) {
1322                                 btrfs_abort_transaction(trans, root, ret);
1323                                 goto error;
1324                         }
1325                         cow_start = (u64)-1;
1326                 }
1327
1328                 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1329                         struct extent_map *em;
1330                         struct extent_map_tree *em_tree;
1331                         em_tree = &BTRFS_I(inode)->extent_tree;
1332                         em = alloc_extent_map();
1333                         BUG_ON(!em); /* -ENOMEM */
1334                         em->start = cur_offset;
1335                         em->orig_start = found_key.offset - extent_offset;
1336                         em->len = num_bytes;
1337                         em->block_len = num_bytes;
1338                         em->block_start = disk_bytenr;
1339                         em->orig_block_len = disk_num_bytes;
1340                         em->bdev = root->fs_info->fs_devices->latest_bdev;
1341                         set_bit(EXTENT_FLAG_PINNED, &em->flags);
1342                         set_bit(EXTENT_FLAG_FILLING, &em->flags);
1343                         em->generation = -1;
1344                         while (1) {
1345                                 write_lock(&em_tree->lock);
1346                                 ret = add_extent_mapping(em_tree, em);
1347                                 if (!ret)
1348                                         list_move(&em->list,
1349                                                   &em_tree->modified_extents);
1350                                 write_unlock(&em_tree->lock);
1351                                 if (ret != -EEXIST) {
1352                                         free_extent_map(em);
1353                                         break;
1354                                 }
1355                                 btrfs_drop_extent_cache(inode, em->start,
1356                                                 em->start + em->len - 1, 0);
1357                         }
1358                         type = BTRFS_ORDERED_PREALLOC;
1359                 } else {
1360                         type = BTRFS_ORDERED_NOCOW;
1361                 }
1362
1363                 ret = btrfs_add_ordered_extent(inode, cur_offset, disk_bytenr,
1364                                                num_bytes, num_bytes, type);
1365                 BUG_ON(ret); /* -ENOMEM */
1366
1367                 if (root->root_key.objectid ==
1368                     BTRFS_DATA_RELOC_TREE_OBJECTID) {
1369                         ret = btrfs_reloc_clone_csums(inode, cur_offset,
1370                                                       num_bytes);
1371                         if (ret) {
1372                                 btrfs_abort_transaction(trans, root, ret);
1373                                 goto error;
1374                         }
1375                 }
1376
1377                 extent_clear_unlock_delalloc(inode, &BTRFS_I(inode)->io_tree,
1378                                 cur_offset, cur_offset + num_bytes - 1,
1379                                 locked_page, EXTENT_CLEAR_UNLOCK_PAGE |
1380                                 EXTENT_CLEAR_UNLOCK | EXTENT_CLEAR_DELALLOC |
1381                                 EXTENT_SET_PRIVATE2);
1382                 cur_offset = extent_end;
1383                 if (cur_offset > end)
1384                         break;
1385         }
1386         btrfs_release_path(path);
1387
1388         if (cur_offset <= end && cow_start == (u64)-1) {
1389                 cow_start = cur_offset;
1390                 cur_offset = end;
1391         }
1392
1393         if (cow_start != (u64)-1) {
1394                 ret = __cow_file_range(trans, inode, root, locked_page,
1395                                        cow_start, end,
1396                                        page_started, nr_written, 1);
1397                 if (ret) {
1398                         btrfs_abort_transaction(trans, root, ret);
1399                         goto error;
1400                 }
1401         }
1402
1403 error:
1404         err = btrfs_end_transaction(trans, root);
1405         if (!ret)
1406                 ret = err;
1407
1408         if (ret && cur_offset < end)
1409                 extent_clear_unlock_delalloc(inode,
1410                              &BTRFS_I(inode)->io_tree,
1411                              cur_offset, end, locked_page,
1412                              EXTENT_CLEAR_UNLOCK_PAGE |
1413                              EXTENT_CLEAR_UNLOCK |
1414                              EXTENT_CLEAR_DELALLOC |
1415                              EXTENT_CLEAR_DIRTY |
1416                              EXTENT_SET_WRITEBACK |
1417                              EXTENT_END_WRITEBACK);
1418
1419         btrfs_free_path(path);
1420         return ret;
1421 }
1422
1423 /*
1424  * extent_io.c call back to do delayed allocation processing
1425  */
1426 static int run_delalloc_range(struct inode *inode, struct page *locked_page,
1427                               u64 start, u64 end, int *page_started,
1428                               unsigned long *nr_written)
1429 {
1430         int ret;
1431         struct btrfs_root *root = BTRFS_I(inode)->root;
1432
1433         if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) {
1434                 ret = run_delalloc_nocow(inode, locked_page, start, end,
1435                                          page_started, 1, nr_written);
1436         } else if (BTRFS_I(inode)->flags & BTRFS_INODE_PREALLOC) {
1437                 ret = run_delalloc_nocow(inode, locked_page, start, end,
1438                                          page_started, 0, nr_written);
1439         } else if (!btrfs_test_opt(root, COMPRESS) &&
1440                    !(BTRFS_I(inode)->force_compress) &&
1441                    !(BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS)) {
1442                 ret = cow_file_range(inode, locked_page, start, end,
1443                                       page_started, nr_written, 1);
1444         } else {
1445                 set_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
1446                         &BTRFS_I(inode)->runtime_flags);
1447                 ret = cow_file_range_async(inode, locked_page, start, end,
1448                                            page_started, nr_written);
1449         }
1450         return ret;
1451 }
1452
1453 static void btrfs_split_extent_hook(struct inode *inode,
1454                                     struct extent_state *orig, u64 split)
1455 {
1456         /* not delalloc, ignore it */
1457         if (!(orig->state & EXTENT_DELALLOC))
1458                 return;
1459
1460         spin_lock(&BTRFS_I(inode)->lock);
1461         BTRFS_I(inode)->outstanding_extents++;
1462         spin_unlock(&BTRFS_I(inode)->lock);
1463 }
1464
1465 /*
1466  * extent_io.c merge_extent_hook, used to track merged delayed allocation
1467  * extents so we can keep track of new extents that are just merged onto old
1468  * extents, such as when we are doing sequential writes, so we can properly
1469  * account for the metadata space we'll need.
1470  */
1471 static void btrfs_merge_extent_hook(struct inode *inode,
1472                                     struct extent_state *new,
1473                                     struct extent_state *other)
1474 {
1475         /* not delalloc, ignore it */
1476         if (!(other->state & EXTENT_DELALLOC))
1477                 return;
1478
1479         spin_lock(&BTRFS_I(inode)->lock);
1480         BTRFS_I(inode)->outstanding_extents--;
1481         spin_unlock(&BTRFS_I(inode)->lock);
1482 }
1483
1484 /*
1485  * extent_io.c set_bit_hook, used to track delayed allocation
1486  * bytes in this file, and to maintain the list of inodes that
1487  * have pending delalloc work to be done.
1488  */
1489 static void btrfs_set_bit_hook(struct inode *inode,
1490                                struct extent_state *state, int *bits)
1491 {
1492
1493         /*
1494          * set_bit and clear bit hooks normally require _irqsave/restore
1495          * but in this case, we are only testing for the DELALLOC
1496          * bit, which is only set or cleared with irqs on
1497          */
1498         if (!(state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
1499                 struct btrfs_root *root = BTRFS_I(inode)->root;
1500                 u64 len = state->end + 1 - state->start;
1501                 bool do_list = !btrfs_is_free_space_inode(inode);
1502
1503                 if (*bits & EXTENT_FIRST_DELALLOC) {
1504                         *bits &= ~EXTENT_FIRST_DELALLOC;
1505                 } else {
1506                         spin_lock(&BTRFS_I(inode)->lock);
1507                         BTRFS_I(inode)->outstanding_extents++;
1508                         spin_unlock(&BTRFS_I(inode)->lock);
1509                 }
1510
1511                 spin_lock(&root->fs_info->delalloc_lock);
1512                 BTRFS_I(inode)->delalloc_bytes += len;
1513                 root->fs_info->delalloc_bytes += len;
1514                 if (do_list && list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
1515                         list_add_tail(&BTRFS_I(inode)->delalloc_inodes,
1516                                       &root->fs_info->delalloc_inodes);
1517                 }
1518                 spin_unlock(&root->fs_info->delalloc_lock);
1519         }
1520 }
1521
1522 /*
1523  * extent_io.c clear_bit_hook, see set_bit_hook for why
1524  */
1525 static void btrfs_clear_bit_hook(struct inode *inode,
1526                                  struct extent_state *state, int *bits)
1527 {
1528         /*
1529          * set_bit and clear bit hooks normally require _irqsave/restore
1530          * but in this case, we are only testing for the DELALLOC
1531          * bit, which is only set or cleared with irqs on
1532          */
1533         if ((state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
1534                 struct btrfs_root *root = BTRFS_I(inode)->root;
1535                 u64 len = state->end + 1 - state->start;
1536                 bool do_list = !btrfs_is_free_space_inode(inode);
1537
1538                 if (*bits & EXTENT_FIRST_DELALLOC) {
1539                         *bits &= ~EXTENT_FIRST_DELALLOC;
1540                 } else if (!(*bits & EXTENT_DO_ACCOUNTING)) {
1541                         spin_lock(&BTRFS_I(inode)->lock);
1542                         BTRFS_I(inode)->outstanding_extents--;
1543                         spin_unlock(&BTRFS_I(inode)->lock);
1544                 }
1545
1546                 if (*bits & EXTENT_DO_ACCOUNTING)
1547                         btrfs_delalloc_release_metadata(inode, len);
1548
1549                 if (root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID
1550                     && do_list)
1551                         btrfs_free_reserved_data_space(inode, len);
1552
1553                 spin_lock(&root->fs_info->delalloc_lock);
1554                 root->fs_info->delalloc_bytes -= len;
1555                 BTRFS_I(inode)->delalloc_bytes -= len;
1556
1557                 if (do_list && BTRFS_I(inode)->delalloc_bytes == 0 &&
1558                     !list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
1559                         list_del_init(&BTRFS_I(inode)->delalloc_inodes);
1560                 }
1561                 spin_unlock(&root->fs_info->delalloc_lock);
1562         }
1563 }
1564
1565 /*
1566  * extent_io.c merge_bio_hook, this must check the chunk tree to make sure
1567  * we don't create bios that span stripes or chunks
1568  */
1569 int btrfs_merge_bio_hook(struct page *page, unsigned long offset,
1570                          size_t size, struct bio *bio,
1571                          unsigned long bio_flags)
1572 {
1573         struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
1574         u64 logical = (u64)bio->bi_sector << 9;
1575         u64 length = 0;
1576         u64 map_length;
1577         int ret;
1578
1579         if (bio_flags & EXTENT_BIO_COMPRESSED)
1580                 return 0;
1581
1582         length = bio->bi_size;
1583         map_length = length;
1584         ret = btrfs_map_block(root->fs_info, READ, logical,
1585                               &map_length, NULL, 0);
1586         /* Will always return 0 with map_multi == NULL */
1587         BUG_ON(ret < 0);
1588         if (map_length < length + size)
1589                 return 1;
1590         return 0;
1591 }
1592
1593 /*
1594  * in order to insert checksums into the metadata in large chunks,
1595  * we wait until bio submission time.   All the pages in the bio are
1596  * checksummed and sums are attached onto the ordered extent record.
1597  *
1598  * At IO completion time the cums attached on the ordered extent record
1599  * are inserted into the btree
1600  */
1601 static int __btrfs_submit_bio_start(struct inode *inode, int rw,
1602                                     struct bio *bio, int mirror_num,
1603                                     unsigned long bio_flags,
1604                                     u64 bio_offset)
1605 {
1606         struct btrfs_root *root = BTRFS_I(inode)->root;
1607         int ret = 0;
1608
1609         ret = btrfs_csum_one_bio(root, inode, bio, 0, 0);
1610         BUG_ON(ret); /* -ENOMEM */
1611         return 0;
1612 }
1613
1614 /*
1615  * in order to insert checksums into the metadata in large chunks,
1616  * we wait until bio submission time.   All the pages in the bio are
1617  * checksummed and sums are attached onto the ordered extent record.
1618  *
1619  * At IO completion time the cums attached on the ordered extent record
1620  * are inserted into the btree
1621  */
1622 static int __btrfs_submit_bio_done(struct inode *inode, int rw, struct bio *bio,
1623                           int mirror_num, unsigned long bio_flags,
1624                           u64 bio_offset)
1625 {
1626         struct btrfs_root *root = BTRFS_I(inode)->root;
1627         int ret;
1628
1629         ret = btrfs_map_bio(root, rw, bio, mirror_num, 1);
1630         if (ret)
1631                 bio_endio(bio, ret);
1632         return ret;
1633 }
1634
1635 /*
1636  * extent_io.c submission hook. This does the right thing for csum calculation
1637  * on write, or reading the csums from the tree before a read
1638  */
1639 static int btrfs_submit_bio_hook(struct inode *inode, int rw, struct bio *bio,
1640                           int mirror_num, unsigned long bio_flags,
1641                           u64 bio_offset)
1642 {
1643         struct btrfs_root *root = BTRFS_I(inode)->root;
1644         int ret = 0;
1645         int skip_sum;
1646         int metadata = 0;
1647         int async = !atomic_read(&BTRFS_I(inode)->sync_writers);
1648
1649         skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
1650
1651         if (btrfs_is_free_space_inode(inode))
1652                 metadata = 2;
1653
1654         if (!(rw & REQ_WRITE)) {
1655                 ret = btrfs_bio_wq_end_io(root->fs_info, bio, metadata);
1656                 if (ret)
1657                         goto out;
1658
1659                 if (bio_flags & EXTENT_BIO_COMPRESSED) {
1660                         ret = btrfs_submit_compressed_read(inode, bio,
1661                                                            mirror_num,
1662                                                            bio_flags);
1663                         goto out;
1664                 } else if (!skip_sum) {
1665                         ret = btrfs_lookup_bio_sums(root, inode, bio, NULL);
1666                         if (ret)
1667                                 goto out;
1668                 }
1669                 goto mapit;
1670         } else if (async && !skip_sum) {
1671                 /* csum items have already been cloned */
1672                 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
1673                         goto mapit;
1674                 /* we're doing a write, do the async checksumming */
1675                 ret = btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info,
1676                                    inode, rw, bio, mirror_num,
1677                                    bio_flags, bio_offset,
1678                                    __btrfs_submit_bio_start,
1679                                    __btrfs_submit_bio_done);
1680                 goto out;
1681         } else if (!skip_sum) {
1682                 ret = btrfs_csum_one_bio(root, inode, bio, 0, 0);
1683                 if (ret)
1684                         goto out;
1685         }
1686
1687 mapit:
1688         ret = btrfs_map_bio(root, rw, bio, mirror_num, 0);
1689
1690 out:
1691         if (ret < 0)
1692                 bio_endio(bio, ret);
1693         return ret;
1694 }
1695
1696 /*
1697  * given a list of ordered sums record them in the inode.  This happens
1698  * at IO completion time based on sums calculated at bio submission time.
1699  */
1700 static noinline int add_pending_csums(struct btrfs_trans_handle *trans,
1701                              struct inode *inode, u64 file_offset,
1702                              struct list_head *list)
1703 {
1704         struct btrfs_ordered_sum *sum;
1705
1706         list_for_each_entry(sum, list, list) {
1707                 btrfs_csum_file_blocks(trans,
1708                        BTRFS_I(inode)->root->fs_info->csum_root, sum);
1709         }
1710         return 0;
1711 }
1712
1713 int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end,
1714                               struct extent_state **cached_state)
1715 {
1716         WARN_ON((end & (PAGE_CACHE_SIZE - 1)) == 0);
1717         return set_extent_delalloc(&BTRFS_I(inode)->io_tree, start, end,
1718                                    cached_state, GFP_NOFS);
1719 }
1720
1721 /* see btrfs_writepage_start_hook for details on why this is required */
1722 struct btrfs_writepage_fixup {
1723         struct page *page;
1724         struct btrfs_work work;
1725 };
1726
1727 static void btrfs_writepage_fixup_worker(struct btrfs_work *work)
1728 {
1729         struct btrfs_writepage_fixup *fixup;
1730         struct btrfs_ordered_extent *ordered;
1731         struct extent_state *cached_state = NULL;
1732         struct page *page;
1733         struct inode *inode;
1734         u64 page_start;
1735         u64 page_end;
1736         int ret;
1737
1738         fixup = container_of(work, struct btrfs_writepage_fixup, work);
1739         page = fixup->page;
1740 again:
1741         lock_page(page);
1742         if (!page->mapping || !PageDirty(page) || !PageChecked(page)) {
1743                 ClearPageChecked(page);
1744                 goto out_page;
1745         }
1746
1747         inode = page->mapping->host;
1748         page_start = page_offset(page);
1749         page_end = page_offset(page) + PAGE_CACHE_SIZE - 1;
1750
1751         lock_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end, 0,
1752                          &cached_state);
1753
1754         /* already ordered? We're done */
1755         if (PagePrivate2(page))
1756                 goto out;
1757
1758         ordered = btrfs_lookup_ordered_extent(inode, page_start);
1759         if (ordered) {
1760                 unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start,
1761                                      page_end, &cached_state, GFP_NOFS);
1762                 unlock_page(page);
1763                 btrfs_start_ordered_extent(inode, ordered, 1);
1764                 btrfs_put_ordered_extent(ordered);
1765                 goto again;
1766         }
1767
1768         ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE);
1769         if (ret) {
1770                 mapping_set_error(page->mapping, ret);
1771                 end_extent_writepage(page, ret, page_start, page_end);
1772                 ClearPageChecked(page);
1773                 goto out;
1774          }
1775
1776         btrfs_set_extent_delalloc(inode, page_start, page_end, &cached_state);
1777         ClearPageChecked(page);
1778         set_page_dirty(page);
1779 out:
1780         unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start, page_end,
1781                              &cached_state, GFP_NOFS);
1782 out_page:
1783         unlock_page(page);
1784         page_cache_release(page);
1785         kfree(fixup);
1786 }
1787
1788 /*
1789  * There are a few paths in the higher layers of the kernel that directly
1790  * set the page dirty bit without asking the filesystem if it is a
1791  * good idea.  This causes problems because we want to make sure COW
1792  * properly happens and the data=ordered rules are followed.
1793  *
1794  * In our case any range that doesn't have the ORDERED bit set
1795  * hasn't been properly setup for IO.  We kick off an async process
1796  * to fix it up.  The async helper will wait for ordered extents, set
1797  * the delalloc bit and make it safe to write the page.
1798  */
1799 static int btrfs_writepage_start_hook(struct page *page, u64 start, u64 end)
1800 {
1801         struct inode *inode = page->mapping->host;
1802         struct btrfs_writepage_fixup *fixup;
1803         struct btrfs_root *root = BTRFS_I(inode)->root;
1804
1805         /* this page is properly in the ordered list */
1806         if (TestClearPagePrivate2(page))
1807                 return 0;
1808
1809         if (PageChecked(page))
1810                 return -EAGAIN;
1811
1812         fixup = kzalloc(sizeof(*fixup), GFP_NOFS);
1813         if (!fixup)
1814                 return -EAGAIN;
1815
1816         SetPageChecked(page);
1817         page_cache_get(page);
1818         fixup->work.func = btrfs_writepage_fixup_worker;
1819         fixup->page = page;
1820         btrfs_queue_worker(&root->fs_info->fixup_workers, &fixup->work);
1821         return -EBUSY;
1822 }
1823
1824 static int insert_reserved_file_extent(struct btrfs_trans_handle *trans,
1825                                        struct inode *inode, u64 file_pos,
1826                                        u64 disk_bytenr, u64 disk_num_bytes,
1827                                        u64 num_bytes, u64 ram_bytes,
1828                                        u8 compression, u8 encryption,
1829                                        u16 other_encoding, int extent_type)
1830 {
1831         struct btrfs_root *root = BTRFS_I(inode)->root;
1832         struct btrfs_file_extent_item *fi;
1833         struct btrfs_path *path;
1834         struct extent_buffer *leaf;
1835         struct btrfs_key ins;
1836         int ret;
1837
1838         path = btrfs_alloc_path();
1839         if (!path)
1840                 return -ENOMEM;
1841
1842         path->leave_spinning = 1;
1843
1844         /*
1845          * we may be replacing one extent in the tree with another.
1846          * The new extent is pinned in the extent map, and we don't want
1847          * to drop it from the cache until it is completely in the btree.
1848          *
1849          * So, tell btrfs_drop_extents to leave this extent in the cache.
1850          * the caller is expected to unpin it and allow it to be merged
1851          * with the others.
1852          */
1853         ret = btrfs_drop_extents(trans, root, inode, file_pos,
1854                                  file_pos + num_bytes, 0);
1855         if (ret)
1856                 goto out;
1857
1858         ins.objectid = btrfs_ino(inode);
1859         ins.offset = file_pos;
1860         ins.type = BTRFS_EXTENT_DATA_KEY;
1861         ret = btrfs_insert_empty_item(trans, root, path, &ins, sizeof(*fi));
1862         if (ret)
1863                 goto out;
1864         leaf = path->nodes[0];
1865         fi = btrfs_item_ptr(leaf, path->slots[0],
1866                             struct btrfs_file_extent_item);
1867         btrfs_set_file_extent_generation(leaf, fi, trans->transid);
1868         btrfs_set_file_extent_type(leaf, fi, extent_type);
1869         btrfs_set_file_extent_disk_bytenr(leaf, fi, disk_bytenr);
1870         btrfs_set_file_extent_disk_num_bytes(leaf, fi, disk_num_bytes);
1871         btrfs_set_file_extent_offset(leaf, fi, 0);
1872         btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes);
1873         btrfs_set_file_extent_ram_bytes(leaf, fi, ram_bytes);
1874         btrfs_set_file_extent_compression(leaf, fi, compression);
1875         btrfs_set_file_extent_encryption(leaf, fi, encryption);
1876         btrfs_set_file_extent_other_encoding(leaf, fi, other_encoding);
1877
1878         btrfs_mark_buffer_dirty(leaf);
1879         btrfs_release_path(path);
1880
1881         inode_add_bytes(inode, num_bytes);
1882
1883         ins.objectid = disk_bytenr;
1884         ins.offset = disk_num_bytes;
1885         ins.type = BTRFS_EXTENT_ITEM_KEY;
1886         ret = btrfs_alloc_reserved_file_extent(trans, root,
1887                                         root->root_key.objectid,
1888                                         btrfs_ino(inode), file_pos, &ins);
1889 out:
1890         btrfs_free_path(path);
1891
1892         return ret;
1893 }
1894
1895 /*
1896  * helper function for btrfs_finish_ordered_io, this
1897  * just reads in some of the csum leaves to prime them into ram
1898  * before we start the transaction.  It limits the amount of btree
1899  * reads required while inside the transaction.
1900  */
1901 /* as ordered data IO finishes, this gets called so we can finish
1902  * an ordered extent if the range of bytes in the file it covers are
1903  * fully written.
1904  */
1905 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent)
1906 {
1907         struct inode *inode = ordered_extent->inode;
1908         struct btrfs_root *root = BTRFS_I(inode)->root;
1909         struct btrfs_trans_handle *trans = NULL;
1910         struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
1911         struct extent_state *cached_state = NULL;
1912         int compress_type = 0;
1913         int ret;
1914         bool nolock;
1915
1916         nolock = btrfs_is_free_space_inode(inode);
1917
1918         if (test_bit(BTRFS_ORDERED_IOERR, &ordered_extent->flags)) {
1919                 ret = -EIO;
1920                 goto out;
1921         }
1922
1923         if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) {
1924                 BUG_ON(!list_empty(&ordered_extent->list)); /* Logic error */
1925                 btrfs_ordered_update_i_size(inode, 0, ordered_extent);
1926                 if (nolock)
1927                         trans = btrfs_join_transaction_nolock(root);
1928                 else
1929                         trans = btrfs_join_transaction(root);
1930                 if (IS_ERR(trans)) {
1931                         ret = PTR_ERR(trans);
1932                         trans = NULL;
1933                         goto out;
1934                 }
1935                 trans->block_rsv = &root->fs_info->delalloc_block_rsv;
1936                 ret = btrfs_update_inode_fallback(trans, root, inode);
1937                 if (ret) /* -ENOMEM or corruption */
1938                         btrfs_abort_transaction(trans, root, ret);
1939                 goto out;
1940         }
1941
1942         lock_extent_bits(io_tree, ordered_extent->file_offset,
1943                          ordered_extent->file_offset + ordered_extent->len - 1,
1944                          0, &cached_state);
1945
1946         if (nolock)
1947                 trans = btrfs_join_transaction_nolock(root);
1948         else
1949                 trans = btrfs_join_transaction(root);
1950         if (IS_ERR(trans)) {
1951                 ret = PTR_ERR(trans);
1952                 trans = NULL;
1953                 goto out_unlock;
1954         }
1955         trans->block_rsv = &root->fs_info->delalloc_block_rsv;
1956
1957         if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags))
1958                 compress_type = ordered_extent->compress_type;
1959         if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
1960                 BUG_ON(compress_type);
1961                 ret = btrfs_mark_extent_written(trans, inode,
1962                                                 ordered_extent->file_offset,
1963                                                 ordered_extent->file_offset +
1964                                                 ordered_extent->len);
1965         } else {
1966                 BUG_ON(root == root->fs_info->tree_root);
1967                 ret = insert_reserved_file_extent(trans, inode,
1968                                                 ordered_extent->file_offset,
1969                                                 ordered_extent->start,
1970                                                 ordered_extent->disk_len,
1971                                                 ordered_extent->len,
1972                                                 ordered_extent->len,
1973                                                 compress_type, 0, 0,
1974                                                 BTRFS_FILE_EXTENT_REG);
1975         }
1976         unpin_extent_cache(&BTRFS_I(inode)->extent_tree,
1977                            ordered_extent->file_offset, ordered_extent->len,
1978                            trans->transid);
1979         if (ret < 0) {
1980                 btrfs_abort_transaction(trans, root, ret);
1981                 goto out_unlock;
1982         }
1983
1984         add_pending_csums(trans, inode, ordered_extent->file_offset,
1985                           &ordered_extent->list);
1986
1987         btrfs_ordered_update_i_size(inode, 0, ordered_extent);
1988         ret = btrfs_update_inode_fallback(trans, root, inode);
1989         if (ret) { /* -ENOMEM or corruption */
1990                 btrfs_abort_transaction(trans, root, ret);
1991                 goto out_unlock;
1992         }
1993         ret = 0;
1994 out_unlock:
1995         unlock_extent_cached(io_tree, ordered_extent->file_offset,
1996                              ordered_extent->file_offset +
1997                              ordered_extent->len - 1, &cached_state, GFP_NOFS);
1998 out:
1999         if (root != root->fs_info->tree_root)
2000                 btrfs_delalloc_release_metadata(inode, ordered_extent->len);
2001         if (trans)
2002                 btrfs_end_transaction(trans, root);
2003
2004         if (ret)
2005                 clear_extent_uptodate(io_tree, ordered_extent->file_offset,
2006                                       ordered_extent->file_offset +
2007                                       ordered_extent->len - 1, NULL, GFP_NOFS);
2008
2009         /*
2010          * This needs to be done to make sure anybody waiting knows we are done
2011          * updating everything for this ordered extent.
2012          */
2013         btrfs_remove_ordered_extent(inode, ordered_extent);
2014
2015         /* once for us */
2016         btrfs_put_ordered_extent(ordered_extent);
2017         /* once for the tree */
2018         btrfs_put_ordered_extent(ordered_extent);
2019
2020         return ret;
2021 }
2022
2023 static void finish_ordered_fn(struct btrfs_work *work)
2024 {
2025         struct btrfs_ordered_extent *ordered_extent;
2026         ordered_extent = container_of(work, struct btrfs_ordered_extent, work);
2027         btrfs_finish_ordered_io(ordered_extent);
2028 }
2029
2030 static int btrfs_writepage_end_io_hook(struct page *page, u64 start, u64 end,
2031                                 struct extent_state *state, int uptodate)
2032 {
2033         struct inode *inode = page->mapping->host;
2034         struct btrfs_root *root = BTRFS_I(inode)->root;
2035         struct btrfs_ordered_extent *ordered_extent = NULL;
2036         struct btrfs_workers *workers;
2037
2038         trace_btrfs_writepage_end_io_hook(page, start, end, uptodate);
2039
2040         ClearPagePrivate2(page);
2041         if (!btrfs_dec_test_ordered_pending(inode, &ordered_extent, start,
2042                                             end - start + 1, uptodate))
2043                 return 0;
2044
2045         ordered_extent->work.func = finish_ordered_fn;
2046         ordered_extent->work.flags = 0;
2047
2048         if (btrfs_is_free_space_inode(inode))
2049                 workers = &root->fs_info->endio_freespace_worker;
2050         else
2051                 workers = &root->fs_info->endio_write_workers;
2052         btrfs_queue_worker(workers, &ordered_extent->work);
2053
2054         return 0;
2055 }
2056
2057 /*
2058  * when reads are done, we need to check csums to verify the data is correct
2059  * if there's a match, we allow the bio to finish.  If not, the code in
2060  * extent_io.c will try to find good copies for us.
2061  */
2062 static int btrfs_readpage_end_io_hook(struct page *page, u64 start, u64 end,
2063                                struct extent_state *state, int mirror)
2064 {
2065         size_t offset = start - ((u64)page->index << PAGE_CACHE_SHIFT);
2066         struct inode *inode = page->mapping->host;
2067         struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
2068         char *kaddr;
2069         u64 private = ~(u32)0;
2070         int ret;
2071         struct btrfs_root *root = BTRFS_I(inode)->root;
2072         u32 csum = ~(u32)0;
2073
2074         if (PageChecked(page)) {
2075                 ClearPageChecked(page);
2076                 goto good;
2077         }
2078
2079         if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)
2080                 goto good;
2081
2082         if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID &&
2083             test_range_bit(io_tree, start, end, EXTENT_NODATASUM, 1, NULL)) {
2084                 clear_extent_bits(io_tree, start, end, EXTENT_NODATASUM,
2085                                   GFP_NOFS);
2086                 return 0;
2087         }
2088
2089         if (state && state->start == start) {
2090                 private = state->private;
2091                 ret = 0;
2092         } else {
2093                 ret = get_state_private(io_tree, start, &private);
2094         }
2095         kaddr = kmap_atomic(page);
2096         if (ret)
2097                 goto zeroit;
2098
2099         csum = btrfs_csum_data(root, kaddr + offset, csum,  end - start + 1);
2100         btrfs_csum_final(csum, (char *)&csum);
2101         if (csum != private)
2102                 goto zeroit;
2103
2104         kunmap_atomic(kaddr);
2105 good:
2106         return 0;
2107
2108 zeroit:
2109         printk_ratelimited(KERN_INFO "btrfs csum failed ino %llu off %llu csum %u "
2110                        "private %llu\n",
2111                        (unsigned long long)btrfs_ino(page->mapping->host),
2112                        (unsigned long long)start, csum,
2113                        (unsigned long long)private);
2114         memset(kaddr + offset, 1, end - start + 1);
2115         flush_dcache_page(page);
2116         kunmap_atomic(kaddr);
2117         if (private == 0)
2118                 return 0;
2119         return -EIO;
2120 }
2121
2122 struct delayed_iput {
2123         struct list_head list;
2124         struct inode *inode;
2125 };
2126
2127 /* JDM: If this is fs-wide, why can't we add a pointer to
2128  * btrfs_inode instead and avoid the allocation? */
2129 void btrfs_add_delayed_iput(struct inode *inode)
2130 {
2131         struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
2132         struct delayed_iput *delayed;
2133
2134         if (atomic_add_unless(&inode->i_count, -1, 1))
2135                 return;
2136
2137         delayed = kmalloc(sizeof(*delayed), GFP_NOFS | __GFP_NOFAIL);
2138         delayed->inode = inode;
2139
2140         spin_lock(&fs_info->delayed_iput_lock);
2141         list_add_tail(&delayed->list, &fs_info->delayed_iputs);
2142         spin_unlock(&fs_info->delayed_iput_lock);
2143 }
2144
2145 void btrfs_run_delayed_iputs(struct btrfs_root *root)
2146 {
2147         LIST_HEAD(list);
2148         struct btrfs_fs_info *fs_info = root->fs_info;
2149         struct delayed_iput *delayed;
2150         int empty;
2151
2152         spin_lock(&fs_info->delayed_iput_lock);
2153         empty = list_empty(&fs_info->delayed_iputs);
2154         spin_unlock(&fs_info->delayed_iput_lock);
2155         if (empty)
2156                 return;
2157
2158         spin_lock(&fs_info->delayed_iput_lock);
2159         list_splice_init(&fs_info->delayed_iputs, &list);
2160         spin_unlock(&fs_info->delayed_iput_lock);
2161
2162         while (!list_empty(&list)) {
2163                 delayed = list_entry(list.next, struct delayed_iput, list);
2164                 list_del(&delayed->list);
2165                 iput(delayed->inode);
2166                 kfree(delayed);
2167         }
2168 }
2169
2170 enum btrfs_orphan_cleanup_state {
2171         ORPHAN_CLEANUP_STARTED  = 1,
2172         ORPHAN_CLEANUP_DONE     = 2,
2173 };
2174
2175 /*
2176  * This is called in transaction commit time. If there are no orphan
2177  * files in the subvolume, it removes orphan item and frees block_rsv
2178  * structure.
2179  */
2180 void btrfs_orphan_commit_root(struct btrfs_trans_handle *trans,
2181                               struct btrfs_root *root)
2182 {
2183         struct btrfs_block_rsv *block_rsv;
2184         int ret;
2185
2186         if (atomic_read(&root->orphan_inodes) ||
2187             root->orphan_cleanup_state != ORPHAN_CLEANUP_DONE)
2188                 return;
2189
2190         spin_lock(&root->orphan_lock);
2191         if (atomic_read(&root->orphan_inodes)) {
2192                 spin_unlock(&root->orphan_lock);
2193                 return;
2194         }
2195
2196         if (root->orphan_cleanup_state != ORPHAN_CLEANUP_DONE) {
2197                 spin_unlock(&root->orphan_lock);
2198                 return;
2199         }
2200
2201         block_rsv = root->orphan_block_rsv;
2202         root->orphan_block_rsv = NULL;
2203         spin_unlock(&root->orphan_lock);
2204
2205         if (root->orphan_item_inserted &&
2206             btrfs_root_refs(&root->root_item) > 0) {
2207                 ret = btrfs_del_orphan_item(trans, root->fs_info->tree_root,
2208                                             root->root_key.objectid);
2209                 BUG_ON(ret);
2210                 root->orphan_item_inserted = 0;
2211         }
2212
2213         if (block_rsv) {
2214                 WARN_ON(block_rsv->size > 0);
2215                 btrfs_free_block_rsv(root, block_rsv);
2216         }
2217 }
2218
2219 /*
2220  * This creates an orphan entry for the given inode in case something goes
2221  * wrong in the middle of an unlink/truncate.
2222  *
2223  * NOTE: caller of this function should reserve 5 units of metadata for
2224  *       this function.
2225  */
2226 int btrfs_orphan_add(struct btrfs_trans_handle *trans, struct inode *inode)
2227 {
2228         struct btrfs_root *root = BTRFS_I(inode)->root;
2229         struct btrfs_block_rsv *block_rsv = NULL;
2230         int reserve = 0;
2231         int insert = 0;
2232         int ret;
2233
2234         if (!root->orphan_block_rsv) {
2235                 block_rsv = btrfs_alloc_block_rsv(root, BTRFS_BLOCK_RSV_TEMP);
2236                 if (!block_rsv)
2237                         return -ENOMEM;
2238         }
2239
2240         spin_lock(&root->orphan_lock);
2241         if (!root->orphan_block_rsv) {
2242                 root->orphan_block_rsv = block_rsv;
2243         } else if (block_rsv) {
2244                 btrfs_free_block_rsv(root, block_rsv);
2245                 block_rsv = NULL;
2246         }
2247
2248         if (!test_and_set_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
2249                               &BTRFS_I(inode)->runtime_flags)) {
2250 #if 0
2251                 /*
2252                  * For proper ENOSPC handling, we should do orphan
2253                  * cleanup when mounting. But this introduces backward
2254                  * compatibility issue.
2255                  */
2256                 if (!xchg(&root->orphan_item_inserted, 1))
2257                         insert = 2;
2258                 else
2259                         insert = 1;
2260 #endif
2261                 insert = 1;
2262                 atomic_inc(&root->orphan_inodes);
2263         }
2264
2265         if (!test_and_set_bit(BTRFS_INODE_ORPHAN_META_RESERVED,
2266                               &BTRFS_I(inode)->runtime_flags))
2267                 reserve = 1;
2268         spin_unlock(&root->orphan_lock);
2269
2270         /* grab metadata reservation from transaction handle */
2271         if (reserve) {
2272                 ret = btrfs_orphan_reserve_metadata(trans, inode);
2273                 BUG_ON(ret); /* -ENOSPC in reservation; Logic error? JDM */
2274         }
2275
2276         /* insert an orphan item to track this unlinked/truncated file */
2277         if (insert >= 1) {
2278                 ret = btrfs_insert_orphan_item(trans, root, btrfs_ino(inode));
2279                 if (ret && ret != -EEXIST) {
2280                         clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
2281                                   &BTRFS_I(inode)->runtime_flags);
2282                         btrfs_abort_transaction(trans, root, ret);
2283                         return ret;
2284                 }
2285                 ret = 0;
2286         }
2287
2288         /* insert an orphan item to track subvolume contains orphan files */
2289         if (insert >= 2) {
2290                 ret = btrfs_insert_orphan_item(trans, root->fs_info->tree_root,
2291                                                root->root_key.objectid);
2292                 if (ret && ret != -EEXIST) {
2293                         btrfs_abort_transaction(trans, root, ret);
2294                         return ret;
2295                 }
2296         }
2297         return 0;
2298 }
2299
2300 /*
2301  * We have done the truncate/delete so we can go ahead and remove the orphan
2302  * item for this particular inode.
2303  */
2304 int btrfs_orphan_del(struct btrfs_trans_handle *trans, struct inode *inode)
2305 {
2306         struct btrfs_root *root = BTRFS_I(inode)->root;
2307         int delete_item = 0;
2308         int release_rsv = 0;
2309         int ret = 0;
2310
2311         spin_lock(&root->orphan_lock);
2312         if (test_and_clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
2313                                &BTRFS_I(inode)->runtime_flags))
2314                 delete_item = 1;
2315
2316         if (test_and_clear_bit(BTRFS_INODE_ORPHAN_META_RESERVED,
2317                                &BTRFS_I(inode)->runtime_flags))
2318                 release_rsv = 1;
2319         spin_unlock(&root->orphan_lock);
2320
2321         if (trans && delete_item) {
2322                 ret = btrfs_del_orphan_item(trans, root, btrfs_ino(inode));
2323                 BUG_ON(ret); /* -ENOMEM or corruption (JDM: Recheck) */
2324         }
2325
2326         if (release_rsv) {
2327                 btrfs_orphan_release_metadata(inode);
2328                 atomic_dec(&root->orphan_inodes);
2329         }
2330
2331         return 0;
2332 }
2333
2334 /*
2335  * this cleans up any orphans that may be left on the list from the last use
2336  * of this root.
2337  */
2338 int btrfs_orphan_cleanup(struct btrfs_root *root)
2339 {
2340         struct btrfs_path *path;
2341         struct extent_buffer *leaf;
2342         struct btrfs_key key, found_key;
2343         struct btrfs_trans_handle *trans;
2344         struct inode *inode;
2345         u64 last_objectid = 0;
2346         int ret = 0, nr_unlink = 0, nr_truncate = 0;
2347
2348         if (cmpxchg(&root->orphan_cleanup_state, 0, ORPHAN_CLEANUP_STARTED))
2349                 return 0;
2350
2351         path = btrfs_alloc_path();
2352         if (!path) {
2353                 ret = -ENOMEM;
2354                 goto out;
2355         }
2356         path->reada = -1;
2357
2358         key.objectid = BTRFS_ORPHAN_OBJECTID;
2359         btrfs_set_key_type(&key, BTRFS_ORPHAN_ITEM_KEY);
2360         key.offset = (u64)-1;
2361
2362         while (1) {
2363                 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2364                 if (ret < 0)
2365                         goto out;
2366
2367                 /*
2368                  * if ret == 0 means we found what we were searching for, which
2369                  * is weird, but possible, so only screw with path if we didn't
2370                  * find the key and see if we have stuff that matches
2371                  */
2372                 if (ret > 0) {
2373                         ret = 0;
2374                         if (path->slots[0] == 0)
2375                                 break;
2376                         path->slots[0]--;
2377                 }
2378
2379                 /* pull out the item */
2380                 leaf = path->nodes[0];
2381                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
2382
2383                 /* make sure the item matches what we want */
2384                 if (found_key.objectid != BTRFS_ORPHAN_OBJECTID)
2385                         break;
2386                 if (btrfs_key_type(&found_key) != BTRFS_ORPHAN_ITEM_KEY)
2387                         break;
2388
2389                 /* release the path since we're done with it */
2390                 btrfs_release_path(path);
2391
2392                 /*
2393                  * this is where we are basically btrfs_lookup, without the
2394                  * crossing root thing.  we store the inode number in the
2395                  * offset of the orphan item.
2396                  */
2397
2398                 if (found_key.offset == last_objectid) {
2399                         printk(KERN_ERR "btrfs: Error removing orphan entry, "
2400                                "stopping orphan cleanup\n");
2401                         ret = -EINVAL;
2402                         goto out;
2403                 }
2404
2405                 last_objectid = found_key.offset;
2406
2407                 found_key.objectid = found_key.offset;
2408                 found_key.type = BTRFS_INODE_ITEM_KEY;
2409                 found_key.offset = 0;
2410                 inode = btrfs_iget(root->fs_info->sb, &found_key, root, NULL);
2411                 ret = PTR_RET(inode);
2412                 if (ret && ret != -ESTALE)
2413                         goto out;
2414
2415                 if (ret == -ESTALE && root == root->fs_info->tree_root) {
2416                         struct btrfs_root *dead_root;
2417                         struct btrfs_fs_info *fs_info = root->fs_info;
2418                         int is_dead_root = 0;
2419
2420                         /*
2421                          * this is an orphan in the tree root. Currently these
2422                          * could come from 2 sources:
2423                          *  a) a snapshot deletion in progress
2424                          *  b) a free space cache inode
2425                          * We need to distinguish those two, as the snapshot
2426                          * orphan must not get deleted.
2427                          * find_dead_roots already ran before us, so if this
2428                          * is a snapshot deletion, we should find the root
2429                          * in the dead_roots list
2430                          */
2431                         spin_lock(&fs_info->trans_lock);
2432                         list_for_each_entry(dead_root, &fs_info->dead_roots,
2433                                             root_list) {
2434                                 if (dead_root->root_key.objectid ==
2435                                     found_key.objectid) {
2436                                         is_dead_root = 1;
2437                                         break;
2438                                 }
2439                         }
2440                         spin_unlock(&fs_info->trans_lock);
2441                         if (is_dead_root) {
2442                                 /* prevent this orphan from being found again */
2443                                 key.offset = found_key.objectid - 1;
2444                                 continue;
2445                         }
2446                 }
2447                 /*
2448                  * Inode is already gone but the orphan item is still there,
2449                  * kill the orphan item.
2450                  */
2451                 if (ret == -ESTALE) {
2452                         trans = btrfs_start_transaction(root, 1);
2453                         if (IS_ERR(trans)) {
2454                                 ret = PTR_ERR(trans);
2455                                 goto out;
2456                         }
2457                         printk(KERN_ERR "auto deleting %Lu\n",
2458                                found_key.objectid);
2459                         ret = btrfs_del_orphan_item(trans, root,
2460                                                     found_key.objectid);
2461                         BUG_ON(ret); /* -ENOMEM or corruption (JDM: Recheck) */
2462                         btrfs_end_transaction(trans, root);
2463                         continue;
2464                 }
2465
2466                 /*
2467                  * add this inode to the orphan list so btrfs_orphan_del does
2468                  * the proper thing when we hit it
2469                  */
2470                 set_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
2471                         &BTRFS_I(inode)->runtime_flags);
2472
2473                 /* if we have links, this was a truncate, lets do that */
2474                 if (inode->i_nlink) {
2475                         if (!S_ISREG(inode->i_mode)) {
2476                                 WARN_ON(1);
2477                                 iput(inode);
2478                                 continue;
2479                         }
2480                         nr_truncate++;
2481
2482                         /* 1 for the orphan item deletion. */
2483                         trans = btrfs_start_transaction(root, 1);
2484                         if (IS_ERR(trans)) {
2485                                 ret = PTR_ERR(trans);
2486                                 goto out;
2487                         }
2488                         ret = btrfs_orphan_add(trans, inode);
2489                         btrfs_end_transaction(trans, root);
2490                         if (ret)
2491                                 goto out;
2492
2493                         ret = btrfs_truncate(inode);
2494                 } else {
2495                         nr_unlink++;
2496                 }
2497
2498                 /* this will do delete_inode and everything for us */
2499                 iput(inode);
2500                 if (ret)
2501                         goto out;
2502         }
2503         /* release the path since we're done with it */
2504         btrfs_release_path(path);
2505
2506         root->orphan_cleanup_state = ORPHAN_CLEANUP_DONE;
2507
2508         if (root->orphan_block_rsv)
2509                 btrfs_block_rsv_release(root, root->orphan_block_rsv,
2510                                         (u64)-1);
2511
2512         if (root->orphan_block_rsv || root->orphan_item_inserted) {
2513                 trans = btrfs_join_transaction(root);
2514                 if (!IS_ERR(trans))
2515                         btrfs_end_transaction(trans, root);
2516         }
2517
2518         if (nr_unlink)
2519                 printk(KERN_INFO "btrfs: unlinked %d orphans\n", nr_unlink);
2520         if (nr_truncate)
2521                 printk(KERN_INFO "btrfs: truncated %d orphans\n", nr_truncate);
2522
2523 out:
2524         if (ret)
2525                 printk(KERN_CRIT "btrfs: could not do orphan cleanup %d\n", ret);
2526         btrfs_free_path(path);
2527         return ret;
2528 }
2529
2530 /*
2531  * very simple check to peek ahead in the leaf looking for xattrs.  If we
2532  * don't find any xattrs, we know there can't be any acls.
2533  *
2534  * slot is the slot the inode is in, objectid is the objectid of the inode
2535  */
2536 static noinline int acls_after_inode_item(struct extent_buffer *leaf,
2537                                           int slot, u64 objectid)
2538 {
2539         u32 nritems = btrfs_header_nritems(leaf);
2540         struct btrfs_key found_key;
2541         int scanned = 0;
2542
2543         slot++;
2544         while (slot < nritems) {
2545                 btrfs_item_key_to_cpu(leaf, &found_key, slot);
2546
2547                 /* we found a different objectid, there must not be acls */
2548                 if (found_key.objectid != objectid)
2549                         return 0;
2550
2551                 /* we found an xattr, assume we've got an acl */
2552                 if (found_key.type == BTRFS_XATTR_ITEM_KEY)
2553                         return 1;
2554
2555                 /*
2556                  * we found a key greater than an xattr key, there can't
2557                  * be any acls later on
2558                  */
2559                 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
2560                         return 0;
2561
2562                 slot++;
2563                 scanned++;
2564
2565                 /*
2566                  * it goes inode, inode backrefs, xattrs, extents,
2567                  * so if there are a ton of hard links to an inode there can
2568                  * be a lot of backrefs.  Don't waste time searching too hard,
2569                  * this is just an optimization
2570                  */
2571                 if (scanned >= 8)
2572                         break;
2573         }
2574         /* we hit the end of the leaf before we found an xattr or
2575          * something larger than an xattr.  We have to assume the inode
2576          * has acls
2577          */
2578         return 1;
2579 }
2580
2581 /*
2582  * read an inode from the btree into the in-memory inode
2583  */
2584 static void btrfs_read_locked_inode(struct inode *inode)
2585 {
2586         struct btrfs_path *path;
2587         struct extent_buffer *leaf;
2588         struct btrfs_inode_item *inode_item;
2589         struct btrfs_timespec *tspec;
2590         struct btrfs_root *root = BTRFS_I(inode)->root;
2591         struct btrfs_key location;
2592         int maybe_acls;
2593         u32 rdev;
2594         int ret;
2595         bool filled = false;
2596
2597         ret = btrfs_fill_inode(inode, &rdev);
2598         if (!ret)
2599                 filled = true;
2600
2601         path = btrfs_alloc_path();
2602         if (!path)
2603                 goto make_bad;
2604
2605         path->leave_spinning = 1;
2606         memcpy(&location, &BTRFS_I(inode)->location, sizeof(location));
2607
2608         ret = btrfs_lookup_inode(NULL, root, path, &location, 0);
2609         if (ret)
2610                 goto make_bad;
2611
2612         leaf = path->nodes[0];
2613
2614         if (filled)
2615                 goto cache_acl;
2616
2617         inode_item = btrfs_item_ptr(leaf, path->slots[0],
2618                                     struct btrfs_inode_item);
2619         inode->i_mode = btrfs_inode_mode(leaf, inode_item);
2620         set_nlink(inode, btrfs_inode_nlink(leaf, inode_item));
2621         i_uid_write(inode, btrfs_inode_uid(leaf, inode_item));
2622         i_gid_write(inode, btrfs_inode_gid(leaf, inode_item));
2623         btrfs_i_size_write(inode, btrfs_inode_size(leaf, inode_item));
2624
2625         tspec = btrfs_inode_atime(inode_item);
2626         inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, tspec);
2627         inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, tspec);
2628
2629         tspec = btrfs_inode_mtime(inode_item);
2630         inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, tspec);
2631         inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, tspec);
2632
2633         tspec = btrfs_inode_ctime(inode_item);
2634         inode->i_ctime.tv_sec = btrfs_timespec_sec(leaf, tspec);
2635         inode->i_ctime.tv_nsec = btrfs_timespec_nsec(leaf, tspec);
2636
2637         inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item));
2638         BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item);
2639         BTRFS_I(inode)->last_trans = btrfs_inode_transid(leaf, inode_item);
2640
2641         /*
2642          * If we were modified in the current generation and evicted from memory
2643          * and then re-read we need to do a full sync since we don't have any
2644          * idea about which extents were modified before we were evicted from
2645          * cache.
2646          */
2647         if (BTRFS_I(inode)->last_trans == root->fs_info->generation)
2648                 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
2649                         &BTRFS_I(inode)->runtime_flags);
2650
2651         inode->i_version = btrfs_inode_sequence(leaf, inode_item);
2652         inode->i_generation = BTRFS_I(inode)->generation;
2653         inode->i_rdev = 0;
2654         rdev = btrfs_inode_rdev(leaf, inode_item);
2655
2656         BTRFS_I(inode)->index_cnt = (u64)-1;
2657         BTRFS_I(inode)->flags = btrfs_inode_flags(leaf, inode_item);
2658 cache_acl:
2659         /*
2660          * try to precache a NULL acl entry for files that don't have
2661          * any xattrs or acls
2662          */
2663         maybe_acls = acls_after_inode_item(leaf, path->slots[0],
2664                                            btrfs_ino(inode));
2665         if (!maybe_acls)
2666                 cache_no_acl(inode);
2667
2668         btrfs_free_path(path);
2669
2670         switch (inode->i_mode & S_IFMT) {
2671         case S_IFREG:
2672                 inode->i_mapping->a_ops = &btrfs_aops;
2673                 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
2674                 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
2675                 inode->i_fop = &btrfs_file_operations;
2676                 inode->i_op = &btrfs_file_inode_operations;
2677                 break;
2678         case S_IFDIR:
2679                 inode->i_fop = &btrfs_dir_file_operations;
2680                 if (root == root->fs_info->tree_root)
2681                         inode->i_op = &btrfs_dir_ro_inode_operations;
2682                 else
2683                         inode->i_op = &btrfs_dir_inode_operations;
2684                 break;
2685         case S_IFLNK:
2686                 inode->i_op = &btrfs_symlink_inode_operations;
2687                 inode->i_mapping->a_ops = &btrfs_symlink_aops;
2688                 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
2689                 break;
2690         default:
2691                 inode->i_op = &btrfs_special_inode_operations;
2692                 init_special_inode(inode, inode->i_mode, rdev);
2693                 break;
2694         }
2695
2696         btrfs_update_iflags(inode);
2697         return;
2698
2699 make_bad:
2700         btrfs_free_path(path);
2701         make_bad_inode(inode);
2702 }
2703
2704 /*
2705  * given a leaf and an inode, copy the inode fields into the leaf
2706  */
2707 static void fill_inode_item(struct btrfs_trans_handle *trans,
2708                             struct extent_buffer *leaf,
2709                             struct btrfs_inode_item *item,
2710                             struct inode *inode)
2711 {
2712         btrfs_set_inode_uid(leaf, item, i_uid_read(inode));
2713         btrfs_set_inode_gid(leaf, item, i_gid_read(inode));
2714         btrfs_set_inode_size(leaf, item, BTRFS_I(inode)->disk_i_size);
2715         btrfs_set_inode_mode(leaf, item, inode->i_mode);
2716         btrfs_set_inode_nlink(leaf, item, inode->i_nlink);
2717
2718         btrfs_set_timespec_sec(leaf, btrfs_inode_atime(item),
2719                                inode->i_atime.tv_sec);
2720         btrfs_set_timespec_nsec(leaf, btrfs_inode_atime(item),
2721                                 inode->i_atime.tv_nsec);
2722
2723         btrfs_set_timespec_sec(leaf, btrfs_inode_mtime(item),
2724                                inode->i_mtime.tv_sec);
2725         btrfs_set_timespec_nsec(leaf, btrfs_inode_mtime(item),
2726                                 inode->i_mtime.tv_nsec);
2727
2728         btrfs_set_timespec_sec(leaf, btrfs_inode_ctime(item),
2729                                inode->i_ctime.tv_sec);
2730         btrfs_set_timespec_nsec(leaf, btrfs_inode_ctime(item),
2731                                 inode->i_ctime.tv_nsec);
2732
2733         btrfs_set_inode_nbytes(leaf, item, inode_get_bytes(inode));
2734         btrfs_set_inode_generation(leaf, item, BTRFS_I(inode)->generation);
2735         btrfs_set_inode_sequence(leaf, item, inode->i_version);
2736         btrfs_set_inode_transid(leaf, item, trans->transid);
2737         btrfs_set_inode_rdev(leaf, item, inode->i_rdev);
2738         btrfs_set_inode_flags(leaf, item, BTRFS_I(inode)->flags);
2739         btrfs_set_inode_block_group(leaf, item, 0);
2740 }
2741
2742 /*
2743  * copy everything in the in-memory inode into the btree.
2744  */
2745 static noinline int btrfs_update_inode_item(struct btrfs_trans_handle *trans,
2746                                 struct btrfs_root *root, struct inode *inode)
2747 {
2748         struct btrfs_inode_item *inode_item;
2749         struct btrfs_path *path;
2750         struct extent_buffer *leaf;
2751         int ret;
2752
2753         path = btrfs_alloc_path();
2754         if (!path)
2755                 return -ENOMEM;
2756
2757         path->leave_spinning = 1;
2758         ret = btrfs_lookup_inode(trans, root, path, &BTRFS_I(inode)->location,
2759                                  1);
2760         if (ret) {
2761                 if (ret > 0)
2762                         ret = -ENOENT;
2763                 goto failed;
2764         }
2765
2766         btrfs_unlock_up_safe(path, 1);
2767         leaf = path->nodes[0];
2768         inode_item = btrfs_item_ptr(leaf, path->slots[0],
2769                                     struct btrfs_inode_item);
2770
2771         fill_inode_item(trans, leaf, inode_item, inode);
2772         btrfs_mark_buffer_dirty(leaf);
2773         btrfs_set_inode_last_trans(trans, inode);
2774         ret = 0;
2775 failed:
2776         btrfs_free_path(path);
2777         return ret;
2778 }
2779
2780 /*
2781  * copy everything in the in-memory inode into the btree.
2782  */
2783 noinline int btrfs_update_inode(struct btrfs_trans_handle *trans,
2784                                 struct btrfs_root *root, struct inode *inode)
2785 {
2786         int ret;
2787
2788         /*
2789          * If the inode is a free space inode, we can deadlock during commit
2790          * if we put it into the delayed code.
2791          *
2792          * The data relocation inode should also be directly updated
2793          * without delay
2794          */
2795         if (!btrfs_is_free_space_inode(inode)
2796             && root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID) {
2797                 btrfs_update_root_times(trans, root);
2798
2799                 ret = btrfs_delayed_update_inode(trans, root, inode);
2800                 if (!ret)
2801                         btrfs_set_inode_last_trans(trans, inode);
2802                 return ret;
2803         }
2804
2805         return btrfs_update_inode_item(trans, root, inode);
2806 }
2807
2808 noinline int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans,
2809                                          struct btrfs_root *root,
2810                                          struct inode *inode)
2811 {
2812         int ret;
2813
2814         ret = btrfs_update_inode(trans, root, inode);
2815         if (ret == -ENOSPC)
2816                 return btrfs_update_inode_item(trans, root, inode);
2817         return ret;
2818 }
2819
2820 /*
2821  * unlink helper that gets used here in inode.c and in the tree logging
2822  * recovery code.  It remove a link in a directory with a given name, and
2823  * also drops the back refs in the inode to the directory
2824  */
2825 static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans,
2826                                 struct btrfs_root *root,
2827                                 struct inode *dir, struct inode *inode,
2828                                 const char *name, int name_len)
2829 {
2830         struct btrfs_path *path;
2831         int ret = 0;
2832         struct extent_buffer *leaf;
2833         struct btrfs_dir_item *di;
2834         struct btrfs_key key;
2835         u64 index;
2836         u64 ino = btrfs_ino(inode);
2837         u64 dir_ino = btrfs_ino(dir);
2838
2839         path = btrfs_alloc_path();
2840         if (!path) {
2841                 ret = -ENOMEM;
2842                 goto out;
2843         }
2844
2845         path->leave_spinning = 1;
2846         di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
2847                                     name, name_len, -1);
2848         if (IS_ERR(di)) {
2849                 ret = PTR_ERR(di);
2850                 goto err;
2851         }
2852         if (!di) {
2853                 ret = -ENOENT;
2854                 goto err;
2855         }
2856         leaf = path->nodes[0];
2857         btrfs_dir_item_key_to_cpu(leaf, di, &key);
2858         ret = btrfs_delete_one_dir_name(trans, root, path, di);
2859         if (ret)
2860                 goto err;
2861         btrfs_release_path(path);
2862
2863         ret = btrfs_del_inode_ref(trans, root, name, name_len, ino,
2864                                   dir_ino, &index);
2865         if (ret) {
2866                 printk(KERN_INFO "btrfs failed to delete reference to %.*s, "
2867                        "inode %llu parent %llu\n", name_len, name,
2868                        (unsigned long long)ino, (unsigned long long)dir_ino);
2869                 btrfs_abort_transaction(trans, root, ret);
2870                 goto err;
2871         }
2872
2873         ret = btrfs_delete_delayed_dir_index(trans, root, dir, index);
2874         if (ret) {
2875                 btrfs_abort_transaction(trans, root, ret);
2876                 goto err;
2877         }
2878
2879         ret = btrfs_del_inode_ref_in_log(trans, root, name, name_len,
2880                                          inode, dir_ino);
2881         if (ret != 0 && ret != -ENOENT) {
2882                 btrfs_abort_transaction(trans, root, ret);
2883                 goto err;
2884         }
2885
2886         ret = btrfs_del_dir_entries_in_log(trans, root, name, name_len,
2887                                            dir, index);
2888         if (ret == -ENOENT)
2889                 ret = 0;
2890 err:
2891         btrfs_free_path(path);
2892         if (ret)
2893                 goto out;
2894
2895         btrfs_i_size_write(dir, dir->i_size - name_len * 2);
2896         inode_inc_iversion(inode);
2897         inode_inc_iversion(dir);
2898         inode->i_ctime = dir->i_mtime = dir->i_ctime = CURRENT_TIME;
2899         ret = btrfs_update_inode(trans, root, dir);
2900 out:
2901         return ret;
2902 }
2903
2904 int btrfs_unlink_inode(struct btrfs_trans_handle *trans,
2905                        struct btrfs_root *root,
2906                        struct inode *dir, struct inode *inode,
2907                        const char *name, int name_len)
2908 {
2909         int ret;
2910         ret = __btrfs_unlink_inode(trans, root, dir, inode, name, name_len);
2911         if (!ret) {
2912                 btrfs_drop_nlink(inode);
2913                 ret = btrfs_update_inode(trans, root, inode);
2914         }
2915         return ret;
2916 }
2917
2918
2919 /* helper to check if there is any shared block in the path */
2920 static int check_path_shared(struct btrfs_root *root,
2921                              struct btrfs_path *path)
2922 {
2923         struct extent_buffer *eb;
2924         int level;
2925         u64 refs = 1;
2926
2927         for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
2928                 int ret;
2929
2930                 if (!path->nodes[level])
2931                         break;
2932                 eb = path->nodes[level];
2933                 if (!btrfs_block_can_be_shared(root, eb))
2934                         continue;
2935                 ret = btrfs_lookup_extent_info(NULL, root, eb->start, eb->len,
2936                                                &refs, NULL);
2937                 if (refs > 1)
2938                         return 1;
2939         }
2940         return 0;
2941 }
2942
2943 /*
2944  * helper to start transaction for unlink and rmdir.
2945  *
2946  * unlink and rmdir are special in btrfs, they do not always free space.
2947  * so in enospc case, we should make sure they will free space before
2948  * allowing them to use the global metadata reservation.
2949  */
2950 static struct btrfs_trans_handle *__unlink_start_trans(struct inode *dir,
2951                                                        struct dentry *dentry)
2952 {
2953         struct btrfs_trans_handle *trans;
2954         struct btrfs_root *root = BTRFS_I(dir)->root;
2955         struct btrfs_path *path;
2956         struct btrfs_dir_item *di;
2957         struct inode *inode = dentry->d_inode;
2958         u64 index;
2959         int check_link = 1;
2960         int err = -ENOSPC;
2961         int ret;
2962         u64 ino = btrfs_ino(inode);
2963         u64 dir_ino = btrfs_ino(dir);
2964
2965         /*
2966          * 1 for the possible orphan item
2967          * 1 for the dir item
2968          * 1 for the dir index
2969          * 1 for the inode ref
2970          * 1 for the inode ref in the tree log
2971          * 2 for the dir entries in the log
2972          * 1 for the inode
2973          */
2974         trans = btrfs_start_transaction(root, 8);
2975         if (!IS_ERR(trans) || PTR_ERR(trans) != -ENOSPC)
2976                 return trans;
2977
2978         if (ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
2979                 return ERR_PTR(-ENOSPC);
2980
2981         /* check if there is someone else holds reference */
2982         if (S_ISDIR(inode->i_mode) && atomic_read(&inode->i_count) > 1)
2983                 return ERR_PTR(-ENOSPC);
2984
2985         if (atomic_read(&inode->i_count) > 2)
2986                 return ERR_PTR(-ENOSPC);
2987
2988         if (xchg(&root->fs_info->enospc_unlink, 1))
2989                 return ERR_PTR(-ENOSPC);
2990
2991         path = btrfs_alloc_path();
2992         if (!path) {
2993                 root->fs_info->enospc_unlink = 0;
2994                 return ERR_PTR(-ENOMEM);
2995         }
2996
2997         /* 1 for the orphan item */
2998         trans = btrfs_start_transaction(root, 1);
2999         if (IS_ERR(trans)) {
3000                 btrfs_free_path(path);
3001                 root->fs_info->enospc_unlink = 0;
3002                 return trans;
3003         }
3004
3005         path->skip_locking = 1;
3006         path->search_commit_root = 1;
3007
3008         ret = btrfs_lookup_inode(trans, root, path,
3009                                 &BTRFS_I(dir)->location, 0);
3010         if (ret < 0) {
3011                 err = ret;
3012                 goto out;
3013         }
3014         if (ret == 0) {
3015                 if (check_path_shared(root, path))
3016                         goto out;
3017         } else {
3018                 check_link = 0;
3019         }
3020         btrfs_release_path(path);
3021
3022         ret = btrfs_lookup_inode(trans, root, path,
3023                                 &BTRFS_I(inode)->location, 0);
3024         if (ret < 0) {
3025                 err = ret;
3026                 goto out;
3027         }
3028         if (ret == 0) {
3029                 if (check_path_shared(root, path))
3030                         goto out;
3031         } else {
3032                 check_link = 0;
3033         }
3034         btrfs_release_path(path);
3035
3036         if (ret == 0 && S_ISREG(inode->i_mode)) {
3037                 ret = btrfs_lookup_file_extent(trans, root, path,
3038                                                ino, (u64)-1, 0);
3039                 if (ret < 0) {
3040                         err = ret;
3041                         goto out;
3042                 }
3043                 BUG_ON(ret == 0); /* Corruption */
3044                 if (check_path_shared(root, path))
3045                         goto out;
3046                 btrfs_release_path(path);
3047         }
3048
3049         if (!check_link) {
3050                 err = 0;
3051                 goto out;
3052         }
3053
3054         di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
3055                                 dentry->d_name.name, dentry->d_name.len, 0);
3056         if (IS_ERR(di)) {
3057                 err = PTR_ERR(di);
3058                 goto out;
3059         }
3060         if (di) {
3061                 if (check_path_shared(root, path))
3062                         goto out;
3063         } else {
3064                 err = 0;
3065                 goto out;
3066         }
3067         btrfs_release_path(path);
3068
3069         ret = btrfs_get_inode_ref_index(trans, root, path, dentry->d_name.name,
3070                                         dentry->d_name.len, ino, dir_ino, 0,
3071                                         &index);
3072         if (ret) {
3073                 err = ret;
3074                 goto out;
3075         }
3076
3077         if (check_path_shared(root, path))
3078                 goto out;
3079
3080         btrfs_release_path(path);
3081
3082         /*
3083          * This is a commit root search, if we can lookup inode item and other
3084          * relative items in the commit root, it means the transaction of
3085          * dir/file creation has been committed, and the dir index item that we
3086          * delay to insert has also been inserted into the commit root. So
3087          * we needn't worry about the delayed insertion of the dir index item
3088          * here.
3089          */
3090         di = btrfs_lookup_dir_index_item(trans, root, path, dir_ino, index,
3091                                 dentry->d_name.name, dentry->d_name.len, 0);
3092         if (IS_ERR(di)) {
3093                 err = PTR_ERR(di);
3094                 goto out;
3095         }
3096         BUG_ON(ret == -ENOENT);
3097         if (check_path_shared(root, path))
3098                 goto out;
3099
3100         err = 0;
3101 out:
3102         btrfs_free_path(path);
3103         /* Migrate the orphan reservation over */
3104         if (!err)
3105                 err = btrfs_block_rsv_migrate(trans->block_rsv,
3106                                 &root->fs_info->global_block_rsv,
3107                                 trans->bytes_reserved);
3108
3109         if (err) {
3110                 btrfs_end_transaction(trans, root);
3111                 root->fs_info->enospc_unlink = 0;
3112                 return ERR_PTR(err);
3113         }
3114
3115         trans->block_rsv = &root->fs_info->global_block_rsv;
3116         return trans;
3117 }
3118
3119 static void __unlink_end_trans(struct btrfs_trans_handle *trans,
3120                                struct btrfs_root *root)
3121 {
3122         if (trans->block_rsv->type == BTRFS_BLOCK_RSV_GLOBAL) {
3123                 btrfs_block_rsv_release(root, trans->block_rsv,
3124                                         trans->bytes_reserved);
3125                 trans->block_rsv = &root->fs_info->trans_block_rsv;
3126                 BUG_ON(!root->fs_info->enospc_unlink);
3127                 root->fs_info->enospc_unlink = 0;
3128         }
3129         btrfs_end_transaction(trans, root);
3130 }
3131
3132 static int btrfs_unlink(struct inode *dir, struct dentry *dentry)
3133 {
3134         struct btrfs_root *root = BTRFS_I(dir)->root;
3135         struct btrfs_trans_handle *trans;
3136         struct inode *inode = dentry->d_inode;
3137         int ret;
3138
3139         trans = __unlink_start_trans(dir, dentry);
3140         if (IS_ERR(trans))
3141                 return PTR_ERR(trans);
3142
3143         btrfs_record_unlink_dir(trans, dir, dentry->d_inode, 0);
3144
3145         ret = btrfs_unlink_inode(trans, root, dir, dentry->d_inode,
3146                                  dentry->d_name.name, dentry->d_name.len);
3147         if (ret)
3148                 goto out;
3149
3150         if (inode->i_nlink == 0) {
3151                 ret = btrfs_orphan_add(trans, inode);
3152                 if (ret)
3153                         goto out;
3154         }
3155
3156 out:
3157         __unlink_end_trans(trans, root);
3158         btrfs_btree_balance_dirty(root);
3159         return ret;
3160 }
3161
3162 int btrfs_unlink_subvol(struct btrfs_trans_handle *trans,
3163                         struct btrfs_root *root,
3164                         struct inode *dir, u64 objectid,
3165                         const char *name, int name_len)
3166 {
3167         struct btrfs_path *path;
3168         struct extent_buffer *leaf;
3169         struct btrfs_dir_item *di;
3170         struct btrfs_key key;
3171         u64 index;
3172         int ret;
3173         u64 dir_ino = btrfs_ino(dir);
3174
3175         path = btrfs_alloc_path();
3176         if (!path)
3177                 return -ENOMEM;
3178
3179         di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
3180                                    name, name_len, -1);
3181         if (IS_ERR_OR_NULL(di)) {
3182                 if (!di)
3183                         ret = -ENOENT;
3184                 else
3185                         ret = PTR_ERR(di);
3186                 goto out;
3187         }
3188
3189         leaf = path->nodes[0];
3190         btrfs_dir_item_key_to_cpu(leaf, di, &key);
3191         WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid);
3192         ret = btrfs_delete_one_dir_name(trans, root, path, di);
3193         if (ret) {
3194                 btrfs_abort_transaction(trans, root, ret);
3195                 goto out;
3196         }
3197         btrfs_release_path(path);
3198
3199         ret = btrfs_del_root_ref(trans, root->fs_info->tree_root,
3200                                  objectid, root->root_key.objectid,
3201                                  dir_ino, &index, name, name_len);
3202         if (ret < 0) {
3203                 if (ret != -ENOENT) {
3204                         btrfs_abort_transaction(trans, root, ret);
3205                         goto out;
3206                 }
3207                 di = btrfs_search_dir_index_item(root, path, dir_ino,
3208                                                  name, name_len);
3209                 if (IS_ERR_OR_NULL(di)) {
3210                         if (!di)
3211                                 ret = -ENOENT;
3212                         else
3213                                 ret = PTR_ERR(di);
3214                         btrfs_abort_transaction(trans, root, ret);
3215                         goto out;
3216                 }
3217
3218                 leaf = path->nodes[0];
3219                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
3220                 btrfs_release_path(path);
3221                 index = key.offset;
3222         }
3223         btrfs_release_path(path);
3224
3225         ret = btrfs_delete_delayed_dir_index(trans, root, dir, index);
3226         if (ret) {
3227                 btrfs_abort_transaction(trans, root, ret);
3228                 goto out;
3229         }
3230
3231         btrfs_i_size_write(dir, dir->i_size - name_len * 2);
3232         inode_inc_iversion(dir);
3233         dir->i_mtime = dir->i_ctime = CURRENT_TIME;
3234         ret = btrfs_update_inode_fallback(trans, root, dir);
3235         if (ret)
3236                 btrfs_abort_transaction(trans, root, ret);
3237 out:
3238         btrfs_free_path(path);
3239         return ret;
3240 }
3241
3242 static int btrfs_rmdir(struct inode *dir, struct dentry *dentry)
3243 {
3244         struct inode *inode = dentry->d_inode;
3245         int err = 0;
3246         struct btrfs_root *root = BTRFS_I(dir)->root;
3247         struct btrfs_trans_handle *trans;
3248
3249         if (inode->i_size > BTRFS_EMPTY_DIR_SIZE)
3250                 return -ENOTEMPTY;
3251         if (btrfs_ino(inode) == BTRFS_FIRST_FREE_OBJECTID)
3252                 return -EPERM;
3253
3254         trans = __unlink_start_trans(dir, dentry);
3255         if (IS_ERR(trans))
3256                 return PTR_ERR(trans);
3257
3258         if (unlikely(btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
3259                 err = btrfs_unlink_subvol(trans, root, dir,
3260                                           BTRFS_I(inode)->location.objectid,
3261                                           dentry->d_name.name,
3262                                           dentry->d_name.len);
3263                 goto out;
3264         }
3265
3266         err = btrfs_orphan_add(trans, inode);
3267         if (err)
3268                 goto out;
3269
3270         /* now the directory is empty */
3271         err = btrfs_unlink_inode(trans, root, dir, dentry->d_inode,
3272                                  dentry->d_name.name, dentry->d_name.len);
3273         if (!err)
3274                 btrfs_i_size_write(inode, 0);
3275 out:
3276         __unlink_end_trans(trans, root);
3277         btrfs_btree_balance_dirty(root);
3278
3279         return err;
3280 }
3281
3282 /*
3283  * this can truncate away extent items, csum items and directory items.
3284  * It starts at a high offset and removes keys until it can't find
3285  * any higher than new_size
3286  *
3287  * csum items that cross the new i_size are truncated to the new size
3288  * as well.
3289  *
3290  * min_type is the minimum key type to truncate down to.  If set to 0, this
3291  * will kill all the items on this inode, including the INODE_ITEM_KEY.
3292  */
3293 int btrfs_truncate_inode_items(struct btrfs_trans_handle *trans,
3294                                struct btrfs_root *root,
3295                                struct inode *inode,
3296                                u64 new_size, u32 min_type)
3297 {
3298         struct btrfs_path *path;
3299         struct extent_buffer *leaf;
3300         struct btrfs_file_extent_item *fi;
3301         struct btrfs_key key;
3302         struct btrfs_key found_key;
3303         u64 extent_start = 0;
3304         u64 extent_num_bytes = 0;
3305         u64 extent_offset = 0;
3306         u64 item_end = 0;
3307         u64 mask = root->sectorsize - 1;
3308         u32 found_type = (u8)-1;
3309         int found_extent;
3310         int del_item;
3311         int pending_del_nr = 0;
3312         int pending_del_slot = 0;
3313         int extent_type = -1;
3314         int ret;
3315         int err = 0;
3316         u64 ino = btrfs_ino(inode);
3317
3318         BUG_ON(new_size > 0 && min_type != BTRFS_EXTENT_DATA_KEY);
3319
3320         path = btrfs_alloc_path();
3321         if (!path)
3322                 return -ENOMEM;
3323         path->reada = -1;
3324
3325         /*
3326          * We want to drop from the next block forward in case this new size is
3327          * not block aligned since we will be keeping the last block of the
3328          * extent just the way it is.
3329          */
3330         if (root->ref_cows || root == root->fs_info->tree_root)
3331                 btrfs_drop_extent_cache(inode, (new_size + mask) & (~mask), (u64)-1, 0);
3332
3333         /*
3334          * This function is also used to drop the items in the log tree before
3335          * we relog the inode, so if root != BTRFS_I(inode)->root, it means
3336          * it is used to drop the loged items. So we shouldn't kill the delayed
3337          * items.
3338          */
3339         if (min_type == 0 && root == BTRFS_I(inode)->root)
3340                 btrfs_kill_delayed_inode_items(inode);
3341
3342         key.objectid = ino;
3343         key.offset = (u64)-1;
3344         key.type = (u8)-1;
3345
3346 search_again:
3347         path->leave_spinning = 1;
3348         ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
3349         if (ret < 0) {
3350                 err = ret;
3351                 goto out;
3352         }
3353
3354         if (ret > 0) {
3355                 /* there are no items in the tree for us to truncate, we're
3356                  * done
3357                  */
3358                 if (path->slots[0] == 0)
3359                         goto out;
3360                 path->slots[0]--;
3361         }
3362
3363         while (1) {
3364                 fi = NULL;
3365                 leaf = path->nodes[0];
3366                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3367                 found_type = btrfs_key_type(&found_key);
3368
3369                 if (found_key.objectid != ino)
3370                         break;
3371
3372                 if (found_type < min_type)
3373                         break;
3374
3375                 item_end = found_key.offset;
3376                 if (found_type == BTRFS_EXTENT_DATA_KEY) {
3377                         fi = btrfs_item_ptr(leaf, path->slots[0],
3378                                             struct btrfs_file_extent_item);
3379                         extent_type = btrfs_file_extent_type(leaf, fi);
3380                         if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
3381                                 item_end +=
3382                                     btrfs_file_extent_num_bytes(leaf, fi);
3383                         } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
3384                                 item_end += btrfs_file_extent_inline_len(leaf,
3385                                                                          fi);
3386                         }
3387                         item_end--;
3388                 }
3389                 if (found_type > min_type) {
3390                         del_item = 1;
3391                 } else {
3392                         if (item_end < new_size)
3393                                 break;
3394                         if (found_key.offset >= new_size)
3395                                 del_item = 1;
3396                         else
3397                                 del_item = 0;
3398                 }
3399                 found_extent = 0;
3400                 /* FIXME, shrink the extent if the ref count is only 1 */
3401                 if (found_type != BTRFS_EXTENT_DATA_KEY)
3402                         goto delete;
3403
3404                 if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
3405                         u64 num_dec;
3406                         extent_start = btrfs_file_extent_disk_bytenr(leaf, fi);
3407                         if (!del_item) {
3408                                 u64 orig_num_bytes =
3409                                         btrfs_file_extent_num_bytes(leaf, fi);
3410                                 extent_num_bytes = new_size -
3411                                         found_key.offset + root->sectorsize - 1;
3412                                 extent_num_bytes = extent_num_bytes &
3413                                         ~((u64)root->sectorsize - 1);
3414                                 btrfs_set_file_extent_num_bytes(leaf, fi,
3415                                                          extent_num_bytes);
3416                                 num_dec = (orig_num_bytes -
3417                                            extent_num_bytes);
3418                                 if (root->ref_cows && extent_start != 0)
3419                                         inode_sub_bytes(inode, num_dec);
3420                                 btrfs_mark_buffer_dirty(leaf);
3421                         } else {
3422                                 extent_num_bytes =
3423                                         btrfs_file_extent_disk_num_bytes(leaf,
3424                                                                          fi);
3425                                 extent_offset = found_key.offset -
3426                                         btrfs_file_extent_offset(leaf, fi);
3427
3428                                 /* FIXME blocksize != 4096 */
3429                                 num_dec = btrfs_file_extent_num_bytes(leaf, fi);
3430                                 if (extent_start != 0) {
3431                                         found_extent = 1;
3432                                         if (root->ref_cows)
3433                                                 inode_sub_bytes(inode, num_dec);
3434                                 }
3435                         }
3436                 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
3437                         /*
3438                          * we can't truncate inline items that have had
3439                          * special encodings
3440                          */
3441                         if (!del_item &&
3442                             btrfs_file_extent_compression(leaf, fi) == 0 &&
3443                             btrfs_file_extent_encryption(leaf, fi) == 0 &&
3444                             btrfs_file_extent_other_encoding(leaf, fi) == 0) {
3445                                 u32 size = new_size - found_key.offset;
3446
3447                                 if (root->ref_cows) {
3448                                         inode_sub_bytes(inode, item_end + 1 -
3449                                                         new_size);
3450                                 }
3451                                 size =
3452                                     btrfs_file_extent_calc_inline_size(size);
3453                                 btrfs_truncate_item(trans, root, path,
3454                                                     size, 1);
3455                         } else if (root->ref_cows) {
3456                                 inode_sub_bytes(inode, item_end + 1 -
3457                                                 found_key.offset);
3458                         }
3459                 }
3460 delete:
3461                 if (del_item) {
3462                         if (!pending_del_nr) {
3463                                 /* no pending yet, add ourselves */
3464                                 pending_del_slot = path->slots[0];
3465                                 pending_del_nr = 1;
3466                         } else if (pending_del_nr &&
3467                                    path->slots[0] + 1 == pending_del_slot) {
3468                                 /* hop on the pending chunk */
3469                                 pending_del_nr++;
3470                                 pending_del_slot = path->slots[0];
3471                         } else {
3472                                 BUG();
3473                         }
3474                 } else {
3475                         break;
3476                 }
3477                 if (found_extent && (root->ref_cows ||
3478                                      root == root->fs_info->tree_root)) {
3479                         btrfs_set_path_blocking(path);
3480                         ret = btrfs_free_extent(trans, root, extent_start,
3481                                                 extent_num_bytes, 0,
3482                                                 btrfs_header_owner(leaf),
3483                                                 ino, extent_offset, 0);
3484                         BUG_ON(ret);
3485                 }
3486
3487                 if (found_type == BTRFS_INODE_ITEM_KEY)
3488                         break;
3489
3490                 if (path->slots[0] == 0 ||
3491                     path->slots[0] != pending_del_slot) {
3492                         if (pending_del_nr) {
3493                                 ret = btrfs_del_items(trans, root, path,
3494                                                 pending_del_slot,
3495                                                 pending_del_nr);
3496                                 if (ret) {
3497                                         btrfs_abort_transaction(trans,
3498                                                                 root, ret);
3499                                         goto error;
3500                                 }
3501                                 pending_del_nr = 0;
3502                         }
3503                         btrfs_release_path(path);
3504                         goto search_again;
3505                 } else {
3506                         path->slots[0]--;
3507                 }
3508         }
3509 out:
3510         if (pending_del_nr) {
3511                 ret = btrfs_del_items(trans, root, path, pending_del_slot,
3512                                       pending_del_nr);
3513                 if (ret)
3514                         btrfs_abort_transaction(trans, root, ret);
3515         }
3516 error:
3517         btrfs_free_path(path);
3518         return err;
3519 }
3520
3521 /*
3522  * btrfs_truncate_page - read, zero a chunk and write a page
3523  * @inode - inode that we're zeroing
3524  * @from - the offset to start zeroing
3525  * @len - the length to zero, 0 to zero the entire range respective to the
3526  *      offset
3527  * @front - zero up to the offset instead of from the offset on
3528  *
3529  * This will find the page for the "from" offset and cow the page and zero the
3530  * part we want to zero.  This is used with truncate and hole punching.
3531  */
3532 int btrfs_truncate_page(struct inode *inode, loff_t from, loff_t len,
3533                         int front)
3534 {
3535         struct address_space *mapping = inode->i_mapping;
3536         struct btrfs_root *root = BTRFS_I(inode)->root;
3537         struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
3538         struct btrfs_ordered_extent *ordered;
3539         struct extent_state *cached_state = NULL;
3540         char *kaddr;
3541         u32 blocksize = root->sectorsize;
3542         pgoff_t index = from >> PAGE_CACHE_SHIFT;
3543         unsigned offset = from & (PAGE_CACHE_SIZE-1);
3544         struct page *page;
3545         gfp_t mask = btrfs_alloc_write_mask(mapping);
3546         int ret = 0;
3547         u64 page_start;
3548         u64 page_end;
3549
3550         if ((offset & (blocksize - 1)) == 0 &&
3551             (!len || ((len & (blocksize - 1)) == 0)))
3552                 goto out;
3553         ret = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE);
3554         if (ret)
3555                 goto out;
3556
3557 again:
3558         page = find_or_create_page(mapping, index, mask);
3559         if (!page) {
3560                 btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE);
3561                 ret = -ENOMEM;
3562                 goto out;
3563         }
3564
3565         page_start = page_offset(page);
3566         page_end = page_start + PAGE_CACHE_SIZE - 1;
3567
3568         if (!PageUptodate(page)) {
3569                 ret = btrfs_readpage(NULL, page);
3570                 lock_page(page);
3571                 if (page->mapping != mapping) {
3572                         unlock_page(page);
3573                         page_cache_release(page);
3574                         goto again;
3575                 }
3576                 if (!PageUptodate(page)) {
3577                         ret = -EIO;
3578                         goto out_unlock;
3579                 }
3580         }
3581         wait_on_page_writeback(page);
3582
3583         lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state);
3584         set_page_extent_mapped(page);
3585
3586         ordered = btrfs_lookup_ordered_extent(inode, page_start);
3587         if (ordered) {
3588                 unlock_extent_cached(io_tree, page_start, page_end,
3589                                      &cached_state, GFP_NOFS);
3590                 unlock_page(page);
3591                 page_cache_release(page);
3592                 btrfs_start_ordered_extent(inode, ordered, 1);
3593                 btrfs_put_ordered_extent(ordered);
3594                 goto again;
3595         }
3596
3597         clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end,
3598                           EXTENT_DIRTY | EXTENT_DELALLOC |
3599                           EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
3600                           0, 0, &cached_state, GFP_NOFS);
3601
3602         ret = btrfs_set_extent_delalloc(inode, page_start, page_end,
3603                                         &cached_state);
3604         if (ret) {
3605                 unlock_extent_cached(io_tree, page_start, page_end,
3606                                      &cached_state, GFP_NOFS);
3607                 goto out_unlock;
3608         }
3609
3610         if (offset != PAGE_CACHE_SIZE) {
3611                 if (!len)
3612                         len = PAGE_CACHE_SIZE - offset;
3613                 kaddr = kmap(page);
3614                 if (front)
3615                         memset(kaddr, 0, offset);
3616                 else
3617                         memset(kaddr + offset, 0, len);
3618                 flush_dcache_page(page);
3619                 kunmap(page);
3620         }
3621         ClearPageChecked(page);
3622         set_page_dirty(page);
3623         unlock_extent_cached(io_tree, page_start, page_end, &cached_state,
3624                              GFP_NOFS);
3625
3626 out_unlock:
3627         if (ret)
3628                 btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE);
3629         unlock_page(page);
3630         page_cache_release(page);
3631 out:
3632         return ret;
3633 }
3634
3635 /*
3636  * This function puts in dummy file extents for the area we're creating a hole
3637  * for.  So if we are truncating this file to a larger size we need to insert
3638  * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for
3639  * the range between oldsize and size
3640  */
3641 int btrfs_cont_expand(struct inode *inode, loff_t oldsize, loff_t size)
3642 {
3643         struct btrfs_trans_handle *trans;
3644         struct btrfs_root *root = BTRFS_I(inode)->root;
3645         struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
3646         struct extent_map *em = NULL;
3647         struct extent_state *cached_state = NULL;
3648         struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
3649         u64 mask = root->sectorsize - 1;
3650         u64 hole_start = (oldsize + mask) & ~mask;
3651         u64 block_end = (size + mask) & ~mask;
3652         u64 last_byte;
3653         u64 cur_offset;
3654         u64 hole_size;
3655         int err = 0;
3656
3657         if (size <= hole_start)
3658                 return 0;
3659
3660         while (1) {
3661                 struct btrfs_ordered_extent *ordered;
3662                 btrfs_wait_ordered_range(inode, hole_start,
3663                                          block_end - hole_start);
3664                 lock_extent_bits(io_tree, hole_start, block_end - 1, 0,
3665                                  &cached_state);
3666                 ordered = btrfs_lookup_ordered_extent(inode, hole_start);
3667                 if (!ordered)
3668                         break;
3669                 unlock_extent_cached(io_tree, hole_start, block_end - 1,
3670                                      &cached_state, GFP_NOFS);
3671                 btrfs_put_ordered_extent(ordered);
3672         }
3673
3674         cur_offset = hole_start;
3675         while (1) {
3676                 em = btrfs_get_extent(inode, NULL, 0, cur_offset,
3677                                 block_end - cur_offset, 0);
3678                 if (IS_ERR(em)) {
3679                         err = PTR_ERR(em);
3680                         break;
3681                 }
3682                 last_byte = min(extent_map_end(em), block_end);
3683                 last_byte = (last_byte + mask) & ~mask;
3684                 if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
3685                         struct extent_map *hole_em;
3686                         hole_size = last_byte - cur_offset;
3687
3688                         trans = btrfs_start_transaction(root, 3);
3689                         if (IS_ERR(trans)) {
3690                                 err = PTR_ERR(trans);
3691                                 break;
3692                         }
3693
3694                         err = btrfs_drop_extents(trans, root, inode,
3695                                                  cur_offset,
3696                                                  cur_offset + hole_size, 1);
3697                         if (err) {
3698                                 btrfs_abort_transaction(trans, root, err);
3699                                 btrfs_end_transaction(trans, root);
3700                                 break;
3701                         }
3702
3703                         err = btrfs_insert_file_extent(trans, root,
3704                                         btrfs_ino(inode), cur_offset, 0,
3705                                         0, hole_size, 0, hole_size,
3706                                         0, 0, 0);
3707                         if (err) {
3708                                 btrfs_abort_transaction(trans, root, err);
3709                                 btrfs_end_transaction(trans, root);
3710                                 break;
3711                         }
3712
3713                         btrfs_drop_extent_cache(inode, cur_offset,
3714                                                 cur_offset + hole_size - 1, 0);
3715                         hole_em = alloc_extent_map();
3716                         if (!hole_em) {
3717                                 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
3718                                         &BTRFS_I(inode)->runtime_flags);
3719                                 goto next;
3720                         }
3721                         hole_em->start = cur_offset;
3722                         hole_em->len = hole_size;
3723                         hole_em->orig_start = cur_offset;
3724
3725                         hole_em->block_start = EXTENT_MAP_HOLE;
3726                         hole_em->block_len = 0;
3727                         hole_em->orig_block_len = 0;
3728                         hole_em->bdev = root->fs_info->fs_devices->latest_bdev;
3729                         hole_em->compress_type = BTRFS_COMPRESS_NONE;
3730                         hole_em->generation = trans->transid;
3731
3732                         while (1) {
3733                                 write_lock(&em_tree->lock);
3734                                 err = add_extent_mapping(em_tree, hole_em);
3735                                 if (!err)
3736                                         list_move(&hole_em->list,
3737                                                   &em_tree->modified_extents);
3738                                 write_unlock(&em_tree->lock);
3739                                 if (err != -EEXIST)
3740                                         break;
3741                                 btrfs_drop_extent_cache(inode, cur_offset,
3742                                                         cur_offset +
3743                                                         hole_size - 1, 0);
3744                         }
3745                         free_extent_map(hole_em);
3746 next:
3747                         btrfs_update_inode(trans, root, inode);
3748                         btrfs_end_transaction(trans, root);
3749                 }
3750                 free_extent_map(em);
3751                 em = NULL;
3752                 cur_offset = last_byte;
3753                 if (cur_offset >= block_end)
3754                         break;
3755         }
3756
3757         free_extent_map(em);
3758         unlock_extent_cached(io_tree, hole_start, block_end - 1, &cached_state,
3759                              GFP_NOFS);
3760         return err;
3761 }
3762
3763 static int btrfs_setsize(struct inode *inode, loff_t newsize)
3764 {
3765         struct btrfs_root *root = BTRFS_I(inode)->root;
3766         struct btrfs_trans_handle *trans;
3767         loff_t oldsize = i_size_read(inode);
3768         int ret;
3769
3770         if (newsize == oldsize)
3771                 return 0;
3772
3773         if (newsize > oldsize) {
3774                 truncate_pagecache(inode, oldsize, newsize);
3775                 ret = btrfs_cont_expand(inode, oldsize, newsize);
3776                 if (ret)
3777                         return ret;
3778
3779                 trans = btrfs_start_transaction(root, 1);
3780                 if (IS_ERR(trans))
3781                         return PTR_ERR(trans);
3782
3783                 i_size_write(inode, newsize);
3784                 btrfs_ordered_update_i_size(inode, i_size_read(inode), NULL);
3785                 ret = btrfs_update_inode(trans, root, inode);
3786                 btrfs_end_transaction(trans, root);
3787         } else {
3788
3789                 /*
3790                  * We're truncating a file that used to have good data down to
3791                  * zero. Make sure it gets into the ordered flush list so that
3792                  * any new writes get down to disk quickly.
3793                  */
3794                 if (newsize == 0)
3795                         set_bit(BTRFS_INODE_ORDERED_DATA_CLOSE,
3796                                 &BTRFS_I(inode)->runtime_flags);
3797
3798                 /*
3799                  * 1 for the orphan item we're going to add
3800                  * 1 for the orphan item deletion.
3801                  */
3802                 trans = btrfs_start_transaction(root, 2);
3803                 if (IS_ERR(trans))
3804                         return PTR_ERR(trans);
3805
3806                 /*
3807                  * We need to do this in case we fail at _any_ point during the
3808                  * actual truncate.  Once we do the truncate_setsize we could
3809                  * invalidate pages which forces any outstanding ordered io to
3810                  * be instantly completed which will give us extents that need
3811                  * to be truncated.  If we fail to get an orphan inode down we
3812                  * could have left over extents that were never meant to live,
3813                  * so we need to garuntee from this point on that everything
3814                  * will be consistent.
3815                  */
3816                 ret = btrfs_orphan_add(trans, inode);
3817                 btrfs_end_transaction(trans, root);
3818                 if (ret)
3819                         return ret;
3820
3821                 /* we don't support swapfiles, so vmtruncate shouldn't fail */
3822                 truncate_setsize(inode, newsize);
3823                 ret = btrfs_truncate(inode);
3824                 if (ret && inode->i_nlink)
3825                         btrfs_orphan_del(NULL, inode);
3826         }
3827
3828         return ret;
3829 }
3830
3831 static int btrfs_setattr(struct dentry *dentry, struct iattr *attr)
3832 {
3833         struct inode *inode = dentry->d_inode;
3834         struct btrfs_root *root = BTRFS_I(inode)->root;
3835         int err;
3836
3837         if (btrfs_root_readonly(root))
3838                 return -EROFS;
3839
3840         err = inode_change_ok(inode, attr);
3841         if (err)
3842                 return err;
3843
3844         if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) {
3845                 err = btrfs_setsize(inode, attr->ia_size);
3846                 if (err)
3847                         return err;
3848         }
3849
3850         if (attr->ia_valid) {
3851                 setattr_copy(inode, attr);
3852                 inode_inc_iversion(inode);
3853                 err = btrfs_dirty_inode(inode);
3854
3855                 if (!err && attr->ia_valid & ATTR_MODE)
3856                         err = btrfs_acl_chmod(inode);
3857         }
3858
3859         return err;
3860 }
3861
3862 void btrfs_evict_inode(struct inode *inode)
3863 {
3864         struct btrfs_trans_handle *trans;
3865         struct btrfs_root *root = BTRFS_I(inode)->root;
3866         struct btrfs_block_rsv *rsv, *global_rsv;
3867         u64 min_size = btrfs_calc_trunc_metadata_size(root, 1);
3868         int ret;
3869
3870         trace_btrfs_inode_evict(inode);
3871
3872         truncate_inode_pages(&inode->i_data, 0);
3873         if (inode->i_nlink && (btrfs_root_refs(&root->root_item) != 0 ||
3874                                btrfs_is_free_space_inode(inode)))
3875                 goto no_delete;
3876
3877         if (is_bad_inode(inode)) {
3878                 btrfs_orphan_del(NULL, inode);
3879                 goto no_delete;
3880         }
3881         /* do we really want it for ->i_nlink > 0 and zero btrfs_root_refs? */
3882         btrfs_wait_ordered_range(inode, 0, (u64)-1);
3883
3884         if (root->fs_info->log_root_recovering) {
3885                 BUG_ON(test_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
3886                                  &BTRFS_I(inode)->runtime_flags));
3887                 goto no_delete;
3888         }
3889
3890         if (inode->i_nlink > 0) {
3891                 BUG_ON(btrfs_root_refs(&root->root_item) != 0);
3892                 goto no_delete;
3893         }
3894
3895         rsv = btrfs_alloc_block_rsv(root, BTRFS_BLOCK_RSV_TEMP);
3896         if (!rsv) {
3897                 btrfs_orphan_del(NULL, inode);
3898                 goto no_delete;
3899         }
3900         rsv->size = min_size;
3901         rsv->failfast = 1;
3902         global_rsv = &root->fs_info->global_block_rsv;
3903
3904         btrfs_i_size_write(inode, 0);
3905
3906         /*
3907          * This is a bit simpler than btrfs_truncate since we've already
3908          * reserved our space for our orphan item in the unlink, so we just
3909          * need to reserve some slack space in case we add bytes and update
3910          * inode item when doing the truncate.
3911          */
3912         while (1) {
3913                 ret = btrfs_block_rsv_refill(root, rsv, min_size,
3914                                              BTRFS_RESERVE_FLUSH_LIMIT);
3915
3916                 /*
3917                  * Try and steal from the global reserve since we will
3918                  * likely not use this space anyway, we want to try as
3919                  * hard as possible to get this to work.
3920                  */
3921                 if (ret)
3922                         ret = btrfs_block_rsv_migrate(global_rsv, rsv, min_size);
3923
3924                 if (ret) {
3925                         printk(KERN_WARNING "Could not get space for a "
3926                                "delete, will truncate on mount %d\n", ret);
3927                         btrfs_orphan_del(NULL, inode);
3928                         btrfs_free_block_rsv(root, rsv);
3929                         goto no_delete;
3930                 }
3931
3932                 trans = btrfs_start_transaction_lflush(root, 1);
3933                 if (IS_ERR(trans)) {
3934                         btrfs_orphan_del(NULL, inode);
3935                         btrfs_free_block_rsv(root, rsv);
3936                         goto no_delete;
3937                 }
3938
3939                 trans->block_rsv = rsv;
3940
3941                 ret = btrfs_truncate_inode_items(trans, root, inode, 0, 0);
3942                 if (ret != -ENOSPC)
3943                         break;
3944
3945                 trans->block_rsv = &root->fs_info->trans_block_rsv;
3946                 ret = btrfs_update_inode(trans, root, inode);
3947                 BUG_ON(ret);
3948
3949                 btrfs_end_transaction(trans, root);
3950                 trans = NULL;
3951                 btrfs_btree_balance_dirty(root);
3952         }
3953
3954         btrfs_free_block_rsv(root, rsv);
3955
3956         if (ret == 0) {
3957                 trans->block_rsv = root->orphan_block_rsv;
3958                 ret = btrfs_orphan_del(trans, inode);
3959                 BUG_ON(ret);
3960         }
3961
3962         trans->block_rsv = &root->fs_info->trans_block_rsv;
3963         if (!(root == root->fs_info->tree_root ||
3964               root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID))
3965                 btrfs_return_ino(root, btrfs_ino(inode));
3966
3967         btrfs_end_transaction(trans, root);
3968         btrfs_btree_balance_dirty(root);
3969 no_delete:
3970         clear_inode(inode);
3971         return;
3972 }
3973
3974 /*
3975  * this returns the key found in the dir entry in the location pointer.
3976  * If no dir entries were found, location->objectid is 0.
3977  */
3978 static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry,
3979                                struct btrfs_key *location)
3980 {
3981         const char *name = dentry->d_name.name;
3982         int namelen = dentry->d_name.len;
3983         struct btrfs_dir_item *di;
3984         struct btrfs_path *path;
3985         struct btrfs_root *root = BTRFS_I(dir)->root;
3986         int ret = 0;
3987
3988         path = btrfs_alloc_path();
3989         if (!path)
3990                 return -ENOMEM;
3991
3992         di = btrfs_lookup_dir_item(NULL, root, path, btrfs_ino(dir), name,
3993                                     namelen, 0);
3994         if (IS_ERR(di))
3995                 ret = PTR_ERR(di);
3996
3997         if (IS_ERR_OR_NULL(di))
3998                 goto out_err;
3999
4000         btrfs_dir_item_key_to_cpu(path->nodes[0], di, location);
4001 out:
4002         btrfs_free_path(path);
4003         return ret;
4004 out_err:
4005         location->objectid = 0;
4006         goto out;
4007 }
4008
4009 /*
4010  * when we hit a tree root in a directory, the btrfs part of the inode
4011  * needs to be changed to reflect the root directory of the tree root.  This
4012  * is kind of like crossing a mount point.
4013  */
4014 static int fixup_tree_root_location(struct btrfs_root *root,
4015                                     struct inode *dir,
4016                                     struct dentry *dentry,
4017                                     struct btrfs_key *location,
4018                                     struct btrfs_root **sub_root)
4019 {
4020         struct btrfs_path *path;
4021         struct btrfs_root *new_root;
4022         struct btrfs_root_ref *ref;
4023         struct extent_buffer *leaf;
4024         int ret;
4025         int err = 0;
4026
4027         path = btrfs_alloc_path();
4028         if (!path) {
4029                 err = -ENOMEM;
4030                 goto out;
4031         }
4032
4033         err = -ENOENT;
4034         ret = btrfs_find_root_ref(root->fs_info->tree_root, path,
4035                                   BTRFS_I(dir)->root->root_key.objectid,
4036                                   location->objectid);
4037         if (ret) {
4038                 if (ret < 0)
4039                         err = ret;
4040                 goto out;
4041         }
4042
4043         leaf = path->nodes[0];
4044         ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
4045         if (btrfs_root_ref_dirid(leaf, ref) != btrfs_ino(dir) ||
4046             btrfs_root_ref_name_len(leaf, ref) != dentry->d_name.len)
4047                 goto out;
4048
4049         ret = memcmp_extent_buffer(leaf, dentry->d_name.name,
4050                                    (unsigned long)(ref + 1),
4051                                    dentry->d_name.len);
4052         if (ret)
4053                 goto out;
4054
4055         btrfs_release_path(path);
4056
4057         new_root = btrfs_read_fs_root_no_name(root->fs_info, location);
4058         if (IS_ERR(new_root)) {
4059                 err = PTR_ERR(new_root);
4060                 goto out;
4061         }
4062
4063         if (btrfs_root_refs(&new_root->root_item) == 0) {
4064                 err = -ENOENT;
4065                 goto out;
4066         }
4067
4068         *sub_root = new_root;
4069         location->objectid = btrfs_root_dirid(&new_root->root_item);
4070         location->type = BTRFS_INODE_ITEM_KEY;
4071         location->offset = 0;
4072         err = 0;
4073 out:
4074         btrfs_free_path(path);
4075         return err;
4076 }
4077
4078 static void inode_tree_add(struct inode *inode)
4079 {
4080         struct btrfs_root *root = BTRFS_I(inode)->root;
4081         struct btrfs_inode *entry;
4082         struct rb_node **p;
4083         struct rb_node *parent;
4084         u64 ino = btrfs_ino(inode);
4085 again:
4086         p = &root->inode_tree.rb_node;
4087         parent = NULL;
4088
4089         if (inode_unhashed(inode))
4090                 return;
4091
4092         spin_lock(&root->inode_lock);
4093         while (*p) {
4094                 parent = *p;
4095                 entry = rb_entry(parent, struct btrfs_inode, rb_node);
4096
4097                 if (ino < btrfs_ino(&entry->vfs_inode))
4098                         p = &parent->rb_left;
4099                 else if (ino > btrfs_ino(&entry->vfs_inode))
4100                         p = &parent->rb_right;
4101                 else {
4102                         WARN_ON(!(entry->vfs_inode.i_state &
4103                                   (I_WILL_FREE | I_FREEING)));
4104                         rb_erase(parent, &root->inode_tree);
4105                         RB_CLEAR_NODE(parent);
4106                         spin_unlock(&root->inode_lock);
4107                         goto again;
4108                 }
4109         }
4110         rb_link_node(&BTRFS_I(inode)->rb_node, parent, p);
4111         rb_insert_color(&BTRFS_I(inode)->rb_node, &root->inode_tree);
4112         spin_unlock(&root->inode_lock);
4113 }
4114
4115 static void inode_tree_del(struct inode *inode)
4116 {
4117         struct btrfs_root *root = BTRFS_I(inode)->root;
4118         int empty = 0;
4119
4120         spin_lock(&root->inode_lock);
4121         if (!RB_EMPTY_NODE(&BTRFS_I(inode)->rb_node)) {
4122                 rb_erase(&BTRFS_I(inode)->rb_node, &root->inode_tree);
4123                 RB_CLEAR_NODE(&BTRFS_I(inode)->rb_node);
4124                 empty = RB_EMPTY_ROOT(&root->inode_tree);
4125         }
4126         spin_unlock(&root->inode_lock);
4127
4128         /*
4129          * Free space cache has inodes in the tree root, but the tree root has a
4130          * root_refs of 0, so this could end up dropping the tree root as a
4131          * snapshot, so we need the extra !root->fs_info->tree_root check to
4132          * make sure we don't drop it.
4133          */
4134         if (empty && btrfs_root_refs(&root->root_item) == 0 &&
4135             root != root->fs_info->tree_root) {
4136                 synchronize_srcu(&root->fs_info->subvol_srcu);
4137                 spin_lock(&root->inode_lock);
4138                 empty = RB_EMPTY_ROOT(&root->inode_tree);
4139                 spin_unlock(&root->inode_lock);
4140                 if (empty)
4141                         btrfs_add_dead_root(root);
4142         }
4143 }
4144
4145 void btrfs_invalidate_inodes(struct btrfs_root *root)
4146 {
4147         struct rb_node *node;
4148         struct rb_node *prev;
4149         struct btrfs_inode *entry;
4150         struct inode *inode;
4151         u64 objectid = 0;
4152
4153         WARN_ON(btrfs_root_refs(&root->root_item) != 0);
4154
4155         spin_lock(&root->inode_lock);
4156 again:
4157         node = root->inode_tree.rb_node;
4158         prev = NULL;
4159         while (node) {
4160                 prev = node;
4161                 entry = rb_entry(node, struct btrfs_inode, rb_node);
4162
4163                 if (objectid < btrfs_ino(&entry->vfs_inode))
4164                         node = node->rb_left;
4165                 else if (objectid > btrfs_ino(&entry->vfs_inode))
4166                         node = node->rb_right;
4167                 else
4168                         break;
4169         }
4170         if (!node) {
4171                 while (prev) {
4172                         entry = rb_entry(prev, struct btrfs_inode, rb_node);
4173                         if (objectid <= btrfs_ino(&entry->vfs_inode)) {
4174                                 node = prev;
4175                                 break;
4176                         }
4177                         prev = rb_next(prev);
4178                 }
4179         }
4180         while (node) {
4181                 entry = rb_entry(node, struct btrfs_inode, rb_node);
4182                 objectid = btrfs_ino(&entry->vfs_inode) + 1;
4183                 inode = igrab(&entry->vfs_inode);
4184                 if (inode) {
4185                         spin_unlock(&root->inode_lock);
4186                         if (atomic_read(&inode->i_count) > 1)
4187                                 d_prune_aliases(inode);
4188                         /*
4189                          * btrfs_drop_inode will have it removed from
4190                          * the inode cache when its usage count
4191                          * hits zero.
4192                          */
4193                         iput(inode);
4194                         cond_resched();
4195                         spin_lock(&root->inode_lock);
4196                         goto again;
4197                 }
4198
4199                 if (cond_resched_lock(&root->inode_lock))
4200                         goto again;
4201
4202                 node = rb_next(node);
4203         }
4204         spin_unlock(&root->inode_lock);
4205 }
4206
4207 static int btrfs_init_locked_inode(struct inode *inode, void *p)
4208 {
4209         struct btrfs_iget_args *args = p;
4210         inode->i_ino = args->ino;
4211         BTRFS_I(inode)->root = args->root;
4212         return 0;
4213 }
4214
4215 static int btrfs_find_actor(struct inode *inode, void *opaque)
4216 {
4217         struct btrfs_iget_args *args = opaque;
4218         return args->ino == btrfs_ino(inode) &&
4219                 args->root == BTRFS_I(inode)->root;
4220 }
4221
4222 static struct inode *btrfs_iget_locked(struct super_block *s,
4223                                        u64 objectid,
4224                                        struct btrfs_root *root)
4225 {
4226         struct inode *inode;
4227         struct btrfs_iget_args args;
4228         args.ino = objectid;
4229         args.root = root;
4230
4231         inode = iget5_locked(s, objectid, btrfs_find_actor,
4232                              btrfs_init_locked_inode,
4233                              (void *)&args);
4234         return inode;
4235 }
4236
4237 /* Get an inode object given its location and corresponding root.
4238  * Returns in *is_new if the inode was read from disk
4239  */
4240 struct inode *btrfs_iget(struct super_block *s, struct btrfs_key *location,
4241                          struct btrfs_root *root, int *new)
4242 {
4243         struct inode *inode;
4244
4245         inode = btrfs_iget_locked(s, location->objectid, root);
4246         if (!inode)
4247                 return ERR_PTR(-ENOMEM);
4248
4249         if (inode->i_state & I_NEW) {
4250                 BTRFS_I(inode)->root = root;
4251                 memcpy(&BTRFS_I(inode)->location, location, sizeof(*location));
4252                 btrfs_read_locked_inode(inode);
4253                 if (!is_bad_inode(inode)) {
4254                         inode_tree_add(inode);
4255                         unlock_new_inode(inode);
4256                         if (new)
4257                                 *new = 1;
4258                 } else {
4259                         unlock_new_inode(inode);
4260                         iput(inode);
4261                         inode = ERR_PTR(-ESTALE);
4262                 }
4263         }
4264
4265         return inode;
4266 }
4267
4268 static struct inode *new_simple_dir(struct super_block *s,
4269                                     struct btrfs_key *key,
4270                                     struct btrfs_root *root)
4271 {
4272         struct inode *inode = new_inode(s);
4273
4274         if (!inode)
4275                 return ERR_PTR(-ENOMEM);
4276
4277         BTRFS_I(inode)->root = root;
4278         memcpy(&BTRFS_I(inode)->location, key, sizeof(*key));
4279         set_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags);
4280
4281         inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID;
4282         inode->i_op = &btrfs_dir_ro_inode_operations;
4283         inode->i_fop = &simple_dir_operations;
4284         inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO;
4285         inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
4286
4287         return inode;
4288 }
4289
4290 struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry)
4291 {
4292         struct inode *inode;
4293         struct btrfs_root *root = BTRFS_I(dir)->root;
4294         struct btrfs_root *sub_root = root;
4295         struct btrfs_key location;
4296         int index;
4297         int ret = 0;
4298
4299         if (dentry->d_name.len > BTRFS_NAME_LEN)
4300                 return ERR_PTR(-ENAMETOOLONG);
4301
4302         if (unlikely(d_need_lookup(dentry))) {
4303                 memcpy(&location, dentry->d_fsdata, sizeof(struct btrfs_key));
4304                 kfree(dentry->d_fsdata);
4305                 dentry->d_fsdata = NULL;
4306                 /* This thing is hashed, drop it for now */
4307                 d_drop(dentry);
4308         } else {
4309                 ret = btrfs_inode_by_name(dir, dentry, &location);
4310         }
4311
4312         if (ret < 0)
4313                 return ERR_PTR(ret);
4314
4315         if (location.objectid == 0)
4316                 return NULL;
4317
4318         if (location.type == BTRFS_INODE_ITEM_KEY) {
4319                 inode = btrfs_iget(dir->i_sb, &location, root, NULL);
4320                 return inode;
4321         }
4322
4323         BUG_ON(location.type != BTRFS_ROOT_ITEM_KEY);
4324
4325         index = srcu_read_lock(&root->fs_info->subvol_srcu);
4326         ret = fixup_tree_root_location(root, dir, dentry,
4327                                        &location, &sub_root);
4328         if (ret < 0) {
4329                 if (ret != -ENOENT)
4330                         inode = ERR_PTR(ret);
4331                 else
4332                         inode = new_simple_dir(dir->i_sb, &location, sub_root);
4333         } else {
4334                 inode = btrfs_iget(dir->i_sb, &location, sub_root, NULL);
4335         }
4336         srcu_read_unlock(&root->fs_info->subvol_srcu, index);
4337
4338         if (!IS_ERR(inode) && root != sub_root) {
4339                 down_read(&root->fs_info->cleanup_work_sem);
4340                 if (!(inode->i_sb->s_flags & MS_RDONLY))
4341                         ret = btrfs_orphan_cleanup(sub_root);
4342                 up_read(&root->fs_info->cleanup_work_sem);
4343                 if (ret)
4344                         inode = ERR_PTR(ret);
4345         }
4346
4347         return inode;
4348 }
4349
4350 static int btrfs_dentry_delete(const struct dentry *dentry)
4351 {
4352         struct btrfs_root *root;
4353         struct inode *inode = dentry->d_inode;
4354
4355         if (!inode && !IS_ROOT(dentry))
4356                 inode = dentry->d_parent->d_inode;
4357
4358         if (inode) {
4359                 root = BTRFS_I(inode)->root;
4360                 if (btrfs_root_refs(&root->root_item) == 0)
4361                         return 1;
4362
4363                 if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
4364                         return 1;
4365         }
4366         return 0;
4367 }
4368
4369 static void btrfs_dentry_release(struct dentry *dentry)
4370 {
4371         if (dentry->d_fsdata)
4372                 kfree(dentry->d_fsdata);
4373 }
4374
4375 static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry,
4376                                    unsigned int flags)
4377 {
4378         struct dentry *ret;
4379
4380         ret = d_splice_alias(btrfs_lookup_dentry(dir, dentry), dentry);
4381         if (unlikely(d_need_lookup(dentry))) {
4382                 spin_lock(&dentry->d_lock);
4383                 dentry->d_flags &= ~DCACHE_NEED_LOOKUP;
4384                 spin_unlock(&dentry->d_lock);
4385         }
4386         return ret;
4387 }
4388
4389 unsigned char btrfs_filetype_table[] = {
4390         DT_UNKNOWN, DT_REG, DT_DIR, DT_CHR, DT_BLK, DT_FIFO, DT_SOCK, DT_LNK
4391 };
4392
4393 static int btrfs_real_readdir(struct file *filp, void *dirent,
4394                               filldir_t filldir)
4395 {
4396         struct inode *inode = filp->f_dentry->d_inode;
4397         struct btrfs_root *root = BTRFS_I(inode)->root;
4398         struct btrfs_item *item;
4399         struct btrfs_dir_item *di;
4400         struct btrfs_key key;
4401         struct btrfs_key found_key;
4402         struct btrfs_path *path;
4403         struct list_head ins_list;
4404         struct list_head del_list;
4405         int ret;
4406         struct extent_buffer *leaf;
4407         int slot;
4408         unsigned char d_type;
4409         int over = 0;
4410         u32 di_cur;
4411         u32 di_total;
4412         u32 di_len;
4413         int key_type = BTRFS_DIR_INDEX_KEY;
4414         char tmp_name[32];
4415         char *name_ptr;
4416         int name_len;
4417         int is_curr = 0;        /* filp->f_pos points to the current index? */
4418
4419         /* FIXME, use a real flag for deciding about the key type */
4420         if (root->fs_info->tree_root == root)
4421                 key_type = BTRFS_DIR_ITEM_KEY;
4422
4423         /* special case for "." */
4424         if (filp->f_pos == 0) {
4425                 over = filldir(dirent, ".", 1,
4426                                filp->f_pos, btrfs_ino(inode), DT_DIR);
4427                 if (over)
4428                         return 0;
4429                 filp->f_pos = 1;
4430         }
4431         /* special case for .., just use the back ref */
4432         if (filp->f_pos == 1) {
4433                 u64 pino = parent_ino(filp->f_path.dentry);
4434                 over = filldir(dirent, "..", 2,
4435                                filp->f_pos, pino, DT_DIR);
4436                 if (over)
4437                         return 0;
4438                 filp->f_pos = 2;
4439         }
4440         path = btrfs_alloc_path();
4441         if (!path)
4442                 return -ENOMEM;
4443
4444         path->reada = 1;
4445
4446         if (key_type == BTRFS_DIR_INDEX_KEY) {
4447                 INIT_LIST_HEAD(&ins_list);
4448                 INIT_LIST_HEAD(&del_list);
4449                 btrfs_get_delayed_items(inode, &ins_list, &del_list);
4450         }
4451
4452         btrfs_set_key_type(&key, key_type);
4453         key.offset = filp->f_pos;
4454         key.objectid = btrfs_ino(inode);
4455
4456         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4457         if (ret < 0)
4458                 goto err;
4459
4460         while (1) {
4461                 leaf = path->nodes[0];
4462                 slot = path->slots[0];
4463                 if (slot >= btrfs_header_nritems(leaf)) {
4464                         ret = btrfs_next_leaf(root, path);
4465                         if (ret < 0)
4466                                 goto err;
4467                         else if (ret > 0)
4468                                 break;
4469                         continue;
4470                 }
4471
4472                 item = btrfs_item_nr(leaf, slot);
4473                 btrfs_item_key_to_cpu(leaf, &found_key, slot);
4474
4475                 if (found_key.objectid != key.objectid)
4476                         break;
4477                 if (btrfs_key_type(&found_key) != key_type)
4478                         break;
4479                 if (found_key.offset < filp->f_pos)
4480                         goto next;
4481                 if (key_type == BTRFS_DIR_INDEX_KEY &&
4482                     btrfs_should_delete_dir_index(&del_list,
4483                                                   found_key.offset))
4484                         goto next;
4485
4486                 filp->f_pos = found_key.offset;
4487                 is_curr = 1;
4488
4489                 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
4490                 di_cur = 0;
4491                 di_total = btrfs_item_size(leaf, item);
4492
4493                 while (di_cur < di_total) {
4494                         struct btrfs_key location;
4495
4496                         if (verify_dir_item(root, leaf, di))
4497                                 break;
4498
4499                         name_len = btrfs_dir_name_len(leaf, di);
4500                         if (name_len <= sizeof(tmp_name)) {
4501                                 name_ptr = tmp_name;
4502                         } else {
4503                                 name_ptr = kmalloc(name_len, GFP_NOFS);
4504                                 if (!name_ptr) {
4505                                         ret = -ENOMEM;
4506                                         goto err;
4507                                 }
4508                         }
4509                         read_extent_buffer(leaf, name_ptr,
4510                                            (unsigned long)(di + 1), name_len);
4511
4512                         d_type = btrfs_filetype_table[btrfs_dir_type(leaf, di)];
4513                         btrfs_dir_item_key_to_cpu(leaf, di, &location);
4514
4515
4516                         /* is this a reference to our own snapshot? If so
4517                          * skip it.
4518                          *
4519                          * In contrast to old kernels, we insert the snapshot's
4520                          * dir item and dir index after it has been created, so
4521                          * we won't find a reference to our own snapshot. We
4522                          * still keep the following code for backward
4523                          * compatibility.
4524                          */
4525                         if (location.type == BTRFS_ROOT_ITEM_KEY &&
4526                             location.objectid == root->root_key.objectid) {
4527                                 over = 0;
4528                                 goto skip;
4529                         }
4530                         over = filldir(dirent, name_ptr, name_len,
4531                                        found_key.offset, location.objectid,
4532                                        d_type);
4533
4534 skip:
4535                         if (name_ptr != tmp_name)
4536                                 kfree(name_ptr);
4537
4538                         if (over)
4539                                 goto nopos;
4540                         di_len = btrfs_dir_name_len(leaf, di) +
4541                                  btrfs_dir_data_len(leaf, di) + sizeof(*di);
4542                         di_cur += di_len;
4543                         di = (struct btrfs_dir_item *)((char *)di + di_len);
4544                 }
4545 next:
4546                 path->slots[0]++;
4547         }
4548
4549         if (key_type == BTRFS_DIR_INDEX_KEY) {
4550                 if (is_curr)
4551                         filp->f_pos++;
4552                 ret = btrfs_readdir_delayed_dir_index(filp, dirent, filldir,
4553                                                       &ins_list);
4554                 if (ret)
4555                         goto nopos;
4556         }
4557
4558         /* Reached end of directory/root. Bump pos past the last item. */
4559         if (key_type == BTRFS_DIR_INDEX_KEY)
4560                 /*
4561                  * 32-bit glibc will use getdents64, but then strtol -
4562                  * so the last number we can serve is this.
4563                  */
4564                 filp->f_pos = 0x7fffffff;
4565         else
4566                 filp->f_pos++;
4567 nopos:
4568         ret = 0;
4569 err:
4570         if (key_type == BTRFS_DIR_INDEX_KEY)
4571                 btrfs_put_delayed_items(&ins_list, &del_list);
4572         btrfs_free_path(path);
4573         return ret;
4574 }
4575
4576 int btrfs_write_inode(struct inode *inode, struct writeback_control *wbc)
4577 {
4578         struct btrfs_root *root = BTRFS_I(inode)->root;
4579         struct btrfs_trans_handle *trans;
4580         int ret = 0;
4581         bool nolock = false;
4582
4583         if (test_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags))
4584                 return 0;
4585
4586         if (btrfs_fs_closing(root->fs_info) && btrfs_is_free_space_inode(inode))
4587                 nolock = true;
4588
4589         if (wbc->sync_mode == WB_SYNC_ALL) {
4590                 if (nolock)
4591                         trans = btrfs_join_transaction_nolock(root);
4592                 else
4593                         trans = btrfs_join_transaction(root);
4594                 if (IS_ERR(trans))
4595                         return PTR_ERR(trans);
4596                 ret = btrfs_commit_transaction(trans, root);
4597         }
4598         return ret;
4599 }
4600
4601 /*
4602  * This is somewhat expensive, updating the tree every time the
4603  * inode changes.  But, it is most likely to find the inode in cache.
4604  * FIXME, needs more benchmarking...there are no reasons other than performance
4605  * to keep or drop this code.
4606  */
4607 int btrfs_dirty_inode(struct inode *inode)
4608 {
4609         struct btrfs_root *root = BTRFS_I(inode)->root;
4610         struct btrfs_trans_handle *trans;
4611         int ret;
4612
4613         if (test_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags))
4614                 return 0;
4615
4616         trans = btrfs_join_transaction(root);
4617         if (IS_ERR(trans))
4618                 return PTR_ERR(trans);
4619
4620         ret = btrfs_update_inode(trans, root, inode);
4621         if (ret && ret == -ENOSPC) {
4622                 /* whoops, lets try again with the full transaction */
4623                 btrfs_end_transaction(trans, root);
4624                 trans = btrfs_start_transaction(root, 1);
4625                 if (IS_ERR(trans))
4626                         return PTR_ERR(trans);
4627
4628                 ret = btrfs_update_inode(trans, root, inode);
4629         }
4630         btrfs_end_transaction(trans, root);
4631         if (BTRFS_I(inode)->delayed_node)
4632                 btrfs_balance_delayed_items(root);
4633
4634         return ret;
4635 }
4636
4637 /*
4638  * This is a copy of file_update_time.  We need this so we can return error on
4639  * ENOSPC for updating the inode in the case of file write and mmap writes.
4640  */
4641 static int btrfs_update_time(struct inode *inode, struct timespec *now,
4642                              int flags)
4643 {
4644         struct btrfs_root *root = BTRFS_I(inode)->root;
4645
4646         if (btrfs_root_readonly(root))
4647                 return -EROFS;
4648
4649         if (flags & S_VERSION)
4650                 inode_inc_iversion(inode);
4651         if (flags & S_CTIME)
4652                 inode->i_ctime = *now;
4653         if (flags & S_MTIME)
4654                 inode->i_mtime = *now;
4655         if (flags & S_ATIME)
4656                 inode->i_atime = *now;
4657         return btrfs_dirty_inode(inode);
4658 }
4659
4660 /*
4661  * find the highest existing sequence number in a directory
4662  * and then set the in-memory index_cnt variable to reflect
4663  * free sequence numbers
4664  */
4665 static int btrfs_set_inode_index_count(struct inode *inode)
4666 {
4667         struct btrfs_root *root = BTRFS_I(inode)->root;
4668         struct btrfs_key key, found_key;
4669         struct btrfs_path *path;
4670         struct extent_buffer *leaf;
4671         int ret;
4672
4673         key.objectid = btrfs_ino(inode);
4674         btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
4675         key.offset = (u64)-1;
4676
4677         path = btrfs_alloc_path();
4678         if (!path)
4679                 return -ENOMEM;
4680
4681         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4682         if (ret < 0)
4683                 goto out;
4684         /* FIXME: we should be able to handle this */
4685         if (ret == 0)
4686                 goto out;
4687         ret = 0;
4688
4689         /*
4690          * MAGIC NUMBER EXPLANATION:
4691          * since we search a directory based on f_pos we have to start at 2
4692          * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody
4693          * else has to start at 2
4694          */
4695         if (path->slots[0] == 0) {
4696                 BTRFS_I(inode)->index_cnt = 2;
4697                 goto out;
4698         }
4699
4700         path->slots[0]--;
4701
4702         leaf = path->nodes[0];
4703         btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
4704
4705         if (found_key.objectid != btrfs_ino(inode) ||
4706             btrfs_key_type(&found_key) != BTRFS_DIR_INDEX_KEY) {
4707                 BTRFS_I(inode)->index_cnt = 2;
4708                 goto out;
4709         }
4710
4711         BTRFS_I(inode)->index_cnt = found_key.offset + 1;
4712 out:
4713         btrfs_free_path(path);
4714         return ret;
4715 }
4716
4717 /*
4718  * helper to find a free sequence number in a given directory.  This current
4719  * code is very simple, later versions will do smarter things in the btree
4720  */
4721 int btrfs_set_inode_index(struct inode *dir, u64 *index)
4722 {
4723         int ret = 0;
4724
4725         if (BTRFS_I(dir)->index_cnt == (u64)-1) {
4726                 ret = btrfs_inode_delayed_dir_index_count(dir);
4727                 if (ret) {
4728                         ret = btrfs_set_inode_index_count(dir);
4729                         if (ret)
4730                                 return ret;
4731                 }
4732         }
4733
4734         *index = BTRFS_I(dir)->index_cnt;
4735         BTRFS_I(dir)->index_cnt++;
4736
4737         return ret;
4738 }
4739
4740 static struct inode *btrfs_new_inode(struct btrfs_trans_handle *trans,
4741                                      struct btrfs_root *root,
4742                                      struct inode *dir,
4743                                      const char *name, int name_len,
4744                                      u64 ref_objectid, u64 objectid,
4745                                      umode_t mode, u64 *index)
4746 {
4747         struct inode *inode;
4748         struct btrfs_inode_item *inode_item;
4749         struct btrfs_key *location;
4750         struct btrfs_path *path;
4751         struct btrfs_inode_ref *ref;
4752         struct btrfs_key key[2];
4753         u32 sizes[2];
4754         unsigned long ptr;
4755         int ret;
4756         int owner;
4757
4758         path = btrfs_alloc_path();
4759         if (!path)
4760                 return ERR_PTR(-ENOMEM);
4761
4762         inode = new_inode(root->fs_info->sb);
4763         if (!inode) {
4764                 btrfs_free_path(path);
4765                 return ERR_PTR(-ENOMEM);
4766         }
4767
4768         /*
4769          * we have to initialize this early, so we can reclaim the inode
4770          * number if we fail afterwards in this function.
4771          */
4772         inode->i_ino = objectid;
4773
4774         if (dir) {
4775                 trace_btrfs_inode_request(dir);
4776
4777                 ret = btrfs_set_inode_index(dir, index);
4778                 if (ret) {
4779                         btrfs_free_path(path);
4780                         iput(inode);
4781                         return ERR_PTR(ret);
4782                 }
4783         }
4784         /*
4785          * index_cnt is ignored for everything but a dir,
4786          * btrfs_get_inode_index_count has an explanation for the magic
4787          * number
4788          */
4789         BTRFS_I(inode)->index_cnt = 2;
4790         BTRFS_I(inode)->root = root;
4791         BTRFS_I(inode)->generation = trans->transid;
4792         inode->i_generation = BTRFS_I(inode)->generation;
4793
4794         /*
4795          * We could have gotten an inode number from somebody who was fsynced
4796          * and then removed in this same transaction, so let's just set full
4797          * sync since it will be a full sync anyway and this will blow away the
4798          * old info in the log.
4799          */
4800         set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags);
4801
4802         if (S_ISDIR(mode))
4803                 owner = 0;
4804         else
4805                 owner = 1;
4806
4807         key[0].objectid = objectid;
4808         btrfs_set_key_type(&key[0], BTRFS_INODE_ITEM_KEY);
4809         key[0].offset = 0;
4810
4811         /*
4812          * Start new inodes with an inode_ref. This is slightly more
4813          * efficient for small numbers of hard links since they will
4814          * be packed into one item. Extended refs will kick in if we
4815          * add more hard links than can fit in the ref item.
4816          */
4817         key[1].objectid = objectid;
4818         btrfs_set_key_type(&key[1], BTRFS_INODE_REF_KEY);
4819         key[1].offset = ref_objectid;
4820
4821         sizes[0] = sizeof(struct btrfs_inode_item);
4822         sizes[1] = name_len + sizeof(*ref);
4823
4824         path->leave_spinning = 1;
4825         ret = btrfs_insert_empty_items(trans, root, path, key, sizes, 2);
4826         if (ret != 0)
4827                 goto fail;
4828
4829         inode_init_owner(inode, dir, mode);
4830         inode_set_bytes(inode, 0);
4831         inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
4832         inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
4833                                   struct btrfs_inode_item);
4834         memset_extent_buffer(path->nodes[0], 0, (unsigned long)inode_item,
4835                              sizeof(*inode_item));
4836         fill_inode_item(trans, path->nodes[0], inode_item, inode);
4837
4838         ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1,
4839                              struct btrfs_inode_ref);
4840         btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
4841         btrfs_set_inode_ref_index(path->nodes[0], ref, *index);
4842         ptr = (unsigned long)(ref + 1);
4843         write_extent_buffer(path->nodes[0], name, ptr, name_len);
4844
4845         btrfs_mark_buffer_dirty(path->nodes[0]);
4846         btrfs_free_path(path);
4847
4848         location = &BTRFS_I(inode)->location;
4849         location->objectid = objectid;
4850         location->offset = 0;
4851         btrfs_set_key_type(location, BTRFS_INODE_ITEM_KEY);
4852
4853         btrfs_inherit_iflags(inode, dir);
4854
4855         if (S_ISREG(mode)) {
4856                 if (btrfs_test_opt(root, NODATASUM))
4857                         BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM;
4858                 if (btrfs_test_opt(root, NODATACOW))
4859                         BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW;
4860         }
4861
4862         insert_inode_hash(inode);
4863         inode_tree_add(inode);
4864
4865         trace_btrfs_inode_new(inode);
4866         btrfs_set_inode_last_trans(trans, inode);
4867
4868         btrfs_update_root_times(trans, root);
4869
4870         return inode;
4871 fail:
4872         if (dir)
4873                 BTRFS_I(dir)->index_cnt--;
4874         btrfs_free_path(path);
4875         iput(inode);
4876         return ERR_PTR(ret);
4877 }
4878
4879 static inline u8 btrfs_inode_type(struct inode *inode)
4880 {
4881         return btrfs_type_by_mode[(inode->i_mode & S_IFMT) >> S_SHIFT];
4882 }
4883
4884 /*
4885  * utility function to add 'inode' into 'parent_inode' with
4886  * a give name and a given sequence number.
4887  * if 'add_backref' is true, also insert a backref from the
4888  * inode to the parent directory.
4889  */
4890 int btrfs_add_link(struct btrfs_trans_handle *trans,
4891                    struct inode *parent_inode, struct inode *inode,
4892                    const char *name, int name_len, int add_backref, u64 index)
4893 {
4894         int ret = 0;
4895         struct btrfs_key key;
4896         struct btrfs_root *root = BTRFS_I(parent_inode)->root;
4897         u64 ino = btrfs_ino(inode);
4898         u64 parent_ino = btrfs_ino(parent_inode);
4899
4900         if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
4901                 memcpy(&key, &BTRFS_I(inode)->root->root_key, sizeof(key));
4902         } else {
4903                 key.objectid = ino;
4904                 btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY);
4905                 key.offset = 0;
4906         }
4907
4908         if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
4909                 ret = btrfs_add_root_ref(trans, root->fs_info->tree_root,
4910                                          key.objectid, root->root_key.objectid,
4911                                          parent_ino, index, name, name_len);
4912         } else if (add_backref) {
4913                 ret = btrfs_insert_inode_ref(trans, root, name, name_len, ino,
4914                                              parent_ino, index);
4915         }
4916
4917         /* Nothing to clean up yet */
4918         if (ret)
4919                 return ret;
4920
4921         ret = btrfs_insert_dir_item(trans, root, name, name_len,
4922                                     parent_inode, &key,
4923                                     btrfs_inode_type(inode), index);
4924         if (ret == -EEXIST || ret == -EOVERFLOW)
4925                 goto fail_dir_item;
4926         else if (ret) {
4927                 btrfs_abort_transaction(trans, root, ret);
4928                 return ret;
4929         }
4930
4931         btrfs_i_size_write(parent_inode, parent_inode->i_size +
4932                            name_len * 2);
4933         inode_inc_iversion(parent_inode);
4934         parent_inode->i_mtime = parent_inode->i_ctime = CURRENT_TIME;
4935         ret = btrfs_update_inode(trans, root, parent_inode);
4936         if (ret)
4937                 btrfs_abort_transaction(trans, root, ret);
4938         return ret;
4939
4940 fail_dir_item:
4941         if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
4942                 u64 local_index;
4943                 int err;
4944                 err = btrfs_del_root_ref(trans, root->fs_info->tree_root,
4945                                  key.objectid, root->root_key.objectid,
4946                                  parent_ino, &local_index, name, name_len);
4947
4948         } else if (add_backref) {
4949                 u64 local_index;
4950                 int err;
4951
4952                 err = btrfs_del_inode_ref(trans, root, name, name_len,
4953                                           ino, parent_ino, &local_index);
4954         }
4955         return ret;
4956 }
4957
4958 static int btrfs_add_nondir(struct btrfs_trans_handle *trans,
4959                             struct inode *dir, struct dentry *dentry,
4960                             struct inode *inode, int backref, u64 index)
4961 {
4962         int err = btrfs_add_link(trans, dir, inode,
4963                                  dentry->d_name.name, dentry->d_name.len,
4964                                  backref, index);
4965         if (err > 0)
4966                 err = -EEXIST;
4967         return err;
4968 }
4969
4970 static int btrfs_mknod(struct inode *dir, struct dentry *dentry,
4971                         umode_t mode, dev_t rdev)
4972 {
4973         struct btrfs_trans_handle *trans;
4974         struct btrfs_root *root = BTRFS_I(dir)->root;
4975         struct inode *inode = NULL;
4976         int err;
4977         int drop_inode = 0;
4978         u64 objectid;
4979         u64 index = 0;
4980
4981         if (!new_valid_dev(rdev))
4982                 return -EINVAL;
4983
4984         /*
4985          * 2 for inode item and ref
4986          * 2 for dir items
4987          * 1 for xattr if selinux is on
4988          */
4989         trans = btrfs_start_transaction(root, 5);
4990         if (IS_ERR(trans))
4991                 return PTR_ERR(trans);
4992
4993         err = btrfs_find_free_ino(root, &objectid);
4994         if (err)
4995                 goto out_unlock;
4996
4997         inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
4998                                 dentry->d_name.len, btrfs_ino(dir), objectid,
4999                                 mode, &index);
5000         if (IS_ERR(inode)) {
5001                 err = PTR_ERR(inode);
5002                 goto out_unlock;
5003         }
5004
5005         err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
5006         if (err) {
5007                 drop_inode = 1;
5008                 goto out_unlock;
5009         }
5010
5011         err = btrfs_update_inode(trans, root, inode);
5012         if (err) {
5013                 drop_inode = 1;
5014                 goto out_unlock;
5015         }
5016
5017         /*
5018         * If the active LSM wants to access the inode during
5019         * d_instantiate it needs these. Smack checks to see
5020         * if the filesystem supports xattrs by looking at the
5021         * ops vector.
5022         */
5023
5024         inode->i_op = &btrfs_special_inode_operations;
5025         err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index);
5026         if (err)
5027                 drop_inode = 1;
5028         else {
5029                 init_special_inode(inode, inode->i_mode, rdev);
5030                 btrfs_update_inode(trans, root, inode);
5031                 d_instantiate(dentry, inode);
5032         }
5033 out_unlock:
5034         btrfs_end_transaction(trans, root);
5035         btrfs_btree_balance_dirty(root);
5036         if (drop_inode) {
5037                 inode_dec_link_count(inode);
5038                 iput(inode);
5039         }
5040         return err;
5041 }
5042
5043 static int btrfs_create(struct inode *dir, struct dentry *dentry,
5044                         umode_t mode, bool excl)
5045 {
5046         struct btrfs_trans_handle *trans;
5047         struct btrfs_root *root = BTRFS_I(dir)->root;
5048         struct inode *inode = NULL;
5049         int drop_inode_on_err = 0;
5050         int err;
5051         u64 objectid;
5052         u64 index = 0;
5053
5054         /*
5055          * 2 for inode item and ref
5056          * 2 for dir items
5057          * 1 for xattr if selinux is on
5058          */
5059         trans = btrfs_start_transaction(root, 5);
5060         if (IS_ERR(trans))
5061                 return PTR_ERR(trans);
5062
5063         err = btrfs_find_free_ino(root, &objectid);
5064         if (err)
5065                 goto out_unlock;
5066
5067         inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
5068                                 dentry->d_name.len, btrfs_ino(dir), objectid,
5069                                 mode, &index);
5070         if (IS_ERR(inode)) {
5071                 err = PTR_ERR(inode);
5072                 goto out_unlock;
5073         }
5074         drop_inode_on_err = 1;
5075
5076         err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
5077         if (err)
5078                 goto out_unlock;
5079
5080         err = btrfs_update_inode(trans, root, inode);
5081         if (err)
5082                 goto out_unlock;
5083
5084         /*
5085         * If the active LSM wants to access the inode during
5086         * d_instantiate it needs these. Smack checks to see
5087         * if the filesystem supports xattrs by looking at the
5088         * ops vector.
5089         */
5090         inode->i_fop = &btrfs_file_operations;
5091         inode->i_op = &btrfs_file_inode_operations;
5092
5093         err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index);
5094         if (err)
5095                 goto out_unlock;
5096
5097         inode->i_mapping->a_ops = &btrfs_aops;
5098         inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
5099         BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
5100         d_instantiate(dentry, inode);
5101
5102 out_unlock:
5103         btrfs_end_transaction(trans, root);
5104         if (err && drop_inode_on_err) {
5105                 inode_dec_link_count(inode);
5106                 iput(inode);
5107         }
5108         btrfs_btree_balance_dirty(root);
5109         return err;
5110 }
5111
5112 static int btrfs_link(struct dentry *old_dentry, struct inode *dir,
5113                       struct dentry *dentry)
5114 {
5115         struct btrfs_trans_handle *trans;
5116         struct btrfs_root *root = BTRFS_I(dir)->root;
5117         struct inode *inode = old_dentry->d_inode;
5118         u64 index;
5119         int err;
5120         int drop_inode = 0;
5121
5122         /* do not allow sys_link's with other subvols of the same device */
5123         if (root->objectid != BTRFS_I(inode)->root->objectid)
5124                 return -EXDEV;
5125
5126         if (inode->i_nlink >= BTRFS_LINK_MAX)
5127                 return -EMLINK;
5128
5129         err = btrfs_set_inode_index(dir, &index);
5130         if (err)
5131                 goto fail;
5132
5133         /*
5134          * 2 items for inode and inode ref
5135          * 2 items for dir items
5136          * 1 item for parent inode
5137          */
5138         trans = btrfs_start_transaction(root, 5);
5139         if (IS_ERR(trans)) {
5140                 err = PTR_ERR(trans);
5141                 goto fail;
5142         }
5143
5144         btrfs_inc_nlink(inode);
5145         inode_inc_iversion(inode);
5146         inode->i_ctime = CURRENT_TIME;
5147         ihold(inode);
5148         set_bit(BTRFS_INODE_COPY_EVERYTHING, &BTRFS_I(inode)->runtime_flags);
5149
5150         err = btrfs_add_nondir(trans, dir, dentry, inode, 1, index);
5151
5152         if (err) {
5153                 drop_inode = 1;
5154         } else {
5155                 struct dentry *parent = dentry->d_parent;
5156                 err = btrfs_update_inode(trans, root, inode);
5157                 if (err)
5158                         goto fail;
5159                 d_instantiate(dentry, inode);
5160                 btrfs_log_new_name(trans, inode, NULL, parent);
5161         }
5162
5163         btrfs_end_transaction(trans, root);
5164 fail:
5165         if (drop_inode) {
5166                 inode_dec_link_count(inode);
5167                 iput(inode);
5168         }
5169         btrfs_btree_balance_dirty(root);
5170         return err;
5171 }
5172
5173 static int btrfs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
5174 {
5175         struct inode *inode = NULL;
5176         struct btrfs_trans_handle *trans;
5177         struct btrfs_root *root = BTRFS_I(dir)->root;
5178         int err = 0;
5179         int drop_on_err = 0;
5180         u64 objectid = 0;
5181         u64 index = 0;
5182
5183         /*
5184          * 2 items for inode and ref
5185          * 2 items for dir items
5186          * 1 for xattr if selinux is on
5187          */
5188         trans = btrfs_start_transaction(root, 5);
5189         if (IS_ERR(trans))
5190                 return PTR_ERR(trans);
5191
5192         err = btrfs_find_free_ino(root, &objectid);
5193         if (err)
5194                 goto out_fail;
5195
5196         inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
5197                                 dentry->d_name.len, btrfs_ino(dir), objectid,
5198                                 S_IFDIR | mode, &index);
5199         if (IS_ERR(inode)) {
5200                 err = PTR_ERR(inode);
5201                 goto out_fail;
5202         }
5203
5204         drop_on_err = 1;
5205
5206         err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
5207         if (err)
5208                 goto out_fail;
5209
5210         inode->i_op = &btrfs_dir_inode_operations;
5211         inode->i_fop = &btrfs_dir_file_operations;
5212
5213         btrfs_i_size_write(inode, 0);
5214         err = btrfs_update_inode(trans, root, inode);
5215         if (err)
5216                 goto out_fail;
5217
5218         err = btrfs_add_link(trans, dir, inode, dentry->d_name.name,
5219                              dentry->d_name.len, 0, index);
5220         if (err)
5221                 goto out_fail;
5222
5223         d_instantiate(dentry, inode);
5224         drop_on_err = 0;
5225
5226 out_fail:
5227         btrfs_end_transaction(trans, root);
5228         if (drop_on_err)
5229                 iput(inode);
5230         btrfs_btree_balance_dirty(root);
5231         return err;
5232 }
5233
5234 /* helper for btfs_get_extent.  Given an existing extent in the tree,
5235  * and an extent that you want to insert, deal with overlap and insert
5236  * the new extent into the tree.
5237  */
5238 static int merge_extent_mapping(struct extent_map_tree *em_tree,
5239                                 struct extent_map *existing,
5240                                 struct extent_map *em,
5241                                 u64 map_start, u64 map_len)
5242 {
5243         u64 start_diff;
5244
5245         BUG_ON(map_start < em->start || map_start >= extent_map_end(em));
5246         start_diff = map_start - em->start;
5247         em->start = map_start;
5248         em->len = map_len;
5249         if (em->block_start < EXTENT_MAP_LAST_BYTE &&
5250             !test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
5251                 em->block_start += start_diff;
5252                 em->block_len -= start_diff;
5253         }
5254         return add_extent_mapping(em_tree, em);
5255 }
5256
5257 static noinline int uncompress_inline(struct btrfs_path *path,
5258                                       struct inode *inode, struct page *page,
5259                                       size_t pg_offset, u64 extent_offset,
5260                                       struct btrfs_file_extent_item *item)
5261 {
5262         int ret;
5263         struct extent_buffer *leaf = path->nodes[0];
5264         char *tmp;
5265         size_t max_size;
5266         unsigned long inline_size;
5267         unsigned long ptr;
5268         int compress_type;
5269
5270         WARN_ON(pg_offset != 0);
5271         compress_type = btrfs_file_extent_compression(leaf, item);
5272         max_size = btrfs_file_extent_ram_bytes(leaf, item);
5273         inline_size = btrfs_file_extent_inline_item_len(leaf,
5274                                         btrfs_item_nr(leaf, path->slots[0]));
5275         tmp = kmalloc(inline_size, GFP_NOFS);
5276         if (!tmp)
5277                 return -ENOMEM;
5278         ptr = btrfs_file_extent_inline_start(item);
5279
5280         read_extent_buffer(leaf, tmp, ptr, inline_size);
5281
5282         max_size = min_t(unsigned long, PAGE_CACHE_SIZE, max_size);
5283         ret = btrfs_decompress(compress_type, tmp, page,
5284                                extent_offset, inline_size, max_size);
5285         if (ret) {
5286                 char *kaddr = kmap_atomic(page);
5287                 unsigned long copy_size = min_t(u64,
5288                                   PAGE_CACHE_SIZE - pg_offset,
5289                                   max_size - extent_offset);
5290                 memset(kaddr + pg_offset, 0, copy_size);
5291                 kunmap_atomic(kaddr);
5292         }
5293         kfree(tmp);
5294         return 0;
5295 }
5296
5297 /*
5298  * a bit scary, this does extent mapping from logical file offset to the disk.
5299  * the ugly parts come from merging extents from the disk with the in-ram
5300  * representation.  This gets more complex because of the data=ordered code,
5301  * where the in-ram extents might be locked pending data=ordered completion.
5302  *
5303  * This also copies inline extents directly into the page.
5304  */
5305
5306 struct extent_map *btrfs_get_extent(struct inode *inode, struct page *page,
5307                                     size_t pg_offset, u64 start, u64 len,
5308                                     int create)
5309 {
5310         int ret;
5311         int err = 0;
5312         u64 bytenr;
5313         u64 extent_start = 0;
5314         u64 extent_end = 0;
5315         u64 objectid = btrfs_ino(inode);
5316         u32 found_type;
5317         struct btrfs_path *path = NULL;
5318         struct btrfs_root *root = BTRFS_I(inode)->root;
5319         struct btrfs_file_extent_item *item;
5320         struct extent_buffer *leaf;
5321         struct btrfs_key found_key;
5322         struct extent_map *em = NULL;
5323         struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
5324         struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
5325         struct btrfs_trans_handle *trans = NULL;
5326         int compress_type;
5327
5328 again:
5329         read_lock(&em_tree->lock);
5330         em = lookup_extent_mapping(em_tree, start, len);
5331         if (em)
5332                 em->bdev = root->fs_info->fs_devices->latest_bdev;
5333         read_unlock(&em_tree->lock);
5334
5335         if (em) {
5336                 if (em->start > start || em->start + em->len <= start)
5337                         free_extent_map(em);
5338                 else if (em->block_start == EXTENT_MAP_INLINE && page)
5339                         free_extent_map(em);
5340                 else
5341                         goto out;
5342         }
5343         em = alloc_extent_map();
5344         if (!em) {
5345                 err = -ENOMEM;
5346                 goto out;
5347         }
5348         em->bdev = root->fs_info->fs_devices->latest_bdev;
5349         em->start = EXTENT_MAP_HOLE;
5350         em->orig_start = EXTENT_MAP_HOLE;
5351         em->len = (u64)-1;
5352         em->block_len = (u64)-1;
5353
5354         if (!path) {
5355                 path = btrfs_alloc_path();
5356                 if (!path) {
5357                         err = -ENOMEM;
5358                         goto out;
5359                 }
5360                 /*
5361                  * Chances are we'll be called again, so go ahead and do
5362                  * readahead
5363                  */
5364                 path->reada = 1;
5365         }
5366
5367         ret = btrfs_lookup_file_extent(trans, root, path,
5368                                        objectid, start, trans != NULL);
5369         if (ret < 0) {
5370                 err = ret;
5371                 goto out;
5372         }
5373
5374         if (ret != 0) {
5375                 if (path->slots[0] == 0)
5376                         goto not_found;
5377                 path->slots[0]--;
5378         }
5379
5380         leaf = path->nodes[0];
5381         item = btrfs_item_ptr(leaf, path->slots[0],
5382                               struct btrfs_file_extent_item);
5383         /* are we inside the extent that was found? */
5384         btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
5385         found_type = btrfs_key_type(&found_key);
5386         if (found_key.objectid != objectid ||
5387             found_type != BTRFS_EXTENT_DATA_KEY) {
5388                 goto not_found;
5389         }
5390
5391         found_type = btrfs_file_extent_type(leaf, item);
5392         extent_start = found_key.offset;
5393         compress_type = btrfs_file_extent_compression(leaf, item);
5394         if (found_type == BTRFS_FILE_EXTENT_REG ||
5395             found_type == BTRFS_FILE_EXTENT_PREALLOC) {
5396                 extent_end = extent_start +
5397                        btrfs_file_extent_num_bytes(leaf, item);
5398         } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
5399                 size_t size;
5400                 size = btrfs_file_extent_inline_len(leaf, item);
5401                 extent_end = (extent_start + size + root->sectorsize - 1) &
5402                         ~((u64)root->sectorsize - 1);
5403         }
5404
5405         if (start >= extent_end) {
5406                 path->slots[0]++;
5407                 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
5408                         ret = btrfs_next_leaf(root, path);
5409                         if (ret < 0) {
5410                                 err = ret;
5411                                 goto out;
5412                         }
5413                         if (ret > 0)
5414                                 goto not_found;
5415                         leaf = path->nodes[0];
5416                 }
5417                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
5418                 if (found_key.objectid != objectid ||
5419                     found_key.type != BTRFS_EXTENT_DATA_KEY)
5420                         goto not_found;
5421                 if (start + len <= found_key.offset)
5422                         goto not_found;
5423                 em->start = start;
5424                 em->orig_start = start;
5425                 em->len = found_key.offset - start;
5426                 goto not_found_em;
5427         }
5428
5429         if (found_type == BTRFS_FILE_EXTENT_REG ||
5430             found_type == BTRFS_FILE_EXTENT_PREALLOC) {
5431                 em->start = extent_start;
5432                 em->len = extent_end - extent_start;
5433                 em->orig_start = extent_start -
5434                                  btrfs_file_extent_offset(leaf, item);
5435                 em->orig_block_len = btrfs_file_extent_disk_num_bytes(leaf,
5436                                                                       item);
5437                 bytenr = btrfs_file_extent_disk_bytenr(leaf, item);
5438                 if (bytenr == 0) {
5439                         em->block_start = EXTENT_MAP_HOLE;
5440                         goto insert;
5441                 }
5442                 if (compress_type != BTRFS_COMPRESS_NONE) {
5443                         set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
5444                         em->compress_type = compress_type;
5445                         em->block_start = bytenr;
5446                         em->block_len = em->orig_block_len;
5447                 } else {
5448                         bytenr += btrfs_file_extent_offset(leaf, item);
5449                         em->block_start = bytenr;
5450                         em->block_len = em->len;
5451                         if (found_type == BTRFS_FILE_EXTENT_PREALLOC)
5452                                 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
5453                 }
5454                 goto insert;
5455         } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
5456                 unsigned long ptr;
5457                 char *map;
5458                 size_t size;
5459                 size_t extent_offset;
5460                 size_t copy_size;
5461
5462                 em->block_start = EXTENT_MAP_INLINE;
5463                 if (!page || create) {
5464                         em->start = extent_start;
5465                         em->len = extent_end - extent_start;
5466                         goto out;
5467                 }
5468
5469                 size = btrfs_file_extent_inline_len(leaf, item);
5470                 extent_offset = page_offset(page) + pg_offset - extent_start;
5471                 copy_size = min_t(u64, PAGE_CACHE_SIZE - pg_offset,
5472                                 size - extent_offset);
5473                 em->start = extent_start + extent_offset;
5474                 em->len = (copy_size + root->sectorsize - 1) &
5475                         ~((u64)root->sectorsize - 1);
5476                 em->orig_block_len = em->len;
5477                 em->orig_start = em->start;
5478                 if (compress_type) {
5479                         set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
5480                         em->compress_type = compress_type;
5481                 }
5482                 ptr = btrfs_file_extent_inline_start(item) + extent_offset;
5483                 if (create == 0 && !PageUptodate(page)) {
5484                         if (btrfs_file_extent_compression(leaf, item) !=
5485                             BTRFS_COMPRESS_NONE) {
5486                                 ret = uncompress_inline(path, inode, page,
5487                                                         pg_offset,
5488                                                         extent_offset, item);
5489                                 BUG_ON(ret); /* -ENOMEM */
5490                         } else {
5491                                 map = kmap(page);
5492                                 read_extent_buffer(leaf, map + pg_offset, ptr,
5493                                                    copy_size);
5494                                 if (pg_offset + copy_size < PAGE_CACHE_SIZE) {
5495                                         memset(map + pg_offset + copy_size, 0,
5496                                                PAGE_CACHE_SIZE - pg_offset -
5497                                                copy_size);
5498                                 }
5499                                 kunmap(page);
5500                         }
5501                         flush_dcache_page(page);
5502                 } else if (create && PageUptodate(page)) {
5503                         BUG();
5504                         if (!trans) {
5505                                 kunmap(page);
5506                                 free_extent_map(em);
5507                                 em = NULL;
5508
5509                                 btrfs_release_path(path);
5510                                 trans = btrfs_join_transaction(root);
5511
5512                                 if (IS_ERR(trans))
5513                                         return ERR_CAST(trans);
5514                                 goto again;
5515                         }
5516                         map = kmap(page);
5517                         write_extent_buffer(leaf, map + pg_offset, ptr,
5518                                             copy_size);
5519                         kunmap(page);
5520                         btrfs_mark_buffer_dirty(leaf);
5521                 }
5522                 set_extent_uptodate(io_tree, em->start,
5523                                     extent_map_end(em) - 1, NULL, GFP_NOFS);
5524                 goto insert;
5525         } else {
5526                 WARN(1, KERN_ERR "btrfs unknown found_type %d\n", found_type);
5527         }
5528 not_found:
5529         em->start = start;
5530         em->orig_start = start;
5531         em->len = len;
5532 not_found_em:
5533         em->block_start = EXTENT_MAP_HOLE;
5534         set_bit(EXTENT_FLAG_VACANCY, &em->flags);
5535 insert:
5536         btrfs_release_path(path);
5537         if (em->start > start || extent_map_end(em) <= start) {
5538                 printk(KERN_ERR "Btrfs: bad extent! em: [%llu %llu] passed "
5539                        "[%llu %llu]\n", (unsigned long long)em->start,
5540                        (unsigned long long)em->len,
5541                        (unsigned long long)start,
5542                        (unsigned long long)len);
5543                 err = -EIO;
5544                 goto out;
5545         }
5546
5547         err = 0;
5548         write_lock(&em_tree->lock);
5549         ret = add_extent_mapping(em_tree, em);
5550         /* it is possible that someone inserted the extent into the tree
5551          * while we had the lock dropped.  It is also possible that
5552          * an overlapping map exists in the tree
5553          */
5554         if (ret == -EEXIST) {
5555                 struct extent_map *existing;
5556
5557                 ret = 0;
5558
5559                 existing = lookup_extent_mapping(em_tree, start, len);
5560                 if (existing && (existing->start > start ||
5561                     existing->start + existing->len <= start)) {
5562                         free_extent_map(existing);
5563                         existing = NULL;
5564                 }
5565                 if (!existing) {
5566                         existing = lookup_extent_mapping(em_tree, em->start,
5567                                                          em->len);
5568                         if (existing) {
5569                                 err = merge_extent_mapping(em_tree, existing,
5570                                                            em, start,
5571                                                            root->sectorsize);
5572                                 free_extent_map(existing);
5573                                 if (err) {
5574                                         free_extent_map(em);
5575                                         em = NULL;
5576                                 }
5577                         } else {
5578                                 err = -EIO;
5579                                 free_extent_map(em);
5580                                 em = NULL;
5581                         }
5582                 } else {
5583                         free_extent_map(em);
5584                         em = existing;
5585                         err = 0;
5586                 }
5587         }
5588         write_unlock(&em_tree->lock);
5589 out:
5590
5591         if (em)
5592                 trace_btrfs_get_extent(root, em);
5593
5594         if (path)
5595                 btrfs_free_path(path);
5596         if (trans) {
5597                 ret = btrfs_end_transaction(trans, root);
5598                 if (!err)
5599                         err = ret;
5600         }
5601         if (err) {
5602                 free_extent_map(em);
5603                 return ERR_PTR(err);
5604         }
5605         BUG_ON(!em); /* Error is always set */
5606         return em;
5607 }
5608
5609 struct extent_map *btrfs_get_extent_fiemap(struct inode *inode, struct page *page,
5610                                            size_t pg_offset, u64 start, u64 len,
5611                                            int create)
5612 {
5613         struct extent_map *em;
5614         struct extent_map *hole_em = NULL;
5615         u64 range_start = start;
5616         u64 end;
5617         u64 found;
5618         u64 found_end;
5619         int err = 0;
5620
5621         em = btrfs_get_extent(inode, page, pg_offset, start, len, create);
5622         if (IS_ERR(em))
5623                 return em;
5624         if (em) {
5625                 /*
5626                  * if our em maps to
5627                  * -  a hole or
5628                  * -  a pre-alloc extent,
5629                  * there might actually be delalloc bytes behind it.
5630                  */
5631                 if (em->block_start != EXTENT_MAP_HOLE &&
5632                     !test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
5633                         return em;
5634                 else
5635                         hole_em = em;
5636         }
5637
5638         /* check to see if we've wrapped (len == -1 or similar) */
5639         end = start + len;
5640         if (end < start)
5641                 end = (u64)-1;
5642         else
5643                 end -= 1;
5644
5645         em = NULL;
5646
5647         /* ok, we didn't find anything, lets look for delalloc */
5648         found = count_range_bits(&BTRFS_I(inode)->io_tree, &range_start,
5649                                  end, len, EXTENT_DELALLOC, 1);
5650         found_end = range_start + found;
5651         if (found_end < range_start)
5652                 found_end = (u64)-1;
5653
5654         /*
5655          * we didn't find anything useful, return
5656          * the original results from get_extent()
5657          */
5658         if (range_start > end || found_end <= start) {
5659                 em = hole_em;
5660                 hole_em = NULL;
5661                 goto out;
5662         }
5663
5664         /* adjust the range_start to make sure it doesn't
5665          * go backwards from the start they passed in
5666          */
5667         range_start = max(start,range_start);
5668         found = found_end - range_start;
5669
5670         if (found > 0) {
5671                 u64 hole_start = start;
5672                 u64 hole_len = len;
5673
5674                 em = alloc_extent_map();
5675                 if (!em) {
5676                         err = -ENOMEM;
5677                         goto out;
5678                 }
5679                 /*
5680                  * when btrfs_get_extent can't find anything it
5681                  * returns one huge hole
5682                  *
5683                  * make sure what it found really fits our range, and
5684                  * adjust to make sure it is based on the start from
5685                  * the caller
5686                  */
5687                 if (hole_em) {
5688                         u64 calc_end = extent_map_end(hole_em);
5689
5690                         if (calc_end <= start || (hole_em->start > end)) {
5691                                 free_extent_map(hole_em);
5692                                 hole_em = NULL;
5693                         } else {
5694                                 hole_start = max(hole_em->start, start);
5695                                 hole_len = calc_end - hole_start;
5696                         }
5697                 }
5698                 em->bdev = NULL;
5699                 if (hole_em && range_start > hole_start) {
5700                         /* our hole starts before our delalloc, so we
5701                          * have to return just the parts of the hole
5702                          * that go until  the delalloc starts
5703                          */
5704                         em->len = min(hole_len,
5705                                       range_start - hole_start);
5706                         em->start = hole_start;
5707                         em->orig_start = hole_start;
5708                         /*
5709                          * don't adjust block start at all,
5710                          * it is fixed at EXTENT_MAP_HOLE
5711                          */
5712                         em->block_start = hole_em->block_start;
5713                         em->block_len = hole_len;
5714                         if (test_bit(EXTENT_FLAG_PREALLOC, &hole_em->flags))
5715                                 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
5716                 } else {
5717                         em->start = range_start;
5718                         em->len = found;
5719                         em->orig_start = range_start;
5720                         em->block_start = EXTENT_MAP_DELALLOC;
5721                         em->block_len = found;
5722                 }
5723         } else if (hole_em) {
5724                 return hole_em;
5725         }
5726 out:
5727
5728         free_extent_map(hole_em);
5729         if (err) {
5730                 free_extent_map(em);
5731                 return ERR_PTR(err);
5732         }
5733         return em;
5734 }
5735
5736 static struct extent_map *btrfs_new_extent_direct(struct inode *inode,
5737                                                   u64 start, u64 len)
5738 {
5739         struct btrfs_root *root = BTRFS_I(inode)->root;
5740         struct btrfs_trans_handle *trans;
5741         struct extent_map *em;
5742         struct btrfs_key ins;
5743         u64 alloc_hint;
5744         int ret;
5745
5746         trans = btrfs_join_transaction(root);
5747         if (IS_ERR(trans))
5748                 return ERR_CAST(trans);
5749
5750         trans->block_rsv = &root->fs_info->delalloc_block_rsv;
5751
5752         alloc_hint = get_extent_allocation_hint(inode, start, len);
5753         ret = btrfs_reserve_extent(trans, root, len, root->sectorsize, 0,
5754                                    alloc_hint, &ins, 1);
5755         if (ret) {
5756                 em = ERR_PTR(ret);
5757                 goto out;
5758         }
5759
5760         em = create_pinned_em(inode, start, ins.offset, start, ins.objectid,
5761                               ins.offset, ins.offset, 0);
5762         if (IS_ERR(em))
5763                 goto out;
5764
5765         ret = btrfs_add_ordered_extent_dio(inode, start, ins.objectid,
5766                                            ins.offset, ins.offset, 0);
5767         if (ret) {
5768                 btrfs_free_reserved_extent(root, ins.objectid, ins.offset);
5769                 em = ERR_PTR(ret);
5770         }
5771 out:
5772         btrfs_end_transaction(trans, root);
5773         return em;
5774 }
5775
5776 /*
5777  * returns 1 when the nocow is safe, < 1 on error, 0 if the
5778  * block must be cow'd
5779  */
5780 static noinline int can_nocow_odirect(struct btrfs_trans_handle *trans,
5781                                       struct inode *inode, u64 offset, u64 len)
5782 {
5783         struct btrfs_path *path;
5784         int ret;
5785         struct extent_buffer *leaf;
5786         struct btrfs_root *root = BTRFS_I(inode)->root;
5787         struct btrfs_file_extent_item *fi;
5788         struct btrfs_key key;
5789         u64 disk_bytenr;
5790         u64 backref_offset;
5791         u64 extent_end;
5792         u64 num_bytes;
5793         int slot;
5794         int found_type;
5795
5796         path = btrfs_alloc_path();
5797         if (!path)
5798                 return -ENOMEM;
5799
5800         ret = btrfs_lookup_file_extent(trans, root, path, btrfs_ino(inode),
5801                                        offset, 0);
5802         if (ret < 0)
5803                 goto out;
5804
5805         slot = path->slots[0];
5806         if (ret == 1) {
5807                 if (slot == 0) {
5808                         /* can't find the item, must cow */
5809                         ret = 0;
5810                         goto out;
5811                 }
5812                 slot--;
5813         }
5814         ret = 0;
5815         leaf = path->nodes[0];
5816         btrfs_item_key_to_cpu(leaf, &key, slot);
5817         if (key.objectid != btrfs_ino(inode) ||
5818             key.type != BTRFS_EXTENT_DATA_KEY) {
5819                 /* not our file or wrong item type, must cow */
5820                 goto out;
5821         }
5822
5823         if (key.offset > offset) {
5824                 /* Wrong offset, must cow */
5825                 goto out;
5826         }
5827
5828         fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
5829         found_type = btrfs_file_extent_type(leaf, fi);
5830         if (found_type != BTRFS_FILE_EXTENT_REG &&
5831             found_type != BTRFS_FILE_EXTENT_PREALLOC) {
5832                 /* not a regular extent, must cow */
5833                 goto out;
5834         }
5835         disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
5836         backref_offset = btrfs_file_extent_offset(leaf, fi);
5837
5838         extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi);
5839         if (extent_end < offset + len) {
5840                 /* extent doesn't include our full range, must cow */
5841                 goto out;
5842         }
5843
5844         if (btrfs_extent_readonly(root, disk_bytenr))
5845                 goto out;
5846
5847         /*
5848          * look for other files referencing this extent, if we
5849          * find any we must cow
5850          */
5851         if (btrfs_cross_ref_exist(trans, root, btrfs_ino(inode),
5852                                   key.offset - backref_offset, disk_bytenr))
5853                 goto out;
5854
5855         /*
5856          * adjust disk_bytenr and num_bytes to cover just the bytes
5857          * in this extent we are about to write.  If there
5858          * are any csums in that range we have to cow in order
5859          * to keep the csums correct
5860          */
5861         disk_bytenr += backref_offset;
5862         disk_bytenr += offset - key.offset;
5863         num_bytes = min(offset + len, extent_end) - offset;
5864         if (csum_exist_in_range(root, disk_bytenr, num_bytes))
5865                                 goto out;
5866         /*
5867          * all of the above have passed, it is safe to overwrite this extent
5868          * without cow
5869          */
5870         ret = 1;
5871 out:
5872         btrfs_free_path(path);
5873         return ret;
5874 }
5875
5876 static int lock_extent_direct(struct inode *inode, u64 lockstart, u64 lockend,
5877                               struct extent_state **cached_state, int writing)
5878 {
5879         struct btrfs_ordered_extent *ordered;
5880         int ret = 0;
5881
5882         while (1) {
5883                 lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend,
5884                                  0, cached_state);
5885                 /*
5886                  * We're concerned with the entire range that we're going to be
5887                  * doing DIO to, so we need to make sure theres no ordered
5888                  * extents in this range.
5889                  */
5890                 ordered = btrfs_lookup_ordered_range(inode, lockstart,
5891                                                      lockend - lockstart + 1);
5892
5893                 /*
5894                  * We need to make sure there are no buffered pages in this
5895                  * range either, we could have raced between the invalidate in
5896                  * generic_file_direct_write and locking the extent.  The
5897                  * invalidate needs to happen so that reads after a write do not
5898                  * get stale data.
5899                  */
5900                 if (!ordered && (!writing ||
5901                     !test_range_bit(&BTRFS_I(inode)->io_tree,
5902                                     lockstart, lockend, EXTENT_UPTODATE, 0,
5903                                     *cached_state)))
5904                         break;
5905
5906                 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend,
5907                                      cached_state, GFP_NOFS);
5908
5909                 if (ordered) {
5910                         btrfs_start_ordered_extent(inode, ordered, 1);
5911                         btrfs_put_ordered_extent(ordered);
5912                 } else {
5913                         /* Screw you mmap */
5914                         ret = filemap_write_and_wait_range(inode->i_mapping,
5915                                                            lockstart,
5916                                                            lockend);
5917                         if (ret)
5918                                 break;
5919
5920                         /*
5921                          * If we found a page that couldn't be invalidated just
5922                          * fall back to buffered.
5923                          */
5924                         ret = invalidate_inode_pages2_range(inode->i_mapping,
5925                                         lockstart >> PAGE_CACHE_SHIFT,
5926                                         lockend >> PAGE_CACHE_SHIFT);
5927                         if (ret)
5928                                 break;
5929                 }
5930
5931                 cond_resched();
5932         }
5933
5934         return ret;
5935 }
5936
5937 static struct extent_map *create_pinned_em(struct inode *inode, u64 start,
5938                                            u64 len, u64 orig_start,
5939                                            u64 block_start, u64 block_len,
5940                                            u64 orig_block_len, int type)
5941 {
5942         struct extent_map_tree *em_tree;
5943         struct extent_map *em;
5944         struct btrfs_root *root = BTRFS_I(inode)->root;
5945         int ret;
5946
5947         em_tree = &BTRFS_I(inode)->extent_tree;
5948         em = alloc_extent_map();
5949         if (!em)
5950                 return ERR_PTR(-ENOMEM);
5951
5952         em->start = start;
5953         em->orig_start = orig_start;
5954         em->len = len;
5955         em->block_len = block_len;
5956         em->block_start = block_start;
5957         em->bdev = root->fs_info->fs_devices->latest_bdev;
5958         em->orig_block_len = orig_block_len;
5959         em->generation = -1;
5960         set_bit(EXTENT_FLAG_PINNED, &em->flags);
5961         if (type == BTRFS_ORDERED_PREALLOC)
5962                 set_bit(EXTENT_FLAG_FILLING, &em->flags);
5963
5964         do {
5965                 btrfs_drop_extent_cache(inode, em->start,
5966                                 em->start + em->len - 1, 0);
5967                 write_lock(&em_tree->lock);
5968                 ret = add_extent_mapping(em_tree, em);
5969                 if (!ret)
5970                         list_move(&em->list,
5971                                   &em_tree->modified_extents);
5972                 write_unlock(&em_tree->lock);
5973         } while (ret == -EEXIST);
5974
5975         if (ret) {
5976                 free_extent_map(em);
5977                 return ERR_PTR(ret);
5978         }
5979
5980         return em;
5981 }
5982
5983
5984 static int btrfs_get_blocks_direct(struct inode *inode, sector_t iblock,
5985                                    struct buffer_head *bh_result, int create)
5986 {
5987         struct extent_map *em;
5988         struct btrfs_root *root = BTRFS_I(inode)->root;
5989         struct extent_state *cached_state = NULL;
5990         u64 start = iblock << inode->i_blkbits;
5991         u64 lockstart, lockend;
5992         u64 len = bh_result->b_size;
5993         struct btrfs_trans_handle *trans;
5994         int unlock_bits = EXTENT_LOCKED;
5995         int ret;
5996
5997         if (create) {
5998                 ret = btrfs_delalloc_reserve_space(inode, len);
5999                 if (ret)
6000                         return ret;
6001                 unlock_bits |= EXTENT_DELALLOC | EXTENT_DIRTY;
6002         } else {
6003                 len = min_t(u64, len, root->sectorsize);
6004         }
6005
6006         lockstart = start;
6007         lockend = start + len - 1;
6008
6009         /*
6010          * If this errors out it's because we couldn't invalidate pagecache for
6011          * this range and we need to fallback to buffered.
6012          */
6013         if (lock_extent_direct(inode, lockstart, lockend, &cached_state, create))
6014                 return -ENOTBLK;
6015
6016         if (create) {
6017                 ret = set_extent_bit(&BTRFS_I(inode)->io_tree, lockstart,
6018                                      lockend, EXTENT_DELALLOC, NULL,
6019                                      &cached_state, GFP_NOFS);
6020                 if (ret)
6021                         goto unlock_err;
6022         }
6023
6024         em = btrfs_get_extent(inode, NULL, 0, start, len, 0);
6025         if (IS_ERR(em)) {
6026                 ret = PTR_ERR(em);
6027                 goto unlock_err;
6028         }
6029
6030         /*
6031          * Ok for INLINE and COMPRESSED extents we need to fallback on buffered
6032          * io.  INLINE is special, and we could probably kludge it in here, but
6033          * it's still buffered so for safety lets just fall back to the generic
6034          * buffered path.
6035          *
6036          * For COMPRESSED we _have_ to read the entire extent in so we can
6037          * decompress it, so there will be buffering required no matter what we
6038          * do, so go ahead and fallback to buffered.
6039          *
6040          * We return -ENOTBLK because thats what makes DIO go ahead and go back
6041          * to buffered IO.  Don't blame me, this is the price we pay for using
6042          * the generic code.
6043          */
6044         if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) ||
6045             em->block_start == EXTENT_MAP_INLINE) {
6046                 free_extent_map(em);
6047                 ret = -ENOTBLK;
6048                 goto unlock_err;
6049         }
6050
6051         /* Just a good old fashioned hole, return */
6052         if (!create && (em->block_start == EXTENT_MAP_HOLE ||
6053                         test_bit(EXTENT_FLAG_PREALLOC, &em->flags))) {
6054                 free_extent_map(em);
6055                 ret = 0;
6056                 goto unlock_err;
6057         }
6058
6059         /*
6060          * We don't allocate a new extent in the following cases
6061          *
6062          * 1) The inode is marked as NODATACOW.  In this case we'll just use the
6063          * existing extent.
6064          * 2) The extent is marked as PREALLOC.  We're good to go here and can
6065          * just use the extent.
6066          *
6067          */
6068         if (!create) {
6069                 len = min(len, em->len - (start - em->start));
6070                 lockstart = start + len;
6071                 goto unlock;
6072         }
6073
6074         if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) ||
6075             ((BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
6076              em->block_start != EXTENT_MAP_HOLE)) {
6077                 int type;
6078                 int ret;
6079                 u64 block_start;
6080
6081                 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
6082                         type = BTRFS_ORDERED_PREALLOC;
6083                 else
6084                         type = BTRFS_ORDERED_NOCOW;
6085                 len = min(len, em->len - (start - em->start));
6086                 block_start = em->block_start + (start - em->start);
6087
6088                 /*
6089                  * we're not going to log anything, but we do need
6090                  * to make sure the current transaction stays open
6091                  * while we look for nocow cross refs
6092                  */
6093                 trans = btrfs_join_transaction(root);
6094                 if (IS_ERR(trans))
6095                         goto must_cow;
6096
6097                 if (can_nocow_odirect(trans, inode, start, len) == 1) {
6098                         u64 orig_start = em->orig_start;
6099                         u64 orig_block_len = em->orig_block_len;
6100
6101                         if (type == BTRFS_ORDERED_PREALLOC) {
6102                                 free_extent_map(em);
6103                                 em = create_pinned_em(inode, start, len,
6104                                                        orig_start,
6105                                                        block_start, len,
6106                                                        orig_block_len, type);
6107                                 if (IS_ERR(em)) {
6108                                         btrfs_end_transaction(trans, root);
6109                                         goto unlock_err;
6110                                 }
6111                         }
6112
6113                         ret = btrfs_add_ordered_extent_dio(inode, start,
6114                                            block_start, len, len, type);
6115                         btrfs_end_transaction(trans, root);
6116                         if (ret) {
6117                                 free_extent_map(em);
6118                                 goto unlock_err;
6119                         }
6120                         goto unlock;
6121                 }
6122                 btrfs_end_transaction(trans, root);
6123         }
6124 must_cow:
6125         /*
6126          * this will cow the extent, reset the len in case we changed
6127          * it above
6128          */
6129         len = bh_result->b_size;
6130         free_extent_map(em);
6131         em = btrfs_new_extent_direct(inode, start, len);
6132         if (IS_ERR(em)) {
6133                 ret = PTR_ERR(em);
6134                 goto unlock_err;
6135         }
6136         len = min(len, em->len - (start - em->start));
6137 unlock:
6138         bh_result->b_blocknr = (em->block_start + (start - em->start)) >>
6139                 inode->i_blkbits;
6140         bh_result->b_size = len;
6141         bh_result->b_bdev = em->bdev;
6142         set_buffer_mapped(bh_result);
6143         if (create) {
6144                 if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
6145                         set_buffer_new(bh_result);
6146
6147                 /*
6148                  * Need to update the i_size under the extent lock so buffered
6149                  * readers will get the updated i_size when we unlock.
6150                  */
6151                 if (start + len > i_size_read(inode))
6152                         i_size_write(inode, start + len);
6153         }
6154
6155         /*
6156          * In the case of write we need to clear and unlock the entire range,
6157          * in the case of read we need to unlock only the end area that we
6158          * aren't using if there is any left over space.
6159          */
6160         if (lockstart < lockend) {
6161                 if (create && len < lockend - lockstart) {
6162                         clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart,
6163                                          lockstart + len - 1,
6164                                          unlock_bits | EXTENT_DEFRAG, 1, 0,
6165                                          &cached_state, GFP_NOFS);
6166                         /*
6167                          * Beside unlock, we also need to cleanup reserved space
6168                          * for the left range by attaching EXTENT_DO_ACCOUNTING.
6169                          */
6170                         clear_extent_bit(&BTRFS_I(inode)->io_tree,
6171                                          lockstart + len, lockend,
6172                                          unlock_bits | EXTENT_DO_ACCOUNTING |
6173                                          EXTENT_DEFRAG, 1, 0, NULL, GFP_NOFS);
6174                 } else {
6175                         clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart,
6176                                          lockend, unlock_bits, 1, 0,
6177                                          &cached_state, GFP_NOFS);
6178                 }
6179         } else {
6180                 free_extent_state(cached_state);
6181         }
6182
6183         free_extent_map(em);
6184
6185         return 0;
6186
6187 unlock_err:
6188         if (create)
6189                 unlock_bits |= EXTENT_DO_ACCOUNTING;
6190
6191         clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart, lockend,
6192                          unlock_bits, 1, 0, &cached_state, GFP_NOFS);
6193         return ret;
6194 }
6195
6196 struct btrfs_dio_private {
6197         struct inode *inode;
6198         u64 logical_offset;
6199         u64 disk_bytenr;
6200         u64 bytes;
6201         void *private;
6202
6203         /* number of bios pending for this dio */
6204         atomic_t pending_bios;
6205
6206         /* IO errors */
6207         int errors;
6208
6209         struct bio *orig_bio;
6210 };
6211
6212 static void btrfs_endio_direct_read(struct bio *bio, int err)
6213 {
6214         struct btrfs_dio_private *dip = bio->bi_private;
6215         struct bio_vec *bvec_end = bio->bi_io_vec + bio->bi_vcnt - 1;
6216         struct bio_vec *bvec = bio->bi_io_vec;
6217         struct inode *inode = dip->inode;
6218         struct btrfs_root *root = BTRFS_I(inode)->root;
6219         u64 start;
6220
6221         start = dip->logical_offset;
6222         do {
6223                 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) {
6224                         struct page *page = bvec->bv_page;
6225                         char *kaddr;
6226                         u32 csum = ~(u32)0;
6227                         u64 private = ~(u32)0;
6228                         unsigned long flags;
6229
6230                         if (get_state_private(&BTRFS_I(inode)->io_tree,
6231                                               start, &private))
6232                                 goto failed;
6233                         local_irq_save(flags);
6234                         kaddr = kmap_atomic(page);
6235                         csum = btrfs_csum_data(root, kaddr + bvec->bv_offset,
6236                                                csum, bvec->bv_len);
6237                         btrfs_csum_final(csum, (char *)&csum);
6238                         kunmap_atomic(kaddr);
6239                         local_irq_restore(flags);
6240
6241                         flush_dcache_page(bvec->bv_page);
6242                         if (csum != private) {
6243 failed:
6244                                 printk(KERN_ERR "btrfs csum failed ino %llu off"
6245                                       " %llu csum %u private %u\n",
6246                                       (unsigned long long)btrfs_ino(inode),
6247                                       (unsigned long long)start,
6248                                       csum, (unsigned)private);
6249                                 err = -EIO;
6250                         }
6251                 }
6252
6253                 start += bvec->bv_len;
6254                 bvec++;
6255         } while (bvec <= bvec_end);
6256
6257         unlock_extent(&BTRFS_I(inode)->io_tree, dip->logical_offset,
6258                       dip->logical_offset + dip->bytes - 1);
6259         bio->bi_private = dip->private;
6260
6261         kfree(dip);
6262
6263         /* If we had a csum failure make sure to clear the uptodate flag */
6264         if (err)
6265                 clear_bit(BIO_UPTODATE, &bio->bi_flags);
6266         dio_end_io(bio, err);
6267 }
6268
6269 static void btrfs_endio_direct_write(struct bio *bio, int err)
6270 {
6271         struct btrfs_dio_private *dip = bio->bi_private;
6272         struct inode *inode = dip->inode;
6273         struct btrfs_root *root = BTRFS_I(inode)->root;
6274         struct btrfs_ordered_extent *ordered = NULL;
6275         u64 ordered_offset = dip->logical_offset;
6276         u64 ordered_bytes = dip->bytes;
6277         int ret;
6278
6279         if (err)
6280                 goto out_done;
6281 again:
6282         ret = btrfs_dec_test_first_ordered_pending(inode, &ordered,
6283                                                    &ordered_offset,
6284                                                    ordered_bytes, !err);
6285         if (!ret)
6286                 goto out_test;
6287
6288         ordered->work.func = finish_ordered_fn;
6289         ordered->work.flags = 0;
6290         btrfs_queue_worker(&root->fs_info->endio_write_workers,
6291                            &ordered->work);
6292 out_test:
6293         /*
6294          * our bio might span multiple ordered extents.  If we haven't
6295          * completed the accounting for the whole dio, go back and try again
6296          */
6297         if (ordered_offset < dip->logical_offset + dip->bytes) {
6298                 ordered_bytes = dip->logical_offset + dip->bytes -
6299                         ordered_offset;
6300                 ordered = NULL;
6301                 goto again;
6302         }
6303 out_done:
6304         bio->bi_private = dip->private;
6305
6306         kfree(dip);
6307
6308         /* If we had an error make sure to clear the uptodate flag */
6309         if (err)
6310                 clear_bit(BIO_UPTODATE, &bio->bi_flags);
6311         dio_end_io(bio, err);
6312 }
6313
6314 static int __btrfs_submit_bio_start_direct_io(struct inode *inode, int rw,
6315                                     struct bio *bio, int mirror_num,
6316                                     unsigned long bio_flags, u64 offset)
6317 {
6318         int ret;
6319         struct btrfs_root *root = BTRFS_I(inode)->root;
6320         ret = btrfs_csum_one_bio(root, inode, bio, offset, 1);
6321         BUG_ON(ret); /* -ENOMEM */
6322         return 0;
6323 }
6324
6325 static void btrfs_end_dio_bio(struct bio *bio, int err)
6326 {
6327         struct btrfs_dio_private *dip = bio->bi_private;
6328
6329         if (err) {
6330                 printk(KERN_ERR "btrfs direct IO failed ino %llu rw %lu "
6331                       "sector %#Lx len %u err no %d\n",
6332                       (unsigned long long)btrfs_ino(dip->inode), bio->bi_rw,
6333                       (unsigned long long)bio->bi_sector, bio->bi_size, err);
6334                 dip->errors = 1;
6335
6336                 /*
6337                  * before atomic variable goto zero, we must make sure
6338                  * dip->errors is perceived to be set.
6339                  */
6340                 smp_mb__before_atomic_dec();
6341         }
6342
6343         /* if there are more bios still pending for this dio, just exit */
6344         if (!atomic_dec_and_test(&dip->pending_bios))
6345                 goto out;
6346
6347         if (dip->errors)
6348                 bio_io_error(dip->orig_bio);
6349         else {
6350                 set_bit(BIO_UPTODATE, &dip->orig_bio->bi_flags);
6351                 bio_endio(dip->orig_bio, 0);
6352         }
6353 out:
6354         bio_put(bio);
6355 }
6356
6357 static struct bio *btrfs_dio_bio_alloc(struct block_device *bdev,
6358                                        u64 first_sector, gfp_t gfp_flags)
6359 {
6360         int nr_vecs = bio_get_nr_vecs(bdev);
6361         return btrfs_bio_alloc(bdev, first_sector, nr_vecs, gfp_flags);
6362 }
6363
6364 static inline int __btrfs_submit_dio_bio(struct bio *bio, struct inode *inode,
6365                                          int rw, u64 file_offset, int skip_sum,
6366                                          int async_submit)
6367 {
6368         int write = rw & REQ_WRITE;
6369         struct btrfs_root *root = BTRFS_I(inode)->root;
6370         int ret;
6371
6372         if (async_submit)
6373                 async_submit = !atomic_read(&BTRFS_I(inode)->sync_writers);
6374
6375         bio_get(bio);
6376
6377         if (!write) {
6378                 ret = btrfs_bio_wq_end_io(root->fs_info, bio, 0);
6379                 if (ret)
6380                         goto err;
6381         }
6382
6383         if (skip_sum)
6384                 goto map;
6385
6386         if (write && async_submit) {
6387                 ret = btrfs_wq_submit_bio(root->fs_info,
6388                                    inode, rw, bio, 0, 0,
6389                                    file_offset,
6390                                    __btrfs_submit_bio_start_direct_io,
6391                                    __btrfs_submit_bio_done);
6392                 goto err;
6393         } else if (write) {
6394                 /*
6395                  * If we aren't doing async submit, calculate the csum of the
6396                  * bio now.
6397                  */
6398                 ret = btrfs_csum_one_bio(root, inode, bio, file_offset, 1);
6399                 if (ret)
6400                         goto err;
6401         } else if (!skip_sum) {
6402                 ret = btrfs_lookup_bio_sums_dio(root, inode, bio, file_offset);
6403                 if (ret)
6404                         goto err;
6405         }
6406
6407 map:
6408         ret = btrfs_map_bio(root, rw, bio, 0, async_submit);
6409 err:
6410         bio_put(bio);
6411         return ret;
6412 }
6413
6414 static int btrfs_submit_direct_hook(int rw, struct btrfs_dio_private *dip,
6415                                     int skip_sum)
6416 {
6417         struct inode *inode = dip->inode;
6418         struct btrfs_root *root = BTRFS_I(inode)->root;
6419         struct bio *bio;
6420         struct bio *orig_bio = dip->orig_bio;
6421         struct bio_vec *bvec = orig_bio->bi_io_vec;
6422         u64 start_sector = orig_bio->bi_sector;
6423         u64 file_offset = dip->logical_offset;
6424         u64 submit_len = 0;
6425         u64 map_length;
6426         int nr_pages = 0;
6427         int ret = 0;
6428         int async_submit = 0;
6429
6430         map_length = orig_bio->bi_size;
6431         ret = btrfs_map_block(root->fs_info, READ, start_sector << 9,
6432                               &map_length, NULL, 0);
6433         if (ret) {
6434                 bio_put(orig_bio);
6435                 return -EIO;
6436         }
6437
6438         if (map_length >= orig_bio->bi_size) {
6439                 bio = orig_bio;
6440                 goto submit;
6441         }
6442
6443         async_submit = 1;
6444         bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev, start_sector, GFP_NOFS);
6445         if (!bio)
6446                 return -ENOMEM;
6447         bio->bi_private = dip;
6448         bio->bi_end_io = btrfs_end_dio_bio;
6449         atomic_inc(&dip->pending_bios);
6450
6451         while (bvec <= (orig_bio->bi_io_vec + orig_bio->bi_vcnt - 1)) {
6452                 if (unlikely(map_length < submit_len + bvec->bv_len ||
6453                     bio_add_page(bio, bvec->bv_page, bvec->bv_len,
6454                                  bvec->bv_offset) < bvec->bv_len)) {
6455                         /*
6456                          * inc the count before we submit the bio so
6457                          * we know the end IO handler won't happen before
6458                          * we inc the count. Otherwise, the dip might get freed
6459                          * before we're done setting it up
6460                          */
6461                         atomic_inc(&dip->pending_bios);
6462                         ret = __btrfs_submit_dio_bio(bio, inode, rw,
6463                                                      file_offset, skip_sum,
6464                                                      async_submit);
6465                         if (ret) {
6466                                 bio_put(bio);
6467                                 atomic_dec(&dip->pending_bios);
6468                                 goto out_err;
6469                         }
6470
6471                         start_sector += submit_len >> 9;
6472                         file_offset += submit_len;
6473
6474                         submit_len = 0;
6475                         nr_pages = 0;
6476
6477                         bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev,
6478                                                   start_sector, GFP_NOFS);
6479                         if (!bio)
6480                                 goto out_err;
6481                         bio->bi_private = dip;
6482                         bio->bi_end_io = btrfs_end_dio_bio;
6483
6484                         map_length = orig_bio->bi_size;
6485                         ret = btrfs_map_block(root->fs_info, READ,
6486                                               start_sector << 9,
6487                                               &map_length, NULL, 0);
6488                         if (ret) {
6489                                 bio_put(bio);
6490                                 goto out_err;
6491                         }
6492                 } else {
6493                         submit_len += bvec->bv_len;
6494                         nr_pages ++;
6495                         bvec++;
6496                 }
6497         }
6498
6499 submit:
6500         ret = __btrfs_submit_dio_bio(bio, inode, rw, file_offset, skip_sum,
6501                                      async_submit);
6502         if (!ret)
6503                 return 0;
6504
6505         bio_put(bio);
6506 out_err:
6507         dip->errors = 1;
6508         /*
6509          * before atomic variable goto zero, we must
6510          * make sure dip->errors is perceived to be set.
6511          */
6512         smp_mb__before_atomic_dec();
6513         if (atomic_dec_and_test(&dip->pending_bios))
6514                 bio_io_error(dip->orig_bio);
6515
6516         /* bio_end_io() will handle error, so we needn't return it */
6517         return 0;
6518 }
6519
6520 static void btrfs_submit_direct(int rw, struct bio *bio, struct inode *inode,
6521                                 loff_t file_offset)
6522 {
6523         struct btrfs_root *root = BTRFS_I(inode)->root;
6524         struct btrfs_dio_private *dip;
6525         struct bio_vec *bvec = bio->bi_io_vec;
6526         int skip_sum;
6527         int write = rw & REQ_WRITE;
6528         int ret = 0;
6529
6530         skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
6531
6532         dip = kmalloc(sizeof(*dip), GFP_NOFS);
6533         if (!dip) {
6534                 ret = -ENOMEM;
6535                 goto free_ordered;
6536         }
6537
6538         dip->private = bio->bi_private;
6539         dip->inode = inode;
6540         dip->logical_offset = file_offset;
6541
6542         dip->bytes = 0;
6543         do {
6544                 dip->bytes += bvec->bv_len;
6545                 bvec++;
6546         } while (bvec <= (bio->bi_io_vec + bio->bi_vcnt - 1));
6547
6548         dip->disk_bytenr = (u64)bio->bi_sector << 9;
6549         bio->bi_private = dip;
6550         dip->errors = 0;
6551         dip->orig_bio = bio;
6552         atomic_set(&dip->pending_bios, 0);
6553
6554         if (write)
6555                 bio->bi_end_io = btrfs_endio_direct_write;
6556         else
6557                 bio->bi_end_io = btrfs_endio_direct_read;
6558
6559         ret = btrfs_submit_direct_hook(rw, dip, skip_sum);
6560         if (!ret)
6561                 return;
6562 free_ordered:
6563         /*
6564          * If this is a write, we need to clean up the reserved space and kill
6565          * the ordered extent.
6566          */
6567         if (write) {
6568                 struct btrfs_ordered_extent *ordered;
6569                 ordered = btrfs_lookup_ordered_extent(inode, file_offset);
6570                 if (!test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags) &&
6571                     !test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags))
6572                         btrfs_free_reserved_extent(root, ordered->start,
6573                                                    ordered->disk_len);
6574                 btrfs_put_ordered_extent(ordered);
6575                 btrfs_put_ordered_extent(ordered);
6576         }
6577         bio_endio(bio, ret);
6578 }
6579
6580 static ssize_t check_direct_IO(struct btrfs_root *root, int rw, struct kiocb *iocb,
6581                         const struct iovec *iov, loff_t offset,
6582                         unsigned long nr_segs)
6583 {
6584         int seg;
6585         int i;
6586         size_t size;
6587         unsigned long addr;
6588         unsigned blocksize_mask = root->sectorsize - 1;
6589         ssize_t retval = -EINVAL;
6590         loff_t end = offset;
6591
6592         if (offset & blocksize_mask)
6593                 goto out;
6594
6595         /* Check the memory alignment.  Blocks cannot straddle pages */
6596         for (seg = 0; seg < nr_segs; seg++) {
6597                 addr = (unsigned long)iov[seg].iov_base;
6598                 size = iov[seg].iov_len;
6599                 end += size;
6600                 if ((addr & blocksize_mask) || (size & blocksize_mask))
6601                         goto out;
6602
6603                 /* If this is a write we don't need to check anymore */
6604                 if (rw & WRITE)
6605                         continue;
6606
6607                 /*
6608                  * Check to make sure we don't have duplicate iov_base's in this
6609                  * iovec, if so return EINVAL, otherwise we'll get csum errors
6610                  * when reading back.
6611                  */
6612                 for (i = seg + 1; i < nr_segs; i++) {
6613                         if (iov[seg].iov_base == iov[i].iov_base)
6614                                 goto out;
6615                 }
6616         }
6617         retval = 0;
6618 out:
6619         return retval;
6620 }
6621
6622 static ssize_t btrfs_direct_IO(int rw, struct kiocb *iocb,
6623                         const struct iovec *iov, loff_t offset,
6624                         unsigned long nr_segs)
6625 {
6626         struct file *file = iocb->ki_filp;
6627         struct inode *inode = file->f_mapping->host;
6628
6629         if (check_direct_IO(BTRFS_I(inode)->root, rw, iocb, iov,
6630                             offset, nr_segs))
6631                 return 0;
6632
6633         return __blockdev_direct_IO(rw, iocb, inode,
6634                    BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev,
6635                    iov, offset, nr_segs, btrfs_get_blocks_direct, NULL,
6636                    btrfs_submit_direct, 0);
6637 }
6638
6639 #define BTRFS_FIEMAP_FLAGS      (FIEMAP_FLAG_SYNC)
6640
6641 static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
6642                 __u64 start, __u64 len)
6643 {
6644         int     ret;
6645
6646         ret = fiemap_check_flags(fieinfo, BTRFS_FIEMAP_FLAGS);
6647         if (ret)
6648                 return ret;
6649
6650         return extent_fiemap(inode, fieinfo, start, len, btrfs_get_extent_fiemap);
6651 }
6652
6653 int btrfs_readpage(struct file *file, struct page *page)
6654 {
6655         struct extent_io_tree *tree;
6656         tree = &BTRFS_I(page->mapping->host)->io_tree;
6657         return extent_read_full_page(tree, page, btrfs_get_extent, 0);
6658 }
6659
6660 static int btrfs_writepage(struct page *page, struct writeback_control *wbc)
6661 {
6662         struct extent_io_tree *tree;
6663
6664
6665         if (current->flags & PF_MEMALLOC) {
6666                 redirty_page_for_writepage(wbc, page);
6667                 unlock_page(page);
6668                 return 0;
6669         }
6670         tree = &BTRFS_I(page->mapping->host)->io_tree;
6671         return extent_write_full_page(tree, page, btrfs_get_extent, wbc);
6672 }
6673
6674 int btrfs_writepages(struct address_space *mapping,
6675                      struct writeback_control *wbc)
6676 {
6677         struct extent_io_tree *tree;
6678
6679         tree = &BTRFS_I(mapping->host)->io_tree;
6680         return extent_writepages(tree, mapping, btrfs_get_extent, wbc);
6681 }
6682
6683 static int
6684 btrfs_readpages(struct file *file, struct address_space *mapping,
6685                 struct list_head *pages, unsigned nr_pages)
6686 {
6687         struct extent_io_tree *tree;
6688         tree = &BTRFS_I(mapping->host)->io_tree;
6689         return extent_readpages(tree, mapping, pages, nr_pages,
6690                                 btrfs_get_extent);
6691 }
6692 static int __btrfs_releasepage(struct page *page, gfp_t gfp_flags)
6693 {
6694         struct extent_io_tree *tree;
6695         struct extent_map_tree *map;
6696         int ret;
6697
6698         tree = &BTRFS_I(page->mapping->host)->io_tree;
6699         map = &BTRFS_I(page->mapping->host)->extent_tree;
6700         ret = try_release_extent_mapping(map, tree, page, gfp_flags);
6701         if (ret == 1) {
6702                 ClearPagePrivate(page);
6703                 set_page_private(page, 0);
6704                 page_cache_release(page);
6705         }
6706         return ret;
6707 }
6708
6709 static int btrfs_releasepage(struct page *page, gfp_t gfp_flags)
6710 {
6711         if (PageWriteback(page) || PageDirty(page))
6712                 return 0;
6713         return __btrfs_releasepage(page, gfp_flags & GFP_NOFS);
6714 }
6715
6716 static void btrfs_invalidatepage(struct page *page, unsigned long offset)
6717 {
6718         struct inode *inode = page->mapping->host;
6719         struct extent_io_tree *tree;
6720         struct btrfs_ordered_extent *ordered;
6721         struct extent_state *cached_state = NULL;
6722         u64 page_start = page_offset(page);
6723         u64 page_end = page_start + PAGE_CACHE_SIZE - 1;
6724
6725         /*
6726          * we have the page locked, so new writeback can't start,
6727          * and the dirty bit won't be cleared while we are here.
6728          *
6729          * Wait for IO on this page so that we can safely clear
6730          * the PagePrivate2 bit and do ordered accounting
6731          */
6732         wait_on_page_writeback(page);
6733
6734         tree = &BTRFS_I(inode)->io_tree;
6735         if (offset) {
6736                 btrfs_releasepage(page, GFP_NOFS);
6737                 return;
6738         }
6739         lock_extent_bits(tree, page_start, page_end, 0, &cached_state);
6740         ordered = btrfs_lookup_ordered_extent(inode,
6741                                            page_offset(page));
6742         if (ordered) {
6743                 /*
6744                  * IO on this page will never be started, so we need
6745                  * to account for any ordered extents now
6746                  */
6747                 clear_extent_bit(tree, page_start, page_end,
6748                                  EXTENT_DIRTY | EXTENT_DELALLOC |
6749                                  EXTENT_LOCKED | EXTENT_DO_ACCOUNTING |
6750                                  EXTENT_DEFRAG, 1, 0, &cached_state, GFP_NOFS);
6751                 /*
6752                  * whoever cleared the private bit is responsible
6753                  * for the finish_ordered_io
6754                  */
6755                 if (TestClearPagePrivate2(page) &&
6756                     btrfs_dec_test_ordered_pending(inode, &ordered, page_start,
6757                                                    PAGE_CACHE_SIZE, 1)) {
6758                         btrfs_finish_ordered_io(ordered);
6759                 }
6760                 btrfs_put_ordered_extent(ordered);
6761                 cached_state = NULL;
6762                 lock_extent_bits(tree, page_start, page_end, 0, &cached_state);
6763         }
6764         clear_extent_bit(tree, page_start, page_end,
6765                  EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC |
6766                  EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG, 1, 1,
6767                  &cached_state, GFP_NOFS);
6768         __btrfs_releasepage(page, GFP_NOFS);
6769
6770         ClearPageChecked(page);
6771         if (PagePrivate(page)) {
6772                 ClearPagePrivate(page);
6773                 set_page_private(page, 0);
6774                 page_cache_release(page);
6775         }
6776 }
6777
6778 /*
6779  * btrfs_page_mkwrite() is not allowed to change the file size as it gets
6780  * called from a page fault handler when a page is first dirtied. Hence we must
6781  * be careful to check for EOF conditions here. We set the page up correctly
6782  * for a written page which means we get ENOSPC checking when writing into
6783  * holes and correct delalloc and unwritten extent mapping on filesystems that
6784  * support these features.
6785  *
6786  * We are not allowed to take the i_mutex here so we have to play games to
6787  * protect against truncate races as the page could now be beyond EOF.  Because
6788  * vmtruncate() writes the inode size before removing pages, once we have the
6789  * page lock we can determine safely if the page is beyond EOF. If it is not
6790  * beyond EOF, then the page is guaranteed safe against truncation until we
6791  * unlock the page.
6792  */
6793 int btrfs_page_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf)
6794 {
6795         struct page *page = vmf->page;
6796         struct inode *inode = fdentry(vma->vm_file)->d_inode;
6797         struct btrfs_root *root = BTRFS_I(inode)->root;
6798         struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
6799         struct btrfs_ordered_extent *ordered;
6800         struct extent_state *cached_state = NULL;
6801         char *kaddr;
6802         unsigned long zero_start;
6803         loff_t size;
6804         int ret;
6805         int reserved = 0;
6806         u64 page_start;
6807         u64 page_end;
6808
6809         sb_start_pagefault(inode->i_sb);
6810         ret  = btrfs_delalloc_reserve_space(inode, PAGE_CACHE_SIZE);
6811         if (!ret) {
6812                 ret = file_update_time(vma->vm_file);
6813                 reserved = 1;
6814         }
6815         if (ret) {
6816                 if (ret == -ENOMEM)
6817                         ret = VM_FAULT_OOM;
6818                 else /* -ENOSPC, -EIO, etc */
6819                         ret = VM_FAULT_SIGBUS;
6820                 if (reserved)
6821                         goto out;
6822                 goto out_noreserve;
6823         }
6824
6825         ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */
6826 again:
6827         lock_page(page);
6828         size = i_size_read(inode);
6829         page_start = page_offset(page);
6830         page_end = page_start + PAGE_CACHE_SIZE - 1;
6831
6832         if ((page->mapping != inode->i_mapping) ||
6833             (page_start >= size)) {
6834                 /* page got truncated out from underneath us */
6835                 goto out_unlock;
6836         }
6837         wait_on_page_writeback(page);
6838
6839         lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state);
6840         set_page_extent_mapped(page);
6841
6842         /*
6843          * we can't set the delalloc bits if there are pending ordered
6844          * extents.  Drop our locks and wait for them to finish
6845          */
6846         ordered = btrfs_lookup_ordered_extent(inode, page_start);
6847         if (ordered) {
6848                 unlock_extent_cached(io_tree, page_start, page_end,
6849                                      &cached_state, GFP_NOFS);
6850                 unlock_page(page);
6851                 btrfs_start_ordered_extent(inode, ordered, 1);
6852                 btrfs_put_ordered_extent(ordered);
6853                 goto again;
6854         }
6855
6856         /*
6857          * XXX - page_mkwrite gets called every time the page is dirtied, even
6858          * if it was already dirty, so for space accounting reasons we need to
6859          * clear any delalloc bits for the range we are fixing to save.  There
6860          * is probably a better way to do this, but for now keep consistent with
6861          * prepare_pages in the normal write path.
6862          */
6863         clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end,
6864                           EXTENT_DIRTY | EXTENT_DELALLOC |
6865                           EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
6866                           0, 0, &cached_state, GFP_NOFS);
6867
6868         ret = btrfs_set_extent_delalloc(inode, page_start, page_end,
6869                                         &cached_state);
6870         if (ret) {
6871                 unlock_extent_cached(io_tree, page_start, page_end,
6872                                      &cached_state, GFP_NOFS);
6873                 ret = VM_FAULT_SIGBUS;
6874                 goto out_unlock;
6875         }
6876         ret = 0;
6877
6878         /* page is wholly or partially inside EOF */
6879         if (page_start + PAGE_CACHE_SIZE > size)
6880                 zero_start = size & ~PAGE_CACHE_MASK;
6881         else
6882                 zero_start = PAGE_CACHE_SIZE;
6883
6884         if (zero_start != PAGE_CACHE_SIZE) {
6885                 kaddr = kmap(page);
6886                 memset(kaddr + zero_start, 0, PAGE_CACHE_SIZE - zero_start);
6887                 flush_dcache_page(page);
6888                 kunmap(page);
6889         }
6890         ClearPageChecked(page);
6891         set_page_dirty(page);
6892         SetPageUptodate(page);
6893
6894         BTRFS_I(inode)->last_trans = root->fs_info->generation;
6895         BTRFS_I(inode)->last_sub_trans = BTRFS_I(inode)->root->log_transid;
6896         BTRFS_I(inode)->last_log_commit = BTRFS_I(inode)->root->last_log_commit;
6897
6898         unlock_extent_cached(io_tree, page_start, page_end, &cached_state, GFP_NOFS);
6899
6900 out_unlock:
6901         if (!ret) {
6902                 sb_end_pagefault(inode->i_sb);
6903                 return VM_FAULT_LOCKED;
6904         }
6905         unlock_page(page);
6906 out:
6907         btrfs_delalloc_release_space(inode, PAGE_CACHE_SIZE);
6908 out_noreserve:
6909         sb_end_pagefault(inode->i_sb);
6910         return ret;
6911 }
6912
6913 static int btrfs_truncate(struct inode *inode)
6914 {
6915         struct btrfs_root *root = BTRFS_I(inode)->root;
6916         struct btrfs_block_rsv *rsv;
6917         int ret;
6918         int err = 0;
6919         struct btrfs_trans_handle *trans;
6920         u64 mask = root->sectorsize - 1;
6921         u64 min_size = btrfs_calc_trunc_metadata_size(root, 1);
6922
6923         ret = btrfs_truncate_page(inode, inode->i_size, 0, 0);
6924         if (ret)
6925                 return ret;
6926
6927         btrfs_wait_ordered_range(inode, inode->i_size & (~mask), (u64)-1);
6928         btrfs_ordered_update_i_size(inode, inode->i_size, NULL);
6929
6930         /*
6931          * Yes ladies and gentelment, this is indeed ugly.  The fact is we have
6932          * 3 things going on here
6933          *
6934          * 1) We need to reserve space for our orphan item and the space to
6935          * delete our orphan item.  Lord knows we don't want to have a dangling
6936          * orphan item because we didn't reserve space to remove it.
6937          *
6938          * 2) We need to reserve space to update our inode.
6939          *
6940          * 3) We need to have something to cache all the space that is going to
6941          * be free'd up by the truncate operation, but also have some slack
6942          * space reserved in case it uses space during the truncate (thank you
6943          * very much snapshotting).
6944          *
6945          * And we need these to all be seperate.  The fact is we can use alot of
6946          * space doing the truncate, and we have no earthly idea how much space
6947          * we will use, so we need the truncate reservation to be seperate so it
6948          * doesn't end up using space reserved for updating the inode or
6949          * removing the orphan item.  We also need to be able to stop the
6950          * transaction and start a new one, which means we need to be able to
6951          * update the inode several times, and we have no idea of knowing how
6952          * many times that will be, so we can't just reserve 1 item for the
6953          * entirety of the opration, so that has to be done seperately as well.
6954          * Then there is the orphan item, which does indeed need to be held on
6955          * to for the whole operation, and we need nobody to touch this reserved
6956          * space except the orphan code.
6957          *
6958          * So that leaves us with
6959          *
6960          * 1) root->orphan_block_rsv - for the orphan deletion.
6961          * 2) rsv - for the truncate reservation, which we will steal from the
6962          * transaction reservation.
6963          * 3) fs_info->trans_block_rsv - this will have 1 items worth left for
6964          * updating the inode.
6965          */
6966         rsv = btrfs_alloc_block_rsv(root, BTRFS_BLOCK_RSV_TEMP);
6967         if (!rsv)
6968                 return -ENOMEM;
6969         rsv->size = min_size;
6970         rsv->failfast = 1;
6971
6972         /*
6973          * 1 for the truncate slack space
6974          * 1 for updating the inode.
6975          */
6976         trans = btrfs_start_transaction(root, 2);
6977         if (IS_ERR(trans)) {
6978                 err = PTR_ERR(trans);
6979                 goto out;
6980         }
6981
6982         /* Migrate the slack space for the truncate to our reserve */
6983         ret = btrfs_block_rsv_migrate(&root->fs_info->trans_block_rsv, rsv,
6984                                       min_size);
6985         BUG_ON(ret);
6986
6987         /*
6988          * setattr is responsible for setting the ordered_data_close flag,
6989          * but that is only tested during the last file release.  That
6990          * could happen well after the next commit, leaving a great big
6991          * window where new writes may get lost if someone chooses to write
6992          * to this file after truncating to zero
6993          *
6994          * The inode doesn't have any dirty data here, and so if we commit
6995          * this is a noop.  If someone immediately starts writing to the inode
6996          * it is very likely we'll catch some of their writes in this
6997          * transaction, and the commit will find this file on the ordered
6998          * data list with good things to send down.
6999          *
7000          * This is a best effort solution, there is still a window where
7001          * using truncate to replace the contents of the file will
7002          * end up with a zero length file after a crash.
7003          */
7004         if (inode->i_size == 0 && test_bit(BTRFS_INODE_ORDERED_DATA_CLOSE,
7005                                            &BTRFS_I(inode)->runtime_flags))
7006                 btrfs_add_ordered_operation(trans, root, inode);
7007
7008         /*
7009          * So if we truncate and then write and fsync we normally would just
7010          * write the extents that changed, which is a problem if we need to
7011          * first truncate that entire inode.  So set this flag so we write out
7012          * all of the extents in the inode to the sync log so we're completely
7013          * safe.
7014          */
7015         set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags);
7016         trans->block_rsv = rsv;
7017
7018         while (1) {
7019                 ret = btrfs_truncate_inode_items(trans, root, inode,
7020                                                  inode->i_size,
7021                                                  BTRFS_EXTENT_DATA_KEY);
7022                 if (ret != -ENOSPC) {
7023                         err = ret;
7024                         break;
7025                 }
7026
7027                 trans->block_rsv = &root->fs_info->trans_block_rsv;
7028                 ret = btrfs_update_inode(trans, root, inode);
7029                 if (ret) {
7030                         err = ret;
7031                         break;
7032                 }
7033
7034                 btrfs_end_transaction(trans, root);
7035                 btrfs_btree_balance_dirty(root);
7036
7037                 trans = btrfs_start_transaction(root, 2);
7038                 if (IS_ERR(trans)) {
7039                         ret = err = PTR_ERR(trans);
7040                         trans = NULL;
7041                         break;
7042                 }
7043
7044                 ret = btrfs_block_rsv_migrate(&root->fs_info->trans_block_rsv,
7045                                               rsv, min_size);
7046                 BUG_ON(ret);    /* shouldn't happen */
7047                 trans->block_rsv = rsv;
7048         }
7049
7050         if (ret == 0 && inode->i_nlink > 0) {
7051                 trans->block_rsv = root->orphan_block_rsv;
7052                 ret = btrfs_orphan_del(trans, inode);
7053                 if (ret)
7054                         err = ret;
7055         }
7056
7057         if (trans) {
7058                 trans->block_rsv = &root->fs_info->trans_block_rsv;
7059                 ret = btrfs_update_inode(trans, root, inode);
7060                 if (ret && !err)
7061                         err = ret;
7062
7063                 ret = btrfs_end_transaction(trans, root);
7064                 btrfs_btree_balance_dirty(root);
7065         }
7066
7067 out:
7068         btrfs_free_block_rsv(root, rsv);
7069
7070         if (ret && !err)
7071                 err = ret;
7072
7073         return err;
7074 }
7075
7076 /*
7077  * create a new subvolume directory/inode (helper for the ioctl).
7078  */
7079 int btrfs_create_subvol_root(struct btrfs_trans_handle *trans,
7080                              struct btrfs_root *new_root, u64 new_dirid)
7081 {
7082         struct inode *inode;
7083         int err;
7084         u64 index = 0;
7085
7086         inode = btrfs_new_inode(trans, new_root, NULL, "..", 2,
7087                                 new_dirid, new_dirid,
7088                                 S_IFDIR | (~current_umask() & S_IRWXUGO),
7089                                 &index);
7090         if (IS_ERR(inode))
7091                 return PTR_ERR(inode);
7092         inode->i_op = &btrfs_dir_inode_operations;
7093         inode->i_fop = &btrfs_dir_file_operations;
7094
7095         set_nlink(inode, 1);
7096         btrfs_i_size_write(inode, 0);
7097
7098         err = btrfs_update_inode(trans, new_root, inode);
7099
7100         iput(inode);
7101         return err;
7102 }
7103
7104 struct inode *btrfs_alloc_inode(struct super_block *sb)
7105 {
7106         struct btrfs_inode *ei;
7107         struct inode *inode;
7108
7109         ei = kmem_cache_alloc(btrfs_inode_cachep, GFP_NOFS);
7110         if (!ei)
7111                 return NULL;
7112
7113         ei->root = NULL;
7114         ei->generation = 0;
7115         ei->last_trans = 0;
7116         ei->last_sub_trans = 0;
7117         ei->logged_trans = 0;
7118         ei->delalloc_bytes = 0;
7119         ei->disk_i_size = 0;
7120         ei->flags = 0;
7121         ei->csum_bytes = 0;
7122         ei->index_cnt = (u64)-1;
7123         ei->last_unlink_trans = 0;
7124         ei->last_log_commit = 0;
7125
7126         spin_lock_init(&ei->lock);
7127         ei->outstanding_extents = 0;
7128         ei->reserved_extents = 0;
7129
7130         ei->runtime_flags = 0;
7131         ei->force_compress = BTRFS_COMPRESS_NONE;
7132
7133         ei->delayed_node = NULL;
7134
7135         inode = &ei->vfs_inode;
7136         extent_map_tree_init(&ei->extent_tree);
7137         extent_io_tree_init(&ei->io_tree, &inode->i_data);
7138         extent_io_tree_init(&ei->io_failure_tree, &inode->i_data);
7139         ei->io_tree.track_uptodate = 1;
7140         ei->io_failure_tree.track_uptodate = 1;
7141         atomic_set(&ei->sync_writers, 0);
7142         mutex_init(&ei->log_mutex);
7143         mutex_init(&ei->delalloc_mutex);
7144         btrfs_ordered_inode_tree_init(&ei->ordered_tree);
7145         INIT_LIST_HEAD(&ei->delalloc_inodes);
7146         INIT_LIST_HEAD(&ei->ordered_operations);
7147         RB_CLEAR_NODE(&ei->rb_node);
7148
7149         return inode;
7150 }
7151
7152 static void btrfs_i_callback(struct rcu_head *head)
7153 {
7154         struct inode *inode = container_of(head, struct inode, i_rcu);
7155         kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
7156 }
7157
7158 void btrfs_destroy_inode(struct inode *inode)
7159 {
7160         struct btrfs_ordered_extent *ordered;
7161         struct btrfs_root *root = BTRFS_I(inode)->root;
7162
7163         WARN_ON(!hlist_empty(&inode->i_dentry));
7164         WARN_ON(inode->i_data.nrpages);
7165         WARN_ON(BTRFS_I(inode)->outstanding_extents);
7166         WARN_ON(BTRFS_I(inode)->reserved_extents);
7167         WARN_ON(BTRFS_I(inode)->delalloc_bytes);
7168         WARN_ON(BTRFS_I(inode)->csum_bytes);
7169
7170         /*
7171          * This can happen where we create an inode, but somebody else also
7172          * created the same inode and we need to destroy the one we already
7173          * created.
7174          */
7175         if (!root)
7176                 goto free;
7177
7178         /*
7179          * Make sure we're properly removed from the ordered operation
7180          * lists.
7181          */
7182         smp_mb();
7183         if (!list_empty(&BTRFS_I(inode)->ordered_operations)) {
7184                 spin_lock(&root->fs_info->ordered_extent_lock);
7185                 list_del_init(&BTRFS_I(inode)->ordered_operations);
7186                 spin_unlock(&root->fs_info->ordered_extent_lock);
7187         }
7188
7189         if (test_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
7190                      &BTRFS_I(inode)->runtime_flags)) {
7191                 printk(KERN_INFO "BTRFS: inode %llu still on the orphan list\n",
7192                        (unsigned long long)btrfs_ino(inode));
7193                 atomic_dec(&root->orphan_inodes);
7194         }
7195
7196         while (1) {
7197                 ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1);
7198                 if (!ordered)
7199                         break;
7200                 else {
7201                         printk(KERN_ERR "btrfs found ordered "
7202                                "extent %llu %llu on inode cleanup\n",
7203                                (unsigned long long)ordered->file_offset,
7204                                (unsigned long long)ordered->len);
7205                         btrfs_remove_ordered_extent(inode, ordered);
7206                         btrfs_put_ordered_extent(ordered);
7207                         btrfs_put_ordered_extent(ordered);
7208                 }
7209         }
7210         inode_tree_del(inode);
7211         btrfs_drop_extent_cache(inode, 0, (u64)-1, 0);
7212 free:
7213         btrfs_remove_delayed_node(inode);
7214         call_rcu(&inode->i_rcu, btrfs_i_callback);
7215 }
7216
7217 int btrfs_drop_inode(struct inode *inode)
7218 {
7219         struct btrfs_root *root = BTRFS_I(inode)->root;
7220
7221         if (btrfs_root_refs(&root->root_item) == 0 &&
7222             !btrfs_is_free_space_inode(inode))
7223                 return 1;
7224         else
7225                 return generic_drop_inode(inode);
7226 }
7227
7228 static void init_once(void *foo)
7229 {
7230         struct btrfs_inode *ei = (struct btrfs_inode *) foo;
7231
7232         inode_init_once(&ei->vfs_inode);
7233 }
7234
7235 void btrfs_destroy_cachep(void)
7236 {
7237         /*
7238          * Make sure all delayed rcu free inodes are flushed before we
7239          * destroy cache.
7240          */
7241         rcu_barrier();
7242         if (btrfs_inode_cachep)
7243                 kmem_cache_destroy(btrfs_inode_cachep);
7244         if (btrfs_trans_handle_cachep)
7245                 kmem_cache_destroy(btrfs_trans_handle_cachep);
7246         if (btrfs_transaction_cachep)
7247                 kmem_cache_destroy(btrfs_transaction_cachep);
7248         if (btrfs_path_cachep)
7249                 kmem_cache_destroy(btrfs_path_cachep);
7250         if (btrfs_free_space_cachep)
7251                 kmem_cache_destroy(btrfs_free_space_cachep);
7252         if (btrfs_delalloc_work_cachep)
7253                 kmem_cache_destroy(btrfs_delalloc_work_cachep);
7254 }
7255
7256 int btrfs_init_cachep(void)
7257 {
7258         btrfs_inode_cachep = kmem_cache_create("btrfs_inode",
7259                         sizeof(struct btrfs_inode), 0,
7260                         SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, init_once);
7261         if (!btrfs_inode_cachep)
7262                 goto fail;
7263
7264         btrfs_trans_handle_cachep = kmem_cache_create("btrfs_trans_handle",
7265                         sizeof(struct btrfs_trans_handle), 0,
7266                         SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
7267         if (!btrfs_trans_handle_cachep)
7268                 goto fail;
7269
7270         btrfs_transaction_cachep = kmem_cache_create("btrfs_transaction",
7271                         sizeof(struct btrfs_transaction), 0,
7272                         SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
7273         if (!btrfs_transaction_cachep)
7274                 goto fail;
7275
7276         btrfs_path_cachep = kmem_cache_create("btrfs_path",
7277                         sizeof(struct btrfs_path), 0,
7278                         SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
7279         if (!btrfs_path_cachep)
7280                 goto fail;
7281
7282         btrfs_free_space_cachep = kmem_cache_create("btrfs_free_space",
7283                         sizeof(struct btrfs_free_space), 0,
7284                         SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
7285         if (!btrfs_free_space_cachep)
7286                 goto fail;
7287
7288         btrfs_delalloc_work_cachep = kmem_cache_create("btrfs_delalloc_work",
7289                         sizeof(struct btrfs_delalloc_work), 0,
7290                         SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD,
7291                         NULL);
7292         if (!btrfs_delalloc_work_cachep)
7293                 goto fail;
7294
7295         return 0;
7296 fail:
7297         btrfs_destroy_cachep();
7298         return -ENOMEM;
7299 }
7300
7301 static int btrfs_getattr(struct vfsmount *mnt,
7302                          struct dentry *dentry, struct kstat *stat)
7303 {
7304         struct inode *inode = dentry->d_inode;
7305         u32 blocksize = inode->i_sb->s_blocksize;
7306
7307         generic_fillattr(inode, stat);
7308         stat->dev = BTRFS_I(inode)->root->anon_dev;
7309         stat->blksize = PAGE_CACHE_SIZE;
7310         stat->blocks = (ALIGN(inode_get_bytes(inode), blocksize) +
7311                 ALIGN(BTRFS_I(inode)->delalloc_bytes, blocksize)) >> 9;
7312         return 0;
7313 }
7314
7315 /*
7316  * If a file is moved, it will inherit the cow and compression flags of the new
7317  * directory.
7318  */
7319 static void fixup_inode_flags(struct inode *dir, struct inode *inode)
7320 {
7321         struct btrfs_inode *b_dir = BTRFS_I(dir);
7322         struct btrfs_inode *b_inode = BTRFS_I(inode);
7323
7324         if (b_dir->flags & BTRFS_INODE_NODATACOW)
7325                 b_inode->flags |= BTRFS_INODE_NODATACOW;
7326         else
7327                 b_inode->flags &= ~BTRFS_INODE_NODATACOW;
7328
7329         if (b_dir->flags & BTRFS_INODE_COMPRESS) {
7330                 b_inode->flags |= BTRFS_INODE_COMPRESS;
7331                 b_inode->flags &= ~BTRFS_INODE_NOCOMPRESS;
7332         } else {
7333                 b_inode->flags &= ~(BTRFS_INODE_COMPRESS |
7334                                     BTRFS_INODE_NOCOMPRESS);
7335         }
7336 }
7337
7338 static int btrfs_rename(struct inode *old_dir, struct dentry *old_dentry,
7339                            struct inode *new_dir, struct dentry *new_dentry)
7340 {
7341         struct btrfs_trans_handle *trans;
7342         struct btrfs_root *root = BTRFS_I(old_dir)->root;
7343         struct btrfs_root *dest = BTRFS_I(new_dir)->root;
7344         struct inode *new_inode = new_dentry->d_inode;
7345         struct inode *old_inode = old_dentry->d_inode;
7346         struct timespec ctime = CURRENT_TIME;
7347         u64 index = 0;
7348         u64 root_objectid;
7349         int ret;
7350         u64 old_ino = btrfs_ino(old_inode);
7351
7352         if (btrfs_ino(new_dir) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
7353                 return -EPERM;
7354
7355         /* we only allow rename subvolume link between subvolumes */
7356         if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest)
7357                 return -EXDEV;
7358
7359         if (old_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID ||
7360             (new_inode && btrfs_ino(new_inode) == BTRFS_FIRST_FREE_OBJECTID))
7361                 return -ENOTEMPTY;
7362
7363         if (S_ISDIR(old_inode->i_mode) && new_inode &&
7364             new_inode->i_size > BTRFS_EMPTY_DIR_SIZE)
7365                 return -ENOTEMPTY;
7366
7367
7368         /* check for collisions, even if the  name isn't there */
7369         ret = btrfs_check_dir_item_collision(root, new_dir->i_ino,
7370                              new_dentry->d_name.name,
7371                              new_dentry->d_name.len);
7372
7373         if (ret) {
7374                 if (ret == -EEXIST) {
7375                         /* we shouldn't get
7376                          * eexist without a new_inode */
7377                         if (!new_inode) {
7378                                 WARN_ON(1);
7379                                 return ret;
7380                         }
7381                 } else {
7382                         /* maybe -EOVERFLOW */
7383                         return ret;
7384                 }
7385         }
7386         ret = 0;
7387
7388         /*
7389          * we're using rename to replace one file with another.
7390          * and the replacement file is large.  Start IO on it now so
7391          * we don't add too much work to the end of the transaction
7392          */
7393         if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size &&
7394             old_inode->i_size > BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT)
7395                 filemap_flush(old_inode->i_mapping);
7396
7397         /* close the racy window with snapshot create/destroy ioctl */
7398         if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
7399                 down_read(&root->fs_info->subvol_sem);
7400         /*
7401          * We want to reserve the absolute worst case amount of items.  So if
7402          * both inodes are subvols and we need to unlink them then that would
7403          * require 4 item modifications, but if they are both normal inodes it
7404          * would require 5 item modifications, so we'll assume their normal
7405          * inodes.  So 5 * 2 is 10, plus 1 for the new link, so 11 total items
7406          * should cover the worst case number of items we'll modify.
7407          */
7408         trans = btrfs_start_transaction(root, 20);
7409         if (IS_ERR(trans)) {
7410                 ret = PTR_ERR(trans);
7411                 goto out_notrans;
7412         }
7413
7414         if (dest != root)
7415                 btrfs_record_root_in_trans(trans, dest);
7416
7417         ret = btrfs_set_inode_index(new_dir, &index);
7418         if (ret)
7419                 goto out_fail;
7420
7421         if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
7422                 /* force full log commit if subvolume involved. */
7423                 root->fs_info->last_trans_log_full_commit = trans->transid;
7424         } else {
7425                 ret = btrfs_insert_inode_ref(trans, dest,
7426                                              new_dentry->d_name.name,
7427                                              new_dentry->d_name.len,
7428                                              old_ino,
7429                                              btrfs_ino(new_dir), index);
7430                 if (ret)
7431                         goto out_fail;
7432                 /*
7433                  * this is an ugly little race, but the rename is required
7434                  * to make sure that if we crash, the inode is either at the
7435                  * old name or the new one.  pinning the log transaction lets
7436                  * us make sure we don't allow a log commit to come in after
7437                  * we unlink the name but before we add the new name back in.
7438                  */
7439                 btrfs_pin_log_trans(root);
7440         }
7441         /*
7442          * make sure the inode gets flushed if it is replacing
7443          * something.
7444          */
7445         if (new_inode && new_inode->i_size && S_ISREG(old_inode->i_mode))
7446                 btrfs_add_ordered_operation(trans, root, old_inode);
7447
7448         inode_inc_iversion(old_dir);
7449         inode_inc_iversion(new_dir);
7450         inode_inc_iversion(old_inode);
7451         old_dir->i_ctime = old_dir->i_mtime = ctime;
7452         new_dir->i_ctime = new_dir->i_mtime = ctime;
7453         old_inode->i_ctime = ctime;
7454
7455         if (old_dentry->d_parent != new_dentry->d_parent)
7456                 btrfs_record_unlink_dir(trans, old_dir, old_inode, 1);
7457
7458         if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
7459                 root_objectid = BTRFS_I(old_inode)->root->root_key.objectid;
7460                 ret = btrfs_unlink_subvol(trans, root, old_dir, root_objectid,
7461                                         old_dentry->d_name.name,
7462                                         old_dentry->d_name.len);
7463         } else {
7464                 ret = __btrfs_unlink_inode(trans, root, old_dir,
7465                                         old_dentry->d_inode,
7466                                         old_dentry->d_name.name,
7467                                         old_dentry->d_name.len);
7468                 if (!ret)
7469                         ret = btrfs_update_inode(trans, root, old_inode);
7470         }
7471         if (ret) {
7472                 btrfs_abort_transaction(trans, root, ret);
7473                 goto out_fail;
7474         }
7475
7476         if (new_inode) {
7477                 inode_inc_iversion(new_inode);
7478                 new_inode->i_ctime = CURRENT_TIME;
7479                 if (unlikely(btrfs_ino(new_inode) ==
7480                              BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
7481                         root_objectid = BTRFS_I(new_inode)->location.objectid;
7482                         ret = btrfs_unlink_subvol(trans, dest, new_dir,
7483                                                 root_objectid,
7484                                                 new_dentry->d_name.name,
7485                                                 new_dentry->d_name.len);
7486                         BUG_ON(new_inode->i_nlink == 0);
7487                 } else {
7488                         ret = btrfs_unlink_inode(trans, dest, new_dir,
7489                                                  new_dentry->d_inode,
7490                                                  new_dentry->d_name.name,
7491                                                  new_dentry->d_name.len);
7492                 }
7493                 if (!ret && new_inode->i_nlink == 0) {
7494                         ret = btrfs_orphan_add(trans, new_dentry->d_inode);
7495                         BUG_ON(ret);
7496                 }
7497                 if (ret) {
7498                         btrfs_abort_transaction(trans, root, ret);
7499                         goto out_fail;
7500                 }
7501         }
7502
7503         fixup_inode_flags(new_dir, old_inode);
7504
7505         ret = btrfs_add_link(trans, new_dir, old_inode,
7506                              new_dentry->d_name.name,
7507                              new_dentry->d_name.len, 0, index);
7508         if (ret) {
7509                 btrfs_abort_transaction(trans, root, ret);
7510                 goto out_fail;
7511         }
7512
7513         if (old_ino != BTRFS_FIRST_FREE_OBJECTID) {
7514                 struct dentry *parent = new_dentry->d_parent;
7515                 btrfs_log_new_name(trans, old_inode, old_dir, parent);
7516                 btrfs_end_log_trans(root);
7517         }
7518 out_fail:
7519         btrfs_end_transaction(trans, root);
7520 out_notrans:
7521         if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
7522                 up_read(&root->fs_info->subvol_sem);
7523
7524         return ret;
7525 }
7526
7527 static void btrfs_run_delalloc_work(struct btrfs_work *work)
7528 {
7529         struct btrfs_delalloc_work *delalloc_work;
7530
7531         delalloc_work = container_of(work, struct btrfs_delalloc_work,
7532                                      work);
7533         if (delalloc_work->wait)
7534                 btrfs_wait_ordered_range(delalloc_work->inode, 0, (u64)-1);
7535         else
7536                 filemap_flush(delalloc_work->inode->i_mapping);
7537
7538         if (delalloc_work->delay_iput)
7539                 btrfs_add_delayed_iput(delalloc_work->inode);
7540         else
7541                 iput(delalloc_work->inode);
7542         complete(&delalloc_work->completion);
7543 }
7544
7545 struct btrfs_delalloc_work *btrfs_alloc_delalloc_work(struct inode *inode,
7546                                                     int wait, int delay_iput)
7547 {
7548         struct btrfs_delalloc_work *work;
7549
7550         work = kmem_cache_zalloc(btrfs_delalloc_work_cachep, GFP_NOFS);
7551         if (!work)
7552                 return NULL;
7553
7554         init_completion(&work->completion);
7555         INIT_LIST_HEAD(&work->list);
7556         work->inode = inode;
7557         work->wait = wait;
7558         work->delay_iput = delay_iput;
7559         work->work.func = btrfs_run_delalloc_work;
7560
7561         return work;
7562 }
7563
7564 void btrfs_wait_and_free_delalloc_work(struct btrfs_delalloc_work *work)
7565 {
7566         wait_for_completion(&work->completion);
7567         kmem_cache_free(btrfs_delalloc_work_cachep, work);
7568 }
7569
7570 /*
7571  * some fairly slow code that needs optimization. This walks the list
7572  * of all the inodes with pending delalloc and forces them to disk.
7573  */
7574 int btrfs_start_delalloc_inodes(struct btrfs_root *root, int delay_iput)
7575 {
7576         struct list_head *head = &root->fs_info->delalloc_inodes;
7577         struct btrfs_inode *binode;
7578         struct inode *inode;
7579         struct btrfs_delalloc_work *work, *next;
7580         struct list_head works;
7581         int ret = 0;
7582
7583         if (root->fs_info->sb->s_flags & MS_RDONLY)
7584                 return -EROFS;
7585
7586         INIT_LIST_HEAD(&works);
7587
7588         spin_lock(&root->fs_info->delalloc_lock);
7589         while (!list_empty(head)) {
7590                 binode = list_entry(head->next, struct btrfs_inode,
7591                                     delalloc_inodes);
7592                 inode = igrab(&binode->vfs_inode);
7593                 if (!inode)
7594                         list_del_init(&binode->delalloc_inodes);
7595                 spin_unlock(&root->fs_info->delalloc_lock);
7596                 if (inode) {
7597                         work = btrfs_alloc_delalloc_work(inode, 0, delay_iput);
7598                         if (!work) {
7599                                 ret = -ENOMEM;
7600                                 goto out;
7601                         }
7602                         list_add_tail(&work->list, &works);
7603                         btrfs_queue_worker(&root->fs_info->flush_workers,
7604                                            &work->work);
7605                 }
7606                 cond_resched();
7607                 spin_lock(&root->fs_info->delalloc_lock);
7608         }
7609         spin_unlock(&root->fs_info->delalloc_lock);
7610
7611         /* the filemap_flush will queue IO into the worker threads, but
7612          * we have to make sure the IO is actually started and that
7613          * ordered extents get created before we return
7614          */
7615         atomic_inc(&root->fs_info->async_submit_draining);
7616         while (atomic_read(&root->fs_info->nr_async_submits) ||
7617               atomic_read(&root->fs_info->async_delalloc_pages)) {
7618                 wait_event(root->fs_info->async_submit_wait,
7619                    (atomic_read(&root->fs_info->nr_async_submits) == 0 &&
7620                     atomic_read(&root->fs_info->async_delalloc_pages) == 0));
7621         }
7622         atomic_dec(&root->fs_info->async_submit_draining);
7623 out:
7624         list_for_each_entry_safe(work, next, &works, list) {
7625                 list_del_init(&work->list);
7626                 btrfs_wait_and_free_delalloc_work(work);
7627         }
7628         return ret;
7629 }
7630
7631 static int btrfs_symlink(struct inode *dir, struct dentry *dentry,
7632                          const char *symname)
7633 {
7634         struct btrfs_trans_handle *trans;
7635         struct btrfs_root *root = BTRFS_I(dir)->root;
7636         struct btrfs_path *path;
7637         struct btrfs_key key;
7638         struct inode *inode = NULL;
7639         int err;
7640         int drop_inode = 0;
7641         u64 objectid;
7642         u64 index = 0 ;
7643         int name_len;
7644         int datasize;
7645         unsigned long ptr;
7646         struct btrfs_file_extent_item *ei;
7647         struct extent_buffer *leaf;
7648
7649         name_len = strlen(symname) + 1;
7650         if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(root))
7651                 return -ENAMETOOLONG;
7652
7653         /*
7654          * 2 items for inode item and ref
7655          * 2 items for dir items
7656          * 1 item for xattr if selinux is on
7657          */
7658         trans = btrfs_start_transaction(root, 5);
7659         if (IS_ERR(trans))
7660                 return PTR_ERR(trans);
7661
7662         err = btrfs_find_free_ino(root, &objectid);
7663         if (err)
7664                 goto out_unlock;
7665
7666         inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
7667                                 dentry->d_name.len, btrfs_ino(dir), objectid,
7668                                 S_IFLNK|S_IRWXUGO, &index);
7669         if (IS_ERR(inode)) {
7670                 err = PTR_ERR(inode);
7671                 goto out_unlock;
7672         }
7673
7674         err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
7675         if (err) {
7676                 drop_inode = 1;
7677                 goto out_unlock;
7678         }
7679
7680         /*
7681         * If the active LSM wants to access the inode during
7682         * d_instantiate it needs these. Smack checks to see
7683         * if the filesystem supports xattrs by looking at the
7684         * ops vector.
7685         */
7686         inode->i_fop = &btrfs_file_operations;
7687         inode->i_op = &btrfs_file_inode_operations;
7688
7689         err = btrfs_add_nondir(trans, dir, dentry, inode, 0, index);
7690         if (err)
7691                 drop_inode = 1;
7692         else {
7693                 inode->i_mapping->a_ops = &btrfs_aops;
7694                 inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
7695                 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
7696         }
7697         if (drop_inode)
7698                 goto out_unlock;
7699
7700         path = btrfs_alloc_path();
7701         if (!path) {
7702                 err = -ENOMEM;
7703                 drop_inode = 1;
7704                 goto out_unlock;
7705         }
7706         key.objectid = btrfs_ino(inode);
7707         key.offset = 0;
7708         btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY);
7709         datasize = btrfs_file_extent_calc_inline_size(name_len);
7710         err = btrfs_insert_empty_item(trans, root, path, &key,
7711                                       datasize);
7712         if (err) {
7713                 drop_inode = 1;
7714                 btrfs_free_path(path);
7715                 goto out_unlock;
7716         }
7717         leaf = path->nodes[0];
7718         ei = btrfs_item_ptr(leaf, path->slots[0],
7719                             struct btrfs_file_extent_item);
7720         btrfs_set_file_extent_generation(leaf, ei, trans->transid);
7721         btrfs_set_file_extent_type(leaf, ei,
7722                                    BTRFS_FILE_EXTENT_INLINE);
7723         btrfs_set_file_extent_encryption(leaf, ei, 0);
7724         btrfs_set_file_extent_compression(leaf, ei, 0);
7725         btrfs_set_file_extent_other_encoding(leaf, ei, 0);
7726         btrfs_set_file_extent_ram_bytes(leaf, ei, name_len);
7727
7728         ptr = btrfs_file_extent_inline_start(ei);
7729         write_extent_buffer(leaf, symname, ptr, name_len);
7730         btrfs_mark_buffer_dirty(leaf);
7731         btrfs_free_path(path);
7732
7733         inode->i_op = &btrfs_symlink_inode_operations;
7734         inode->i_mapping->a_ops = &btrfs_symlink_aops;
7735         inode->i_mapping->backing_dev_info = &root->fs_info->bdi;
7736         inode_set_bytes(inode, name_len);
7737         btrfs_i_size_write(inode, name_len - 1);
7738         err = btrfs_update_inode(trans, root, inode);
7739         if (err)
7740                 drop_inode = 1;
7741
7742 out_unlock:
7743         if (!err)
7744                 d_instantiate(dentry, inode);
7745         btrfs_end_transaction(trans, root);
7746         if (drop_inode) {
7747                 inode_dec_link_count(inode);
7748                 iput(inode);
7749         }
7750         btrfs_btree_balance_dirty(root);
7751         return err;
7752 }
7753
7754 static int __btrfs_prealloc_file_range(struct inode *inode, int mode,
7755                                        u64 start, u64 num_bytes, u64 min_size,
7756                                        loff_t actual_len, u64 *alloc_hint,
7757                                        struct btrfs_trans_handle *trans)
7758 {
7759         struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
7760         struct extent_map *em;
7761         struct btrfs_root *root = BTRFS_I(inode)->root;
7762         struct btrfs_key ins;
7763         u64 cur_offset = start;
7764         u64 i_size;
7765         int ret = 0;
7766         bool own_trans = true;
7767
7768         if (trans)
7769                 own_trans = false;
7770         while (num_bytes > 0) {
7771                 if (own_trans) {
7772                         trans = btrfs_start_transaction(root, 3);
7773                         if (IS_ERR(trans)) {
7774                                 ret = PTR_ERR(trans);
7775                                 break;
7776                         }
7777                 }
7778
7779                 ret = btrfs_reserve_extent(trans, root, num_bytes, min_size,
7780                                            0, *alloc_hint, &ins, 1);
7781                 if (ret) {
7782                         if (own_trans)
7783                                 btrfs_end_transaction(trans, root);
7784                         break;
7785                 }
7786
7787                 ret = insert_reserved_file_extent(trans, inode,
7788                                                   cur_offset, ins.objectid,
7789                                                   ins.offset, ins.offset,
7790                                                   ins.offset, 0, 0, 0,
7791                                                   BTRFS_FILE_EXTENT_PREALLOC);
7792                 if (ret) {
7793                         btrfs_abort_transaction(trans, root, ret);
7794                         if (own_trans)
7795                                 btrfs_end_transaction(trans, root);
7796                         break;
7797                 }
7798                 btrfs_drop_extent_cache(inode, cur_offset,
7799                                         cur_offset + ins.offset -1, 0);
7800
7801                 em = alloc_extent_map();
7802                 if (!em) {
7803                         set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
7804                                 &BTRFS_I(inode)->runtime_flags);
7805                         goto next;
7806                 }
7807
7808                 em->start = cur_offset;
7809                 em->orig_start = cur_offset;
7810                 em->len = ins.offset;
7811                 em->block_start = ins.objectid;
7812                 em->block_len = ins.offset;
7813                 em->orig_block_len = ins.offset;
7814                 em->bdev = root->fs_info->fs_devices->latest_bdev;
7815                 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
7816                 em->generation = trans->transid;
7817
7818                 while (1) {
7819                         write_lock(&em_tree->lock);
7820                         ret = add_extent_mapping(em_tree, em);
7821                         if (!ret)
7822                                 list_move(&em->list,
7823                                           &em_tree->modified_extents);
7824                         write_unlock(&em_tree->lock);
7825                         if (ret != -EEXIST)
7826                                 break;
7827                         btrfs_drop_extent_cache(inode, cur_offset,
7828                                                 cur_offset + ins.offset - 1,
7829                                                 0);
7830                 }
7831                 free_extent_map(em);
7832 next:
7833                 num_bytes -= ins.offset;
7834                 cur_offset += ins.offset;
7835                 *alloc_hint = ins.objectid + ins.offset;
7836
7837                 inode_inc_iversion(inode);
7838                 inode->i_ctime = CURRENT_TIME;
7839                 BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC;
7840                 if (!(mode & FALLOC_FL_KEEP_SIZE) &&
7841                     (actual_len > inode->i_size) &&
7842                     (cur_offset > inode->i_size)) {
7843                         if (cur_offset > actual_len)
7844                                 i_size = actual_len;
7845                         else
7846                                 i_size = cur_offset;
7847                         i_size_write(inode, i_size);
7848                         btrfs_ordered_update_i_size(inode, i_size, NULL);
7849                 }
7850
7851                 ret = btrfs_update_inode(trans, root, inode);
7852
7853                 if (ret) {
7854                         btrfs_abort_transaction(trans, root, ret);
7855                         if (own_trans)
7856                                 btrfs_end_transaction(trans, root);
7857                         break;
7858                 }
7859
7860                 if (own_trans)
7861                         btrfs_end_transaction(trans, root);
7862         }
7863         return ret;
7864 }
7865
7866 int btrfs_prealloc_file_range(struct inode *inode, int mode,
7867                               u64 start, u64 num_bytes, u64 min_size,
7868                               loff_t actual_len, u64 *alloc_hint)
7869 {
7870         return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
7871                                            min_size, actual_len, alloc_hint,
7872                                            NULL);
7873 }
7874
7875 int btrfs_prealloc_file_range_trans(struct inode *inode,
7876                                     struct btrfs_trans_handle *trans, int mode,
7877                                     u64 start, u64 num_bytes, u64 min_size,
7878                                     loff_t actual_len, u64 *alloc_hint)
7879 {
7880         return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
7881                                            min_size, actual_len, alloc_hint, trans);
7882 }
7883
7884 static int btrfs_set_page_dirty(struct page *page)
7885 {
7886         return __set_page_dirty_nobuffers(page);
7887 }
7888
7889 static int btrfs_permission(struct inode *inode, int mask)
7890 {
7891         struct btrfs_root *root = BTRFS_I(inode)->root;
7892         umode_t mode = inode->i_mode;
7893
7894         if (mask & MAY_WRITE &&
7895             (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))) {
7896                 if (btrfs_root_readonly(root))
7897                         return -EROFS;
7898                 if (BTRFS_I(inode)->flags & BTRFS_INODE_READONLY)
7899                         return -EACCES;
7900         }
7901         return generic_permission(inode, mask);
7902 }
7903
7904 static const struct inode_operations btrfs_dir_inode_operations = {
7905         .getattr        = btrfs_getattr,
7906         .lookup         = btrfs_lookup,
7907         .create         = btrfs_create,
7908         .unlink         = btrfs_unlink,
7909         .link           = btrfs_link,
7910         .mkdir          = btrfs_mkdir,
7911         .rmdir          = btrfs_rmdir,
7912         .rename         = btrfs_rename,
7913         .symlink        = btrfs_symlink,
7914         .setattr        = btrfs_setattr,
7915         .mknod          = btrfs_mknod,
7916         .setxattr       = btrfs_setxattr,
7917         .getxattr       = btrfs_getxattr,
7918         .listxattr      = btrfs_listxattr,
7919         .removexattr    = btrfs_removexattr,
7920         .permission     = btrfs_permission,
7921         .get_acl        = btrfs_get_acl,
7922 };
7923 static const struct inode_operations btrfs_dir_ro_inode_operations = {
7924         .lookup         = btrfs_lookup,
7925         .permission     = btrfs_permission,
7926         .get_acl        = btrfs_get_acl,
7927 };
7928
7929 static const struct file_operations btrfs_dir_file_operations = {
7930         .llseek         = generic_file_llseek,
7931         .read           = generic_read_dir,
7932         .readdir        = btrfs_real_readdir,
7933         .unlocked_ioctl = btrfs_ioctl,
7934 #ifdef CONFIG_COMPAT
7935         .compat_ioctl   = btrfs_ioctl,
7936 #endif
7937         .release        = btrfs_release_file,
7938         .fsync          = btrfs_sync_file,
7939 };
7940
7941 static struct extent_io_ops btrfs_extent_io_ops = {
7942         .fill_delalloc = run_delalloc_range,
7943         .submit_bio_hook = btrfs_submit_bio_hook,
7944         .merge_bio_hook = btrfs_merge_bio_hook,
7945         .readpage_end_io_hook = btrfs_readpage_end_io_hook,
7946         .writepage_end_io_hook = btrfs_writepage_end_io_hook,
7947         .writepage_start_hook = btrfs_writepage_start_hook,
7948         .set_bit_hook = btrfs_set_bit_hook,
7949         .clear_bit_hook = btrfs_clear_bit_hook,
7950         .merge_extent_hook = btrfs_merge_extent_hook,
7951         .split_extent_hook = btrfs_split_extent_hook,
7952 };
7953
7954 /*
7955  * btrfs doesn't support the bmap operation because swapfiles
7956  * use bmap to make a mapping of extents in the file.  They assume
7957  * these extents won't change over the life of the file and they
7958  * use the bmap result to do IO directly to the drive.
7959  *
7960  * the btrfs bmap call would return logical addresses that aren't
7961  * suitable for IO and they also will change frequently as COW
7962  * operations happen.  So, swapfile + btrfs == corruption.
7963  *
7964  * For now we're avoiding this by dropping bmap.
7965  */
7966 static const struct address_space_operations btrfs_aops = {
7967         .readpage       = btrfs_readpage,
7968         .writepage      = btrfs_writepage,
7969         .writepages     = btrfs_writepages,
7970         .readpages      = btrfs_readpages,
7971         .direct_IO      = btrfs_direct_IO,
7972         .invalidatepage = btrfs_invalidatepage,
7973         .releasepage    = btrfs_releasepage,
7974         .set_page_dirty = btrfs_set_page_dirty,
7975         .error_remove_page = generic_error_remove_page,
7976 };
7977
7978 static const struct address_space_operations btrfs_symlink_aops = {
7979         .readpage       = btrfs_readpage,
7980         .writepage      = btrfs_writepage,
7981         .invalidatepage = btrfs_invalidatepage,
7982         .releasepage    = btrfs_releasepage,
7983 };
7984
7985 static const struct inode_operations btrfs_file_inode_operations = {
7986         .getattr        = btrfs_getattr,
7987         .setattr        = btrfs_setattr,
7988         .setxattr       = btrfs_setxattr,
7989         .getxattr       = btrfs_getxattr,
7990         .listxattr      = btrfs_listxattr,
7991         .removexattr    = btrfs_removexattr,
7992         .permission     = btrfs_permission,
7993         .fiemap         = btrfs_fiemap,
7994         .get_acl        = btrfs_get_acl,
7995         .update_time    = btrfs_update_time,
7996 };
7997 static const struct inode_operations btrfs_special_inode_operations = {
7998         .getattr        = btrfs_getattr,
7999         .setattr        = btrfs_setattr,
8000         .permission     = btrfs_permission,
8001         .setxattr       = btrfs_setxattr,
8002         .getxattr       = btrfs_getxattr,
8003         .listxattr      = btrfs_listxattr,
8004         .removexattr    = btrfs_removexattr,
8005         .get_acl        = btrfs_get_acl,
8006         .update_time    = btrfs_update_time,
8007 };
8008 static const struct inode_operations btrfs_symlink_inode_operations = {
8009         .readlink       = generic_readlink,
8010         .follow_link    = page_follow_link_light,
8011         .put_link       = page_put_link,
8012         .getattr        = btrfs_getattr,
8013         .setattr        = btrfs_setattr,
8014         .permission     = btrfs_permission,
8015         .setxattr       = btrfs_setxattr,
8016         .getxattr       = btrfs_getxattr,
8017         .listxattr      = btrfs_listxattr,
8018         .removexattr    = btrfs_removexattr,
8019         .get_acl        = btrfs_get_acl,
8020         .update_time    = btrfs_update_time,
8021 };
8022
8023 const struct dentry_operations btrfs_dentry_operations = {
8024         .d_delete       = btrfs_dentry_delete,
8025         .d_release      = btrfs_dentry_release,
8026 };