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 | |
Miao Xie | 6352b91 | 2012-09-06 04:01:51 -0600 | [diff] [blame] | 28 | static struct kmem_cache *btrfs_ordered_extent_cache; |
| 29 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 30 | static u64 entry_end(struct btrfs_ordered_extent *entry) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 31 | { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 32 | if (entry->file_offset + entry->len < entry->file_offset) |
| 33 | return (u64)-1; |
| 34 | return entry->file_offset + entry->len; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 35 | } |
| 36 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 37 | /* returns NULL if the insertion worked, or it returns the node it did find |
| 38 | * in the tree |
| 39 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 40 | static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, |
| 41 | struct rb_node *node) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 42 | { |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 43 | struct rb_node **p = &root->rb_node; |
| 44 | struct rb_node *parent = NULL; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 45 | struct btrfs_ordered_extent *entry; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 46 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 47 | while (*p) { |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 48 | parent = *p; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 49 | entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 50 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 51 | if (file_offset < entry->file_offset) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 52 | p = &(*p)->rb_left; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 53 | else if (file_offset >= entry_end(entry)) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 54 | p = &(*p)->rb_right; |
| 55 | else |
| 56 | return parent; |
| 57 | } |
| 58 | |
| 59 | rb_link_node(node, parent, p); |
| 60 | rb_insert_color(node, root); |
| 61 | return NULL; |
| 62 | } |
| 63 | |
Jeff Mahoney | 43c04fb | 2011-10-03 23:22:33 -0400 | [diff] [blame] | 64 | static void ordered_data_tree_panic(struct inode *inode, int errno, |
| 65 | u64 offset) |
| 66 | { |
| 67 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb); |
| 68 | btrfs_panic(fs_info, errno, "Inconsistency in ordered tree at offset " |
| 69 | "%llu\n", (unsigned long long)offset); |
| 70 | } |
| 71 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 72 | /* |
| 73 | * look for a given offset in the tree, and if it can't be found return the |
| 74 | * first lesser offset |
| 75 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 76 | static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, |
| 77 | struct rb_node **prev_ret) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 78 | { |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 79 | struct rb_node *n = root->rb_node; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 80 | struct rb_node *prev = NULL; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 81 | struct rb_node *test; |
| 82 | struct btrfs_ordered_extent *entry; |
| 83 | struct btrfs_ordered_extent *prev_entry = NULL; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 84 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 85 | while (n) { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 86 | entry = rb_entry(n, struct btrfs_ordered_extent, rb_node); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 87 | prev = n; |
| 88 | prev_entry = entry; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 89 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 90 | if (file_offset < entry->file_offset) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 91 | n = n->rb_left; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 92 | else if (file_offset >= entry_end(entry)) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 93 | n = n->rb_right; |
| 94 | else |
| 95 | return n; |
| 96 | } |
| 97 | if (!prev_ret) |
| 98 | return NULL; |
| 99 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 100 | while (prev && file_offset >= entry_end(prev_entry)) { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 101 | test = rb_next(prev); |
| 102 | if (!test) |
| 103 | break; |
| 104 | prev_entry = rb_entry(test, struct btrfs_ordered_extent, |
| 105 | rb_node); |
| 106 | if (file_offset < entry_end(prev_entry)) |
| 107 | break; |
| 108 | |
| 109 | prev = test; |
| 110 | } |
| 111 | if (prev) |
| 112 | prev_entry = rb_entry(prev, struct btrfs_ordered_extent, |
| 113 | rb_node); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 114 | while (prev && file_offset < entry_end(prev_entry)) { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 115 | test = rb_prev(prev); |
| 116 | if (!test) |
| 117 | break; |
| 118 | prev_entry = rb_entry(test, struct btrfs_ordered_extent, |
| 119 | rb_node); |
| 120 | prev = test; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 121 | } |
| 122 | *prev_ret = prev; |
| 123 | return NULL; |
| 124 | } |
| 125 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 126 | /* |
| 127 | * helper to check if a given offset is inside a given entry |
| 128 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 129 | 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] | 130 | { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 131 | if (file_offset < entry->file_offset || |
| 132 | entry->file_offset + entry->len <= file_offset) |
| 133 | return 0; |
| 134 | return 1; |
| 135 | } |
| 136 | |
Josef Bacik | 4b46fce | 2010-05-23 11:00:55 -0400 | [diff] [blame] | 137 | static int range_overlaps(struct btrfs_ordered_extent *entry, u64 file_offset, |
| 138 | u64 len) |
| 139 | { |
| 140 | if (file_offset + len <= entry->file_offset || |
| 141 | entry->file_offset + entry->len <= file_offset) |
| 142 | return 0; |
| 143 | return 1; |
| 144 | } |
| 145 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 146 | /* |
| 147 | * look find the first ordered struct that has this offset, otherwise |
| 148 | * the first one less than this offset |
| 149 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 150 | static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, |
| 151 | u64 file_offset) |
| 152 | { |
| 153 | struct rb_root *root = &tree->tree; |
Chris Mason | c87fb6f | 2011-01-31 19:54:59 -0500 | [diff] [blame] | 154 | struct rb_node *prev = NULL; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 155 | struct rb_node *ret; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 156 | struct btrfs_ordered_extent *entry; |
| 157 | |
| 158 | if (tree->last) { |
| 159 | entry = rb_entry(tree->last, struct btrfs_ordered_extent, |
| 160 | rb_node); |
| 161 | if (offset_in_entry(entry, file_offset)) |
| 162 | return tree->last; |
| 163 | } |
| 164 | ret = __tree_search(root, file_offset, &prev); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 165 | if (!ret) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 166 | ret = prev; |
| 167 | if (ret) |
| 168 | tree->last = ret; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 169 | return ret; |
| 170 | } |
| 171 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 172 | /* allocate and add a new ordered_extent into the per-inode tree. |
| 173 | * file_offset is the logical offset in the file |
| 174 | * |
| 175 | * start is the disk block number of an extent already reserved in the |
| 176 | * extent allocation tree |
| 177 | * |
| 178 | * len is the length of the extent |
| 179 | * |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 180 | * The tree is given a single reference on the ordered extent that was |
| 181 | * inserted. |
| 182 | */ |
Josef Bacik | 4b46fce | 2010-05-23 11:00:55 -0400 | [diff] [blame] | 183 | static int __btrfs_add_ordered_extent(struct inode *inode, u64 file_offset, |
| 184 | u64 start, u64 len, u64 disk_len, |
Li Zefan | 261507a0 | 2010-12-17 14:21:50 +0800 | [diff] [blame] | 185 | int type, int dio, int compress_type) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 186 | { |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 187 | struct btrfs_ordered_inode_tree *tree; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 188 | struct rb_node *node; |
| 189 | struct btrfs_ordered_extent *entry; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 190 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 191 | tree = &BTRFS_I(inode)->ordered_tree; |
Miao Xie | 6352b91 | 2012-09-06 04:01:51 -0600 | [diff] [blame] | 192 | entry = kmem_cache_zalloc(btrfs_ordered_extent_cache, GFP_NOFS); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 193 | if (!entry) |
| 194 | return -ENOMEM; |
| 195 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 196 | entry->file_offset = file_offset; |
| 197 | entry->start = start; |
| 198 | entry->len = len; |
Josef Bacik | 2ab28f3 | 2012-10-12 15:27:49 -0400 | [diff] [blame] | 199 | if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM) && |
| 200 | !(type == BTRFS_ORDERED_NOCOW)) |
| 201 | entry->csum_bytes_left = disk_len; |
Chris Mason | c8b9781 | 2008-10-29 14:49:59 -0400 | [diff] [blame] | 202 | entry->disk_len = disk_len; |
Chris Mason | 8b62b72 | 2009-09-02 16:53:46 -0400 | [diff] [blame] | 203 | entry->bytes_left = len; |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 204 | entry->inode = igrab(inode); |
Li Zefan | 261507a0 | 2010-12-17 14:21:50 +0800 | [diff] [blame] | 205 | entry->compress_type = compress_type; |
Yan Zheng | d899e05 | 2008-10-30 14:25:28 -0400 | [diff] [blame] | 206 | if (type != BTRFS_ORDERED_IO_DONE && type != BTRFS_ORDERED_COMPLETE) |
Yan Zheng | 80ff385 | 2008-10-30 14:20:02 -0400 | [diff] [blame] | 207 | set_bit(type, &entry->flags); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 208 | |
Josef Bacik | 4b46fce | 2010-05-23 11:00:55 -0400 | [diff] [blame] | 209 | if (dio) |
| 210 | set_bit(BTRFS_ORDERED_DIRECT, &entry->flags); |
| 211 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 212 | /* one ref for the tree */ |
| 213 | atomic_set(&entry->refs, 1); |
| 214 | init_waitqueue_head(&entry->wait); |
| 215 | INIT_LIST_HEAD(&entry->list); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 216 | INIT_LIST_HEAD(&entry->root_extent_list); |
Miao Xie | 9afab88 | 2012-10-25 09:41:36 +0000 | [diff] [blame] | 217 | INIT_LIST_HEAD(&entry->work_list); |
| 218 | init_completion(&entry->completion); |
Josef Bacik | 2ab28f3 | 2012-10-12 15:27:49 -0400 | [diff] [blame] | 219 | INIT_LIST_HEAD(&entry->log_list); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 220 | |
liubo | 1abe9b8 | 2011-03-24 11:18:59 +0000 | [diff] [blame] | 221 | trace_btrfs_ordered_extent_add(inode, entry); |
| 222 | |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 223 | spin_lock_irq(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 224 | node = tree_insert(&tree->tree, file_offset, |
| 225 | &entry->rb_node); |
Jeff Mahoney | 43c04fb | 2011-10-03 23:22:33 -0400 | [diff] [blame] | 226 | if (node) |
| 227 | ordered_data_tree_panic(inode, -EEXIST, file_offset); |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 228 | spin_unlock_irq(&tree->lock); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 229 | |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 230 | spin_lock(&BTRFS_I(inode)->root->fs_info->ordered_extent_lock); |
| 231 | list_add_tail(&entry->root_extent_list, |
| 232 | &BTRFS_I(inode)->root->fs_info->ordered_extents); |
| 233 | spin_unlock(&BTRFS_I(inode)->root->fs_info->ordered_extent_lock); |
| 234 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 235 | return 0; |
| 236 | } |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 237 | |
Josef Bacik | 4b46fce | 2010-05-23 11:00:55 -0400 | [diff] [blame] | 238 | int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset, |
| 239 | u64 start, u64 len, u64 disk_len, int type) |
| 240 | { |
| 241 | return __btrfs_add_ordered_extent(inode, file_offset, start, len, |
Li Zefan | 261507a0 | 2010-12-17 14:21:50 +0800 | [diff] [blame] | 242 | disk_len, type, 0, |
| 243 | BTRFS_COMPRESS_NONE); |
Josef Bacik | 4b46fce | 2010-05-23 11:00:55 -0400 | [diff] [blame] | 244 | } |
| 245 | |
| 246 | int btrfs_add_ordered_extent_dio(struct inode *inode, u64 file_offset, |
| 247 | u64 start, u64 len, u64 disk_len, int type) |
| 248 | { |
| 249 | return __btrfs_add_ordered_extent(inode, file_offset, start, len, |
Li Zefan | 261507a0 | 2010-12-17 14:21:50 +0800 | [diff] [blame] | 250 | disk_len, type, 1, |
| 251 | BTRFS_COMPRESS_NONE); |
| 252 | } |
| 253 | |
| 254 | int btrfs_add_ordered_extent_compress(struct inode *inode, u64 file_offset, |
| 255 | u64 start, u64 len, u64 disk_len, |
| 256 | int type, int compress_type) |
| 257 | { |
| 258 | return __btrfs_add_ordered_extent(inode, file_offset, start, len, |
| 259 | disk_len, type, 0, |
| 260 | compress_type); |
Josef Bacik | 4b46fce | 2010-05-23 11:00:55 -0400 | [diff] [blame] | 261 | } |
| 262 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 263 | /* |
| 264 | * 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] | 265 | * when an ordered extent is finished. If the list covers more than one |
| 266 | * ordered extent, it is split across multiples. |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 267 | */ |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 268 | void btrfs_add_ordered_sum(struct inode *inode, |
| 269 | struct btrfs_ordered_extent *entry, |
| 270 | struct btrfs_ordered_sum *sum) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 271 | { |
| 272 | struct btrfs_ordered_inode_tree *tree; |
Chris Mason | 1b1e213 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 273 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 274 | tree = &BTRFS_I(inode)->ordered_tree; |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 275 | spin_lock_irq(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 276 | list_add_tail(&sum->list, &entry->list); |
Josef Bacik | 2ab28f3 | 2012-10-12 15:27:49 -0400 | [diff] [blame] | 277 | WARN_ON(entry->csum_bytes_left < sum->len); |
| 278 | entry->csum_bytes_left -= sum->len; |
| 279 | if (entry->csum_bytes_left == 0) |
| 280 | wake_up(&entry->wait); |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 281 | spin_unlock_irq(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 282 | } |
| 283 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 284 | /* |
| 285 | * this is used to account for finished IO across a given range |
Chris Mason | 163cf09 | 2010-11-28 19:56:33 -0500 | [diff] [blame] | 286 | * of the file. The IO may span ordered extents. If |
| 287 | * a given ordered_extent is completely done, 1 is returned, otherwise |
| 288 | * 0. |
| 289 | * |
| 290 | * test_and_set_bit on a flag in the struct btrfs_ordered_extent is used |
| 291 | * to make sure this function only returns 1 once for a given ordered extent. |
| 292 | * |
| 293 | * file_offset is updated to one byte past the range that is recorded as |
| 294 | * complete. This allows you to walk forward in the file. |
| 295 | */ |
| 296 | int btrfs_dec_test_first_ordered_pending(struct inode *inode, |
| 297 | struct btrfs_ordered_extent **cached, |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 298 | u64 *file_offset, u64 io_size, int uptodate) |
Chris Mason | 163cf09 | 2010-11-28 19:56:33 -0500 | [diff] [blame] | 299 | { |
| 300 | struct btrfs_ordered_inode_tree *tree; |
| 301 | struct rb_node *node; |
| 302 | struct btrfs_ordered_extent *entry = NULL; |
| 303 | int ret; |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 304 | unsigned long flags; |
Chris Mason | 163cf09 | 2010-11-28 19:56:33 -0500 | [diff] [blame] | 305 | u64 dec_end; |
| 306 | u64 dec_start; |
| 307 | u64 to_dec; |
| 308 | |
| 309 | tree = &BTRFS_I(inode)->ordered_tree; |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 310 | spin_lock_irqsave(&tree->lock, flags); |
Chris Mason | 163cf09 | 2010-11-28 19:56:33 -0500 | [diff] [blame] | 311 | node = tree_search(tree, *file_offset); |
| 312 | if (!node) { |
| 313 | ret = 1; |
| 314 | goto out; |
| 315 | } |
| 316 | |
| 317 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
| 318 | if (!offset_in_entry(entry, *file_offset)) { |
| 319 | ret = 1; |
| 320 | goto out; |
| 321 | } |
| 322 | |
| 323 | dec_start = max(*file_offset, entry->file_offset); |
| 324 | dec_end = min(*file_offset + io_size, entry->file_offset + |
| 325 | entry->len); |
| 326 | *file_offset = dec_end; |
| 327 | if (dec_start > dec_end) { |
| 328 | printk(KERN_CRIT "bad ordering dec_start %llu end %llu\n", |
| 329 | (unsigned long long)dec_start, |
| 330 | (unsigned long long)dec_end); |
| 331 | } |
| 332 | to_dec = dec_end - dec_start; |
| 333 | if (to_dec > entry->bytes_left) { |
| 334 | printk(KERN_CRIT "bad ordered accounting left %llu size %llu\n", |
| 335 | (unsigned long long)entry->bytes_left, |
| 336 | (unsigned long long)to_dec); |
| 337 | } |
| 338 | entry->bytes_left -= to_dec; |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 339 | if (!uptodate) |
| 340 | set_bit(BTRFS_ORDERED_IOERR, &entry->flags); |
| 341 | |
Chris Mason | 163cf09 | 2010-11-28 19:56:33 -0500 | [diff] [blame] | 342 | if (entry->bytes_left == 0) |
| 343 | ret = test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags); |
| 344 | else |
| 345 | ret = 1; |
| 346 | out: |
| 347 | if (!ret && cached && entry) { |
| 348 | *cached = entry; |
| 349 | atomic_inc(&entry->refs); |
| 350 | } |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 351 | spin_unlock_irqrestore(&tree->lock, flags); |
Chris Mason | 163cf09 | 2010-11-28 19:56:33 -0500 | [diff] [blame] | 352 | return ret == 0; |
| 353 | } |
| 354 | |
| 355 | /* |
| 356 | * this is used to account for finished IO across a given range |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 357 | * of the file. The IO should not span ordered extents. If |
| 358 | * a given ordered_extent is completely done, 1 is returned, otherwise |
| 359 | * 0. |
| 360 | * |
| 361 | * test_and_set_bit on a flag in the struct btrfs_ordered_extent is used |
| 362 | * to make sure this function only returns 1 once for a given ordered extent. |
| 363 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 364 | int btrfs_dec_test_ordered_pending(struct inode *inode, |
Josef Bacik | 5a1a3df | 2010-02-02 20:51:14 +0000 | [diff] [blame] | 365 | struct btrfs_ordered_extent **cached, |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 366 | u64 file_offset, u64 io_size, int uptodate) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 367 | { |
| 368 | struct btrfs_ordered_inode_tree *tree; |
| 369 | struct rb_node *node; |
Josef Bacik | 5a1a3df | 2010-02-02 20:51:14 +0000 | [diff] [blame] | 370 | struct btrfs_ordered_extent *entry = NULL; |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 371 | unsigned long flags; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 372 | int ret; |
| 373 | |
| 374 | tree = &BTRFS_I(inode)->ordered_tree; |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 375 | spin_lock_irqsave(&tree->lock, flags); |
| 376 | if (cached && *cached) { |
| 377 | entry = *cached; |
| 378 | goto have_entry; |
| 379 | } |
| 380 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 381 | node = tree_search(tree, file_offset); |
| 382 | if (!node) { |
| 383 | ret = 1; |
| 384 | goto out; |
| 385 | } |
| 386 | |
| 387 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 388 | have_entry: |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 389 | if (!offset_in_entry(entry, file_offset)) { |
| 390 | ret = 1; |
| 391 | goto out; |
| 392 | } |
| 393 | |
Chris Mason | 8b62b72 | 2009-09-02 16:53:46 -0400 | [diff] [blame] | 394 | if (io_size > entry->bytes_left) { |
| 395 | printk(KERN_CRIT "bad ordered accounting left %llu size %llu\n", |
| 396 | (unsigned long long)entry->bytes_left, |
| 397 | (unsigned long long)io_size); |
| 398 | } |
| 399 | entry->bytes_left -= io_size; |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 400 | if (!uptodate) |
| 401 | set_bit(BTRFS_ORDERED_IOERR, &entry->flags); |
| 402 | |
Chris Mason | 8b62b72 | 2009-09-02 16:53:46 -0400 | [diff] [blame] | 403 | if (entry->bytes_left == 0) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 404 | ret = test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags); |
Chris Mason | 8b62b72 | 2009-09-02 16:53:46 -0400 | [diff] [blame] | 405 | else |
| 406 | ret = 1; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 407 | out: |
Josef Bacik | 5a1a3df | 2010-02-02 20:51:14 +0000 | [diff] [blame] | 408 | if (!ret && cached && entry) { |
| 409 | *cached = entry; |
| 410 | atomic_inc(&entry->refs); |
| 411 | } |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 412 | spin_unlock_irqrestore(&tree->lock, flags); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 413 | return ret == 0; |
| 414 | } |
| 415 | |
Josef Bacik | 2ab28f3 | 2012-10-12 15:27:49 -0400 | [diff] [blame] | 416 | /* Needs to either be called under a log transaction or the log_mutex */ |
| 417 | void btrfs_get_logged_extents(struct btrfs_root *log, struct inode *inode) |
| 418 | { |
| 419 | struct btrfs_ordered_inode_tree *tree; |
| 420 | struct btrfs_ordered_extent *ordered; |
| 421 | struct rb_node *n; |
| 422 | int index = log->log_transid % 2; |
| 423 | |
| 424 | tree = &BTRFS_I(inode)->ordered_tree; |
| 425 | spin_lock_irq(&tree->lock); |
| 426 | for (n = rb_first(&tree->tree); n; n = rb_next(n)) { |
| 427 | ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node); |
| 428 | spin_lock(&log->log_extents_lock[index]); |
| 429 | if (list_empty(&ordered->log_list)) { |
| 430 | list_add_tail(&ordered->log_list, &log->logged_list[index]); |
| 431 | atomic_inc(&ordered->refs); |
| 432 | } |
| 433 | spin_unlock(&log->log_extents_lock[index]); |
| 434 | } |
| 435 | spin_unlock_irq(&tree->lock); |
| 436 | } |
| 437 | |
| 438 | void btrfs_wait_logged_extents(struct btrfs_root *log, u64 transid) |
| 439 | { |
| 440 | struct btrfs_ordered_extent *ordered; |
| 441 | int index = transid % 2; |
| 442 | |
| 443 | spin_lock_irq(&log->log_extents_lock[index]); |
| 444 | while (!list_empty(&log->logged_list[index])) { |
| 445 | ordered = list_first_entry(&log->logged_list[index], |
| 446 | struct btrfs_ordered_extent, |
| 447 | log_list); |
| 448 | list_del_init(&ordered->log_list); |
| 449 | spin_unlock_irq(&log->log_extents_lock[index]); |
| 450 | wait_event(ordered->wait, test_bit(BTRFS_ORDERED_IO_DONE, |
| 451 | &ordered->flags)); |
| 452 | btrfs_put_ordered_extent(ordered); |
| 453 | spin_lock_irq(&log->log_extents_lock[index]); |
| 454 | } |
| 455 | spin_unlock_irq(&log->log_extents_lock[index]); |
| 456 | } |
| 457 | |
| 458 | void btrfs_free_logged_extents(struct btrfs_root *log, u64 transid) |
| 459 | { |
| 460 | struct btrfs_ordered_extent *ordered; |
| 461 | int index = transid % 2; |
| 462 | |
| 463 | spin_lock_irq(&log->log_extents_lock[index]); |
| 464 | while (!list_empty(&log->logged_list[index])) { |
| 465 | ordered = list_first_entry(&log->logged_list[index], |
| 466 | struct btrfs_ordered_extent, |
| 467 | log_list); |
| 468 | list_del_init(&ordered->log_list); |
| 469 | spin_unlock_irq(&log->log_extents_lock[index]); |
| 470 | btrfs_put_ordered_extent(ordered); |
| 471 | spin_lock_irq(&log->log_extents_lock[index]); |
| 472 | } |
| 473 | spin_unlock_irq(&log->log_extents_lock[index]); |
| 474 | } |
| 475 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 476 | /* |
| 477 | * used to drop a reference on an ordered extent. This will free |
| 478 | * the extent if the last reference is dropped |
| 479 | */ |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 480 | void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 481 | { |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 482 | struct list_head *cur; |
| 483 | struct btrfs_ordered_sum *sum; |
| 484 | |
liubo | 1abe9b8 | 2011-03-24 11:18:59 +0000 | [diff] [blame] | 485 | trace_btrfs_ordered_extent_put(entry->inode, entry); |
| 486 | |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 487 | if (atomic_dec_and_test(&entry->refs)) { |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 488 | if (entry->inode) |
| 489 | btrfs_add_delayed_iput(entry->inode); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 490 | while (!list_empty(&entry->list)) { |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 491 | cur = entry->list.next; |
| 492 | sum = list_entry(cur, struct btrfs_ordered_sum, list); |
| 493 | list_del(&sum->list); |
| 494 | kfree(sum); |
| 495 | } |
Miao Xie | 6352b91 | 2012-09-06 04:01:51 -0600 | [diff] [blame] | 496 | kmem_cache_free(btrfs_ordered_extent_cache, entry); |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 497 | } |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 498 | } |
| 499 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 500 | /* |
| 501 | * remove an ordered extent from the tree. No references are dropped |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 502 | * and waiters are woken up. |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 503 | */ |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 504 | void btrfs_remove_ordered_extent(struct inode *inode, |
| 505 | struct btrfs_ordered_extent *entry) |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 506 | { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 507 | struct btrfs_ordered_inode_tree *tree; |
Josef Bacik | 287a0ab | 2010-03-19 18:07:23 +0000 | [diff] [blame] | 508 | struct btrfs_root *root = BTRFS_I(inode)->root; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 509 | struct rb_node *node; |
| 510 | |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 511 | tree = &BTRFS_I(inode)->ordered_tree; |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 512 | spin_lock_irq(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 513 | node = &entry->rb_node; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 514 | rb_erase(node, &tree->tree); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 515 | tree->last = NULL; |
| 516 | set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags); |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 517 | spin_unlock_irq(&tree->lock); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 518 | |
Josef Bacik | 287a0ab | 2010-03-19 18:07:23 +0000 | [diff] [blame] | 519 | spin_lock(&root->fs_info->ordered_extent_lock); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 520 | list_del_init(&entry->root_extent_list); |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 521 | |
liubo | 1abe9b8 | 2011-03-24 11:18:59 +0000 | [diff] [blame] | 522 | trace_btrfs_ordered_extent_remove(inode, entry); |
| 523 | |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 524 | /* |
| 525 | * we have no more ordered extents for this inode and |
| 526 | * no dirty pages. We can safely remove it from the |
| 527 | * list of ordered extents |
| 528 | */ |
| 529 | if (RB_EMPTY_ROOT(&tree->tree) && |
| 530 | !mapping_tagged(inode->i_mapping, PAGECACHE_TAG_DIRTY)) { |
| 531 | list_del_init(&BTRFS_I(inode)->ordered_operations); |
| 532 | } |
Josef Bacik | 287a0ab | 2010-03-19 18:07:23 +0000 | [diff] [blame] | 533 | spin_unlock(&root->fs_info->ordered_extent_lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 534 | wake_up(&entry->wait); |
Chris Mason | 81d7ed2 | 2008-04-25 08:51:48 -0400 | [diff] [blame] | 535 | } |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 536 | |
Miao Xie | 9afab88 | 2012-10-25 09:41:36 +0000 | [diff] [blame] | 537 | static void btrfs_run_ordered_extent_work(struct btrfs_work *work) |
| 538 | { |
| 539 | struct btrfs_ordered_extent *ordered; |
| 540 | |
| 541 | ordered = container_of(work, struct btrfs_ordered_extent, flush_work); |
| 542 | btrfs_start_ordered_extent(ordered->inode, ordered, 1); |
| 543 | complete(&ordered->completion); |
| 544 | } |
| 545 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 546 | /* |
| 547 | * wait for all the ordered extents in a root. This is done when balancing |
| 548 | * space between drives. |
| 549 | */ |
Liu Bo | 6bbe3a9 | 2012-09-14 02:58:07 -0600 | [diff] [blame] | 550 | void btrfs_wait_ordered_extents(struct btrfs_root *root, int delay_iput) |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 551 | { |
Miao Xie | 9afab88 | 2012-10-25 09:41:36 +0000 | [diff] [blame] | 552 | struct list_head splice, works; |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 553 | struct list_head *cur; |
Miao Xie | 9afab88 | 2012-10-25 09:41:36 +0000 | [diff] [blame] | 554 | struct btrfs_ordered_extent *ordered, *next; |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 555 | struct inode *inode; |
| 556 | |
| 557 | INIT_LIST_HEAD(&splice); |
Miao Xie | 9afab88 | 2012-10-25 09:41:36 +0000 | [diff] [blame] | 558 | INIT_LIST_HEAD(&works); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 559 | |
| 560 | spin_lock(&root->fs_info->ordered_extent_lock); |
| 561 | list_splice_init(&root->fs_info->ordered_extents, &splice); |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 562 | while (!list_empty(&splice)) { |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 563 | cur = splice.next; |
| 564 | ordered = list_entry(cur, struct btrfs_ordered_extent, |
| 565 | root_extent_list); |
| 566 | list_del_init(&ordered->root_extent_list); |
| 567 | atomic_inc(&ordered->refs); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 568 | |
| 569 | /* |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 570 | * the inode may be getting freed (in sys_unlink path). |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 571 | */ |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 572 | inode = igrab(ordered->inode); |
| 573 | |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 574 | spin_unlock(&root->fs_info->ordered_extent_lock); |
| 575 | |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 576 | if (inode) { |
Miao Xie | 9afab88 | 2012-10-25 09:41:36 +0000 | [diff] [blame] | 577 | ordered->flush_work.func = btrfs_run_ordered_extent_work; |
| 578 | list_add_tail(&ordered->work_list, &works); |
| 579 | btrfs_queue_worker(&root->fs_info->flush_workers, |
| 580 | &ordered->flush_work); |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 581 | } else { |
| 582 | btrfs_put_ordered_extent(ordered); |
| 583 | } |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 584 | |
Miao Xie | 9afab88 | 2012-10-25 09:41:36 +0000 | [diff] [blame] | 585 | cond_resched(); |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 586 | spin_lock(&root->fs_info->ordered_extent_lock); |
| 587 | } |
| 588 | spin_unlock(&root->fs_info->ordered_extent_lock); |
Miao Xie | 9afab88 | 2012-10-25 09:41:36 +0000 | [diff] [blame] | 589 | |
| 590 | list_for_each_entry_safe(ordered, next, &works, work_list) { |
| 591 | list_del_init(&ordered->work_list); |
| 592 | wait_for_completion(&ordered->completion); |
| 593 | |
| 594 | inode = ordered->inode; |
| 595 | btrfs_put_ordered_extent(ordered); |
| 596 | if (delay_iput) |
| 597 | btrfs_add_delayed_iput(inode); |
| 598 | else |
| 599 | iput(inode); |
| 600 | |
| 601 | cond_resched(); |
| 602 | } |
Chris Mason | 3eaa288 | 2008-07-24 11:57:52 -0400 | [diff] [blame] | 603 | } |
| 604 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 605 | /* |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 606 | * this is used during transaction commit to write all the inodes |
| 607 | * added to the ordered operation list. These files must be fully on |
| 608 | * disk before the transaction commits. |
| 609 | * |
| 610 | * we have two modes here, one is to just start the IO via filemap_flush |
| 611 | * and the other is to wait for all the io. When we wait, we have an |
| 612 | * extra check to make sure the ordered operation list really is empty |
| 613 | * before we return |
| 614 | */ |
Josef Bacik | 569e0f3 | 2013-02-13 11:09:14 -0500 | [diff] [blame] | 615 | int btrfs_run_ordered_operations(struct btrfs_trans_handle *trans, |
| 616 | struct btrfs_root *root, int wait) |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 617 | { |
| 618 | struct btrfs_inode *btrfs_inode; |
| 619 | struct inode *inode; |
Josef Bacik | 569e0f3 | 2013-02-13 11:09:14 -0500 | [diff] [blame] | 620 | struct btrfs_transaction *cur_trans = trans->transaction; |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 621 | struct list_head splice; |
Miao Xie | 25287e0 | 2012-10-25 09:31:03 +0000 | [diff] [blame] | 622 | struct list_head works; |
| 623 | struct btrfs_delalloc_work *work, *next; |
| 624 | int ret = 0; |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 625 | |
| 626 | INIT_LIST_HEAD(&splice); |
Miao Xie | 25287e0 | 2012-10-25 09:31:03 +0000 | [diff] [blame] | 627 | INIT_LIST_HEAD(&works); |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 628 | |
| 629 | mutex_lock(&root->fs_info->ordered_operations_mutex); |
| 630 | spin_lock(&root->fs_info->ordered_extent_lock); |
Josef Bacik | 569e0f3 | 2013-02-13 11:09:14 -0500 | [diff] [blame] | 631 | list_splice_init(&cur_trans->ordered_operations, &splice); |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 632 | while (!list_empty(&splice)) { |
| 633 | btrfs_inode = list_entry(splice.next, struct btrfs_inode, |
| 634 | ordered_operations); |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 635 | inode = &btrfs_inode->vfs_inode; |
| 636 | |
| 637 | list_del_init(&btrfs_inode->ordered_operations); |
| 638 | |
| 639 | /* |
| 640 | * the inode may be getting freed (in sys_unlink path). |
| 641 | */ |
| 642 | inode = igrab(inode); |
Miao Xie | 25287e0 | 2012-10-25 09:31:03 +0000 | [diff] [blame] | 643 | if (!inode) |
| 644 | continue; |
Miao Xie | 5b947f1 | 2013-01-22 10:52:04 +0000 | [diff] [blame] | 645 | |
| 646 | if (!wait) |
| 647 | list_add_tail(&BTRFS_I(inode)->ordered_operations, |
Josef Bacik | 569e0f3 | 2013-02-13 11:09:14 -0500 | [diff] [blame] | 648 | &cur_trans->ordered_operations); |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 649 | spin_unlock(&root->fs_info->ordered_extent_lock); |
| 650 | |
Miao Xie | 25287e0 | 2012-10-25 09:31:03 +0000 | [diff] [blame] | 651 | work = btrfs_alloc_delalloc_work(inode, wait, 1); |
| 652 | if (!work) { |
Miao Xie | 5b947f1 | 2013-01-22 10:52:04 +0000 | [diff] [blame] | 653 | spin_lock(&root->fs_info->ordered_extent_lock); |
Miao Xie | 25287e0 | 2012-10-25 09:31:03 +0000 | [diff] [blame] | 654 | if (list_empty(&BTRFS_I(inode)->ordered_operations)) |
| 655 | list_add_tail(&btrfs_inode->ordered_operations, |
| 656 | &splice); |
Miao Xie | 25287e0 | 2012-10-25 09:31:03 +0000 | [diff] [blame] | 657 | list_splice_tail(&splice, |
Josef Bacik | 569e0f3 | 2013-02-13 11:09:14 -0500 | [diff] [blame] | 658 | &cur_trans->ordered_operations); |
Miao Xie | 25287e0 | 2012-10-25 09:31:03 +0000 | [diff] [blame] | 659 | spin_unlock(&root->fs_info->ordered_extent_lock); |
| 660 | ret = -ENOMEM; |
| 661 | goto out; |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 662 | } |
Miao Xie | 25287e0 | 2012-10-25 09:31:03 +0000 | [diff] [blame] | 663 | list_add_tail(&work->list, &works); |
| 664 | btrfs_queue_worker(&root->fs_info->flush_workers, |
| 665 | &work->work); |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 666 | |
| 667 | cond_resched(); |
| 668 | spin_lock(&root->fs_info->ordered_extent_lock); |
| 669 | } |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 670 | spin_unlock(&root->fs_info->ordered_extent_lock); |
Miao Xie | 25287e0 | 2012-10-25 09:31:03 +0000 | [diff] [blame] | 671 | out: |
| 672 | list_for_each_entry_safe(work, next, &works, list) { |
| 673 | list_del_init(&work->list); |
| 674 | btrfs_wait_and_free_delalloc_work(work); |
| 675 | } |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 676 | mutex_unlock(&root->fs_info->ordered_operations_mutex); |
Miao Xie | 25287e0 | 2012-10-25 09:31:03 +0000 | [diff] [blame] | 677 | return ret; |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 678 | } |
| 679 | |
| 680 | /* |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 681 | * Used to start IO or wait for a given ordered extent to finish. |
| 682 | * |
| 683 | * If wait is one, this effectively waits on page writeback for all the pages |
| 684 | * in the extent, and it waits on the io completion code to insert |
| 685 | * metadata into the btree corresponding to the extent |
| 686 | */ |
| 687 | void btrfs_start_ordered_extent(struct inode *inode, |
| 688 | struct btrfs_ordered_extent *entry, |
| 689 | int wait) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 690 | { |
| 691 | u64 start = entry->file_offset; |
| 692 | u64 end = start + entry->len - 1; |
| 693 | |
liubo | 1abe9b8 | 2011-03-24 11:18:59 +0000 | [diff] [blame] | 694 | trace_btrfs_ordered_extent_start(inode, entry); |
| 695 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 696 | /* |
| 697 | * pages in the range can be dirty, clean or writeback. We |
| 698 | * start IO on any dirty ones so the wait doesn't stall waiting |
Artem Bityutskiy | b257031 | 2012-07-25 18:12:06 +0300 | [diff] [blame] | 699 | * for the flusher thread to find them |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 700 | */ |
Josef Bacik | 4b46fce | 2010-05-23 11:00:55 -0400 | [diff] [blame] | 701 | if (!test_bit(BTRFS_ORDERED_DIRECT, &entry->flags)) |
| 702 | filemap_fdatawrite_range(inode->i_mapping, start, end); |
Chris Mason | c8b9781 | 2008-10-29 14:49:59 -0400 | [diff] [blame] | 703 | if (wait) { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 704 | wait_event(entry->wait, test_bit(BTRFS_ORDERED_COMPLETE, |
| 705 | &entry->flags)); |
Chris Mason | c8b9781 | 2008-10-29 14:49:59 -0400 | [diff] [blame] | 706 | } |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 707 | } |
| 708 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 709 | /* |
| 710 | * Used to wait on ordered extents across a large range of bytes. |
| 711 | */ |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 712 | void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 713 | { |
| 714 | u64 end; |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 715 | u64 orig_end; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 716 | struct btrfs_ordered_extent *ordered; |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 717 | |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 718 | if (start + len < start) { |
Chris Mason | f421950 | 2008-07-22 11:18:09 -0400 | [diff] [blame] | 719 | orig_end = INT_LIMIT(loff_t); |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 720 | } else { |
| 721 | orig_end = start + len - 1; |
Chris Mason | f421950 | 2008-07-22 11:18:09 -0400 | [diff] [blame] | 722 | if (orig_end > INT_LIMIT(loff_t)) |
| 723 | orig_end = INT_LIMIT(loff_t); |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 724 | } |
Josef Bacik | 551ebb2 | 2012-04-23 14:41:09 -0400 | [diff] [blame] | 725 | |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 726 | /* start IO across the range first to instantiate any delalloc |
| 727 | * extents |
| 728 | */ |
Josef Bacik | 7ddf5a4 | 2012-06-08 15:26:47 -0400 | [diff] [blame] | 729 | filemap_fdatawrite_range(inode->i_mapping, start, orig_end); |
| 730 | |
| 731 | /* |
| 732 | * So with compression we will find and lock a dirty page and clear the |
| 733 | * first one as dirty, setup an async extent, and immediately return |
| 734 | * with the entire range locked but with nobody actually marked with |
| 735 | * writeback. So we can't just filemap_write_and_wait_range() and |
| 736 | * expect it to work since it will just kick off a thread to do the |
| 737 | * actual work. So we need to call filemap_fdatawrite_range _again_ |
| 738 | * since it will wait on the page lock, which won't be unlocked until |
| 739 | * after the pages have been marked as writeback and so we're good to go |
| 740 | * from there. We have to do this otherwise we'll miss the ordered |
| 741 | * extents and that results in badness. Please Josef, do not think you |
| 742 | * know better and pull this out at some point in the future, it is |
| 743 | * right and you are wrong. |
| 744 | */ |
| 745 | if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT, |
| 746 | &BTRFS_I(inode)->runtime_flags)) |
| 747 | filemap_fdatawrite_range(inode->i_mapping, start, orig_end); |
| 748 | |
| 749 | filemap_fdatawait_range(inode->i_mapping, start, orig_end); |
Chris Mason | f421950 | 2008-07-22 11:18:09 -0400 | [diff] [blame] | 750 | |
| 751 | end = orig_end; |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 752 | while (1) { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 753 | ordered = btrfs_lookup_first_ordered_extent(inode, end); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 754 | if (!ordered) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 755 | break; |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 756 | if (ordered->file_offset > orig_end) { |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 757 | btrfs_put_ordered_extent(ordered); |
| 758 | break; |
| 759 | } |
| 760 | if (ordered->file_offset + ordered->len < start) { |
| 761 | btrfs_put_ordered_extent(ordered); |
| 762 | break; |
| 763 | } |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 764 | btrfs_start_ordered_extent(inode, ordered, 1); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 765 | end = ordered->file_offset; |
| 766 | btrfs_put_ordered_extent(ordered); |
Chris Mason | e5a2217 | 2008-07-18 20:42:20 -0400 | [diff] [blame] | 767 | if (end == 0 || end == start) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 768 | break; |
| 769 | end--; |
| 770 | } |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 771 | } |
| 772 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 773 | /* |
| 774 | * find an ordered extent corresponding to file_offset. return NULL if |
| 775 | * nothing is found, otherwise take a reference on the extent and return it |
| 776 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 777 | struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode, |
| 778 | u64 file_offset) |
| 779 | { |
| 780 | struct btrfs_ordered_inode_tree *tree; |
| 781 | struct rb_node *node; |
| 782 | struct btrfs_ordered_extent *entry = NULL; |
| 783 | |
| 784 | tree = &BTRFS_I(inode)->ordered_tree; |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 785 | spin_lock_irq(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 786 | node = tree_search(tree, file_offset); |
| 787 | if (!node) |
| 788 | goto out; |
| 789 | |
| 790 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
| 791 | if (!offset_in_entry(entry, file_offset)) |
| 792 | entry = NULL; |
| 793 | if (entry) |
| 794 | atomic_inc(&entry->refs); |
| 795 | out: |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 796 | spin_unlock_irq(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 797 | return entry; |
| 798 | } |
| 799 | |
Josef Bacik | 4b46fce | 2010-05-23 11:00:55 -0400 | [diff] [blame] | 800 | /* Since the DIO code tries to lock a wide area we need to look for any ordered |
| 801 | * extents that exist in the range, rather than just the start of the range. |
| 802 | */ |
| 803 | struct btrfs_ordered_extent *btrfs_lookup_ordered_range(struct inode *inode, |
| 804 | u64 file_offset, |
| 805 | u64 len) |
| 806 | { |
| 807 | struct btrfs_ordered_inode_tree *tree; |
| 808 | struct rb_node *node; |
| 809 | struct btrfs_ordered_extent *entry = NULL; |
| 810 | |
| 811 | tree = &BTRFS_I(inode)->ordered_tree; |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 812 | spin_lock_irq(&tree->lock); |
Josef Bacik | 4b46fce | 2010-05-23 11:00:55 -0400 | [diff] [blame] | 813 | node = tree_search(tree, file_offset); |
| 814 | if (!node) { |
| 815 | node = tree_search(tree, file_offset + len); |
| 816 | if (!node) |
| 817 | goto out; |
| 818 | } |
| 819 | |
| 820 | while (1) { |
| 821 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
| 822 | if (range_overlaps(entry, file_offset, len)) |
| 823 | break; |
| 824 | |
| 825 | if (entry->file_offset >= file_offset + len) { |
| 826 | entry = NULL; |
| 827 | break; |
| 828 | } |
| 829 | entry = NULL; |
| 830 | node = rb_next(node); |
| 831 | if (!node) |
| 832 | break; |
| 833 | } |
| 834 | out: |
| 835 | if (entry) |
| 836 | atomic_inc(&entry->refs); |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 837 | spin_unlock_irq(&tree->lock); |
Josef Bacik | 4b46fce | 2010-05-23 11:00:55 -0400 | [diff] [blame] | 838 | return entry; |
| 839 | } |
| 840 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 841 | /* |
| 842 | * lookup and return any extent before 'file_offset'. NULL is returned |
| 843 | * if none is found |
| 844 | */ |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 845 | struct btrfs_ordered_extent * |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 846 | btrfs_lookup_first_ordered_extent(struct inode *inode, u64 file_offset) |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 847 | { |
| 848 | struct btrfs_ordered_inode_tree *tree; |
| 849 | struct rb_node *node; |
| 850 | struct btrfs_ordered_extent *entry = NULL; |
| 851 | |
| 852 | tree = &BTRFS_I(inode)->ordered_tree; |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 853 | spin_lock_irq(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 854 | node = tree_search(tree, file_offset); |
| 855 | if (!node) |
| 856 | goto out; |
| 857 | |
| 858 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
| 859 | atomic_inc(&entry->refs); |
| 860 | out: |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 861 | spin_unlock_irq(&tree->lock); |
Chris Mason | e6dcd2d | 2008-07-17 12:53:50 -0400 | [diff] [blame] | 862 | return entry; |
| 863 | } |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 864 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 865 | /* |
| 866 | * After an extent is done, call this to conditionally update the on disk |
| 867 | * i_size. i_size is updated to cover any fully written part of the file. |
| 868 | */ |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 869 | int btrfs_ordered_update_i_size(struct inode *inode, u64 offset, |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 870 | struct btrfs_ordered_extent *ordered) |
| 871 | { |
| 872 | struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree; |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 873 | u64 disk_i_size; |
| 874 | u64 new_i_size; |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 875 | u64 i_size = i_size_read(inode); |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 876 | struct rb_node *node; |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 877 | struct rb_node *prev = NULL; |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 878 | struct btrfs_ordered_extent *test; |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 879 | int ret = 1; |
| 880 | |
| 881 | if (ordered) |
| 882 | offset = entry_end(ordered); |
Yan, Zheng | a038fab0 | 2009-12-28 05:01:58 +0000 | [diff] [blame] | 883 | else |
| 884 | offset = ALIGN(offset, BTRFS_I(inode)->root->sectorsize); |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 885 | |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 886 | spin_lock_irq(&tree->lock); |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 887 | disk_i_size = BTRFS_I(inode)->disk_i_size; |
| 888 | |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 889 | /* truncate file */ |
| 890 | if (disk_i_size > i_size) { |
| 891 | BTRFS_I(inode)->disk_i_size = i_size; |
| 892 | ret = 0; |
| 893 | goto out; |
| 894 | } |
| 895 | |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 896 | /* |
| 897 | * if the disk i_size is already at the inode->i_size, or |
| 898 | * this ordered extent is inside the disk i_size, we're done |
| 899 | */ |
Josef Bacik | 5d1f402 | 2013-01-30 14:17:31 -0500 | [diff] [blame] | 900 | if (disk_i_size == i_size) |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 901 | goto out; |
Josef Bacik | 5d1f402 | 2013-01-30 14:17:31 -0500 | [diff] [blame] | 902 | |
| 903 | /* |
| 904 | * We still need to update disk_i_size if outstanding_isize is greater |
| 905 | * than disk_i_size. |
| 906 | */ |
| 907 | if (offset <= disk_i_size && |
| 908 | (!ordered || ordered->outstanding_isize <= disk_i_size)) |
| 909 | goto out; |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 910 | |
| 911 | /* |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 912 | * walk backward from this ordered extent to disk_i_size. |
| 913 | * if we find an ordered extent then we can't update disk i_size |
| 914 | * yet |
| 915 | */ |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 916 | if (ordered) { |
| 917 | node = rb_prev(&ordered->rb_node); |
| 918 | } else { |
| 919 | prev = tree_search(tree, offset); |
| 920 | /* |
| 921 | * we insert file extents without involving ordered struct, |
| 922 | * so there should be no ordered struct cover this offset |
| 923 | */ |
| 924 | if (prev) { |
| 925 | test = rb_entry(prev, struct btrfs_ordered_extent, |
| 926 | rb_node); |
| 927 | BUG_ON(offset_in_entry(test, offset)); |
| 928 | } |
| 929 | node = prev; |
| 930 | } |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 931 | for (; node; node = rb_prev(node)) { |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 932 | test = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 933 | |
| 934 | /* We treat this entry as if it doesnt exist */ |
| 935 | if (test_bit(BTRFS_ORDERED_UPDATED_ISIZE, &test->flags)) |
| 936 | continue; |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 937 | if (test->file_offset + test->len <= disk_i_size) |
| 938 | break; |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 939 | if (test->file_offset >= i_size) |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 940 | break; |
Josef Bacik | 59fe4f4 | 2013-01-30 14:31:31 -0500 | [diff] [blame] | 941 | if (entry_end(test) > disk_i_size) { |
Miao Xie | b9a8cc5 | 2012-09-06 04:01:21 -0600 | [diff] [blame] | 942 | /* |
| 943 | * we don't update disk_i_size now, so record this |
| 944 | * undealt i_size. Or we will not know the real |
| 945 | * i_size. |
| 946 | */ |
| 947 | if (test->outstanding_isize < offset) |
| 948 | test->outstanding_isize = offset; |
| 949 | if (ordered && |
| 950 | ordered->outstanding_isize > |
| 951 | test->outstanding_isize) |
| 952 | test->outstanding_isize = |
| 953 | ordered->outstanding_isize; |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 954 | goto out; |
Miao Xie | b9a8cc5 | 2012-09-06 04:01:21 -0600 | [diff] [blame] | 955 | } |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 956 | } |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 957 | new_i_size = min_t(u64, offset, i_size); |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 958 | |
| 959 | /* |
Miao Xie | b9a8cc5 | 2012-09-06 04:01:21 -0600 | [diff] [blame] | 960 | * Some ordered extents may completed before the current one, and |
| 961 | * we hold the real i_size in ->outstanding_isize. |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 962 | */ |
Miao Xie | b9a8cc5 | 2012-09-06 04:01:21 -0600 | [diff] [blame] | 963 | if (ordered && ordered->outstanding_isize > new_i_size) |
| 964 | new_i_size = min_t(u64, ordered->outstanding_isize, i_size); |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 965 | BTRFS_I(inode)->disk_i_size = new_i_size; |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 966 | ret = 0; |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 967 | out: |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 968 | /* |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 969 | * We need to do this because we can't remove ordered extents until |
| 970 | * after the i_disk_size has been updated and then the inode has been |
| 971 | * updated to reflect the change, so we need to tell anybody who finds |
| 972 | * this ordered extent that we've already done all the real work, we |
| 973 | * just haven't completed all the other work. |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 974 | */ |
| 975 | if (ordered) |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 976 | set_bit(BTRFS_ORDERED_UPDATED_ISIZE, &ordered->flags); |
| 977 | spin_unlock_irq(&tree->lock); |
Yan, Zheng | c216775 | 2009-11-12 09:34:21 +0000 | [diff] [blame] | 978 | return ret; |
Chris Mason | dbe674a | 2008-07-17 12:54:05 -0400 | [diff] [blame] | 979 | } |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 980 | |
Chris Mason | eb84ae0 | 2008-07-17 13:53:27 -0400 | [diff] [blame] | 981 | /* |
| 982 | * search the ordered extents for one corresponding to 'offset' and |
| 983 | * try to find a checksum. This is used because we allow pages to |
| 984 | * be reclaimed before their checksum is actually put into the btree |
| 985 | */ |
Chris Mason | d20f704 | 2008-12-08 16:58:54 -0500 | [diff] [blame] | 986 | int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u64 disk_bytenr, |
| 987 | u32 *sum) |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 988 | { |
| 989 | struct btrfs_ordered_sum *ordered_sum; |
| 990 | struct btrfs_sector_sum *sector_sums; |
| 991 | struct btrfs_ordered_extent *ordered; |
| 992 | struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree; |
Chris Mason | 3edf7d3 | 2008-07-18 06:17:13 -0400 | [diff] [blame] | 993 | unsigned long num_sectors; |
| 994 | unsigned long i; |
| 995 | u32 sectorsize = BTRFS_I(inode)->root->sectorsize; |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 996 | int ret = 1; |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 997 | |
| 998 | ordered = btrfs_lookup_ordered_extent(inode, offset); |
| 999 | if (!ordered) |
| 1000 | return 1; |
| 1001 | |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 1002 | spin_lock_irq(&tree->lock); |
Qinghuang Feng | c6e3087 | 2009-01-21 10:59:08 -0500 | [diff] [blame] | 1003 | list_for_each_entry_reverse(ordered_sum, &ordered->list, list) { |
Chris Mason | d20f704 | 2008-12-08 16:58:54 -0500 | [diff] [blame] | 1004 | if (disk_bytenr >= ordered_sum->bytenr) { |
Chris Mason | 3edf7d3 | 2008-07-18 06:17:13 -0400 | [diff] [blame] | 1005 | num_sectors = ordered_sum->len / sectorsize; |
Chris Mason | ed98b56 | 2008-07-22 23:06:42 -0400 | [diff] [blame] | 1006 | sector_sums = ordered_sum->sums; |
Chris Mason | 3edf7d3 | 2008-07-18 06:17:13 -0400 | [diff] [blame] | 1007 | for (i = 0; i < num_sectors; i++) { |
Chris Mason | d20f704 | 2008-12-08 16:58:54 -0500 | [diff] [blame] | 1008 | if (sector_sums[i].bytenr == disk_bytenr) { |
Chris Mason | 3edf7d3 | 2008-07-18 06:17:13 -0400 | [diff] [blame] | 1009 | *sum = sector_sums[i].sum; |
| 1010 | ret = 0; |
| 1011 | goto out; |
| 1012 | } |
| 1013 | } |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 1014 | } |
| 1015 | } |
| 1016 | out: |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 1017 | spin_unlock_irq(&tree->lock); |
Chris Mason | 8964222 | 2008-07-24 09:41:53 -0400 | [diff] [blame] | 1018 | btrfs_put_ordered_extent(ordered); |
Chris Mason | ba1da2f | 2008-07-17 12:54:15 -0400 | [diff] [blame] | 1019 | return ret; |
| 1020 | } |
| 1021 | |
Chris Mason | f421950 | 2008-07-22 11:18:09 -0400 | [diff] [blame] | 1022 | |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 1023 | /* |
| 1024 | * add a given inode to the list of inodes that must be fully on |
| 1025 | * disk before a transaction commit finishes. |
| 1026 | * |
| 1027 | * This basically gives us the ext3 style data=ordered mode, and it is mostly |
| 1028 | * used to make sure renamed files are fully on disk. |
| 1029 | * |
| 1030 | * It is a noop if the inode is already fully on disk. |
| 1031 | * |
| 1032 | * If trans is not null, we'll do a friendly check for a transaction that |
| 1033 | * is already flushing things and force the IO down ourselves. |
| 1034 | */ |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 1035 | void btrfs_add_ordered_operation(struct btrfs_trans_handle *trans, |
| 1036 | struct btrfs_root *root, struct inode *inode) |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 1037 | { |
Josef Bacik | 569e0f3 | 2013-02-13 11:09:14 -0500 | [diff] [blame] | 1038 | struct btrfs_transaction *cur_trans = trans->transaction; |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 1039 | u64 last_mod; |
| 1040 | |
| 1041 | last_mod = max(BTRFS_I(inode)->generation, BTRFS_I(inode)->last_trans); |
| 1042 | |
| 1043 | /* |
| 1044 | * if this file hasn't been changed since the last transaction |
| 1045 | * commit, we can safely return without doing anything |
| 1046 | */ |
| 1047 | if (last_mod < root->fs_info->last_trans_committed) |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 1048 | return; |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 1049 | |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 1050 | spin_lock(&root->fs_info->ordered_extent_lock); |
| 1051 | if (list_empty(&BTRFS_I(inode)->ordered_operations)) { |
| 1052 | list_add_tail(&BTRFS_I(inode)->ordered_operations, |
Josef Bacik | 569e0f3 | 2013-02-13 11:09:14 -0500 | [diff] [blame] | 1053 | &cur_trans->ordered_operations); |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 1054 | } |
| 1055 | spin_unlock(&root->fs_info->ordered_extent_lock); |
Chris Mason | 5a3f23d | 2009-03-31 13:27:11 -0400 | [diff] [blame] | 1056 | } |
Miao Xie | 6352b91 | 2012-09-06 04:01:51 -0600 | [diff] [blame] | 1057 | |
| 1058 | int __init ordered_data_init(void) |
| 1059 | { |
| 1060 | btrfs_ordered_extent_cache = kmem_cache_create("btrfs_ordered_extent", |
| 1061 | sizeof(struct btrfs_ordered_extent), 0, |
| 1062 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, |
| 1063 | NULL); |
| 1064 | if (!btrfs_ordered_extent_cache) |
| 1065 | return -ENOMEM; |
Miao Xie | 25287e0 | 2012-10-25 09:31:03 +0000 | [diff] [blame] | 1066 | |
Miao Xie | 6352b91 | 2012-09-06 04:01:51 -0600 | [diff] [blame] | 1067 | return 0; |
| 1068 | } |
| 1069 | |
| 1070 | void ordered_data_exit(void) |
| 1071 | { |
| 1072 | if (btrfs_ordered_extent_cache) |
| 1073 | kmem_cache_destroy(btrfs_ordered_extent_cache); |
| 1074 | } |