Chris Mason | 6cbd557 | 2007-06-12 09:07:21 -0400 | [diff] [blame] | 1 | /* |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 2 | * Copyright (C) 2007,2008 Oracle. All rights reserved. |
Chris Mason | 6cbd557 | 2007-06-12 09:07:21 -0400 | [diff] [blame] | 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 | a6b6e75 | 2007-10-15 16:22:39 -0400 | [diff] [blame] | 19 | #include <linux/sched.h> |
Tejun Heo | 5a0e3ad | 2010-03-24 17:04:11 +0900 | [diff] [blame] | 20 | #include <linux/slab.h> |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 21 | #include <linux/rbtree.h> |
David Sterba | 8f282f7 | 2016-03-30 16:01:12 +0200 | [diff] [blame] | 22 | #include <linux/vmalloc.h> |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 23 | #include "ctree.h" |
| 24 | #include "disk-io.h" |
Chris Mason | 7f5c151 | 2007-03-23 15:56:19 -0400 | [diff] [blame] | 25 | #include "transaction.h" |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 26 | #include "print-tree.h" |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 27 | #include "locking.h" |
Chris Mason | 9a8dd15 | 2007-02-23 08:38:36 -0500 | [diff] [blame] | 28 | |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 29 | static int split_node(struct btrfs_trans_handle *trans, struct btrfs_root |
| 30 | *root, struct btrfs_path *path, int level); |
| 31 | static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 32 | *root, struct btrfs_key *ins_key, |
Chris Mason | cc0c553 | 2007-10-25 15:42:57 -0400 | [diff] [blame] | 33 | struct btrfs_path *path, int data_size, int extend); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 34 | static int push_node_left(struct btrfs_trans_handle *trans, |
| 35 | struct btrfs_root *root, struct extent_buffer *dst, |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 36 | struct extent_buffer *src, int empty); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 37 | static int balance_node_right(struct btrfs_trans_handle *trans, |
| 38 | struct btrfs_root *root, |
| 39 | struct extent_buffer *dst_buf, |
| 40 | struct extent_buffer *src_buf); |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 41 | static void del_ptr(struct btrfs_root *root, struct btrfs_path *path, |
| 42 | int level, int slot); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 43 | static int tree_mod_log_free_eb(struct btrfs_fs_info *fs_info, |
Jan Schmidt | f230475 | 2012-05-26 11:43:17 +0200 | [diff] [blame] | 44 | struct extent_buffer *eb); |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 45 | |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 46 | struct btrfs_path *btrfs_alloc_path(void) |
| 47 | { |
Masahiro Yamada | e2c8990 | 2016-09-13 04:35:52 +0900 | [diff] [blame] | 48 | return kmem_cache_zalloc(btrfs_path_cachep, GFP_NOFS); |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 49 | } |
| 50 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 51 | /* |
| 52 | * set all locked nodes in the path to blocking locks. This should |
| 53 | * be done before scheduling |
| 54 | */ |
| 55 | noinline void btrfs_set_path_blocking(struct btrfs_path *p) |
| 56 | { |
| 57 | int i; |
| 58 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 59 | if (!p->nodes[i] || !p->locks[i]) |
| 60 | continue; |
| 61 | btrfs_set_lock_blocking_rw(p->nodes[i], p->locks[i]); |
| 62 | if (p->locks[i] == BTRFS_READ_LOCK) |
| 63 | p->locks[i] = BTRFS_READ_LOCK_BLOCKING; |
| 64 | else if (p->locks[i] == BTRFS_WRITE_LOCK) |
| 65 | p->locks[i] = BTRFS_WRITE_LOCK_BLOCKING; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 66 | } |
| 67 | } |
| 68 | |
| 69 | /* |
| 70 | * reset all the locked nodes in the patch to spinning locks. |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 71 | * |
| 72 | * held is used to keep lockdep happy, when lockdep is enabled |
| 73 | * we set held to a blocking lock before we go around and |
| 74 | * retake all the spinlocks in the path. You can safely use NULL |
| 75 | * for held |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 76 | */ |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 77 | noinline void btrfs_clear_path_blocking(struct btrfs_path *p, |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 78 | struct extent_buffer *held, int held_rw) |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 79 | { |
| 80 | int i; |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 81 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 82 | if (held) { |
| 83 | btrfs_set_lock_blocking_rw(held, held_rw); |
| 84 | if (held_rw == BTRFS_WRITE_LOCK) |
| 85 | held_rw = BTRFS_WRITE_LOCK_BLOCKING; |
| 86 | else if (held_rw == BTRFS_READ_LOCK) |
| 87 | held_rw = BTRFS_READ_LOCK_BLOCKING; |
| 88 | } |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 89 | btrfs_set_path_blocking(p); |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 90 | |
| 91 | for (i = BTRFS_MAX_LEVEL - 1; i >= 0; i--) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 92 | if (p->nodes[i] && p->locks[i]) { |
| 93 | btrfs_clear_lock_blocking_rw(p->nodes[i], p->locks[i]); |
| 94 | if (p->locks[i] == BTRFS_WRITE_LOCK_BLOCKING) |
| 95 | p->locks[i] = BTRFS_WRITE_LOCK; |
| 96 | else if (p->locks[i] == BTRFS_READ_LOCK_BLOCKING) |
| 97 | p->locks[i] = BTRFS_READ_LOCK; |
| 98 | } |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 99 | } |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 100 | |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 101 | if (held) |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 102 | btrfs_clear_lock_blocking_rw(held, held_rw); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 103 | } |
| 104 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 105 | /* this also releases the path */ |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 106 | void btrfs_free_path(struct btrfs_path *p) |
| 107 | { |
Jesper Juhl | ff175d5 | 2010-12-25 21:22:30 +0000 | [diff] [blame] | 108 | if (!p) |
| 109 | return; |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 110 | btrfs_release_path(p); |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 111 | kmem_cache_free(btrfs_path_cachep, p); |
| 112 | } |
| 113 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 114 | /* |
| 115 | * path release drops references on the extent buffers in the path |
| 116 | * and it drops any locks held by this path |
| 117 | * |
| 118 | * It is safe to call this on paths that no locks or extent buffers held. |
| 119 | */ |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 120 | noinline void btrfs_release_path(struct btrfs_path *p) |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 121 | { |
| 122 | int i; |
Chris Mason | a213501 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 123 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 124 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) { |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 125 | p->slots[i] = 0; |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 126 | if (!p->nodes[i]) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 127 | continue; |
| 128 | if (p->locks[i]) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 129 | btrfs_tree_unlock_rw(p->nodes[i], p->locks[i]); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 130 | p->locks[i] = 0; |
| 131 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 132 | free_extent_buffer(p->nodes[i]); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 133 | p->nodes[i] = NULL; |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 134 | } |
| 135 | } |
| 136 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 137 | /* |
| 138 | * safely gets a reference on the root node of a tree. A lock |
| 139 | * is not taken, so a concurrent writer may put a different node |
| 140 | * at the root of the tree. See btrfs_lock_root_node for the |
| 141 | * looping required. |
| 142 | * |
| 143 | * The extent buffer returned by this has a reference taken, so |
| 144 | * it won't disappear. It may stop being the root of the tree |
| 145 | * at any time because there are no locks held. |
| 146 | */ |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 147 | struct extent_buffer *btrfs_root_node(struct btrfs_root *root) |
| 148 | { |
| 149 | struct extent_buffer *eb; |
Chris Mason | 240f62c | 2011-03-23 14:54:42 -0400 | [diff] [blame] | 150 | |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 151 | while (1) { |
| 152 | rcu_read_lock(); |
| 153 | eb = rcu_dereference(root->node); |
| 154 | |
| 155 | /* |
| 156 | * RCU really hurts here, we could free up the root node because |
Nicholas D Steeves | 0132761 | 2016-05-19 21:18:45 -0400 | [diff] [blame] | 157 | * it was COWed but we may not get the new root node yet so do |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 158 | * the inc_not_zero dance and if it doesn't work then |
| 159 | * synchronize_rcu and try again. |
| 160 | */ |
| 161 | if (atomic_inc_not_zero(&eb->refs)) { |
| 162 | rcu_read_unlock(); |
| 163 | break; |
| 164 | } |
| 165 | rcu_read_unlock(); |
| 166 | synchronize_rcu(); |
| 167 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 168 | return eb; |
| 169 | } |
| 170 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 171 | /* loop around taking references on and locking the root node of the |
| 172 | * tree until you end up with a lock on the root. A locked buffer |
| 173 | * is returned, with a reference held. |
| 174 | */ |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 175 | struct extent_buffer *btrfs_lock_root_node(struct btrfs_root *root) |
| 176 | { |
| 177 | struct extent_buffer *eb; |
| 178 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 179 | while (1) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 180 | eb = btrfs_root_node(root); |
| 181 | btrfs_tree_lock(eb); |
Chris Mason | 240f62c | 2011-03-23 14:54:42 -0400 | [diff] [blame] | 182 | if (eb == root->node) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 183 | break; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 184 | btrfs_tree_unlock(eb); |
| 185 | free_extent_buffer(eb); |
| 186 | } |
| 187 | return eb; |
| 188 | } |
| 189 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 190 | /* loop around taking references on and locking the root node of the |
| 191 | * tree until you end up with a lock on the root. A locked buffer |
| 192 | * is returned, with a reference held. |
| 193 | */ |
Eric Sandeen | 48a3b63 | 2013-04-25 20:41:01 +0000 | [diff] [blame] | 194 | static struct extent_buffer *btrfs_read_lock_root_node(struct btrfs_root *root) |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 195 | { |
| 196 | struct extent_buffer *eb; |
| 197 | |
| 198 | while (1) { |
| 199 | eb = btrfs_root_node(root); |
| 200 | btrfs_tree_read_lock(eb); |
| 201 | if (eb == root->node) |
| 202 | break; |
| 203 | btrfs_tree_read_unlock(eb); |
| 204 | free_extent_buffer(eb); |
| 205 | } |
| 206 | return eb; |
| 207 | } |
| 208 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 209 | /* cowonly root (everything not a reference counted cow subvolume), just get |
| 210 | * put onto a simple dirty list. transaction.c walks this to make sure they |
| 211 | * get properly updated on disk. |
| 212 | */ |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 213 | static void add_root_to_dirty_list(struct btrfs_root *root) |
| 214 | { |
Josef Bacik | e7070be | 2014-12-16 08:54:43 -0800 | [diff] [blame] | 215 | if (test_bit(BTRFS_ROOT_DIRTY, &root->state) || |
| 216 | !test_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state)) |
| 217 | return; |
| 218 | |
Chris Mason | e5846fc | 2012-05-03 12:08:48 -0400 | [diff] [blame] | 219 | spin_lock(&root->fs_info->trans_lock); |
Josef Bacik | e7070be | 2014-12-16 08:54:43 -0800 | [diff] [blame] | 220 | if (!test_and_set_bit(BTRFS_ROOT_DIRTY, &root->state)) { |
| 221 | /* Want the extent tree to be the last on the list */ |
| 222 | if (root->objectid == BTRFS_EXTENT_TREE_OBJECTID) |
| 223 | list_move_tail(&root->dirty_list, |
| 224 | &root->fs_info->dirty_cowonly_roots); |
| 225 | else |
| 226 | list_move(&root->dirty_list, |
| 227 | &root->fs_info->dirty_cowonly_roots); |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 228 | } |
Chris Mason | e5846fc | 2012-05-03 12:08:48 -0400 | [diff] [blame] | 229 | spin_unlock(&root->fs_info->trans_lock); |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 230 | } |
| 231 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 232 | /* |
| 233 | * used by snapshot creation to make a copy of a root for a tree with |
| 234 | * a given objectid. The buffer with the new root node is returned in |
| 235 | * cow_ret, and this func returns zero on success or a negative error code. |
| 236 | */ |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 237 | int btrfs_copy_root(struct btrfs_trans_handle *trans, |
| 238 | struct btrfs_root *root, |
| 239 | struct extent_buffer *buf, |
| 240 | struct extent_buffer **cow_ret, u64 new_root_objectid) |
| 241 | { |
| 242 | struct extent_buffer *cow; |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 243 | int ret = 0; |
| 244 | int level; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 245 | struct btrfs_disk_key disk_key; |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 246 | |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 247 | WARN_ON(test_bit(BTRFS_ROOT_REF_COWS, &root->state) && |
| 248 | trans->transid != root->fs_info->running_transaction->transid); |
| 249 | WARN_ON(test_bit(BTRFS_ROOT_REF_COWS, &root->state) && |
| 250 | trans->transid != root->last_trans); |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 251 | |
| 252 | level = btrfs_header_level(buf); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 253 | if (level == 0) |
| 254 | btrfs_item_key(buf, &disk_key, 0); |
| 255 | else |
| 256 | btrfs_node_key(buf, &disk_key, 0); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 257 | |
David Sterba | 4d75f8a | 2014-06-15 01:54:12 +0200 | [diff] [blame] | 258 | cow = btrfs_alloc_tree_block(trans, root, 0, new_root_objectid, |
| 259 | &disk_key, level, buf->start, 0); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 260 | if (IS_ERR(cow)) |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 261 | return PTR_ERR(cow); |
| 262 | |
| 263 | copy_extent_buffer(cow, buf, 0, 0, cow->len); |
| 264 | btrfs_set_header_bytenr(cow, cow->start); |
| 265 | btrfs_set_header_generation(cow, trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 266 | btrfs_set_header_backref_rev(cow, BTRFS_MIXED_BACKREF_REV); |
| 267 | btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN | |
| 268 | BTRFS_HEADER_FLAG_RELOC); |
| 269 | if (new_root_objectid == BTRFS_TREE_RELOC_OBJECTID) |
| 270 | btrfs_set_header_flag(cow, BTRFS_HEADER_FLAG_RELOC); |
| 271 | else |
| 272 | btrfs_set_header_owner(cow, new_root_objectid); |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 273 | |
Ross Kirk | 0a4e558 | 2013-09-24 10:12:38 +0100 | [diff] [blame] | 274 | write_extent_buffer(cow, root->fs_info->fsid, btrfs_header_fsid(), |
Yan Zheng | 2b82032 | 2008-11-17 21:11:30 -0500 | [diff] [blame] | 275 | BTRFS_FSID_SIZE); |
| 276 | |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 277 | WARN_ON(btrfs_header_generation(buf) > trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 278 | if (new_root_objectid == BTRFS_TREE_RELOC_OBJECTID) |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 279 | ret = btrfs_inc_ref(trans, root, cow, 1); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 280 | else |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 281 | ret = btrfs_inc_ref(trans, root, cow, 0); |
Chris Mason | 4aec2b5 | 2007-12-18 16:25:45 -0500 | [diff] [blame] | 282 | |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 283 | if (ret) |
| 284 | return ret; |
| 285 | |
| 286 | btrfs_mark_buffer_dirty(cow); |
| 287 | *cow_ret = cow; |
| 288 | return 0; |
| 289 | } |
| 290 | |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 291 | enum mod_log_op { |
| 292 | MOD_LOG_KEY_REPLACE, |
| 293 | MOD_LOG_KEY_ADD, |
| 294 | MOD_LOG_KEY_REMOVE, |
| 295 | MOD_LOG_KEY_REMOVE_WHILE_FREEING, |
| 296 | MOD_LOG_KEY_REMOVE_WHILE_MOVING, |
| 297 | MOD_LOG_MOVE_KEYS, |
| 298 | MOD_LOG_ROOT_REPLACE, |
| 299 | }; |
| 300 | |
| 301 | struct tree_mod_move { |
| 302 | int dst_slot; |
| 303 | int nr_items; |
| 304 | }; |
| 305 | |
| 306 | struct tree_mod_root { |
| 307 | u64 logical; |
| 308 | u8 level; |
| 309 | }; |
| 310 | |
| 311 | struct tree_mod_elem { |
| 312 | struct rb_node node; |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 313 | u64 logical; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 314 | u64 seq; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 315 | enum mod_log_op op; |
| 316 | |
| 317 | /* this is used for MOD_LOG_KEY_* and MOD_LOG_MOVE_KEYS operations */ |
| 318 | int slot; |
| 319 | |
| 320 | /* this is used for MOD_LOG_KEY* and MOD_LOG_ROOT_REPLACE */ |
| 321 | u64 generation; |
| 322 | |
| 323 | /* those are used for op == MOD_LOG_KEY_{REPLACE,REMOVE} */ |
| 324 | struct btrfs_disk_key key; |
| 325 | u64 blockptr; |
| 326 | |
| 327 | /* this is used for op == MOD_LOG_MOVE_KEYS */ |
| 328 | struct tree_mod_move move; |
| 329 | |
| 330 | /* this is used for op == MOD_LOG_ROOT_REPLACE */ |
| 331 | struct tree_mod_root old_root; |
| 332 | }; |
| 333 | |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 334 | static inline void tree_mod_log_read_lock(struct btrfs_fs_info *fs_info) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 335 | { |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 336 | read_lock(&fs_info->tree_mod_log_lock); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 337 | } |
| 338 | |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 339 | static inline void tree_mod_log_read_unlock(struct btrfs_fs_info *fs_info) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 340 | { |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 341 | read_unlock(&fs_info->tree_mod_log_lock); |
| 342 | } |
| 343 | |
| 344 | static inline void tree_mod_log_write_lock(struct btrfs_fs_info *fs_info) |
| 345 | { |
| 346 | write_lock(&fs_info->tree_mod_log_lock); |
| 347 | } |
| 348 | |
| 349 | static inline void tree_mod_log_write_unlock(struct btrfs_fs_info *fs_info) |
| 350 | { |
| 351 | write_unlock(&fs_info->tree_mod_log_lock); |
| 352 | } |
| 353 | |
| 354 | /* |
Josef Bacik | fcebe45 | 2014-05-13 17:30:47 -0700 | [diff] [blame] | 355 | * Pull a new tree mod seq number for our operation. |
Jan Schmidt | fc36ed7e | 2013-04-24 16:57:33 +0000 | [diff] [blame] | 356 | */ |
Josef Bacik | fcebe45 | 2014-05-13 17:30:47 -0700 | [diff] [blame] | 357 | static inline u64 btrfs_inc_tree_mod_seq(struct btrfs_fs_info *fs_info) |
Jan Schmidt | fc36ed7e | 2013-04-24 16:57:33 +0000 | [diff] [blame] | 358 | { |
| 359 | return atomic64_inc_return(&fs_info->tree_mod_seq); |
| 360 | } |
| 361 | |
| 362 | /* |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 363 | * This adds a new blocker to the tree mod log's blocker list if the @elem |
| 364 | * passed does not already have a sequence number set. So when a caller expects |
| 365 | * to record tree modifications, it should ensure to set elem->seq to zero |
| 366 | * before calling btrfs_get_tree_mod_seq. |
| 367 | * Returns a fresh, unused tree log modification sequence number, even if no new |
| 368 | * blocker was added. |
| 369 | */ |
| 370 | u64 btrfs_get_tree_mod_seq(struct btrfs_fs_info *fs_info, |
| 371 | struct seq_list *elem) |
| 372 | { |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 373 | tree_mod_log_write_lock(fs_info); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 374 | spin_lock(&fs_info->tree_mod_seq_lock); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 375 | if (!elem->seq) { |
Josef Bacik | fcebe45 | 2014-05-13 17:30:47 -0700 | [diff] [blame] | 376 | elem->seq = btrfs_inc_tree_mod_seq(fs_info); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 377 | list_add_tail(&elem->list, &fs_info->tree_mod_seq_list); |
| 378 | } |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 379 | spin_unlock(&fs_info->tree_mod_seq_lock); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 380 | tree_mod_log_write_unlock(fs_info); |
| 381 | |
Josef Bacik | fcebe45 | 2014-05-13 17:30:47 -0700 | [diff] [blame] | 382 | return elem->seq; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 383 | } |
| 384 | |
| 385 | void btrfs_put_tree_mod_seq(struct btrfs_fs_info *fs_info, |
| 386 | struct seq_list *elem) |
| 387 | { |
| 388 | struct rb_root *tm_root; |
| 389 | struct rb_node *node; |
| 390 | struct rb_node *next; |
| 391 | struct seq_list *cur_elem; |
| 392 | struct tree_mod_elem *tm; |
| 393 | u64 min_seq = (u64)-1; |
| 394 | u64 seq_putting = elem->seq; |
| 395 | |
| 396 | if (!seq_putting) |
| 397 | return; |
| 398 | |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 399 | spin_lock(&fs_info->tree_mod_seq_lock); |
| 400 | list_del(&elem->list); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 401 | elem->seq = 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 402 | |
| 403 | list_for_each_entry(cur_elem, &fs_info->tree_mod_seq_list, list) { |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 404 | if (cur_elem->seq < min_seq) { |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 405 | if (seq_putting > cur_elem->seq) { |
| 406 | /* |
| 407 | * blocker with lower sequence number exists, we |
| 408 | * cannot remove anything from the log |
| 409 | */ |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 410 | spin_unlock(&fs_info->tree_mod_seq_lock); |
| 411 | return; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 412 | } |
| 413 | min_seq = cur_elem->seq; |
| 414 | } |
| 415 | } |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 416 | spin_unlock(&fs_info->tree_mod_seq_lock); |
| 417 | |
| 418 | /* |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 419 | * anything that's lower than the lowest existing (read: blocked) |
| 420 | * sequence number can be removed from the tree. |
| 421 | */ |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 422 | tree_mod_log_write_lock(fs_info); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 423 | tm_root = &fs_info->tree_mod_log; |
| 424 | for (node = rb_first(tm_root); node; node = next) { |
| 425 | next = rb_next(node); |
| 426 | tm = container_of(node, struct tree_mod_elem, node); |
Filipe Manana | be9a42b | 2019-12-06 12:27:39 +0000 | [diff] [blame] | 427 | if (tm->seq >= min_seq) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 428 | continue; |
| 429 | rb_erase(node, tm_root); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 430 | kfree(tm); |
| 431 | } |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 432 | tree_mod_log_write_unlock(fs_info); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 433 | } |
| 434 | |
| 435 | /* |
| 436 | * key order of the log: |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 437 | * node/leaf start address -> sequence |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 438 | * |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 439 | * The 'start address' is the logical address of the *new* root node |
| 440 | * for root replace operations, or the logical address of the affected |
| 441 | * block for all other operations. |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 442 | * |
| 443 | * Note: must be called with write lock (tree_mod_log_write_lock). |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 444 | */ |
| 445 | static noinline int |
| 446 | __tree_mod_log_insert(struct btrfs_fs_info *fs_info, struct tree_mod_elem *tm) |
| 447 | { |
| 448 | struct rb_root *tm_root; |
| 449 | struct rb_node **new; |
| 450 | struct rb_node *parent = NULL; |
| 451 | struct tree_mod_elem *cur; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 452 | |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 453 | BUG_ON(!tm); |
| 454 | |
Josef Bacik | fcebe45 | 2014-05-13 17:30:47 -0700 | [diff] [blame] | 455 | tm->seq = btrfs_inc_tree_mod_seq(fs_info); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 456 | |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 457 | tm_root = &fs_info->tree_mod_log; |
| 458 | new = &tm_root->rb_node; |
| 459 | while (*new) { |
| 460 | cur = container_of(*new, struct tree_mod_elem, node); |
| 461 | parent = *new; |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 462 | if (cur->logical < tm->logical) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 463 | new = &((*new)->rb_left); |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 464 | else if (cur->logical > tm->logical) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 465 | new = &((*new)->rb_right); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 466 | else if (cur->seq < tm->seq) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 467 | new = &((*new)->rb_left); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 468 | else if (cur->seq > tm->seq) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 469 | new = &((*new)->rb_right); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 470 | else |
| 471 | return -EEXIST; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 472 | } |
| 473 | |
| 474 | rb_link_node(&tm->node, parent, new); |
| 475 | rb_insert_color(&tm->node, tm_root); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 476 | return 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 477 | } |
| 478 | |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 479 | /* |
| 480 | * Determines if logging can be omitted. Returns 1 if it can. Otherwise, it |
| 481 | * returns zero with the tree_mod_log_lock acquired. The caller must hold |
| 482 | * this until all tree mod log insertions are recorded in the rb tree and then |
| 483 | * call tree_mod_log_write_unlock() to release. |
| 484 | */ |
Jan Schmidt | e9b7fd4 | 2012-05-31 14:59:09 +0200 | [diff] [blame] | 485 | static inline int tree_mod_dont_log(struct btrfs_fs_info *fs_info, |
| 486 | struct extent_buffer *eb) { |
| 487 | smp_mb(); |
| 488 | if (list_empty(&(fs_info)->tree_mod_seq_list)) |
| 489 | return 1; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 490 | if (eb && btrfs_header_level(eb) == 0) |
Jan Schmidt | e9b7fd4 | 2012-05-31 14:59:09 +0200 | [diff] [blame] | 491 | return 1; |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 492 | |
| 493 | tree_mod_log_write_lock(fs_info); |
| 494 | if (list_empty(&(fs_info)->tree_mod_seq_list)) { |
| 495 | tree_mod_log_write_unlock(fs_info); |
| 496 | return 1; |
| 497 | } |
| 498 | |
Jan Schmidt | e9b7fd4 | 2012-05-31 14:59:09 +0200 | [diff] [blame] | 499 | return 0; |
| 500 | } |
| 501 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 502 | /* Similar to tree_mod_dont_log, but doesn't acquire any locks. */ |
| 503 | static inline int tree_mod_need_log(const struct btrfs_fs_info *fs_info, |
| 504 | struct extent_buffer *eb) |
| 505 | { |
| 506 | smp_mb(); |
| 507 | if (list_empty(&(fs_info)->tree_mod_seq_list)) |
| 508 | return 0; |
| 509 | if (eb && btrfs_header_level(eb) == 0) |
| 510 | return 0; |
| 511 | |
| 512 | return 1; |
| 513 | } |
| 514 | |
| 515 | static struct tree_mod_elem * |
| 516 | alloc_tree_mod_elem(struct extent_buffer *eb, int slot, |
| 517 | enum mod_log_op op, gfp_t flags) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 518 | { |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 519 | struct tree_mod_elem *tm; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 520 | |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 521 | tm = kzalloc(sizeof(*tm), flags); |
| 522 | if (!tm) |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 523 | return NULL; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 524 | |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 525 | tm->logical = eb->start; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 526 | if (op != MOD_LOG_KEY_ADD) { |
| 527 | btrfs_node_key(eb, &tm->key, slot); |
| 528 | tm->blockptr = btrfs_node_blockptr(eb, slot); |
| 529 | } |
| 530 | tm->op = op; |
| 531 | tm->slot = slot; |
| 532 | tm->generation = btrfs_node_ptr_generation(eb, slot); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 533 | RB_CLEAR_NODE(&tm->node); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 534 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 535 | return tm; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 536 | } |
| 537 | |
| 538 | static noinline int |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 539 | tree_mod_log_insert_key(struct btrfs_fs_info *fs_info, |
| 540 | struct extent_buffer *eb, int slot, |
| 541 | enum mod_log_op op, gfp_t flags) |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 542 | { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 543 | struct tree_mod_elem *tm; |
| 544 | int ret; |
| 545 | |
| 546 | if (!tree_mod_need_log(fs_info, eb)) |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 547 | return 0; |
| 548 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 549 | tm = alloc_tree_mod_elem(eb, slot, op, flags); |
| 550 | if (!tm) |
| 551 | return -ENOMEM; |
| 552 | |
| 553 | if (tree_mod_dont_log(fs_info, eb)) { |
| 554 | kfree(tm); |
| 555 | return 0; |
| 556 | } |
| 557 | |
| 558 | ret = __tree_mod_log_insert(fs_info, tm); |
| 559 | tree_mod_log_write_unlock(fs_info); |
| 560 | if (ret) |
| 561 | kfree(tm); |
| 562 | |
| 563 | return ret; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 564 | } |
| 565 | |
| 566 | static noinline int |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 567 | tree_mod_log_insert_move(struct btrfs_fs_info *fs_info, |
| 568 | struct extent_buffer *eb, int dst_slot, int src_slot, |
| 569 | int nr_items, gfp_t flags) |
| 570 | { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 571 | struct tree_mod_elem *tm = NULL; |
| 572 | struct tree_mod_elem **tm_list = NULL; |
| 573 | int ret = 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 574 | int i; |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 575 | int locked = 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 576 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 577 | if (!tree_mod_need_log(fs_info, eb)) |
Jan Schmidt | f395694 | 2012-05-31 15:02:32 +0200 | [diff] [blame] | 578 | return 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 579 | |
David Sterba | 31e818f | 2015-02-20 18:00:26 +0100 | [diff] [blame] | 580 | tm_list = kcalloc(nr_items, sizeof(struct tree_mod_elem *), flags); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 581 | if (!tm_list) |
| 582 | return -ENOMEM; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 583 | |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 584 | tm = kzalloc(sizeof(*tm), flags); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 585 | if (!tm) { |
| 586 | ret = -ENOMEM; |
| 587 | goto free_tms; |
| 588 | } |
Jan Schmidt | f395694 | 2012-05-31 15:02:32 +0200 | [diff] [blame] | 589 | |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 590 | tm->logical = eb->start; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 591 | tm->slot = src_slot; |
| 592 | tm->move.dst_slot = dst_slot; |
| 593 | tm->move.nr_items = nr_items; |
| 594 | tm->op = MOD_LOG_MOVE_KEYS; |
| 595 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 596 | for (i = 0; i + dst_slot < src_slot && i < nr_items; i++) { |
| 597 | tm_list[i] = alloc_tree_mod_elem(eb, i + dst_slot, |
| 598 | MOD_LOG_KEY_REMOVE_WHILE_MOVING, flags); |
| 599 | if (!tm_list[i]) { |
| 600 | ret = -ENOMEM; |
| 601 | goto free_tms; |
| 602 | } |
| 603 | } |
| 604 | |
| 605 | if (tree_mod_dont_log(fs_info, eb)) |
| 606 | goto free_tms; |
| 607 | locked = 1; |
| 608 | |
| 609 | /* |
| 610 | * When we override something during the move, we log these removals. |
| 611 | * This can only happen when we move towards the beginning of the |
| 612 | * buffer, i.e. dst_slot < src_slot. |
| 613 | */ |
| 614 | for (i = 0; i + dst_slot < src_slot && i < nr_items; i++) { |
| 615 | ret = __tree_mod_log_insert(fs_info, tm_list[i]); |
| 616 | if (ret) |
| 617 | goto free_tms; |
| 618 | } |
| 619 | |
| 620 | ret = __tree_mod_log_insert(fs_info, tm); |
| 621 | if (ret) |
| 622 | goto free_tms; |
| 623 | tree_mod_log_write_unlock(fs_info); |
| 624 | kfree(tm_list); |
| 625 | |
| 626 | return 0; |
| 627 | free_tms: |
| 628 | for (i = 0; i < nr_items; i++) { |
| 629 | if (tm_list[i] && !RB_EMPTY_NODE(&tm_list[i]->node)) |
| 630 | rb_erase(&tm_list[i]->node, &fs_info->tree_mod_log); |
| 631 | kfree(tm_list[i]); |
| 632 | } |
| 633 | if (locked) |
| 634 | tree_mod_log_write_unlock(fs_info); |
| 635 | kfree(tm_list); |
| 636 | kfree(tm); |
| 637 | |
| 638 | return ret; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 639 | } |
| 640 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 641 | static inline int |
| 642 | __tree_mod_log_free_eb(struct btrfs_fs_info *fs_info, |
| 643 | struct tree_mod_elem **tm_list, |
| 644 | int nritems) |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 645 | { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 646 | int i, j; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 647 | int ret; |
| 648 | |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 649 | for (i = nritems - 1; i >= 0; i--) { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 650 | ret = __tree_mod_log_insert(fs_info, tm_list[i]); |
| 651 | if (ret) { |
| 652 | for (j = nritems - 1; j > i; j--) |
| 653 | rb_erase(&tm_list[j]->node, |
| 654 | &fs_info->tree_mod_log); |
| 655 | return ret; |
| 656 | } |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 657 | } |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 658 | |
| 659 | return 0; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 660 | } |
| 661 | |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 662 | static noinline int |
| 663 | tree_mod_log_insert_root(struct btrfs_fs_info *fs_info, |
| 664 | struct extent_buffer *old_root, |
Jan Schmidt | 90f8d62 | 2013-04-13 13:19:53 +0000 | [diff] [blame] | 665 | struct extent_buffer *new_root, gfp_t flags, |
| 666 | int log_removal) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 667 | { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 668 | struct tree_mod_elem *tm = NULL; |
| 669 | struct tree_mod_elem **tm_list = NULL; |
| 670 | int nritems = 0; |
| 671 | int ret = 0; |
| 672 | int i; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 673 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 674 | if (!tree_mod_need_log(fs_info, NULL)) |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 675 | return 0; |
| 676 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 677 | if (log_removal && btrfs_header_level(old_root) > 0) { |
| 678 | nritems = btrfs_header_nritems(old_root); |
David Sterba | 31e818f | 2015-02-20 18:00:26 +0100 | [diff] [blame] | 679 | tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 680 | flags); |
| 681 | if (!tm_list) { |
| 682 | ret = -ENOMEM; |
| 683 | goto free_tms; |
| 684 | } |
| 685 | for (i = 0; i < nritems; i++) { |
| 686 | tm_list[i] = alloc_tree_mod_elem(old_root, i, |
| 687 | MOD_LOG_KEY_REMOVE_WHILE_FREEING, flags); |
| 688 | if (!tm_list[i]) { |
| 689 | ret = -ENOMEM; |
| 690 | goto free_tms; |
| 691 | } |
| 692 | } |
| 693 | } |
Jan Schmidt | d9abbf1 | 2013-03-20 13:49:48 +0000 | [diff] [blame] | 694 | |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 695 | tm = kzalloc(sizeof(*tm), flags); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 696 | if (!tm) { |
| 697 | ret = -ENOMEM; |
| 698 | goto free_tms; |
| 699 | } |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 700 | |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 701 | tm->logical = new_root->start; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 702 | tm->old_root.logical = old_root->start; |
| 703 | tm->old_root.level = btrfs_header_level(old_root); |
| 704 | tm->generation = btrfs_header_generation(old_root); |
| 705 | tm->op = MOD_LOG_ROOT_REPLACE; |
| 706 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 707 | if (tree_mod_dont_log(fs_info, NULL)) |
| 708 | goto free_tms; |
| 709 | |
| 710 | if (tm_list) |
| 711 | ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems); |
| 712 | if (!ret) |
| 713 | ret = __tree_mod_log_insert(fs_info, tm); |
| 714 | |
| 715 | tree_mod_log_write_unlock(fs_info); |
| 716 | if (ret) |
| 717 | goto free_tms; |
| 718 | kfree(tm_list); |
| 719 | |
| 720 | return ret; |
| 721 | |
| 722 | free_tms: |
| 723 | if (tm_list) { |
| 724 | for (i = 0; i < nritems; i++) |
| 725 | kfree(tm_list[i]); |
| 726 | kfree(tm_list); |
| 727 | } |
| 728 | kfree(tm); |
| 729 | |
| 730 | return ret; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 731 | } |
| 732 | |
| 733 | static struct tree_mod_elem * |
| 734 | __tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq, |
| 735 | int smallest) |
| 736 | { |
| 737 | struct rb_root *tm_root; |
| 738 | struct rb_node *node; |
| 739 | struct tree_mod_elem *cur = NULL; |
| 740 | struct tree_mod_elem *found = NULL; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 741 | |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 742 | tree_mod_log_read_lock(fs_info); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 743 | tm_root = &fs_info->tree_mod_log; |
| 744 | node = tm_root->rb_node; |
| 745 | while (node) { |
| 746 | cur = container_of(node, struct tree_mod_elem, node); |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 747 | if (cur->logical < start) { |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 748 | node = node->rb_left; |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 749 | } else if (cur->logical > start) { |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 750 | node = node->rb_right; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 751 | } else if (cur->seq < min_seq) { |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 752 | node = node->rb_left; |
| 753 | } else if (!smallest) { |
| 754 | /* we want the node with the highest seq */ |
| 755 | if (found) |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 756 | BUG_ON(found->seq > cur->seq); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 757 | found = cur; |
| 758 | node = node->rb_left; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 759 | } else if (cur->seq > min_seq) { |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 760 | /* we want the node with the smallest seq */ |
| 761 | if (found) |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 762 | BUG_ON(found->seq < cur->seq); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 763 | found = cur; |
| 764 | node = node->rb_right; |
| 765 | } else { |
| 766 | found = cur; |
| 767 | break; |
| 768 | } |
| 769 | } |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 770 | tree_mod_log_read_unlock(fs_info); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 771 | |
| 772 | return found; |
| 773 | } |
| 774 | |
| 775 | /* |
| 776 | * this returns the element from the log with the smallest time sequence |
| 777 | * value that's in the log (the oldest log item). any element with a time |
| 778 | * sequence lower than min_seq will be ignored. |
| 779 | */ |
| 780 | static struct tree_mod_elem * |
| 781 | tree_mod_log_search_oldest(struct btrfs_fs_info *fs_info, u64 start, |
| 782 | u64 min_seq) |
| 783 | { |
| 784 | return __tree_mod_log_search(fs_info, start, min_seq, 1); |
| 785 | } |
| 786 | |
| 787 | /* |
| 788 | * this returns the element from the log with the largest time sequence |
| 789 | * value that's in the log (the most recent log item). any element with |
| 790 | * a time sequence lower than min_seq will be ignored. |
| 791 | */ |
| 792 | static struct tree_mod_elem * |
| 793 | tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq) |
| 794 | { |
| 795 | return __tree_mod_log_search(fs_info, start, min_seq, 0); |
| 796 | } |
| 797 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 798 | static noinline int |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 799 | tree_mod_log_eb_copy(struct btrfs_fs_info *fs_info, struct extent_buffer *dst, |
| 800 | struct extent_buffer *src, unsigned long dst_offset, |
Jan Schmidt | 90f8d62 | 2013-04-13 13:19:53 +0000 | [diff] [blame] | 801 | unsigned long src_offset, int nr_items) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 802 | { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 803 | int ret = 0; |
| 804 | struct tree_mod_elem **tm_list = NULL; |
| 805 | struct tree_mod_elem **tm_list_add, **tm_list_rem; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 806 | int i; |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 807 | int locked = 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 808 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 809 | if (!tree_mod_need_log(fs_info, NULL)) |
| 810 | return 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 811 | |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 812 | if (btrfs_header_level(dst) == 0 && btrfs_header_level(src) == 0) |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 813 | return 0; |
| 814 | |
David Sterba | 31e818f | 2015-02-20 18:00:26 +0100 | [diff] [blame] | 815 | tm_list = kcalloc(nr_items * 2, sizeof(struct tree_mod_elem *), |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 816 | GFP_NOFS); |
| 817 | if (!tm_list) |
| 818 | return -ENOMEM; |
| 819 | |
| 820 | tm_list_add = tm_list; |
| 821 | tm_list_rem = tm_list + nr_items; |
| 822 | for (i = 0; i < nr_items; i++) { |
| 823 | tm_list_rem[i] = alloc_tree_mod_elem(src, i + src_offset, |
| 824 | MOD_LOG_KEY_REMOVE, GFP_NOFS); |
| 825 | if (!tm_list_rem[i]) { |
| 826 | ret = -ENOMEM; |
| 827 | goto free_tms; |
| 828 | } |
| 829 | |
| 830 | tm_list_add[i] = alloc_tree_mod_elem(dst, i + dst_offset, |
| 831 | MOD_LOG_KEY_ADD, GFP_NOFS); |
| 832 | if (!tm_list_add[i]) { |
| 833 | ret = -ENOMEM; |
| 834 | goto free_tms; |
| 835 | } |
| 836 | } |
| 837 | |
| 838 | if (tree_mod_dont_log(fs_info, NULL)) |
| 839 | goto free_tms; |
| 840 | locked = 1; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 841 | |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 842 | for (i = 0; i < nr_items; i++) { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 843 | ret = __tree_mod_log_insert(fs_info, tm_list_rem[i]); |
| 844 | if (ret) |
| 845 | goto free_tms; |
| 846 | ret = __tree_mod_log_insert(fs_info, tm_list_add[i]); |
| 847 | if (ret) |
| 848 | goto free_tms; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 849 | } |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 850 | |
| 851 | tree_mod_log_write_unlock(fs_info); |
| 852 | kfree(tm_list); |
| 853 | |
| 854 | return 0; |
| 855 | |
| 856 | free_tms: |
| 857 | for (i = 0; i < nr_items * 2; i++) { |
| 858 | if (tm_list[i] && !RB_EMPTY_NODE(&tm_list[i]->node)) |
| 859 | rb_erase(&tm_list[i]->node, &fs_info->tree_mod_log); |
| 860 | kfree(tm_list[i]); |
| 861 | } |
| 862 | if (locked) |
| 863 | tree_mod_log_write_unlock(fs_info); |
| 864 | kfree(tm_list); |
| 865 | |
| 866 | return ret; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 867 | } |
| 868 | |
| 869 | static inline void |
| 870 | tree_mod_log_eb_move(struct btrfs_fs_info *fs_info, struct extent_buffer *dst, |
| 871 | int dst_offset, int src_offset, int nr_items) |
| 872 | { |
| 873 | int ret; |
| 874 | ret = tree_mod_log_insert_move(fs_info, dst, dst_offset, src_offset, |
| 875 | nr_items, GFP_NOFS); |
| 876 | BUG_ON(ret < 0); |
| 877 | } |
| 878 | |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 879 | static noinline void |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 880 | tree_mod_log_set_node_key(struct btrfs_fs_info *fs_info, |
Liu Bo | 32adf09 | 2012-10-19 12:52:15 +0000 | [diff] [blame] | 881 | struct extent_buffer *eb, int slot, int atomic) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 882 | { |
| 883 | int ret; |
| 884 | |
Filipe David Borba Manana | 7835776 | 2013-12-12 19:19:52 +0000 | [diff] [blame] | 885 | ret = tree_mod_log_insert_key(fs_info, eb, slot, |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 886 | MOD_LOG_KEY_REPLACE, |
| 887 | atomic ? GFP_ATOMIC : GFP_NOFS); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 888 | BUG_ON(ret < 0); |
| 889 | } |
| 890 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 891 | static noinline int |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 892 | tree_mod_log_free_eb(struct btrfs_fs_info *fs_info, struct extent_buffer *eb) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 893 | { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 894 | struct tree_mod_elem **tm_list = NULL; |
| 895 | int nritems = 0; |
| 896 | int i; |
| 897 | int ret = 0; |
| 898 | |
| 899 | if (btrfs_header_level(eb) == 0) |
| 900 | return 0; |
| 901 | |
| 902 | if (!tree_mod_need_log(fs_info, NULL)) |
| 903 | return 0; |
| 904 | |
| 905 | nritems = btrfs_header_nritems(eb); |
David Sterba | 31e818f | 2015-02-20 18:00:26 +0100 | [diff] [blame] | 906 | tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), GFP_NOFS); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 907 | if (!tm_list) |
| 908 | return -ENOMEM; |
| 909 | |
| 910 | for (i = 0; i < nritems; i++) { |
| 911 | tm_list[i] = alloc_tree_mod_elem(eb, i, |
| 912 | MOD_LOG_KEY_REMOVE_WHILE_FREEING, GFP_NOFS); |
| 913 | if (!tm_list[i]) { |
| 914 | ret = -ENOMEM; |
| 915 | goto free_tms; |
| 916 | } |
| 917 | } |
| 918 | |
Jan Schmidt | e9b7fd4 | 2012-05-31 14:59:09 +0200 | [diff] [blame] | 919 | if (tree_mod_dont_log(fs_info, eb)) |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 920 | goto free_tms; |
| 921 | |
| 922 | ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems); |
| 923 | tree_mod_log_write_unlock(fs_info); |
| 924 | if (ret) |
| 925 | goto free_tms; |
| 926 | kfree(tm_list); |
| 927 | |
| 928 | return 0; |
| 929 | |
| 930 | free_tms: |
| 931 | for (i = 0; i < nritems; i++) |
| 932 | kfree(tm_list[i]); |
| 933 | kfree(tm_list); |
| 934 | |
| 935 | return ret; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 936 | } |
| 937 | |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 938 | static noinline void |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 939 | tree_mod_log_set_root_pointer(struct btrfs_root *root, |
Jan Schmidt | 90f8d62 | 2013-04-13 13:19:53 +0000 | [diff] [blame] | 940 | struct extent_buffer *new_root_node, |
| 941 | int log_removal) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 942 | { |
| 943 | int ret; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 944 | ret = tree_mod_log_insert_root(root->fs_info, root->node, |
Jan Schmidt | 90f8d62 | 2013-04-13 13:19:53 +0000 | [diff] [blame] | 945 | new_root_node, GFP_NOFS, log_removal); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 946 | BUG_ON(ret < 0); |
| 947 | } |
| 948 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 949 | /* |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 950 | * check if the tree block can be shared by multiple trees |
| 951 | */ |
| 952 | int btrfs_block_can_be_shared(struct btrfs_root *root, |
| 953 | struct extent_buffer *buf) |
| 954 | { |
| 955 | /* |
Nicholas D Steeves | 0132761 | 2016-05-19 21:18:45 -0400 | [diff] [blame] | 956 | * Tree blocks not in reference counted trees and tree roots |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 957 | * are never shared. If a block was allocated after the last |
| 958 | * snapshot and the block was not allocated by tree relocation, |
| 959 | * we know the block is not shared. |
| 960 | */ |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 961 | if (test_bit(BTRFS_ROOT_REF_COWS, &root->state) && |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 962 | buf != root->node && buf != root->commit_root && |
| 963 | (btrfs_header_generation(buf) <= |
| 964 | btrfs_root_last_snapshot(&root->root_item) || |
| 965 | btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC))) |
| 966 | return 1; |
| 967 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 968 | if (test_bit(BTRFS_ROOT_REF_COWS, &root->state) && |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 969 | btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV) |
| 970 | return 1; |
| 971 | #endif |
| 972 | return 0; |
| 973 | } |
| 974 | |
| 975 | static noinline int update_ref_for_cow(struct btrfs_trans_handle *trans, |
| 976 | struct btrfs_root *root, |
| 977 | struct extent_buffer *buf, |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 978 | struct extent_buffer *cow, |
| 979 | int *last_ref) |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 980 | { |
| 981 | u64 refs; |
| 982 | u64 owner; |
| 983 | u64 flags; |
| 984 | u64 new_flags = 0; |
| 985 | int ret; |
| 986 | |
| 987 | /* |
| 988 | * Backrefs update rules: |
| 989 | * |
| 990 | * Always use full backrefs for extent pointers in tree block |
| 991 | * allocated by tree relocation. |
| 992 | * |
| 993 | * If a shared tree block is no longer referenced by its owner |
| 994 | * tree (btrfs_header_owner(buf) == root->root_key.objectid), |
| 995 | * use full backrefs for extent pointers in tree block. |
| 996 | * |
| 997 | * If a tree block is been relocating |
| 998 | * (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID), |
| 999 | * use full backrefs for extent pointers in tree block. |
| 1000 | * The reason for this is some operations (such as drop tree) |
| 1001 | * are only allowed for blocks use full backrefs. |
| 1002 | */ |
| 1003 | |
| 1004 | if (btrfs_block_can_be_shared(root, buf)) { |
| 1005 | ret = btrfs_lookup_extent_info(trans, root, buf->start, |
Josef Bacik | 3173a18 | 2013-03-07 14:22:04 -0500 | [diff] [blame] | 1006 | btrfs_header_level(buf), 1, |
| 1007 | &refs, &flags); |
Mark Fasheh | be1a556 | 2011-08-08 13:20:18 -0700 | [diff] [blame] | 1008 | if (ret) |
| 1009 | return ret; |
Mark Fasheh | e5df957 | 2011-08-29 14:17:04 -0700 | [diff] [blame] | 1010 | if (refs == 0) { |
| 1011 | ret = -EROFS; |
Anand Jain | 34d9700 | 2016-03-16 16:43:06 +0800 | [diff] [blame] | 1012 | btrfs_handle_fs_error(root->fs_info, ret, NULL); |
Mark Fasheh | e5df957 | 2011-08-29 14:17:04 -0700 | [diff] [blame] | 1013 | return ret; |
| 1014 | } |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1015 | } else { |
| 1016 | refs = 1; |
| 1017 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID || |
| 1018 | btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV) |
| 1019 | flags = BTRFS_BLOCK_FLAG_FULL_BACKREF; |
| 1020 | else |
| 1021 | flags = 0; |
| 1022 | } |
| 1023 | |
| 1024 | owner = btrfs_header_owner(buf); |
| 1025 | BUG_ON(owner == BTRFS_TREE_RELOC_OBJECTID && |
| 1026 | !(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)); |
| 1027 | |
| 1028 | if (refs > 1) { |
| 1029 | if ((owner == root->root_key.objectid || |
| 1030 | root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) && |
| 1031 | !(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) { |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 1032 | ret = btrfs_inc_ref(trans, root, buf, 1); |
Jeff Mahoney | 79787ea | 2012-03-12 16:03:00 +0100 | [diff] [blame] | 1033 | BUG_ON(ret); /* -ENOMEM */ |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1034 | |
| 1035 | if (root->root_key.objectid == |
| 1036 | BTRFS_TREE_RELOC_OBJECTID) { |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 1037 | ret = btrfs_dec_ref(trans, root, buf, 0); |
Jeff Mahoney | 79787ea | 2012-03-12 16:03:00 +0100 | [diff] [blame] | 1038 | BUG_ON(ret); /* -ENOMEM */ |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 1039 | ret = btrfs_inc_ref(trans, root, cow, 1); |
Jeff Mahoney | 79787ea | 2012-03-12 16:03:00 +0100 | [diff] [blame] | 1040 | BUG_ON(ret); /* -ENOMEM */ |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1041 | } |
| 1042 | new_flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF; |
| 1043 | } else { |
| 1044 | |
| 1045 | if (root->root_key.objectid == |
| 1046 | BTRFS_TREE_RELOC_OBJECTID) |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 1047 | ret = btrfs_inc_ref(trans, root, cow, 1); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1048 | else |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 1049 | ret = btrfs_inc_ref(trans, root, cow, 0); |
Jeff Mahoney | 79787ea | 2012-03-12 16:03:00 +0100 | [diff] [blame] | 1050 | BUG_ON(ret); /* -ENOMEM */ |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1051 | } |
| 1052 | if (new_flags != 0) { |
Josef Bacik | b1c79e0 | 2013-05-09 13:49:30 -0400 | [diff] [blame] | 1053 | int level = btrfs_header_level(buf); |
| 1054 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1055 | ret = btrfs_set_disk_extent_flags(trans, root, |
| 1056 | buf->start, |
| 1057 | buf->len, |
Josef Bacik | b1c79e0 | 2013-05-09 13:49:30 -0400 | [diff] [blame] | 1058 | new_flags, level, 0); |
Mark Fasheh | be1a556 | 2011-08-08 13:20:18 -0700 | [diff] [blame] | 1059 | if (ret) |
| 1060 | return ret; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1061 | } |
| 1062 | } else { |
| 1063 | if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) { |
| 1064 | if (root->root_key.objectid == |
| 1065 | BTRFS_TREE_RELOC_OBJECTID) |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 1066 | ret = btrfs_inc_ref(trans, root, cow, 1); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1067 | else |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 1068 | ret = btrfs_inc_ref(trans, root, cow, 0); |
Jeff Mahoney | 79787ea | 2012-03-12 16:03:00 +0100 | [diff] [blame] | 1069 | BUG_ON(ret); /* -ENOMEM */ |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 1070 | ret = btrfs_dec_ref(trans, root, buf, 1); |
Jeff Mahoney | 79787ea | 2012-03-12 16:03:00 +0100 | [diff] [blame] | 1071 | BUG_ON(ret); /* -ENOMEM */ |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1072 | } |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 1073 | clean_tree_block(trans, root->fs_info, buf); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1074 | *last_ref = 1; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1075 | } |
| 1076 | return 0; |
| 1077 | } |
| 1078 | |
| 1079 | /* |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1080 | * does the dirty work in cow of a single block. The parent block (if |
| 1081 | * supplied) is updated to point to the new cow copy. The new buffer is marked |
| 1082 | * dirty and returned locked. If you modify the block it needs to be marked |
| 1083 | * dirty again. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1084 | * |
| 1085 | * search_start -- an allocation hint for the new block |
| 1086 | * |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1087 | * empty_size -- a hint that you plan on doing more cow. This is the size in |
| 1088 | * bytes the allocator should try to find free next to the block it returns. |
| 1089 | * This is just a hint and may be ignored by the allocator. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1090 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1091 | static noinline int __btrfs_cow_block(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1092 | struct btrfs_root *root, |
| 1093 | struct extent_buffer *buf, |
| 1094 | struct extent_buffer *parent, int parent_slot, |
| 1095 | struct extent_buffer **cow_ret, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1096 | u64 search_start, u64 empty_size) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1097 | { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1098 | struct btrfs_disk_key disk_key; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1099 | struct extent_buffer *cow; |
Mark Fasheh | be1a556 | 2011-08-08 13:20:18 -0700 | [diff] [blame] | 1100 | int level, ret; |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1101 | int last_ref = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1102 | int unlock_orig = 0; |
Goldwyn Rodrigues | 0f5053e | 2016-09-22 14:11:34 -0500 | [diff] [blame] | 1103 | u64 parent_start = 0; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1104 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1105 | if (*cow_ret == buf) |
| 1106 | unlock_orig = 1; |
| 1107 | |
Chris Mason | b9447ef | 2009-03-09 11:45:38 -0400 | [diff] [blame] | 1108 | btrfs_assert_tree_locked(buf); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1109 | |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 1110 | WARN_ON(test_bit(BTRFS_ROOT_REF_COWS, &root->state) && |
| 1111 | trans->transid != root->fs_info->running_transaction->transid); |
| 1112 | WARN_ON(test_bit(BTRFS_ROOT_REF_COWS, &root->state) && |
| 1113 | trans->transid != root->last_trans); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1114 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 1115 | level = btrfs_header_level(buf); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 1116 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1117 | if (level == 0) |
| 1118 | btrfs_item_key(buf, &disk_key, 0); |
| 1119 | else |
| 1120 | btrfs_node_key(buf, &disk_key, 0); |
| 1121 | |
Goldwyn Rodrigues | 0f5053e | 2016-09-22 14:11:34 -0500 | [diff] [blame] | 1122 | if ((root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) && parent) |
| 1123 | parent_start = parent->start; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1124 | |
David Sterba | 4d75f8a | 2014-06-15 01:54:12 +0200 | [diff] [blame] | 1125 | cow = btrfs_alloc_tree_block(trans, root, parent_start, |
| 1126 | root->root_key.objectid, &disk_key, level, |
| 1127 | search_start, empty_size); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1128 | if (IS_ERR(cow)) |
| 1129 | return PTR_ERR(cow); |
| 1130 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1131 | /* cow is set to blocking by btrfs_init_new_buffer */ |
| 1132 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1133 | copy_extent_buffer(cow, buf, 0, 0, cow->len); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 1134 | btrfs_set_header_bytenr(cow, cow->start); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1135 | btrfs_set_header_generation(cow, trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1136 | btrfs_set_header_backref_rev(cow, BTRFS_MIXED_BACKREF_REV); |
| 1137 | btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN | |
| 1138 | BTRFS_HEADER_FLAG_RELOC); |
| 1139 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) |
| 1140 | btrfs_set_header_flag(cow, BTRFS_HEADER_FLAG_RELOC); |
| 1141 | else |
| 1142 | btrfs_set_header_owner(cow, root->root_key.objectid); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1143 | |
Ross Kirk | 0a4e558 | 2013-09-24 10:12:38 +0100 | [diff] [blame] | 1144 | write_extent_buffer(cow, root->fs_info->fsid, btrfs_header_fsid(), |
Yan Zheng | 2b82032 | 2008-11-17 21:11:30 -0500 | [diff] [blame] | 1145 | BTRFS_FSID_SIZE); |
| 1146 | |
Mark Fasheh | be1a556 | 2011-08-08 13:20:18 -0700 | [diff] [blame] | 1147 | ret = update_ref_for_cow(trans, root, buf, cow, &last_ref); |
Mark Fasheh | b68dc2a | 2011-08-29 14:30:39 -0700 | [diff] [blame] | 1148 | if (ret) { |
Jeff Mahoney | 6664283 | 2016-06-10 18:19:25 -0400 | [diff] [blame] | 1149 | btrfs_abort_transaction(trans, ret); |
Mark Fasheh | b68dc2a | 2011-08-29 14:30:39 -0700 | [diff] [blame] | 1150 | return ret; |
| 1151 | } |
Zheng Yan | 1a40e23 | 2008-09-26 10:09:34 -0400 | [diff] [blame] | 1152 | |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 1153 | if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { |
Josef Bacik | 83d4cfd | 2013-08-30 15:09:51 -0400 | [diff] [blame] | 1154 | ret = btrfs_reloc_cow_block(trans, root, buf, cow); |
Zhaolei | 93314e3 | 2015-08-06 21:56:58 +0800 | [diff] [blame] | 1155 | if (ret) { |
Jeff Mahoney | 6664283 | 2016-06-10 18:19:25 -0400 | [diff] [blame] | 1156 | btrfs_abort_transaction(trans, ret); |
Josef Bacik | 83d4cfd | 2013-08-30 15:09:51 -0400 | [diff] [blame] | 1157 | return ret; |
Zhaolei | 93314e3 | 2015-08-06 21:56:58 +0800 | [diff] [blame] | 1158 | } |
Josef Bacik | 83d4cfd | 2013-08-30 15:09:51 -0400 | [diff] [blame] | 1159 | } |
Yan, Zheng | 3fd0a55 | 2010-05-16 10:49:59 -0400 | [diff] [blame] | 1160 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1161 | if (buf == root->node) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1162 | WARN_ON(parent && parent != buf); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1163 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID || |
| 1164 | btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV) |
| 1165 | parent_start = buf->start; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1166 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1167 | extent_buffer_get(cow); |
Jan Schmidt | 90f8d62 | 2013-04-13 13:19:53 +0000 | [diff] [blame] | 1168 | tree_mod_log_set_root_pointer(root, cow, 1); |
Chris Mason | 240f62c | 2011-03-23 14:54:42 -0400 | [diff] [blame] | 1169 | rcu_assign_pointer(root->node, cow); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1170 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1171 | btrfs_free_tree_block(trans, root, buf, parent_start, |
Jan Schmidt | 5581a51 | 2012-05-16 17:04:52 +0200 | [diff] [blame] | 1172 | last_ref); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1173 | free_extent_buffer(buf); |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 1174 | add_root_to_dirty_list(root); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1175 | } else { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1176 | WARN_ON(trans->transid != btrfs_header_generation(parent)); |
Jan Schmidt | f230475 | 2012-05-26 11:43:17 +0200 | [diff] [blame] | 1177 | tree_mod_log_insert_key(root->fs_info, parent, parent_slot, |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 1178 | MOD_LOG_KEY_REPLACE, GFP_NOFS); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1179 | btrfs_set_node_blockptr(parent, parent_slot, |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 1180 | cow->start); |
Chris Mason | 74493f7 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 1181 | btrfs_set_node_ptr_generation(parent, parent_slot, |
| 1182 | trans->transid); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1183 | btrfs_mark_buffer_dirty(parent); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 1184 | if (last_ref) { |
| 1185 | ret = tree_mod_log_free_eb(root->fs_info, buf); |
| 1186 | if (ret) { |
Jeff Mahoney | 6664283 | 2016-06-10 18:19:25 -0400 | [diff] [blame] | 1187 | btrfs_abort_transaction(trans, ret); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 1188 | return ret; |
| 1189 | } |
| 1190 | } |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1191 | btrfs_free_tree_block(trans, root, buf, parent_start, |
Jan Schmidt | 5581a51 | 2012-05-16 17:04:52 +0200 | [diff] [blame] | 1192 | last_ref); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1193 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1194 | if (unlock_orig) |
| 1195 | btrfs_tree_unlock(buf); |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 1196 | free_extent_buffer_stale(buf); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1197 | btrfs_mark_buffer_dirty(cow); |
| 1198 | *cow_ret = cow; |
| 1199 | return 0; |
| 1200 | } |
| 1201 | |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1202 | /* |
| 1203 | * returns the logical address of the oldest predecessor of the given root. |
| 1204 | * entries older than time_seq are ignored. |
| 1205 | */ |
| 1206 | static struct tree_mod_elem * |
| 1207 | __tree_mod_log_oldest_root(struct btrfs_fs_info *fs_info, |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1208 | struct extent_buffer *eb_root, u64 time_seq) |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1209 | { |
| 1210 | struct tree_mod_elem *tm; |
| 1211 | struct tree_mod_elem *found = NULL; |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1212 | u64 root_logical = eb_root->start; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1213 | int looped = 0; |
| 1214 | |
| 1215 | if (!time_seq) |
Stefan Behrens | 35a3621 | 2013-08-14 18:12:25 +0200 | [diff] [blame] | 1216 | return NULL; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1217 | |
| 1218 | /* |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 1219 | * the very last operation that's logged for a root is the |
| 1220 | * replacement operation (if it is replaced at all). this has |
| 1221 | * the logical address of the *new* root, making it the very |
| 1222 | * first operation that's logged for this root. |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1223 | */ |
| 1224 | while (1) { |
| 1225 | tm = tree_mod_log_search_oldest(fs_info, root_logical, |
| 1226 | time_seq); |
| 1227 | if (!looped && !tm) |
Stefan Behrens | 35a3621 | 2013-08-14 18:12:25 +0200 | [diff] [blame] | 1228 | return NULL; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1229 | /* |
Jan Schmidt | 28da9fb | 2012-06-21 10:59:13 +0200 | [diff] [blame] | 1230 | * if there are no tree operation for the oldest root, we simply |
| 1231 | * return it. this should only happen if that (old) root is at |
| 1232 | * level 0. |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1233 | */ |
Jan Schmidt | 28da9fb | 2012-06-21 10:59:13 +0200 | [diff] [blame] | 1234 | if (!tm) |
| 1235 | break; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1236 | |
Jan Schmidt | 28da9fb | 2012-06-21 10:59:13 +0200 | [diff] [blame] | 1237 | /* |
| 1238 | * if there's an operation that's not a root replacement, we |
| 1239 | * found the oldest version of our root. normally, we'll find a |
| 1240 | * MOD_LOG_KEY_REMOVE_WHILE_FREEING operation here. |
| 1241 | */ |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1242 | if (tm->op != MOD_LOG_ROOT_REPLACE) |
| 1243 | break; |
| 1244 | |
| 1245 | found = tm; |
| 1246 | root_logical = tm->old_root.logical; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1247 | looped = 1; |
| 1248 | } |
| 1249 | |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1250 | /* if there's no old root to return, return what we found instead */ |
| 1251 | if (!found) |
| 1252 | found = tm; |
| 1253 | |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1254 | return found; |
| 1255 | } |
| 1256 | |
| 1257 | /* |
| 1258 | * tm is a pointer to the first operation to rewind within eb. then, all |
Nicholas D Steeves | 0132761 | 2016-05-19 21:18:45 -0400 | [diff] [blame] | 1259 | * previous operations will be rewound (until we reach something older than |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1260 | * time_seq). |
| 1261 | */ |
| 1262 | static void |
Josef Bacik | f1ca7e98 | 2013-06-29 23:15:19 -0400 | [diff] [blame] | 1263 | __tree_mod_log_rewind(struct btrfs_fs_info *fs_info, struct extent_buffer *eb, |
| 1264 | u64 time_seq, struct tree_mod_elem *first_tm) |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1265 | { |
| 1266 | u32 n; |
| 1267 | struct rb_node *next; |
| 1268 | struct tree_mod_elem *tm = first_tm; |
| 1269 | unsigned long o_dst; |
| 1270 | unsigned long o_src; |
| 1271 | unsigned long p_size = sizeof(struct btrfs_key_ptr); |
| 1272 | |
| 1273 | n = btrfs_header_nritems(eb); |
Josef Bacik | f1ca7e98 | 2013-06-29 23:15:19 -0400 | [diff] [blame] | 1274 | tree_mod_log_read_lock(fs_info); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 1275 | while (tm && tm->seq >= time_seq) { |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1276 | /* |
| 1277 | * all the operations are recorded with the operator used for |
| 1278 | * the modification. as we're going backwards, we do the |
| 1279 | * opposite of each operation here. |
| 1280 | */ |
| 1281 | switch (tm->op) { |
| 1282 | case MOD_LOG_KEY_REMOVE_WHILE_FREEING: |
| 1283 | BUG_ON(tm->slot < n); |
Eric Sandeen | 1c697d4 | 2013-01-31 00:54:56 +0000 | [diff] [blame] | 1284 | /* Fallthrough */ |
Liu Bo | 95c80bb | 2012-10-19 09:50:52 +0000 | [diff] [blame] | 1285 | case MOD_LOG_KEY_REMOVE_WHILE_MOVING: |
Chris Mason | 4c3e696 | 2012-12-18 15:43:18 -0500 | [diff] [blame] | 1286 | case MOD_LOG_KEY_REMOVE: |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1287 | btrfs_set_node_key(eb, &tm->key, tm->slot); |
| 1288 | btrfs_set_node_blockptr(eb, tm->slot, tm->blockptr); |
| 1289 | btrfs_set_node_ptr_generation(eb, tm->slot, |
| 1290 | tm->generation); |
Chris Mason | 4c3e696 | 2012-12-18 15:43:18 -0500 | [diff] [blame] | 1291 | n++; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1292 | break; |
| 1293 | case MOD_LOG_KEY_REPLACE: |
| 1294 | BUG_ON(tm->slot >= n); |
| 1295 | btrfs_set_node_key(eb, &tm->key, tm->slot); |
| 1296 | btrfs_set_node_blockptr(eb, tm->slot, tm->blockptr); |
| 1297 | btrfs_set_node_ptr_generation(eb, tm->slot, |
| 1298 | tm->generation); |
| 1299 | break; |
| 1300 | case MOD_LOG_KEY_ADD: |
Jan Schmidt | 19956c7 | 2012-06-22 14:52:13 +0200 | [diff] [blame] | 1301 | /* if a move operation is needed it's in the log */ |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1302 | n--; |
| 1303 | break; |
| 1304 | case MOD_LOG_MOVE_KEYS: |
Jan Schmidt | c319310 | 2012-05-31 19:24:36 +0200 | [diff] [blame] | 1305 | o_dst = btrfs_node_key_ptr_offset(tm->slot); |
| 1306 | o_src = btrfs_node_key_ptr_offset(tm->move.dst_slot); |
| 1307 | memmove_extent_buffer(eb, o_dst, o_src, |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1308 | tm->move.nr_items * p_size); |
| 1309 | break; |
| 1310 | case MOD_LOG_ROOT_REPLACE: |
| 1311 | /* |
| 1312 | * this operation is special. for roots, this must be |
| 1313 | * handled explicitly before rewinding. |
| 1314 | * for non-roots, this operation may exist if the node |
| 1315 | * was a root: root A -> child B; then A gets empty and |
| 1316 | * B is promoted to the new root. in the mod log, we'll |
| 1317 | * have a root-replace operation for B, a tree block |
| 1318 | * that is no root. we simply ignore that operation. |
| 1319 | */ |
| 1320 | break; |
| 1321 | } |
| 1322 | next = rb_next(&tm->node); |
| 1323 | if (!next) |
| 1324 | break; |
| 1325 | tm = container_of(next, struct tree_mod_elem, node); |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 1326 | if (tm->logical != first_tm->logical) |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1327 | break; |
| 1328 | } |
Josef Bacik | f1ca7e98 | 2013-06-29 23:15:19 -0400 | [diff] [blame] | 1329 | tree_mod_log_read_unlock(fs_info); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1330 | btrfs_set_header_nritems(eb, n); |
| 1331 | } |
| 1332 | |
Jan Schmidt | 47fb091 | 2013-04-13 13:19:55 +0000 | [diff] [blame] | 1333 | /* |
Nicholas D Steeves | 0132761 | 2016-05-19 21:18:45 -0400 | [diff] [blame] | 1334 | * Called with eb read locked. If the buffer cannot be rewound, the same buffer |
Jan Schmidt | 47fb091 | 2013-04-13 13:19:55 +0000 | [diff] [blame] | 1335 | * is returned. If rewind operations happen, a fresh buffer is returned. The |
| 1336 | * returned buffer is always read-locked. If the returned buffer is not the |
| 1337 | * input buffer, the lock on the input buffer is released and the input buffer |
| 1338 | * is freed (its refcount is decremented). |
| 1339 | */ |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1340 | static struct extent_buffer * |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1341 | tree_mod_log_rewind(struct btrfs_fs_info *fs_info, struct btrfs_path *path, |
| 1342 | struct extent_buffer *eb, u64 time_seq) |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1343 | { |
| 1344 | struct extent_buffer *eb_rewin; |
| 1345 | struct tree_mod_elem *tm; |
| 1346 | |
| 1347 | if (!time_seq) |
| 1348 | return eb; |
| 1349 | |
| 1350 | if (btrfs_header_level(eb) == 0) |
| 1351 | return eb; |
| 1352 | |
| 1353 | tm = tree_mod_log_search(fs_info, eb->start, time_seq); |
| 1354 | if (!tm) |
| 1355 | return eb; |
| 1356 | |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1357 | btrfs_set_path_blocking(path); |
| 1358 | btrfs_set_lock_blocking_rw(eb, BTRFS_READ_LOCK); |
| 1359 | |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1360 | if (tm->op == MOD_LOG_KEY_REMOVE_WHILE_FREEING) { |
| 1361 | BUG_ON(tm->slot != 0); |
Feifei Xu | b9ef22d | 2016-06-01 19:18:25 +0800 | [diff] [blame] | 1362 | eb_rewin = alloc_dummy_extent_buffer(fs_info, eb->start, |
| 1363 | eb->len); |
Josef Bacik | db7f343 | 2013-08-07 14:54:37 -0400 | [diff] [blame] | 1364 | if (!eb_rewin) { |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1365 | btrfs_tree_read_unlock_blocking(eb); |
Josef Bacik | db7f343 | 2013-08-07 14:54:37 -0400 | [diff] [blame] | 1366 | free_extent_buffer(eb); |
| 1367 | return NULL; |
| 1368 | } |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1369 | btrfs_set_header_bytenr(eb_rewin, eb->start); |
| 1370 | btrfs_set_header_backref_rev(eb_rewin, |
| 1371 | btrfs_header_backref_rev(eb)); |
| 1372 | btrfs_set_header_owner(eb_rewin, btrfs_header_owner(eb)); |
Jan Schmidt | c319310 | 2012-05-31 19:24:36 +0200 | [diff] [blame] | 1373 | btrfs_set_header_level(eb_rewin, btrfs_header_level(eb)); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1374 | } else { |
| 1375 | eb_rewin = btrfs_clone_extent_buffer(eb); |
Josef Bacik | db7f343 | 2013-08-07 14:54:37 -0400 | [diff] [blame] | 1376 | if (!eb_rewin) { |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1377 | btrfs_tree_read_unlock_blocking(eb); |
Josef Bacik | db7f343 | 2013-08-07 14:54:37 -0400 | [diff] [blame] | 1378 | free_extent_buffer(eb); |
| 1379 | return NULL; |
| 1380 | } |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1381 | } |
| 1382 | |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1383 | btrfs_clear_path_blocking(path, NULL, BTRFS_READ_LOCK); |
| 1384 | btrfs_tree_read_unlock_blocking(eb); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1385 | free_extent_buffer(eb); |
| 1386 | |
Jan Schmidt | 47fb091 | 2013-04-13 13:19:55 +0000 | [diff] [blame] | 1387 | extent_buffer_get(eb_rewin); |
| 1388 | btrfs_tree_read_lock(eb_rewin); |
Josef Bacik | f1ca7e98 | 2013-06-29 23:15:19 -0400 | [diff] [blame] | 1389 | __tree_mod_log_rewind(fs_info, eb_rewin, time_seq, tm); |
Jan Schmidt | 57911b8 | 2012-10-19 09:22:03 +0200 | [diff] [blame] | 1390 | WARN_ON(btrfs_header_nritems(eb_rewin) > |
Arne Jansen | 2a745b1 | 2013-02-13 04:20:01 -0700 | [diff] [blame] | 1391 | BTRFS_NODEPTRS_PER_BLOCK(fs_info->tree_root)); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1392 | |
| 1393 | return eb_rewin; |
| 1394 | } |
| 1395 | |
Jan Schmidt | 8ba97a1 | 2012-06-04 16:54:57 +0200 | [diff] [blame] | 1396 | /* |
| 1397 | * get_old_root() rewinds the state of @root's root node to the given @time_seq |
| 1398 | * value. If there are no changes, the current root->root_node is returned. If |
| 1399 | * anything changed in between, there's a fresh buffer allocated on which the |
| 1400 | * rewind operations are done. In any case, the returned buffer is read locked. |
| 1401 | * Returns NULL on error (with no locks held). |
| 1402 | */ |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1403 | static inline struct extent_buffer * |
| 1404 | get_old_root(struct btrfs_root *root, u64 time_seq) |
| 1405 | { |
| 1406 | struct tree_mod_elem *tm; |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1407 | struct extent_buffer *eb = NULL; |
| 1408 | struct extent_buffer *eb_root; |
Filipe Manana | f0ed93d | 2019-08-12 19:14:29 +0100 | [diff] [blame] | 1409 | u64 eb_root_owner = 0; |
Liu Bo | 7bfdcf7 | 2012-10-25 07:30:19 -0600 | [diff] [blame] | 1410 | struct extent_buffer *old; |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1411 | struct tree_mod_root *old_root = NULL; |
Chris Mason | 4325edd | 2012-06-15 20:02:02 -0400 | [diff] [blame] | 1412 | u64 old_generation = 0; |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1413 | u64 logical; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1414 | |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1415 | eb_root = btrfs_read_lock_root_node(root); |
| 1416 | tm = __tree_mod_log_oldest_root(root->fs_info, eb_root, time_seq); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1417 | if (!tm) |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1418 | return eb_root; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1419 | |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1420 | if (tm->op == MOD_LOG_ROOT_REPLACE) { |
| 1421 | old_root = &tm->old_root; |
| 1422 | old_generation = tm->generation; |
| 1423 | logical = old_root->logical; |
| 1424 | } else { |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1425 | logical = eb_root->start; |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1426 | } |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1427 | |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1428 | tm = tree_mod_log_search(root->fs_info, logical, time_seq); |
Jan Schmidt | 834328a | 2012-10-23 11:27:33 +0200 | [diff] [blame] | 1429 | if (old_root && tm && tm->op != MOD_LOG_KEY_REMOVE_WHILE_FREEING) { |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1430 | btrfs_tree_read_unlock(eb_root); |
| 1431 | free_extent_buffer(eb_root); |
David Sterba | ce86cd5 | 2014-06-15 01:07:32 +0200 | [diff] [blame] | 1432 | old = read_tree_block(root, logical, 0); |
Liu Bo | 64c043d | 2015-05-25 17:30:15 +0800 | [diff] [blame] | 1433 | if (WARN_ON(IS_ERR(old) || !extent_buffer_uptodate(old))) { |
| 1434 | if (!IS_ERR(old)) |
| 1435 | free_extent_buffer(old); |
Frank Holton | efe120a | 2013-12-20 11:37:06 -0500 | [diff] [blame] | 1436 | btrfs_warn(root->fs_info, |
| 1437 | "failed to read tree block %llu from get_old_root", logical); |
Jan Schmidt | 834328a | 2012-10-23 11:27:33 +0200 | [diff] [blame] | 1438 | } else { |
Liu Bo | 7bfdcf7 | 2012-10-25 07:30:19 -0600 | [diff] [blame] | 1439 | eb = btrfs_clone_extent_buffer(old); |
| 1440 | free_extent_buffer(old); |
Jan Schmidt | 834328a | 2012-10-23 11:27:33 +0200 | [diff] [blame] | 1441 | } |
| 1442 | } else if (old_root) { |
Filipe Manana | f0ed93d | 2019-08-12 19:14:29 +0100 | [diff] [blame] | 1443 | eb_root_owner = btrfs_header_owner(eb_root); |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1444 | btrfs_tree_read_unlock(eb_root); |
| 1445 | free_extent_buffer(eb_root); |
Feifei Xu | b9ef22d | 2016-06-01 19:18:25 +0800 | [diff] [blame] | 1446 | eb = alloc_dummy_extent_buffer(root->fs_info, logical, |
| 1447 | root->nodesize); |
Jan Schmidt | 834328a | 2012-10-23 11:27:33 +0200 | [diff] [blame] | 1448 | } else { |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1449 | btrfs_set_lock_blocking_rw(eb_root, BTRFS_READ_LOCK); |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1450 | eb = btrfs_clone_extent_buffer(eb_root); |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1451 | btrfs_tree_read_unlock_blocking(eb_root); |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1452 | free_extent_buffer(eb_root); |
Jan Schmidt | 834328a | 2012-10-23 11:27:33 +0200 | [diff] [blame] | 1453 | } |
| 1454 | |
Jan Schmidt | 8ba97a1 | 2012-06-04 16:54:57 +0200 | [diff] [blame] | 1455 | if (!eb) |
| 1456 | return NULL; |
Jan Schmidt | d638108 | 2012-10-23 14:21:05 +0200 | [diff] [blame] | 1457 | extent_buffer_get(eb); |
Jan Schmidt | 8ba97a1 | 2012-06-04 16:54:57 +0200 | [diff] [blame] | 1458 | btrfs_tree_read_lock(eb); |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1459 | if (old_root) { |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1460 | btrfs_set_header_bytenr(eb, eb->start); |
| 1461 | btrfs_set_header_backref_rev(eb, BTRFS_MIXED_BACKREF_REV); |
Filipe Manana | f0ed93d | 2019-08-12 19:14:29 +0100 | [diff] [blame] | 1462 | btrfs_set_header_owner(eb, eb_root_owner); |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1463 | btrfs_set_header_level(eb, old_root->level); |
| 1464 | btrfs_set_header_generation(eb, old_generation); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1465 | } |
Jan Schmidt | 28da9fb | 2012-06-21 10:59:13 +0200 | [diff] [blame] | 1466 | if (tm) |
Josef Bacik | f1ca7e98 | 2013-06-29 23:15:19 -0400 | [diff] [blame] | 1467 | __tree_mod_log_rewind(root->fs_info, eb, time_seq, tm); |
Jan Schmidt | 28da9fb | 2012-06-21 10:59:13 +0200 | [diff] [blame] | 1468 | else |
| 1469 | WARN_ON(btrfs_header_level(eb) != 0); |
Jan Schmidt | 57911b8 | 2012-10-19 09:22:03 +0200 | [diff] [blame] | 1470 | WARN_ON(btrfs_header_nritems(eb) > BTRFS_NODEPTRS_PER_BLOCK(root)); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1471 | |
| 1472 | return eb; |
| 1473 | } |
| 1474 | |
Jan Schmidt | 5b6602e | 2012-10-23 11:28:27 +0200 | [diff] [blame] | 1475 | int btrfs_old_root_level(struct btrfs_root *root, u64 time_seq) |
| 1476 | { |
| 1477 | struct tree_mod_elem *tm; |
| 1478 | int level; |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1479 | struct extent_buffer *eb_root = btrfs_root_node(root); |
Jan Schmidt | 5b6602e | 2012-10-23 11:28:27 +0200 | [diff] [blame] | 1480 | |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1481 | tm = __tree_mod_log_oldest_root(root->fs_info, eb_root, time_seq); |
Jan Schmidt | 5b6602e | 2012-10-23 11:28:27 +0200 | [diff] [blame] | 1482 | if (tm && tm->op == MOD_LOG_ROOT_REPLACE) { |
| 1483 | level = tm->old_root.level; |
| 1484 | } else { |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1485 | level = btrfs_header_level(eb_root); |
Jan Schmidt | 5b6602e | 2012-10-23 11:28:27 +0200 | [diff] [blame] | 1486 | } |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1487 | free_extent_buffer(eb_root); |
Jan Schmidt | 5b6602e | 2012-10-23 11:28:27 +0200 | [diff] [blame] | 1488 | |
| 1489 | return level; |
| 1490 | } |
| 1491 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1492 | static inline int should_cow_block(struct btrfs_trans_handle *trans, |
| 1493 | struct btrfs_root *root, |
| 1494 | struct extent_buffer *buf) |
| 1495 | { |
Jeff Mahoney | f5ee5c9 | 2016-06-21 09:52:41 -0400 | [diff] [blame] | 1496 | if (btrfs_is_testing(root->fs_info)) |
Josef Bacik | faa2dbf | 2014-05-07 17:06:09 -0400 | [diff] [blame] | 1497 | return 0; |
David Sterba | fccb84c | 2014-09-29 23:53:21 +0200 | [diff] [blame] | 1498 | |
Liu Bo | f1ebcc7 | 2011-11-14 20:48:06 -0500 | [diff] [blame] | 1499 | /* ensure we can see the force_cow */ |
| 1500 | smp_rmb(); |
| 1501 | |
| 1502 | /* |
| 1503 | * We do not need to cow a block if |
| 1504 | * 1) this block is not created or changed in this transaction; |
| 1505 | * 2) this block does not belong to TREE_RELOC tree; |
| 1506 | * 3) the root is not forced COW. |
| 1507 | * |
| 1508 | * What is forced COW: |
Nicholas D Steeves | 0132761 | 2016-05-19 21:18:45 -0400 | [diff] [blame] | 1509 | * when we create snapshot during committing the transaction, |
Liu Bo | f1ebcc7 | 2011-11-14 20:48:06 -0500 | [diff] [blame] | 1510 | * after we've finished coping src root, we must COW the shared |
| 1511 | * block to ensure the metadata consistency. |
| 1512 | */ |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1513 | if (btrfs_header_generation(buf) == trans->transid && |
| 1514 | !btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN) && |
| 1515 | !(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID && |
Liu Bo | f1ebcc7 | 2011-11-14 20:48:06 -0500 | [diff] [blame] | 1516 | btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC)) && |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 1517 | !test_bit(BTRFS_ROOT_FORCE_COW, &root->state)) |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1518 | return 0; |
| 1519 | return 1; |
| 1520 | } |
| 1521 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1522 | /* |
| 1523 | * cows a single block, see __btrfs_cow_block for the real work. |
Nicholas D Steeves | 0132761 | 2016-05-19 21:18:45 -0400 | [diff] [blame] | 1524 | * This version of it has extra checks so that a block isn't COWed more than |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1525 | * once per transaction, as long as it hasn't been written yet |
| 1526 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1527 | noinline int btrfs_cow_block(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1528 | struct btrfs_root *root, struct extent_buffer *buf, |
| 1529 | struct extent_buffer *parent, int parent_slot, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1530 | struct extent_buffer **cow_ret) |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 1531 | { |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1532 | u64 search_start; |
Chris Mason | f510cfe | 2007-10-15 16:14:48 -0400 | [diff] [blame] | 1533 | int ret; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 1534 | |
Julia Lawall | 31b1a2b | 2012-11-03 10:58:34 +0000 | [diff] [blame] | 1535 | if (trans->transaction != root->fs_info->running_transaction) |
| 1536 | WARN(1, KERN_CRIT "trans %llu running %llu\n", |
Geert Uytterhoeven | c1c9ff7 | 2013-08-20 13:20:07 +0200 | [diff] [blame] | 1537 | trans->transid, |
Chris Mason | ccd467d | 2007-06-28 15:57:36 -0400 | [diff] [blame] | 1538 | root->fs_info->running_transaction->transid); |
Julia Lawall | 31b1a2b | 2012-11-03 10:58:34 +0000 | [diff] [blame] | 1539 | |
| 1540 | if (trans->transid != root->fs_info->generation) |
| 1541 | WARN(1, KERN_CRIT "trans %llu running %llu\n", |
Geert Uytterhoeven | c1c9ff7 | 2013-08-20 13:20:07 +0200 | [diff] [blame] | 1542 | trans->transid, root->fs_info->generation); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 1543 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1544 | if (!should_cow_block(trans, root, buf)) { |
Jeff Mahoney | 64c1292 | 2016-06-08 00:36:38 -0400 | [diff] [blame] | 1545 | trans->dirty = true; |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 1546 | *cow_ret = buf; |
| 1547 | return 0; |
| 1548 | } |
Chris Mason | c487685 | 2009-02-04 09:24:25 -0500 | [diff] [blame] | 1549 | |
Byongho Lee | ee22184 | 2015-12-15 01:42:10 +0900 | [diff] [blame] | 1550 | search_start = buf->start & ~((u64)SZ_1G - 1); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1551 | |
| 1552 | if (parent) |
| 1553 | btrfs_set_lock_blocking(parent); |
| 1554 | btrfs_set_lock_blocking(buf); |
| 1555 | |
Chris Mason | f510cfe | 2007-10-15 16:14:48 -0400 | [diff] [blame] | 1556 | ret = __btrfs_cow_block(trans, root, buf, parent, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1557 | parent_slot, cow_ret, search_start, 0); |
liubo | 1abe9b8 | 2011-03-24 11:18:59 +0000 | [diff] [blame] | 1558 | |
| 1559 | trace_btrfs_cow_block(root, buf, *cow_ret); |
| 1560 | |
Chris Mason | f510cfe | 2007-10-15 16:14:48 -0400 | [diff] [blame] | 1561 | return ret; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1562 | } |
| 1563 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1564 | /* |
| 1565 | * helper function for defrag to decide if two blocks pointed to by a |
| 1566 | * node are actually close by |
| 1567 | */ |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1568 | static int close_blocks(u64 blocknr, u64 other, u32 blocksize) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1569 | { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1570 | if (blocknr < other && other - (blocknr + blocksize) < 32768) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1571 | return 1; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1572 | if (blocknr > other && blocknr - (other + blocksize) < 32768) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1573 | return 1; |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 1574 | return 0; |
| 1575 | } |
| 1576 | |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 1577 | /* |
| 1578 | * compare two keys in a memcmp fashion |
| 1579 | */ |
| 1580 | static int comp_keys(struct btrfs_disk_key *disk, struct btrfs_key *k2) |
| 1581 | { |
| 1582 | struct btrfs_key k1; |
| 1583 | |
| 1584 | btrfs_disk_key_to_cpu(&k1, disk); |
| 1585 | |
Diego Calleja | 20736ab | 2009-07-24 11:06:52 -0400 | [diff] [blame] | 1586 | return btrfs_comp_cpu_keys(&k1, k2); |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 1587 | } |
| 1588 | |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 1589 | /* |
| 1590 | * same as comp_keys only with two btrfs_key's |
| 1591 | */ |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1592 | int btrfs_comp_cpu_keys(struct btrfs_key *k1, struct btrfs_key *k2) |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 1593 | { |
| 1594 | if (k1->objectid > k2->objectid) |
| 1595 | return 1; |
| 1596 | if (k1->objectid < k2->objectid) |
| 1597 | return -1; |
| 1598 | if (k1->type > k2->type) |
| 1599 | return 1; |
| 1600 | if (k1->type < k2->type) |
| 1601 | return -1; |
| 1602 | if (k1->offset > k2->offset) |
| 1603 | return 1; |
| 1604 | if (k1->offset < k2->offset) |
| 1605 | return -1; |
| 1606 | return 0; |
| 1607 | } |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 1608 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1609 | /* |
| 1610 | * this is used by the defrag code to go through all the |
| 1611 | * leaves pointed to by a node and reallocate them so that |
| 1612 | * disk order is close to key order |
| 1613 | */ |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1614 | int btrfs_realloc_node(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1615 | struct btrfs_root *root, struct extent_buffer *parent, |
Eric Sandeen | de78b51 | 2013-01-31 18:21:12 +0000 | [diff] [blame] | 1616 | int start_slot, u64 *last_ret, |
Chris Mason | a6b6e75 | 2007-10-15 16:22:39 -0400 | [diff] [blame] | 1617 | struct btrfs_key *progress) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1618 | { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1619 | struct extent_buffer *cur; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1620 | u64 blocknr; |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 1621 | u64 gen; |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 1622 | u64 search_start = *last_ret; |
| 1623 | u64 last_block = 0; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1624 | u64 other; |
| 1625 | u32 parent_nritems; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1626 | int end_slot; |
| 1627 | int i; |
| 1628 | int err = 0; |
Chris Mason | f2183bd | 2007-08-10 14:42:37 -0400 | [diff] [blame] | 1629 | int parent_level; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1630 | int uptodate; |
| 1631 | u32 blocksize; |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 1632 | int progress_passed = 0; |
| 1633 | struct btrfs_disk_key disk_key; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1634 | |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 1635 | parent_level = btrfs_header_level(parent); |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 1636 | |
Julia Lawall | 6c1500f | 2012-11-03 20:30:18 +0000 | [diff] [blame] | 1637 | WARN_ON(trans->transaction != root->fs_info->running_transaction); |
| 1638 | WARN_ON(trans->transid != root->fs_info->generation); |
Chris Mason | 86479a0 | 2007-09-10 19:58:16 -0400 | [diff] [blame] | 1639 | |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1640 | parent_nritems = btrfs_header_nritems(parent); |
David Sterba | 707e8a0 | 2014-06-04 19:22:26 +0200 | [diff] [blame] | 1641 | blocksize = root->nodesize; |
Filipe Manana | 5dfe2be | 2015-02-23 19:48:52 +0000 | [diff] [blame] | 1642 | end_slot = parent_nritems - 1; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1643 | |
Filipe Manana | 5dfe2be | 2015-02-23 19:48:52 +0000 | [diff] [blame] | 1644 | if (parent_nritems <= 1) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1645 | return 0; |
| 1646 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1647 | btrfs_set_lock_blocking(parent); |
| 1648 | |
Filipe Manana | 5dfe2be | 2015-02-23 19:48:52 +0000 | [diff] [blame] | 1649 | for (i = start_slot; i <= end_slot; i++) { |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1650 | int close = 1; |
Chris Mason | a6b6e75 | 2007-10-15 16:22:39 -0400 | [diff] [blame] | 1651 | |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 1652 | btrfs_node_key(parent, &disk_key, i); |
| 1653 | if (!progress_passed && comp_keys(&disk_key, progress) < 0) |
| 1654 | continue; |
| 1655 | |
| 1656 | progress_passed = 1; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1657 | blocknr = btrfs_node_blockptr(parent, i); |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 1658 | gen = btrfs_node_ptr_generation(parent, i); |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 1659 | if (last_block == 0) |
| 1660 | last_block = blocknr; |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 1661 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1662 | if (i > 0) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1663 | other = btrfs_node_blockptr(parent, i - 1); |
| 1664 | close = close_blocks(blocknr, other, blocksize); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1665 | } |
Filipe Manana | 5dfe2be | 2015-02-23 19:48:52 +0000 | [diff] [blame] | 1666 | if (!close && i < end_slot) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1667 | other = btrfs_node_blockptr(parent, i + 1); |
| 1668 | close = close_blocks(blocknr, other, blocksize); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1669 | } |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 1670 | if (close) { |
| 1671 | last_block = blocknr; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1672 | continue; |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 1673 | } |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1674 | |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 1675 | cur = btrfs_find_tree_block(root->fs_info, blocknr); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1676 | if (cur) |
Chris Mason | b9fab91 | 2012-05-06 07:23:47 -0400 | [diff] [blame] | 1677 | uptodate = btrfs_buffer_uptodate(cur, gen, 0); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1678 | else |
| 1679 | uptodate = 0; |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 1680 | if (!cur || !uptodate) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1681 | if (!cur) { |
David Sterba | ce86cd5 | 2014-06-15 01:07:32 +0200 | [diff] [blame] | 1682 | cur = read_tree_block(root, blocknr, gen); |
Liu Bo | 64c043d | 2015-05-25 17:30:15 +0800 | [diff] [blame] | 1683 | if (IS_ERR(cur)) { |
| 1684 | return PTR_ERR(cur); |
| 1685 | } else if (!extent_buffer_uptodate(cur)) { |
Josef Bacik | 416bc65 | 2013-04-23 14:17:42 -0400 | [diff] [blame] | 1686 | free_extent_buffer(cur); |
Tsutomu Itoh | 97d9a8a | 2011-03-24 06:33:21 +0000 | [diff] [blame] | 1687 | return -EIO; |
Josef Bacik | 416bc65 | 2013-04-23 14:17:42 -0400 | [diff] [blame] | 1688 | } |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1689 | } else if (!uptodate) { |
Tsutomu Itoh | 018642a | 2012-05-29 18:10:13 +0900 | [diff] [blame] | 1690 | err = btrfs_read_buffer(cur, gen); |
| 1691 | if (err) { |
| 1692 | free_extent_buffer(cur); |
| 1693 | return err; |
| 1694 | } |
Chris Mason | f2183bd | 2007-08-10 14:42:37 -0400 | [diff] [blame] | 1695 | } |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1696 | } |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 1697 | if (search_start == 0) |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1698 | search_start = last_block; |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 1699 | |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 1700 | btrfs_tree_lock(cur); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1701 | btrfs_set_lock_blocking(cur); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1702 | err = __btrfs_cow_block(trans, root, cur, parent, i, |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 1703 | &cur, search_start, |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1704 | min(16 * blocksize, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1705 | (end_slot - i) * blocksize)); |
Yan | 252c38f | 2007-08-29 09:11:44 -0400 | [diff] [blame] | 1706 | if (err) { |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 1707 | btrfs_tree_unlock(cur); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1708 | free_extent_buffer(cur); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1709 | break; |
Yan | 252c38f | 2007-08-29 09:11:44 -0400 | [diff] [blame] | 1710 | } |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 1711 | search_start = cur->start; |
| 1712 | last_block = cur->start; |
Chris Mason | f2183bd | 2007-08-10 14:42:37 -0400 | [diff] [blame] | 1713 | *last_ret = search_start; |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 1714 | btrfs_tree_unlock(cur); |
| 1715 | free_extent_buffer(cur); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1716 | } |
| 1717 | return err; |
| 1718 | } |
| 1719 | |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 1720 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 1721 | /* |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1722 | * search for key in the extent_buffer. The items start at offset p, |
| 1723 | * and they are item_size apart. There are 'max' items in p. |
| 1724 | * |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 1725 | * the slot in the array is returned via slot, and it points to |
| 1726 | * the place where you would insert key if it is not found in |
| 1727 | * the array. |
| 1728 | * |
| 1729 | * slot may point to max if the key is bigger than all of the keys |
| 1730 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 1731 | static noinline int generic_bin_search(struct extent_buffer *eb, |
| 1732 | unsigned long p, |
| 1733 | int item_size, struct btrfs_key *key, |
| 1734 | int max, int *slot) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1735 | { |
| 1736 | int low = 0; |
| 1737 | int high = max; |
| 1738 | int mid; |
| 1739 | int ret; |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 1740 | struct btrfs_disk_key *tmp = NULL; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1741 | struct btrfs_disk_key unaligned; |
| 1742 | unsigned long offset; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1743 | char *kaddr = NULL; |
| 1744 | unsigned long map_start = 0; |
| 1745 | unsigned long map_len = 0; |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 1746 | int err; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1747 | |
Liu Bo | 5e24e9a | 2016-06-23 16:32:45 -0700 | [diff] [blame] | 1748 | if (low > high) { |
| 1749 | btrfs_err(eb->fs_info, |
| 1750 | "%s: low (%d) > high (%d) eb %llu owner %llu level %d", |
| 1751 | __func__, low, high, eb->start, |
| 1752 | btrfs_header_owner(eb), btrfs_header_level(eb)); |
| 1753 | return -EINVAL; |
| 1754 | } |
| 1755 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1756 | while (low < high) { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1757 | mid = (low + high) / 2; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1758 | offset = p + mid * item_size; |
| 1759 | |
Chris Mason | a659171 | 2011-07-19 12:04:14 -0400 | [diff] [blame] | 1760 | if (!kaddr || offset < map_start || |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1761 | (offset + sizeof(struct btrfs_disk_key)) > |
| 1762 | map_start + map_len) { |
Chris Mason | 934d375 | 2008-12-08 16:43:10 -0500 | [diff] [blame] | 1763 | |
| 1764 | err = map_private_extent_buffer(eb, offset, |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 1765 | sizeof(struct btrfs_disk_key), |
Chris Mason | a659171 | 2011-07-19 12:04:14 -0400 | [diff] [blame] | 1766 | &kaddr, &map_start, &map_len); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1767 | |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 1768 | if (!err) { |
| 1769 | tmp = (struct btrfs_disk_key *)(kaddr + offset - |
| 1770 | map_start); |
Liu Bo | 415b35a | 2016-06-17 19:16:21 -0700 | [diff] [blame] | 1771 | } else if (err == 1) { |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 1772 | read_extent_buffer(eb, &unaligned, |
| 1773 | offset, sizeof(unaligned)); |
| 1774 | tmp = &unaligned; |
Liu Bo | 415b35a | 2016-06-17 19:16:21 -0700 | [diff] [blame] | 1775 | } else { |
| 1776 | return err; |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 1777 | } |
| 1778 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1779 | } else { |
| 1780 | tmp = (struct btrfs_disk_key *)(kaddr + offset - |
| 1781 | map_start); |
| 1782 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1783 | ret = comp_keys(tmp, key); |
| 1784 | |
| 1785 | if (ret < 0) |
| 1786 | low = mid + 1; |
| 1787 | else if (ret > 0) |
| 1788 | high = mid; |
| 1789 | else { |
| 1790 | *slot = mid; |
| 1791 | return 0; |
| 1792 | } |
| 1793 | } |
| 1794 | *slot = low; |
| 1795 | return 1; |
| 1796 | } |
| 1797 | |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 1798 | /* |
| 1799 | * simple bin_search frontend that does the right thing for |
| 1800 | * leaves vs nodes |
| 1801 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1802 | static int bin_search(struct extent_buffer *eb, struct btrfs_key *key, |
| 1803 | int level, int *slot) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1804 | { |
Wang Sheng-Hui | f775738 | 2012-03-30 15:14:27 +0800 | [diff] [blame] | 1805 | if (level == 0) |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1806 | return generic_bin_search(eb, |
| 1807 | offsetof(struct btrfs_leaf, items), |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 1808 | sizeof(struct btrfs_item), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1809 | key, btrfs_header_nritems(eb), |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 1810 | slot); |
Wang Sheng-Hui | f775738 | 2012-03-30 15:14:27 +0800 | [diff] [blame] | 1811 | else |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1812 | return generic_bin_search(eb, |
| 1813 | offsetof(struct btrfs_node, ptrs), |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 1814 | sizeof(struct btrfs_key_ptr), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1815 | key, btrfs_header_nritems(eb), |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 1816 | slot); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1817 | } |
| 1818 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1819 | int btrfs_bin_search(struct extent_buffer *eb, struct btrfs_key *key, |
| 1820 | int level, int *slot) |
| 1821 | { |
| 1822 | return bin_search(eb, key, level, slot); |
| 1823 | } |
| 1824 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1825 | static void root_add_used(struct btrfs_root *root, u32 size) |
| 1826 | { |
| 1827 | spin_lock(&root->accounting_lock); |
| 1828 | btrfs_set_root_used(&root->root_item, |
| 1829 | btrfs_root_used(&root->root_item) + size); |
| 1830 | spin_unlock(&root->accounting_lock); |
| 1831 | } |
| 1832 | |
| 1833 | static void root_sub_used(struct btrfs_root *root, u32 size) |
| 1834 | { |
| 1835 | spin_lock(&root->accounting_lock); |
| 1836 | btrfs_set_root_used(&root->root_item, |
| 1837 | btrfs_root_used(&root->root_item) - size); |
| 1838 | spin_unlock(&root->accounting_lock); |
| 1839 | } |
| 1840 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1841 | /* given a node and slot number, this reads the blocks it points to. The |
| 1842 | * extent buffer is returned with a reference taken (but unlocked). |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1843 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 1844 | static noinline struct extent_buffer *read_node_slot(struct btrfs_root *root, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1845 | struct extent_buffer *parent, int slot) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1846 | { |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 1847 | int level = btrfs_header_level(parent); |
Josef Bacik | 416bc65 | 2013-04-23 14:17:42 -0400 | [diff] [blame] | 1848 | struct extent_buffer *eb; |
| 1849 | |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 1850 | if (slot < 0 || slot >= btrfs_header_nritems(parent)) |
| 1851 | return ERR_PTR(-ENOENT); |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 1852 | |
| 1853 | BUG_ON(level == 0); |
| 1854 | |
Josef Bacik | 416bc65 | 2013-04-23 14:17:42 -0400 | [diff] [blame] | 1855 | eb = read_tree_block(root, btrfs_node_blockptr(parent, slot), |
Josef Bacik | 416bc65 | 2013-04-23 14:17:42 -0400 | [diff] [blame] | 1856 | btrfs_node_ptr_generation(parent, slot)); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 1857 | if (!IS_ERR(eb) && !extent_buffer_uptodate(eb)) { |
| 1858 | free_extent_buffer(eb); |
| 1859 | eb = ERR_PTR(-EIO); |
Josef Bacik | 416bc65 | 2013-04-23 14:17:42 -0400 | [diff] [blame] | 1860 | } |
| 1861 | |
| 1862 | return eb; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1863 | } |
| 1864 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1865 | /* |
| 1866 | * node level balancing, used to make sure nodes are in proper order for |
| 1867 | * item deletion. We balance from the top down, so we have to make sure |
| 1868 | * that a deletion won't leave an node completely empty later on. |
| 1869 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 1870 | static noinline int balance_level(struct btrfs_trans_handle *trans, |
Chris Mason | 98ed517 | 2008-01-03 10:01:48 -0500 | [diff] [blame] | 1871 | struct btrfs_root *root, |
| 1872 | struct btrfs_path *path, int level) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1873 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1874 | struct extent_buffer *right = NULL; |
| 1875 | struct extent_buffer *mid; |
| 1876 | struct extent_buffer *left = NULL; |
| 1877 | struct extent_buffer *parent = NULL; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1878 | int ret = 0; |
| 1879 | int wret; |
| 1880 | int pslot; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1881 | int orig_slot = path->slots[level]; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1882 | u64 orig_ptr; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1883 | |
| 1884 | if (level == 0) |
| 1885 | return 0; |
| 1886 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1887 | mid = path->nodes[level]; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1888 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 1889 | WARN_ON(path->locks[level] != BTRFS_WRITE_LOCK && |
| 1890 | path->locks[level] != BTRFS_WRITE_LOCK_BLOCKING); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 1891 | WARN_ON(btrfs_header_generation(mid) != trans->transid); |
| 1892 | |
Chris Mason | 1d4f8a0 | 2007-03-13 09:28:32 -0400 | [diff] [blame] | 1893 | orig_ptr = btrfs_node_blockptr(mid, orig_slot); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1894 | |
Li Zefan | a05a9bb | 2011-09-06 16:55:34 +0800 | [diff] [blame] | 1895 | if (level < BTRFS_MAX_LEVEL - 1) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1896 | parent = path->nodes[level + 1]; |
Li Zefan | a05a9bb | 2011-09-06 16:55:34 +0800 | [diff] [blame] | 1897 | pslot = path->slots[level + 1]; |
| 1898 | } |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1899 | |
Chris Mason | 4068947 | 2007-03-17 14:29:23 -0400 | [diff] [blame] | 1900 | /* |
| 1901 | * deal with the case where there is only one pointer in the root |
| 1902 | * by promoting the node below to a root |
| 1903 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1904 | if (!parent) { |
| 1905 | struct extent_buffer *child; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1906 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1907 | if (btrfs_header_nritems(mid) != 1) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1908 | return 0; |
| 1909 | |
| 1910 | /* promote the child to a root */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1911 | child = read_node_slot(root, mid, 0); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 1912 | if (IS_ERR(child)) { |
| 1913 | ret = PTR_ERR(child); |
Anand Jain | 34d9700 | 2016-03-16 16:43:06 +0800 | [diff] [blame] | 1914 | btrfs_handle_fs_error(root->fs_info, ret, NULL); |
Mark Fasheh | 305a26a | 2011-09-01 11:27:57 -0700 | [diff] [blame] | 1915 | goto enospc; |
| 1916 | } |
| 1917 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1918 | btrfs_tree_lock(child); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1919 | btrfs_set_lock_blocking(child); |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1920 | ret = btrfs_cow_block(trans, root, child, mid, 0, &child); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1921 | if (ret) { |
| 1922 | btrfs_tree_unlock(child); |
| 1923 | free_extent_buffer(child); |
| 1924 | goto enospc; |
| 1925 | } |
Yan | 2f375ab | 2008-02-01 14:58:07 -0500 | [diff] [blame] | 1926 | |
Jan Schmidt | 90f8d62 | 2013-04-13 13:19:53 +0000 | [diff] [blame] | 1927 | tree_mod_log_set_root_pointer(root, child, 1); |
Chris Mason | 240f62c | 2011-03-23 14:54:42 -0400 | [diff] [blame] | 1928 | rcu_assign_pointer(root->node, child); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1929 | |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 1930 | add_root_to_dirty_list(root); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1931 | btrfs_tree_unlock(child); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1932 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1933 | path->locks[level] = 0; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1934 | path->nodes[level] = NULL; |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 1935 | clean_tree_block(trans, root->fs_info, mid); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1936 | btrfs_tree_unlock(mid); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1937 | /* once for the path */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1938 | free_extent_buffer(mid); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1939 | |
| 1940 | root_sub_used(root, mid->len); |
Jan Schmidt | 5581a51 | 2012-05-16 17:04:52 +0200 | [diff] [blame] | 1941 | btrfs_free_tree_block(trans, root, mid, 0, 1); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1942 | /* once for the root ptr */ |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 1943 | free_extent_buffer_stale(mid); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1944 | return 0; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1945 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1946 | if (btrfs_header_nritems(mid) > |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 1947 | BTRFS_NODEPTRS_PER_BLOCK(root) / 4) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1948 | return 0; |
| 1949 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1950 | left = read_node_slot(root, parent, pslot - 1); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 1951 | if (IS_ERR(left)) |
| 1952 | left = NULL; |
| 1953 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1954 | if (left) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1955 | btrfs_tree_lock(left); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1956 | btrfs_set_lock_blocking(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1957 | wret = btrfs_cow_block(trans, root, left, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1958 | parent, pslot - 1, &left); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1959 | if (wret) { |
| 1960 | ret = wret; |
| 1961 | goto enospc; |
| 1962 | } |
Chris Mason | 2cc58cf | 2007-08-27 16:49:44 -0400 | [diff] [blame] | 1963 | } |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 1964 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1965 | right = read_node_slot(root, parent, pslot + 1); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 1966 | if (IS_ERR(right)) |
| 1967 | right = NULL; |
| 1968 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1969 | if (right) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1970 | btrfs_tree_lock(right); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1971 | btrfs_set_lock_blocking(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1972 | wret = btrfs_cow_block(trans, root, right, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1973 | parent, pslot + 1, &right); |
Chris Mason | 2cc58cf | 2007-08-27 16:49:44 -0400 | [diff] [blame] | 1974 | if (wret) { |
| 1975 | ret = wret; |
| 1976 | goto enospc; |
| 1977 | } |
| 1978 | } |
| 1979 | |
| 1980 | /* first, try to make some room in the middle buffer */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1981 | if (left) { |
| 1982 | orig_slot += btrfs_header_nritems(left); |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 1983 | wret = push_node_left(trans, root, left, mid, 1); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1984 | if (wret < 0) |
| 1985 | ret = wret; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1986 | } |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1987 | |
| 1988 | /* |
| 1989 | * then try to empty the right most buffer into the middle |
| 1990 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1991 | if (right) { |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 1992 | wret = push_node_left(trans, root, mid, right, 1); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1993 | if (wret < 0 && wret != -ENOSPC) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1994 | ret = wret; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1995 | if (btrfs_header_nritems(right) == 0) { |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 1996 | clean_tree_block(trans, root->fs_info, right); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1997 | btrfs_tree_unlock(right); |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 1998 | del_ptr(root, path, level + 1, pslot + 1); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1999 | root_sub_used(root, right->len); |
Jan Schmidt | 5581a51 | 2012-05-16 17:04:52 +0200 | [diff] [blame] | 2000 | btrfs_free_tree_block(trans, root, right, 0, 1); |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 2001 | free_extent_buffer_stale(right); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 2002 | right = NULL; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2003 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2004 | struct btrfs_disk_key right_key; |
| 2005 | btrfs_node_key(right, &right_key, 0); |
Jan Schmidt | f230475 | 2012-05-26 11:43:17 +0200 | [diff] [blame] | 2006 | tree_mod_log_set_node_key(root->fs_info, parent, |
Liu Bo | 32adf09 | 2012-10-19 12:52:15 +0000 | [diff] [blame] | 2007 | pslot + 1, 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2008 | btrfs_set_node_key(parent, &right_key, pslot + 1); |
| 2009 | btrfs_mark_buffer_dirty(parent); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2010 | } |
| 2011 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2012 | if (btrfs_header_nritems(mid) == 1) { |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2013 | /* |
| 2014 | * we're not allowed to leave a node with one item in the |
| 2015 | * tree during a delete. A deletion from lower in the tree |
| 2016 | * could try to delete the only pointer in this node. |
| 2017 | * So, pull some keys from the left. |
| 2018 | * There has to be a left pointer at this point because |
| 2019 | * otherwise we would have pulled some pointers from the |
| 2020 | * right |
| 2021 | */ |
Mark Fasheh | 305a26a | 2011-09-01 11:27:57 -0700 | [diff] [blame] | 2022 | if (!left) { |
| 2023 | ret = -EROFS; |
Anand Jain | 34d9700 | 2016-03-16 16:43:06 +0800 | [diff] [blame] | 2024 | btrfs_handle_fs_error(root->fs_info, ret, NULL); |
Mark Fasheh | 305a26a | 2011-09-01 11:27:57 -0700 | [diff] [blame] | 2025 | goto enospc; |
| 2026 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2027 | wret = balance_node_right(trans, root, mid, left); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2028 | if (wret < 0) { |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2029 | ret = wret; |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2030 | goto enospc; |
| 2031 | } |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 2032 | if (wret == 1) { |
| 2033 | wret = push_node_left(trans, root, left, mid, 1); |
| 2034 | if (wret < 0) |
| 2035 | ret = wret; |
| 2036 | } |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2037 | BUG_ON(wret == 1); |
| 2038 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2039 | if (btrfs_header_nritems(mid) == 0) { |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 2040 | clean_tree_block(trans, root->fs_info, mid); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2041 | btrfs_tree_unlock(mid); |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 2042 | del_ptr(root, path, level + 1, pslot); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 2043 | root_sub_used(root, mid->len); |
Jan Schmidt | 5581a51 | 2012-05-16 17:04:52 +0200 | [diff] [blame] | 2044 | btrfs_free_tree_block(trans, root, mid, 0, 1); |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 2045 | free_extent_buffer_stale(mid); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 2046 | mid = NULL; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2047 | } else { |
| 2048 | /* update the parent key to reflect our changes */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2049 | struct btrfs_disk_key mid_key; |
| 2050 | btrfs_node_key(mid, &mid_key, 0); |
Liu Bo | 32adf09 | 2012-10-19 12:52:15 +0000 | [diff] [blame] | 2051 | tree_mod_log_set_node_key(root->fs_info, parent, |
Jan Schmidt | f230475 | 2012-05-26 11:43:17 +0200 | [diff] [blame] | 2052 | pslot, 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2053 | btrfs_set_node_key(parent, &mid_key, pslot); |
| 2054 | btrfs_mark_buffer_dirty(parent); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2055 | } |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2056 | |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2057 | /* update the path */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2058 | if (left) { |
| 2059 | if (btrfs_header_nritems(left) > orig_slot) { |
| 2060 | extent_buffer_get(left); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2061 | /* left was locked after cow */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2062 | path->nodes[level] = left; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2063 | path->slots[level + 1] -= 1; |
| 2064 | path->slots[level] = orig_slot; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2065 | if (mid) { |
| 2066 | btrfs_tree_unlock(mid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2067 | free_extent_buffer(mid); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2068 | } |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2069 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2070 | orig_slot -= btrfs_header_nritems(left); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2071 | path->slots[level] = orig_slot; |
| 2072 | } |
| 2073 | } |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2074 | /* double check we haven't messed things up */ |
Chris Mason | e20d96d | 2007-03-22 12:13:20 -0400 | [diff] [blame] | 2075 | if (orig_ptr != |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2076 | btrfs_node_blockptr(path->nodes[level], path->slots[level])) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2077 | BUG(); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2078 | enospc: |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2079 | if (right) { |
| 2080 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2081 | free_extent_buffer(right); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2082 | } |
| 2083 | if (left) { |
| 2084 | if (path->nodes[level] != left) |
| 2085 | btrfs_tree_unlock(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2086 | free_extent_buffer(left); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2087 | } |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2088 | return ret; |
| 2089 | } |
| 2090 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 2091 | /* Node balancing for insertion. Here we only split or push nodes around |
| 2092 | * when they are completely full. This is also done top down, so we |
| 2093 | * have to be pessimistic. |
| 2094 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2095 | static noinline int push_nodes_for_insert(struct btrfs_trans_handle *trans, |
Chris Mason | 98ed517 | 2008-01-03 10:01:48 -0500 | [diff] [blame] | 2096 | struct btrfs_root *root, |
| 2097 | struct btrfs_path *path, int level) |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2098 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2099 | struct extent_buffer *right = NULL; |
| 2100 | struct extent_buffer *mid; |
| 2101 | struct extent_buffer *left = NULL; |
| 2102 | struct extent_buffer *parent = NULL; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2103 | int ret = 0; |
| 2104 | int wret; |
| 2105 | int pslot; |
| 2106 | int orig_slot = path->slots[level]; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2107 | |
| 2108 | if (level == 0) |
| 2109 | return 1; |
| 2110 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2111 | mid = path->nodes[level]; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 2112 | WARN_ON(btrfs_header_generation(mid) != trans->transid); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2113 | |
Li Zefan | a05a9bb | 2011-09-06 16:55:34 +0800 | [diff] [blame] | 2114 | if (level < BTRFS_MAX_LEVEL - 1) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2115 | parent = path->nodes[level + 1]; |
Li Zefan | a05a9bb | 2011-09-06 16:55:34 +0800 | [diff] [blame] | 2116 | pslot = path->slots[level + 1]; |
| 2117 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2118 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2119 | if (!parent) |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2120 | return 1; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2121 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2122 | left = read_node_slot(root, parent, pslot - 1); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 2123 | if (IS_ERR(left)) |
| 2124 | left = NULL; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2125 | |
| 2126 | /* first, try to make some room in the middle buffer */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2127 | if (left) { |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2128 | u32 left_nr; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2129 | |
| 2130 | btrfs_tree_lock(left); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2131 | btrfs_set_lock_blocking(left); |
| 2132 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2133 | left_nr = btrfs_header_nritems(left); |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 2134 | if (left_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { |
| 2135 | wret = 1; |
| 2136 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2137 | ret = btrfs_cow_block(trans, root, left, parent, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 2138 | pslot - 1, &left); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2139 | if (ret) |
| 2140 | wret = 1; |
| 2141 | else { |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2142 | wret = push_node_left(trans, root, |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 2143 | left, mid, 0); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2144 | } |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 2145 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2146 | if (wret < 0) |
| 2147 | ret = wret; |
| 2148 | if (wret == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2149 | struct btrfs_disk_key disk_key; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2150 | orig_slot += left_nr; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2151 | btrfs_node_key(mid, &disk_key, 0); |
Jan Schmidt | f230475 | 2012-05-26 11:43:17 +0200 | [diff] [blame] | 2152 | tree_mod_log_set_node_key(root->fs_info, parent, |
Liu Bo | 32adf09 | 2012-10-19 12:52:15 +0000 | [diff] [blame] | 2153 | pslot, 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2154 | btrfs_set_node_key(parent, &disk_key, pslot); |
| 2155 | btrfs_mark_buffer_dirty(parent); |
| 2156 | if (btrfs_header_nritems(left) > orig_slot) { |
| 2157 | path->nodes[level] = left; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2158 | path->slots[level + 1] -= 1; |
| 2159 | path->slots[level] = orig_slot; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2160 | btrfs_tree_unlock(mid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2161 | free_extent_buffer(mid); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2162 | } else { |
| 2163 | orig_slot -= |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2164 | btrfs_header_nritems(left); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2165 | path->slots[level] = orig_slot; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2166 | btrfs_tree_unlock(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2167 | free_extent_buffer(left); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2168 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2169 | return 0; |
| 2170 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2171 | btrfs_tree_unlock(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2172 | free_extent_buffer(left); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2173 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2174 | right = read_node_slot(root, parent, pslot + 1); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 2175 | if (IS_ERR(right)) |
| 2176 | right = NULL; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2177 | |
| 2178 | /* |
| 2179 | * then try to empty the right most buffer into the middle |
| 2180 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2181 | if (right) { |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 2182 | u32 right_nr; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2183 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2184 | btrfs_tree_lock(right); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2185 | btrfs_set_lock_blocking(right); |
| 2186 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2187 | right_nr = btrfs_header_nritems(right); |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 2188 | if (right_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { |
| 2189 | wret = 1; |
| 2190 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2191 | ret = btrfs_cow_block(trans, root, right, |
| 2192 | parent, pslot + 1, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 2193 | &right); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2194 | if (ret) |
| 2195 | wret = 1; |
| 2196 | else { |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2197 | wret = balance_node_right(trans, root, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2198 | right, mid); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2199 | } |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 2200 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2201 | if (wret < 0) |
| 2202 | ret = wret; |
| 2203 | if (wret == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2204 | struct btrfs_disk_key disk_key; |
| 2205 | |
| 2206 | btrfs_node_key(right, &disk_key, 0); |
Jan Schmidt | f230475 | 2012-05-26 11:43:17 +0200 | [diff] [blame] | 2207 | tree_mod_log_set_node_key(root->fs_info, parent, |
Liu Bo | 32adf09 | 2012-10-19 12:52:15 +0000 | [diff] [blame] | 2208 | pslot + 1, 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2209 | btrfs_set_node_key(parent, &disk_key, pslot + 1); |
| 2210 | btrfs_mark_buffer_dirty(parent); |
| 2211 | |
| 2212 | if (btrfs_header_nritems(mid) <= orig_slot) { |
| 2213 | path->nodes[level] = right; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2214 | path->slots[level + 1] += 1; |
| 2215 | path->slots[level] = orig_slot - |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2216 | btrfs_header_nritems(mid); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2217 | btrfs_tree_unlock(mid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2218 | free_extent_buffer(mid); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2219 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2220 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2221 | free_extent_buffer(right); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2222 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2223 | return 0; |
| 2224 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2225 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2226 | free_extent_buffer(right); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2227 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2228 | return 1; |
| 2229 | } |
| 2230 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2231 | /* |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 2232 | * readahead one full node of leaves, finding things that are close |
| 2233 | * to the block in 'slot', and triggering ra on them. |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2234 | */ |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2235 | static void reada_for_search(struct btrfs_root *root, |
| 2236 | struct btrfs_path *path, |
| 2237 | int level, int slot, u64 objectid) |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2238 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2239 | struct extent_buffer *node; |
Chris Mason | 01f4665 | 2007-12-21 16:24:26 -0500 | [diff] [blame] | 2240 | struct btrfs_disk_key disk_key; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2241 | u32 nritems; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2242 | u64 search; |
Chris Mason | a717531 | 2009-01-22 09:23:10 -0500 | [diff] [blame] | 2243 | u64 target; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2244 | u64 nread = 0; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2245 | struct extent_buffer *eb; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2246 | u32 nr; |
| 2247 | u32 blocksize; |
| 2248 | u32 nscan = 0; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2249 | |
Chris Mason | a6b6e75 | 2007-10-15 16:22:39 -0400 | [diff] [blame] | 2250 | if (level != 1) |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2251 | return; |
| 2252 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 2253 | if (!path->nodes[level]) |
| 2254 | return; |
| 2255 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2256 | node = path->nodes[level]; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2257 | |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2258 | search = btrfs_node_blockptr(node, slot); |
David Sterba | 707e8a0 | 2014-06-04 19:22:26 +0200 | [diff] [blame] | 2259 | blocksize = root->nodesize; |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 2260 | eb = btrfs_find_tree_block(root->fs_info, search); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2261 | if (eb) { |
| 2262 | free_extent_buffer(eb); |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2263 | return; |
| 2264 | } |
| 2265 | |
Chris Mason | a717531 | 2009-01-22 09:23:10 -0500 | [diff] [blame] | 2266 | target = search; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2267 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2268 | nritems = btrfs_header_nritems(node); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2269 | nr = slot; |
Josef Bacik | 25b8b93 | 2011-06-08 14:36:54 -0400 | [diff] [blame] | 2270 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2271 | while (1) { |
David Sterba | e4058b5 | 2015-11-27 16:31:35 +0100 | [diff] [blame] | 2272 | if (path->reada == READA_BACK) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2273 | if (nr == 0) |
| 2274 | break; |
| 2275 | nr--; |
David Sterba | e4058b5 | 2015-11-27 16:31:35 +0100 | [diff] [blame] | 2276 | } else if (path->reada == READA_FORWARD) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2277 | nr++; |
| 2278 | if (nr >= nritems) |
| 2279 | break; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2280 | } |
David Sterba | e4058b5 | 2015-11-27 16:31:35 +0100 | [diff] [blame] | 2281 | if (path->reada == READA_BACK && objectid) { |
Chris Mason | 01f4665 | 2007-12-21 16:24:26 -0500 | [diff] [blame] | 2282 | btrfs_node_key(node, &disk_key, nr); |
| 2283 | if (btrfs_disk_key_objectid(&disk_key) != objectid) |
| 2284 | break; |
| 2285 | } |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2286 | search = btrfs_node_blockptr(node, nr); |
Chris Mason | a717531 | 2009-01-22 09:23:10 -0500 | [diff] [blame] | 2287 | if ((search <= target && target - search <= 65536) || |
| 2288 | (search > target && search - target <= 65536)) { |
David Sterba | d3e46fe | 2014-06-15 02:04:19 +0200 | [diff] [blame] | 2289 | readahead_tree_block(root, search); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2290 | nread += blocksize; |
| 2291 | } |
| 2292 | nscan++; |
Chris Mason | a717531 | 2009-01-22 09:23:10 -0500 | [diff] [blame] | 2293 | if ((nread > 65536 || nscan > 32)) |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2294 | break; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2295 | } |
| 2296 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2297 | |
Josef Bacik | 0b08851 | 2013-06-17 14:23:02 -0400 | [diff] [blame] | 2298 | static noinline void reada_for_balance(struct btrfs_root *root, |
| 2299 | struct btrfs_path *path, int level) |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2300 | { |
| 2301 | int slot; |
| 2302 | int nritems; |
| 2303 | struct extent_buffer *parent; |
| 2304 | struct extent_buffer *eb; |
| 2305 | u64 gen; |
| 2306 | u64 block1 = 0; |
| 2307 | u64 block2 = 0; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2308 | |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 2309 | parent = path->nodes[level + 1]; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2310 | if (!parent) |
Josef Bacik | 0b08851 | 2013-06-17 14:23:02 -0400 | [diff] [blame] | 2311 | return; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2312 | |
| 2313 | nritems = btrfs_header_nritems(parent); |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 2314 | slot = path->slots[level + 1]; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2315 | |
| 2316 | if (slot > 0) { |
| 2317 | block1 = btrfs_node_blockptr(parent, slot - 1); |
| 2318 | gen = btrfs_node_ptr_generation(parent, slot - 1); |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 2319 | eb = btrfs_find_tree_block(root->fs_info, block1); |
Chris Mason | b9fab91 | 2012-05-06 07:23:47 -0400 | [diff] [blame] | 2320 | /* |
| 2321 | * if we get -eagain from btrfs_buffer_uptodate, we |
| 2322 | * don't want to return eagain here. That will loop |
| 2323 | * forever |
| 2324 | */ |
| 2325 | if (eb && btrfs_buffer_uptodate(eb, gen, 1) != 0) |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2326 | block1 = 0; |
| 2327 | free_extent_buffer(eb); |
| 2328 | } |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 2329 | if (slot + 1 < nritems) { |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2330 | block2 = btrfs_node_blockptr(parent, slot + 1); |
| 2331 | gen = btrfs_node_ptr_generation(parent, slot + 1); |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 2332 | eb = btrfs_find_tree_block(root->fs_info, block2); |
Chris Mason | b9fab91 | 2012-05-06 07:23:47 -0400 | [diff] [blame] | 2333 | if (eb && btrfs_buffer_uptodate(eb, gen, 1) != 0) |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2334 | block2 = 0; |
| 2335 | free_extent_buffer(eb); |
| 2336 | } |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 2337 | |
Josef Bacik | 0b08851 | 2013-06-17 14:23:02 -0400 | [diff] [blame] | 2338 | if (block1) |
David Sterba | d3e46fe | 2014-06-15 02:04:19 +0200 | [diff] [blame] | 2339 | readahead_tree_block(root, block1); |
Josef Bacik | 0b08851 | 2013-06-17 14:23:02 -0400 | [diff] [blame] | 2340 | if (block2) |
David Sterba | d3e46fe | 2014-06-15 02:04:19 +0200 | [diff] [blame] | 2341 | readahead_tree_block(root, block2); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2342 | } |
| 2343 | |
| 2344 | |
| 2345 | /* |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2346 | * when we walk down the tree, it is usually safe to unlock the higher layers |
| 2347 | * in the tree. The exceptions are when our path goes through slot 0, because |
| 2348 | * operations on the tree might require changing key pointers higher up in the |
| 2349 | * tree. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 2350 | * |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2351 | * callers might also have set path->keep_locks, which tells this code to keep |
| 2352 | * the lock if the path points to the last slot in the block. This is part of |
| 2353 | * walking through the tree, and selecting the next slot in the higher block. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 2354 | * |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2355 | * lowest_unlock sets the lowest level in the tree we're allowed to unlock. so |
| 2356 | * if lowest_unlock is 1, level 0 won't be unlocked |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 2357 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 2358 | static noinline void unlock_up(struct btrfs_path *path, int level, |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 2359 | int lowest_unlock, int min_write_lock_level, |
| 2360 | int *write_lock_level) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2361 | { |
| 2362 | int i; |
| 2363 | int skip_level = level; |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2364 | int no_skips = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2365 | struct extent_buffer *t; |
| 2366 | |
| 2367 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
| 2368 | if (!path->nodes[i]) |
| 2369 | break; |
| 2370 | if (!path->locks[i]) |
| 2371 | break; |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2372 | if (!no_skips && path->slots[i] == 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2373 | skip_level = i + 1; |
| 2374 | continue; |
| 2375 | } |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2376 | if (!no_skips && path->keep_locks) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2377 | u32 nritems; |
| 2378 | t = path->nodes[i]; |
| 2379 | nritems = btrfs_header_nritems(t); |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2380 | if (nritems < 1 || path->slots[i] >= nritems - 1) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2381 | skip_level = i + 1; |
| 2382 | continue; |
| 2383 | } |
| 2384 | } |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2385 | if (skip_level < i && i >= lowest_unlock) |
| 2386 | no_skips = 1; |
| 2387 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2388 | t = path->nodes[i]; |
| 2389 | if (i >= lowest_unlock && i > skip_level && path->locks[i]) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2390 | btrfs_tree_unlock_rw(t, path->locks[i]); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2391 | path->locks[i] = 0; |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 2392 | if (write_lock_level && |
| 2393 | i > min_write_lock_level && |
| 2394 | i <= *write_lock_level) { |
| 2395 | *write_lock_level = i - 1; |
| 2396 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2397 | } |
| 2398 | } |
| 2399 | } |
| 2400 | |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2401 | /* |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2402 | * This releases any locks held in the path starting at level and |
| 2403 | * going all the way up to the root. |
| 2404 | * |
| 2405 | * btrfs_search_slot will keep the lock held on higher nodes in a few |
| 2406 | * corner cases, such as COW of the block at slot zero in the node. This |
| 2407 | * ignores those rules, and it should only be called when there are no |
| 2408 | * more updates to be done higher up in the tree. |
| 2409 | */ |
| 2410 | noinline void btrfs_unlock_up_safe(struct btrfs_path *path, int level) |
| 2411 | { |
| 2412 | int i; |
| 2413 | |
Josef Bacik | 09a2a8f9 | 2013-04-05 16:51:15 -0400 | [diff] [blame] | 2414 | if (path->keep_locks) |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2415 | return; |
| 2416 | |
| 2417 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
| 2418 | if (!path->nodes[i]) |
Chris Mason | 12f4dac | 2009-02-04 09:31:42 -0500 | [diff] [blame] | 2419 | continue; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2420 | if (!path->locks[i]) |
Chris Mason | 12f4dac | 2009-02-04 09:31:42 -0500 | [diff] [blame] | 2421 | continue; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2422 | btrfs_tree_unlock_rw(path->nodes[i], path->locks[i]); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2423 | path->locks[i] = 0; |
| 2424 | } |
| 2425 | } |
| 2426 | |
| 2427 | /* |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2428 | * helper function for btrfs_search_slot. The goal is to find a block |
| 2429 | * in cache without setting the path to blocking. If we find the block |
| 2430 | * we return zero and the path is unchanged. |
| 2431 | * |
| 2432 | * If we can't find the block, we set the path blocking and do some |
| 2433 | * reada. -EAGAIN is returned and the search must be repeated. |
| 2434 | */ |
| 2435 | static int |
| 2436 | read_block_for_search(struct btrfs_trans_handle *trans, |
| 2437 | struct btrfs_root *root, struct btrfs_path *p, |
| 2438 | struct extent_buffer **eb_ret, int level, int slot, |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2439 | struct btrfs_key *key, u64 time_seq) |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2440 | { |
| 2441 | u64 blocknr; |
| 2442 | u64 gen; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2443 | struct extent_buffer *b = *eb_ret; |
| 2444 | struct extent_buffer *tmp; |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2445 | int ret; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2446 | |
| 2447 | blocknr = btrfs_node_blockptr(b, slot); |
| 2448 | gen = btrfs_node_ptr_generation(b, slot); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2449 | |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 2450 | tmp = btrfs_find_tree_block(root->fs_info, blocknr); |
Chris Mason | cb44921 | 2010-10-24 11:01:27 -0400 | [diff] [blame] | 2451 | if (tmp) { |
Chris Mason | b9fab91 | 2012-05-06 07:23:47 -0400 | [diff] [blame] | 2452 | /* first we do an atomic uptodate check */ |
Josef Bacik | bdf7c00 | 2013-06-17 13:44:48 -0400 | [diff] [blame] | 2453 | if (btrfs_buffer_uptodate(tmp, gen, 1) > 0) { |
| 2454 | *eb_ret = tmp; |
| 2455 | return 0; |
Chris Mason | cb44921 | 2010-10-24 11:01:27 -0400 | [diff] [blame] | 2456 | } |
Josef Bacik | bdf7c00 | 2013-06-17 13:44:48 -0400 | [diff] [blame] | 2457 | |
| 2458 | /* the pages were up to date, but we failed |
| 2459 | * the generation number check. Do a full |
| 2460 | * read for the generation number that is correct. |
| 2461 | * We must do this without dropping locks so |
| 2462 | * we can trust our generation number |
| 2463 | */ |
| 2464 | btrfs_set_path_blocking(p); |
| 2465 | |
| 2466 | /* now we're allowed to do a blocking uptodate check */ |
| 2467 | ret = btrfs_read_buffer(tmp, gen); |
| 2468 | if (!ret) { |
| 2469 | *eb_ret = tmp; |
| 2470 | return 0; |
| 2471 | } |
| 2472 | free_extent_buffer(tmp); |
| 2473 | btrfs_release_path(p); |
| 2474 | return -EIO; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2475 | } |
| 2476 | |
| 2477 | /* |
| 2478 | * reduce lock contention at high levels |
| 2479 | * of the btree by dropping locks before |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2480 | * we read. Don't release the lock on the current |
| 2481 | * level because we need to walk this node to figure |
| 2482 | * out which blocks to read. |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2483 | */ |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 2484 | btrfs_unlock_up_safe(p, level + 1); |
| 2485 | btrfs_set_path_blocking(p); |
| 2486 | |
Chris Mason | cb44921 | 2010-10-24 11:01:27 -0400 | [diff] [blame] | 2487 | free_extent_buffer(tmp); |
David Sterba | e4058b5 | 2015-11-27 16:31:35 +0100 | [diff] [blame] | 2488 | if (p->reada != READA_NONE) |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2489 | reada_for_search(root, p, level, slot, key->objectid); |
| 2490 | |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2491 | ret = -EAGAIN; |
Liu Bo | 298d5db | 2018-05-16 01:37:36 +0800 | [diff] [blame] | 2492 | tmp = read_tree_block(root, blocknr, gen); |
Liu Bo | 64c043d | 2015-05-25 17:30:15 +0800 | [diff] [blame] | 2493 | if (!IS_ERR(tmp)) { |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2494 | /* |
| 2495 | * If the read above didn't mark this buffer up to date, |
| 2496 | * it will never end up being up to date. Set ret to EIO now |
| 2497 | * and give up so that our caller doesn't loop forever |
| 2498 | * on our EAGAINs. |
| 2499 | */ |
Chris Mason | b9fab91 | 2012-05-06 07:23:47 -0400 | [diff] [blame] | 2500 | if (!btrfs_buffer_uptodate(tmp, 0, 0)) |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2501 | ret = -EIO; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2502 | free_extent_buffer(tmp); |
Liu Bo | c871b0f | 2016-06-06 12:01:23 -0700 | [diff] [blame] | 2503 | } else { |
| 2504 | ret = PTR_ERR(tmp); |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2505 | } |
Liu Bo | 298d5db | 2018-05-16 01:37:36 +0800 | [diff] [blame] | 2506 | |
| 2507 | btrfs_release_path(p); |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2508 | return ret; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2509 | } |
| 2510 | |
| 2511 | /* |
| 2512 | * helper function for btrfs_search_slot. This does all of the checks |
| 2513 | * for node-level blocks and does any balancing required based on |
| 2514 | * the ins_len. |
| 2515 | * |
| 2516 | * If no extra work was required, zero is returned. If we had to |
| 2517 | * drop the path, -EAGAIN is returned and btrfs_search_slot must |
| 2518 | * start over |
| 2519 | */ |
| 2520 | static int |
| 2521 | setup_nodes_for_search(struct btrfs_trans_handle *trans, |
| 2522 | struct btrfs_root *root, struct btrfs_path *p, |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2523 | struct extent_buffer *b, int level, int ins_len, |
| 2524 | int *write_lock_level) |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2525 | { |
| 2526 | int ret; |
| 2527 | if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >= |
| 2528 | BTRFS_NODEPTRS_PER_BLOCK(root) - 3) { |
| 2529 | int sret; |
| 2530 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2531 | if (*write_lock_level < level + 1) { |
| 2532 | *write_lock_level = level + 1; |
| 2533 | btrfs_release_path(p); |
| 2534 | goto again; |
| 2535 | } |
| 2536 | |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2537 | btrfs_set_path_blocking(p); |
Josef Bacik | 0b08851 | 2013-06-17 14:23:02 -0400 | [diff] [blame] | 2538 | reada_for_balance(root, p, level); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2539 | sret = split_node(trans, root, p, level); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2540 | btrfs_clear_path_blocking(p, NULL, 0); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2541 | |
| 2542 | BUG_ON(sret > 0); |
| 2543 | if (sret) { |
| 2544 | ret = sret; |
| 2545 | goto done; |
| 2546 | } |
| 2547 | b = p->nodes[level]; |
| 2548 | } else if (ins_len < 0 && btrfs_header_nritems(b) < |
Chris Mason | cfbb930 | 2009-05-18 10:41:58 -0400 | [diff] [blame] | 2549 | BTRFS_NODEPTRS_PER_BLOCK(root) / 2) { |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2550 | int sret; |
| 2551 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2552 | if (*write_lock_level < level + 1) { |
| 2553 | *write_lock_level = level + 1; |
| 2554 | btrfs_release_path(p); |
| 2555 | goto again; |
| 2556 | } |
| 2557 | |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2558 | btrfs_set_path_blocking(p); |
Josef Bacik | 0b08851 | 2013-06-17 14:23:02 -0400 | [diff] [blame] | 2559 | reada_for_balance(root, p, level); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2560 | sret = balance_level(trans, root, p, level); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2561 | btrfs_clear_path_blocking(p, NULL, 0); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2562 | |
| 2563 | if (sret) { |
| 2564 | ret = sret; |
| 2565 | goto done; |
| 2566 | } |
| 2567 | b = p->nodes[level]; |
| 2568 | if (!b) { |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 2569 | btrfs_release_path(p); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2570 | goto again; |
| 2571 | } |
| 2572 | BUG_ON(btrfs_header_nritems(b) == 1); |
| 2573 | } |
| 2574 | return 0; |
| 2575 | |
| 2576 | again: |
| 2577 | ret = -EAGAIN; |
| 2578 | done: |
| 2579 | return ret; |
| 2580 | } |
| 2581 | |
Filipe David Borba Manana | d7396f0 | 2013-08-30 15:46:43 +0100 | [diff] [blame] | 2582 | static void key_search_validate(struct extent_buffer *b, |
| 2583 | struct btrfs_key *key, |
| 2584 | int level) |
| 2585 | { |
| 2586 | #ifdef CONFIG_BTRFS_ASSERT |
| 2587 | struct btrfs_disk_key disk_key; |
| 2588 | |
| 2589 | btrfs_cpu_key_to_disk(&disk_key, key); |
| 2590 | |
| 2591 | if (level == 0) |
| 2592 | ASSERT(!memcmp_extent_buffer(b, &disk_key, |
| 2593 | offsetof(struct btrfs_leaf, items[0].key), |
| 2594 | sizeof(disk_key))); |
| 2595 | else |
| 2596 | ASSERT(!memcmp_extent_buffer(b, &disk_key, |
| 2597 | offsetof(struct btrfs_node, ptrs[0].key), |
| 2598 | sizeof(disk_key))); |
| 2599 | #endif |
| 2600 | } |
| 2601 | |
| 2602 | static int key_search(struct extent_buffer *b, struct btrfs_key *key, |
| 2603 | int level, int *prev_cmp, int *slot) |
| 2604 | { |
| 2605 | if (*prev_cmp != 0) { |
| 2606 | *prev_cmp = bin_search(b, key, level, slot); |
| 2607 | return *prev_cmp; |
| 2608 | } |
| 2609 | |
| 2610 | key_search_validate(b, key, level); |
| 2611 | *slot = 0; |
| 2612 | |
| 2613 | return 0; |
| 2614 | } |
| 2615 | |
David Sterba | 381cf65 | 2015-01-02 18:45:16 +0100 | [diff] [blame] | 2616 | int btrfs_find_item(struct btrfs_root *fs_root, struct btrfs_path *path, |
Kelley Nielsen | e33d5c3 | 2013-11-04 19:33:33 -0800 | [diff] [blame] | 2617 | u64 iobjectid, u64 ioff, u8 key_type, |
| 2618 | struct btrfs_key *found_key) |
| 2619 | { |
| 2620 | int ret; |
| 2621 | struct btrfs_key key; |
| 2622 | struct extent_buffer *eb; |
David Sterba | 381cf65 | 2015-01-02 18:45:16 +0100 | [diff] [blame] | 2623 | |
| 2624 | ASSERT(path); |
David Sterba | 1d4c08e | 2015-01-02 19:36:14 +0100 | [diff] [blame] | 2625 | ASSERT(found_key); |
Kelley Nielsen | e33d5c3 | 2013-11-04 19:33:33 -0800 | [diff] [blame] | 2626 | |
| 2627 | key.type = key_type; |
| 2628 | key.objectid = iobjectid; |
| 2629 | key.offset = ioff; |
| 2630 | |
| 2631 | ret = btrfs_search_slot(NULL, fs_root, &key, path, 0, 0); |
David Sterba | 1d4c08e | 2015-01-02 19:36:14 +0100 | [diff] [blame] | 2632 | if (ret < 0) |
Kelley Nielsen | e33d5c3 | 2013-11-04 19:33:33 -0800 | [diff] [blame] | 2633 | return ret; |
| 2634 | |
| 2635 | eb = path->nodes[0]; |
| 2636 | if (ret && path->slots[0] >= btrfs_header_nritems(eb)) { |
| 2637 | ret = btrfs_next_leaf(fs_root, path); |
| 2638 | if (ret) |
| 2639 | return ret; |
| 2640 | eb = path->nodes[0]; |
| 2641 | } |
| 2642 | |
| 2643 | btrfs_item_key_to_cpu(eb, found_key, path->slots[0]); |
| 2644 | if (found_key->type != key.type || |
| 2645 | found_key->objectid != key.objectid) |
| 2646 | return 1; |
| 2647 | |
| 2648 | return 0; |
| 2649 | } |
| 2650 | |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2651 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2652 | * look for key in the tree. path is filled in with nodes along the way |
| 2653 | * if key is found, we return zero and you can find the item in the leaf |
| 2654 | * level of the path (level 0) |
| 2655 | * |
| 2656 | * If the key isn't found, the path points to the slot where it should |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2657 | * be inserted, and 1 is returned. If there are other errors during the |
| 2658 | * search a negative error number is returned. |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 2659 | * |
| 2660 | * if ins_len > 0, nodes and leaves will be split as we walk down the |
| 2661 | * tree. if ins_len < 0, nodes will be merged as we walk down the tree (if |
| 2662 | * possible) |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2663 | */ |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 2664 | int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root |
| 2665 | *root, struct btrfs_key *key, struct btrfs_path *p, int |
| 2666 | ins_len, int cow) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2667 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2668 | struct extent_buffer *b; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2669 | int slot; |
| 2670 | int ret; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2671 | int err; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2672 | int level; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2673 | int lowest_unlock = 1; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2674 | int root_lock; |
| 2675 | /* everything at write_lock_level or lower must be write locked */ |
| 2676 | int write_lock_level = 0; |
Chris Mason | 9f3a742 | 2007-08-07 15:52:19 -0400 | [diff] [blame] | 2677 | u8 lowest_level = 0; |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 2678 | int min_write_lock_level; |
Filipe David Borba Manana | d7396f0 | 2013-08-30 15:46:43 +0100 | [diff] [blame] | 2679 | int prev_cmp; |
Chris Mason | 9f3a742 | 2007-08-07 15:52:19 -0400 | [diff] [blame] | 2680 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 2681 | lowest_level = p->lowest_level; |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 2682 | WARN_ON(lowest_level && ins_len > 0); |
Chris Mason | 22b0ebd | 2007-03-30 08:47:31 -0400 | [diff] [blame] | 2683 | WARN_ON(p->nodes[0] != NULL); |
Filipe David Borba Manana | eb653de | 2013-12-23 11:53:02 +0000 | [diff] [blame] | 2684 | BUG_ON(!cow && ins_len); |
Josef Bacik | 2517920 | 2008-10-29 14:49:05 -0400 | [diff] [blame] | 2685 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2686 | if (ins_len < 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2687 | lowest_unlock = 2; |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2688 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2689 | /* when we are removing items, we might have to go up to level |
| 2690 | * two as we update tree pointers Make sure we keep write |
| 2691 | * for those levels as well |
| 2692 | */ |
| 2693 | write_lock_level = 2; |
| 2694 | } else if (ins_len > 0) { |
| 2695 | /* |
| 2696 | * for inserting items, make sure we have a write lock on |
| 2697 | * level 1 so we can update keys |
| 2698 | */ |
| 2699 | write_lock_level = 1; |
| 2700 | } |
| 2701 | |
| 2702 | if (!cow) |
| 2703 | write_lock_level = -1; |
| 2704 | |
Josef Bacik | 09a2a8f9 | 2013-04-05 16:51:15 -0400 | [diff] [blame] | 2705 | if (cow && (p->keep_locks || p->lowest_level)) |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2706 | write_lock_level = BTRFS_MAX_LEVEL; |
| 2707 | |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 2708 | min_write_lock_level = write_lock_level; |
| 2709 | |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2710 | again: |
Filipe David Borba Manana | d7396f0 | 2013-08-30 15:46:43 +0100 | [diff] [blame] | 2711 | prev_cmp = -1; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2712 | /* |
| 2713 | * we try very hard to do read locks on the root |
| 2714 | */ |
| 2715 | root_lock = BTRFS_READ_LOCK; |
| 2716 | level = 0; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2717 | if (p->search_commit_root) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2718 | /* |
| 2719 | * the commit roots are read only |
| 2720 | * so we always do read locks |
| 2721 | */ |
Josef Bacik | 3f8a18c | 2014-03-28 17:16:01 -0400 | [diff] [blame] | 2722 | if (p->need_commit_sem) |
| 2723 | down_read(&root->fs_info->commit_root_sem); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2724 | b = root->commit_root; |
| 2725 | extent_buffer_get(b); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2726 | level = btrfs_header_level(b); |
Josef Bacik | 3f8a18c | 2014-03-28 17:16:01 -0400 | [diff] [blame] | 2727 | if (p->need_commit_sem) |
| 2728 | up_read(&root->fs_info->commit_root_sem); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2729 | if (!p->skip_locking) |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2730 | btrfs_tree_read_lock(b); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2731 | } else { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2732 | if (p->skip_locking) { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2733 | b = btrfs_root_node(root); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2734 | level = btrfs_header_level(b); |
| 2735 | } else { |
| 2736 | /* we don't know the level of the root node |
| 2737 | * until we actually have it read locked |
| 2738 | */ |
| 2739 | b = btrfs_read_lock_root_node(root); |
| 2740 | level = btrfs_header_level(b); |
| 2741 | if (level <= write_lock_level) { |
| 2742 | /* whoops, must trade for write lock */ |
| 2743 | btrfs_tree_read_unlock(b); |
| 2744 | free_extent_buffer(b); |
| 2745 | b = btrfs_lock_root_node(root); |
| 2746 | root_lock = BTRFS_WRITE_LOCK; |
| 2747 | |
| 2748 | /* the level might have changed, check again */ |
| 2749 | level = btrfs_header_level(b); |
| 2750 | } |
| 2751 | } |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2752 | } |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2753 | p->nodes[level] = b; |
| 2754 | if (!p->skip_locking) |
| 2755 | p->locks[level] = root_lock; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2756 | |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 2757 | while (b) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2758 | level = btrfs_header_level(b); |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2759 | |
| 2760 | /* |
| 2761 | * setup the path here so we can release it under lock |
| 2762 | * contention with the cow code |
| 2763 | */ |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 2764 | if (cow) { |
Nikolay Borisov | e23c097 | 2017-12-12 11:14:49 +0200 | [diff] [blame] | 2765 | bool last_level = (level == (BTRFS_MAX_LEVEL - 1)); |
| 2766 | |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2767 | /* |
| 2768 | * if we don't really need to cow this block |
| 2769 | * then we don't want to set the path blocking, |
| 2770 | * so we test it here |
| 2771 | */ |
Jeff Mahoney | 64c1292 | 2016-06-08 00:36:38 -0400 | [diff] [blame] | 2772 | if (!should_cow_block(trans, root, b)) { |
| 2773 | trans->dirty = true; |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2774 | goto cow_done; |
Jeff Mahoney | 64c1292 | 2016-06-08 00:36:38 -0400 | [diff] [blame] | 2775 | } |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2776 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2777 | /* |
| 2778 | * must have write locks on this node and the |
| 2779 | * parent |
| 2780 | */ |
Josef Bacik | 5124e00 | 2012-11-07 13:44:13 -0500 | [diff] [blame] | 2781 | if (level > write_lock_level || |
| 2782 | (level + 1 > write_lock_level && |
| 2783 | level + 1 < BTRFS_MAX_LEVEL && |
| 2784 | p->nodes[level + 1])) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2785 | write_lock_level = level + 1; |
| 2786 | btrfs_release_path(p); |
| 2787 | goto again; |
| 2788 | } |
| 2789 | |
Filipe Manana | 160f408 | 2014-07-28 19:37:17 +0100 | [diff] [blame] | 2790 | btrfs_set_path_blocking(p); |
Nikolay Borisov | e23c097 | 2017-12-12 11:14:49 +0200 | [diff] [blame] | 2791 | if (last_level) |
| 2792 | err = btrfs_cow_block(trans, root, b, NULL, 0, |
| 2793 | &b); |
| 2794 | else |
| 2795 | err = btrfs_cow_block(trans, root, b, |
| 2796 | p->nodes[level + 1], |
| 2797 | p->slots[level + 1], &b); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2798 | if (err) { |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2799 | ret = err; |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2800 | goto done; |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2801 | } |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 2802 | } |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2803 | cow_done: |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 2804 | p->nodes[level] = b; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2805 | btrfs_clear_path_blocking(p, NULL, 0); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2806 | |
| 2807 | /* |
| 2808 | * we have a lock on b and as long as we aren't changing |
| 2809 | * the tree, there is no way to for the items in b to change. |
| 2810 | * It is safe to drop the lock on our parent before we |
| 2811 | * go through the expensive btree search on b. |
| 2812 | * |
Filipe David Borba Manana | eb653de | 2013-12-23 11:53:02 +0000 | [diff] [blame] | 2813 | * If we're inserting or deleting (ins_len != 0), then we might |
| 2814 | * be changing slot zero, which may require changing the parent. |
| 2815 | * So, we can't drop the lock until after we know which slot |
| 2816 | * we're operating on. |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2817 | */ |
Filipe David Borba Manana | eb653de | 2013-12-23 11:53:02 +0000 | [diff] [blame] | 2818 | if (!ins_len && !p->keep_locks) { |
| 2819 | int u = level + 1; |
| 2820 | |
| 2821 | if (u < BTRFS_MAX_LEVEL && p->locks[u]) { |
| 2822 | btrfs_tree_unlock_rw(p->nodes[u], p->locks[u]); |
| 2823 | p->locks[u] = 0; |
| 2824 | } |
| 2825 | } |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2826 | |
Filipe David Borba Manana | d7396f0 | 2013-08-30 15:46:43 +0100 | [diff] [blame] | 2827 | ret = key_search(b, key, level, &prev_cmp, &slot); |
Liu Bo | 415b35a | 2016-06-17 19:16:21 -0700 | [diff] [blame] | 2828 | if (ret < 0) |
| 2829 | goto done; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2830 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2831 | if (level != 0) { |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2832 | int dec = 0; |
| 2833 | if (ret && slot > 0) { |
| 2834 | dec = 1; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2835 | slot -= 1; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2836 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2837 | p->slots[level] = slot; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2838 | err = setup_nodes_for_search(trans, root, p, b, level, |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2839 | ins_len, &write_lock_level); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2840 | if (err == -EAGAIN) |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2841 | goto again; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2842 | if (err) { |
| 2843 | ret = err; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2844 | goto done; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2845 | } |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2846 | b = p->nodes[level]; |
| 2847 | slot = p->slots[level]; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2848 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2849 | /* |
| 2850 | * slot 0 is special, if we change the key |
| 2851 | * we have to update the parent pointer |
| 2852 | * which means we must have a write lock |
| 2853 | * on the parent |
| 2854 | */ |
Filipe David Borba Manana | eb653de | 2013-12-23 11:53:02 +0000 | [diff] [blame] | 2855 | if (slot == 0 && ins_len && |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2856 | write_lock_level < level + 1) { |
| 2857 | write_lock_level = level + 1; |
| 2858 | btrfs_release_path(p); |
| 2859 | goto again; |
| 2860 | } |
| 2861 | |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 2862 | unlock_up(p, level, lowest_unlock, |
| 2863 | min_write_lock_level, &write_lock_level); |
Chris Mason | f9efa9c | 2008-06-25 16:14:04 -0400 | [diff] [blame] | 2864 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2865 | if (level == lowest_level) { |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2866 | if (dec) |
| 2867 | p->slots[level]++; |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 2868 | goto done; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2869 | } |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 2870 | |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2871 | err = read_block_for_search(trans, root, p, |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2872 | &b, level, slot, key, 0); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2873 | if (err == -EAGAIN) |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2874 | goto again; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2875 | if (err) { |
| 2876 | ret = err; |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2877 | goto done; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2878 | } |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2879 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2880 | if (!p->skip_locking) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2881 | level = btrfs_header_level(b); |
| 2882 | if (level <= write_lock_level) { |
| 2883 | err = btrfs_try_tree_write_lock(b); |
| 2884 | if (!err) { |
| 2885 | btrfs_set_path_blocking(p); |
| 2886 | btrfs_tree_lock(b); |
| 2887 | btrfs_clear_path_blocking(p, b, |
| 2888 | BTRFS_WRITE_LOCK); |
| 2889 | } |
| 2890 | p->locks[level] = BTRFS_WRITE_LOCK; |
| 2891 | } else { |
Chris Mason | f82c458 | 2014-11-19 10:25:09 -0800 | [diff] [blame] | 2892 | err = btrfs_tree_read_lock_atomic(b); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2893 | if (!err) { |
| 2894 | btrfs_set_path_blocking(p); |
| 2895 | btrfs_tree_read_lock(b); |
| 2896 | btrfs_clear_path_blocking(p, b, |
| 2897 | BTRFS_READ_LOCK); |
| 2898 | } |
| 2899 | p->locks[level] = BTRFS_READ_LOCK; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2900 | } |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2901 | p->nodes[level] = b; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2902 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2903 | } else { |
| 2904 | p->slots[level] = slot; |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 2905 | if (ins_len > 0 && |
| 2906 | btrfs_leaf_free_space(root, b) < ins_len) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2907 | if (write_lock_level < 1) { |
| 2908 | write_lock_level = 1; |
| 2909 | btrfs_release_path(p); |
| 2910 | goto again; |
| 2911 | } |
| 2912 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2913 | btrfs_set_path_blocking(p); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2914 | err = split_leaf(trans, root, key, |
| 2915 | p, ins_len, ret == 0); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2916 | btrfs_clear_path_blocking(p, NULL, 0); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2917 | |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2918 | BUG_ON(err > 0); |
| 2919 | if (err) { |
| 2920 | ret = err; |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2921 | goto done; |
| 2922 | } |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 2923 | } |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 2924 | if (!p->search_for_split) |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 2925 | unlock_up(p, level, lowest_unlock, |
| 2926 | min_write_lock_level, &write_lock_level); |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2927 | goto done; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2928 | } |
| 2929 | } |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2930 | ret = 1; |
| 2931 | done: |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2932 | /* |
| 2933 | * we don't really know what they plan on doing with the path |
| 2934 | * from here on, so for now just mark it as blocking |
| 2935 | */ |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 2936 | if (!p->leave_spinning) |
| 2937 | btrfs_set_path_blocking(p); |
Filipe Manana | 5f5bc6b | 2014-11-09 08:38:39 +0000 | [diff] [blame] | 2938 | if (ret < 0 && !p->skip_release_on_error) |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 2939 | btrfs_release_path(p); |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2940 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2941 | } |
| 2942 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2943 | /* |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2944 | * Like btrfs_search_slot, this looks for a key in the given tree. It uses the |
| 2945 | * current state of the tree together with the operations recorded in the tree |
| 2946 | * modification log to search for the key in a previous version of this tree, as |
| 2947 | * denoted by the time_seq parameter. |
| 2948 | * |
| 2949 | * Naturally, there is no support for insert, delete or cow operations. |
| 2950 | * |
| 2951 | * The resulting path and return value will be set up as if we called |
| 2952 | * btrfs_search_slot at that point in time with ins_len and cow both set to 0. |
| 2953 | */ |
| 2954 | int btrfs_search_old_slot(struct btrfs_root *root, struct btrfs_key *key, |
| 2955 | struct btrfs_path *p, u64 time_seq) |
| 2956 | { |
| 2957 | struct extent_buffer *b; |
| 2958 | int slot; |
| 2959 | int ret; |
| 2960 | int err; |
| 2961 | int level; |
| 2962 | int lowest_unlock = 1; |
| 2963 | u8 lowest_level = 0; |
Josef Bacik | d4b4087 | 2013-09-24 14:09:34 -0400 | [diff] [blame] | 2964 | int prev_cmp = -1; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2965 | |
| 2966 | lowest_level = p->lowest_level; |
| 2967 | WARN_ON(p->nodes[0] != NULL); |
| 2968 | |
| 2969 | if (p->search_commit_root) { |
| 2970 | BUG_ON(time_seq); |
| 2971 | return btrfs_search_slot(NULL, root, key, p, 0, 0); |
| 2972 | } |
| 2973 | |
| 2974 | again: |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2975 | b = get_old_root(root, time_seq); |
Nikolay Borisov | 56af241 | 2018-09-13 11:35:10 +0300 | [diff] [blame] | 2976 | if (!b) { |
| 2977 | ret = -EIO; |
| 2978 | goto done; |
| 2979 | } |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2980 | level = btrfs_header_level(b); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2981 | p->locks[level] = BTRFS_READ_LOCK; |
| 2982 | |
| 2983 | while (b) { |
| 2984 | level = btrfs_header_level(b); |
| 2985 | p->nodes[level] = b; |
| 2986 | btrfs_clear_path_blocking(p, NULL, 0); |
| 2987 | |
| 2988 | /* |
| 2989 | * we have a lock on b and as long as we aren't changing |
| 2990 | * the tree, there is no way to for the items in b to change. |
| 2991 | * It is safe to drop the lock on our parent before we |
| 2992 | * go through the expensive btree search on b. |
| 2993 | */ |
| 2994 | btrfs_unlock_up_safe(p, level + 1); |
| 2995 | |
Josef Bacik | d4b4087 | 2013-09-24 14:09:34 -0400 | [diff] [blame] | 2996 | /* |
Nicholas D Steeves | 0132761 | 2016-05-19 21:18:45 -0400 | [diff] [blame] | 2997 | * Since we can unwind ebs we want to do a real search every |
Josef Bacik | d4b4087 | 2013-09-24 14:09:34 -0400 | [diff] [blame] | 2998 | * time. |
| 2999 | */ |
| 3000 | prev_cmp = -1; |
Filipe David Borba Manana | d7396f0 | 2013-08-30 15:46:43 +0100 | [diff] [blame] | 3001 | ret = key_search(b, key, level, &prev_cmp, &slot); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 3002 | |
| 3003 | if (level != 0) { |
| 3004 | int dec = 0; |
| 3005 | if (ret && slot > 0) { |
| 3006 | dec = 1; |
| 3007 | slot -= 1; |
| 3008 | } |
| 3009 | p->slots[level] = slot; |
| 3010 | unlock_up(p, level, lowest_unlock, 0, NULL); |
| 3011 | |
| 3012 | if (level == lowest_level) { |
| 3013 | if (dec) |
| 3014 | p->slots[level]++; |
| 3015 | goto done; |
| 3016 | } |
| 3017 | |
| 3018 | err = read_block_for_search(NULL, root, p, &b, level, |
| 3019 | slot, key, time_seq); |
| 3020 | if (err == -EAGAIN) |
| 3021 | goto again; |
| 3022 | if (err) { |
| 3023 | ret = err; |
| 3024 | goto done; |
| 3025 | } |
| 3026 | |
| 3027 | level = btrfs_header_level(b); |
Chris Mason | f82c458 | 2014-11-19 10:25:09 -0800 | [diff] [blame] | 3028 | err = btrfs_tree_read_lock_atomic(b); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 3029 | if (!err) { |
| 3030 | btrfs_set_path_blocking(p); |
| 3031 | btrfs_tree_read_lock(b); |
| 3032 | btrfs_clear_path_blocking(p, b, |
| 3033 | BTRFS_READ_LOCK); |
| 3034 | } |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 3035 | b = tree_mod_log_rewind(root->fs_info, p, b, time_seq); |
Josef Bacik | db7f343 | 2013-08-07 14:54:37 -0400 | [diff] [blame] | 3036 | if (!b) { |
| 3037 | ret = -ENOMEM; |
| 3038 | goto done; |
| 3039 | } |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 3040 | p->locks[level] = BTRFS_READ_LOCK; |
| 3041 | p->nodes[level] = b; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 3042 | } else { |
| 3043 | p->slots[level] = slot; |
| 3044 | unlock_up(p, level, lowest_unlock, 0, NULL); |
| 3045 | goto done; |
| 3046 | } |
| 3047 | } |
| 3048 | ret = 1; |
| 3049 | done: |
| 3050 | if (!p->leave_spinning) |
| 3051 | btrfs_set_path_blocking(p); |
| 3052 | if (ret < 0) |
| 3053 | btrfs_release_path(p); |
| 3054 | |
| 3055 | return ret; |
| 3056 | } |
| 3057 | |
| 3058 | /* |
Arne Jansen | 2f38b3e | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3059 | * helper to use instead of search slot if no exact match is needed but |
| 3060 | * instead the next or previous item should be returned. |
| 3061 | * When find_higher is true, the next higher item is returned, the next lower |
| 3062 | * otherwise. |
| 3063 | * When return_any and find_higher are both true, and no higher item is found, |
| 3064 | * return the next lower instead. |
| 3065 | * When return_any is true and find_higher is false, and no lower item is found, |
| 3066 | * return the next higher instead. |
| 3067 | * It returns 0 if any item is found, 1 if none is found (tree empty), and |
| 3068 | * < 0 on error |
| 3069 | */ |
| 3070 | int btrfs_search_slot_for_read(struct btrfs_root *root, |
| 3071 | struct btrfs_key *key, struct btrfs_path *p, |
| 3072 | int find_higher, int return_any) |
| 3073 | { |
| 3074 | int ret; |
| 3075 | struct extent_buffer *leaf; |
| 3076 | |
| 3077 | again: |
| 3078 | ret = btrfs_search_slot(NULL, root, key, p, 0, 0); |
| 3079 | if (ret <= 0) |
| 3080 | return ret; |
| 3081 | /* |
| 3082 | * a return value of 1 means the path is at the position where the |
| 3083 | * item should be inserted. Normally this is the next bigger item, |
| 3084 | * but in case the previous item is the last in a leaf, path points |
| 3085 | * to the first free slot in the previous leaf, i.e. at an invalid |
| 3086 | * item. |
| 3087 | */ |
| 3088 | leaf = p->nodes[0]; |
| 3089 | |
| 3090 | if (find_higher) { |
| 3091 | if (p->slots[0] >= btrfs_header_nritems(leaf)) { |
| 3092 | ret = btrfs_next_leaf(root, p); |
| 3093 | if (ret <= 0) |
| 3094 | return ret; |
| 3095 | if (!return_any) |
| 3096 | return 1; |
| 3097 | /* |
| 3098 | * no higher item found, return the next |
| 3099 | * lower instead |
| 3100 | */ |
| 3101 | return_any = 0; |
| 3102 | find_higher = 0; |
| 3103 | btrfs_release_path(p); |
| 3104 | goto again; |
| 3105 | } |
| 3106 | } else { |
Arne Jansen | e679376 | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3107 | if (p->slots[0] == 0) { |
| 3108 | ret = btrfs_prev_leaf(root, p); |
| 3109 | if (ret < 0) |
| 3110 | return ret; |
| 3111 | if (!ret) { |
Filipe David Borba Manana | 23c6bf6 | 2014-01-11 21:28:54 +0000 | [diff] [blame] | 3112 | leaf = p->nodes[0]; |
| 3113 | if (p->slots[0] == btrfs_header_nritems(leaf)) |
| 3114 | p->slots[0]--; |
Arne Jansen | e679376 | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3115 | return 0; |
Arne Jansen | 2f38b3e | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3116 | } |
Arne Jansen | e679376 | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3117 | if (!return_any) |
| 3118 | return 1; |
| 3119 | /* |
| 3120 | * no lower item found, return the next |
| 3121 | * higher instead |
| 3122 | */ |
| 3123 | return_any = 0; |
| 3124 | find_higher = 1; |
| 3125 | btrfs_release_path(p); |
| 3126 | goto again; |
| 3127 | } else { |
Arne Jansen | 2f38b3e | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3128 | --p->slots[0]; |
| 3129 | } |
| 3130 | } |
| 3131 | return 0; |
| 3132 | } |
| 3133 | |
| 3134 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3135 | * adjust the pointers going up the tree, starting at level |
| 3136 | * making sure the right key of each node is points to 'key'. |
| 3137 | * This is used after shifting pointers to the left, so it stops |
| 3138 | * fixing up pointers when a given leaf/node is not in slot 0 of the |
| 3139 | * higher levels |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3140 | * |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3141 | */ |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 3142 | static void fixup_low_keys(struct btrfs_fs_info *fs_info, |
| 3143 | struct btrfs_path *path, |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 3144 | struct btrfs_disk_key *key, int level) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3145 | { |
| 3146 | int i; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3147 | struct extent_buffer *t; |
| 3148 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 3149 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3150 | int tslot = path->slots[i]; |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 3151 | if (!path->nodes[i]) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3152 | break; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3153 | t = path->nodes[i]; |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 3154 | tree_mod_log_set_node_key(fs_info, t, tslot, 1); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3155 | btrfs_set_node_key(t, key, tslot); |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3156 | btrfs_mark_buffer_dirty(path->nodes[i]); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3157 | if (tslot != 0) |
| 3158 | break; |
| 3159 | } |
| 3160 | } |
| 3161 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3162 | /* |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3163 | * update item key. |
| 3164 | * |
| 3165 | * This function isn't completely safe. It's the caller's responsibility |
| 3166 | * that the new key won't break the order |
| 3167 | */ |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 3168 | void btrfs_set_item_key_safe(struct btrfs_fs_info *fs_info, |
| 3169 | struct btrfs_path *path, |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 3170 | struct btrfs_key *new_key) |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3171 | { |
| 3172 | struct btrfs_disk_key disk_key; |
| 3173 | struct extent_buffer *eb; |
| 3174 | int slot; |
| 3175 | |
| 3176 | eb = path->nodes[0]; |
| 3177 | slot = path->slots[0]; |
| 3178 | if (slot > 0) { |
| 3179 | btrfs_item_key(eb, &disk_key, slot - 1); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 3180 | BUG_ON(comp_keys(&disk_key, new_key) >= 0); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3181 | } |
| 3182 | if (slot < btrfs_header_nritems(eb) - 1) { |
| 3183 | btrfs_item_key(eb, &disk_key, slot + 1); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 3184 | BUG_ON(comp_keys(&disk_key, new_key) <= 0); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3185 | } |
| 3186 | |
| 3187 | btrfs_cpu_key_to_disk(&disk_key, new_key); |
| 3188 | btrfs_set_item_key(eb, &disk_key, slot); |
| 3189 | btrfs_mark_buffer_dirty(eb); |
| 3190 | if (slot == 0) |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 3191 | fixup_low_keys(fs_info, path, &disk_key, 1); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3192 | } |
| 3193 | |
| 3194 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3195 | * try to push data from one node into the next node left in the |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3196 | * tree. |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3197 | * |
| 3198 | * returns 0 if some ptrs were pushed left, < 0 if there was some horrible |
| 3199 | * error, and > 0 if there was no room in the left hand block. |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3200 | */ |
Chris Mason | 98ed517 | 2008-01-03 10:01:48 -0500 | [diff] [blame] | 3201 | static int push_node_left(struct btrfs_trans_handle *trans, |
| 3202 | struct btrfs_root *root, struct extent_buffer *dst, |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 3203 | struct extent_buffer *src, int empty) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3204 | { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3205 | int push_items = 0; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 3206 | int src_nritems; |
| 3207 | int dst_nritems; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3208 | int ret = 0; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3209 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3210 | src_nritems = btrfs_header_nritems(src); |
| 3211 | dst_nritems = btrfs_header_nritems(dst); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 3212 | push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3213 | WARN_ON(btrfs_header_generation(src) != trans->transid); |
| 3214 | WARN_ON(btrfs_header_generation(dst) != trans->transid); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 3215 | |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 3216 | if (!empty && src_nritems <= 8) |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 3217 | return 1; |
| 3218 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3219 | if (push_items <= 0) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3220 | return 1; |
| 3221 | |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 3222 | if (empty) { |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 3223 | push_items = min(src_nritems, push_items); |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 3224 | if (push_items < src_nritems) { |
| 3225 | /* leave at least 8 pointers in the node if |
| 3226 | * we aren't going to empty it |
| 3227 | */ |
| 3228 | if (src_nritems - push_items < 8) { |
| 3229 | if (push_items <= 8) |
| 3230 | return 1; |
| 3231 | push_items -= 8; |
| 3232 | } |
| 3233 | } |
| 3234 | } else |
| 3235 | push_items = min(src_nritems - 8, push_items); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3236 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 3237 | ret = tree_mod_log_eb_copy(root->fs_info, dst, src, dst_nritems, 0, |
| 3238 | push_items); |
| 3239 | if (ret) { |
Jeff Mahoney | 6664283 | 2016-06-10 18:19:25 -0400 | [diff] [blame] | 3240 | btrfs_abort_transaction(trans, ret); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 3241 | return ret; |
| 3242 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3243 | copy_extent_buffer(dst, src, |
| 3244 | btrfs_node_key_ptr_offset(dst_nritems), |
| 3245 | btrfs_node_key_ptr_offset(0), |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3246 | push_items * sizeof(struct btrfs_key_ptr)); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3247 | |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 3248 | if (push_items < src_nritems) { |
Jan Schmidt | 57911b8 | 2012-10-19 09:22:03 +0200 | [diff] [blame] | 3249 | /* |
| 3250 | * don't call tree_mod_log_eb_move here, key removal was already |
| 3251 | * fully logged by tree_mod_log_eb_copy above. |
| 3252 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3253 | memmove_extent_buffer(src, btrfs_node_key_ptr_offset(0), |
| 3254 | btrfs_node_key_ptr_offset(push_items), |
| 3255 | (src_nritems - push_items) * |
| 3256 | sizeof(struct btrfs_key_ptr)); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 3257 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3258 | btrfs_set_header_nritems(src, src_nritems - push_items); |
| 3259 | btrfs_set_header_nritems(dst, dst_nritems + push_items); |
| 3260 | btrfs_mark_buffer_dirty(src); |
| 3261 | btrfs_mark_buffer_dirty(dst); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3262 | |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 3263 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3264 | } |
| 3265 | |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3266 | /* |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3267 | * try to push data from one node into the next node right in the |
| 3268 | * tree. |
| 3269 | * |
| 3270 | * returns 0 if some ptrs were pushed, < 0 if there was some horrible |
| 3271 | * error, and > 0 if there was no room in the right hand block. |
| 3272 | * |
| 3273 | * this will only push up to 1/2 the contents of the left node over |
| 3274 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3275 | static int balance_node_right(struct btrfs_trans_handle *trans, |
| 3276 | struct btrfs_root *root, |
| 3277 | struct extent_buffer *dst, |
| 3278 | struct extent_buffer *src) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3279 | { |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3280 | int push_items = 0; |
| 3281 | int max_push; |
| 3282 | int src_nritems; |
| 3283 | int dst_nritems; |
| 3284 | int ret = 0; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3285 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3286 | WARN_ON(btrfs_header_generation(src) != trans->transid); |
| 3287 | WARN_ON(btrfs_header_generation(dst) != trans->transid); |
| 3288 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3289 | src_nritems = btrfs_header_nritems(src); |
| 3290 | dst_nritems = btrfs_header_nritems(dst); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 3291 | push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems; |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3292 | if (push_items <= 0) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3293 | return 1; |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 3294 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3295 | if (src_nritems < 4) |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 3296 | return 1; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3297 | |
| 3298 | max_push = src_nritems / 2 + 1; |
| 3299 | /* don't try to empty the node */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3300 | if (max_push >= src_nritems) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3301 | return 1; |
Yan | 252c38f | 2007-08-29 09:11:44 -0400 | [diff] [blame] | 3302 | |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3303 | if (max_push < push_items) |
| 3304 | push_items = max_push; |
| 3305 | |
Jan Schmidt | f230475 | 2012-05-26 11:43:17 +0200 | [diff] [blame] | 3306 | tree_mod_log_eb_move(root->fs_info, dst, push_items, 0, dst_nritems); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3307 | memmove_extent_buffer(dst, btrfs_node_key_ptr_offset(push_items), |
| 3308 | btrfs_node_key_ptr_offset(0), |
| 3309 | (dst_nritems) * |
| 3310 | sizeof(struct btrfs_key_ptr)); |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3311 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 3312 | ret = tree_mod_log_eb_copy(root->fs_info, dst, src, 0, |
| 3313 | src_nritems - push_items, push_items); |
| 3314 | if (ret) { |
Jeff Mahoney | 6664283 | 2016-06-10 18:19:25 -0400 | [diff] [blame] | 3315 | btrfs_abort_transaction(trans, ret); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 3316 | return ret; |
| 3317 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3318 | copy_extent_buffer(dst, src, |
| 3319 | btrfs_node_key_ptr_offset(0), |
| 3320 | btrfs_node_key_ptr_offset(src_nritems - push_items), |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3321 | push_items * sizeof(struct btrfs_key_ptr)); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3322 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3323 | btrfs_set_header_nritems(src, src_nritems - push_items); |
| 3324 | btrfs_set_header_nritems(dst, dst_nritems + push_items); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3325 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3326 | btrfs_mark_buffer_dirty(src); |
| 3327 | btrfs_mark_buffer_dirty(dst); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3328 | |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3329 | return ret; |
| 3330 | } |
| 3331 | |
| 3332 | /* |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3333 | * helper function to insert a new root level in the tree. |
| 3334 | * A new node is allocated, and a single item is inserted to |
| 3335 | * point to the existing root |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3336 | * |
| 3337 | * returns zero on success or < 0 on failure. |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3338 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3339 | static noinline int insert_new_root(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3340 | struct btrfs_root *root, |
Liu Bo | fdd99c7 | 2013-05-22 12:06:51 +0000 | [diff] [blame] | 3341 | struct btrfs_path *path, int level) |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3342 | { |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3343 | u64 lower_gen; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3344 | struct extent_buffer *lower; |
| 3345 | struct extent_buffer *c; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3346 | struct extent_buffer *old; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3347 | struct btrfs_disk_key lower_key; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3348 | |
| 3349 | BUG_ON(path->nodes[level]); |
| 3350 | BUG_ON(path->nodes[level-1] != root->node); |
| 3351 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3352 | lower = path->nodes[level-1]; |
| 3353 | if (level == 1) |
| 3354 | btrfs_item_key(lower, &lower_key, 0); |
| 3355 | else |
| 3356 | btrfs_node_key(lower, &lower_key, 0); |
| 3357 | |
David Sterba | 4d75f8a | 2014-06-15 01:54:12 +0200 | [diff] [blame] | 3358 | c = btrfs_alloc_tree_block(trans, root, 0, root->root_key.objectid, |
| 3359 | &lower_key, level, root->node->start, 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3360 | if (IS_ERR(c)) |
| 3361 | return PTR_ERR(c); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3362 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3363 | root_add_used(root, root->nodesize); |
| 3364 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 3365 | memset_extent_buffer(c, 0, 0, sizeof(struct btrfs_header)); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3366 | btrfs_set_header_nritems(c, 1); |
| 3367 | btrfs_set_header_level(c, level); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3368 | btrfs_set_header_bytenr(c, c->start); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3369 | btrfs_set_header_generation(c, trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 3370 | btrfs_set_header_backref_rev(c, BTRFS_MIXED_BACKREF_REV); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3371 | btrfs_set_header_owner(c, root->root_key.objectid); |
Chris Mason | d571976 | 2007-03-23 10:01:08 -0400 | [diff] [blame] | 3372 | |
Ross Kirk | 0a4e558 | 2013-09-24 10:12:38 +0100 | [diff] [blame] | 3373 | write_extent_buffer(c, root->fs_info->fsid, btrfs_header_fsid(), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3374 | BTRFS_FSID_SIZE); |
Chris Mason | e17cade | 2008-04-15 15:41:47 -0400 | [diff] [blame] | 3375 | |
| 3376 | write_extent_buffer(c, root->fs_info->chunk_tree_uuid, |
Geert Uytterhoeven | b308bc2 | 2013-08-20 13:20:15 +0200 | [diff] [blame] | 3377 | btrfs_header_chunk_tree_uuid(c), BTRFS_UUID_SIZE); |
Chris Mason | e17cade | 2008-04-15 15:41:47 -0400 | [diff] [blame] | 3378 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3379 | btrfs_set_node_key(c, &lower_key, 0); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3380 | btrfs_set_node_blockptr(c, 0, lower->start); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3381 | lower_gen = btrfs_header_generation(lower); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3382 | WARN_ON(lower_gen != trans->transid); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3383 | |
| 3384 | btrfs_set_node_ptr_generation(c, 0, lower_gen); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3385 | |
| 3386 | btrfs_mark_buffer_dirty(c); |
Chris Mason | d571976 | 2007-03-23 10:01:08 -0400 | [diff] [blame] | 3387 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3388 | old = root->node; |
Liu Bo | fdd99c7 | 2013-05-22 12:06:51 +0000 | [diff] [blame] | 3389 | tree_mod_log_set_root_pointer(root, c, 0); |
Chris Mason | 240f62c | 2011-03-23 14:54:42 -0400 | [diff] [blame] | 3390 | rcu_assign_pointer(root->node, c); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3391 | |
| 3392 | /* the super has an extra ref to root->node */ |
| 3393 | free_extent_buffer(old); |
| 3394 | |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 3395 | add_root_to_dirty_list(root); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3396 | extent_buffer_get(c); |
| 3397 | path->nodes[level] = c; |
chandan | 95449a1 | 2015-01-15 12:22:03 +0530 | [diff] [blame] | 3398 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3399 | path->slots[level] = 0; |
| 3400 | return 0; |
| 3401 | } |
| 3402 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3403 | /* |
| 3404 | * worker function to insert a single pointer in a node. |
| 3405 | * the node should have enough room for the pointer already |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3406 | * |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3407 | * slot and level indicate where you want the key to go, and |
| 3408 | * blocknr is the block the key points to. |
| 3409 | */ |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 3410 | static void insert_ptr(struct btrfs_trans_handle *trans, |
| 3411 | struct btrfs_root *root, struct btrfs_path *path, |
| 3412 | struct btrfs_disk_key *key, u64 bytenr, |
Jan Schmidt | c3e0696 | 2012-06-21 11:01:06 +0200 | [diff] [blame] | 3413 | int slot, int level) |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3414 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3415 | struct extent_buffer *lower; |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3416 | int nritems; |
Jan Schmidt | f3ea38d | 2012-05-26 11:45:21 +0200 | [diff] [blame] | 3417 | int ret; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3418 | |
| 3419 | BUG_ON(!path->nodes[level]); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3420 | btrfs_assert_tree_locked(path->nodes[level]); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3421 | lower = path->nodes[level]; |
| 3422 | nritems = btrfs_header_nritems(lower); |
Stoyan Gaydarov | c293498 | 2009-04-02 17:05:11 -0400 | [diff] [blame] | 3423 | BUG_ON(slot > nritems); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 3424 | BUG_ON(nritems == BTRFS_NODEPTRS_PER_BLOCK(root)); |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3425 | if (slot != nritems) { |
Jan Schmidt | c3e0696 | 2012-06-21 11:01:06 +0200 | [diff] [blame] | 3426 | if (level) |
Jan Schmidt | f3ea38d | 2012-05-26 11:45:21 +0200 | [diff] [blame] | 3427 | tree_mod_log_eb_move(root->fs_info, lower, slot + 1, |
| 3428 | slot, nritems - slot); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3429 | memmove_extent_buffer(lower, |
| 3430 | btrfs_node_key_ptr_offset(slot + 1), |
| 3431 | btrfs_node_key_ptr_offset(slot), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3432 | (nritems - slot) * sizeof(struct btrfs_key_ptr)); |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3433 | } |
Jan Schmidt | c3e0696 | 2012-06-21 11:01:06 +0200 | [diff] [blame] | 3434 | if (level) { |
Jan Schmidt | f3ea38d | 2012-05-26 11:45:21 +0200 | [diff] [blame] | 3435 | ret = tree_mod_log_insert_key(root->fs_info, lower, slot, |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 3436 | MOD_LOG_KEY_ADD, GFP_NOFS); |
Jan Schmidt | f3ea38d | 2012-05-26 11:45:21 +0200 | [diff] [blame] | 3437 | BUG_ON(ret < 0); |
| 3438 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3439 | btrfs_set_node_key(lower, key, slot); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3440 | btrfs_set_node_blockptr(lower, slot, bytenr); |
Chris Mason | 74493f7 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3441 | WARN_ON(trans->transid == 0); |
| 3442 | btrfs_set_node_ptr_generation(lower, slot, trans->transid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3443 | btrfs_set_header_nritems(lower, nritems + 1); |
| 3444 | btrfs_mark_buffer_dirty(lower); |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3445 | } |
| 3446 | |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3447 | /* |
| 3448 | * split the node at the specified level in path in two. |
| 3449 | * The path is corrected to point to the appropriate node after the split |
| 3450 | * |
| 3451 | * Before splitting this tries to make some room in the node by pushing |
| 3452 | * left and right, if either one works, it returns right away. |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3453 | * |
| 3454 | * returns 0 on success and < 0 on failure |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3455 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 3456 | static noinline int split_node(struct btrfs_trans_handle *trans, |
| 3457 | struct btrfs_root *root, |
| 3458 | struct btrfs_path *path, int level) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3459 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3460 | struct extent_buffer *c; |
| 3461 | struct extent_buffer *split; |
| 3462 | struct btrfs_disk_key disk_key; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3463 | int mid; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3464 | int ret; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3465 | u32 c_nritems; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3466 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3467 | c = path->nodes[level]; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3468 | WARN_ON(btrfs_header_generation(c) != trans->transid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3469 | if (c == root->node) { |
Jan Schmidt | d9abbf1 | 2013-03-20 13:49:48 +0000 | [diff] [blame] | 3470 | /* |
Jan Schmidt | 90f8d62 | 2013-04-13 13:19:53 +0000 | [diff] [blame] | 3471 | * trying to split the root, lets make a new one |
| 3472 | * |
Liu Bo | fdd99c7 | 2013-05-22 12:06:51 +0000 | [diff] [blame] | 3473 | * tree mod log: We don't log_removal old root in |
Jan Schmidt | 90f8d62 | 2013-04-13 13:19:53 +0000 | [diff] [blame] | 3474 | * insert_new_root, because that root buffer will be kept as a |
| 3475 | * normal node. We are going to log removal of half of the |
| 3476 | * elements below with tree_mod_log_eb_copy. We're holding a |
| 3477 | * tree lock on the buffer, which is why we cannot race with |
| 3478 | * other tree_mod_log users. |
Jan Schmidt | d9abbf1 | 2013-03-20 13:49:48 +0000 | [diff] [blame] | 3479 | */ |
Liu Bo | fdd99c7 | 2013-05-22 12:06:51 +0000 | [diff] [blame] | 3480 | ret = insert_new_root(trans, root, path, level + 1); |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3481 | if (ret) |
| 3482 | return ret; |
Chris Mason | b361242 | 2009-05-13 19:12:15 -0400 | [diff] [blame] | 3483 | } else { |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 3484 | ret = push_nodes_for_insert(trans, root, path, level); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3485 | c = path->nodes[level]; |
| 3486 | if (!ret && btrfs_header_nritems(c) < |
Chris Mason | c448acf | 2008-04-24 09:34:34 -0400 | [diff] [blame] | 3487 | BTRFS_NODEPTRS_PER_BLOCK(root) - 3) |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 3488 | return 0; |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 3489 | if (ret < 0) |
| 3490 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3491 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 3492 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3493 | c_nritems = btrfs_header_nritems(c); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 3494 | mid = (c_nritems + 1) / 2; |
| 3495 | btrfs_node_key(c, &disk_key, mid); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3496 | |
David Sterba | 4d75f8a | 2014-06-15 01:54:12 +0200 | [diff] [blame] | 3497 | split = btrfs_alloc_tree_block(trans, root, 0, root->root_key.objectid, |
| 3498 | &disk_key, level, c->start, 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3499 | if (IS_ERR(split)) |
| 3500 | return PTR_ERR(split); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 3501 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3502 | root_add_used(root, root->nodesize); |
| 3503 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 3504 | memset_extent_buffer(split, 0, 0, sizeof(struct btrfs_header)); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3505 | btrfs_set_header_level(split, btrfs_header_level(c)); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3506 | btrfs_set_header_bytenr(split, split->start); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3507 | btrfs_set_header_generation(split, trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 3508 | btrfs_set_header_backref_rev(split, BTRFS_MIXED_BACKREF_REV); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3509 | btrfs_set_header_owner(split, root->root_key.objectid); |
| 3510 | write_extent_buffer(split, root->fs_info->fsid, |
Ross Kirk | 0a4e558 | 2013-09-24 10:12:38 +0100 | [diff] [blame] | 3511 | btrfs_header_fsid(), BTRFS_FSID_SIZE); |
Chris Mason | e17cade | 2008-04-15 15:41:47 -0400 | [diff] [blame] | 3512 | write_extent_buffer(split, root->fs_info->chunk_tree_uuid, |
Geert Uytterhoeven | b308bc2 | 2013-08-20 13:20:15 +0200 | [diff] [blame] | 3513 | btrfs_header_chunk_tree_uuid(split), |
Chris Mason | e17cade | 2008-04-15 15:41:47 -0400 | [diff] [blame] | 3514 | BTRFS_UUID_SIZE); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3515 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 3516 | ret = tree_mod_log_eb_copy(root->fs_info, split, c, 0, |
| 3517 | mid, c_nritems - mid); |
| 3518 | if (ret) { |
Jeff Mahoney | 6664283 | 2016-06-10 18:19:25 -0400 | [diff] [blame] | 3519 | btrfs_abort_transaction(trans, ret); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 3520 | return ret; |
| 3521 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3522 | copy_extent_buffer(split, c, |
| 3523 | btrfs_node_key_ptr_offset(0), |
| 3524 | btrfs_node_key_ptr_offset(mid), |
| 3525 | (c_nritems - mid) * sizeof(struct btrfs_key_ptr)); |
| 3526 | btrfs_set_header_nritems(split, c_nritems - mid); |
| 3527 | btrfs_set_header_nritems(c, mid); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3528 | ret = 0; |
| 3529 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3530 | btrfs_mark_buffer_dirty(c); |
| 3531 | btrfs_mark_buffer_dirty(split); |
| 3532 | |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 3533 | insert_ptr(trans, root, path, &disk_key, split->start, |
Jan Schmidt | c3e0696 | 2012-06-21 11:01:06 +0200 | [diff] [blame] | 3534 | path->slots[level + 1] + 1, level + 1); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3535 | |
Chris Mason | 5de08d7 | 2007-02-24 06:24:44 -0500 | [diff] [blame] | 3536 | if (path->slots[level] >= mid) { |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3537 | path->slots[level] -= mid; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3538 | btrfs_tree_unlock(c); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3539 | free_extent_buffer(c); |
| 3540 | path->nodes[level] = split; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3541 | path->slots[level + 1] += 1; |
| 3542 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3543 | btrfs_tree_unlock(split); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3544 | free_extent_buffer(split); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3545 | } |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3546 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3547 | } |
| 3548 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3549 | /* |
| 3550 | * how many bytes are required to store the items in a leaf. start |
| 3551 | * and nr indicate which items in the leaf to check. This totals up the |
| 3552 | * space used both by the item structs and the item data |
| 3553 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3554 | static int leaf_space_used(struct extent_buffer *l, int start, int nr) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3555 | { |
Josef Bacik | 41be1f3 | 2012-10-15 13:43:18 -0400 | [diff] [blame] | 3556 | struct btrfs_item *start_item; |
| 3557 | struct btrfs_item *end_item; |
| 3558 | struct btrfs_map_token token; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3559 | int data_len; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3560 | int nritems = btrfs_header_nritems(l); |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 3561 | int end = min(nritems, start + nr) - 1; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3562 | |
| 3563 | if (!nr) |
| 3564 | return 0; |
Josef Bacik | 41be1f3 | 2012-10-15 13:43:18 -0400 | [diff] [blame] | 3565 | btrfs_init_map_token(&token); |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 3566 | start_item = btrfs_item_nr(start); |
| 3567 | end_item = btrfs_item_nr(end); |
Josef Bacik | 41be1f3 | 2012-10-15 13:43:18 -0400 | [diff] [blame] | 3568 | data_len = btrfs_token_item_offset(l, start_item, &token) + |
| 3569 | btrfs_token_item_size(l, start_item, &token); |
| 3570 | data_len = data_len - btrfs_token_item_offset(l, end_item, &token); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 3571 | data_len += sizeof(struct btrfs_item) * nr; |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 3572 | WARN_ON(data_len < 0); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3573 | return data_len; |
| 3574 | } |
| 3575 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3576 | /* |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 3577 | * The space between the end of the leaf items and |
| 3578 | * the start of the leaf data. IOW, how much room |
| 3579 | * the leaf has left for both items and data |
| 3580 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3581 | noinline int btrfs_leaf_free_space(struct btrfs_root *root, |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 3582 | struct extent_buffer *leaf) |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 3583 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3584 | int nritems = btrfs_header_nritems(leaf); |
| 3585 | int ret; |
| 3586 | ret = BTRFS_LEAF_DATA_SIZE(root) - leaf_space_used(leaf, 0, nritems); |
| 3587 | if (ret < 0) { |
Frank Holton | efe120a | 2013-12-20 11:37:06 -0500 | [diff] [blame] | 3588 | btrfs_crit(root->fs_info, |
| 3589 | "leaf free space ret %d, leaf data size %lu, used %d nritems %d", |
Jens Axboe | ae2f541 | 2007-10-19 09:22:59 -0400 | [diff] [blame] | 3590 | ret, (unsigned long) BTRFS_LEAF_DATA_SIZE(root), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3591 | leaf_space_used(leaf, 0, nritems), nritems); |
| 3592 | } |
| 3593 | return ret; |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 3594 | } |
| 3595 | |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3596 | /* |
| 3597 | * min slot controls the lowest index we're willing to push to the |
| 3598 | * right. We'll push up to and including min_slot, but no lower |
| 3599 | */ |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3600 | static noinline int __push_leaf_right(struct btrfs_trans_handle *trans, |
| 3601 | struct btrfs_root *root, |
| 3602 | struct btrfs_path *path, |
| 3603 | int data_size, int empty, |
| 3604 | struct extent_buffer *right, |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3605 | int free_space, u32 left_nritems, |
| 3606 | u32 min_slot) |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3607 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3608 | struct extent_buffer *left = path->nodes[0]; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3609 | struct extent_buffer *upper = path->nodes[1]; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3610 | struct btrfs_map_token token; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3611 | struct btrfs_disk_key disk_key; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3612 | int slot; |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3613 | u32 i; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3614 | int push_space = 0; |
| 3615 | int push_items = 0; |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 3616 | struct btrfs_item *item; |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3617 | u32 nr; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3618 | u32 right_nritems; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3619 | u32 data_end; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3620 | u32 this_item_size; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3621 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3622 | btrfs_init_map_token(&token); |
| 3623 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3624 | if (empty) |
| 3625 | nr = 0; |
| 3626 | else |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3627 | nr = max_t(u32, 1, min_slot); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3628 | |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3629 | if (path->slots[0] >= left_nritems) |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 3630 | push_space += data_size; |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3631 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3632 | slot = path->slots[1]; |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3633 | i = left_nritems - 1; |
| 3634 | while (i >= nr) { |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 3635 | item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3636 | |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3637 | if (!empty && push_items > 0) { |
| 3638 | if (path->slots[0] > i) |
| 3639 | break; |
| 3640 | if (path->slots[0] == i) { |
| 3641 | int space = btrfs_leaf_free_space(root, left); |
| 3642 | if (space + push_space * 2 > free_space) |
| 3643 | break; |
| 3644 | } |
| 3645 | } |
| 3646 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3647 | if (path->slots[0] == i) |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 3648 | push_space += data_size; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3649 | |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3650 | this_item_size = btrfs_item_size(left, item); |
| 3651 | if (this_item_size + sizeof(*item) + push_space > free_space) |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3652 | break; |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3653 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3654 | push_items++; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3655 | push_space += this_item_size + sizeof(*item); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3656 | if (i == 0) |
| 3657 | break; |
| 3658 | i--; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3659 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3660 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3661 | if (push_items == 0) |
| 3662 | goto out_unlock; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3663 | |
Julia Lawall | 6c1500f | 2012-11-03 20:30:18 +0000 | [diff] [blame] | 3664 | WARN_ON(!empty && push_items == left_nritems); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3665 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3666 | /* push left to right */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3667 | right_nritems = btrfs_header_nritems(right); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3668 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3669 | push_space = btrfs_item_end_nr(left, left_nritems - push_items); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 3670 | push_space -= leaf_data_end(root, left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3671 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3672 | /* make room in the right data area */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3673 | data_end = leaf_data_end(root, right); |
| 3674 | memmove_extent_buffer(right, |
| 3675 | btrfs_leaf_data(right) + data_end - push_space, |
| 3676 | btrfs_leaf_data(right) + data_end, |
| 3677 | BTRFS_LEAF_DATA_SIZE(root) - data_end); |
| 3678 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3679 | /* copy from the left data area */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3680 | copy_extent_buffer(right, left, btrfs_leaf_data(right) + |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3681 | BTRFS_LEAF_DATA_SIZE(root) - push_space, |
| 3682 | btrfs_leaf_data(left) + leaf_data_end(root, left), |
| 3683 | push_space); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3684 | |
| 3685 | memmove_extent_buffer(right, btrfs_item_nr_offset(push_items), |
| 3686 | btrfs_item_nr_offset(0), |
| 3687 | right_nritems * sizeof(struct btrfs_item)); |
| 3688 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3689 | /* copy the items from left to right */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3690 | copy_extent_buffer(right, left, btrfs_item_nr_offset(0), |
| 3691 | btrfs_item_nr_offset(left_nritems - push_items), |
| 3692 | push_items * sizeof(struct btrfs_item)); |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3693 | |
| 3694 | /* update the item pointers */ |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3695 | right_nritems += push_items; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3696 | btrfs_set_header_nritems(right, right_nritems); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 3697 | push_space = BTRFS_LEAF_DATA_SIZE(root); |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3698 | for (i = 0; i < right_nritems; i++) { |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 3699 | item = btrfs_item_nr(i); |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3700 | push_space -= btrfs_token_item_size(right, item, &token); |
| 3701 | btrfs_set_token_item_offset(right, item, push_space, &token); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3702 | } |
| 3703 | |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3704 | left_nritems -= push_items; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3705 | btrfs_set_header_nritems(left, left_nritems); |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3706 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3707 | if (left_nritems) |
| 3708 | btrfs_mark_buffer_dirty(left); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3709 | else |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 3710 | clean_tree_block(trans, root->fs_info, left); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3711 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3712 | btrfs_mark_buffer_dirty(right); |
Chris Mason | a429e51 | 2007-04-18 16:15:28 -0400 | [diff] [blame] | 3713 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3714 | btrfs_item_key(right, &disk_key, 0); |
| 3715 | btrfs_set_node_key(upper, &disk_key, slot + 1); |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3716 | btrfs_mark_buffer_dirty(upper); |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 3717 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3718 | /* then fixup the leaf pointer in the path */ |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3719 | if (path->slots[0] >= left_nritems) { |
| 3720 | path->slots[0] -= left_nritems; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3721 | if (btrfs_header_nritems(path->nodes[0]) == 0) |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 3722 | clean_tree_block(trans, root->fs_info, path->nodes[0]); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3723 | btrfs_tree_unlock(path->nodes[0]); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3724 | free_extent_buffer(path->nodes[0]); |
| 3725 | path->nodes[0] = right; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3726 | path->slots[1] += 1; |
| 3727 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3728 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3729 | free_extent_buffer(right); |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3730 | } |
| 3731 | return 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3732 | |
| 3733 | out_unlock: |
| 3734 | btrfs_tree_unlock(right); |
| 3735 | free_extent_buffer(right); |
| 3736 | return 1; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3737 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3738 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3739 | /* |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3740 | * push some data in the path leaf to the right, trying to free up at |
| 3741 | * least data_size bytes. returns zero if the push worked, nonzero otherwise |
| 3742 | * |
| 3743 | * returns 1 if the push failed because the other node didn't have enough |
| 3744 | * room, 0 if everything worked out and < 0 if there were major errors. |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3745 | * |
| 3746 | * this will push starting from min_slot to the end of the leaf. It won't |
| 3747 | * push any slot lower than min_slot |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3748 | */ |
| 3749 | static int push_leaf_right(struct btrfs_trans_handle *trans, struct btrfs_root |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3750 | *root, struct btrfs_path *path, |
| 3751 | int min_data_size, int data_size, |
| 3752 | int empty, u32 min_slot) |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3753 | { |
| 3754 | struct extent_buffer *left = path->nodes[0]; |
| 3755 | struct extent_buffer *right; |
| 3756 | struct extent_buffer *upper; |
| 3757 | int slot; |
| 3758 | int free_space; |
| 3759 | u32 left_nritems; |
| 3760 | int ret; |
| 3761 | |
| 3762 | if (!path->nodes[1]) |
| 3763 | return 1; |
| 3764 | |
| 3765 | slot = path->slots[1]; |
| 3766 | upper = path->nodes[1]; |
| 3767 | if (slot >= btrfs_header_nritems(upper) - 1) |
| 3768 | return 1; |
| 3769 | |
| 3770 | btrfs_assert_tree_locked(path->nodes[1]); |
| 3771 | |
| 3772 | right = read_node_slot(root, upper, slot + 1); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 3773 | /* |
| 3774 | * slot + 1 is not valid or we fail to read the right node, |
| 3775 | * no big deal, just return. |
| 3776 | */ |
| 3777 | if (IS_ERR(right)) |
Tsutomu Itoh | 91ca338 | 2011-01-05 02:32:22 +0000 | [diff] [blame] | 3778 | return 1; |
| 3779 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3780 | btrfs_tree_lock(right); |
| 3781 | btrfs_set_lock_blocking(right); |
| 3782 | |
| 3783 | free_space = btrfs_leaf_free_space(root, right); |
| 3784 | if (free_space < data_size) |
| 3785 | goto out_unlock; |
| 3786 | |
| 3787 | /* cow and double check */ |
| 3788 | ret = btrfs_cow_block(trans, root, right, upper, |
| 3789 | slot + 1, &right); |
| 3790 | if (ret) |
| 3791 | goto out_unlock; |
| 3792 | |
| 3793 | free_space = btrfs_leaf_free_space(root, right); |
| 3794 | if (free_space < data_size) |
| 3795 | goto out_unlock; |
| 3796 | |
| 3797 | left_nritems = btrfs_header_nritems(left); |
| 3798 | if (left_nritems == 0) |
| 3799 | goto out_unlock; |
| 3800 | |
Filipe David Borba Manana | 2ef1fed | 2013-12-04 22:17:39 +0000 | [diff] [blame] | 3801 | if (path->slots[0] == left_nritems && !empty) { |
| 3802 | /* Key greater than all keys in the leaf, right neighbor has |
| 3803 | * enough room for it and we're not emptying our leaf to delete |
| 3804 | * it, therefore use right neighbor to insert the new item and |
| 3805 | * no need to touch/dirty our left leaft. */ |
| 3806 | btrfs_tree_unlock(left); |
| 3807 | free_extent_buffer(left); |
| 3808 | path->nodes[0] = right; |
| 3809 | path->slots[0] = 0; |
| 3810 | path->slots[1]++; |
| 3811 | return 0; |
| 3812 | } |
| 3813 | |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3814 | return __push_leaf_right(trans, root, path, min_data_size, empty, |
| 3815 | right, free_space, left_nritems, min_slot); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3816 | out_unlock: |
| 3817 | btrfs_tree_unlock(right); |
| 3818 | free_extent_buffer(right); |
| 3819 | return 1; |
| 3820 | } |
| 3821 | |
| 3822 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3823 | * push some data in the path leaf to the left, trying to free up at |
| 3824 | * least data_size bytes. returns zero if the push worked, nonzero otherwise |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3825 | * |
| 3826 | * max_slot can put a limit on how far into the leaf we'll push items. The |
| 3827 | * item at 'max_slot' won't be touched. Use (u32)-1 to make us do all the |
| 3828 | * items |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3829 | */ |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3830 | static noinline int __push_leaf_left(struct btrfs_trans_handle *trans, |
| 3831 | struct btrfs_root *root, |
| 3832 | struct btrfs_path *path, int data_size, |
| 3833 | int empty, struct extent_buffer *left, |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3834 | int free_space, u32 right_nritems, |
| 3835 | u32 max_slot) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3836 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3837 | struct btrfs_disk_key disk_key; |
| 3838 | struct extent_buffer *right = path->nodes[0]; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3839 | int i; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3840 | int push_space = 0; |
| 3841 | int push_items = 0; |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 3842 | struct btrfs_item *item; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3843 | u32 old_left_nritems; |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3844 | u32 nr; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3845 | int ret = 0; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3846 | u32 this_item_size; |
| 3847 | u32 old_left_item_size; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3848 | struct btrfs_map_token token; |
| 3849 | |
| 3850 | btrfs_init_map_token(&token); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3851 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3852 | if (empty) |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3853 | nr = min(right_nritems, max_slot); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3854 | else |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3855 | nr = min(right_nritems - 1, max_slot); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3856 | |
| 3857 | for (i = 0; i < nr; i++) { |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 3858 | item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3859 | |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3860 | if (!empty && push_items > 0) { |
| 3861 | if (path->slots[0] < i) |
| 3862 | break; |
| 3863 | if (path->slots[0] == i) { |
| 3864 | int space = btrfs_leaf_free_space(root, right); |
| 3865 | if (space + push_space * 2 > free_space) |
| 3866 | break; |
| 3867 | } |
| 3868 | } |
| 3869 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3870 | if (path->slots[0] == i) |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 3871 | push_space += data_size; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3872 | |
| 3873 | this_item_size = btrfs_item_size(right, item); |
| 3874 | if (this_item_size + sizeof(*item) + push_space > free_space) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3875 | break; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3876 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3877 | push_items++; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3878 | push_space += this_item_size + sizeof(*item); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3879 | } |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3880 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3881 | if (push_items == 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3882 | ret = 1; |
| 3883 | goto out; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3884 | } |
Dulshani Gunawardhana | fae7f21 | 2013-10-31 10:30:08 +0530 | [diff] [blame] | 3885 | WARN_ON(!empty && push_items == btrfs_header_nritems(right)); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3886 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3887 | /* push data from right to left */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3888 | copy_extent_buffer(left, right, |
| 3889 | btrfs_item_nr_offset(btrfs_header_nritems(left)), |
| 3890 | btrfs_item_nr_offset(0), |
| 3891 | push_items * sizeof(struct btrfs_item)); |
| 3892 | |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 3893 | push_space = BTRFS_LEAF_DATA_SIZE(root) - |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3894 | btrfs_item_offset_nr(right, push_items - 1); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3895 | |
| 3896 | copy_extent_buffer(left, right, btrfs_leaf_data(left) + |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3897 | leaf_data_end(root, left) - push_space, |
| 3898 | btrfs_leaf_data(right) + |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3899 | btrfs_item_offset_nr(right, push_items - 1), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3900 | push_space); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3901 | old_left_nritems = btrfs_header_nritems(left); |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 3902 | BUG_ON(old_left_nritems <= 0); |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 3903 | |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3904 | old_left_item_size = btrfs_item_offset_nr(left, old_left_nritems - 1); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 3905 | for (i = old_left_nritems; i < old_left_nritems + push_items; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3906 | u32 ioff; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3907 | |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 3908 | item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3909 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3910 | ioff = btrfs_token_item_offset(left, item, &token); |
| 3911 | btrfs_set_token_item_offset(left, item, |
| 3912 | ioff - (BTRFS_LEAF_DATA_SIZE(root) - old_left_item_size), |
| 3913 | &token); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3914 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3915 | btrfs_set_header_nritems(left, old_left_nritems + push_items); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3916 | |
| 3917 | /* fixup right node */ |
Julia Lawall | 31b1a2b | 2012-11-03 10:58:34 +0000 | [diff] [blame] | 3918 | if (push_items > right_nritems) |
| 3919 | WARN(1, KERN_CRIT "push items %d nr %u\n", push_items, |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3920 | right_nritems); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3921 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3922 | if (push_items < right_nritems) { |
| 3923 | push_space = btrfs_item_offset_nr(right, push_items - 1) - |
| 3924 | leaf_data_end(root, right); |
| 3925 | memmove_extent_buffer(right, btrfs_leaf_data(right) + |
| 3926 | BTRFS_LEAF_DATA_SIZE(root) - push_space, |
| 3927 | btrfs_leaf_data(right) + |
| 3928 | leaf_data_end(root, right), push_space); |
| 3929 | |
| 3930 | memmove_extent_buffer(right, btrfs_item_nr_offset(0), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3931 | btrfs_item_nr_offset(push_items), |
| 3932 | (btrfs_header_nritems(right) - push_items) * |
| 3933 | sizeof(struct btrfs_item)); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3934 | } |
Yan | eef1c49 | 2007-11-26 10:58:13 -0500 | [diff] [blame] | 3935 | right_nritems -= push_items; |
| 3936 | btrfs_set_header_nritems(right, right_nritems); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 3937 | push_space = BTRFS_LEAF_DATA_SIZE(root); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3938 | for (i = 0; i < right_nritems; i++) { |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 3939 | item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3940 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3941 | push_space = push_space - btrfs_token_item_size(right, |
| 3942 | item, &token); |
| 3943 | btrfs_set_token_item_offset(right, item, push_space, &token); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3944 | } |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 3945 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3946 | btrfs_mark_buffer_dirty(left); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3947 | if (right_nritems) |
| 3948 | btrfs_mark_buffer_dirty(right); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3949 | else |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 3950 | clean_tree_block(trans, root->fs_info, right); |
Chris Mason | 098f59c | 2007-05-11 11:33:21 -0400 | [diff] [blame] | 3951 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3952 | btrfs_item_key(right, &disk_key, 0); |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 3953 | fixup_low_keys(root->fs_info, path, &disk_key, 1); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3954 | |
| 3955 | /* then fixup the leaf pointer in the path */ |
| 3956 | if (path->slots[0] < push_items) { |
| 3957 | path->slots[0] += old_left_nritems; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3958 | btrfs_tree_unlock(path->nodes[0]); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3959 | free_extent_buffer(path->nodes[0]); |
| 3960 | path->nodes[0] = left; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3961 | path->slots[1] -= 1; |
| 3962 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3963 | btrfs_tree_unlock(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3964 | free_extent_buffer(left); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3965 | path->slots[0] -= push_items; |
| 3966 | } |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 3967 | BUG_ON(path->slots[0] < 0); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3968 | return ret; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3969 | out: |
| 3970 | btrfs_tree_unlock(left); |
| 3971 | free_extent_buffer(left); |
| 3972 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3973 | } |
| 3974 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3975 | /* |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3976 | * push some data in the path leaf to the left, trying to free up at |
| 3977 | * least data_size bytes. returns zero if the push worked, nonzero otherwise |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3978 | * |
| 3979 | * max_slot can put a limit on how far into the leaf we'll push items. The |
| 3980 | * item at 'max_slot' won't be touched. Use (u32)-1 to make us push all the |
| 3981 | * items |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3982 | */ |
| 3983 | static int push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_root |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3984 | *root, struct btrfs_path *path, int min_data_size, |
| 3985 | int data_size, int empty, u32 max_slot) |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3986 | { |
| 3987 | struct extent_buffer *right = path->nodes[0]; |
| 3988 | struct extent_buffer *left; |
| 3989 | int slot; |
| 3990 | int free_space; |
| 3991 | u32 right_nritems; |
| 3992 | int ret = 0; |
| 3993 | |
| 3994 | slot = path->slots[1]; |
| 3995 | if (slot == 0) |
| 3996 | return 1; |
| 3997 | if (!path->nodes[1]) |
| 3998 | return 1; |
| 3999 | |
| 4000 | right_nritems = btrfs_header_nritems(right); |
| 4001 | if (right_nritems == 0) |
| 4002 | return 1; |
| 4003 | |
| 4004 | btrfs_assert_tree_locked(path->nodes[1]); |
| 4005 | |
| 4006 | left = read_node_slot(root, path->nodes[1], slot - 1); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 4007 | /* |
| 4008 | * slot - 1 is not valid or we fail to read the left node, |
| 4009 | * no big deal, just return. |
| 4010 | */ |
| 4011 | if (IS_ERR(left)) |
Tsutomu Itoh | 91ca338 | 2011-01-05 02:32:22 +0000 | [diff] [blame] | 4012 | return 1; |
| 4013 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4014 | btrfs_tree_lock(left); |
| 4015 | btrfs_set_lock_blocking(left); |
| 4016 | |
| 4017 | free_space = btrfs_leaf_free_space(root, left); |
| 4018 | if (free_space < data_size) { |
| 4019 | ret = 1; |
| 4020 | goto out; |
| 4021 | } |
| 4022 | |
| 4023 | /* cow and double check */ |
| 4024 | ret = btrfs_cow_block(trans, root, left, |
| 4025 | path->nodes[1], slot - 1, &left); |
| 4026 | if (ret) { |
| 4027 | /* we hit -ENOSPC, but it isn't fatal here */ |
Jeff Mahoney | 79787ea | 2012-03-12 16:03:00 +0100 | [diff] [blame] | 4028 | if (ret == -ENOSPC) |
| 4029 | ret = 1; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4030 | goto out; |
| 4031 | } |
| 4032 | |
| 4033 | free_space = btrfs_leaf_free_space(root, left); |
| 4034 | if (free_space < data_size) { |
| 4035 | ret = 1; |
| 4036 | goto out; |
| 4037 | } |
| 4038 | |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4039 | return __push_leaf_left(trans, root, path, min_data_size, |
| 4040 | empty, left, free_space, right_nritems, |
| 4041 | max_slot); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4042 | out: |
| 4043 | btrfs_tree_unlock(left); |
| 4044 | free_extent_buffer(left); |
| 4045 | return ret; |
| 4046 | } |
| 4047 | |
| 4048 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4049 | * split the path's leaf in two, making sure there is at least data_size |
| 4050 | * available for the resulting leaf level of the path. |
| 4051 | */ |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4052 | static noinline void copy_for_split(struct btrfs_trans_handle *trans, |
| 4053 | struct btrfs_root *root, |
| 4054 | struct btrfs_path *path, |
| 4055 | struct extent_buffer *l, |
| 4056 | struct extent_buffer *right, |
| 4057 | int slot, int mid, int nritems) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4058 | { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4059 | int data_copy_size; |
| 4060 | int rt_data_off; |
| 4061 | int i; |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 4062 | struct btrfs_disk_key disk_key; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4063 | struct btrfs_map_token token; |
| 4064 | |
| 4065 | btrfs_init_map_token(&token); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4066 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4067 | nritems = nritems - mid; |
| 4068 | btrfs_set_header_nritems(right, nritems); |
| 4069 | data_copy_size = btrfs_item_end_nr(l, mid) - leaf_data_end(root, l); |
| 4070 | |
| 4071 | copy_extent_buffer(right, l, btrfs_item_nr_offset(0), |
| 4072 | btrfs_item_nr_offset(mid), |
| 4073 | nritems * sizeof(struct btrfs_item)); |
| 4074 | |
| 4075 | copy_extent_buffer(right, l, |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 4076 | btrfs_leaf_data(right) + BTRFS_LEAF_DATA_SIZE(root) - |
| 4077 | data_copy_size, btrfs_leaf_data(l) + |
| 4078 | leaf_data_end(root, l), data_copy_size); |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4079 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4080 | rt_data_off = BTRFS_LEAF_DATA_SIZE(root) - |
| 4081 | btrfs_item_end_nr(l, mid); |
| 4082 | |
| 4083 | for (i = 0; i < nritems; i++) { |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4084 | struct btrfs_item *item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4085 | u32 ioff; |
| 4086 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4087 | ioff = btrfs_token_item_offset(right, item, &token); |
| 4088 | btrfs_set_token_item_offset(right, item, |
| 4089 | ioff + rt_data_off, &token); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 4090 | } |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4091 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4092 | btrfs_set_header_nritems(l, mid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4093 | btrfs_item_key(right, &disk_key, 0); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4094 | insert_ptr(trans, root, path, &disk_key, right->start, |
Jan Schmidt | c3e0696 | 2012-06-21 11:01:06 +0200 | [diff] [blame] | 4095 | path->slots[1] + 1, 1); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4096 | |
| 4097 | btrfs_mark_buffer_dirty(right); |
| 4098 | btrfs_mark_buffer_dirty(l); |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 4099 | BUG_ON(path->slots[0] != slot); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4100 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4101 | if (mid <= slot) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4102 | btrfs_tree_unlock(path->nodes[0]); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4103 | free_extent_buffer(path->nodes[0]); |
| 4104 | path->nodes[0] = right; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4105 | path->slots[0] -= mid; |
| 4106 | path->slots[1] += 1; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4107 | } else { |
| 4108 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4109 | free_extent_buffer(right); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4110 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4111 | |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 4112 | BUG_ON(path->slots[0] < 0); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4113 | } |
| 4114 | |
| 4115 | /* |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4116 | * double splits happen when we need to insert a big item in the middle |
| 4117 | * of a leaf. A double split can leave us with 3 mostly empty leaves: |
| 4118 | * leaf: [ slots 0 - N] [ our target ] [ N + 1 - total in leaf ] |
| 4119 | * A B C |
| 4120 | * |
| 4121 | * We avoid this by trying to push the items on either side of our target |
| 4122 | * into the adjacent leaves. If all goes well we can avoid the double split |
| 4123 | * completely. |
| 4124 | */ |
| 4125 | static noinline int push_for_double_split(struct btrfs_trans_handle *trans, |
| 4126 | struct btrfs_root *root, |
| 4127 | struct btrfs_path *path, |
| 4128 | int data_size) |
| 4129 | { |
| 4130 | int ret; |
| 4131 | int progress = 0; |
| 4132 | int slot; |
| 4133 | u32 nritems; |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4134 | int space_needed = data_size; |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4135 | |
| 4136 | slot = path->slots[0]; |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4137 | if (slot < btrfs_header_nritems(path->nodes[0])) |
| 4138 | space_needed -= btrfs_leaf_free_space(root, path->nodes[0]); |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4139 | |
| 4140 | /* |
| 4141 | * try to push all the items after our slot into the |
| 4142 | * right leaf |
| 4143 | */ |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4144 | ret = push_leaf_right(trans, root, path, 1, space_needed, 0, slot); |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4145 | if (ret < 0) |
| 4146 | return ret; |
| 4147 | |
| 4148 | if (ret == 0) |
| 4149 | progress++; |
| 4150 | |
| 4151 | nritems = btrfs_header_nritems(path->nodes[0]); |
| 4152 | /* |
| 4153 | * our goal is to get our slot at the start or end of a leaf. If |
| 4154 | * we've done so we're done |
| 4155 | */ |
| 4156 | if (path->slots[0] == 0 || path->slots[0] == nritems) |
| 4157 | return 0; |
| 4158 | |
| 4159 | if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size) |
| 4160 | return 0; |
| 4161 | |
| 4162 | /* try to push all the items before our slot into the next leaf */ |
| 4163 | slot = path->slots[0]; |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4164 | ret = push_leaf_left(trans, root, path, 1, space_needed, 0, slot); |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4165 | if (ret < 0) |
| 4166 | return ret; |
| 4167 | |
| 4168 | if (ret == 0) |
| 4169 | progress++; |
| 4170 | |
| 4171 | if (progress) |
| 4172 | return 0; |
| 4173 | return 1; |
| 4174 | } |
| 4175 | |
| 4176 | /* |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4177 | * split the path's leaf in two, making sure there is at least data_size |
| 4178 | * available for the resulting leaf level of the path. |
| 4179 | * |
| 4180 | * returns 0 if all went well and < 0 on failure. |
| 4181 | */ |
| 4182 | static noinline int split_leaf(struct btrfs_trans_handle *trans, |
| 4183 | struct btrfs_root *root, |
| 4184 | struct btrfs_key *ins_key, |
| 4185 | struct btrfs_path *path, int data_size, |
| 4186 | int extend) |
| 4187 | { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4188 | struct btrfs_disk_key disk_key; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4189 | struct extent_buffer *l; |
| 4190 | u32 nritems; |
| 4191 | int mid; |
| 4192 | int slot; |
| 4193 | struct extent_buffer *right; |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 4194 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4195 | int ret = 0; |
| 4196 | int wret; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4197 | int split; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4198 | int num_doubles = 0; |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4199 | int tried_avoid_double = 0; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4200 | |
Yan, Zheng | a571952 | 2009-09-24 09:17:31 -0400 | [diff] [blame] | 4201 | l = path->nodes[0]; |
| 4202 | slot = path->slots[0]; |
| 4203 | if (extend && data_size + btrfs_item_size_nr(l, slot) + |
| 4204 | sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(root)) |
| 4205 | return -EOVERFLOW; |
| 4206 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4207 | /* first try to make some room by pushing left and right */ |
Liu Bo | 33157e0 | 2013-05-22 12:07:06 +0000 | [diff] [blame] | 4208 | if (data_size && path->nodes[1]) { |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4209 | int space_needed = data_size; |
| 4210 | |
| 4211 | if (slot < btrfs_header_nritems(l)) |
| 4212 | space_needed -= btrfs_leaf_free_space(root, l); |
| 4213 | |
| 4214 | wret = push_leaf_right(trans, root, path, space_needed, |
| 4215 | space_needed, 0, 0); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4216 | if (wret < 0) |
| 4217 | return wret; |
| 4218 | if (wret) { |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4219 | wret = push_leaf_left(trans, root, path, space_needed, |
| 4220 | space_needed, 0, (u32)-1); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4221 | if (wret < 0) |
| 4222 | return wret; |
| 4223 | } |
| 4224 | l = path->nodes[0]; |
| 4225 | |
| 4226 | /* did the pushes work? */ |
| 4227 | if (btrfs_leaf_free_space(root, l) >= data_size) |
| 4228 | return 0; |
| 4229 | } |
| 4230 | |
| 4231 | if (!path->nodes[1]) { |
Liu Bo | fdd99c7 | 2013-05-22 12:06:51 +0000 | [diff] [blame] | 4232 | ret = insert_new_root(trans, root, path, 1); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4233 | if (ret) |
| 4234 | return ret; |
| 4235 | } |
| 4236 | again: |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4237 | split = 1; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4238 | l = path->nodes[0]; |
| 4239 | slot = path->slots[0]; |
| 4240 | nritems = btrfs_header_nritems(l); |
| 4241 | mid = (nritems + 1) / 2; |
| 4242 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4243 | if (mid <= slot) { |
| 4244 | if (nritems == 1 || |
| 4245 | leaf_space_used(l, mid, nritems - mid) + data_size > |
| 4246 | BTRFS_LEAF_DATA_SIZE(root)) { |
| 4247 | if (slot >= nritems) { |
| 4248 | split = 0; |
| 4249 | } else { |
| 4250 | mid = slot; |
| 4251 | if (mid != nritems && |
| 4252 | leaf_space_used(l, mid, nritems - mid) + |
| 4253 | data_size > BTRFS_LEAF_DATA_SIZE(root)) { |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4254 | if (data_size && !tried_avoid_double) |
| 4255 | goto push_for_double; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4256 | split = 2; |
| 4257 | } |
| 4258 | } |
| 4259 | } |
| 4260 | } else { |
| 4261 | if (leaf_space_used(l, 0, mid) + data_size > |
| 4262 | BTRFS_LEAF_DATA_SIZE(root)) { |
| 4263 | if (!extend && data_size && slot == 0) { |
| 4264 | split = 0; |
| 4265 | } else if ((extend || !data_size) && slot == 0) { |
| 4266 | mid = 1; |
| 4267 | } else { |
| 4268 | mid = slot; |
| 4269 | if (mid != nritems && |
| 4270 | leaf_space_used(l, mid, nritems - mid) + |
| 4271 | data_size > BTRFS_LEAF_DATA_SIZE(root)) { |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4272 | if (data_size && !tried_avoid_double) |
| 4273 | goto push_for_double; |
Dulshani Gunawardhana | 6787125 | 2013-10-31 10:33:04 +0530 | [diff] [blame] | 4274 | split = 2; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4275 | } |
| 4276 | } |
| 4277 | } |
| 4278 | } |
| 4279 | |
| 4280 | if (split == 0) |
| 4281 | btrfs_cpu_key_to_disk(&disk_key, ins_key); |
| 4282 | else |
| 4283 | btrfs_item_key(l, &disk_key, mid); |
| 4284 | |
David Sterba | 4d75f8a | 2014-06-15 01:54:12 +0200 | [diff] [blame] | 4285 | right = btrfs_alloc_tree_block(trans, root, 0, root->root_key.objectid, |
| 4286 | &disk_key, 0, l->start, 0); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 4287 | if (IS_ERR(right)) |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4288 | return PTR_ERR(right); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 4289 | |
David Sterba | 707e8a0 | 2014-06-04 19:22:26 +0200 | [diff] [blame] | 4290 | root_add_used(root, root->nodesize); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4291 | |
| 4292 | memset_extent_buffer(right, 0, 0, sizeof(struct btrfs_header)); |
| 4293 | btrfs_set_header_bytenr(right, right->start); |
| 4294 | btrfs_set_header_generation(right, trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4295 | btrfs_set_header_backref_rev(right, BTRFS_MIXED_BACKREF_REV); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4296 | btrfs_set_header_owner(right, root->root_key.objectid); |
| 4297 | btrfs_set_header_level(right, 0); |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 4298 | write_extent_buffer(right, fs_info->fsid, |
Ross Kirk | 0a4e558 | 2013-09-24 10:12:38 +0100 | [diff] [blame] | 4299 | btrfs_header_fsid(), BTRFS_FSID_SIZE); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4300 | |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 4301 | write_extent_buffer(right, fs_info->chunk_tree_uuid, |
Geert Uytterhoeven | b308bc2 | 2013-08-20 13:20:15 +0200 | [diff] [blame] | 4302 | btrfs_header_chunk_tree_uuid(right), |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4303 | BTRFS_UUID_SIZE); |
| 4304 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4305 | if (split == 0) { |
| 4306 | if (mid <= slot) { |
| 4307 | btrfs_set_header_nritems(right, 0); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4308 | insert_ptr(trans, root, path, &disk_key, right->start, |
Jan Schmidt | c3e0696 | 2012-06-21 11:01:06 +0200 | [diff] [blame] | 4309 | path->slots[1] + 1, 1); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4310 | btrfs_tree_unlock(path->nodes[0]); |
| 4311 | free_extent_buffer(path->nodes[0]); |
| 4312 | path->nodes[0] = right; |
| 4313 | path->slots[0] = 0; |
| 4314 | path->slots[1] += 1; |
| 4315 | } else { |
| 4316 | btrfs_set_header_nritems(right, 0); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4317 | insert_ptr(trans, root, path, &disk_key, right->start, |
Jan Schmidt | c3e0696 | 2012-06-21 11:01:06 +0200 | [diff] [blame] | 4318 | path->slots[1], 1); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4319 | btrfs_tree_unlock(path->nodes[0]); |
| 4320 | free_extent_buffer(path->nodes[0]); |
| 4321 | path->nodes[0] = right; |
| 4322 | path->slots[0] = 0; |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4323 | if (path->slots[1] == 0) |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 4324 | fixup_low_keys(fs_info, path, &disk_key, 1); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4325 | } |
Liu Bo | 196e024 | 2016-09-07 14:48:28 -0700 | [diff] [blame] | 4326 | /* |
| 4327 | * We create a new leaf 'right' for the required ins_len and |
| 4328 | * we'll do btrfs_mark_buffer_dirty() on this leaf after copying |
| 4329 | * the content of ins_len to 'right'. |
| 4330 | */ |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4331 | return ret; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4332 | } |
| 4333 | |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4334 | copy_for_split(trans, root, path, l, right, slot, mid, nritems); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4335 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4336 | if (split == 2) { |
Chris Mason | cc0c553 | 2007-10-25 15:42:57 -0400 | [diff] [blame] | 4337 | BUG_ON(num_doubles != 0); |
| 4338 | num_doubles++; |
| 4339 | goto again; |
Chris Mason | 3326d1b | 2007-10-15 16:18:25 -0400 | [diff] [blame] | 4340 | } |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4341 | |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4342 | return 0; |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4343 | |
| 4344 | push_for_double: |
| 4345 | push_for_double_split(trans, root, path, data_size); |
| 4346 | tried_avoid_double = 1; |
| 4347 | if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size) |
| 4348 | return 0; |
| 4349 | goto again; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4350 | } |
| 4351 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4352 | static noinline int setup_leaf_for_split(struct btrfs_trans_handle *trans, |
| 4353 | struct btrfs_root *root, |
| 4354 | struct btrfs_path *path, int ins_len) |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4355 | { |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4356 | struct btrfs_key key; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4357 | struct extent_buffer *leaf; |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4358 | struct btrfs_file_extent_item *fi; |
| 4359 | u64 extent_len = 0; |
| 4360 | u32 item_size; |
| 4361 | int ret; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4362 | |
| 4363 | leaf = path->nodes[0]; |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4364 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
| 4365 | |
| 4366 | BUG_ON(key.type != BTRFS_EXTENT_DATA_KEY && |
| 4367 | key.type != BTRFS_EXTENT_CSUM_KEY); |
| 4368 | |
| 4369 | if (btrfs_leaf_free_space(root, leaf) >= ins_len) |
| 4370 | return 0; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4371 | |
| 4372 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4373 | if (key.type == BTRFS_EXTENT_DATA_KEY) { |
| 4374 | fi = btrfs_item_ptr(leaf, path->slots[0], |
| 4375 | struct btrfs_file_extent_item); |
| 4376 | extent_len = btrfs_file_extent_num_bytes(leaf, fi); |
| 4377 | } |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 4378 | btrfs_release_path(path); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4379 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4380 | path->keep_locks = 1; |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4381 | path->search_for_split = 1; |
| 4382 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4383 | path->search_for_split = 0; |
Filipe Manana | a8df6fe | 2015-01-20 12:40:53 +0000 | [diff] [blame] | 4384 | if (ret > 0) |
| 4385 | ret = -EAGAIN; |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4386 | if (ret < 0) |
| 4387 | goto err; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4388 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4389 | ret = -EAGAIN; |
| 4390 | leaf = path->nodes[0]; |
Filipe Manana | a8df6fe | 2015-01-20 12:40:53 +0000 | [diff] [blame] | 4391 | /* if our item isn't there, return now */ |
| 4392 | if (item_size != btrfs_item_size_nr(leaf, path->slots[0])) |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4393 | goto err; |
| 4394 | |
Chris Mason | 109f6ae | 2010-04-02 09:20:18 -0400 | [diff] [blame] | 4395 | /* the leaf has changed, it now has room. return now */ |
| 4396 | if (btrfs_leaf_free_space(root, path->nodes[0]) >= ins_len) |
| 4397 | goto err; |
| 4398 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4399 | if (key.type == BTRFS_EXTENT_DATA_KEY) { |
| 4400 | fi = btrfs_item_ptr(leaf, path->slots[0], |
| 4401 | struct btrfs_file_extent_item); |
| 4402 | if (extent_len != btrfs_file_extent_num_bytes(leaf, fi)) |
| 4403 | goto err; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4404 | } |
| 4405 | |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 4406 | btrfs_set_path_blocking(path); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4407 | ret = split_leaf(trans, root, &key, path, ins_len, 1); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 4408 | if (ret) |
| 4409 | goto err; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4410 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4411 | path->keep_locks = 0; |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 4412 | btrfs_unlock_up_safe(path, 1); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4413 | return 0; |
| 4414 | err: |
| 4415 | path->keep_locks = 0; |
| 4416 | return ret; |
| 4417 | } |
| 4418 | |
| 4419 | static noinline int split_item(struct btrfs_trans_handle *trans, |
| 4420 | struct btrfs_root *root, |
| 4421 | struct btrfs_path *path, |
| 4422 | struct btrfs_key *new_key, |
| 4423 | unsigned long split_offset) |
| 4424 | { |
| 4425 | struct extent_buffer *leaf; |
| 4426 | struct btrfs_item *item; |
| 4427 | struct btrfs_item *new_item; |
| 4428 | int slot; |
| 4429 | char *buf; |
| 4430 | u32 nritems; |
| 4431 | u32 item_size; |
| 4432 | u32 orig_offset; |
| 4433 | struct btrfs_disk_key disk_key; |
| 4434 | |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 4435 | leaf = path->nodes[0]; |
| 4436 | BUG_ON(btrfs_leaf_free_space(root, leaf) < sizeof(struct btrfs_item)); |
| 4437 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 4438 | btrfs_set_path_blocking(path); |
| 4439 | |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4440 | item = btrfs_item_nr(path->slots[0]); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4441 | orig_offset = btrfs_item_offset(leaf, item); |
| 4442 | item_size = btrfs_item_size(leaf, item); |
| 4443 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4444 | buf = kmalloc(item_size, GFP_NOFS); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4445 | if (!buf) |
| 4446 | return -ENOMEM; |
| 4447 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4448 | read_extent_buffer(leaf, buf, btrfs_item_ptr_offset(leaf, |
| 4449 | path->slots[0]), item_size); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4450 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4451 | slot = path->slots[0] + 1; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4452 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4453 | if (slot != nritems) { |
| 4454 | /* shift the items */ |
| 4455 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + 1), |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4456 | btrfs_item_nr_offset(slot), |
| 4457 | (nritems - slot) * sizeof(struct btrfs_item)); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4458 | } |
| 4459 | |
| 4460 | btrfs_cpu_key_to_disk(&disk_key, new_key); |
| 4461 | btrfs_set_item_key(leaf, &disk_key, slot); |
| 4462 | |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4463 | new_item = btrfs_item_nr(slot); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4464 | |
| 4465 | btrfs_set_item_offset(leaf, new_item, orig_offset); |
| 4466 | btrfs_set_item_size(leaf, new_item, item_size - split_offset); |
| 4467 | |
| 4468 | btrfs_set_item_offset(leaf, item, |
| 4469 | orig_offset + item_size - split_offset); |
| 4470 | btrfs_set_item_size(leaf, item, split_offset); |
| 4471 | |
| 4472 | btrfs_set_header_nritems(leaf, nritems + 1); |
| 4473 | |
| 4474 | /* write the data for the start of the original item */ |
| 4475 | write_extent_buffer(leaf, buf, |
| 4476 | btrfs_item_ptr_offset(leaf, path->slots[0]), |
| 4477 | split_offset); |
| 4478 | |
| 4479 | /* write the data for the new item */ |
| 4480 | write_extent_buffer(leaf, buf + split_offset, |
| 4481 | btrfs_item_ptr_offset(leaf, slot), |
| 4482 | item_size - split_offset); |
| 4483 | btrfs_mark_buffer_dirty(leaf); |
| 4484 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4485 | BUG_ON(btrfs_leaf_free_space(root, leaf) < 0); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4486 | kfree(buf); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4487 | return 0; |
| 4488 | } |
| 4489 | |
| 4490 | /* |
| 4491 | * This function splits a single item into two items, |
| 4492 | * giving 'new_key' to the new item and splitting the |
| 4493 | * old one at split_offset (from the start of the item). |
| 4494 | * |
| 4495 | * The path may be released by this operation. After |
| 4496 | * the split, the path is pointing to the old item. The |
| 4497 | * new item is going to be in the same node as the old one. |
| 4498 | * |
| 4499 | * Note, the item being split must be smaller enough to live alone on |
| 4500 | * a tree block with room for one extra struct btrfs_item |
| 4501 | * |
| 4502 | * This allows us to split the item in place, keeping a lock on the |
| 4503 | * leaf the entire time. |
| 4504 | */ |
| 4505 | int btrfs_split_item(struct btrfs_trans_handle *trans, |
| 4506 | struct btrfs_root *root, |
| 4507 | struct btrfs_path *path, |
| 4508 | struct btrfs_key *new_key, |
| 4509 | unsigned long split_offset) |
| 4510 | { |
| 4511 | int ret; |
| 4512 | ret = setup_leaf_for_split(trans, root, path, |
| 4513 | sizeof(struct btrfs_item)); |
| 4514 | if (ret) |
| 4515 | return ret; |
| 4516 | |
| 4517 | ret = split_item(trans, root, path, new_key, split_offset); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4518 | return ret; |
| 4519 | } |
| 4520 | |
| 4521 | /* |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4522 | * This function duplicate a item, giving 'new_key' to the new item. |
| 4523 | * It guarantees both items live in the same tree leaf and the new item |
| 4524 | * is contiguous with the original item. |
| 4525 | * |
| 4526 | * This allows us to split file extent in place, keeping a lock on the |
| 4527 | * leaf the entire time. |
| 4528 | */ |
| 4529 | int btrfs_duplicate_item(struct btrfs_trans_handle *trans, |
| 4530 | struct btrfs_root *root, |
| 4531 | struct btrfs_path *path, |
| 4532 | struct btrfs_key *new_key) |
| 4533 | { |
| 4534 | struct extent_buffer *leaf; |
| 4535 | int ret; |
| 4536 | u32 item_size; |
| 4537 | |
| 4538 | leaf = path->nodes[0]; |
| 4539 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); |
| 4540 | ret = setup_leaf_for_split(trans, root, path, |
| 4541 | item_size + sizeof(struct btrfs_item)); |
| 4542 | if (ret) |
| 4543 | return ret; |
| 4544 | |
| 4545 | path->slots[0]++; |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 4546 | setup_items_for_insert(root, path, new_key, &item_size, |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4547 | item_size, item_size + |
| 4548 | sizeof(struct btrfs_item), 1); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4549 | leaf = path->nodes[0]; |
| 4550 | memcpy_extent_buffer(leaf, |
| 4551 | btrfs_item_ptr_offset(leaf, path->slots[0]), |
| 4552 | btrfs_item_ptr_offset(leaf, path->slots[0] - 1), |
| 4553 | item_size); |
| 4554 | return 0; |
| 4555 | } |
| 4556 | |
| 4557 | /* |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 4558 | * make the item pointed to by the path smaller. new_size indicates |
| 4559 | * how small to make it, and from_end tells us if we just chop bytes |
| 4560 | * off the end of the item or if we shift the item to chop bytes off |
| 4561 | * the front. |
| 4562 | */ |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 4563 | void btrfs_truncate_item(struct btrfs_root *root, struct btrfs_path *path, |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4564 | u32 new_size, int from_end) |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4565 | { |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4566 | int slot; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4567 | struct extent_buffer *leaf; |
| 4568 | struct btrfs_item *item; |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4569 | u32 nritems; |
| 4570 | unsigned int data_end; |
| 4571 | unsigned int old_data_start; |
| 4572 | unsigned int old_size; |
| 4573 | unsigned int size_diff; |
| 4574 | int i; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4575 | struct btrfs_map_token token; |
| 4576 | |
| 4577 | btrfs_init_map_token(&token); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4578 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4579 | leaf = path->nodes[0]; |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 4580 | slot = path->slots[0]; |
| 4581 | |
| 4582 | old_size = btrfs_item_size_nr(leaf, slot); |
| 4583 | if (old_size == new_size) |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4584 | return; |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4585 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4586 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4587 | data_end = leaf_data_end(root, leaf); |
| 4588 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4589 | old_data_start = btrfs_item_offset_nr(leaf, slot); |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 4590 | |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4591 | size_diff = old_size - new_size; |
| 4592 | |
| 4593 | BUG_ON(slot < 0); |
| 4594 | BUG_ON(slot >= nritems); |
| 4595 | |
| 4596 | /* |
| 4597 | * item0..itemN ... dataN.offset..dataN.size .. data0.size |
| 4598 | */ |
| 4599 | /* first correct the data pointers */ |
| 4600 | for (i = slot; i < nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4601 | u32 ioff; |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4602 | item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4603 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4604 | ioff = btrfs_token_item_offset(leaf, item, &token); |
| 4605 | btrfs_set_token_item_offset(leaf, item, |
| 4606 | ioff + size_diff, &token); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4607 | } |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4608 | |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4609 | /* shift the data */ |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 4610 | if (from_end) { |
| 4611 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
| 4612 | data_end + size_diff, btrfs_leaf_data(leaf) + |
| 4613 | data_end, old_data_start + new_size - data_end); |
| 4614 | } else { |
| 4615 | struct btrfs_disk_key disk_key; |
| 4616 | u64 offset; |
| 4617 | |
| 4618 | btrfs_item_key(leaf, &disk_key, slot); |
| 4619 | |
| 4620 | if (btrfs_disk_key_type(&disk_key) == BTRFS_EXTENT_DATA_KEY) { |
| 4621 | unsigned long ptr; |
| 4622 | struct btrfs_file_extent_item *fi; |
| 4623 | |
| 4624 | fi = btrfs_item_ptr(leaf, slot, |
| 4625 | struct btrfs_file_extent_item); |
| 4626 | fi = (struct btrfs_file_extent_item *)( |
| 4627 | (unsigned long)fi - size_diff); |
| 4628 | |
| 4629 | if (btrfs_file_extent_type(leaf, fi) == |
| 4630 | BTRFS_FILE_EXTENT_INLINE) { |
| 4631 | ptr = btrfs_item_ptr_offset(leaf, slot); |
| 4632 | memmove_extent_buffer(leaf, ptr, |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 4633 | (unsigned long)fi, |
David Sterba | 7ec20af | 2014-07-24 17:34:58 +0200 | [diff] [blame] | 4634 | BTRFS_FILE_EXTENT_INLINE_DATA_START); |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 4635 | } |
| 4636 | } |
| 4637 | |
| 4638 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
| 4639 | data_end + size_diff, btrfs_leaf_data(leaf) + |
| 4640 | data_end, old_data_start - data_end); |
| 4641 | |
| 4642 | offset = btrfs_disk_key_offset(&disk_key); |
| 4643 | btrfs_set_disk_key_offset(&disk_key, offset + size_diff); |
| 4644 | btrfs_set_item_key(leaf, &disk_key, slot); |
| 4645 | if (slot == 0) |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 4646 | fixup_low_keys(root->fs_info, path, &disk_key, 1); |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 4647 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4648 | |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4649 | item = btrfs_item_nr(slot); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4650 | btrfs_set_item_size(leaf, item, new_size); |
| 4651 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4652 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4653 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
| 4654 | btrfs_print_leaf(root, leaf); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4655 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4656 | } |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4657 | } |
| 4658 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 4659 | /* |
Stefan Behrens | 8f69dbd | 2013-05-07 10:23:30 +0000 | [diff] [blame] | 4660 | * make the item pointed to by the path bigger, data_size is the added size. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 4661 | */ |
Tsutomu Itoh | 4b90c68 | 2013-04-16 05:18:49 +0000 | [diff] [blame] | 4662 | void btrfs_extend_item(struct btrfs_root *root, struct btrfs_path *path, |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4663 | u32 data_size) |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4664 | { |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4665 | int slot; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4666 | struct extent_buffer *leaf; |
| 4667 | struct btrfs_item *item; |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4668 | u32 nritems; |
| 4669 | unsigned int data_end; |
| 4670 | unsigned int old_data; |
| 4671 | unsigned int old_size; |
| 4672 | int i; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4673 | struct btrfs_map_token token; |
| 4674 | |
| 4675 | btrfs_init_map_token(&token); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4676 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4677 | leaf = path->nodes[0]; |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4678 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4679 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4680 | data_end = leaf_data_end(root, leaf); |
| 4681 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4682 | if (btrfs_leaf_free_space(root, leaf) < data_size) { |
| 4683 | btrfs_print_leaf(root, leaf); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4684 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4685 | } |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4686 | slot = path->slots[0]; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4687 | old_data = btrfs_item_end_nr(leaf, slot); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4688 | |
| 4689 | BUG_ON(slot < 0); |
Chris Mason | 3326d1b | 2007-10-15 16:18:25 -0400 | [diff] [blame] | 4690 | if (slot >= nritems) { |
| 4691 | btrfs_print_leaf(root, leaf); |
Frank Holton | efe120a | 2013-12-20 11:37:06 -0500 | [diff] [blame] | 4692 | btrfs_crit(root->fs_info, "slot %d too large, nritems %d", |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 4693 | slot, nritems); |
Chris Mason | 3326d1b | 2007-10-15 16:18:25 -0400 | [diff] [blame] | 4694 | BUG_ON(1); |
| 4695 | } |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4696 | |
| 4697 | /* |
| 4698 | * item0..itemN ... dataN.offset..dataN.size .. data0.size |
| 4699 | */ |
| 4700 | /* first correct the data pointers */ |
| 4701 | for (i = slot; i < nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4702 | u32 ioff; |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4703 | item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4704 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4705 | ioff = btrfs_token_item_offset(leaf, item, &token); |
| 4706 | btrfs_set_token_item_offset(leaf, item, |
| 4707 | ioff - data_size, &token); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4708 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4709 | |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4710 | /* shift the data */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4711 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4712 | data_end - data_size, btrfs_leaf_data(leaf) + |
| 4713 | data_end, old_data - data_end); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4714 | |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4715 | data_end = old_data; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4716 | old_size = btrfs_item_size_nr(leaf, slot); |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4717 | item = btrfs_item_nr(slot); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4718 | btrfs_set_item_size(leaf, item, old_size + data_size); |
| 4719 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4720 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4721 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
| 4722 | btrfs_print_leaf(root, leaf); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4723 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4724 | } |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4725 | } |
| 4726 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4727 | /* |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4728 | * this is a helper for btrfs_insert_empty_items, the main goal here is |
| 4729 | * to save stack depth by doing the bulk of the work in a function |
| 4730 | * that doesn't call btrfs_search_slot |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4731 | */ |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 4732 | void setup_items_for_insert(struct btrfs_root *root, struct btrfs_path *path, |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4733 | struct btrfs_key *cpu_key, u32 *data_size, |
| 4734 | u32 total_data, u32 total_size, int nr) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4735 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4736 | struct btrfs_item *item; |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4737 | int i; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 4738 | u32 nritems; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4739 | unsigned int data_end; |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 4740 | struct btrfs_disk_key disk_key; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4741 | struct extent_buffer *leaf; |
| 4742 | int slot; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4743 | struct btrfs_map_token token; |
| 4744 | |
Filipe Manana | 24cdc84 | 2014-07-28 19:34:35 +0100 | [diff] [blame] | 4745 | if (path->slots[0] == 0) { |
| 4746 | btrfs_cpu_key_to_disk(&disk_key, cpu_key); |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 4747 | fixup_low_keys(root->fs_info, path, &disk_key, 1); |
Filipe Manana | 24cdc84 | 2014-07-28 19:34:35 +0100 | [diff] [blame] | 4748 | } |
| 4749 | btrfs_unlock_up_safe(path, 1); |
| 4750 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4751 | btrfs_init_map_token(&token); |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 4752 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4753 | leaf = path->nodes[0]; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4754 | slot = path->slots[0]; |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4755 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4756 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 4757 | data_end = leaf_data_end(root, leaf); |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 4758 | |
Chris Mason | f25956c | 2008-09-12 15:32:53 -0400 | [diff] [blame] | 4759 | if (btrfs_leaf_free_space(root, leaf) < total_size) { |
Chris Mason | 3326d1b | 2007-10-15 16:18:25 -0400 | [diff] [blame] | 4760 | btrfs_print_leaf(root, leaf); |
Jeff Mahoney | 5d163e0 | 2016-09-20 10:05:00 -0400 | [diff] [blame] | 4761 | btrfs_crit(root->fs_info, |
| 4762 | "not enough freespace need %u have %d", |
| 4763 | total_size, btrfs_leaf_free_space(root, leaf)); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4764 | BUG(); |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 4765 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4766 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4767 | if (slot != nritems) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4768 | unsigned int old_data = btrfs_item_end_nr(leaf, slot); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4769 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4770 | if (old_data < data_end) { |
| 4771 | btrfs_print_leaf(root, leaf); |
Jeff Mahoney | 5d163e0 | 2016-09-20 10:05:00 -0400 | [diff] [blame] | 4772 | btrfs_crit(root->fs_info, |
| 4773 | "slot %d old_data %d data_end %d", |
| 4774 | slot, old_data, data_end); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4775 | BUG_ON(1); |
| 4776 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4777 | /* |
| 4778 | * item0..itemN ... dataN.offset..dataN.size .. data0.size |
| 4779 | */ |
| 4780 | /* first correct the data pointers */ |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 4781 | for (i = slot; i < nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4782 | u32 ioff; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4783 | |
Jeff Mahoney | 62e8557 | 2016-09-20 10:05:01 -0400 | [diff] [blame] | 4784 | item = btrfs_item_nr(i); |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4785 | ioff = btrfs_token_item_offset(leaf, item, &token); |
| 4786 | btrfs_set_token_item_offset(leaf, item, |
| 4787 | ioff - total_data, &token); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 4788 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4789 | /* shift the items */ |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4790 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + nr), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4791 | btrfs_item_nr_offset(slot), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 4792 | (nritems - slot) * sizeof(struct btrfs_item)); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4793 | |
| 4794 | /* shift the data */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4795 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4796 | data_end - total_data, btrfs_leaf_data(leaf) + |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 4797 | data_end, old_data - data_end); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4798 | data_end = old_data; |
| 4799 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4800 | |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 4801 | /* setup the item for the new data */ |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4802 | for (i = 0; i < nr; i++) { |
| 4803 | btrfs_cpu_key_to_disk(&disk_key, cpu_key + i); |
| 4804 | btrfs_set_item_key(leaf, &disk_key, slot + i); |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4805 | item = btrfs_item_nr(slot + i); |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4806 | btrfs_set_token_item_offset(leaf, item, |
| 4807 | data_end - data_size[i], &token); |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4808 | data_end -= data_size[i]; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4809 | btrfs_set_token_item_size(leaf, item, data_size[i], &token); |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4810 | } |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4811 | |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4812 | btrfs_set_header_nritems(leaf, nritems + nr); |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 4813 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 4814 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4815 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
| 4816 | btrfs_print_leaf(root, leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4817 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4818 | } |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4819 | } |
| 4820 | |
| 4821 | /* |
| 4822 | * Given a key and some data, insert items into the tree. |
| 4823 | * This does all the path init required, making room in the tree if needed. |
| 4824 | */ |
| 4825 | int btrfs_insert_empty_items(struct btrfs_trans_handle *trans, |
| 4826 | struct btrfs_root *root, |
| 4827 | struct btrfs_path *path, |
| 4828 | struct btrfs_key *cpu_key, u32 *data_size, |
| 4829 | int nr) |
| 4830 | { |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4831 | int ret = 0; |
| 4832 | int slot; |
| 4833 | int i; |
| 4834 | u32 total_size = 0; |
| 4835 | u32 total_data = 0; |
| 4836 | |
| 4837 | for (i = 0; i < nr; i++) |
| 4838 | total_data += data_size[i]; |
| 4839 | |
| 4840 | total_size = total_data + (nr * sizeof(struct btrfs_item)); |
| 4841 | ret = btrfs_search_slot(trans, root, cpu_key, path, total_size, 1); |
| 4842 | if (ret == 0) |
| 4843 | return -EEXIST; |
| 4844 | if (ret < 0) |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4845 | return ret; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4846 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4847 | slot = path->slots[0]; |
| 4848 | BUG_ON(slot < 0); |
| 4849 | |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 4850 | setup_items_for_insert(root, path, cpu_key, data_size, |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4851 | total_data, total_size, nr); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4852 | return 0; |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 4853 | } |
| 4854 | |
| 4855 | /* |
| 4856 | * Given a key and some data, insert an item into the tree. |
| 4857 | * This does all the path init required, making room in the tree if needed. |
| 4858 | */ |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 4859 | int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root |
| 4860 | *root, struct btrfs_key *cpu_key, void *data, u32 |
| 4861 | data_size) |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 4862 | { |
| 4863 | int ret = 0; |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 4864 | struct btrfs_path *path; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4865 | struct extent_buffer *leaf; |
| 4866 | unsigned long ptr; |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 4867 | |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 4868 | path = btrfs_alloc_path(); |
Tsutomu Itoh | db5b493 | 2011-03-23 08:14:16 +0000 | [diff] [blame] | 4869 | if (!path) |
| 4870 | return -ENOMEM; |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 4871 | ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size); |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 4872 | if (!ret) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4873 | leaf = path->nodes[0]; |
| 4874 | ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); |
| 4875 | write_extent_buffer(leaf, data, ptr, data_size); |
| 4876 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 4877 | } |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 4878 | btrfs_free_path(path); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 4879 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4880 | } |
| 4881 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4882 | /* |
Chris Mason | 5de08d7 | 2007-02-24 06:24:44 -0500 | [diff] [blame] | 4883 | * delete the pointer from a given node. |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4884 | * |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 4885 | * the tree should have been previously balanced so the deletion does not |
| 4886 | * empty a node. |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4887 | */ |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 4888 | static void del_ptr(struct btrfs_root *root, struct btrfs_path *path, |
| 4889 | int level, int slot) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4890 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4891 | struct extent_buffer *parent = path->nodes[level]; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 4892 | u32 nritems; |
Jan Schmidt | f3ea38d | 2012-05-26 11:45:21 +0200 | [diff] [blame] | 4893 | int ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4894 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4895 | nritems = btrfs_header_nritems(parent); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 4896 | if (slot != nritems - 1) { |
Liu Bo | 0e411ec | 2012-10-19 09:50:54 +0000 | [diff] [blame] | 4897 | if (level) |
Jan Schmidt | f3ea38d | 2012-05-26 11:45:21 +0200 | [diff] [blame] | 4898 | tree_mod_log_eb_move(root->fs_info, parent, slot, |
| 4899 | slot + 1, nritems - slot - 1); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4900 | memmove_extent_buffer(parent, |
| 4901 | btrfs_node_key_ptr_offset(slot), |
| 4902 | btrfs_node_key_ptr_offset(slot + 1), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 4903 | sizeof(struct btrfs_key_ptr) * |
| 4904 | (nritems - slot - 1)); |
Chris Mason | 57ba86c | 2012-12-18 19:35:32 -0500 | [diff] [blame] | 4905 | } else if (level) { |
| 4906 | ret = tree_mod_log_insert_key(root->fs_info, parent, slot, |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 4907 | MOD_LOG_KEY_REMOVE, GFP_NOFS); |
Chris Mason | 57ba86c | 2012-12-18 19:35:32 -0500 | [diff] [blame] | 4908 | BUG_ON(ret < 0); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 4909 | } |
Jan Schmidt | f3ea38d | 2012-05-26 11:45:21 +0200 | [diff] [blame] | 4910 | |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 4911 | nritems--; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4912 | btrfs_set_header_nritems(parent, nritems); |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 4913 | if (nritems == 0 && parent == root->node) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4914 | BUG_ON(btrfs_header_level(root->node) != 1); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 4915 | /* just turn the root into a leaf and break */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4916 | btrfs_set_header_level(root->node, 0); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 4917 | } else if (slot == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4918 | struct btrfs_disk_key disk_key; |
| 4919 | |
| 4920 | btrfs_node_key(parent, &disk_key, 0); |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 4921 | fixup_low_keys(root->fs_info, path, &disk_key, level + 1); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4922 | } |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 4923 | btrfs_mark_buffer_dirty(parent); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4924 | } |
| 4925 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4926 | /* |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 4927 | * a helper function to delete the leaf pointed to by path->slots[1] and |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4928 | * path->nodes[1]. |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 4929 | * |
| 4930 | * This deletes the pointer in path->nodes[1] and frees the leaf |
| 4931 | * block extent. zero is returned if it all worked out, < 0 otherwise. |
| 4932 | * |
| 4933 | * The path must have already been setup for deleting the leaf, including |
| 4934 | * all the proper balancing. path->nodes[1] must be locked. |
| 4935 | */ |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4936 | static noinline void btrfs_del_leaf(struct btrfs_trans_handle *trans, |
| 4937 | struct btrfs_root *root, |
| 4938 | struct btrfs_path *path, |
| 4939 | struct extent_buffer *leaf) |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 4940 | { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4941 | WARN_ON(btrfs_header_generation(leaf) != trans->transid); |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 4942 | del_ptr(root, path, 1, path->slots[1]); |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 4943 | |
Chris Mason | 4d081c4 | 2009-02-04 09:31:28 -0500 | [diff] [blame] | 4944 | /* |
| 4945 | * btrfs_free_extent is expensive, we want to make sure we |
| 4946 | * aren't holding any locks when we call it |
| 4947 | */ |
| 4948 | btrfs_unlock_up_safe(path, 0); |
| 4949 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 4950 | root_sub_used(root, leaf->len); |
| 4951 | |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 4952 | extent_buffer_get(leaf); |
Jan Schmidt | 5581a51 | 2012-05-16 17:04:52 +0200 | [diff] [blame] | 4953 | btrfs_free_tree_block(trans, root, leaf, 0, 1); |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 4954 | free_extent_buffer_stale(leaf); |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 4955 | } |
| 4956 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4957 | * delete the item at the leaf level in path. If that empties |
| 4958 | * the leaf, remove it from the tree |
| 4959 | */ |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4960 | int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 4961 | struct btrfs_path *path, int slot, int nr) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4962 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4963 | struct extent_buffer *leaf; |
| 4964 | struct btrfs_item *item; |
Alexandru Moise | ce0eac2 | 2015-08-23 16:01:42 +0000 | [diff] [blame] | 4965 | u32 last_off; |
| 4966 | u32 dsize = 0; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 4967 | int ret = 0; |
| 4968 | int wret; |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4969 | int i; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 4970 | u32 nritems; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4971 | struct btrfs_map_token token; |
| 4972 | |
| 4973 | btrfs_init_map_token(&token); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4974 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4975 | leaf = path->nodes[0]; |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4976 | last_off = btrfs_item_offset_nr(leaf, slot + nr - 1); |
| 4977 | |
| 4978 | for (i = 0; i < nr; i++) |
| 4979 | dsize += btrfs_item_size_nr(leaf, slot + i); |
| 4980 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4981 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4982 | |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4983 | if (slot + nr != nritems) { |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 4984 | int data_end = leaf_data_end(root, leaf); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4985 | |
| 4986 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 4987 | data_end + dsize, |
| 4988 | btrfs_leaf_data(leaf) + data_end, |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4989 | last_off - data_end); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4990 | |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4991 | for (i = slot + nr; i < nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4992 | u32 ioff; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4993 | |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4994 | item = btrfs_item_nr(i); |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4995 | ioff = btrfs_token_item_offset(leaf, item, &token); |
| 4996 | btrfs_set_token_item_offset(leaf, item, |
| 4997 | ioff + dsize, &token); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 4998 | } |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4999 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5000 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot), |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 5001 | btrfs_item_nr_offset(slot + nr), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 5002 | sizeof(struct btrfs_item) * |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 5003 | (nritems - slot - nr)); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 5004 | } |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 5005 | btrfs_set_header_nritems(leaf, nritems - nr); |
| 5006 | nritems -= nr; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5007 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 5008 | /* delete the leaf if we've emptied it */ |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 5009 | if (nritems == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5010 | if (leaf == root->node) { |
| 5011 | btrfs_set_header_level(leaf, 0); |
Chris Mason | 9a8dd15 | 2007-02-23 08:38:36 -0500 | [diff] [blame] | 5012 | } else { |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 5013 | btrfs_set_path_blocking(path); |
Daniel Dressler | 01d5847 | 2014-11-21 17:15:07 +0900 | [diff] [blame] | 5014 | clean_tree_block(trans, root->fs_info, leaf); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 5015 | btrfs_del_leaf(trans, root, path, leaf); |
Chris Mason | 9a8dd15 | 2007-02-23 08:38:36 -0500 | [diff] [blame] | 5016 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 5017 | } else { |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 5018 | int used = leaf_space_used(leaf, 0, nritems); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 5019 | if (slot == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5020 | struct btrfs_disk_key disk_key; |
| 5021 | |
| 5022 | btrfs_item_key(leaf, &disk_key, 0); |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 5023 | fixup_low_keys(root->fs_info, path, &disk_key, 1); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 5024 | } |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 5025 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 5026 | /* delete the leaf if it is mostly empty */ |
Yan Zheng | d717aa1 | 2009-07-24 12:42:46 -0400 | [diff] [blame] | 5027 | if (used < BTRFS_LEAF_DATA_SIZE(root) / 3) { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 5028 | /* push_leaf_left fixes the path. |
| 5029 | * make sure the path still points to our leaf |
| 5030 | * for possible call to del_ptr below |
| 5031 | */ |
Chris Mason | 4920c9a | 2007-01-26 16:38:42 -0500 | [diff] [blame] | 5032 | slot = path->slots[1]; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5033 | extent_buffer_get(leaf); |
| 5034 | |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 5035 | btrfs_set_path_blocking(path); |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 5036 | wret = push_leaf_left(trans, root, path, 1, 1, |
| 5037 | 1, (u32)-1); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 5038 | if (wret < 0 && wret != -ENOSPC) |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 5039 | ret = wret; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5040 | |
| 5041 | if (path->nodes[0] == leaf && |
| 5042 | btrfs_header_nritems(leaf)) { |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 5043 | wret = push_leaf_right(trans, root, path, 1, |
| 5044 | 1, 1, 0); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 5045 | if (wret < 0 && wret != -ENOSPC) |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 5046 | ret = wret; |
| 5047 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5048 | |
| 5049 | if (btrfs_header_nritems(leaf) == 0) { |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 5050 | path->slots[1] = slot; |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 5051 | btrfs_del_leaf(trans, root, path, leaf); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5052 | free_extent_buffer(leaf); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 5053 | ret = 0; |
Chris Mason | 5de08d7 | 2007-02-24 06:24:44 -0500 | [diff] [blame] | 5054 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5055 | /* if we're still in the path, make sure |
| 5056 | * we're dirty. Otherwise, one of the |
| 5057 | * push_leaf functions must have already |
| 5058 | * dirtied this buffer |
| 5059 | */ |
| 5060 | if (path->nodes[0] == leaf) |
| 5061 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5062 | free_extent_buffer(leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 5063 | } |
Chris Mason | d571976 | 2007-03-23 10:01:08 -0400 | [diff] [blame] | 5064 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5065 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 5066 | } |
| 5067 | } |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 5068 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 5069 | } |
| 5070 | |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 5071 | /* |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5072 | * search the tree again to find a leaf with lesser keys |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5073 | * returns 0 if it found something or 1 if there are no lesser leaves. |
| 5074 | * returns < 0 on io errors. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 5075 | * |
| 5076 | * This may release the path, and so you may lose any locks held at the |
| 5077 | * time you call it. |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5078 | */ |
Josef Bacik | 16e7549 | 2013-10-22 12:18:51 -0400 | [diff] [blame] | 5079 | int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path) |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5080 | { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5081 | struct btrfs_key key; |
| 5082 | struct btrfs_disk_key found_key; |
| 5083 | int ret; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5084 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5085 | btrfs_item_key_to_cpu(path->nodes[0], &key, 0); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5086 | |
Filipe David Borba Manana | e8b0d72 | 2013-10-15 00:12:27 +0100 | [diff] [blame] | 5087 | if (key.offset > 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5088 | key.offset--; |
Filipe David Borba Manana | e8b0d72 | 2013-10-15 00:12:27 +0100 | [diff] [blame] | 5089 | } else if (key.type > 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5090 | key.type--; |
Filipe David Borba Manana | e8b0d72 | 2013-10-15 00:12:27 +0100 | [diff] [blame] | 5091 | key.offset = (u64)-1; |
| 5092 | } else if (key.objectid > 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5093 | key.objectid--; |
Filipe David Borba Manana | e8b0d72 | 2013-10-15 00:12:27 +0100 | [diff] [blame] | 5094 | key.type = (u8)-1; |
| 5095 | key.offset = (u64)-1; |
| 5096 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5097 | return 1; |
Filipe David Borba Manana | e8b0d72 | 2013-10-15 00:12:27 +0100 | [diff] [blame] | 5098 | } |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5099 | |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 5100 | btrfs_release_path(path); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5101 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
| 5102 | if (ret < 0) |
| 5103 | return ret; |
| 5104 | btrfs_item_key(path->nodes[0], &found_key, 0); |
| 5105 | ret = comp_keys(&found_key, &key); |
Filipe Manana | 337c6f6 | 2014-06-09 13:22:13 +0100 | [diff] [blame] | 5106 | /* |
| 5107 | * We might have had an item with the previous key in the tree right |
| 5108 | * before we released our path. And after we released our path, that |
| 5109 | * item might have been pushed to the first slot (0) of the leaf we |
| 5110 | * were holding due to a tree balance. Alternatively, an item with the |
| 5111 | * previous key can exist as the only element of a leaf (big fat item). |
| 5112 | * Therefore account for these 2 cases, so that our callers (like |
| 5113 | * btrfs_previous_item) don't miss an existing item with a key matching |
| 5114 | * the previous key we computed above. |
| 5115 | */ |
| 5116 | if (ret <= 0) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5117 | return 0; |
| 5118 | return 1; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5119 | } |
| 5120 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5121 | /* |
| 5122 | * A helper function to walk down the tree starting at min_key, and looking |
Eric Sandeen | de78b51 | 2013-01-31 18:21:12 +0000 | [diff] [blame] | 5123 | * for nodes or leaves that are have a minimum transaction id. |
| 5124 | * This is used by the btree defrag code, and tree logging |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5125 | * |
| 5126 | * This does not cow, but it does stuff the starting key it finds back |
| 5127 | * into min_key, so you can call btrfs_search_slot with cow=1 on the |
| 5128 | * key and get a writable path. |
| 5129 | * |
| 5130 | * This does lock as it descends, and path->keep_locks should be set |
| 5131 | * to 1 by the caller. |
| 5132 | * |
| 5133 | * This honors path->lowest_level to prevent descent past a given level |
| 5134 | * of the tree. |
| 5135 | * |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 5136 | * min_trans indicates the oldest transaction that you are interested |
| 5137 | * in walking through. Any nodes or leaves older than min_trans are |
| 5138 | * skipped over (without reading them). |
| 5139 | * |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5140 | * returns zero if something useful was found, < 0 on error and 1 if there |
| 5141 | * was nothing in the tree that matched the search criteria. |
| 5142 | */ |
| 5143 | int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key, |
Eric Sandeen | de78b51 | 2013-01-31 18:21:12 +0000 | [diff] [blame] | 5144 | struct btrfs_path *path, |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5145 | u64 min_trans) |
| 5146 | { |
| 5147 | struct extent_buffer *cur; |
| 5148 | struct btrfs_key found_key; |
| 5149 | int slot; |
Yan | 9652480 | 2008-07-24 12:19:49 -0400 | [diff] [blame] | 5150 | int sret; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5151 | u32 nritems; |
| 5152 | int level; |
| 5153 | int ret = 1; |
Filipe Manana | f98de9b | 2014-08-04 19:37:21 +0100 | [diff] [blame] | 5154 | int keep_locks = path->keep_locks; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5155 | |
Filipe Manana | f98de9b | 2014-08-04 19:37:21 +0100 | [diff] [blame] | 5156 | path->keep_locks = 1; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5157 | again: |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5158 | cur = btrfs_read_lock_root_node(root); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5159 | level = btrfs_header_level(cur); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5160 | WARN_ON(path->nodes[level]); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5161 | path->nodes[level] = cur; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5162 | path->locks[level] = BTRFS_READ_LOCK; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5163 | |
| 5164 | if (btrfs_header_generation(cur) < min_trans) { |
| 5165 | ret = 1; |
| 5166 | goto out; |
| 5167 | } |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5168 | while (1) { |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5169 | nritems = btrfs_header_nritems(cur); |
| 5170 | level = btrfs_header_level(cur); |
Yan | 9652480 | 2008-07-24 12:19:49 -0400 | [diff] [blame] | 5171 | sret = bin_search(cur, min_key, level, &slot); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5172 | |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 5173 | /* at the lowest level, we're done, setup the path and exit */ |
| 5174 | if (level == path->lowest_level) { |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5175 | if (slot >= nritems) |
| 5176 | goto find_next_key; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5177 | ret = 0; |
| 5178 | path->slots[level] = slot; |
| 5179 | btrfs_item_key_to_cpu(cur, &found_key, slot); |
| 5180 | goto out; |
| 5181 | } |
Yan | 9652480 | 2008-07-24 12:19:49 -0400 | [diff] [blame] | 5182 | if (sret && slot > 0) |
| 5183 | slot--; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5184 | /* |
Eric Sandeen | de78b51 | 2013-01-31 18:21:12 +0000 | [diff] [blame] | 5185 | * check this node pointer against the min_trans parameters. |
| 5186 | * If it is too old, old, skip to the next one. |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5187 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5188 | while (slot < nritems) { |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5189 | u64 gen; |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5190 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5191 | gen = btrfs_node_ptr_generation(cur, slot); |
| 5192 | if (gen < min_trans) { |
| 5193 | slot++; |
| 5194 | continue; |
| 5195 | } |
Eric Sandeen | de78b51 | 2013-01-31 18:21:12 +0000 | [diff] [blame] | 5196 | break; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5197 | } |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5198 | find_next_key: |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5199 | /* |
| 5200 | * we didn't find a candidate key in this node, walk forward |
| 5201 | * and find another one |
| 5202 | */ |
| 5203 | if (slot >= nritems) { |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5204 | path->slots[level] = slot; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 5205 | btrfs_set_path_blocking(path); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5206 | sret = btrfs_find_next_key(root, path, min_key, level, |
Eric Sandeen | de78b51 | 2013-01-31 18:21:12 +0000 | [diff] [blame] | 5207 | min_trans); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5208 | if (sret == 0) { |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 5209 | btrfs_release_path(path); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5210 | goto again; |
| 5211 | } else { |
| 5212 | goto out; |
| 5213 | } |
| 5214 | } |
| 5215 | /* save our key for returning back */ |
| 5216 | btrfs_node_key_to_cpu(cur, &found_key, slot); |
| 5217 | path->slots[level] = slot; |
| 5218 | if (level == path->lowest_level) { |
| 5219 | ret = 0; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5220 | goto out; |
| 5221 | } |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 5222 | btrfs_set_path_blocking(path); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5223 | cur = read_node_slot(root, cur, slot); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5224 | if (IS_ERR(cur)) { |
| 5225 | ret = PTR_ERR(cur); |
| 5226 | goto out; |
| 5227 | } |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5228 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5229 | btrfs_tree_read_lock(cur); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 5230 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5231 | path->locks[level - 1] = BTRFS_READ_LOCK; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5232 | path->nodes[level - 1] = cur; |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 5233 | unlock_up(path, level, 1, 0, NULL); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5234 | btrfs_clear_path_blocking(path, NULL, 0); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5235 | } |
| 5236 | out: |
Filipe Manana | f98de9b | 2014-08-04 19:37:21 +0100 | [diff] [blame] | 5237 | path->keep_locks = keep_locks; |
| 5238 | if (ret == 0) { |
| 5239 | btrfs_unlock_up_safe(path, path->lowest_level + 1); |
| 5240 | btrfs_set_path_blocking(path); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5241 | memcpy(min_key, &found_key, sizeof(found_key)); |
Filipe Manana | f98de9b | 2014-08-04 19:37:21 +0100 | [diff] [blame] | 5242 | } |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5243 | return ret; |
| 5244 | } |
| 5245 | |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5246 | static int tree_move_down(struct btrfs_root *root, |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5247 | struct btrfs_path *path, |
| 5248 | int *level, int root_level) |
| 5249 | { |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5250 | struct extent_buffer *eb; |
| 5251 | |
Chris Mason | 74dd17f | 2012-08-07 16:25:13 -0400 | [diff] [blame] | 5252 | BUG_ON(*level == 0); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5253 | eb = read_node_slot(root, path->nodes[*level], path->slots[*level]); |
| 5254 | if (IS_ERR(eb)) |
| 5255 | return PTR_ERR(eb); |
| 5256 | |
| 5257 | path->nodes[*level - 1] = eb; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5258 | path->slots[*level - 1] = 0; |
| 5259 | (*level)--; |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5260 | return 0; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5261 | } |
| 5262 | |
| 5263 | static int tree_move_next_or_upnext(struct btrfs_root *root, |
| 5264 | struct btrfs_path *path, |
| 5265 | int *level, int root_level) |
| 5266 | { |
| 5267 | int ret = 0; |
| 5268 | int nritems; |
| 5269 | nritems = btrfs_header_nritems(path->nodes[*level]); |
| 5270 | |
| 5271 | path->slots[*level]++; |
| 5272 | |
Chris Mason | 74dd17f | 2012-08-07 16:25:13 -0400 | [diff] [blame] | 5273 | while (path->slots[*level] >= nritems) { |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5274 | if (*level == root_level) |
| 5275 | return -1; |
| 5276 | |
| 5277 | /* move upnext */ |
| 5278 | path->slots[*level] = 0; |
| 5279 | free_extent_buffer(path->nodes[*level]); |
| 5280 | path->nodes[*level] = NULL; |
| 5281 | (*level)++; |
| 5282 | path->slots[*level]++; |
| 5283 | |
| 5284 | nritems = btrfs_header_nritems(path->nodes[*level]); |
| 5285 | ret = 1; |
| 5286 | } |
| 5287 | return ret; |
| 5288 | } |
| 5289 | |
| 5290 | /* |
| 5291 | * Returns 1 if it had to move up and next. 0 is returned if it moved only next |
| 5292 | * or down. |
| 5293 | */ |
| 5294 | static int tree_advance(struct btrfs_root *root, |
| 5295 | struct btrfs_path *path, |
| 5296 | int *level, int root_level, |
| 5297 | int allow_down, |
| 5298 | struct btrfs_key *key) |
| 5299 | { |
| 5300 | int ret; |
| 5301 | |
| 5302 | if (*level == 0 || !allow_down) { |
| 5303 | ret = tree_move_next_or_upnext(root, path, level, root_level); |
| 5304 | } else { |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5305 | ret = tree_move_down(root, path, level, root_level); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5306 | } |
| 5307 | if (ret >= 0) { |
| 5308 | if (*level == 0) |
| 5309 | btrfs_item_key_to_cpu(path->nodes[*level], key, |
| 5310 | path->slots[*level]); |
| 5311 | else |
| 5312 | btrfs_node_key_to_cpu(path->nodes[*level], key, |
| 5313 | path->slots[*level]); |
| 5314 | } |
| 5315 | return ret; |
| 5316 | } |
| 5317 | |
| 5318 | static int tree_compare_item(struct btrfs_root *left_root, |
| 5319 | struct btrfs_path *left_path, |
| 5320 | struct btrfs_path *right_path, |
| 5321 | char *tmp_buf) |
| 5322 | { |
| 5323 | int cmp; |
| 5324 | int len1, len2; |
| 5325 | unsigned long off1, off2; |
| 5326 | |
| 5327 | len1 = btrfs_item_size_nr(left_path->nodes[0], left_path->slots[0]); |
| 5328 | len2 = btrfs_item_size_nr(right_path->nodes[0], right_path->slots[0]); |
| 5329 | if (len1 != len2) |
| 5330 | return 1; |
| 5331 | |
| 5332 | off1 = btrfs_item_ptr_offset(left_path->nodes[0], left_path->slots[0]); |
| 5333 | off2 = btrfs_item_ptr_offset(right_path->nodes[0], |
| 5334 | right_path->slots[0]); |
| 5335 | |
| 5336 | read_extent_buffer(left_path->nodes[0], tmp_buf, off1, len1); |
| 5337 | |
| 5338 | cmp = memcmp_extent_buffer(right_path->nodes[0], tmp_buf, off2, len1); |
| 5339 | if (cmp) |
| 5340 | return 1; |
| 5341 | return 0; |
| 5342 | } |
| 5343 | |
| 5344 | #define ADVANCE 1 |
| 5345 | #define ADVANCE_ONLY_NEXT -1 |
| 5346 | |
| 5347 | /* |
| 5348 | * This function compares two trees and calls the provided callback for |
| 5349 | * every changed/new/deleted item it finds. |
| 5350 | * If shared tree blocks are encountered, whole subtrees are skipped, making |
| 5351 | * the compare pretty fast on snapshotted subvolumes. |
| 5352 | * |
| 5353 | * This currently works on commit roots only. As commit roots are read only, |
| 5354 | * we don't do any locking. The commit roots are protected with transactions. |
| 5355 | * Transactions are ended and rejoined when a commit is tried in between. |
| 5356 | * |
| 5357 | * This function checks for modifications done to the trees while comparing. |
| 5358 | * If it detects a change, it aborts immediately. |
| 5359 | */ |
| 5360 | int btrfs_compare_trees(struct btrfs_root *left_root, |
| 5361 | struct btrfs_root *right_root, |
| 5362 | btrfs_changed_cb_t changed_cb, void *ctx) |
| 5363 | { |
| 5364 | int ret; |
| 5365 | int cmp; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5366 | struct btrfs_path *left_path = NULL; |
| 5367 | struct btrfs_path *right_path = NULL; |
| 5368 | struct btrfs_key left_key; |
| 5369 | struct btrfs_key right_key; |
| 5370 | char *tmp_buf = NULL; |
| 5371 | int left_root_level; |
| 5372 | int right_root_level; |
| 5373 | int left_level; |
| 5374 | int right_level; |
| 5375 | int left_end_reached; |
| 5376 | int right_end_reached; |
| 5377 | int advance_left; |
| 5378 | int advance_right; |
| 5379 | u64 left_blockptr; |
| 5380 | u64 right_blockptr; |
Filipe Manana | 6baa429 | 2014-02-20 21:15:25 +0000 | [diff] [blame] | 5381 | u64 left_gen; |
| 5382 | u64 right_gen; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5383 | |
| 5384 | left_path = btrfs_alloc_path(); |
| 5385 | if (!left_path) { |
| 5386 | ret = -ENOMEM; |
| 5387 | goto out; |
| 5388 | } |
| 5389 | right_path = btrfs_alloc_path(); |
| 5390 | if (!right_path) { |
| 5391 | ret = -ENOMEM; |
| 5392 | goto out; |
| 5393 | } |
| 5394 | |
David Sterba | 8f282f7 | 2016-03-30 16:01:12 +0200 | [diff] [blame] | 5395 | tmp_buf = kmalloc(left_root->nodesize, GFP_KERNEL | __GFP_NOWARN); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5396 | if (!tmp_buf) { |
David Sterba | 8f282f7 | 2016-03-30 16:01:12 +0200 | [diff] [blame] | 5397 | tmp_buf = vmalloc(left_root->nodesize); |
| 5398 | if (!tmp_buf) { |
| 5399 | ret = -ENOMEM; |
| 5400 | goto out; |
| 5401 | } |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5402 | } |
| 5403 | |
| 5404 | left_path->search_commit_root = 1; |
| 5405 | left_path->skip_locking = 1; |
| 5406 | right_path->search_commit_root = 1; |
| 5407 | right_path->skip_locking = 1; |
| 5408 | |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5409 | /* |
| 5410 | * Strategy: Go to the first items of both trees. Then do |
| 5411 | * |
| 5412 | * If both trees are at level 0 |
| 5413 | * Compare keys of current items |
| 5414 | * If left < right treat left item as new, advance left tree |
| 5415 | * and repeat |
| 5416 | * If left > right treat right item as deleted, advance right tree |
| 5417 | * and repeat |
| 5418 | * If left == right do deep compare of items, treat as changed if |
| 5419 | * needed, advance both trees and repeat |
| 5420 | * If both trees are at the same level but not at level 0 |
| 5421 | * Compare keys of current nodes/leafs |
| 5422 | * If left < right advance left tree and repeat |
| 5423 | * If left > right advance right tree and repeat |
| 5424 | * If left == right compare blockptrs of the next nodes/leafs |
| 5425 | * If they match advance both trees but stay at the same level |
| 5426 | * and repeat |
| 5427 | * If they don't match advance both trees while allowing to go |
| 5428 | * deeper and repeat |
| 5429 | * If tree levels are different |
| 5430 | * Advance the tree that needs it and repeat |
| 5431 | * |
| 5432 | * Advancing a tree means: |
| 5433 | * If we are at level 0, try to go to the next slot. If that's not |
| 5434 | * possible, go one level up and repeat. Stop when we found a level |
| 5435 | * where we could go to the next slot. We may at this point be on a |
| 5436 | * node or a leaf. |
| 5437 | * |
| 5438 | * If we are not at level 0 and not on shared tree blocks, go one |
| 5439 | * level deeper. |
| 5440 | * |
| 5441 | * If we are not at level 0 and on shared tree blocks, go one slot to |
| 5442 | * the right if possible or go up and right. |
| 5443 | */ |
| 5444 | |
Josef Bacik | 3f8a18c | 2014-03-28 17:16:01 -0400 | [diff] [blame] | 5445 | down_read(&left_root->fs_info->commit_root_sem); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5446 | left_level = btrfs_header_level(left_root->commit_root); |
| 5447 | left_root_level = left_level; |
| 5448 | left_path->nodes[left_level] = left_root->commit_root; |
| 5449 | extent_buffer_get(left_path->nodes[left_level]); |
| 5450 | |
| 5451 | right_level = btrfs_header_level(right_root->commit_root); |
| 5452 | right_root_level = right_level; |
| 5453 | right_path->nodes[right_level] = right_root->commit_root; |
| 5454 | extent_buffer_get(right_path->nodes[right_level]); |
Josef Bacik | 3f8a18c | 2014-03-28 17:16:01 -0400 | [diff] [blame] | 5455 | up_read(&left_root->fs_info->commit_root_sem); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5456 | |
| 5457 | if (left_level == 0) |
| 5458 | btrfs_item_key_to_cpu(left_path->nodes[left_level], |
| 5459 | &left_key, left_path->slots[left_level]); |
| 5460 | else |
| 5461 | btrfs_node_key_to_cpu(left_path->nodes[left_level], |
| 5462 | &left_key, left_path->slots[left_level]); |
| 5463 | if (right_level == 0) |
| 5464 | btrfs_item_key_to_cpu(right_path->nodes[right_level], |
| 5465 | &right_key, right_path->slots[right_level]); |
| 5466 | else |
| 5467 | btrfs_node_key_to_cpu(right_path->nodes[right_level], |
| 5468 | &right_key, right_path->slots[right_level]); |
| 5469 | |
| 5470 | left_end_reached = right_end_reached = 0; |
| 5471 | advance_left = advance_right = 0; |
| 5472 | |
| 5473 | while (1) { |
Nikolay Borisov | 13f9914 | 2019-09-04 19:33:58 +0300 | [diff] [blame] | 5474 | cond_resched(); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5475 | if (advance_left && !left_end_reached) { |
| 5476 | ret = tree_advance(left_root, left_path, &left_level, |
| 5477 | left_root_level, |
| 5478 | advance_left != ADVANCE_ONLY_NEXT, |
| 5479 | &left_key); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5480 | if (ret == -1) |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5481 | left_end_reached = ADVANCE; |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5482 | else if (ret < 0) |
| 5483 | goto out; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5484 | advance_left = 0; |
| 5485 | } |
| 5486 | if (advance_right && !right_end_reached) { |
| 5487 | ret = tree_advance(right_root, right_path, &right_level, |
| 5488 | right_root_level, |
| 5489 | advance_right != ADVANCE_ONLY_NEXT, |
| 5490 | &right_key); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5491 | if (ret == -1) |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5492 | right_end_reached = ADVANCE; |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5493 | else if (ret < 0) |
| 5494 | goto out; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5495 | advance_right = 0; |
| 5496 | } |
| 5497 | |
| 5498 | if (left_end_reached && right_end_reached) { |
| 5499 | ret = 0; |
| 5500 | goto out; |
| 5501 | } else if (left_end_reached) { |
| 5502 | if (right_level == 0) { |
| 5503 | ret = changed_cb(left_root, right_root, |
| 5504 | left_path, right_path, |
| 5505 | &right_key, |
| 5506 | BTRFS_COMPARE_TREE_DELETED, |
| 5507 | ctx); |
| 5508 | if (ret < 0) |
| 5509 | goto out; |
| 5510 | } |
| 5511 | advance_right = ADVANCE; |
| 5512 | continue; |
| 5513 | } else if (right_end_reached) { |
| 5514 | if (left_level == 0) { |
| 5515 | ret = changed_cb(left_root, right_root, |
| 5516 | left_path, right_path, |
| 5517 | &left_key, |
| 5518 | BTRFS_COMPARE_TREE_NEW, |
| 5519 | ctx); |
| 5520 | if (ret < 0) |
| 5521 | goto out; |
| 5522 | } |
| 5523 | advance_left = ADVANCE; |
| 5524 | continue; |
| 5525 | } |
| 5526 | |
| 5527 | if (left_level == 0 && right_level == 0) { |
| 5528 | cmp = btrfs_comp_cpu_keys(&left_key, &right_key); |
| 5529 | if (cmp < 0) { |
| 5530 | ret = changed_cb(left_root, right_root, |
| 5531 | left_path, right_path, |
| 5532 | &left_key, |
| 5533 | BTRFS_COMPARE_TREE_NEW, |
| 5534 | ctx); |
| 5535 | if (ret < 0) |
| 5536 | goto out; |
| 5537 | advance_left = ADVANCE; |
| 5538 | } else if (cmp > 0) { |
| 5539 | ret = changed_cb(left_root, right_root, |
| 5540 | left_path, right_path, |
| 5541 | &right_key, |
| 5542 | BTRFS_COMPARE_TREE_DELETED, |
| 5543 | ctx); |
| 5544 | if (ret < 0) |
| 5545 | goto out; |
| 5546 | advance_right = ADVANCE; |
| 5547 | } else { |
Fabian Frederick | b99d9a6 | 2014-09-25 19:35:02 +0200 | [diff] [blame] | 5548 | enum btrfs_compare_tree_result result; |
Josef Bacik | ba5e8f2 | 2013-08-16 16:52:55 -0400 | [diff] [blame] | 5549 | |
Chris Mason | 74dd17f | 2012-08-07 16:25:13 -0400 | [diff] [blame] | 5550 | WARN_ON(!extent_buffer_uptodate(left_path->nodes[0])); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5551 | ret = tree_compare_item(left_root, left_path, |
| 5552 | right_path, tmp_buf); |
Josef Bacik | ba5e8f2 | 2013-08-16 16:52:55 -0400 | [diff] [blame] | 5553 | if (ret) |
Fabian Frederick | b99d9a6 | 2014-09-25 19:35:02 +0200 | [diff] [blame] | 5554 | result = BTRFS_COMPARE_TREE_CHANGED; |
Josef Bacik | ba5e8f2 | 2013-08-16 16:52:55 -0400 | [diff] [blame] | 5555 | else |
Fabian Frederick | b99d9a6 | 2014-09-25 19:35:02 +0200 | [diff] [blame] | 5556 | result = BTRFS_COMPARE_TREE_SAME; |
Josef Bacik | ba5e8f2 | 2013-08-16 16:52:55 -0400 | [diff] [blame] | 5557 | ret = changed_cb(left_root, right_root, |
| 5558 | left_path, right_path, |
Fabian Frederick | b99d9a6 | 2014-09-25 19:35:02 +0200 | [diff] [blame] | 5559 | &left_key, result, ctx); |
Josef Bacik | ba5e8f2 | 2013-08-16 16:52:55 -0400 | [diff] [blame] | 5560 | if (ret < 0) |
| 5561 | goto out; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5562 | advance_left = ADVANCE; |
| 5563 | advance_right = ADVANCE; |
| 5564 | } |
| 5565 | } else if (left_level == right_level) { |
| 5566 | cmp = btrfs_comp_cpu_keys(&left_key, &right_key); |
| 5567 | if (cmp < 0) { |
| 5568 | advance_left = ADVANCE; |
| 5569 | } else if (cmp > 0) { |
| 5570 | advance_right = ADVANCE; |
| 5571 | } else { |
| 5572 | left_blockptr = btrfs_node_blockptr( |
| 5573 | left_path->nodes[left_level], |
| 5574 | left_path->slots[left_level]); |
| 5575 | right_blockptr = btrfs_node_blockptr( |
| 5576 | right_path->nodes[right_level], |
| 5577 | right_path->slots[right_level]); |
Filipe Manana | 6baa429 | 2014-02-20 21:15:25 +0000 | [diff] [blame] | 5578 | left_gen = btrfs_node_ptr_generation( |
| 5579 | left_path->nodes[left_level], |
| 5580 | left_path->slots[left_level]); |
| 5581 | right_gen = btrfs_node_ptr_generation( |
| 5582 | right_path->nodes[right_level], |
| 5583 | right_path->slots[right_level]); |
| 5584 | if (left_blockptr == right_blockptr && |
| 5585 | left_gen == right_gen) { |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5586 | /* |
| 5587 | * As we're on a shared block, don't |
| 5588 | * allow to go deeper. |
| 5589 | */ |
| 5590 | advance_left = ADVANCE_ONLY_NEXT; |
| 5591 | advance_right = ADVANCE_ONLY_NEXT; |
| 5592 | } else { |
| 5593 | advance_left = ADVANCE; |
| 5594 | advance_right = ADVANCE; |
| 5595 | } |
| 5596 | } |
| 5597 | } else if (left_level < right_level) { |
| 5598 | advance_right = ADVANCE; |
| 5599 | } else { |
| 5600 | advance_left = ADVANCE; |
| 5601 | } |
| 5602 | } |
| 5603 | |
| 5604 | out: |
| 5605 | btrfs_free_path(left_path); |
| 5606 | btrfs_free_path(right_path); |
David Sterba | 8f282f7 | 2016-03-30 16:01:12 +0200 | [diff] [blame] | 5607 | kvfree(tmp_buf); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5608 | return ret; |
| 5609 | } |
| 5610 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5611 | /* |
| 5612 | * this is similar to btrfs_next_leaf, but does not try to preserve |
| 5613 | * and fixup the path. It looks for and returns the next key in the |
Eric Sandeen | de78b51 | 2013-01-31 18:21:12 +0000 | [diff] [blame] | 5614 | * tree based on the current path and the min_trans parameters. |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5615 | * |
| 5616 | * 0 is returned if another key is found, < 0 if there are any errors |
| 5617 | * and 1 is returned if there are no higher keys in the tree |
| 5618 | * |
| 5619 | * path->keep_locks should be set to 1 on the search made before |
| 5620 | * calling this function. |
| 5621 | */ |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5622 | int btrfs_find_next_key(struct btrfs_root *root, struct btrfs_path *path, |
Eric Sandeen | de78b51 | 2013-01-31 18:21:12 +0000 | [diff] [blame] | 5623 | struct btrfs_key *key, int level, u64 min_trans) |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5624 | { |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5625 | int slot; |
| 5626 | struct extent_buffer *c; |
| 5627 | |
Chris Mason | 934d375 | 2008-12-08 16:43:10 -0500 | [diff] [blame] | 5628 | WARN_ON(!path->keep_locks); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5629 | while (level < BTRFS_MAX_LEVEL) { |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5630 | if (!path->nodes[level]) |
| 5631 | return 1; |
| 5632 | |
| 5633 | slot = path->slots[level] + 1; |
| 5634 | c = path->nodes[level]; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5635 | next: |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5636 | if (slot >= btrfs_header_nritems(c)) { |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 5637 | int ret; |
| 5638 | int orig_lowest; |
| 5639 | struct btrfs_key cur_key; |
| 5640 | if (level + 1 >= BTRFS_MAX_LEVEL || |
| 5641 | !path->nodes[level + 1]) |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5642 | return 1; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 5643 | |
| 5644 | if (path->locks[level + 1]) { |
| 5645 | level++; |
| 5646 | continue; |
| 5647 | } |
| 5648 | |
| 5649 | slot = btrfs_header_nritems(c) - 1; |
| 5650 | if (level == 0) |
| 5651 | btrfs_item_key_to_cpu(c, &cur_key, slot); |
| 5652 | else |
| 5653 | btrfs_node_key_to_cpu(c, &cur_key, slot); |
| 5654 | |
| 5655 | orig_lowest = path->lowest_level; |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 5656 | btrfs_release_path(path); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 5657 | path->lowest_level = level; |
| 5658 | ret = btrfs_search_slot(NULL, root, &cur_key, path, |
| 5659 | 0, 0); |
| 5660 | path->lowest_level = orig_lowest; |
| 5661 | if (ret < 0) |
| 5662 | return ret; |
| 5663 | |
| 5664 | c = path->nodes[level]; |
| 5665 | slot = path->slots[level]; |
| 5666 | if (ret == 0) |
| 5667 | slot++; |
| 5668 | goto next; |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5669 | } |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 5670 | |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5671 | if (level == 0) |
| 5672 | btrfs_item_key_to_cpu(c, key, slot); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5673 | else { |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5674 | u64 gen = btrfs_node_ptr_generation(c, slot); |
| 5675 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5676 | if (gen < min_trans) { |
| 5677 | slot++; |
| 5678 | goto next; |
| 5679 | } |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5680 | btrfs_node_key_to_cpu(c, key, slot); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5681 | } |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5682 | return 0; |
| 5683 | } |
| 5684 | return 1; |
| 5685 | } |
| 5686 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5687 | /* |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5688 | * search the tree again to find a leaf with greater keys |
Chris Mason | 0f70abe | 2007-02-28 16:46:22 -0500 | [diff] [blame] | 5689 | * returns 0 if it found something or 1 if there are no greater leaves. |
| 5690 | * returns < 0 on io errors. |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 5691 | */ |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 5692 | int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path) |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5693 | { |
Jan Schmidt | 3d7806e | 2012-06-11 08:29:29 +0200 | [diff] [blame] | 5694 | return btrfs_next_old_leaf(root, path, 0); |
| 5695 | } |
| 5696 | |
| 5697 | int btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path, |
| 5698 | u64 time_seq) |
| 5699 | { |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5700 | int slot; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5701 | int level; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5702 | struct extent_buffer *c; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5703 | struct extent_buffer *next; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5704 | struct btrfs_key key; |
| 5705 | u32 nritems; |
| 5706 | int ret; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5707 | int old_spinning = path->leave_spinning; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5708 | int next_rw_lock = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5709 | |
| 5710 | nritems = btrfs_header_nritems(path->nodes[0]); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5711 | if (nritems == 0) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5712 | return 1; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5713 | |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5714 | btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1); |
| 5715 | again: |
| 5716 | level = 1; |
| 5717 | next = NULL; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5718 | next_rw_lock = 0; |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 5719 | btrfs_release_path(path); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5720 | |
Chris Mason | a213501 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5721 | path->keep_locks = 1; |
Chris Mason | 31533fb | 2011-07-26 16:01:59 -0400 | [diff] [blame] | 5722 | path->leave_spinning = 1; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5723 | |
Jan Schmidt | 3d7806e | 2012-06-11 08:29:29 +0200 | [diff] [blame] | 5724 | if (time_seq) |
| 5725 | ret = btrfs_search_old_slot(root, &key, path, time_seq); |
| 5726 | else |
| 5727 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5728 | path->keep_locks = 0; |
| 5729 | |
| 5730 | if (ret < 0) |
| 5731 | return ret; |
| 5732 | |
Chris Mason | a213501 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5733 | nritems = btrfs_header_nritems(path->nodes[0]); |
Chris Mason | 168fd7d | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5734 | /* |
| 5735 | * by releasing the path above we dropped all our locks. A balance |
| 5736 | * could have added more items next to the key that used to be |
| 5737 | * at the very end of the block. So, check again here and |
| 5738 | * advance the path if there are now more items available. |
| 5739 | */ |
Chris Mason | a213501 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5740 | if (nritems > 0 && path->slots[0] < nritems - 1) { |
Yan Zheng | e457afe | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 5741 | if (ret == 0) |
| 5742 | path->slots[0]++; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5743 | ret = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5744 | goto done; |
| 5745 | } |
Liu Bo | 0b43e04 | 2014-06-09 11:04:49 +0800 | [diff] [blame] | 5746 | /* |
| 5747 | * So the above check misses one case: |
| 5748 | * - after releasing the path above, someone has removed the item that |
| 5749 | * used to be at the very end of the block, and balance between leafs |
| 5750 | * gets another one with bigger key.offset to replace it. |
| 5751 | * |
| 5752 | * This one should be returned as well, or we can get leaf corruption |
| 5753 | * later(esp. in __btrfs_drop_extents()). |
| 5754 | * |
| 5755 | * And a bit more explanation about this check, |
| 5756 | * with ret > 0, the key isn't found, the path points to the slot |
| 5757 | * where it should be inserted, so the path->slots[0] item must be the |
| 5758 | * bigger one. |
| 5759 | */ |
| 5760 | if (nritems > 0 && ret > 0 && path->slots[0] == nritems - 1) { |
| 5761 | ret = 0; |
| 5762 | goto done; |
| 5763 | } |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5764 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5765 | while (level < BTRFS_MAX_LEVEL) { |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5766 | if (!path->nodes[level]) { |
| 5767 | ret = 1; |
| 5768 | goto done; |
| 5769 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5770 | |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5771 | slot = path->slots[level] + 1; |
| 5772 | c = path->nodes[level]; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5773 | if (slot >= btrfs_header_nritems(c)) { |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5774 | level++; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5775 | if (level == BTRFS_MAX_LEVEL) { |
| 5776 | ret = 1; |
| 5777 | goto done; |
| 5778 | } |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5779 | continue; |
| 5780 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5781 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5782 | if (next) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5783 | btrfs_tree_unlock_rw(next, next_rw_lock); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5784 | free_extent_buffer(next); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5785 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5786 | |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5787 | next = c; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5788 | next_rw_lock = path->locks[level]; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5789 | ret = read_block_for_search(NULL, root, path, &next, level, |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 5790 | slot, &key, 0); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5791 | if (ret == -EAGAIN) |
| 5792 | goto again; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5793 | |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 5794 | if (ret < 0) { |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 5795 | btrfs_release_path(path); |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 5796 | goto done; |
| 5797 | } |
| 5798 | |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5799 | if (!path->skip_locking) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5800 | ret = btrfs_try_tree_read_lock(next); |
Jan Schmidt | d42244a | 2012-06-22 14:51:15 +0200 | [diff] [blame] | 5801 | if (!ret && time_seq) { |
| 5802 | /* |
| 5803 | * If we don't get the lock, we may be racing |
| 5804 | * with push_leaf_left, holding that lock while |
| 5805 | * itself waiting for the leaf we've currently |
| 5806 | * locked. To solve this situation, we give up |
| 5807 | * on our lock and cycle. |
| 5808 | */ |
Jan Schmidt | cf53883 | 2012-07-04 15:42:48 +0200 | [diff] [blame] | 5809 | free_extent_buffer(next); |
Jan Schmidt | d42244a | 2012-06-22 14:51:15 +0200 | [diff] [blame] | 5810 | btrfs_release_path(path); |
| 5811 | cond_resched(); |
| 5812 | goto again; |
| 5813 | } |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5814 | if (!ret) { |
| 5815 | btrfs_set_path_blocking(path); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5816 | btrfs_tree_read_lock(next); |
Chris Mason | 31533fb | 2011-07-26 16:01:59 -0400 | [diff] [blame] | 5817 | btrfs_clear_path_blocking(path, next, |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5818 | BTRFS_READ_LOCK); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5819 | } |
Chris Mason | 31533fb | 2011-07-26 16:01:59 -0400 | [diff] [blame] | 5820 | next_rw_lock = BTRFS_READ_LOCK; |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5821 | } |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5822 | break; |
| 5823 | } |
| 5824 | path->slots[level] = slot; |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5825 | while (1) { |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5826 | level--; |
| 5827 | c = path->nodes[level]; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5828 | if (path->locks[level]) |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5829 | btrfs_tree_unlock_rw(c, path->locks[level]); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5830 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5831 | free_extent_buffer(c); |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5832 | path->nodes[level] = next; |
| 5833 | path->slots[level] = 0; |
Chris Mason | a74a4b9 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5834 | if (!path->skip_locking) |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5835 | path->locks[level] = next_rw_lock; |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5836 | if (!level) |
| 5837 | break; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 5838 | |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5839 | ret = read_block_for_search(NULL, root, path, &next, level, |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 5840 | 0, &key, 0); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5841 | if (ret == -EAGAIN) |
| 5842 | goto again; |
| 5843 | |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 5844 | if (ret < 0) { |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 5845 | btrfs_release_path(path); |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 5846 | goto done; |
| 5847 | } |
| 5848 | |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5849 | if (!path->skip_locking) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5850 | ret = btrfs_try_tree_read_lock(next); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5851 | if (!ret) { |
| 5852 | btrfs_set_path_blocking(path); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5853 | btrfs_tree_read_lock(next); |
Chris Mason | 31533fb | 2011-07-26 16:01:59 -0400 | [diff] [blame] | 5854 | btrfs_clear_path_blocking(path, next, |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5855 | BTRFS_READ_LOCK); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5856 | } |
Chris Mason | 31533fb | 2011-07-26 16:01:59 -0400 | [diff] [blame] | 5857 | next_rw_lock = BTRFS_READ_LOCK; |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5858 | } |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5859 | } |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5860 | ret = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5861 | done: |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 5862 | unlock_up(path, 0, 1, 0, NULL); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5863 | path->leave_spinning = old_spinning; |
| 5864 | if (!old_spinning) |
| 5865 | btrfs_set_path_blocking(path); |
| 5866 | |
| 5867 | return ret; |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5868 | } |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5869 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5870 | /* |
| 5871 | * this uses btrfs_prev_leaf to walk backwards in the tree, and keeps |
| 5872 | * searching until it gets past min_objectid or finds an item of 'type' |
| 5873 | * |
| 5874 | * returns 0 if something is found, 1 if nothing was found and < 0 on error |
| 5875 | */ |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5876 | int btrfs_previous_item(struct btrfs_root *root, |
| 5877 | struct btrfs_path *path, u64 min_objectid, |
| 5878 | int type) |
| 5879 | { |
| 5880 | struct btrfs_key found_key; |
| 5881 | struct extent_buffer *leaf; |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5882 | u32 nritems; |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5883 | int ret; |
| 5884 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5885 | while (1) { |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5886 | if (path->slots[0] == 0) { |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 5887 | btrfs_set_path_blocking(path); |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5888 | ret = btrfs_prev_leaf(root, path); |
| 5889 | if (ret != 0) |
| 5890 | return ret; |
| 5891 | } else { |
| 5892 | path->slots[0]--; |
| 5893 | } |
| 5894 | leaf = path->nodes[0]; |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5895 | nritems = btrfs_header_nritems(leaf); |
| 5896 | if (nritems == 0) |
| 5897 | return 1; |
| 5898 | if (path->slots[0] == nritems) |
| 5899 | path->slots[0]--; |
| 5900 | |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5901 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5902 | if (found_key.objectid < min_objectid) |
| 5903 | break; |
Yan Zheng | 0a4eefb | 2009-07-24 11:06:53 -0400 | [diff] [blame] | 5904 | if (found_key.type == type) |
| 5905 | return 0; |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5906 | if (found_key.objectid == min_objectid && |
| 5907 | found_key.type < type) |
| 5908 | break; |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5909 | } |
| 5910 | return 1; |
| 5911 | } |
Wang Shilong | ade2e0b | 2014-01-12 21:38:33 +0800 | [diff] [blame] | 5912 | |
| 5913 | /* |
| 5914 | * search in extent tree to find a previous Metadata/Data extent item with |
| 5915 | * min objecitd. |
| 5916 | * |
| 5917 | * returns 0 if something is found, 1 if nothing was found and < 0 on error |
| 5918 | */ |
| 5919 | int btrfs_previous_extent_item(struct btrfs_root *root, |
| 5920 | struct btrfs_path *path, u64 min_objectid) |
| 5921 | { |
| 5922 | struct btrfs_key found_key; |
| 5923 | struct extent_buffer *leaf; |
| 5924 | u32 nritems; |
| 5925 | int ret; |
| 5926 | |
| 5927 | while (1) { |
| 5928 | if (path->slots[0] == 0) { |
| 5929 | btrfs_set_path_blocking(path); |
| 5930 | ret = btrfs_prev_leaf(root, path); |
| 5931 | if (ret != 0) |
| 5932 | return ret; |
| 5933 | } else { |
| 5934 | path->slots[0]--; |
| 5935 | } |
| 5936 | leaf = path->nodes[0]; |
| 5937 | nritems = btrfs_header_nritems(leaf); |
| 5938 | if (nritems == 0) |
| 5939 | return 1; |
| 5940 | if (path->slots[0] == nritems) |
| 5941 | path->slots[0]--; |
| 5942 | |
| 5943 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
| 5944 | if (found_key.objectid < min_objectid) |
| 5945 | break; |
| 5946 | if (found_key.type == BTRFS_EXTENT_ITEM_KEY || |
| 5947 | found_key.type == BTRFS_METADATA_ITEM_KEY) |
| 5948 | return 0; |
| 5949 | if (found_key.objectid == min_objectid && |
| 5950 | found_key.type < BTRFS_EXTENT_ITEM_KEY) |
| 5951 | break; |
| 5952 | } |
| 5953 | return 1; |
| 5954 | } |