]>
Commit | Line | Data |
---|---|---|
6cbd5570 | 1 | /* |
d352ac68 | 2 | * Copyright (C) 2007,2008 Oracle. All rights reserved. |
6cbd5570 CM |
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 | ||
a6b6e75e | 19 | #include <linux/sched.h> |
eb60ceac CM |
20 | #include "ctree.h" |
21 | #include "disk-io.h" | |
7f5c1516 | 22 | #include "transaction.h" |
5f39d397 | 23 | #include "print-tree.h" |
925baedd | 24 | #include "locking.h" |
9a8dd150 | 25 | |
e089f05c CM |
26 | static int split_node(struct btrfs_trans_handle *trans, struct btrfs_root |
27 | *root, struct btrfs_path *path, int level); | |
28 | static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root | |
d4dbff95 | 29 | *root, struct btrfs_key *ins_key, |
cc0c5538 | 30 | struct btrfs_path *path, int data_size, int extend); |
5f39d397 CM |
31 | static int push_node_left(struct btrfs_trans_handle *trans, |
32 | struct btrfs_root *root, struct extent_buffer *dst, | |
971a1f66 | 33 | struct extent_buffer *src, int empty); |
5f39d397 CM |
34 | static int balance_node_right(struct btrfs_trans_handle *trans, |
35 | struct btrfs_root *root, | |
36 | struct extent_buffer *dst_buf, | |
37 | struct extent_buffer *src_buf); | |
e089f05c CM |
38 | static int del_ptr(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
39 | struct btrfs_path *path, int level, int slot); | |
d97e63b6 | 40 | |
df24a2b9 | 41 | inline void btrfs_init_path(struct btrfs_path *p) |
2c90e5d6 | 42 | { |
df24a2b9 | 43 | memset(p, 0, sizeof(*p)); |
2c90e5d6 CM |
44 | } |
45 | ||
df24a2b9 | 46 | struct btrfs_path *btrfs_alloc_path(void) |
2c90e5d6 | 47 | { |
df24a2b9 CM |
48 | struct btrfs_path *path; |
49 | path = kmem_cache_alloc(btrfs_path_cachep, GFP_NOFS); | |
2cc58cf2 | 50 | if (path) { |
df24a2b9 | 51 | btrfs_init_path(path); |
2cc58cf2 CM |
52 | path->reada = 1; |
53 | } | |
df24a2b9 | 54 | return path; |
2c90e5d6 CM |
55 | } |
56 | ||
d352ac68 | 57 | /* this also releases the path */ |
df24a2b9 | 58 | void btrfs_free_path(struct btrfs_path *p) |
be0e5c09 | 59 | { |
df24a2b9 CM |
60 | btrfs_release_path(NULL, p); |
61 | kmem_cache_free(btrfs_path_cachep, p); | |
be0e5c09 CM |
62 | } |
63 | ||
d352ac68 CM |
64 | /* |
65 | * path release drops references on the extent buffers in the path | |
66 | * and it drops any locks held by this path | |
67 | * | |
68 | * It is safe to call this on paths that no locks or extent buffers held. | |
69 | */ | |
e02119d5 | 70 | void noinline btrfs_release_path(struct btrfs_root *root, struct btrfs_path *p) |
eb60ceac CM |
71 | { |
72 | int i; | |
a2135011 | 73 | |
234b63a0 | 74 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) { |
3f157a2f | 75 | p->slots[i] = 0; |
eb60ceac | 76 | if (!p->nodes[i]) |
925baedd CM |
77 | continue; |
78 | if (p->locks[i]) { | |
79 | btrfs_tree_unlock(p->nodes[i]); | |
80 | p->locks[i] = 0; | |
81 | } | |
5f39d397 | 82 | free_extent_buffer(p->nodes[i]); |
3f157a2f | 83 | p->nodes[i] = NULL; |
eb60ceac CM |
84 | } |
85 | } | |
86 | ||
d352ac68 CM |
87 | /* |
88 | * safely gets a reference on the root node of a tree. A lock | |
89 | * is not taken, so a concurrent writer may put a different node | |
90 | * at the root of the tree. See btrfs_lock_root_node for the | |
91 | * looping required. | |
92 | * | |
93 | * The extent buffer returned by this has a reference taken, so | |
94 | * it won't disappear. It may stop being the root of the tree | |
95 | * at any time because there are no locks held. | |
96 | */ | |
925baedd CM |
97 | struct extent_buffer *btrfs_root_node(struct btrfs_root *root) |
98 | { | |
99 | struct extent_buffer *eb; | |
100 | spin_lock(&root->node_lock); | |
101 | eb = root->node; | |
102 | extent_buffer_get(eb); | |
103 | spin_unlock(&root->node_lock); | |
104 | return eb; | |
105 | } | |
106 | ||
d352ac68 CM |
107 | /* loop around taking references on and locking the root node of the |
108 | * tree until you end up with a lock on the root. A locked buffer | |
109 | * is returned, with a reference held. | |
110 | */ | |
925baedd CM |
111 | struct extent_buffer *btrfs_lock_root_node(struct btrfs_root *root) |
112 | { | |
113 | struct extent_buffer *eb; | |
114 | ||
115 | while(1) { | |
116 | eb = btrfs_root_node(root); | |
117 | btrfs_tree_lock(eb); | |
118 | ||
119 | spin_lock(&root->node_lock); | |
120 | if (eb == root->node) { | |
121 | spin_unlock(&root->node_lock); | |
122 | break; | |
123 | } | |
124 | spin_unlock(&root->node_lock); | |
125 | ||
126 | btrfs_tree_unlock(eb); | |
127 | free_extent_buffer(eb); | |
128 | } | |
129 | return eb; | |
130 | } | |
131 | ||
d352ac68 CM |
132 | /* cowonly root (everything not a reference counted cow subvolume), just get |
133 | * put onto a simple dirty list. transaction.c walks this to make sure they | |
134 | * get properly updated on disk. | |
135 | */ | |
0b86a832 CM |
136 | static void add_root_to_dirty_list(struct btrfs_root *root) |
137 | { | |
138 | if (root->track_dirty && list_empty(&root->dirty_list)) { | |
139 | list_add(&root->dirty_list, | |
140 | &root->fs_info->dirty_cowonly_roots); | |
141 | } | |
142 | } | |
143 | ||
d352ac68 CM |
144 | /* |
145 | * used by snapshot creation to make a copy of a root for a tree with | |
146 | * a given objectid. The buffer with the new root node is returned in | |
147 | * cow_ret, and this func returns zero on success or a negative error code. | |
148 | */ | |
be20aa9d CM |
149 | int btrfs_copy_root(struct btrfs_trans_handle *trans, |
150 | struct btrfs_root *root, | |
151 | struct extent_buffer *buf, | |
152 | struct extent_buffer **cow_ret, u64 new_root_objectid) | |
153 | { | |
154 | struct extent_buffer *cow; | |
155 | u32 nritems; | |
156 | int ret = 0; | |
157 | int level; | |
4aec2b52 | 158 | struct btrfs_root *new_root; |
be20aa9d | 159 | |
4aec2b52 CM |
160 | new_root = kmalloc(sizeof(*new_root), GFP_NOFS); |
161 | if (!new_root) | |
162 | return -ENOMEM; | |
163 | ||
164 | memcpy(new_root, root, sizeof(*new_root)); | |
165 | new_root->root_key.objectid = new_root_objectid; | |
be20aa9d CM |
166 | |
167 | WARN_ON(root->ref_cows && trans->transid != | |
168 | root->fs_info->running_transaction->transid); | |
169 | WARN_ON(root->ref_cows && trans->transid != root->last_trans); | |
170 | ||
171 | level = btrfs_header_level(buf); | |
172 | nritems = btrfs_header_nritems(buf); | |
31840ae1 ZY |
173 | |
174 | cow = btrfs_alloc_free_block(trans, new_root, buf->len, 0, | |
175 | new_root_objectid, trans->transid, | |
176 | level, buf->start, 0); | |
4aec2b52 CM |
177 | if (IS_ERR(cow)) { |
178 | kfree(new_root); | |
be20aa9d | 179 | return PTR_ERR(cow); |
4aec2b52 | 180 | } |
be20aa9d CM |
181 | |
182 | copy_extent_buffer(cow, buf, 0, 0, cow->len); | |
183 | btrfs_set_header_bytenr(cow, cow->start); | |
184 | btrfs_set_header_generation(cow, trans->transid); | |
185 | btrfs_set_header_owner(cow, new_root_objectid); | |
63b10fc4 | 186 | btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN); |
be20aa9d CM |
187 | |
188 | WARN_ON(btrfs_header_generation(buf) > trans->transid); | |
31840ae1 | 189 | ret = btrfs_inc_ref(trans, new_root, buf, cow, NULL); |
4aec2b52 CM |
190 | kfree(new_root); |
191 | ||
be20aa9d CM |
192 | if (ret) |
193 | return ret; | |
194 | ||
195 | btrfs_mark_buffer_dirty(cow); | |
196 | *cow_ret = cow; | |
197 | return 0; | |
198 | } | |
199 | ||
d352ac68 CM |
200 | /* |
201 | * does the dirty work in cow of a single block. The parent block | |
202 | * (if supplied) is updated to point to the new cow copy. The new | |
203 | * buffer is marked dirty and returned locked. If you modify the block | |
204 | * it needs to be marked dirty again. | |
205 | * | |
206 | * search_start -- an allocation hint for the new block | |
207 | * | |
208 | * empty_size -- a hint that you plan on doing more cow. This is the size in bytes | |
209 | * the allocator should try to find free next to the block it returns. This is | |
210 | * just a hint and may be ignored by the allocator. | |
211 | * | |
212 | * prealloc_dest -- if you have already reserved a destination for the cow, | |
213 | * this uses that block instead of allocating a new one. btrfs_alloc_reserved_extent | |
214 | * is used to finish the allocation. | |
215 | */ | |
e02119d5 | 216 | int noinline __btrfs_cow_block(struct btrfs_trans_handle *trans, |
5f39d397 CM |
217 | struct btrfs_root *root, |
218 | struct extent_buffer *buf, | |
219 | struct extent_buffer *parent, int parent_slot, | |
220 | struct extent_buffer **cow_ret, | |
65b51a00 CM |
221 | u64 search_start, u64 empty_size, |
222 | u64 prealloc_dest) | |
02217ed2 | 223 | { |
31840ae1 | 224 | u64 parent_start; |
5f39d397 | 225 | struct extent_buffer *cow; |
7bb86316 | 226 | u32 nritems; |
6702ed49 | 227 | int ret = 0; |
7bb86316 | 228 | int level; |
925baedd | 229 | int unlock_orig = 0; |
7bb86316 | 230 | |
925baedd CM |
231 | if (*cow_ret == buf) |
232 | unlock_orig = 1; | |
233 | ||
234 | WARN_ON(!btrfs_tree_locked(buf)); | |
235 | ||
31840ae1 ZY |
236 | if (parent) |
237 | parent_start = parent->start; | |
238 | else | |
239 | parent_start = 0; | |
240 | ||
7bb86316 CM |
241 | WARN_ON(root->ref_cows && trans->transid != |
242 | root->fs_info->running_transaction->transid); | |
6702ed49 | 243 | WARN_ON(root->ref_cows && trans->transid != root->last_trans); |
5f39d397 | 244 | |
7bb86316 CM |
245 | level = btrfs_header_level(buf); |
246 | nritems = btrfs_header_nritems(buf); | |
31840ae1 | 247 | |
65b51a00 CM |
248 | if (prealloc_dest) { |
249 | struct btrfs_key ins; | |
250 | ||
251 | ins.objectid = prealloc_dest; | |
252 | ins.offset = buf->len; | |
253 | ins.type = BTRFS_EXTENT_ITEM_KEY; | |
254 | ||
31840ae1 | 255 | ret = btrfs_alloc_reserved_extent(trans, root, parent_start, |
65b51a00 | 256 | root->root_key.objectid, |
31840ae1 | 257 | trans->transid, level, 0, |
65b51a00 CM |
258 | &ins); |
259 | BUG_ON(ret); | |
260 | cow = btrfs_init_new_buffer(trans, root, prealloc_dest, | |
261 | buf->len); | |
262 | } else { | |
263 | cow = btrfs_alloc_free_block(trans, root, buf->len, | |
31840ae1 | 264 | parent_start, |
65b51a00 | 265 | root->root_key.objectid, |
31840ae1 ZY |
266 | trans->transid, level, |
267 | search_start, empty_size); | |
65b51a00 | 268 | } |
54aa1f4d CM |
269 | if (IS_ERR(cow)) |
270 | return PTR_ERR(cow); | |
6702ed49 | 271 | |
5f39d397 | 272 | copy_extent_buffer(cow, buf, 0, 0, cow->len); |
db94535d | 273 | btrfs_set_header_bytenr(cow, cow->start); |
5f39d397 CM |
274 | btrfs_set_header_generation(cow, trans->transid); |
275 | btrfs_set_header_owner(cow, root->root_key.objectid); | |
63b10fc4 | 276 | btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN); |
6702ed49 | 277 | |
5f39d397 CM |
278 | WARN_ON(btrfs_header_generation(buf) > trans->transid); |
279 | if (btrfs_header_generation(buf) != trans->transid) { | |
31840ae1 | 280 | u32 nr_extents; |
31840ae1 | 281 | ret = btrfs_inc_ref(trans, root, buf, cow, &nr_extents); |
6702ed49 CM |
282 | if (ret) |
283 | return ret; | |
31840ae1 ZY |
284 | |
285 | ret = btrfs_cache_ref(trans, root, buf, nr_extents); | |
286 | WARN_ON(ret); | |
1a40e23b ZY |
287 | } else if (btrfs_header_owner(buf) == BTRFS_TREE_RELOC_OBJECTID) { |
288 | /* | |
289 | * There are only two places that can drop reference to | |
290 | * tree blocks owned by living reloc trees, one is here, | |
291 | * the other place is btrfs_merge_path. In both places, | |
292 | * we check reference count while tree block is locked. | |
293 | * Furthermore, if reference count is one, it won't get | |
294 | * increased by someone else. | |
295 | */ | |
296 | u32 refs; | |
297 | ret = btrfs_lookup_extent_ref(trans, root, buf->start, | |
298 | buf->len, &refs); | |
299 | BUG_ON(ret); | |
300 | if (refs == 1) { | |
301 | ret = btrfs_update_ref(trans, root, buf, cow, | |
302 | 0, nritems); | |
303 | clean_tree_block(trans, root, buf); | |
304 | } else { | |
305 | ret = btrfs_inc_ref(trans, root, buf, cow, NULL); | |
306 | } | |
307 | BUG_ON(ret); | |
6702ed49 | 308 | } else { |
31840ae1 ZY |
309 | ret = btrfs_update_ref(trans, root, buf, cow, 0, nritems); |
310 | if (ret) | |
311 | return ret; | |
6702ed49 CM |
312 | clean_tree_block(trans, root, buf); |
313 | } | |
314 | ||
1a40e23b ZY |
315 | if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) { |
316 | ret = btrfs_add_reloc_mapping(root, buf->start, | |
317 | buf->len, cow->start); | |
318 | BUG_ON(ret); | |
319 | ret = btrfs_reloc_tree_cache_ref(trans, root, cow, buf->start); | |
320 | WARN_ON(ret); | |
321 | } | |
322 | ||
02217ed2 | 323 | if (buf == root->node) { |
925baedd | 324 | WARN_ON(parent && parent != buf); |
925baedd CM |
325 | |
326 | spin_lock(&root->node_lock); | |
02217ed2 | 327 | root->node = cow; |
5f39d397 | 328 | extent_buffer_get(cow); |
925baedd CM |
329 | spin_unlock(&root->node_lock); |
330 | ||
2c90e5d6 | 331 | if (buf != root->commit_root) { |
db94535d | 332 | btrfs_free_extent(trans, root, buf->start, |
31840ae1 ZY |
333 | buf->len, buf->start, |
334 | root->root_key.objectid, | |
335 | btrfs_header_generation(buf), | |
336 | 0, 0, 1); | |
2c90e5d6 | 337 | } |
5f39d397 | 338 | free_extent_buffer(buf); |
0b86a832 | 339 | add_root_to_dirty_list(root); |
02217ed2 | 340 | } else { |
5f39d397 | 341 | btrfs_set_node_blockptr(parent, parent_slot, |
db94535d | 342 | cow->start); |
74493f7a CM |
343 | WARN_ON(trans->transid == 0); |
344 | btrfs_set_node_ptr_generation(parent, parent_slot, | |
345 | trans->transid); | |
d6025579 | 346 | btrfs_mark_buffer_dirty(parent); |
5f39d397 | 347 | WARN_ON(btrfs_header_generation(parent) != trans->transid); |
7bb86316 | 348 | btrfs_free_extent(trans, root, buf->start, buf->len, |
31840ae1 ZY |
349 | parent_start, btrfs_header_owner(parent), |
350 | btrfs_header_generation(parent), 0, 0, 1); | |
02217ed2 | 351 | } |
925baedd CM |
352 | if (unlock_orig) |
353 | btrfs_tree_unlock(buf); | |
5f39d397 | 354 | free_extent_buffer(buf); |
ccd467d6 | 355 | btrfs_mark_buffer_dirty(cow); |
2c90e5d6 | 356 | *cow_ret = cow; |
02217ed2 CM |
357 | return 0; |
358 | } | |
359 | ||
d352ac68 CM |
360 | /* |
361 | * cows a single block, see __btrfs_cow_block for the real work. | |
362 | * This version of it has extra checks so that a block isn't cow'd more than | |
363 | * once per transaction, as long as it hasn't been written yet | |
364 | */ | |
e02119d5 | 365 | int noinline btrfs_cow_block(struct btrfs_trans_handle *trans, |
5f39d397 CM |
366 | struct btrfs_root *root, struct extent_buffer *buf, |
367 | struct extent_buffer *parent, int parent_slot, | |
65b51a00 | 368 | struct extent_buffer **cow_ret, u64 prealloc_dest) |
6702ed49 CM |
369 | { |
370 | u64 search_start; | |
f510cfec | 371 | int ret; |
dc17ff8f | 372 | |
6702ed49 CM |
373 | if (trans->transaction != root->fs_info->running_transaction) { |
374 | printk(KERN_CRIT "trans %Lu running %Lu\n", trans->transid, | |
375 | root->fs_info->running_transaction->transid); | |
376 | WARN_ON(1); | |
377 | } | |
378 | if (trans->transid != root->fs_info->generation) { | |
379 | printk(KERN_CRIT "trans %Lu running %Lu\n", trans->transid, | |
380 | root->fs_info->generation); | |
381 | WARN_ON(1); | |
382 | } | |
dc17ff8f | 383 | |
63b10fc4 | 384 | spin_lock(&root->fs_info->hash_lock); |
5b21f2ed ZY |
385 | if (btrfs_header_generation(buf) == trans->transid && |
386 | btrfs_header_owner(buf) == root->root_key.objectid && | |
63b10fc4 | 387 | !btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN)) { |
6702ed49 | 388 | *cow_ret = buf; |
63b10fc4 | 389 | spin_unlock(&root->fs_info->hash_lock); |
65b51a00 | 390 | WARN_ON(prealloc_dest); |
6702ed49 CM |
391 | return 0; |
392 | } | |
63b10fc4 | 393 | spin_unlock(&root->fs_info->hash_lock); |
0b86a832 | 394 | search_start = buf->start & ~((u64)(1024 * 1024 * 1024) - 1); |
f510cfec | 395 | ret = __btrfs_cow_block(trans, root, buf, parent, |
65b51a00 CM |
396 | parent_slot, cow_ret, search_start, 0, |
397 | prealloc_dest); | |
f510cfec | 398 | return ret; |
6702ed49 CM |
399 | } |
400 | ||
d352ac68 CM |
401 | /* |
402 | * helper function for defrag to decide if two blocks pointed to by a | |
403 | * node are actually close by | |
404 | */ | |
6b80053d | 405 | static int close_blocks(u64 blocknr, u64 other, u32 blocksize) |
6702ed49 | 406 | { |
6b80053d | 407 | if (blocknr < other && other - (blocknr + blocksize) < 32768) |
6702ed49 | 408 | return 1; |
6b80053d | 409 | if (blocknr > other && blocknr - (other + blocksize) < 32768) |
6702ed49 CM |
410 | return 1; |
411 | return 0; | |
412 | } | |
413 | ||
081e9573 CM |
414 | /* |
415 | * compare two keys in a memcmp fashion | |
416 | */ | |
417 | static int comp_keys(struct btrfs_disk_key *disk, struct btrfs_key *k2) | |
418 | { | |
419 | struct btrfs_key k1; | |
420 | ||
421 | btrfs_disk_key_to_cpu(&k1, disk); | |
422 | ||
423 | if (k1.objectid > k2->objectid) | |
424 | return 1; | |
425 | if (k1.objectid < k2->objectid) | |
426 | return -1; | |
427 | if (k1.type > k2->type) | |
428 | return 1; | |
429 | if (k1.type < k2->type) | |
430 | return -1; | |
431 | if (k1.offset > k2->offset) | |
432 | return 1; | |
433 | if (k1.offset < k2->offset) | |
434 | return -1; | |
435 | return 0; | |
436 | } | |
437 | ||
438 | ||
d352ac68 CM |
439 | /* |
440 | * this is used by the defrag code to go through all the | |
441 | * leaves pointed to by a node and reallocate them so that | |
442 | * disk order is close to key order | |
443 | */ | |
6702ed49 | 444 | int btrfs_realloc_node(struct btrfs_trans_handle *trans, |
5f39d397 | 445 | struct btrfs_root *root, struct extent_buffer *parent, |
a6b6e75e CM |
446 | int start_slot, int cache_only, u64 *last_ret, |
447 | struct btrfs_key *progress) | |
6702ed49 | 448 | { |
6b80053d | 449 | struct extent_buffer *cur; |
6702ed49 | 450 | u64 blocknr; |
ca7a79ad | 451 | u64 gen; |
e9d0b13b CM |
452 | u64 search_start = *last_ret; |
453 | u64 last_block = 0; | |
6702ed49 CM |
454 | u64 other; |
455 | u32 parent_nritems; | |
6702ed49 CM |
456 | int end_slot; |
457 | int i; | |
458 | int err = 0; | |
f2183bde | 459 | int parent_level; |
6b80053d CM |
460 | int uptodate; |
461 | u32 blocksize; | |
081e9573 CM |
462 | int progress_passed = 0; |
463 | struct btrfs_disk_key disk_key; | |
6702ed49 | 464 | |
5708b959 CM |
465 | parent_level = btrfs_header_level(parent); |
466 | if (cache_only && parent_level != 1) | |
467 | return 0; | |
468 | ||
6702ed49 CM |
469 | if (trans->transaction != root->fs_info->running_transaction) { |
470 | printk(KERN_CRIT "trans %Lu running %Lu\n", trans->transid, | |
471 | root->fs_info->running_transaction->transid); | |
472 | WARN_ON(1); | |
473 | } | |
474 | if (trans->transid != root->fs_info->generation) { | |
475 | printk(KERN_CRIT "trans %Lu running %Lu\n", trans->transid, | |
476 | root->fs_info->generation); | |
477 | WARN_ON(1); | |
478 | } | |
86479a04 | 479 | |
6b80053d | 480 | parent_nritems = btrfs_header_nritems(parent); |
6b80053d | 481 | blocksize = btrfs_level_size(root, parent_level - 1); |
6702ed49 CM |
482 | end_slot = parent_nritems; |
483 | ||
484 | if (parent_nritems == 1) | |
485 | return 0; | |
486 | ||
487 | for (i = start_slot; i < end_slot; i++) { | |
488 | int close = 1; | |
a6b6e75e | 489 | |
5708b959 CM |
490 | if (!parent->map_token) { |
491 | map_extent_buffer(parent, | |
492 | btrfs_node_key_ptr_offset(i), | |
493 | sizeof(struct btrfs_key_ptr), | |
494 | &parent->map_token, &parent->kaddr, | |
495 | &parent->map_start, &parent->map_len, | |
496 | KM_USER1); | |
497 | } | |
081e9573 CM |
498 | btrfs_node_key(parent, &disk_key, i); |
499 | if (!progress_passed && comp_keys(&disk_key, progress) < 0) | |
500 | continue; | |
501 | ||
502 | progress_passed = 1; | |
6b80053d | 503 | blocknr = btrfs_node_blockptr(parent, i); |
ca7a79ad | 504 | gen = btrfs_node_ptr_generation(parent, i); |
e9d0b13b CM |
505 | if (last_block == 0) |
506 | last_block = blocknr; | |
5708b959 | 507 | |
6702ed49 | 508 | if (i > 0) { |
6b80053d CM |
509 | other = btrfs_node_blockptr(parent, i - 1); |
510 | close = close_blocks(blocknr, other, blocksize); | |
6702ed49 | 511 | } |
0ef3e66b | 512 | if (!close && i < end_slot - 2) { |
6b80053d CM |
513 | other = btrfs_node_blockptr(parent, i + 1); |
514 | close = close_blocks(blocknr, other, blocksize); | |
6702ed49 | 515 | } |
e9d0b13b CM |
516 | if (close) { |
517 | last_block = blocknr; | |
6702ed49 | 518 | continue; |
e9d0b13b | 519 | } |
5708b959 CM |
520 | if (parent->map_token) { |
521 | unmap_extent_buffer(parent, parent->map_token, | |
522 | KM_USER1); | |
523 | parent->map_token = NULL; | |
524 | } | |
6702ed49 | 525 | |
6b80053d CM |
526 | cur = btrfs_find_tree_block(root, blocknr, blocksize); |
527 | if (cur) | |
1259ab75 | 528 | uptodate = btrfs_buffer_uptodate(cur, gen); |
6b80053d CM |
529 | else |
530 | uptodate = 0; | |
5708b959 | 531 | if (!cur || !uptodate) { |
6702ed49 | 532 | if (cache_only) { |
6b80053d | 533 | free_extent_buffer(cur); |
6702ed49 CM |
534 | continue; |
535 | } | |
6b80053d CM |
536 | if (!cur) { |
537 | cur = read_tree_block(root, blocknr, | |
ca7a79ad | 538 | blocksize, gen); |
6b80053d | 539 | } else if (!uptodate) { |
ca7a79ad | 540 | btrfs_read_buffer(cur, gen); |
f2183bde | 541 | } |
6702ed49 | 542 | } |
e9d0b13b | 543 | if (search_start == 0) |
6b80053d | 544 | search_start = last_block; |
e9d0b13b | 545 | |
e7a84565 | 546 | btrfs_tree_lock(cur); |
6b80053d | 547 | err = __btrfs_cow_block(trans, root, cur, parent, i, |
e7a84565 | 548 | &cur, search_start, |
6b80053d | 549 | min(16 * blocksize, |
65b51a00 | 550 | (end_slot - i) * blocksize), 0); |
252c38f0 | 551 | if (err) { |
e7a84565 | 552 | btrfs_tree_unlock(cur); |
6b80053d | 553 | free_extent_buffer(cur); |
6702ed49 | 554 | break; |
252c38f0 | 555 | } |
e7a84565 CM |
556 | search_start = cur->start; |
557 | last_block = cur->start; | |
f2183bde | 558 | *last_ret = search_start; |
e7a84565 CM |
559 | btrfs_tree_unlock(cur); |
560 | free_extent_buffer(cur); | |
6702ed49 | 561 | } |
5708b959 CM |
562 | if (parent->map_token) { |
563 | unmap_extent_buffer(parent, parent->map_token, | |
564 | KM_USER1); | |
565 | parent->map_token = NULL; | |
566 | } | |
6702ed49 CM |
567 | return err; |
568 | } | |
569 | ||
74123bd7 CM |
570 | /* |
571 | * The leaf data grows from end-to-front in the node. | |
572 | * this returns the address of the start of the last item, | |
573 | * which is the stop of the leaf data stack | |
574 | */ | |
123abc88 | 575 | static inline unsigned int leaf_data_end(struct btrfs_root *root, |
5f39d397 | 576 | struct extent_buffer *leaf) |
be0e5c09 | 577 | { |
5f39d397 | 578 | u32 nr = btrfs_header_nritems(leaf); |
be0e5c09 | 579 | if (nr == 0) |
123abc88 | 580 | return BTRFS_LEAF_DATA_SIZE(root); |
5f39d397 | 581 | return btrfs_item_offset_nr(leaf, nr - 1); |
be0e5c09 CM |
582 | } |
583 | ||
d352ac68 CM |
584 | /* |
585 | * extra debugging checks to make sure all the items in a key are | |
586 | * well formed and in the proper order | |
587 | */ | |
123abc88 CM |
588 | static int check_node(struct btrfs_root *root, struct btrfs_path *path, |
589 | int level) | |
aa5d6bed | 590 | { |
5f39d397 CM |
591 | struct extent_buffer *parent = NULL; |
592 | struct extent_buffer *node = path->nodes[level]; | |
593 | struct btrfs_disk_key parent_key; | |
594 | struct btrfs_disk_key node_key; | |
aa5d6bed | 595 | int parent_slot; |
8d7be552 CM |
596 | int slot; |
597 | struct btrfs_key cpukey; | |
5f39d397 | 598 | u32 nritems = btrfs_header_nritems(node); |
aa5d6bed CM |
599 | |
600 | if (path->nodes[level + 1]) | |
5f39d397 | 601 | parent = path->nodes[level + 1]; |
a1f39630 | 602 | |
8d7be552 | 603 | slot = path->slots[level]; |
7518a238 CM |
604 | BUG_ON(nritems == 0); |
605 | if (parent) { | |
a1f39630 | 606 | parent_slot = path->slots[level + 1]; |
5f39d397 CM |
607 | btrfs_node_key(parent, &parent_key, parent_slot); |
608 | btrfs_node_key(node, &node_key, 0); | |
609 | BUG_ON(memcmp(&parent_key, &node_key, | |
e2fa7227 | 610 | sizeof(struct btrfs_disk_key))); |
1d4f8a0c | 611 | BUG_ON(btrfs_node_blockptr(parent, parent_slot) != |
db94535d | 612 | btrfs_header_bytenr(node)); |
aa5d6bed | 613 | } |
123abc88 | 614 | BUG_ON(nritems > BTRFS_NODEPTRS_PER_BLOCK(root)); |
8d7be552 | 615 | if (slot != 0) { |
5f39d397 CM |
616 | btrfs_node_key_to_cpu(node, &cpukey, slot - 1); |
617 | btrfs_node_key(node, &node_key, slot); | |
618 | BUG_ON(comp_keys(&node_key, &cpukey) <= 0); | |
8d7be552 CM |
619 | } |
620 | if (slot < nritems - 1) { | |
5f39d397 CM |
621 | btrfs_node_key_to_cpu(node, &cpukey, slot + 1); |
622 | btrfs_node_key(node, &node_key, slot); | |
623 | BUG_ON(comp_keys(&node_key, &cpukey) >= 0); | |
aa5d6bed CM |
624 | } |
625 | return 0; | |
626 | } | |
627 | ||
d352ac68 CM |
628 | /* |
629 | * extra checking to make sure all the items in a leaf are | |
630 | * well formed and in the proper order | |
631 | */ | |
123abc88 CM |
632 | static int check_leaf(struct btrfs_root *root, struct btrfs_path *path, |
633 | int level) | |
aa5d6bed | 634 | { |
5f39d397 CM |
635 | struct extent_buffer *leaf = path->nodes[level]; |
636 | struct extent_buffer *parent = NULL; | |
aa5d6bed | 637 | int parent_slot; |
8d7be552 | 638 | struct btrfs_key cpukey; |
5f39d397 CM |
639 | struct btrfs_disk_key parent_key; |
640 | struct btrfs_disk_key leaf_key; | |
641 | int slot = path->slots[0]; | |
8d7be552 | 642 | |
5f39d397 | 643 | u32 nritems = btrfs_header_nritems(leaf); |
aa5d6bed CM |
644 | |
645 | if (path->nodes[level + 1]) | |
5f39d397 | 646 | parent = path->nodes[level + 1]; |
7518a238 CM |
647 | |
648 | if (nritems == 0) | |
649 | return 0; | |
650 | ||
651 | if (parent) { | |
a1f39630 | 652 | parent_slot = path->slots[level + 1]; |
5f39d397 CM |
653 | btrfs_node_key(parent, &parent_key, parent_slot); |
654 | btrfs_item_key(leaf, &leaf_key, 0); | |
6702ed49 | 655 | |
5f39d397 | 656 | BUG_ON(memcmp(&parent_key, &leaf_key, |
e2fa7227 | 657 | sizeof(struct btrfs_disk_key))); |
1d4f8a0c | 658 | BUG_ON(btrfs_node_blockptr(parent, parent_slot) != |
db94535d | 659 | btrfs_header_bytenr(leaf)); |
5f39d397 CM |
660 | } |
661 | #if 0 | |
662 | for (i = 0; nritems > 1 && i < nritems - 2; i++) { | |
663 | btrfs_item_key_to_cpu(leaf, &cpukey, i + 1); | |
664 | btrfs_item_key(leaf, &leaf_key, i); | |
665 | if (comp_keys(&leaf_key, &cpukey) >= 0) { | |
666 | btrfs_print_leaf(root, leaf); | |
667 | printk("slot %d offset bad key\n", i); | |
668 | BUG_ON(1); | |
669 | } | |
670 | if (btrfs_item_offset_nr(leaf, i) != | |
671 | btrfs_item_end_nr(leaf, i + 1)) { | |
672 | btrfs_print_leaf(root, leaf); | |
673 | printk("slot %d offset bad\n", i); | |
674 | BUG_ON(1); | |
675 | } | |
676 | if (i == 0) { | |
677 | if (btrfs_item_offset_nr(leaf, i) + | |
678 | btrfs_item_size_nr(leaf, i) != | |
679 | BTRFS_LEAF_DATA_SIZE(root)) { | |
680 | btrfs_print_leaf(root, leaf); | |
681 | printk("slot %d first offset bad\n", i); | |
682 | BUG_ON(1); | |
683 | } | |
684 | } | |
aa5d6bed | 685 | } |
5f39d397 CM |
686 | if (nritems > 0) { |
687 | if (btrfs_item_size_nr(leaf, nritems - 1) > 4096) { | |
688 | btrfs_print_leaf(root, leaf); | |
689 | printk("slot %d bad size \n", nritems - 1); | |
690 | BUG_ON(1); | |
691 | } | |
692 | } | |
693 | #endif | |
694 | if (slot != 0 && slot < nritems - 1) { | |
695 | btrfs_item_key(leaf, &leaf_key, slot); | |
696 | btrfs_item_key_to_cpu(leaf, &cpukey, slot - 1); | |
697 | if (comp_keys(&leaf_key, &cpukey) <= 0) { | |
698 | btrfs_print_leaf(root, leaf); | |
699 | printk("slot %d offset bad key\n", slot); | |
700 | BUG_ON(1); | |
701 | } | |
702 | if (btrfs_item_offset_nr(leaf, slot - 1) != | |
703 | btrfs_item_end_nr(leaf, slot)) { | |
704 | btrfs_print_leaf(root, leaf); | |
705 | printk("slot %d offset bad\n", slot); | |
706 | BUG_ON(1); | |
707 | } | |
8d7be552 CM |
708 | } |
709 | if (slot < nritems - 1) { | |
5f39d397 CM |
710 | btrfs_item_key(leaf, &leaf_key, slot); |
711 | btrfs_item_key_to_cpu(leaf, &cpukey, slot + 1); | |
712 | BUG_ON(comp_keys(&leaf_key, &cpukey) >= 0); | |
713 | if (btrfs_item_offset_nr(leaf, slot) != | |
714 | btrfs_item_end_nr(leaf, slot + 1)) { | |
715 | btrfs_print_leaf(root, leaf); | |
716 | printk("slot %d offset bad\n", slot); | |
717 | BUG_ON(1); | |
718 | } | |
aa5d6bed | 719 | } |
5f39d397 CM |
720 | BUG_ON(btrfs_item_offset_nr(leaf, 0) + |
721 | btrfs_item_size_nr(leaf, 0) != BTRFS_LEAF_DATA_SIZE(root)); | |
aa5d6bed CM |
722 | return 0; |
723 | } | |
724 | ||
98ed5174 CM |
725 | static int noinline check_block(struct btrfs_root *root, |
726 | struct btrfs_path *path, int level) | |
aa5d6bed | 727 | { |
f188591e | 728 | u64 found_start; |
85d824c4 | 729 | return 0; |
f188591e CM |
730 | if (btrfs_header_level(path->nodes[level]) != level) |
731 | printk("warning: bad level %Lu wanted %d found %d\n", | |
732 | path->nodes[level]->start, level, | |
733 | btrfs_header_level(path->nodes[level])); | |
734 | found_start = btrfs_header_bytenr(path->nodes[level]); | |
735 | if (found_start != path->nodes[level]->start) { | |
736 | printk("warning: bad bytentr %Lu found %Lu\n", | |
737 | path->nodes[level]->start, found_start); | |
738 | } | |
db94535d | 739 | #if 0 |
5f39d397 | 740 | struct extent_buffer *buf = path->nodes[level]; |
5f39d397 | 741 | |
479965d6 CM |
742 | if (memcmp_extent_buffer(buf, root->fs_info->fsid, |
743 | (unsigned long)btrfs_header_fsid(buf), | |
744 | BTRFS_FSID_SIZE)) { | |
5f39d397 | 745 | printk("warning bad block %Lu\n", buf->start); |
db94535d | 746 | return 1; |
5f39d397 | 747 | } |
db94535d | 748 | #endif |
aa5d6bed | 749 | if (level == 0) |
123abc88 CM |
750 | return check_leaf(root, path, level); |
751 | return check_node(root, path, level); | |
aa5d6bed CM |
752 | } |
753 | ||
74123bd7 | 754 | /* |
5f39d397 CM |
755 | * search for key in the extent_buffer. The items start at offset p, |
756 | * and they are item_size apart. There are 'max' items in p. | |
757 | * | |
74123bd7 CM |
758 | * the slot in the array is returned via slot, and it points to |
759 | * the place where you would insert key if it is not found in | |
760 | * the array. | |
761 | * | |
762 | * slot may point to max if the key is bigger than all of the keys | |
763 | */ | |
e02119d5 CM |
764 | static noinline int generic_bin_search(struct extent_buffer *eb, |
765 | unsigned long p, | |
766 | int item_size, struct btrfs_key *key, | |
767 | int max, int *slot) | |
be0e5c09 CM |
768 | { |
769 | int low = 0; | |
770 | int high = max; | |
771 | int mid; | |
772 | int ret; | |
479965d6 | 773 | struct btrfs_disk_key *tmp = NULL; |
5f39d397 CM |
774 | struct btrfs_disk_key unaligned; |
775 | unsigned long offset; | |
776 | char *map_token = NULL; | |
777 | char *kaddr = NULL; | |
778 | unsigned long map_start = 0; | |
779 | unsigned long map_len = 0; | |
479965d6 | 780 | int err; |
be0e5c09 CM |
781 | |
782 | while(low < high) { | |
783 | mid = (low + high) / 2; | |
5f39d397 CM |
784 | offset = p + mid * item_size; |
785 | ||
786 | if (!map_token || offset < map_start || | |
787 | (offset + sizeof(struct btrfs_disk_key)) > | |
788 | map_start + map_len) { | |
479965d6 | 789 | if (map_token) { |
5f39d397 | 790 | unmap_extent_buffer(eb, map_token, KM_USER0); |
479965d6 CM |
791 | map_token = NULL; |
792 | } | |
793 | err = map_extent_buffer(eb, offset, | |
794 | sizeof(struct btrfs_disk_key), | |
795 | &map_token, &kaddr, | |
796 | &map_start, &map_len, KM_USER0); | |
797 | ||
798 | if (!err) { | |
799 | tmp = (struct btrfs_disk_key *)(kaddr + offset - | |
800 | map_start); | |
801 | } else { | |
802 | read_extent_buffer(eb, &unaligned, | |
803 | offset, sizeof(unaligned)); | |
804 | tmp = &unaligned; | |
805 | } | |
5f39d397 | 806 | |
5f39d397 CM |
807 | } else { |
808 | tmp = (struct btrfs_disk_key *)(kaddr + offset - | |
809 | map_start); | |
810 | } | |
be0e5c09 CM |
811 | ret = comp_keys(tmp, key); |
812 | ||
813 | if (ret < 0) | |
814 | low = mid + 1; | |
815 | else if (ret > 0) | |
816 | high = mid; | |
817 | else { | |
818 | *slot = mid; | |
479965d6 CM |
819 | if (map_token) |
820 | unmap_extent_buffer(eb, map_token, KM_USER0); | |
be0e5c09 CM |
821 | return 0; |
822 | } | |
823 | } | |
824 | *slot = low; | |
5f39d397 CM |
825 | if (map_token) |
826 | unmap_extent_buffer(eb, map_token, KM_USER0); | |
be0e5c09 CM |
827 | return 1; |
828 | } | |
829 | ||
97571fd0 CM |
830 | /* |
831 | * simple bin_search frontend that does the right thing for | |
832 | * leaves vs nodes | |
833 | */ | |
5f39d397 CM |
834 | static int bin_search(struct extent_buffer *eb, struct btrfs_key *key, |
835 | int level, int *slot) | |
be0e5c09 | 836 | { |
5f39d397 CM |
837 | if (level == 0) { |
838 | return generic_bin_search(eb, | |
839 | offsetof(struct btrfs_leaf, items), | |
0783fcfc | 840 | sizeof(struct btrfs_item), |
5f39d397 | 841 | key, btrfs_header_nritems(eb), |
7518a238 | 842 | slot); |
be0e5c09 | 843 | } else { |
5f39d397 CM |
844 | return generic_bin_search(eb, |
845 | offsetof(struct btrfs_node, ptrs), | |
123abc88 | 846 | sizeof(struct btrfs_key_ptr), |
5f39d397 | 847 | key, btrfs_header_nritems(eb), |
7518a238 | 848 | slot); |
be0e5c09 CM |
849 | } |
850 | return -1; | |
851 | } | |
852 | ||
d352ac68 CM |
853 | /* given a node and slot number, this reads the blocks it points to. The |
854 | * extent buffer is returned with a reference taken (but unlocked). | |
855 | * NULL is returned on error. | |
856 | */ | |
e02119d5 | 857 | static noinline struct extent_buffer *read_node_slot(struct btrfs_root *root, |
5f39d397 | 858 | struct extent_buffer *parent, int slot) |
bb803951 | 859 | { |
ca7a79ad | 860 | int level = btrfs_header_level(parent); |
bb803951 CM |
861 | if (slot < 0) |
862 | return NULL; | |
5f39d397 | 863 | if (slot >= btrfs_header_nritems(parent)) |
bb803951 | 864 | return NULL; |
ca7a79ad CM |
865 | |
866 | BUG_ON(level == 0); | |
867 | ||
db94535d | 868 | return read_tree_block(root, btrfs_node_blockptr(parent, slot), |
ca7a79ad CM |
869 | btrfs_level_size(root, level - 1), |
870 | btrfs_node_ptr_generation(parent, slot)); | |
bb803951 CM |
871 | } |
872 | ||
d352ac68 CM |
873 | /* |
874 | * node level balancing, used to make sure nodes are in proper order for | |
875 | * item deletion. We balance from the top down, so we have to make sure | |
876 | * that a deletion won't leave an node completely empty later on. | |
877 | */ | |
e02119d5 | 878 | static noinline int balance_level(struct btrfs_trans_handle *trans, |
98ed5174 CM |
879 | struct btrfs_root *root, |
880 | struct btrfs_path *path, int level) | |
bb803951 | 881 | { |
5f39d397 CM |
882 | struct extent_buffer *right = NULL; |
883 | struct extent_buffer *mid; | |
884 | struct extent_buffer *left = NULL; | |
885 | struct extent_buffer *parent = NULL; | |
bb803951 CM |
886 | int ret = 0; |
887 | int wret; | |
888 | int pslot; | |
bb803951 | 889 | int orig_slot = path->slots[level]; |
54aa1f4d | 890 | int err_on_enospc = 0; |
79f95c82 | 891 | u64 orig_ptr; |
bb803951 CM |
892 | |
893 | if (level == 0) | |
894 | return 0; | |
895 | ||
5f39d397 | 896 | mid = path->nodes[level]; |
925baedd | 897 | WARN_ON(!path->locks[level]); |
7bb86316 CM |
898 | WARN_ON(btrfs_header_generation(mid) != trans->transid); |
899 | ||
1d4f8a0c | 900 | orig_ptr = btrfs_node_blockptr(mid, orig_slot); |
79f95c82 | 901 | |
234b63a0 | 902 | if (level < BTRFS_MAX_LEVEL - 1) |
5f39d397 | 903 | parent = path->nodes[level + 1]; |
bb803951 CM |
904 | pslot = path->slots[level + 1]; |
905 | ||
40689478 CM |
906 | /* |
907 | * deal with the case where there is only one pointer in the root | |
908 | * by promoting the node below to a root | |
909 | */ | |
5f39d397 CM |
910 | if (!parent) { |
911 | struct extent_buffer *child; | |
bb803951 | 912 | |
5f39d397 | 913 | if (btrfs_header_nritems(mid) != 1) |
bb803951 CM |
914 | return 0; |
915 | ||
916 | /* promote the child to a root */ | |
5f39d397 | 917 | child = read_node_slot(root, mid, 0); |
925baedd | 918 | btrfs_tree_lock(child); |
bb803951 | 919 | BUG_ON(!child); |
65b51a00 | 920 | ret = btrfs_cow_block(trans, root, child, mid, 0, &child, 0); |
2f375ab9 Y |
921 | BUG_ON(ret); |
922 | ||
925baedd | 923 | spin_lock(&root->node_lock); |
bb803951 | 924 | root->node = child; |
925baedd CM |
925 | spin_unlock(&root->node_lock); |
926 | ||
31840ae1 ZY |
927 | ret = btrfs_update_extent_ref(trans, root, child->start, |
928 | mid->start, child->start, | |
929 | root->root_key.objectid, | |
930 | trans->transid, level - 1, 0); | |
931 | BUG_ON(ret); | |
932 | ||
0b86a832 | 933 | add_root_to_dirty_list(root); |
925baedd CM |
934 | btrfs_tree_unlock(child); |
935 | path->locks[level] = 0; | |
bb803951 | 936 | path->nodes[level] = NULL; |
5f39d397 | 937 | clean_tree_block(trans, root, mid); |
925baedd | 938 | btrfs_tree_unlock(mid); |
bb803951 | 939 | /* once for the path */ |
5f39d397 | 940 | free_extent_buffer(mid); |
7bb86316 | 941 | ret = btrfs_free_extent(trans, root, mid->start, mid->len, |
31840ae1 | 942 | mid->start, root->root_key.objectid, |
7bb86316 | 943 | btrfs_header_generation(mid), 0, 0, 1); |
bb803951 | 944 | /* once for the root ptr */ |
5f39d397 | 945 | free_extent_buffer(mid); |
db94535d | 946 | return ret; |
bb803951 | 947 | } |
5f39d397 | 948 | if (btrfs_header_nritems(mid) > |
123abc88 | 949 | BTRFS_NODEPTRS_PER_BLOCK(root) / 4) |
bb803951 CM |
950 | return 0; |
951 | ||
5f39d397 | 952 | if (btrfs_header_nritems(mid) < 2) |
54aa1f4d CM |
953 | err_on_enospc = 1; |
954 | ||
5f39d397 CM |
955 | left = read_node_slot(root, parent, pslot - 1); |
956 | if (left) { | |
925baedd | 957 | btrfs_tree_lock(left); |
5f39d397 | 958 | wret = btrfs_cow_block(trans, root, left, |
65b51a00 | 959 | parent, pslot - 1, &left, 0); |
54aa1f4d CM |
960 | if (wret) { |
961 | ret = wret; | |
962 | goto enospc; | |
963 | } | |
2cc58cf2 | 964 | } |
5f39d397 CM |
965 | right = read_node_slot(root, parent, pslot + 1); |
966 | if (right) { | |
925baedd | 967 | btrfs_tree_lock(right); |
5f39d397 | 968 | wret = btrfs_cow_block(trans, root, right, |
65b51a00 | 969 | parent, pslot + 1, &right, 0); |
2cc58cf2 CM |
970 | if (wret) { |
971 | ret = wret; | |
972 | goto enospc; | |
973 | } | |
974 | } | |
975 | ||
976 | /* first, try to make some room in the middle buffer */ | |
5f39d397 CM |
977 | if (left) { |
978 | orig_slot += btrfs_header_nritems(left); | |
bce4eae9 | 979 | wret = push_node_left(trans, root, left, mid, 1); |
79f95c82 CM |
980 | if (wret < 0) |
981 | ret = wret; | |
5f39d397 | 982 | if (btrfs_header_nritems(mid) < 2) |
54aa1f4d | 983 | err_on_enospc = 1; |
bb803951 | 984 | } |
79f95c82 CM |
985 | |
986 | /* | |
987 | * then try to empty the right most buffer into the middle | |
988 | */ | |
5f39d397 | 989 | if (right) { |
971a1f66 | 990 | wret = push_node_left(trans, root, mid, right, 1); |
54aa1f4d | 991 | if (wret < 0 && wret != -ENOSPC) |
79f95c82 | 992 | ret = wret; |
5f39d397 | 993 | if (btrfs_header_nritems(right) == 0) { |
db94535d | 994 | u64 bytenr = right->start; |
7bb86316 | 995 | u64 generation = btrfs_header_generation(parent); |
db94535d CM |
996 | u32 blocksize = right->len; |
997 | ||
5f39d397 | 998 | clean_tree_block(trans, root, right); |
925baedd | 999 | btrfs_tree_unlock(right); |
5f39d397 | 1000 | free_extent_buffer(right); |
bb803951 | 1001 | right = NULL; |
e089f05c CM |
1002 | wret = del_ptr(trans, root, path, level + 1, pslot + |
1003 | 1); | |
bb803951 CM |
1004 | if (wret) |
1005 | ret = wret; | |
db94535d | 1006 | wret = btrfs_free_extent(trans, root, bytenr, |
31840ae1 | 1007 | blocksize, parent->start, |
7bb86316 CM |
1008 | btrfs_header_owner(parent), |
1009 | generation, 0, 0, 1); | |
bb803951 CM |
1010 | if (wret) |
1011 | ret = wret; | |
1012 | } else { | |
5f39d397 CM |
1013 | struct btrfs_disk_key right_key; |
1014 | btrfs_node_key(right, &right_key, 0); | |
1015 | btrfs_set_node_key(parent, &right_key, pslot + 1); | |
1016 | btrfs_mark_buffer_dirty(parent); | |
bb803951 CM |
1017 | } |
1018 | } | |
5f39d397 | 1019 | if (btrfs_header_nritems(mid) == 1) { |
79f95c82 CM |
1020 | /* |
1021 | * we're not allowed to leave a node with one item in the | |
1022 | * tree during a delete. A deletion from lower in the tree | |
1023 | * could try to delete the only pointer in this node. | |
1024 | * So, pull some keys from the left. | |
1025 | * There has to be a left pointer at this point because | |
1026 | * otherwise we would have pulled some pointers from the | |
1027 | * right | |
1028 | */ | |
5f39d397 CM |
1029 | BUG_ON(!left); |
1030 | wret = balance_node_right(trans, root, mid, left); | |
54aa1f4d | 1031 | if (wret < 0) { |
79f95c82 | 1032 | ret = wret; |
54aa1f4d CM |
1033 | goto enospc; |
1034 | } | |
bce4eae9 CM |
1035 | if (wret == 1) { |
1036 | wret = push_node_left(trans, root, left, mid, 1); | |
1037 | if (wret < 0) | |
1038 | ret = wret; | |
1039 | } | |
79f95c82 CM |
1040 | BUG_ON(wret == 1); |
1041 | } | |
5f39d397 | 1042 | if (btrfs_header_nritems(mid) == 0) { |
79f95c82 | 1043 | /* we've managed to empty the middle node, drop it */ |
7bb86316 | 1044 | u64 root_gen = btrfs_header_generation(parent); |
db94535d CM |
1045 | u64 bytenr = mid->start; |
1046 | u32 blocksize = mid->len; | |
925baedd | 1047 | |
5f39d397 | 1048 | clean_tree_block(trans, root, mid); |
925baedd | 1049 | btrfs_tree_unlock(mid); |
5f39d397 | 1050 | free_extent_buffer(mid); |
bb803951 | 1051 | mid = NULL; |
e089f05c | 1052 | wret = del_ptr(trans, root, path, level + 1, pslot); |
bb803951 CM |
1053 | if (wret) |
1054 | ret = wret; | |
7bb86316 | 1055 | wret = btrfs_free_extent(trans, root, bytenr, blocksize, |
31840ae1 | 1056 | parent->start, |
7bb86316 CM |
1057 | btrfs_header_owner(parent), |
1058 | root_gen, 0, 0, 1); | |
bb803951 CM |
1059 | if (wret) |
1060 | ret = wret; | |
79f95c82 CM |
1061 | } else { |
1062 | /* update the parent key to reflect our changes */ | |
5f39d397 CM |
1063 | struct btrfs_disk_key mid_key; |
1064 | btrfs_node_key(mid, &mid_key, 0); | |
1065 | btrfs_set_node_key(parent, &mid_key, pslot); | |
1066 | btrfs_mark_buffer_dirty(parent); | |
79f95c82 | 1067 | } |
bb803951 | 1068 | |
79f95c82 | 1069 | /* update the path */ |
5f39d397 CM |
1070 | if (left) { |
1071 | if (btrfs_header_nritems(left) > orig_slot) { | |
1072 | extent_buffer_get(left); | |
925baedd | 1073 | /* left was locked after cow */ |
5f39d397 | 1074 | path->nodes[level] = left; |
bb803951 CM |
1075 | path->slots[level + 1] -= 1; |
1076 | path->slots[level] = orig_slot; | |
925baedd CM |
1077 | if (mid) { |
1078 | btrfs_tree_unlock(mid); | |
5f39d397 | 1079 | free_extent_buffer(mid); |
925baedd | 1080 | } |
bb803951 | 1081 | } else { |
5f39d397 | 1082 | orig_slot -= btrfs_header_nritems(left); |
bb803951 CM |
1083 | path->slots[level] = orig_slot; |
1084 | } | |
1085 | } | |
79f95c82 | 1086 | /* double check we haven't messed things up */ |
123abc88 | 1087 | check_block(root, path, level); |
e20d96d6 | 1088 | if (orig_ptr != |
5f39d397 | 1089 | btrfs_node_blockptr(path->nodes[level], path->slots[level])) |
79f95c82 | 1090 | BUG(); |
54aa1f4d | 1091 | enospc: |
925baedd CM |
1092 | if (right) { |
1093 | btrfs_tree_unlock(right); | |
5f39d397 | 1094 | free_extent_buffer(right); |
925baedd CM |
1095 | } |
1096 | if (left) { | |
1097 | if (path->nodes[level] != left) | |
1098 | btrfs_tree_unlock(left); | |
5f39d397 | 1099 | free_extent_buffer(left); |
925baedd | 1100 | } |
bb803951 CM |
1101 | return ret; |
1102 | } | |
1103 | ||
d352ac68 CM |
1104 | /* Node balancing for insertion. Here we only split or push nodes around |
1105 | * when they are completely full. This is also done top down, so we | |
1106 | * have to be pessimistic. | |
1107 | */ | |
98ed5174 CM |
1108 | static int noinline push_nodes_for_insert(struct btrfs_trans_handle *trans, |
1109 | struct btrfs_root *root, | |
1110 | struct btrfs_path *path, int level) | |
e66f709b | 1111 | { |
5f39d397 CM |
1112 | struct extent_buffer *right = NULL; |
1113 | struct extent_buffer *mid; | |
1114 | struct extent_buffer *left = NULL; | |
1115 | struct extent_buffer *parent = NULL; | |
e66f709b CM |
1116 | int ret = 0; |
1117 | int wret; | |
1118 | int pslot; | |
1119 | int orig_slot = path->slots[level]; | |
1120 | u64 orig_ptr; | |
1121 | ||
1122 | if (level == 0) | |
1123 | return 1; | |
1124 | ||
5f39d397 | 1125 | mid = path->nodes[level]; |
7bb86316 | 1126 | WARN_ON(btrfs_header_generation(mid) != trans->transid); |
e66f709b CM |
1127 | orig_ptr = btrfs_node_blockptr(mid, orig_slot); |
1128 | ||
1129 | if (level < BTRFS_MAX_LEVEL - 1) | |
5f39d397 | 1130 | parent = path->nodes[level + 1]; |
e66f709b CM |
1131 | pslot = path->slots[level + 1]; |
1132 | ||
5f39d397 | 1133 | if (!parent) |
e66f709b | 1134 | return 1; |
e66f709b | 1135 | |
5f39d397 | 1136 | left = read_node_slot(root, parent, pslot - 1); |
e66f709b CM |
1137 | |
1138 | /* first, try to make some room in the middle buffer */ | |
5f39d397 | 1139 | if (left) { |
e66f709b | 1140 | u32 left_nr; |
925baedd CM |
1141 | |
1142 | btrfs_tree_lock(left); | |
5f39d397 | 1143 | left_nr = btrfs_header_nritems(left); |
33ade1f8 CM |
1144 | if (left_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { |
1145 | wret = 1; | |
1146 | } else { | |
5f39d397 | 1147 | ret = btrfs_cow_block(trans, root, left, parent, |
65b51a00 | 1148 | pslot - 1, &left, 0); |
54aa1f4d CM |
1149 | if (ret) |
1150 | wret = 1; | |
1151 | else { | |
54aa1f4d | 1152 | wret = push_node_left(trans, root, |
971a1f66 | 1153 | left, mid, 0); |
54aa1f4d | 1154 | } |
33ade1f8 | 1155 | } |
e66f709b CM |
1156 | if (wret < 0) |
1157 | ret = wret; | |
1158 | if (wret == 0) { | |
5f39d397 | 1159 | struct btrfs_disk_key disk_key; |
e66f709b | 1160 | orig_slot += left_nr; |
5f39d397 CM |
1161 | btrfs_node_key(mid, &disk_key, 0); |
1162 | btrfs_set_node_key(parent, &disk_key, pslot); | |
1163 | btrfs_mark_buffer_dirty(parent); | |
1164 | if (btrfs_header_nritems(left) > orig_slot) { | |
1165 | path->nodes[level] = left; | |
e66f709b CM |
1166 | path->slots[level + 1] -= 1; |
1167 | path->slots[level] = orig_slot; | |
925baedd | 1168 | btrfs_tree_unlock(mid); |
5f39d397 | 1169 | free_extent_buffer(mid); |
e66f709b CM |
1170 | } else { |
1171 | orig_slot -= | |
5f39d397 | 1172 | btrfs_header_nritems(left); |
e66f709b | 1173 | path->slots[level] = orig_slot; |
925baedd | 1174 | btrfs_tree_unlock(left); |
5f39d397 | 1175 | free_extent_buffer(left); |
e66f709b | 1176 | } |
e66f709b CM |
1177 | return 0; |
1178 | } | |
925baedd | 1179 | btrfs_tree_unlock(left); |
5f39d397 | 1180 | free_extent_buffer(left); |
e66f709b | 1181 | } |
925baedd | 1182 | right = read_node_slot(root, parent, pslot + 1); |
e66f709b CM |
1183 | |
1184 | /* | |
1185 | * then try to empty the right most buffer into the middle | |
1186 | */ | |
5f39d397 | 1187 | if (right) { |
33ade1f8 | 1188 | u32 right_nr; |
925baedd | 1189 | btrfs_tree_lock(right); |
5f39d397 | 1190 | right_nr = btrfs_header_nritems(right); |
33ade1f8 CM |
1191 | if (right_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) { |
1192 | wret = 1; | |
1193 | } else { | |
5f39d397 CM |
1194 | ret = btrfs_cow_block(trans, root, right, |
1195 | parent, pslot + 1, | |
65b51a00 | 1196 | &right, 0); |
54aa1f4d CM |
1197 | if (ret) |
1198 | wret = 1; | |
1199 | else { | |
54aa1f4d | 1200 | wret = balance_node_right(trans, root, |
5f39d397 | 1201 | right, mid); |
54aa1f4d | 1202 | } |
33ade1f8 | 1203 | } |
e66f709b CM |
1204 | if (wret < 0) |
1205 | ret = wret; | |
1206 | if (wret == 0) { | |
5f39d397 CM |
1207 | struct btrfs_disk_key disk_key; |
1208 | ||
1209 | btrfs_node_key(right, &disk_key, 0); | |
1210 | btrfs_set_node_key(parent, &disk_key, pslot + 1); | |
1211 | btrfs_mark_buffer_dirty(parent); | |
1212 | ||
1213 | if (btrfs_header_nritems(mid) <= orig_slot) { | |
1214 | path->nodes[level] = right; | |
e66f709b CM |
1215 | path->slots[level + 1] += 1; |
1216 | path->slots[level] = orig_slot - | |
5f39d397 | 1217 | btrfs_header_nritems(mid); |
925baedd | 1218 | btrfs_tree_unlock(mid); |
5f39d397 | 1219 | free_extent_buffer(mid); |
e66f709b | 1220 | } else { |
925baedd | 1221 | btrfs_tree_unlock(right); |
5f39d397 | 1222 | free_extent_buffer(right); |
e66f709b | 1223 | } |
e66f709b CM |
1224 | return 0; |
1225 | } | |
925baedd | 1226 | btrfs_tree_unlock(right); |
5f39d397 | 1227 | free_extent_buffer(right); |
e66f709b | 1228 | } |
e66f709b CM |
1229 | return 1; |
1230 | } | |
1231 | ||
3c69faec | 1232 | /* |
d352ac68 CM |
1233 | * readahead one full node of leaves, finding things that are close |
1234 | * to the block in 'slot', and triggering ra on them. | |
3c69faec | 1235 | */ |
e02119d5 CM |
1236 | static noinline void reada_for_search(struct btrfs_root *root, |
1237 | struct btrfs_path *path, | |
1238 | int level, int slot, u64 objectid) | |
3c69faec | 1239 | { |
5f39d397 | 1240 | struct extent_buffer *node; |
01f46658 | 1241 | struct btrfs_disk_key disk_key; |
3c69faec | 1242 | u32 nritems; |
3c69faec | 1243 | u64 search; |
6b80053d CM |
1244 | u64 lowest_read; |
1245 | u64 highest_read; | |
1246 | u64 nread = 0; | |
3c69faec | 1247 | int direction = path->reada; |
5f39d397 | 1248 | struct extent_buffer *eb; |
6b80053d CM |
1249 | u32 nr; |
1250 | u32 blocksize; | |
1251 | u32 nscan = 0; | |
db94535d | 1252 | |
a6b6e75e | 1253 | if (level != 1) |
6702ed49 CM |
1254 | return; |
1255 | ||
1256 | if (!path->nodes[level]) | |
3c69faec CM |
1257 | return; |
1258 | ||
5f39d397 | 1259 | node = path->nodes[level]; |
925baedd | 1260 | |
3c69faec | 1261 | search = btrfs_node_blockptr(node, slot); |
6b80053d CM |
1262 | blocksize = btrfs_level_size(root, level - 1); |
1263 | eb = btrfs_find_tree_block(root, search, blocksize); | |
5f39d397 CM |
1264 | if (eb) { |
1265 | free_extent_buffer(eb); | |
3c69faec CM |
1266 | return; |
1267 | } | |
1268 | ||
6b80053d CM |
1269 | highest_read = search; |
1270 | lowest_read = search; | |
1271 | ||
5f39d397 | 1272 | nritems = btrfs_header_nritems(node); |
6b80053d | 1273 | nr = slot; |
3c69faec | 1274 | while(1) { |
6b80053d CM |
1275 | if (direction < 0) { |
1276 | if (nr == 0) | |
1277 | break; | |
1278 | nr--; | |
1279 | } else if (direction > 0) { | |
1280 | nr++; | |
1281 | if (nr >= nritems) | |
1282 | break; | |
3c69faec | 1283 | } |
01f46658 CM |
1284 | if (path->reada < 0 && objectid) { |
1285 | btrfs_node_key(node, &disk_key, nr); | |
1286 | if (btrfs_disk_key_objectid(&disk_key) != objectid) | |
1287 | break; | |
1288 | } | |
6b80053d CM |
1289 | search = btrfs_node_blockptr(node, nr); |
1290 | if ((search >= lowest_read && search <= highest_read) || | |
1291 | (search < lowest_read && lowest_read - search <= 32768) || | |
1292 | (search > highest_read && search - highest_read <= 32768)) { | |
ca7a79ad CM |
1293 | readahead_tree_block(root, search, blocksize, |
1294 | btrfs_node_ptr_generation(node, nr)); | |
6b80053d CM |
1295 | nread += blocksize; |
1296 | } | |
1297 | nscan++; | |
1298 | if (path->reada < 2 && (nread > (256 * 1024) || nscan > 32)) | |
1299 | break; | |
1300 | if(nread > (1024 * 1024) || nscan > 128) | |
1301 | break; | |
1302 | ||
1303 | if (search < lowest_read) | |
1304 | lowest_read = search; | |
1305 | if (search > highest_read) | |
1306 | highest_read = search; | |
3c69faec CM |
1307 | } |
1308 | } | |
925baedd | 1309 | |
d352ac68 CM |
1310 | /* |
1311 | * when we walk down the tree, it is usually safe to unlock the higher layers in | |
1312 | * the tree. The exceptions are when our path goes through slot 0, because operations | |
1313 | * on the tree might require changing key pointers higher up in the tree. | |
1314 | * | |
1315 | * callers might also have set path->keep_locks, which tells this code to | |
1316 | * keep the lock if the path points to the last slot in the block. This is | |
1317 | * part of walking through the tree, and selecting the next slot in the higher | |
1318 | * block. | |
1319 | * | |
1320 | * lowest_unlock sets the lowest level in the tree we're allowed to unlock. | |
1321 | * so if lowest_unlock is 1, level 0 won't be unlocked | |
1322 | */ | |
e02119d5 CM |
1323 | static noinline void unlock_up(struct btrfs_path *path, int level, |
1324 | int lowest_unlock) | |
925baedd CM |
1325 | { |
1326 | int i; | |
1327 | int skip_level = level; | |
051e1b9f | 1328 | int no_skips = 0; |
925baedd CM |
1329 | struct extent_buffer *t; |
1330 | ||
1331 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { | |
1332 | if (!path->nodes[i]) | |
1333 | break; | |
1334 | if (!path->locks[i]) | |
1335 | break; | |
051e1b9f | 1336 | if (!no_skips && path->slots[i] == 0) { |
925baedd CM |
1337 | skip_level = i + 1; |
1338 | continue; | |
1339 | } | |
051e1b9f | 1340 | if (!no_skips && path->keep_locks) { |
925baedd CM |
1341 | u32 nritems; |
1342 | t = path->nodes[i]; | |
1343 | nritems = btrfs_header_nritems(t); | |
051e1b9f | 1344 | if (nritems < 1 || path->slots[i] >= nritems - 1) { |
925baedd CM |
1345 | skip_level = i + 1; |
1346 | continue; | |
1347 | } | |
1348 | } | |
051e1b9f CM |
1349 | if (skip_level < i && i >= lowest_unlock) |
1350 | no_skips = 1; | |
1351 | ||
925baedd CM |
1352 | t = path->nodes[i]; |
1353 | if (i >= lowest_unlock && i > skip_level && path->locks[i]) { | |
1354 | btrfs_tree_unlock(t); | |
1355 | path->locks[i] = 0; | |
1356 | } | |
1357 | } | |
1358 | } | |
1359 | ||
74123bd7 CM |
1360 | /* |
1361 | * look for key in the tree. path is filled in with nodes along the way | |
1362 | * if key is found, we return zero and you can find the item in the leaf | |
1363 | * level of the path (level 0) | |
1364 | * | |
1365 | * If the key isn't found, the path points to the slot where it should | |
aa5d6bed CM |
1366 | * be inserted, and 1 is returned. If there are other errors during the |
1367 | * search a negative error number is returned. | |
97571fd0 CM |
1368 | * |
1369 | * if ins_len > 0, nodes and leaves will be split as we walk down the | |
1370 | * tree. if ins_len < 0, nodes will be merged as we walk down the tree (if | |
1371 | * possible) | |
74123bd7 | 1372 | */ |
e089f05c CM |
1373 | int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root |
1374 | *root, struct btrfs_key *key, struct btrfs_path *p, int | |
1375 | ins_len, int cow) | |
be0e5c09 | 1376 | { |
5f39d397 | 1377 | struct extent_buffer *b; |
051e1b9f | 1378 | struct extent_buffer *tmp; |
be0e5c09 CM |
1379 | int slot; |
1380 | int ret; | |
1381 | int level; | |
3c69faec | 1382 | int should_reada = p->reada; |
925baedd | 1383 | int lowest_unlock = 1; |
594a24eb | 1384 | int blocksize; |
9f3a7427 | 1385 | u8 lowest_level = 0; |
594a24eb CM |
1386 | u64 blocknr; |
1387 | u64 gen; | |
65b51a00 | 1388 | struct btrfs_key prealloc_block; |
9f3a7427 | 1389 | |
6702ed49 CM |
1390 | lowest_level = p->lowest_level; |
1391 | WARN_ON(lowest_level && ins_len); | |
22b0ebda | 1392 | WARN_ON(p->nodes[0] != NULL); |
333db94c | 1393 | WARN_ON(cow && root == root->fs_info->extent_root && |
925baedd | 1394 | !mutex_is_locked(&root->fs_info->alloc_mutex)); |
925baedd CM |
1395 | if (ins_len < 0) |
1396 | lowest_unlock = 2; | |
65b51a00 CM |
1397 | |
1398 | prealloc_block.objectid = 0; | |
1399 | ||
bb803951 | 1400 | again: |
5cd57b2c CM |
1401 | if (p->skip_locking) |
1402 | b = btrfs_root_node(root); | |
1403 | else | |
1404 | b = btrfs_lock_root_node(root); | |
925baedd | 1405 | |
eb60ceac | 1406 | while (b) { |
5f39d397 | 1407 | level = btrfs_header_level(b); |
65b51a00 CM |
1408 | |
1409 | /* | |
1410 | * setup the path here so we can release it under lock | |
1411 | * contention with the cow code | |
1412 | */ | |
1413 | p->nodes[level] = b; | |
1414 | if (!p->skip_locking) | |
1415 | p->locks[level] = 1; | |
1416 | ||
02217ed2 CM |
1417 | if (cow) { |
1418 | int wret; | |
65b51a00 CM |
1419 | |
1420 | /* is a cow on this block not required */ | |
1421 | spin_lock(&root->fs_info->hash_lock); | |
1422 | if (btrfs_header_generation(b) == trans->transid && | |
5b21f2ed | 1423 | btrfs_header_owner(b) == root->root_key.objectid && |
65b51a00 CM |
1424 | !btrfs_header_flag(b, BTRFS_HEADER_FLAG_WRITTEN)) { |
1425 | spin_unlock(&root->fs_info->hash_lock); | |
1426 | goto cow_done; | |
1427 | } | |
1428 | spin_unlock(&root->fs_info->hash_lock); | |
1429 | ||
1430 | /* ok, we have to cow, is our old prealloc the right | |
1431 | * size? | |
1432 | */ | |
1433 | if (prealloc_block.objectid && | |
1434 | prealloc_block.offset != b->len) { | |
1435 | btrfs_free_reserved_extent(root, | |
1436 | prealloc_block.objectid, | |
1437 | prealloc_block.offset); | |
1438 | prealloc_block.objectid = 0; | |
1439 | } | |
1440 | ||
1441 | /* | |
1442 | * for higher level blocks, try not to allocate blocks | |
1443 | * with the block and the parent locks held. | |
1444 | */ | |
1445 | if (level > 1 && !prealloc_block.objectid && | |
1446 | btrfs_path_lock_waiting(p, level)) { | |
1447 | u32 size = b->len; | |
1448 | u64 hint = b->start; | |
1449 | ||
1450 | btrfs_release_path(root, p); | |
1451 | ret = btrfs_reserve_extent(trans, root, | |
1452 | size, size, 0, | |
1453 | hint, (u64)-1, | |
1454 | &prealloc_block, 0); | |
1455 | BUG_ON(ret); | |
1456 | goto again; | |
1457 | } | |
1458 | ||
e20d96d6 CM |
1459 | wret = btrfs_cow_block(trans, root, b, |
1460 | p->nodes[level + 1], | |
1461 | p->slots[level + 1], | |
65b51a00 CM |
1462 | &b, prealloc_block.objectid); |
1463 | prealloc_block.objectid = 0; | |
54aa1f4d | 1464 | if (wret) { |
5f39d397 | 1465 | free_extent_buffer(b); |
65b51a00 CM |
1466 | ret = wret; |
1467 | goto done; | |
54aa1f4d | 1468 | } |
02217ed2 | 1469 | } |
65b51a00 | 1470 | cow_done: |
02217ed2 | 1471 | BUG_ON(!cow && ins_len); |
5f39d397 | 1472 | if (level != btrfs_header_level(b)) |
2c90e5d6 | 1473 | WARN_ON(1); |
5f39d397 | 1474 | level = btrfs_header_level(b); |
65b51a00 | 1475 | |
eb60ceac | 1476 | p->nodes[level] = b; |
5cd57b2c CM |
1477 | if (!p->skip_locking) |
1478 | p->locks[level] = 1; | |
65b51a00 | 1479 | |
123abc88 | 1480 | ret = check_block(root, p, level); |
65b51a00 CM |
1481 | if (ret) { |
1482 | ret = -1; | |
1483 | goto done; | |
1484 | } | |
925baedd | 1485 | |
5f39d397 CM |
1486 | ret = bin_search(b, key, level, &slot); |
1487 | if (level != 0) { | |
be0e5c09 CM |
1488 | if (ret && slot > 0) |
1489 | slot -= 1; | |
1490 | p->slots[level] = slot; | |
5f39d397 | 1491 | if (ins_len > 0 && btrfs_header_nritems(b) >= |
1514794e | 1492 | BTRFS_NODEPTRS_PER_BLOCK(root) - 3) { |
e089f05c | 1493 | int sret = split_node(trans, root, p, level); |
5c680ed6 | 1494 | BUG_ON(sret > 0); |
65b51a00 CM |
1495 | if (sret) { |
1496 | ret = sret; | |
1497 | goto done; | |
1498 | } | |
5c680ed6 | 1499 | b = p->nodes[level]; |
5c680ed6 | 1500 | slot = p->slots[level]; |
bb803951 | 1501 | } else if (ins_len < 0) { |
e089f05c CM |
1502 | int sret = balance_level(trans, root, p, |
1503 | level); | |
65b51a00 CM |
1504 | if (sret) { |
1505 | ret = sret; | |
1506 | goto done; | |
1507 | } | |
bb803951 | 1508 | b = p->nodes[level]; |
f510cfec CM |
1509 | if (!b) { |
1510 | btrfs_release_path(NULL, p); | |
bb803951 | 1511 | goto again; |
f510cfec | 1512 | } |
bb803951 | 1513 | slot = p->slots[level]; |
5f39d397 | 1514 | BUG_ON(btrfs_header_nritems(b) == 1); |
5c680ed6 | 1515 | } |
f9efa9c7 CM |
1516 | unlock_up(p, level, lowest_unlock); |
1517 | ||
9f3a7427 | 1518 | /* this is only true while dropping a snapshot */ |
925baedd | 1519 | if (level == lowest_level) { |
5b21f2ed ZY |
1520 | ret = 0; |
1521 | goto done; | |
925baedd | 1522 | } |
ca7a79ad | 1523 | |
594a24eb CM |
1524 | blocknr = btrfs_node_blockptr(b, slot); |
1525 | gen = btrfs_node_ptr_generation(b, slot); | |
1526 | blocksize = btrfs_level_size(root, level - 1); | |
1527 | ||
1528 | tmp = btrfs_find_tree_block(root, blocknr, blocksize); | |
1529 | if (tmp && btrfs_buffer_uptodate(tmp, gen)) { | |
051e1b9f CM |
1530 | b = tmp; |
1531 | } else { | |
1532 | /* | |
1533 | * reduce lock contention at high levels | |
1534 | * of the btree by dropping locks before | |
1535 | * we read. | |
1536 | */ | |
1537 | if (level > 1) { | |
1538 | btrfs_release_path(NULL, p); | |
594a24eb CM |
1539 | if (tmp) |
1540 | free_extent_buffer(tmp); | |
f9efa9c7 CM |
1541 | if (should_reada) |
1542 | reada_for_search(root, p, | |
1543 | level, slot, | |
1544 | key->objectid); | |
1545 | ||
594a24eb CM |
1546 | tmp = read_tree_block(root, blocknr, |
1547 | blocksize, gen); | |
051e1b9f CM |
1548 | if (tmp) |
1549 | free_extent_buffer(tmp); | |
1550 | goto again; | |
1551 | } else { | |
a74a4b97 CM |
1552 | if (tmp) |
1553 | free_extent_buffer(tmp); | |
f9efa9c7 CM |
1554 | if (should_reada) |
1555 | reada_for_search(root, p, | |
1556 | level, slot, | |
1557 | key->objectid); | |
051e1b9f CM |
1558 | b = read_node_slot(root, b, slot); |
1559 | } | |
1560 | } | |
5cd57b2c CM |
1561 | if (!p->skip_locking) |
1562 | btrfs_tree_lock(b); | |
be0e5c09 CM |
1563 | } else { |
1564 | p->slots[level] = slot; | |
5f39d397 | 1565 | if (ins_len > 0 && btrfs_leaf_free_space(root, b) < |
0783fcfc | 1566 | sizeof(struct btrfs_item) + ins_len) { |
d4dbff95 | 1567 | int sret = split_leaf(trans, root, key, |
cc0c5538 | 1568 | p, ins_len, ret == 0); |
5c680ed6 | 1569 | BUG_ON(sret > 0); |
65b51a00 CM |
1570 | if (sret) { |
1571 | ret = sret; | |
1572 | goto done; | |
1573 | } | |
5c680ed6 | 1574 | } |
925baedd | 1575 | unlock_up(p, level, lowest_unlock); |
65b51a00 | 1576 | goto done; |
be0e5c09 CM |
1577 | } |
1578 | } | |
65b51a00 CM |
1579 | ret = 1; |
1580 | done: | |
1581 | if (prealloc_block.objectid) { | |
1582 | btrfs_free_reserved_extent(root, | |
1583 | prealloc_block.objectid, | |
1584 | prealloc_block.offset); | |
1585 | } | |
1586 | ||
1587 | return ret; | |
be0e5c09 CM |
1588 | } |
1589 | ||
1a40e23b ZY |
1590 | int btrfs_merge_path(struct btrfs_trans_handle *trans, |
1591 | struct btrfs_root *root, | |
1592 | struct btrfs_key *node_keys, | |
1593 | u64 *nodes, int lowest_level) | |
1594 | { | |
1595 | struct extent_buffer *eb; | |
1596 | struct extent_buffer *parent; | |
1597 | struct btrfs_key key; | |
1598 | u64 bytenr; | |
1599 | u64 generation; | |
1600 | u32 blocksize; | |
1601 | int level; | |
1602 | int slot; | |
1603 | int key_match; | |
1604 | int ret; | |
1605 | ||
1606 | eb = btrfs_lock_root_node(root); | |
1607 | ret = btrfs_cow_block(trans, root, eb, NULL, 0, &eb, 0); | |
1608 | BUG_ON(ret); | |
1609 | ||
1610 | parent = eb; | |
1611 | while (1) { | |
1612 | level = btrfs_header_level(parent); | |
1613 | if (level == 0 || level <= lowest_level) | |
1614 | break; | |
1615 | ||
1616 | ret = bin_search(parent, &node_keys[lowest_level], level, | |
1617 | &slot); | |
1618 | if (ret && slot > 0) | |
1619 | slot--; | |
1620 | ||
1621 | bytenr = btrfs_node_blockptr(parent, slot); | |
1622 | if (nodes[level - 1] == bytenr) | |
1623 | break; | |
1624 | ||
1625 | blocksize = btrfs_level_size(root, level - 1); | |
1626 | generation = btrfs_node_ptr_generation(parent, slot); | |
1627 | btrfs_node_key_to_cpu(eb, &key, slot); | |
1628 | key_match = !memcmp(&key, &node_keys[level - 1], sizeof(key)); | |
1629 | ||
1630 | /* | |
1631 | * if node keys match and node pointer hasn't been modified | |
1632 | * in the running transaction, we can merge the path. for | |
1633 | * reloc trees, the node pointer check is skipped, this is | |
1634 | * because the reloc trees are fully controlled by the space | |
1635 | * balance code, no one else can modify them. | |
1636 | */ | |
1637 | if (!nodes[level - 1] || !key_match || | |
1638 | (generation == trans->transid && | |
1639 | root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID)) { | |
1640 | next_level: | |
1641 | if (level == 1 || level == lowest_level + 1) | |
1642 | break; | |
1643 | ||
1644 | eb = read_tree_block(root, bytenr, blocksize, | |
1645 | generation); | |
1646 | btrfs_tree_lock(eb); | |
1647 | ||
1648 | ret = btrfs_cow_block(trans, root, eb, parent, slot, | |
1649 | &eb, 0); | |
1650 | BUG_ON(ret); | |
1651 | ||
1652 | btrfs_tree_unlock(parent); | |
1653 | free_extent_buffer(parent); | |
1654 | parent = eb; | |
1655 | continue; | |
1656 | } | |
1657 | ||
1658 | if (generation == trans->transid) { | |
1659 | u32 refs; | |
1660 | BUG_ON(btrfs_header_owner(eb) != | |
1661 | BTRFS_TREE_RELOC_OBJECTID); | |
1662 | /* | |
1663 | * lock the block to keep __btrfs_cow_block from | |
1664 | * changing the reference count. | |
1665 | */ | |
1666 | eb = read_tree_block(root, bytenr, blocksize, | |
1667 | generation); | |
1668 | btrfs_tree_lock(eb); | |
1669 | ||
1670 | ret = btrfs_lookup_extent_ref(trans, root, bytenr, | |
1671 | blocksize, &refs); | |
1672 | BUG_ON(ret); | |
1673 | /* | |
1674 | * if replace block whose reference count is one, | |
1675 | * we have to "drop the subtree". so skip it for | |
1676 | * simplicity | |
1677 | */ | |
1678 | if (refs == 1) { | |
1679 | btrfs_tree_unlock(eb); | |
1680 | free_extent_buffer(eb); | |
1681 | goto next_level; | |
1682 | } | |
1683 | } | |
1684 | ||
1685 | btrfs_set_node_blockptr(parent, slot, nodes[level - 1]); | |
1686 | btrfs_set_node_ptr_generation(parent, slot, trans->transid); | |
1687 | btrfs_mark_buffer_dirty(parent); | |
1688 | ||
1689 | ret = btrfs_inc_extent_ref(trans, root, | |
1690 | nodes[level - 1], | |
1691 | blocksize, parent->start, | |
1692 | btrfs_header_owner(parent), | |
1693 | btrfs_header_generation(parent), | |
1694 | level - 1, 0); | |
1695 | BUG_ON(ret); | |
1696 | ret = btrfs_free_extent(trans, root, bytenr, | |
1697 | blocksize, parent->start, | |
1698 | btrfs_header_owner(parent), | |
1699 | btrfs_header_generation(parent), | |
1700 | level - 1, 0, 1); | |
1701 | BUG_ON(ret); | |
1702 | ||
1703 | if (generation == trans->transid) { | |
1704 | btrfs_tree_unlock(eb); | |
1705 | free_extent_buffer(eb); | |
1706 | } | |
1707 | break; | |
1708 | } | |
1709 | btrfs_tree_unlock(parent); | |
1710 | free_extent_buffer(parent); | |
1711 | return 0; | |
1712 | } | |
1713 | ||
74123bd7 CM |
1714 | /* |
1715 | * adjust the pointers going up the tree, starting at level | |
1716 | * making sure the right key of each node is points to 'key'. | |
1717 | * This is used after shifting pointers to the left, so it stops | |
1718 | * fixing up pointers when a given leaf/node is not in slot 0 of the | |
1719 | * higher levels | |
aa5d6bed CM |
1720 | * |
1721 | * If this fails to write a tree block, it returns -1, but continues | |
1722 | * fixing up the blocks in ram so the tree is consistent. | |
74123bd7 | 1723 | */ |
5f39d397 CM |
1724 | static int fixup_low_keys(struct btrfs_trans_handle *trans, |
1725 | struct btrfs_root *root, struct btrfs_path *path, | |
1726 | struct btrfs_disk_key *key, int level) | |
be0e5c09 CM |
1727 | { |
1728 | int i; | |
aa5d6bed | 1729 | int ret = 0; |
5f39d397 CM |
1730 | struct extent_buffer *t; |
1731 | ||
234b63a0 | 1732 | for (i = level; i < BTRFS_MAX_LEVEL; i++) { |
be0e5c09 | 1733 | int tslot = path->slots[i]; |
eb60ceac | 1734 | if (!path->nodes[i]) |
be0e5c09 | 1735 | break; |
5f39d397 CM |
1736 | t = path->nodes[i]; |
1737 | btrfs_set_node_key(t, key, tslot); | |
d6025579 | 1738 | btrfs_mark_buffer_dirty(path->nodes[i]); |
be0e5c09 CM |
1739 | if (tslot != 0) |
1740 | break; | |
1741 | } | |
aa5d6bed | 1742 | return ret; |
be0e5c09 CM |
1743 | } |
1744 | ||
31840ae1 ZY |
1745 | /* |
1746 | * update item key. | |
1747 | * | |
1748 | * This function isn't completely safe. It's the caller's responsibility | |
1749 | * that the new key won't break the order | |
1750 | */ | |
1751 | int btrfs_set_item_key_safe(struct btrfs_trans_handle *trans, | |
1752 | struct btrfs_root *root, struct btrfs_path *path, | |
1753 | struct btrfs_key *new_key) | |
1754 | { | |
1755 | struct btrfs_disk_key disk_key; | |
1756 | struct extent_buffer *eb; | |
1757 | int slot; | |
1758 | ||
1759 | eb = path->nodes[0]; | |
1760 | slot = path->slots[0]; | |
1761 | if (slot > 0) { | |
1762 | btrfs_item_key(eb, &disk_key, slot - 1); | |
1763 | if (comp_keys(&disk_key, new_key) >= 0) | |
1764 | return -1; | |
1765 | } | |
1766 | if (slot < btrfs_header_nritems(eb) - 1) { | |
1767 | btrfs_item_key(eb, &disk_key, slot + 1); | |
1768 | if (comp_keys(&disk_key, new_key) <= 0) | |
1769 | return -1; | |
1770 | } | |
1771 | ||
1772 | btrfs_cpu_key_to_disk(&disk_key, new_key); | |
1773 | btrfs_set_item_key(eb, &disk_key, slot); | |
1774 | btrfs_mark_buffer_dirty(eb); | |
1775 | if (slot == 0) | |
1776 | fixup_low_keys(trans, root, path, &disk_key, 1); | |
1777 | return 0; | |
1778 | } | |
1779 | ||
74123bd7 CM |
1780 | /* |
1781 | * try to push data from one node into the next node left in the | |
79f95c82 | 1782 | * tree. |
aa5d6bed CM |
1783 | * |
1784 | * returns 0 if some ptrs were pushed left, < 0 if there was some horrible | |
1785 | * error, and > 0 if there was no room in the left hand block. | |
74123bd7 | 1786 | */ |
98ed5174 CM |
1787 | static int push_node_left(struct btrfs_trans_handle *trans, |
1788 | struct btrfs_root *root, struct extent_buffer *dst, | |
971a1f66 | 1789 | struct extent_buffer *src, int empty) |
be0e5c09 | 1790 | { |
be0e5c09 | 1791 | int push_items = 0; |
bb803951 CM |
1792 | int src_nritems; |
1793 | int dst_nritems; | |
aa5d6bed | 1794 | int ret = 0; |
be0e5c09 | 1795 | |
5f39d397 CM |
1796 | src_nritems = btrfs_header_nritems(src); |
1797 | dst_nritems = btrfs_header_nritems(dst); | |
123abc88 | 1798 | push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems; |
7bb86316 CM |
1799 | WARN_ON(btrfs_header_generation(src) != trans->transid); |
1800 | WARN_ON(btrfs_header_generation(dst) != trans->transid); | |
54aa1f4d | 1801 | |
bce4eae9 | 1802 | if (!empty && src_nritems <= 8) |
971a1f66 CM |
1803 | return 1; |
1804 | ||
eb60ceac | 1805 | if (push_items <= 0) { |
be0e5c09 | 1806 | return 1; |
eb60ceac | 1807 | } |
be0e5c09 | 1808 | |
bce4eae9 | 1809 | if (empty) { |
971a1f66 | 1810 | push_items = min(src_nritems, push_items); |
bce4eae9 CM |
1811 | if (push_items < src_nritems) { |
1812 | /* leave at least 8 pointers in the node if | |
1813 | * we aren't going to empty it | |
1814 | */ | |
1815 | if (src_nritems - push_items < 8) { | |
1816 | if (push_items <= 8) | |
1817 | return 1; | |
1818 | push_items -= 8; | |
1819 | } | |
1820 | } | |
1821 | } else | |
1822 | push_items = min(src_nritems - 8, push_items); | |
79f95c82 | 1823 | |
5f39d397 CM |
1824 | copy_extent_buffer(dst, src, |
1825 | btrfs_node_key_ptr_offset(dst_nritems), | |
1826 | btrfs_node_key_ptr_offset(0), | |
1827 | push_items * sizeof(struct btrfs_key_ptr)); | |
1828 | ||
bb803951 | 1829 | if (push_items < src_nritems) { |
5f39d397 CM |
1830 | memmove_extent_buffer(src, btrfs_node_key_ptr_offset(0), |
1831 | btrfs_node_key_ptr_offset(push_items), | |
1832 | (src_nritems - push_items) * | |
1833 | sizeof(struct btrfs_key_ptr)); | |
1834 | } | |
1835 | btrfs_set_header_nritems(src, src_nritems - push_items); | |
1836 | btrfs_set_header_nritems(dst, dst_nritems + push_items); | |
1837 | btrfs_mark_buffer_dirty(src); | |
1838 | btrfs_mark_buffer_dirty(dst); | |
31840ae1 ZY |
1839 | |
1840 | ret = btrfs_update_ref(trans, root, src, dst, dst_nritems, push_items); | |
1841 | BUG_ON(ret); | |
1842 | ||
79f95c82 CM |
1843 | return ret; |
1844 | } | |
1845 | ||
1846 | /* | |
1847 | * try to push data from one node into the next node right in the | |
1848 | * tree. | |
1849 | * | |
1850 | * returns 0 if some ptrs were pushed, < 0 if there was some horrible | |
1851 | * error, and > 0 if there was no room in the right hand block. | |
1852 | * | |
1853 | * this will only push up to 1/2 the contents of the left node over | |
1854 | */ | |
5f39d397 CM |
1855 | static int balance_node_right(struct btrfs_trans_handle *trans, |
1856 | struct btrfs_root *root, | |
1857 | struct extent_buffer *dst, | |
1858 | struct extent_buffer *src) | |
79f95c82 | 1859 | { |
79f95c82 CM |
1860 | int push_items = 0; |
1861 | int max_push; | |
1862 | int src_nritems; | |
1863 | int dst_nritems; | |
1864 | int ret = 0; | |
79f95c82 | 1865 | |
7bb86316 CM |
1866 | WARN_ON(btrfs_header_generation(src) != trans->transid); |
1867 | WARN_ON(btrfs_header_generation(dst) != trans->transid); | |
1868 | ||
5f39d397 CM |
1869 | src_nritems = btrfs_header_nritems(src); |
1870 | dst_nritems = btrfs_header_nritems(dst); | |
123abc88 | 1871 | push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems; |
bce4eae9 | 1872 | if (push_items <= 0) { |
79f95c82 | 1873 | return 1; |
bce4eae9 CM |
1874 | } |
1875 | ||
1876 | if (src_nritems < 4) { | |
1877 | return 1; | |
1878 | } | |
79f95c82 CM |
1879 | |
1880 | max_push = src_nritems / 2 + 1; | |
1881 | /* don't try to empty the node */ | |
bce4eae9 | 1882 | if (max_push >= src_nritems) { |
79f95c82 | 1883 | return 1; |
bce4eae9 | 1884 | } |
252c38f0 | 1885 | |
79f95c82 CM |
1886 | if (max_push < push_items) |
1887 | push_items = max_push; | |
1888 | ||
5f39d397 CM |
1889 | memmove_extent_buffer(dst, btrfs_node_key_ptr_offset(push_items), |
1890 | btrfs_node_key_ptr_offset(0), | |
1891 | (dst_nritems) * | |
1892 | sizeof(struct btrfs_key_ptr)); | |
d6025579 | 1893 | |
5f39d397 CM |
1894 | copy_extent_buffer(dst, src, |
1895 | btrfs_node_key_ptr_offset(0), | |
1896 | btrfs_node_key_ptr_offset(src_nritems - push_items), | |
1897 | push_items * sizeof(struct btrfs_key_ptr)); | |
79f95c82 | 1898 | |
5f39d397 CM |
1899 | btrfs_set_header_nritems(src, src_nritems - push_items); |
1900 | btrfs_set_header_nritems(dst, dst_nritems + push_items); | |
79f95c82 | 1901 | |
5f39d397 CM |
1902 | btrfs_mark_buffer_dirty(src); |
1903 | btrfs_mark_buffer_dirty(dst); | |
31840ae1 ZY |
1904 | |
1905 | ret = btrfs_update_ref(trans, root, src, dst, 0, push_items); | |
1906 | BUG_ON(ret); | |
1907 | ||
aa5d6bed | 1908 | return ret; |
be0e5c09 CM |
1909 | } |
1910 | ||
97571fd0 CM |
1911 | /* |
1912 | * helper function to insert a new root level in the tree. | |
1913 | * A new node is allocated, and a single item is inserted to | |
1914 | * point to the existing root | |
aa5d6bed CM |
1915 | * |
1916 | * returns zero on success or < 0 on failure. | |
97571fd0 | 1917 | */ |
98ed5174 | 1918 | static int noinline insert_new_root(struct btrfs_trans_handle *trans, |
5f39d397 CM |
1919 | struct btrfs_root *root, |
1920 | struct btrfs_path *path, int level) | |
5c680ed6 | 1921 | { |
7bb86316 | 1922 | u64 lower_gen; |
5f39d397 CM |
1923 | struct extent_buffer *lower; |
1924 | struct extent_buffer *c; | |
925baedd | 1925 | struct extent_buffer *old; |
5f39d397 | 1926 | struct btrfs_disk_key lower_key; |
31840ae1 | 1927 | int ret; |
5c680ed6 CM |
1928 | |
1929 | BUG_ON(path->nodes[level]); | |
1930 | BUG_ON(path->nodes[level-1] != root->node); | |
1931 | ||
7bb86316 CM |
1932 | lower = path->nodes[level-1]; |
1933 | if (level == 1) | |
1934 | btrfs_item_key(lower, &lower_key, 0); | |
1935 | else | |
1936 | btrfs_node_key(lower, &lower_key, 0); | |
1937 | ||
31840ae1 ZY |
1938 | c = btrfs_alloc_free_block(trans, root, root->nodesize, 0, |
1939 | root->root_key.objectid, trans->transid, | |
ad3d81ba | 1940 | level, root->node->start, 0); |
5f39d397 CM |
1941 | if (IS_ERR(c)) |
1942 | return PTR_ERR(c); | |
925baedd | 1943 | |
5f39d397 CM |
1944 | memset_extent_buffer(c, 0, 0, root->nodesize); |
1945 | btrfs_set_header_nritems(c, 1); | |
1946 | btrfs_set_header_level(c, level); | |
db94535d | 1947 | btrfs_set_header_bytenr(c, c->start); |
5f39d397 CM |
1948 | btrfs_set_header_generation(c, trans->transid); |
1949 | btrfs_set_header_owner(c, root->root_key.objectid); | |
5f39d397 CM |
1950 | |
1951 | write_extent_buffer(c, root->fs_info->fsid, | |
1952 | (unsigned long)btrfs_header_fsid(c), | |
1953 | BTRFS_FSID_SIZE); | |
e17cade2 CM |
1954 | |
1955 | write_extent_buffer(c, root->fs_info->chunk_tree_uuid, | |
1956 | (unsigned long)btrfs_header_chunk_tree_uuid(c), | |
1957 | BTRFS_UUID_SIZE); | |
1958 | ||
5f39d397 | 1959 | btrfs_set_node_key(c, &lower_key, 0); |
db94535d | 1960 | btrfs_set_node_blockptr(c, 0, lower->start); |
7bb86316 | 1961 | lower_gen = btrfs_header_generation(lower); |
31840ae1 | 1962 | WARN_ON(lower_gen != trans->transid); |
7bb86316 CM |
1963 | |
1964 | btrfs_set_node_ptr_generation(c, 0, lower_gen); | |
d5719762 | 1965 | |
5f39d397 | 1966 | btrfs_mark_buffer_dirty(c); |
d5719762 | 1967 | |
925baedd CM |
1968 | spin_lock(&root->node_lock); |
1969 | old = root->node; | |
5f39d397 | 1970 | root->node = c; |
925baedd CM |
1971 | spin_unlock(&root->node_lock); |
1972 | ||
31840ae1 ZY |
1973 | ret = btrfs_update_extent_ref(trans, root, lower->start, |
1974 | lower->start, c->start, | |
1975 | root->root_key.objectid, | |
1976 | trans->transid, level - 1, 0); | |
1977 | BUG_ON(ret); | |
1978 | ||
925baedd CM |
1979 | /* the super has an extra ref to root->node */ |
1980 | free_extent_buffer(old); | |
1981 | ||
0b86a832 | 1982 | add_root_to_dirty_list(root); |
5f39d397 CM |
1983 | extent_buffer_get(c); |
1984 | path->nodes[level] = c; | |
925baedd | 1985 | path->locks[level] = 1; |
5c680ed6 CM |
1986 | path->slots[level] = 0; |
1987 | return 0; | |
1988 | } | |
1989 | ||
74123bd7 CM |
1990 | /* |
1991 | * worker function to insert a single pointer in a node. | |
1992 | * the node should have enough room for the pointer already | |
97571fd0 | 1993 | * |
74123bd7 CM |
1994 | * slot and level indicate where you want the key to go, and |
1995 | * blocknr is the block the key points to. | |
aa5d6bed CM |
1996 | * |
1997 | * returns zero on success and < 0 on any error | |
74123bd7 | 1998 | */ |
e089f05c CM |
1999 | static int insert_ptr(struct btrfs_trans_handle *trans, struct btrfs_root |
2000 | *root, struct btrfs_path *path, struct btrfs_disk_key | |
db94535d | 2001 | *key, u64 bytenr, int slot, int level) |
74123bd7 | 2002 | { |
5f39d397 | 2003 | struct extent_buffer *lower; |
74123bd7 | 2004 | int nritems; |
5c680ed6 CM |
2005 | |
2006 | BUG_ON(!path->nodes[level]); | |
5f39d397 CM |
2007 | lower = path->nodes[level]; |
2008 | nritems = btrfs_header_nritems(lower); | |
74123bd7 CM |
2009 | if (slot > nritems) |
2010 | BUG(); | |
123abc88 | 2011 | if (nritems == BTRFS_NODEPTRS_PER_BLOCK(root)) |
74123bd7 CM |
2012 | BUG(); |
2013 | if (slot != nritems) { | |
5f39d397 CM |
2014 | memmove_extent_buffer(lower, |
2015 | btrfs_node_key_ptr_offset(slot + 1), | |
2016 | btrfs_node_key_ptr_offset(slot), | |
d6025579 | 2017 | (nritems - slot) * sizeof(struct btrfs_key_ptr)); |
74123bd7 | 2018 | } |
5f39d397 | 2019 | btrfs_set_node_key(lower, key, slot); |
db94535d | 2020 | btrfs_set_node_blockptr(lower, slot, bytenr); |
74493f7a CM |
2021 | WARN_ON(trans->transid == 0); |
2022 | btrfs_set_node_ptr_generation(lower, slot, trans->transid); | |
5f39d397 CM |
2023 | btrfs_set_header_nritems(lower, nritems + 1); |
2024 | btrfs_mark_buffer_dirty(lower); | |
74123bd7 CM |
2025 | return 0; |
2026 | } | |
2027 | ||
97571fd0 CM |
2028 | /* |
2029 | * split the node at the specified level in path in two. | |
2030 | * The path is corrected to point to the appropriate node after the split | |
2031 | * | |
2032 | * Before splitting this tries to make some room in the node by pushing | |
2033 | * left and right, if either one works, it returns right away. | |
aa5d6bed CM |
2034 | * |
2035 | * returns 0 on success and < 0 on failure | |
97571fd0 | 2036 | */ |
e02119d5 CM |
2037 | static noinline int split_node(struct btrfs_trans_handle *trans, |
2038 | struct btrfs_root *root, | |
2039 | struct btrfs_path *path, int level) | |
be0e5c09 | 2040 | { |
5f39d397 CM |
2041 | struct extent_buffer *c; |
2042 | struct extent_buffer *split; | |
2043 | struct btrfs_disk_key disk_key; | |
be0e5c09 | 2044 | int mid; |
5c680ed6 | 2045 | int ret; |
aa5d6bed | 2046 | int wret; |
7518a238 | 2047 | u32 c_nritems; |
eb60ceac | 2048 | |
5f39d397 | 2049 | c = path->nodes[level]; |
7bb86316 | 2050 | WARN_ON(btrfs_header_generation(c) != trans->transid); |
5f39d397 | 2051 | if (c == root->node) { |
5c680ed6 | 2052 | /* trying to split the root, lets make a new one */ |
e089f05c | 2053 | ret = insert_new_root(trans, root, path, level + 1); |
5c680ed6 CM |
2054 | if (ret) |
2055 | return ret; | |
e66f709b CM |
2056 | } else { |
2057 | ret = push_nodes_for_insert(trans, root, path, level); | |
5f39d397 CM |
2058 | c = path->nodes[level]; |
2059 | if (!ret && btrfs_header_nritems(c) < | |
c448acf0 | 2060 | BTRFS_NODEPTRS_PER_BLOCK(root) - 3) |
e66f709b | 2061 | return 0; |
54aa1f4d CM |
2062 | if (ret < 0) |
2063 | return ret; | |
be0e5c09 | 2064 | } |
e66f709b | 2065 | |
5f39d397 | 2066 | c_nritems = btrfs_header_nritems(c); |
7bb86316 | 2067 | |
925baedd | 2068 | split = btrfs_alloc_free_block(trans, root, root->nodesize, |
31840ae1 ZY |
2069 | path->nodes[level + 1]->start, |
2070 | root->root_key.objectid, | |
2071 | trans->transid, level, c->start, 0); | |
5f39d397 CM |
2072 | if (IS_ERR(split)) |
2073 | return PTR_ERR(split); | |
2074 | ||
2075 | btrfs_set_header_flags(split, btrfs_header_flags(c)); | |
2076 | btrfs_set_header_level(split, btrfs_header_level(c)); | |
db94535d | 2077 | btrfs_set_header_bytenr(split, split->start); |
5f39d397 CM |
2078 | btrfs_set_header_generation(split, trans->transid); |
2079 | btrfs_set_header_owner(split, root->root_key.objectid); | |
63b10fc4 | 2080 | btrfs_set_header_flags(split, 0); |
5f39d397 CM |
2081 | write_extent_buffer(split, root->fs_info->fsid, |
2082 | (unsigned long)btrfs_header_fsid(split), | |
2083 | BTRFS_FSID_SIZE); | |
e17cade2 CM |
2084 | write_extent_buffer(split, root->fs_info->chunk_tree_uuid, |
2085 | (unsigned long)btrfs_header_chunk_tree_uuid(split), | |
2086 | BTRFS_UUID_SIZE); | |
54aa1f4d | 2087 | |
7518a238 | 2088 | mid = (c_nritems + 1) / 2; |
5f39d397 CM |
2089 | |
2090 | copy_extent_buffer(split, c, | |
2091 | btrfs_node_key_ptr_offset(0), | |
2092 | btrfs_node_key_ptr_offset(mid), | |
2093 | (c_nritems - mid) * sizeof(struct btrfs_key_ptr)); | |
2094 | btrfs_set_header_nritems(split, c_nritems - mid); | |
2095 | btrfs_set_header_nritems(c, mid); | |
aa5d6bed CM |
2096 | ret = 0; |
2097 | ||
5f39d397 CM |
2098 | btrfs_mark_buffer_dirty(c); |
2099 | btrfs_mark_buffer_dirty(split); | |
2100 | ||
2101 | btrfs_node_key(split, &disk_key, 0); | |
db94535d | 2102 | wret = insert_ptr(trans, root, path, &disk_key, split->start, |
5f39d397 | 2103 | path->slots[level + 1] + 1, |
123abc88 | 2104 | level + 1); |
aa5d6bed CM |
2105 | if (wret) |
2106 | ret = wret; | |
2107 | ||
31840ae1 ZY |
2108 | ret = btrfs_update_ref(trans, root, c, split, 0, c_nritems - mid); |
2109 | BUG_ON(ret); | |
2110 | ||
5de08d7d | 2111 | if (path->slots[level] >= mid) { |
5c680ed6 | 2112 | path->slots[level] -= mid; |
925baedd | 2113 | btrfs_tree_unlock(c); |
5f39d397 CM |
2114 | free_extent_buffer(c); |
2115 | path->nodes[level] = split; | |
5c680ed6 CM |
2116 | path->slots[level + 1] += 1; |
2117 | } else { | |
925baedd | 2118 | btrfs_tree_unlock(split); |
5f39d397 | 2119 | free_extent_buffer(split); |
be0e5c09 | 2120 | } |
aa5d6bed | 2121 | return ret; |
be0e5c09 CM |
2122 | } |
2123 | ||
74123bd7 CM |
2124 | /* |
2125 | * how many bytes are required to store the items in a leaf. start | |
2126 | * and nr indicate which items in the leaf to check. This totals up the | |
2127 | * space used both by the item structs and the item data | |
2128 | */ | |
5f39d397 | 2129 | static int leaf_space_used(struct extent_buffer *l, int start, int nr) |
be0e5c09 CM |
2130 | { |
2131 | int data_len; | |
5f39d397 | 2132 | int nritems = btrfs_header_nritems(l); |
d4dbff95 | 2133 | int end = min(nritems, start + nr) - 1; |
be0e5c09 CM |
2134 | |
2135 | if (!nr) | |
2136 | return 0; | |
5f39d397 CM |
2137 | data_len = btrfs_item_end_nr(l, start); |
2138 | data_len = data_len - btrfs_item_offset_nr(l, end); | |
0783fcfc | 2139 | data_len += sizeof(struct btrfs_item) * nr; |
d4dbff95 | 2140 | WARN_ON(data_len < 0); |
be0e5c09 CM |
2141 | return data_len; |
2142 | } | |
2143 | ||
d4dbff95 CM |
2144 | /* |
2145 | * The space between the end of the leaf items and | |
2146 | * the start of the leaf data. IOW, how much room | |
2147 | * the leaf has left for both items and data | |
2148 | */ | |
e02119d5 CM |
2149 | int noinline btrfs_leaf_free_space(struct btrfs_root *root, |
2150 | struct extent_buffer *leaf) | |
d4dbff95 | 2151 | { |
5f39d397 CM |
2152 | int nritems = btrfs_header_nritems(leaf); |
2153 | int ret; | |
2154 | ret = BTRFS_LEAF_DATA_SIZE(root) - leaf_space_used(leaf, 0, nritems); | |
2155 | if (ret < 0) { | |
2156 | printk("leaf free space ret %d, leaf data size %lu, used %d nritems %d\n", | |
ae2f5411 | 2157 | ret, (unsigned long) BTRFS_LEAF_DATA_SIZE(root), |
5f39d397 CM |
2158 | leaf_space_used(leaf, 0, nritems), nritems); |
2159 | } | |
2160 | return ret; | |
d4dbff95 CM |
2161 | } |
2162 | ||
00ec4c51 CM |
2163 | /* |
2164 | * push some data in the path leaf to the right, trying to free up at | |
2165 | * least data_size bytes. returns zero if the push worked, nonzero otherwise | |
aa5d6bed CM |
2166 | * |
2167 | * returns 1 if the push failed because the other node didn't have enough | |
2168 | * room, 0 if everything worked out and < 0 if there were major errors. | |
00ec4c51 | 2169 | */ |
e089f05c | 2170 | static int push_leaf_right(struct btrfs_trans_handle *trans, struct btrfs_root |
34a38218 CM |
2171 | *root, struct btrfs_path *path, int data_size, |
2172 | int empty) | |
00ec4c51 | 2173 | { |
5f39d397 CM |
2174 | struct extent_buffer *left = path->nodes[0]; |
2175 | struct extent_buffer *right; | |
2176 | struct extent_buffer *upper; | |
2177 | struct btrfs_disk_key disk_key; | |
00ec4c51 | 2178 | int slot; |
34a38218 | 2179 | u32 i; |
00ec4c51 CM |
2180 | int free_space; |
2181 | int push_space = 0; | |
2182 | int push_items = 0; | |
0783fcfc | 2183 | struct btrfs_item *item; |
7518a238 | 2184 | u32 left_nritems; |
34a38218 | 2185 | u32 nr; |
7518a238 | 2186 | u32 right_nritems; |
5f39d397 | 2187 | u32 data_end; |
db94535d | 2188 | u32 this_item_size; |
54aa1f4d | 2189 | int ret; |
00ec4c51 CM |
2190 | |
2191 | slot = path->slots[1]; | |
2192 | if (!path->nodes[1]) { | |
2193 | return 1; | |
2194 | } | |
2195 | upper = path->nodes[1]; | |
5f39d397 | 2196 | if (slot >= btrfs_header_nritems(upper) - 1) |
00ec4c51 | 2197 | return 1; |
5f39d397 | 2198 | |
a2135011 CM |
2199 | WARN_ON(!btrfs_tree_locked(path->nodes[1])); |
2200 | ||
ca7a79ad | 2201 | right = read_node_slot(root, upper, slot + 1); |
925baedd | 2202 | btrfs_tree_lock(right); |
123abc88 | 2203 | free_space = btrfs_leaf_free_space(root, right); |
925baedd CM |
2204 | if (free_space < data_size + sizeof(struct btrfs_item)) |
2205 | goto out_unlock; | |
5f39d397 | 2206 | |
02217ed2 | 2207 | /* cow and double check */ |
5f39d397 | 2208 | ret = btrfs_cow_block(trans, root, right, upper, |
65b51a00 | 2209 | slot + 1, &right, 0); |
925baedd CM |
2210 | if (ret) |
2211 | goto out_unlock; | |
2212 | ||
123abc88 | 2213 | free_space = btrfs_leaf_free_space(root, right); |
925baedd CM |
2214 | if (free_space < data_size + sizeof(struct btrfs_item)) |
2215 | goto out_unlock; | |
02217ed2 | 2216 | |
5f39d397 | 2217 | left_nritems = btrfs_header_nritems(left); |
925baedd CM |
2218 | if (left_nritems == 0) |
2219 | goto out_unlock; | |
5f39d397 | 2220 | |
34a38218 CM |
2221 | if (empty) |
2222 | nr = 0; | |
2223 | else | |
2224 | nr = 1; | |
2225 | ||
31840ae1 ZY |
2226 | if (path->slots[0] >= left_nritems) |
2227 | push_space += data_size + sizeof(*item); | |
2228 | ||
34a38218 CM |
2229 | i = left_nritems - 1; |
2230 | while (i >= nr) { | |
5f39d397 | 2231 | item = btrfs_item_nr(left, i); |
db94535d | 2232 | |
31840ae1 ZY |
2233 | if (!empty && push_items > 0) { |
2234 | if (path->slots[0] > i) | |
2235 | break; | |
2236 | if (path->slots[0] == i) { | |
2237 | int space = btrfs_leaf_free_space(root, left); | |
2238 | if (space + push_space * 2 > free_space) | |
2239 | break; | |
2240 | } | |
2241 | } | |
2242 | ||
00ec4c51 CM |
2243 | if (path->slots[0] == i) |
2244 | push_space += data_size + sizeof(*item); | |
db94535d CM |
2245 | |
2246 | if (!left->map_token) { | |
2247 | map_extent_buffer(left, (unsigned long)item, | |
2248 | sizeof(struct btrfs_item), | |
2249 | &left->map_token, &left->kaddr, | |
2250 | &left->map_start, &left->map_len, | |
2251 | KM_USER1); | |
2252 | } | |
2253 | ||
2254 | this_item_size = btrfs_item_size(left, item); | |
2255 | if (this_item_size + sizeof(*item) + push_space > free_space) | |
00ec4c51 | 2256 | break; |
31840ae1 | 2257 | |
00ec4c51 | 2258 | push_items++; |
db94535d | 2259 | push_space += this_item_size + sizeof(*item); |
34a38218 CM |
2260 | if (i == 0) |
2261 | break; | |
2262 | i--; | |
db94535d CM |
2263 | } |
2264 | if (left->map_token) { | |
2265 | unmap_extent_buffer(left, left->map_token, KM_USER1); | |
2266 | left->map_token = NULL; | |
00ec4c51 | 2267 | } |
5f39d397 | 2268 | |
925baedd CM |
2269 | if (push_items == 0) |
2270 | goto out_unlock; | |
5f39d397 | 2271 | |
34a38218 | 2272 | if (!empty && push_items == left_nritems) |
a429e513 | 2273 | WARN_ON(1); |
5f39d397 | 2274 | |
00ec4c51 | 2275 | /* push left to right */ |
5f39d397 | 2276 | right_nritems = btrfs_header_nritems(right); |
34a38218 | 2277 | |
5f39d397 | 2278 | push_space = btrfs_item_end_nr(left, left_nritems - push_items); |
123abc88 | 2279 | push_space -= leaf_data_end(root, left); |
5f39d397 | 2280 | |
00ec4c51 | 2281 | /* make room in the right data area */ |
5f39d397 CM |
2282 | data_end = leaf_data_end(root, right); |
2283 | memmove_extent_buffer(right, | |
2284 | btrfs_leaf_data(right) + data_end - push_space, | |
2285 | btrfs_leaf_data(right) + data_end, | |
2286 | BTRFS_LEAF_DATA_SIZE(root) - data_end); | |
2287 | ||
00ec4c51 | 2288 | /* copy from the left data area */ |
5f39d397 | 2289 | copy_extent_buffer(right, left, btrfs_leaf_data(right) + |
d6025579 CM |
2290 | BTRFS_LEAF_DATA_SIZE(root) - push_space, |
2291 | btrfs_leaf_data(left) + leaf_data_end(root, left), | |
2292 | push_space); | |
5f39d397 CM |
2293 | |
2294 | memmove_extent_buffer(right, btrfs_item_nr_offset(push_items), | |
2295 | btrfs_item_nr_offset(0), | |
2296 | right_nritems * sizeof(struct btrfs_item)); | |
2297 | ||
00ec4c51 | 2298 | /* copy the items from left to right */ |
5f39d397 CM |
2299 | copy_extent_buffer(right, left, btrfs_item_nr_offset(0), |
2300 | btrfs_item_nr_offset(left_nritems - push_items), | |
2301 | push_items * sizeof(struct btrfs_item)); | |
00ec4c51 CM |
2302 | |
2303 | /* update the item pointers */ | |
7518a238 | 2304 | right_nritems += push_items; |
5f39d397 | 2305 | btrfs_set_header_nritems(right, right_nritems); |
123abc88 | 2306 | push_space = BTRFS_LEAF_DATA_SIZE(root); |
7518a238 | 2307 | for (i = 0; i < right_nritems; i++) { |
5f39d397 | 2308 | item = btrfs_item_nr(right, i); |
db94535d CM |
2309 | if (!right->map_token) { |
2310 | map_extent_buffer(right, (unsigned long)item, | |
2311 | sizeof(struct btrfs_item), | |
2312 | &right->map_token, &right->kaddr, | |
2313 | &right->map_start, &right->map_len, | |
2314 | KM_USER1); | |
2315 | } | |
2316 | push_space -= btrfs_item_size(right, item); | |
2317 | btrfs_set_item_offset(right, item, push_space); | |
2318 | } | |
2319 | ||
2320 | if (right->map_token) { | |
2321 | unmap_extent_buffer(right, right->map_token, KM_USER1); | |
2322 | right->map_token = NULL; | |
00ec4c51 | 2323 | } |
7518a238 | 2324 | left_nritems -= push_items; |
5f39d397 | 2325 | btrfs_set_header_nritems(left, left_nritems); |
00ec4c51 | 2326 | |
34a38218 CM |
2327 | if (left_nritems) |
2328 | btrfs_mark_buffer_dirty(left); | |
5f39d397 | 2329 | btrfs_mark_buffer_dirty(right); |
a429e513 | 2330 | |
31840ae1 ZY |
2331 | ret = btrfs_update_ref(trans, root, left, right, 0, push_items); |
2332 | BUG_ON(ret); | |
2333 | ||
5f39d397 CM |
2334 | btrfs_item_key(right, &disk_key, 0); |
2335 | btrfs_set_node_key(upper, &disk_key, slot + 1); | |
d6025579 | 2336 | btrfs_mark_buffer_dirty(upper); |
02217ed2 | 2337 | |
00ec4c51 | 2338 | /* then fixup the leaf pointer in the path */ |
7518a238 CM |
2339 | if (path->slots[0] >= left_nritems) { |
2340 | path->slots[0] -= left_nritems; | |
925baedd CM |
2341 | if (btrfs_header_nritems(path->nodes[0]) == 0) |
2342 | clean_tree_block(trans, root, path->nodes[0]); | |
2343 | btrfs_tree_unlock(path->nodes[0]); | |
5f39d397 CM |
2344 | free_extent_buffer(path->nodes[0]); |
2345 | path->nodes[0] = right; | |
00ec4c51 CM |
2346 | path->slots[1] += 1; |
2347 | } else { | |
925baedd | 2348 | btrfs_tree_unlock(right); |
5f39d397 | 2349 | free_extent_buffer(right); |
00ec4c51 CM |
2350 | } |
2351 | return 0; | |
925baedd CM |
2352 | |
2353 | out_unlock: | |
2354 | btrfs_tree_unlock(right); | |
2355 | free_extent_buffer(right); | |
2356 | return 1; | |
00ec4c51 | 2357 | } |
925baedd | 2358 | |
74123bd7 CM |
2359 | /* |
2360 | * push some data in the path leaf to the left, trying to free up at | |
2361 | * least data_size bytes. returns zero if the push worked, nonzero otherwise | |
2362 | */ | |
e089f05c | 2363 | static int push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_root |
34a38218 CM |
2364 | *root, struct btrfs_path *path, int data_size, |
2365 | int empty) | |
be0e5c09 | 2366 | { |
5f39d397 CM |
2367 | struct btrfs_disk_key disk_key; |
2368 | struct extent_buffer *right = path->nodes[0]; | |
2369 | struct extent_buffer *left; | |
be0e5c09 CM |
2370 | int slot; |
2371 | int i; | |
2372 | int free_space; | |
2373 | int push_space = 0; | |
2374 | int push_items = 0; | |
0783fcfc | 2375 | struct btrfs_item *item; |
7518a238 | 2376 | u32 old_left_nritems; |
5f39d397 | 2377 | u32 right_nritems; |
34a38218 | 2378 | u32 nr; |
aa5d6bed CM |
2379 | int ret = 0; |
2380 | int wret; | |
db94535d CM |
2381 | u32 this_item_size; |
2382 | u32 old_left_item_size; | |
be0e5c09 CM |
2383 | |
2384 | slot = path->slots[1]; | |
5f39d397 | 2385 | if (slot == 0) |
be0e5c09 | 2386 | return 1; |
5f39d397 | 2387 | if (!path->nodes[1]) |
be0e5c09 | 2388 | return 1; |
5f39d397 | 2389 | |
3685f791 CM |
2390 | right_nritems = btrfs_header_nritems(right); |
2391 | if (right_nritems == 0) { | |
2392 | return 1; | |
2393 | } | |
2394 | ||
a2135011 CM |
2395 | WARN_ON(!btrfs_tree_locked(path->nodes[1])); |
2396 | ||
ca7a79ad | 2397 | left = read_node_slot(root, path->nodes[1], slot - 1); |
925baedd | 2398 | btrfs_tree_lock(left); |
123abc88 | 2399 | free_space = btrfs_leaf_free_space(root, left); |
0783fcfc | 2400 | if (free_space < data_size + sizeof(struct btrfs_item)) { |
925baedd CM |
2401 | ret = 1; |
2402 | goto out; | |
be0e5c09 | 2403 | } |
02217ed2 CM |
2404 | |
2405 | /* cow and double check */ | |
5f39d397 | 2406 | ret = btrfs_cow_block(trans, root, left, |
65b51a00 | 2407 | path->nodes[1], slot - 1, &left, 0); |
54aa1f4d CM |
2408 | if (ret) { |
2409 | /* we hit -ENOSPC, but it isn't fatal here */ | |
925baedd CM |
2410 | ret = 1; |
2411 | goto out; | |
54aa1f4d | 2412 | } |
3685f791 | 2413 | |
123abc88 | 2414 | free_space = btrfs_leaf_free_space(root, left); |
0783fcfc | 2415 | if (free_space < data_size + sizeof(struct btrfs_item)) { |
925baedd CM |
2416 | ret = 1; |
2417 | goto out; | |
02217ed2 CM |
2418 | } |
2419 | ||
34a38218 CM |
2420 | if (empty) |
2421 | nr = right_nritems; | |
2422 | else | |
2423 | nr = right_nritems - 1; | |
2424 | ||
2425 | for (i = 0; i < nr; i++) { | |
5f39d397 | 2426 | item = btrfs_item_nr(right, i); |
db94535d CM |
2427 | if (!right->map_token) { |
2428 | map_extent_buffer(right, (unsigned long)item, | |
2429 | sizeof(struct btrfs_item), | |
2430 | &right->map_token, &right->kaddr, | |
2431 | &right->map_start, &right->map_len, | |
2432 | KM_USER1); | |
2433 | } | |
2434 | ||
31840ae1 ZY |
2435 | if (!empty && push_items > 0) { |
2436 | if (path->slots[0] < i) | |
2437 | break; | |
2438 | if (path->slots[0] == i) { | |
2439 | int space = btrfs_leaf_free_space(root, right); | |
2440 | if (space + push_space * 2 > free_space) | |
2441 | break; | |
2442 | } | |
2443 | } | |
2444 | ||
be0e5c09 CM |
2445 | if (path->slots[0] == i) |
2446 | push_space += data_size + sizeof(*item); | |
db94535d CM |
2447 | |
2448 | this_item_size = btrfs_item_size(right, item); | |
2449 | if (this_item_size + sizeof(*item) + push_space > free_space) | |
be0e5c09 | 2450 | break; |
db94535d | 2451 | |
be0e5c09 | 2452 | push_items++; |
db94535d CM |
2453 | push_space += this_item_size + sizeof(*item); |
2454 | } | |
2455 | ||
2456 | if (right->map_token) { | |
2457 | unmap_extent_buffer(right, right->map_token, KM_USER1); | |
2458 | right->map_token = NULL; | |
be0e5c09 | 2459 | } |
db94535d | 2460 | |
be0e5c09 | 2461 | if (push_items == 0) { |
925baedd CM |
2462 | ret = 1; |
2463 | goto out; | |
be0e5c09 | 2464 | } |
34a38218 | 2465 | if (!empty && push_items == btrfs_header_nritems(right)) |
a429e513 | 2466 | WARN_ON(1); |
5f39d397 | 2467 | |
be0e5c09 | 2468 | /* push data from right to left */ |
5f39d397 CM |
2469 | copy_extent_buffer(left, right, |
2470 | btrfs_item_nr_offset(btrfs_header_nritems(left)), | |
2471 | btrfs_item_nr_offset(0), | |
2472 | push_items * sizeof(struct btrfs_item)); | |
2473 | ||
123abc88 | 2474 | push_space = BTRFS_LEAF_DATA_SIZE(root) - |
5f39d397 CM |
2475 | btrfs_item_offset_nr(right, push_items -1); |
2476 | ||
2477 | copy_extent_buffer(left, right, btrfs_leaf_data(left) + | |
d6025579 CM |
2478 | leaf_data_end(root, left) - push_space, |
2479 | btrfs_leaf_data(right) + | |
5f39d397 | 2480 | btrfs_item_offset_nr(right, push_items - 1), |
d6025579 | 2481 | push_space); |
5f39d397 | 2482 | old_left_nritems = btrfs_header_nritems(left); |
eb60ceac CM |
2483 | BUG_ON(old_left_nritems < 0); |
2484 | ||
db94535d | 2485 | old_left_item_size = btrfs_item_offset_nr(left, old_left_nritems - 1); |
0783fcfc | 2486 | for (i = old_left_nritems; i < old_left_nritems + push_items; i++) { |
5f39d397 | 2487 | u32 ioff; |
db94535d | 2488 | |
5f39d397 | 2489 | item = btrfs_item_nr(left, i); |
db94535d CM |
2490 | if (!left->map_token) { |
2491 | map_extent_buffer(left, (unsigned long)item, | |
2492 | sizeof(struct btrfs_item), | |
2493 | &left->map_token, &left->kaddr, | |
2494 | &left->map_start, &left->map_len, | |
2495 | KM_USER1); | |
2496 | } | |
2497 | ||
5f39d397 CM |
2498 | ioff = btrfs_item_offset(left, item); |
2499 | btrfs_set_item_offset(left, item, | |
db94535d | 2500 | ioff - (BTRFS_LEAF_DATA_SIZE(root) - old_left_item_size)); |
be0e5c09 | 2501 | } |
5f39d397 | 2502 | btrfs_set_header_nritems(left, old_left_nritems + push_items); |
db94535d CM |
2503 | if (left->map_token) { |
2504 | unmap_extent_buffer(left, left->map_token, KM_USER1); | |
2505 | left->map_token = NULL; | |
2506 | } | |
be0e5c09 CM |
2507 | |
2508 | /* fixup right node */ | |
34a38218 CM |
2509 | if (push_items > right_nritems) { |
2510 | printk("push items %d nr %u\n", push_items, right_nritems); | |
2511 | WARN_ON(1); | |
2512 | } | |
2513 | ||
2514 | if (push_items < right_nritems) { | |
2515 | push_space = btrfs_item_offset_nr(right, push_items - 1) - | |
2516 | leaf_data_end(root, right); | |
2517 | memmove_extent_buffer(right, btrfs_leaf_data(right) + | |
2518 | BTRFS_LEAF_DATA_SIZE(root) - push_space, | |
2519 | btrfs_leaf_data(right) + | |
2520 | leaf_data_end(root, right), push_space); | |
2521 | ||
2522 | memmove_extent_buffer(right, btrfs_item_nr_offset(0), | |
5f39d397 CM |
2523 | btrfs_item_nr_offset(push_items), |
2524 | (btrfs_header_nritems(right) - push_items) * | |
2525 | sizeof(struct btrfs_item)); | |
34a38218 | 2526 | } |
eef1c494 Y |
2527 | right_nritems -= push_items; |
2528 | btrfs_set_header_nritems(right, right_nritems); | |
123abc88 | 2529 | push_space = BTRFS_LEAF_DATA_SIZE(root); |
5f39d397 CM |
2530 | for (i = 0; i < right_nritems; i++) { |
2531 | item = btrfs_item_nr(right, i); | |
db94535d CM |
2532 | |
2533 | if (!right->map_token) { | |
2534 | map_extent_buffer(right, (unsigned long)item, | |
2535 | sizeof(struct btrfs_item), | |
2536 | &right->map_token, &right->kaddr, | |
2537 | &right->map_start, &right->map_len, | |
2538 | KM_USER1); | |
2539 | } | |
2540 | ||
2541 | push_space = push_space - btrfs_item_size(right, item); | |
2542 | btrfs_set_item_offset(right, item, push_space); | |
2543 | } | |
2544 | if (right->map_token) { | |
2545 | unmap_extent_buffer(right, right->map_token, KM_USER1); | |
2546 | right->map_token = NULL; | |
be0e5c09 | 2547 | } |
eb60ceac | 2548 | |
5f39d397 | 2549 | btrfs_mark_buffer_dirty(left); |
34a38218 CM |
2550 | if (right_nritems) |
2551 | btrfs_mark_buffer_dirty(right); | |
098f59c2 | 2552 | |
31840ae1 ZY |
2553 | ret = btrfs_update_ref(trans, root, right, left, |
2554 | old_left_nritems, push_items); | |
2555 | BUG_ON(ret); | |
2556 | ||
5f39d397 CM |
2557 | btrfs_item_key(right, &disk_key, 0); |
2558 | wret = fixup_low_keys(trans, root, path, &disk_key, 1); | |
aa5d6bed CM |
2559 | if (wret) |
2560 | ret = wret; | |
be0e5c09 CM |
2561 | |
2562 | /* then fixup the leaf pointer in the path */ | |
2563 | if (path->slots[0] < push_items) { | |
2564 | path->slots[0] += old_left_nritems; | |
925baedd CM |
2565 | if (btrfs_header_nritems(path->nodes[0]) == 0) |
2566 | clean_tree_block(trans, root, path->nodes[0]); | |
2567 | btrfs_tree_unlock(path->nodes[0]); | |
5f39d397 CM |
2568 | free_extent_buffer(path->nodes[0]); |
2569 | path->nodes[0] = left; | |
be0e5c09 CM |
2570 | path->slots[1] -= 1; |
2571 | } else { | |
925baedd | 2572 | btrfs_tree_unlock(left); |
5f39d397 | 2573 | free_extent_buffer(left); |
be0e5c09 CM |
2574 | path->slots[0] -= push_items; |
2575 | } | |
eb60ceac | 2576 | BUG_ON(path->slots[0] < 0); |
aa5d6bed | 2577 | return ret; |
925baedd CM |
2578 | out: |
2579 | btrfs_tree_unlock(left); | |
2580 | free_extent_buffer(left); | |
2581 | return ret; | |
be0e5c09 CM |
2582 | } |
2583 | ||
74123bd7 CM |
2584 | /* |
2585 | * split the path's leaf in two, making sure there is at least data_size | |
2586 | * available for the resulting leaf level of the path. | |
aa5d6bed CM |
2587 | * |
2588 | * returns 0 if all went well and < 0 on failure. | |
74123bd7 | 2589 | */ |
e02119d5 CM |
2590 | static noinline int split_leaf(struct btrfs_trans_handle *trans, |
2591 | struct btrfs_root *root, | |
2592 | struct btrfs_key *ins_key, | |
2593 | struct btrfs_path *path, int data_size, | |
2594 | int extend) | |
be0e5c09 | 2595 | { |
5f39d397 | 2596 | struct extent_buffer *l; |
7518a238 | 2597 | u32 nritems; |
eb60ceac CM |
2598 | int mid; |
2599 | int slot; | |
5f39d397 | 2600 | struct extent_buffer *right; |
0783fcfc | 2601 | int space_needed = data_size + sizeof(struct btrfs_item); |
be0e5c09 CM |
2602 | int data_copy_size; |
2603 | int rt_data_off; | |
2604 | int i; | |
d4dbff95 | 2605 | int ret = 0; |
aa5d6bed | 2606 | int wret; |
cc0c5538 CM |
2607 | int double_split; |
2608 | int num_doubles = 0; | |
d4dbff95 | 2609 | struct btrfs_disk_key disk_key; |
aa5d6bed | 2610 | |
cc0c5538 CM |
2611 | if (extend) |
2612 | space_needed = data_size; | |
2613 | ||
40689478 | 2614 | /* first try to make some room by pushing left and right */ |
3685f791 | 2615 | if (ins_key->type != BTRFS_DIR_ITEM_KEY) { |
34a38218 | 2616 | wret = push_leaf_right(trans, root, path, data_size, 0); |
3685f791 | 2617 | if (wret < 0) { |
eaee50e8 | 2618 | return wret; |
3685f791 CM |
2619 | } |
2620 | if (wret) { | |
34a38218 | 2621 | wret = push_leaf_left(trans, root, path, data_size, 0); |
3685f791 CM |
2622 | if (wret < 0) |
2623 | return wret; | |
2624 | } | |
2625 | l = path->nodes[0]; | |
aa5d6bed | 2626 | |
3685f791 | 2627 | /* did the pushes work? */ |
cc0c5538 | 2628 | if (btrfs_leaf_free_space(root, l) >= space_needed) |
3685f791 | 2629 | return 0; |
3326d1b0 | 2630 | } |
aa5d6bed | 2631 | |
5c680ed6 | 2632 | if (!path->nodes[1]) { |
e089f05c | 2633 | ret = insert_new_root(trans, root, path, 1); |
5c680ed6 CM |
2634 | if (ret) |
2635 | return ret; | |
2636 | } | |
cc0c5538 CM |
2637 | again: |
2638 | double_split = 0; | |
2639 | l = path->nodes[0]; | |
eb60ceac | 2640 | slot = path->slots[0]; |
5f39d397 | 2641 | nritems = btrfs_header_nritems(l); |
eb60ceac | 2642 | mid = (nritems + 1)/ 2; |
54aa1f4d | 2643 | |
925baedd | 2644 | right = btrfs_alloc_free_block(trans, root, root->leafsize, |
31840ae1 ZY |
2645 | path->nodes[1]->start, |
2646 | root->root_key.objectid, | |
2647 | trans->transid, 0, l->start, 0); | |
cea9e445 CM |
2648 | if (IS_ERR(right)) { |
2649 | BUG_ON(1); | |
5f39d397 | 2650 | return PTR_ERR(right); |
cea9e445 | 2651 | } |
5f39d397 CM |
2652 | |
2653 | memset_extent_buffer(right, 0, 0, sizeof(struct btrfs_header)); | |
db94535d | 2654 | btrfs_set_header_bytenr(right, right->start); |
5f39d397 CM |
2655 | btrfs_set_header_generation(right, trans->transid); |
2656 | btrfs_set_header_owner(right, root->root_key.objectid); | |
2657 | btrfs_set_header_level(right, 0); | |
2658 | write_extent_buffer(right, root->fs_info->fsid, | |
2659 | (unsigned long)btrfs_header_fsid(right), | |
2660 | BTRFS_FSID_SIZE); | |
e17cade2 CM |
2661 | |
2662 | write_extent_buffer(right, root->fs_info->chunk_tree_uuid, | |
2663 | (unsigned long)btrfs_header_chunk_tree_uuid(right), | |
2664 | BTRFS_UUID_SIZE); | |
d4dbff95 CM |
2665 | if (mid <= slot) { |
2666 | if (nritems == 1 || | |
2667 | leaf_space_used(l, mid, nritems - mid) + space_needed > | |
2668 | BTRFS_LEAF_DATA_SIZE(root)) { | |
2669 | if (slot >= nritems) { | |
2670 | btrfs_cpu_key_to_disk(&disk_key, ins_key); | |
5f39d397 | 2671 | btrfs_set_header_nritems(right, 0); |
d4dbff95 | 2672 | wret = insert_ptr(trans, root, path, |
db94535d | 2673 | &disk_key, right->start, |
d4dbff95 CM |
2674 | path->slots[1] + 1, 1); |
2675 | if (wret) | |
2676 | ret = wret; | |
925baedd CM |
2677 | |
2678 | btrfs_tree_unlock(path->nodes[0]); | |
5f39d397 CM |
2679 | free_extent_buffer(path->nodes[0]); |
2680 | path->nodes[0] = right; | |
d4dbff95 CM |
2681 | path->slots[0] = 0; |
2682 | path->slots[1] += 1; | |
0ef8b242 | 2683 | btrfs_mark_buffer_dirty(right); |
d4dbff95 CM |
2684 | return ret; |
2685 | } | |
2686 | mid = slot; | |
3326d1b0 CM |
2687 | if (mid != nritems && |
2688 | leaf_space_used(l, mid, nritems - mid) + | |
2689 | space_needed > BTRFS_LEAF_DATA_SIZE(root)) { | |
2690 | double_split = 1; | |
2691 | } | |
d4dbff95 CM |
2692 | } |
2693 | } else { | |
2694 | if (leaf_space_used(l, 0, mid + 1) + space_needed > | |
2695 | BTRFS_LEAF_DATA_SIZE(root)) { | |
cc0c5538 | 2696 | if (!extend && slot == 0) { |
d4dbff95 | 2697 | btrfs_cpu_key_to_disk(&disk_key, ins_key); |
5f39d397 | 2698 | btrfs_set_header_nritems(right, 0); |
d4dbff95 CM |
2699 | wret = insert_ptr(trans, root, path, |
2700 | &disk_key, | |
db94535d | 2701 | right->start, |
098f59c2 | 2702 | path->slots[1], 1); |
d4dbff95 CM |
2703 | if (wret) |
2704 | ret = wret; | |
925baedd | 2705 | btrfs_tree_unlock(path->nodes[0]); |
5f39d397 CM |
2706 | free_extent_buffer(path->nodes[0]); |
2707 | path->nodes[0] = right; | |
d4dbff95 | 2708 | path->slots[0] = 0; |
a429e513 CM |
2709 | if (path->slots[1] == 0) { |
2710 | wret = fixup_low_keys(trans, root, | |
2711 | path, &disk_key, 1); | |
2712 | if (wret) | |
2713 | ret = wret; | |
2714 | } | |
0ef8b242 | 2715 | btrfs_mark_buffer_dirty(right); |
d4dbff95 | 2716 | return ret; |
cc0c5538 CM |
2717 | } else if (extend && slot == 0) { |
2718 | mid = 1; | |
2719 | } else { | |
2720 | mid = slot; | |
2721 | if (mid != nritems && | |
2722 | leaf_space_used(l, mid, nritems - mid) + | |
2723 | space_needed > BTRFS_LEAF_DATA_SIZE(root)) { | |
2724 | double_split = 1; | |
2725 | } | |
5ee78ac7 | 2726 | } |
d4dbff95 CM |
2727 | } |
2728 | } | |
5f39d397 CM |
2729 | nritems = nritems - mid; |
2730 | btrfs_set_header_nritems(right, nritems); | |
2731 | data_copy_size = btrfs_item_end_nr(l, mid) - leaf_data_end(root, l); | |
2732 | ||
2733 | copy_extent_buffer(right, l, btrfs_item_nr_offset(0), | |
2734 | btrfs_item_nr_offset(mid), | |
2735 | nritems * sizeof(struct btrfs_item)); | |
2736 | ||
2737 | copy_extent_buffer(right, l, | |
d6025579 CM |
2738 | btrfs_leaf_data(right) + BTRFS_LEAF_DATA_SIZE(root) - |
2739 | data_copy_size, btrfs_leaf_data(l) + | |
2740 | leaf_data_end(root, l), data_copy_size); | |
5f39d397 | 2741 | |
123abc88 | 2742 | rt_data_off = BTRFS_LEAF_DATA_SIZE(root) - |
5f39d397 | 2743 | btrfs_item_end_nr(l, mid); |
74123bd7 | 2744 | |
5f39d397 CM |
2745 | for (i = 0; i < nritems; i++) { |
2746 | struct btrfs_item *item = btrfs_item_nr(right, i); | |
db94535d CM |
2747 | u32 ioff; |
2748 | ||
2749 | if (!right->map_token) { | |
2750 | map_extent_buffer(right, (unsigned long)item, | |
2751 | sizeof(struct btrfs_item), | |
2752 | &right->map_token, &right->kaddr, | |
2753 | &right->map_start, &right->map_len, | |
2754 | KM_USER1); | |
2755 | } | |
2756 | ||
2757 | ioff = btrfs_item_offset(right, item); | |
5f39d397 | 2758 | btrfs_set_item_offset(right, item, ioff + rt_data_off); |
0783fcfc | 2759 | } |
74123bd7 | 2760 | |
db94535d CM |
2761 | if (right->map_token) { |
2762 | unmap_extent_buffer(right, right->map_token, KM_USER1); | |
2763 | right->map_token = NULL; | |
2764 | } | |
2765 | ||
5f39d397 | 2766 | btrfs_set_header_nritems(l, mid); |
aa5d6bed | 2767 | ret = 0; |
5f39d397 | 2768 | btrfs_item_key(right, &disk_key, 0); |
db94535d CM |
2769 | wret = insert_ptr(trans, root, path, &disk_key, right->start, |
2770 | path->slots[1] + 1, 1); | |
aa5d6bed CM |
2771 | if (wret) |
2772 | ret = wret; | |
5f39d397 CM |
2773 | |
2774 | btrfs_mark_buffer_dirty(right); | |
2775 | btrfs_mark_buffer_dirty(l); | |
eb60ceac | 2776 | BUG_ON(path->slots[0] != slot); |
5f39d397 | 2777 | |
31840ae1 ZY |
2778 | ret = btrfs_update_ref(trans, root, l, right, 0, nritems); |
2779 | BUG_ON(ret); | |
2780 | ||
be0e5c09 | 2781 | if (mid <= slot) { |
925baedd | 2782 | btrfs_tree_unlock(path->nodes[0]); |
5f39d397 CM |
2783 | free_extent_buffer(path->nodes[0]); |
2784 | path->nodes[0] = right; | |
be0e5c09 CM |
2785 | path->slots[0] -= mid; |
2786 | path->slots[1] += 1; | |
925baedd CM |
2787 | } else { |
2788 | btrfs_tree_unlock(right); | |
5f39d397 | 2789 | free_extent_buffer(right); |
925baedd | 2790 | } |
5f39d397 | 2791 | |
eb60ceac | 2792 | BUG_ON(path->slots[0] < 0); |
d4dbff95 | 2793 | |
cc0c5538 CM |
2794 | if (double_split) { |
2795 | BUG_ON(num_doubles != 0); | |
2796 | num_doubles++; | |
2797 | goto again; | |
a429e513 | 2798 | } |
be0e5c09 CM |
2799 | return ret; |
2800 | } | |
2801 | ||
d352ac68 CM |
2802 | /* |
2803 | * make the item pointed to by the path smaller. new_size indicates | |
2804 | * how small to make it, and from_end tells us if we just chop bytes | |
2805 | * off the end of the item or if we shift the item to chop bytes off | |
2806 | * the front. | |
2807 | */ | |
b18c6685 CM |
2808 | int btrfs_truncate_item(struct btrfs_trans_handle *trans, |
2809 | struct btrfs_root *root, | |
2810 | struct btrfs_path *path, | |
179e29e4 | 2811 | u32 new_size, int from_end) |
b18c6685 CM |
2812 | { |
2813 | int ret = 0; | |
2814 | int slot; | |
2815 | int slot_orig; | |
5f39d397 CM |
2816 | struct extent_buffer *leaf; |
2817 | struct btrfs_item *item; | |
b18c6685 CM |
2818 | u32 nritems; |
2819 | unsigned int data_end; | |
2820 | unsigned int old_data_start; | |
2821 | unsigned int old_size; | |
2822 | unsigned int size_diff; | |
2823 | int i; | |
2824 | ||
2825 | slot_orig = path->slots[0]; | |
5f39d397 | 2826 | leaf = path->nodes[0]; |
179e29e4 CM |
2827 | slot = path->slots[0]; |
2828 | ||
2829 | old_size = btrfs_item_size_nr(leaf, slot); | |
2830 | if (old_size == new_size) | |
2831 | return 0; | |
b18c6685 | 2832 | |
5f39d397 | 2833 | nritems = btrfs_header_nritems(leaf); |
b18c6685 CM |
2834 | data_end = leaf_data_end(root, leaf); |
2835 | ||
5f39d397 | 2836 | old_data_start = btrfs_item_offset_nr(leaf, slot); |
179e29e4 | 2837 | |
b18c6685 CM |
2838 | size_diff = old_size - new_size; |
2839 | ||
2840 | BUG_ON(slot < 0); | |
2841 | BUG_ON(slot >= nritems); | |
2842 | ||
2843 | /* | |
2844 | * item0..itemN ... dataN.offset..dataN.size .. data0.size | |
2845 | */ | |
2846 | /* first correct the data pointers */ | |
2847 | for (i = slot; i < nritems; i++) { | |
5f39d397 CM |
2848 | u32 ioff; |
2849 | item = btrfs_item_nr(leaf, i); | |
db94535d CM |
2850 | |
2851 | if (!leaf->map_token) { | |
2852 | map_extent_buffer(leaf, (unsigned long)item, | |
2853 | sizeof(struct btrfs_item), | |
2854 | &leaf->map_token, &leaf->kaddr, | |
2855 | &leaf->map_start, &leaf->map_len, | |
2856 | KM_USER1); | |
2857 | } | |
2858 | ||
5f39d397 CM |
2859 | ioff = btrfs_item_offset(leaf, item); |
2860 | btrfs_set_item_offset(leaf, item, ioff + size_diff); | |
b18c6685 | 2861 | } |
db94535d CM |
2862 | |
2863 | if (leaf->map_token) { | |
2864 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); | |
2865 | leaf->map_token = NULL; | |
2866 | } | |
2867 | ||
b18c6685 | 2868 | /* shift the data */ |
179e29e4 CM |
2869 | if (from_end) { |
2870 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + | |
2871 | data_end + size_diff, btrfs_leaf_data(leaf) + | |
2872 | data_end, old_data_start + new_size - data_end); | |
2873 | } else { | |
2874 | struct btrfs_disk_key disk_key; | |
2875 | u64 offset; | |
2876 | ||
2877 | btrfs_item_key(leaf, &disk_key, slot); | |
2878 | ||
2879 | if (btrfs_disk_key_type(&disk_key) == BTRFS_EXTENT_DATA_KEY) { | |
2880 | unsigned long ptr; | |
2881 | struct btrfs_file_extent_item *fi; | |
2882 | ||
2883 | fi = btrfs_item_ptr(leaf, slot, | |
2884 | struct btrfs_file_extent_item); | |
2885 | fi = (struct btrfs_file_extent_item *)( | |
2886 | (unsigned long)fi - size_diff); | |
2887 | ||
2888 | if (btrfs_file_extent_type(leaf, fi) == | |
2889 | BTRFS_FILE_EXTENT_INLINE) { | |
2890 | ptr = btrfs_item_ptr_offset(leaf, slot); | |
2891 | memmove_extent_buffer(leaf, ptr, | |
2892 | (unsigned long)fi, | |
2893 | offsetof(struct btrfs_file_extent_item, | |
2894 | disk_bytenr)); | |
2895 | } | |
2896 | } | |
2897 | ||
2898 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + | |
2899 | data_end + size_diff, btrfs_leaf_data(leaf) + | |
2900 | data_end, old_data_start - data_end); | |
2901 | ||
2902 | offset = btrfs_disk_key_offset(&disk_key); | |
2903 | btrfs_set_disk_key_offset(&disk_key, offset + size_diff); | |
2904 | btrfs_set_item_key(leaf, &disk_key, slot); | |
2905 | if (slot == 0) | |
2906 | fixup_low_keys(trans, root, path, &disk_key, 1); | |
2907 | } | |
5f39d397 CM |
2908 | |
2909 | item = btrfs_item_nr(leaf, slot); | |
2910 | btrfs_set_item_size(leaf, item, new_size); | |
2911 | btrfs_mark_buffer_dirty(leaf); | |
b18c6685 CM |
2912 | |
2913 | ret = 0; | |
5f39d397 CM |
2914 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
2915 | btrfs_print_leaf(root, leaf); | |
b18c6685 | 2916 | BUG(); |
5f39d397 | 2917 | } |
b18c6685 CM |
2918 | return ret; |
2919 | } | |
2920 | ||
d352ac68 CM |
2921 | /* |
2922 | * make the item pointed to by the path bigger, data_size is the new size. | |
2923 | */ | |
5f39d397 CM |
2924 | int btrfs_extend_item(struct btrfs_trans_handle *trans, |
2925 | struct btrfs_root *root, struct btrfs_path *path, | |
2926 | u32 data_size) | |
6567e837 CM |
2927 | { |
2928 | int ret = 0; | |
2929 | int slot; | |
2930 | int slot_orig; | |
5f39d397 CM |
2931 | struct extent_buffer *leaf; |
2932 | struct btrfs_item *item; | |
6567e837 CM |
2933 | u32 nritems; |
2934 | unsigned int data_end; | |
2935 | unsigned int old_data; | |
2936 | unsigned int old_size; | |
2937 | int i; | |
2938 | ||
2939 | slot_orig = path->slots[0]; | |
5f39d397 | 2940 | leaf = path->nodes[0]; |
6567e837 | 2941 | |
5f39d397 | 2942 | nritems = btrfs_header_nritems(leaf); |
6567e837 CM |
2943 | data_end = leaf_data_end(root, leaf); |
2944 | ||
5f39d397 CM |
2945 | if (btrfs_leaf_free_space(root, leaf) < data_size) { |
2946 | btrfs_print_leaf(root, leaf); | |
6567e837 | 2947 | BUG(); |
5f39d397 | 2948 | } |
6567e837 | 2949 | slot = path->slots[0]; |
5f39d397 | 2950 | old_data = btrfs_item_end_nr(leaf, slot); |
6567e837 CM |
2951 | |
2952 | BUG_ON(slot < 0); | |
3326d1b0 CM |
2953 | if (slot >= nritems) { |
2954 | btrfs_print_leaf(root, leaf); | |
2955 | printk("slot %d too large, nritems %d\n", slot, nritems); | |
2956 | BUG_ON(1); | |
2957 | } | |
6567e837 CM |
2958 | |
2959 | /* | |
2960 | * item0..itemN ... dataN.offset..dataN.size .. data0.size | |
2961 | */ | |
2962 | /* first correct the data pointers */ | |
2963 | for (i = slot; i < nritems; i++) { | |
5f39d397 CM |
2964 | u32 ioff; |
2965 | item = btrfs_item_nr(leaf, i); | |
db94535d CM |
2966 | |
2967 | if (!leaf->map_token) { | |
2968 | map_extent_buffer(leaf, (unsigned long)item, | |
2969 | sizeof(struct btrfs_item), | |
2970 | &leaf->map_token, &leaf->kaddr, | |
2971 | &leaf->map_start, &leaf->map_len, | |
2972 | KM_USER1); | |
2973 | } | |
5f39d397 CM |
2974 | ioff = btrfs_item_offset(leaf, item); |
2975 | btrfs_set_item_offset(leaf, item, ioff - data_size); | |
6567e837 | 2976 | } |
5f39d397 | 2977 | |
db94535d CM |
2978 | if (leaf->map_token) { |
2979 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); | |
2980 | leaf->map_token = NULL; | |
2981 | } | |
2982 | ||
6567e837 | 2983 | /* shift the data */ |
5f39d397 | 2984 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
6567e837 CM |
2985 | data_end - data_size, btrfs_leaf_data(leaf) + |
2986 | data_end, old_data - data_end); | |
5f39d397 | 2987 | |
6567e837 | 2988 | data_end = old_data; |
5f39d397 CM |
2989 | old_size = btrfs_item_size_nr(leaf, slot); |
2990 | item = btrfs_item_nr(leaf, slot); | |
2991 | btrfs_set_item_size(leaf, item, old_size + data_size); | |
2992 | btrfs_mark_buffer_dirty(leaf); | |
6567e837 CM |
2993 | |
2994 | ret = 0; | |
5f39d397 CM |
2995 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
2996 | btrfs_print_leaf(root, leaf); | |
6567e837 | 2997 | BUG(); |
5f39d397 | 2998 | } |
6567e837 CM |
2999 | return ret; |
3000 | } | |
3001 | ||
74123bd7 | 3002 | /* |
d352ac68 | 3003 | * Given a key and some data, insert items into the tree. |
74123bd7 CM |
3004 | * This does all the path init required, making room in the tree if needed. |
3005 | */ | |
9c58309d | 3006 | int btrfs_insert_empty_items(struct btrfs_trans_handle *trans, |
5f39d397 CM |
3007 | struct btrfs_root *root, |
3008 | struct btrfs_path *path, | |
9c58309d CM |
3009 | struct btrfs_key *cpu_key, u32 *data_size, |
3010 | int nr) | |
be0e5c09 | 3011 | { |
5f39d397 CM |
3012 | struct extent_buffer *leaf; |
3013 | struct btrfs_item *item; | |
aa5d6bed | 3014 | int ret = 0; |
be0e5c09 | 3015 | int slot; |
eb60ceac | 3016 | int slot_orig; |
9c58309d | 3017 | int i; |
7518a238 | 3018 | u32 nritems; |
9c58309d CM |
3019 | u32 total_size = 0; |
3020 | u32 total_data = 0; | |
be0e5c09 | 3021 | unsigned int data_end; |
e2fa7227 CM |
3022 | struct btrfs_disk_key disk_key; |
3023 | ||
9c58309d CM |
3024 | for (i = 0; i < nr; i++) { |
3025 | total_data += data_size[i]; | |
3026 | } | |
be0e5c09 | 3027 | |
7b128766 | 3028 | total_size = total_data + (nr * sizeof(struct btrfs_item)); |
9c58309d | 3029 | ret = btrfs_search_slot(trans, root, cpu_key, path, total_size, 1); |
0f9dd46c | 3030 | if (ret == 0) |
f0930a37 | 3031 | return -EEXIST; |
ed2ff2cb CM |
3032 | if (ret < 0) |
3033 | goto out; | |
be0e5c09 | 3034 | |
62e2749e | 3035 | slot_orig = path->slots[0]; |
5f39d397 | 3036 | leaf = path->nodes[0]; |
74123bd7 | 3037 | |
5f39d397 | 3038 | nritems = btrfs_header_nritems(leaf); |
123abc88 | 3039 | data_end = leaf_data_end(root, leaf); |
eb60ceac | 3040 | |
f25956cc | 3041 | if (btrfs_leaf_free_space(root, leaf) < total_size) { |
3326d1b0 CM |
3042 | btrfs_print_leaf(root, leaf); |
3043 | printk("not enough freespace need %u have %d\n", | |
9c58309d | 3044 | total_size, btrfs_leaf_free_space(root, leaf)); |
be0e5c09 | 3045 | BUG(); |
d4dbff95 | 3046 | } |
5f39d397 | 3047 | |
62e2749e | 3048 | slot = path->slots[0]; |
eb60ceac | 3049 | BUG_ON(slot < 0); |
5f39d397 | 3050 | |
be0e5c09 | 3051 | if (slot != nritems) { |
5f39d397 | 3052 | unsigned int old_data = btrfs_item_end_nr(leaf, slot); |
be0e5c09 | 3053 | |
5f39d397 CM |
3054 | if (old_data < data_end) { |
3055 | btrfs_print_leaf(root, leaf); | |
3056 | printk("slot %d old_data %d data_end %d\n", | |
3057 | slot, old_data, data_end); | |
3058 | BUG_ON(1); | |
3059 | } | |
be0e5c09 CM |
3060 | /* |
3061 | * item0..itemN ... dataN.offset..dataN.size .. data0.size | |
3062 | */ | |
3063 | /* first correct the data pointers */ | |
db94535d | 3064 | WARN_ON(leaf->map_token); |
0783fcfc | 3065 | for (i = slot; i < nritems; i++) { |
5f39d397 | 3066 | u32 ioff; |
db94535d | 3067 | |
5f39d397 | 3068 | item = btrfs_item_nr(leaf, i); |
db94535d CM |
3069 | if (!leaf->map_token) { |
3070 | map_extent_buffer(leaf, (unsigned long)item, | |
3071 | sizeof(struct btrfs_item), | |
3072 | &leaf->map_token, &leaf->kaddr, | |
3073 | &leaf->map_start, &leaf->map_len, | |
3074 | KM_USER1); | |
3075 | } | |
3076 | ||
5f39d397 | 3077 | ioff = btrfs_item_offset(leaf, item); |
9c58309d | 3078 | btrfs_set_item_offset(leaf, item, ioff - total_data); |
0783fcfc | 3079 | } |
db94535d CM |
3080 | if (leaf->map_token) { |
3081 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); | |
3082 | leaf->map_token = NULL; | |
3083 | } | |
be0e5c09 CM |
3084 | |
3085 | /* shift the items */ | |
9c58309d | 3086 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + nr), |
5f39d397 | 3087 | btrfs_item_nr_offset(slot), |
d6025579 | 3088 | (nritems - slot) * sizeof(struct btrfs_item)); |
be0e5c09 CM |
3089 | |
3090 | /* shift the data */ | |
5f39d397 | 3091 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + |
9c58309d | 3092 | data_end - total_data, btrfs_leaf_data(leaf) + |
d6025579 | 3093 | data_end, old_data - data_end); |
be0e5c09 CM |
3094 | data_end = old_data; |
3095 | } | |
5f39d397 | 3096 | |
62e2749e | 3097 | /* setup the item for the new data */ |
9c58309d CM |
3098 | for (i = 0; i < nr; i++) { |
3099 | btrfs_cpu_key_to_disk(&disk_key, cpu_key + i); | |
3100 | btrfs_set_item_key(leaf, &disk_key, slot + i); | |
3101 | item = btrfs_item_nr(leaf, slot + i); | |
3102 | btrfs_set_item_offset(leaf, item, data_end - data_size[i]); | |
3103 | data_end -= data_size[i]; | |
3104 | btrfs_set_item_size(leaf, item, data_size[i]); | |
3105 | } | |
3106 | btrfs_set_header_nritems(leaf, nritems + nr); | |
5f39d397 | 3107 | btrfs_mark_buffer_dirty(leaf); |
aa5d6bed CM |
3108 | |
3109 | ret = 0; | |
5a01a2e3 CM |
3110 | if (slot == 0) { |
3111 | btrfs_cpu_key_to_disk(&disk_key, cpu_key); | |
e089f05c | 3112 | ret = fixup_low_keys(trans, root, path, &disk_key, 1); |
5a01a2e3 | 3113 | } |
aa5d6bed | 3114 | |
5f39d397 CM |
3115 | if (btrfs_leaf_free_space(root, leaf) < 0) { |
3116 | btrfs_print_leaf(root, leaf); | |
be0e5c09 | 3117 | BUG(); |
5f39d397 | 3118 | } |
ed2ff2cb | 3119 | out: |
62e2749e CM |
3120 | return ret; |
3121 | } | |
3122 | ||
3123 | /* | |
3124 | * Given a key and some data, insert an item into the tree. | |
3125 | * This does all the path init required, making room in the tree if needed. | |
3126 | */ | |
e089f05c CM |
3127 | int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root |
3128 | *root, struct btrfs_key *cpu_key, void *data, u32 | |
3129 | data_size) | |
62e2749e CM |
3130 | { |
3131 | int ret = 0; | |
2c90e5d6 | 3132 | struct btrfs_path *path; |
5f39d397 CM |
3133 | struct extent_buffer *leaf; |
3134 | unsigned long ptr; | |
62e2749e | 3135 | |
2c90e5d6 CM |
3136 | path = btrfs_alloc_path(); |
3137 | BUG_ON(!path); | |
2c90e5d6 | 3138 | ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size); |
62e2749e | 3139 | if (!ret) { |
5f39d397 CM |
3140 | leaf = path->nodes[0]; |
3141 | ptr = btrfs_item_ptr_offset(leaf, path->slots[0]); | |
3142 | write_extent_buffer(leaf, data, ptr, data_size); | |
3143 | btrfs_mark_buffer_dirty(leaf); | |
62e2749e | 3144 | } |
2c90e5d6 | 3145 | btrfs_free_path(path); |
aa5d6bed | 3146 | return ret; |
be0e5c09 CM |
3147 | } |
3148 | ||
74123bd7 | 3149 | /* |
5de08d7d | 3150 | * delete the pointer from a given node. |
74123bd7 | 3151 | * |
d352ac68 CM |
3152 | * the tree should have been previously balanced so the deletion does not |
3153 | * empty a node. | |
74123bd7 | 3154 | */ |
e089f05c CM |
3155 | static int del_ptr(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
3156 | struct btrfs_path *path, int level, int slot) | |
be0e5c09 | 3157 | { |
5f39d397 | 3158 | struct extent_buffer *parent = path->nodes[level]; |
7518a238 | 3159 | u32 nritems; |
aa5d6bed | 3160 | int ret = 0; |
bb803951 | 3161 | int wret; |
be0e5c09 | 3162 | |
5f39d397 | 3163 | nritems = btrfs_header_nritems(parent); |
bb803951 | 3164 | if (slot != nritems -1) { |
5f39d397 CM |
3165 | memmove_extent_buffer(parent, |
3166 | btrfs_node_key_ptr_offset(slot), | |
3167 | btrfs_node_key_ptr_offset(slot + 1), | |
d6025579 CM |
3168 | sizeof(struct btrfs_key_ptr) * |
3169 | (nritems - slot - 1)); | |
bb803951 | 3170 | } |
7518a238 | 3171 | nritems--; |
5f39d397 | 3172 | btrfs_set_header_nritems(parent, nritems); |
7518a238 | 3173 | if (nritems == 0 && parent == root->node) { |
5f39d397 | 3174 | BUG_ON(btrfs_header_level(root->node) != 1); |
bb803951 | 3175 | /* just turn the root into a leaf and break */ |
5f39d397 | 3176 | btrfs_set_header_level(root->node, 0); |
bb803951 | 3177 | } else if (slot == 0) { |
5f39d397 CM |
3178 | struct btrfs_disk_key disk_key; |
3179 | ||
3180 | btrfs_node_key(parent, &disk_key, 0); | |
3181 | wret = fixup_low_keys(trans, root, path, &disk_key, level + 1); | |
0f70abe2 CM |
3182 | if (wret) |
3183 | ret = wret; | |
be0e5c09 | 3184 | } |
d6025579 | 3185 | btrfs_mark_buffer_dirty(parent); |
aa5d6bed | 3186 | return ret; |
be0e5c09 CM |
3187 | } |
3188 | ||
74123bd7 CM |
3189 | /* |
3190 | * delete the item at the leaf level in path. If that empties | |
3191 | * the leaf, remove it from the tree | |
3192 | */ | |
85e21bac CM |
3193 | int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
3194 | struct btrfs_path *path, int slot, int nr) | |
be0e5c09 | 3195 | { |
5f39d397 CM |
3196 | struct extent_buffer *leaf; |
3197 | struct btrfs_item *item; | |
85e21bac CM |
3198 | int last_off; |
3199 | int dsize = 0; | |
aa5d6bed CM |
3200 | int ret = 0; |
3201 | int wret; | |
85e21bac | 3202 | int i; |
7518a238 | 3203 | u32 nritems; |
be0e5c09 | 3204 | |
5f39d397 | 3205 | leaf = path->nodes[0]; |
85e21bac CM |
3206 | last_off = btrfs_item_offset_nr(leaf, slot + nr - 1); |
3207 | ||
3208 | for (i = 0; i < nr; i++) | |
3209 | dsize += btrfs_item_size_nr(leaf, slot + i); | |
3210 | ||
5f39d397 | 3211 | nritems = btrfs_header_nritems(leaf); |
be0e5c09 | 3212 | |
85e21bac | 3213 | if (slot + nr != nritems) { |
123abc88 | 3214 | int data_end = leaf_data_end(root, leaf); |
5f39d397 CM |
3215 | |
3216 | memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) + | |
d6025579 CM |
3217 | data_end + dsize, |
3218 | btrfs_leaf_data(leaf) + data_end, | |
85e21bac | 3219 | last_off - data_end); |
5f39d397 | 3220 | |
85e21bac | 3221 | for (i = slot + nr; i < nritems; i++) { |
5f39d397 | 3222 | u32 ioff; |
db94535d | 3223 | |
5f39d397 | 3224 | item = btrfs_item_nr(leaf, i); |
db94535d CM |
3225 | if (!leaf->map_token) { |
3226 | map_extent_buffer(leaf, (unsigned long)item, | |
3227 | sizeof(struct btrfs_item), | |
3228 | &leaf->map_token, &leaf->kaddr, | |
3229 | &leaf->map_start, &leaf->map_len, | |
3230 | KM_USER1); | |
3231 | } | |
5f39d397 CM |
3232 | ioff = btrfs_item_offset(leaf, item); |
3233 | btrfs_set_item_offset(leaf, item, ioff + dsize); | |
0783fcfc | 3234 | } |
db94535d CM |
3235 | |
3236 | if (leaf->map_token) { | |
3237 | unmap_extent_buffer(leaf, leaf->map_token, KM_USER1); | |
3238 | leaf->map_token = NULL; | |
3239 | } | |
3240 | ||
5f39d397 | 3241 | memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot), |
85e21bac | 3242 | btrfs_item_nr_offset(slot + nr), |
d6025579 | 3243 | sizeof(struct btrfs_item) * |
85e21bac | 3244 | (nritems - slot - nr)); |
be0e5c09 | 3245 | } |
85e21bac CM |
3246 | btrfs_set_header_nritems(leaf, nritems - nr); |
3247 | nritems -= nr; | |
5f39d397 | 3248 | |
74123bd7 | 3249 | /* delete the leaf if we've emptied it */ |
7518a238 | 3250 | if (nritems == 0) { |
5f39d397 CM |
3251 | if (leaf == root->node) { |
3252 | btrfs_set_header_level(leaf, 0); | |
9a8dd150 | 3253 | } else { |
7bb86316 | 3254 | u64 root_gen = btrfs_header_generation(path->nodes[1]); |
e089f05c | 3255 | wret = del_ptr(trans, root, path, 1, path->slots[1]); |
aa5d6bed CM |
3256 | if (wret) |
3257 | ret = wret; | |
e089f05c | 3258 | wret = btrfs_free_extent(trans, root, |
7bb86316 | 3259 | leaf->start, leaf->len, |
31840ae1 | 3260 | path->nodes[1]->start, |
7bb86316 CM |
3261 | btrfs_header_owner(path->nodes[1]), |
3262 | root_gen, 0, 0, 1); | |
0f70abe2 CM |
3263 | if (wret) |
3264 | ret = wret; | |
9a8dd150 | 3265 | } |
be0e5c09 | 3266 | } else { |
7518a238 | 3267 | int used = leaf_space_used(leaf, 0, nritems); |
aa5d6bed | 3268 | if (slot == 0) { |
5f39d397 CM |
3269 | struct btrfs_disk_key disk_key; |
3270 | ||
3271 | btrfs_item_key(leaf, &disk_key, 0); | |
e089f05c | 3272 | wret = fixup_low_keys(trans, root, path, |
5f39d397 | 3273 | &disk_key, 1); |
aa5d6bed CM |
3274 | if (wret) |
3275 | ret = wret; | |
3276 | } | |
aa5d6bed | 3277 | |
74123bd7 | 3278 | /* delete the leaf if it is mostly empty */ |
85e21bac | 3279 | if (used < BTRFS_LEAF_DATA_SIZE(root) / 4) { |
be0e5c09 CM |
3280 | /* push_leaf_left fixes the path. |
3281 | * make sure the path still points to our leaf | |
3282 | * for possible call to del_ptr below | |
3283 | */ | |
4920c9ac | 3284 | slot = path->slots[1]; |
5f39d397 CM |
3285 | extent_buffer_get(leaf); |
3286 | ||
85e21bac | 3287 | wret = push_leaf_left(trans, root, path, 1, 1); |
54aa1f4d | 3288 | if (wret < 0 && wret != -ENOSPC) |
aa5d6bed | 3289 | ret = wret; |
5f39d397 CM |
3290 | |
3291 | if (path->nodes[0] == leaf && | |
3292 | btrfs_header_nritems(leaf)) { | |
85e21bac | 3293 | wret = push_leaf_right(trans, root, path, 1, 1); |
54aa1f4d | 3294 | if (wret < 0 && wret != -ENOSPC) |
aa5d6bed CM |
3295 | ret = wret; |
3296 | } | |
5f39d397 CM |
3297 | |
3298 | if (btrfs_header_nritems(leaf) == 0) { | |
7bb86316 | 3299 | u64 root_gen; |
db94535d CM |
3300 | u64 bytenr = leaf->start; |
3301 | u32 blocksize = leaf->len; | |
5f39d397 | 3302 | |
7bb86316 CM |
3303 | root_gen = btrfs_header_generation( |
3304 | path->nodes[1]); | |
3305 | ||
e089f05c | 3306 | wret = del_ptr(trans, root, path, 1, slot); |
aa5d6bed CM |
3307 | if (wret) |
3308 | ret = wret; | |
5f39d397 CM |
3309 | |
3310 | free_extent_buffer(leaf); | |
db94535d | 3311 | wret = btrfs_free_extent(trans, root, bytenr, |
31840ae1 | 3312 | blocksize, path->nodes[1]->start, |
7bb86316 CM |
3313 | btrfs_header_owner(path->nodes[1]), |
3314 | root_gen, 0, 0, 1); | |
0f70abe2 CM |
3315 | if (wret) |
3316 | ret = wret; | |
5de08d7d | 3317 | } else { |
925baedd CM |
3318 | /* if we're still in the path, make sure |
3319 | * we're dirty. Otherwise, one of the | |
3320 | * push_leaf functions must have already | |
3321 | * dirtied this buffer | |
3322 | */ | |
3323 | if (path->nodes[0] == leaf) | |
3324 | btrfs_mark_buffer_dirty(leaf); | |
5f39d397 | 3325 | free_extent_buffer(leaf); |
be0e5c09 | 3326 | } |
d5719762 | 3327 | } else { |
5f39d397 | 3328 | btrfs_mark_buffer_dirty(leaf); |
be0e5c09 CM |
3329 | } |
3330 | } | |
aa5d6bed | 3331 | return ret; |
be0e5c09 CM |
3332 | } |
3333 | ||
7bb86316 | 3334 | /* |
925baedd | 3335 | * search the tree again to find a leaf with lesser keys |
7bb86316 CM |
3336 | * returns 0 if it found something or 1 if there are no lesser leaves. |
3337 | * returns < 0 on io errors. | |
d352ac68 CM |
3338 | * |
3339 | * This may release the path, and so you may lose any locks held at the | |
3340 | * time you call it. | |
7bb86316 CM |
3341 | */ |
3342 | int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path) | |
3343 | { | |
925baedd CM |
3344 | struct btrfs_key key; |
3345 | struct btrfs_disk_key found_key; | |
3346 | int ret; | |
7bb86316 | 3347 | |
925baedd | 3348 | btrfs_item_key_to_cpu(path->nodes[0], &key, 0); |
7bb86316 | 3349 | |
925baedd CM |
3350 | if (key.offset > 0) |
3351 | key.offset--; | |
3352 | else if (key.type > 0) | |
3353 | key.type--; | |
3354 | else if (key.objectid > 0) | |
3355 | key.objectid--; | |
3356 | else | |
3357 | return 1; | |
7bb86316 | 3358 | |
925baedd CM |
3359 | btrfs_release_path(root, path); |
3360 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
3361 | if (ret < 0) | |
3362 | return ret; | |
3363 | btrfs_item_key(path->nodes[0], &found_key, 0); | |
3364 | ret = comp_keys(&found_key, &key); | |
3365 | if (ret < 0) | |
3366 | return 0; | |
3367 | return 1; | |
7bb86316 CM |
3368 | } |
3369 | ||
3f157a2f CM |
3370 | /* |
3371 | * A helper function to walk down the tree starting at min_key, and looking | |
3372 | * for nodes or leaves that are either in cache or have a minimum | |
d352ac68 | 3373 | * transaction id. This is used by the btree defrag code, and tree logging |
3f157a2f CM |
3374 | * |
3375 | * This does not cow, but it does stuff the starting key it finds back | |
3376 | * into min_key, so you can call btrfs_search_slot with cow=1 on the | |
3377 | * key and get a writable path. | |
3378 | * | |
3379 | * This does lock as it descends, and path->keep_locks should be set | |
3380 | * to 1 by the caller. | |
3381 | * | |
3382 | * This honors path->lowest_level to prevent descent past a given level | |
3383 | * of the tree. | |
3384 | * | |
d352ac68 CM |
3385 | * min_trans indicates the oldest transaction that you are interested |
3386 | * in walking through. Any nodes or leaves older than min_trans are | |
3387 | * skipped over (without reading them). | |
3388 | * | |
3f157a2f CM |
3389 | * returns zero if something useful was found, < 0 on error and 1 if there |
3390 | * was nothing in the tree that matched the search criteria. | |
3391 | */ | |
3392 | int btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key, | |
e02119d5 | 3393 | struct btrfs_key *max_key, |
3f157a2f CM |
3394 | struct btrfs_path *path, int cache_only, |
3395 | u64 min_trans) | |
3396 | { | |
3397 | struct extent_buffer *cur; | |
3398 | struct btrfs_key found_key; | |
3399 | int slot; | |
9652480b | 3400 | int sret; |
3f157a2f CM |
3401 | u32 nritems; |
3402 | int level; | |
3403 | int ret = 1; | |
3404 | ||
3405 | again: | |
3406 | cur = btrfs_lock_root_node(root); | |
3407 | level = btrfs_header_level(cur); | |
e02119d5 | 3408 | WARN_ON(path->nodes[level]); |
3f157a2f CM |
3409 | path->nodes[level] = cur; |
3410 | path->locks[level] = 1; | |
3411 | ||
3412 | if (btrfs_header_generation(cur) < min_trans) { | |
3413 | ret = 1; | |
3414 | goto out; | |
3415 | } | |
3416 | while(1) { | |
3417 | nritems = btrfs_header_nritems(cur); | |
3418 | level = btrfs_header_level(cur); | |
9652480b | 3419 | sret = bin_search(cur, min_key, level, &slot); |
3f157a2f CM |
3420 | |
3421 | /* at level = 0, we're done, setup the path and exit */ | |
3422 | if (level == 0) { | |
e02119d5 CM |
3423 | if (slot >= nritems) |
3424 | goto find_next_key; | |
3f157a2f CM |
3425 | ret = 0; |
3426 | path->slots[level] = slot; | |
3427 | btrfs_item_key_to_cpu(cur, &found_key, slot); | |
3428 | goto out; | |
3429 | } | |
9652480b Y |
3430 | if (sret && slot > 0) |
3431 | slot--; | |
3f157a2f CM |
3432 | /* |
3433 | * check this node pointer against the cache_only and | |
3434 | * min_trans parameters. If it isn't in cache or is too | |
3435 | * old, skip to the next one. | |
3436 | */ | |
3437 | while(slot < nritems) { | |
3438 | u64 blockptr; | |
3439 | u64 gen; | |
3440 | struct extent_buffer *tmp; | |
e02119d5 CM |
3441 | struct btrfs_disk_key disk_key; |
3442 | ||
3f157a2f CM |
3443 | blockptr = btrfs_node_blockptr(cur, slot); |
3444 | gen = btrfs_node_ptr_generation(cur, slot); | |
3445 | if (gen < min_trans) { | |
3446 | slot++; | |
3447 | continue; | |
3448 | } | |
3449 | if (!cache_only) | |
3450 | break; | |
3451 | ||
e02119d5 CM |
3452 | if (max_key) { |
3453 | btrfs_node_key(cur, &disk_key, slot); | |
3454 | if (comp_keys(&disk_key, max_key) >= 0) { | |
3455 | ret = 1; | |
3456 | goto out; | |
3457 | } | |
3458 | } | |
3459 | ||
3f157a2f CM |
3460 | tmp = btrfs_find_tree_block(root, blockptr, |
3461 | btrfs_level_size(root, level - 1)); | |
3462 | ||
3463 | if (tmp && btrfs_buffer_uptodate(tmp, gen)) { | |
3464 | free_extent_buffer(tmp); | |
3465 | break; | |
3466 | } | |
3467 | if (tmp) | |
3468 | free_extent_buffer(tmp); | |
3469 | slot++; | |
3470 | } | |
e02119d5 | 3471 | find_next_key: |
3f157a2f CM |
3472 | /* |
3473 | * we didn't find a candidate key in this node, walk forward | |
3474 | * and find another one | |
3475 | */ | |
3476 | if (slot >= nritems) { | |
e02119d5 CM |
3477 | path->slots[level] = slot; |
3478 | sret = btrfs_find_next_key(root, path, min_key, level, | |
3f157a2f | 3479 | cache_only, min_trans); |
e02119d5 | 3480 | if (sret == 0) { |
3f157a2f CM |
3481 | btrfs_release_path(root, path); |
3482 | goto again; | |
3483 | } else { | |
3484 | goto out; | |
3485 | } | |
3486 | } | |
3487 | /* save our key for returning back */ | |
3488 | btrfs_node_key_to_cpu(cur, &found_key, slot); | |
3489 | path->slots[level] = slot; | |
3490 | if (level == path->lowest_level) { | |
3491 | ret = 0; | |
3492 | unlock_up(path, level, 1); | |
3493 | goto out; | |
3494 | } | |
3495 | cur = read_node_slot(root, cur, slot); | |
3496 | ||
3497 | btrfs_tree_lock(cur); | |
3498 | path->locks[level - 1] = 1; | |
3499 | path->nodes[level - 1] = cur; | |
3500 | unlock_up(path, level, 1); | |
3501 | } | |
3502 | out: | |
3503 | if (ret == 0) | |
3504 | memcpy(min_key, &found_key, sizeof(found_key)); | |
3505 | return ret; | |
3506 | } | |
3507 | ||
3508 | /* | |
3509 | * this is similar to btrfs_next_leaf, but does not try to preserve | |
3510 | * and fixup the path. It looks for and returns the next key in the | |
3511 | * tree based on the current path and the cache_only and min_trans | |
3512 | * parameters. | |
3513 | * | |
3514 | * 0 is returned if another key is found, < 0 if there are any errors | |
3515 | * and 1 is returned if there are no higher keys in the tree | |
3516 | * | |
3517 | * path->keep_locks should be set to 1 on the search made before | |
3518 | * calling this function. | |
3519 | */ | |
e7a84565 | 3520 | int btrfs_find_next_key(struct btrfs_root *root, struct btrfs_path *path, |
3f157a2f CM |
3521 | struct btrfs_key *key, int lowest_level, |
3522 | int cache_only, u64 min_trans) | |
e7a84565 CM |
3523 | { |
3524 | int level = lowest_level; | |
3525 | int slot; | |
3526 | struct extent_buffer *c; | |
3527 | ||
3528 | while(level < BTRFS_MAX_LEVEL) { | |
3529 | if (!path->nodes[level]) | |
3530 | return 1; | |
3531 | ||
3532 | slot = path->slots[level] + 1; | |
3533 | c = path->nodes[level]; | |
3f157a2f | 3534 | next: |
e7a84565 CM |
3535 | if (slot >= btrfs_header_nritems(c)) { |
3536 | level++; | |
3537 | if (level == BTRFS_MAX_LEVEL) { | |
3538 | return 1; | |
3539 | } | |
3540 | continue; | |
3541 | } | |
3542 | if (level == 0) | |
3543 | btrfs_item_key_to_cpu(c, key, slot); | |
3f157a2f CM |
3544 | else { |
3545 | u64 blockptr = btrfs_node_blockptr(c, slot); | |
3546 | u64 gen = btrfs_node_ptr_generation(c, slot); | |
3547 | ||
3548 | if (cache_only) { | |
3549 | struct extent_buffer *cur; | |
3550 | cur = btrfs_find_tree_block(root, blockptr, | |
3551 | btrfs_level_size(root, level - 1)); | |
3552 | if (!cur || !btrfs_buffer_uptodate(cur, gen)) { | |
3553 | slot++; | |
3554 | if (cur) | |
3555 | free_extent_buffer(cur); | |
3556 | goto next; | |
3557 | } | |
3558 | free_extent_buffer(cur); | |
3559 | } | |
3560 | if (gen < min_trans) { | |
3561 | slot++; | |
3562 | goto next; | |
3563 | } | |
e7a84565 | 3564 | btrfs_node_key_to_cpu(c, key, slot); |
3f157a2f | 3565 | } |
e7a84565 CM |
3566 | return 0; |
3567 | } | |
3568 | return 1; | |
3569 | } | |
3570 | ||
97571fd0 | 3571 | /* |
925baedd | 3572 | * search the tree again to find a leaf with greater keys |
0f70abe2 CM |
3573 | * returns 0 if it found something or 1 if there are no greater leaves. |
3574 | * returns < 0 on io errors. | |
97571fd0 | 3575 | */ |
234b63a0 | 3576 | int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path) |
d97e63b6 CM |
3577 | { |
3578 | int slot; | |
3579 | int level = 1; | |
5f39d397 CM |
3580 | struct extent_buffer *c; |
3581 | struct extent_buffer *next = NULL; | |
925baedd CM |
3582 | struct btrfs_key key; |
3583 | u32 nritems; | |
3584 | int ret; | |
3585 | ||
3586 | nritems = btrfs_header_nritems(path->nodes[0]); | |
3587 | if (nritems == 0) { | |
3588 | return 1; | |
3589 | } | |
3590 | ||
3591 | btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1); | |
3592 | ||
925baedd | 3593 | btrfs_release_path(root, path); |
a2135011 | 3594 | path->keep_locks = 1; |
925baedd CM |
3595 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
3596 | path->keep_locks = 0; | |
3597 | ||
3598 | if (ret < 0) | |
3599 | return ret; | |
3600 | ||
a2135011 | 3601 | nritems = btrfs_header_nritems(path->nodes[0]); |
168fd7d2 CM |
3602 | /* |
3603 | * by releasing the path above we dropped all our locks. A balance | |
3604 | * could have added more items next to the key that used to be | |
3605 | * at the very end of the block. So, check again here and | |
3606 | * advance the path if there are now more items available. | |
3607 | */ | |
a2135011 | 3608 | if (nritems > 0 && path->slots[0] < nritems - 1) { |
168fd7d2 | 3609 | path->slots[0]++; |
925baedd CM |
3610 | goto done; |
3611 | } | |
d97e63b6 | 3612 | |
234b63a0 | 3613 | while(level < BTRFS_MAX_LEVEL) { |
d97e63b6 | 3614 | if (!path->nodes[level]) |
0f70abe2 | 3615 | return 1; |
5f39d397 | 3616 | |
d97e63b6 CM |
3617 | slot = path->slots[level] + 1; |
3618 | c = path->nodes[level]; | |
5f39d397 | 3619 | if (slot >= btrfs_header_nritems(c)) { |
d97e63b6 | 3620 | level++; |
925baedd | 3621 | if (level == BTRFS_MAX_LEVEL) { |
7bb86316 | 3622 | return 1; |
925baedd | 3623 | } |
d97e63b6 CM |
3624 | continue; |
3625 | } | |
5f39d397 | 3626 | |
925baedd CM |
3627 | if (next) { |
3628 | btrfs_tree_unlock(next); | |
5f39d397 | 3629 | free_extent_buffer(next); |
925baedd | 3630 | } |
5f39d397 | 3631 | |
0bd40a71 CM |
3632 | if (level == 1 && (path->locks[1] || path->skip_locking) && |
3633 | path->reada) | |
01f46658 | 3634 | reada_for_search(root, path, level, slot, 0); |
5f39d397 | 3635 | |
ca7a79ad | 3636 | next = read_node_slot(root, c, slot); |
5cd57b2c CM |
3637 | if (!path->skip_locking) { |
3638 | WARN_ON(!btrfs_tree_locked(c)); | |
3639 | btrfs_tree_lock(next); | |
3640 | } | |
d97e63b6 CM |
3641 | break; |
3642 | } | |
3643 | path->slots[level] = slot; | |
3644 | while(1) { | |
3645 | level--; | |
3646 | c = path->nodes[level]; | |
925baedd CM |
3647 | if (path->locks[level]) |
3648 | btrfs_tree_unlock(c); | |
5f39d397 | 3649 | free_extent_buffer(c); |
d97e63b6 CM |
3650 | path->nodes[level] = next; |
3651 | path->slots[level] = 0; | |
a74a4b97 CM |
3652 | if (!path->skip_locking) |
3653 | path->locks[level] = 1; | |
d97e63b6 CM |
3654 | if (!level) |
3655 | break; | |
925baedd CM |
3656 | if (level == 1 && path->locks[1] && path->reada) |
3657 | reada_for_search(root, path, level, slot, 0); | |
ca7a79ad | 3658 | next = read_node_slot(root, next, 0); |
5cd57b2c CM |
3659 | if (!path->skip_locking) { |
3660 | WARN_ON(!btrfs_tree_locked(path->nodes[level])); | |
3661 | btrfs_tree_lock(next); | |
3662 | } | |
d97e63b6 | 3663 | } |
925baedd CM |
3664 | done: |
3665 | unlock_up(path, 0, 1); | |
d97e63b6 CM |
3666 | return 0; |
3667 | } | |
0b86a832 | 3668 | |
3f157a2f CM |
3669 | /* |
3670 | * this uses btrfs_prev_leaf to walk backwards in the tree, and keeps | |
3671 | * searching until it gets past min_objectid or finds an item of 'type' | |
3672 | * | |
3673 | * returns 0 if something is found, 1 if nothing was found and < 0 on error | |
3674 | */ | |
0b86a832 CM |
3675 | int btrfs_previous_item(struct btrfs_root *root, |
3676 | struct btrfs_path *path, u64 min_objectid, | |
3677 | int type) | |
3678 | { | |
3679 | struct btrfs_key found_key; | |
3680 | struct extent_buffer *leaf; | |
e02119d5 | 3681 | u32 nritems; |
0b86a832 CM |
3682 | int ret; |
3683 | ||
3684 | while(1) { | |
3685 | if (path->slots[0] == 0) { | |
3686 | ret = btrfs_prev_leaf(root, path); | |
3687 | if (ret != 0) | |
3688 | return ret; | |
3689 | } else { | |
3690 | path->slots[0]--; | |
3691 | } | |
3692 | leaf = path->nodes[0]; | |
e02119d5 CM |
3693 | nritems = btrfs_header_nritems(leaf); |
3694 | if (nritems == 0) | |
3695 | return 1; | |
3696 | if (path->slots[0] == nritems) | |
3697 | path->slots[0]--; | |
3698 | ||
0b86a832 CM |
3699 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
3700 | if (found_key.type == type) | |
3701 | return 0; | |
e02119d5 CM |
3702 | if (found_key.objectid < min_objectid) |
3703 | break; | |
3704 | if (found_key.objectid == min_objectid && | |
3705 | found_key.type < type) | |
3706 | break; | |
0b86a832 CM |
3707 | } |
3708 | return 1; | |
3709 | } |