Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 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 | |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 19 | #include <linux/slab.h> |
Chris Mason | d6bfde8 | 2008-04-30 13:59:35 -0400 | [diff] [blame] | 20 | #include <linux/blkdev.h> |
Chris Mason | f421950 | 2008-07-22 11:18:09 -0400 | [diff] [blame] | 21 | #include <linux/writeback.h> |
| 22 | #include <linux/pagevec.h> |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 23 | #include "ctree.h" |
| 24 | #include "transaction.h" |
| 25 | #include "btrfs_inode.h" |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 26 | #include "extent_io.h" |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 27 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 28 | static u64 entry_end(struct btrfs_ordered_extent *entry) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 29 | { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 30 | if (entry->file_offset + entry->len < entry->file_offset) |
| 31 | return (u64)-1; |
| 32 | return entry->file_offset + entry->len; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 33 | } |
| 34 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 35 | /* returns NULL if the insertion worked, or it returns the node it did find |
| 36 | * in the tree |
| 37 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 38 | static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, |
| 39 | struct rb_node *node) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 40 | { |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 41 | struct rb_node **p = &root->rb_node; |
| 42 | struct rb_node *parent = NULL; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 43 | struct btrfs_ordered_extent *entry; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 44 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 45 | while (*p) { |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 46 | parent = *p; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 47 | entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 48 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 49 | if (file_offset < entry->file_offset) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 50 | p = &(*p)->rb_left; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 51 | else if (file_offset >= entry_end(entry)) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 52 | p = &(*p)->rb_right; |
| 53 | else |
| 54 | return parent; |
| 55 | } |
| 56 | |
| 57 | rb_link_node(node, parent, p); |
| 58 | rb_insert_color(node, root); |
| 59 | return NULL; |
| 60 | } |
| 61 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 62 | /* |
| 63 | * look for a given offset in the tree, and if it can't be found return the |
| 64 | * first lesser offset |
| 65 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 66 | static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, |
| 67 | struct rb_node **prev_ret) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 68 | { |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 69 | struct rb_node *n = root->rb_node; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 70 | struct rb_node *prev = NULL; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 71 | struct rb_node *test; |
| 72 | struct btrfs_ordered_extent *entry; |
| 73 | struct btrfs_ordered_extent *prev_entry = NULL; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 74 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 75 | while (n) { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 76 | entry = rb_entry(n, struct btrfs_ordered_extent, rb_node); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 77 | prev = n; |
| 78 | prev_entry = entry; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 79 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 80 | if (file_offset < entry->file_offset) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 81 | n = n->rb_left; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 82 | else if (file_offset >= entry_end(entry)) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 83 | n = n->rb_right; |
| 84 | else |
| 85 | return n; |
| 86 | } |
| 87 | if (!prev_ret) |
| 88 | return NULL; |
| 89 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 90 | while (prev && file_offset >= entry_end(prev_entry)) { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 91 | test = rb_next(prev); |
| 92 | if (!test) |
| 93 | break; |
| 94 | prev_entry = rb_entry(test, struct btrfs_ordered_extent, |
| 95 | rb_node); |
| 96 | if (file_offset < entry_end(prev_entry)) |
| 97 | break; |
| 98 | |
| 99 | prev = test; |
| 100 | } |
| 101 | if (prev) |
| 102 | prev_entry = rb_entry(prev, struct btrfs_ordered_extent, |
| 103 | rb_node); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 104 | while (prev && file_offset < entry_end(prev_entry)) { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 105 | test = rb_prev(prev); |
| 106 | if (!test) |
| 107 | break; |
| 108 | prev_entry = rb_entry(test, struct btrfs_ordered_extent, |
| 109 | rb_node); |
| 110 | prev = test; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 111 | } |
| 112 | *prev_ret = prev; |
| 113 | return NULL; |
| 114 | } |
| 115 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 116 | /* |
| 117 | * helper to check if a given offset is inside a given entry |
| 118 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 119 | static int offset_in_entry(struct btrfs_ordered_extent *entry, u64 file_offset) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 120 | { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 121 | if (file_offset < entry->file_offset || |
| 122 | entry->file_offset + entry->len <= file_offset) |
| 123 | return 0; |
| 124 | return 1; |
| 125 | } |
| 126 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 127 | /* |
| 128 | * look find the first ordered struct that has this offset, otherwise |
| 129 | * the first one less than this offset |
| 130 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 131 | static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, |
| 132 | u64 file_offset) |
| 133 | { |
| 134 | struct rb_root *root = &tree->tree; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 135 | struct rb_node *prev; |
| 136 | struct rb_node *ret; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 137 | struct btrfs_ordered_extent *entry; |
| 138 | |
| 139 | if (tree->last) { |
| 140 | entry = rb_entry(tree->last, struct btrfs_ordered_extent, |
| 141 | rb_node); |
| 142 | if (offset_in_entry(entry, file_offset)) |
| 143 | return tree->last; |
| 144 | } |
| 145 | ret = __tree_search(root, file_offset, &prev); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 146 | if (!ret) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 147 | ret = prev; |
| 148 | if (ret) |
| 149 | tree->last = ret; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 150 | return ret; |
| 151 | } |
| 152 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 153 | /* allocate and add a new ordered_extent into the per-inode tree. |
| 154 | * file_offset is the logical offset in the file |
| 155 | * |
| 156 | * start is the disk block number of an extent already reserved in the |
| 157 | * extent allocation tree |
| 158 | * |
| 159 | * len is the length of the extent |
| 160 | * |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 161 | * The tree is given a single reference on the ordered extent that was |
| 162 | * inserted. |
| 163 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 164 | int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset, |
Yan Zheng | 80ff385 | 2008-10-30 14:20:02 -0400 | [diff] [blame] | 165 | u64 start, u64 len, u64 disk_len, int type) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 166 | { |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 167 | struct btrfs_ordered_inode_tree *tree; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 168 | struct rb_node *node; |
| 169 | struct btrfs_ordered_extent *entry; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 170 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 171 | tree = &BTRFS_I(inode)->ordered_tree; |
| 172 | entry = kzalloc(sizeof(*entry), GFP_NOFS); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 173 | if (!entry) |
| 174 | return -ENOMEM; |
| 175 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 176 | entry->file_offset = file_offset; |
| 177 | entry->start = start; |
| 178 | entry->len = len; |
Chris Mason | c8b9781 | 2008-10-29 14:49:59 -0400 | [diff] [blame] | 179 | entry->disk_len = disk_len; |
Chris Mason | 8b62b72 | 2009-09-02 16:53:46 -0400 | [diff] [blame] | 180 | entry->bytes_left = len; |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 181 | entry->inode = inode; |
Yan Zheng | d899e05 | 2008-10-30 14:25:28 -0400 | [diff] [blame] | 182 | if (type != BTRFS_ORDERED_IO_DONE && type != BTRFS_ORDERED_COMPLETE) |
Yan Zheng | 80ff385 | 2008-10-30 14:20:02 -0400 | [diff] [blame] | 183 | set_bit(type, &entry->flags); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 184 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 185 | /* one ref for the tree */ |
| 186 | atomic_set(&entry->refs, 1); |
| 187 | init_waitqueue_head(&entry->wait); |
| 188 | INIT_LIST_HEAD(&entry->list); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 189 | INIT_LIST_HEAD(&entry->root_extent_list); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 190 | |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 191 | spin_lock(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 192 | node = tree_insert(&tree->tree, file_offset, |
| 193 | &entry->rb_node); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 194 | BUG_ON(node); |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 195 | spin_unlock(&tree->lock); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 196 | |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 197 | spin_lock(&BTRFS_I(inode)->root->fs_info->ordered_extent_lock); |
| 198 | list_add_tail(&entry->root_extent_list, |
| 199 | &BTRFS_I(inode)->root->fs_info->ordered_extents); |
| 200 | spin_unlock(&BTRFS_I(inode)->root->fs_info->ordered_extent_lock); |
| 201 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 202 | BUG_ON(node); |
| 203 | return 0; |
| 204 | } |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 205 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 206 | /* |
| 207 | * Add a struct btrfs_ordered_sum into the list of checksums to be inserted |
Chris Mason | 3edf7d3 | 2008-07-18 06:17:13 -0400 | [diff] [blame] | 208 | * when an ordered extent is finished. If the list covers more than one |
| 209 | * ordered extent, it is split across multiples. |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 210 | */ |
Chris Mason | 3edf7d3 | 2008-07-18 06:17:13 -0400 | [diff] [blame] | 211 | int btrfs_add_ordered_sum(struct inode *inode, |
| 212 | struct btrfs_ordered_extent *entry, |
| 213 | struct btrfs_ordered_sum *sum) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 214 | { |
| 215 | struct btrfs_ordered_inode_tree *tree; |
Chris Mason | 1b1e213 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 216 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 217 | tree = &BTRFS_I(inode)->ordered_tree; |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 218 | spin_lock(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 219 | list_add_tail(&sum->list, &entry->list); |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 220 | spin_unlock(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 221 | return 0; |
| 222 | } |
| 223 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 224 | /* |
| 225 | * this is used to account for finished IO across a given range |
| 226 | * of the file. The IO should not span ordered extents. If |
| 227 | * a given ordered_extent is completely done, 1 is returned, otherwise |
| 228 | * 0. |
| 229 | * |
| 230 | * test_and_set_bit on a flag in the struct btrfs_ordered_extent is used |
| 231 | * to make sure this function only returns 1 once for a given ordered extent. |
| 232 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 233 | int btrfs_dec_test_ordered_pending(struct inode *inode, |
Josef Bacik | 5a1a3df | 2010-02-02 20:51:14 +0000 | [diff] [blame] | 234 | struct btrfs_ordered_extent **cached, |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 235 | u64 file_offset, u64 io_size) |
| 236 | { |
| 237 | struct btrfs_ordered_inode_tree *tree; |
| 238 | struct rb_node *node; |
Josef Bacik | 5a1a3df | 2010-02-02 20:51:14 +0000 | [diff] [blame] | 239 | struct btrfs_ordered_extent *entry = NULL; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 240 | int ret; |
| 241 | |
| 242 | tree = &BTRFS_I(inode)->ordered_tree; |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 243 | spin_lock(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 244 | node = tree_search(tree, file_offset); |
| 245 | if (!node) { |
| 246 | ret = 1; |
| 247 | goto out; |
| 248 | } |
| 249 | |
| 250 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
| 251 | if (!offset_in_entry(entry, file_offset)) { |
| 252 | ret = 1; |
| 253 | goto out; |
| 254 | } |
| 255 | |
Chris Mason | 8b62b72 | 2009-09-02 16:53:46 -0400 | [diff] [blame] | 256 | if (io_size > entry->bytes_left) { |
| 257 | printk(KERN_CRIT "bad ordered accounting left %llu size %llu\n", |
| 258 | (unsigned long long)entry->bytes_left, |
| 259 | (unsigned long long)io_size); |
| 260 | } |
| 261 | entry->bytes_left -= io_size; |
| 262 | if (entry->bytes_left == 0) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 263 | ret = test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags); |
Chris Mason | 8b62b72 | 2009-09-02 16:53:46 -0400 | [diff] [blame] | 264 | else |
| 265 | ret = 1; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 266 | out: |
Josef Bacik | 5a1a3df | 2010-02-02 20:51:14 +0000 | [diff] [blame] | 267 | if (!ret && cached && entry) { |
| 268 | *cached = entry; |
| 269 | atomic_inc(&entry->refs); |
| 270 | } |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 271 | spin_unlock(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 272 | return ret == 0; |
| 273 | } |
| 274 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 275 | /* |
| 276 | * used to drop a reference on an ordered extent. This will free |
| 277 | * the extent if the last reference is dropped |
| 278 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 279 | int btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry) |
| 280 | { |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 281 | struct list_head *cur; |
| 282 | struct btrfs_ordered_sum *sum; |
| 283 | |
| 284 | if (atomic_dec_and_test(&entry->refs)) { |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 285 | while (!list_empty(&entry->list)) { |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 286 | cur = entry->list.next; |
| 287 | sum = list_entry(cur, struct btrfs_ordered_sum, list); |
| 288 | list_del(&sum->list); |
| 289 | kfree(sum); |
| 290 | } |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 291 | kfree(entry); |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 292 | } |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 293 | return 0; |
| 294 | } |
| 295 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 296 | /* |
| 297 | * remove an ordered extent from the tree. No references are dropped |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 298 | * and you must wake_up entry->wait. You must hold the tree lock |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 299 | * while you call this function. |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 300 | */ |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 301 | static int __btrfs_remove_ordered_extent(struct inode *inode, |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 302 | struct btrfs_ordered_extent *entry) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 303 | { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 304 | struct btrfs_ordered_inode_tree *tree; |
Josef Bacik | 287a0ab | 2010-03-19 18:07:23 +0000 | [diff] [blame] | 305 | struct btrfs_root *root = BTRFS_I(inode)->root; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 306 | struct rb_node *node; |
| 307 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 308 | tree = &BTRFS_I(inode)->ordered_tree; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 309 | node = &entry->rb_node; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 310 | rb_erase(node, &tree->tree); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 311 | tree->last = NULL; |
| 312 | set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 313 | |
Josef Bacik | 287a0ab | 2010-03-19 18:07:23 +0000 | [diff] [blame] | 314 | spin_lock(&root->fs_info->ordered_extent_lock); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 315 | list_del_init(&entry->root_extent_list); |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 316 | |
| 317 | /* |
| 318 | * we have no more ordered extents for this inode and |
| 319 | * no dirty pages. We can safely remove it from the |
| 320 | * list of ordered extents |
| 321 | */ |
| 322 | if (RB_EMPTY_ROOT(&tree->tree) && |
| 323 | !mapping_tagged(inode->i_mapping, PAGECACHE_TAG_DIRTY)) { |
| 324 | list_del_init(&BTRFS_I(inode)->ordered_operations); |
| 325 | } |
Josef Bacik | 287a0ab | 2010-03-19 18:07:23 +0000 | [diff] [blame] | 326 | spin_unlock(&root->fs_info->ordered_extent_lock); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 327 | |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 328 | return 0; |
| 329 | } |
| 330 | |
| 331 | /* |
| 332 | * remove an ordered extent from the tree. No references are dropped |
| 333 | * but any waiters are woken. |
| 334 | */ |
| 335 | int btrfs_remove_ordered_extent(struct inode *inode, |
| 336 | struct btrfs_ordered_extent *entry) |
| 337 | { |
| 338 | struct btrfs_ordered_inode_tree *tree; |
| 339 | int ret; |
| 340 | |
| 341 | tree = &BTRFS_I(inode)->ordered_tree; |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 342 | spin_lock(&tree->lock); |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 343 | ret = __btrfs_remove_ordered_extent(inode, entry); |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 344 | spin_unlock(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 345 | wake_up(&entry->wait); |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 346 | |
| 347 | return ret; |
Chris Mason | 81d7ed2 | 2008-04-25 08:51:48 -0400 | [diff] [blame] | 348 | } |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 349 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 350 | /* |
| 351 | * wait for all the ordered extents in a root. This is done when balancing |
| 352 | * space between drives. |
| 353 | */ |
Yan, Zheng | 24bbcf0 | 2009-11-12 09:36:34 +0000 | [diff] [blame] | 354 | int btrfs_wait_ordered_extents(struct btrfs_root *root, |
| 355 | int nocow_only, int delay_iput) |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 356 | { |
| 357 | struct list_head splice; |
| 358 | struct list_head *cur; |
| 359 | struct btrfs_ordered_extent *ordered; |
| 360 | struct inode *inode; |
| 361 | |
| 362 | INIT_LIST_HEAD(&splice); |
| 363 | |
| 364 | spin_lock(&root->fs_info->ordered_extent_lock); |
| 365 | list_splice_init(&root->fs_info->ordered_extents, &splice); |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 366 | while (!list_empty(&splice)) { |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 367 | cur = splice.next; |
| 368 | ordered = list_entry(cur, struct btrfs_ordered_extent, |
| 369 | root_extent_list); |
Yan Zheng | 7ea394f | 2008-08-05 13:05:02 -0400 | [diff] [blame] | 370 | if (nocow_only && |
Yan Zheng | d899e05 | 2008-10-30 14:25:28 -0400 | [diff] [blame] | 371 | !test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags) && |
| 372 | !test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags)) { |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 373 | list_move(&ordered->root_extent_list, |
| 374 | &root->fs_info->ordered_extents); |
Yan Zheng | 7ea394f | 2008-08-05 13:05:02 -0400 | [diff] [blame] | 375 | cond_resched_lock(&root->fs_info->ordered_extent_lock); |
| 376 | continue; |
| 377 | } |
| 378 | |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 379 | list_del_init(&ordered->root_extent_list); |
| 380 | atomic_inc(&ordered->refs); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 381 | |
| 382 | /* |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 383 | * the inode may be getting freed (in sys_unlink path). |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 384 | */ |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 385 | inode = igrab(ordered->inode); |
| 386 | |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 387 | spin_unlock(&root->fs_info->ordered_extent_lock); |
| 388 | |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 389 | if (inode) { |
| 390 | btrfs_start_ordered_extent(inode, ordered, 1); |
| 391 | btrfs_put_ordered_extent(ordered); |
Yan, Zheng | 24bbcf0 | 2009-11-12 09:36:34 +0000 | [diff] [blame] | 392 | if (delay_iput) |
| 393 | btrfs_add_delayed_iput(inode); |
| 394 | else |
| 395 | iput(inode); |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 396 | } else { |
| 397 | btrfs_put_ordered_extent(ordered); |
| 398 | } |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 399 | |
| 400 | spin_lock(&root->fs_info->ordered_extent_lock); |
| 401 | } |
| 402 | spin_unlock(&root->fs_info->ordered_extent_lock); |
| 403 | return 0; |
| 404 | } |
| 405 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 406 | /* |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 407 | * this is used during transaction commit to write all the inodes |
| 408 | * added to the ordered operation list. These files must be fully on |
| 409 | * disk before the transaction commits. |
| 410 | * |
| 411 | * we have two modes here, one is to just start the IO via filemap_flush |
| 412 | * and the other is to wait for all the io. When we wait, we have an |
| 413 | * extra check to make sure the ordered operation list really is empty |
| 414 | * before we return |
| 415 | */ |
| 416 | int btrfs_run_ordered_operations(struct btrfs_root *root, int wait) |
| 417 | { |
| 418 | struct btrfs_inode *btrfs_inode; |
| 419 | struct inode *inode; |
| 420 | struct list_head splice; |
| 421 | |
| 422 | INIT_LIST_HEAD(&splice); |
| 423 | |
| 424 | mutex_lock(&root->fs_info->ordered_operations_mutex); |
| 425 | spin_lock(&root->fs_info->ordered_extent_lock); |
| 426 | again: |
| 427 | list_splice_init(&root->fs_info->ordered_operations, &splice); |
| 428 | |
| 429 | while (!list_empty(&splice)) { |
| 430 | btrfs_inode = list_entry(splice.next, struct btrfs_inode, |
| 431 | ordered_operations); |
| 432 | |
| 433 | inode = &btrfs_inode->vfs_inode; |
| 434 | |
| 435 | list_del_init(&btrfs_inode->ordered_operations); |
| 436 | |
| 437 | /* |
| 438 | * the inode may be getting freed (in sys_unlink path). |
| 439 | */ |
| 440 | inode = igrab(inode); |
| 441 | |
| 442 | if (!wait && inode) { |
| 443 | list_add_tail(&BTRFS_I(inode)->ordered_operations, |
| 444 | &root->fs_info->ordered_operations); |
| 445 | } |
| 446 | spin_unlock(&root->fs_info->ordered_extent_lock); |
| 447 | |
| 448 | if (inode) { |
| 449 | if (wait) |
| 450 | btrfs_wait_ordered_range(inode, 0, (u64)-1); |
| 451 | else |
| 452 | filemap_flush(inode->i_mapping); |
Yan, Zheng | 24bbcf0 | 2009-11-12 09:36:34 +0000 | [diff] [blame] | 453 | btrfs_add_delayed_iput(inode); |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 454 | } |
| 455 | |
| 456 | cond_resched(); |
| 457 | spin_lock(&root->fs_info->ordered_extent_lock); |
| 458 | } |
| 459 | if (wait && !list_empty(&root->fs_info->ordered_operations)) |
| 460 | goto again; |
| 461 | |
| 462 | spin_unlock(&root->fs_info->ordered_extent_lock); |
| 463 | mutex_unlock(&root->fs_info->ordered_operations_mutex); |
| 464 | |
| 465 | return 0; |
| 466 | } |
| 467 | |
| 468 | /* |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 469 | * Used to start IO or wait for a given ordered extent to finish. |
| 470 | * |
| 471 | * If wait is one, this effectively waits on page writeback for all the pages |
| 472 | * in the extent, and it waits on the io completion code to insert |
| 473 | * metadata into the btree corresponding to the extent |
| 474 | */ |
| 475 | void btrfs_start_ordered_extent(struct inode *inode, |
| 476 | struct btrfs_ordered_extent *entry, |
| 477 | int wait) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 478 | { |
| 479 | u64 start = entry->file_offset; |
| 480 | u64 end = start + entry->len - 1; |
| 481 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 482 | /* |
| 483 | * pages in the range can be dirty, clean or writeback. We |
| 484 | * start IO on any dirty ones so the wait doesn't stall waiting |
| 485 | * for pdflush to find them |
| 486 | */ |
Christoph Hellwig | 8aa38c3 | 2009-10-01 12:58:30 -0400 | [diff] [blame] | 487 | filemap_fdatawrite_range(inode->i_mapping, start, end); |
Chris Mason | c8b9781 | 2008-10-29 14:49:59 -0400 | [diff] [blame] | 488 | if (wait) { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 489 | wait_event(entry->wait, test_bit(BTRFS_ORDERED_COMPLETE, |
| 490 | &entry->flags)); |
Chris Mason | c8b9781 | 2008-10-29 14:49:59 -0400 | [diff] [blame] | 491 | } |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 492 | } |
| 493 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 494 | /* |
| 495 | * Used to wait on ordered extents across a large range of bytes. |
| 496 | */ |
Chris Mason | cb843a6 | 2008-10-03 12:30:02 -0400 | [diff] [blame] | 497 | int btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 498 | { |
| 499 | u64 end; |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 500 | u64 orig_end; |
| 501 | u64 wait_end; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 502 | struct btrfs_ordered_extent *ordered; |
Chris Mason | 8b62b72 | 2009-09-02 16:53:46 -0400 | [diff] [blame] | 503 | int found; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 504 | |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 505 | if (start + len < start) { |
Chris Mason | f421950 | 2008-07-22 11:18:09 -0400 | [diff] [blame] | 506 | orig_end = INT_LIMIT(loff_t); |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 507 | } else { |
| 508 | orig_end = start + len - 1; |
Chris Mason | f421950 | 2008-07-22 11:18:09 -0400 | [diff] [blame] | 509 | if (orig_end > INT_LIMIT(loff_t)) |
| 510 | orig_end = INT_LIMIT(loff_t); |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 511 | } |
Chris Mason | f421950 | 2008-07-22 11:18:09 -0400 | [diff] [blame] | 512 | wait_end = orig_end; |
Chris Mason | 4a09675 | 2008-07-21 10:29:44 -0400 | [diff] [blame] | 513 | again: |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 514 | /* start IO across the range first to instantiate any delalloc |
| 515 | * extents |
| 516 | */ |
Christoph Hellwig | 8aa38c3 | 2009-10-01 12:58:30 -0400 | [diff] [blame] | 517 | filemap_fdatawrite_range(inode->i_mapping, start, orig_end); |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 518 | |
Chris Mason | 771ed68 | 2008-11-06 22:02:51 -0500 | [diff] [blame] | 519 | /* The compression code will leave pages locked but return from |
| 520 | * writepage without setting the page writeback. Starting again |
| 521 | * with WB_SYNC_ALL will end up waiting for the IO to actually start. |
| 522 | */ |
Christoph Hellwig | 8aa38c3 | 2009-10-01 12:58:30 -0400 | [diff] [blame] | 523 | filemap_fdatawrite_range(inode->i_mapping, start, orig_end); |
Chris Mason | 771ed68 | 2008-11-06 22:02:51 -0500 | [diff] [blame] | 524 | |
Christoph Hellwig | 8aa38c3 | 2009-10-01 12:58:30 -0400 | [diff] [blame] | 525 | filemap_fdatawait_range(inode->i_mapping, start, orig_end); |
Chris Mason | f421950 | 2008-07-22 11:18:09 -0400 | [diff] [blame] | 526 | |
| 527 | end = orig_end; |
Chris Mason | 8b62b72 | 2009-09-02 16:53:46 -0400 | [diff] [blame] | 528 | found = 0; |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 529 | while (1) { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 530 | ordered = btrfs_lookup_first_ordered_extent(inode, end); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 531 | if (!ordered) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 532 | break; |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 533 | if (ordered->file_offset > orig_end) { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 534 | btrfs_put_ordered_extent(ordered); |
| 535 | break; |
| 536 | } |
| 537 | if (ordered->file_offset + ordered->len < start) { |
| 538 | btrfs_put_ordered_extent(ordered); |
| 539 | break; |
| 540 | } |
Chris Mason | 8b62b72 | 2009-09-02 16:53:46 -0400 | [diff] [blame] | 541 | found++; |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 542 | btrfs_start_ordered_extent(inode, ordered, 1); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 543 | end = ordered->file_offset; |
| 544 | btrfs_put_ordered_extent(ordered); |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 545 | if (end == 0 || end == start) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 546 | break; |
| 547 | end--; |
| 548 | } |
Chris Mason | 8b62b72 | 2009-09-02 16:53:46 -0400 | [diff] [blame] | 549 | if (found || test_range_bit(&BTRFS_I(inode)->io_tree, start, orig_end, |
| 550 | EXTENT_DELALLOC, 0, NULL)) { |
Chris Mason | 771ed68 | 2008-11-06 22:02:51 -0500 | [diff] [blame] | 551 | schedule_timeout(1); |
Chris Mason | 4a09675 | 2008-07-21 10:29:44 -0400 | [diff] [blame] | 552 | goto again; |
| 553 | } |
Chris Mason | cb843a6 | 2008-10-03 12:30:02 -0400 | [diff] [blame] | 554 | return 0; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 555 | } |
| 556 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 557 | /* |
| 558 | * find an ordered extent corresponding to file_offset. return NULL if |
| 559 | * nothing is found, otherwise take a reference on the extent and return it |
| 560 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 561 | struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode, |
| 562 | u64 file_offset) |
| 563 | { |
| 564 | struct btrfs_ordered_inode_tree *tree; |
| 565 | struct rb_node *node; |
| 566 | struct btrfs_ordered_extent *entry = NULL; |
| 567 | |
| 568 | tree = &BTRFS_I(inode)->ordered_tree; |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 569 | spin_lock(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 570 | node = tree_search(tree, file_offset); |
| 571 | if (!node) |
| 572 | goto out; |
| 573 | |
| 574 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
| 575 | if (!offset_in_entry(entry, file_offset)) |
| 576 | entry = NULL; |
| 577 | if (entry) |
| 578 | atomic_inc(&entry->refs); |
| 579 | out: |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 580 | spin_unlock(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 581 | return entry; |
| 582 | } |
| 583 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 584 | /* |
| 585 | * lookup and return any extent before 'file_offset'. NULL is returned |
| 586 | * if none is found |
| 587 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 588 | struct btrfs_ordered_extent * |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 589 | btrfs_lookup_first_ordered_extent(struct inode *inode, u64 file_offset) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 590 | { |
| 591 | struct btrfs_ordered_inode_tree *tree; |
| 592 | struct rb_node *node; |
| 593 | struct btrfs_ordered_extent *entry = NULL; |
| 594 | |
| 595 | tree = &BTRFS_I(inode)->ordered_tree; |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 596 | spin_lock(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 597 | node = tree_search(tree, file_offset); |
| 598 | if (!node) |
| 599 | goto out; |
| 600 | |
| 601 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
| 602 | atomic_inc(&entry->refs); |
| 603 | out: |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 604 | spin_unlock(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 605 | return entry; |
| 606 | } |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 607 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 608 | /* |
| 609 | * After an extent is done, call this to conditionally update the on disk |
| 610 | * i_size. i_size is updated to cover any fully written part of the file. |
| 611 | */ |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 612 | int btrfs_ordered_update_i_size(struct inode *inode, u64 offset, |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 613 | struct btrfs_ordered_extent *ordered) |
| 614 | { |
| 615 | struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree; |
| 616 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
| 617 | u64 disk_i_size; |
| 618 | u64 new_i_size; |
| 619 | u64 i_size_test; |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 620 | u64 i_size = i_size_read(inode); |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 621 | struct rb_node *node; |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 622 | struct rb_node *prev = NULL; |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 623 | struct btrfs_ordered_extent *test; |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 624 | int ret = 1; |
| 625 | |
| 626 | if (ordered) |
| 627 | offset = entry_end(ordered); |
Yan, Zheng | a038fab0 | 2009-12-28 05:01:58 +0000 | [diff] [blame] | 628 | else |
| 629 | offset = ALIGN(offset, BTRFS_I(inode)->root->sectorsize); |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 630 | |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 631 | spin_lock(&tree->lock); |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 632 | disk_i_size = BTRFS_I(inode)->disk_i_size; |
| 633 | |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 634 | /* truncate file */ |
| 635 | if (disk_i_size > i_size) { |
| 636 | BTRFS_I(inode)->disk_i_size = i_size; |
| 637 | ret = 0; |
| 638 | goto out; |
| 639 | } |
| 640 | |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 641 | /* |
| 642 | * if the disk i_size is already at the inode->i_size, or |
| 643 | * this ordered extent is inside the disk i_size, we're done |
| 644 | */ |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 645 | if (disk_i_size == i_size || offset <= disk_i_size) { |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 646 | goto out; |
| 647 | } |
| 648 | |
| 649 | /* |
| 650 | * we can't update the disk_isize if there are delalloc bytes |
| 651 | * between disk_i_size and this ordered extent |
| 652 | */ |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 653 | if (test_range_bit(io_tree, disk_i_size, offset - 1, |
Chris Mason | 9655d29 | 2009-09-02 15:22:30 -0400 | [diff] [blame] | 654 | EXTENT_DELALLOC, 0, NULL)) { |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 655 | goto out; |
| 656 | } |
| 657 | /* |
| 658 | * walk backward from this ordered extent to disk_i_size. |
| 659 | * if we find an ordered extent then we can't update disk i_size |
| 660 | * yet |
| 661 | */ |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 662 | if (ordered) { |
| 663 | node = rb_prev(&ordered->rb_node); |
| 664 | } else { |
| 665 | prev = tree_search(tree, offset); |
| 666 | /* |
| 667 | * we insert file extents without involving ordered struct, |
| 668 | * so there should be no ordered struct cover this offset |
| 669 | */ |
| 670 | if (prev) { |
| 671 | test = rb_entry(prev, struct btrfs_ordered_extent, |
| 672 | rb_node); |
| 673 | BUG_ON(offset_in_entry(test, offset)); |
| 674 | } |
| 675 | node = prev; |
| 676 | } |
| 677 | while (node) { |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 678 | test = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
| 679 | if (test->file_offset + test->len <= disk_i_size) |
| 680 | break; |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 681 | if (test->file_offset >= i_size) |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 682 | break; |
| 683 | if (test->file_offset >= disk_i_size) |
| 684 | goto out; |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 685 | node = rb_prev(node); |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 686 | } |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 687 | new_i_size = min_t(u64, offset, i_size); |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 688 | |
| 689 | /* |
| 690 | * at this point, we know we can safely update i_size to at least |
| 691 | * the offset from this ordered extent. But, we need to |
| 692 | * walk forward and see if ios from higher up in the file have |
| 693 | * finished. |
| 694 | */ |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 695 | if (ordered) { |
| 696 | node = rb_next(&ordered->rb_node); |
| 697 | } else { |
| 698 | if (prev) |
| 699 | node = rb_next(prev); |
| 700 | else |
| 701 | node = rb_first(&tree->tree); |
| 702 | } |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 703 | i_size_test = 0; |
| 704 | if (node) { |
| 705 | /* |
| 706 | * do we have an area where IO might have finished |
| 707 | * between our ordered extent and the next one. |
| 708 | */ |
| 709 | test = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 710 | if (test->file_offset > offset) |
Yan Zheng | b48652c | 2008-08-04 23:23:47 -0400 | [diff] [blame] | 711 | i_size_test = test->file_offset; |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 712 | } else { |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 713 | i_size_test = i_size; |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 714 | } |
| 715 | |
| 716 | /* |
| 717 | * i_size_test is the end of a region after this ordered |
| 718 | * extent where there are no ordered extents. As long as there |
| 719 | * are no delalloc bytes in this area, it is safe to update |
| 720 | * disk_i_size to the end of the region. |
| 721 | */ |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 722 | if (i_size_test > offset && |
| 723 | !test_range_bit(io_tree, offset, i_size_test - 1, |
| 724 | EXTENT_DELALLOC, 0, NULL)) { |
| 725 | new_i_size = min_t(u64, i_size_test, i_size); |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 726 | } |
| 727 | BTRFS_I(inode)->disk_i_size = new_i_size; |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 728 | ret = 0; |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 729 | out: |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 730 | /* |
| 731 | * we need to remove the ordered extent with the tree lock held |
| 732 | * so that other people calling this function don't find our fully |
| 733 | * processed ordered entry and skip updating the i_size |
| 734 | */ |
| 735 | if (ordered) |
| 736 | __btrfs_remove_ordered_extent(inode, ordered); |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 737 | spin_unlock(&tree->lock); |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 738 | if (ordered) |
| 739 | wake_up(&ordered->wait); |
| 740 | return ret; |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 741 | } |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 742 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 743 | /* |
| 744 | * search the ordered extents for one corresponding to 'offset' and |
| 745 | * try to find a checksum. This is used because we allow pages to |
| 746 | * be reclaimed before their checksum is actually put into the btree |
| 747 | */ |
Chris Mason | d20f704 | 2008-12-08 16:58:54 -0500 | [diff] [blame] | 748 | int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u64 disk_bytenr, |
| 749 | u32 *sum) |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 750 | { |
| 751 | struct btrfs_ordered_sum *ordered_sum; |
| 752 | struct btrfs_sector_sum *sector_sums; |
| 753 | struct btrfs_ordered_extent *ordered; |
| 754 | struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree; |
Chris Mason | 3edf7d3 | 2008-07-18 06:17:13 -0400 | [diff] [blame] | 755 | unsigned long num_sectors; |
| 756 | unsigned long i; |
| 757 | u32 sectorsize = BTRFS_I(inode)->root->sectorsize; |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 758 | int ret = 1; |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 759 | |
| 760 | ordered = btrfs_lookup_ordered_extent(inode, offset); |
| 761 | if (!ordered) |
| 762 | return 1; |
| 763 | |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 764 | spin_lock(&tree->lock); |
Qinghuang Feng | c6e3087 | 2009-01-21 10:59:08 -0500 | [diff] [blame] | 765 | list_for_each_entry_reverse(ordered_sum, &ordered->list, list) { |
Chris Mason | d20f704 | 2008-12-08 16:58:54 -0500 | [diff] [blame] | 766 | if (disk_bytenr >= ordered_sum->bytenr) { |
Chris Mason | 3edf7d3 | 2008-07-18 06:17:13 -0400 | [diff] [blame] | 767 | num_sectors = ordered_sum->len / sectorsize; |
Chris Mason | ed98b56 | 2008-07-22 23:06:42 -0400 | [diff] [blame] | 768 | sector_sums = ordered_sum->sums; |
Chris Mason | 3edf7d3 | 2008-07-18 06:17:13 -0400 | [diff] [blame] | 769 | for (i = 0; i < num_sectors; i++) { |
Chris Mason | d20f704 | 2008-12-08 16:58:54 -0500 | [diff] [blame] | 770 | if (sector_sums[i].bytenr == disk_bytenr) { |
Chris Mason | 3edf7d3 | 2008-07-18 06:17:13 -0400 | [diff] [blame] | 771 | *sum = sector_sums[i].sum; |
| 772 | ret = 0; |
| 773 | goto out; |
| 774 | } |
| 775 | } |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 776 | } |
| 777 | } |
| 778 | out: |
Josef Bacik | 49958fd | 2010-02-02 21:48:28 +0000 | [diff] [blame] | 779 | spin_unlock(&tree->lock); |
Chris Mason | 8964222 | 2008-07-24 09:41:53 -0400 | [diff] [blame] | 780 | btrfs_put_ordered_extent(ordered); |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 781 | return ret; |
| 782 | } |
| 783 | |
Chris Mason | f421950 | 2008-07-22 11:18:09 -0400 | [diff] [blame] | 784 | |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 785 | /* |
| 786 | * add a given inode to the list of inodes that must be fully on |
| 787 | * disk before a transaction commit finishes. |
| 788 | * |
| 789 | * This basically gives us the ext3 style data=ordered mode, and it is mostly |
| 790 | * used to make sure renamed files are fully on disk. |
| 791 | * |
| 792 | * It is a noop if the inode is already fully on disk. |
| 793 | * |
| 794 | * If trans is not null, we'll do a friendly check for a transaction that |
| 795 | * is already flushing things and force the IO down ourselves. |
| 796 | */ |
| 797 | int btrfs_add_ordered_operation(struct btrfs_trans_handle *trans, |
| 798 | struct btrfs_root *root, |
| 799 | struct inode *inode) |
| 800 | { |
| 801 | u64 last_mod; |
| 802 | |
| 803 | last_mod = max(BTRFS_I(inode)->generation, BTRFS_I(inode)->last_trans); |
| 804 | |
| 805 | /* |
| 806 | * if this file hasn't been changed since the last transaction |
| 807 | * commit, we can safely return without doing anything |
| 808 | */ |
| 809 | if (last_mod < root->fs_info->last_trans_committed) |
| 810 | return 0; |
| 811 | |
| 812 | /* |
| 813 | * the transaction is already committing. Just start the IO and |
| 814 | * don't bother with all of this list nonsense |
| 815 | */ |
| 816 | if (trans && root->fs_info->running_transaction->blocked) { |
| 817 | btrfs_wait_ordered_range(inode, 0, (u64)-1); |
| 818 | return 0; |
| 819 | } |
| 820 | |
| 821 | spin_lock(&root->fs_info->ordered_extent_lock); |
| 822 | if (list_empty(&BTRFS_I(inode)->ordered_operations)) { |
| 823 | list_add_tail(&BTRFS_I(inode)->ordered_operations, |
| 824 | &root->fs_info->ordered_operations); |
| 825 | } |
| 826 | spin_unlock(&root->fs_info->ordered_extent_lock); |
| 827 | |
| 828 | return 0; |
| 829 | } |