Btrfs: Don't try to compress pages past i_size
[safe/jmp/linux-2.6] / fs / btrfs / file.c
index 238a8e2..3e8023e 100644 (file)
@@ -29,7 +29,6 @@
 #include <linux/writeback.h>
 #include <linux/statfs.h>
 #include <linux/compat.h>
-#include <linux/version.h>
 #include "ctree.h"
 #include "disk-io.h"
 #include "transaction.h"
 /* simple helper to fault in pages and copy.  This should go away
  * and be replaced with calls into generic code.
  */
-static int noinline btrfs_copy_from_user(loff_t pos, int num_pages,
+static noinline int btrfs_copy_from_user(loff_t pos, int num_pages,
                                         int write_bytes,
                                         struct page **prepared_pages,
-                                        const char __user * buf)
+                                        const char __user *buf)
 {
        long page_fault = 0;
        int i;
@@ -78,7 +77,7 @@ static int noinline btrfs_copy_from_user(loff_t pos, int num_pages,
 /*
  * unlocks pages after btrfs_file_write is done with them
  */
-static void noinline btrfs_drop_pages(struct page **pages, size_t num_pages)
+static noinline void btrfs_drop_pages(struct page **pages, size_t num_pages)
 {
        size_t i;
        for (i = 0; i < num_pages; i++) {
@@ -103,7 +102,7 @@ static void noinline btrfs_drop_pages(struct page **pages, size_t num_pages)
  * this also makes the decision about creating an inline extent vs
  * doing real data extents, marking pages dirty and delalloc as required.
  */
-static int noinline dirty_and_release_pages(struct btrfs_trans_handle *trans,
+static noinline int dirty_and_release_pages(struct btrfs_trans_handle *trans,
                                   struct btrfs_root *root,
                                   struct file *file,
                                   struct page **pages,
@@ -137,9 +136,6 @@ static int noinline dirty_and_release_pages(struct btrfs_trans_handle *trans,
        btrfs_set_trans_block_group(trans, inode);
        hint_byte = 0;
 
-       if ((end_of_last_block & 4095) == 0) {
-               printk("strange end of last %Lu %zu %Lu\n", start_pos, write_bytes, end_of_last_block);
-       }
        set_extent_uptodate(io_tree, start_pos, end_of_last_block, GFP_NOFS);
 
        /* check for reserved extents on each page, we don't want
@@ -185,7 +181,7 @@ int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end,
                len = (u64)-1;
                testend = 0;
        }
-       while(1) {
+       while (1) {
                if (!split)
                        split = alloc_extent_map(GFP_NOFS);
                if (!split2)
@@ -222,6 +218,7 @@ int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end,
                    em->start < start) {
                        split->start = em->start;
                        split->len = start - em->start;
+                       split->orig_start = em->orig_start;
                        split->block_start = em->block_start;
 
                        if (compressed)
@@ -249,9 +246,11 @@ int btrfs_drop_extent_cache(struct inode *inode, u64 start, u64 end,
                        if (compressed) {
                                split->block_len = em->block_len;
                                split->block_start = em->block_start;
+                               split->orig_start = em->orig_start;
                        } else {
                                split->block_len = split->len;
                                split->block_start = em->block_start + diff;
+                               split->orig_start = split->start;
                        }
 
                        ret = add_extent_mapping(em_tree, split);
@@ -292,7 +291,7 @@ int btrfs_check_file(struct btrfs_root *root, struct inode *inode)
        path = btrfs_alloc_path();
        ret = btrfs_lookup_file_extent(NULL, root, path, inode->i_ino,
                                       last_offset, 0);
-       while(1) {
+       while (1) {
                nritems = btrfs_header_nritems(path->nodes[0]);
                if (path->slots[0] >= nritems) {
                        ret = btrfs_next_leaf(root, path);
@@ -311,8 +310,10 @@ int btrfs_check_file(struct btrfs_root *root, struct inode *inode)
                if (found_key.offset < last_offset) {
                        WARN_ON(1);
                        btrfs_print_leaf(root, leaf);
-                       printk("inode %lu found offset %Lu expected %Lu\n",
-                              inode->i_ino, found_key.offset, last_offset);
+                       printk(KERN_ERR "inode %lu found offset %llu "
+                              "expected %llu\n", inode->i_ino,
+                              (unsigned long long)found_key.offset,
+                              (unsigned long long)last_offset);
                        err = 1;
                        goto out;
                }
@@ -328,7 +329,7 @@ int btrfs_check_file(struct btrfs_root *root, struct inode *inode)
                        extent_end = found_key.offset +
                             btrfs_file_extent_inline_len(leaf, extent);
                        extent_end = (extent_end + root->sectorsize - 1) &
-                               ~((u64)root->sectorsize -);
+                               ~((u64)root->sectorsize - 1);
                }
                last_offset = extent_end;
                path->slots[0]++;
@@ -336,8 +337,9 @@ int btrfs_check_file(struct btrfs_root *root, struct inode *inode)
        if (0 && last_offset < inode->i_size) {
                WARN_ON(1);
                btrfs_print_leaf(root, leaf);
-               printk("inode %lu found offset %Lu size %Lu\n", inode->i_ino,
-                      last_offset, inode->i_size);
+               printk(KERN_ERR "inode %lu found offset %llu size %llu\n",
+                      inode->i_ino, (unsigned long long)last_offset,
+                      (unsigned long long)inode->i_size);
                err = 1;
 
        }
@@ -359,7 +361,7 @@ out:
  * inline_limit is used to tell this code which offsets in the file to keep
  * if they contain inline extents.
  */
-int noinline btrfs_drop_extents(struct btrfs_trans_handle *trans,
+noinline int btrfs_drop_extents(struct btrfs_trans_handle *trans,
                       struct btrfs_root *root, struct inode *inode,
                       u64 start, u64 end, u64 inline_limit, u64 *hint_byte)
 {
@@ -368,8 +370,10 @@ int noinline btrfs_drop_extents(struct btrfs_trans_handle *trans,
        u64 search_start = start;
        u64 leaf_start;
        u64 ram_bytes = 0;
-       u8 compression = 0;
-       u8 encryption = 0;
+       u64 orig_parent = 0;
+       u64 disk_bytenr = 0;
+       u8 compression;
+       u8 encryption;
        u16 other_encoding = 0;
        u64 root_gen;
        u64 root_owner;
@@ -393,7 +397,7 @@ int noinline btrfs_drop_extents(struct btrfs_trans_handle *trans,
        path = btrfs_alloc_path();
        if (!path)
                return -ENOMEM;
-       while(1) {
+       while (1) {
                recow = 0;
                btrfs_release_path(root, path);
                ret = btrfs_lookup_file_extent(trans, root, path, inode->i_ino,
@@ -415,6 +419,8 @@ next_slot:
                leaf_start = 0;
                root_gen = 0;
                root_owner = 0;
+               compression = 0;
+               encryption = 0;
                extent = NULL;
                leaf = path->nodes[0];
                slot = path->slots[0];
@@ -429,7 +435,7 @@ next_slot:
                        goto out;
                }
                if (recow) {
-                       search_start = key.offset;
+                       search_start = max(key.offset, start);
                        continue;
                }
                if (btrfs_key_type(&key) == BTRFS_EXTENT_DATA_KEY) {
@@ -498,17 +504,31 @@ next_slot:
                                keep = 1;
                }
 
-               if (bookend && found_extent && locked_end < extent_end) {
-                       ret = try_lock_extent(&BTRFS_I(inode)->io_tree,
-                                       locked_end, extent_end - 1, GFP_NOFS);
-                       if (!ret) {
-                               btrfs_release_path(root, path);
-                               lock_extent(&BTRFS_I(inode)->io_tree,
-                                       locked_end, extent_end - 1, GFP_NOFS);
+               if (bookend && found_extent) {
+                       if (locked_end < extent_end) {
+                               ret = try_lock_extent(&BTRFS_I(inode)->io_tree,
+                                               locked_end, extent_end - 1,
+                                               GFP_NOFS);
+                               if (!ret) {
+                                       btrfs_release_path(root, path);
+                                       lock_extent(&BTRFS_I(inode)->io_tree,
+                                               locked_end, extent_end - 1,
+                                               GFP_NOFS);
+                                       locked_end = extent_end;
+                                       continue;
+                               }
                                locked_end = extent_end;
-                               continue;
                        }
-                       locked_end = extent_end;
+                       orig_parent = path->nodes[0]->start;
+                       disk_bytenr = le64_to_cpu(old.disk_bytenr);
+                       if (disk_bytenr != 0) {
+                               ret = btrfs_inc_extent_ref(trans, root,
+                                          disk_bytenr,
+                                          le64_to_cpu(old.disk_num_bytes),
+                                          orig_parent, root->root_key.objectid,
+                                          trans->transid, inode->i_ino);
+                               BUG_ON(ret);
+                       }
                }
 
                if (found_inline) {
@@ -535,8 +555,8 @@ next_slot:
                                        inode_sub_bytes(inode, old_num -
                                                        new_num);
                                }
-                               btrfs_set_file_extent_num_bytes(leaf, extent,
-                                                               new_num);
+                               btrfs_set_file_extent_num_bytes(leaf,
+                                                       extent, new_num);
                                btrfs_mark_buffer_dirty(leaf);
                        } else if (key.offset < inline_limit &&
                                   (end > extent_end) &&
@@ -546,8 +566,12 @@ next_slot:
                                                   inline_limit - key.offset);
                                inode_sub_bytes(inode, extent_end -
                                                inline_limit);
-                               btrfs_truncate_item(trans, root, path,
-                                                   new_size, 1);
+                               btrfs_set_file_extent_ram_bytes(leaf, extent,
+                                                       new_size);
+                               if (!compression && !encryption) {
+                                       btrfs_truncate_item(trans, root, path,
+                                                           new_size, 1);
+                               }
                        }
                }
                /* delete the entire extent */
@@ -567,17 +591,20 @@ next_slot:
                        new_size = btrfs_file_extent_calc_inline_size(
                                                   extent_end - end);
                        inode_sub_bytes(inode, end - key.offset);
-                       ret = btrfs_truncate_item(trans, root, path,
-                                                 new_size, 0);
+                       btrfs_set_file_extent_ram_bytes(leaf, extent,
+                                                       new_size);
+                       if (!compression && !encryption)
+                               ret = btrfs_truncate_item(trans, root, path,
+                                                         new_size, 0);
                        BUG_ON(ret);
                }
                /* create bookend, splitting the extent in two */
                if (bookend && found_extent) {
-                       u64 disk_bytenr;
                        struct btrfs_key ins;
                        ins.objectid = inode->i_ino;
                        ins.offset = end;
                        btrfs_set_key_type(&ins, BTRFS_EXTENT_DATA_KEY);
+
                        btrfs_release_path(root, path);
                        ret = btrfs_insert_empty_item(trans, root, path, &ins,
                                                      sizeof(*extent));
@@ -614,35 +641,33 @@ next_slot:
 
                        btrfs_mark_buffer_dirty(path->nodes[0]);
 
-                       disk_bytenr = le64_to_cpu(old.disk_bytenr);
                        if (disk_bytenr != 0) {
-                               ret = btrfs_inc_extent_ref(trans, root,
-                                               disk_bytenr,
-                                               le64_to_cpu(old.disk_num_bytes),
+                               ret = btrfs_update_extent_ref(trans, root,
+                                               disk_bytenr, orig_parent,
                                                leaf->start,
                                                root->root_key.objectid,
                                                trans->transid, ins.objectid);
+
                                BUG_ON(ret);
                        }
                        btrfs_release_path(root, path);
-                       if (disk_bytenr != 0) {
+                       if (disk_bytenr != 0)
                                inode_add_bytes(inode, extent_end - end);
-                       }
                }
 
                if (found_extent && !keep) {
-                       u64 disk_bytenr = le64_to_cpu(old.disk_bytenr);
+                       u64 old_disk_bytenr = le64_to_cpu(old.disk_bytenr);
 
-                       if (disk_bytenr != 0) {
+                       if (old_disk_bytenr != 0) {
                                inode_sub_bytes(inode,
                                                le64_to_cpu(old.num_bytes));
                                ret = btrfs_free_extent(trans, root,
-                                               disk_bytenr,
+                                               old_disk_bytenr,
                                                le64_to_cpu(old.disk_num_bytes),
                                                leaf_start, root_owner,
                                                root_gen, key.objectid, 0);
                                BUG_ON(ret);
-                               *hint_byte = disk_bytenr;
+                               *hint_byte = old_disk_bytenr;
                        }
                }
 
@@ -715,6 +740,7 @@ int btrfs_mark_extent_written(struct btrfs_trans_handle *trans,
        u64 other_end;
        u64 split = start;
        u64 locked_end = end;
+       u64 orig_parent;
        int extent_type;
        int split_end = 1;
        int ret;
@@ -859,6 +885,12 @@ again:
        }
 
        btrfs_mark_buffer_dirty(leaf);
+
+       orig_parent = leaf->start;
+       ret = btrfs_inc_extent_ref(trans, root, bytenr, num_bytes,
+                                  orig_parent, root->root_key.objectid,
+                                  trans->transid, inode->i_ino);
+       BUG_ON(ret);
        btrfs_release_path(root, path);
 
        key.offset = start;
@@ -879,10 +911,13 @@ again:
        btrfs_set_file_extent_encryption(leaf, fi, 0);
        btrfs_set_file_extent_other_encoding(leaf, fi, 0);
 
-       ret = btrfs_inc_extent_ref(trans, root, bytenr, num_bytes,
-                                  leaf->start, root->root_key.objectid,
-                                  trans->transid, inode->i_ino);
-       BUG_ON(ret);
+       if (orig_parent != leaf->start) {
+               ret = btrfs_update_extent_ref(trans, root, bytenr,
+                                             orig_parent, leaf->start,
+                                             root->root_key.objectid,
+                                             trans->transid, inode->i_ino);
+               BUG_ON(ret);
+       }
 done:
        btrfs_mark_buffer_dirty(leaf);
        btrfs_release_path(root, path);
@@ -903,7 +938,7 @@ done:
  * waits for data=ordered extents to finish before allowing the pages to be
  * modified.
  */
-static int noinline prepare_pages(struct btrfs_root *root, struct file *file,
+static noinline int prepare_pages(struct btrfs_root *root, struct file *file,
                         struct page **pages, size_t num_pages,
                         loff_t pos, unsigned long first_index,
                         unsigned long last_index, size_t write_bytes)
@@ -938,7 +973,8 @@ again:
                struct btrfs_ordered_extent *ordered;
                lock_extent(&BTRFS_I(inode)->io_tree,
                            start_pos, last_pos - 1, GFP_NOFS);
-               ordered = btrfs_lookup_first_ordered_extent(inode, last_pos -1);
+               ordered = btrfs_lookup_first_ordered_extent(inode,
+                                                           last_pos - 1);
                if (ordered &&
                    ordered->file_offset + ordered->len > start_pos &&
                    ordered->file_offset < last_pos) {
@@ -1014,18 +1050,11 @@ static ssize_t btrfs_file_write(struct file *file, const char __user *buf,
        pages = kmalloc(nrptrs * sizeof(struct page *), GFP_KERNEL);
 
        mutex_lock(&inode->i_mutex);
+       BTRFS_I(inode)->sequence++;
        first_index = pos >> PAGE_CACHE_SHIFT;
        last_index = (pos + count) >> PAGE_CACHE_SHIFT;
 
        /*
-        * if this is a nodatasum mount, force summing off for the inode
-        * all the time.  That way a later mount with summing on won't
-        * get confused
-        */
-       if (btrfs_test_opt(root, NODATASUM))
-               btrfs_set_flag(inode, NODATASUM);
-
-       /*
         * there are lots of better ways to do this, but this code
         * makes sure the first and last page in the file range are
         * up to date and ready for cow
@@ -1051,7 +1080,7 @@ static ssize_t btrfs_file_write(struct file *file, const char __user *buf,
                }
        }
 
-       while(count > 0) {
+       while (count > 0) {
                size_t offset = pos & (PAGE_CACHE_SIZE - 1);
                size_t write_bytes = min(count, nrptrs *
                                        (size_t)PAGE_CACHE_SIZE -
@@ -1060,7 +1089,7 @@ static ssize_t btrfs_file_write(struct file *file, const char __user *buf,
                                        PAGE_CACHE_SHIFT;
 
                WARN_ON(num_pages > nrptrs);
-               memset(pages, 0, sizeof(pages));
+               memset(pages, 0, sizeof(struct page *) * nrptrs);
 
                ret = btrfs_check_free_space(root, write_bytes, 0);
                if (ret)
@@ -1144,7 +1173,7 @@ out_nolock:
        return num_written ? num_written : err;
 }
 
-int btrfs_release_file(struct inode * inode, struct file * filp)
+int btrfs_release_file(struct inode *inode, struct file *filp)
 {
        if (filp->private_data)
                btrfs_ioctl_trans_end(filp);
@@ -1185,9 +1214,10 @@ int btrfs_sync_file(struct file *file, struct dentry *dentry, int datasync)
        }
        mutex_unlock(&root->fs_info->trans_mutex);
 
-       root->fs_info->tree_log_batch++;
-       filemap_fdatawait(inode->i_mapping);
-       root->fs_info->tree_log_batch++;
+       root->log_batch++;
+       filemap_fdatawrite(inode->i_mapping);
+       btrfs_wait_ordered_range(inode, 0, (u64)-1);
+       root->log_batch++;
 
        /*
         * ok we haven't committed the transaction yet, lets do a commit
@@ -1202,9 +1232,8 @@ int btrfs_sync_file(struct file *file, struct dentry *dentry, int datasync)
        }
 
        ret = btrfs_log_dentry_safe(trans, root, file->f_dentry);
-       if (ret < 0) {
+       if (ret < 0)
                goto out;
-       }
 
        /* we've logged all the items and now have a consistent
         * version of the file in the log.  It is possible that