fs/btrfs/file.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/fs.h>
  20 #include <linux/pagemap.h>
  21 #include <linux/highmem.h>
  22 #include <linux/time.h>
  23 #include <linux/init.h>
  24 #include <linux/string.h>
  25 #include <linux/smp_lock.h>
  26 #include <linux/backing-dev.h>
  27 #include <linux/mpage.h>
  28 #include <linux/swap.h>
  29 #include <linux/writeback.h>
  30 #include <linux/statfs.h>
  31 #include <linux/compat.h>
  32 #include <linux/version.h>
  33 #include "ctree.h"
  34 #include "disk-io.h"
  35 #include "transaction.h"
  36 #include "btrfs_inode.h"
  37 #include "ordered-data.h"
  38 #include "ioctl.h"
  39 #include "print-tree.h"
  40
  41
  42 static int btrfs_copy_from_user(loff_t pos, int num_pages, int write_bytes,
  43                                 struct page **prepared_pages,
  44                                 const char __user * buf)
  45 {
  46         long page_fault = 0;
  47         int i;
  48         int offset = pos & (PAGE_CACHE_SIZE - 1);
  49
  50         for (i = 0; i < num_pages && write_bytes > 0; i++, offset = 0) {
  51                 size_t count = min_t(size_t,
  52                                      PAGE_CACHE_SIZE - offset, write_bytes);
  53                 struct page *page = prepared_pages[i];
  54                 fault_in_pages_readable(buf, count);
  55
  56                 /* Copy data from userspace to the current page */
  57                 kmap(page);
  58                 page_fault = __copy_from_user(page_address(page) + offset,
  59                                               buf, count);
  60                 /* Flush processor's dcache for this page */
  61                 flush_dcache_page(page);
  62                 kunmap(page);
  63                 buf += count;
  64                 write_bytes -= count;
  65
  66                 if (page_fault)
  67                         break;
  68         }
  69         return page_fault ? -EFAULT : 0;
  70 }
  71
  72 static void btrfs_drop_pages(struct page **pages, size_t num_pages)
  73 {
  74         size_t i;
  75         for (i = 0; i < num_pages; i++) {
  76                 if (!pages[i])
  77                         break;
  78                 unlock_page(pages[i]);
  79                 mark_page_accessed(pages[i]);
  80                 page_cache_release(pages[i]);
  81         }
  82 }
  83
  84 static int noinline insert_inline_extent(struct btrfs_trans_handle *trans,
  85                                 struct btrfs_root *root, struct inode *inode,
  86                                 u64 offset, size_t size,
  87                                 struct page **pages, size_t page_offset,
  88                                 int num_pages)
  89 {
  90         struct btrfs_key key;
  91         struct btrfs_path *path;
  92         struct extent_buffer *leaf;
  93         char *kaddr;
  94         unsigned long ptr;
  95         struct btrfs_file_extent_item *ei;
  96         struct page *page;
  97         u32 datasize;
  98         int err = 0;
  99         int ret;
 100         int i;
 101         ssize_t cur_size;
 102
 103         path = btrfs_alloc_path();
 104         if (!path)
 105                 return -ENOMEM;
 106
 107         btrfs_set_trans_block_group(trans, inode);
 108
 109         key.objectid = inode->i_ino;
 110         key.offset = offset;
 111         btrfs_set_key_type(&key, BTRFS_EXTENT_DATA_KEY);
 112
 113         ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
 114         if (ret < 0) {
 115                 err = ret;
 116                 goto fail;
 117         }
 118         if (ret == 1) {
 119                 struct btrfs_key found_key;
 120
 121                 if (path->slots[0] == 0)
 122                         goto insert;
 123
 124                 path->slots[0]--;
 125                 leaf = path->nodes[0];
 126                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
 127
 128                 if (found_key.objectid != inode->i_ino)
 129                         goto insert;
 130
 131                 if (found_key.type != BTRFS_EXTENT_DATA_KEY)
 132                         goto insert;
 133                 ei = btrfs_item_ptr(leaf, path->slots[0],
 134                                     struct btrfs_file_extent_item);
 135
 136                 if (btrfs_file_extent_type(leaf, ei) !=
 137                     BTRFS_FILE_EXTENT_INLINE) {
 138                         goto insert;
 139                 }
 140                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
 141                 ret = 0;
 142         }
 143         if (ret == 0) {
 144                 u32 found_size;
 145                 u64 found_end;
 146
 147                 leaf = path->nodes[0];
 148                 ei = btrfs_item_ptr(leaf, path->slots[0],
 149                                     struct btrfs_file_extent_item);
 150
 151                 if (btrfs_file_extent_type(leaf, ei) !=
 152                     BTRFS_FILE_EXTENT_INLINE) {
 153                         err = ret;
 154                         btrfs_print_leaf(root, leaf);
 155                         printk("found wasn't inline offset %Lu inode %lu\n",
 156                                offset, inode->i_ino);
 157                         goto fail;
 158                 }
 159                 found_size = btrfs_file_extent_inline_len(leaf,
 160                                           btrfs_item_nr(leaf, path->slots[0]));
 161                 found_end = key.offset + found_size;
 162
 163                 if (found_end < offset + size) {
 164                         btrfs_release_path(root, path);
 165                         ret = btrfs_search_slot(trans, root, &key, path,
 166                                                 offset + size - found_end, 1);
 167                         BUG_ON(ret != 0);
 168
 169                         ret = btrfs_extend_item(trans, root, path,
 170                                                 offset + size - found_end);
 171                         if (ret) {
 172                                 err = ret;
 173                                 goto fail;
 174                         }
 175                         leaf = path->nodes[0];
 176                         ei = btrfs_item_ptr(leaf, path->slots[0],
 177                                             struct btrfs_file_extent_item);
 178                 }
 179                 if (found_end < offset) {
 180                         ptr = btrfs_file_extent_inline_start(ei) + found_size;
 181                         memset_extent_buffer(leaf, 0, ptr, offset - found_end);
 182                 }
 183         } else {
 184 insert:
 185                 btrfs_release_path(root, path);
 186                 datasize = offset + size - key.offset;
 187                 datasize = btrfs_file_extent_calc_inline_size(datasize);
 188                 ret = btrfs_insert_empty_item(trans, root, path, &key,
 189                                               datasize);
 190                 if (ret) {
 191                         err = ret;
 192                         printk("got bad ret %d\n", ret);
 193                         goto fail;
 194                 }
 195                 leaf = path->nodes[0];
 196                 ei = btrfs_item_ptr(leaf, path->slots[0],
 197                                     struct btrfs_file_extent_item);
 198                 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
 199                 btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
 200         }
 201         ptr = btrfs_file_extent_inline_start(ei) + offset - key.offset;
 202
 203         cur_size = size;
 204         i = 0;
 205         while (size > 0) {
 206                 page = pages[i];
 207                 kaddr = kmap_atomic(page, KM_USER0);
 208                 cur_size = min_t(size_t, PAGE_CACHE_SIZE - page_offset, size);
 209                 write_extent_buffer(leaf, kaddr + page_offset, ptr, cur_size);
 210                 kunmap_atomic(kaddr, KM_USER0);
 211                 page_offset = 0;
 212                 ptr += cur_size;
 213                 size -= cur_size;
 214                 if (i >= num_pages) {
 215                         printk("i %d num_pages %d\n", i, num_pages);
 216                 }
 217                 i++;
 218         }
 219         btrfs_mark_buffer_dirty(leaf);
 220 fail:
 221         btrfs_free_path(path);
 222         return err;
 223 }
 224
 225 static int noinline dirty_and_release_pages(struct btrfs_trans_handle *trans,
 226                                    struct btrfs_root *root,
 227                                    struct file *file,
 228                                    struct page **pages,
 229                                    size_t num_pages,
 230                                    loff_t pos,
 231                                    size_t write_bytes)
 232 {
 233         int err = 0;
 234         int i;
 235         struct inode *inode = fdentry(file)->d_inode;
 236         struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
 237         u64 hint_byte;
 238         u64 num_bytes;
 239         u64 start_pos;
 240         u64 end_of_last_block;
 241         u64 end_pos = pos + write_bytes;
 242         u64 inline_size;
 243         loff_t isize = i_size_read(inode);
 244
 245         start_pos = pos & ~((u64)root->sectorsize - 1);
 246         num_bytes = (write_bytes + pos - start_pos +
 247                     root->sectorsize - 1) & ~((u64)root->sectorsize - 1);
 248
 249         end_of_last_block = start_pos + num_bytes - 1;
 250
 251         lock_extent(io_tree, start_pos, end_of_last_block, GFP_NOFS);
 252         mutex_lock(&root->fs_info->fs_mutex);
 253         trans = btrfs_start_transaction(root, 1);
 254         if (!trans) {
 255                 err = -ENOMEM;
 256                 goto out_unlock;
 257         }
 258         btrfs_set_trans_block_group(trans, inode);
 259         inode->i_blocks += num_bytes >> 9;
 260         hint_byte = 0;
 261
 262         if ((end_of_last_block & 4095) == 0) {
 263                 printk("strange end of last %Lu %zu %Lu\n", start_pos, write_bytes, end_of_last_block);
 264         }
 265         set_extent_uptodate(io_tree, start_pos, end_of_last_block, GFP_NOFS);
 266
 267         /* FIXME...EIEIO, ENOSPC and more */
 268         /* insert any holes we need to create */
 269         if (isize < end_pos) {
 270                 u64 last_pos_in_file;
 271                 u64 hole_size;
 272                 u64 mask = root->sectorsize - 1;
 273                 last_pos_in_file = (isize + mask) & ~mask;
 274                 hole_size = (end_pos - last_pos_in_file + mask) & ~mask;
 275                 if (last_pos_in_file < end_pos) {
 276                         err = btrfs_drop_extents(trans, root, inode,
 277                                                  last_pos_in_file,
 278                                                  last_pos_in_file + hole_size,
 279                                                  last_pos_in_file,
 280                                                  &hint_byte);
 281                         if (err)
 282                                 goto failed;
 283
 284                         err = btrfs_insert_file_extent(trans, root,
 285                                                        inode->i_ino,
 286                                                        last_pos_in_file,
 287                                                        0, 0, hole_size);
 288                         btrfs_drop_extent_cache(inode, last_pos_in_file,
 289                                         last_pos_in_file + hole_size -1);
 290                         btrfs_check_file(root, inode);
 291                 }
 292                 if (err)
 293                         goto failed;
 294         }
 295
 296         /*
 297          * either allocate an extent for the new bytes or setup the key
 298          * to show we are doing inline data in the extent
 299          */
 300         inline_size = end_pos;
 301         if (isize >= BTRFS_MAX_INLINE_DATA_SIZE(root) ||
 302             inline_size > root->fs_info->max_inline ||
 303             (inline_size & (root->sectorsize -1)) == 0 ||
 304             inline_size >= BTRFS_MAX_INLINE_DATA_SIZE(root)) {
 305                 u64 last_end;
 306                 u64 existing_delalloc = 0;
 307
 308                 for (i = 0; i < num_pages; i++) {
 309                         struct page *p = pages[i];
 310                         SetPageUptodate(p);
 311                         set_page_dirty(p);
 312                 }
 313                 last_end = (u64)(pages[num_pages -1]->index) <<
 314                                 PAGE_CACHE_SHIFT;
 315                 last_end += PAGE_CACHE_SIZE - 1;
 316                 if (start_pos < isize) {
 317                         u64 delalloc_start = start_pos;
 318                         existing_delalloc = count_range_bits(io_tree,
 319                                              &delalloc_start,
 320                                              end_of_last_block, (u64)-1,
 321                                              EXTENT_DELALLOC);
 322                 }
 323                 set_extent_delalloc(io_tree, start_pos, end_of_last_block,
 324                                  GFP_NOFS);
 325                 btrfs_add_ordered_inode(inode);
 326         } else {
 327                 u64 aligned_end;
 328                 /* step one, delete the existing extents in this range */
 329                 aligned_end = (pos + write_bytes + root->sectorsize - 1) &
 330                         ~((u64)root->sectorsize - 1);
 331                 err = btrfs_drop_extents(trans, root, inode, start_pos,
 332                                          aligned_end, aligned_end, &hint_byte);
 333                 if (err)
 334                         goto failed;
 335                 if (isize > inline_size)
 336                         inline_size = min_t(u64, isize, aligned_end);
 337                 inline_size -= start_pos;
 338                 err = insert_inline_extent(trans, root, inode, start_pos,
 339                                            inline_size, pages, 0, num_pages);
 340                 btrfs_drop_extent_cache(inode, start_pos, aligned_end - 1);
 341                 BUG_ON(err);
 342         }
 343         if (end_pos > isize) {
 344                 i_size_write(inode, end_pos);
 345                 btrfs_update_inode(trans, root, inode);
 346         }
 347 failed:
 348         err = btrfs_end_transaction(trans, root);
 349 out_unlock:
 350         mutex_unlock(&root->fs_info->fs_mutex);
 351         unlock_extent(io_tree, start_pos, end_of_last_block, GFP_NOFS);
 352         return err;
 353 }
 354
 355 int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end)
 356 {
 357         struct extent_map *em;
 358         struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
 359
 360         while(1) {
 361                 spin_lock(&em_tree->lock);
 362                 em = lookup_extent_mapping(em_tree, start, end);
 363                 if (!em) {
 364                         spin_unlock(&em_tree->lock);
 365                         break;
 366                 }
 367                 remove_extent_mapping(em_tree, em);
 368                 spin_unlock(&em_tree->lock);
 369
 370                 /* once for us */
 371                 free_extent_map(em);
 372                 /* once for the tree*/
 373                 free_extent_map(em);
 374         }
 375         return 0;
 376 }
 377
 378 int btrfs_check_file(struct btrfs_root *root, struct inode *inode)
 379 {
 380         return 0;
 381 #if 0
 382         struct btrfs_path *path;
 383         struct btrfs_key found_key;
 384         struct extent_buffer *leaf;
 385         struct btrfs_file_extent_item *extent;
 386         u64 last_offset = 0;
 387         int nritems;
 388         int slot;
 389         int found_type;
 390         int ret;
 391         int err = 0;
 392         u64 extent_end = 0;
 393
 394         path = btrfs_alloc_path();
 395         ret = btrfs_lookup_file_extent(NULL, root, path, inode->i_ino,
 396                                        last_offset, 0);
 397         while(1) {
 398                 nritems = btrfs_header_nritems(path->nodes[0]);
 399                 if (path->slots[0] >= nritems) {
 400                         ret = btrfs_next_leaf(root, path);
 401                         if (ret)
 402                                 goto out;
 403                         nritems = btrfs_header_nritems(path->nodes[0]);
 404                 }
 405                 slot = path->slots[0];
 406                 leaf = path->nodes[0];
 407                 btrfs_item_key_to_cpu(leaf, &found_key, slot);
 408                 if (found_key.objectid != inode->i_ino)
 409                         break;
 410                 if (found_key.type != BTRFS_EXTENT_DATA_KEY)
 411                         goto out;
 412
 413                 if (found_key.offset != last_offset) {
 414                         WARN_ON(1);
 415                         btrfs_print_leaf(root, leaf);
 416                         printk("inode %lu found offset %Lu expected %Lu\n",
 417                                inode->i_ino, found_key.offset, last_offset);
 418                         err = 1;
 419                         goto out;
 420                 }
 421                 extent = btrfs_item_ptr(leaf, slot,
 422                                         struct btrfs_file_extent_item);
 423                 found_type = btrfs_file_extent_type(leaf, extent);
 424                 if (found_type == BTRFS_FILE_EXTENT_REG) {
 425                         extent_end = found_key.offset +
 426                              btrfs_file_extent_num_bytes(leaf, extent);
 427                 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
 428                         struct btrfs_item *item;
 429                         item = btrfs_item_nr(leaf, slot);
 430                         extent_end = found_key.offset +
 431                              btrfs_file_extent_inline_len(leaf, item);
 432                         extent_end = (extent_end + root->sectorsize - 1) &
 433                                 ~((u64)root->sectorsize -1 );
 434                 }
 435                 last_offset = extent_end;
 436                 path->slots[0]++;
 437         }
 438         if (last_offset < inode->i_size) {
 439                 WARN_ON(1);
 440                 btrfs_print_leaf(root, leaf);
 441                 printk("inode %lu found offset %Lu size %Lu\n", inode->i_ino,
 442                        last_offset, inode->i_size);
 443                 err = 1;
 444
 445         }
 446 out:
 447         btrfs_free_path(path);
 448         return err;
 449 #endif
 450 }
 451
 452 /*
 453  * this is very complex, but the basic idea is to drop all extents
 454  * in the range start - end.  hint_block is filled in with a block number
 455  * that would be a good hint to the block allocator for this file.
 456  *
 457  * If an extent intersects the range but is not entirely inside the range
 458  * it is either truncated or split.  Anything entirely inside the range
 459  * is deleted from the tree.
 460  */
 461 int btrfs_drop_extents(struct btrfs_trans_handle *trans,
 462                        struct btrfs_root *root, struct inode *inode,
 463                        u64 start, u64 end, u64 inline_limit, u64 *hint_byte)
 464 {
 465         u64 extent_end = 0;
 466         u64 search_start = start;
 467         struct extent_buffer *leaf;
 468         struct btrfs_file_extent_item *extent;
 469         struct btrfs_path *path;
 470         struct btrfs_key key;
 471         struct btrfs_file_extent_item old;
 472         int keep;
 473         int slot;
 474         int bookend;
 475         int found_type;
 476         int found_extent;
 477         int found_inline;
 478         int recow;
 479         int ret;
 480
 481         btrfs_drop_extent_cache(inode, start, end - 1);
 482
 483         path = btrfs_alloc_path();
 484         if (!path)
 485                 return -ENOMEM;
 486         while(1) {
 487                 recow = 0;
 488                 btrfs_release_path(root, path);
 489                 ret = btrfs_lookup_file_extent(trans, root, path, inode->i_ino,
 490                                                search_start, -1);
 491                 if (ret < 0)
 492                         goto out;
 493                 if (ret > 0) {
 494                         if (path->slots[0] == 0) {
 495                                 ret = 0;
 496                                 goto out;
 497                         }
 498                         path->slots[0]--;
 499                 }
 500 next_slot:
 501                 keep = 0;
 502                 bookend = 0;
 503                 found_extent = 0;
 504                 found_inline = 0;
 505                 extent = NULL;
 506                 leaf = path->nodes[0];
 507                 slot = path->slots[0];
 508                 ret = 0;
 509                 btrfs_item_key_to_cpu(leaf, &key, slot);
 510                 if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY &&
 511                     key.offset >= end) {
 512                         goto out;
 513                 }
 514                 if (btrfs_key_type(&key) > BTRFS_EXTENT_DATA_KEY ||
 515                     key.objectid != inode->i_ino) {
 516                         goto out;
 517                 }
 518                 if (recow) {
 519                         search_start = key.offset;
 520                         continue;
 521                 }
 522                 if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY) {
 523                         extent = btrfs_item_ptr(leaf, slot,
 524                                                 struct btrfs_file_extent_item);
 525                         found_type = btrfs_file_extent_type(leaf, extent);
 526                         if (found_type == BTRFS_FILE_EXTENT_REG) {
 527                                 extent_end =
 528                                      btrfs_file_extent_disk_bytenr(leaf,
 529                                                                    extent);
 530                                 if (extent_end)
 531                                         *hint_byte = extent_end;
 532
 533                                 extent_end = key.offset +
 534                                      btrfs_file_extent_num_bytes(leaf, extent);
 535                                 found_extent = 1;
 536                         } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
 537                                 struct btrfs_item *item;
 538                                 item = btrfs_item_nr(leaf, slot);
 539                                 found_inline = 1;
 540                                 extent_end = key.offset +
 541                                      btrfs_file_extent_inline_len(leaf, item);
 542                         }
 543                 } else {
 544                         extent_end = search_start;
 545                 }
 546
 547                 /* we found nothing we can drop */
 548                 if ((!found_extent && !found_inline) ||
 549                     search_start >= extent_end) {
 550                         int nextret;
 551                         u32 nritems;
 552                         nritems = btrfs_header_nritems(leaf);
 553                         if (slot >= nritems - 1) {
 554                                 nextret = btrfs_next_leaf(root, path);
 555                                 if (nextret)
 556                                         goto out;
 557                                 recow = 1;
 558                         } else {
 559                                 path->slots[0]++;
 560                         }
 561                         goto next_slot;
 562                 }
 563
 564                 if (found_inline) {
 565                         u64 mask = root->sectorsize - 1;
 566                         search_start = (extent_end + mask) & ~mask;
 567                 } else
 568                         search_start = extent_end;
 569                 if (end <= extent_end && start >= key.offset && found_inline) {
 570                         *hint_byte = EXTENT_MAP_INLINE;
 571                         continue;
 572                 }
 573                 if (end < extent_end && end >= key.offset) {
 574                         if (found_extent) {
 575                                 u64 disk_bytenr =
 576                                     btrfs_file_extent_disk_bytenr(leaf, extent);
 577                                 u64 disk_num_bytes =
 578                                     btrfs_file_extent_disk_num_bytes(leaf,
 579                                                                       extent);
 580                                 read_extent_buffer(leaf, &old,
 581                                                    (unsigned long)extent,
 582                                                    sizeof(old));
 583                                 if (disk_bytenr != 0) {
 584                                         ret = btrfs_inc_extent_ref(trans, root,
 585                                                  disk_bytenr, disk_num_bytes,
 586                                                  root->root_key.objectid,
 587                                                  trans->transid,
 588                                                  key.objectid, end);
 589                                         BUG_ON(ret);
 590                                 }
 591                         }
 592                         bookend = 1;
 593                         if (found_inline && start <= key.offset)
 594                                 keep = 1;
 595                 }
 596                 /* truncate existing extent */
 597                 if (start > key.offset) {
 598                         u64 new_num;
 599                         u64 old_num;
 600                         keep = 1;
 601                         WARN_ON(start & (root->sectorsize - 1));
 602                         if (found_extent) {
 603                                 new_num = start - key.offset;
 604                                 old_num = btrfs_file_extent_num_bytes(leaf,
 605                                                                       extent);
 606                                 *hint_byte =
 607                                         btrfs_file_extent_disk_bytenr(leaf,
 608                                                                       extent);
 609                                 if (btrfs_file_extent_disk_bytenr(leaf,
 610                                                                   extent)) {
 611                                         inode->i_blocks -=
 612                                                 (old_num - new_num) >> 9;
 613                                 }
 614                                 btrfs_set_file_extent_num_bytes(leaf, extent,
 615                                                                 new_num);
 616                                 btrfs_mark_buffer_dirty(leaf);
 617                         } else if (key.offset < inline_limit &&
 618                                    (end > extent_end) &&
 619                                    (inline_limit < extent_end)) {
 620                                 u32 new_size;
 621                                 new_size = btrfs_file_extent_calc_inline_size(
 622                                                    inline_limit - key.offset);
 623                                 btrfs_truncate_item(trans, root, path,
 624                                                     new_size, 1);
 625                         }
 626                 }
 627                 /* delete the entire extent */
 628                 if (!keep) {
 629                         u64 disk_bytenr = 0;
 630                         u64 disk_num_bytes = 0;
 631                         u64 extent_num_bytes = 0;
 632                         u64 root_gen;
 633                         u64 root_owner;
 634
 635                         root_gen = btrfs_header_generation(leaf);
 636                         root_owner = btrfs_header_owner(leaf);
 637                         if (found_extent) {
 638                                 disk_bytenr =
 639                                       btrfs_file_extent_disk_bytenr(leaf,
 640                                                                      extent);
 641                                 disk_num_bytes =
 642                                       btrfs_file_extent_disk_num_bytes(leaf,
 643                                                                        extent);
 644                                 extent_num_bytes =
 645                                       btrfs_file_extent_num_bytes(leaf, extent);
 646                                 *hint_byte =
 647                                         btrfs_file_extent_disk_bytenr(leaf,
 648                                                                       extent);
 649                         }
 650                         ret = btrfs_del_item(trans, root, path);
 651                         /* TODO update progress marker and return */
 652                         BUG_ON(ret);
 653                         btrfs_release_path(root, path);
 654                         extent = NULL;
 655                         if (found_extent && disk_bytenr != 0) {
 656                                 inode->i_blocks -= extent_num_bytes >> 9;
 657                                 ret = btrfs_free_extent(trans, root,
 658                                                 disk_bytenr,
 659                                                 disk_num_bytes,
 660                                                 root_owner,
 661                                                 root_gen, inode->i_ino,
 662                                                 key.offset, 0);
 663                         }
 664
 665                         BUG_ON(ret);
 666                         if (!bookend && search_start >= end) {
 667                                 ret = 0;
 668                                 goto out;
 669                         }
 670                         if (!bookend)
 671                                 continue;
 672                 }
 673                 if (bookend && found_inline && start <= key.offset) {
 674                         u32 new_size;
 675                         new_size = btrfs_file_extent_calc_inline_size(
 676                                                    extent_end - end);
 677                         btrfs_truncate_item(trans, root, path, new_size, 0);
 678                 }
 679                 /* create bookend, splitting the extent in two */
 680                 if (bookend && found_extent) {
 681                         struct btrfs_key ins;
 682                         ins.objectid = inode->i_ino;
 683                         ins.offset = end;
 684                         btrfs_set_key_type(&ins, BTRFS_EXTENT_DATA_KEY);
 685                         btrfs_release_path(root, path);
 686                         ret = btrfs_insert_empty_item(trans, root, path, &ins,
 687                                                       sizeof(*extent));
 688
 689                         leaf = path->nodes[0];
 690                         if (ret) {
 691                                 btrfs_print_leaf(root, leaf);
 692                                 printk("got %d on inserting %Lu %u %Lu start %Lu end %Lu found %Lu %Lu keep was %d\n", ret , ins.objectid, ins.type, ins.offset, start, end, key.offset, extent_end, keep);
 693                         }
 694                         BUG_ON(ret);
 695                         extent = btrfs_item_ptr(leaf, path->slots[0],
 696                                                 struct btrfs_file_extent_item);
 697                         write_extent_buffer(leaf, &old,
 698                                             (unsigned long)extent, sizeof(old));
 699
 700                         btrfs_set_file_extent_offset(leaf, extent,
 701                                     le64_to_cpu(old.offset) + end - key.offset);
 702                         WARN_ON(le64_to_cpu(old.num_bytes) <
 703                                 (extent_end - end));
 704                         btrfs_set_file_extent_num_bytes(leaf, extent,
 705                                                         extent_end - end);
 706                         btrfs_set_file_extent_type(leaf, extent,
 707                                                    BTRFS_FILE_EXTENT_REG);
 708
 709                         btrfs_mark_buffer_dirty(path->nodes[0]);
 710                         if (le64_to_cpu(old.disk_bytenr) != 0) {
 711                                 inode->i_blocks +=
 712                                       btrfs_file_extent_num_bytes(leaf,
 713                                                                   extent) >> 9;
 714                         }
 715                         ret = 0;
 716                         goto out;
 717                 }
 718         }
 719 out:
 720         btrfs_free_path(path);
 721         return ret;
 722 }
 723
 724 /*
 725  * this gets pages into the page cache and locks them down
 726  */
 727 static int prepare_pages(struct btrfs_root *root, struct file *file,
 728                          struct page **pages, size_t num_pages,
 729                          loff_t pos, unsigned long first_index,
 730                          unsigned long last_index, size_t write_bytes)
 731 {
 732         int i;
 733         unsigned long index = pos >> PAGE_CACHE_SHIFT;
 734         struct inode *inode = fdentry(file)->d_inode;
 735         int err = 0;
 736         u64 start_pos;
 737
 738         start_pos = pos & ~((u64)root->sectorsize - 1);
 739
 740         memset(pages, 0, num_pages * sizeof(struct page *));
 741
 742         for (i = 0; i < num_pages; i++) {
 743                 pages[i] = grab_cache_page(inode->i_mapping, index + i);
 744                 if (!pages[i]) {
 745                         err = -ENOMEM;
 746                         BUG_ON(1);
 747                 }
 748 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
 749                 ClearPageDirty(pages[i]);
 750 #else
 751                 cancel_dirty_page(pages[i], PAGE_CACHE_SIZE);
 752 #endif
 753                 wait_on_page_writeback(pages[i]);
 754                 set_page_extent_mapped(pages[i]);
 755                 WARN_ON(!PageLocked(pages[i]));
 756         }
 757         return 0;
 758 }
 759
 760 static ssize_t btrfs_file_write(struct file *file, const char __user *buf,
 761                                 size_t count, loff_t *ppos)
 762 {
 763         loff_t pos;
 764         loff_t start_pos;
 765         ssize_t num_written = 0;
 766         ssize_t err = 0;
 767         int ret = 0;
 768         struct inode *inode = fdentry(file)->d_inode;
 769         struct btrfs_root *root = BTRFS_I(inode)->root;
 770         struct page **pages = NULL;
 771         int nrptrs;
 772         struct page *pinned[2];
 773         unsigned long first_index;
 774         unsigned long last_index;
 775
 776         nrptrs = min((count + PAGE_CACHE_SIZE - 1) / PAGE_CACHE_SIZE,
 777                      PAGE_CACHE_SIZE / (sizeof(struct page *)));
 778         pinned[0] = NULL;
 779         pinned[1] = NULL;
 780         if (file->f_flags & O_DIRECT)
 781                 return -EINVAL;
 782
 783         pos = *ppos;
 784         start_pos = pos;
 785
 786         vfs_check_frozen(inode->i_sb, SB_FREEZE_WRITE);
 787         current->backing_dev_info = inode->i_mapping->backing_dev_info;
 788         err = generic_write_checks(file, &pos, &count, S_ISBLK(inode->i_mode));
 789         if (err)
 790                 goto out_nolock;
 791         if (count == 0)
 792                 goto out_nolock;
 793         err = remove_suid(fdentry(file));
 794         if (err)
 795                 goto out_nolock;
 796         file_update_time(file);
 797
 798         pages = kmalloc(nrptrs * sizeof(struct page *), GFP_KERNEL);
 799
 800         mutex_lock(&inode->i_mutex);
 801         first_index = pos >> PAGE_CACHE_SHIFT;
 802         last_index = (pos + count) >> PAGE_CACHE_SHIFT;
 803
 804         /*
 805          * there are lots of better ways to do this, but this code
 806          * makes sure the first and last page in the file range are
 807          * up to date and ready for cow
 808          */
 809         if ((pos & (PAGE_CACHE_SIZE - 1))) {
 810                 pinned[0] = grab_cache_page(inode->i_mapping, first_index);
 811                 if (!PageUptodate(pinned[0])) {
 812                         ret = btrfs_readpage(NULL, pinned[0]);
 813                         BUG_ON(ret);
 814                         wait_on_page_locked(pinned[0]);
 815                 } else {
 816                         unlock_page(pinned[0]);
 817                 }
 818         }
 819         if ((pos + count) & (PAGE_CACHE_SIZE - 1)) {
 820                 pinned[1] = grab_cache_page(inode->i_mapping, last_index);
 821                 if (!PageUptodate(pinned[1])) {
 822                         ret = btrfs_readpage(NULL, pinned[1]);
 823                         BUG_ON(ret);
 824                         wait_on_page_locked(pinned[1]);
 825                 } else {
 826                         unlock_page(pinned[1]);
 827                 }
 828         }
 829
 830         while(count > 0) {
 831                 size_t offset = pos & (PAGE_CACHE_SIZE - 1);
 832                 size_t write_bytes = min(count, nrptrs *
 833                                         (size_t)PAGE_CACHE_SIZE -
 834                                          offset);
 835                 size_t num_pages = (write_bytes + PAGE_CACHE_SIZE - 1) >>
 836                                         PAGE_CACHE_SHIFT;
 837
 838                 WARN_ON(num_pages > nrptrs);
 839                 memset(pages, 0, sizeof(pages));
 840
 841                 mutex_lock(&root->fs_info->fs_mutex);
 842                 ret = btrfs_check_free_space(root, write_bytes, 0);
 843                 mutex_unlock(&root->fs_info->fs_mutex);
 844                 if (ret)
 845                         goto out;
 846
 847                 ret = prepare_pages(root, file, pages, num_pages,
 848                                     pos, first_index, last_index,
 849                                     write_bytes);
 850                 if (ret)
 851                         goto out;
 852
 853                 ret = btrfs_copy_from_user(pos, num_pages,
 854                                            write_bytes, pages, buf);
 855                 if (ret) {
 856                         btrfs_drop_pages(pages, num_pages);
 857                         goto out;
 858                 }
 859
 860                 ret = dirty_and_release_pages(NULL, root, file, pages,
 861                                               num_pages, pos, write_bytes);
 862                 btrfs_drop_pages(pages, num_pages);
 863                 if (ret)
 864                         goto out;
 865
 866                 buf += write_bytes;
 867                 count -= write_bytes;
 868                 pos += write_bytes;
 869                 num_written += write_bytes;
 870
 871                 balance_dirty_pages_ratelimited_nr(inode->i_mapping, num_pages);
 872                 if (num_pages < (root->leafsize >> PAGE_CACHE_SHIFT) + 1)
 873                         btrfs_btree_balance_dirty(root, 1);
 874                 btrfs_throttle(root);
 875                 cond_resched();
 876         }
 877 out:
 878         mutex_unlock(&inode->i_mutex);
 879
 880 out_nolock:
 881         kfree(pages);
 882         if (pinned[0])
 883                 page_cache_release(pinned[0]);
 884         if (pinned[1])
 885                 page_cache_release(pinned[1]);
 886         *ppos = pos;
 887
 888         if (num_written > 0 && ((file->f_flags & O_SYNC) || IS_SYNC(inode))) {
 889                 err = sync_page_range(inode, inode->i_mapping,
 890                                       start_pos, num_written);
 891                 if (err < 0)
 892                         num_written = err;
 893         }
 894         current->backing_dev_info = NULL;
 895         return num_written ? num_written : err;
 896 }
 897
 898 static int btrfs_sync_file(struct file *file,
 899                            struct dentry *dentry, int datasync)
 900 {
 901         struct inode *inode = dentry->d_inode;
 902         struct btrfs_root *root = BTRFS_I(inode)->root;
 903         int ret = 0;
 904         struct btrfs_trans_handle *trans;
 905
 906         /*
 907          * check the transaction that last modified this inode
 908          * and see if its already been committed
 909          */
 910         mutex_lock(&root->fs_info->fs_mutex);
 911         if (!BTRFS_I(inode)->last_trans)
 912                 goto out;
 913         mutex_lock(&root->fs_info->trans_mutex);
 914         if (BTRFS_I(inode)->last_trans <=
 915             root->fs_info->last_trans_committed) {
 916                 BTRFS_I(inode)->last_trans = 0;
 917                 mutex_unlock(&root->fs_info->trans_mutex);
 918                 goto out;
 919         }
 920         mutex_unlock(&root->fs_info->trans_mutex);
 921
 922         /*
 923          * ok we haven't committed the transaction yet, lets do a commit
 924          */
 925         trans = btrfs_start_transaction(root, 1);
 926         if (!trans) {
 927                 ret = -ENOMEM;
 928                 goto out;
 929         }
 930         ret = btrfs_commit_transaction(trans, root);
 931 out:
 932         mutex_unlock(&root->fs_info->fs_mutex);
 933         return ret > 0 ? EIO : ret;
 934 }
 935
 936 static struct vm_operations_struct btrfs_file_vm_ops = {
 937 #if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,23)
 938         .nopage         = filemap_nopage,
 939         .populate       = filemap_populate,
 940 #else
 941         .fault          = filemap_fault,
 942 #endif
 943         .page_mkwrite   = btrfs_page_mkwrite,
 944 };
 945
 946 static int btrfs_file_mmap(struct file  *filp, struct vm_area_struct *vma)
 947 {
 948         vma->vm_ops = &btrfs_file_vm_ops;
 949         file_accessed(filp);
 950         return 0;
 951 }
 952
 953 struct file_operations btrfs_file_operations = {
 954         .llseek         = generic_file_llseek,
 955         .read           = do_sync_read,
 956         .aio_read       = generic_file_aio_read,
 957         .splice_read    = generic_file_splice_read,
 958 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
 959         .sendfile       = generic_file_sendfile,
 960 #endif
 961         .write          = btrfs_file_write,
 962         .mmap           = btrfs_file_mmap,
 963         .open           = generic_file_open,
 964         .fsync          = btrfs_sync_file,
 965         .unlocked_ioctl = btrfs_ioctl,
 966 #ifdef CONFIG_COMPAT
 967         .compat_ioctl   = btrfs_ioctl,
 968 #endif
 969 };
 970