Chris Mason | 6cbd557 | 2007-06-12 09:07:21 -0400 | [diff] [blame] | 1 | /* |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 2 | * Copyright (C) 2007,2008 Oracle. All rights reserved. |
Chris Mason | 6cbd557 | 2007-06-12 09:07:21 -0400 | [diff] [blame] | 3 | * |
| 4 | * This program is free software; you can redistribute it and/or |
| 5 | * modify it under the terms of the GNU General Public |
| 6 | * License v2 as published by the Free Software Foundation. |
| 7 | * |
| 8 | * This program is distributed in the hope that it will be useful, |
| 9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 11 | * General Public License for more details. |
| 12 | * |
| 13 | * You should have received a copy of the GNU General Public |
| 14 | * License along with this program; if not, write to the |
| 15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
| 16 | * Boston, MA 021110-1307, USA. |
| 17 | */ |
| 18 | |
Chris Mason | a6b6e75 | 2007-10-15 16:22:39 -0400 | [diff] [blame] | 19 | #include <linux/sched.h> |
Tejun Heo | 5a0e3ad | 2010-03-24 17:04:11 +0900 | [diff] [blame] | 20 | #include <linux/slab.h> |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 21 | #include "ctree.h" |
| 22 | #include "disk-io.h" |
Chris Mason | 7f5c151 | 2007-03-23 15:56:19 -0400 | [diff] [blame] | 23 | #include "transaction.h" |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 24 | #include "print-tree.h" |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 25 | #include "locking.h" |
Chris Mason | 9a8dd15 | 2007-02-23 08:38:36 -0500 | [diff] [blame] | 26 | |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 27 | static int split_node(struct btrfs_trans_handle *trans, struct btrfs_root |
| 28 | *root, struct btrfs_path *path, int level); |
| 29 | static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 30 | *root, struct btrfs_key *ins_key, |
Chris Mason | cc0c553 | 2007-10-25 15:42:57 -0400 | [diff] [blame] | 31 | struct btrfs_path *path, int data_size, int extend); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 32 | static int push_node_left(struct btrfs_trans_handle *trans, |
| 33 | struct btrfs_root *root, struct extent_buffer *dst, |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 34 | struct extent_buffer *src, int empty); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 35 | static int balance_node_right(struct btrfs_trans_handle *trans, |
| 36 | struct btrfs_root *root, |
| 37 | struct extent_buffer *dst_buf, |
| 38 | struct extent_buffer *src_buf); |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 39 | static int del_ptr(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 40 | struct btrfs_path *path, int level, int slot); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 41 | static int setup_items_for_insert(struct btrfs_trans_handle *trans, |
| 42 | struct btrfs_root *root, struct btrfs_path *path, |
| 43 | struct btrfs_key *cpu_key, u32 *data_size, |
| 44 | u32 total_data, u32 total_size, int nr); |
| 45 | |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 46 | |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 47 | struct btrfs_path *btrfs_alloc_path(void) |
| 48 | { |
Chris Mason | df24a2b | 2007-04-04 09:36:31 -0400 | [diff] [blame] | 49 | struct btrfs_path *path; |
Jeff Mahoney | e00f730 | 2009-02-12 14:11:25 -0500 | [diff] [blame] | 50 | path = kmem_cache_zalloc(btrfs_path_cachep, GFP_NOFS); |
| 51 | if (path) |
Chris Mason | 2cc58cf | 2007-08-27 16:49:44 -0400 | [diff] [blame] | 52 | path->reada = 1; |
Chris Mason | df24a2b | 2007-04-04 09:36:31 -0400 | [diff] [blame] | 53 | return path; |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 54 | } |
| 55 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 56 | /* |
| 57 | * set all locked nodes in the path to blocking locks. This should |
| 58 | * be done before scheduling |
| 59 | */ |
| 60 | noinline void btrfs_set_path_blocking(struct btrfs_path *p) |
| 61 | { |
| 62 | int i; |
| 63 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) { |
| 64 | if (p->nodes[i] && p->locks[i]) |
| 65 | btrfs_set_lock_blocking(p->nodes[i]); |
| 66 | } |
| 67 | } |
| 68 | |
| 69 | /* |
| 70 | * reset all the locked nodes in the patch to spinning locks. |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 71 | * |
| 72 | * held is used to keep lockdep happy, when lockdep is enabled |
| 73 | * we set held to a blocking lock before we go around and |
| 74 | * retake all the spinlocks in the path. You can safely use NULL |
| 75 | * for held |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 76 | */ |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 77 | noinline void btrfs_clear_path_blocking(struct btrfs_path *p, |
| 78 | struct extent_buffer *held) |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 79 | { |
| 80 | int i; |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 81 | |
| 82 | #ifdef CONFIG_DEBUG_LOCK_ALLOC |
| 83 | /* lockdep really cares that we take all of these spinlocks |
| 84 | * in the right order. If any of the locks in the path are not |
| 85 | * currently blocking, it is going to complain. So, make really |
| 86 | * really sure by forcing the path to blocking before we clear |
| 87 | * the path blocking. |
| 88 | */ |
| 89 | if (held) |
| 90 | btrfs_set_lock_blocking(held); |
| 91 | btrfs_set_path_blocking(p); |
| 92 | #endif |
| 93 | |
| 94 | for (i = BTRFS_MAX_LEVEL - 1; i >= 0; i--) { |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 95 | if (p->nodes[i] && p->locks[i]) |
| 96 | btrfs_clear_lock_blocking(p->nodes[i]); |
| 97 | } |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 98 | |
| 99 | #ifdef CONFIG_DEBUG_LOCK_ALLOC |
| 100 | if (held) |
| 101 | btrfs_clear_lock_blocking(held); |
| 102 | #endif |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 103 | } |
| 104 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 105 | /* this also releases the path */ |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 106 | void btrfs_free_path(struct btrfs_path *p) |
| 107 | { |
Jesper Juhl | ff175d5 | 2010-12-25 21:22:30 +0000 | [diff] [blame] | 108 | if (!p) |
| 109 | return; |
Chris Mason | df24a2b | 2007-04-04 09:36:31 -0400 | [diff] [blame] | 110 | btrfs_release_path(NULL, p); |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 111 | kmem_cache_free(btrfs_path_cachep, p); |
| 112 | } |
| 113 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 114 | /* |
| 115 | * path release drops references on the extent buffers in the path |
| 116 | * and it drops any locks held by this path |
| 117 | * |
| 118 | * It is safe to call this on paths that no locks or extent buffers held. |
| 119 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 120 | noinline void btrfs_release_path(struct btrfs_root *root, struct btrfs_path *p) |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 121 | { |
| 122 | int i; |
Chris Mason | a213501 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 123 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 124 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) { |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 125 | p->slots[i] = 0; |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 126 | if (!p->nodes[i]) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 127 | continue; |
| 128 | if (p->locks[i]) { |
| 129 | btrfs_tree_unlock(p->nodes[i]); |
| 130 | p->locks[i] = 0; |
| 131 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 132 | free_extent_buffer(p->nodes[i]); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 133 | p->nodes[i] = NULL; |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 134 | } |
| 135 | } |
| 136 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 137 | /* |
| 138 | * safely gets a reference on the root node of a tree. A lock |
| 139 | * is not taken, so a concurrent writer may put a different node |
| 140 | * at the root of the tree. See btrfs_lock_root_node for the |
| 141 | * looping required. |
| 142 | * |
| 143 | * The extent buffer returned by this has a reference taken, so |
| 144 | * it won't disappear. It may stop being the root of the tree |
| 145 | * at any time because there are no locks held. |
| 146 | */ |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 147 | struct extent_buffer *btrfs_root_node(struct btrfs_root *root) |
| 148 | { |
| 149 | struct extent_buffer *eb; |
| 150 | spin_lock(&root->node_lock); |
| 151 | eb = root->node; |
| 152 | extent_buffer_get(eb); |
| 153 | spin_unlock(&root->node_lock); |
| 154 | return eb; |
| 155 | } |
| 156 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 157 | /* loop around taking references on and locking the root node of the |
| 158 | * tree until you end up with a lock on the root. A locked buffer |
| 159 | * is returned, with a reference held. |
| 160 | */ |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 161 | struct extent_buffer *btrfs_lock_root_node(struct btrfs_root *root) |
| 162 | { |
| 163 | struct extent_buffer *eb; |
| 164 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 165 | while (1) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 166 | eb = btrfs_root_node(root); |
| 167 | btrfs_tree_lock(eb); |
| 168 | |
| 169 | spin_lock(&root->node_lock); |
| 170 | if (eb == root->node) { |
| 171 | spin_unlock(&root->node_lock); |
| 172 | break; |
| 173 | } |
| 174 | spin_unlock(&root->node_lock); |
| 175 | |
| 176 | btrfs_tree_unlock(eb); |
| 177 | free_extent_buffer(eb); |
| 178 | } |
| 179 | return eb; |
| 180 | } |
| 181 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 182 | /* cowonly root (everything not a reference counted cow subvolume), just get |
| 183 | * put onto a simple dirty list. transaction.c walks this to make sure they |
| 184 | * get properly updated on disk. |
| 185 | */ |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 186 | static void add_root_to_dirty_list(struct btrfs_root *root) |
| 187 | { |
| 188 | if (root->track_dirty && list_empty(&root->dirty_list)) { |
| 189 | list_add(&root->dirty_list, |
| 190 | &root->fs_info->dirty_cowonly_roots); |
| 191 | } |
| 192 | } |
| 193 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 194 | /* |
| 195 | * used by snapshot creation to make a copy of a root for a tree with |
| 196 | * a given objectid. The buffer with the new root node is returned in |
| 197 | * cow_ret, and this func returns zero on success or a negative error code. |
| 198 | */ |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 199 | int btrfs_copy_root(struct btrfs_trans_handle *trans, |
| 200 | struct btrfs_root *root, |
| 201 | struct extent_buffer *buf, |
| 202 | struct extent_buffer **cow_ret, u64 new_root_objectid) |
| 203 | { |
| 204 | struct extent_buffer *cow; |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 205 | int ret = 0; |
| 206 | int level; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 207 | struct btrfs_disk_key disk_key; |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 208 | |
| 209 | WARN_ON(root->ref_cows && trans->transid != |
| 210 | root->fs_info->running_transaction->transid); |
| 211 | WARN_ON(root->ref_cows && trans->transid != root->last_trans); |
| 212 | |
| 213 | level = btrfs_header_level(buf); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 214 | if (level == 0) |
| 215 | btrfs_item_key(buf, &disk_key, 0); |
| 216 | else |
| 217 | btrfs_node_key(buf, &disk_key, 0); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 218 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 219 | cow = btrfs_alloc_free_block(trans, root, buf->len, 0, |
| 220 | new_root_objectid, &disk_key, level, |
| 221 | buf->start, 0); |
| 222 | if (IS_ERR(cow)) |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 223 | return PTR_ERR(cow); |
| 224 | |
| 225 | copy_extent_buffer(cow, buf, 0, 0, cow->len); |
| 226 | btrfs_set_header_bytenr(cow, cow->start); |
| 227 | btrfs_set_header_generation(cow, trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 228 | btrfs_set_header_backref_rev(cow, BTRFS_MIXED_BACKREF_REV); |
| 229 | btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN | |
| 230 | BTRFS_HEADER_FLAG_RELOC); |
| 231 | if (new_root_objectid == BTRFS_TREE_RELOC_OBJECTID) |
| 232 | btrfs_set_header_flag(cow, BTRFS_HEADER_FLAG_RELOC); |
| 233 | else |
| 234 | btrfs_set_header_owner(cow, new_root_objectid); |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 235 | |
Yan Zheng | 2b82032 | 2008-11-17 21:11:30 -0500 | [diff] [blame] | 236 | write_extent_buffer(cow, root->fs_info->fsid, |
| 237 | (unsigned long)btrfs_header_fsid(cow), |
| 238 | BTRFS_FSID_SIZE); |
| 239 | |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 240 | WARN_ON(btrfs_header_generation(buf) > trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 241 | if (new_root_objectid == BTRFS_TREE_RELOC_OBJECTID) |
| 242 | ret = btrfs_inc_ref(trans, root, cow, 1); |
| 243 | else |
| 244 | ret = btrfs_inc_ref(trans, root, cow, 0); |
Chris Mason | 4aec2b5 | 2007-12-18 16:25:45 -0500 | [diff] [blame] | 245 | |
Chris Mason | be20aa9 | 2007-12-17 20:14:01 -0500 | [diff] [blame] | 246 | if (ret) |
| 247 | return ret; |
| 248 | |
| 249 | btrfs_mark_buffer_dirty(cow); |
| 250 | *cow_ret = cow; |
| 251 | return 0; |
| 252 | } |
| 253 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 254 | /* |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 255 | * check if the tree block can be shared by multiple trees |
| 256 | */ |
| 257 | int btrfs_block_can_be_shared(struct btrfs_root *root, |
| 258 | struct extent_buffer *buf) |
| 259 | { |
| 260 | /* |
| 261 | * Tree blocks not in refernece counted trees and tree roots |
| 262 | * are never shared. If a block was allocated after the last |
| 263 | * snapshot and the block was not allocated by tree relocation, |
| 264 | * we know the block is not shared. |
| 265 | */ |
| 266 | if (root->ref_cows && |
| 267 | buf != root->node && buf != root->commit_root && |
| 268 | (btrfs_header_generation(buf) <= |
| 269 | btrfs_root_last_snapshot(&root->root_item) || |
| 270 | btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC))) |
| 271 | return 1; |
| 272 | #ifdef BTRFS_COMPAT_EXTENT_TREE_V0 |
| 273 | if (root->ref_cows && |
| 274 | btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV) |
| 275 | return 1; |
| 276 | #endif |
| 277 | return 0; |
| 278 | } |
| 279 | |
| 280 | static noinline int update_ref_for_cow(struct btrfs_trans_handle *trans, |
| 281 | struct btrfs_root *root, |
| 282 | struct extent_buffer *buf, |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 283 | struct extent_buffer *cow, |
| 284 | int *last_ref) |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 285 | { |
| 286 | u64 refs; |
| 287 | u64 owner; |
| 288 | u64 flags; |
| 289 | u64 new_flags = 0; |
| 290 | int ret; |
| 291 | |
| 292 | /* |
| 293 | * Backrefs update rules: |
| 294 | * |
| 295 | * Always use full backrefs for extent pointers in tree block |
| 296 | * allocated by tree relocation. |
| 297 | * |
| 298 | * If a shared tree block is no longer referenced by its owner |
| 299 | * tree (btrfs_header_owner(buf) == root->root_key.objectid), |
| 300 | * use full backrefs for extent pointers in tree block. |
| 301 | * |
| 302 | * If a tree block is been relocating |
| 303 | * (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID), |
| 304 | * use full backrefs for extent pointers in tree block. |
| 305 | * The reason for this is some operations (such as drop tree) |
| 306 | * are only allowed for blocks use full backrefs. |
| 307 | */ |
| 308 | |
| 309 | if (btrfs_block_can_be_shared(root, buf)) { |
| 310 | ret = btrfs_lookup_extent_info(trans, root, buf->start, |
| 311 | buf->len, &refs, &flags); |
| 312 | BUG_ON(ret); |
| 313 | BUG_ON(refs == 0); |
| 314 | } else { |
| 315 | refs = 1; |
| 316 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID || |
| 317 | btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV) |
| 318 | flags = BTRFS_BLOCK_FLAG_FULL_BACKREF; |
| 319 | else |
| 320 | flags = 0; |
| 321 | } |
| 322 | |
| 323 | owner = btrfs_header_owner(buf); |
| 324 | BUG_ON(owner == BTRFS_TREE_RELOC_OBJECTID && |
| 325 | !(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)); |
| 326 | |
| 327 | if (refs > 1) { |
| 328 | if ((owner == root->root_key.objectid || |
| 329 | root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) && |
| 330 | !(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) { |
| 331 | ret = btrfs_inc_ref(trans, root, buf, 1); |
| 332 | BUG_ON(ret); |
| 333 | |
| 334 | if (root->root_key.objectid == |
| 335 | BTRFS_TREE_RELOC_OBJECTID) { |
| 336 | ret = btrfs_dec_ref(trans, root, buf, 0); |
| 337 | BUG_ON(ret); |
| 338 | ret = btrfs_inc_ref(trans, root, cow, 1); |
| 339 | BUG_ON(ret); |
| 340 | } |
| 341 | new_flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF; |
| 342 | } else { |
| 343 | |
| 344 | if (root->root_key.objectid == |
| 345 | BTRFS_TREE_RELOC_OBJECTID) |
| 346 | ret = btrfs_inc_ref(trans, root, cow, 1); |
| 347 | else |
| 348 | ret = btrfs_inc_ref(trans, root, cow, 0); |
| 349 | BUG_ON(ret); |
| 350 | } |
| 351 | if (new_flags != 0) { |
| 352 | ret = btrfs_set_disk_extent_flags(trans, root, |
| 353 | buf->start, |
| 354 | buf->len, |
| 355 | new_flags, 0); |
| 356 | BUG_ON(ret); |
| 357 | } |
| 358 | } else { |
| 359 | if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) { |
| 360 | if (root->root_key.objectid == |
| 361 | BTRFS_TREE_RELOC_OBJECTID) |
| 362 | ret = btrfs_inc_ref(trans, root, cow, 1); |
| 363 | else |
| 364 | ret = btrfs_inc_ref(trans, root, cow, 0); |
| 365 | BUG_ON(ret); |
| 366 | ret = btrfs_dec_ref(trans, root, buf, 1); |
| 367 | BUG_ON(ret); |
| 368 | } |
| 369 | clean_tree_block(trans, root, buf); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 370 | *last_ref = 1; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 371 | } |
| 372 | return 0; |
| 373 | } |
| 374 | |
| 375 | /* |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 376 | * does the dirty work in cow of a single block. The parent block (if |
| 377 | * supplied) is updated to point to the new cow copy. The new buffer is marked |
| 378 | * dirty and returned locked. If you modify the block it needs to be marked |
| 379 | * dirty again. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 380 | * |
| 381 | * search_start -- an allocation hint for the new block |
| 382 | * |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 383 | * empty_size -- a hint that you plan on doing more cow. This is the size in |
| 384 | * bytes the allocator should try to find free next to the block it returns. |
| 385 | * This is just a hint and may be ignored by the allocator. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 386 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 387 | static noinline int __btrfs_cow_block(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 388 | struct btrfs_root *root, |
| 389 | struct extent_buffer *buf, |
| 390 | struct extent_buffer *parent, int parent_slot, |
| 391 | struct extent_buffer **cow_ret, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 392 | u64 search_start, u64 empty_size) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 393 | { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 394 | struct btrfs_disk_key disk_key; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 395 | struct extent_buffer *cow; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 396 | int level; |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 397 | int last_ref = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 398 | int unlock_orig = 0; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 399 | u64 parent_start; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 400 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 401 | if (*cow_ret == buf) |
| 402 | unlock_orig = 1; |
| 403 | |
Chris Mason | b9447ef | 2009-03-09 11:45:38 -0400 | [diff] [blame] | 404 | btrfs_assert_tree_locked(buf); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 405 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 406 | WARN_ON(root->ref_cows && trans->transid != |
| 407 | root->fs_info->running_transaction->transid); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 408 | WARN_ON(root->ref_cows && trans->transid != root->last_trans); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 409 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 410 | level = btrfs_header_level(buf); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 411 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 412 | if (level == 0) |
| 413 | btrfs_item_key(buf, &disk_key, 0); |
| 414 | else |
| 415 | btrfs_node_key(buf, &disk_key, 0); |
| 416 | |
| 417 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { |
| 418 | if (parent) |
| 419 | parent_start = parent->start; |
| 420 | else |
| 421 | parent_start = 0; |
| 422 | } else |
| 423 | parent_start = 0; |
| 424 | |
| 425 | cow = btrfs_alloc_free_block(trans, root, buf->len, parent_start, |
| 426 | root->root_key.objectid, &disk_key, |
| 427 | level, search_start, empty_size); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 428 | if (IS_ERR(cow)) |
| 429 | return PTR_ERR(cow); |
| 430 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 431 | /* cow is set to blocking by btrfs_init_new_buffer */ |
| 432 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 433 | copy_extent_buffer(cow, buf, 0, 0, cow->len); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 434 | btrfs_set_header_bytenr(cow, cow->start); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 435 | btrfs_set_header_generation(cow, trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 436 | btrfs_set_header_backref_rev(cow, BTRFS_MIXED_BACKREF_REV); |
| 437 | btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN | |
| 438 | BTRFS_HEADER_FLAG_RELOC); |
| 439 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) |
| 440 | btrfs_set_header_flag(cow, BTRFS_HEADER_FLAG_RELOC); |
| 441 | else |
| 442 | btrfs_set_header_owner(cow, root->root_key.objectid); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 443 | |
Yan Zheng | 2b82032 | 2008-11-17 21:11:30 -0500 | [diff] [blame] | 444 | write_extent_buffer(cow, root->fs_info->fsid, |
| 445 | (unsigned long)btrfs_header_fsid(cow), |
| 446 | BTRFS_FSID_SIZE); |
| 447 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 448 | update_ref_for_cow(trans, root, buf, cow, &last_ref); |
Zheng Yan | 1a40e23 | 2008-09-26 10:09:34 -0400 | [diff] [blame] | 449 | |
Yan, Zheng | 3fd0a55 | 2010-05-16 10:49:59 -0400 | [diff] [blame] | 450 | if (root->ref_cows) |
| 451 | btrfs_reloc_cow_block(trans, root, buf, cow); |
| 452 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 453 | if (buf == root->node) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 454 | WARN_ON(parent && parent != buf); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 455 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID || |
| 456 | btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV) |
| 457 | parent_start = buf->start; |
| 458 | else |
| 459 | parent_start = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 460 | |
| 461 | spin_lock(&root->node_lock); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 462 | root->node = cow; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 463 | extent_buffer_get(cow); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 464 | spin_unlock(&root->node_lock); |
| 465 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 466 | btrfs_free_tree_block(trans, root, buf, parent_start, |
| 467 | last_ref); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 468 | free_extent_buffer(buf); |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 469 | add_root_to_dirty_list(root); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 470 | } else { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 471 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) |
| 472 | parent_start = parent->start; |
| 473 | else |
| 474 | parent_start = 0; |
| 475 | |
| 476 | WARN_ON(trans->transid != btrfs_header_generation(parent)); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 477 | btrfs_set_node_blockptr(parent, parent_slot, |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 478 | cow->start); |
Chris Mason | 74493f7 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 479 | btrfs_set_node_ptr_generation(parent, parent_slot, |
| 480 | trans->transid); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 481 | btrfs_mark_buffer_dirty(parent); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 482 | btrfs_free_tree_block(trans, root, buf, parent_start, |
| 483 | last_ref); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 484 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 485 | if (unlock_orig) |
| 486 | btrfs_tree_unlock(buf); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 487 | free_extent_buffer(buf); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 488 | btrfs_mark_buffer_dirty(cow); |
| 489 | *cow_ret = cow; |
| 490 | return 0; |
| 491 | } |
| 492 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 493 | static inline int should_cow_block(struct btrfs_trans_handle *trans, |
| 494 | struct btrfs_root *root, |
| 495 | struct extent_buffer *buf) |
| 496 | { |
| 497 | if (btrfs_header_generation(buf) == trans->transid && |
| 498 | !btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN) && |
| 499 | !(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID && |
| 500 | btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC))) |
| 501 | return 0; |
| 502 | return 1; |
| 503 | } |
| 504 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 505 | /* |
| 506 | * cows a single block, see __btrfs_cow_block for the real work. |
| 507 | * This version of it has extra checks so that a block isn't cow'd more than |
| 508 | * once per transaction, as long as it hasn't been written yet |
| 509 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 510 | noinline int btrfs_cow_block(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 511 | struct btrfs_root *root, struct extent_buffer *buf, |
| 512 | struct extent_buffer *parent, int parent_slot, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 513 | struct extent_buffer **cow_ret) |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 514 | { |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 515 | u64 search_start; |
Chris Mason | f510cfe | 2007-10-15 16:14:48 -0400 | [diff] [blame] | 516 | int ret; |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 517 | |
Chris Mason | ccd467d | 2007-06-28 15:57:36 -0400 | [diff] [blame] | 518 | if (trans->transaction != root->fs_info->running_transaction) { |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 519 | printk(KERN_CRIT "trans %llu running %llu\n", |
| 520 | (unsigned long long)trans->transid, |
| 521 | (unsigned long long) |
Chris Mason | ccd467d | 2007-06-28 15:57:36 -0400 | [diff] [blame] | 522 | root->fs_info->running_transaction->transid); |
| 523 | WARN_ON(1); |
| 524 | } |
| 525 | if (trans->transid != root->fs_info->generation) { |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 526 | printk(KERN_CRIT "trans %llu running %llu\n", |
| 527 | (unsigned long long)trans->transid, |
| 528 | (unsigned long long)root->fs_info->generation); |
Chris Mason | ccd467d | 2007-06-28 15:57:36 -0400 | [diff] [blame] | 529 | WARN_ON(1); |
| 530 | } |
Chris Mason | dc17ff8 | 2008-01-08 15:46:30 -0500 | [diff] [blame] | 531 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 532 | if (!should_cow_block(trans, root, buf)) { |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 533 | *cow_ret = buf; |
| 534 | return 0; |
| 535 | } |
Chris Mason | c487685 | 2009-02-04 09:24:25 -0500 | [diff] [blame] | 536 | |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 537 | search_start = buf->start & ~((u64)(1024 * 1024 * 1024) - 1); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 538 | |
| 539 | if (parent) |
| 540 | btrfs_set_lock_blocking(parent); |
| 541 | btrfs_set_lock_blocking(buf); |
| 542 | |
Chris Mason | f510cfe | 2007-10-15 16:14:48 -0400 | [diff] [blame] | 543 | ret = __btrfs_cow_block(trans, root, buf, parent, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 544 | parent_slot, cow_ret, search_start, 0); |
Chris Mason | f510cfe | 2007-10-15 16:14:48 -0400 | [diff] [blame] | 545 | return ret; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 546 | } |
| 547 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 548 | /* |
| 549 | * helper function for defrag to decide if two blocks pointed to by a |
| 550 | * node are actually close by |
| 551 | */ |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 552 | static int close_blocks(u64 blocknr, u64 other, u32 blocksize) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 553 | { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 554 | if (blocknr < other && other - (blocknr + blocksize) < 32768) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 555 | return 1; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 556 | if (blocknr > other && blocknr - (other + blocksize) < 32768) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 557 | return 1; |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 558 | return 0; |
| 559 | } |
| 560 | |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 561 | /* |
| 562 | * compare two keys in a memcmp fashion |
| 563 | */ |
| 564 | static int comp_keys(struct btrfs_disk_key *disk, struct btrfs_key *k2) |
| 565 | { |
| 566 | struct btrfs_key k1; |
| 567 | |
| 568 | btrfs_disk_key_to_cpu(&k1, disk); |
| 569 | |
Diego Calleja | 20736ab | 2009-07-24 11:06:52 -0400 | [diff] [blame] | 570 | return btrfs_comp_cpu_keys(&k1, k2); |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 571 | } |
| 572 | |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 573 | /* |
| 574 | * same as comp_keys only with two btrfs_key's |
| 575 | */ |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 576 | int btrfs_comp_cpu_keys(struct btrfs_key *k1, struct btrfs_key *k2) |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 577 | { |
| 578 | if (k1->objectid > k2->objectid) |
| 579 | return 1; |
| 580 | if (k1->objectid < k2->objectid) |
| 581 | return -1; |
| 582 | if (k1->type > k2->type) |
| 583 | return 1; |
| 584 | if (k1->type < k2->type) |
| 585 | return -1; |
| 586 | if (k1->offset > k2->offset) |
| 587 | return 1; |
| 588 | if (k1->offset < k2->offset) |
| 589 | return -1; |
| 590 | return 0; |
| 591 | } |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 592 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 593 | /* |
| 594 | * this is used by the defrag code to go through all the |
| 595 | * leaves pointed to by a node and reallocate them so that |
| 596 | * disk order is close to key order |
| 597 | */ |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 598 | int btrfs_realloc_node(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 599 | struct btrfs_root *root, struct extent_buffer *parent, |
Chris Mason | a6b6e75 | 2007-10-15 16:22:39 -0400 | [diff] [blame] | 600 | int start_slot, int cache_only, u64 *last_ret, |
| 601 | struct btrfs_key *progress) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 602 | { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 603 | struct extent_buffer *cur; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 604 | u64 blocknr; |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 605 | u64 gen; |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 606 | u64 search_start = *last_ret; |
| 607 | u64 last_block = 0; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 608 | u64 other; |
| 609 | u32 parent_nritems; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 610 | int end_slot; |
| 611 | int i; |
| 612 | int err = 0; |
Chris Mason | f2183bd | 2007-08-10 14:42:37 -0400 | [diff] [blame] | 613 | int parent_level; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 614 | int uptodate; |
| 615 | u32 blocksize; |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 616 | int progress_passed = 0; |
| 617 | struct btrfs_disk_key disk_key; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 618 | |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 619 | parent_level = btrfs_header_level(parent); |
| 620 | if (cache_only && parent_level != 1) |
| 621 | return 0; |
| 622 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 623 | if (trans->transaction != root->fs_info->running_transaction) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 624 | WARN_ON(1); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 625 | if (trans->transid != root->fs_info->generation) |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 626 | WARN_ON(1); |
Chris Mason | 86479a0 | 2007-09-10 19:58:16 -0400 | [diff] [blame] | 627 | |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 628 | parent_nritems = btrfs_header_nritems(parent); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 629 | blocksize = btrfs_level_size(root, parent_level - 1); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 630 | end_slot = parent_nritems; |
| 631 | |
| 632 | if (parent_nritems == 1) |
| 633 | return 0; |
| 634 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 635 | btrfs_set_lock_blocking(parent); |
| 636 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 637 | for (i = start_slot; i < end_slot; i++) { |
| 638 | int close = 1; |
Chris Mason | a6b6e75 | 2007-10-15 16:22:39 -0400 | [diff] [blame] | 639 | |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 640 | if (!parent->map_token) { |
| 641 | map_extent_buffer(parent, |
| 642 | btrfs_node_key_ptr_offset(i), |
| 643 | sizeof(struct btrfs_key_ptr), |
| 644 | &parent->map_token, &parent->kaddr, |
| 645 | &parent->map_start, &parent->map_len, |
| 646 | KM_USER1); |
| 647 | } |
Chris Mason | 081e957 | 2007-11-06 10:26:24 -0500 | [diff] [blame] | 648 | btrfs_node_key(parent, &disk_key, i); |
| 649 | if (!progress_passed && comp_keys(&disk_key, progress) < 0) |
| 650 | continue; |
| 651 | |
| 652 | progress_passed = 1; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 653 | blocknr = btrfs_node_blockptr(parent, i); |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 654 | gen = btrfs_node_ptr_generation(parent, i); |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 655 | if (last_block == 0) |
| 656 | last_block = blocknr; |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 657 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 658 | if (i > 0) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 659 | other = btrfs_node_blockptr(parent, i - 1); |
| 660 | close = close_blocks(blocknr, other, blocksize); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 661 | } |
Chris Mason | 0ef3e66 | 2008-05-24 14:04:53 -0400 | [diff] [blame] | 662 | if (!close && i < end_slot - 2) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 663 | other = btrfs_node_blockptr(parent, i + 1); |
| 664 | close = close_blocks(blocknr, other, blocksize); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 665 | } |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 666 | if (close) { |
| 667 | last_block = blocknr; |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 668 | continue; |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 669 | } |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 670 | if (parent->map_token) { |
| 671 | unmap_extent_buffer(parent, parent->map_token, |
| 672 | KM_USER1); |
| 673 | parent->map_token = NULL; |
| 674 | } |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 675 | |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 676 | cur = btrfs_find_tree_block(root, blocknr, blocksize); |
| 677 | if (cur) |
Chris Mason | 1259ab7 | 2008-05-12 13:39:03 -0400 | [diff] [blame] | 678 | uptodate = btrfs_buffer_uptodate(cur, gen); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 679 | else |
| 680 | uptodate = 0; |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 681 | if (!cur || !uptodate) { |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 682 | if (cache_only) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 683 | free_extent_buffer(cur); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 684 | continue; |
| 685 | } |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 686 | if (!cur) { |
| 687 | cur = read_tree_block(root, blocknr, |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 688 | blocksize, gen); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 689 | } else if (!uptodate) { |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 690 | btrfs_read_buffer(cur, gen); |
Chris Mason | f2183bd | 2007-08-10 14:42:37 -0400 | [diff] [blame] | 691 | } |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 692 | } |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 693 | if (search_start == 0) |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 694 | search_start = last_block; |
Chris Mason | e9d0b13 | 2007-08-10 14:06:19 -0400 | [diff] [blame] | 695 | |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 696 | btrfs_tree_lock(cur); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 697 | btrfs_set_lock_blocking(cur); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 698 | err = __btrfs_cow_block(trans, root, cur, parent, i, |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 699 | &cur, search_start, |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 700 | min(16 * blocksize, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 701 | (end_slot - i) * blocksize)); |
Yan | 252c38f | 2007-08-29 09:11:44 -0400 | [diff] [blame] | 702 | if (err) { |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 703 | btrfs_tree_unlock(cur); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 704 | free_extent_buffer(cur); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 705 | break; |
Yan | 252c38f | 2007-08-29 09:11:44 -0400 | [diff] [blame] | 706 | } |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 707 | search_start = cur->start; |
| 708 | last_block = cur->start; |
Chris Mason | f2183bd | 2007-08-10 14:42:37 -0400 | [diff] [blame] | 709 | *last_ret = search_start; |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 710 | btrfs_tree_unlock(cur); |
| 711 | free_extent_buffer(cur); |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 712 | } |
Chris Mason | 5708b95 | 2007-10-25 15:43:18 -0400 | [diff] [blame] | 713 | if (parent->map_token) { |
| 714 | unmap_extent_buffer(parent, parent->map_token, |
| 715 | KM_USER1); |
| 716 | parent->map_token = NULL; |
| 717 | } |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 718 | return err; |
| 719 | } |
| 720 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 721 | /* |
| 722 | * The leaf data grows from end-to-front in the node. |
| 723 | * this returns the address of the start of the last item, |
| 724 | * which is the stop of the leaf data stack |
| 725 | */ |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 726 | static inline unsigned int leaf_data_end(struct btrfs_root *root, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 727 | struct extent_buffer *leaf) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 728 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 729 | u32 nr = btrfs_header_nritems(leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 730 | if (nr == 0) |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 731 | return BTRFS_LEAF_DATA_SIZE(root); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 732 | return btrfs_item_offset_nr(leaf, nr - 1); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 733 | } |
| 734 | |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 735 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 736 | /* |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 737 | * search for key in the extent_buffer. The items start at offset p, |
| 738 | * and they are item_size apart. There are 'max' items in p. |
| 739 | * |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 740 | * the slot in the array is returned via slot, and it points to |
| 741 | * the place where you would insert key if it is not found in |
| 742 | * the array. |
| 743 | * |
| 744 | * slot may point to max if the key is bigger than all of the keys |
| 745 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 746 | static noinline int generic_bin_search(struct extent_buffer *eb, |
| 747 | unsigned long p, |
| 748 | int item_size, struct btrfs_key *key, |
| 749 | int max, int *slot) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 750 | { |
| 751 | int low = 0; |
| 752 | int high = max; |
| 753 | int mid; |
| 754 | int ret; |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 755 | struct btrfs_disk_key *tmp = NULL; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 756 | struct btrfs_disk_key unaligned; |
| 757 | unsigned long offset; |
| 758 | char *map_token = NULL; |
| 759 | char *kaddr = NULL; |
| 760 | unsigned long map_start = 0; |
| 761 | unsigned long map_len = 0; |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 762 | int err; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 763 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 764 | while (low < high) { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 765 | mid = (low + high) / 2; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 766 | offset = p + mid * item_size; |
| 767 | |
| 768 | if (!map_token || offset < map_start || |
| 769 | (offset + sizeof(struct btrfs_disk_key)) > |
| 770 | map_start + map_len) { |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 771 | if (map_token) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 772 | unmap_extent_buffer(eb, map_token, KM_USER0); |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 773 | map_token = NULL; |
| 774 | } |
Chris Mason | 934d375 | 2008-12-08 16:43:10 -0500 | [diff] [blame] | 775 | |
| 776 | err = map_private_extent_buffer(eb, offset, |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 777 | sizeof(struct btrfs_disk_key), |
| 778 | &map_token, &kaddr, |
| 779 | &map_start, &map_len, KM_USER0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 780 | |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 781 | if (!err) { |
| 782 | tmp = (struct btrfs_disk_key *)(kaddr + offset - |
| 783 | map_start); |
| 784 | } else { |
| 785 | read_extent_buffer(eb, &unaligned, |
| 786 | offset, sizeof(unaligned)); |
| 787 | tmp = &unaligned; |
| 788 | } |
| 789 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 790 | } else { |
| 791 | tmp = (struct btrfs_disk_key *)(kaddr + offset - |
| 792 | map_start); |
| 793 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 794 | ret = comp_keys(tmp, key); |
| 795 | |
| 796 | if (ret < 0) |
| 797 | low = mid + 1; |
| 798 | else if (ret > 0) |
| 799 | high = mid; |
| 800 | else { |
| 801 | *slot = mid; |
Chris Mason | 479965d | 2007-10-15 16:14:27 -0400 | [diff] [blame] | 802 | if (map_token) |
| 803 | unmap_extent_buffer(eb, map_token, KM_USER0); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 804 | return 0; |
| 805 | } |
| 806 | } |
| 807 | *slot = low; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 808 | if (map_token) |
| 809 | unmap_extent_buffer(eb, map_token, KM_USER0); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 810 | return 1; |
| 811 | } |
| 812 | |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 813 | /* |
| 814 | * simple bin_search frontend that does the right thing for |
| 815 | * leaves vs nodes |
| 816 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 817 | static int bin_search(struct extent_buffer *eb, struct btrfs_key *key, |
| 818 | int level, int *slot) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 819 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 820 | if (level == 0) { |
| 821 | return generic_bin_search(eb, |
| 822 | offsetof(struct btrfs_leaf, items), |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 823 | sizeof(struct btrfs_item), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 824 | key, btrfs_header_nritems(eb), |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 825 | slot); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 826 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 827 | return generic_bin_search(eb, |
| 828 | offsetof(struct btrfs_node, ptrs), |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 829 | sizeof(struct btrfs_key_ptr), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 830 | key, btrfs_header_nritems(eb), |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 831 | slot); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 832 | } |
| 833 | return -1; |
| 834 | } |
| 835 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 836 | int btrfs_bin_search(struct extent_buffer *eb, struct btrfs_key *key, |
| 837 | int level, int *slot) |
| 838 | { |
| 839 | return bin_search(eb, key, level, slot); |
| 840 | } |
| 841 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 842 | static void root_add_used(struct btrfs_root *root, u32 size) |
| 843 | { |
| 844 | spin_lock(&root->accounting_lock); |
| 845 | btrfs_set_root_used(&root->root_item, |
| 846 | btrfs_root_used(&root->root_item) + size); |
| 847 | spin_unlock(&root->accounting_lock); |
| 848 | } |
| 849 | |
| 850 | static void root_sub_used(struct btrfs_root *root, u32 size) |
| 851 | { |
| 852 | spin_lock(&root->accounting_lock); |
| 853 | btrfs_set_root_used(&root->root_item, |
| 854 | btrfs_root_used(&root->root_item) - size); |
| 855 | spin_unlock(&root->accounting_lock); |
| 856 | } |
| 857 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 858 | /* given a node and slot number, this reads the blocks it points to. The |
| 859 | * extent buffer is returned with a reference taken (but unlocked). |
| 860 | * NULL is returned on error. |
| 861 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 862 | static noinline struct extent_buffer *read_node_slot(struct btrfs_root *root, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 863 | struct extent_buffer *parent, int slot) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 864 | { |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 865 | int level = btrfs_header_level(parent); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 866 | if (slot < 0) |
| 867 | return NULL; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 868 | if (slot >= btrfs_header_nritems(parent)) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 869 | return NULL; |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 870 | |
| 871 | BUG_ON(level == 0); |
| 872 | |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 873 | return read_tree_block(root, btrfs_node_blockptr(parent, slot), |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 874 | btrfs_level_size(root, level - 1), |
| 875 | btrfs_node_ptr_generation(parent, slot)); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 876 | } |
| 877 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 878 | /* |
| 879 | * node level balancing, used to make sure nodes are in proper order for |
| 880 | * item deletion. We balance from the top down, so we have to make sure |
| 881 | * that a deletion won't leave an node completely empty later on. |
| 882 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 883 | static noinline int balance_level(struct btrfs_trans_handle *trans, |
Chris Mason | 98ed517 | 2008-01-03 10:01:48 -0500 | [diff] [blame] | 884 | struct btrfs_root *root, |
| 885 | struct btrfs_path *path, int level) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 886 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 887 | struct extent_buffer *right = NULL; |
| 888 | struct extent_buffer *mid; |
| 889 | struct extent_buffer *left = NULL; |
| 890 | struct extent_buffer *parent = NULL; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 891 | int ret = 0; |
| 892 | int wret; |
| 893 | int pslot; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 894 | int orig_slot = path->slots[level]; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 895 | u64 orig_ptr; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 896 | |
| 897 | if (level == 0) |
| 898 | return 0; |
| 899 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 900 | mid = path->nodes[level]; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 901 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 902 | WARN_ON(!path->locks[level]); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 903 | WARN_ON(btrfs_header_generation(mid) != trans->transid); |
| 904 | |
Chris Mason | 1d4f8a0 | 2007-03-13 09:28:32 -0400 | [diff] [blame] | 905 | orig_ptr = btrfs_node_blockptr(mid, orig_slot); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 906 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 907 | if (level < BTRFS_MAX_LEVEL - 1) |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 908 | parent = path->nodes[level + 1]; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 909 | pslot = path->slots[level + 1]; |
| 910 | |
Chris Mason | 4068947 | 2007-03-17 14:29:23 -0400 | [diff] [blame] | 911 | /* |
| 912 | * deal with the case where there is only one pointer in the root |
| 913 | * by promoting the node below to a root |
| 914 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 915 | if (!parent) { |
| 916 | struct extent_buffer *child; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 917 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 918 | if (btrfs_header_nritems(mid) != 1) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 919 | return 0; |
| 920 | |
| 921 | /* promote the child to a root */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 922 | child = read_node_slot(root, mid, 0); |
Jeff Mahoney | 7951f3c | 2009-02-12 10:06:15 -0500 | [diff] [blame] | 923 | BUG_ON(!child); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 924 | btrfs_tree_lock(child); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 925 | btrfs_set_lock_blocking(child); |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 926 | ret = btrfs_cow_block(trans, root, child, mid, 0, &child); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 927 | if (ret) { |
| 928 | btrfs_tree_unlock(child); |
| 929 | free_extent_buffer(child); |
| 930 | goto enospc; |
| 931 | } |
Yan | 2f375ab | 2008-02-01 14:58:07 -0500 | [diff] [blame] | 932 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 933 | spin_lock(&root->node_lock); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 934 | root->node = child; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 935 | spin_unlock(&root->node_lock); |
| 936 | |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 937 | add_root_to_dirty_list(root); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 938 | btrfs_tree_unlock(child); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 939 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 940 | path->locks[level] = 0; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 941 | path->nodes[level] = NULL; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 942 | clean_tree_block(trans, root, mid); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 943 | btrfs_tree_unlock(mid); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 944 | /* once for the path */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 945 | free_extent_buffer(mid); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 946 | |
| 947 | root_sub_used(root, mid->len); |
| 948 | btrfs_free_tree_block(trans, root, mid, 0, 1); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 949 | /* once for the root ptr */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 950 | free_extent_buffer(mid); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 951 | return 0; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 952 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 953 | if (btrfs_header_nritems(mid) > |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 954 | BTRFS_NODEPTRS_PER_BLOCK(root) / 4) |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 955 | return 0; |
| 956 | |
Andi Kleen | 559af82 | 2010-10-29 15:14:37 -0400 | [diff] [blame] | 957 | btrfs_header_nritems(mid); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 958 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 959 | left = read_node_slot(root, parent, pslot - 1); |
| 960 | if (left) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 961 | btrfs_tree_lock(left); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 962 | btrfs_set_lock_blocking(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 963 | wret = btrfs_cow_block(trans, root, left, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 964 | parent, pslot - 1, &left); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 965 | if (wret) { |
| 966 | ret = wret; |
| 967 | goto enospc; |
| 968 | } |
Chris Mason | 2cc58cf | 2007-08-27 16:49:44 -0400 | [diff] [blame] | 969 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 970 | right = read_node_slot(root, parent, pslot + 1); |
| 971 | if (right) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 972 | btrfs_tree_lock(right); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 973 | btrfs_set_lock_blocking(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 974 | wret = btrfs_cow_block(trans, root, right, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 975 | parent, pslot + 1, &right); |
Chris Mason | 2cc58cf | 2007-08-27 16:49:44 -0400 | [diff] [blame] | 976 | if (wret) { |
| 977 | ret = wret; |
| 978 | goto enospc; |
| 979 | } |
| 980 | } |
| 981 | |
| 982 | /* first, try to make some room in the middle buffer */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 983 | if (left) { |
| 984 | orig_slot += btrfs_header_nritems(left); |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 985 | wret = push_node_left(trans, root, left, mid, 1); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 986 | if (wret < 0) |
| 987 | ret = wret; |
Andi Kleen | 559af82 | 2010-10-29 15:14:37 -0400 | [diff] [blame] | 988 | btrfs_header_nritems(mid); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 989 | } |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 990 | |
| 991 | /* |
| 992 | * then try to empty the right most buffer into the middle |
| 993 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 994 | if (right) { |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 995 | wret = push_node_left(trans, root, mid, right, 1); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 996 | if (wret < 0 && wret != -ENOSPC) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 997 | ret = wret; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 998 | if (btrfs_header_nritems(right) == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 999 | clean_tree_block(trans, root, right); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1000 | btrfs_tree_unlock(right); |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 1001 | wret = del_ptr(trans, root, path, level + 1, pslot + |
| 1002 | 1); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1003 | if (wret) |
| 1004 | ret = wret; |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1005 | root_sub_used(root, right->len); |
| 1006 | btrfs_free_tree_block(trans, root, right, 0, 1); |
| 1007 | free_extent_buffer(right); |
| 1008 | right = NULL; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1009 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1010 | struct btrfs_disk_key right_key; |
| 1011 | btrfs_node_key(right, &right_key, 0); |
| 1012 | btrfs_set_node_key(parent, &right_key, pslot + 1); |
| 1013 | btrfs_mark_buffer_dirty(parent); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1014 | } |
| 1015 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1016 | if (btrfs_header_nritems(mid) == 1) { |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1017 | /* |
| 1018 | * we're not allowed to leave a node with one item in the |
| 1019 | * tree during a delete. A deletion from lower in the tree |
| 1020 | * could try to delete the only pointer in this node. |
| 1021 | * So, pull some keys from the left. |
| 1022 | * There has to be a left pointer at this point because |
| 1023 | * otherwise we would have pulled some pointers from the |
| 1024 | * right |
| 1025 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1026 | BUG_ON(!left); |
| 1027 | wret = balance_node_right(trans, root, mid, left); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1028 | if (wret < 0) { |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1029 | ret = wret; |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1030 | goto enospc; |
| 1031 | } |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 1032 | if (wret == 1) { |
| 1033 | wret = push_node_left(trans, root, left, mid, 1); |
| 1034 | if (wret < 0) |
| 1035 | ret = wret; |
| 1036 | } |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1037 | BUG_ON(wret == 1); |
| 1038 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1039 | if (btrfs_header_nritems(mid) == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1040 | clean_tree_block(trans, root, mid); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1041 | btrfs_tree_unlock(mid); |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 1042 | wret = del_ptr(trans, root, path, level + 1, pslot); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1043 | if (wret) |
| 1044 | ret = wret; |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1045 | root_sub_used(root, mid->len); |
| 1046 | btrfs_free_tree_block(trans, root, mid, 0, 1); |
| 1047 | free_extent_buffer(mid); |
| 1048 | mid = NULL; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1049 | } else { |
| 1050 | /* update the parent key to reflect our changes */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1051 | struct btrfs_disk_key mid_key; |
| 1052 | btrfs_node_key(mid, &mid_key, 0); |
| 1053 | btrfs_set_node_key(parent, &mid_key, pslot); |
| 1054 | btrfs_mark_buffer_dirty(parent); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1055 | } |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1056 | |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1057 | /* update the path */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1058 | if (left) { |
| 1059 | if (btrfs_header_nritems(left) > orig_slot) { |
| 1060 | extent_buffer_get(left); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1061 | /* left was locked after cow */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1062 | path->nodes[level] = left; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1063 | path->slots[level + 1] -= 1; |
| 1064 | path->slots[level] = orig_slot; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1065 | if (mid) { |
| 1066 | btrfs_tree_unlock(mid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1067 | free_extent_buffer(mid); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1068 | } |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1069 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1070 | orig_slot -= btrfs_header_nritems(left); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1071 | path->slots[level] = orig_slot; |
| 1072 | } |
| 1073 | } |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1074 | /* double check we haven't messed things up */ |
Chris Mason | e20d96d | 2007-03-22 12:13:20 -0400 | [diff] [blame] | 1075 | if (orig_ptr != |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1076 | btrfs_node_blockptr(path->nodes[level], path->slots[level])) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1077 | BUG(); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1078 | enospc: |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1079 | if (right) { |
| 1080 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1081 | free_extent_buffer(right); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1082 | } |
| 1083 | if (left) { |
| 1084 | if (path->nodes[level] != left) |
| 1085 | btrfs_tree_unlock(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1086 | free_extent_buffer(left); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1087 | } |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1088 | return ret; |
| 1089 | } |
| 1090 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1091 | /* Node balancing for insertion. Here we only split or push nodes around |
| 1092 | * when they are completely full. This is also done top down, so we |
| 1093 | * have to be pessimistic. |
| 1094 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1095 | static noinline int push_nodes_for_insert(struct btrfs_trans_handle *trans, |
Chris Mason | 98ed517 | 2008-01-03 10:01:48 -0500 | [diff] [blame] | 1096 | struct btrfs_root *root, |
| 1097 | struct btrfs_path *path, int level) |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1098 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1099 | struct extent_buffer *right = NULL; |
| 1100 | struct extent_buffer *mid; |
| 1101 | struct extent_buffer *left = NULL; |
| 1102 | struct extent_buffer *parent = NULL; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1103 | int ret = 0; |
| 1104 | int wret; |
| 1105 | int pslot; |
| 1106 | int orig_slot = path->slots[level]; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1107 | |
| 1108 | if (level == 0) |
| 1109 | return 1; |
| 1110 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1111 | mid = path->nodes[level]; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 1112 | WARN_ON(btrfs_header_generation(mid) != trans->transid); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1113 | |
| 1114 | if (level < BTRFS_MAX_LEVEL - 1) |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1115 | parent = path->nodes[level + 1]; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1116 | pslot = path->slots[level + 1]; |
| 1117 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1118 | if (!parent) |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1119 | return 1; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1120 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1121 | left = read_node_slot(root, parent, pslot - 1); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1122 | |
| 1123 | /* first, try to make some room in the middle buffer */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1124 | if (left) { |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1125 | u32 left_nr; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1126 | |
| 1127 | btrfs_tree_lock(left); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1128 | btrfs_set_lock_blocking(left); |
| 1129 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1130 | left_nr = btrfs_header_nritems(left); |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 1131 | if (left_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { |
| 1132 | wret = 1; |
| 1133 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1134 | ret = btrfs_cow_block(trans, root, left, parent, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1135 | pslot - 1, &left); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1136 | if (ret) |
| 1137 | wret = 1; |
| 1138 | else { |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1139 | wret = push_node_left(trans, root, |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 1140 | left, mid, 0); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1141 | } |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 1142 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1143 | if (wret < 0) |
| 1144 | ret = wret; |
| 1145 | if (wret == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1146 | struct btrfs_disk_key disk_key; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1147 | orig_slot += left_nr; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1148 | btrfs_node_key(mid, &disk_key, 0); |
| 1149 | btrfs_set_node_key(parent, &disk_key, pslot); |
| 1150 | btrfs_mark_buffer_dirty(parent); |
| 1151 | if (btrfs_header_nritems(left) > orig_slot) { |
| 1152 | path->nodes[level] = left; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1153 | path->slots[level + 1] -= 1; |
| 1154 | path->slots[level] = orig_slot; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1155 | btrfs_tree_unlock(mid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1156 | free_extent_buffer(mid); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1157 | } else { |
| 1158 | orig_slot -= |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1159 | btrfs_header_nritems(left); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1160 | path->slots[level] = orig_slot; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1161 | btrfs_tree_unlock(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1162 | free_extent_buffer(left); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1163 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1164 | return 0; |
| 1165 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1166 | btrfs_tree_unlock(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1167 | free_extent_buffer(left); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1168 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1169 | right = read_node_slot(root, parent, pslot + 1); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1170 | |
| 1171 | /* |
| 1172 | * then try to empty the right most buffer into the middle |
| 1173 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1174 | if (right) { |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 1175 | u32 right_nr; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1176 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1177 | btrfs_tree_lock(right); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1178 | btrfs_set_lock_blocking(right); |
| 1179 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1180 | right_nr = btrfs_header_nritems(right); |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 1181 | if (right_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { |
| 1182 | wret = 1; |
| 1183 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1184 | ret = btrfs_cow_block(trans, root, right, |
| 1185 | parent, pslot + 1, |
Chris Mason | 9fa8cfe | 2009-03-13 10:24:59 -0400 | [diff] [blame] | 1186 | &right); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1187 | if (ret) |
| 1188 | wret = 1; |
| 1189 | else { |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1190 | wret = balance_node_right(trans, root, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1191 | right, mid); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1192 | } |
Chris Mason | 33ade1f | 2007-04-20 13:48:57 -0400 | [diff] [blame] | 1193 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1194 | if (wret < 0) |
| 1195 | ret = wret; |
| 1196 | if (wret == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1197 | struct btrfs_disk_key disk_key; |
| 1198 | |
| 1199 | btrfs_node_key(right, &disk_key, 0); |
| 1200 | btrfs_set_node_key(parent, &disk_key, pslot + 1); |
| 1201 | btrfs_mark_buffer_dirty(parent); |
| 1202 | |
| 1203 | if (btrfs_header_nritems(mid) <= orig_slot) { |
| 1204 | path->nodes[level] = right; |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1205 | path->slots[level + 1] += 1; |
| 1206 | path->slots[level] = orig_slot - |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1207 | btrfs_header_nritems(mid); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1208 | btrfs_tree_unlock(mid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1209 | free_extent_buffer(mid); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1210 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1211 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1212 | free_extent_buffer(right); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1213 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1214 | return 0; |
| 1215 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1216 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1217 | free_extent_buffer(right); |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1218 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 1219 | return 1; |
| 1220 | } |
| 1221 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 1222 | /* |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1223 | * readahead one full node of leaves, finding things that are close |
| 1224 | * to the block in 'slot', and triggering ra on them. |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 1225 | */ |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1226 | static void reada_for_search(struct btrfs_root *root, |
| 1227 | struct btrfs_path *path, |
| 1228 | int level, int slot, u64 objectid) |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 1229 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1230 | struct extent_buffer *node; |
Chris Mason | 01f4665 | 2007-12-21 16:24:26 -0500 | [diff] [blame] | 1231 | struct btrfs_disk_key disk_key; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 1232 | u32 nritems; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 1233 | u64 search; |
Chris Mason | a717531 | 2009-01-22 09:23:10 -0500 | [diff] [blame] | 1234 | u64 target; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1235 | u64 nread = 0; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 1236 | int direction = path->reada; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1237 | struct extent_buffer *eb; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1238 | u32 nr; |
| 1239 | u32 blocksize; |
| 1240 | u32 nscan = 0; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 1241 | |
Chris Mason | a6b6e75 | 2007-10-15 16:22:39 -0400 | [diff] [blame] | 1242 | if (level != 1) |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 1243 | return; |
| 1244 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1245 | if (!path->nodes[level]) |
| 1246 | return; |
| 1247 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1248 | node = path->nodes[level]; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1249 | |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 1250 | search = btrfs_node_blockptr(node, slot); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1251 | blocksize = btrfs_level_size(root, level - 1); |
| 1252 | eb = btrfs_find_tree_block(root, search, blocksize); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1253 | if (eb) { |
| 1254 | free_extent_buffer(eb); |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 1255 | return; |
| 1256 | } |
| 1257 | |
Chris Mason | a717531 | 2009-01-22 09:23:10 -0500 | [diff] [blame] | 1258 | target = search; |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1259 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1260 | nritems = btrfs_header_nritems(node); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1261 | nr = slot; |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1262 | while (1) { |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1263 | if (direction < 0) { |
| 1264 | if (nr == 0) |
| 1265 | break; |
| 1266 | nr--; |
| 1267 | } else if (direction > 0) { |
| 1268 | nr++; |
| 1269 | if (nr >= nritems) |
| 1270 | break; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 1271 | } |
Chris Mason | 01f4665 | 2007-12-21 16:24:26 -0500 | [diff] [blame] | 1272 | if (path->reada < 0 && objectid) { |
| 1273 | btrfs_node_key(node, &disk_key, nr); |
| 1274 | if (btrfs_disk_key_objectid(&disk_key) != objectid) |
| 1275 | break; |
| 1276 | } |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1277 | search = btrfs_node_blockptr(node, nr); |
Chris Mason | a717531 | 2009-01-22 09:23:10 -0500 | [diff] [blame] | 1278 | if ((search <= target && target - search <= 65536) || |
| 1279 | (search > target && search - target <= 65536)) { |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 1280 | readahead_tree_block(root, search, blocksize, |
| 1281 | btrfs_node_ptr_generation(node, nr)); |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1282 | nread += blocksize; |
| 1283 | } |
| 1284 | nscan++; |
Chris Mason | a717531 | 2009-01-22 09:23:10 -0500 | [diff] [blame] | 1285 | if ((nread > 65536 || nscan > 32)) |
Chris Mason | 6b80053 | 2007-10-15 16:17:34 -0400 | [diff] [blame] | 1286 | break; |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 1287 | } |
| 1288 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1289 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1290 | /* |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1291 | * returns -EAGAIN if it had to drop the path, or zero if everything was in |
| 1292 | * cache |
| 1293 | */ |
| 1294 | static noinline int reada_for_balance(struct btrfs_root *root, |
| 1295 | struct btrfs_path *path, int level) |
| 1296 | { |
| 1297 | int slot; |
| 1298 | int nritems; |
| 1299 | struct extent_buffer *parent; |
| 1300 | struct extent_buffer *eb; |
| 1301 | u64 gen; |
| 1302 | u64 block1 = 0; |
| 1303 | u64 block2 = 0; |
| 1304 | int ret = 0; |
| 1305 | int blocksize; |
| 1306 | |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 1307 | parent = path->nodes[level + 1]; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1308 | if (!parent) |
| 1309 | return 0; |
| 1310 | |
| 1311 | nritems = btrfs_header_nritems(parent); |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 1312 | slot = path->slots[level + 1]; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1313 | blocksize = btrfs_level_size(root, level); |
| 1314 | |
| 1315 | if (slot > 0) { |
| 1316 | block1 = btrfs_node_blockptr(parent, slot - 1); |
| 1317 | gen = btrfs_node_ptr_generation(parent, slot - 1); |
| 1318 | eb = btrfs_find_tree_block(root, block1, blocksize); |
| 1319 | if (eb && btrfs_buffer_uptodate(eb, gen)) |
| 1320 | block1 = 0; |
| 1321 | free_extent_buffer(eb); |
| 1322 | } |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 1323 | if (slot + 1 < nritems) { |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1324 | block2 = btrfs_node_blockptr(parent, slot + 1); |
| 1325 | gen = btrfs_node_ptr_generation(parent, slot + 1); |
| 1326 | eb = btrfs_find_tree_block(root, block2, blocksize); |
| 1327 | if (eb && btrfs_buffer_uptodate(eb, gen)) |
| 1328 | block2 = 0; |
| 1329 | free_extent_buffer(eb); |
| 1330 | } |
| 1331 | if (block1 || block2) { |
| 1332 | ret = -EAGAIN; |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 1333 | |
| 1334 | /* release the whole path */ |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1335 | btrfs_release_path(root, path); |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 1336 | |
| 1337 | /* read the blocks */ |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1338 | if (block1) |
| 1339 | readahead_tree_block(root, block1, blocksize, 0); |
| 1340 | if (block2) |
| 1341 | readahead_tree_block(root, block2, blocksize, 0); |
| 1342 | |
| 1343 | if (block1) { |
| 1344 | eb = read_tree_block(root, block1, blocksize, 0); |
| 1345 | free_extent_buffer(eb); |
| 1346 | } |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 1347 | if (block2) { |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1348 | eb = read_tree_block(root, block2, blocksize, 0); |
| 1349 | free_extent_buffer(eb); |
| 1350 | } |
| 1351 | } |
| 1352 | return ret; |
| 1353 | } |
| 1354 | |
| 1355 | |
| 1356 | /* |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1357 | * when we walk down the tree, it is usually safe to unlock the higher layers |
| 1358 | * in the tree. The exceptions are when our path goes through slot 0, because |
| 1359 | * operations on the tree might require changing key pointers higher up in the |
| 1360 | * tree. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1361 | * |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1362 | * callers might also have set path->keep_locks, which tells this code to keep |
| 1363 | * the lock if the path points to the last slot in the block. This is part of |
| 1364 | * 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] | 1365 | * |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1366 | * lowest_unlock sets the lowest level in the tree we're allowed to unlock. so |
| 1367 | * if lowest_unlock is 1, level 0 won't be unlocked |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 1368 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 1369 | static noinline void unlock_up(struct btrfs_path *path, int level, |
| 1370 | int lowest_unlock) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1371 | { |
| 1372 | int i; |
| 1373 | int skip_level = level; |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1374 | int no_skips = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1375 | struct extent_buffer *t; |
| 1376 | |
| 1377 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
| 1378 | if (!path->nodes[i]) |
| 1379 | break; |
| 1380 | if (!path->locks[i]) |
| 1381 | break; |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1382 | if (!no_skips && path->slots[i] == 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1383 | skip_level = i + 1; |
| 1384 | continue; |
| 1385 | } |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1386 | if (!no_skips && path->keep_locks) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1387 | u32 nritems; |
| 1388 | t = path->nodes[i]; |
| 1389 | nritems = btrfs_header_nritems(t); |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1390 | if (nritems < 1 || path->slots[i] >= nritems - 1) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1391 | skip_level = i + 1; |
| 1392 | continue; |
| 1393 | } |
| 1394 | } |
Chris Mason | 051e1b9 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1395 | if (skip_level < i && i >= lowest_unlock) |
| 1396 | no_skips = 1; |
| 1397 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1398 | t = path->nodes[i]; |
| 1399 | if (i >= lowest_unlock && i > skip_level && path->locks[i]) { |
| 1400 | btrfs_tree_unlock(t); |
| 1401 | path->locks[i] = 0; |
| 1402 | } |
| 1403 | } |
| 1404 | } |
| 1405 | |
Chris Mason | 3c69fae | 2007-08-07 15:52:22 -0400 | [diff] [blame] | 1406 | /* |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1407 | * This releases any locks held in the path starting at level and |
| 1408 | * going all the way up to the root. |
| 1409 | * |
| 1410 | * btrfs_search_slot will keep the lock held on higher nodes in a few |
| 1411 | * corner cases, such as COW of the block at slot zero in the node. This |
| 1412 | * ignores those rules, and it should only be called when there are no |
| 1413 | * more updates to be done higher up in the tree. |
| 1414 | */ |
| 1415 | noinline void btrfs_unlock_up_safe(struct btrfs_path *path, int level) |
| 1416 | { |
| 1417 | int i; |
| 1418 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1419 | if (path->keep_locks) |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1420 | return; |
| 1421 | |
| 1422 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
| 1423 | if (!path->nodes[i]) |
Chris Mason | 12f4dac | 2009-02-04 09:31:42 -0500 | [diff] [blame] | 1424 | continue; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1425 | if (!path->locks[i]) |
Chris Mason | 12f4dac | 2009-02-04 09:31:42 -0500 | [diff] [blame] | 1426 | continue; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1427 | btrfs_tree_unlock(path->nodes[i]); |
| 1428 | path->locks[i] = 0; |
| 1429 | } |
| 1430 | } |
| 1431 | |
| 1432 | /* |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1433 | * helper function for btrfs_search_slot. The goal is to find a block |
| 1434 | * in cache without setting the path to blocking. If we find the block |
| 1435 | * we return zero and the path is unchanged. |
| 1436 | * |
| 1437 | * If we can't find the block, we set the path blocking and do some |
| 1438 | * reada. -EAGAIN is returned and the search must be repeated. |
| 1439 | */ |
| 1440 | static int |
| 1441 | read_block_for_search(struct btrfs_trans_handle *trans, |
| 1442 | struct btrfs_root *root, struct btrfs_path *p, |
| 1443 | struct extent_buffer **eb_ret, int level, int slot, |
| 1444 | struct btrfs_key *key) |
| 1445 | { |
| 1446 | u64 blocknr; |
| 1447 | u64 gen; |
| 1448 | u32 blocksize; |
| 1449 | struct extent_buffer *b = *eb_ret; |
| 1450 | struct extent_buffer *tmp; |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 1451 | int ret; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1452 | |
| 1453 | blocknr = btrfs_node_blockptr(b, slot); |
| 1454 | gen = btrfs_node_ptr_generation(b, slot); |
| 1455 | blocksize = btrfs_level_size(root, level - 1); |
| 1456 | |
| 1457 | tmp = btrfs_find_tree_block(root, blocknr, blocksize); |
Chris Mason | cb44921 | 2010-10-24 11:01:27 -0400 | [diff] [blame] | 1458 | if (tmp) { |
| 1459 | if (btrfs_buffer_uptodate(tmp, 0)) { |
| 1460 | if (btrfs_buffer_uptodate(tmp, gen)) { |
| 1461 | /* |
| 1462 | * we found an up to date block without |
| 1463 | * sleeping, return |
| 1464 | * right away |
| 1465 | */ |
| 1466 | *eb_ret = tmp; |
| 1467 | return 0; |
| 1468 | } |
| 1469 | /* the pages were up to date, but we failed |
| 1470 | * the generation number check. Do a full |
| 1471 | * read for the generation number that is correct. |
| 1472 | * We must do this without dropping locks so |
| 1473 | * we can trust our generation number |
| 1474 | */ |
| 1475 | free_extent_buffer(tmp); |
| 1476 | tmp = read_tree_block(root, blocknr, blocksize, gen); |
| 1477 | if (tmp && btrfs_buffer_uptodate(tmp, gen)) { |
| 1478 | *eb_ret = tmp; |
| 1479 | return 0; |
| 1480 | } |
| 1481 | free_extent_buffer(tmp); |
| 1482 | btrfs_release_path(NULL, p); |
| 1483 | return -EIO; |
| 1484 | } |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1485 | } |
| 1486 | |
| 1487 | /* |
| 1488 | * reduce lock contention at high levels |
| 1489 | * of the btree by dropping locks before |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 1490 | * we read. Don't release the lock on the current |
| 1491 | * level because we need to walk this node to figure |
| 1492 | * out which blocks to read. |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1493 | */ |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 1494 | btrfs_unlock_up_safe(p, level + 1); |
| 1495 | btrfs_set_path_blocking(p); |
| 1496 | |
Chris Mason | cb44921 | 2010-10-24 11:01:27 -0400 | [diff] [blame] | 1497 | free_extent_buffer(tmp); |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1498 | if (p->reada) |
| 1499 | reada_for_search(root, p, level, slot, key->objectid); |
| 1500 | |
Chris Mason | 8c594ea | 2009-04-20 15:50:10 -0400 | [diff] [blame] | 1501 | btrfs_release_path(NULL, p); |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 1502 | |
| 1503 | ret = -EAGAIN; |
Yan, Zheng | 5bdd353 | 2010-05-26 11:20:30 -0400 | [diff] [blame] | 1504 | tmp = read_tree_block(root, blocknr, blocksize, 0); |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 1505 | if (tmp) { |
| 1506 | /* |
| 1507 | * If the read above didn't mark this buffer up to date, |
| 1508 | * it will never end up being up to date. Set ret to EIO now |
| 1509 | * and give up so that our caller doesn't loop forever |
| 1510 | * on our EAGAINs. |
| 1511 | */ |
| 1512 | if (!btrfs_buffer_uptodate(tmp, 0)) |
| 1513 | ret = -EIO; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1514 | free_extent_buffer(tmp); |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 1515 | } |
| 1516 | return ret; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1517 | } |
| 1518 | |
| 1519 | /* |
| 1520 | * helper function for btrfs_search_slot. This does all of the checks |
| 1521 | * for node-level blocks and does any balancing required based on |
| 1522 | * the ins_len. |
| 1523 | * |
| 1524 | * If no extra work was required, zero is returned. If we had to |
| 1525 | * drop the path, -EAGAIN is returned and btrfs_search_slot must |
| 1526 | * start over |
| 1527 | */ |
| 1528 | static int |
| 1529 | setup_nodes_for_search(struct btrfs_trans_handle *trans, |
| 1530 | struct btrfs_root *root, struct btrfs_path *p, |
| 1531 | struct extent_buffer *b, int level, int ins_len) |
| 1532 | { |
| 1533 | int ret; |
| 1534 | if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >= |
| 1535 | BTRFS_NODEPTRS_PER_BLOCK(root) - 3) { |
| 1536 | int sret; |
| 1537 | |
| 1538 | sret = reada_for_balance(root, p, level); |
| 1539 | if (sret) |
| 1540 | goto again; |
| 1541 | |
| 1542 | btrfs_set_path_blocking(p); |
| 1543 | sret = split_node(trans, root, p, level); |
| 1544 | btrfs_clear_path_blocking(p, NULL); |
| 1545 | |
| 1546 | BUG_ON(sret > 0); |
| 1547 | if (sret) { |
| 1548 | ret = sret; |
| 1549 | goto done; |
| 1550 | } |
| 1551 | b = p->nodes[level]; |
| 1552 | } else if (ins_len < 0 && btrfs_header_nritems(b) < |
Chris Mason | cfbb930 | 2009-05-18 10:41:58 -0400 | [diff] [blame] | 1553 | BTRFS_NODEPTRS_PER_BLOCK(root) / 2) { |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1554 | int sret; |
| 1555 | |
| 1556 | sret = reada_for_balance(root, p, level); |
| 1557 | if (sret) |
| 1558 | goto again; |
| 1559 | |
| 1560 | btrfs_set_path_blocking(p); |
| 1561 | sret = balance_level(trans, root, p, level); |
| 1562 | btrfs_clear_path_blocking(p, NULL); |
| 1563 | |
| 1564 | if (sret) { |
| 1565 | ret = sret; |
| 1566 | goto done; |
| 1567 | } |
| 1568 | b = p->nodes[level]; |
| 1569 | if (!b) { |
| 1570 | btrfs_release_path(NULL, p); |
| 1571 | goto again; |
| 1572 | } |
| 1573 | BUG_ON(btrfs_header_nritems(b) == 1); |
| 1574 | } |
| 1575 | return 0; |
| 1576 | |
| 1577 | again: |
| 1578 | ret = -EAGAIN; |
| 1579 | done: |
| 1580 | return ret; |
| 1581 | } |
| 1582 | |
| 1583 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 1584 | * look for key in the tree. path is filled in with nodes along the way |
| 1585 | * if key is found, we return zero and you can find the item in the leaf |
| 1586 | * level of the path (level 0) |
| 1587 | * |
| 1588 | * If the key isn't found, the path points to the slot where it should |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 1589 | * be inserted, and 1 is returned. If there are other errors during the |
| 1590 | * search a negative error number is returned. |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 1591 | * |
| 1592 | * if ins_len > 0, nodes and leaves will be split as we walk down the |
| 1593 | * tree. if ins_len < 0, nodes will be merged as we walk down the tree (if |
| 1594 | * possible) |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 1595 | */ |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 1596 | int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root |
| 1597 | *root, struct btrfs_key *key, struct btrfs_path *p, int |
| 1598 | ins_len, int cow) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1599 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1600 | struct extent_buffer *b; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1601 | int slot; |
| 1602 | int ret; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1603 | int err; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1604 | int level; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1605 | int lowest_unlock = 1; |
Chris Mason | 9f3a742 | 2007-08-07 15:52:19 -0400 | [diff] [blame] | 1606 | u8 lowest_level = 0; |
| 1607 | |
Chris Mason | 6702ed4 | 2007-08-07 16:15:09 -0400 | [diff] [blame] | 1608 | lowest_level = p->lowest_level; |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 1609 | WARN_ON(lowest_level && ins_len > 0); |
Chris Mason | 22b0ebd | 2007-03-30 08:47:31 -0400 | [diff] [blame] | 1610 | WARN_ON(p->nodes[0] != NULL); |
Josef Bacik | 2517920 | 2008-10-29 14:49:05 -0400 | [diff] [blame] | 1611 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1612 | if (ins_len < 0) |
| 1613 | lowest_unlock = 2; |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 1614 | |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1615 | again: |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1616 | if (p->search_commit_root) { |
| 1617 | b = root->commit_root; |
| 1618 | extent_buffer_get(b); |
| 1619 | if (!p->skip_locking) |
| 1620 | btrfs_tree_lock(b); |
| 1621 | } else { |
| 1622 | if (p->skip_locking) |
| 1623 | b = btrfs_root_node(root); |
| 1624 | else |
| 1625 | b = btrfs_lock_root_node(root); |
| 1626 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1627 | |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 1628 | while (b) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1629 | level = btrfs_header_level(b); |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 1630 | |
| 1631 | /* |
| 1632 | * setup the path here so we can release it under lock |
| 1633 | * contention with the cow code |
| 1634 | */ |
| 1635 | p->nodes[level] = b; |
| 1636 | if (!p->skip_locking) |
| 1637 | p->locks[level] = 1; |
| 1638 | |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 1639 | if (cow) { |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1640 | /* |
| 1641 | * if we don't really need to cow this block |
| 1642 | * then we don't want to set the path blocking, |
| 1643 | * so we test it here |
| 1644 | */ |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1645 | if (!should_cow_block(trans, root, b)) |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 1646 | goto cow_done; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1647 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1648 | btrfs_set_path_blocking(p); |
| 1649 | |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1650 | err = btrfs_cow_block(trans, root, b, |
| 1651 | p->nodes[level + 1], |
| 1652 | p->slots[level + 1], &b); |
| 1653 | if (err) { |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1654 | ret = err; |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 1655 | goto done; |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1656 | } |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 1657 | } |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 1658 | cow_done: |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 1659 | BUG_ON(!cow && ins_len); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1660 | if (level != btrfs_header_level(b)) |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 1661 | WARN_ON(1); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1662 | level = btrfs_header_level(b); |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 1663 | |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 1664 | p->nodes[level] = b; |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1665 | if (!p->skip_locking) |
| 1666 | p->locks[level] = 1; |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 1667 | |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 1668 | btrfs_clear_path_blocking(p, NULL); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1669 | |
| 1670 | /* |
| 1671 | * we have a lock on b and as long as we aren't changing |
| 1672 | * the tree, there is no way to for the items in b to change. |
| 1673 | * It is safe to drop the lock on our parent before we |
| 1674 | * go through the expensive btree search on b. |
| 1675 | * |
| 1676 | * If cow is true, then we might be changing slot zero, |
| 1677 | * which may require changing the parent. So, we can't |
| 1678 | * drop the lock until after we know which slot we're |
| 1679 | * operating on. |
| 1680 | */ |
| 1681 | if (!cow) |
| 1682 | btrfs_unlock_up_safe(p, level + 1); |
| 1683 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1684 | ret = bin_search(b, key, level, &slot); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1685 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1686 | if (level != 0) { |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1687 | int dec = 0; |
| 1688 | if (ret && slot > 0) { |
| 1689 | dec = 1; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1690 | slot -= 1; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1691 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1692 | p->slots[level] = slot; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1693 | err = setup_nodes_for_search(trans, root, p, b, level, |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1694 | ins_len); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1695 | if (err == -EAGAIN) |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1696 | goto again; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1697 | if (err) { |
| 1698 | ret = err; |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1699 | goto done; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1700 | } |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1701 | b = p->nodes[level]; |
| 1702 | slot = p->slots[level]; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1703 | |
Chris Mason | f9efa9c | 2008-06-25 16:14:04 -0400 | [diff] [blame] | 1704 | unlock_up(p, level, lowest_unlock); |
| 1705 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1706 | if (level == lowest_level) { |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1707 | if (dec) |
| 1708 | p->slots[level]++; |
Zheng Yan | 5b21f2e | 2008-09-26 10:05:38 -0400 | [diff] [blame] | 1709 | goto done; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1710 | } |
Chris Mason | ca7a79a | 2008-05-12 12:59:19 -0400 | [diff] [blame] | 1711 | |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1712 | err = read_block_for_search(trans, root, p, |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1713 | &b, level, slot, key); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1714 | if (err == -EAGAIN) |
Chris Mason | c8c4286 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1715 | goto again; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1716 | if (err) { |
| 1717 | ret = err; |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 1718 | goto done; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1719 | } |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 1720 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1721 | if (!p->skip_locking) { |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 1722 | btrfs_clear_path_blocking(p, NULL); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1723 | err = btrfs_try_spin_lock(b); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1724 | |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1725 | if (!err) { |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1726 | btrfs_set_path_blocking(p); |
| 1727 | btrfs_tree_lock(b); |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 1728 | btrfs_clear_path_blocking(p, b); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1729 | } |
| 1730 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1731 | } else { |
| 1732 | p->slots[level] = slot; |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 1733 | if (ins_len > 0 && |
| 1734 | btrfs_leaf_free_space(root, b) < ins_len) { |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1735 | btrfs_set_path_blocking(p); |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1736 | err = split_leaf(trans, root, key, |
| 1737 | p, ins_len, ret == 0); |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 1738 | btrfs_clear_path_blocking(p, NULL); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1739 | |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 1740 | BUG_ON(err > 0); |
| 1741 | if (err) { |
| 1742 | ret = err; |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 1743 | goto done; |
| 1744 | } |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 1745 | } |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 1746 | if (!p->search_for_split) |
| 1747 | unlock_up(p, level, lowest_unlock); |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 1748 | goto done; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1749 | } |
| 1750 | } |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 1751 | ret = 1; |
| 1752 | done: |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 1753 | /* |
| 1754 | * we don't really know what they plan on doing with the path |
| 1755 | * from here on, so for now just mark it as blocking |
| 1756 | */ |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 1757 | if (!p->leave_spinning) |
| 1758 | btrfs_set_path_blocking(p); |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 1759 | if (ret < 0) |
| 1760 | btrfs_release_path(root, p); |
Chris Mason | 65b51a0 | 2008-08-01 15:11:20 -0400 | [diff] [blame] | 1761 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1762 | } |
| 1763 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 1764 | /* |
| 1765 | * adjust the pointers going up the tree, starting at level |
| 1766 | * making sure the right key of each node is points to 'key'. |
| 1767 | * This is used after shifting pointers to the left, so it stops |
| 1768 | * fixing up pointers when a given leaf/node is not in slot 0 of the |
| 1769 | * higher levels |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 1770 | * |
| 1771 | * If this fails to write a tree block, it returns -1, but continues |
| 1772 | * fixing up the blocks in ram so the tree is consistent. |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 1773 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1774 | static int fixup_low_keys(struct btrfs_trans_handle *trans, |
| 1775 | struct btrfs_root *root, struct btrfs_path *path, |
| 1776 | struct btrfs_disk_key *key, int level) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1777 | { |
| 1778 | int i; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 1779 | int ret = 0; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1780 | struct extent_buffer *t; |
| 1781 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 1782 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1783 | int tslot = path->slots[i]; |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 1784 | if (!path->nodes[i]) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1785 | break; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1786 | t = path->nodes[i]; |
| 1787 | btrfs_set_node_key(t, key, tslot); |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 1788 | btrfs_mark_buffer_dirty(path->nodes[i]); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1789 | if (tslot != 0) |
| 1790 | break; |
| 1791 | } |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 1792 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1793 | } |
| 1794 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 1795 | /* |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 1796 | * update item key. |
| 1797 | * |
| 1798 | * This function isn't completely safe. It's the caller's responsibility |
| 1799 | * that the new key won't break the order |
| 1800 | */ |
| 1801 | int btrfs_set_item_key_safe(struct btrfs_trans_handle *trans, |
| 1802 | struct btrfs_root *root, struct btrfs_path *path, |
| 1803 | struct btrfs_key *new_key) |
| 1804 | { |
| 1805 | struct btrfs_disk_key disk_key; |
| 1806 | struct extent_buffer *eb; |
| 1807 | int slot; |
| 1808 | |
| 1809 | eb = path->nodes[0]; |
| 1810 | slot = path->slots[0]; |
| 1811 | if (slot > 0) { |
| 1812 | btrfs_item_key(eb, &disk_key, slot - 1); |
| 1813 | if (comp_keys(&disk_key, new_key) >= 0) |
| 1814 | return -1; |
| 1815 | } |
| 1816 | if (slot < btrfs_header_nritems(eb) - 1) { |
| 1817 | btrfs_item_key(eb, &disk_key, slot + 1); |
| 1818 | if (comp_keys(&disk_key, new_key) <= 0) |
| 1819 | return -1; |
| 1820 | } |
| 1821 | |
| 1822 | btrfs_cpu_key_to_disk(&disk_key, new_key); |
| 1823 | btrfs_set_item_key(eb, &disk_key, slot); |
| 1824 | btrfs_mark_buffer_dirty(eb); |
| 1825 | if (slot == 0) |
| 1826 | fixup_low_keys(trans, root, path, &disk_key, 1); |
| 1827 | return 0; |
| 1828 | } |
| 1829 | |
| 1830 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 1831 | * 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] | 1832 | * tree. |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 1833 | * |
| 1834 | * returns 0 if some ptrs were pushed left, < 0 if there was some horrible |
| 1835 | * 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] | 1836 | */ |
Chris Mason | 98ed517 | 2008-01-03 10:01:48 -0500 | [diff] [blame] | 1837 | static int push_node_left(struct btrfs_trans_handle *trans, |
| 1838 | struct btrfs_root *root, struct extent_buffer *dst, |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 1839 | struct extent_buffer *src, int empty) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1840 | { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1841 | int push_items = 0; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1842 | int src_nritems; |
| 1843 | int dst_nritems; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 1844 | int ret = 0; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1845 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1846 | src_nritems = btrfs_header_nritems(src); |
| 1847 | dst_nritems = btrfs_header_nritems(dst); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 1848 | push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 1849 | WARN_ON(btrfs_header_generation(src) != trans->transid); |
| 1850 | WARN_ON(btrfs_header_generation(dst) != trans->transid); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 1851 | |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 1852 | if (!empty && src_nritems <= 8) |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 1853 | return 1; |
| 1854 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1855 | if (push_items <= 0) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1856 | return 1; |
| 1857 | |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 1858 | if (empty) { |
Chris Mason | 971a1f6 | 2008-04-24 10:54:32 -0400 | [diff] [blame] | 1859 | push_items = min(src_nritems, push_items); |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 1860 | if (push_items < src_nritems) { |
| 1861 | /* leave at least 8 pointers in the node if |
| 1862 | * we aren't going to empty it |
| 1863 | */ |
| 1864 | if (src_nritems - push_items < 8) { |
| 1865 | if (push_items <= 8) |
| 1866 | return 1; |
| 1867 | push_items -= 8; |
| 1868 | } |
| 1869 | } |
| 1870 | } else |
| 1871 | push_items = min(src_nritems - 8, push_items); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1872 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1873 | copy_extent_buffer(dst, src, |
| 1874 | btrfs_node_key_ptr_offset(dst_nritems), |
| 1875 | btrfs_node_key_ptr_offset(0), |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1876 | push_items * sizeof(struct btrfs_key_ptr)); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1877 | |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1878 | if (push_items < src_nritems) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1879 | memmove_extent_buffer(src, btrfs_node_key_ptr_offset(0), |
| 1880 | btrfs_node_key_ptr_offset(push_items), |
| 1881 | (src_nritems - push_items) * |
| 1882 | sizeof(struct btrfs_key_ptr)); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1883 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1884 | btrfs_set_header_nritems(src, src_nritems - push_items); |
| 1885 | btrfs_set_header_nritems(dst, dst_nritems + push_items); |
| 1886 | btrfs_mark_buffer_dirty(src); |
| 1887 | btrfs_mark_buffer_dirty(dst); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 1888 | |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 1889 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 1890 | } |
| 1891 | |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 1892 | /* |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1893 | * try to push data from one node into the next node right in the |
| 1894 | * tree. |
| 1895 | * |
| 1896 | * returns 0 if some ptrs were pushed, < 0 if there was some horrible |
| 1897 | * error, and > 0 if there was no room in the right hand block. |
| 1898 | * |
| 1899 | * this will only push up to 1/2 the contents of the left node over |
| 1900 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1901 | static int balance_node_right(struct btrfs_trans_handle *trans, |
| 1902 | struct btrfs_root *root, |
| 1903 | struct extent_buffer *dst, |
| 1904 | struct extent_buffer *src) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1905 | { |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1906 | int push_items = 0; |
| 1907 | int max_push; |
| 1908 | int src_nritems; |
| 1909 | int dst_nritems; |
| 1910 | int ret = 0; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1911 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 1912 | WARN_ON(btrfs_header_generation(src) != trans->transid); |
| 1913 | WARN_ON(btrfs_header_generation(dst) != trans->transid); |
| 1914 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1915 | src_nritems = btrfs_header_nritems(src); |
| 1916 | dst_nritems = btrfs_header_nritems(dst); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 1917 | push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems; |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1918 | if (push_items <= 0) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1919 | return 1; |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 1920 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1921 | if (src_nritems < 4) |
Chris Mason | bce4eae | 2008-04-24 14:42:46 -0400 | [diff] [blame] | 1922 | return 1; |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1923 | |
| 1924 | max_push = src_nritems / 2 + 1; |
| 1925 | /* don't try to empty the node */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1926 | if (max_push >= src_nritems) |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1927 | return 1; |
Yan | 252c38f | 2007-08-29 09:11:44 -0400 | [diff] [blame] | 1928 | |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1929 | if (max_push < push_items) |
| 1930 | push_items = max_push; |
| 1931 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1932 | memmove_extent_buffer(dst, btrfs_node_key_ptr_offset(push_items), |
| 1933 | btrfs_node_key_ptr_offset(0), |
| 1934 | (dst_nritems) * |
| 1935 | sizeof(struct btrfs_key_ptr)); |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 1936 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1937 | copy_extent_buffer(dst, src, |
| 1938 | btrfs_node_key_ptr_offset(0), |
| 1939 | btrfs_node_key_ptr_offset(src_nritems - push_items), |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1940 | push_items * sizeof(struct btrfs_key_ptr)); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1941 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1942 | btrfs_set_header_nritems(src, src_nritems - push_items); |
| 1943 | btrfs_set_header_nritems(dst, dst_nritems + push_items); |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1944 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1945 | btrfs_mark_buffer_dirty(src); |
| 1946 | btrfs_mark_buffer_dirty(dst); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 1947 | |
Chris Mason | 79f95c8 | 2007-03-01 15:16:26 -0500 | [diff] [blame] | 1948 | return ret; |
| 1949 | } |
| 1950 | |
| 1951 | /* |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 1952 | * helper function to insert a new root level in the tree. |
| 1953 | * A new node is allocated, and a single item is inserted to |
| 1954 | * point to the existing root |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 1955 | * |
| 1956 | * returns zero on success or < 0 on failure. |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 1957 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 1958 | static noinline int insert_new_root(struct btrfs_trans_handle *trans, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1959 | struct btrfs_root *root, |
| 1960 | struct btrfs_path *path, int level) |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 1961 | { |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 1962 | u64 lower_gen; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1963 | struct extent_buffer *lower; |
| 1964 | struct extent_buffer *c; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1965 | struct extent_buffer *old; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1966 | struct btrfs_disk_key lower_key; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 1967 | |
| 1968 | BUG_ON(path->nodes[level]); |
| 1969 | BUG_ON(path->nodes[level-1] != root->node); |
| 1970 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 1971 | lower = path->nodes[level-1]; |
| 1972 | if (level == 1) |
| 1973 | btrfs_item_key(lower, &lower_key, 0); |
| 1974 | else |
| 1975 | btrfs_node_key(lower, &lower_key, 0); |
| 1976 | |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 1977 | c = btrfs_alloc_free_block(trans, root, root->nodesize, 0, |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1978 | root->root_key.objectid, &lower_key, |
Christoph Hellwig | ad3d81b | 2008-09-05 16:43:28 -0400 | [diff] [blame] | 1979 | level, root->node->start, 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1980 | if (IS_ERR(c)) |
| 1981 | return PTR_ERR(c); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 1982 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 1983 | root_add_used(root, root->nodesize); |
| 1984 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1985 | memset_extent_buffer(c, 0, 0, sizeof(struct btrfs_header)); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1986 | btrfs_set_header_nritems(c, 1); |
| 1987 | btrfs_set_header_level(c, level); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 1988 | btrfs_set_header_bytenr(c, c->start); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1989 | btrfs_set_header_generation(c, trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 1990 | btrfs_set_header_backref_rev(c, BTRFS_MIXED_BACKREF_REV); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1991 | btrfs_set_header_owner(c, root->root_key.objectid); |
Chris Mason | d571976 | 2007-03-23 10:01:08 -0400 | [diff] [blame] | 1992 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 1993 | write_extent_buffer(c, root->fs_info->fsid, |
| 1994 | (unsigned long)btrfs_header_fsid(c), |
| 1995 | BTRFS_FSID_SIZE); |
Chris Mason | e17cade | 2008-04-15 15:41:47 -0400 | [diff] [blame] | 1996 | |
| 1997 | write_extent_buffer(c, root->fs_info->chunk_tree_uuid, |
| 1998 | (unsigned long)btrfs_header_chunk_tree_uuid(c), |
| 1999 | BTRFS_UUID_SIZE); |
| 2000 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2001 | btrfs_set_node_key(c, &lower_key, 0); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2002 | btrfs_set_node_blockptr(c, 0, lower->start); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 2003 | lower_gen = btrfs_header_generation(lower); |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 2004 | WARN_ON(lower_gen != trans->transid); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 2005 | |
| 2006 | btrfs_set_node_ptr_generation(c, 0, lower_gen); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2007 | |
| 2008 | btrfs_mark_buffer_dirty(c); |
Chris Mason | d571976 | 2007-03-23 10:01:08 -0400 | [diff] [blame] | 2009 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2010 | spin_lock(&root->node_lock); |
| 2011 | old = root->node; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2012 | root->node = c; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2013 | spin_unlock(&root->node_lock); |
| 2014 | |
| 2015 | /* the super has an extra ref to root->node */ |
| 2016 | free_extent_buffer(old); |
| 2017 | |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 2018 | add_root_to_dirty_list(root); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2019 | extent_buffer_get(c); |
| 2020 | path->nodes[level] = c; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2021 | path->locks[level] = 1; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 2022 | path->slots[level] = 0; |
| 2023 | return 0; |
| 2024 | } |
| 2025 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2026 | /* |
| 2027 | * worker function to insert a single pointer in a node. |
| 2028 | * the node should have enough room for the pointer already |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 2029 | * |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2030 | * slot and level indicate where you want the key to go, and |
| 2031 | * blocknr is the block the key points to. |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2032 | * |
| 2033 | * returns zero on success and < 0 on any error |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2034 | */ |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 2035 | static int insert_ptr(struct btrfs_trans_handle *trans, struct btrfs_root |
| 2036 | *root, struct btrfs_path *path, struct btrfs_disk_key |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2037 | *key, u64 bytenr, int slot, int level) |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2038 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2039 | struct extent_buffer *lower; |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2040 | int nritems; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 2041 | |
| 2042 | BUG_ON(!path->nodes[level]); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 2043 | btrfs_assert_tree_locked(path->nodes[level]); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2044 | lower = path->nodes[level]; |
| 2045 | nritems = btrfs_header_nritems(lower); |
Stoyan Gaydarov | c293498 | 2009-04-02 17:05:11 -0400 | [diff] [blame] | 2046 | BUG_ON(slot > nritems); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 2047 | if (nritems == BTRFS_NODEPTRS_PER_BLOCK(root)) |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2048 | BUG(); |
| 2049 | if (slot != nritems) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2050 | memmove_extent_buffer(lower, |
| 2051 | btrfs_node_key_ptr_offset(slot + 1), |
| 2052 | btrfs_node_key_ptr_offset(slot), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 2053 | (nritems - slot) * sizeof(struct btrfs_key_ptr)); |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2054 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2055 | btrfs_set_node_key(lower, key, slot); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2056 | btrfs_set_node_blockptr(lower, slot, bytenr); |
Chris Mason | 74493f7 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 2057 | WARN_ON(trans->transid == 0); |
| 2058 | btrfs_set_node_ptr_generation(lower, slot, trans->transid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2059 | btrfs_set_header_nritems(lower, nritems + 1); |
| 2060 | btrfs_mark_buffer_dirty(lower); |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2061 | return 0; |
| 2062 | } |
| 2063 | |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 2064 | /* |
| 2065 | * split the node at the specified level in path in two. |
| 2066 | * The path is corrected to point to the appropriate node after the split |
| 2067 | * |
| 2068 | * Before splitting this tries to make some room in the node by pushing |
| 2069 | * left and right, if either one works, it returns right away. |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2070 | * |
| 2071 | * returns 0 on success and < 0 on failure |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 2072 | */ |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 2073 | static noinline int split_node(struct btrfs_trans_handle *trans, |
| 2074 | struct btrfs_root *root, |
| 2075 | struct btrfs_path *path, int level) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2076 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2077 | struct extent_buffer *c; |
| 2078 | struct extent_buffer *split; |
| 2079 | struct btrfs_disk_key disk_key; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2080 | int mid; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 2081 | int ret; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2082 | int wret; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 2083 | u32 c_nritems; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2084 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2085 | c = path->nodes[level]; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 2086 | WARN_ON(btrfs_header_generation(c) != trans->transid); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2087 | if (c == root->node) { |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 2088 | /* trying to split the root, lets make a new one */ |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 2089 | ret = insert_new_root(trans, root, path, level + 1); |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 2090 | if (ret) |
| 2091 | return ret; |
Chris Mason | b361242 | 2009-05-13 19:12:15 -0400 | [diff] [blame] | 2092 | } else { |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2093 | ret = push_nodes_for_insert(trans, root, path, level); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2094 | c = path->nodes[level]; |
| 2095 | if (!ret && btrfs_header_nritems(c) < |
Chris Mason | c448acf | 2008-04-24 09:34:34 -0400 | [diff] [blame] | 2096 | BTRFS_NODEPTRS_PER_BLOCK(root) - 3) |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2097 | return 0; |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2098 | if (ret < 0) |
| 2099 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2100 | } |
Chris Mason | e66f709 | 2007-04-20 13:16:02 -0400 | [diff] [blame] | 2101 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2102 | c_nritems = btrfs_header_nritems(c); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2103 | mid = (c_nritems + 1) / 2; |
| 2104 | btrfs_node_key(c, &disk_key, mid); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 2105 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2106 | split = btrfs_alloc_free_block(trans, root, root->nodesize, 0, |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 2107 | root->root_key.objectid, |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2108 | &disk_key, level, c->start, 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2109 | if (IS_ERR(split)) |
| 2110 | return PTR_ERR(split); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 2111 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 2112 | root_add_used(root, root->nodesize); |
| 2113 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2114 | memset_extent_buffer(split, 0, 0, sizeof(struct btrfs_header)); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2115 | btrfs_set_header_level(split, btrfs_header_level(c)); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2116 | btrfs_set_header_bytenr(split, split->start); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2117 | btrfs_set_header_generation(split, trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2118 | btrfs_set_header_backref_rev(split, BTRFS_MIXED_BACKREF_REV); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2119 | btrfs_set_header_owner(split, root->root_key.objectid); |
| 2120 | write_extent_buffer(split, root->fs_info->fsid, |
| 2121 | (unsigned long)btrfs_header_fsid(split), |
| 2122 | BTRFS_FSID_SIZE); |
Chris Mason | e17cade | 2008-04-15 15:41:47 -0400 | [diff] [blame] | 2123 | write_extent_buffer(split, root->fs_info->chunk_tree_uuid, |
| 2124 | (unsigned long)btrfs_header_chunk_tree_uuid(split), |
| 2125 | BTRFS_UUID_SIZE); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2126 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2127 | |
| 2128 | copy_extent_buffer(split, c, |
| 2129 | btrfs_node_key_ptr_offset(0), |
| 2130 | btrfs_node_key_ptr_offset(mid), |
| 2131 | (c_nritems - mid) * sizeof(struct btrfs_key_ptr)); |
| 2132 | btrfs_set_header_nritems(split, c_nritems - mid); |
| 2133 | btrfs_set_header_nritems(c, mid); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2134 | ret = 0; |
| 2135 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2136 | btrfs_mark_buffer_dirty(c); |
| 2137 | btrfs_mark_buffer_dirty(split); |
| 2138 | |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2139 | wret = insert_ptr(trans, root, path, &disk_key, split->start, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2140 | path->slots[level + 1] + 1, |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 2141 | level + 1); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2142 | if (wret) |
| 2143 | ret = wret; |
| 2144 | |
Chris Mason | 5de08d7 | 2007-02-24 06:24:44 -0500 | [diff] [blame] | 2145 | if (path->slots[level] >= mid) { |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 2146 | path->slots[level] -= mid; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2147 | btrfs_tree_unlock(c); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2148 | free_extent_buffer(c); |
| 2149 | path->nodes[level] = split; |
Chris Mason | 5c680ed | 2007-02-22 11:39:13 -0500 | [diff] [blame] | 2150 | path->slots[level + 1] += 1; |
| 2151 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2152 | btrfs_tree_unlock(split); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2153 | free_extent_buffer(split); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2154 | } |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2155 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2156 | } |
| 2157 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2158 | /* |
| 2159 | * how many bytes are required to store the items in a leaf. start |
| 2160 | * and nr indicate which items in the leaf to check. This totals up the |
| 2161 | * space used both by the item structs and the item data |
| 2162 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2163 | 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] | 2164 | { |
| 2165 | int data_len; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2166 | int nritems = btrfs_header_nritems(l); |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 2167 | int end = min(nritems, start + nr) - 1; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2168 | |
| 2169 | if (!nr) |
| 2170 | return 0; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2171 | data_len = btrfs_item_end_nr(l, start); |
| 2172 | data_len = data_len - btrfs_item_offset_nr(l, end); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 2173 | data_len += sizeof(struct btrfs_item) * nr; |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 2174 | WARN_ON(data_len < 0); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2175 | return data_len; |
| 2176 | } |
| 2177 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2178 | /* |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 2179 | * The space between the end of the leaf items and |
| 2180 | * the start of the leaf data. IOW, how much room |
| 2181 | * the leaf has left for both items and data |
| 2182 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2183 | noinline int btrfs_leaf_free_space(struct btrfs_root *root, |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 2184 | struct extent_buffer *leaf) |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 2185 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2186 | int nritems = btrfs_header_nritems(leaf); |
| 2187 | int ret; |
| 2188 | ret = BTRFS_LEAF_DATA_SIZE(root) - leaf_space_used(leaf, 0, nritems); |
| 2189 | if (ret < 0) { |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2190 | printk(KERN_CRIT "leaf free space ret %d, leaf data size %lu, " |
| 2191 | "used %d nritems %d\n", |
Jens Axboe | ae2f541 | 2007-10-19 09:22:59 -0400 | [diff] [blame] | 2192 | ret, (unsigned long) BTRFS_LEAF_DATA_SIZE(root), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2193 | leaf_space_used(leaf, 0, nritems), nritems); |
| 2194 | } |
| 2195 | return ret; |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 2196 | } |
| 2197 | |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2198 | /* |
| 2199 | * min slot controls the lowest index we're willing to push to the |
| 2200 | * right. We'll push up to and including min_slot, but no lower |
| 2201 | */ |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2202 | static noinline int __push_leaf_right(struct btrfs_trans_handle *trans, |
| 2203 | struct btrfs_root *root, |
| 2204 | struct btrfs_path *path, |
| 2205 | int data_size, int empty, |
| 2206 | struct extent_buffer *right, |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2207 | int free_space, u32 left_nritems, |
| 2208 | u32 min_slot) |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2209 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2210 | struct extent_buffer *left = path->nodes[0]; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2211 | struct extent_buffer *upper = path->nodes[1]; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2212 | struct btrfs_disk_key disk_key; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2213 | int slot; |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2214 | u32 i; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2215 | int push_space = 0; |
| 2216 | int push_items = 0; |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 2217 | struct btrfs_item *item; |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2218 | u32 nr; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 2219 | u32 right_nritems; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2220 | u32 data_end; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2221 | u32 this_item_size; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2222 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2223 | if (empty) |
| 2224 | nr = 0; |
| 2225 | else |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2226 | nr = max_t(u32, 1, min_slot); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2227 | |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 2228 | if (path->slots[0] >= left_nritems) |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 2229 | push_space += data_size; |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 2230 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2231 | slot = path->slots[1]; |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2232 | i = left_nritems - 1; |
| 2233 | while (i >= nr) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2234 | item = btrfs_item_nr(left, i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2235 | |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 2236 | if (!empty && push_items > 0) { |
| 2237 | if (path->slots[0] > i) |
| 2238 | break; |
| 2239 | if (path->slots[0] == i) { |
| 2240 | int space = btrfs_leaf_free_space(root, left); |
| 2241 | if (space + push_space * 2 > free_space) |
| 2242 | break; |
| 2243 | } |
| 2244 | } |
| 2245 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2246 | if (path->slots[0] == i) |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 2247 | push_space += data_size; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2248 | |
| 2249 | if (!left->map_token) { |
| 2250 | map_extent_buffer(left, (unsigned long)item, |
| 2251 | sizeof(struct btrfs_item), |
| 2252 | &left->map_token, &left->kaddr, |
| 2253 | &left->map_start, &left->map_len, |
| 2254 | KM_USER1); |
| 2255 | } |
| 2256 | |
| 2257 | this_item_size = btrfs_item_size(left, item); |
| 2258 | if (this_item_size + sizeof(*item) + push_space > free_space) |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2259 | break; |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 2260 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2261 | push_items++; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2262 | push_space += this_item_size + sizeof(*item); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2263 | if (i == 0) |
| 2264 | break; |
| 2265 | i--; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2266 | } |
| 2267 | if (left->map_token) { |
| 2268 | unmap_extent_buffer(left, left->map_token, KM_USER1); |
| 2269 | left->map_token = NULL; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2270 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2271 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2272 | if (push_items == 0) |
| 2273 | goto out_unlock; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2274 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2275 | if (!empty && push_items == left_nritems) |
Chris Mason | a429e51 | 2007-04-18 16:15:28 -0400 | [diff] [blame] | 2276 | WARN_ON(1); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2277 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2278 | /* push left to right */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2279 | right_nritems = btrfs_header_nritems(right); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2280 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2281 | push_space = btrfs_item_end_nr(left, left_nritems - push_items); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 2282 | push_space -= leaf_data_end(root, left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2283 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2284 | /* make room in the right data area */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2285 | data_end = leaf_data_end(root, right); |
| 2286 | memmove_extent_buffer(right, |
| 2287 | btrfs_leaf_data(right) + data_end - push_space, |
| 2288 | btrfs_leaf_data(right) + data_end, |
| 2289 | BTRFS_LEAF_DATA_SIZE(root) - data_end); |
| 2290 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2291 | /* copy from the left data area */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2292 | copy_extent_buffer(right, left, btrfs_leaf_data(right) + |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 2293 | BTRFS_LEAF_DATA_SIZE(root) - push_space, |
| 2294 | btrfs_leaf_data(left) + leaf_data_end(root, left), |
| 2295 | push_space); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2296 | |
| 2297 | memmove_extent_buffer(right, btrfs_item_nr_offset(push_items), |
| 2298 | btrfs_item_nr_offset(0), |
| 2299 | right_nritems * sizeof(struct btrfs_item)); |
| 2300 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2301 | /* copy the items from left to right */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2302 | copy_extent_buffer(right, left, btrfs_item_nr_offset(0), |
| 2303 | btrfs_item_nr_offset(left_nritems - push_items), |
| 2304 | push_items * sizeof(struct btrfs_item)); |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2305 | |
| 2306 | /* update the item pointers */ |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 2307 | right_nritems += push_items; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2308 | btrfs_set_header_nritems(right, right_nritems); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 2309 | push_space = BTRFS_LEAF_DATA_SIZE(root); |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 2310 | for (i = 0; i < right_nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2311 | item = btrfs_item_nr(right, i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2312 | if (!right->map_token) { |
| 2313 | map_extent_buffer(right, (unsigned long)item, |
| 2314 | sizeof(struct btrfs_item), |
| 2315 | &right->map_token, &right->kaddr, |
| 2316 | &right->map_start, &right->map_len, |
| 2317 | KM_USER1); |
| 2318 | } |
| 2319 | push_space -= btrfs_item_size(right, item); |
| 2320 | btrfs_set_item_offset(right, item, push_space); |
| 2321 | } |
| 2322 | |
| 2323 | if (right->map_token) { |
| 2324 | unmap_extent_buffer(right, right->map_token, KM_USER1); |
| 2325 | right->map_token = NULL; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2326 | } |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 2327 | left_nritems -= push_items; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2328 | btrfs_set_header_nritems(left, left_nritems); |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2329 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2330 | if (left_nritems) |
| 2331 | btrfs_mark_buffer_dirty(left); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 2332 | else |
| 2333 | clean_tree_block(trans, root, left); |
| 2334 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2335 | btrfs_mark_buffer_dirty(right); |
Chris Mason | a429e51 | 2007-04-18 16:15:28 -0400 | [diff] [blame] | 2336 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2337 | btrfs_item_key(right, &disk_key, 0); |
| 2338 | btrfs_set_node_key(upper, &disk_key, slot + 1); |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 2339 | btrfs_mark_buffer_dirty(upper); |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 2340 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2341 | /* then fixup the leaf pointer in the path */ |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 2342 | if (path->slots[0] >= left_nritems) { |
| 2343 | path->slots[0] -= left_nritems; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2344 | if (btrfs_header_nritems(path->nodes[0]) == 0) |
| 2345 | clean_tree_block(trans, root, path->nodes[0]); |
| 2346 | btrfs_tree_unlock(path->nodes[0]); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2347 | free_extent_buffer(path->nodes[0]); |
| 2348 | path->nodes[0] = right; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2349 | path->slots[1] += 1; |
| 2350 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2351 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2352 | free_extent_buffer(right); |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2353 | } |
| 2354 | return 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2355 | |
| 2356 | out_unlock: |
| 2357 | btrfs_tree_unlock(right); |
| 2358 | free_extent_buffer(right); |
| 2359 | return 1; |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2360 | } |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2361 | |
Chris Mason | 00ec4c5 | 2007-02-24 12:47:20 -0500 | [diff] [blame] | 2362 | /* |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2363 | * push some data in the path leaf to the right, trying to free up at |
| 2364 | * least data_size bytes. returns zero if the push worked, nonzero otherwise |
| 2365 | * |
| 2366 | * returns 1 if the push failed because the other node didn't have enough |
| 2367 | * 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] | 2368 | * |
| 2369 | * this will push starting from min_slot to the end of the leaf. It won't |
| 2370 | * push any slot lower than min_slot |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2371 | */ |
| 2372 | 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] | 2373 | *root, struct btrfs_path *path, |
| 2374 | int min_data_size, int data_size, |
| 2375 | int empty, u32 min_slot) |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2376 | { |
| 2377 | struct extent_buffer *left = path->nodes[0]; |
| 2378 | struct extent_buffer *right; |
| 2379 | struct extent_buffer *upper; |
| 2380 | int slot; |
| 2381 | int free_space; |
| 2382 | u32 left_nritems; |
| 2383 | int ret; |
| 2384 | |
| 2385 | if (!path->nodes[1]) |
| 2386 | return 1; |
| 2387 | |
| 2388 | slot = path->slots[1]; |
| 2389 | upper = path->nodes[1]; |
| 2390 | if (slot >= btrfs_header_nritems(upper) - 1) |
| 2391 | return 1; |
| 2392 | |
| 2393 | btrfs_assert_tree_locked(path->nodes[1]); |
| 2394 | |
| 2395 | right = read_node_slot(root, upper, slot + 1); |
Tsutomu Itoh | 91ca338 | 2011-01-05 02:32:22 +0000 | [diff] [blame] | 2396 | if (right == NULL) |
| 2397 | return 1; |
| 2398 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2399 | btrfs_tree_lock(right); |
| 2400 | btrfs_set_lock_blocking(right); |
| 2401 | |
| 2402 | free_space = btrfs_leaf_free_space(root, right); |
| 2403 | if (free_space < data_size) |
| 2404 | goto out_unlock; |
| 2405 | |
| 2406 | /* cow and double check */ |
| 2407 | ret = btrfs_cow_block(trans, root, right, upper, |
| 2408 | slot + 1, &right); |
| 2409 | if (ret) |
| 2410 | goto out_unlock; |
| 2411 | |
| 2412 | free_space = btrfs_leaf_free_space(root, right); |
| 2413 | if (free_space < data_size) |
| 2414 | goto out_unlock; |
| 2415 | |
| 2416 | left_nritems = btrfs_header_nritems(left); |
| 2417 | if (left_nritems == 0) |
| 2418 | goto out_unlock; |
| 2419 | |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2420 | return __push_leaf_right(trans, root, path, min_data_size, empty, |
| 2421 | right, free_space, left_nritems, min_slot); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2422 | out_unlock: |
| 2423 | btrfs_tree_unlock(right); |
| 2424 | free_extent_buffer(right); |
| 2425 | return 1; |
| 2426 | } |
| 2427 | |
| 2428 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2429 | * push some data in the path leaf to the left, trying to free up at |
| 2430 | * least data_size bytes. returns zero if the push worked, nonzero otherwise |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2431 | * |
| 2432 | * max_slot can put a limit on how far into the leaf we'll push items. The |
| 2433 | * item at 'max_slot' won't be touched. Use (u32)-1 to make us do all the |
| 2434 | * items |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2435 | */ |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2436 | static noinline int __push_leaf_left(struct btrfs_trans_handle *trans, |
| 2437 | struct btrfs_root *root, |
| 2438 | struct btrfs_path *path, int data_size, |
| 2439 | int empty, struct extent_buffer *left, |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2440 | int free_space, u32 right_nritems, |
| 2441 | u32 max_slot) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2442 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2443 | struct btrfs_disk_key disk_key; |
| 2444 | struct extent_buffer *right = path->nodes[0]; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2445 | int i; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2446 | int push_space = 0; |
| 2447 | int push_items = 0; |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 2448 | struct btrfs_item *item; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 2449 | u32 old_left_nritems; |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2450 | u32 nr; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2451 | int ret = 0; |
| 2452 | int wret; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2453 | u32 this_item_size; |
| 2454 | u32 old_left_item_size; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2455 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2456 | if (empty) |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2457 | nr = min(right_nritems, max_slot); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2458 | else |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2459 | nr = min(right_nritems - 1, max_slot); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2460 | |
| 2461 | for (i = 0; i < nr; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2462 | item = btrfs_item_nr(right, i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2463 | if (!right->map_token) { |
| 2464 | map_extent_buffer(right, (unsigned long)item, |
| 2465 | sizeof(struct btrfs_item), |
| 2466 | &right->map_token, &right->kaddr, |
| 2467 | &right->map_start, &right->map_len, |
| 2468 | KM_USER1); |
| 2469 | } |
| 2470 | |
Zheng Yan | 31840ae | 2008-09-23 13:14:14 -0400 | [diff] [blame] | 2471 | if (!empty && push_items > 0) { |
| 2472 | if (path->slots[0] < i) |
| 2473 | break; |
| 2474 | if (path->slots[0] == i) { |
| 2475 | int space = btrfs_leaf_free_space(root, right); |
| 2476 | if (space + push_space * 2 > free_space) |
| 2477 | break; |
| 2478 | } |
| 2479 | } |
| 2480 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2481 | if (path->slots[0] == i) |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 2482 | push_space += data_size; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2483 | |
| 2484 | this_item_size = btrfs_item_size(right, item); |
| 2485 | if (this_item_size + sizeof(*item) + push_space > free_space) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2486 | break; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2487 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2488 | push_items++; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2489 | push_space += this_item_size + sizeof(*item); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2490 | } |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2491 | |
| 2492 | if (right->map_token) { |
| 2493 | unmap_extent_buffer(right, right->map_token, KM_USER1); |
| 2494 | right->map_token = NULL; |
| 2495 | } |
| 2496 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2497 | if (push_items == 0) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2498 | ret = 1; |
| 2499 | goto out; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2500 | } |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2501 | if (!empty && push_items == btrfs_header_nritems(right)) |
Chris Mason | a429e51 | 2007-04-18 16:15:28 -0400 | [diff] [blame] | 2502 | WARN_ON(1); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2503 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2504 | /* push data from right to left */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2505 | copy_extent_buffer(left, right, |
| 2506 | btrfs_item_nr_offset(btrfs_header_nritems(left)), |
| 2507 | btrfs_item_nr_offset(0), |
| 2508 | push_items * sizeof(struct btrfs_item)); |
| 2509 | |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 2510 | push_space = BTRFS_LEAF_DATA_SIZE(root) - |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2511 | btrfs_item_offset_nr(right, push_items - 1); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2512 | |
| 2513 | copy_extent_buffer(left, right, btrfs_leaf_data(left) + |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 2514 | leaf_data_end(root, left) - push_space, |
| 2515 | btrfs_leaf_data(right) + |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2516 | btrfs_item_offset_nr(right, push_items - 1), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 2517 | push_space); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2518 | old_left_nritems = btrfs_header_nritems(left); |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 2519 | BUG_ON(old_left_nritems <= 0); |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 2520 | |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2521 | 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] | 2522 | for (i = old_left_nritems; i < old_left_nritems + push_items; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2523 | u32 ioff; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2524 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2525 | item = btrfs_item_nr(left, i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2526 | if (!left->map_token) { |
| 2527 | map_extent_buffer(left, (unsigned long)item, |
| 2528 | sizeof(struct btrfs_item), |
| 2529 | &left->map_token, &left->kaddr, |
| 2530 | &left->map_start, &left->map_len, |
| 2531 | KM_USER1); |
| 2532 | } |
| 2533 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2534 | ioff = btrfs_item_offset(left, item); |
| 2535 | btrfs_set_item_offset(left, item, |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2536 | ioff - (BTRFS_LEAF_DATA_SIZE(root) - old_left_item_size)); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2537 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2538 | btrfs_set_header_nritems(left, old_left_nritems + push_items); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2539 | if (left->map_token) { |
| 2540 | unmap_extent_buffer(left, left->map_token, KM_USER1); |
| 2541 | left->map_token = NULL; |
| 2542 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2543 | |
| 2544 | /* fixup right node */ |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2545 | if (push_items > right_nritems) { |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 2546 | printk(KERN_CRIT "push items %d nr %u\n", push_items, |
| 2547 | right_nritems); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2548 | WARN_ON(1); |
| 2549 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2550 | |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2551 | if (push_items < right_nritems) { |
| 2552 | push_space = btrfs_item_offset_nr(right, push_items - 1) - |
| 2553 | leaf_data_end(root, right); |
| 2554 | memmove_extent_buffer(right, btrfs_leaf_data(right) + |
| 2555 | BTRFS_LEAF_DATA_SIZE(root) - push_space, |
| 2556 | btrfs_leaf_data(right) + |
| 2557 | leaf_data_end(root, right), push_space); |
| 2558 | |
| 2559 | memmove_extent_buffer(right, btrfs_item_nr_offset(0), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2560 | btrfs_item_nr_offset(push_items), |
| 2561 | (btrfs_header_nritems(right) - push_items) * |
| 2562 | sizeof(struct btrfs_item)); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2563 | } |
Yan | eef1c49 | 2007-11-26 10:58:13 -0500 | [diff] [blame] | 2564 | right_nritems -= push_items; |
| 2565 | btrfs_set_header_nritems(right, right_nritems); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 2566 | push_space = BTRFS_LEAF_DATA_SIZE(root); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2567 | for (i = 0; i < right_nritems; i++) { |
| 2568 | item = btrfs_item_nr(right, i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2569 | |
| 2570 | if (!right->map_token) { |
| 2571 | map_extent_buffer(right, (unsigned long)item, |
| 2572 | sizeof(struct btrfs_item), |
| 2573 | &right->map_token, &right->kaddr, |
| 2574 | &right->map_start, &right->map_len, |
| 2575 | KM_USER1); |
| 2576 | } |
| 2577 | |
| 2578 | push_space = push_space - btrfs_item_size(right, item); |
| 2579 | btrfs_set_item_offset(right, item, push_space); |
| 2580 | } |
| 2581 | if (right->map_token) { |
| 2582 | unmap_extent_buffer(right, right->map_token, KM_USER1); |
| 2583 | right->map_token = NULL; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2584 | } |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 2585 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2586 | btrfs_mark_buffer_dirty(left); |
Chris Mason | 34a3821 | 2007-11-07 13:31:03 -0500 | [diff] [blame] | 2587 | if (right_nritems) |
| 2588 | btrfs_mark_buffer_dirty(right); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 2589 | else |
| 2590 | clean_tree_block(trans, root, right); |
Chris Mason | 098f59c | 2007-05-11 11:33:21 -0400 | [diff] [blame] | 2591 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2592 | btrfs_item_key(right, &disk_key, 0); |
| 2593 | wret = fixup_low_keys(trans, root, path, &disk_key, 1); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2594 | if (wret) |
| 2595 | ret = wret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2596 | |
| 2597 | /* then fixup the leaf pointer in the path */ |
| 2598 | if (path->slots[0] < push_items) { |
| 2599 | path->slots[0] += old_left_nritems; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2600 | btrfs_tree_unlock(path->nodes[0]); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2601 | free_extent_buffer(path->nodes[0]); |
| 2602 | path->nodes[0] = left; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2603 | path->slots[1] -= 1; |
| 2604 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2605 | btrfs_tree_unlock(left); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2606 | free_extent_buffer(left); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2607 | path->slots[0] -= push_items; |
| 2608 | } |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 2609 | BUG_ON(path->slots[0] < 0); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2610 | return ret; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2611 | out: |
| 2612 | btrfs_tree_unlock(left); |
| 2613 | free_extent_buffer(left); |
| 2614 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2615 | } |
| 2616 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2617 | /* |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2618 | * push some data in the path leaf to the left, trying to free up at |
| 2619 | * least data_size bytes. returns zero if the push worked, nonzero otherwise |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2620 | * |
| 2621 | * max_slot can put a limit on how far into the leaf we'll push items. The |
| 2622 | * item at 'max_slot' won't be touched. Use (u32)-1 to make us push all the |
| 2623 | * items |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2624 | */ |
| 2625 | 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] | 2626 | *root, struct btrfs_path *path, int min_data_size, |
| 2627 | int data_size, int empty, u32 max_slot) |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2628 | { |
| 2629 | struct extent_buffer *right = path->nodes[0]; |
| 2630 | struct extent_buffer *left; |
| 2631 | int slot; |
| 2632 | int free_space; |
| 2633 | u32 right_nritems; |
| 2634 | int ret = 0; |
| 2635 | |
| 2636 | slot = path->slots[1]; |
| 2637 | if (slot == 0) |
| 2638 | return 1; |
| 2639 | if (!path->nodes[1]) |
| 2640 | return 1; |
| 2641 | |
| 2642 | right_nritems = btrfs_header_nritems(right); |
| 2643 | if (right_nritems == 0) |
| 2644 | return 1; |
| 2645 | |
| 2646 | btrfs_assert_tree_locked(path->nodes[1]); |
| 2647 | |
| 2648 | left = read_node_slot(root, path->nodes[1], slot - 1); |
Tsutomu Itoh | 91ca338 | 2011-01-05 02:32:22 +0000 | [diff] [blame] | 2649 | if (left == NULL) |
| 2650 | return 1; |
| 2651 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2652 | btrfs_tree_lock(left); |
| 2653 | btrfs_set_lock_blocking(left); |
| 2654 | |
| 2655 | free_space = btrfs_leaf_free_space(root, left); |
| 2656 | if (free_space < data_size) { |
| 2657 | ret = 1; |
| 2658 | goto out; |
| 2659 | } |
| 2660 | |
| 2661 | /* cow and double check */ |
| 2662 | ret = btrfs_cow_block(trans, root, left, |
| 2663 | path->nodes[1], slot - 1, &left); |
| 2664 | if (ret) { |
| 2665 | /* we hit -ENOSPC, but it isn't fatal here */ |
| 2666 | ret = 1; |
| 2667 | goto out; |
| 2668 | } |
| 2669 | |
| 2670 | free_space = btrfs_leaf_free_space(root, left); |
| 2671 | if (free_space < data_size) { |
| 2672 | ret = 1; |
| 2673 | goto out; |
| 2674 | } |
| 2675 | |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2676 | return __push_leaf_left(trans, root, path, min_data_size, |
| 2677 | empty, left, free_space, right_nritems, |
| 2678 | max_slot); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2679 | out: |
| 2680 | btrfs_tree_unlock(left); |
| 2681 | free_extent_buffer(left); |
| 2682 | return ret; |
| 2683 | } |
| 2684 | |
| 2685 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2686 | * split the path's leaf in two, making sure there is at least data_size |
| 2687 | * available for the resulting leaf level of the path. |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2688 | * |
| 2689 | * returns 0 if all went well and < 0 on failure. |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2690 | */ |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2691 | static noinline int copy_for_split(struct btrfs_trans_handle *trans, |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 2692 | struct btrfs_root *root, |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2693 | struct btrfs_path *path, |
| 2694 | struct extent_buffer *l, |
| 2695 | struct extent_buffer *right, |
| 2696 | int slot, int mid, int nritems) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2697 | { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2698 | int data_copy_size; |
| 2699 | int rt_data_off; |
| 2700 | int i; |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 2701 | int ret = 0; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2702 | int wret; |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 2703 | struct btrfs_disk_key disk_key; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2704 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2705 | nritems = nritems - mid; |
| 2706 | btrfs_set_header_nritems(right, nritems); |
| 2707 | data_copy_size = btrfs_item_end_nr(l, mid) - leaf_data_end(root, l); |
| 2708 | |
| 2709 | copy_extent_buffer(right, l, btrfs_item_nr_offset(0), |
| 2710 | btrfs_item_nr_offset(mid), |
| 2711 | nritems * sizeof(struct btrfs_item)); |
| 2712 | |
| 2713 | copy_extent_buffer(right, l, |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 2714 | btrfs_leaf_data(right) + BTRFS_LEAF_DATA_SIZE(root) - |
| 2715 | data_copy_size, btrfs_leaf_data(l) + |
| 2716 | leaf_data_end(root, l), data_copy_size); |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2717 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2718 | rt_data_off = BTRFS_LEAF_DATA_SIZE(root) - |
| 2719 | btrfs_item_end_nr(l, mid); |
| 2720 | |
| 2721 | for (i = 0; i < nritems; i++) { |
| 2722 | struct btrfs_item *item = btrfs_item_nr(right, i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2723 | u32 ioff; |
| 2724 | |
| 2725 | if (!right->map_token) { |
| 2726 | map_extent_buffer(right, (unsigned long)item, |
| 2727 | sizeof(struct btrfs_item), |
| 2728 | &right->map_token, &right->kaddr, |
| 2729 | &right->map_start, &right->map_len, |
| 2730 | KM_USER1); |
| 2731 | } |
| 2732 | |
| 2733 | ioff = btrfs_item_offset(right, item); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2734 | btrfs_set_item_offset(right, item, ioff + rt_data_off); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 2735 | } |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 2736 | |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2737 | if (right->map_token) { |
| 2738 | unmap_extent_buffer(right, right->map_token, KM_USER1); |
| 2739 | right->map_token = NULL; |
| 2740 | } |
| 2741 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2742 | btrfs_set_header_nritems(l, mid); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2743 | ret = 0; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2744 | btrfs_item_key(right, &disk_key, 0); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 2745 | wret = insert_ptr(trans, root, path, &disk_key, right->start, |
| 2746 | path->slots[1] + 1, 1); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 2747 | if (wret) |
| 2748 | ret = wret; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2749 | |
| 2750 | btrfs_mark_buffer_dirty(right); |
| 2751 | btrfs_mark_buffer_dirty(l); |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 2752 | BUG_ON(path->slots[0] != slot); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2753 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2754 | if (mid <= slot) { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2755 | btrfs_tree_unlock(path->nodes[0]); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2756 | free_extent_buffer(path->nodes[0]); |
| 2757 | path->nodes[0] = right; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2758 | path->slots[0] -= mid; |
| 2759 | path->slots[1] += 1; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2760 | } else { |
| 2761 | btrfs_tree_unlock(right); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2762 | free_extent_buffer(right); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 2763 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 2764 | |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 2765 | BUG_ON(path->slots[0] < 0); |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 2766 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2767 | return ret; |
| 2768 | } |
| 2769 | |
| 2770 | /* |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2771 | * double splits happen when we need to insert a big item in the middle |
| 2772 | * of a leaf. A double split can leave us with 3 mostly empty leaves: |
| 2773 | * leaf: [ slots 0 - N] [ our target ] [ N + 1 - total in leaf ] |
| 2774 | * A B C |
| 2775 | * |
| 2776 | * We avoid this by trying to push the items on either side of our target |
| 2777 | * into the adjacent leaves. If all goes well we can avoid the double split |
| 2778 | * completely. |
| 2779 | */ |
| 2780 | static noinline int push_for_double_split(struct btrfs_trans_handle *trans, |
| 2781 | struct btrfs_root *root, |
| 2782 | struct btrfs_path *path, |
| 2783 | int data_size) |
| 2784 | { |
| 2785 | int ret; |
| 2786 | int progress = 0; |
| 2787 | int slot; |
| 2788 | u32 nritems; |
| 2789 | |
| 2790 | slot = path->slots[0]; |
| 2791 | |
| 2792 | /* |
| 2793 | * try to push all the items after our slot into the |
| 2794 | * right leaf |
| 2795 | */ |
| 2796 | ret = push_leaf_right(trans, root, path, 1, data_size, 0, slot); |
| 2797 | if (ret < 0) |
| 2798 | return ret; |
| 2799 | |
| 2800 | if (ret == 0) |
| 2801 | progress++; |
| 2802 | |
| 2803 | nritems = btrfs_header_nritems(path->nodes[0]); |
| 2804 | /* |
| 2805 | * our goal is to get our slot at the start or end of a leaf. If |
| 2806 | * we've done so we're done |
| 2807 | */ |
| 2808 | if (path->slots[0] == 0 || path->slots[0] == nritems) |
| 2809 | return 0; |
| 2810 | |
| 2811 | if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size) |
| 2812 | return 0; |
| 2813 | |
| 2814 | /* try to push all the items before our slot into the next leaf */ |
| 2815 | slot = path->slots[0]; |
| 2816 | ret = push_leaf_left(trans, root, path, 1, data_size, 0, slot); |
| 2817 | if (ret < 0) |
| 2818 | return ret; |
| 2819 | |
| 2820 | if (ret == 0) |
| 2821 | progress++; |
| 2822 | |
| 2823 | if (progress) |
| 2824 | return 0; |
| 2825 | return 1; |
| 2826 | } |
| 2827 | |
| 2828 | /* |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2829 | * split the path's leaf in two, making sure there is at least data_size |
| 2830 | * available for the resulting leaf level of the path. |
| 2831 | * |
| 2832 | * returns 0 if all went well and < 0 on failure. |
| 2833 | */ |
| 2834 | static noinline int split_leaf(struct btrfs_trans_handle *trans, |
| 2835 | struct btrfs_root *root, |
| 2836 | struct btrfs_key *ins_key, |
| 2837 | struct btrfs_path *path, int data_size, |
| 2838 | int extend) |
| 2839 | { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2840 | struct btrfs_disk_key disk_key; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2841 | struct extent_buffer *l; |
| 2842 | u32 nritems; |
| 2843 | int mid; |
| 2844 | int slot; |
| 2845 | struct extent_buffer *right; |
| 2846 | int ret = 0; |
| 2847 | int wret; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2848 | int split; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2849 | int num_doubles = 0; |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2850 | int tried_avoid_double = 0; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2851 | |
Yan, Zheng | a571952 | 2009-09-24 09:17:31 -0400 | [diff] [blame] | 2852 | l = path->nodes[0]; |
| 2853 | slot = path->slots[0]; |
| 2854 | if (extend && data_size + btrfs_item_size_nr(l, slot) + |
| 2855 | sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(root)) |
| 2856 | return -EOVERFLOW; |
| 2857 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2858 | /* first try to make some room by pushing left and right */ |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2859 | if (data_size) { |
| 2860 | wret = push_leaf_right(trans, root, path, data_size, |
| 2861 | data_size, 0, 0); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2862 | if (wret < 0) |
| 2863 | return wret; |
| 2864 | if (wret) { |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2865 | wret = push_leaf_left(trans, root, path, data_size, |
| 2866 | data_size, 0, (u32)-1); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2867 | if (wret < 0) |
| 2868 | return wret; |
| 2869 | } |
| 2870 | l = path->nodes[0]; |
| 2871 | |
| 2872 | /* did the pushes work? */ |
| 2873 | if (btrfs_leaf_free_space(root, l) >= data_size) |
| 2874 | return 0; |
| 2875 | } |
| 2876 | |
| 2877 | if (!path->nodes[1]) { |
| 2878 | ret = insert_new_root(trans, root, path, 1); |
| 2879 | if (ret) |
| 2880 | return ret; |
| 2881 | } |
| 2882 | again: |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2883 | split = 1; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2884 | l = path->nodes[0]; |
| 2885 | slot = path->slots[0]; |
| 2886 | nritems = btrfs_header_nritems(l); |
| 2887 | mid = (nritems + 1) / 2; |
| 2888 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2889 | if (mid <= slot) { |
| 2890 | if (nritems == 1 || |
| 2891 | leaf_space_used(l, mid, nritems - mid) + data_size > |
| 2892 | BTRFS_LEAF_DATA_SIZE(root)) { |
| 2893 | if (slot >= nritems) { |
| 2894 | split = 0; |
| 2895 | } else { |
| 2896 | mid = slot; |
| 2897 | if (mid != nritems && |
| 2898 | leaf_space_used(l, mid, nritems - mid) + |
| 2899 | data_size > BTRFS_LEAF_DATA_SIZE(root)) { |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2900 | if (data_size && !tried_avoid_double) |
| 2901 | goto push_for_double; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2902 | split = 2; |
| 2903 | } |
| 2904 | } |
| 2905 | } |
| 2906 | } else { |
| 2907 | if (leaf_space_used(l, 0, mid) + data_size > |
| 2908 | BTRFS_LEAF_DATA_SIZE(root)) { |
| 2909 | if (!extend && data_size && slot == 0) { |
| 2910 | split = 0; |
| 2911 | } else if ((extend || !data_size) && slot == 0) { |
| 2912 | mid = 1; |
| 2913 | } else { |
| 2914 | mid = slot; |
| 2915 | if (mid != nritems && |
| 2916 | leaf_space_used(l, mid, nritems - mid) + |
| 2917 | data_size > BTRFS_LEAF_DATA_SIZE(root)) { |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 2918 | if (data_size && !tried_avoid_double) |
| 2919 | goto push_for_double; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2920 | split = 2 ; |
| 2921 | } |
| 2922 | } |
| 2923 | } |
| 2924 | } |
| 2925 | |
| 2926 | if (split == 0) |
| 2927 | btrfs_cpu_key_to_disk(&disk_key, ins_key); |
| 2928 | else |
| 2929 | btrfs_item_key(l, &disk_key, mid); |
| 2930 | |
| 2931 | right = btrfs_alloc_free_block(trans, root, root->leafsize, 0, |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2932 | root->root_key.objectid, |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2933 | &disk_key, 0, l->start, 0); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 2934 | if (IS_ERR(right)) |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2935 | return PTR_ERR(right); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 2936 | |
| 2937 | root_add_used(root, root->leafsize); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2938 | |
| 2939 | memset_extent_buffer(right, 0, 0, sizeof(struct btrfs_header)); |
| 2940 | btrfs_set_header_bytenr(right, right->start); |
| 2941 | btrfs_set_header_generation(right, trans->transid); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2942 | btrfs_set_header_backref_rev(right, BTRFS_MIXED_BACKREF_REV); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2943 | btrfs_set_header_owner(right, root->root_key.objectid); |
| 2944 | btrfs_set_header_level(right, 0); |
| 2945 | write_extent_buffer(right, root->fs_info->fsid, |
| 2946 | (unsigned long)btrfs_header_fsid(right), |
| 2947 | BTRFS_FSID_SIZE); |
| 2948 | |
| 2949 | write_extent_buffer(right, root->fs_info->chunk_tree_uuid, |
| 2950 | (unsigned long)btrfs_header_chunk_tree_uuid(right), |
| 2951 | BTRFS_UUID_SIZE); |
| 2952 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2953 | if (split == 0) { |
| 2954 | if (mid <= slot) { |
| 2955 | btrfs_set_header_nritems(right, 0); |
| 2956 | wret = insert_ptr(trans, root, path, |
| 2957 | &disk_key, right->start, |
| 2958 | path->slots[1] + 1, 1); |
| 2959 | if (wret) |
| 2960 | ret = wret; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2961 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2962 | btrfs_tree_unlock(path->nodes[0]); |
| 2963 | free_extent_buffer(path->nodes[0]); |
| 2964 | path->nodes[0] = right; |
| 2965 | path->slots[0] = 0; |
| 2966 | path->slots[1] += 1; |
| 2967 | } else { |
| 2968 | btrfs_set_header_nritems(right, 0); |
| 2969 | wret = insert_ptr(trans, root, path, |
| 2970 | &disk_key, |
| 2971 | right->start, |
| 2972 | path->slots[1], 1); |
| 2973 | if (wret) |
| 2974 | ret = wret; |
| 2975 | btrfs_tree_unlock(path->nodes[0]); |
| 2976 | free_extent_buffer(path->nodes[0]); |
| 2977 | path->nodes[0] = right; |
| 2978 | path->slots[0] = 0; |
| 2979 | if (path->slots[1] == 0) { |
| 2980 | wret = fixup_low_keys(trans, root, |
| 2981 | path, &disk_key, 1); |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2982 | if (wret) |
| 2983 | ret = wret; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2984 | } |
| 2985 | } |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2986 | btrfs_mark_buffer_dirty(right); |
| 2987 | return ret; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2988 | } |
| 2989 | |
| 2990 | ret = copy_for_split(trans, root, path, l, right, slot, mid, nritems); |
| 2991 | BUG_ON(ret); |
| 2992 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 2993 | if (split == 2) { |
Chris Mason | cc0c553 | 2007-10-25 15:42:57 -0400 | [diff] [blame] | 2994 | BUG_ON(num_doubles != 0); |
| 2995 | num_doubles++; |
| 2996 | goto again; |
Chris Mason | 3326d1b | 2007-10-15 16:18:25 -0400 | [diff] [blame] | 2997 | } |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 2998 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 2999 | return ret; |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3000 | |
| 3001 | push_for_double: |
| 3002 | push_for_double_split(trans, root, path, data_size); |
| 3003 | tried_avoid_double = 1; |
| 3004 | if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size) |
| 3005 | return 0; |
| 3006 | goto again; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3007 | } |
| 3008 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3009 | static noinline int setup_leaf_for_split(struct btrfs_trans_handle *trans, |
| 3010 | struct btrfs_root *root, |
| 3011 | struct btrfs_path *path, int ins_len) |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3012 | { |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3013 | struct btrfs_key key; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3014 | struct extent_buffer *leaf; |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3015 | struct btrfs_file_extent_item *fi; |
| 3016 | u64 extent_len = 0; |
| 3017 | u32 item_size; |
| 3018 | int ret; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3019 | |
| 3020 | leaf = path->nodes[0]; |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3021 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); |
| 3022 | |
| 3023 | BUG_ON(key.type != BTRFS_EXTENT_DATA_KEY && |
| 3024 | key.type != BTRFS_EXTENT_CSUM_KEY); |
| 3025 | |
| 3026 | if (btrfs_leaf_free_space(root, leaf) >= ins_len) |
| 3027 | return 0; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3028 | |
| 3029 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3030 | if (key.type == BTRFS_EXTENT_DATA_KEY) { |
| 3031 | fi = btrfs_item_ptr(leaf, path->slots[0], |
| 3032 | struct btrfs_file_extent_item); |
| 3033 | extent_len = btrfs_file_extent_num_bytes(leaf, fi); |
| 3034 | } |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3035 | btrfs_release_path(root, path); |
| 3036 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3037 | path->keep_locks = 1; |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3038 | path->search_for_split = 1; |
| 3039 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3040 | path->search_for_split = 0; |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3041 | if (ret < 0) |
| 3042 | goto err; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3043 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3044 | ret = -EAGAIN; |
| 3045 | leaf = path->nodes[0]; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3046 | /* if our item isn't there or got smaller, return now */ |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3047 | if (ret > 0 || item_size != btrfs_item_size_nr(leaf, path->slots[0])) |
| 3048 | goto err; |
| 3049 | |
Chris Mason | 109f6ae | 2010-04-02 09:20:18 -0400 | [diff] [blame] | 3050 | /* the leaf has changed, it now has room. return now */ |
| 3051 | if (btrfs_leaf_free_space(root, path->nodes[0]) >= ins_len) |
| 3052 | goto err; |
| 3053 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3054 | if (key.type == BTRFS_EXTENT_DATA_KEY) { |
| 3055 | fi = btrfs_item_ptr(leaf, path->slots[0], |
| 3056 | struct btrfs_file_extent_item); |
| 3057 | if (extent_len != btrfs_file_extent_num_bytes(leaf, fi)) |
| 3058 | goto err; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3059 | } |
| 3060 | |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 3061 | btrfs_set_path_blocking(path); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3062 | ret = split_leaf(trans, root, &key, path, ins_len, 1); |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3063 | if (ret) |
| 3064 | goto err; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3065 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3066 | path->keep_locks = 0; |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 3067 | btrfs_unlock_up_safe(path, 1); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3068 | return 0; |
| 3069 | err: |
| 3070 | path->keep_locks = 0; |
| 3071 | return ret; |
| 3072 | } |
| 3073 | |
| 3074 | static noinline int split_item(struct btrfs_trans_handle *trans, |
| 3075 | struct btrfs_root *root, |
| 3076 | struct btrfs_path *path, |
| 3077 | struct btrfs_key *new_key, |
| 3078 | unsigned long split_offset) |
| 3079 | { |
| 3080 | struct extent_buffer *leaf; |
| 3081 | struct btrfs_item *item; |
| 3082 | struct btrfs_item *new_item; |
| 3083 | int slot; |
| 3084 | char *buf; |
| 3085 | u32 nritems; |
| 3086 | u32 item_size; |
| 3087 | u32 orig_offset; |
| 3088 | struct btrfs_disk_key disk_key; |
| 3089 | |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 3090 | leaf = path->nodes[0]; |
| 3091 | BUG_ON(btrfs_leaf_free_space(root, leaf) < sizeof(struct btrfs_item)); |
| 3092 | |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 3093 | btrfs_set_path_blocking(path); |
| 3094 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3095 | item = btrfs_item_nr(leaf, path->slots[0]); |
| 3096 | orig_offset = btrfs_item_offset(leaf, item); |
| 3097 | item_size = btrfs_item_size(leaf, item); |
| 3098 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3099 | buf = kmalloc(item_size, GFP_NOFS); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3100 | if (!buf) |
| 3101 | return -ENOMEM; |
| 3102 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3103 | read_extent_buffer(leaf, buf, btrfs_item_ptr_offset(leaf, |
| 3104 | path->slots[0]), item_size); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3105 | |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3106 | slot = path->slots[0] + 1; |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3107 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3108 | if (slot != nritems) { |
| 3109 | /* shift the items */ |
| 3110 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + 1), |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3111 | btrfs_item_nr_offset(slot), |
| 3112 | (nritems - slot) * sizeof(struct btrfs_item)); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3113 | } |
| 3114 | |
| 3115 | btrfs_cpu_key_to_disk(&disk_key, new_key); |
| 3116 | btrfs_set_item_key(leaf, &disk_key, slot); |
| 3117 | |
| 3118 | new_item = btrfs_item_nr(leaf, slot); |
| 3119 | |
| 3120 | btrfs_set_item_offset(leaf, new_item, orig_offset); |
| 3121 | btrfs_set_item_size(leaf, new_item, item_size - split_offset); |
| 3122 | |
| 3123 | btrfs_set_item_offset(leaf, item, |
| 3124 | orig_offset + item_size - split_offset); |
| 3125 | btrfs_set_item_size(leaf, item, split_offset); |
| 3126 | |
| 3127 | btrfs_set_header_nritems(leaf, nritems + 1); |
| 3128 | |
| 3129 | /* write the data for the start of the original item */ |
| 3130 | write_extent_buffer(leaf, buf, |
| 3131 | btrfs_item_ptr_offset(leaf, path->slots[0]), |
| 3132 | split_offset); |
| 3133 | |
| 3134 | /* write the data for the new item */ |
| 3135 | write_extent_buffer(leaf, buf + split_offset, |
| 3136 | btrfs_item_ptr_offset(leaf, slot), |
| 3137 | item_size - split_offset); |
| 3138 | btrfs_mark_buffer_dirty(leaf); |
| 3139 | |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3140 | BUG_ON(btrfs_leaf_free_space(root, leaf) < 0); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3141 | kfree(buf); |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3142 | return 0; |
| 3143 | } |
| 3144 | |
| 3145 | /* |
| 3146 | * This function splits a single item into two items, |
| 3147 | * giving 'new_key' to the new item and splitting the |
| 3148 | * old one at split_offset (from the start of the item). |
| 3149 | * |
| 3150 | * The path may be released by this operation. After |
| 3151 | * the split, the path is pointing to the old item. The |
| 3152 | * new item is going to be in the same node as the old one. |
| 3153 | * |
| 3154 | * Note, the item being split must be smaller enough to live alone on |
| 3155 | * a tree block with room for one extra struct btrfs_item |
| 3156 | * |
| 3157 | * This allows us to split the item in place, keeping a lock on the |
| 3158 | * leaf the entire time. |
| 3159 | */ |
| 3160 | int btrfs_split_item(struct btrfs_trans_handle *trans, |
| 3161 | struct btrfs_root *root, |
| 3162 | struct btrfs_path *path, |
| 3163 | struct btrfs_key *new_key, |
| 3164 | unsigned long split_offset) |
| 3165 | { |
| 3166 | int ret; |
| 3167 | ret = setup_leaf_for_split(trans, root, path, |
| 3168 | sizeof(struct btrfs_item)); |
| 3169 | if (ret) |
| 3170 | return ret; |
| 3171 | |
| 3172 | ret = split_item(trans, root, path, new_key, split_offset); |
Chris Mason | 459931e | 2008-12-10 09:10:46 -0500 | [diff] [blame] | 3173 | return ret; |
| 3174 | } |
| 3175 | |
| 3176 | /* |
Yan, Zheng | ad48fd75 | 2009-11-12 09:33:58 +0000 | [diff] [blame] | 3177 | * This function duplicate a item, giving 'new_key' to the new item. |
| 3178 | * It guarantees both items live in the same tree leaf and the new item |
| 3179 | * is contiguous with the original item. |
| 3180 | * |
| 3181 | * This allows us to split file extent in place, keeping a lock on the |
| 3182 | * leaf the entire time. |
| 3183 | */ |
| 3184 | int btrfs_duplicate_item(struct btrfs_trans_handle *trans, |
| 3185 | struct btrfs_root *root, |
| 3186 | struct btrfs_path *path, |
| 3187 | struct btrfs_key *new_key) |
| 3188 | { |
| 3189 | struct extent_buffer *leaf; |
| 3190 | int ret; |
| 3191 | u32 item_size; |
| 3192 | |
| 3193 | leaf = path->nodes[0]; |
| 3194 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); |
| 3195 | ret = setup_leaf_for_split(trans, root, path, |
| 3196 | item_size + sizeof(struct btrfs_item)); |
| 3197 | if (ret) |
| 3198 | return ret; |
| 3199 | |
| 3200 | path->slots[0]++; |
| 3201 | ret = setup_items_for_insert(trans, root, path, new_key, &item_size, |
| 3202 | item_size, item_size + |
| 3203 | sizeof(struct btrfs_item), 1); |
| 3204 | BUG_ON(ret); |
| 3205 | |
| 3206 | leaf = path->nodes[0]; |
| 3207 | memcpy_extent_buffer(leaf, |
| 3208 | btrfs_item_ptr_offset(leaf, path->slots[0]), |
| 3209 | btrfs_item_ptr_offset(leaf, path->slots[0] - 1), |
| 3210 | item_size); |
| 3211 | return 0; |
| 3212 | } |
| 3213 | |
| 3214 | /* |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 3215 | * make the item pointed to by the path smaller. new_size indicates |
| 3216 | * how small to make it, and from_end tells us if we just chop bytes |
| 3217 | * off the end of the item or if we shift the item to chop bytes off |
| 3218 | * the front. |
| 3219 | */ |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 3220 | int btrfs_truncate_item(struct btrfs_trans_handle *trans, |
| 3221 | struct btrfs_root *root, |
| 3222 | struct btrfs_path *path, |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 3223 | u32 new_size, int from_end) |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 3224 | { |
| 3225 | int ret = 0; |
| 3226 | int slot; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3227 | struct extent_buffer *leaf; |
| 3228 | struct btrfs_item *item; |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 3229 | u32 nritems; |
| 3230 | unsigned int data_end; |
| 3231 | unsigned int old_data_start; |
| 3232 | unsigned int old_size; |
| 3233 | unsigned int size_diff; |
| 3234 | int i; |
| 3235 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3236 | leaf = path->nodes[0]; |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 3237 | slot = path->slots[0]; |
| 3238 | |
| 3239 | old_size = btrfs_item_size_nr(leaf, slot); |
| 3240 | if (old_size == new_size) |
| 3241 | return 0; |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 3242 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3243 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 3244 | data_end = leaf_data_end(root, leaf); |
| 3245 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3246 | old_data_start = btrfs_item_offset_nr(leaf, slot); |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 3247 | |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 3248 | size_diff = old_size - new_size; |
| 3249 | |
| 3250 | BUG_ON(slot < 0); |
| 3251 | BUG_ON(slot >= nritems); |
| 3252 | |
| 3253 | /* |
| 3254 | * item0..itemN ... dataN.offset..dataN.size .. data0.size |
| 3255 | */ |
| 3256 | /* first correct the data pointers */ |
| 3257 | for (i = slot; i < nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3258 | u32 ioff; |
| 3259 | item = btrfs_item_nr(leaf, i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3260 | |
| 3261 | if (!leaf->map_token) { |
| 3262 | map_extent_buffer(leaf, (unsigned long)item, |
| 3263 | sizeof(struct btrfs_item), |
| 3264 | &leaf->map_token, &leaf->kaddr, |
| 3265 | &leaf->map_start, &leaf->map_len, |
| 3266 | KM_USER1); |
| 3267 | } |
| 3268 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3269 | ioff = btrfs_item_offset(leaf, item); |
| 3270 | btrfs_set_item_offset(leaf, item, ioff + size_diff); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 3271 | } |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3272 | |
| 3273 | if (leaf->map_token) { |
| 3274 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); |
| 3275 | leaf->map_token = NULL; |
| 3276 | } |
| 3277 | |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 3278 | /* shift the data */ |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 3279 | if (from_end) { |
| 3280 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
| 3281 | data_end + size_diff, btrfs_leaf_data(leaf) + |
| 3282 | data_end, old_data_start + new_size - data_end); |
| 3283 | } else { |
| 3284 | struct btrfs_disk_key disk_key; |
| 3285 | u64 offset; |
| 3286 | |
| 3287 | btrfs_item_key(leaf, &disk_key, slot); |
| 3288 | |
| 3289 | if (btrfs_disk_key_type(&disk_key) == BTRFS_EXTENT_DATA_KEY) { |
| 3290 | unsigned long ptr; |
| 3291 | struct btrfs_file_extent_item *fi; |
| 3292 | |
| 3293 | fi = btrfs_item_ptr(leaf, slot, |
| 3294 | struct btrfs_file_extent_item); |
| 3295 | fi = (struct btrfs_file_extent_item *)( |
| 3296 | (unsigned long)fi - size_diff); |
| 3297 | |
| 3298 | if (btrfs_file_extent_type(leaf, fi) == |
| 3299 | BTRFS_FILE_EXTENT_INLINE) { |
| 3300 | ptr = btrfs_item_ptr_offset(leaf, slot); |
| 3301 | memmove_extent_buffer(leaf, ptr, |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3302 | (unsigned long)fi, |
| 3303 | offsetof(struct btrfs_file_extent_item, |
Chris Mason | 179e29e | 2007-11-01 11:28:41 -0400 | [diff] [blame] | 3304 | disk_bytenr)); |
| 3305 | } |
| 3306 | } |
| 3307 | |
| 3308 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
| 3309 | data_end + size_diff, btrfs_leaf_data(leaf) + |
| 3310 | data_end, old_data_start - data_end); |
| 3311 | |
| 3312 | offset = btrfs_disk_key_offset(&disk_key); |
| 3313 | btrfs_set_disk_key_offset(&disk_key, offset + size_diff); |
| 3314 | btrfs_set_item_key(leaf, &disk_key, slot); |
| 3315 | if (slot == 0) |
| 3316 | fixup_low_keys(trans, root, path, &disk_key, 1); |
| 3317 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3318 | |
| 3319 | item = btrfs_item_nr(leaf, slot); |
| 3320 | btrfs_set_item_size(leaf, item, new_size); |
| 3321 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 3322 | |
| 3323 | ret = 0; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3324 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
| 3325 | btrfs_print_leaf(root, leaf); |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 3326 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3327 | } |
Chris Mason | b18c668 | 2007-04-17 13:26:50 -0400 | [diff] [blame] | 3328 | return ret; |
| 3329 | } |
| 3330 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 3331 | /* |
| 3332 | * make the item pointed to by the path bigger, data_size is the new size. |
| 3333 | */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3334 | int btrfs_extend_item(struct btrfs_trans_handle *trans, |
| 3335 | struct btrfs_root *root, struct btrfs_path *path, |
| 3336 | u32 data_size) |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3337 | { |
| 3338 | int ret = 0; |
| 3339 | int slot; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3340 | struct extent_buffer *leaf; |
| 3341 | struct btrfs_item *item; |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3342 | u32 nritems; |
| 3343 | unsigned int data_end; |
| 3344 | unsigned int old_data; |
| 3345 | unsigned int old_size; |
| 3346 | int i; |
| 3347 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3348 | leaf = path->nodes[0]; |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3349 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3350 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3351 | data_end = leaf_data_end(root, leaf); |
| 3352 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3353 | if (btrfs_leaf_free_space(root, leaf) < data_size) { |
| 3354 | btrfs_print_leaf(root, leaf); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3355 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3356 | } |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3357 | slot = path->slots[0]; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3358 | old_data = btrfs_item_end_nr(leaf, slot); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3359 | |
| 3360 | BUG_ON(slot < 0); |
Chris Mason | 3326d1b | 2007-10-15 16:18:25 -0400 | [diff] [blame] | 3361 | if (slot >= nritems) { |
| 3362 | btrfs_print_leaf(root, leaf); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3363 | printk(KERN_CRIT "slot %d too large, nritems %d\n", |
| 3364 | slot, nritems); |
Chris Mason | 3326d1b | 2007-10-15 16:18:25 -0400 | [diff] [blame] | 3365 | BUG_ON(1); |
| 3366 | } |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3367 | |
| 3368 | /* |
| 3369 | * item0..itemN ... dataN.offset..dataN.size .. data0.size |
| 3370 | */ |
| 3371 | /* first correct the data pointers */ |
| 3372 | for (i = slot; i < nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3373 | u32 ioff; |
| 3374 | item = btrfs_item_nr(leaf, i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3375 | |
| 3376 | if (!leaf->map_token) { |
| 3377 | map_extent_buffer(leaf, (unsigned long)item, |
| 3378 | sizeof(struct btrfs_item), |
| 3379 | &leaf->map_token, &leaf->kaddr, |
| 3380 | &leaf->map_start, &leaf->map_len, |
| 3381 | KM_USER1); |
| 3382 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3383 | ioff = btrfs_item_offset(leaf, item); |
| 3384 | btrfs_set_item_offset(leaf, item, ioff - data_size); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3385 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3386 | |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3387 | if (leaf->map_token) { |
| 3388 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); |
| 3389 | leaf->map_token = NULL; |
| 3390 | } |
| 3391 | |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3392 | /* shift the data */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3393 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3394 | data_end - data_size, btrfs_leaf_data(leaf) + |
| 3395 | data_end, old_data - data_end); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3396 | |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3397 | data_end = old_data; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3398 | old_size = btrfs_item_size_nr(leaf, slot); |
| 3399 | item = btrfs_item_nr(leaf, slot); |
| 3400 | btrfs_set_item_size(leaf, item, old_size + data_size); |
| 3401 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3402 | |
| 3403 | ret = 0; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3404 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
| 3405 | btrfs_print_leaf(root, leaf); |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3406 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3407 | } |
Chris Mason | 6567e83 | 2007-04-16 09:22:45 -0400 | [diff] [blame] | 3408 | return ret; |
| 3409 | } |
| 3410 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3411 | /* |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 3412 | * Given a key and some data, insert items into the tree. |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3413 | * This does all the path init required, making room in the tree if needed. |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 3414 | * Returns the number of keys that were inserted. |
| 3415 | */ |
| 3416 | int btrfs_insert_some_items(struct btrfs_trans_handle *trans, |
| 3417 | struct btrfs_root *root, |
| 3418 | struct btrfs_path *path, |
| 3419 | struct btrfs_key *cpu_key, u32 *data_size, |
| 3420 | int nr) |
| 3421 | { |
| 3422 | struct extent_buffer *leaf; |
| 3423 | struct btrfs_item *item; |
| 3424 | int ret = 0; |
| 3425 | int slot; |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 3426 | int i; |
| 3427 | u32 nritems; |
| 3428 | u32 total_data = 0; |
| 3429 | u32 total_size = 0; |
| 3430 | unsigned int data_end; |
| 3431 | struct btrfs_disk_key disk_key; |
| 3432 | struct btrfs_key found_key; |
| 3433 | |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 3434 | for (i = 0; i < nr; i++) { |
| 3435 | if (total_size + data_size[i] + sizeof(struct btrfs_item) > |
| 3436 | BTRFS_LEAF_DATA_SIZE(root)) { |
| 3437 | break; |
| 3438 | nr = i; |
| 3439 | } |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 3440 | total_data += data_size[i]; |
Yan Zheng | 87b29b2 | 2008-12-17 10:21:48 -0500 | [diff] [blame] | 3441 | total_size += data_size[i] + sizeof(struct btrfs_item); |
| 3442 | } |
| 3443 | BUG_ON(nr == 0); |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 3444 | |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 3445 | ret = btrfs_search_slot(trans, root, cpu_key, path, total_size, 1); |
| 3446 | if (ret == 0) |
| 3447 | return -EEXIST; |
| 3448 | if (ret < 0) |
| 3449 | goto out; |
| 3450 | |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 3451 | leaf = path->nodes[0]; |
| 3452 | |
| 3453 | nritems = btrfs_header_nritems(leaf); |
| 3454 | data_end = leaf_data_end(root, leaf); |
| 3455 | |
| 3456 | if (btrfs_leaf_free_space(root, leaf) < total_size) { |
| 3457 | for (i = nr; i >= 0; i--) { |
| 3458 | total_data -= data_size[i]; |
| 3459 | total_size -= data_size[i] + sizeof(struct btrfs_item); |
| 3460 | if (total_size < btrfs_leaf_free_space(root, leaf)) |
| 3461 | break; |
| 3462 | } |
| 3463 | nr = i; |
| 3464 | } |
| 3465 | |
| 3466 | slot = path->slots[0]; |
| 3467 | BUG_ON(slot < 0); |
| 3468 | |
| 3469 | if (slot != nritems) { |
| 3470 | unsigned int old_data = btrfs_item_end_nr(leaf, slot); |
| 3471 | |
| 3472 | item = btrfs_item_nr(leaf, slot); |
| 3473 | btrfs_item_key_to_cpu(leaf, &found_key, slot); |
| 3474 | |
| 3475 | /* figure out how many keys we can insert in here */ |
| 3476 | total_data = data_size[0]; |
| 3477 | for (i = 1; i < nr; i++) { |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 3478 | if (btrfs_comp_cpu_keys(&found_key, cpu_key + i) <= 0) |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 3479 | break; |
| 3480 | total_data += data_size[i]; |
| 3481 | } |
| 3482 | nr = i; |
| 3483 | |
| 3484 | if (old_data < data_end) { |
| 3485 | btrfs_print_leaf(root, leaf); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3486 | printk(KERN_CRIT "slot %d old_data %d data_end %d\n", |
Josef Bacik | f3465ca | 2008-11-12 14:19:50 -0500 | [diff] [blame] | 3487 | slot, old_data, data_end); |
| 3488 | BUG_ON(1); |
| 3489 | } |
| 3490 | /* |
| 3491 | * item0..itemN ... dataN.offset..dataN.size .. data0.size |
| 3492 | */ |
| 3493 | /* first correct the data pointers */ |
| 3494 | WARN_ON(leaf->map_token); |
| 3495 | for (i = slot; i < nritems; i++) { |
| 3496 | u32 ioff; |
| 3497 | |
| 3498 | item = btrfs_item_nr(leaf, i); |
| 3499 | if (!leaf->map_token) { |
| 3500 | map_extent_buffer(leaf, (unsigned long)item, |
| 3501 | sizeof(struct btrfs_item), |
| 3502 | &leaf->map_token, &leaf->kaddr, |
| 3503 | &leaf->map_start, &leaf->map_len, |
| 3504 | KM_USER1); |
| 3505 | } |
| 3506 | |
| 3507 | ioff = btrfs_item_offset(leaf, item); |
| 3508 | btrfs_set_item_offset(leaf, item, ioff - total_data); |
| 3509 | } |
| 3510 | if (leaf->map_token) { |
| 3511 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); |
| 3512 | leaf->map_token = NULL; |
| 3513 | } |
| 3514 | |
| 3515 | /* shift the items */ |
| 3516 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + nr), |
| 3517 | btrfs_item_nr_offset(slot), |
| 3518 | (nritems - slot) * sizeof(struct btrfs_item)); |
| 3519 | |
| 3520 | /* shift the data */ |
| 3521 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
| 3522 | data_end - total_data, btrfs_leaf_data(leaf) + |
| 3523 | data_end, old_data - data_end); |
| 3524 | data_end = old_data; |
| 3525 | } else { |
| 3526 | /* |
| 3527 | * this sucks but it has to be done, if we are inserting at |
| 3528 | * the end of the leaf only insert 1 of the items, since we |
| 3529 | * have no way of knowing whats on the next leaf and we'd have |
| 3530 | * to drop our current locks to figure it out |
| 3531 | */ |
| 3532 | nr = 1; |
| 3533 | } |
| 3534 | |
| 3535 | /* setup the item for the new data */ |
| 3536 | for (i = 0; i < nr; i++) { |
| 3537 | btrfs_cpu_key_to_disk(&disk_key, cpu_key + i); |
| 3538 | btrfs_set_item_key(leaf, &disk_key, slot + i); |
| 3539 | item = btrfs_item_nr(leaf, slot + i); |
| 3540 | btrfs_set_item_offset(leaf, item, data_end - data_size[i]); |
| 3541 | data_end -= data_size[i]; |
| 3542 | btrfs_set_item_size(leaf, item, data_size[i]); |
| 3543 | } |
| 3544 | btrfs_set_header_nritems(leaf, nritems + nr); |
| 3545 | btrfs_mark_buffer_dirty(leaf); |
| 3546 | |
| 3547 | ret = 0; |
| 3548 | if (slot == 0) { |
| 3549 | btrfs_cpu_key_to_disk(&disk_key, cpu_key); |
| 3550 | ret = fixup_low_keys(trans, root, path, &disk_key, 1); |
| 3551 | } |
| 3552 | |
| 3553 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
| 3554 | btrfs_print_leaf(root, leaf); |
| 3555 | BUG(); |
| 3556 | } |
| 3557 | out: |
| 3558 | if (!ret) |
| 3559 | ret = nr; |
| 3560 | return ret; |
| 3561 | } |
| 3562 | |
| 3563 | /* |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3564 | * this is a helper for btrfs_insert_empty_items, the main goal here is |
| 3565 | * to save stack depth by doing the bulk of the work in a function |
| 3566 | * that doesn't call btrfs_search_slot |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3567 | */ |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3568 | static noinline_for_stack int |
| 3569 | setup_items_for_insert(struct btrfs_trans_handle *trans, |
| 3570 | struct btrfs_root *root, struct btrfs_path *path, |
| 3571 | struct btrfs_key *cpu_key, u32 *data_size, |
| 3572 | u32 total_data, u32 total_size, int nr) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3573 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3574 | struct btrfs_item *item; |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 3575 | int i; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3576 | u32 nritems; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3577 | unsigned int data_end; |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 3578 | struct btrfs_disk_key disk_key; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3579 | int ret; |
| 3580 | struct extent_buffer *leaf; |
| 3581 | int slot; |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 3582 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3583 | leaf = path->nodes[0]; |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3584 | slot = path->slots[0]; |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3585 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3586 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 3587 | data_end = leaf_data_end(root, leaf); |
Chris Mason | eb60cea | 2007-02-02 09:18:22 -0500 | [diff] [blame] | 3588 | |
Chris Mason | f25956c | 2008-09-12 15:32:53 -0400 | [diff] [blame] | 3589 | if (btrfs_leaf_free_space(root, leaf) < total_size) { |
Chris Mason | 3326d1b | 2007-10-15 16:18:25 -0400 | [diff] [blame] | 3590 | btrfs_print_leaf(root, leaf); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3591 | printk(KERN_CRIT "not enough freespace need %u have %d\n", |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 3592 | total_size, btrfs_leaf_free_space(root, leaf)); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3593 | BUG(); |
Chris Mason | d4dbff9 | 2007-04-04 14:08:15 -0400 | [diff] [blame] | 3594 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3595 | |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3596 | if (slot != nritems) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3597 | unsigned int old_data = btrfs_item_end_nr(leaf, slot); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3598 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3599 | if (old_data < data_end) { |
| 3600 | btrfs_print_leaf(root, leaf); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3601 | printk(KERN_CRIT "slot %d old_data %d data_end %d\n", |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3602 | slot, old_data, data_end); |
| 3603 | BUG_ON(1); |
| 3604 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3605 | /* |
| 3606 | * item0..itemN ... dataN.offset..dataN.size .. data0.size |
| 3607 | */ |
| 3608 | /* first correct the data pointers */ |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3609 | WARN_ON(leaf->map_token); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 3610 | for (i = slot; i < nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3611 | u32 ioff; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3612 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3613 | item = btrfs_item_nr(leaf, i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3614 | if (!leaf->map_token) { |
| 3615 | map_extent_buffer(leaf, (unsigned long)item, |
| 3616 | sizeof(struct btrfs_item), |
| 3617 | &leaf->map_token, &leaf->kaddr, |
| 3618 | &leaf->map_start, &leaf->map_len, |
| 3619 | KM_USER1); |
| 3620 | } |
| 3621 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3622 | ioff = btrfs_item_offset(leaf, item); |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 3623 | btrfs_set_item_offset(leaf, item, ioff - total_data); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 3624 | } |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3625 | if (leaf->map_token) { |
| 3626 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); |
| 3627 | leaf->map_token = NULL; |
| 3628 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3629 | |
| 3630 | /* shift the items */ |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 3631 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + nr), |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3632 | btrfs_item_nr_offset(slot), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3633 | (nritems - slot) * sizeof(struct btrfs_item)); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3634 | |
| 3635 | /* shift the data */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3636 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 3637 | data_end - total_data, btrfs_leaf_data(leaf) + |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3638 | data_end, old_data - data_end); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3639 | data_end = old_data; |
| 3640 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3641 | |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 3642 | /* setup the item for the new data */ |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 3643 | for (i = 0; i < nr; i++) { |
| 3644 | btrfs_cpu_key_to_disk(&disk_key, cpu_key + i); |
| 3645 | btrfs_set_item_key(leaf, &disk_key, slot + i); |
| 3646 | item = btrfs_item_nr(leaf, slot + i); |
| 3647 | btrfs_set_item_offset(leaf, item, data_end - data_size[i]); |
| 3648 | data_end -= data_size[i]; |
| 3649 | btrfs_set_item_size(leaf, item, data_size[i]); |
| 3650 | } |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3651 | |
Chris Mason | 9c58309 | 2008-01-29 15:15:18 -0500 | [diff] [blame] | 3652 | btrfs_set_header_nritems(leaf, nritems + nr); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3653 | |
| 3654 | ret = 0; |
Chris Mason | 5a01a2e | 2008-01-30 11:43:54 -0500 | [diff] [blame] | 3655 | if (slot == 0) { |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3656 | struct btrfs_disk_key disk_key; |
Chris Mason | 5a01a2e | 2008-01-30 11:43:54 -0500 | [diff] [blame] | 3657 | btrfs_cpu_key_to_disk(&disk_key, cpu_key); |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 3658 | ret = fixup_low_keys(trans, root, path, &disk_key, 1); |
Chris Mason | 5a01a2e | 2008-01-30 11:43:54 -0500 | [diff] [blame] | 3659 | } |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 3660 | btrfs_unlock_up_safe(path, 1); |
| 3661 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3662 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3663 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
| 3664 | btrfs_print_leaf(root, leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3665 | BUG(); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3666 | } |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3667 | return ret; |
| 3668 | } |
| 3669 | |
| 3670 | /* |
| 3671 | * Given a key and some data, insert items into the tree. |
| 3672 | * This does all the path init required, making room in the tree if needed. |
| 3673 | */ |
| 3674 | int btrfs_insert_empty_items(struct btrfs_trans_handle *trans, |
| 3675 | struct btrfs_root *root, |
| 3676 | struct btrfs_path *path, |
| 3677 | struct btrfs_key *cpu_key, u32 *data_size, |
| 3678 | int nr) |
| 3679 | { |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3680 | int ret = 0; |
| 3681 | int slot; |
| 3682 | int i; |
| 3683 | u32 total_size = 0; |
| 3684 | u32 total_data = 0; |
| 3685 | |
| 3686 | for (i = 0; i < nr; i++) |
| 3687 | total_data += data_size[i]; |
| 3688 | |
| 3689 | total_size = total_data + (nr * sizeof(struct btrfs_item)); |
| 3690 | ret = btrfs_search_slot(trans, root, cpu_key, path, total_size, 1); |
| 3691 | if (ret == 0) |
| 3692 | return -EEXIST; |
| 3693 | if (ret < 0) |
| 3694 | goto out; |
| 3695 | |
Chris Mason | 44871b1 | 2009-03-13 10:04:31 -0400 | [diff] [blame] | 3696 | slot = path->slots[0]; |
| 3697 | BUG_ON(slot < 0); |
| 3698 | |
| 3699 | ret = setup_items_for_insert(trans, root, path, cpu_key, data_size, |
| 3700 | total_data, total_size, nr); |
| 3701 | |
Chris Mason | ed2ff2c | 2007-03-01 18:59:40 -0500 | [diff] [blame] | 3702 | out: |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 3703 | return ret; |
| 3704 | } |
| 3705 | |
| 3706 | /* |
| 3707 | * Given a key and some data, insert an item into the tree. |
| 3708 | * This does all the path init required, making room in the tree if needed. |
| 3709 | */ |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 3710 | int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root |
| 3711 | *root, struct btrfs_key *cpu_key, void *data, u32 |
| 3712 | data_size) |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 3713 | { |
| 3714 | int ret = 0; |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 3715 | struct btrfs_path *path; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3716 | struct extent_buffer *leaf; |
| 3717 | unsigned long ptr; |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 3718 | |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 3719 | path = btrfs_alloc_path(); |
| 3720 | BUG_ON(!path); |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 3721 | ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size); |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 3722 | if (!ret) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3723 | leaf = path->nodes[0]; |
| 3724 | ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); |
| 3725 | write_extent_buffer(leaf, data, ptr, data_size); |
| 3726 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 3727 | } |
Chris Mason | 2c90e5d | 2007-04-02 10:50:19 -0400 | [diff] [blame] | 3728 | btrfs_free_path(path); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3729 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3730 | } |
| 3731 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3732 | /* |
Chris Mason | 5de08d7 | 2007-02-24 06:24:44 -0500 | [diff] [blame] | 3733 | * delete the pointer from a given node. |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3734 | * |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 3735 | * the tree should have been previously balanced so the deletion does not |
| 3736 | * empty a node. |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3737 | */ |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 3738 | static int del_ptr(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 3739 | struct btrfs_path *path, int level, int slot) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3740 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3741 | struct extent_buffer *parent = path->nodes[level]; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3742 | u32 nritems; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3743 | int ret = 0; |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 3744 | int wret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3745 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3746 | nritems = btrfs_header_nritems(parent); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 3747 | if (slot != nritems - 1) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3748 | memmove_extent_buffer(parent, |
| 3749 | btrfs_node_key_ptr_offset(slot), |
| 3750 | btrfs_node_key_ptr_offset(slot + 1), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3751 | sizeof(struct btrfs_key_ptr) * |
| 3752 | (nritems - slot - 1)); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 3753 | } |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3754 | nritems--; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3755 | btrfs_set_header_nritems(parent, nritems); |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3756 | if (nritems == 0 && parent == root->node) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3757 | BUG_ON(btrfs_header_level(root->node) != 1); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 3758 | /* just turn the root into a leaf and break */ |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3759 | btrfs_set_header_level(root->node, 0); |
Chris Mason | bb80395 | 2007-03-01 12:04:21 -0500 | [diff] [blame] | 3760 | } else if (slot == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3761 | struct btrfs_disk_key disk_key; |
| 3762 | |
| 3763 | btrfs_node_key(parent, &disk_key, 0); |
| 3764 | wret = fixup_low_keys(trans, root, path, &disk_key, level + 1); |
Chris Mason | 0f70abe | 2007-02-28 16:46:22 -0500 | [diff] [blame] | 3765 | if (wret) |
| 3766 | ret = wret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3767 | } |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3768 | btrfs_mark_buffer_dirty(parent); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3769 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3770 | } |
| 3771 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3772 | /* |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 3773 | * 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] | 3774 | * path->nodes[1]. |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 3775 | * |
| 3776 | * This deletes the pointer in path->nodes[1] and frees the leaf |
| 3777 | * block extent. zero is returned if it all worked out, < 0 otherwise. |
| 3778 | * |
| 3779 | * The path must have already been setup for deleting the leaf, including |
| 3780 | * all the proper balancing. path->nodes[1] must be locked. |
| 3781 | */ |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 3782 | static noinline int btrfs_del_leaf(struct btrfs_trans_handle *trans, |
| 3783 | struct btrfs_root *root, |
| 3784 | struct btrfs_path *path, |
| 3785 | struct extent_buffer *leaf) |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 3786 | { |
| 3787 | int ret; |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 3788 | |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 3789 | WARN_ON(btrfs_header_generation(leaf) != trans->transid); |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 3790 | ret = del_ptr(trans, root, path, 1, path->slots[1]); |
| 3791 | if (ret) |
| 3792 | return ret; |
| 3793 | |
Chris Mason | 4d081c4 | 2009-02-04 09:31:28 -0500 | [diff] [blame] | 3794 | /* |
| 3795 | * btrfs_free_extent is expensive, we want to make sure we |
| 3796 | * aren't holding any locks when we call it |
| 3797 | */ |
| 3798 | btrfs_unlock_up_safe(path, 0); |
| 3799 | |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3800 | root_sub_used(root, leaf->len); |
| 3801 | |
| 3802 | btrfs_free_tree_block(trans, root, leaf, 0, 1); |
| 3803 | return 0; |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 3804 | } |
| 3805 | /* |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3806 | * delete the item at the leaf level in path. If that empties |
| 3807 | * the leaf, remove it from the tree |
| 3808 | */ |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 3809 | int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 3810 | struct btrfs_path *path, int slot, int nr) |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3811 | { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3812 | struct extent_buffer *leaf; |
| 3813 | struct btrfs_item *item; |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 3814 | int last_off; |
| 3815 | int dsize = 0; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3816 | int ret = 0; |
| 3817 | int wret; |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 3818 | int i; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3819 | u32 nritems; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3820 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3821 | leaf = path->nodes[0]; |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 3822 | last_off = btrfs_item_offset_nr(leaf, slot + nr - 1); |
| 3823 | |
| 3824 | for (i = 0; i < nr; i++) |
| 3825 | dsize += btrfs_item_size_nr(leaf, slot + i); |
| 3826 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3827 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3828 | |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 3829 | if (slot + nr != nritems) { |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 3830 | int data_end = leaf_data_end(root, leaf); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3831 | |
| 3832 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3833 | data_end + dsize, |
| 3834 | btrfs_leaf_data(leaf) + data_end, |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 3835 | last_off - data_end); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3836 | |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 3837 | for (i = slot + nr; i < nritems; i++) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3838 | u32 ioff; |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3839 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3840 | item = btrfs_item_nr(leaf, i); |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3841 | if (!leaf->map_token) { |
| 3842 | map_extent_buffer(leaf, (unsigned long)item, |
| 3843 | sizeof(struct btrfs_item), |
| 3844 | &leaf->map_token, &leaf->kaddr, |
| 3845 | &leaf->map_start, &leaf->map_len, |
| 3846 | KM_USER1); |
| 3847 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3848 | ioff = btrfs_item_offset(leaf, item); |
| 3849 | btrfs_set_item_offset(leaf, item, ioff + dsize); |
Chris Mason | 0783fcf | 2007-03-12 20:12:07 -0400 | [diff] [blame] | 3850 | } |
Chris Mason | db94535 | 2007-10-15 16:15:53 -0400 | [diff] [blame] | 3851 | |
| 3852 | if (leaf->map_token) { |
| 3853 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); |
| 3854 | leaf->map_token = NULL; |
| 3855 | } |
| 3856 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3857 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot), |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 3858 | btrfs_item_nr_offset(slot + nr), |
Chris Mason | d602557 | 2007-03-30 14:27:56 -0400 | [diff] [blame] | 3859 | sizeof(struct btrfs_item) * |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 3860 | (nritems - slot - nr)); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3861 | } |
Chris Mason | 85e21ba | 2008-01-29 15:11:36 -0500 | [diff] [blame] | 3862 | btrfs_set_header_nritems(leaf, nritems - nr); |
| 3863 | nritems -= nr; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3864 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3865 | /* delete the leaf if we've emptied it */ |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3866 | if (nritems == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3867 | if (leaf == root->node) { |
| 3868 | btrfs_set_header_level(leaf, 0); |
Chris Mason | 9a8dd15 | 2007-02-23 08:38:36 -0500 | [diff] [blame] | 3869 | } else { |
Yan, Zheng | f0486c6 | 2010-05-16 10:46:25 -0400 | [diff] [blame] | 3870 | btrfs_set_path_blocking(path); |
| 3871 | clean_tree_block(trans, root, leaf); |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 3872 | ret = btrfs_del_leaf(trans, root, path, leaf); |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 3873 | BUG_ON(ret); |
Chris Mason | 9a8dd15 | 2007-02-23 08:38:36 -0500 | [diff] [blame] | 3874 | } |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3875 | } else { |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 3876 | int used = leaf_space_used(leaf, 0, nritems); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3877 | if (slot == 0) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3878 | struct btrfs_disk_key disk_key; |
| 3879 | |
| 3880 | btrfs_item_key(leaf, &disk_key, 0); |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 3881 | wret = fixup_low_keys(trans, root, path, |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3882 | &disk_key, 1); |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3883 | if (wret) |
| 3884 | ret = wret; |
| 3885 | } |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3886 | |
Chris Mason | 74123bd | 2007-02-02 11:05:29 -0500 | [diff] [blame] | 3887 | /* delete the leaf if it is mostly empty */ |
Yan Zheng | d717aa1 | 2009-07-24 12:42:46 -0400 | [diff] [blame] | 3888 | if (used < BTRFS_LEAF_DATA_SIZE(root) / 3) { |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3889 | /* push_leaf_left fixes the path. |
| 3890 | * make sure the path still points to our leaf |
| 3891 | * for possible call to del_ptr below |
| 3892 | */ |
Chris Mason | 4920c9a | 2007-01-26 16:38:42 -0500 | [diff] [blame] | 3893 | slot = path->slots[1]; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3894 | extent_buffer_get(leaf); |
| 3895 | |
Chris Mason | b947343 | 2009-03-13 11:00:37 -0400 | [diff] [blame] | 3896 | btrfs_set_path_blocking(path); |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3897 | wret = push_leaf_left(trans, root, path, 1, 1, |
| 3898 | 1, (u32)-1); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 3899 | if (wret < 0 && wret != -ENOSPC) |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3900 | ret = wret; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3901 | |
| 3902 | if (path->nodes[0] == leaf && |
| 3903 | btrfs_header_nritems(leaf)) { |
Chris Mason | 99d8f83 | 2010-07-07 10:51:48 -0400 | [diff] [blame] | 3904 | wret = push_leaf_right(trans, root, path, 1, |
| 3905 | 1, 1, 0); |
Chris Mason | 54aa1f4 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 3906 | if (wret < 0 && wret != -ENOSPC) |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3907 | ret = wret; |
| 3908 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3909 | |
| 3910 | if (btrfs_header_nritems(leaf) == 0) { |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 3911 | path->slots[1] = slot; |
Yan Zheng | 5d4f98a | 2009-06-10 10:45:14 -0400 | [diff] [blame] | 3912 | ret = btrfs_del_leaf(trans, root, path, leaf); |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 3913 | BUG_ON(ret); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3914 | free_extent_buffer(leaf); |
Chris Mason | 5de08d7 | 2007-02-24 06:24:44 -0500 | [diff] [blame] | 3915 | } else { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3916 | /* if we're still in the path, make sure |
| 3917 | * we're dirty. Otherwise, one of the |
| 3918 | * push_leaf functions must have already |
| 3919 | * dirtied this buffer |
| 3920 | */ |
| 3921 | if (path->nodes[0] == leaf) |
| 3922 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3923 | free_extent_buffer(leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3924 | } |
Chris Mason | d571976 | 2007-03-23 10:01:08 -0400 | [diff] [blame] | 3925 | } else { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 3926 | btrfs_mark_buffer_dirty(leaf); |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3927 | } |
| 3928 | } |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 3929 | return ret; |
Chris Mason | be0e5c0 | 2007-01-26 15:51:26 -0500 | [diff] [blame] | 3930 | } |
| 3931 | |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 3932 | /* |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3933 | * search the tree again to find a leaf with lesser keys |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3934 | * returns 0 if it found something or 1 if there are no lesser leaves. |
| 3935 | * returns < 0 on io errors. |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 3936 | * |
| 3937 | * This may release the path, and so you may lose any locks held at the |
| 3938 | * time you call it. |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3939 | */ |
| 3940 | int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path) |
| 3941 | { |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3942 | struct btrfs_key key; |
| 3943 | struct btrfs_disk_key found_key; |
| 3944 | int ret; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3945 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3946 | btrfs_item_key_to_cpu(path->nodes[0], &key, 0); |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3947 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3948 | if (key.offset > 0) |
| 3949 | key.offset--; |
| 3950 | else if (key.type > 0) |
| 3951 | key.type--; |
| 3952 | else if (key.objectid > 0) |
| 3953 | key.objectid--; |
| 3954 | else |
| 3955 | return 1; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3956 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 3957 | btrfs_release_path(root, path); |
| 3958 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
| 3959 | if (ret < 0) |
| 3960 | return ret; |
| 3961 | btrfs_item_key(path->nodes[0], &found_key, 0); |
| 3962 | ret = comp_keys(&found_key, &key); |
| 3963 | if (ret < 0) |
| 3964 | return 0; |
| 3965 | return 1; |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 3966 | } |
| 3967 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 3968 | /* |
| 3969 | * A helper function to walk down the tree starting at min_key, and looking |
| 3970 | * for nodes or leaves that are either in cache or have a minimum |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 3971 | * transaction id. This is used by the btree defrag code, and tree logging |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 3972 | * |
| 3973 | * This does not cow, but it does stuff the starting key it finds back |
| 3974 | * into min_key, so you can call btrfs_search_slot with cow=1 on the |
| 3975 | * key and get a writable path. |
| 3976 | * |
| 3977 | * This does lock as it descends, and path->keep_locks should be set |
| 3978 | * to 1 by the caller. |
| 3979 | * |
| 3980 | * This honors path->lowest_level to prevent descent past a given level |
| 3981 | * of the tree. |
| 3982 | * |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 3983 | * min_trans indicates the oldest transaction that you are interested |
| 3984 | * in walking through. Any nodes or leaves older than min_trans are |
| 3985 | * skipped over (without reading them). |
| 3986 | * |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 3987 | * returns zero if something useful was found, < 0 on error and 1 if there |
| 3988 | * was nothing in the tree that matched the search criteria. |
| 3989 | */ |
| 3990 | int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key, |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 3991 | struct btrfs_key *max_key, |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 3992 | struct btrfs_path *path, int cache_only, |
| 3993 | u64 min_trans) |
| 3994 | { |
| 3995 | struct extent_buffer *cur; |
| 3996 | struct btrfs_key found_key; |
| 3997 | int slot; |
Yan | 9652480 | 2008-07-24 12:19:49 -0400 | [diff] [blame] | 3998 | int sret; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 3999 | u32 nritems; |
| 4000 | int level; |
| 4001 | int ret = 1; |
| 4002 | |
Chris Mason | 934d375 | 2008-12-08 16:43:10 -0500 | [diff] [blame] | 4003 | WARN_ON(!path->keep_locks); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4004 | again: |
| 4005 | cur = btrfs_lock_root_node(root); |
| 4006 | level = btrfs_header_level(cur); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 4007 | WARN_ON(path->nodes[level]); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4008 | path->nodes[level] = cur; |
| 4009 | path->locks[level] = 1; |
| 4010 | |
| 4011 | if (btrfs_header_generation(cur) < min_trans) { |
| 4012 | ret = 1; |
| 4013 | goto out; |
| 4014 | } |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 4015 | while (1) { |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4016 | nritems = btrfs_header_nritems(cur); |
| 4017 | level = btrfs_header_level(cur); |
Yan | 9652480 | 2008-07-24 12:19:49 -0400 | [diff] [blame] | 4018 | sret = bin_search(cur, min_key, level, &slot); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4019 | |
Chris Mason | 323ac95 | 2008-10-01 19:05:46 -0400 | [diff] [blame] | 4020 | /* at the lowest level, we're done, setup the path and exit */ |
| 4021 | if (level == path->lowest_level) { |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 4022 | if (slot >= nritems) |
| 4023 | goto find_next_key; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4024 | ret = 0; |
| 4025 | path->slots[level] = slot; |
| 4026 | btrfs_item_key_to_cpu(cur, &found_key, slot); |
| 4027 | goto out; |
| 4028 | } |
Yan | 9652480 | 2008-07-24 12:19:49 -0400 | [diff] [blame] | 4029 | if (sret && slot > 0) |
| 4030 | slot--; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4031 | /* |
| 4032 | * check this node pointer against the cache_only and |
| 4033 | * min_trans parameters. If it isn't in cache or is too |
| 4034 | * old, skip to the next one. |
| 4035 | */ |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 4036 | while (slot < nritems) { |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4037 | u64 blockptr; |
| 4038 | u64 gen; |
| 4039 | struct extent_buffer *tmp; |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 4040 | struct btrfs_disk_key disk_key; |
| 4041 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4042 | blockptr = btrfs_node_blockptr(cur, slot); |
| 4043 | gen = btrfs_node_ptr_generation(cur, slot); |
| 4044 | if (gen < min_trans) { |
| 4045 | slot++; |
| 4046 | continue; |
| 4047 | } |
| 4048 | if (!cache_only) |
| 4049 | break; |
| 4050 | |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 4051 | if (max_key) { |
| 4052 | btrfs_node_key(cur, &disk_key, slot); |
| 4053 | if (comp_keys(&disk_key, max_key) >= 0) { |
| 4054 | ret = 1; |
| 4055 | goto out; |
| 4056 | } |
| 4057 | } |
| 4058 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4059 | tmp = btrfs_find_tree_block(root, blockptr, |
| 4060 | btrfs_level_size(root, level - 1)); |
| 4061 | |
| 4062 | if (tmp && btrfs_buffer_uptodate(tmp, gen)) { |
| 4063 | free_extent_buffer(tmp); |
| 4064 | break; |
| 4065 | } |
| 4066 | if (tmp) |
| 4067 | free_extent_buffer(tmp); |
| 4068 | slot++; |
| 4069 | } |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 4070 | find_next_key: |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4071 | /* |
| 4072 | * we didn't find a candidate key in this node, walk forward |
| 4073 | * and find another one |
| 4074 | */ |
| 4075 | if (slot >= nritems) { |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 4076 | path->slots[level] = slot; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 4077 | btrfs_set_path_blocking(path); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 4078 | sret = btrfs_find_next_key(root, path, min_key, level, |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4079 | cache_only, min_trans); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 4080 | if (sret == 0) { |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4081 | btrfs_release_path(root, path); |
| 4082 | goto again; |
| 4083 | } else { |
| 4084 | goto out; |
| 4085 | } |
| 4086 | } |
| 4087 | /* save our key for returning back */ |
| 4088 | btrfs_node_key_to_cpu(cur, &found_key, slot); |
| 4089 | path->slots[level] = slot; |
| 4090 | if (level == path->lowest_level) { |
| 4091 | ret = 0; |
| 4092 | unlock_up(path, level, 1); |
| 4093 | goto out; |
| 4094 | } |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 4095 | btrfs_set_path_blocking(path); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4096 | cur = read_node_slot(root, cur, slot); |
| 4097 | |
| 4098 | btrfs_tree_lock(cur); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 4099 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4100 | path->locks[level - 1] = 1; |
| 4101 | path->nodes[level - 1] = cur; |
| 4102 | unlock_up(path, level, 1); |
Chris Mason | 4008c04 | 2009-02-12 14:09:45 -0500 | [diff] [blame] | 4103 | btrfs_clear_path_blocking(path, NULL); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4104 | } |
| 4105 | out: |
| 4106 | if (ret == 0) |
| 4107 | memcpy(min_key, &found_key, sizeof(found_key)); |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 4108 | btrfs_set_path_blocking(path); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4109 | return ret; |
| 4110 | } |
| 4111 | |
| 4112 | /* |
| 4113 | * this is similar to btrfs_next_leaf, but does not try to preserve |
| 4114 | * and fixup the path. It looks for and returns the next key in the |
| 4115 | * tree based on the current path and the cache_only and min_trans |
| 4116 | * parameters. |
| 4117 | * |
| 4118 | * 0 is returned if another key is found, < 0 if there are any errors |
| 4119 | * and 1 is returned if there are no higher keys in the tree |
| 4120 | * |
| 4121 | * path->keep_locks should be set to 1 on the search made before |
| 4122 | * calling this function. |
| 4123 | */ |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4124 | int btrfs_find_next_key(struct btrfs_root *root, struct btrfs_path *path, |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 4125 | struct btrfs_key *key, int level, |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4126 | int cache_only, u64 min_trans) |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4127 | { |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4128 | int slot; |
| 4129 | struct extent_buffer *c; |
| 4130 | |
Chris Mason | 934d375 | 2008-12-08 16:43:10 -0500 | [diff] [blame] | 4131 | WARN_ON(!path->keep_locks); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 4132 | while (level < BTRFS_MAX_LEVEL) { |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4133 | if (!path->nodes[level]) |
| 4134 | return 1; |
| 4135 | |
| 4136 | slot = path->slots[level] + 1; |
| 4137 | c = path->nodes[level]; |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4138 | next: |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4139 | if (slot >= btrfs_header_nritems(c)) { |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 4140 | int ret; |
| 4141 | int orig_lowest; |
| 4142 | struct btrfs_key cur_key; |
| 4143 | if (level + 1 >= BTRFS_MAX_LEVEL || |
| 4144 | !path->nodes[level + 1]) |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4145 | return 1; |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 4146 | |
| 4147 | if (path->locks[level + 1]) { |
| 4148 | level++; |
| 4149 | continue; |
| 4150 | } |
| 4151 | |
| 4152 | slot = btrfs_header_nritems(c) - 1; |
| 4153 | if (level == 0) |
| 4154 | btrfs_item_key_to_cpu(c, &cur_key, slot); |
| 4155 | else |
| 4156 | btrfs_node_key_to_cpu(c, &cur_key, slot); |
| 4157 | |
| 4158 | orig_lowest = path->lowest_level; |
| 4159 | btrfs_release_path(root, path); |
| 4160 | path->lowest_level = level; |
| 4161 | ret = btrfs_search_slot(NULL, root, &cur_key, path, |
| 4162 | 0, 0); |
| 4163 | path->lowest_level = orig_lowest; |
| 4164 | if (ret < 0) |
| 4165 | return ret; |
| 4166 | |
| 4167 | c = path->nodes[level]; |
| 4168 | slot = path->slots[level]; |
| 4169 | if (ret == 0) |
| 4170 | slot++; |
| 4171 | goto next; |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4172 | } |
Yan Zheng | 33c66f4 | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 4173 | |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4174 | if (level == 0) |
| 4175 | btrfs_item_key_to_cpu(c, key, slot); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4176 | else { |
| 4177 | u64 blockptr = btrfs_node_blockptr(c, slot); |
| 4178 | u64 gen = btrfs_node_ptr_generation(c, slot); |
| 4179 | |
| 4180 | if (cache_only) { |
| 4181 | struct extent_buffer *cur; |
| 4182 | cur = btrfs_find_tree_block(root, blockptr, |
| 4183 | btrfs_level_size(root, level - 1)); |
| 4184 | if (!cur || !btrfs_buffer_uptodate(cur, gen)) { |
| 4185 | slot++; |
| 4186 | if (cur) |
| 4187 | free_extent_buffer(cur); |
| 4188 | goto next; |
| 4189 | } |
| 4190 | free_extent_buffer(cur); |
| 4191 | } |
| 4192 | if (gen < min_trans) { |
| 4193 | slot++; |
| 4194 | goto next; |
| 4195 | } |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4196 | btrfs_node_key_to_cpu(c, key, slot); |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4197 | } |
Chris Mason | e7a8456 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4198 | return 0; |
| 4199 | } |
| 4200 | return 1; |
| 4201 | } |
| 4202 | |
Chris Mason | 7bb8631 | 2007-12-11 09:25:06 -0500 | [diff] [blame] | 4203 | /* |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4204 | * search the tree again to find a leaf with greater keys |
Chris Mason | 0f70abe | 2007-02-28 16:46:22 -0500 | [diff] [blame] | 4205 | * returns 0 if it found something or 1 if there are no greater leaves. |
| 4206 | * returns < 0 on io errors. |
Chris Mason | 97571fd | 2007-02-24 13:39:08 -0500 | [diff] [blame] | 4207 | */ |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 4208 | int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path) |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 4209 | { |
| 4210 | int slot; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4211 | int level; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4212 | struct extent_buffer *c; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4213 | struct extent_buffer *next; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4214 | struct btrfs_key key; |
| 4215 | u32 nritems; |
| 4216 | int ret; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4217 | int old_spinning = path->leave_spinning; |
| 4218 | int force_blocking = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4219 | |
| 4220 | nritems = btrfs_header_nritems(path->nodes[0]); |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 4221 | if (nritems == 0) |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4222 | return 1; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4223 | |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4224 | /* |
| 4225 | * we take the blocks in an order that upsets lockdep. Using |
| 4226 | * blocking mode is the only way around it. |
| 4227 | */ |
| 4228 | #ifdef CONFIG_DEBUG_LOCK_ALLOC |
| 4229 | force_blocking = 1; |
| 4230 | #endif |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4231 | |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4232 | btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1); |
| 4233 | again: |
| 4234 | level = 1; |
| 4235 | next = NULL; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4236 | btrfs_release_path(root, path); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4237 | |
Chris Mason | a213501 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4238 | path->keep_locks = 1; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4239 | |
| 4240 | if (!force_blocking) |
| 4241 | path->leave_spinning = 1; |
| 4242 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4243 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
| 4244 | path->keep_locks = 0; |
| 4245 | |
| 4246 | if (ret < 0) |
| 4247 | return ret; |
| 4248 | |
Chris Mason | a213501 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4249 | nritems = btrfs_header_nritems(path->nodes[0]); |
Chris Mason | 168fd7d | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4250 | /* |
| 4251 | * by releasing the path above we dropped all our locks. A balance |
| 4252 | * could have added more items next to the key that used to be |
| 4253 | * at the very end of the block. So, check again here and |
| 4254 | * advance the path if there are now more items available. |
| 4255 | */ |
Chris Mason | a213501 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4256 | if (nritems > 0 && path->slots[0] < nritems - 1) { |
Yan Zheng | e457afe | 2009-07-22 09:59:00 -0400 | [diff] [blame] | 4257 | if (ret == 0) |
| 4258 | path->slots[0]++; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4259 | ret = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4260 | goto done; |
| 4261 | } |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 4262 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 4263 | while (level < BTRFS_MAX_LEVEL) { |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4264 | if (!path->nodes[level]) { |
| 4265 | ret = 1; |
| 4266 | goto done; |
| 4267 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4268 | |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 4269 | slot = path->slots[level] + 1; |
| 4270 | c = path->nodes[level]; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4271 | if (slot >= btrfs_header_nritems(c)) { |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 4272 | level++; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4273 | if (level == BTRFS_MAX_LEVEL) { |
| 4274 | ret = 1; |
| 4275 | goto done; |
| 4276 | } |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 4277 | continue; |
| 4278 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4279 | |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4280 | if (next) { |
| 4281 | btrfs_tree_unlock(next); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4282 | free_extent_buffer(next); |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4283 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4284 | |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4285 | next = c; |
| 4286 | ret = read_block_for_search(NULL, root, path, &next, level, |
| 4287 | slot, &key); |
| 4288 | if (ret == -EAGAIN) |
| 4289 | goto again; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4290 | |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 4291 | if (ret < 0) { |
| 4292 | btrfs_release_path(root, path); |
| 4293 | goto done; |
| 4294 | } |
| 4295 | |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4296 | if (!path->skip_locking) { |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4297 | ret = btrfs_try_spin_lock(next); |
| 4298 | if (!ret) { |
| 4299 | btrfs_set_path_blocking(path); |
| 4300 | btrfs_tree_lock(next); |
| 4301 | if (!force_blocking) |
| 4302 | btrfs_clear_path_blocking(path, next); |
| 4303 | } |
| 4304 | if (force_blocking) |
| 4305 | btrfs_set_lock_blocking(next); |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4306 | } |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 4307 | break; |
| 4308 | } |
| 4309 | path->slots[level] = slot; |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 4310 | while (1) { |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 4311 | level--; |
| 4312 | c = path->nodes[level]; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4313 | if (path->locks[level]) |
| 4314 | btrfs_tree_unlock(c); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4315 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 4316 | free_extent_buffer(c); |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 4317 | path->nodes[level] = next; |
| 4318 | path->slots[level] = 0; |
Chris Mason | a74a4b9 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4319 | if (!path->skip_locking) |
| 4320 | path->locks[level] = 1; |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4321 | |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 4322 | if (!level) |
| 4323 | break; |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 4324 | |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4325 | ret = read_block_for_search(NULL, root, path, &next, level, |
| 4326 | 0, &key); |
| 4327 | if (ret == -EAGAIN) |
| 4328 | goto again; |
| 4329 | |
Chris Mason | 76a05b3 | 2009-05-14 13:24:30 -0400 | [diff] [blame] | 4330 | if (ret < 0) { |
| 4331 | btrfs_release_path(root, path); |
| 4332 | goto done; |
| 4333 | } |
| 4334 | |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4335 | if (!path->skip_locking) { |
Chris Mason | b9447ef | 2009-03-09 11:45:38 -0400 | [diff] [blame] | 4336 | btrfs_assert_tree_locked(path->nodes[level]); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4337 | ret = btrfs_try_spin_lock(next); |
| 4338 | if (!ret) { |
| 4339 | btrfs_set_path_blocking(path); |
| 4340 | btrfs_tree_lock(next); |
| 4341 | if (!force_blocking) |
| 4342 | btrfs_clear_path_blocking(path, next); |
| 4343 | } |
| 4344 | if (force_blocking) |
| 4345 | btrfs_set_lock_blocking(next); |
Chris Mason | 5cd57b2 | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4346 | } |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 4347 | } |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4348 | ret = 0; |
Chris Mason | 925baed | 2008-06-25 16:01:30 -0400 | [diff] [blame] | 4349 | done: |
| 4350 | unlock_up(path, 0, 1); |
Chris Mason | 8e73f27 | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 4351 | path->leave_spinning = old_spinning; |
| 4352 | if (!old_spinning) |
| 4353 | btrfs_set_path_blocking(path); |
| 4354 | |
| 4355 | return ret; |
Chris Mason | d97e63b | 2007-02-20 16:40:44 -0500 | [diff] [blame] | 4356 | } |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 4357 | |
Chris Mason | 3f157a2 | 2008-06-25 16:01:31 -0400 | [diff] [blame] | 4358 | /* |
| 4359 | * this uses btrfs_prev_leaf to walk backwards in the tree, and keeps |
| 4360 | * searching until it gets past min_objectid or finds an item of 'type' |
| 4361 | * |
| 4362 | * returns 0 if something is found, 1 if nothing was found and < 0 on error |
| 4363 | */ |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 4364 | int btrfs_previous_item(struct btrfs_root *root, |
| 4365 | struct btrfs_path *path, u64 min_objectid, |
| 4366 | int type) |
| 4367 | { |
| 4368 | struct btrfs_key found_key; |
| 4369 | struct extent_buffer *leaf; |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 4370 | u32 nritems; |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 4371 | int ret; |
| 4372 | |
Chris Mason | d397712 | 2009-01-05 21:25:51 -0500 | [diff] [blame] | 4373 | while (1) { |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 4374 | if (path->slots[0] == 0) { |
Chris Mason | b4ce94d | 2009-02-04 09:25:08 -0500 | [diff] [blame] | 4375 | btrfs_set_path_blocking(path); |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 4376 | ret = btrfs_prev_leaf(root, path); |
| 4377 | if (ret != 0) |
| 4378 | return ret; |
| 4379 | } else { |
| 4380 | path->slots[0]--; |
| 4381 | } |
| 4382 | leaf = path->nodes[0]; |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 4383 | nritems = btrfs_header_nritems(leaf); |
| 4384 | if (nritems == 0) |
| 4385 | return 1; |
| 4386 | if (path->slots[0] == nritems) |
| 4387 | path->slots[0]--; |
| 4388 | |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 4389 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 4390 | if (found_key.objectid < min_objectid) |
| 4391 | break; |
Yan Zheng | 0a4eefb | 2009-07-24 11:06:53 -0400 | [diff] [blame] | 4392 | if (found_key.type == type) |
| 4393 | return 0; |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 4394 | if (found_key.objectid == min_objectid && |
| 4395 | found_key.type < type) |
| 4396 | break; |
Chris Mason | 0b86a83 | 2008-03-24 15:01:56 -0400 | [diff] [blame] | 4397 | } |
| 4398 | return 1; |
| 4399 | } |