David Sterba | c1d7c51 | 2018-04-03 19:23:33 +0200 | [diff] [blame] | 1 | // SPDX-License-Identifier: GPL-2.0 |
Chris Mason | 6cbd557 | 2007-06-12 09:07:21 -0400 | [diff] [blame] | 2 | /* |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 3 | * Copyright (C) 2007,2008 Oracle. All rights reserved. |
Chris Mason | 6cbd557 | 2007-06-12 09:07:21 -0400 | [diff] [blame] | 4 | */ |
| 5 | |
Chris Mason | a6b6e75 | 2007-10-15 16:22:39 -0400 | [diff] [blame] | 6 | #include <linux/sched.h> |
Tejun Heo | 5a0e3ad | 2010-03-24 17:04:11 +0900 | [diff] [blame] | 7 | #include <linux/slab.h> |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 8 | #include <linux/rbtree.h> |
David Sterba | adf0212 | 2017-05-31 19:44:31 +0200 | [diff] [blame] | 9 | #include <linux/mm.h> |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 10 | #include "ctree.h" |
| 11 | #include "disk-io.h" |
Chris Mason | 7f5c151 | 2007-03-23 15:56:19 -0400 | [diff] [blame] | 12 | #include "transaction.h" |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 13 | #include "print-tree.h" |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 14 | #include "locking.h" |
Nikolay Borisov | de37aa5 | 2018-10-30 16:43:24 +0200 | [diff] [blame] | 15 | #include "volumes.h" |
Qu Wenruo | f616f5c | 2019-01-23 15:15:17 +0800 | [diff] [blame] | 16 | #include "qgroup.h" |
Chris Mason | 9a8dd15 | 2007-02-23 08:38:36 -0500 | [diff] [blame] | 17 | |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 18 | static int split_node(struct btrfs_trans_handle *trans, struct btrfs_root |
| 19 | *root, struct btrfs_path *path, int level); |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 20 | static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 21 | const struct btrfs_key *ins_key, struct btrfs_path *path, |
| 22 | int data_size, int extend); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 23 | static int push_node_left(struct btrfs_trans_handle *trans, |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 24 | struct extent_buffer *dst, |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 25 | struct extent_buffer *src, int empty); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 26 | static int balance_node_right(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 27 | struct extent_buffer *dst_buf, |
| 28 | struct extent_buffer *src_buf); |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 29 | static void del_ptr(struct btrfs_root *root, struct btrfs_path *path, |
| 30 | int level, int slot); |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 31 | |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 32 | struct btrfs_path *btrfs_alloc_path(void) |
| 33 | { |
Masahiro Yamada | e2c8990 | 2016-09-13 04:35:52 +0900 | [diff] [blame] | 34 | return kmem_cache_zalloc(btrfs_path_cachep, GFP_NOFS); |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 35 | } |
| 36 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 37 | /* |
| 38 | * set all locked nodes in the path to blocking locks. This should |
| 39 | * be done before scheduling |
| 40 | */ |
| 41 | noinline void btrfs_set_path_blocking(struct btrfs_path *p) |
| 42 | { |
| 43 | int i; |
| 44 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 45 | if (!p->nodes[i] || !p->locks[i]) |
| 46 | continue; |
David Sterba | 766ece5 | 2019-01-23 18:07:14 +0100 | [diff] [blame] | 47 | /* |
| 48 | * If we currently have a spinning reader or writer lock this |
| 49 | * will bump the count of blocking holders and drop the |
| 50 | * spinlock. |
| 51 | */ |
| 52 | if (p->locks[i] == BTRFS_READ_LOCK) { |
| 53 | btrfs_set_lock_blocking_read(p->nodes[i]); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 54 | p->locks[i] = BTRFS_READ_LOCK_BLOCKING; |
David Sterba | 766ece5 | 2019-01-23 18:07:14 +0100 | [diff] [blame] | 55 | } else if (p->locks[i] == BTRFS_WRITE_LOCK) { |
| 56 | btrfs_set_lock_blocking_write(p->nodes[i]); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 57 | p->locks[i] = BTRFS_WRITE_LOCK_BLOCKING; |
David Sterba | 766ece5 | 2019-01-23 18:07:14 +0100 | [diff] [blame] | 58 | } |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 59 | } |
| 60 | } |
| 61 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 62 | /* this also releases the path */ |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 63 | void btrfs_free_path(struct btrfs_path *p) |
| 64 | { |
Jesper Juhl | ff175d5 | 2010-12-25 21:22:30 +0000 | [diff] [blame] | 65 | if (!p) |
| 66 | return; |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 67 | btrfs_release_path(p); |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 68 | kmem_cache_free(btrfs_path_cachep, p); |
| 69 | } |
| 70 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 71 | /* |
| 72 | * path release drops references on the extent buffers in the path |
| 73 | * and it drops any locks held by this path |
| 74 | * |
| 75 | * It is safe to call this on paths that no locks or extent buffers held. |
| 76 | */ |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 77 | noinline void btrfs_release_path(struct btrfs_path *p) |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 78 | { |
| 79 | int i; |
Chris Mason | a213501 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 80 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 81 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) { |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 82 | p->slots[i] = 0; |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 83 | if (!p->nodes[i]) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 84 | continue; |
| 85 | if (p->locks[i]) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 86 | btrfs_tree_unlock_rw(p->nodes[i], p->locks[i]); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 87 | p->locks[i] = 0; |
| 88 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 89 | free_extent_buffer(p->nodes[i]); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 90 | p->nodes[i] = NULL; |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 91 | } |
| 92 | } |
| 93 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 94 | /* |
| 95 | * safely gets a reference on the root node of a tree. A lock |
| 96 | * is not taken, so a concurrent writer may put a different node |
| 97 | * at the root of the tree. See btrfs_lock_root_node for the |
| 98 | * looping required. |
| 99 | * |
| 100 | * The extent buffer returned by this has a reference taken, so |
| 101 | * it won't disappear. It may stop being the root of the tree |
| 102 | * at any time because there are no locks held. |
| 103 | */ |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 104 | struct extent_buffer *btrfs_root_node(struct btrfs_root *root) |
| 105 | { |
| 106 | struct extent_buffer *eb; |
Chris Mason | 240f62c | 2011-03-23 14:54:42 -0400 | [diff] [blame] | 107 | |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 108 | while (1) { |
| 109 | rcu_read_lock(); |
| 110 | eb = rcu_dereference(root->node); |
| 111 | |
| 112 | /* |
| 113 | * 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] | 114 | * 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] | 115 | * the inc_not_zero dance and if it doesn't work then |
| 116 | * synchronize_rcu and try again. |
| 117 | */ |
| 118 | if (atomic_inc_not_zero(&eb->refs)) { |
| 119 | rcu_read_unlock(); |
| 120 | break; |
| 121 | } |
| 122 | rcu_read_unlock(); |
| 123 | synchronize_rcu(); |
| 124 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 125 | return eb; |
| 126 | } |
| 127 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 128 | /* loop around taking references on and locking the root node of the |
| 129 | * tree until you end up with a lock on the root. A locked buffer |
| 130 | * is returned, with a reference held. |
| 131 | */ |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 132 | struct extent_buffer *btrfs_lock_root_node(struct btrfs_root *root) |
| 133 | { |
| 134 | struct extent_buffer *eb; |
| 135 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 136 | while (1) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 137 | eb = btrfs_root_node(root); |
| 138 | btrfs_tree_lock(eb); |
Chris Mason | 240f62c | 2011-03-23 14:54:42 -0400 | [diff] [blame] | 139 | if (eb == root->node) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 140 | break; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 141 | btrfs_tree_unlock(eb); |
| 142 | free_extent_buffer(eb); |
| 143 | } |
| 144 | return eb; |
| 145 | } |
| 146 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 147 | /* loop around taking references on and locking the root node of the |
| 148 | * tree until you end up with a lock on the root. A locked buffer |
| 149 | * is returned, with a reference held. |
| 150 | */ |
Josef Bacik | 84f7d8e | 2017-09-29 15:43:49 -0400 | [diff] [blame] | 151 | struct extent_buffer *btrfs_read_lock_root_node(struct btrfs_root *root) |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 152 | { |
| 153 | struct extent_buffer *eb; |
| 154 | |
| 155 | while (1) { |
| 156 | eb = btrfs_root_node(root); |
| 157 | btrfs_tree_read_lock(eb); |
| 158 | if (eb == root->node) |
| 159 | break; |
| 160 | btrfs_tree_read_unlock(eb); |
| 161 | free_extent_buffer(eb); |
| 162 | } |
| 163 | return eb; |
| 164 | } |
| 165 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 166 | /* cowonly root (everything not a reference counted cow subvolume), just get |
| 167 | * put onto a simple dirty list. transaction.c walks this to make sure they |
| 168 | * get properly updated on disk. |
| 169 | */ |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 170 | static void add_root_to_dirty_list(struct btrfs_root *root) |
| 171 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 172 | struct btrfs_fs_info *fs_info = root->fs_info; |
| 173 | |
Josef Bacik | e7070be | 2014-12-16 08:54:43 -0800 | [diff] [blame] | 174 | if (test_bit(BTRFS_ROOT_DIRTY, &root->state) || |
| 175 | !test_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state)) |
| 176 | return; |
| 177 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 178 | spin_lock(&fs_info->trans_lock); |
Josef Bacik | e7070be | 2014-12-16 08:54:43 -0800 | [diff] [blame] | 179 | if (!test_and_set_bit(BTRFS_ROOT_DIRTY, &root->state)) { |
| 180 | /* Want the extent tree to be the last on the list */ |
Misono Tomohiro | 4fd786e | 2018-08-06 14:25:24 +0900 | [diff] [blame] | 181 | if (root->root_key.objectid == BTRFS_EXTENT_TREE_OBJECTID) |
Josef Bacik | e7070be | 2014-12-16 08:54:43 -0800 | [diff] [blame] | 182 | list_move_tail(&root->dirty_list, |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 183 | &fs_info->dirty_cowonly_roots); |
Josef Bacik | e7070be | 2014-12-16 08:54:43 -0800 | [diff] [blame] | 184 | else |
| 185 | list_move(&root->dirty_list, |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 186 | &fs_info->dirty_cowonly_roots); |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 187 | } |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 188 | spin_unlock(&fs_info->trans_lock); |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 189 | } |
| 190 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 191 | /* |
| 192 | * used by snapshot creation to make a copy of a root for a tree with |
| 193 | * a given objectid. The buffer with the new root node is returned in |
| 194 | * cow_ret, and this func returns zero on success or a negative error code. |
| 195 | */ |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 196 | int btrfs_copy_root(struct btrfs_trans_handle *trans, |
| 197 | struct btrfs_root *root, |
| 198 | struct extent_buffer *buf, |
| 199 | struct extent_buffer **cow_ret, u64 new_root_objectid) |
| 200 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 201 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 202 | struct extent_buffer *cow; |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 203 | int ret = 0; |
| 204 | int level; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 205 | struct btrfs_disk_key disk_key; |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 206 | |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 207 | WARN_ON(test_bit(BTRFS_ROOT_REF_COWS, &root->state) && |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 208 | trans->transid != fs_info->running_transaction->transid); |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 209 | WARN_ON(test_bit(BTRFS_ROOT_REF_COWS, &root->state) && |
| 210 | trans->transid != root->last_trans); |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 211 | |
| 212 | level = btrfs_header_level(buf); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 213 | if (level == 0) |
| 214 | btrfs_item_key(buf, &disk_key, 0); |
| 215 | else |
| 216 | btrfs_node_key(buf, &disk_key, 0); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 217 | |
David Sterba | 4d75f8a | 2014-06-15 01:54:12 +0200 | [diff] [blame] | 218 | cow = btrfs_alloc_tree_block(trans, root, 0, new_root_objectid, |
| 219 | &disk_key, level, buf->start, 0); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 220 | if (IS_ERR(cow)) |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 221 | return PTR_ERR(cow); |
| 222 | |
David Sterba | 58e8012 | 2016-11-08 18:30:31 +0100 | [diff] [blame] | 223 | copy_extent_buffer_full(cow, buf); |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 224 | btrfs_set_header_bytenr(cow, cow->start); |
| 225 | btrfs_set_header_generation(cow, trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 226 | btrfs_set_header_backref_rev(cow, BTRFS_MIXED_BACKREF_REV); |
| 227 | btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN | |
| 228 | BTRFS_HEADER_FLAG_RELOC); |
| 229 | if (new_root_objectid == BTRFS_TREE_RELOC_OBJECTID) |
| 230 | btrfs_set_header_flag(cow, BTRFS_HEADER_FLAG_RELOC); |
| 231 | else |
| 232 | btrfs_set_header_owner(cow, new_root_objectid); |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 233 | |
Nikolay Borisov | de37aa5 | 2018-10-30 16:43:24 +0200 | [diff] [blame] | 234 | write_extent_buffer_fsid(cow, fs_info->fs_devices->metadata_uuid); |
Yan Zheng | 2b82032 | 2008-11-17 21:11:30 -0500 | [diff] [blame] | 235 | |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 236 | WARN_ON(btrfs_header_generation(buf) > trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 237 | if (new_root_objectid == BTRFS_TREE_RELOC_OBJECTID) |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 238 | ret = btrfs_inc_ref(trans, root, cow, 1); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 239 | else |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 240 | ret = btrfs_inc_ref(trans, root, cow, 0); |
Chris Mason | 4aec2b5 | 2007-12-18 16:25:45 -0500 | [diff] [blame] | 241 | |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 242 | if (ret) |
| 243 | return ret; |
| 244 | |
| 245 | btrfs_mark_buffer_dirty(cow); |
| 246 | *cow_ret = cow; |
| 247 | return 0; |
| 248 | } |
| 249 | |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 250 | enum mod_log_op { |
| 251 | MOD_LOG_KEY_REPLACE, |
| 252 | MOD_LOG_KEY_ADD, |
| 253 | MOD_LOG_KEY_REMOVE, |
| 254 | MOD_LOG_KEY_REMOVE_WHILE_FREEING, |
| 255 | MOD_LOG_KEY_REMOVE_WHILE_MOVING, |
| 256 | MOD_LOG_MOVE_KEYS, |
| 257 | MOD_LOG_ROOT_REPLACE, |
| 258 | }; |
| 259 | |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 260 | struct tree_mod_root { |
| 261 | u64 logical; |
| 262 | u8 level; |
| 263 | }; |
| 264 | |
| 265 | struct tree_mod_elem { |
| 266 | struct rb_node node; |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 267 | u64 logical; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 268 | u64 seq; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 269 | enum mod_log_op op; |
| 270 | |
| 271 | /* this is used for MOD_LOG_KEY_* and MOD_LOG_MOVE_KEYS operations */ |
| 272 | int slot; |
| 273 | |
| 274 | /* this is used for MOD_LOG_KEY* and MOD_LOG_ROOT_REPLACE */ |
| 275 | u64 generation; |
| 276 | |
| 277 | /* those are used for op == MOD_LOG_KEY_{REPLACE,REMOVE} */ |
| 278 | struct btrfs_disk_key key; |
| 279 | u64 blockptr; |
| 280 | |
| 281 | /* this is used for op == MOD_LOG_MOVE_KEYS */ |
David Sterba | b6dfa35 | 2018-03-05 15:31:18 +0100 | [diff] [blame] | 282 | struct { |
| 283 | int dst_slot; |
| 284 | int nr_items; |
| 285 | } move; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 286 | |
| 287 | /* this is used for op == MOD_LOG_ROOT_REPLACE */ |
| 288 | struct tree_mod_root old_root; |
| 289 | }; |
| 290 | |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 291 | /* |
Josef Bacik | fcebe45 | 2014-05-13 17:30:47 -0700 | [diff] [blame] | 292 | * Pull a new tree mod seq number for our operation. |
Jan Schmidt | fc36ed7e | 2013-04-24 16:57:33 +0000 | [diff] [blame] | 293 | */ |
Josef Bacik | fcebe45 | 2014-05-13 17:30:47 -0700 | [diff] [blame] | 294 | 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] | 295 | { |
| 296 | return atomic64_inc_return(&fs_info->tree_mod_seq); |
| 297 | } |
| 298 | |
| 299 | /* |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 300 | * This adds a new blocker to the tree mod log's blocker list if the @elem |
| 301 | * passed does not already have a sequence number set. So when a caller expects |
| 302 | * to record tree modifications, it should ensure to set elem->seq to zero |
| 303 | * before calling btrfs_get_tree_mod_seq. |
| 304 | * Returns a fresh, unused tree log modification sequence number, even if no new |
| 305 | * blocker was added. |
| 306 | */ |
| 307 | u64 btrfs_get_tree_mod_seq(struct btrfs_fs_info *fs_info, |
| 308 | struct seq_list *elem) |
| 309 | { |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 310 | write_lock(&fs_info->tree_mod_log_lock); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 311 | spin_lock(&fs_info->tree_mod_seq_lock); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 312 | if (!elem->seq) { |
Josef Bacik | fcebe45 | 2014-05-13 17:30:47 -0700 | [diff] [blame] | 313 | elem->seq = btrfs_inc_tree_mod_seq(fs_info); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 314 | list_add_tail(&elem->list, &fs_info->tree_mod_seq_list); |
| 315 | } |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 316 | spin_unlock(&fs_info->tree_mod_seq_lock); |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 317 | write_unlock(&fs_info->tree_mod_log_lock); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 318 | |
Josef Bacik | fcebe45 | 2014-05-13 17:30:47 -0700 | [diff] [blame] | 319 | return elem->seq; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 320 | } |
| 321 | |
| 322 | void btrfs_put_tree_mod_seq(struct btrfs_fs_info *fs_info, |
| 323 | struct seq_list *elem) |
| 324 | { |
| 325 | struct rb_root *tm_root; |
| 326 | struct rb_node *node; |
| 327 | struct rb_node *next; |
| 328 | struct seq_list *cur_elem; |
| 329 | struct tree_mod_elem *tm; |
| 330 | u64 min_seq = (u64)-1; |
| 331 | u64 seq_putting = elem->seq; |
| 332 | |
| 333 | if (!seq_putting) |
| 334 | return; |
| 335 | |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 336 | spin_lock(&fs_info->tree_mod_seq_lock); |
| 337 | list_del(&elem->list); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 338 | elem->seq = 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 339 | |
| 340 | 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] | 341 | if (cur_elem->seq < min_seq) { |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 342 | if (seq_putting > cur_elem->seq) { |
| 343 | /* |
| 344 | * blocker with lower sequence number exists, we |
| 345 | * cannot remove anything from the log |
| 346 | */ |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 347 | spin_unlock(&fs_info->tree_mod_seq_lock); |
| 348 | return; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 349 | } |
| 350 | min_seq = cur_elem->seq; |
| 351 | } |
| 352 | } |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 353 | spin_unlock(&fs_info->tree_mod_seq_lock); |
| 354 | |
| 355 | /* |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 356 | * anything that's lower than the lowest existing (read: blocked) |
| 357 | * sequence number can be removed from the tree. |
| 358 | */ |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 359 | write_lock(&fs_info->tree_mod_log_lock); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 360 | tm_root = &fs_info->tree_mod_log; |
| 361 | for (node = rb_first(tm_root); node; node = next) { |
| 362 | next = rb_next(node); |
Geliang Tang | 6b4df8b | 2016-12-19 22:53:41 +0800 | [diff] [blame] | 363 | tm = rb_entry(node, struct tree_mod_elem, node); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 364 | if (tm->seq > min_seq) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 365 | continue; |
| 366 | rb_erase(node, tm_root); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 367 | kfree(tm); |
| 368 | } |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 369 | write_unlock(&fs_info->tree_mod_log_lock); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 370 | } |
| 371 | |
| 372 | /* |
| 373 | * key order of the log: |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 374 | * node/leaf start address -> sequence |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 375 | * |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 376 | * The 'start address' is the logical address of the *new* root node |
| 377 | * for root replace operations, or the logical address of the affected |
| 378 | * block for all other operations. |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 379 | * |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 380 | * Note: must be called with write lock for fs_info::tree_mod_log_lock. |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 381 | */ |
| 382 | static noinline int |
| 383 | __tree_mod_log_insert(struct btrfs_fs_info *fs_info, struct tree_mod_elem *tm) |
| 384 | { |
| 385 | struct rb_root *tm_root; |
| 386 | struct rb_node **new; |
| 387 | struct rb_node *parent = NULL; |
| 388 | struct tree_mod_elem *cur; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 389 | |
Josef Bacik | fcebe45 | 2014-05-13 17:30:47 -0700 | [diff] [blame] | 390 | tm->seq = btrfs_inc_tree_mod_seq(fs_info); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 391 | |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 392 | tm_root = &fs_info->tree_mod_log; |
| 393 | new = &tm_root->rb_node; |
| 394 | while (*new) { |
Geliang Tang | 6b4df8b | 2016-12-19 22:53:41 +0800 | [diff] [blame] | 395 | cur = rb_entry(*new, struct tree_mod_elem, node); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 396 | parent = *new; |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 397 | if (cur->logical < tm->logical) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 398 | new = &((*new)->rb_left); |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 399 | else if (cur->logical > tm->logical) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 400 | new = &((*new)->rb_right); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 401 | else if (cur->seq < tm->seq) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 402 | new = &((*new)->rb_left); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 403 | else if (cur->seq > tm->seq) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 404 | new = &((*new)->rb_right); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 405 | else |
| 406 | return -EEXIST; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 407 | } |
| 408 | |
| 409 | rb_link_node(&tm->node, parent, new); |
| 410 | rb_insert_color(&tm->node, tm_root); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 411 | return 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 412 | } |
| 413 | |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 414 | /* |
| 415 | * Determines if logging can be omitted. Returns 1 if it can. Otherwise, it |
| 416 | * returns zero with the tree_mod_log_lock acquired. The caller must hold |
| 417 | * this until all tree mod log insertions are recorded in the rb tree and then |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 418 | * write unlock fs_info::tree_mod_log_lock. |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 419 | */ |
Jan Schmidt | e9b7fd4 | 2012-05-31 14:59:09 +0200 | [diff] [blame] | 420 | static inline int tree_mod_dont_log(struct btrfs_fs_info *fs_info, |
| 421 | struct extent_buffer *eb) { |
| 422 | smp_mb(); |
| 423 | if (list_empty(&(fs_info)->tree_mod_seq_list)) |
| 424 | return 1; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 425 | if (eb && btrfs_header_level(eb) == 0) |
Jan Schmidt | e9b7fd4 | 2012-05-31 14:59:09 +0200 | [diff] [blame] | 426 | return 1; |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 427 | |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 428 | write_lock(&fs_info->tree_mod_log_lock); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 429 | if (list_empty(&(fs_info)->tree_mod_seq_list)) { |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 430 | write_unlock(&fs_info->tree_mod_log_lock); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 431 | return 1; |
| 432 | } |
| 433 | |
Jan Schmidt | e9b7fd4 | 2012-05-31 14:59:09 +0200 | [diff] [blame] | 434 | return 0; |
| 435 | } |
| 436 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 437 | /* Similar to tree_mod_dont_log, but doesn't acquire any locks. */ |
| 438 | static inline int tree_mod_need_log(const struct btrfs_fs_info *fs_info, |
| 439 | struct extent_buffer *eb) |
| 440 | { |
| 441 | smp_mb(); |
| 442 | if (list_empty(&(fs_info)->tree_mod_seq_list)) |
| 443 | return 0; |
| 444 | if (eb && btrfs_header_level(eb) == 0) |
| 445 | return 0; |
| 446 | |
| 447 | return 1; |
| 448 | } |
| 449 | |
| 450 | static struct tree_mod_elem * |
| 451 | alloc_tree_mod_elem(struct extent_buffer *eb, int slot, |
| 452 | enum mod_log_op op, gfp_t flags) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 453 | { |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 454 | struct tree_mod_elem *tm; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 455 | |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 456 | tm = kzalloc(sizeof(*tm), flags); |
| 457 | if (!tm) |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 458 | return NULL; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 459 | |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 460 | tm->logical = eb->start; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 461 | if (op != MOD_LOG_KEY_ADD) { |
| 462 | btrfs_node_key(eb, &tm->key, slot); |
| 463 | tm->blockptr = btrfs_node_blockptr(eb, slot); |
| 464 | } |
| 465 | tm->op = op; |
| 466 | tm->slot = slot; |
| 467 | tm->generation = btrfs_node_ptr_generation(eb, slot); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 468 | RB_CLEAR_NODE(&tm->node); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 469 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 470 | return tm; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 471 | } |
| 472 | |
David Sterba | e09c2ef | 2018-03-05 15:09:03 +0100 | [diff] [blame] | 473 | static noinline int tree_mod_log_insert_key(struct extent_buffer *eb, int slot, |
| 474 | enum mod_log_op op, gfp_t flags) |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 475 | { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 476 | struct tree_mod_elem *tm; |
| 477 | int ret; |
| 478 | |
David Sterba | e09c2ef | 2018-03-05 15:09:03 +0100 | [diff] [blame] | 479 | if (!tree_mod_need_log(eb->fs_info, eb)) |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 480 | return 0; |
| 481 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 482 | tm = alloc_tree_mod_elem(eb, slot, op, flags); |
| 483 | if (!tm) |
| 484 | return -ENOMEM; |
| 485 | |
David Sterba | e09c2ef | 2018-03-05 15:09:03 +0100 | [diff] [blame] | 486 | if (tree_mod_dont_log(eb->fs_info, eb)) { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 487 | kfree(tm); |
| 488 | return 0; |
| 489 | } |
| 490 | |
David Sterba | e09c2ef | 2018-03-05 15:09:03 +0100 | [diff] [blame] | 491 | ret = __tree_mod_log_insert(eb->fs_info, tm); |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 492 | write_unlock(&eb->fs_info->tree_mod_log_lock); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 493 | if (ret) |
| 494 | kfree(tm); |
| 495 | |
| 496 | return ret; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 497 | } |
| 498 | |
David Sterba | 6074d45 | 2018-03-05 15:03:52 +0100 | [diff] [blame] | 499 | static noinline int tree_mod_log_insert_move(struct extent_buffer *eb, |
| 500 | int dst_slot, int src_slot, int nr_items) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 501 | { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 502 | struct tree_mod_elem *tm = NULL; |
| 503 | struct tree_mod_elem **tm_list = NULL; |
| 504 | int ret = 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 505 | int i; |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 506 | int locked = 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 507 | |
David Sterba | 6074d45 | 2018-03-05 15:03:52 +0100 | [diff] [blame] | 508 | if (!tree_mod_need_log(eb->fs_info, eb)) |
Jan Schmidt | f395694 | 2012-05-31 15:02:32 +0200 | [diff] [blame] | 509 | return 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 510 | |
David Sterba | 176ef8f | 2017-03-28 14:35:01 +0200 | [diff] [blame] | 511 | tm_list = kcalloc(nr_items, sizeof(struct tree_mod_elem *), GFP_NOFS); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 512 | if (!tm_list) |
| 513 | return -ENOMEM; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 514 | |
David Sterba | 176ef8f | 2017-03-28 14:35:01 +0200 | [diff] [blame] | 515 | tm = kzalloc(sizeof(*tm), GFP_NOFS); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 516 | if (!tm) { |
| 517 | ret = -ENOMEM; |
| 518 | goto free_tms; |
| 519 | } |
Jan Schmidt | f395694 | 2012-05-31 15:02:32 +0200 | [diff] [blame] | 520 | |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 521 | tm->logical = eb->start; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 522 | tm->slot = src_slot; |
| 523 | tm->move.dst_slot = dst_slot; |
| 524 | tm->move.nr_items = nr_items; |
| 525 | tm->op = MOD_LOG_MOVE_KEYS; |
| 526 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 527 | for (i = 0; i + dst_slot < src_slot && i < nr_items; i++) { |
| 528 | tm_list[i] = alloc_tree_mod_elem(eb, i + dst_slot, |
David Sterba | 176ef8f | 2017-03-28 14:35:01 +0200 | [diff] [blame] | 529 | MOD_LOG_KEY_REMOVE_WHILE_MOVING, GFP_NOFS); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 530 | if (!tm_list[i]) { |
| 531 | ret = -ENOMEM; |
| 532 | goto free_tms; |
| 533 | } |
| 534 | } |
| 535 | |
David Sterba | 6074d45 | 2018-03-05 15:03:52 +0100 | [diff] [blame] | 536 | if (tree_mod_dont_log(eb->fs_info, eb)) |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 537 | goto free_tms; |
| 538 | locked = 1; |
| 539 | |
| 540 | /* |
| 541 | * When we override something during the move, we log these removals. |
| 542 | * This can only happen when we move towards the beginning of the |
| 543 | * buffer, i.e. dst_slot < src_slot. |
| 544 | */ |
| 545 | for (i = 0; i + dst_slot < src_slot && i < nr_items; i++) { |
David Sterba | 6074d45 | 2018-03-05 15:03:52 +0100 | [diff] [blame] | 546 | ret = __tree_mod_log_insert(eb->fs_info, tm_list[i]); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 547 | if (ret) |
| 548 | goto free_tms; |
| 549 | } |
| 550 | |
David Sterba | 6074d45 | 2018-03-05 15:03:52 +0100 | [diff] [blame] | 551 | ret = __tree_mod_log_insert(eb->fs_info, tm); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 552 | if (ret) |
| 553 | goto free_tms; |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 554 | write_unlock(&eb->fs_info->tree_mod_log_lock); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 555 | kfree(tm_list); |
| 556 | |
| 557 | return 0; |
| 558 | free_tms: |
| 559 | for (i = 0; i < nr_items; i++) { |
| 560 | if (tm_list[i] && !RB_EMPTY_NODE(&tm_list[i]->node)) |
David Sterba | 6074d45 | 2018-03-05 15:03:52 +0100 | [diff] [blame] | 561 | rb_erase(&tm_list[i]->node, &eb->fs_info->tree_mod_log); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 562 | kfree(tm_list[i]); |
| 563 | } |
| 564 | if (locked) |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 565 | write_unlock(&eb->fs_info->tree_mod_log_lock); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 566 | kfree(tm_list); |
| 567 | kfree(tm); |
| 568 | |
| 569 | return ret; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 570 | } |
| 571 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 572 | static inline int |
| 573 | __tree_mod_log_free_eb(struct btrfs_fs_info *fs_info, |
| 574 | struct tree_mod_elem **tm_list, |
| 575 | int nritems) |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 576 | { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 577 | int i, j; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 578 | int ret; |
| 579 | |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 580 | for (i = nritems - 1; i >= 0; i--) { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 581 | ret = __tree_mod_log_insert(fs_info, tm_list[i]); |
| 582 | if (ret) { |
| 583 | for (j = nritems - 1; j > i; j--) |
| 584 | rb_erase(&tm_list[j]->node, |
| 585 | &fs_info->tree_mod_log); |
| 586 | return ret; |
| 587 | } |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 588 | } |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 589 | |
| 590 | return 0; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 591 | } |
| 592 | |
David Sterba | 95b757c | 2018-03-05 15:22:30 +0100 | [diff] [blame] | 593 | static noinline int tree_mod_log_insert_root(struct extent_buffer *old_root, |
| 594 | struct extent_buffer *new_root, int log_removal) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 595 | { |
David Sterba | 95b757c | 2018-03-05 15:22:30 +0100 | [diff] [blame] | 596 | struct btrfs_fs_info *fs_info = old_root->fs_info; |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 597 | struct tree_mod_elem *tm = NULL; |
| 598 | struct tree_mod_elem **tm_list = NULL; |
| 599 | int nritems = 0; |
| 600 | int ret = 0; |
| 601 | int i; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 602 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 603 | if (!tree_mod_need_log(fs_info, NULL)) |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 604 | return 0; |
| 605 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 606 | if (log_removal && btrfs_header_level(old_root) > 0) { |
| 607 | nritems = btrfs_header_nritems(old_root); |
David Sterba | 31e818f | 2015-02-20 18:00:26 +0100 | [diff] [blame] | 608 | tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), |
David Sterba | bcc8e07 | 2017-03-28 14:35:42 +0200 | [diff] [blame] | 609 | GFP_NOFS); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 610 | if (!tm_list) { |
| 611 | ret = -ENOMEM; |
| 612 | goto free_tms; |
| 613 | } |
| 614 | for (i = 0; i < nritems; i++) { |
| 615 | tm_list[i] = alloc_tree_mod_elem(old_root, i, |
David Sterba | bcc8e07 | 2017-03-28 14:35:42 +0200 | [diff] [blame] | 616 | MOD_LOG_KEY_REMOVE_WHILE_FREEING, GFP_NOFS); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 617 | if (!tm_list[i]) { |
| 618 | ret = -ENOMEM; |
| 619 | goto free_tms; |
| 620 | } |
| 621 | } |
| 622 | } |
Jan Schmidt | d9abbf1 | 2013-03-20 13:49:48 +0000 | [diff] [blame] | 623 | |
David Sterba | bcc8e07 | 2017-03-28 14:35:42 +0200 | [diff] [blame] | 624 | tm = kzalloc(sizeof(*tm), GFP_NOFS); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 625 | if (!tm) { |
| 626 | ret = -ENOMEM; |
| 627 | goto free_tms; |
| 628 | } |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 629 | |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 630 | tm->logical = new_root->start; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 631 | tm->old_root.logical = old_root->start; |
| 632 | tm->old_root.level = btrfs_header_level(old_root); |
| 633 | tm->generation = btrfs_header_generation(old_root); |
| 634 | tm->op = MOD_LOG_ROOT_REPLACE; |
| 635 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 636 | if (tree_mod_dont_log(fs_info, NULL)) |
| 637 | goto free_tms; |
| 638 | |
| 639 | if (tm_list) |
| 640 | ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems); |
| 641 | if (!ret) |
| 642 | ret = __tree_mod_log_insert(fs_info, tm); |
| 643 | |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 644 | write_unlock(&fs_info->tree_mod_log_lock); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 645 | if (ret) |
| 646 | goto free_tms; |
| 647 | kfree(tm_list); |
| 648 | |
| 649 | return ret; |
| 650 | |
| 651 | free_tms: |
| 652 | if (tm_list) { |
| 653 | for (i = 0; i < nritems; i++) |
| 654 | kfree(tm_list[i]); |
| 655 | kfree(tm_list); |
| 656 | } |
| 657 | kfree(tm); |
| 658 | |
| 659 | return ret; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 660 | } |
| 661 | |
| 662 | static struct tree_mod_elem * |
| 663 | __tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq, |
| 664 | int smallest) |
| 665 | { |
| 666 | struct rb_root *tm_root; |
| 667 | struct rb_node *node; |
| 668 | struct tree_mod_elem *cur = NULL; |
| 669 | struct tree_mod_elem *found = NULL; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 670 | |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 671 | read_lock(&fs_info->tree_mod_log_lock); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 672 | tm_root = &fs_info->tree_mod_log; |
| 673 | node = tm_root->rb_node; |
| 674 | while (node) { |
Geliang Tang | 6b4df8b | 2016-12-19 22:53:41 +0800 | [diff] [blame] | 675 | cur = rb_entry(node, struct tree_mod_elem, node); |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 676 | if (cur->logical < start) { |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 677 | node = node->rb_left; |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 678 | } else if (cur->logical > start) { |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 679 | node = node->rb_right; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 680 | } else if (cur->seq < min_seq) { |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 681 | node = node->rb_left; |
| 682 | } else if (!smallest) { |
| 683 | /* we want the node with the highest seq */ |
| 684 | if (found) |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 685 | BUG_ON(found->seq > cur->seq); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 686 | found = cur; |
| 687 | node = node->rb_left; |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 688 | } else if (cur->seq > min_seq) { |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 689 | /* we want the node with the smallest seq */ |
| 690 | if (found) |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 691 | BUG_ON(found->seq < cur->seq); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 692 | found = cur; |
| 693 | node = node->rb_right; |
| 694 | } else { |
| 695 | found = cur; |
| 696 | break; |
| 697 | } |
| 698 | } |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 699 | read_unlock(&fs_info->tree_mod_log_lock); |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 700 | |
| 701 | return found; |
| 702 | } |
| 703 | |
| 704 | /* |
| 705 | * this returns the element from the log with the smallest time sequence |
| 706 | * value that's in the log (the oldest log item). any element with a time |
| 707 | * sequence lower than min_seq will be ignored. |
| 708 | */ |
| 709 | static struct tree_mod_elem * |
| 710 | tree_mod_log_search_oldest(struct btrfs_fs_info *fs_info, u64 start, |
| 711 | u64 min_seq) |
| 712 | { |
| 713 | return __tree_mod_log_search(fs_info, start, min_seq, 1); |
| 714 | } |
| 715 | |
| 716 | /* |
| 717 | * this returns the element from the log with the largest time sequence |
| 718 | * value that's in the log (the most recent log item). any element with |
| 719 | * a time sequence lower than min_seq will be ignored. |
| 720 | */ |
| 721 | static struct tree_mod_elem * |
| 722 | tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq) |
| 723 | { |
| 724 | return __tree_mod_log_search(fs_info, start, min_seq, 0); |
| 725 | } |
| 726 | |
David Sterba | ed874f0 | 2019-03-20 14:22:04 +0100 | [diff] [blame] | 727 | static noinline int tree_mod_log_eb_copy(struct extent_buffer *dst, |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 728 | struct extent_buffer *src, unsigned long dst_offset, |
Jan Schmidt | 90f8d62 | 2013-04-13 13:19:53 +0000 | [diff] [blame] | 729 | unsigned long src_offset, int nr_items) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 730 | { |
David Sterba | ed874f0 | 2019-03-20 14:22:04 +0100 | [diff] [blame] | 731 | struct btrfs_fs_info *fs_info = dst->fs_info; |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 732 | int ret = 0; |
| 733 | struct tree_mod_elem **tm_list = NULL; |
| 734 | struct tree_mod_elem **tm_list_add, **tm_list_rem; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 735 | int i; |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 736 | int locked = 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 737 | |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 738 | if (!tree_mod_need_log(fs_info, NULL)) |
| 739 | return 0; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 740 | |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 741 | 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] | 742 | return 0; |
| 743 | |
David Sterba | 31e818f | 2015-02-20 18:00:26 +0100 | [diff] [blame] | 744 | 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] | 745 | GFP_NOFS); |
| 746 | if (!tm_list) |
| 747 | return -ENOMEM; |
| 748 | |
| 749 | tm_list_add = tm_list; |
| 750 | tm_list_rem = tm_list + nr_items; |
| 751 | for (i = 0; i < nr_items; i++) { |
| 752 | tm_list_rem[i] = alloc_tree_mod_elem(src, i + src_offset, |
| 753 | MOD_LOG_KEY_REMOVE, GFP_NOFS); |
| 754 | if (!tm_list_rem[i]) { |
| 755 | ret = -ENOMEM; |
| 756 | goto free_tms; |
| 757 | } |
| 758 | |
| 759 | tm_list_add[i] = alloc_tree_mod_elem(dst, i + dst_offset, |
| 760 | MOD_LOG_KEY_ADD, GFP_NOFS); |
| 761 | if (!tm_list_add[i]) { |
| 762 | ret = -ENOMEM; |
| 763 | goto free_tms; |
| 764 | } |
| 765 | } |
| 766 | |
| 767 | if (tree_mod_dont_log(fs_info, NULL)) |
| 768 | goto free_tms; |
| 769 | locked = 1; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 770 | |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 771 | for (i = 0; i < nr_items; i++) { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 772 | ret = __tree_mod_log_insert(fs_info, tm_list_rem[i]); |
| 773 | if (ret) |
| 774 | goto free_tms; |
| 775 | ret = __tree_mod_log_insert(fs_info, tm_list_add[i]); |
| 776 | if (ret) |
| 777 | goto free_tms; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 778 | } |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 779 | |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 780 | write_unlock(&fs_info->tree_mod_log_lock); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 781 | kfree(tm_list); |
| 782 | |
| 783 | return 0; |
| 784 | |
| 785 | free_tms: |
| 786 | for (i = 0; i < nr_items * 2; i++) { |
| 787 | if (tm_list[i] && !RB_EMPTY_NODE(&tm_list[i]->node)) |
| 788 | rb_erase(&tm_list[i]->node, &fs_info->tree_mod_log); |
| 789 | kfree(tm_list[i]); |
| 790 | } |
| 791 | if (locked) |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 792 | write_unlock(&fs_info->tree_mod_log_lock); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 793 | kfree(tm_list); |
| 794 | |
| 795 | return ret; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 796 | } |
| 797 | |
David Sterba | db7279a | 2018-03-05 15:14:25 +0100 | [diff] [blame] | 798 | static noinline int tree_mod_log_free_eb(struct extent_buffer *eb) |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 799 | { |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 800 | struct tree_mod_elem **tm_list = NULL; |
| 801 | int nritems = 0; |
| 802 | int i; |
| 803 | int ret = 0; |
| 804 | |
| 805 | if (btrfs_header_level(eb) == 0) |
| 806 | return 0; |
| 807 | |
David Sterba | db7279a | 2018-03-05 15:14:25 +0100 | [diff] [blame] | 808 | if (!tree_mod_need_log(eb->fs_info, NULL)) |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 809 | return 0; |
| 810 | |
| 811 | nritems = btrfs_header_nritems(eb); |
David Sterba | 31e818f | 2015-02-20 18:00:26 +0100 | [diff] [blame] | 812 | 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] | 813 | if (!tm_list) |
| 814 | return -ENOMEM; |
| 815 | |
| 816 | for (i = 0; i < nritems; i++) { |
| 817 | tm_list[i] = alloc_tree_mod_elem(eb, i, |
| 818 | MOD_LOG_KEY_REMOVE_WHILE_FREEING, GFP_NOFS); |
| 819 | if (!tm_list[i]) { |
| 820 | ret = -ENOMEM; |
| 821 | goto free_tms; |
| 822 | } |
| 823 | } |
| 824 | |
David Sterba | db7279a | 2018-03-05 15:14:25 +0100 | [diff] [blame] | 825 | if (tree_mod_dont_log(eb->fs_info, eb)) |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 826 | goto free_tms; |
| 827 | |
David Sterba | db7279a | 2018-03-05 15:14:25 +0100 | [diff] [blame] | 828 | ret = __tree_mod_log_free_eb(eb->fs_info, tm_list, nritems); |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 829 | write_unlock(&eb->fs_info->tree_mod_log_lock); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 830 | if (ret) |
| 831 | goto free_tms; |
| 832 | kfree(tm_list); |
| 833 | |
| 834 | return 0; |
| 835 | |
| 836 | free_tms: |
| 837 | for (i = 0; i < nritems; i++) |
| 838 | kfree(tm_list[i]); |
| 839 | kfree(tm_list); |
| 840 | |
| 841 | return ret; |
Jan Schmidt | bd989ba | 2012-05-16 17:18:50 +0200 | [diff] [blame] | 842 | } |
| 843 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 844 | /* |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 845 | * check if the tree block can be shared by multiple trees |
| 846 | */ |
| 847 | int btrfs_block_can_be_shared(struct btrfs_root *root, |
| 848 | struct extent_buffer *buf) |
| 849 | { |
| 850 | /* |
Nicholas D Steeves | 0132761 | 2016-05-19 21:18:45 -0400 | [diff] [blame] | 851 | * Tree blocks not in reference counted trees and tree roots |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 852 | * are never shared. If a block was allocated after the last |
| 853 | * snapshot and the block was not allocated by tree relocation, |
| 854 | * we know the block is not shared. |
| 855 | */ |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 856 | if (test_bit(BTRFS_ROOT_REF_COWS, &root->state) && |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 857 | buf != root->node && buf != root->commit_root && |
| 858 | (btrfs_header_generation(buf) <= |
| 859 | btrfs_root_last_snapshot(&root->root_item) || |
| 860 | btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC))) |
| 861 | return 1; |
Nikolay Borisov | a79865c | 2018-06-21 09:45:00 +0300 | [diff] [blame] | 862 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 863 | return 0; |
| 864 | } |
| 865 | |
| 866 | static noinline int update_ref_for_cow(struct btrfs_trans_handle *trans, |
| 867 | struct btrfs_root *root, |
| 868 | struct extent_buffer *buf, |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 869 | struct extent_buffer *cow, |
| 870 | int *last_ref) |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 871 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 872 | struct btrfs_fs_info *fs_info = root->fs_info; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 873 | u64 refs; |
| 874 | u64 owner; |
| 875 | u64 flags; |
| 876 | u64 new_flags = 0; |
| 877 | int ret; |
| 878 | |
| 879 | /* |
| 880 | * Backrefs update rules: |
| 881 | * |
| 882 | * Always use full backrefs for extent pointers in tree block |
| 883 | * allocated by tree relocation. |
| 884 | * |
| 885 | * If a shared tree block is no longer referenced by its owner |
| 886 | * tree (btrfs_header_owner(buf) == root->root_key.objectid), |
| 887 | * use full backrefs for extent pointers in tree block. |
| 888 | * |
| 889 | * If a tree block is been relocating |
| 890 | * (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID), |
| 891 | * use full backrefs for extent pointers in tree block. |
| 892 | * The reason for this is some operations (such as drop tree) |
| 893 | * are only allowed for blocks use full backrefs. |
| 894 | */ |
| 895 | |
| 896 | if (btrfs_block_can_be_shared(root, buf)) { |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 897 | ret = btrfs_lookup_extent_info(trans, fs_info, buf->start, |
Josef Bacik | 3173a18 | 2013-03-07 14:22:04 -0500 | [diff] [blame] | 898 | btrfs_header_level(buf), 1, |
| 899 | &refs, &flags); |
Mark Fasheh | be1a556 | 2011-08-08 13:20:18 -0700 | [diff] [blame] | 900 | if (ret) |
| 901 | return ret; |
Mark Fasheh | e5df957 | 2011-08-29 14:17:04 -0700 | [diff] [blame] | 902 | if (refs == 0) { |
| 903 | ret = -EROFS; |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 904 | btrfs_handle_fs_error(fs_info, ret, NULL); |
Mark Fasheh | e5df957 | 2011-08-29 14:17:04 -0700 | [diff] [blame] | 905 | return ret; |
| 906 | } |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 907 | } else { |
| 908 | refs = 1; |
| 909 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID || |
| 910 | btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV) |
| 911 | flags = BTRFS_BLOCK_FLAG_FULL_BACKREF; |
| 912 | else |
| 913 | flags = 0; |
| 914 | } |
| 915 | |
| 916 | owner = btrfs_header_owner(buf); |
| 917 | BUG_ON(owner == BTRFS_TREE_RELOC_OBJECTID && |
| 918 | !(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)); |
| 919 | |
| 920 | if (refs > 1) { |
| 921 | if ((owner == root->root_key.objectid || |
| 922 | root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) && |
| 923 | !(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) { |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 924 | ret = btrfs_inc_ref(trans, root, buf, 1); |
Jeff Mahoney | 692826b | 2017-11-21 13:58:49 -0500 | [diff] [blame] | 925 | if (ret) |
| 926 | return ret; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 927 | |
| 928 | if (root->root_key.objectid == |
| 929 | BTRFS_TREE_RELOC_OBJECTID) { |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 930 | ret = btrfs_dec_ref(trans, root, buf, 0); |
Jeff Mahoney | 692826b | 2017-11-21 13:58:49 -0500 | [diff] [blame] | 931 | if (ret) |
| 932 | return ret; |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 933 | ret = btrfs_inc_ref(trans, root, cow, 1); |
Jeff Mahoney | 692826b | 2017-11-21 13:58:49 -0500 | [diff] [blame] | 934 | if (ret) |
| 935 | return ret; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 936 | } |
| 937 | new_flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF; |
| 938 | } else { |
| 939 | |
| 940 | if (root->root_key.objectid == |
| 941 | BTRFS_TREE_RELOC_OBJECTID) |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 942 | ret = btrfs_inc_ref(trans, root, cow, 1); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 943 | else |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 944 | ret = btrfs_inc_ref(trans, root, cow, 0); |
Jeff Mahoney | 692826b | 2017-11-21 13:58:49 -0500 | [diff] [blame] | 945 | if (ret) |
| 946 | return ret; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 947 | } |
| 948 | if (new_flags != 0) { |
Josef Bacik | b1c79e0 | 2013-05-09 13:49:30 -0400 | [diff] [blame] | 949 | int level = btrfs_header_level(buf); |
| 950 | |
David Sterba | f5c8daa | 2019-03-20 11:43:36 +0100 | [diff] [blame^] | 951 | ret = btrfs_set_disk_extent_flags(trans, |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 952 | buf->start, |
| 953 | buf->len, |
Josef Bacik | b1c79e0 | 2013-05-09 13:49:30 -0400 | [diff] [blame] | 954 | new_flags, level, 0); |
Mark Fasheh | be1a556 | 2011-08-08 13:20:18 -0700 | [diff] [blame] | 955 | if (ret) |
| 956 | return ret; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 957 | } |
| 958 | } else { |
| 959 | if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) { |
| 960 | if (root->root_key.objectid == |
| 961 | BTRFS_TREE_RELOC_OBJECTID) |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 962 | ret = btrfs_inc_ref(trans, root, cow, 1); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 963 | else |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 964 | ret = btrfs_inc_ref(trans, root, cow, 0); |
Jeff Mahoney | 692826b | 2017-11-21 13:58:49 -0500 | [diff] [blame] | 965 | if (ret) |
| 966 | return ret; |
Josef Bacik | e339a6b | 2014-07-02 10:54:25 -0700 | [diff] [blame] | 967 | ret = btrfs_dec_ref(trans, root, buf, 1); |
Jeff Mahoney | 692826b | 2017-11-21 13:58:49 -0500 | [diff] [blame] | 968 | if (ret) |
| 969 | return ret; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 970 | } |
David Sterba | 6a884d7d | 2019-03-20 14:30:02 +0100 | [diff] [blame] | 971 | btrfs_clean_tree_block(buf); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 972 | *last_ref = 1; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 973 | } |
| 974 | return 0; |
| 975 | } |
| 976 | |
Filipe Manana | a627947 | 2019-01-25 11:48:51 +0000 | [diff] [blame] | 977 | static struct extent_buffer *alloc_tree_block_no_bg_flush( |
| 978 | struct btrfs_trans_handle *trans, |
| 979 | struct btrfs_root *root, |
| 980 | u64 parent_start, |
| 981 | const struct btrfs_disk_key *disk_key, |
| 982 | int level, |
| 983 | u64 hint, |
| 984 | u64 empty_size) |
| 985 | { |
| 986 | struct btrfs_fs_info *fs_info = root->fs_info; |
| 987 | struct extent_buffer *ret; |
| 988 | |
| 989 | /* |
| 990 | * If we are COWing a node/leaf from the extent, chunk, device or free |
| 991 | * space trees, make sure that we do not finish block group creation of |
| 992 | * pending block groups. We do this to avoid a deadlock. |
| 993 | * COWing can result in allocation of a new chunk, and flushing pending |
| 994 | * block groups (btrfs_create_pending_block_groups()) can be triggered |
| 995 | * when finishing allocation of a new chunk. Creation of a pending block |
| 996 | * group modifies the extent, chunk, device and free space trees, |
| 997 | * therefore we could deadlock with ourselves since we are holding a |
| 998 | * lock on an extent buffer that btrfs_create_pending_block_groups() may |
| 999 | * try to COW later. |
| 1000 | * For similar reasons, we also need to delay flushing pending block |
| 1001 | * groups when splitting a leaf or node, from one of those trees, since |
| 1002 | * we are holding a write lock on it and its parent or when inserting a |
| 1003 | * new root node for one of those trees. |
| 1004 | */ |
| 1005 | if (root == fs_info->extent_root || |
| 1006 | root == fs_info->chunk_root || |
| 1007 | root == fs_info->dev_root || |
| 1008 | root == fs_info->free_space_root) |
| 1009 | trans->can_flush_pending_bgs = false; |
| 1010 | |
| 1011 | ret = btrfs_alloc_tree_block(trans, root, parent_start, |
| 1012 | root->root_key.objectid, disk_key, level, |
| 1013 | hint, empty_size); |
| 1014 | trans->can_flush_pending_bgs = true; |
| 1015 | |
| 1016 | return ret; |
| 1017 | } |
| 1018 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1019 | /* |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1020 | * does the dirty work in cow of a single block. The parent block (if |
| 1021 | * supplied) is updated to point to the new cow copy. The new buffer is marked |
| 1022 | * dirty and returned locked. If you modify the block it needs to be marked |
| 1023 | * dirty again. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1024 | * |
| 1025 | * search_start -- an allocation hint for the new block |
| 1026 | * |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1027 | * empty_size -- a hint that you plan on doing more cow. This is the size in |
| 1028 | * bytes the allocator should try to find free next to the block it returns. |
| 1029 | * This is just a hint and may be ignored by the allocator. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1030 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1031 | static noinline int __btrfs_cow_block(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1032 | struct btrfs_root *root, |
| 1033 | struct extent_buffer *buf, |
| 1034 | struct extent_buffer *parent, int parent_slot, |
| 1035 | struct extent_buffer **cow_ret, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1036 | u64 search_start, u64 empty_size) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1037 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1038 | struct btrfs_fs_info *fs_info = root->fs_info; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1039 | struct btrfs_disk_key disk_key; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1040 | struct extent_buffer *cow; |
Mark Fasheh | be1a556 | 2011-08-08 13:20:18 -0700 | [diff] [blame] | 1041 | int level, ret; |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1042 | int last_ref = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1043 | int unlock_orig = 0; |
Goldwyn Rodrigues | 0f5053e | 2016-09-22 14:11:34 -0500 | [diff] [blame] | 1044 | u64 parent_start = 0; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1045 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1046 | if (*cow_ret == buf) |
| 1047 | unlock_orig = 1; |
| 1048 | |
Chris Mason | b9447ef8 | 2009-03-09 11:45:38 -0400 | [diff] [blame] | 1049 | btrfs_assert_tree_locked(buf); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1050 | |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 1051 | WARN_ON(test_bit(BTRFS_ROOT_REF_COWS, &root->state) && |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1052 | trans->transid != fs_info->running_transaction->transid); |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 1053 | WARN_ON(test_bit(BTRFS_ROOT_REF_COWS, &root->state) && |
| 1054 | trans->transid != root->last_trans); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1055 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 1056 | level = btrfs_header_level(buf); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 1057 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1058 | if (level == 0) |
| 1059 | btrfs_item_key(buf, &disk_key, 0); |
| 1060 | else |
| 1061 | btrfs_node_key(buf, &disk_key, 0); |
| 1062 | |
Goldwyn Rodrigues | 0f5053e | 2016-09-22 14:11:34 -0500 | [diff] [blame] | 1063 | if ((root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) && parent) |
| 1064 | parent_start = parent->start; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1065 | |
Filipe Manana | a627947 | 2019-01-25 11:48:51 +0000 | [diff] [blame] | 1066 | cow = alloc_tree_block_no_bg_flush(trans, root, parent_start, &disk_key, |
| 1067 | level, search_start, empty_size); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1068 | if (IS_ERR(cow)) |
| 1069 | return PTR_ERR(cow); |
| 1070 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1071 | /* cow is set to blocking by btrfs_init_new_buffer */ |
| 1072 | |
David Sterba | 58e8012 | 2016-11-08 18:30:31 +0100 | [diff] [blame] | 1073 | copy_extent_buffer_full(cow, buf); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 1074 | btrfs_set_header_bytenr(cow, cow->start); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1075 | btrfs_set_header_generation(cow, trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1076 | btrfs_set_header_backref_rev(cow, BTRFS_MIXED_BACKREF_REV); |
| 1077 | btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN | |
| 1078 | BTRFS_HEADER_FLAG_RELOC); |
| 1079 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) |
| 1080 | btrfs_set_header_flag(cow, BTRFS_HEADER_FLAG_RELOC); |
| 1081 | else |
| 1082 | btrfs_set_header_owner(cow, root->root_key.objectid); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1083 | |
Nikolay Borisov | de37aa5 | 2018-10-30 16:43:24 +0200 | [diff] [blame] | 1084 | write_extent_buffer_fsid(cow, fs_info->fs_devices->metadata_uuid); |
Yan Zheng | 2b82032 | 2008-11-17 21:11:30 -0500 | [diff] [blame] | 1085 | |
Mark Fasheh | be1a556 | 2011-08-08 13:20:18 -0700 | [diff] [blame] | 1086 | ret = update_ref_for_cow(trans, root, buf, cow, &last_ref); |
Mark Fasheh | b68dc2a | 2011-08-29 14:30:39 -0700 | [diff] [blame] | 1087 | if (ret) { |
Jeff Mahoney | 6664283 | 2016-06-10 18:19:25 -0400 | [diff] [blame] | 1088 | btrfs_abort_transaction(trans, ret); |
Mark Fasheh | b68dc2a | 2011-08-29 14:30:39 -0700 | [diff] [blame] | 1089 | return ret; |
| 1090 | } |
Zheng Yan | 1a40e23 | 2008-09-26 10:09:34 -0400 | [diff] [blame] | 1091 | |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 1092 | if (test_bit(BTRFS_ROOT_REF_COWS, &root->state)) { |
Josef Bacik | 83d4cfd | 2013-08-30 15:09:51 -0400 | [diff] [blame] | 1093 | ret = btrfs_reloc_cow_block(trans, root, buf, cow); |
Zhaolei | 93314e3 | 2015-08-06 21:56:58 +0800 | [diff] [blame] | 1094 | if (ret) { |
Jeff Mahoney | 6664283 | 2016-06-10 18:19:25 -0400 | [diff] [blame] | 1095 | btrfs_abort_transaction(trans, ret); |
Josef Bacik | 83d4cfd | 2013-08-30 15:09:51 -0400 | [diff] [blame] | 1096 | return ret; |
Zhaolei | 93314e3 | 2015-08-06 21:56:58 +0800 | [diff] [blame] | 1097 | } |
Josef Bacik | 83d4cfd | 2013-08-30 15:09:51 -0400 | [diff] [blame] | 1098 | } |
Yan, Zheng | 3fd0a55 | 2010-05-16 10:49:59 -0400 | [diff] [blame] | 1099 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1100 | if (buf == root->node) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1101 | WARN_ON(parent && parent != buf); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1102 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID || |
| 1103 | btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV) |
| 1104 | parent_start = buf->start; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1105 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1106 | extent_buffer_get(cow); |
David Sterba | d9d19a0 | 2018-03-05 16:35:29 +0100 | [diff] [blame] | 1107 | ret = tree_mod_log_insert_root(root->node, cow, 1); |
| 1108 | BUG_ON(ret < 0); |
Chris Mason | 240f62c | 2011-03-23 14:54:42 -0400 | [diff] [blame] | 1109 | rcu_assign_pointer(root->node, cow); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1110 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1111 | btrfs_free_tree_block(trans, root, buf, parent_start, |
Jan Schmidt | 5581a51 | 2012-05-16 17:04:52 +0200 | [diff] [blame] | 1112 | last_ref); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1113 | free_extent_buffer(buf); |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 1114 | add_root_to_dirty_list(root); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1115 | } else { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1116 | WARN_ON(trans->transid != btrfs_header_generation(parent)); |
David Sterba | e09c2ef | 2018-03-05 15:09:03 +0100 | [diff] [blame] | 1117 | tree_mod_log_insert_key(parent, parent_slot, |
Josef Bacik | c8cc634 | 2013-07-01 16:18:19 -0400 | [diff] [blame] | 1118 | MOD_LOG_KEY_REPLACE, GFP_NOFS); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1119 | btrfs_set_node_blockptr(parent, parent_slot, |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 1120 | cow->start); |
Chris Mason | 74493f7 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 1121 | btrfs_set_node_ptr_generation(parent, parent_slot, |
| 1122 | trans->transid); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1123 | btrfs_mark_buffer_dirty(parent); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 1124 | if (last_ref) { |
David Sterba | db7279a | 2018-03-05 15:14:25 +0100 | [diff] [blame] | 1125 | ret = tree_mod_log_free_eb(buf); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 1126 | if (ret) { |
Jeff Mahoney | 6664283 | 2016-06-10 18:19:25 -0400 | [diff] [blame] | 1127 | btrfs_abort_transaction(trans, ret); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 1128 | return ret; |
| 1129 | } |
| 1130 | } |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1131 | btrfs_free_tree_block(trans, root, buf, parent_start, |
Jan Schmidt | 5581a51 | 2012-05-16 17:04:52 +0200 | [diff] [blame] | 1132 | last_ref); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1133 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1134 | if (unlock_orig) |
| 1135 | btrfs_tree_unlock(buf); |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 1136 | free_extent_buffer_stale(buf); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1137 | btrfs_mark_buffer_dirty(cow); |
| 1138 | *cow_ret = cow; |
| 1139 | return 0; |
| 1140 | } |
| 1141 | |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1142 | /* |
| 1143 | * returns the logical address of the oldest predecessor of the given root. |
| 1144 | * entries older than time_seq are ignored. |
| 1145 | */ |
David Sterba | bcd24da | 2018-03-05 15:33:18 +0100 | [diff] [blame] | 1146 | static struct tree_mod_elem *__tree_mod_log_oldest_root( |
| 1147 | struct extent_buffer *eb_root, u64 time_seq) |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1148 | { |
| 1149 | struct tree_mod_elem *tm; |
| 1150 | struct tree_mod_elem *found = NULL; |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1151 | u64 root_logical = eb_root->start; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1152 | int looped = 0; |
| 1153 | |
| 1154 | if (!time_seq) |
Stefan Behrens | 35a3621 | 2013-08-14 18:12:25 +0200 | [diff] [blame] | 1155 | return NULL; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1156 | |
| 1157 | /* |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 1158 | * the very last operation that's logged for a root is the |
| 1159 | * replacement operation (if it is replaced at all). this has |
| 1160 | * the logical address of the *new* root, making it the very |
| 1161 | * first operation that's logged for this root. |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1162 | */ |
| 1163 | while (1) { |
David Sterba | bcd24da | 2018-03-05 15:33:18 +0100 | [diff] [blame] | 1164 | tm = tree_mod_log_search_oldest(eb_root->fs_info, root_logical, |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1165 | time_seq); |
| 1166 | if (!looped && !tm) |
Stefan Behrens | 35a3621 | 2013-08-14 18:12:25 +0200 | [diff] [blame] | 1167 | return NULL; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1168 | /* |
Jan Schmidt | 28da9fb | 2012-06-21 10:59:13 +0200 | [diff] [blame] | 1169 | * if there are no tree operation for the oldest root, we simply |
| 1170 | * return it. this should only happen if that (old) root is at |
| 1171 | * level 0. |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1172 | */ |
Jan Schmidt | 28da9fb | 2012-06-21 10:59:13 +0200 | [diff] [blame] | 1173 | if (!tm) |
| 1174 | break; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1175 | |
Jan Schmidt | 28da9fb | 2012-06-21 10:59:13 +0200 | [diff] [blame] | 1176 | /* |
| 1177 | * if there's an operation that's not a root replacement, we |
| 1178 | * found the oldest version of our root. normally, we'll find a |
| 1179 | * MOD_LOG_KEY_REMOVE_WHILE_FREEING operation here. |
| 1180 | */ |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1181 | if (tm->op != MOD_LOG_ROOT_REPLACE) |
| 1182 | break; |
| 1183 | |
| 1184 | found = tm; |
| 1185 | root_logical = tm->old_root.logical; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1186 | looped = 1; |
| 1187 | } |
| 1188 | |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1189 | /* if there's no old root to return, return what we found instead */ |
| 1190 | if (!found) |
| 1191 | found = tm; |
| 1192 | |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1193 | return found; |
| 1194 | } |
| 1195 | |
| 1196 | /* |
| 1197 | * 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] | 1198 | * previous operations will be rewound (until we reach something older than |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1199 | * time_seq). |
| 1200 | */ |
| 1201 | static void |
Josef Bacik | f1ca7e98 | 2013-06-29 23:15:19 -0400 | [diff] [blame] | 1202 | __tree_mod_log_rewind(struct btrfs_fs_info *fs_info, struct extent_buffer *eb, |
| 1203 | u64 time_seq, struct tree_mod_elem *first_tm) |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1204 | { |
| 1205 | u32 n; |
| 1206 | struct rb_node *next; |
| 1207 | struct tree_mod_elem *tm = first_tm; |
| 1208 | unsigned long o_dst; |
| 1209 | unsigned long o_src; |
| 1210 | unsigned long p_size = sizeof(struct btrfs_key_ptr); |
| 1211 | |
| 1212 | n = btrfs_header_nritems(eb); |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 1213 | read_lock(&fs_info->tree_mod_log_lock); |
Jan Schmidt | 097b8a7 | 2012-06-21 11:08:04 +0200 | [diff] [blame] | 1214 | while (tm && tm->seq >= time_seq) { |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1215 | /* |
| 1216 | * all the operations are recorded with the operator used for |
| 1217 | * the modification. as we're going backwards, we do the |
| 1218 | * opposite of each operation here. |
| 1219 | */ |
| 1220 | switch (tm->op) { |
| 1221 | case MOD_LOG_KEY_REMOVE_WHILE_FREEING: |
| 1222 | BUG_ON(tm->slot < n); |
Eric Sandeen | 1c697d4 | 2013-01-31 00:54:56 +0000 | [diff] [blame] | 1223 | /* Fallthrough */ |
Liu Bo | 95c80bb | 2012-10-19 09:50:52 +0000 | [diff] [blame] | 1224 | case MOD_LOG_KEY_REMOVE_WHILE_MOVING: |
Chris Mason | 4c3e696 | 2012-12-18 15:43:18 -0500 | [diff] [blame] | 1225 | case MOD_LOG_KEY_REMOVE: |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1226 | btrfs_set_node_key(eb, &tm->key, tm->slot); |
| 1227 | btrfs_set_node_blockptr(eb, tm->slot, tm->blockptr); |
| 1228 | btrfs_set_node_ptr_generation(eb, tm->slot, |
| 1229 | tm->generation); |
Chris Mason | 4c3e696 | 2012-12-18 15:43:18 -0500 | [diff] [blame] | 1230 | n++; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1231 | break; |
| 1232 | case MOD_LOG_KEY_REPLACE: |
| 1233 | BUG_ON(tm->slot >= n); |
| 1234 | btrfs_set_node_key(eb, &tm->key, tm->slot); |
| 1235 | btrfs_set_node_blockptr(eb, tm->slot, tm->blockptr); |
| 1236 | btrfs_set_node_ptr_generation(eb, tm->slot, |
| 1237 | tm->generation); |
| 1238 | break; |
| 1239 | case MOD_LOG_KEY_ADD: |
Jan Schmidt | 19956c7 | 2012-06-22 14:52:13 +0200 | [diff] [blame] | 1240 | /* if a move operation is needed it's in the log */ |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1241 | n--; |
| 1242 | break; |
| 1243 | case MOD_LOG_MOVE_KEYS: |
Jan Schmidt | c319310 | 2012-05-31 19:24:36 +0200 | [diff] [blame] | 1244 | o_dst = btrfs_node_key_ptr_offset(tm->slot); |
| 1245 | o_src = btrfs_node_key_ptr_offset(tm->move.dst_slot); |
| 1246 | memmove_extent_buffer(eb, o_dst, o_src, |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1247 | tm->move.nr_items * p_size); |
| 1248 | break; |
| 1249 | case MOD_LOG_ROOT_REPLACE: |
| 1250 | /* |
| 1251 | * this operation is special. for roots, this must be |
| 1252 | * handled explicitly before rewinding. |
| 1253 | * for non-roots, this operation may exist if the node |
| 1254 | * was a root: root A -> child B; then A gets empty and |
| 1255 | * B is promoted to the new root. in the mod log, we'll |
| 1256 | * have a root-replace operation for B, a tree block |
| 1257 | * that is no root. we simply ignore that operation. |
| 1258 | */ |
| 1259 | break; |
| 1260 | } |
| 1261 | next = rb_next(&tm->node); |
| 1262 | if (!next) |
| 1263 | break; |
Geliang Tang | 6b4df8b | 2016-12-19 22:53:41 +0800 | [diff] [blame] | 1264 | tm = rb_entry(next, struct tree_mod_elem, node); |
Chandan Rajendra | 298cfd3 | 2016-01-21 15:55:59 +0530 | [diff] [blame] | 1265 | if (tm->logical != first_tm->logical) |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1266 | break; |
| 1267 | } |
David Sterba | b1a09f1 | 2018-03-05 15:43:41 +0100 | [diff] [blame] | 1268 | read_unlock(&fs_info->tree_mod_log_lock); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1269 | btrfs_set_header_nritems(eb, n); |
| 1270 | } |
| 1271 | |
Jan Schmidt | 47fb091 | 2013-04-13 13:19:55 +0000 | [diff] [blame] | 1272 | /* |
Nicholas D Steeves | 0132761 | 2016-05-19 21:18:45 -0400 | [diff] [blame] | 1273 | * 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] | 1274 | * is returned. If rewind operations happen, a fresh buffer is returned. The |
| 1275 | * returned buffer is always read-locked. If the returned buffer is not the |
| 1276 | * input buffer, the lock on the input buffer is released and the input buffer |
| 1277 | * is freed (its refcount is decremented). |
| 1278 | */ |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1279 | static struct extent_buffer * |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1280 | tree_mod_log_rewind(struct btrfs_fs_info *fs_info, struct btrfs_path *path, |
| 1281 | struct extent_buffer *eb, u64 time_seq) |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1282 | { |
| 1283 | struct extent_buffer *eb_rewin; |
| 1284 | struct tree_mod_elem *tm; |
| 1285 | |
| 1286 | if (!time_seq) |
| 1287 | return eb; |
| 1288 | |
| 1289 | if (btrfs_header_level(eb) == 0) |
| 1290 | return eb; |
| 1291 | |
| 1292 | tm = tree_mod_log_search(fs_info, eb->start, time_seq); |
| 1293 | if (!tm) |
| 1294 | return eb; |
| 1295 | |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1296 | btrfs_set_path_blocking(path); |
David Sterba | 300aa89 | 2018-04-04 02:00:17 +0200 | [diff] [blame] | 1297 | btrfs_set_lock_blocking_read(eb); |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1298 | |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1299 | if (tm->op == MOD_LOG_KEY_REMOVE_WHILE_FREEING) { |
| 1300 | BUG_ON(tm->slot != 0); |
Jeff Mahoney | da17066 | 2016-06-15 09:22:56 -0400 | [diff] [blame] | 1301 | eb_rewin = alloc_dummy_extent_buffer(fs_info, eb->start); |
Josef Bacik | db7f343 | 2013-08-07 14:54:37 -0400 | [diff] [blame] | 1302 | if (!eb_rewin) { |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1303 | btrfs_tree_read_unlock_blocking(eb); |
Josef Bacik | db7f343 | 2013-08-07 14:54:37 -0400 | [diff] [blame] | 1304 | free_extent_buffer(eb); |
| 1305 | return NULL; |
| 1306 | } |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1307 | btrfs_set_header_bytenr(eb_rewin, eb->start); |
| 1308 | btrfs_set_header_backref_rev(eb_rewin, |
| 1309 | btrfs_header_backref_rev(eb)); |
| 1310 | btrfs_set_header_owner(eb_rewin, btrfs_header_owner(eb)); |
Jan Schmidt | c319310 | 2012-05-31 19:24:36 +0200 | [diff] [blame] | 1311 | btrfs_set_header_level(eb_rewin, btrfs_header_level(eb)); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1312 | } else { |
| 1313 | eb_rewin = btrfs_clone_extent_buffer(eb); |
Josef Bacik | db7f343 | 2013-08-07 14:54:37 -0400 | [diff] [blame] | 1314 | if (!eb_rewin) { |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1315 | btrfs_tree_read_unlock_blocking(eb); |
Josef Bacik | db7f343 | 2013-08-07 14:54:37 -0400 | [diff] [blame] | 1316 | free_extent_buffer(eb); |
| 1317 | return NULL; |
| 1318 | } |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1319 | } |
| 1320 | |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1321 | btrfs_tree_read_unlock_blocking(eb); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1322 | free_extent_buffer(eb); |
| 1323 | |
Jan Schmidt | 47fb091 | 2013-04-13 13:19:55 +0000 | [diff] [blame] | 1324 | btrfs_tree_read_lock(eb_rewin); |
Josef Bacik | f1ca7e98 | 2013-06-29 23:15:19 -0400 | [diff] [blame] | 1325 | __tree_mod_log_rewind(fs_info, eb_rewin, time_seq, tm); |
Jan Schmidt | 57911b8 | 2012-10-19 09:22:03 +0200 | [diff] [blame] | 1326 | WARN_ON(btrfs_header_nritems(eb_rewin) > |
Jeff Mahoney | da17066 | 2016-06-15 09:22:56 -0400 | [diff] [blame] | 1327 | BTRFS_NODEPTRS_PER_BLOCK(fs_info)); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1328 | |
| 1329 | return eb_rewin; |
| 1330 | } |
| 1331 | |
Jan Schmidt | 8ba97a1 | 2012-06-04 16:54:57 +0200 | [diff] [blame] | 1332 | /* |
| 1333 | * get_old_root() rewinds the state of @root's root node to the given @time_seq |
| 1334 | * value. If there are no changes, the current root->root_node is returned. If |
| 1335 | * anything changed in between, there's a fresh buffer allocated on which the |
| 1336 | * rewind operations are done. In any case, the returned buffer is read locked. |
| 1337 | * Returns NULL on error (with no locks held). |
| 1338 | */ |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1339 | static inline struct extent_buffer * |
| 1340 | get_old_root(struct btrfs_root *root, u64 time_seq) |
| 1341 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1342 | struct btrfs_fs_info *fs_info = root->fs_info; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1343 | struct tree_mod_elem *tm; |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1344 | struct extent_buffer *eb = NULL; |
| 1345 | struct extent_buffer *eb_root; |
Liu Bo | 7bfdcf7 | 2012-10-25 07:30:19 -0600 | [diff] [blame] | 1346 | struct extent_buffer *old; |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1347 | struct tree_mod_root *old_root = NULL; |
Chris Mason | 4325edd | 2012-06-15 20:02:02 -0400 | [diff] [blame] | 1348 | u64 old_generation = 0; |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1349 | u64 logical; |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 1350 | int level; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1351 | |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1352 | eb_root = btrfs_read_lock_root_node(root); |
David Sterba | bcd24da | 2018-03-05 15:33:18 +0100 | [diff] [blame] | 1353 | tm = __tree_mod_log_oldest_root(eb_root, time_seq); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1354 | if (!tm) |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1355 | return eb_root; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1356 | |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1357 | if (tm->op == MOD_LOG_ROOT_REPLACE) { |
| 1358 | old_root = &tm->old_root; |
| 1359 | old_generation = tm->generation; |
| 1360 | logical = old_root->logical; |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 1361 | level = old_root->level; |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1362 | } else { |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1363 | logical = eb_root->start; |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 1364 | level = btrfs_header_level(eb_root); |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1365 | } |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1366 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1367 | tm = tree_mod_log_search(fs_info, logical, time_seq); |
Jan Schmidt | 834328a | 2012-10-23 11:27:33 +0200 | [diff] [blame] | 1368 | if (old_root && tm && tm->op != MOD_LOG_KEY_REMOVE_WHILE_FREEING) { |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1369 | btrfs_tree_read_unlock(eb_root); |
| 1370 | free_extent_buffer(eb_root); |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 1371 | old = read_tree_block(fs_info, logical, 0, level, NULL); |
Liu Bo | 64c043d | 2015-05-25 17:30:15 +0800 | [diff] [blame] | 1372 | if (WARN_ON(IS_ERR(old) || !extent_buffer_uptodate(old))) { |
| 1373 | if (!IS_ERR(old)) |
| 1374 | free_extent_buffer(old); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1375 | btrfs_warn(fs_info, |
| 1376 | "failed to read tree block %llu from get_old_root", |
| 1377 | logical); |
Jan Schmidt | 834328a | 2012-10-23 11:27:33 +0200 | [diff] [blame] | 1378 | } else { |
Liu Bo | 7bfdcf7 | 2012-10-25 07:30:19 -0600 | [diff] [blame] | 1379 | eb = btrfs_clone_extent_buffer(old); |
| 1380 | free_extent_buffer(old); |
Jan Schmidt | 834328a | 2012-10-23 11:27:33 +0200 | [diff] [blame] | 1381 | } |
| 1382 | } else if (old_root) { |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1383 | btrfs_tree_read_unlock(eb_root); |
| 1384 | free_extent_buffer(eb_root); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1385 | eb = alloc_dummy_extent_buffer(fs_info, logical); |
Jan Schmidt | 834328a | 2012-10-23 11:27:33 +0200 | [diff] [blame] | 1386 | } else { |
David Sterba | 300aa89 | 2018-04-04 02:00:17 +0200 | [diff] [blame] | 1387 | btrfs_set_lock_blocking_read(eb_root); |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1388 | eb = btrfs_clone_extent_buffer(eb_root); |
Josef Bacik | 9ec7267 | 2013-08-07 16:57:23 -0400 | [diff] [blame] | 1389 | btrfs_tree_read_unlock_blocking(eb_root); |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1390 | free_extent_buffer(eb_root); |
Jan Schmidt | 834328a | 2012-10-23 11:27:33 +0200 | [diff] [blame] | 1391 | } |
| 1392 | |
Jan Schmidt | 8ba97a1 | 2012-06-04 16:54:57 +0200 | [diff] [blame] | 1393 | if (!eb) |
| 1394 | return NULL; |
| 1395 | btrfs_tree_read_lock(eb); |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1396 | if (old_root) { |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1397 | btrfs_set_header_bytenr(eb, eb->start); |
| 1398 | btrfs_set_header_backref_rev(eb, BTRFS_MIXED_BACKREF_REV); |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1399 | btrfs_set_header_owner(eb, btrfs_header_owner(eb_root)); |
Jan Schmidt | a95236d | 2012-06-05 16:41:24 +0200 | [diff] [blame] | 1400 | btrfs_set_header_level(eb, old_root->level); |
| 1401 | btrfs_set_header_generation(eb, old_generation); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1402 | } |
Jan Schmidt | 28da9fb | 2012-06-21 10:59:13 +0200 | [diff] [blame] | 1403 | if (tm) |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1404 | __tree_mod_log_rewind(fs_info, eb, time_seq, tm); |
Jan Schmidt | 28da9fb | 2012-06-21 10:59:13 +0200 | [diff] [blame] | 1405 | else |
| 1406 | WARN_ON(btrfs_header_level(eb) != 0); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1407 | WARN_ON(btrfs_header_nritems(eb) > BTRFS_NODEPTRS_PER_BLOCK(fs_info)); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 1408 | |
| 1409 | return eb; |
| 1410 | } |
| 1411 | |
Jan Schmidt | 5b6602e | 2012-10-23 11:28:27 +0200 | [diff] [blame] | 1412 | int btrfs_old_root_level(struct btrfs_root *root, u64 time_seq) |
| 1413 | { |
| 1414 | struct tree_mod_elem *tm; |
| 1415 | int level; |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1416 | struct extent_buffer *eb_root = btrfs_root_node(root); |
Jan Schmidt | 5b6602e | 2012-10-23 11:28:27 +0200 | [diff] [blame] | 1417 | |
David Sterba | bcd24da | 2018-03-05 15:33:18 +0100 | [diff] [blame] | 1418 | tm = __tree_mod_log_oldest_root(eb_root, time_seq); |
Jan Schmidt | 5b6602e | 2012-10-23 11:28:27 +0200 | [diff] [blame] | 1419 | if (tm && tm->op == MOD_LOG_ROOT_REPLACE) { |
| 1420 | level = tm->old_root.level; |
| 1421 | } else { |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1422 | level = btrfs_header_level(eb_root); |
Jan Schmidt | 5b6602e | 2012-10-23 11:28:27 +0200 | [diff] [blame] | 1423 | } |
Jan Schmidt | 30b0463 | 2013-04-13 13:19:54 +0000 | [diff] [blame] | 1424 | free_extent_buffer(eb_root); |
Jan Schmidt | 5b6602e | 2012-10-23 11:28:27 +0200 | [diff] [blame] | 1425 | |
| 1426 | return level; |
| 1427 | } |
| 1428 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1429 | static inline int should_cow_block(struct btrfs_trans_handle *trans, |
| 1430 | struct btrfs_root *root, |
| 1431 | struct extent_buffer *buf) |
| 1432 | { |
Jeff Mahoney | f5ee5c9 | 2016-06-21 09:52:41 -0400 | [diff] [blame] | 1433 | if (btrfs_is_testing(root->fs_info)) |
Josef Bacik | faa2dbf | 2014-05-07 17:06:09 -0400 | [diff] [blame] | 1434 | return 0; |
David Sterba | fccb84c | 2014-09-29 23:53:21 +0200 | [diff] [blame] | 1435 | |
David Sterba | d198013 | 2018-03-16 02:39:40 +0100 | [diff] [blame] | 1436 | /* Ensure we can see the FORCE_COW bit */ |
| 1437 | smp_mb__before_atomic(); |
Liu Bo | f1ebcc7 | 2011-11-14 20:48:06 -0500 | [diff] [blame] | 1438 | |
| 1439 | /* |
| 1440 | * We do not need to cow a block if |
| 1441 | * 1) this block is not created or changed in this transaction; |
| 1442 | * 2) this block does not belong to TREE_RELOC tree; |
| 1443 | * 3) the root is not forced COW. |
| 1444 | * |
| 1445 | * What is forced COW: |
Nicholas D Steeves | 0132761 | 2016-05-19 21:18:45 -0400 | [diff] [blame] | 1446 | * when we create snapshot during committing the transaction, |
Andrea Gelmini | 52042d8 | 2018-11-28 12:05:13 +0100 | [diff] [blame] | 1447 | * after we've finished copying src root, we must COW the shared |
Liu Bo | f1ebcc7 | 2011-11-14 20:48:06 -0500 | [diff] [blame] | 1448 | * block to ensure the metadata consistency. |
| 1449 | */ |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1450 | if (btrfs_header_generation(buf) == trans->transid && |
| 1451 | !btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN) && |
| 1452 | !(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID && |
Liu Bo | f1ebcc7 | 2011-11-14 20:48:06 -0500 | [diff] [blame] | 1453 | btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC)) && |
Miao Xie | 27cdeb7 | 2014-04-02 19:51:05 +0800 | [diff] [blame] | 1454 | !test_bit(BTRFS_ROOT_FORCE_COW, &root->state)) |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1455 | return 0; |
| 1456 | return 1; |
| 1457 | } |
| 1458 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1459 | /* |
| 1460 | * 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] | 1461 | * 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] | 1462 | * once per transaction, as long as it hasn't been written yet |
| 1463 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1464 | noinline int btrfs_cow_block(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1465 | struct btrfs_root *root, struct extent_buffer *buf, |
| 1466 | struct extent_buffer *parent, int parent_slot, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1467 | struct extent_buffer **cow_ret) |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 1468 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1469 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1470 | u64 search_start; |
Chris Mason | f510cfe | 2007-10-15 16:14:48 -0400 | [diff] [blame] | 1471 | int ret; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 1472 | |
Josef Bacik | 83354f0 | 2018-11-30 11:52:13 -0500 | [diff] [blame] | 1473 | if (test_bit(BTRFS_ROOT_DELETING, &root->state)) |
| 1474 | btrfs_err(fs_info, |
| 1475 | "COW'ing blocks on a fs root that's being dropped"); |
| 1476 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1477 | if (trans->transaction != fs_info->running_transaction) |
Julia Lawall | 31b1a2b | 2012-11-03 10:58:34 +0000 | [diff] [blame] | 1478 | WARN(1, KERN_CRIT "trans %llu running %llu\n", |
Geert Uytterhoeven | c1c9ff7 | 2013-08-20 13:20:07 +0200 | [diff] [blame] | 1479 | trans->transid, |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1480 | fs_info->running_transaction->transid); |
Julia Lawall | 31b1a2b | 2012-11-03 10:58:34 +0000 | [diff] [blame] | 1481 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1482 | if (trans->transid != fs_info->generation) |
Julia Lawall | 31b1a2b | 2012-11-03 10:58:34 +0000 | [diff] [blame] | 1483 | WARN(1, KERN_CRIT "trans %llu running %llu\n", |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1484 | trans->transid, fs_info->generation); |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 1485 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1486 | if (!should_cow_block(trans, root, buf)) { |
Jeff Mahoney | 64c1292 | 2016-06-08 00:36:38 -0400 | [diff] [blame] | 1487 | trans->dirty = true; |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 1488 | *cow_ret = buf; |
| 1489 | return 0; |
| 1490 | } |
Chris Mason | c487685 | 2009-02-04 09:24:25 -0500 | [diff] [blame] | 1491 | |
Byongho Lee | ee22184 | 2015-12-15 01:42:10 +0900 | [diff] [blame] | 1492 | search_start = buf->start & ~((u64)SZ_1G - 1); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1493 | |
| 1494 | if (parent) |
David Sterba | 8bead25 | 2018-04-04 02:03:48 +0200 | [diff] [blame] | 1495 | btrfs_set_lock_blocking_write(parent); |
| 1496 | btrfs_set_lock_blocking_write(buf); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1497 | |
Qu Wenruo | f616f5c | 2019-01-23 15:15:17 +0800 | [diff] [blame] | 1498 | /* |
| 1499 | * Before CoWing this block for later modification, check if it's |
| 1500 | * the subtree root and do the delayed subtree trace if needed. |
| 1501 | * |
| 1502 | * Also We don't care about the error, as it's handled internally. |
| 1503 | */ |
| 1504 | btrfs_qgroup_trace_subtree_after_cow(trans, root, buf); |
Chris Mason | f510cfe | 2007-10-15 16:14:48 -0400 | [diff] [blame] | 1505 | ret = __btrfs_cow_block(trans, root, buf, parent, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1506 | parent_slot, cow_ret, search_start, 0); |
liubo | 1abe9b8 | 2011-03-24 11:18:59 +0000 | [diff] [blame] | 1507 | |
| 1508 | trace_btrfs_cow_block(root, buf, *cow_ret); |
| 1509 | |
Chris Mason | f510cfe | 2007-10-15 16:14:48 -0400 | [diff] [blame] | 1510 | return ret; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1511 | } |
| 1512 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1513 | /* |
| 1514 | * helper function for defrag to decide if two blocks pointed to by a |
| 1515 | * node are actually close by |
| 1516 | */ |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1517 | static int close_blocks(u64 blocknr, u64 other, u32 blocksize) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1518 | { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1519 | if (blocknr < other && other - (blocknr + blocksize) < 32768) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1520 | return 1; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1521 | if (blocknr > other && blocknr - (other + blocksize) < 32768) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1522 | return 1; |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 1523 | return 0; |
| 1524 | } |
| 1525 | |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 1526 | /* |
| 1527 | * compare two keys in a memcmp fashion |
| 1528 | */ |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 1529 | static int comp_keys(const struct btrfs_disk_key *disk, |
| 1530 | const struct btrfs_key *k2) |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 1531 | { |
| 1532 | struct btrfs_key k1; |
| 1533 | |
| 1534 | btrfs_disk_key_to_cpu(&k1, disk); |
| 1535 | |
Diego Calleja | 20736ab | 2009-07-24 11:06:52 -0400 | [diff] [blame] | 1536 | return btrfs_comp_cpu_keys(&k1, k2); |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 1537 | } |
| 1538 | |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 1539 | /* |
| 1540 | * same as comp_keys only with two btrfs_key's |
| 1541 | */ |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 1542 | int btrfs_comp_cpu_keys(const struct btrfs_key *k1, const struct btrfs_key *k2) |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 1543 | { |
| 1544 | if (k1->objectid > k2->objectid) |
| 1545 | return 1; |
| 1546 | if (k1->objectid < k2->objectid) |
| 1547 | return -1; |
| 1548 | if (k1->type > k2->type) |
| 1549 | return 1; |
| 1550 | if (k1->type < k2->type) |
| 1551 | return -1; |
| 1552 | if (k1->offset > k2->offset) |
| 1553 | return 1; |
| 1554 | if (k1->offset < k2->offset) |
| 1555 | return -1; |
| 1556 | return 0; |
| 1557 | } |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 1558 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1559 | /* |
| 1560 | * this is used by the defrag code to go through all the |
| 1561 | * leaves pointed to by a node and reallocate them so that |
| 1562 | * disk order is close to key order |
| 1563 | */ |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1564 | int btrfs_realloc_node(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1565 | struct btrfs_root *root, struct extent_buffer *parent, |
Eric Sandeen | de78b51 | 2013-01-31 18:21:12 +0000 | [diff] [blame] | 1566 | int start_slot, u64 *last_ret, |
Chris Mason | a6b6e75 | 2007-10-15 16:22:39 -0400 | [diff] [blame] | 1567 | struct btrfs_key *progress) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1568 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1569 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1570 | struct extent_buffer *cur; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1571 | u64 blocknr; |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 1572 | u64 gen; |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 1573 | u64 search_start = *last_ret; |
| 1574 | u64 last_block = 0; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1575 | u64 other; |
| 1576 | u32 parent_nritems; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1577 | int end_slot; |
| 1578 | int i; |
| 1579 | int err = 0; |
Chris Mason | f2183bd | 2007-08-10 14:42:37 -0400 | [diff] [blame] | 1580 | int parent_level; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1581 | int uptodate; |
| 1582 | u32 blocksize; |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 1583 | int progress_passed = 0; |
| 1584 | struct btrfs_disk_key disk_key; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1585 | |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 1586 | parent_level = btrfs_header_level(parent); |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 1587 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1588 | WARN_ON(trans->transaction != fs_info->running_transaction); |
| 1589 | WARN_ON(trans->transid != fs_info->generation); |
Chris Mason | 86479a0 | 2007-09-10 19:58:16 -0400 | [diff] [blame] | 1590 | |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1591 | parent_nritems = btrfs_header_nritems(parent); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1592 | blocksize = fs_info->nodesize; |
Filipe Manana | 5dfe2be | 2015-02-23 19:48:52 +0000 | [diff] [blame] | 1593 | end_slot = parent_nritems - 1; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1594 | |
Filipe Manana | 5dfe2be | 2015-02-23 19:48:52 +0000 | [diff] [blame] | 1595 | if (parent_nritems <= 1) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1596 | return 0; |
| 1597 | |
David Sterba | 8bead25 | 2018-04-04 02:03:48 +0200 | [diff] [blame] | 1598 | btrfs_set_lock_blocking_write(parent); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1599 | |
Filipe Manana | 5dfe2be | 2015-02-23 19:48:52 +0000 | [diff] [blame] | 1600 | for (i = start_slot; i <= end_slot; i++) { |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 1601 | struct btrfs_key first_key; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1602 | int close = 1; |
Chris Mason | a6b6e75 | 2007-10-15 16:22:39 -0400 | [diff] [blame] | 1603 | |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 1604 | btrfs_node_key(parent, &disk_key, i); |
| 1605 | if (!progress_passed && comp_keys(&disk_key, progress) < 0) |
| 1606 | continue; |
| 1607 | |
| 1608 | progress_passed = 1; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1609 | blocknr = btrfs_node_blockptr(parent, i); |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 1610 | gen = btrfs_node_ptr_generation(parent, i); |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 1611 | btrfs_node_key_to_cpu(parent, &first_key, i); |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 1612 | if (last_block == 0) |
| 1613 | last_block = blocknr; |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 1614 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1615 | if (i > 0) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1616 | other = btrfs_node_blockptr(parent, i - 1); |
| 1617 | close = close_blocks(blocknr, other, blocksize); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1618 | } |
Filipe Manana | 5dfe2be | 2015-02-23 19:48:52 +0000 | [diff] [blame] | 1619 | if (!close && i < end_slot) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1620 | other = btrfs_node_blockptr(parent, i + 1); |
| 1621 | close = close_blocks(blocknr, other, blocksize); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1622 | } |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 1623 | if (close) { |
| 1624 | last_block = blocknr; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1625 | continue; |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 1626 | } |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1627 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1628 | cur = find_extent_buffer(fs_info, blocknr); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1629 | if (cur) |
Chris Mason | b9fab91 | 2012-05-06 07:23:47 -0400 | [diff] [blame] | 1630 | uptodate = btrfs_buffer_uptodate(cur, gen, 0); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1631 | else |
| 1632 | uptodate = 0; |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 1633 | if (!cur || !uptodate) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1634 | if (!cur) { |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 1635 | cur = read_tree_block(fs_info, blocknr, gen, |
| 1636 | parent_level - 1, |
| 1637 | &first_key); |
Liu Bo | 64c043d | 2015-05-25 17:30:15 +0800 | [diff] [blame] | 1638 | if (IS_ERR(cur)) { |
| 1639 | return PTR_ERR(cur); |
| 1640 | } else if (!extent_buffer_uptodate(cur)) { |
Josef Bacik | 416bc65 | 2013-04-23 14:17:42 -0400 | [diff] [blame] | 1641 | free_extent_buffer(cur); |
Tsutomu Itoh | 97d9a8a | 2011-03-24 06:33:21 +0000 | [diff] [blame] | 1642 | return -EIO; |
Josef Bacik | 416bc65 | 2013-04-23 14:17:42 -0400 | [diff] [blame] | 1643 | } |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1644 | } else if (!uptodate) { |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 1645 | err = btrfs_read_buffer(cur, gen, |
| 1646 | parent_level - 1,&first_key); |
Tsutomu Itoh | 018642a | 2012-05-29 18:10:13 +0900 | [diff] [blame] | 1647 | if (err) { |
| 1648 | free_extent_buffer(cur); |
| 1649 | return err; |
| 1650 | } |
Chris Mason | f2183bd | 2007-08-10 14:42:37 -0400 | [diff] [blame] | 1651 | } |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1652 | } |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 1653 | if (search_start == 0) |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1654 | search_start = last_block; |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 1655 | |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 1656 | btrfs_tree_lock(cur); |
David Sterba | 8bead25 | 2018-04-04 02:03:48 +0200 | [diff] [blame] | 1657 | btrfs_set_lock_blocking_write(cur); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1658 | err = __btrfs_cow_block(trans, root, cur, parent, i, |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 1659 | &cur, search_start, |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1660 | min(16 * blocksize, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1661 | (end_slot - i) * blocksize)); |
Yan | 252c38f | 2007-08-29 09:11:44 -0400 | [diff] [blame] | 1662 | if (err) { |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 1663 | btrfs_tree_unlock(cur); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1664 | free_extent_buffer(cur); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1665 | break; |
Yan | 252c38f | 2007-08-29 09:11:44 -0400 | [diff] [blame] | 1666 | } |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 1667 | search_start = cur->start; |
| 1668 | last_block = cur->start; |
Chris Mason | f2183bd | 2007-08-10 14:42:37 -0400 | [diff] [blame] | 1669 | *last_ret = search_start; |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 1670 | btrfs_tree_unlock(cur); |
| 1671 | free_extent_buffer(cur); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1672 | } |
| 1673 | return err; |
| 1674 | } |
| 1675 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 1676 | /* |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1677 | * search for key in the extent_buffer. The items start at offset p, |
| 1678 | * and they are item_size apart. There are 'max' items in p. |
| 1679 | * |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 1680 | * the slot in the array is returned via slot, and it points to |
| 1681 | * the place where you would insert key if it is not found in |
| 1682 | * the array. |
| 1683 | * |
| 1684 | * slot may point to max if the key is bigger than all of the keys |
| 1685 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 1686 | static noinline int generic_bin_search(struct extent_buffer *eb, |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 1687 | unsigned long p, int item_size, |
| 1688 | const struct btrfs_key *key, |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 1689 | int max, int *slot) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1690 | { |
| 1691 | int low = 0; |
| 1692 | int high = max; |
| 1693 | int mid; |
| 1694 | int ret; |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 1695 | struct btrfs_disk_key *tmp = NULL; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1696 | struct btrfs_disk_key unaligned; |
| 1697 | unsigned long offset; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1698 | char *kaddr = NULL; |
| 1699 | unsigned long map_start = 0; |
| 1700 | unsigned long map_len = 0; |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 1701 | int err; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1702 | |
Liu Bo | 5e24e9a | 2016-06-23 16:32:45 -0700 | [diff] [blame] | 1703 | if (low > high) { |
| 1704 | btrfs_err(eb->fs_info, |
| 1705 | "%s: low (%d) > high (%d) eb %llu owner %llu level %d", |
| 1706 | __func__, low, high, eb->start, |
| 1707 | btrfs_header_owner(eb), btrfs_header_level(eb)); |
| 1708 | return -EINVAL; |
| 1709 | } |
| 1710 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1711 | while (low < high) { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1712 | mid = (low + high) / 2; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1713 | offset = p + mid * item_size; |
| 1714 | |
Chris Mason | a659171 | 2011-07-19 12:04:14 -0400 | [diff] [blame] | 1715 | if (!kaddr || offset < map_start || |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1716 | (offset + sizeof(struct btrfs_disk_key)) > |
| 1717 | map_start + map_len) { |
Chris Mason | 934d375 | 2008-12-08 16:43:10 -0500 | [diff] [blame] | 1718 | |
| 1719 | err = map_private_extent_buffer(eb, offset, |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 1720 | sizeof(struct btrfs_disk_key), |
Chris Mason | a659171 | 2011-07-19 12:04:14 -0400 | [diff] [blame] | 1721 | &kaddr, &map_start, &map_len); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1722 | |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 1723 | if (!err) { |
| 1724 | tmp = (struct btrfs_disk_key *)(kaddr + offset - |
| 1725 | map_start); |
Liu Bo | 415b35a | 2016-06-17 19:16:21 -0700 | [diff] [blame] | 1726 | } else if (err == 1) { |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 1727 | read_extent_buffer(eb, &unaligned, |
| 1728 | offset, sizeof(unaligned)); |
| 1729 | tmp = &unaligned; |
Liu Bo | 415b35a | 2016-06-17 19:16:21 -0700 | [diff] [blame] | 1730 | } else { |
| 1731 | return err; |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 1732 | } |
| 1733 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1734 | } else { |
| 1735 | tmp = (struct btrfs_disk_key *)(kaddr + offset - |
| 1736 | map_start); |
| 1737 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1738 | ret = comp_keys(tmp, key); |
| 1739 | |
| 1740 | if (ret < 0) |
| 1741 | low = mid + 1; |
| 1742 | else if (ret > 0) |
| 1743 | high = mid; |
| 1744 | else { |
| 1745 | *slot = mid; |
| 1746 | return 0; |
| 1747 | } |
| 1748 | } |
| 1749 | *slot = low; |
| 1750 | return 1; |
| 1751 | } |
| 1752 | |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 1753 | /* |
| 1754 | * simple bin_search frontend that does the right thing for |
| 1755 | * leaves vs nodes |
| 1756 | */ |
Nikolay Borisov | a74b35e | 2017-12-08 16:27:43 +0200 | [diff] [blame] | 1757 | int btrfs_bin_search(struct extent_buffer *eb, const struct btrfs_key *key, |
| 1758 | int level, int *slot) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1759 | { |
Wang Sheng-Hui | f775738 | 2012-03-30 15:14:27 +0800 | [diff] [blame] | 1760 | if (level == 0) |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1761 | return generic_bin_search(eb, |
| 1762 | offsetof(struct btrfs_leaf, items), |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 1763 | sizeof(struct btrfs_item), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1764 | key, btrfs_header_nritems(eb), |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 1765 | slot); |
Wang Sheng-Hui | f775738 | 2012-03-30 15:14:27 +0800 | [diff] [blame] | 1766 | else |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1767 | return generic_bin_search(eb, |
| 1768 | offsetof(struct btrfs_node, ptrs), |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 1769 | sizeof(struct btrfs_key_ptr), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1770 | key, btrfs_header_nritems(eb), |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 1771 | slot); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1772 | } |
| 1773 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1774 | static void root_add_used(struct btrfs_root *root, u32 size) |
| 1775 | { |
| 1776 | spin_lock(&root->accounting_lock); |
| 1777 | btrfs_set_root_used(&root->root_item, |
| 1778 | btrfs_root_used(&root->root_item) + size); |
| 1779 | spin_unlock(&root->accounting_lock); |
| 1780 | } |
| 1781 | |
| 1782 | static void root_sub_used(struct btrfs_root *root, u32 size) |
| 1783 | { |
| 1784 | spin_lock(&root->accounting_lock); |
| 1785 | btrfs_set_root_used(&root->root_item, |
| 1786 | btrfs_root_used(&root->root_item) - size); |
| 1787 | spin_unlock(&root->accounting_lock); |
| 1788 | } |
| 1789 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1790 | /* given a node and slot number, this reads the blocks it points to. The |
| 1791 | * extent buffer is returned with a reference taken (but unlocked). |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1792 | */ |
David Sterba | d0d20b0 | 2019-03-20 14:54:01 +0100 | [diff] [blame] | 1793 | static noinline struct extent_buffer *read_node_slot( |
| 1794 | struct extent_buffer *parent, int slot) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1795 | { |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 1796 | int level = btrfs_header_level(parent); |
Josef Bacik | 416bc65 | 2013-04-23 14:17:42 -0400 | [diff] [blame] | 1797 | struct extent_buffer *eb; |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 1798 | struct btrfs_key first_key; |
Josef Bacik | 416bc65 | 2013-04-23 14:17:42 -0400 | [diff] [blame] | 1799 | |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 1800 | if (slot < 0 || slot >= btrfs_header_nritems(parent)) |
| 1801 | return ERR_PTR(-ENOENT); |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 1802 | |
| 1803 | BUG_ON(level == 0); |
| 1804 | |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 1805 | btrfs_node_key_to_cpu(parent, &first_key, slot); |
David Sterba | d0d20b0 | 2019-03-20 14:54:01 +0100 | [diff] [blame] | 1806 | eb = read_tree_block(parent->fs_info, btrfs_node_blockptr(parent, slot), |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 1807 | btrfs_node_ptr_generation(parent, slot), |
| 1808 | level - 1, &first_key); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 1809 | if (!IS_ERR(eb) && !extent_buffer_uptodate(eb)) { |
| 1810 | free_extent_buffer(eb); |
| 1811 | eb = ERR_PTR(-EIO); |
Josef Bacik | 416bc65 | 2013-04-23 14:17:42 -0400 | [diff] [blame] | 1812 | } |
| 1813 | |
| 1814 | return eb; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1815 | } |
| 1816 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1817 | /* |
| 1818 | * node level balancing, used to make sure nodes are in proper order for |
| 1819 | * item deletion. We balance from the top down, so we have to make sure |
| 1820 | * that a deletion won't leave an node completely empty later on. |
| 1821 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 1822 | static noinline int balance_level(struct btrfs_trans_handle *trans, |
Chris Mason | 98ed517 | 2008-01-03 10:01:48 -0500 | [diff] [blame] | 1823 | struct btrfs_root *root, |
| 1824 | struct btrfs_path *path, int level) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1825 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1826 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1827 | struct extent_buffer *right = NULL; |
| 1828 | struct extent_buffer *mid; |
| 1829 | struct extent_buffer *left = NULL; |
| 1830 | struct extent_buffer *parent = NULL; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1831 | int ret = 0; |
| 1832 | int wret; |
| 1833 | int pslot; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1834 | int orig_slot = path->slots[level]; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1835 | u64 orig_ptr; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1836 | |
Liu Bo | 98e6b1e | 2018-09-12 06:06:23 +0800 | [diff] [blame] | 1837 | ASSERT(level > 0); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1838 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1839 | mid = path->nodes[level]; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1840 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 1841 | WARN_ON(path->locks[level] != BTRFS_WRITE_LOCK && |
| 1842 | path->locks[level] != BTRFS_WRITE_LOCK_BLOCKING); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 1843 | WARN_ON(btrfs_header_generation(mid) != trans->transid); |
| 1844 | |
Chris Mason | 1d4f8a0 | 2007-03-13 09:28:32 -0400 | [diff] [blame] | 1845 | orig_ptr = btrfs_node_blockptr(mid, orig_slot); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1846 | |
Li Zefan | a05a9bb | 2011-09-06 16:55:34 +0800 | [diff] [blame] | 1847 | if (level < BTRFS_MAX_LEVEL - 1) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1848 | parent = path->nodes[level + 1]; |
Li Zefan | a05a9bb | 2011-09-06 16:55:34 +0800 | [diff] [blame] | 1849 | pslot = path->slots[level + 1]; |
| 1850 | } |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1851 | |
Chris Mason | 4068947 | 2007-03-17 14:29:23 -0400 | [diff] [blame] | 1852 | /* |
| 1853 | * deal with the case where there is only one pointer in the root |
| 1854 | * by promoting the node below to a root |
| 1855 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1856 | if (!parent) { |
| 1857 | struct extent_buffer *child; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1858 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1859 | if (btrfs_header_nritems(mid) != 1) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1860 | return 0; |
| 1861 | |
| 1862 | /* promote the child to a root */ |
David Sterba | d0d20b0 | 2019-03-20 14:54:01 +0100 | [diff] [blame] | 1863 | child = read_node_slot(mid, 0); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 1864 | if (IS_ERR(child)) { |
| 1865 | ret = PTR_ERR(child); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1866 | btrfs_handle_fs_error(fs_info, ret, NULL); |
Mark Fasheh | 305a26a | 2011-09-01 11:27:57 -0700 | [diff] [blame] | 1867 | goto enospc; |
| 1868 | } |
| 1869 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1870 | btrfs_tree_lock(child); |
David Sterba | 8bead25 | 2018-04-04 02:03:48 +0200 | [diff] [blame] | 1871 | btrfs_set_lock_blocking_write(child); |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1872 | ret = btrfs_cow_block(trans, root, child, mid, 0, &child); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1873 | if (ret) { |
| 1874 | btrfs_tree_unlock(child); |
| 1875 | free_extent_buffer(child); |
| 1876 | goto enospc; |
| 1877 | } |
Yan | 2f375ab | 2008-02-01 14:58:07 -0500 | [diff] [blame] | 1878 | |
David Sterba | d9d19a0 | 2018-03-05 16:35:29 +0100 | [diff] [blame] | 1879 | ret = tree_mod_log_insert_root(root->node, child, 1); |
| 1880 | BUG_ON(ret < 0); |
Chris Mason | 240f62c | 2011-03-23 14:54:42 -0400 | [diff] [blame] | 1881 | rcu_assign_pointer(root->node, child); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1882 | |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 1883 | add_root_to_dirty_list(root); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1884 | btrfs_tree_unlock(child); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1885 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1886 | path->locks[level] = 0; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1887 | path->nodes[level] = NULL; |
David Sterba | 6a884d7d | 2019-03-20 14:30:02 +0100 | [diff] [blame] | 1888 | btrfs_clean_tree_block(mid); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1889 | btrfs_tree_unlock(mid); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1890 | /* once for the path */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1891 | free_extent_buffer(mid); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1892 | |
| 1893 | root_sub_used(root, mid->len); |
Jan Schmidt | 5581a51 | 2012-05-16 17:04:52 +0200 | [diff] [blame] | 1894 | btrfs_free_tree_block(trans, root, mid, 0, 1); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1895 | /* once for the root ptr */ |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 1896 | free_extent_buffer_stale(mid); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1897 | return 0; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1898 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1899 | if (btrfs_header_nritems(mid) > |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1900 | BTRFS_NODEPTRS_PER_BLOCK(fs_info) / 4) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1901 | return 0; |
| 1902 | |
David Sterba | d0d20b0 | 2019-03-20 14:54:01 +0100 | [diff] [blame] | 1903 | left = read_node_slot(parent, pslot - 1); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 1904 | if (IS_ERR(left)) |
| 1905 | left = NULL; |
| 1906 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1907 | if (left) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1908 | btrfs_tree_lock(left); |
David Sterba | 8bead25 | 2018-04-04 02:03:48 +0200 | [diff] [blame] | 1909 | btrfs_set_lock_blocking_write(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1910 | wret = btrfs_cow_block(trans, root, left, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1911 | parent, pslot - 1, &left); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1912 | if (wret) { |
| 1913 | ret = wret; |
| 1914 | goto enospc; |
| 1915 | } |
Chris Mason | 2cc58cf | 2007-08-27 16:49:44 -0400 | [diff] [blame] | 1916 | } |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 1917 | |
David Sterba | d0d20b0 | 2019-03-20 14:54:01 +0100 | [diff] [blame] | 1918 | right = read_node_slot(parent, pslot + 1); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 1919 | if (IS_ERR(right)) |
| 1920 | right = NULL; |
| 1921 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1922 | if (right) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1923 | btrfs_tree_lock(right); |
David Sterba | 8bead25 | 2018-04-04 02:03:48 +0200 | [diff] [blame] | 1924 | btrfs_set_lock_blocking_write(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1925 | wret = btrfs_cow_block(trans, root, right, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1926 | parent, pslot + 1, &right); |
Chris Mason | 2cc58cf | 2007-08-27 16:49:44 -0400 | [diff] [blame] | 1927 | if (wret) { |
| 1928 | ret = wret; |
| 1929 | goto enospc; |
| 1930 | } |
| 1931 | } |
| 1932 | |
| 1933 | /* first, try to make some room in the middle buffer */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1934 | if (left) { |
| 1935 | orig_slot += btrfs_header_nritems(left); |
David Sterba | d30a668 | 2019-03-20 14:16:45 +0100 | [diff] [blame] | 1936 | wret = push_node_left(trans, left, mid, 1); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1937 | if (wret < 0) |
| 1938 | ret = wret; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1939 | } |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1940 | |
| 1941 | /* |
| 1942 | * then try to empty the right most buffer into the middle |
| 1943 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1944 | if (right) { |
David Sterba | d30a668 | 2019-03-20 14:16:45 +0100 | [diff] [blame] | 1945 | wret = push_node_left(trans, mid, right, 1); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1946 | if (wret < 0 && wret != -ENOSPC) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1947 | ret = wret; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1948 | if (btrfs_header_nritems(right) == 0) { |
David Sterba | 6a884d7d | 2019-03-20 14:30:02 +0100 | [diff] [blame] | 1949 | btrfs_clean_tree_block(right); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1950 | btrfs_tree_unlock(right); |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 1951 | del_ptr(root, path, level + 1, pslot + 1); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1952 | root_sub_used(root, right->len); |
Jan Schmidt | 5581a51 | 2012-05-16 17:04:52 +0200 | [diff] [blame] | 1953 | btrfs_free_tree_block(trans, root, right, 0, 1); |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 1954 | free_extent_buffer_stale(right); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1955 | right = NULL; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1956 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1957 | struct btrfs_disk_key right_key; |
| 1958 | btrfs_node_key(right, &right_key, 0); |
David Sterba | 0e82bcf | 2018-03-05 16:16:54 +0100 | [diff] [blame] | 1959 | ret = tree_mod_log_insert_key(parent, pslot + 1, |
| 1960 | MOD_LOG_KEY_REPLACE, GFP_NOFS); |
| 1961 | BUG_ON(ret < 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1962 | btrfs_set_node_key(parent, &right_key, pslot + 1); |
| 1963 | btrfs_mark_buffer_dirty(parent); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1964 | } |
| 1965 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1966 | if (btrfs_header_nritems(mid) == 1) { |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1967 | /* |
| 1968 | * we're not allowed to leave a node with one item in the |
| 1969 | * tree during a delete. A deletion from lower in the tree |
| 1970 | * could try to delete the only pointer in this node. |
| 1971 | * So, pull some keys from the left. |
| 1972 | * There has to be a left pointer at this point because |
| 1973 | * otherwise we would have pulled some pointers from the |
| 1974 | * right |
| 1975 | */ |
Mark Fasheh | 305a26a | 2011-09-01 11:27:57 -0700 | [diff] [blame] | 1976 | if (!left) { |
| 1977 | ret = -EROFS; |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 1978 | btrfs_handle_fs_error(fs_info, ret, NULL); |
Mark Fasheh | 305a26a | 2011-09-01 11:27:57 -0700 | [diff] [blame] | 1979 | goto enospc; |
| 1980 | } |
David Sterba | 55d32ed | 2019-03-20 14:18:06 +0100 | [diff] [blame] | 1981 | wret = balance_node_right(trans, mid, left); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1982 | if (wret < 0) { |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1983 | ret = wret; |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1984 | goto enospc; |
| 1985 | } |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 1986 | if (wret == 1) { |
David Sterba | d30a668 | 2019-03-20 14:16:45 +0100 | [diff] [blame] | 1987 | wret = push_node_left(trans, left, mid, 1); |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 1988 | if (wret < 0) |
| 1989 | ret = wret; |
| 1990 | } |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1991 | BUG_ON(wret == 1); |
| 1992 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1993 | if (btrfs_header_nritems(mid) == 0) { |
David Sterba | 6a884d7d | 2019-03-20 14:30:02 +0100 | [diff] [blame] | 1994 | btrfs_clean_tree_block(mid); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1995 | btrfs_tree_unlock(mid); |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 1996 | del_ptr(root, path, level + 1, pslot); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1997 | root_sub_used(root, mid->len); |
Jan Schmidt | 5581a51 | 2012-05-16 17:04:52 +0200 | [diff] [blame] | 1998 | btrfs_free_tree_block(trans, root, mid, 0, 1); |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 1999 | free_extent_buffer_stale(mid); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 2000 | mid = NULL; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2001 | } else { |
| 2002 | /* update the parent key to reflect our changes */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2003 | struct btrfs_disk_key mid_key; |
| 2004 | btrfs_node_key(mid, &mid_key, 0); |
David Sterba | 0e82bcf | 2018-03-05 16:16:54 +0100 | [diff] [blame] | 2005 | ret = tree_mod_log_insert_key(parent, pslot, |
| 2006 | MOD_LOG_KEY_REPLACE, GFP_NOFS); |
| 2007 | BUG_ON(ret < 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2008 | btrfs_set_node_key(parent, &mid_key, pslot); |
| 2009 | btrfs_mark_buffer_dirty(parent); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2010 | } |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2011 | |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2012 | /* update the path */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2013 | if (left) { |
| 2014 | if (btrfs_header_nritems(left) > orig_slot) { |
| 2015 | extent_buffer_get(left); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2016 | /* left was locked after cow */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2017 | path->nodes[level] = left; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2018 | path->slots[level + 1] -= 1; |
| 2019 | path->slots[level] = orig_slot; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2020 | if (mid) { |
| 2021 | btrfs_tree_unlock(mid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2022 | free_extent_buffer(mid); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2023 | } |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2024 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2025 | orig_slot -= btrfs_header_nritems(left); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2026 | path->slots[level] = orig_slot; |
| 2027 | } |
| 2028 | } |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2029 | /* double check we haven't messed things up */ |
Chris Mason | e20d96d | 2007-03-22 12:13:20 -0400 | [diff] [blame] | 2030 | if (orig_ptr != |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2031 | btrfs_node_blockptr(path->nodes[level], path->slots[level])) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 2032 | BUG(); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2033 | enospc: |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2034 | if (right) { |
| 2035 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2036 | free_extent_buffer(right); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2037 | } |
| 2038 | if (left) { |
| 2039 | if (path->nodes[level] != left) |
| 2040 | btrfs_tree_unlock(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2041 | free_extent_buffer(left); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2042 | } |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2043 | return ret; |
| 2044 | } |
| 2045 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 2046 | /* Node balancing for insertion. Here we only split or push nodes around |
| 2047 | * when they are completely full. This is also done top down, so we |
| 2048 | * have to be pessimistic. |
| 2049 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2050 | static noinline int push_nodes_for_insert(struct btrfs_trans_handle *trans, |
Chris Mason | 98ed517 | 2008-01-03 10:01:48 -0500 | [diff] [blame] | 2051 | struct btrfs_root *root, |
| 2052 | struct btrfs_path *path, int level) |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2053 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2054 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2055 | struct extent_buffer *right = NULL; |
| 2056 | struct extent_buffer *mid; |
| 2057 | struct extent_buffer *left = NULL; |
| 2058 | struct extent_buffer *parent = NULL; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2059 | int ret = 0; |
| 2060 | int wret; |
| 2061 | int pslot; |
| 2062 | int orig_slot = path->slots[level]; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2063 | |
| 2064 | if (level == 0) |
| 2065 | return 1; |
| 2066 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2067 | mid = path->nodes[level]; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 2068 | WARN_ON(btrfs_header_generation(mid) != trans->transid); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2069 | |
Li Zefan | a05a9bb | 2011-09-06 16:55:34 +0800 | [diff] [blame] | 2070 | if (level < BTRFS_MAX_LEVEL - 1) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2071 | parent = path->nodes[level + 1]; |
Li Zefan | a05a9bb | 2011-09-06 16:55:34 +0800 | [diff] [blame] | 2072 | pslot = path->slots[level + 1]; |
| 2073 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2074 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2075 | if (!parent) |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2076 | return 1; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2077 | |
David Sterba | d0d20b0 | 2019-03-20 14:54:01 +0100 | [diff] [blame] | 2078 | left = read_node_slot(parent, pslot - 1); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 2079 | if (IS_ERR(left)) |
| 2080 | left = NULL; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2081 | |
| 2082 | /* first, try to make some room in the middle buffer */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2083 | if (left) { |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2084 | u32 left_nr; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2085 | |
| 2086 | btrfs_tree_lock(left); |
David Sterba | 8bead25 | 2018-04-04 02:03:48 +0200 | [diff] [blame] | 2087 | btrfs_set_lock_blocking_write(left); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2088 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2089 | left_nr = btrfs_header_nritems(left); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2090 | if (left_nr >= BTRFS_NODEPTRS_PER_BLOCK(fs_info) - 1) { |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 2091 | wret = 1; |
| 2092 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2093 | ret = btrfs_cow_block(trans, root, left, parent, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 2094 | pslot - 1, &left); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2095 | if (ret) |
| 2096 | wret = 1; |
| 2097 | else { |
David Sterba | d30a668 | 2019-03-20 14:16:45 +0100 | [diff] [blame] | 2098 | wret = push_node_left(trans, left, mid, 0); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2099 | } |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 2100 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2101 | if (wret < 0) |
| 2102 | ret = wret; |
| 2103 | if (wret == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2104 | struct btrfs_disk_key disk_key; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2105 | orig_slot += left_nr; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2106 | btrfs_node_key(mid, &disk_key, 0); |
David Sterba | 0e82bcf | 2018-03-05 16:16:54 +0100 | [diff] [blame] | 2107 | ret = tree_mod_log_insert_key(parent, pslot, |
| 2108 | MOD_LOG_KEY_REPLACE, GFP_NOFS); |
| 2109 | BUG_ON(ret < 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2110 | btrfs_set_node_key(parent, &disk_key, pslot); |
| 2111 | btrfs_mark_buffer_dirty(parent); |
| 2112 | if (btrfs_header_nritems(left) > orig_slot) { |
| 2113 | path->nodes[level] = left; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2114 | path->slots[level + 1] -= 1; |
| 2115 | path->slots[level] = orig_slot; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2116 | btrfs_tree_unlock(mid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2117 | free_extent_buffer(mid); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2118 | } else { |
| 2119 | orig_slot -= |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2120 | btrfs_header_nritems(left); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2121 | path->slots[level] = orig_slot; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2122 | btrfs_tree_unlock(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2123 | free_extent_buffer(left); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2124 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2125 | return 0; |
| 2126 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2127 | btrfs_tree_unlock(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2128 | free_extent_buffer(left); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2129 | } |
David Sterba | d0d20b0 | 2019-03-20 14:54:01 +0100 | [diff] [blame] | 2130 | right = read_node_slot(parent, pslot + 1); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 2131 | if (IS_ERR(right)) |
| 2132 | right = NULL; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2133 | |
| 2134 | /* |
| 2135 | * then try to empty the right most buffer into the middle |
| 2136 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2137 | if (right) { |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 2138 | u32 right_nr; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2139 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2140 | btrfs_tree_lock(right); |
David Sterba | 8bead25 | 2018-04-04 02:03:48 +0200 | [diff] [blame] | 2141 | btrfs_set_lock_blocking_write(right); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2142 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2143 | right_nr = btrfs_header_nritems(right); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2144 | if (right_nr >= BTRFS_NODEPTRS_PER_BLOCK(fs_info) - 1) { |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 2145 | wret = 1; |
| 2146 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2147 | ret = btrfs_cow_block(trans, root, right, |
| 2148 | parent, pslot + 1, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 2149 | &right); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2150 | if (ret) |
| 2151 | wret = 1; |
| 2152 | else { |
David Sterba | 55d32ed | 2019-03-20 14:18:06 +0100 | [diff] [blame] | 2153 | wret = balance_node_right(trans, right, mid); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2154 | } |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 2155 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2156 | if (wret < 0) |
| 2157 | ret = wret; |
| 2158 | if (wret == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2159 | struct btrfs_disk_key disk_key; |
| 2160 | |
| 2161 | btrfs_node_key(right, &disk_key, 0); |
David Sterba | 0e82bcf | 2018-03-05 16:16:54 +0100 | [diff] [blame] | 2162 | ret = tree_mod_log_insert_key(parent, pslot + 1, |
| 2163 | MOD_LOG_KEY_REPLACE, GFP_NOFS); |
| 2164 | BUG_ON(ret < 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2165 | btrfs_set_node_key(parent, &disk_key, pslot + 1); |
| 2166 | btrfs_mark_buffer_dirty(parent); |
| 2167 | |
| 2168 | if (btrfs_header_nritems(mid) <= orig_slot) { |
| 2169 | path->nodes[level] = right; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2170 | path->slots[level + 1] += 1; |
| 2171 | path->slots[level] = orig_slot - |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2172 | btrfs_header_nritems(mid); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2173 | btrfs_tree_unlock(mid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2174 | free_extent_buffer(mid); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2175 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2176 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2177 | free_extent_buffer(right); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2178 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2179 | return 0; |
| 2180 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2181 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2182 | free_extent_buffer(right); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2183 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2184 | return 1; |
| 2185 | } |
| 2186 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2187 | /* |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 2188 | * readahead one full node of leaves, finding things that are close |
| 2189 | * to the block in 'slot', and triggering ra on them. |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2190 | */ |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 2191 | static void reada_for_search(struct btrfs_fs_info *fs_info, |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2192 | struct btrfs_path *path, |
| 2193 | int level, int slot, u64 objectid) |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2194 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2195 | struct extent_buffer *node; |
Chris Mason | 01f4665 | 2007-12-21 16:24:26 -0500 | [diff] [blame] | 2196 | struct btrfs_disk_key disk_key; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2197 | u32 nritems; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2198 | u64 search; |
Chris Mason | a717531 | 2009-01-22 09:23:10 -0500 | [diff] [blame] | 2199 | u64 target; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2200 | u64 nread = 0; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2201 | struct extent_buffer *eb; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2202 | u32 nr; |
| 2203 | u32 blocksize; |
| 2204 | u32 nscan = 0; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2205 | |
Chris Mason | a6b6e75 | 2007-10-15 16:22:39 -0400 | [diff] [blame] | 2206 | if (level != 1) |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2207 | return; |
| 2208 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 2209 | if (!path->nodes[level]) |
| 2210 | return; |
| 2211 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2212 | node = path->nodes[level]; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2213 | |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2214 | search = btrfs_node_blockptr(node, slot); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2215 | blocksize = fs_info->nodesize; |
| 2216 | eb = find_extent_buffer(fs_info, search); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2217 | if (eb) { |
| 2218 | free_extent_buffer(eb); |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2219 | return; |
| 2220 | } |
| 2221 | |
Chris Mason | a717531 | 2009-01-22 09:23:10 -0500 | [diff] [blame] | 2222 | target = search; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2223 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2224 | nritems = btrfs_header_nritems(node); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2225 | nr = slot; |
Josef Bacik | 25b8b93 | 2011-06-08 14:36:54 -0400 | [diff] [blame] | 2226 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2227 | while (1) { |
David Sterba | e4058b5 | 2015-11-27 16:31:35 +0100 | [diff] [blame] | 2228 | if (path->reada == READA_BACK) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2229 | if (nr == 0) |
| 2230 | break; |
| 2231 | nr--; |
David Sterba | e4058b5 | 2015-11-27 16:31:35 +0100 | [diff] [blame] | 2232 | } else if (path->reada == READA_FORWARD) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2233 | nr++; |
| 2234 | if (nr >= nritems) |
| 2235 | break; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2236 | } |
David Sterba | e4058b5 | 2015-11-27 16:31:35 +0100 | [diff] [blame] | 2237 | if (path->reada == READA_BACK && objectid) { |
Chris Mason | 01f4665 | 2007-12-21 16:24:26 -0500 | [diff] [blame] | 2238 | btrfs_node_key(node, &disk_key, nr); |
| 2239 | if (btrfs_disk_key_objectid(&disk_key) != objectid) |
| 2240 | break; |
| 2241 | } |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2242 | search = btrfs_node_blockptr(node, nr); |
Chris Mason | a717531 | 2009-01-22 09:23:10 -0500 | [diff] [blame] | 2243 | if ((search <= target && target - search <= 65536) || |
| 2244 | (search > target && search - target <= 65536)) { |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 2245 | readahead_tree_block(fs_info, search); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2246 | nread += blocksize; |
| 2247 | } |
| 2248 | nscan++; |
Chris Mason | a717531 | 2009-01-22 09:23:10 -0500 | [diff] [blame] | 2249 | if ((nread > 65536 || nscan > 32)) |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 2250 | break; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2251 | } |
| 2252 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2253 | |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 2254 | static noinline void reada_for_balance(struct btrfs_fs_info *fs_info, |
Josef Bacik | 0b08851 | 2013-06-17 14:23:02 -0400 | [diff] [blame] | 2255 | struct btrfs_path *path, int level) |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2256 | { |
| 2257 | int slot; |
| 2258 | int nritems; |
| 2259 | struct extent_buffer *parent; |
| 2260 | struct extent_buffer *eb; |
| 2261 | u64 gen; |
| 2262 | u64 block1 = 0; |
| 2263 | u64 block2 = 0; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2264 | |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 2265 | parent = path->nodes[level + 1]; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2266 | if (!parent) |
Josef Bacik | 0b08851 | 2013-06-17 14:23:02 -0400 | [diff] [blame] | 2267 | return; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2268 | |
| 2269 | nritems = btrfs_header_nritems(parent); |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 2270 | slot = path->slots[level + 1]; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2271 | |
| 2272 | if (slot > 0) { |
| 2273 | block1 = btrfs_node_blockptr(parent, slot - 1); |
| 2274 | gen = btrfs_node_ptr_generation(parent, slot - 1); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2275 | eb = find_extent_buffer(fs_info, block1); |
Chris Mason | b9fab91 | 2012-05-06 07:23:47 -0400 | [diff] [blame] | 2276 | /* |
| 2277 | * if we get -eagain from btrfs_buffer_uptodate, we |
| 2278 | * don't want to return eagain here. That will loop |
| 2279 | * forever |
| 2280 | */ |
| 2281 | if (eb && btrfs_buffer_uptodate(eb, gen, 1) != 0) |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2282 | block1 = 0; |
| 2283 | free_extent_buffer(eb); |
| 2284 | } |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 2285 | if (slot + 1 < nritems) { |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2286 | block2 = btrfs_node_blockptr(parent, slot + 1); |
| 2287 | gen = btrfs_node_ptr_generation(parent, slot + 1); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2288 | eb = find_extent_buffer(fs_info, block2); |
Chris Mason | b9fab91 | 2012-05-06 07:23:47 -0400 | [diff] [blame] | 2289 | if (eb && btrfs_buffer_uptodate(eb, gen, 1) != 0) |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2290 | block2 = 0; |
| 2291 | free_extent_buffer(eb); |
| 2292 | } |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 2293 | |
Josef Bacik | 0b08851 | 2013-06-17 14:23:02 -0400 | [diff] [blame] | 2294 | if (block1) |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 2295 | readahead_tree_block(fs_info, block1); |
Josef Bacik | 0b08851 | 2013-06-17 14:23:02 -0400 | [diff] [blame] | 2296 | if (block2) |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 2297 | readahead_tree_block(fs_info, block2); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2298 | } |
| 2299 | |
| 2300 | |
| 2301 | /* |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2302 | * when we walk down the tree, it is usually safe to unlock the higher layers |
| 2303 | * in the tree. The exceptions are when our path goes through slot 0, because |
| 2304 | * operations on the tree might require changing key pointers higher up in the |
| 2305 | * tree. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 2306 | * |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2307 | * callers might also have set path->keep_locks, which tells this code to keep |
| 2308 | * the lock if the path points to the last slot in the block. This is part of |
| 2309 | * 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] | 2310 | * |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2311 | * lowest_unlock sets the lowest level in the tree we're allowed to unlock. so |
| 2312 | * if lowest_unlock is 1, level 0 won't be unlocked |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 2313 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 2314 | static noinline void unlock_up(struct btrfs_path *path, int level, |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 2315 | int lowest_unlock, int min_write_lock_level, |
| 2316 | int *write_lock_level) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2317 | { |
| 2318 | int i; |
| 2319 | int skip_level = level; |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2320 | int no_skips = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2321 | struct extent_buffer *t; |
| 2322 | |
| 2323 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
| 2324 | if (!path->nodes[i]) |
| 2325 | break; |
| 2326 | if (!path->locks[i]) |
| 2327 | break; |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2328 | if (!no_skips && path->slots[i] == 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2329 | skip_level = i + 1; |
| 2330 | continue; |
| 2331 | } |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2332 | if (!no_skips && path->keep_locks) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2333 | u32 nritems; |
| 2334 | t = path->nodes[i]; |
| 2335 | nritems = btrfs_header_nritems(t); |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2336 | if (nritems < 1 || path->slots[i] >= nritems - 1) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2337 | skip_level = i + 1; |
| 2338 | continue; |
| 2339 | } |
| 2340 | } |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2341 | if (skip_level < i && i >= lowest_unlock) |
| 2342 | no_skips = 1; |
| 2343 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2344 | t = path->nodes[i]; |
Liu Bo | d80bb3f | 2018-05-18 11:00:24 +0800 | [diff] [blame] | 2345 | if (i >= lowest_unlock && i > skip_level) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2346 | btrfs_tree_unlock_rw(t, path->locks[i]); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2347 | path->locks[i] = 0; |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 2348 | if (write_lock_level && |
| 2349 | i > min_write_lock_level && |
| 2350 | i <= *write_lock_level) { |
| 2351 | *write_lock_level = i - 1; |
| 2352 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2353 | } |
| 2354 | } |
| 2355 | } |
| 2356 | |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 2357 | /* |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2358 | * This releases any locks held in the path starting at level and |
| 2359 | * going all the way up to the root. |
| 2360 | * |
| 2361 | * btrfs_search_slot will keep the lock held on higher nodes in a few |
| 2362 | * corner cases, such as COW of the block at slot zero in the node. This |
| 2363 | * ignores those rules, and it should only be called when there are no |
| 2364 | * more updates to be done higher up in the tree. |
| 2365 | */ |
| 2366 | noinline void btrfs_unlock_up_safe(struct btrfs_path *path, int level) |
| 2367 | { |
| 2368 | int i; |
| 2369 | |
Josef Bacik | 09a2a8f9 | 2013-04-05 16:51:15 -0400 | [diff] [blame] | 2370 | if (path->keep_locks) |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2371 | return; |
| 2372 | |
| 2373 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
| 2374 | if (!path->nodes[i]) |
Chris Mason | 12f4dac | 2009-02-04 09:31:42 -0500 | [diff] [blame] | 2375 | continue; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2376 | if (!path->locks[i]) |
Chris Mason | 12f4dac | 2009-02-04 09:31:42 -0500 | [diff] [blame] | 2377 | continue; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2378 | btrfs_tree_unlock_rw(path->nodes[i], path->locks[i]); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2379 | path->locks[i] = 0; |
| 2380 | } |
| 2381 | } |
| 2382 | |
| 2383 | /* |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2384 | * helper function for btrfs_search_slot. The goal is to find a block |
| 2385 | * in cache without setting the path to blocking. If we find the block |
| 2386 | * we return zero and the path is unchanged. |
| 2387 | * |
| 2388 | * If we can't find the block, we set the path blocking and do some |
| 2389 | * reada. -EAGAIN is returned and the search must be repeated. |
| 2390 | */ |
| 2391 | static int |
Liu Bo | d07b852 | 2017-01-30 12:23:42 -0800 | [diff] [blame] | 2392 | read_block_for_search(struct btrfs_root *root, struct btrfs_path *p, |
| 2393 | struct extent_buffer **eb_ret, int level, int slot, |
David Sterba | cda79c5 | 2017-02-10 18:44:32 +0100 | [diff] [blame] | 2394 | const struct btrfs_key *key) |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2395 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2396 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2397 | u64 blocknr; |
| 2398 | u64 gen; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2399 | struct extent_buffer *b = *eb_ret; |
| 2400 | struct extent_buffer *tmp; |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 2401 | struct btrfs_key first_key; |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2402 | int ret; |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 2403 | int parent_level; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2404 | |
| 2405 | blocknr = btrfs_node_blockptr(b, slot); |
| 2406 | gen = btrfs_node_ptr_generation(b, slot); |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 2407 | parent_level = btrfs_header_level(b); |
| 2408 | btrfs_node_key_to_cpu(b, &first_key, slot); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2409 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2410 | tmp = find_extent_buffer(fs_info, blocknr); |
Chris Mason | cb44921 | 2010-10-24 11:01:27 -0400 | [diff] [blame] | 2411 | if (tmp) { |
Chris Mason | b9fab91 | 2012-05-06 07:23:47 -0400 | [diff] [blame] | 2412 | /* first we do an atomic uptodate check */ |
Josef Bacik | bdf7c00 | 2013-06-17 13:44:48 -0400 | [diff] [blame] | 2413 | if (btrfs_buffer_uptodate(tmp, gen, 1) > 0) { |
Qu Wenruo | 448de47 | 2019-03-12 17:10:40 +0800 | [diff] [blame] | 2414 | /* |
| 2415 | * Do extra check for first_key, eb can be stale due to |
| 2416 | * being cached, read from scrub, or have multiple |
| 2417 | * parents (shared tree blocks). |
| 2418 | */ |
David Sterba | e064d5e | 2019-03-20 14:58:13 +0100 | [diff] [blame] | 2419 | if (btrfs_verify_level_key(tmp, |
Qu Wenruo | 448de47 | 2019-03-12 17:10:40 +0800 | [diff] [blame] | 2420 | parent_level - 1, &first_key, gen)) { |
| 2421 | free_extent_buffer(tmp); |
| 2422 | return -EUCLEAN; |
| 2423 | } |
Josef Bacik | bdf7c00 | 2013-06-17 13:44:48 -0400 | [diff] [blame] | 2424 | *eb_ret = tmp; |
| 2425 | return 0; |
Chris Mason | cb44921 | 2010-10-24 11:01:27 -0400 | [diff] [blame] | 2426 | } |
Josef Bacik | bdf7c00 | 2013-06-17 13:44:48 -0400 | [diff] [blame] | 2427 | |
| 2428 | /* the pages were up to date, but we failed |
| 2429 | * the generation number check. Do a full |
| 2430 | * read for the generation number that is correct. |
| 2431 | * We must do this without dropping locks so |
| 2432 | * we can trust our generation number |
| 2433 | */ |
| 2434 | btrfs_set_path_blocking(p); |
| 2435 | |
| 2436 | /* now we're allowed to do a blocking uptodate check */ |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 2437 | ret = btrfs_read_buffer(tmp, gen, parent_level - 1, &first_key); |
Josef Bacik | bdf7c00 | 2013-06-17 13:44:48 -0400 | [diff] [blame] | 2438 | if (!ret) { |
| 2439 | *eb_ret = tmp; |
| 2440 | return 0; |
| 2441 | } |
| 2442 | free_extent_buffer(tmp); |
| 2443 | btrfs_release_path(p); |
| 2444 | return -EIO; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2445 | } |
| 2446 | |
| 2447 | /* |
| 2448 | * reduce lock contention at high levels |
| 2449 | * of the btree by dropping locks before |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2450 | * we read. Don't release the lock on the current |
| 2451 | * level because we need to walk this node to figure |
| 2452 | * out which blocks to read. |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2453 | */ |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 2454 | btrfs_unlock_up_safe(p, level + 1); |
| 2455 | btrfs_set_path_blocking(p); |
| 2456 | |
David Sterba | e4058b5 | 2015-11-27 16:31:35 +0100 | [diff] [blame] | 2457 | if (p->reada != READA_NONE) |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 2458 | reada_for_search(fs_info, p, level, slot, key->objectid); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2459 | |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2460 | ret = -EAGAIN; |
Liu Bo | 02a3307 | 2018-05-16 01:37:36 +0800 | [diff] [blame] | 2461 | tmp = read_tree_block(fs_info, blocknr, gen, parent_level - 1, |
Qu Wenruo | 581c176 | 2018-03-29 09:08:11 +0800 | [diff] [blame] | 2462 | &first_key); |
Liu Bo | 64c043d | 2015-05-25 17:30:15 +0800 | [diff] [blame] | 2463 | if (!IS_ERR(tmp)) { |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2464 | /* |
| 2465 | * If the read above didn't mark this buffer up to date, |
| 2466 | * it will never end up being up to date. Set ret to EIO now |
| 2467 | * and give up so that our caller doesn't loop forever |
| 2468 | * on our EAGAINs. |
| 2469 | */ |
Liu Bo | e6a1d6f | 2018-05-18 11:00:20 +0800 | [diff] [blame] | 2470 | if (!extent_buffer_uptodate(tmp)) |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2471 | ret = -EIO; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2472 | free_extent_buffer(tmp); |
Liu Bo | c871b0f | 2016-06-06 12:01:23 -0700 | [diff] [blame] | 2473 | } else { |
| 2474 | ret = PTR_ERR(tmp); |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2475 | } |
Liu Bo | 02a3307 | 2018-05-16 01:37:36 +0800 | [diff] [blame] | 2476 | |
| 2477 | btrfs_release_path(p); |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2478 | return ret; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2479 | } |
| 2480 | |
| 2481 | /* |
| 2482 | * helper function for btrfs_search_slot. This does all of the checks |
| 2483 | * for node-level blocks and does any balancing required based on |
| 2484 | * the ins_len. |
| 2485 | * |
| 2486 | * If no extra work was required, zero is returned. If we had to |
| 2487 | * drop the path, -EAGAIN is returned and btrfs_search_slot must |
| 2488 | * start over |
| 2489 | */ |
| 2490 | static int |
| 2491 | setup_nodes_for_search(struct btrfs_trans_handle *trans, |
| 2492 | struct btrfs_root *root, struct btrfs_path *p, |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2493 | struct extent_buffer *b, int level, int ins_len, |
| 2494 | int *write_lock_level) |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2495 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2496 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2497 | int ret; |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2498 | |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2499 | if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >= |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2500 | BTRFS_NODEPTRS_PER_BLOCK(fs_info) - 3) { |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2501 | int sret; |
| 2502 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2503 | if (*write_lock_level < level + 1) { |
| 2504 | *write_lock_level = level + 1; |
| 2505 | btrfs_release_path(p); |
| 2506 | goto again; |
| 2507 | } |
| 2508 | |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2509 | btrfs_set_path_blocking(p); |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 2510 | reada_for_balance(fs_info, p, level); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2511 | sret = split_node(trans, root, p, level); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2512 | |
| 2513 | BUG_ON(sret > 0); |
| 2514 | if (sret) { |
| 2515 | ret = sret; |
| 2516 | goto done; |
| 2517 | } |
| 2518 | b = p->nodes[level]; |
| 2519 | } else if (ins_len < 0 && btrfs_header_nritems(b) < |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2520 | BTRFS_NODEPTRS_PER_BLOCK(fs_info) / 2) { |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2521 | int sret; |
| 2522 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2523 | if (*write_lock_level < level + 1) { |
| 2524 | *write_lock_level = level + 1; |
| 2525 | btrfs_release_path(p); |
| 2526 | goto again; |
| 2527 | } |
| 2528 | |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2529 | btrfs_set_path_blocking(p); |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 2530 | reada_for_balance(fs_info, p, level); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2531 | sret = balance_level(trans, root, p, level); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2532 | |
| 2533 | if (sret) { |
| 2534 | ret = sret; |
| 2535 | goto done; |
| 2536 | } |
| 2537 | b = p->nodes[level]; |
| 2538 | if (!b) { |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 2539 | btrfs_release_path(p); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2540 | goto again; |
| 2541 | } |
| 2542 | BUG_ON(btrfs_header_nritems(b) == 1); |
| 2543 | } |
| 2544 | return 0; |
| 2545 | |
| 2546 | again: |
| 2547 | ret = -EAGAIN; |
| 2548 | done: |
| 2549 | return ret; |
| 2550 | } |
| 2551 | |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 2552 | static int key_search(struct extent_buffer *b, const struct btrfs_key *key, |
Filipe David Borba Manana | d7396f0 | 2013-08-30 15:46:43 +0100 | [diff] [blame] | 2553 | int level, int *prev_cmp, int *slot) |
| 2554 | { |
| 2555 | if (*prev_cmp != 0) { |
Nikolay Borisov | a74b35e | 2017-12-08 16:27:43 +0200 | [diff] [blame] | 2556 | *prev_cmp = btrfs_bin_search(b, key, level, slot); |
Filipe David Borba Manana | d7396f0 | 2013-08-30 15:46:43 +0100 | [diff] [blame] | 2557 | return *prev_cmp; |
| 2558 | } |
| 2559 | |
Filipe David Borba Manana | d7396f0 | 2013-08-30 15:46:43 +0100 | [diff] [blame] | 2560 | *slot = 0; |
| 2561 | |
| 2562 | return 0; |
| 2563 | } |
| 2564 | |
David Sterba | 381cf65 | 2015-01-02 18:45:16 +0100 | [diff] [blame] | 2565 | 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] | 2566 | u64 iobjectid, u64 ioff, u8 key_type, |
| 2567 | struct btrfs_key *found_key) |
| 2568 | { |
| 2569 | int ret; |
| 2570 | struct btrfs_key key; |
| 2571 | struct extent_buffer *eb; |
David Sterba | 381cf65 | 2015-01-02 18:45:16 +0100 | [diff] [blame] | 2572 | |
| 2573 | ASSERT(path); |
David Sterba | 1d4c08e | 2015-01-02 19:36:14 +0100 | [diff] [blame] | 2574 | ASSERT(found_key); |
Kelley Nielsen | e33d5c3 | 2013-11-04 19:33:33 -0800 | [diff] [blame] | 2575 | |
| 2576 | key.type = key_type; |
| 2577 | key.objectid = iobjectid; |
| 2578 | key.offset = ioff; |
| 2579 | |
| 2580 | ret = btrfs_search_slot(NULL, fs_root, &key, path, 0, 0); |
David Sterba | 1d4c08e | 2015-01-02 19:36:14 +0100 | [diff] [blame] | 2581 | if (ret < 0) |
Kelley Nielsen | e33d5c3 | 2013-11-04 19:33:33 -0800 | [diff] [blame] | 2582 | return ret; |
| 2583 | |
| 2584 | eb = path->nodes[0]; |
| 2585 | if (ret && path->slots[0] >= btrfs_header_nritems(eb)) { |
| 2586 | ret = btrfs_next_leaf(fs_root, path); |
| 2587 | if (ret) |
| 2588 | return ret; |
| 2589 | eb = path->nodes[0]; |
| 2590 | } |
| 2591 | |
| 2592 | btrfs_item_key_to_cpu(eb, found_key, path->slots[0]); |
| 2593 | if (found_key->type != key.type || |
| 2594 | found_key->objectid != key.objectid) |
| 2595 | return 1; |
| 2596 | |
| 2597 | return 0; |
| 2598 | } |
| 2599 | |
Liu Bo | 1fc28d8 | 2018-05-18 11:00:21 +0800 | [diff] [blame] | 2600 | static struct extent_buffer *btrfs_search_slot_get_root(struct btrfs_root *root, |
| 2601 | struct btrfs_path *p, |
| 2602 | int write_lock_level) |
| 2603 | { |
| 2604 | struct btrfs_fs_info *fs_info = root->fs_info; |
| 2605 | struct extent_buffer *b; |
| 2606 | int root_lock; |
| 2607 | int level = 0; |
| 2608 | |
| 2609 | /* We try very hard to do read locks on the root */ |
| 2610 | root_lock = BTRFS_READ_LOCK; |
| 2611 | |
| 2612 | if (p->search_commit_root) { |
Filipe Manana | be6821f | 2018-12-11 10:19:45 +0000 | [diff] [blame] | 2613 | /* |
| 2614 | * The commit roots are read only so we always do read locks, |
| 2615 | * and we always must hold the commit_root_sem when doing |
| 2616 | * searches on them, the only exception is send where we don't |
| 2617 | * want to block transaction commits for a long time, so |
| 2618 | * we need to clone the commit root in order to avoid races |
| 2619 | * with transaction commits that create a snapshot of one of |
| 2620 | * the roots used by a send operation. |
| 2621 | */ |
| 2622 | if (p->need_commit_sem) { |
Liu Bo | 1fc28d8 | 2018-05-18 11:00:21 +0800 | [diff] [blame] | 2623 | down_read(&fs_info->commit_root_sem); |
Filipe Manana | be6821f | 2018-12-11 10:19:45 +0000 | [diff] [blame] | 2624 | b = btrfs_clone_extent_buffer(root->commit_root); |
Liu Bo | 1fc28d8 | 2018-05-18 11:00:21 +0800 | [diff] [blame] | 2625 | up_read(&fs_info->commit_root_sem); |
Filipe Manana | be6821f | 2018-12-11 10:19:45 +0000 | [diff] [blame] | 2626 | if (!b) |
| 2627 | return ERR_PTR(-ENOMEM); |
| 2628 | |
| 2629 | } else { |
| 2630 | b = root->commit_root; |
| 2631 | extent_buffer_get(b); |
| 2632 | } |
| 2633 | level = btrfs_header_level(b); |
Liu Bo | f9ddfd0 | 2018-05-29 21:27:06 +0800 | [diff] [blame] | 2634 | /* |
| 2635 | * Ensure that all callers have set skip_locking when |
| 2636 | * p->search_commit_root = 1. |
| 2637 | */ |
| 2638 | ASSERT(p->skip_locking == 1); |
Liu Bo | 1fc28d8 | 2018-05-18 11:00:21 +0800 | [diff] [blame] | 2639 | |
| 2640 | goto out; |
| 2641 | } |
| 2642 | |
| 2643 | if (p->skip_locking) { |
| 2644 | b = btrfs_root_node(root); |
| 2645 | level = btrfs_header_level(b); |
| 2646 | goto out; |
| 2647 | } |
| 2648 | |
| 2649 | /* |
Liu Bo | 662c653 | 2018-05-18 11:00:23 +0800 | [diff] [blame] | 2650 | * If the level is set to maximum, we can skip trying to get the read |
| 2651 | * lock. |
Liu Bo | 1fc28d8 | 2018-05-18 11:00:21 +0800 | [diff] [blame] | 2652 | */ |
Liu Bo | 662c653 | 2018-05-18 11:00:23 +0800 | [diff] [blame] | 2653 | if (write_lock_level < BTRFS_MAX_LEVEL) { |
| 2654 | /* |
| 2655 | * We don't know the level of the root node until we actually |
| 2656 | * have it read locked |
| 2657 | */ |
| 2658 | b = btrfs_read_lock_root_node(root); |
| 2659 | level = btrfs_header_level(b); |
| 2660 | if (level > write_lock_level) |
| 2661 | goto out; |
Liu Bo | 1fc28d8 | 2018-05-18 11:00:21 +0800 | [diff] [blame] | 2662 | |
Liu Bo | 662c653 | 2018-05-18 11:00:23 +0800 | [diff] [blame] | 2663 | /* Whoops, must trade for write lock */ |
| 2664 | btrfs_tree_read_unlock(b); |
| 2665 | free_extent_buffer(b); |
| 2666 | } |
| 2667 | |
Liu Bo | 1fc28d8 | 2018-05-18 11:00:21 +0800 | [diff] [blame] | 2668 | b = btrfs_lock_root_node(root); |
| 2669 | root_lock = BTRFS_WRITE_LOCK; |
| 2670 | |
| 2671 | /* The level might have changed, check again */ |
| 2672 | level = btrfs_header_level(b); |
| 2673 | |
| 2674 | out: |
| 2675 | p->nodes[level] = b; |
| 2676 | if (!p->skip_locking) |
| 2677 | p->locks[level] = root_lock; |
| 2678 | /* |
| 2679 | * Callers are responsible for dropping b's references. |
| 2680 | */ |
| 2681 | return b; |
| 2682 | } |
| 2683 | |
| 2684 | |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2685 | /* |
Nikolay Borisov | 4271ece | 2017-12-13 09:38:14 +0200 | [diff] [blame] | 2686 | * btrfs_search_slot - look for a key in a tree and perform necessary |
| 2687 | * modifications to preserve tree invariants. |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2688 | * |
Nikolay Borisov | 4271ece | 2017-12-13 09:38:14 +0200 | [diff] [blame] | 2689 | * @trans: Handle of transaction, used when modifying the tree |
| 2690 | * @p: Holds all btree nodes along the search path |
| 2691 | * @root: The root node of the tree |
| 2692 | * @key: The key we are looking for |
| 2693 | * @ins_len: Indicates purpose of search, for inserts it is 1, for |
| 2694 | * deletions it's -1. 0 for plain searches |
| 2695 | * @cow: boolean should CoW operations be performed. Must always be 1 |
| 2696 | * when modifying the tree. |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 2697 | * |
Nikolay Borisov | 4271ece | 2017-12-13 09:38:14 +0200 | [diff] [blame] | 2698 | * If @ins_len > 0, nodes and leaves will be split as we walk down the tree. |
| 2699 | * If @ins_len < 0, nodes will be merged as we walk down the tree (if possible) |
| 2700 | * |
| 2701 | * If @key is found, 0 is returned and you can find the item in the leaf level |
| 2702 | * of the path (level 0) |
| 2703 | * |
| 2704 | * If @key isn't found, 1 is returned and the leaf level of the path (level 0) |
| 2705 | * points to the slot where it should be inserted |
| 2706 | * |
| 2707 | * If an error is encountered while searching the tree a negative error number |
| 2708 | * is returned |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2709 | */ |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 2710 | int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 2711 | const struct btrfs_key *key, struct btrfs_path *p, |
| 2712 | int ins_len, int cow) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2713 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2714 | struct extent_buffer *b; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2715 | int slot; |
| 2716 | int ret; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2717 | int err; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2718 | int level; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2719 | int lowest_unlock = 1; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2720 | /* everything at write_lock_level or lower must be write locked */ |
| 2721 | int write_lock_level = 0; |
Chris Mason | 9f3a742 | 2007-08-07 15:52:19 -0400 | [diff] [blame] | 2722 | u8 lowest_level = 0; |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 2723 | int min_write_lock_level; |
Filipe David Borba Manana | d7396f0 | 2013-08-30 15:46:43 +0100 | [diff] [blame] | 2724 | int prev_cmp; |
Chris Mason | 9f3a742 | 2007-08-07 15:52:19 -0400 | [diff] [blame] | 2725 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 2726 | lowest_level = p->lowest_level; |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 2727 | WARN_ON(lowest_level && ins_len > 0); |
Chris Mason | 22b0ebd | 2007-03-30 08:47:31 -0400 | [diff] [blame] | 2728 | WARN_ON(p->nodes[0] != NULL); |
Filipe David Borba Manana | eb653de | 2013-12-23 11:53:02 +0000 | [diff] [blame] | 2729 | BUG_ON(!cow && ins_len); |
Josef Bacik | 2517920 | 2008-10-29 14:49:05 -0400 | [diff] [blame] | 2730 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2731 | if (ins_len < 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2732 | lowest_unlock = 2; |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2733 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2734 | /* when we are removing items, we might have to go up to level |
| 2735 | * two as we update tree pointers Make sure we keep write |
| 2736 | * for those levels as well |
| 2737 | */ |
| 2738 | write_lock_level = 2; |
| 2739 | } else if (ins_len > 0) { |
| 2740 | /* |
| 2741 | * for inserting items, make sure we have a write lock on |
| 2742 | * level 1 so we can update keys |
| 2743 | */ |
| 2744 | write_lock_level = 1; |
| 2745 | } |
| 2746 | |
| 2747 | if (!cow) |
| 2748 | write_lock_level = -1; |
| 2749 | |
Josef Bacik | 09a2a8f9 | 2013-04-05 16:51:15 -0400 | [diff] [blame] | 2750 | if (cow && (p->keep_locks || p->lowest_level)) |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2751 | write_lock_level = BTRFS_MAX_LEVEL; |
| 2752 | |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 2753 | min_write_lock_level = write_lock_level; |
| 2754 | |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 2755 | again: |
Filipe David Borba Manana | d7396f0 | 2013-08-30 15:46:43 +0100 | [diff] [blame] | 2756 | prev_cmp = -1; |
Liu Bo | 1fc28d8 | 2018-05-18 11:00:21 +0800 | [diff] [blame] | 2757 | b = btrfs_search_slot_get_root(root, p, write_lock_level); |
Filipe Manana | be6821f | 2018-12-11 10:19:45 +0000 | [diff] [blame] | 2758 | if (IS_ERR(b)) { |
| 2759 | ret = PTR_ERR(b); |
| 2760 | goto done; |
| 2761 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2762 | |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 2763 | while (b) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2764 | level = btrfs_header_level(b); |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2765 | |
| 2766 | /* |
| 2767 | * setup the path here so we can release it under lock |
| 2768 | * contention with the cow code |
| 2769 | */ |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 2770 | if (cow) { |
Nikolay Borisov | 9ea2c7c | 2017-12-12 11:14:49 +0200 | [diff] [blame] | 2771 | bool last_level = (level == (BTRFS_MAX_LEVEL - 1)); |
| 2772 | |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2773 | /* |
| 2774 | * if we don't really need to cow this block |
| 2775 | * then we don't want to set the path blocking, |
| 2776 | * so we test it here |
| 2777 | */ |
Jeff Mahoney | 64c1292 | 2016-06-08 00:36:38 -0400 | [diff] [blame] | 2778 | if (!should_cow_block(trans, root, b)) { |
| 2779 | trans->dirty = true; |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2780 | goto cow_done; |
Jeff Mahoney | 64c1292 | 2016-06-08 00:36:38 -0400 | [diff] [blame] | 2781 | } |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2782 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2783 | /* |
| 2784 | * must have write locks on this node and the |
| 2785 | * parent |
| 2786 | */ |
Josef Bacik | 5124e00 | 2012-11-07 13:44:13 -0500 | [diff] [blame] | 2787 | if (level > write_lock_level || |
| 2788 | (level + 1 > write_lock_level && |
| 2789 | level + 1 < BTRFS_MAX_LEVEL && |
| 2790 | p->nodes[level + 1])) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2791 | write_lock_level = level + 1; |
| 2792 | btrfs_release_path(p); |
| 2793 | goto again; |
| 2794 | } |
| 2795 | |
Filipe Manana | 160f408 | 2014-07-28 19:37:17 +0100 | [diff] [blame] | 2796 | btrfs_set_path_blocking(p); |
Nikolay Borisov | 9ea2c7c | 2017-12-12 11:14:49 +0200 | [diff] [blame] | 2797 | if (last_level) |
| 2798 | err = btrfs_cow_block(trans, root, b, NULL, 0, |
| 2799 | &b); |
| 2800 | else |
| 2801 | err = btrfs_cow_block(trans, root, b, |
| 2802 | p->nodes[level + 1], |
| 2803 | p->slots[level + 1], &b); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2804 | if (err) { |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2805 | ret = err; |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2806 | goto done; |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2807 | } |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 2808 | } |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2809 | cow_done: |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 2810 | p->nodes[level] = b; |
Liu Bo | 5239834 | 2018-08-22 05:54:37 +0800 | [diff] [blame] | 2811 | /* |
| 2812 | * Leave path with blocking locks to avoid massive |
| 2813 | * lock context switch, this is made on purpose. |
| 2814 | */ |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2815 | |
| 2816 | /* |
| 2817 | * we have a lock on b and as long as we aren't changing |
| 2818 | * the tree, there is no way to for the items in b to change. |
| 2819 | * It is safe to drop the lock on our parent before we |
| 2820 | * go through the expensive btree search on b. |
| 2821 | * |
Filipe David Borba Manana | eb653de | 2013-12-23 11:53:02 +0000 | [diff] [blame] | 2822 | * If we're inserting or deleting (ins_len != 0), then we might |
| 2823 | * be changing slot zero, which may require changing the parent. |
| 2824 | * So, we can't drop the lock until after we know which slot |
| 2825 | * we're operating on. |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2826 | */ |
Filipe David Borba Manana | eb653de | 2013-12-23 11:53:02 +0000 | [diff] [blame] | 2827 | if (!ins_len && !p->keep_locks) { |
| 2828 | int u = level + 1; |
| 2829 | |
| 2830 | if (u < BTRFS_MAX_LEVEL && p->locks[u]) { |
| 2831 | btrfs_tree_unlock_rw(p->nodes[u], p->locks[u]); |
| 2832 | p->locks[u] = 0; |
| 2833 | } |
| 2834 | } |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2835 | |
Filipe David Borba Manana | d7396f0 | 2013-08-30 15:46:43 +0100 | [diff] [blame] | 2836 | ret = key_search(b, key, level, &prev_cmp, &slot); |
Liu Bo | 415b35a | 2016-06-17 19:16:21 -0700 | [diff] [blame] | 2837 | if (ret < 0) |
| 2838 | goto done; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2839 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2840 | if (level != 0) { |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2841 | int dec = 0; |
| 2842 | if (ret && slot > 0) { |
| 2843 | dec = 1; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2844 | slot -= 1; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2845 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2846 | p->slots[level] = slot; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2847 | err = setup_nodes_for_search(trans, root, p, b, level, |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2848 | ins_len, &write_lock_level); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2849 | if (err == -EAGAIN) |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2850 | goto again; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2851 | if (err) { |
| 2852 | ret = err; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2853 | goto done; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2854 | } |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2855 | b = p->nodes[level]; |
| 2856 | slot = p->slots[level]; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2857 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2858 | /* |
| 2859 | * slot 0 is special, if we change the key |
| 2860 | * we have to update the parent pointer |
| 2861 | * which means we must have a write lock |
| 2862 | * on the parent |
| 2863 | */ |
Filipe David Borba Manana | eb653de | 2013-12-23 11:53:02 +0000 | [diff] [blame] | 2864 | if (slot == 0 && ins_len && |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2865 | write_lock_level < level + 1) { |
| 2866 | write_lock_level = level + 1; |
| 2867 | btrfs_release_path(p); |
| 2868 | goto again; |
| 2869 | } |
| 2870 | |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 2871 | unlock_up(p, level, lowest_unlock, |
| 2872 | min_write_lock_level, &write_lock_level); |
Chris Mason | f9efa9c | 2008-06-25 16:14:04 -0400 | [diff] [blame] | 2873 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2874 | if (level == lowest_level) { |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2875 | if (dec) |
| 2876 | p->slots[level]++; |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 2877 | goto done; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2878 | } |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 2879 | |
Liu Bo | d07b852 | 2017-01-30 12:23:42 -0800 | [diff] [blame] | 2880 | err = read_block_for_search(root, p, &b, level, |
David Sterba | cda79c5 | 2017-02-10 18:44:32 +0100 | [diff] [blame] | 2881 | slot, key); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2882 | if (err == -EAGAIN) |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2883 | goto again; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2884 | if (err) { |
| 2885 | ret = err; |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2886 | goto done; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2887 | } |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 2888 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2889 | if (!p->skip_locking) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2890 | level = btrfs_header_level(b); |
| 2891 | if (level <= write_lock_level) { |
| 2892 | err = btrfs_try_tree_write_lock(b); |
| 2893 | if (!err) { |
| 2894 | btrfs_set_path_blocking(p); |
| 2895 | btrfs_tree_lock(b); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2896 | } |
| 2897 | p->locks[level] = BTRFS_WRITE_LOCK; |
| 2898 | } else { |
Chris Mason | f82c458 | 2014-11-19 10:25:09 -0800 | [diff] [blame] | 2899 | err = btrfs_tree_read_lock_atomic(b); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2900 | if (!err) { |
| 2901 | btrfs_set_path_blocking(p); |
| 2902 | btrfs_tree_read_lock(b); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2903 | } |
| 2904 | p->locks[level] = BTRFS_READ_LOCK; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2905 | } |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2906 | p->nodes[level] = b; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2907 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2908 | } else { |
| 2909 | p->slots[level] = slot; |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 2910 | if (ins_len > 0 && |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 2911 | btrfs_leaf_free_space(b) < ins_len) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 2912 | if (write_lock_level < 1) { |
| 2913 | write_lock_level = 1; |
| 2914 | btrfs_release_path(p); |
| 2915 | goto again; |
| 2916 | } |
| 2917 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2918 | btrfs_set_path_blocking(p); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2919 | err = split_leaf(trans, root, key, |
| 2920 | p, ins_len, ret == 0); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2921 | |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 2922 | BUG_ON(err > 0); |
| 2923 | if (err) { |
| 2924 | ret = err; |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2925 | goto done; |
| 2926 | } |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 2927 | } |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 2928 | if (!p->search_for_split) |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 2929 | unlock_up(p, level, lowest_unlock, |
Liu Bo | 4b6f8e9 | 2018-08-14 10:46:53 +0800 | [diff] [blame] | 2930 | min_write_lock_level, NULL); |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2931 | goto done; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2932 | } |
| 2933 | } |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2934 | ret = 1; |
| 2935 | done: |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 2936 | /* |
| 2937 | * we don't really know what they plan on doing with the path |
| 2938 | * from here on, so for now just mark it as blocking |
| 2939 | */ |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 2940 | if (!p->leave_spinning) |
| 2941 | btrfs_set_path_blocking(p); |
Filipe Manana | 5f5bc6b | 2014-11-09 08:38:39 +0000 | [diff] [blame] | 2942 | if (ret < 0 && !p->skip_release_on_error) |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 2943 | btrfs_release_path(p); |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 2944 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2945 | } |
| 2946 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2947 | /* |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2948 | * Like btrfs_search_slot, this looks for a key in the given tree. It uses the |
| 2949 | * current state of the tree together with the operations recorded in the tree |
| 2950 | * modification log to search for the key in a previous version of this tree, as |
| 2951 | * denoted by the time_seq parameter. |
| 2952 | * |
| 2953 | * Naturally, there is no support for insert, delete or cow operations. |
| 2954 | * |
| 2955 | * The resulting path and return value will be set up as if we called |
| 2956 | * btrfs_search_slot at that point in time with ins_len and cow both set to 0. |
| 2957 | */ |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 2958 | int btrfs_search_old_slot(struct btrfs_root *root, const struct btrfs_key *key, |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2959 | struct btrfs_path *p, u64 time_seq) |
| 2960 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 2961 | struct btrfs_fs_info *fs_info = root->fs_info; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2962 | struct extent_buffer *b; |
| 2963 | int slot; |
| 2964 | int ret; |
| 2965 | int err; |
| 2966 | int level; |
| 2967 | int lowest_unlock = 1; |
| 2968 | u8 lowest_level = 0; |
Josef Bacik | d4b4087 | 2013-09-24 14:09:34 -0400 | [diff] [blame] | 2969 | int prev_cmp = -1; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2970 | |
| 2971 | lowest_level = p->lowest_level; |
| 2972 | WARN_ON(p->nodes[0] != NULL); |
| 2973 | |
| 2974 | if (p->search_commit_root) { |
| 2975 | BUG_ON(time_seq); |
| 2976 | return btrfs_search_slot(NULL, root, key, p, 0, 0); |
| 2977 | } |
| 2978 | |
| 2979 | again: |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2980 | b = get_old_root(root, time_seq); |
Nikolay Borisov | 315bed4 | 2018-09-13 11:35:10 +0300 | [diff] [blame] | 2981 | if (!b) { |
| 2982 | ret = -EIO; |
| 2983 | goto done; |
| 2984 | } |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2985 | level = btrfs_header_level(b); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2986 | p->locks[level] = BTRFS_READ_LOCK; |
| 2987 | |
| 2988 | while (b) { |
| 2989 | level = btrfs_header_level(b); |
| 2990 | p->nodes[level] = b; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 2991 | |
| 2992 | /* |
| 2993 | * we have a lock on b and as long as we aren't changing |
| 2994 | * the tree, there is no way to for the items in b to change. |
| 2995 | * It is safe to drop the lock on our parent before we |
| 2996 | * go through the expensive btree search on b. |
| 2997 | */ |
| 2998 | btrfs_unlock_up_safe(p, level + 1); |
| 2999 | |
Josef Bacik | d4b4087 | 2013-09-24 14:09:34 -0400 | [diff] [blame] | 3000 | /* |
Nicholas D Steeves | 0132761 | 2016-05-19 21:18:45 -0400 | [diff] [blame] | 3001 | * 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] | 3002 | * time. |
| 3003 | */ |
| 3004 | prev_cmp = -1; |
Filipe David Borba Manana | d7396f0 | 2013-08-30 15:46:43 +0100 | [diff] [blame] | 3005 | ret = key_search(b, key, level, &prev_cmp, &slot); |
Filipe Manana | cbca7d5 | 2019-02-18 16:57:26 +0000 | [diff] [blame] | 3006 | if (ret < 0) |
| 3007 | goto done; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 3008 | |
| 3009 | if (level != 0) { |
| 3010 | int dec = 0; |
| 3011 | if (ret && slot > 0) { |
| 3012 | dec = 1; |
| 3013 | slot -= 1; |
| 3014 | } |
| 3015 | p->slots[level] = slot; |
| 3016 | unlock_up(p, level, lowest_unlock, 0, NULL); |
| 3017 | |
| 3018 | if (level == lowest_level) { |
| 3019 | if (dec) |
| 3020 | p->slots[level]++; |
| 3021 | goto done; |
| 3022 | } |
| 3023 | |
Liu Bo | d07b852 | 2017-01-30 12:23:42 -0800 | [diff] [blame] | 3024 | err = read_block_for_search(root, p, &b, level, |
David Sterba | cda79c5 | 2017-02-10 18:44:32 +0100 | [diff] [blame] | 3025 | slot, key); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 3026 | if (err == -EAGAIN) |
| 3027 | goto again; |
| 3028 | if (err) { |
| 3029 | ret = err; |
| 3030 | goto done; |
| 3031 | } |
| 3032 | |
| 3033 | level = btrfs_header_level(b); |
Chris Mason | f82c458 | 2014-11-19 10:25:09 -0800 | [diff] [blame] | 3034 | err = btrfs_tree_read_lock_atomic(b); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 3035 | if (!err) { |
| 3036 | btrfs_set_path_blocking(p); |
| 3037 | btrfs_tree_read_lock(b); |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 3038 | } |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3039 | b = tree_mod_log_rewind(fs_info, p, b, time_seq); |
Josef Bacik | db7f343 | 2013-08-07 14:54:37 -0400 | [diff] [blame] | 3040 | if (!b) { |
| 3041 | ret = -ENOMEM; |
| 3042 | goto done; |
| 3043 | } |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 3044 | p->locks[level] = BTRFS_READ_LOCK; |
| 3045 | p->nodes[level] = b; |
Jan Schmidt | 5d9e75c4 | 2012-05-16 18:25:47 +0200 | [diff] [blame] | 3046 | } else { |
| 3047 | p->slots[level] = slot; |
| 3048 | unlock_up(p, level, lowest_unlock, 0, NULL); |
| 3049 | goto done; |
| 3050 | } |
| 3051 | } |
| 3052 | ret = 1; |
| 3053 | done: |
| 3054 | if (!p->leave_spinning) |
| 3055 | btrfs_set_path_blocking(p); |
| 3056 | if (ret < 0) |
| 3057 | btrfs_release_path(p); |
| 3058 | |
| 3059 | return ret; |
| 3060 | } |
| 3061 | |
| 3062 | /* |
Arne Jansen | 2f38b3e | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3063 | * helper to use instead of search slot if no exact match is needed but |
| 3064 | * instead the next or previous item should be returned. |
| 3065 | * When find_higher is true, the next higher item is returned, the next lower |
| 3066 | * otherwise. |
| 3067 | * When return_any and find_higher are both true, and no higher item is found, |
| 3068 | * return the next lower instead. |
| 3069 | * When return_any is true and find_higher is false, and no lower item is found, |
| 3070 | * return the next higher instead. |
| 3071 | * It returns 0 if any item is found, 1 if none is found (tree empty), and |
| 3072 | * < 0 on error |
| 3073 | */ |
| 3074 | int btrfs_search_slot_for_read(struct btrfs_root *root, |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 3075 | const struct btrfs_key *key, |
| 3076 | struct btrfs_path *p, int find_higher, |
| 3077 | int return_any) |
Arne Jansen | 2f38b3e | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3078 | { |
| 3079 | int ret; |
| 3080 | struct extent_buffer *leaf; |
| 3081 | |
| 3082 | again: |
| 3083 | ret = btrfs_search_slot(NULL, root, key, p, 0, 0); |
| 3084 | if (ret <= 0) |
| 3085 | return ret; |
| 3086 | /* |
| 3087 | * a return value of 1 means the path is at the position where the |
| 3088 | * item should be inserted. Normally this is the next bigger item, |
| 3089 | * but in case the previous item is the last in a leaf, path points |
| 3090 | * to the first free slot in the previous leaf, i.e. at an invalid |
| 3091 | * item. |
| 3092 | */ |
| 3093 | leaf = p->nodes[0]; |
| 3094 | |
| 3095 | if (find_higher) { |
| 3096 | if (p->slots[0] >= btrfs_header_nritems(leaf)) { |
| 3097 | ret = btrfs_next_leaf(root, p); |
| 3098 | if (ret <= 0) |
| 3099 | return ret; |
| 3100 | if (!return_any) |
| 3101 | return 1; |
| 3102 | /* |
| 3103 | * no higher item found, return the next |
| 3104 | * lower instead |
| 3105 | */ |
| 3106 | return_any = 0; |
| 3107 | find_higher = 0; |
| 3108 | btrfs_release_path(p); |
| 3109 | goto again; |
| 3110 | } |
| 3111 | } else { |
Arne Jansen | e679376 | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3112 | if (p->slots[0] == 0) { |
| 3113 | ret = btrfs_prev_leaf(root, p); |
| 3114 | if (ret < 0) |
| 3115 | return ret; |
| 3116 | if (!ret) { |
Filipe David Borba Manana | 23c6bf6 | 2014-01-11 21:28:54 +0000 | [diff] [blame] | 3117 | leaf = p->nodes[0]; |
| 3118 | if (p->slots[0] == btrfs_header_nritems(leaf)) |
| 3119 | p->slots[0]--; |
Arne Jansen | e679376 | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3120 | return 0; |
Arne Jansen | 2f38b3e | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3121 | } |
Arne Jansen | e679376 | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3122 | if (!return_any) |
| 3123 | return 1; |
| 3124 | /* |
| 3125 | * no lower item found, return the next |
| 3126 | * higher instead |
| 3127 | */ |
| 3128 | return_any = 0; |
| 3129 | find_higher = 1; |
| 3130 | btrfs_release_path(p); |
| 3131 | goto again; |
| 3132 | } else { |
Arne Jansen | 2f38b3e | 2011-09-13 11:18:10 +0200 | [diff] [blame] | 3133 | --p->slots[0]; |
| 3134 | } |
| 3135 | } |
| 3136 | return 0; |
| 3137 | } |
| 3138 | |
| 3139 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3140 | * adjust the pointers going up the tree, starting at level |
| 3141 | * making sure the right key of each node is points to 'key'. |
| 3142 | * This is used after shifting pointers to the left, so it stops |
| 3143 | * fixing up pointers when a given leaf/node is not in slot 0 of the |
| 3144 | * higher levels |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3145 | * |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3146 | */ |
Nikolay Borisov | b167fa9 | 2018-06-20 15:48:47 +0300 | [diff] [blame] | 3147 | static void fixup_low_keys(struct btrfs_path *path, |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 3148 | struct btrfs_disk_key *key, int level) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3149 | { |
| 3150 | int i; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3151 | struct extent_buffer *t; |
David Sterba | 0e82bcf | 2018-03-05 16:16:54 +0100 | [diff] [blame] | 3152 | int ret; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3153 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 3154 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3155 | int tslot = path->slots[i]; |
David Sterba | 0e82bcf | 2018-03-05 16:16:54 +0100 | [diff] [blame] | 3156 | |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 3157 | if (!path->nodes[i]) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3158 | break; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3159 | t = path->nodes[i]; |
David Sterba | 0e82bcf | 2018-03-05 16:16:54 +0100 | [diff] [blame] | 3160 | ret = tree_mod_log_insert_key(t, tslot, MOD_LOG_KEY_REPLACE, |
| 3161 | GFP_ATOMIC); |
| 3162 | BUG_ON(ret < 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3163 | btrfs_set_node_key(t, key, tslot); |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3164 | btrfs_mark_buffer_dirty(path->nodes[i]); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3165 | if (tslot != 0) |
| 3166 | break; |
| 3167 | } |
| 3168 | } |
| 3169 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3170 | /* |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3171 | * update item key. |
| 3172 | * |
| 3173 | * This function isn't completely safe. It's the caller's responsibility |
| 3174 | * that the new key won't break the order |
| 3175 | */ |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 3176 | void btrfs_set_item_key_safe(struct btrfs_fs_info *fs_info, |
| 3177 | struct btrfs_path *path, |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 3178 | const struct btrfs_key *new_key) |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3179 | { |
| 3180 | struct btrfs_disk_key disk_key; |
| 3181 | struct extent_buffer *eb; |
| 3182 | int slot; |
| 3183 | |
| 3184 | eb = path->nodes[0]; |
| 3185 | slot = path->slots[0]; |
| 3186 | if (slot > 0) { |
| 3187 | btrfs_item_key(eb, &disk_key, slot - 1); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 3188 | BUG_ON(comp_keys(&disk_key, new_key) >= 0); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3189 | } |
| 3190 | if (slot < btrfs_header_nritems(eb) - 1) { |
| 3191 | btrfs_item_key(eb, &disk_key, slot + 1); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 3192 | BUG_ON(comp_keys(&disk_key, new_key) <= 0); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3193 | } |
| 3194 | |
| 3195 | btrfs_cpu_key_to_disk(&disk_key, new_key); |
| 3196 | btrfs_set_item_key(eb, &disk_key, slot); |
| 3197 | btrfs_mark_buffer_dirty(eb); |
| 3198 | if (slot == 0) |
Nikolay Borisov | b167fa9 | 2018-06-20 15:48:47 +0300 | [diff] [blame] | 3199 | fixup_low_keys(path, &disk_key, 1); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3200 | } |
| 3201 | |
| 3202 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3203 | * 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] | 3204 | * tree. |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3205 | * |
| 3206 | * returns 0 if some ptrs were pushed left, < 0 if there was some horrible |
| 3207 | * 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] | 3208 | */ |
Chris Mason | 98ed517 | 2008-01-03 10:01:48 -0500 | [diff] [blame] | 3209 | static int push_node_left(struct btrfs_trans_handle *trans, |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 3210 | struct extent_buffer *dst, |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 3211 | struct extent_buffer *src, int empty) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3212 | { |
David Sterba | d30a668 | 2019-03-20 14:16:45 +0100 | [diff] [blame] | 3213 | struct btrfs_fs_info *fs_info = trans->fs_info; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3214 | int push_items = 0; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 3215 | int src_nritems; |
| 3216 | int dst_nritems; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3217 | int ret = 0; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3218 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3219 | src_nritems = btrfs_header_nritems(src); |
| 3220 | dst_nritems = btrfs_header_nritems(dst); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3221 | push_items = BTRFS_NODEPTRS_PER_BLOCK(fs_info) - dst_nritems; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3222 | WARN_ON(btrfs_header_generation(src) != trans->transid); |
| 3223 | WARN_ON(btrfs_header_generation(dst) != trans->transid); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 3224 | |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 3225 | if (!empty && src_nritems <= 8) |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 3226 | return 1; |
| 3227 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3228 | if (push_items <= 0) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3229 | return 1; |
| 3230 | |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 3231 | if (empty) { |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 3232 | push_items = min(src_nritems, push_items); |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 3233 | if (push_items < src_nritems) { |
| 3234 | /* leave at least 8 pointers in the node if |
| 3235 | * we aren't going to empty it |
| 3236 | */ |
| 3237 | if (src_nritems - push_items < 8) { |
| 3238 | if (push_items <= 8) |
| 3239 | return 1; |
| 3240 | push_items -= 8; |
| 3241 | } |
| 3242 | } |
| 3243 | } else |
| 3244 | push_items = min(src_nritems - 8, push_items); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3245 | |
David Sterba | ed874f0 | 2019-03-20 14:22:04 +0100 | [diff] [blame] | 3246 | ret = tree_mod_log_eb_copy(dst, src, dst_nritems, 0, push_items); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 3247 | if (ret) { |
Jeff Mahoney | 6664283 | 2016-06-10 18:19:25 -0400 | [diff] [blame] | 3248 | btrfs_abort_transaction(trans, ret); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 3249 | return ret; |
| 3250 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3251 | copy_extent_buffer(dst, src, |
| 3252 | btrfs_node_key_ptr_offset(dst_nritems), |
| 3253 | btrfs_node_key_ptr_offset(0), |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3254 | push_items * sizeof(struct btrfs_key_ptr)); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3255 | |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 3256 | if (push_items < src_nritems) { |
Jan Schmidt | 57911b8 | 2012-10-19 09:22:03 +0200 | [diff] [blame] | 3257 | /* |
David Sterba | bf1d342 | 2018-03-05 15:47:39 +0100 | [diff] [blame] | 3258 | * Don't call tree_mod_log_insert_move here, key removal was |
| 3259 | * already fully logged by tree_mod_log_eb_copy above. |
Jan Schmidt | 57911b8 | 2012-10-19 09:22:03 +0200 | [diff] [blame] | 3260 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3261 | memmove_extent_buffer(src, btrfs_node_key_ptr_offset(0), |
| 3262 | btrfs_node_key_ptr_offset(push_items), |
| 3263 | (src_nritems - push_items) * |
| 3264 | sizeof(struct btrfs_key_ptr)); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 3265 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3266 | btrfs_set_header_nritems(src, src_nritems - push_items); |
| 3267 | btrfs_set_header_nritems(dst, dst_nritems + push_items); |
| 3268 | btrfs_mark_buffer_dirty(src); |
| 3269 | btrfs_mark_buffer_dirty(dst); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3270 | |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 3271 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3272 | } |
| 3273 | |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3274 | /* |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3275 | * try to push data from one node into the next node right in the |
| 3276 | * tree. |
| 3277 | * |
| 3278 | * returns 0 if some ptrs were pushed, < 0 if there was some horrible |
| 3279 | * error, and > 0 if there was no room in the right hand block. |
| 3280 | * |
| 3281 | * this will only push up to 1/2 the contents of the left node over |
| 3282 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3283 | static int balance_node_right(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3284 | struct extent_buffer *dst, |
| 3285 | struct extent_buffer *src) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3286 | { |
David Sterba | 55d32ed | 2019-03-20 14:18:06 +0100 | [diff] [blame] | 3287 | struct btrfs_fs_info *fs_info = trans->fs_info; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3288 | int push_items = 0; |
| 3289 | int max_push; |
| 3290 | int src_nritems; |
| 3291 | int dst_nritems; |
| 3292 | int ret = 0; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3293 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3294 | WARN_ON(btrfs_header_generation(src) != trans->transid); |
| 3295 | WARN_ON(btrfs_header_generation(dst) != trans->transid); |
| 3296 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3297 | src_nritems = btrfs_header_nritems(src); |
| 3298 | dst_nritems = btrfs_header_nritems(dst); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3299 | push_items = BTRFS_NODEPTRS_PER_BLOCK(fs_info) - dst_nritems; |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3300 | if (push_items <= 0) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3301 | return 1; |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 3302 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3303 | if (src_nritems < 4) |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 3304 | return 1; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3305 | |
| 3306 | max_push = src_nritems / 2 + 1; |
| 3307 | /* don't try to empty the node */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3308 | if (max_push >= src_nritems) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3309 | return 1; |
Yan | 252c38f | 2007-08-29 09:11:44 -0400 | [diff] [blame] | 3310 | |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3311 | if (max_push < push_items) |
| 3312 | push_items = max_push; |
| 3313 | |
David Sterba | bf1d342 | 2018-03-05 15:47:39 +0100 | [diff] [blame] | 3314 | ret = tree_mod_log_insert_move(dst, push_items, 0, dst_nritems); |
| 3315 | BUG_ON(ret < 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3316 | memmove_extent_buffer(dst, btrfs_node_key_ptr_offset(push_items), |
| 3317 | btrfs_node_key_ptr_offset(0), |
| 3318 | (dst_nritems) * |
| 3319 | sizeof(struct btrfs_key_ptr)); |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3320 | |
David Sterba | ed874f0 | 2019-03-20 14:22:04 +0100 | [diff] [blame] | 3321 | ret = tree_mod_log_eb_copy(dst, src, 0, src_nritems - push_items, |
| 3322 | push_items); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 3323 | if (ret) { |
Jeff Mahoney | 6664283 | 2016-06-10 18:19:25 -0400 | [diff] [blame] | 3324 | btrfs_abort_transaction(trans, ret); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 3325 | return ret; |
| 3326 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3327 | copy_extent_buffer(dst, src, |
| 3328 | btrfs_node_key_ptr_offset(0), |
| 3329 | btrfs_node_key_ptr_offset(src_nritems - push_items), |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3330 | push_items * sizeof(struct btrfs_key_ptr)); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3331 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3332 | btrfs_set_header_nritems(src, src_nritems - push_items); |
| 3333 | btrfs_set_header_nritems(dst, dst_nritems + push_items); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3334 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3335 | btrfs_mark_buffer_dirty(src); |
| 3336 | btrfs_mark_buffer_dirty(dst); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3337 | |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 3338 | return ret; |
| 3339 | } |
| 3340 | |
| 3341 | /* |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3342 | * helper function to insert a new root level in the tree. |
| 3343 | * A new node is allocated, and a single item is inserted to |
| 3344 | * point to the existing root |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3345 | * |
| 3346 | * returns zero on success or < 0 on failure. |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3347 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3348 | static noinline int insert_new_root(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3349 | struct btrfs_root *root, |
Liu Bo | fdd99c7 | 2013-05-22 12:06:51 +0000 | [diff] [blame] | 3350 | struct btrfs_path *path, int level) |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3351 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3352 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3353 | u64 lower_gen; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3354 | struct extent_buffer *lower; |
| 3355 | struct extent_buffer *c; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3356 | struct extent_buffer *old; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3357 | struct btrfs_disk_key lower_key; |
David Sterba | d9d19a0 | 2018-03-05 16:35:29 +0100 | [diff] [blame] | 3358 | int ret; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3359 | |
| 3360 | BUG_ON(path->nodes[level]); |
| 3361 | BUG_ON(path->nodes[level-1] != root->node); |
| 3362 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3363 | lower = path->nodes[level-1]; |
| 3364 | if (level == 1) |
| 3365 | btrfs_item_key(lower, &lower_key, 0); |
| 3366 | else |
| 3367 | btrfs_node_key(lower, &lower_key, 0); |
| 3368 | |
Filipe Manana | a627947 | 2019-01-25 11:48:51 +0000 | [diff] [blame] | 3369 | c = alloc_tree_block_no_bg_flush(trans, root, 0, &lower_key, level, |
| 3370 | root->node->start, 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3371 | if (IS_ERR(c)) |
| 3372 | return PTR_ERR(c); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3373 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3374 | root_add_used(root, fs_info->nodesize); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3375 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3376 | btrfs_set_header_nritems(c, 1); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3377 | btrfs_set_node_key(c, &lower_key, 0); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3378 | btrfs_set_node_blockptr(c, 0, lower->start); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3379 | lower_gen = btrfs_header_generation(lower); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3380 | WARN_ON(lower_gen != trans->transid); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3381 | |
| 3382 | btrfs_set_node_ptr_generation(c, 0, lower_gen); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3383 | |
| 3384 | btrfs_mark_buffer_dirty(c); |
Chris Mason | d571976 | 2007-03-23 10:01:08 -0400 | [diff] [blame] | 3385 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3386 | old = root->node; |
David Sterba | d9d19a0 | 2018-03-05 16:35:29 +0100 | [diff] [blame] | 3387 | ret = tree_mod_log_insert_root(root->node, c, 0); |
| 3388 | BUG_ON(ret < 0); |
Chris Mason | 240f62c | 2011-03-23 14:54:42 -0400 | [diff] [blame] | 3389 | rcu_assign_pointer(root->node, c); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3390 | |
| 3391 | /* the super has an extra ref to root->node */ |
| 3392 | free_extent_buffer(old); |
| 3393 | |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 3394 | add_root_to_dirty_list(root); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3395 | extent_buffer_get(c); |
| 3396 | path->nodes[level] = c; |
chandan | 95449a1 | 2015-01-15 12:22:03 +0530 | [diff] [blame] | 3397 | path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3398 | path->slots[level] = 0; |
| 3399 | return 0; |
| 3400 | } |
| 3401 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3402 | /* |
| 3403 | * worker function to insert a single pointer in a node. |
| 3404 | * the node should have enough room for the pointer already |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3405 | * |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3406 | * slot and level indicate where you want the key to go, and |
| 3407 | * blocknr is the block the key points to. |
| 3408 | */ |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 3409 | static void insert_ptr(struct btrfs_trans_handle *trans, |
David Sterba | 6ad3cf6 | 2019-03-20 14:32:45 +0100 | [diff] [blame] | 3410 | struct btrfs_path *path, |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 3411 | struct btrfs_disk_key *key, u64 bytenr, |
Jan Schmidt | c3e0696 | 2012-06-21 11:01:06 +0200 | [diff] [blame] | 3412 | int slot, int level) |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3413 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3414 | struct extent_buffer *lower; |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3415 | int nritems; |
Jan Schmidt | f3ea38d | 2012-05-26 11:45:21 +0200 | [diff] [blame] | 3416 | int ret; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3417 | |
| 3418 | BUG_ON(!path->nodes[level]); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3419 | btrfs_assert_tree_locked(path->nodes[level]); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3420 | lower = path->nodes[level]; |
| 3421 | nritems = btrfs_header_nritems(lower); |
Stoyan Gaydarov | c293498 | 2009-04-02 17:05:11 -0400 | [diff] [blame] | 3422 | BUG_ON(slot > nritems); |
David Sterba | 6ad3cf6 | 2019-03-20 14:32:45 +0100 | [diff] [blame] | 3423 | BUG_ON(nritems == BTRFS_NODEPTRS_PER_BLOCK(trans->fs_info)); |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3424 | if (slot != nritems) { |
David Sterba | bf1d342 | 2018-03-05 15:47:39 +0100 | [diff] [blame] | 3425 | if (level) { |
| 3426 | ret = tree_mod_log_insert_move(lower, slot + 1, slot, |
David Sterba | a446a97 | 2018-03-05 15:26:29 +0100 | [diff] [blame] | 3427 | nritems - slot); |
David Sterba | bf1d342 | 2018-03-05 15:47:39 +0100 | [diff] [blame] | 3428 | BUG_ON(ret < 0); |
| 3429 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3430 | memmove_extent_buffer(lower, |
| 3431 | btrfs_node_key_ptr_offset(slot + 1), |
| 3432 | btrfs_node_key_ptr_offset(slot), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3433 | (nritems - slot) * sizeof(struct btrfs_key_ptr)); |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3434 | } |
Jan Schmidt | c3e0696 | 2012-06-21 11:01:06 +0200 | [diff] [blame] | 3435 | if (level) { |
David Sterba | e09c2ef | 2018-03-05 15:09:03 +0100 | [diff] [blame] | 3436 | ret = tree_mod_log_insert_key(lower, slot, MOD_LOG_KEY_ADD, |
| 3437 | GFP_NOFS); |
Jan Schmidt | f3ea38d | 2012-05-26 11:45:21 +0200 | [diff] [blame] | 3438 | BUG_ON(ret < 0); |
| 3439 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3440 | btrfs_set_node_key(lower, key, slot); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3441 | btrfs_set_node_blockptr(lower, slot, bytenr); |
Chris Mason | 74493f7 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3442 | WARN_ON(trans->transid == 0); |
| 3443 | btrfs_set_node_ptr_generation(lower, slot, trans->transid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3444 | btrfs_set_header_nritems(lower, nritems + 1); |
| 3445 | btrfs_mark_buffer_dirty(lower); |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3446 | } |
| 3447 | |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3448 | /* |
| 3449 | * split the node at the specified level in path in two. |
| 3450 | * The path is corrected to point to the appropriate node after the split |
| 3451 | * |
| 3452 | * Before splitting this tries to make some room in the node by pushing |
| 3453 | * left and right, if either one works, it returns right away. |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3454 | * |
| 3455 | * returns 0 on success and < 0 on failure |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3456 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 3457 | static noinline int split_node(struct btrfs_trans_handle *trans, |
| 3458 | struct btrfs_root *root, |
| 3459 | struct btrfs_path *path, int level) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3460 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3461 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3462 | struct extent_buffer *c; |
| 3463 | struct extent_buffer *split; |
| 3464 | struct btrfs_disk_key disk_key; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3465 | int mid; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3466 | int ret; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3467 | u32 c_nritems; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3468 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3469 | c = path->nodes[level]; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3470 | WARN_ON(btrfs_header_generation(c) != trans->transid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3471 | if (c == root->node) { |
Jan Schmidt | d9abbf1 | 2013-03-20 13:49:48 +0000 | [diff] [blame] | 3472 | /* |
Jan Schmidt | 90f8d62 | 2013-04-13 13:19:53 +0000 | [diff] [blame] | 3473 | * trying to split the root, lets make a new one |
| 3474 | * |
Liu Bo | fdd99c7 | 2013-05-22 12:06:51 +0000 | [diff] [blame] | 3475 | * tree mod log: We don't log_removal old root in |
Jan Schmidt | 90f8d62 | 2013-04-13 13:19:53 +0000 | [diff] [blame] | 3476 | * insert_new_root, because that root buffer will be kept as a |
| 3477 | * normal node. We are going to log removal of half of the |
| 3478 | * elements below with tree_mod_log_eb_copy. We're holding a |
| 3479 | * tree lock on the buffer, which is why we cannot race with |
| 3480 | * other tree_mod_log users. |
Jan Schmidt | d9abbf1 | 2013-03-20 13:49:48 +0000 | [diff] [blame] | 3481 | */ |
Liu Bo | fdd99c7 | 2013-05-22 12:06:51 +0000 | [diff] [blame] | 3482 | ret = insert_new_root(trans, root, path, level + 1); |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3483 | if (ret) |
| 3484 | return ret; |
Chris Mason | b361242 | 2009-05-13 19:12:15 -0400 | [diff] [blame] | 3485 | } else { |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 3486 | ret = push_nodes_for_insert(trans, root, path, level); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3487 | c = path->nodes[level]; |
| 3488 | if (!ret && btrfs_header_nritems(c) < |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3489 | BTRFS_NODEPTRS_PER_BLOCK(fs_info) - 3) |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 3490 | return 0; |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 3491 | if (ret < 0) |
| 3492 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3493 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 3494 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3495 | c_nritems = btrfs_header_nritems(c); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 3496 | mid = (c_nritems + 1) / 2; |
| 3497 | btrfs_node_key(c, &disk_key, mid); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3498 | |
Filipe Manana | a627947 | 2019-01-25 11:48:51 +0000 | [diff] [blame] | 3499 | split = alloc_tree_block_no_bg_flush(trans, root, 0, &disk_key, level, |
| 3500 | c->start, 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3501 | if (IS_ERR(split)) |
| 3502 | return PTR_ERR(split); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 3503 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3504 | root_add_used(root, fs_info->nodesize); |
Nikolay Borisov | bc877d2 | 2018-06-18 14:13:19 +0300 | [diff] [blame] | 3505 | ASSERT(btrfs_header_level(c) == level); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3506 | |
David Sterba | ed874f0 | 2019-03-20 14:22:04 +0100 | [diff] [blame] | 3507 | ret = tree_mod_log_eb_copy(split, c, 0, mid, c_nritems - mid); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 3508 | if (ret) { |
Jeff Mahoney | 6664283 | 2016-06-10 18:19:25 -0400 | [diff] [blame] | 3509 | btrfs_abort_transaction(trans, ret); |
Filipe David Borba Manana | 5de865e | 2013-12-20 15:17:46 +0000 | [diff] [blame] | 3510 | return ret; |
| 3511 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3512 | copy_extent_buffer(split, c, |
| 3513 | btrfs_node_key_ptr_offset(0), |
| 3514 | btrfs_node_key_ptr_offset(mid), |
| 3515 | (c_nritems - mid) * sizeof(struct btrfs_key_ptr)); |
| 3516 | btrfs_set_header_nritems(split, c_nritems - mid); |
| 3517 | btrfs_set_header_nritems(c, mid); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3518 | ret = 0; |
| 3519 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3520 | btrfs_mark_buffer_dirty(c); |
| 3521 | btrfs_mark_buffer_dirty(split); |
| 3522 | |
David Sterba | 6ad3cf6 | 2019-03-20 14:32:45 +0100 | [diff] [blame] | 3523 | insert_ptr(trans, path, &disk_key, split->start, |
Jan Schmidt | c3e0696 | 2012-06-21 11:01:06 +0200 | [diff] [blame] | 3524 | path->slots[level + 1] + 1, level + 1); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3525 | |
Chris Mason | 5de08d7 | 2007-02-24 06:24:44 -0500 | [diff] [blame] | 3526 | if (path->slots[level] >= mid) { |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3527 | path->slots[level] -= mid; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3528 | btrfs_tree_unlock(c); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3529 | free_extent_buffer(c); |
| 3530 | path->nodes[level] = split; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 3531 | path->slots[level + 1] += 1; |
| 3532 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3533 | btrfs_tree_unlock(split); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3534 | free_extent_buffer(split); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3535 | } |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3536 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3537 | } |
| 3538 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3539 | /* |
| 3540 | * how many bytes are required to store the items in a leaf. start |
| 3541 | * and nr indicate which items in the leaf to check. This totals up the |
| 3542 | * space used both by the item structs and the item data |
| 3543 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3544 | 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] | 3545 | { |
Josef Bacik | 41be1f3 | 2012-10-15 13:43:18 -0400 | [diff] [blame] | 3546 | struct btrfs_item *start_item; |
| 3547 | struct btrfs_item *end_item; |
| 3548 | struct btrfs_map_token token; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3549 | int data_len; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3550 | int nritems = btrfs_header_nritems(l); |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 3551 | int end = min(nritems, start + nr) - 1; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3552 | |
| 3553 | if (!nr) |
| 3554 | return 0; |
Josef Bacik | 41be1f3 | 2012-10-15 13:43:18 -0400 | [diff] [blame] | 3555 | btrfs_init_map_token(&token); |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 3556 | start_item = btrfs_item_nr(start); |
| 3557 | end_item = btrfs_item_nr(end); |
Josef Bacik | 41be1f3 | 2012-10-15 13:43:18 -0400 | [diff] [blame] | 3558 | data_len = btrfs_token_item_offset(l, start_item, &token) + |
| 3559 | btrfs_token_item_size(l, start_item, &token); |
| 3560 | data_len = data_len - btrfs_token_item_offset(l, end_item, &token); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 3561 | data_len += sizeof(struct btrfs_item) * nr; |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 3562 | WARN_ON(data_len < 0); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3563 | return data_len; |
| 3564 | } |
| 3565 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3566 | /* |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 3567 | * The space between the end of the leaf items and |
| 3568 | * the start of the leaf data. IOW, how much room |
| 3569 | * the leaf has left for both items and data |
| 3570 | */ |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 3571 | noinline int btrfs_leaf_free_space(struct extent_buffer *leaf) |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 3572 | { |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 3573 | struct btrfs_fs_info *fs_info = leaf->fs_info; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3574 | int nritems = btrfs_header_nritems(leaf); |
| 3575 | int ret; |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3576 | |
| 3577 | ret = BTRFS_LEAF_DATA_SIZE(fs_info) - leaf_space_used(leaf, 0, nritems); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3578 | if (ret < 0) { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3579 | btrfs_crit(fs_info, |
| 3580 | "leaf free space ret %d, leaf data size %lu, used %d nritems %d", |
| 3581 | ret, |
| 3582 | (unsigned long) BTRFS_LEAF_DATA_SIZE(fs_info), |
| 3583 | leaf_space_used(leaf, 0, nritems), nritems); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3584 | } |
| 3585 | return ret; |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 3586 | } |
| 3587 | |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3588 | /* |
| 3589 | * min slot controls the lowest index we're willing to push to the |
| 3590 | * right. We'll push up to and including min_slot, but no lower |
| 3591 | */ |
David Sterba | f72f001 | 2019-03-20 14:39:45 +0100 | [diff] [blame] | 3592 | static noinline int __push_leaf_right(struct btrfs_path *path, |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3593 | int data_size, int empty, |
| 3594 | struct extent_buffer *right, |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3595 | int free_space, u32 left_nritems, |
| 3596 | u32 min_slot) |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3597 | { |
David Sterba | f72f001 | 2019-03-20 14:39:45 +0100 | [diff] [blame] | 3598 | struct btrfs_fs_info *fs_info = right->fs_info; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3599 | struct extent_buffer *left = path->nodes[0]; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3600 | struct extent_buffer *upper = path->nodes[1]; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3601 | struct btrfs_map_token token; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3602 | struct btrfs_disk_key disk_key; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3603 | int slot; |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3604 | u32 i; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3605 | int push_space = 0; |
| 3606 | int push_items = 0; |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 3607 | struct btrfs_item *item; |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3608 | u32 nr; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3609 | u32 right_nritems; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3610 | u32 data_end; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3611 | u32 this_item_size; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3612 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3613 | btrfs_init_map_token(&token); |
| 3614 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3615 | if (empty) |
| 3616 | nr = 0; |
| 3617 | else |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3618 | nr = max_t(u32, 1, min_slot); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3619 | |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3620 | if (path->slots[0] >= left_nritems) |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 3621 | push_space += data_size; |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3622 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3623 | slot = path->slots[1]; |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3624 | i = left_nritems - 1; |
| 3625 | while (i >= nr) { |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 3626 | item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3627 | |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3628 | if (!empty && push_items > 0) { |
| 3629 | if (path->slots[0] > i) |
| 3630 | break; |
| 3631 | if (path->slots[0] == i) { |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 3632 | int space = btrfs_leaf_free_space(left); |
| 3633 | |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3634 | if (space + push_space * 2 > free_space) |
| 3635 | break; |
| 3636 | } |
| 3637 | } |
| 3638 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3639 | if (path->slots[0] == i) |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 3640 | push_space += data_size; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3641 | |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3642 | this_item_size = btrfs_item_size(left, item); |
| 3643 | if (this_item_size + sizeof(*item) + push_space > free_space) |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3644 | break; |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3645 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3646 | push_items++; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3647 | push_space += this_item_size + sizeof(*item); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3648 | if (i == 0) |
| 3649 | break; |
| 3650 | i--; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3651 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3652 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3653 | if (push_items == 0) |
| 3654 | goto out_unlock; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3655 | |
Julia Lawall | 6c1500f | 2012-11-03 20:30:18 +0000 | [diff] [blame] | 3656 | WARN_ON(!empty && push_items == left_nritems); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3657 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3658 | /* push left to right */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3659 | right_nritems = btrfs_header_nritems(right); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3660 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3661 | push_space = btrfs_item_end_nr(left, left_nritems - push_items); |
David Sterba | 8f881e8 | 2019-03-20 11:33:10 +0100 | [diff] [blame] | 3662 | push_space -= leaf_data_end(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3663 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3664 | /* make room in the right data area */ |
David Sterba | 8f881e8 | 2019-03-20 11:33:10 +0100 | [diff] [blame] | 3665 | data_end = leaf_data_end(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3666 | memmove_extent_buffer(right, |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 3667 | BTRFS_LEAF_DATA_OFFSET + data_end - push_space, |
| 3668 | BTRFS_LEAF_DATA_OFFSET + data_end, |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3669 | BTRFS_LEAF_DATA_SIZE(fs_info) - data_end); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3670 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3671 | /* copy from the left data area */ |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 3672 | copy_extent_buffer(right, left, BTRFS_LEAF_DATA_OFFSET + |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3673 | BTRFS_LEAF_DATA_SIZE(fs_info) - push_space, |
David Sterba | 8f881e8 | 2019-03-20 11:33:10 +0100 | [diff] [blame] | 3674 | BTRFS_LEAF_DATA_OFFSET + leaf_data_end(left), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3675 | push_space); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3676 | |
| 3677 | memmove_extent_buffer(right, btrfs_item_nr_offset(push_items), |
| 3678 | btrfs_item_nr_offset(0), |
| 3679 | right_nritems * sizeof(struct btrfs_item)); |
| 3680 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3681 | /* copy the items from left to right */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3682 | copy_extent_buffer(right, left, btrfs_item_nr_offset(0), |
| 3683 | btrfs_item_nr_offset(left_nritems - push_items), |
| 3684 | push_items * sizeof(struct btrfs_item)); |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3685 | |
| 3686 | /* update the item pointers */ |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3687 | right_nritems += push_items; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3688 | btrfs_set_header_nritems(right, right_nritems); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3689 | push_space = BTRFS_LEAF_DATA_SIZE(fs_info); |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3690 | for (i = 0; i < right_nritems; i++) { |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 3691 | item = btrfs_item_nr(i); |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3692 | push_space -= btrfs_token_item_size(right, item, &token); |
| 3693 | btrfs_set_token_item_offset(right, item, push_space, &token); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3694 | } |
| 3695 | |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3696 | left_nritems -= push_items; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3697 | btrfs_set_header_nritems(left, left_nritems); |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3698 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3699 | if (left_nritems) |
| 3700 | btrfs_mark_buffer_dirty(left); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3701 | else |
David Sterba | 6a884d7d | 2019-03-20 14:30:02 +0100 | [diff] [blame] | 3702 | btrfs_clean_tree_block(left); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3703 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3704 | btrfs_mark_buffer_dirty(right); |
Chris Mason | a429e51 | 2007-04-18 16:15:28 -0400 | [diff] [blame] | 3705 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3706 | btrfs_item_key(right, &disk_key, 0); |
| 3707 | btrfs_set_node_key(upper, &disk_key, slot + 1); |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3708 | btrfs_mark_buffer_dirty(upper); |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 3709 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3710 | /* then fixup the leaf pointer in the path */ |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3711 | if (path->slots[0] >= left_nritems) { |
| 3712 | path->slots[0] -= left_nritems; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3713 | if (btrfs_header_nritems(path->nodes[0]) == 0) |
David Sterba | 6a884d7d | 2019-03-20 14:30:02 +0100 | [diff] [blame] | 3714 | btrfs_clean_tree_block(path->nodes[0]); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3715 | btrfs_tree_unlock(path->nodes[0]); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3716 | free_extent_buffer(path->nodes[0]); |
| 3717 | path->nodes[0] = right; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3718 | path->slots[1] += 1; |
| 3719 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3720 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3721 | free_extent_buffer(right); |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3722 | } |
| 3723 | return 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3724 | |
| 3725 | out_unlock: |
| 3726 | btrfs_tree_unlock(right); |
| 3727 | free_extent_buffer(right); |
| 3728 | return 1; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3729 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3730 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 3731 | /* |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3732 | * push some data in the path leaf to the right, trying to free up at |
| 3733 | * least data_size bytes. returns zero if the push worked, nonzero otherwise |
| 3734 | * |
| 3735 | * returns 1 if the push failed because the other node didn't have enough |
| 3736 | * 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] | 3737 | * |
| 3738 | * this will push starting from min_slot to the end of the leaf. It won't |
| 3739 | * push any slot lower than min_slot |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3740 | */ |
| 3741 | 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] | 3742 | *root, struct btrfs_path *path, |
| 3743 | int min_data_size, int data_size, |
| 3744 | int empty, u32 min_slot) |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3745 | { |
| 3746 | struct extent_buffer *left = path->nodes[0]; |
| 3747 | struct extent_buffer *right; |
| 3748 | struct extent_buffer *upper; |
| 3749 | int slot; |
| 3750 | int free_space; |
| 3751 | u32 left_nritems; |
| 3752 | int ret; |
| 3753 | |
| 3754 | if (!path->nodes[1]) |
| 3755 | return 1; |
| 3756 | |
| 3757 | slot = path->slots[1]; |
| 3758 | upper = path->nodes[1]; |
| 3759 | if (slot >= btrfs_header_nritems(upper) - 1) |
| 3760 | return 1; |
| 3761 | |
| 3762 | btrfs_assert_tree_locked(path->nodes[1]); |
| 3763 | |
David Sterba | d0d20b0 | 2019-03-20 14:54:01 +0100 | [diff] [blame] | 3764 | right = read_node_slot(upper, slot + 1); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 3765 | /* |
| 3766 | * slot + 1 is not valid or we fail to read the right node, |
| 3767 | * no big deal, just return. |
| 3768 | */ |
| 3769 | if (IS_ERR(right)) |
Tsutomu Itoh | 91ca338 | 2011-01-05 02:32:22 +0000 | [diff] [blame] | 3770 | return 1; |
| 3771 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3772 | btrfs_tree_lock(right); |
David Sterba | 8bead25 | 2018-04-04 02:03:48 +0200 | [diff] [blame] | 3773 | btrfs_set_lock_blocking_write(right); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3774 | |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 3775 | free_space = btrfs_leaf_free_space(right); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3776 | if (free_space < data_size) |
| 3777 | goto out_unlock; |
| 3778 | |
| 3779 | /* cow and double check */ |
| 3780 | ret = btrfs_cow_block(trans, root, right, upper, |
| 3781 | slot + 1, &right); |
| 3782 | if (ret) |
| 3783 | goto out_unlock; |
| 3784 | |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 3785 | free_space = btrfs_leaf_free_space(right); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3786 | if (free_space < data_size) |
| 3787 | goto out_unlock; |
| 3788 | |
| 3789 | left_nritems = btrfs_header_nritems(left); |
| 3790 | if (left_nritems == 0) |
| 3791 | goto out_unlock; |
| 3792 | |
Filipe David Borba Manana | 2ef1fed | 2013-12-04 22:17:39 +0000 | [diff] [blame] | 3793 | if (path->slots[0] == left_nritems && !empty) { |
| 3794 | /* Key greater than all keys in the leaf, right neighbor has |
| 3795 | * enough room for it and we're not emptying our leaf to delete |
| 3796 | * it, therefore use right neighbor to insert the new item and |
Andrea Gelmini | 52042d8 | 2018-11-28 12:05:13 +0100 | [diff] [blame] | 3797 | * no need to touch/dirty our left leaf. */ |
Filipe David Borba Manana | 2ef1fed | 2013-12-04 22:17:39 +0000 | [diff] [blame] | 3798 | btrfs_tree_unlock(left); |
| 3799 | free_extent_buffer(left); |
| 3800 | path->nodes[0] = right; |
| 3801 | path->slots[0] = 0; |
| 3802 | path->slots[1]++; |
| 3803 | return 0; |
| 3804 | } |
| 3805 | |
David Sterba | f72f001 | 2019-03-20 14:39:45 +0100 | [diff] [blame] | 3806 | return __push_leaf_right(path, min_data_size, empty, |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3807 | right, free_space, left_nritems, min_slot); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3808 | out_unlock: |
| 3809 | btrfs_tree_unlock(right); |
| 3810 | free_extent_buffer(right); |
| 3811 | return 1; |
| 3812 | } |
| 3813 | |
| 3814 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3815 | * push some data in the path leaf to the left, trying to free up at |
| 3816 | * least data_size bytes. returns zero if the push worked, nonzero otherwise |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3817 | * |
| 3818 | * max_slot can put a limit on how far into the leaf we'll push items. The |
| 3819 | * item at 'max_slot' won't be touched. Use (u32)-1 to make us do all the |
| 3820 | * items |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3821 | */ |
David Sterba | 8087c19 | 2019-03-20 14:40:41 +0100 | [diff] [blame] | 3822 | static noinline int __push_leaf_left(struct btrfs_path *path, int data_size, |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3823 | int empty, struct extent_buffer *left, |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3824 | int free_space, u32 right_nritems, |
| 3825 | u32 max_slot) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3826 | { |
David Sterba | 8087c19 | 2019-03-20 14:40:41 +0100 | [diff] [blame] | 3827 | struct btrfs_fs_info *fs_info = left->fs_info; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3828 | struct btrfs_disk_key disk_key; |
| 3829 | struct extent_buffer *right = path->nodes[0]; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3830 | int i; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3831 | int push_space = 0; |
| 3832 | int push_items = 0; |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 3833 | struct btrfs_item *item; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3834 | u32 old_left_nritems; |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3835 | u32 nr; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3836 | int ret = 0; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3837 | u32 this_item_size; |
| 3838 | u32 old_left_item_size; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3839 | struct btrfs_map_token token; |
| 3840 | |
| 3841 | btrfs_init_map_token(&token); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3842 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3843 | if (empty) |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3844 | nr = min(right_nritems, max_slot); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3845 | else |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3846 | nr = min(right_nritems - 1, max_slot); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3847 | |
| 3848 | for (i = 0; i < nr; i++) { |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 3849 | item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3850 | |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3851 | if (!empty && push_items > 0) { |
| 3852 | if (path->slots[0] < i) |
| 3853 | break; |
| 3854 | if (path->slots[0] == i) { |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 3855 | int space = btrfs_leaf_free_space(right); |
| 3856 | |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 3857 | if (space + push_space * 2 > free_space) |
| 3858 | break; |
| 3859 | } |
| 3860 | } |
| 3861 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3862 | if (path->slots[0] == i) |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 3863 | push_space += data_size; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3864 | |
| 3865 | this_item_size = btrfs_item_size(right, item); |
| 3866 | if (this_item_size + sizeof(*item) + push_space > free_space) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3867 | break; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3868 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3869 | push_items++; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3870 | push_space += this_item_size + sizeof(*item); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3871 | } |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3872 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3873 | if (push_items == 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3874 | ret = 1; |
| 3875 | goto out; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3876 | } |
Dulshani Gunawardhana | fae7f21 | 2013-10-31 10:30:08 +0530 | [diff] [blame] | 3877 | WARN_ON(!empty && push_items == btrfs_header_nritems(right)); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3878 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3879 | /* push data from right to left */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3880 | copy_extent_buffer(left, right, |
| 3881 | btrfs_item_nr_offset(btrfs_header_nritems(left)), |
| 3882 | btrfs_item_nr_offset(0), |
| 3883 | push_items * sizeof(struct btrfs_item)); |
| 3884 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3885 | push_space = BTRFS_LEAF_DATA_SIZE(fs_info) - |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3886 | btrfs_item_offset_nr(right, push_items - 1); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3887 | |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 3888 | copy_extent_buffer(left, right, BTRFS_LEAF_DATA_OFFSET + |
David Sterba | 8f881e8 | 2019-03-20 11:33:10 +0100 | [diff] [blame] | 3889 | leaf_data_end(left) - push_space, |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 3890 | BTRFS_LEAF_DATA_OFFSET + |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3891 | btrfs_item_offset_nr(right, push_items - 1), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3892 | push_space); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3893 | old_left_nritems = btrfs_header_nritems(left); |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 3894 | BUG_ON(old_left_nritems <= 0); |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 3895 | |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3896 | 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] | 3897 | for (i = old_left_nritems; i < old_left_nritems + push_items; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3898 | u32 ioff; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3899 | |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 3900 | item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3901 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3902 | ioff = btrfs_token_item_offset(left, item, &token); |
| 3903 | btrfs_set_token_item_offset(left, item, |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3904 | ioff - (BTRFS_LEAF_DATA_SIZE(fs_info) - old_left_item_size), |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3905 | &token); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3906 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3907 | btrfs_set_header_nritems(left, old_left_nritems + push_items); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3908 | |
| 3909 | /* fixup right node */ |
Julia Lawall | 31b1a2b | 2012-11-03 10:58:34 +0000 | [diff] [blame] | 3910 | if (push_items > right_nritems) |
| 3911 | WARN(1, KERN_CRIT "push items %d nr %u\n", push_items, |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3912 | right_nritems); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3913 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3914 | if (push_items < right_nritems) { |
| 3915 | push_space = btrfs_item_offset_nr(right, push_items - 1) - |
David Sterba | 8f881e8 | 2019-03-20 11:33:10 +0100 | [diff] [blame] | 3916 | leaf_data_end(right); |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 3917 | memmove_extent_buffer(right, BTRFS_LEAF_DATA_OFFSET + |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3918 | BTRFS_LEAF_DATA_SIZE(fs_info) - push_space, |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 3919 | BTRFS_LEAF_DATA_OFFSET + |
David Sterba | 8f881e8 | 2019-03-20 11:33:10 +0100 | [diff] [blame] | 3920 | leaf_data_end(right), push_space); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3921 | |
| 3922 | memmove_extent_buffer(right, btrfs_item_nr_offset(0), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3923 | btrfs_item_nr_offset(push_items), |
| 3924 | (btrfs_header_nritems(right) - push_items) * |
| 3925 | sizeof(struct btrfs_item)); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3926 | } |
Yan | eef1c49 | 2007-11-26 10:58:13 -0500 | [diff] [blame] | 3927 | right_nritems -= push_items; |
| 3928 | btrfs_set_header_nritems(right, right_nritems); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 3929 | push_space = BTRFS_LEAF_DATA_SIZE(fs_info); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3930 | for (i = 0; i < right_nritems; i++) { |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 3931 | item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3932 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 3933 | push_space = push_space - btrfs_token_item_size(right, |
| 3934 | item, &token); |
| 3935 | btrfs_set_token_item_offset(right, item, push_space, &token); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3936 | } |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 3937 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3938 | btrfs_mark_buffer_dirty(left); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 3939 | if (right_nritems) |
| 3940 | btrfs_mark_buffer_dirty(right); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3941 | else |
David Sterba | 6a884d7d | 2019-03-20 14:30:02 +0100 | [diff] [blame] | 3942 | btrfs_clean_tree_block(right); |
Chris Mason | 098f59c | 2007-05-11 11:33:21 -0400 | [diff] [blame] | 3943 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3944 | btrfs_item_key(right, &disk_key, 0); |
Nikolay Borisov | b167fa9 | 2018-06-20 15:48:47 +0300 | [diff] [blame] | 3945 | fixup_low_keys(path, &disk_key, 1); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3946 | |
| 3947 | /* then fixup the leaf pointer in the path */ |
| 3948 | if (path->slots[0] < push_items) { |
| 3949 | path->slots[0] += old_left_nritems; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3950 | btrfs_tree_unlock(path->nodes[0]); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3951 | free_extent_buffer(path->nodes[0]); |
| 3952 | path->nodes[0] = left; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3953 | path->slots[1] -= 1; |
| 3954 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3955 | btrfs_tree_unlock(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3956 | free_extent_buffer(left); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3957 | path->slots[0] -= push_items; |
| 3958 | } |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 3959 | BUG_ON(path->slots[0] < 0); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3960 | return ret; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3961 | out: |
| 3962 | btrfs_tree_unlock(left); |
| 3963 | free_extent_buffer(left); |
| 3964 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3965 | } |
| 3966 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3967 | /* |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3968 | * push some data in the path leaf to the left, trying to free up at |
| 3969 | * least data_size bytes. returns zero if the push worked, nonzero otherwise |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3970 | * |
| 3971 | * max_slot can put a limit on how far into the leaf we'll push items. The |
| 3972 | * item at 'max_slot' won't be touched. Use (u32)-1 to make us push all the |
| 3973 | * items |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3974 | */ |
| 3975 | 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] | 3976 | *root, struct btrfs_path *path, int min_data_size, |
| 3977 | int data_size, int empty, u32 max_slot) |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3978 | { |
| 3979 | struct extent_buffer *right = path->nodes[0]; |
| 3980 | struct extent_buffer *left; |
| 3981 | int slot; |
| 3982 | int free_space; |
| 3983 | u32 right_nritems; |
| 3984 | int ret = 0; |
| 3985 | |
| 3986 | slot = path->slots[1]; |
| 3987 | if (slot == 0) |
| 3988 | return 1; |
| 3989 | if (!path->nodes[1]) |
| 3990 | return 1; |
| 3991 | |
| 3992 | right_nritems = btrfs_header_nritems(right); |
| 3993 | if (right_nritems == 0) |
| 3994 | return 1; |
| 3995 | |
| 3996 | btrfs_assert_tree_locked(path->nodes[1]); |
| 3997 | |
David Sterba | d0d20b0 | 2019-03-20 14:54:01 +0100 | [diff] [blame] | 3998 | left = read_node_slot(path->nodes[1], slot - 1); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 3999 | /* |
| 4000 | * slot - 1 is not valid or we fail to read the left node, |
| 4001 | * no big deal, just return. |
| 4002 | */ |
| 4003 | if (IS_ERR(left)) |
Tsutomu Itoh | 91ca338 | 2011-01-05 02:32:22 +0000 | [diff] [blame] | 4004 | return 1; |
| 4005 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4006 | btrfs_tree_lock(left); |
David Sterba | 8bead25 | 2018-04-04 02:03:48 +0200 | [diff] [blame] | 4007 | btrfs_set_lock_blocking_write(left); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4008 | |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4009 | free_space = btrfs_leaf_free_space(left); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4010 | if (free_space < data_size) { |
| 4011 | ret = 1; |
| 4012 | goto out; |
| 4013 | } |
| 4014 | |
| 4015 | /* cow and double check */ |
| 4016 | ret = btrfs_cow_block(trans, root, left, |
| 4017 | path->nodes[1], slot - 1, &left); |
| 4018 | if (ret) { |
| 4019 | /* we hit -ENOSPC, but it isn't fatal here */ |
Jeff Mahoney | 79787ea | 2012-03-12 16:03:00 +0100 | [diff] [blame] | 4020 | if (ret == -ENOSPC) |
| 4021 | ret = 1; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4022 | goto out; |
| 4023 | } |
| 4024 | |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4025 | free_space = btrfs_leaf_free_space(left); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4026 | if (free_space < data_size) { |
| 4027 | ret = 1; |
| 4028 | goto out; |
| 4029 | } |
| 4030 | |
David Sterba | 8087c19 | 2019-03-20 14:40:41 +0100 | [diff] [blame] | 4031 | return __push_leaf_left(path, min_data_size, |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4032 | empty, left, free_space, right_nritems, |
| 4033 | max_slot); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4034 | out: |
| 4035 | btrfs_tree_unlock(left); |
| 4036 | free_extent_buffer(left); |
| 4037 | return ret; |
| 4038 | } |
| 4039 | |
| 4040 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4041 | * split the path's leaf in two, making sure there is at least data_size |
| 4042 | * available for the resulting leaf level of the path. |
| 4043 | */ |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4044 | static noinline void copy_for_split(struct btrfs_trans_handle *trans, |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4045 | struct btrfs_path *path, |
| 4046 | struct extent_buffer *l, |
| 4047 | struct extent_buffer *right, |
| 4048 | int slot, int mid, int nritems) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4049 | { |
David Sterba | 94f94ad | 2019-03-20 14:42:33 +0100 | [diff] [blame] | 4050 | struct btrfs_fs_info *fs_info = trans->fs_info; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4051 | int data_copy_size; |
| 4052 | int rt_data_off; |
| 4053 | int i; |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 4054 | struct btrfs_disk_key disk_key; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4055 | struct btrfs_map_token token; |
| 4056 | |
| 4057 | btrfs_init_map_token(&token); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4058 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4059 | nritems = nritems - mid; |
| 4060 | btrfs_set_header_nritems(right, nritems); |
David Sterba | 8f881e8 | 2019-03-20 11:33:10 +0100 | [diff] [blame] | 4061 | data_copy_size = btrfs_item_end_nr(l, mid) - leaf_data_end(l); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4062 | |
| 4063 | copy_extent_buffer(right, l, btrfs_item_nr_offset(0), |
| 4064 | btrfs_item_nr_offset(mid), |
| 4065 | nritems * sizeof(struct btrfs_item)); |
| 4066 | |
| 4067 | copy_extent_buffer(right, l, |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 4068 | BTRFS_LEAF_DATA_OFFSET + BTRFS_LEAF_DATA_SIZE(fs_info) - |
| 4069 | data_copy_size, BTRFS_LEAF_DATA_OFFSET + |
David Sterba | 8f881e8 | 2019-03-20 11:33:10 +0100 | [diff] [blame] | 4070 | leaf_data_end(l), data_copy_size); |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4071 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 4072 | rt_data_off = BTRFS_LEAF_DATA_SIZE(fs_info) - btrfs_item_end_nr(l, mid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4073 | |
| 4074 | for (i = 0; i < nritems; i++) { |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4075 | struct btrfs_item *item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4076 | u32 ioff; |
| 4077 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4078 | ioff = btrfs_token_item_offset(right, item, &token); |
| 4079 | btrfs_set_token_item_offset(right, item, |
| 4080 | ioff + rt_data_off, &token); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 4081 | } |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4082 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4083 | btrfs_set_header_nritems(l, mid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4084 | btrfs_item_key(right, &disk_key, 0); |
David Sterba | 6ad3cf6 | 2019-03-20 14:32:45 +0100 | [diff] [blame] | 4085 | insert_ptr(trans, path, &disk_key, right->start, path->slots[1] + 1, 1); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4086 | |
| 4087 | btrfs_mark_buffer_dirty(right); |
| 4088 | btrfs_mark_buffer_dirty(l); |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 4089 | BUG_ON(path->slots[0] != slot); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4090 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4091 | if (mid <= slot) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4092 | btrfs_tree_unlock(path->nodes[0]); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4093 | free_extent_buffer(path->nodes[0]); |
| 4094 | path->nodes[0] = right; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4095 | path->slots[0] -= mid; |
| 4096 | path->slots[1] += 1; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4097 | } else { |
| 4098 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4099 | free_extent_buffer(right); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4100 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4101 | |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 4102 | BUG_ON(path->slots[0] < 0); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4103 | } |
| 4104 | |
| 4105 | /* |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4106 | * double splits happen when we need to insert a big item in the middle |
| 4107 | * of a leaf. A double split can leave us with 3 mostly empty leaves: |
| 4108 | * leaf: [ slots 0 - N] [ our target ] [ N + 1 - total in leaf ] |
| 4109 | * A B C |
| 4110 | * |
| 4111 | * We avoid this by trying to push the items on either side of our target |
| 4112 | * into the adjacent leaves. If all goes well we can avoid the double split |
| 4113 | * completely. |
| 4114 | */ |
| 4115 | static noinline int push_for_double_split(struct btrfs_trans_handle *trans, |
| 4116 | struct btrfs_root *root, |
| 4117 | struct btrfs_path *path, |
| 4118 | int data_size) |
| 4119 | { |
| 4120 | int ret; |
| 4121 | int progress = 0; |
| 4122 | int slot; |
| 4123 | u32 nritems; |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4124 | int space_needed = data_size; |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4125 | |
| 4126 | slot = path->slots[0]; |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4127 | if (slot < btrfs_header_nritems(path->nodes[0])) |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4128 | space_needed -= btrfs_leaf_free_space(path->nodes[0]); |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4129 | |
| 4130 | /* |
| 4131 | * try to push all the items after our slot into the |
| 4132 | * right leaf |
| 4133 | */ |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4134 | ret = push_leaf_right(trans, root, path, 1, space_needed, 0, slot); |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4135 | if (ret < 0) |
| 4136 | return ret; |
| 4137 | |
| 4138 | if (ret == 0) |
| 4139 | progress++; |
| 4140 | |
| 4141 | nritems = btrfs_header_nritems(path->nodes[0]); |
| 4142 | /* |
| 4143 | * our goal is to get our slot at the start or end of a leaf. If |
| 4144 | * we've done so we're done |
| 4145 | */ |
| 4146 | if (path->slots[0] == 0 || path->slots[0] == nritems) |
| 4147 | return 0; |
| 4148 | |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4149 | if (btrfs_leaf_free_space(path->nodes[0]) >= data_size) |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4150 | return 0; |
| 4151 | |
| 4152 | /* try to push all the items before our slot into the next leaf */ |
| 4153 | slot = path->slots[0]; |
Filipe Manana | 263d399 | 2017-02-17 18:43:57 +0000 | [diff] [blame] | 4154 | space_needed = data_size; |
| 4155 | if (slot > 0) |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4156 | space_needed -= btrfs_leaf_free_space(path->nodes[0]); |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4157 | ret = push_leaf_left(trans, root, path, 1, space_needed, 0, slot); |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4158 | if (ret < 0) |
| 4159 | return ret; |
| 4160 | |
| 4161 | if (ret == 0) |
| 4162 | progress++; |
| 4163 | |
| 4164 | if (progress) |
| 4165 | return 0; |
| 4166 | return 1; |
| 4167 | } |
| 4168 | |
| 4169 | /* |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4170 | * split the path's leaf in two, making sure there is at least data_size |
| 4171 | * available for the resulting leaf level of the path. |
| 4172 | * |
| 4173 | * returns 0 if all went well and < 0 on failure. |
| 4174 | */ |
| 4175 | static noinline int split_leaf(struct btrfs_trans_handle *trans, |
| 4176 | struct btrfs_root *root, |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 4177 | const struct btrfs_key *ins_key, |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4178 | struct btrfs_path *path, int data_size, |
| 4179 | int extend) |
| 4180 | { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4181 | struct btrfs_disk_key disk_key; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4182 | struct extent_buffer *l; |
| 4183 | u32 nritems; |
| 4184 | int mid; |
| 4185 | int slot; |
| 4186 | struct extent_buffer *right; |
Daniel Dressler | b7a0365 | 2014-11-12 13:43:09 +0900 | [diff] [blame] | 4187 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4188 | int ret = 0; |
| 4189 | int wret; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4190 | int split; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4191 | int num_doubles = 0; |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4192 | int tried_avoid_double = 0; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4193 | |
Yan, Zheng | a571952 | 2009-09-24 09:17:31 -0400 | [diff] [blame] | 4194 | l = path->nodes[0]; |
| 4195 | slot = path->slots[0]; |
| 4196 | if (extend && data_size + btrfs_item_size_nr(l, slot) + |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 4197 | sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(fs_info)) |
Yan, Zheng | a571952 | 2009-09-24 09:17:31 -0400 | [diff] [blame] | 4198 | return -EOVERFLOW; |
| 4199 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4200 | /* first try to make some room by pushing left and right */ |
Liu Bo | 33157e0 | 2013-05-22 12:07:06 +0000 | [diff] [blame] | 4201 | if (data_size && path->nodes[1]) { |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4202 | int space_needed = data_size; |
| 4203 | |
| 4204 | if (slot < btrfs_header_nritems(l)) |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4205 | space_needed -= btrfs_leaf_free_space(l); |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4206 | |
| 4207 | wret = push_leaf_right(trans, root, path, space_needed, |
| 4208 | space_needed, 0, 0); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4209 | if (wret < 0) |
| 4210 | return wret; |
| 4211 | if (wret) { |
Filipe Manana | 263d399 | 2017-02-17 18:43:57 +0000 | [diff] [blame] | 4212 | space_needed = data_size; |
| 4213 | if (slot > 0) |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4214 | space_needed -= btrfs_leaf_free_space(l); |
Filipe David Borba Manana | 5a4267c | 2013-11-25 03:20:46 +0000 | [diff] [blame] | 4215 | wret = push_leaf_left(trans, root, path, space_needed, |
| 4216 | space_needed, 0, (u32)-1); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4217 | if (wret < 0) |
| 4218 | return wret; |
| 4219 | } |
| 4220 | l = path->nodes[0]; |
| 4221 | |
| 4222 | /* did the pushes work? */ |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4223 | if (btrfs_leaf_free_space(l) >= data_size) |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4224 | return 0; |
| 4225 | } |
| 4226 | |
| 4227 | if (!path->nodes[1]) { |
Liu Bo | fdd99c7 | 2013-05-22 12:06:51 +0000 | [diff] [blame] | 4228 | ret = insert_new_root(trans, root, path, 1); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4229 | if (ret) |
| 4230 | return ret; |
| 4231 | } |
| 4232 | again: |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4233 | split = 1; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4234 | l = path->nodes[0]; |
| 4235 | slot = path->slots[0]; |
| 4236 | nritems = btrfs_header_nritems(l); |
| 4237 | mid = (nritems + 1) / 2; |
| 4238 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4239 | if (mid <= slot) { |
| 4240 | if (nritems == 1 || |
| 4241 | leaf_space_used(l, mid, nritems - mid) + data_size > |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 4242 | BTRFS_LEAF_DATA_SIZE(fs_info)) { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4243 | if (slot >= nritems) { |
| 4244 | split = 0; |
| 4245 | } else { |
| 4246 | mid = slot; |
| 4247 | if (mid != nritems && |
| 4248 | leaf_space_used(l, mid, nritems - mid) + |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 4249 | data_size > BTRFS_LEAF_DATA_SIZE(fs_info)) { |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4250 | if (data_size && !tried_avoid_double) |
| 4251 | goto push_for_double; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4252 | split = 2; |
| 4253 | } |
| 4254 | } |
| 4255 | } |
| 4256 | } else { |
| 4257 | if (leaf_space_used(l, 0, mid) + data_size > |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 4258 | BTRFS_LEAF_DATA_SIZE(fs_info)) { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4259 | if (!extend && data_size && slot == 0) { |
| 4260 | split = 0; |
| 4261 | } else if ((extend || !data_size) && slot == 0) { |
| 4262 | mid = 1; |
| 4263 | } else { |
| 4264 | mid = slot; |
| 4265 | if (mid != nritems && |
| 4266 | leaf_space_used(l, mid, nritems - mid) + |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 4267 | data_size > BTRFS_LEAF_DATA_SIZE(fs_info)) { |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4268 | if (data_size && !tried_avoid_double) |
| 4269 | goto push_for_double; |
Dulshani Gunawardhana | 6787125 | 2013-10-31 10:33:04 +0530 | [diff] [blame] | 4270 | split = 2; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4271 | } |
| 4272 | } |
| 4273 | } |
| 4274 | } |
| 4275 | |
| 4276 | if (split == 0) |
| 4277 | btrfs_cpu_key_to_disk(&disk_key, ins_key); |
| 4278 | else |
| 4279 | btrfs_item_key(l, &disk_key, mid); |
| 4280 | |
Filipe Manana | a627947 | 2019-01-25 11:48:51 +0000 | [diff] [blame] | 4281 | right = alloc_tree_block_no_bg_flush(trans, root, 0, &disk_key, 0, |
| 4282 | l->start, 0); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 4283 | if (IS_ERR(right)) |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4284 | return PTR_ERR(right); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 4285 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 4286 | root_add_used(root, fs_info->nodesize); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4287 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4288 | if (split == 0) { |
| 4289 | if (mid <= slot) { |
| 4290 | btrfs_set_header_nritems(right, 0); |
David Sterba | 6ad3cf6 | 2019-03-20 14:32:45 +0100 | [diff] [blame] | 4291 | insert_ptr(trans, path, &disk_key, |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 4292 | right->start, path->slots[1] + 1, 1); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4293 | btrfs_tree_unlock(path->nodes[0]); |
| 4294 | free_extent_buffer(path->nodes[0]); |
| 4295 | path->nodes[0] = right; |
| 4296 | path->slots[0] = 0; |
| 4297 | path->slots[1] += 1; |
| 4298 | } else { |
| 4299 | btrfs_set_header_nritems(right, 0); |
David Sterba | 6ad3cf6 | 2019-03-20 14:32:45 +0100 | [diff] [blame] | 4300 | insert_ptr(trans, path, &disk_key, |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 4301 | right->start, path->slots[1], 1); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4302 | btrfs_tree_unlock(path->nodes[0]); |
| 4303 | free_extent_buffer(path->nodes[0]); |
| 4304 | path->nodes[0] = right; |
| 4305 | path->slots[0] = 0; |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4306 | if (path->slots[1] == 0) |
Nikolay Borisov | b167fa9 | 2018-06-20 15:48:47 +0300 | [diff] [blame] | 4307 | fixup_low_keys(path, &disk_key, 1); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4308 | } |
Liu Bo | 196e024 | 2016-09-07 14:48:28 -0700 | [diff] [blame] | 4309 | /* |
| 4310 | * We create a new leaf 'right' for the required ins_len and |
| 4311 | * we'll do btrfs_mark_buffer_dirty() on this leaf after copying |
| 4312 | * the content of ins_len to 'right'. |
| 4313 | */ |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4314 | return ret; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4315 | } |
| 4316 | |
David Sterba | 94f94ad | 2019-03-20 14:42:33 +0100 | [diff] [blame] | 4317 | copy_for_split(trans, path, l, right, slot, mid, nritems); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4318 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4319 | if (split == 2) { |
Chris Mason | cc0c553 | 2007-10-25 15:42:57 -0400 | [diff] [blame] | 4320 | BUG_ON(num_doubles != 0); |
| 4321 | num_doubles++; |
| 4322 | goto again; |
Chris Mason | 3326d1b | 2007-10-15 16:18:25 -0400 | [diff] [blame] | 4323 | } |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4324 | |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4325 | return 0; |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4326 | |
| 4327 | push_for_double: |
| 4328 | push_for_double_split(trans, root, path, data_size); |
| 4329 | tried_avoid_double = 1; |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4330 | if (btrfs_leaf_free_space(path->nodes[0]) >= data_size) |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 4331 | return 0; |
| 4332 | goto again; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4333 | } |
| 4334 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4335 | static noinline int setup_leaf_for_split(struct btrfs_trans_handle *trans, |
| 4336 | struct btrfs_root *root, |
| 4337 | struct btrfs_path *path, int ins_len) |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4338 | { |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4339 | struct btrfs_key key; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4340 | struct extent_buffer *leaf; |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4341 | struct btrfs_file_extent_item *fi; |
| 4342 | u64 extent_len = 0; |
| 4343 | u32 item_size; |
| 4344 | int ret; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4345 | |
| 4346 | leaf = path->nodes[0]; |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4347 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
| 4348 | |
| 4349 | BUG_ON(key.type != BTRFS_EXTENT_DATA_KEY && |
| 4350 | key.type != BTRFS_EXTENT_CSUM_KEY); |
| 4351 | |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4352 | if (btrfs_leaf_free_space(leaf) >= ins_len) |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4353 | return 0; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4354 | |
| 4355 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4356 | if (key.type == BTRFS_EXTENT_DATA_KEY) { |
| 4357 | fi = btrfs_item_ptr(leaf, path->slots[0], |
| 4358 | struct btrfs_file_extent_item); |
| 4359 | extent_len = btrfs_file_extent_num_bytes(leaf, fi); |
| 4360 | } |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 4361 | btrfs_release_path(path); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4362 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4363 | path->keep_locks = 1; |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4364 | path->search_for_split = 1; |
| 4365 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4366 | path->search_for_split = 0; |
Filipe Manana | a8df6fe | 2015-01-20 12:40:53 +0000 | [diff] [blame] | 4367 | if (ret > 0) |
| 4368 | ret = -EAGAIN; |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4369 | if (ret < 0) |
| 4370 | goto err; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4371 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4372 | ret = -EAGAIN; |
| 4373 | leaf = path->nodes[0]; |
Filipe Manana | a8df6fe | 2015-01-20 12:40:53 +0000 | [diff] [blame] | 4374 | /* if our item isn't there, return now */ |
| 4375 | if (item_size != btrfs_item_size_nr(leaf, path->slots[0])) |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4376 | goto err; |
| 4377 | |
Chris Mason | 109f6ae | 2010-04-02 09:20:18 -0400 | [diff] [blame] | 4378 | /* the leaf has changed, it now has room. return now */ |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4379 | if (btrfs_leaf_free_space(path->nodes[0]) >= ins_len) |
Chris Mason | 109f6ae | 2010-04-02 09:20:18 -0400 | [diff] [blame] | 4380 | goto err; |
| 4381 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4382 | if (key.type == BTRFS_EXTENT_DATA_KEY) { |
| 4383 | fi = btrfs_item_ptr(leaf, path->slots[0], |
| 4384 | struct btrfs_file_extent_item); |
| 4385 | if (extent_len != btrfs_file_extent_num_bytes(leaf, fi)) |
| 4386 | goto err; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4387 | } |
| 4388 | |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 4389 | btrfs_set_path_blocking(path); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4390 | ret = split_leaf(trans, root, &key, path, ins_len, 1); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 4391 | if (ret) |
| 4392 | goto err; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4393 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4394 | path->keep_locks = 0; |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 4395 | btrfs_unlock_up_safe(path, 1); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4396 | return 0; |
| 4397 | err: |
| 4398 | path->keep_locks = 0; |
| 4399 | return ret; |
| 4400 | } |
| 4401 | |
David Sterba | 25263cd | 2019-03-20 14:44:57 +0100 | [diff] [blame] | 4402 | static noinline int split_item(struct btrfs_path *path, |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 4403 | const struct btrfs_key *new_key, |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4404 | unsigned long split_offset) |
| 4405 | { |
| 4406 | struct extent_buffer *leaf; |
| 4407 | struct btrfs_item *item; |
| 4408 | struct btrfs_item *new_item; |
| 4409 | int slot; |
| 4410 | char *buf; |
| 4411 | u32 nritems; |
| 4412 | u32 item_size; |
| 4413 | u32 orig_offset; |
| 4414 | struct btrfs_disk_key disk_key; |
| 4415 | |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 4416 | leaf = path->nodes[0]; |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4417 | BUG_ON(btrfs_leaf_free_space(leaf) < sizeof(struct btrfs_item)); |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 4418 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 4419 | btrfs_set_path_blocking(path); |
| 4420 | |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4421 | item = btrfs_item_nr(path->slots[0]); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4422 | orig_offset = btrfs_item_offset(leaf, item); |
| 4423 | item_size = btrfs_item_size(leaf, item); |
| 4424 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4425 | buf = kmalloc(item_size, GFP_NOFS); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4426 | if (!buf) |
| 4427 | return -ENOMEM; |
| 4428 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4429 | read_extent_buffer(leaf, buf, btrfs_item_ptr_offset(leaf, |
| 4430 | path->slots[0]), item_size); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4431 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4432 | slot = path->slots[0] + 1; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4433 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4434 | if (slot != nritems) { |
| 4435 | /* shift the items */ |
| 4436 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + 1), |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4437 | btrfs_item_nr_offset(slot), |
| 4438 | (nritems - slot) * sizeof(struct btrfs_item)); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4439 | } |
| 4440 | |
| 4441 | btrfs_cpu_key_to_disk(&disk_key, new_key); |
| 4442 | btrfs_set_item_key(leaf, &disk_key, slot); |
| 4443 | |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4444 | new_item = btrfs_item_nr(slot); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4445 | |
| 4446 | btrfs_set_item_offset(leaf, new_item, orig_offset); |
| 4447 | btrfs_set_item_size(leaf, new_item, item_size - split_offset); |
| 4448 | |
| 4449 | btrfs_set_item_offset(leaf, item, |
| 4450 | orig_offset + item_size - split_offset); |
| 4451 | btrfs_set_item_size(leaf, item, split_offset); |
| 4452 | |
| 4453 | btrfs_set_header_nritems(leaf, nritems + 1); |
| 4454 | |
| 4455 | /* write the data for the start of the original item */ |
| 4456 | write_extent_buffer(leaf, buf, |
| 4457 | btrfs_item_ptr_offset(leaf, path->slots[0]), |
| 4458 | split_offset); |
| 4459 | |
| 4460 | /* write the data for the new item */ |
| 4461 | write_extent_buffer(leaf, buf + split_offset, |
| 4462 | btrfs_item_ptr_offset(leaf, slot), |
| 4463 | item_size - split_offset); |
| 4464 | btrfs_mark_buffer_dirty(leaf); |
| 4465 | |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4466 | BUG_ON(btrfs_leaf_free_space(leaf) < 0); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4467 | kfree(buf); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4468 | return 0; |
| 4469 | } |
| 4470 | |
| 4471 | /* |
| 4472 | * This function splits a single item into two items, |
| 4473 | * giving 'new_key' to the new item and splitting the |
| 4474 | * old one at split_offset (from the start of the item). |
| 4475 | * |
| 4476 | * The path may be released by this operation. After |
| 4477 | * the split, the path is pointing to the old item. The |
| 4478 | * new item is going to be in the same node as the old one. |
| 4479 | * |
| 4480 | * Note, the item being split must be smaller enough to live alone on |
| 4481 | * a tree block with room for one extra struct btrfs_item |
| 4482 | * |
| 4483 | * This allows us to split the item in place, keeping a lock on the |
| 4484 | * leaf the entire time. |
| 4485 | */ |
| 4486 | int btrfs_split_item(struct btrfs_trans_handle *trans, |
| 4487 | struct btrfs_root *root, |
| 4488 | struct btrfs_path *path, |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 4489 | const struct btrfs_key *new_key, |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4490 | unsigned long split_offset) |
| 4491 | { |
| 4492 | int ret; |
| 4493 | ret = setup_leaf_for_split(trans, root, path, |
| 4494 | sizeof(struct btrfs_item)); |
| 4495 | if (ret) |
| 4496 | return ret; |
| 4497 | |
David Sterba | 25263cd | 2019-03-20 14:44:57 +0100 | [diff] [blame] | 4498 | ret = split_item(path, new_key, split_offset); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 4499 | return ret; |
| 4500 | } |
| 4501 | |
| 4502 | /* |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4503 | * This function duplicate a item, giving 'new_key' to the new item. |
| 4504 | * It guarantees both items live in the same tree leaf and the new item |
| 4505 | * is contiguous with the original item. |
| 4506 | * |
| 4507 | * This allows us to split file extent in place, keeping a lock on the |
| 4508 | * leaf the entire time. |
| 4509 | */ |
| 4510 | int btrfs_duplicate_item(struct btrfs_trans_handle *trans, |
| 4511 | struct btrfs_root *root, |
| 4512 | struct btrfs_path *path, |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 4513 | const struct btrfs_key *new_key) |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4514 | { |
| 4515 | struct extent_buffer *leaf; |
| 4516 | int ret; |
| 4517 | u32 item_size; |
| 4518 | |
| 4519 | leaf = path->nodes[0]; |
| 4520 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); |
| 4521 | ret = setup_leaf_for_split(trans, root, path, |
| 4522 | item_size + sizeof(struct btrfs_item)); |
| 4523 | if (ret) |
| 4524 | return ret; |
| 4525 | |
| 4526 | path->slots[0]++; |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 4527 | setup_items_for_insert(root, path, new_key, &item_size, |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4528 | item_size, item_size + |
| 4529 | sizeof(struct btrfs_item), 1); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 4530 | leaf = path->nodes[0]; |
| 4531 | memcpy_extent_buffer(leaf, |
| 4532 | btrfs_item_ptr_offset(leaf, path->slots[0]), |
| 4533 | btrfs_item_ptr_offset(leaf, path->slots[0] - 1), |
| 4534 | item_size); |
| 4535 | return 0; |
| 4536 | } |
| 4537 | |
| 4538 | /* |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 4539 | * make the item pointed to by the path smaller. new_size indicates |
| 4540 | * how small to make it, and from_end tells us if we just chop bytes |
| 4541 | * off the end of the item or if we shift the item to chop bytes off |
| 4542 | * the front. |
| 4543 | */ |
David Sterba | 78ac4f9 | 2019-03-20 14:49:12 +0100 | [diff] [blame] | 4544 | void btrfs_truncate_item(struct btrfs_path *path, u32 new_size, int from_end) |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4545 | { |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4546 | int slot; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4547 | struct extent_buffer *leaf; |
| 4548 | struct btrfs_item *item; |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4549 | u32 nritems; |
| 4550 | unsigned int data_end; |
| 4551 | unsigned int old_data_start; |
| 4552 | unsigned int old_size; |
| 4553 | unsigned int size_diff; |
| 4554 | int i; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4555 | struct btrfs_map_token token; |
| 4556 | |
| 4557 | btrfs_init_map_token(&token); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4558 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4559 | leaf = path->nodes[0]; |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 4560 | slot = path->slots[0]; |
| 4561 | |
| 4562 | old_size = btrfs_item_size_nr(leaf, slot); |
| 4563 | if (old_size == new_size) |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4564 | return; |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4565 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4566 | nritems = btrfs_header_nritems(leaf); |
David Sterba | 8f881e8 | 2019-03-20 11:33:10 +0100 | [diff] [blame] | 4567 | data_end = leaf_data_end(leaf); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4568 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4569 | old_data_start = btrfs_item_offset_nr(leaf, slot); |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 4570 | |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4571 | size_diff = old_size - new_size; |
| 4572 | |
| 4573 | BUG_ON(slot < 0); |
| 4574 | BUG_ON(slot >= nritems); |
| 4575 | |
| 4576 | /* |
| 4577 | * item0..itemN ... dataN.offset..dataN.size .. data0.size |
| 4578 | */ |
| 4579 | /* first correct the data pointers */ |
| 4580 | for (i = slot; i < nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4581 | u32 ioff; |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4582 | item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4583 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4584 | ioff = btrfs_token_item_offset(leaf, item, &token); |
| 4585 | btrfs_set_token_item_offset(leaf, item, |
| 4586 | ioff + size_diff, &token); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4587 | } |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4588 | |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4589 | /* shift the data */ |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 4590 | if (from_end) { |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 4591 | memmove_extent_buffer(leaf, BTRFS_LEAF_DATA_OFFSET + |
| 4592 | data_end + size_diff, BTRFS_LEAF_DATA_OFFSET + |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 4593 | data_end, old_data_start + new_size - data_end); |
| 4594 | } else { |
| 4595 | struct btrfs_disk_key disk_key; |
| 4596 | u64 offset; |
| 4597 | |
| 4598 | btrfs_item_key(leaf, &disk_key, slot); |
| 4599 | |
| 4600 | if (btrfs_disk_key_type(&disk_key) == BTRFS_EXTENT_DATA_KEY) { |
| 4601 | unsigned long ptr; |
| 4602 | struct btrfs_file_extent_item *fi; |
| 4603 | |
| 4604 | fi = btrfs_item_ptr(leaf, slot, |
| 4605 | struct btrfs_file_extent_item); |
| 4606 | fi = (struct btrfs_file_extent_item *)( |
| 4607 | (unsigned long)fi - size_diff); |
| 4608 | |
| 4609 | if (btrfs_file_extent_type(leaf, fi) == |
| 4610 | BTRFS_FILE_EXTENT_INLINE) { |
| 4611 | ptr = btrfs_item_ptr_offset(leaf, slot); |
| 4612 | memmove_extent_buffer(leaf, ptr, |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 4613 | (unsigned long)fi, |
David Sterba | 7ec20af | 2014-07-24 17:34:58 +0200 | [diff] [blame] | 4614 | BTRFS_FILE_EXTENT_INLINE_DATA_START); |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 4615 | } |
| 4616 | } |
| 4617 | |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 4618 | memmove_extent_buffer(leaf, BTRFS_LEAF_DATA_OFFSET + |
| 4619 | data_end + size_diff, BTRFS_LEAF_DATA_OFFSET + |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 4620 | data_end, old_data_start - data_end); |
| 4621 | |
| 4622 | offset = btrfs_disk_key_offset(&disk_key); |
| 4623 | btrfs_set_disk_key_offset(&disk_key, offset + size_diff); |
| 4624 | btrfs_set_item_key(leaf, &disk_key, slot); |
| 4625 | if (slot == 0) |
Nikolay Borisov | b167fa9 | 2018-06-20 15:48:47 +0300 | [diff] [blame] | 4626 | fixup_low_keys(path, &disk_key, 1); |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 4627 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4628 | |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4629 | item = btrfs_item_nr(slot); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4630 | btrfs_set_item_size(leaf, item, new_size); |
| 4631 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4632 | |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4633 | if (btrfs_leaf_free_space(leaf) < 0) { |
David Sterba | a4f7875 | 2017-06-29 18:37:49 +0200 | [diff] [blame] | 4634 | btrfs_print_leaf(leaf); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4635 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4636 | } |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 4637 | } |
| 4638 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 4639 | /* |
Stefan Behrens | 8f69dbd | 2013-05-07 10:23:30 +0000 | [diff] [blame] | 4640 | * 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] | 4641 | */ |
David Sterba | c71dd88 | 2019-03-20 14:51:10 +0100 | [diff] [blame] | 4642 | void btrfs_extend_item(struct btrfs_path *path, u32 data_size) |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4643 | { |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4644 | int slot; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4645 | struct extent_buffer *leaf; |
| 4646 | struct btrfs_item *item; |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4647 | u32 nritems; |
| 4648 | unsigned int data_end; |
| 4649 | unsigned int old_data; |
| 4650 | unsigned int old_size; |
| 4651 | int i; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4652 | struct btrfs_map_token token; |
| 4653 | |
| 4654 | btrfs_init_map_token(&token); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4655 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4656 | leaf = path->nodes[0]; |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4657 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4658 | nritems = btrfs_header_nritems(leaf); |
David Sterba | 8f881e8 | 2019-03-20 11:33:10 +0100 | [diff] [blame] | 4659 | data_end = leaf_data_end(leaf); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4660 | |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4661 | if (btrfs_leaf_free_space(leaf) < data_size) { |
David Sterba | a4f7875 | 2017-06-29 18:37:49 +0200 | [diff] [blame] | 4662 | btrfs_print_leaf(leaf); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4663 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4664 | } |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4665 | slot = path->slots[0]; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4666 | old_data = btrfs_item_end_nr(leaf, slot); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4667 | |
| 4668 | BUG_ON(slot < 0); |
Chris Mason | 3326d1b | 2007-10-15 16:18:25 -0400 | [diff] [blame] | 4669 | if (slot >= nritems) { |
David Sterba | a4f7875 | 2017-06-29 18:37:49 +0200 | [diff] [blame] | 4670 | btrfs_print_leaf(leaf); |
David Sterba | c71dd88 | 2019-03-20 14:51:10 +0100 | [diff] [blame] | 4671 | btrfs_crit(leaf->fs_info, "slot %d too large, nritems %d", |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 4672 | slot, nritems); |
Arnd Bergmann | 290342f | 2019-03-25 14:02:25 +0100 | [diff] [blame] | 4673 | BUG(); |
Chris Mason | 3326d1b | 2007-10-15 16:18:25 -0400 | [diff] [blame] | 4674 | } |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4675 | |
| 4676 | /* |
| 4677 | * item0..itemN ... dataN.offset..dataN.size .. data0.size |
| 4678 | */ |
| 4679 | /* first correct the data pointers */ |
| 4680 | for (i = slot; i < nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4681 | u32 ioff; |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4682 | item = btrfs_item_nr(i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4683 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4684 | ioff = btrfs_token_item_offset(leaf, item, &token); |
| 4685 | btrfs_set_token_item_offset(leaf, item, |
| 4686 | ioff - data_size, &token); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4687 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4688 | |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4689 | /* shift the data */ |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 4690 | memmove_extent_buffer(leaf, BTRFS_LEAF_DATA_OFFSET + |
| 4691 | data_end - data_size, BTRFS_LEAF_DATA_OFFSET + |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4692 | data_end, old_data - data_end); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4693 | |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4694 | data_end = old_data; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4695 | old_size = btrfs_item_size_nr(leaf, slot); |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4696 | item = btrfs_item_nr(slot); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4697 | btrfs_set_item_size(leaf, item, old_size + data_size); |
| 4698 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4699 | |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4700 | if (btrfs_leaf_free_space(leaf) < 0) { |
David Sterba | a4f7875 | 2017-06-29 18:37:49 +0200 | [diff] [blame] | 4701 | btrfs_print_leaf(leaf); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4702 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4703 | } |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 4704 | } |
| 4705 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4706 | /* |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4707 | * this is a helper for btrfs_insert_empty_items, the main goal here is |
| 4708 | * to save stack depth by doing the bulk of the work in a function |
| 4709 | * that doesn't call btrfs_search_slot |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4710 | */ |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 4711 | void setup_items_for_insert(struct btrfs_root *root, struct btrfs_path *path, |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 4712 | const struct btrfs_key *cpu_key, u32 *data_size, |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4713 | u32 total_data, u32 total_size, int nr) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4714 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 4715 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4716 | struct btrfs_item *item; |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4717 | int i; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 4718 | u32 nritems; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4719 | unsigned int data_end; |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 4720 | struct btrfs_disk_key disk_key; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4721 | struct extent_buffer *leaf; |
| 4722 | int slot; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4723 | struct btrfs_map_token token; |
| 4724 | |
Filipe Manana | 24cdc84 | 2014-07-28 19:34:35 +0100 | [diff] [blame] | 4725 | if (path->slots[0] == 0) { |
| 4726 | btrfs_cpu_key_to_disk(&disk_key, cpu_key); |
Nikolay Borisov | b167fa9 | 2018-06-20 15:48:47 +0300 | [diff] [blame] | 4727 | fixup_low_keys(path, &disk_key, 1); |
Filipe Manana | 24cdc84 | 2014-07-28 19:34:35 +0100 | [diff] [blame] | 4728 | } |
| 4729 | btrfs_unlock_up_safe(path, 1); |
| 4730 | |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4731 | btrfs_init_map_token(&token); |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 4732 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4733 | leaf = path->nodes[0]; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4734 | slot = path->slots[0]; |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4735 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4736 | nritems = btrfs_header_nritems(leaf); |
David Sterba | 8f881e8 | 2019-03-20 11:33:10 +0100 | [diff] [blame] | 4737 | data_end = leaf_data_end(leaf); |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 4738 | |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4739 | if (btrfs_leaf_free_space(leaf) < total_size) { |
David Sterba | a4f7875 | 2017-06-29 18:37:49 +0200 | [diff] [blame] | 4740 | btrfs_print_leaf(leaf); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 4741 | btrfs_crit(fs_info, "not enough freespace need %u have %d", |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4742 | total_size, btrfs_leaf_free_space(leaf)); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4743 | BUG(); |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 4744 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4745 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4746 | if (slot != nritems) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4747 | unsigned int old_data = btrfs_item_end_nr(leaf, slot); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4748 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4749 | if (old_data < data_end) { |
David Sterba | a4f7875 | 2017-06-29 18:37:49 +0200 | [diff] [blame] | 4750 | btrfs_print_leaf(leaf); |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 4751 | btrfs_crit(fs_info, "slot %d old_data %d data_end %d", |
Jeff Mahoney | 5d163e0 | 2016-09-20 10:05:00 -0400 | [diff] [blame] | 4752 | slot, old_data, data_end); |
Arnd Bergmann | 290342f | 2019-03-25 14:02:25 +0100 | [diff] [blame] | 4753 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4754 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4755 | /* |
| 4756 | * item0..itemN ... dataN.offset..dataN.size .. data0.size |
| 4757 | */ |
| 4758 | /* first correct the data pointers */ |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 4759 | for (i = slot; i < nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4760 | u32 ioff; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4761 | |
Jeff Mahoney | 62e8557 | 2016-09-20 10:05:01 -0400 | [diff] [blame] | 4762 | item = btrfs_item_nr(i); |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4763 | ioff = btrfs_token_item_offset(leaf, item, &token); |
| 4764 | btrfs_set_token_item_offset(leaf, item, |
| 4765 | ioff - total_data, &token); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 4766 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4767 | /* shift the items */ |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4768 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + nr), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4769 | btrfs_item_nr_offset(slot), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 4770 | (nritems - slot) * sizeof(struct btrfs_item)); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4771 | |
| 4772 | /* shift the data */ |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 4773 | memmove_extent_buffer(leaf, BTRFS_LEAF_DATA_OFFSET + |
| 4774 | data_end - total_data, BTRFS_LEAF_DATA_OFFSET + |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 4775 | data_end, old_data - data_end); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4776 | data_end = old_data; |
| 4777 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4778 | |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 4779 | /* setup the item for the new data */ |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4780 | for (i = 0; i < nr; i++) { |
| 4781 | btrfs_cpu_key_to_disk(&disk_key, cpu_key + i); |
| 4782 | btrfs_set_item_key(leaf, &disk_key, slot + i); |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4783 | item = btrfs_item_nr(slot + i); |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4784 | btrfs_set_token_item_offset(leaf, item, |
| 4785 | data_end - data_size[i], &token); |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4786 | data_end -= data_size[i]; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4787 | btrfs_set_token_item_size(leaf, item, data_size[i], &token); |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4788 | } |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4789 | |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 4790 | btrfs_set_header_nritems(leaf, nritems + nr); |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 4791 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 4792 | |
David Sterba | e902baa | 2019-03-20 14:36:46 +0100 | [diff] [blame] | 4793 | if (btrfs_leaf_free_space(leaf) < 0) { |
David Sterba | a4f7875 | 2017-06-29 18:37:49 +0200 | [diff] [blame] | 4794 | btrfs_print_leaf(leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4795 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4796 | } |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4797 | } |
| 4798 | |
| 4799 | /* |
| 4800 | * Given a key and some data, insert items into the tree. |
| 4801 | * This does all the path init required, making room in the tree if needed. |
| 4802 | */ |
| 4803 | int btrfs_insert_empty_items(struct btrfs_trans_handle *trans, |
| 4804 | struct btrfs_root *root, |
| 4805 | struct btrfs_path *path, |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 4806 | const struct btrfs_key *cpu_key, u32 *data_size, |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4807 | int nr) |
| 4808 | { |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4809 | int ret = 0; |
| 4810 | int slot; |
| 4811 | int i; |
| 4812 | u32 total_size = 0; |
| 4813 | u32 total_data = 0; |
| 4814 | |
| 4815 | for (i = 0; i < nr; i++) |
| 4816 | total_data += data_size[i]; |
| 4817 | |
| 4818 | total_size = total_data + (nr * sizeof(struct btrfs_item)); |
| 4819 | ret = btrfs_search_slot(trans, root, cpu_key, path, total_size, 1); |
| 4820 | if (ret == 0) |
| 4821 | return -EEXIST; |
| 4822 | if (ret < 0) |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4823 | return ret; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4824 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4825 | slot = path->slots[0]; |
| 4826 | BUG_ON(slot < 0); |
| 4827 | |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 4828 | setup_items_for_insert(root, path, cpu_key, data_size, |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 4829 | total_data, total_size, nr); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4830 | return 0; |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 4831 | } |
| 4832 | |
| 4833 | /* |
| 4834 | * Given a key and some data, insert an item into the tree. |
| 4835 | * This does all the path init required, making room in the tree if needed. |
| 4836 | */ |
Omar Sandoval | 310712b | 2017-01-17 23:24:37 -0800 | [diff] [blame] | 4837 | int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 4838 | const struct btrfs_key *cpu_key, void *data, |
| 4839 | u32 data_size) |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 4840 | { |
| 4841 | int ret = 0; |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 4842 | struct btrfs_path *path; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4843 | struct extent_buffer *leaf; |
| 4844 | unsigned long ptr; |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 4845 | |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 4846 | path = btrfs_alloc_path(); |
Tsutomu Itoh | db5b493 | 2011-03-23 08:14:16 +0000 | [diff] [blame] | 4847 | if (!path) |
| 4848 | return -ENOMEM; |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 4849 | ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size); |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 4850 | if (!ret) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4851 | leaf = path->nodes[0]; |
| 4852 | ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); |
| 4853 | write_extent_buffer(leaf, data, ptr, data_size); |
| 4854 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 4855 | } |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 4856 | btrfs_free_path(path); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 4857 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4858 | } |
| 4859 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4860 | /* |
Chris Mason | 5de08d7 | 2007-02-24 06:24:44 -0500 | [diff] [blame] | 4861 | * delete the pointer from a given node. |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4862 | * |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 4863 | * the tree should have been previously balanced so the deletion does not |
| 4864 | * empty a node. |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4865 | */ |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 4866 | static void del_ptr(struct btrfs_root *root, struct btrfs_path *path, |
| 4867 | int level, int slot) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4868 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4869 | struct extent_buffer *parent = path->nodes[level]; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 4870 | u32 nritems; |
Jan Schmidt | f3ea38d | 2012-05-26 11:45:21 +0200 | [diff] [blame] | 4871 | int ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4872 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4873 | nritems = btrfs_header_nritems(parent); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 4874 | if (slot != nritems - 1) { |
David Sterba | bf1d342 | 2018-03-05 15:47:39 +0100 | [diff] [blame] | 4875 | if (level) { |
| 4876 | ret = tree_mod_log_insert_move(parent, slot, slot + 1, |
David Sterba | a446a97 | 2018-03-05 15:26:29 +0100 | [diff] [blame] | 4877 | nritems - slot - 1); |
David Sterba | bf1d342 | 2018-03-05 15:47:39 +0100 | [diff] [blame] | 4878 | BUG_ON(ret < 0); |
| 4879 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4880 | memmove_extent_buffer(parent, |
| 4881 | btrfs_node_key_ptr_offset(slot), |
| 4882 | btrfs_node_key_ptr_offset(slot + 1), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 4883 | sizeof(struct btrfs_key_ptr) * |
| 4884 | (nritems - slot - 1)); |
Chris Mason | 57ba86c | 2012-12-18 19:35:32 -0500 | [diff] [blame] | 4885 | } else if (level) { |
David Sterba | e09c2ef | 2018-03-05 15:09:03 +0100 | [diff] [blame] | 4886 | ret = tree_mod_log_insert_key(parent, slot, MOD_LOG_KEY_REMOVE, |
| 4887 | GFP_NOFS); |
Chris Mason | 57ba86c | 2012-12-18 19:35:32 -0500 | [diff] [blame] | 4888 | BUG_ON(ret < 0); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 4889 | } |
Jan Schmidt | f3ea38d | 2012-05-26 11:45:21 +0200 | [diff] [blame] | 4890 | |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 4891 | nritems--; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4892 | btrfs_set_header_nritems(parent, nritems); |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 4893 | if (nritems == 0 && parent == root->node) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4894 | BUG_ON(btrfs_header_level(root->node) != 1); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 4895 | /* just turn the root into a leaf and break */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4896 | btrfs_set_header_level(root->node, 0); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 4897 | } else if (slot == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4898 | struct btrfs_disk_key disk_key; |
| 4899 | |
| 4900 | btrfs_node_key(parent, &disk_key, 0); |
Nikolay Borisov | b167fa9 | 2018-06-20 15:48:47 +0300 | [diff] [blame] | 4901 | fixup_low_keys(path, &disk_key, level + 1); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4902 | } |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 4903 | btrfs_mark_buffer_dirty(parent); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4904 | } |
| 4905 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4906 | /* |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 4907 | * 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] | 4908 | * path->nodes[1]. |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 4909 | * |
| 4910 | * This deletes the pointer in path->nodes[1] and frees the leaf |
| 4911 | * block extent. zero is returned if it all worked out, < 0 otherwise. |
| 4912 | * |
| 4913 | * The path must have already been setup for deleting the leaf, including |
| 4914 | * all the proper balancing. path->nodes[1] must be locked. |
| 4915 | */ |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4916 | static noinline void btrfs_del_leaf(struct btrfs_trans_handle *trans, |
| 4917 | struct btrfs_root *root, |
| 4918 | struct btrfs_path *path, |
| 4919 | struct extent_buffer *leaf) |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 4920 | { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 4921 | WARN_ON(btrfs_header_generation(leaf) != trans->transid); |
Tsutomu Itoh | afe5fea | 2013-04-16 05:18:22 +0000 | [diff] [blame] | 4922 | del_ptr(root, path, 1, path->slots[1]); |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 4923 | |
Chris Mason | 4d081c4 | 2009-02-04 09:31:28 -0500 | [diff] [blame] | 4924 | /* |
| 4925 | * btrfs_free_extent is expensive, we want to make sure we |
| 4926 | * aren't holding any locks when we call it |
| 4927 | */ |
| 4928 | btrfs_unlock_up_safe(path, 0); |
| 4929 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 4930 | root_sub_used(root, leaf->len); |
| 4931 | |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 4932 | extent_buffer_get(leaf); |
Jan Schmidt | 5581a51 | 2012-05-16 17:04:52 +0200 | [diff] [blame] | 4933 | btrfs_free_tree_block(trans, root, leaf, 0, 1); |
Josef Bacik | 3083ee2 | 2012-03-09 16:01:49 -0500 | [diff] [blame] | 4934 | free_extent_buffer_stale(leaf); |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 4935 | } |
| 4936 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4937 | * delete the item at the leaf level in path. If that empties |
| 4938 | * the leaf, remove it from the tree |
| 4939 | */ |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4940 | int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 4941 | struct btrfs_path *path, int slot, int nr) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4942 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 4943 | struct btrfs_fs_info *fs_info = root->fs_info; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4944 | struct extent_buffer *leaf; |
| 4945 | struct btrfs_item *item; |
Alexandru Moise | ce0eac2 | 2015-08-23 16:01:42 +0000 | [diff] [blame] | 4946 | u32 last_off; |
| 4947 | u32 dsize = 0; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 4948 | int ret = 0; |
| 4949 | int wret; |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4950 | int i; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 4951 | u32 nritems; |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4952 | struct btrfs_map_token token; |
| 4953 | |
| 4954 | btrfs_init_map_token(&token); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4955 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4956 | leaf = path->nodes[0]; |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4957 | last_off = btrfs_item_offset_nr(leaf, slot + nr - 1); |
| 4958 | |
| 4959 | for (i = 0; i < nr; i++) |
| 4960 | dsize += btrfs_item_size_nr(leaf, slot + i); |
| 4961 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4962 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4963 | |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4964 | if (slot + nr != nritems) { |
David Sterba | 8f881e8 | 2019-03-20 11:33:10 +0100 | [diff] [blame] | 4965 | int data_end = leaf_data_end(leaf); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4966 | |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 4967 | memmove_extent_buffer(leaf, BTRFS_LEAF_DATA_OFFSET + |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 4968 | data_end + dsize, |
Nikolay Borisov | 3d9ec8c | 2017-05-29 09:43:43 +0300 | [diff] [blame] | 4969 | BTRFS_LEAF_DATA_OFFSET + data_end, |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4970 | last_off - data_end); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4971 | |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4972 | for (i = slot + nr; i < nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4973 | u32 ioff; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4974 | |
Ross Kirk | dd3cc16 | 2013-09-16 15:58:09 +0100 | [diff] [blame] | 4975 | item = btrfs_item_nr(i); |
Chris Mason | cfed81a | 2012-03-03 07:40:03 -0500 | [diff] [blame] | 4976 | ioff = btrfs_token_item_offset(leaf, item, &token); |
| 4977 | btrfs_set_token_item_offset(leaf, item, |
| 4978 | ioff + dsize, &token); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 4979 | } |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 4980 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4981 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot), |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4982 | btrfs_item_nr_offset(slot + nr), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 4983 | sizeof(struct btrfs_item) * |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4984 | (nritems - slot - nr)); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4985 | } |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 4986 | btrfs_set_header_nritems(leaf, nritems - nr); |
| 4987 | nritems -= nr; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4988 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 4989 | /* delete the leaf if we've emptied it */ |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 4990 | if (nritems == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4991 | if (leaf == root->node) { |
| 4992 | btrfs_set_header_level(leaf, 0); |
Chris Mason | 9a8dd15 | 2007-02-23 08:38:36 -0500 | [diff] [blame] | 4993 | } else { |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 4994 | btrfs_set_path_blocking(path); |
David Sterba | 6a884d7d | 2019-03-20 14:30:02 +0100 | [diff] [blame] | 4995 | btrfs_clean_tree_block(leaf); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 4996 | btrfs_del_leaf(trans, root, path, leaf); |
Chris Mason | 9a8dd15 | 2007-02-23 08:38:36 -0500 | [diff] [blame] | 4997 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 4998 | } else { |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 4999 | int used = leaf_space_used(leaf, 0, nritems); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 5000 | if (slot == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5001 | struct btrfs_disk_key disk_key; |
| 5002 | |
| 5003 | btrfs_item_key(leaf, &disk_key, 0); |
Nikolay Borisov | b167fa9 | 2018-06-20 15:48:47 +0300 | [diff] [blame] | 5004 | fixup_low_keys(path, &disk_key, 1); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 5005 | } |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 5006 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 5007 | /* delete the leaf if it is mostly empty */ |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 5008 | if (used < BTRFS_LEAF_DATA_SIZE(fs_info) / 3) { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 5009 | /* push_leaf_left fixes the path. |
| 5010 | * make sure the path still points to our leaf |
| 5011 | * for possible call to del_ptr below |
| 5012 | */ |
Chris Mason | 4920c9a | 2007-01-26 16:38:42 -0500 | [diff] [blame] | 5013 | slot = path->slots[1]; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5014 | extent_buffer_get(leaf); |
| 5015 | |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 5016 | btrfs_set_path_blocking(path); |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 5017 | wret = push_leaf_left(trans, root, path, 1, 1, |
| 5018 | 1, (u32)-1); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 5019 | if (wret < 0 && wret != -ENOSPC) |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 5020 | ret = wret; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5021 | |
| 5022 | if (path->nodes[0] == leaf && |
| 5023 | btrfs_header_nritems(leaf)) { |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 5024 | wret = push_leaf_right(trans, root, path, 1, |
| 5025 | 1, 1, 0); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 5026 | if (wret < 0 && wret != -ENOSPC) |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 5027 | ret = wret; |
| 5028 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5029 | |
| 5030 | if (btrfs_header_nritems(leaf) == 0) { |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 5031 | path->slots[1] = slot; |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 5032 | btrfs_del_leaf(trans, root, path, leaf); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5033 | free_extent_buffer(leaf); |
Jeff Mahoney | 143bede | 2012-03-01 14:56:26 +0100 | [diff] [blame] | 5034 | ret = 0; |
Chris Mason | 5de08d7 | 2007-02-24 06:24:44 -0500 | [diff] [blame] | 5035 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5036 | /* if we're still in the path, make sure |
| 5037 | * we're dirty. Otherwise, one of the |
| 5038 | * push_leaf functions must have already |
| 5039 | * dirtied this buffer |
| 5040 | */ |
| 5041 | if (path->nodes[0] == leaf) |
| 5042 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5043 | free_extent_buffer(leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 5044 | } |
Chris Mason | d571976 | 2007-03-23 10:01:08 -0400 | [diff] [blame] | 5045 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5046 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 5047 | } |
| 5048 | } |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 5049 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 5050 | } |
| 5051 | |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 5052 | /* |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5053 | * search the tree again to find a leaf with lesser keys |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5054 | * returns 0 if it found something or 1 if there are no lesser leaves. |
| 5055 | * returns < 0 on io errors. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 5056 | * |
| 5057 | * This may release the path, and so you may lose any locks held at the |
| 5058 | * time you call it. |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5059 | */ |
Josef Bacik | 16e7549 | 2013-10-22 12:18:51 -0400 | [diff] [blame] | 5060 | int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path) |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5061 | { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5062 | struct btrfs_key key; |
| 5063 | struct btrfs_disk_key found_key; |
| 5064 | int ret; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5065 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5066 | btrfs_item_key_to_cpu(path->nodes[0], &key, 0); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5067 | |
Filipe David Borba Manana | e8b0d724 | 2013-10-15 00:12:27 +0100 | [diff] [blame] | 5068 | if (key.offset > 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5069 | key.offset--; |
Filipe David Borba Manana | e8b0d724 | 2013-10-15 00:12:27 +0100 | [diff] [blame] | 5070 | } else if (key.type > 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5071 | key.type--; |
Filipe David Borba Manana | e8b0d724 | 2013-10-15 00:12:27 +0100 | [diff] [blame] | 5072 | key.offset = (u64)-1; |
| 5073 | } else if (key.objectid > 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5074 | key.objectid--; |
Filipe David Borba Manana | e8b0d724 | 2013-10-15 00:12:27 +0100 | [diff] [blame] | 5075 | key.type = (u8)-1; |
| 5076 | key.offset = (u64)-1; |
| 5077 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5078 | return 1; |
Filipe David Borba Manana | e8b0d724 | 2013-10-15 00:12:27 +0100 | [diff] [blame] | 5079 | } |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5080 | |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 5081 | btrfs_release_path(path); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5082 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
| 5083 | if (ret < 0) |
| 5084 | return ret; |
| 5085 | btrfs_item_key(path->nodes[0], &found_key, 0); |
| 5086 | ret = comp_keys(&found_key, &key); |
Filipe Manana | 337c6f6 | 2014-06-09 13:22:13 +0100 | [diff] [blame] | 5087 | /* |
| 5088 | * We might have had an item with the previous key in the tree right |
| 5089 | * before we released our path. And after we released our path, that |
| 5090 | * item might have been pushed to the first slot (0) of the leaf we |
| 5091 | * were holding due to a tree balance. Alternatively, an item with the |
| 5092 | * previous key can exist as the only element of a leaf (big fat item). |
| 5093 | * Therefore account for these 2 cases, so that our callers (like |
| 5094 | * btrfs_previous_item) don't miss an existing item with a key matching |
| 5095 | * the previous key we computed above. |
| 5096 | */ |
| 5097 | if (ret <= 0) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5098 | return 0; |
| 5099 | return 1; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5100 | } |
| 5101 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5102 | /* |
| 5103 | * 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] | 5104 | * for nodes or leaves that are have a minimum transaction id. |
| 5105 | * This is used by the btree defrag code, and tree logging |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5106 | * |
| 5107 | * This does not cow, but it does stuff the starting key it finds back |
| 5108 | * into min_key, so you can call btrfs_search_slot with cow=1 on the |
| 5109 | * key and get a writable path. |
| 5110 | * |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5111 | * This honors path->lowest_level to prevent descent past a given level |
| 5112 | * of the tree. |
| 5113 | * |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 5114 | * min_trans indicates the oldest transaction that you are interested |
| 5115 | * in walking through. Any nodes or leaves older than min_trans are |
| 5116 | * skipped over (without reading them). |
| 5117 | * |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5118 | * returns zero if something useful was found, < 0 on error and 1 if there |
| 5119 | * was nothing in the tree that matched the search criteria. |
| 5120 | */ |
| 5121 | 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] | 5122 | struct btrfs_path *path, |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5123 | u64 min_trans) |
| 5124 | { |
| 5125 | struct extent_buffer *cur; |
| 5126 | struct btrfs_key found_key; |
| 5127 | int slot; |
Yan | 9652480 | 2008-07-24 12:19:49 -0400 | [diff] [blame] | 5128 | int sret; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5129 | u32 nritems; |
| 5130 | int level; |
| 5131 | int ret = 1; |
Filipe Manana | f98de9b | 2014-08-04 19:37:21 +0100 | [diff] [blame] | 5132 | int keep_locks = path->keep_locks; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5133 | |
Filipe Manana | f98de9b | 2014-08-04 19:37:21 +0100 | [diff] [blame] | 5134 | path->keep_locks = 1; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5135 | again: |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5136 | cur = btrfs_read_lock_root_node(root); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5137 | level = btrfs_header_level(cur); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5138 | WARN_ON(path->nodes[level]); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5139 | path->nodes[level] = cur; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5140 | path->locks[level] = BTRFS_READ_LOCK; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5141 | |
| 5142 | if (btrfs_header_generation(cur) < min_trans) { |
| 5143 | ret = 1; |
| 5144 | goto out; |
| 5145 | } |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5146 | while (1) { |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5147 | nritems = btrfs_header_nritems(cur); |
| 5148 | level = btrfs_header_level(cur); |
Nikolay Borisov | a74b35e | 2017-12-08 16:27:43 +0200 | [diff] [blame] | 5149 | sret = btrfs_bin_search(cur, min_key, level, &slot); |
Filipe Manana | cbca7d5 | 2019-02-18 16:57:26 +0000 | [diff] [blame] | 5150 | if (sret < 0) { |
| 5151 | ret = sret; |
| 5152 | goto out; |
| 5153 | } |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5154 | |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 5155 | /* at the lowest level, we're done, setup the path and exit */ |
| 5156 | if (level == path->lowest_level) { |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5157 | if (slot >= nritems) |
| 5158 | goto find_next_key; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5159 | ret = 0; |
| 5160 | path->slots[level] = slot; |
| 5161 | btrfs_item_key_to_cpu(cur, &found_key, slot); |
| 5162 | goto out; |
| 5163 | } |
Yan | 9652480 | 2008-07-24 12:19:49 -0400 | [diff] [blame] | 5164 | if (sret && slot > 0) |
| 5165 | slot--; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5166 | /* |
Eric Sandeen | de78b51 | 2013-01-31 18:21:12 +0000 | [diff] [blame] | 5167 | * check this node pointer against the min_trans parameters. |
| 5168 | * If it is too old, old, skip to the next one. |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5169 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5170 | while (slot < nritems) { |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5171 | u64 gen; |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5172 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5173 | gen = btrfs_node_ptr_generation(cur, slot); |
| 5174 | if (gen < min_trans) { |
| 5175 | slot++; |
| 5176 | continue; |
| 5177 | } |
Eric Sandeen | de78b51 | 2013-01-31 18:21:12 +0000 | [diff] [blame] | 5178 | break; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5179 | } |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5180 | find_next_key: |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5181 | /* |
| 5182 | * we didn't find a candidate key in this node, walk forward |
| 5183 | * and find another one |
| 5184 | */ |
| 5185 | if (slot >= nritems) { |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5186 | path->slots[level] = slot; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 5187 | btrfs_set_path_blocking(path); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5188 | sret = btrfs_find_next_key(root, path, min_key, level, |
Eric Sandeen | de78b51 | 2013-01-31 18:21:12 +0000 | [diff] [blame] | 5189 | min_trans); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5190 | if (sret == 0) { |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 5191 | btrfs_release_path(path); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5192 | goto again; |
| 5193 | } else { |
| 5194 | goto out; |
| 5195 | } |
| 5196 | } |
| 5197 | /* save our key for returning back */ |
| 5198 | btrfs_node_key_to_cpu(cur, &found_key, slot); |
| 5199 | path->slots[level] = slot; |
| 5200 | if (level == path->lowest_level) { |
| 5201 | ret = 0; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5202 | goto out; |
| 5203 | } |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 5204 | btrfs_set_path_blocking(path); |
David Sterba | d0d20b0 | 2019-03-20 14:54:01 +0100 | [diff] [blame] | 5205 | cur = read_node_slot(cur, slot); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5206 | if (IS_ERR(cur)) { |
| 5207 | ret = PTR_ERR(cur); |
| 5208 | goto out; |
| 5209 | } |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5210 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5211 | btrfs_tree_read_lock(cur); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 5212 | |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5213 | path->locks[level - 1] = BTRFS_READ_LOCK; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5214 | path->nodes[level - 1] = cur; |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 5215 | unlock_up(path, level, 1, 0, NULL); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5216 | } |
| 5217 | out: |
Filipe Manana | f98de9b | 2014-08-04 19:37:21 +0100 | [diff] [blame] | 5218 | path->keep_locks = keep_locks; |
| 5219 | if (ret == 0) { |
| 5220 | btrfs_unlock_up_safe(path, path->lowest_level + 1); |
| 5221 | btrfs_set_path_blocking(path); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5222 | memcpy(min_key, &found_key, sizeof(found_key)); |
Filipe Manana | f98de9b | 2014-08-04 19:37:21 +0100 | [diff] [blame] | 5223 | } |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5224 | return ret; |
| 5225 | } |
| 5226 | |
David Sterba | c7da959 | 2019-03-20 15:02:46 +0100 | [diff] [blame] | 5227 | static int tree_move_down(struct btrfs_path *path, int *level) |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5228 | { |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5229 | struct extent_buffer *eb; |
| 5230 | |
Chris Mason | 74dd17f | 2012-08-07 16:25:13 -0400 | [diff] [blame] | 5231 | BUG_ON(*level == 0); |
David Sterba | d0d20b0 | 2019-03-20 14:54:01 +0100 | [diff] [blame] | 5232 | eb = read_node_slot(path->nodes[*level], path->slots[*level]); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5233 | if (IS_ERR(eb)) |
| 5234 | return PTR_ERR(eb); |
| 5235 | |
| 5236 | path->nodes[*level - 1] = eb; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5237 | path->slots[*level - 1] = 0; |
| 5238 | (*level)--; |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5239 | return 0; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5240 | } |
| 5241 | |
David Sterba | f1e3026 | 2017-02-10 19:25:51 +0100 | [diff] [blame] | 5242 | static int tree_move_next_or_upnext(struct btrfs_path *path, |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5243 | int *level, int root_level) |
| 5244 | { |
| 5245 | int ret = 0; |
| 5246 | int nritems; |
| 5247 | nritems = btrfs_header_nritems(path->nodes[*level]); |
| 5248 | |
| 5249 | path->slots[*level]++; |
| 5250 | |
Chris Mason | 74dd17f | 2012-08-07 16:25:13 -0400 | [diff] [blame] | 5251 | while (path->slots[*level] >= nritems) { |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5252 | if (*level == root_level) |
| 5253 | return -1; |
| 5254 | |
| 5255 | /* move upnext */ |
| 5256 | path->slots[*level] = 0; |
| 5257 | free_extent_buffer(path->nodes[*level]); |
| 5258 | path->nodes[*level] = NULL; |
| 5259 | (*level)++; |
| 5260 | path->slots[*level]++; |
| 5261 | |
| 5262 | nritems = btrfs_header_nritems(path->nodes[*level]); |
| 5263 | ret = 1; |
| 5264 | } |
| 5265 | return ret; |
| 5266 | } |
| 5267 | |
| 5268 | /* |
| 5269 | * Returns 1 if it had to move up and next. 0 is returned if it moved only next |
| 5270 | * or down. |
| 5271 | */ |
David Sterba | 179d1e6 | 2019-03-20 15:03:48 +0100 | [diff] [blame] | 5272 | static int tree_advance(struct btrfs_path *path, |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5273 | int *level, int root_level, |
| 5274 | int allow_down, |
| 5275 | struct btrfs_key *key) |
| 5276 | { |
| 5277 | int ret; |
| 5278 | |
| 5279 | if (*level == 0 || !allow_down) { |
David Sterba | f1e3026 | 2017-02-10 19:25:51 +0100 | [diff] [blame] | 5280 | ret = tree_move_next_or_upnext(path, level, root_level); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5281 | } else { |
David Sterba | c7da959 | 2019-03-20 15:02:46 +0100 | [diff] [blame] | 5282 | ret = tree_move_down(path, level); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5283 | } |
| 5284 | if (ret >= 0) { |
| 5285 | if (*level == 0) |
| 5286 | btrfs_item_key_to_cpu(path->nodes[*level], key, |
| 5287 | path->slots[*level]); |
| 5288 | else |
| 5289 | btrfs_node_key_to_cpu(path->nodes[*level], key, |
| 5290 | path->slots[*level]); |
| 5291 | } |
| 5292 | return ret; |
| 5293 | } |
| 5294 | |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 5295 | static int tree_compare_item(struct btrfs_path *left_path, |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5296 | struct btrfs_path *right_path, |
| 5297 | char *tmp_buf) |
| 5298 | { |
| 5299 | int cmp; |
| 5300 | int len1, len2; |
| 5301 | unsigned long off1, off2; |
| 5302 | |
| 5303 | len1 = btrfs_item_size_nr(left_path->nodes[0], left_path->slots[0]); |
| 5304 | len2 = btrfs_item_size_nr(right_path->nodes[0], right_path->slots[0]); |
| 5305 | if (len1 != len2) |
| 5306 | return 1; |
| 5307 | |
| 5308 | off1 = btrfs_item_ptr_offset(left_path->nodes[0], left_path->slots[0]); |
| 5309 | off2 = btrfs_item_ptr_offset(right_path->nodes[0], |
| 5310 | right_path->slots[0]); |
| 5311 | |
| 5312 | read_extent_buffer(left_path->nodes[0], tmp_buf, off1, len1); |
| 5313 | |
| 5314 | cmp = memcmp_extent_buffer(right_path->nodes[0], tmp_buf, off2, len1); |
| 5315 | if (cmp) |
| 5316 | return 1; |
| 5317 | return 0; |
| 5318 | } |
| 5319 | |
| 5320 | #define ADVANCE 1 |
| 5321 | #define ADVANCE_ONLY_NEXT -1 |
| 5322 | |
| 5323 | /* |
| 5324 | * This function compares two trees and calls the provided callback for |
| 5325 | * every changed/new/deleted item it finds. |
| 5326 | * If shared tree blocks are encountered, whole subtrees are skipped, making |
| 5327 | * the compare pretty fast on snapshotted subvolumes. |
| 5328 | * |
| 5329 | * This currently works on commit roots only. As commit roots are read only, |
| 5330 | * we don't do any locking. The commit roots are protected with transactions. |
| 5331 | * Transactions are ended and rejoined when a commit is tried in between. |
| 5332 | * |
| 5333 | * This function checks for modifications done to the trees while comparing. |
| 5334 | * If it detects a change, it aborts immediately. |
| 5335 | */ |
| 5336 | int btrfs_compare_trees(struct btrfs_root *left_root, |
| 5337 | struct btrfs_root *right_root, |
| 5338 | btrfs_changed_cb_t changed_cb, void *ctx) |
| 5339 | { |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 5340 | struct btrfs_fs_info *fs_info = left_root->fs_info; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5341 | int ret; |
| 5342 | int cmp; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5343 | struct btrfs_path *left_path = NULL; |
| 5344 | struct btrfs_path *right_path = NULL; |
| 5345 | struct btrfs_key left_key; |
| 5346 | struct btrfs_key right_key; |
| 5347 | char *tmp_buf = NULL; |
| 5348 | int left_root_level; |
| 5349 | int right_root_level; |
| 5350 | int left_level; |
| 5351 | int right_level; |
| 5352 | int left_end_reached; |
| 5353 | int right_end_reached; |
| 5354 | int advance_left; |
| 5355 | int advance_right; |
| 5356 | u64 left_blockptr; |
| 5357 | u64 right_blockptr; |
Filipe Manana | 6baa429 | 2014-02-20 21:15:25 +0000 | [diff] [blame] | 5358 | u64 left_gen; |
| 5359 | u64 right_gen; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5360 | |
| 5361 | left_path = btrfs_alloc_path(); |
| 5362 | if (!left_path) { |
| 5363 | ret = -ENOMEM; |
| 5364 | goto out; |
| 5365 | } |
| 5366 | right_path = btrfs_alloc_path(); |
| 5367 | if (!right_path) { |
| 5368 | ret = -ENOMEM; |
| 5369 | goto out; |
| 5370 | } |
| 5371 | |
Michal Hocko | 752ade6 | 2017-05-08 15:57:27 -0700 | [diff] [blame] | 5372 | tmp_buf = kvmalloc(fs_info->nodesize, GFP_KERNEL); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5373 | if (!tmp_buf) { |
Michal Hocko | 752ade6 | 2017-05-08 15:57:27 -0700 | [diff] [blame] | 5374 | ret = -ENOMEM; |
| 5375 | goto out; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5376 | } |
| 5377 | |
| 5378 | left_path->search_commit_root = 1; |
| 5379 | left_path->skip_locking = 1; |
| 5380 | right_path->search_commit_root = 1; |
| 5381 | right_path->skip_locking = 1; |
| 5382 | |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5383 | /* |
| 5384 | * Strategy: Go to the first items of both trees. Then do |
| 5385 | * |
| 5386 | * If both trees are at level 0 |
| 5387 | * Compare keys of current items |
| 5388 | * If left < right treat left item as new, advance left tree |
| 5389 | * and repeat |
| 5390 | * If left > right treat right item as deleted, advance right tree |
| 5391 | * and repeat |
| 5392 | * If left == right do deep compare of items, treat as changed if |
| 5393 | * needed, advance both trees and repeat |
| 5394 | * If both trees are at the same level but not at level 0 |
| 5395 | * Compare keys of current nodes/leafs |
| 5396 | * If left < right advance left tree and repeat |
| 5397 | * If left > right advance right tree and repeat |
| 5398 | * If left == right compare blockptrs of the next nodes/leafs |
| 5399 | * If they match advance both trees but stay at the same level |
| 5400 | * and repeat |
| 5401 | * If they don't match advance both trees while allowing to go |
| 5402 | * deeper and repeat |
| 5403 | * If tree levels are different |
| 5404 | * Advance the tree that needs it and repeat |
| 5405 | * |
| 5406 | * Advancing a tree means: |
| 5407 | * If we are at level 0, try to go to the next slot. If that's not |
| 5408 | * possible, go one level up and repeat. Stop when we found a level |
| 5409 | * where we could go to the next slot. We may at this point be on a |
| 5410 | * node or a leaf. |
| 5411 | * |
| 5412 | * If we are not at level 0 and not on shared tree blocks, go one |
| 5413 | * level deeper. |
| 5414 | * |
| 5415 | * If we are not at level 0 and on shared tree blocks, go one slot to |
| 5416 | * the right if possible or go up and right. |
| 5417 | */ |
| 5418 | |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 5419 | down_read(&fs_info->commit_root_sem); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5420 | left_level = btrfs_header_level(left_root->commit_root); |
| 5421 | left_root_level = left_level; |
Robbie Ko | 6f2f0b3 | 2018-05-14 10:51:34 +0800 | [diff] [blame] | 5422 | left_path->nodes[left_level] = |
| 5423 | btrfs_clone_extent_buffer(left_root->commit_root); |
| 5424 | if (!left_path->nodes[left_level]) { |
| 5425 | up_read(&fs_info->commit_root_sem); |
| 5426 | ret = -ENOMEM; |
| 5427 | goto out; |
| 5428 | } |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5429 | |
| 5430 | right_level = btrfs_header_level(right_root->commit_root); |
| 5431 | right_root_level = right_level; |
Robbie Ko | 6f2f0b3 | 2018-05-14 10:51:34 +0800 | [diff] [blame] | 5432 | right_path->nodes[right_level] = |
| 5433 | btrfs_clone_extent_buffer(right_root->commit_root); |
| 5434 | if (!right_path->nodes[right_level]) { |
| 5435 | up_read(&fs_info->commit_root_sem); |
| 5436 | ret = -ENOMEM; |
| 5437 | goto out; |
| 5438 | } |
Jeff Mahoney | 0b246af | 2016-06-22 18:54:23 -0400 | [diff] [blame] | 5439 | up_read(&fs_info->commit_root_sem); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5440 | |
| 5441 | if (left_level == 0) |
| 5442 | btrfs_item_key_to_cpu(left_path->nodes[left_level], |
| 5443 | &left_key, left_path->slots[left_level]); |
| 5444 | else |
| 5445 | btrfs_node_key_to_cpu(left_path->nodes[left_level], |
| 5446 | &left_key, left_path->slots[left_level]); |
| 5447 | if (right_level == 0) |
| 5448 | btrfs_item_key_to_cpu(right_path->nodes[right_level], |
| 5449 | &right_key, right_path->slots[right_level]); |
| 5450 | else |
| 5451 | btrfs_node_key_to_cpu(right_path->nodes[right_level], |
| 5452 | &right_key, right_path->slots[right_level]); |
| 5453 | |
| 5454 | left_end_reached = right_end_reached = 0; |
| 5455 | advance_left = advance_right = 0; |
| 5456 | |
| 5457 | while (1) { |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5458 | if (advance_left && !left_end_reached) { |
David Sterba | 179d1e6 | 2019-03-20 15:03:48 +0100 | [diff] [blame] | 5459 | ret = tree_advance(left_path, &left_level, |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5460 | left_root_level, |
| 5461 | advance_left != ADVANCE_ONLY_NEXT, |
| 5462 | &left_key); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5463 | if (ret == -1) |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5464 | left_end_reached = ADVANCE; |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5465 | else if (ret < 0) |
| 5466 | goto out; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5467 | advance_left = 0; |
| 5468 | } |
| 5469 | if (advance_right && !right_end_reached) { |
David Sterba | 179d1e6 | 2019-03-20 15:03:48 +0100 | [diff] [blame] | 5470 | ret = tree_advance(right_path, &right_level, |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5471 | right_root_level, |
| 5472 | advance_right != ADVANCE_ONLY_NEXT, |
| 5473 | &right_key); |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5474 | if (ret == -1) |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5475 | right_end_reached = ADVANCE; |
Liu Bo | fb770ae | 2016-07-05 12:10:14 -0700 | [diff] [blame] | 5476 | else if (ret < 0) |
| 5477 | goto out; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5478 | advance_right = 0; |
| 5479 | } |
| 5480 | |
| 5481 | if (left_end_reached && right_end_reached) { |
| 5482 | ret = 0; |
| 5483 | goto out; |
| 5484 | } else if (left_end_reached) { |
| 5485 | if (right_level == 0) { |
Nikolay Borisov | ee8c494 | 2017-08-21 12:43:45 +0300 | [diff] [blame] | 5486 | ret = changed_cb(left_path, right_path, |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5487 | &right_key, |
| 5488 | BTRFS_COMPARE_TREE_DELETED, |
| 5489 | ctx); |
| 5490 | if (ret < 0) |
| 5491 | goto out; |
| 5492 | } |
| 5493 | advance_right = ADVANCE; |
| 5494 | continue; |
| 5495 | } else if (right_end_reached) { |
| 5496 | if (left_level == 0) { |
Nikolay Borisov | ee8c494 | 2017-08-21 12:43:45 +0300 | [diff] [blame] | 5497 | ret = changed_cb(left_path, right_path, |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5498 | &left_key, |
| 5499 | BTRFS_COMPARE_TREE_NEW, |
| 5500 | ctx); |
| 5501 | if (ret < 0) |
| 5502 | goto out; |
| 5503 | } |
| 5504 | advance_left = ADVANCE; |
| 5505 | continue; |
| 5506 | } |
| 5507 | |
| 5508 | if (left_level == 0 && right_level == 0) { |
| 5509 | cmp = btrfs_comp_cpu_keys(&left_key, &right_key); |
| 5510 | if (cmp < 0) { |
Nikolay Borisov | ee8c494 | 2017-08-21 12:43:45 +0300 | [diff] [blame] | 5511 | ret = changed_cb(left_path, right_path, |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5512 | &left_key, |
| 5513 | BTRFS_COMPARE_TREE_NEW, |
| 5514 | ctx); |
| 5515 | if (ret < 0) |
| 5516 | goto out; |
| 5517 | advance_left = ADVANCE; |
| 5518 | } else if (cmp > 0) { |
Nikolay Borisov | ee8c494 | 2017-08-21 12:43:45 +0300 | [diff] [blame] | 5519 | ret = changed_cb(left_path, right_path, |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5520 | &right_key, |
| 5521 | BTRFS_COMPARE_TREE_DELETED, |
| 5522 | ctx); |
| 5523 | if (ret < 0) |
| 5524 | goto out; |
| 5525 | advance_right = ADVANCE; |
| 5526 | } else { |
Fabian Frederick | b99d9a6 | 2014-09-25 19:35:02 +0200 | [diff] [blame] | 5527 | enum btrfs_compare_tree_result result; |
Josef Bacik | ba5e8f2 | 2013-08-16 16:52:55 -0400 | [diff] [blame] | 5528 | |
Chris Mason | 74dd17f | 2012-08-07 16:25:13 -0400 | [diff] [blame] | 5529 | WARN_ON(!extent_buffer_uptodate(left_path->nodes[0])); |
Jeff Mahoney | 2ff7e61 | 2016-06-22 18:54:24 -0400 | [diff] [blame] | 5530 | ret = tree_compare_item(left_path, right_path, |
| 5531 | tmp_buf); |
Josef Bacik | ba5e8f2 | 2013-08-16 16:52:55 -0400 | [diff] [blame] | 5532 | if (ret) |
Fabian Frederick | b99d9a6 | 2014-09-25 19:35:02 +0200 | [diff] [blame] | 5533 | result = BTRFS_COMPARE_TREE_CHANGED; |
Josef Bacik | ba5e8f2 | 2013-08-16 16:52:55 -0400 | [diff] [blame] | 5534 | else |
Fabian Frederick | b99d9a6 | 2014-09-25 19:35:02 +0200 | [diff] [blame] | 5535 | result = BTRFS_COMPARE_TREE_SAME; |
Nikolay Borisov | ee8c494 | 2017-08-21 12:43:45 +0300 | [diff] [blame] | 5536 | ret = changed_cb(left_path, right_path, |
Fabian Frederick | b99d9a6 | 2014-09-25 19:35:02 +0200 | [diff] [blame] | 5537 | &left_key, result, ctx); |
Josef Bacik | ba5e8f2 | 2013-08-16 16:52:55 -0400 | [diff] [blame] | 5538 | if (ret < 0) |
| 5539 | goto out; |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5540 | advance_left = ADVANCE; |
| 5541 | advance_right = ADVANCE; |
| 5542 | } |
| 5543 | } else if (left_level == right_level) { |
| 5544 | cmp = btrfs_comp_cpu_keys(&left_key, &right_key); |
| 5545 | if (cmp < 0) { |
| 5546 | advance_left = ADVANCE; |
| 5547 | } else if (cmp > 0) { |
| 5548 | advance_right = ADVANCE; |
| 5549 | } else { |
| 5550 | left_blockptr = btrfs_node_blockptr( |
| 5551 | left_path->nodes[left_level], |
| 5552 | left_path->slots[left_level]); |
| 5553 | right_blockptr = btrfs_node_blockptr( |
| 5554 | right_path->nodes[right_level], |
| 5555 | right_path->slots[right_level]); |
Filipe Manana | 6baa429 | 2014-02-20 21:15:25 +0000 | [diff] [blame] | 5556 | left_gen = btrfs_node_ptr_generation( |
| 5557 | left_path->nodes[left_level], |
| 5558 | left_path->slots[left_level]); |
| 5559 | right_gen = btrfs_node_ptr_generation( |
| 5560 | right_path->nodes[right_level], |
| 5561 | right_path->slots[right_level]); |
| 5562 | if (left_blockptr == right_blockptr && |
| 5563 | left_gen == right_gen) { |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5564 | /* |
| 5565 | * As we're on a shared block, don't |
| 5566 | * allow to go deeper. |
| 5567 | */ |
| 5568 | advance_left = ADVANCE_ONLY_NEXT; |
| 5569 | advance_right = ADVANCE_ONLY_NEXT; |
| 5570 | } else { |
| 5571 | advance_left = ADVANCE; |
| 5572 | advance_right = ADVANCE; |
| 5573 | } |
| 5574 | } |
| 5575 | } else if (left_level < right_level) { |
| 5576 | advance_right = ADVANCE; |
| 5577 | } else { |
| 5578 | advance_left = ADVANCE; |
| 5579 | } |
| 5580 | } |
| 5581 | |
| 5582 | out: |
| 5583 | btrfs_free_path(left_path); |
| 5584 | btrfs_free_path(right_path); |
David Sterba | 8f282f7 | 2016-03-30 16:01:12 +0200 | [diff] [blame] | 5585 | kvfree(tmp_buf); |
Alexander Block | 7069830 | 2012-06-05 21:07:48 +0200 | [diff] [blame] | 5586 | return ret; |
| 5587 | } |
| 5588 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5589 | /* |
| 5590 | * this is similar to btrfs_next_leaf, but does not try to preserve |
| 5591 | * 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] | 5592 | * tree based on the current path and the min_trans parameters. |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5593 | * |
| 5594 | * 0 is returned if another key is found, < 0 if there are any errors |
| 5595 | * and 1 is returned if there are no higher keys in the tree |
| 5596 | * |
| 5597 | * path->keep_locks should be set to 1 on the search made before |
| 5598 | * calling this function. |
| 5599 | */ |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5600 | 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] | 5601 | struct btrfs_key *key, int level, u64 min_trans) |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5602 | { |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5603 | int slot; |
| 5604 | struct extent_buffer *c; |
| 5605 | |
Chris Mason | 934d375 | 2008-12-08 16:43:10 -0500 | [diff] [blame] | 5606 | WARN_ON(!path->keep_locks); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5607 | while (level < BTRFS_MAX_LEVEL) { |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5608 | if (!path->nodes[level]) |
| 5609 | return 1; |
| 5610 | |
| 5611 | slot = path->slots[level] + 1; |
| 5612 | c = path->nodes[level]; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5613 | next: |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5614 | if (slot >= btrfs_header_nritems(c)) { |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 5615 | int ret; |
| 5616 | int orig_lowest; |
| 5617 | struct btrfs_key cur_key; |
| 5618 | if (level + 1 >= BTRFS_MAX_LEVEL || |
| 5619 | !path->nodes[level + 1]) |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5620 | return 1; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 5621 | |
| 5622 | if (path->locks[level + 1]) { |
| 5623 | level++; |
| 5624 | continue; |
| 5625 | } |
| 5626 | |
| 5627 | slot = btrfs_header_nritems(c) - 1; |
| 5628 | if (level == 0) |
| 5629 | btrfs_item_key_to_cpu(c, &cur_key, slot); |
| 5630 | else |
| 5631 | btrfs_node_key_to_cpu(c, &cur_key, slot); |
| 5632 | |
| 5633 | orig_lowest = path->lowest_level; |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 5634 | btrfs_release_path(path); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 5635 | path->lowest_level = level; |
| 5636 | ret = btrfs_search_slot(NULL, root, &cur_key, path, |
| 5637 | 0, 0); |
| 5638 | path->lowest_level = orig_lowest; |
| 5639 | if (ret < 0) |
| 5640 | return ret; |
| 5641 | |
| 5642 | c = path->nodes[level]; |
| 5643 | slot = path->slots[level]; |
| 5644 | if (ret == 0) |
| 5645 | slot++; |
| 5646 | goto next; |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5647 | } |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 5648 | |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5649 | if (level == 0) |
| 5650 | btrfs_item_key_to_cpu(c, key, slot); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5651 | else { |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5652 | u64 gen = btrfs_node_ptr_generation(c, slot); |
| 5653 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5654 | if (gen < min_trans) { |
| 5655 | slot++; |
| 5656 | goto next; |
| 5657 | } |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5658 | btrfs_node_key_to_cpu(c, key, slot); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5659 | } |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5660 | return 0; |
| 5661 | } |
| 5662 | return 1; |
| 5663 | } |
| 5664 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 5665 | /* |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5666 | * search the tree again to find a leaf with greater keys |
Chris Mason | 0f70abe | 2007-02-28 16:46:22 -0500 | [diff] [blame] | 5667 | * returns 0 if it found something or 1 if there are no greater leaves. |
| 5668 | * returns < 0 on io errors. |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 5669 | */ |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 5670 | int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path) |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5671 | { |
Jan Schmidt | 3d7806e | 2012-06-11 08:29:29 +0200 | [diff] [blame] | 5672 | return btrfs_next_old_leaf(root, path, 0); |
| 5673 | } |
| 5674 | |
| 5675 | int btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path, |
| 5676 | u64 time_seq) |
| 5677 | { |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5678 | int slot; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5679 | int level; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5680 | struct extent_buffer *c; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5681 | struct extent_buffer *next; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5682 | struct btrfs_key key; |
| 5683 | u32 nritems; |
| 5684 | int ret; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5685 | int old_spinning = path->leave_spinning; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5686 | int next_rw_lock = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5687 | |
| 5688 | nritems = btrfs_header_nritems(path->nodes[0]); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5689 | if (nritems == 0) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5690 | return 1; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5691 | |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5692 | btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1); |
| 5693 | again: |
| 5694 | level = 1; |
| 5695 | next = NULL; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5696 | next_rw_lock = 0; |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 5697 | btrfs_release_path(path); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5698 | |
Chris Mason | a213501 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5699 | path->keep_locks = 1; |
Chris Mason | 31533fb | 2011-07-26 16:01:59 -0400 | [diff] [blame] | 5700 | path->leave_spinning = 1; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5701 | |
Jan Schmidt | 3d7806e | 2012-06-11 08:29:29 +0200 | [diff] [blame] | 5702 | if (time_seq) |
| 5703 | ret = btrfs_search_old_slot(root, &key, path, time_seq); |
| 5704 | else |
| 5705 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5706 | path->keep_locks = 0; |
| 5707 | |
| 5708 | if (ret < 0) |
| 5709 | return ret; |
| 5710 | |
Chris Mason | a213501 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5711 | nritems = btrfs_header_nritems(path->nodes[0]); |
Chris Mason | 168fd7d | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5712 | /* |
| 5713 | * by releasing the path above we dropped all our locks. A balance |
| 5714 | * could have added more items next to the key that used to be |
| 5715 | * at the very end of the block. So, check again here and |
| 5716 | * advance the path if there are now more items available. |
| 5717 | */ |
Chris Mason | a213501 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5718 | if (nritems > 0 && path->slots[0] < nritems - 1) { |
Yan Zheng | e457afe | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 5719 | if (ret == 0) |
| 5720 | path->slots[0]++; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5721 | ret = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5722 | goto done; |
| 5723 | } |
Liu Bo | 0b43e04 | 2014-06-09 11:04:49 +0800 | [diff] [blame] | 5724 | /* |
| 5725 | * So the above check misses one case: |
| 5726 | * - after releasing the path above, someone has removed the item that |
| 5727 | * used to be at the very end of the block, and balance between leafs |
| 5728 | * gets another one with bigger key.offset to replace it. |
| 5729 | * |
| 5730 | * This one should be returned as well, or we can get leaf corruption |
| 5731 | * later(esp. in __btrfs_drop_extents()). |
| 5732 | * |
| 5733 | * And a bit more explanation about this check, |
| 5734 | * with ret > 0, the key isn't found, the path points to the slot |
| 5735 | * where it should be inserted, so the path->slots[0] item must be the |
| 5736 | * bigger one. |
| 5737 | */ |
| 5738 | if (nritems > 0 && ret > 0 && path->slots[0] == nritems - 1) { |
| 5739 | ret = 0; |
| 5740 | goto done; |
| 5741 | } |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5742 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5743 | while (level < BTRFS_MAX_LEVEL) { |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5744 | if (!path->nodes[level]) { |
| 5745 | ret = 1; |
| 5746 | goto done; |
| 5747 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5748 | |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5749 | slot = path->slots[level] + 1; |
| 5750 | c = path->nodes[level]; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5751 | if (slot >= btrfs_header_nritems(c)) { |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5752 | level++; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5753 | if (level == BTRFS_MAX_LEVEL) { |
| 5754 | ret = 1; |
| 5755 | goto done; |
| 5756 | } |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5757 | continue; |
| 5758 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5759 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5760 | if (next) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5761 | btrfs_tree_unlock_rw(next, next_rw_lock); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5762 | free_extent_buffer(next); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5763 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5764 | |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5765 | next = c; |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5766 | next_rw_lock = path->locks[level]; |
Liu Bo | d07b852 | 2017-01-30 12:23:42 -0800 | [diff] [blame] | 5767 | ret = read_block_for_search(root, path, &next, level, |
David Sterba | cda79c5 | 2017-02-10 18:44:32 +0100 | [diff] [blame] | 5768 | slot, &key); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5769 | if (ret == -EAGAIN) |
| 5770 | goto again; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5771 | |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 5772 | if (ret < 0) { |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 5773 | btrfs_release_path(path); |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 5774 | goto done; |
| 5775 | } |
| 5776 | |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5777 | if (!path->skip_locking) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5778 | ret = btrfs_try_tree_read_lock(next); |
Jan Schmidt | d42244a | 2012-06-22 14:51:15 +0200 | [diff] [blame] | 5779 | if (!ret && time_seq) { |
| 5780 | /* |
| 5781 | * If we don't get the lock, we may be racing |
| 5782 | * with push_leaf_left, holding that lock while |
| 5783 | * itself waiting for the leaf we've currently |
| 5784 | * locked. To solve this situation, we give up |
| 5785 | * on our lock and cycle. |
| 5786 | */ |
Jan Schmidt | cf53883 | 2012-07-04 15:42:48 +0200 | [diff] [blame] | 5787 | free_extent_buffer(next); |
Jan Schmidt | d42244a | 2012-06-22 14:51:15 +0200 | [diff] [blame] | 5788 | btrfs_release_path(path); |
| 5789 | cond_resched(); |
| 5790 | goto again; |
| 5791 | } |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5792 | if (!ret) { |
| 5793 | btrfs_set_path_blocking(path); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5794 | btrfs_tree_read_lock(next); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5795 | } |
Chris Mason | 31533fb | 2011-07-26 16:01:59 -0400 | [diff] [blame] | 5796 | next_rw_lock = BTRFS_READ_LOCK; |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5797 | } |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5798 | break; |
| 5799 | } |
| 5800 | path->slots[level] = slot; |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5801 | while (1) { |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5802 | level--; |
| 5803 | c = path->nodes[level]; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5804 | if (path->locks[level]) |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5805 | btrfs_tree_unlock_rw(c, path->locks[level]); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5806 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 5807 | free_extent_buffer(c); |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5808 | path->nodes[level] = next; |
| 5809 | path->slots[level] = 0; |
Chris Mason | a74a4b9 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5810 | if (!path->skip_locking) |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5811 | path->locks[level] = next_rw_lock; |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5812 | if (!level) |
| 5813 | break; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 5814 | |
Liu Bo | d07b852 | 2017-01-30 12:23:42 -0800 | [diff] [blame] | 5815 | ret = read_block_for_search(root, path, &next, level, |
David Sterba | cda79c5 | 2017-02-10 18:44:32 +0100 | [diff] [blame] | 5816 | 0, &key); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5817 | if (ret == -EAGAIN) |
| 5818 | goto again; |
| 5819 | |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 5820 | if (ret < 0) { |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 5821 | btrfs_release_path(path); |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 5822 | goto done; |
| 5823 | } |
| 5824 | |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5825 | if (!path->skip_locking) { |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5826 | ret = btrfs_try_tree_read_lock(next); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5827 | if (!ret) { |
| 5828 | btrfs_set_path_blocking(path); |
Chris Mason | bd68151 | 2011-07-16 15:23:14 -0400 | [diff] [blame] | 5829 | btrfs_tree_read_lock(next); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5830 | } |
Chris Mason | 31533fb | 2011-07-26 16:01:59 -0400 | [diff] [blame] | 5831 | next_rw_lock = BTRFS_READ_LOCK; |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5832 | } |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5833 | } |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5834 | ret = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 5835 | done: |
Chris Mason | f7c79f3 | 2012-03-19 15:54:38 -0400 | [diff] [blame] | 5836 | unlock_up(path, 0, 1, 0, NULL); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 5837 | path->leave_spinning = old_spinning; |
| 5838 | if (!old_spinning) |
| 5839 | btrfs_set_path_blocking(path); |
| 5840 | |
| 5841 | return ret; |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 5842 | } |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5843 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 5844 | /* |
| 5845 | * this uses btrfs_prev_leaf to walk backwards in the tree, and keeps |
| 5846 | * searching until it gets past min_objectid or finds an item of 'type' |
| 5847 | * |
| 5848 | * returns 0 if something is found, 1 if nothing was found and < 0 on error |
| 5849 | */ |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5850 | int btrfs_previous_item(struct btrfs_root *root, |
| 5851 | struct btrfs_path *path, u64 min_objectid, |
| 5852 | int type) |
| 5853 | { |
| 5854 | struct btrfs_key found_key; |
| 5855 | struct extent_buffer *leaf; |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5856 | u32 nritems; |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5857 | int ret; |
| 5858 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 5859 | while (1) { |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5860 | if (path->slots[0] == 0) { |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 5861 | btrfs_set_path_blocking(path); |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5862 | ret = btrfs_prev_leaf(root, path); |
| 5863 | if (ret != 0) |
| 5864 | return ret; |
| 5865 | } else { |
| 5866 | path->slots[0]--; |
| 5867 | } |
| 5868 | leaf = path->nodes[0]; |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5869 | nritems = btrfs_header_nritems(leaf); |
| 5870 | if (nritems == 0) |
| 5871 | return 1; |
| 5872 | if (path->slots[0] == nritems) |
| 5873 | path->slots[0]--; |
| 5874 | |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5875 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5876 | if (found_key.objectid < min_objectid) |
| 5877 | break; |
Yan Zheng | 0a4eefb | 2009-07-24 11:06:53 -0400 | [diff] [blame] | 5878 | if (found_key.type == type) |
| 5879 | return 0; |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 5880 | if (found_key.objectid == min_objectid && |
| 5881 | found_key.type < type) |
| 5882 | break; |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 5883 | } |
| 5884 | return 1; |
| 5885 | } |
Wang Shilong | ade2e0b | 2014-01-12 21:38:33 +0800 | [diff] [blame] | 5886 | |
| 5887 | /* |
| 5888 | * search in extent tree to find a previous Metadata/Data extent item with |
| 5889 | * min objecitd. |
| 5890 | * |
| 5891 | * returns 0 if something is found, 1 if nothing was found and < 0 on error |
| 5892 | */ |
| 5893 | int btrfs_previous_extent_item(struct btrfs_root *root, |
| 5894 | struct btrfs_path *path, u64 min_objectid) |
| 5895 | { |
| 5896 | struct btrfs_key found_key; |
| 5897 | struct extent_buffer *leaf; |
| 5898 | u32 nritems; |
| 5899 | int ret; |
| 5900 | |
| 5901 | while (1) { |
| 5902 | if (path->slots[0] == 0) { |
| 5903 | btrfs_set_path_blocking(path); |
| 5904 | ret = btrfs_prev_leaf(root, path); |
| 5905 | if (ret != 0) |
| 5906 | return ret; |
| 5907 | } else { |
| 5908 | path->slots[0]--; |
| 5909 | } |
| 5910 | leaf = path->nodes[0]; |
| 5911 | nritems = btrfs_header_nritems(leaf); |
| 5912 | if (nritems == 0) |
| 5913 | return 1; |
| 5914 | if (path->slots[0] == nritems) |
| 5915 | path->slots[0]--; |
| 5916 | |
| 5917 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
| 5918 | if (found_key.objectid < min_objectid) |
| 5919 | break; |
| 5920 | if (found_key.type == BTRFS_EXTENT_ITEM_KEY || |
| 5921 | found_key.type == BTRFS_METADATA_ITEM_KEY) |
| 5922 | return 0; |
| 5923 | if (found_key.objectid == min_objectid && |
| 5924 | found_key.type < BTRFS_EXTENT_ITEM_KEY) |
| 5925 | break; |
| 5926 | } |
| 5927 | return 1; |
| 5928 | } |