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