2 * Copyright (C) 2007 Oracle. All rights reserved.
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.
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.
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.
19 #include <linux/sched.h>
22 #include "transaction.h"
23 #include "print-tree.h"
25 static int split_node(struct btrfs_trans_handle
*trans
, struct btrfs_root
26 *root
, struct btrfs_path
*path
, int level
);
27 static int split_leaf(struct btrfs_trans_handle
*trans
, struct btrfs_root
28 *root
, struct btrfs_key
*ins_key
,
29 struct btrfs_path
*path
, int data_size
);
30 static int push_node_left(struct btrfs_trans_handle
*trans
,
31 struct btrfs_root
*root
, struct extent_buffer
*dst
,
32 struct extent_buffer
*src
);
33 static int balance_node_right(struct btrfs_trans_handle
*trans
,
34 struct btrfs_root
*root
,
35 struct extent_buffer
*dst_buf
,
36 struct extent_buffer
*src_buf
);
37 static int del_ptr(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
38 struct btrfs_path
*path
, int level
, int slot
);
40 inline void btrfs_init_path(struct btrfs_path
*p
)
42 memset(p
, 0, sizeof(*p
));
45 struct btrfs_path
*btrfs_alloc_path(void)
47 struct btrfs_path
*path
;
48 path
= kmem_cache_alloc(btrfs_path_cachep
, GFP_NOFS
);
50 btrfs_init_path(path
);
56 void btrfs_free_path(struct btrfs_path
*p
)
58 btrfs_release_path(NULL
, p
);
59 kmem_cache_free(btrfs_path_cachep
, p
);
62 void btrfs_release_path(struct btrfs_root
*root
, struct btrfs_path
*p
)
65 for (i
= 0; i
< BTRFS_MAX_LEVEL
; i
++) {
68 free_extent_buffer(p
->nodes
[i
]);
70 memset(p
, 0, sizeof(*p
));
73 static int __btrfs_cow_block(struct btrfs_trans_handle
*trans
,
74 struct btrfs_root
*root
,
75 struct extent_buffer
*buf
,
76 struct extent_buffer
*parent
, int parent_slot
,
77 struct extent_buffer
**cow_ret
,
78 u64 search_start
, u64 empty_size
)
80 struct extent_buffer
*cow
;
82 int different_trans
= 0;
84 WARN_ON(root
->ref_cows
&& trans
->transid
!= root
->last_trans
);
86 cow
= btrfs_alloc_free_block(trans
, root
, buf
->len
,
87 search_start
, empty_size
);
91 copy_extent_buffer(cow
, buf
, 0, 0, cow
->len
);
92 btrfs_set_header_bytenr(cow
, cow
->start
);
93 btrfs_set_header_generation(cow
, trans
->transid
);
94 btrfs_set_header_owner(cow
, root
->root_key
.objectid
);
96 WARN_ON(btrfs_header_generation(buf
) > trans
->transid
);
97 if (btrfs_header_generation(buf
) != trans
->transid
) {
99 ret
= btrfs_inc_ref(trans
, root
, buf
);
103 clean_tree_block(trans
, root
, buf
);
106 if (buf
== root
->node
) {
108 extent_buffer_get(cow
);
109 if (buf
!= root
->commit_root
) {
110 btrfs_free_extent(trans
, root
, buf
->start
,
113 free_extent_buffer(buf
);
115 btrfs_set_node_blockptr(parent
, parent_slot
,
117 btrfs_mark_buffer_dirty(parent
);
118 WARN_ON(btrfs_header_generation(parent
) != trans
->transid
);
119 btrfs_free_extent(trans
, root
, buf
->start
, buf
->len
, 1);
121 free_extent_buffer(buf
);
122 btrfs_mark_buffer_dirty(cow
);
127 int btrfs_cow_block(struct btrfs_trans_handle
*trans
,
128 struct btrfs_root
*root
, struct extent_buffer
*buf
,
129 struct extent_buffer
*parent
, int parent_slot
,
130 struct extent_buffer
**cow_ret
)
134 if (trans
->transaction
!= root
->fs_info
->running_transaction
) {
135 printk(KERN_CRIT
"trans %Lu running %Lu\n", trans
->transid
,
136 root
->fs_info
->running_transaction
->transid
);
139 if (trans
->transid
!= root
->fs_info
->generation
) {
140 printk(KERN_CRIT
"trans %Lu running %Lu\n", trans
->transid
,
141 root
->fs_info
->generation
);
144 if (btrfs_header_generation(buf
) == trans
->transid
) {
149 search_start
= buf
->start
& ~((u64
)BTRFS_BLOCK_GROUP_SIZE
- 1);
150 ret
= __btrfs_cow_block(trans
, root
, buf
, parent
,
151 parent_slot
, cow_ret
, search_start
, 0);
155 static int close_blocks(u64 blocknr
, u64 other
, u32 blocksize
)
157 if (blocknr
< other
&& other
- (blocknr
+ blocksize
) < 32768)
159 if (blocknr
> other
&& blocknr
- (other
+ blocksize
) < 32768)
164 static int should_defrag_leaf(struct extent_buffer
*leaf
)
166 struct btrfs_key key
;
169 if (btrfs_buffer_defrag(leaf
))
172 nritems
= btrfs_header_nritems(leaf
);
176 btrfs_item_key_to_cpu(leaf
, &key
, 0);
177 if (key
.type
== BTRFS_DIR_ITEM_KEY
)
181 btrfs_item_key_to_cpu(leaf
, &key
, nritems
- 1);
182 if (key
.type
== BTRFS_DIR_ITEM_KEY
)
185 btrfs_item_key_to_cpu(leaf
, &key
, nritems
/ 2);
186 if (key
.type
== BTRFS_DIR_ITEM_KEY
)
192 int btrfs_realloc_node(struct btrfs_trans_handle
*trans
,
193 struct btrfs_root
*root
, struct extent_buffer
*parent
,
194 int start_slot
, int cache_only
, u64
*last_ret
,
195 struct btrfs_key
*progress
)
197 struct extent_buffer
*cur
;
198 struct extent_buffer
*tmp
;
200 u64 search_start
= *last_ret
;
211 if (trans
->transaction
!= root
->fs_info
->running_transaction
) {
212 printk(KERN_CRIT
"trans %Lu running %Lu\n", trans
->transid
,
213 root
->fs_info
->running_transaction
->transid
);
216 if (trans
->transid
!= root
->fs_info
->generation
) {
217 printk(KERN_CRIT
"trans %Lu running %Lu\n", trans
->transid
,
218 root
->fs_info
->generation
);
221 parent_level
= btrfs_header_level(parent
);
223 parent_nritems
= btrfs_header_nritems(parent
);
224 blocksize
= btrfs_level_size(root
, parent_level
- 1);
225 end_slot
= parent_nritems
;
227 if (parent_nritems
== 1)
230 if (root
!= root
->fs_info
->extent_root
) {
231 struct btrfs_key first_key
;
232 struct btrfs_key last_key
;
234 btrfs_node_key_to_cpu(parent
, &first_key
, 0);
235 btrfs_node_key_to_cpu(parent
, &last_key
, parent_nritems
- 1);
236 if (first_key
.objectid
!= last_key
.objectid
)
240 for (i
= start_slot
; i
< end_slot
; i
++) {
243 blocknr
= btrfs_node_blockptr(parent
, i
);
245 last_block
= blocknr
;
247 other
= btrfs_node_blockptr(parent
, i
- 1);
248 close
= close_blocks(blocknr
, other
, blocksize
);
250 if (close
&& i
< end_slot
- 1) {
251 other
= btrfs_node_blockptr(parent
, i
+ 1);
252 close
= close_blocks(blocknr
, other
, blocksize
);
255 last_block
= blocknr
;
259 cur
= btrfs_find_tree_block(root
, blocknr
, blocksize
);
261 uptodate
= btrfs_buffer_uptodate(cur
);
264 if (!cur
|| !uptodate
||
265 (parent_level
!= 1 && !btrfs_buffer_defrag(cur
)) ||
266 (parent_level
== 1 && !should_defrag_leaf(cur
))) {
268 free_extent_buffer(cur
);
272 cur
= read_tree_block(root
, blocknr
,
274 } else if (!uptodate
) {
275 btrfs_read_buffer(cur
);
278 if (search_start
== 0)
279 search_start
= last_block
;
281 err
= __btrfs_cow_block(trans
, root
, cur
, parent
, i
,
284 (end_slot
- i
) * blocksize
));
286 free_extent_buffer(cur
);
289 search_start
= tmp
->start
;
290 *last_ret
= search_start
;
291 if (parent_level
== 1)
292 btrfs_clear_buffer_defrag(tmp
);
293 free_extent_buffer(tmp
);
299 * The leaf data grows from end-to-front in the node.
300 * this returns the address of the start of the last item,
301 * which is the stop of the leaf data stack
303 static inline unsigned int leaf_data_end(struct btrfs_root
*root
,
304 struct extent_buffer
*leaf
)
306 u32 nr
= btrfs_header_nritems(leaf
);
308 return BTRFS_LEAF_DATA_SIZE(root
);
309 return btrfs_item_offset_nr(leaf
, nr
- 1);
313 * compare two keys in a memcmp fashion
315 static int comp_keys(struct btrfs_disk_key
*disk
, struct btrfs_key
*k2
)
319 btrfs_disk_key_to_cpu(&k1
, disk
);
321 if (k1
.objectid
> k2
->objectid
)
323 if (k1
.objectid
< k2
->objectid
)
325 if (k1
.type
> k2
->type
)
327 if (k1
.type
< k2
->type
)
329 if (k1
.offset
> k2
->offset
)
331 if (k1
.offset
< k2
->offset
)
336 static int check_node(struct btrfs_root
*root
, struct btrfs_path
*path
,
339 struct extent_buffer
*parent
= NULL
;
340 struct extent_buffer
*node
= path
->nodes
[level
];
341 struct btrfs_disk_key parent_key
;
342 struct btrfs_disk_key node_key
;
345 struct btrfs_key cpukey
;
346 u32 nritems
= btrfs_header_nritems(node
);
348 if (path
->nodes
[level
+ 1])
349 parent
= path
->nodes
[level
+ 1];
351 slot
= path
->slots
[level
];
352 BUG_ON(nritems
== 0);
354 parent_slot
= path
->slots
[level
+ 1];
355 btrfs_node_key(parent
, &parent_key
, parent_slot
);
356 btrfs_node_key(node
, &node_key
, 0);
357 BUG_ON(memcmp(&parent_key
, &node_key
,
358 sizeof(struct btrfs_disk_key
)));
359 BUG_ON(btrfs_node_blockptr(parent
, parent_slot
) !=
360 btrfs_header_bytenr(node
));
362 BUG_ON(nritems
> BTRFS_NODEPTRS_PER_BLOCK(root
));
364 btrfs_node_key_to_cpu(node
, &cpukey
, slot
- 1);
365 btrfs_node_key(node
, &node_key
, slot
);
366 BUG_ON(comp_keys(&node_key
, &cpukey
) <= 0);
368 if (slot
< nritems
- 1) {
369 btrfs_node_key_to_cpu(node
, &cpukey
, slot
+ 1);
370 btrfs_node_key(node
, &node_key
, slot
);
371 BUG_ON(comp_keys(&node_key
, &cpukey
) >= 0);
376 static int check_leaf(struct btrfs_root
*root
, struct btrfs_path
*path
,
379 struct extent_buffer
*leaf
= path
->nodes
[level
];
380 struct extent_buffer
*parent
= NULL
;
382 struct btrfs_key cpukey
;
383 struct btrfs_disk_key parent_key
;
384 struct btrfs_disk_key leaf_key
;
385 int slot
= path
->slots
[0];
387 u32 nritems
= btrfs_header_nritems(leaf
);
389 if (path
->nodes
[level
+ 1])
390 parent
= path
->nodes
[level
+ 1];
396 parent_slot
= path
->slots
[level
+ 1];
397 btrfs_node_key(parent
, &parent_key
, parent_slot
);
398 btrfs_item_key(leaf
, &leaf_key
, 0);
400 BUG_ON(memcmp(&parent_key
, &leaf_key
,
401 sizeof(struct btrfs_disk_key
)));
402 BUG_ON(btrfs_node_blockptr(parent
, parent_slot
) !=
403 btrfs_header_bytenr(leaf
));
406 for (i
= 0; nritems
> 1 && i
< nritems
- 2; i
++) {
407 btrfs_item_key_to_cpu(leaf
, &cpukey
, i
+ 1);
408 btrfs_item_key(leaf
, &leaf_key
, i
);
409 if (comp_keys(&leaf_key
, &cpukey
) >= 0) {
410 btrfs_print_leaf(root
, leaf
);
411 printk("slot %d offset bad key\n", i
);
414 if (btrfs_item_offset_nr(leaf
, i
) !=
415 btrfs_item_end_nr(leaf
, i
+ 1)) {
416 btrfs_print_leaf(root
, leaf
);
417 printk("slot %d offset bad\n", i
);
421 if (btrfs_item_offset_nr(leaf
, i
) +
422 btrfs_item_size_nr(leaf
, i
) !=
423 BTRFS_LEAF_DATA_SIZE(root
)) {
424 btrfs_print_leaf(root
, leaf
);
425 printk("slot %d first offset bad\n", i
);
431 if (btrfs_item_size_nr(leaf
, nritems
- 1) > 4096) {
432 btrfs_print_leaf(root
, leaf
);
433 printk("slot %d bad size \n", nritems
- 1);
438 if (slot
!= 0 && slot
< nritems
- 1) {
439 btrfs_item_key(leaf
, &leaf_key
, slot
);
440 btrfs_item_key_to_cpu(leaf
, &cpukey
, slot
- 1);
441 if (comp_keys(&leaf_key
, &cpukey
) <= 0) {
442 btrfs_print_leaf(root
, leaf
);
443 printk("slot %d offset bad key\n", slot
);
446 if (btrfs_item_offset_nr(leaf
, slot
- 1) !=
447 btrfs_item_end_nr(leaf
, slot
)) {
448 btrfs_print_leaf(root
, leaf
);
449 printk("slot %d offset bad\n", slot
);
453 if (slot
< nritems
- 1) {
454 btrfs_item_key(leaf
, &leaf_key
, slot
);
455 btrfs_item_key_to_cpu(leaf
, &cpukey
, slot
+ 1);
456 BUG_ON(comp_keys(&leaf_key
, &cpukey
) >= 0);
457 if (btrfs_item_offset_nr(leaf
, slot
) !=
458 btrfs_item_end_nr(leaf
, slot
+ 1)) {
459 btrfs_print_leaf(root
, leaf
);
460 printk("slot %d offset bad\n", slot
);
464 BUG_ON(btrfs_item_offset_nr(leaf
, 0) +
465 btrfs_item_size_nr(leaf
, 0) != BTRFS_LEAF_DATA_SIZE(root
));
469 static int check_block(struct btrfs_root
*root
, struct btrfs_path
*path
,
474 struct extent_buffer
*buf
= path
->nodes
[level
];
476 if (memcmp_extent_buffer(buf
, root
->fs_info
->fsid
,
477 (unsigned long)btrfs_header_fsid(buf
),
479 printk("warning bad block %Lu\n", buf
->start
);
484 return check_leaf(root
, path
, level
);
485 return check_node(root
, path
, level
);
489 * search for key in the extent_buffer. The items start at offset p,
490 * and they are item_size apart. There are 'max' items in p.
492 * the slot in the array is returned via slot, and it points to
493 * the place where you would insert key if it is not found in
496 * slot may point to max if the key is bigger than all of the keys
498 static int generic_bin_search(struct extent_buffer
*eb
, unsigned long p
,
499 int item_size
, struct btrfs_key
*key
,
506 struct btrfs_disk_key
*tmp
= NULL
;
507 struct btrfs_disk_key unaligned
;
508 unsigned long offset
;
509 char *map_token
= NULL
;
511 unsigned long map_start
= 0;
512 unsigned long map_len
= 0;
516 mid
= (low
+ high
) / 2;
517 offset
= p
+ mid
* item_size
;
519 if (!map_token
|| offset
< map_start
||
520 (offset
+ sizeof(struct btrfs_disk_key
)) >
521 map_start
+ map_len
) {
523 unmap_extent_buffer(eb
, map_token
, KM_USER0
);
526 err
= map_extent_buffer(eb
, offset
,
527 sizeof(struct btrfs_disk_key
),
529 &map_start
, &map_len
, KM_USER0
);
532 tmp
= (struct btrfs_disk_key
*)(kaddr
+ offset
-
535 read_extent_buffer(eb
, &unaligned
,
536 offset
, sizeof(unaligned
));
541 tmp
= (struct btrfs_disk_key
*)(kaddr
+ offset
-
544 ret
= comp_keys(tmp
, key
);
553 unmap_extent_buffer(eb
, map_token
, KM_USER0
);
559 unmap_extent_buffer(eb
, map_token
, KM_USER0
);
564 * simple bin_search frontend that does the right thing for
567 static int bin_search(struct extent_buffer
*eb
, struct btrfs_key
*key
,
568 int level
, int *slot
)
571 return generic_bin_search(eb
,
572 offsetof(struct btrfs_leaf
, items
),
573 sizeof(struct btrfs_item
),
574 key
, btrfs_header_nritems(eb
),
577 return generic_bin_search(eb
,
578 offsetof(struct btrfs_node
, ptrs
),
579 sizeof(struct btrfs_key_ptr
),
580 key
, btrfs_header_nritems(eb
),
586 static struct extent_buffer
*read_node_slot(struct btrfs_root
*root
,
587 struct extent_buffer
*parent
, int slot
)
591 if (slot
>= btrfs_header_nritems(parent
))
593 return read_tree_block(root
, btrfs_node_blockptr(parent
, slot
),
594 btrfs_level_size(root
, btrfs_header_level(parent
) - 1));
597 static int balance_level(struct btrfs_trans_handle
*trans
, struct btrfs_root
598 *root
, struct btrfs_path
*path
, int level
)
600 struct extent_buffer
*right
= NULL
;
601 struct extent_buffer
*mid
;
602 struct extent_buffer
*left
= NULL
;
603 struct extent_buffer
*parent
= NULL
;
607 int orig_slot
= path
->slots
[level
];
608 int err_on_enospc
= 0;
614 mid
= path
->nodes
[level
];
615 orig_ptr
= btrfs_node_blockptr(mid
, orig_slot
);
617 if (level
< BTRFS_MAX_LEVEL
- 1)
618 parent
= path
->nodes
[level
+ 1];
619 pslot
= path
->slots
[level
+ 1];
622 * deal with the case where there is only one pointer in the root
623 * by promoting the node below to a root
626 struct extent_buffer
*child
;
628 if (btrfs_header_nritems(mid
) != 1)
631 /* promote the child to a root */
632 child
= read_node_slot(root
, mid
, 0);
635 path
->nodes
[level
] = NULL
;
636 clean_tree_block(trans
, root
, mid
);
637 wait_on_tree_block_writeback(root
, mid
);
638 /* once for the path */
639 free_extent_buffer(mid
);
640 ret
= btrfs_free_extent(trans
, root
, mid
->start
, mid
->len
, 1);
641 /* once for the root ptr */
642 free_extent_buffer(mid
);
645 if (btrfs_header_nritems(mid
) >
646 BTRFS_NODEPTRS_PER_BLOCK(root
) / 4)
649 if (btrfs_header_nritems(mid
) < 2)
652 left
= read_node_slot(root
, parent
, pslot
- 1);
654 wret
= btrfs_cow_block(trans
, root
, left
,
655 parent
, pslot
- 1, &left
);
661 right
= read_node_slot(root
, parent
, pslot
+ 1);
663 wret
= btrfs_cow_block(trans
, root
, right
,
664 parent
, pslot
+ 1, &right
);
671 /* first, try to make some room in the middle buffer */
673 orig_slot
+= btrfs_header_nritems(left
);
674 wret
= push_node_left(trans
, root
, left
, mid
);
677 if (btrfs_header_nritems(mid
) < 2)
682 * then try to empty the right most buffer into the middle
685 wret
= push_node_left(trans
, root
, mid
, right
);
686 if (wret
< 0 && wret
!= -ENOSPC
)
688 if (btrfs_header_nritems(right
) == 0) {
689 u64 bytenr
= right
->start
;
690 u32 blocksize
= right
->len
;
692 clean_tree_block(trans
, root
, right
);
693 wait_on_tree_block_writeback(root
, right
);
694 free_extent_buffer(right
);
696 wret
= del_ptr(trans
, root
, path
, level
+ 1, pslot
+
700 wret
= btrfs_free_extent(trans
, root
, bytenr
,
705 struct btrfs_disk_key right_key
;
706 btrfs_node_key(right
, &right_key
, 0);
707 btrfs_set_node_key(parent
, &right_key
, pslot
+ 1);
708 btrfs_mark_buffer_dirty(parent
);
711 if (btrfs_header_nritems(mid
) == 1) {
713 * we're not allowed to leave a node with one item in the
714 * tree during a delete. A deletion from lower in the tree
715 * could try to delete the only pointer in this node.
716 * So, pull some keys from the left.
717 * There has to be a left pointer at this point because
718 * otherwise we would have pulled some pointers from the
722 wret
= balance_node_right(trans
, root
, mid
, left
);
729 if (btrfs_header_nritems(mid
) == 0) {
730 /* we've managed to empty the middle node, drop it */
731 u64 bytenr
= mid
->start
;
732 u32 blocksize
= mid
->len
;
733 clean_tree_block(trans
, root
, mid
);
734 wait_on_tree_block_writeback(root
, mid
);
735 free_extent_buffer(mid
);
737 wret
= del_ptr(trans
, root
, path
, level
+ 1, pslot
);
740 wret
= btrfs_free_extent(trans
, root
, bytenr
, blocksize
, 1);
744 /* update the parent key to reflect our changes */
745 struct btrfs_disk_key mid_key
;
746 btrfs_node_key(mid
, &mid_key
, 0);
747 btrfs_set_node_key(parent
, &mid_key
, pslot
);
748 btrfs_mark_buffer_dirty(parent
);
751 /* update the path */
753 if (btrfs_header_nritems(left
) > orig_slot
) {
754 extent_buffer_get(left
);
755 path
->nodes
[level
] = left
;
756 path
->slots
[level
+ 1] -= 1;
757 path
->slots
[level
] = orig_slot
;
759 free_extent_buffer(mid
);
761 orig_slot
-= btrfs_header_nritems(left
);
762 path
->slots
[level
] = orig_slot
;
765 /* double check we haven't messed things up */
766 check_block(root
, path
, level
);
768 btrfs_node_blockptr(path
->nodes
[level
], path
->slots
[level
]))
772 free_extent_buffer(right
);
774 free_extent_buffer(left
);
778 /* returns zero if the push worked, non-zero otherwise */
779 static int push_nodes_for_insert(struct btrfs_trans_handle
*trans
,
780 struct btrfs_root
*root
,
781 struct btrfs_path
*path
, int level
)
783 struct extent_buffer
*right
= NULL
;
784 struct extent_buffer
*mid
;
785 struct extent_buffer
*left
= NULL
;
786 struct extent_buffer
*parent
= NULL
;
790 int orig_slot
= path
->slots
[level
];
796 mid
= path
->nodes
[level
];
797 orig_ptr
= btrfs_node_blockptr(mid
, orig_slot
);
799 if (level
< BTRFS_MAX_LEVEL
- 1)
800 parent
= path
->nodes
[level
+ 1];
801 pslot
= path
->slots
[level
+ 1];
806 left
= read_node_slot(root
, parent
, pslot
- 1);
808 /* first, try to make some room in the middle buffer */
811 left_nr
= btrfs_header_nritems(left
);
812 if (left_nr
>= BTRFS_NODEPTRS_PER_BLOCK(root
) - 1) {
815 ret
= btrfs_cow_block(trans
, root
, left
, parent
,
820 wret
= push_node_left(trans
, root
,
827 struct btrfs_disk_key disk_key
;
828 orig_slot
+= left_nr
;
829 btrfs_node_key(mid
, &disk_key
, 0);
830 btrfs_set_node_key(parent
, &disk_key
, pslot
);
831 btrfs_mark_buffer_dirty(parent
);
832 if (btrfs_header_nritems(left
) > orig_slot
) {
833 path
->nodes
[level
] = left
;
834 path
->slots
[level
+ 1] -= 1;
835 path
->slots
[level
] = orig_slot
;
836 free_extent_buffer(mid
);
839 btrfs_header_nritems(left
);
840 path
->slots
[level
] = orig_slot
;
841 free_extent_buffer(left
);
845 free_extent_buffer(left
);
847 right
= read_node_slot(root
, parent
, pslot
+ 1);
850 * then try to empty the right most buffer into the middle
854 right_nr
= btrfs_header_nritems(right
);
855 if (right_nr
>= BTRFS_NODEPTRS_PER_BLOCK(root
) - 1) {
858 ret
= btrfs_cow_block(trans
, root
, right
,
864 wret
= balance_node_right(trans
, root
,
871 struct btrfs_disk_key disk_key
;
873 btrfs_node_key(right
, &disk_key
, 0);
874 btrfs_set_node_key(parent
, &disk_key
, pslot
+ 1);
875 btrfs_mark_buffer_dirty(parent
);
877 if (btrfs_header_nritems(mid
) <= orig_slot
) {
878 path
->nodes
[level
] = right
;
879 path
->slots
[level
+ 1] += 1;
880 path
->slots
[level
] = orig_slot
-
881 btrfs_header_nritems(mid
);
882 free_extent_buffer(mid
);
884 free_extent_buffer(right
);
888 free_extent_buffer(right
);
894 * readahead one full node of leaves
896 static void reada_for_search(struct btrfs_root
*root
, struct btrfs_path
*path
,
899 struct extent_buffer
*node
;
905 int direction
= path
->reada
;
906 struct extent_buffer
*eb
;
914 if (!path
->nodes
[level
])
917 node
= path
->nodes
[level
];
918 search
= btrfs_node_blockptr(node
, slot
);
919 blocksize
= btrfs_level_size(root
, level
- 1);
920 eb
= btrfs_find_tree_block(root
, search
, blocksize
);
922 free_extent_buffer(eb
);
926 highest_read
= search
;
927 lowest_read
= search
;
929 nritems
= btrfs_header_nritems(node
);
936 } else if (direction
> 0) {
941 search
= btrfs_node_blockptr(node
, nr
);
942 if ((search
>= lowest_read
&& search
<= highest_read
) ||
943 (search
< lowest_read
&& lowest_read
- search
<= 32768) ||
944 (search
> highest_read
&& search
- highest_read
<= 32768)) {
945 readahead_tree_block(root
, search
, blocksize
);
949 if (path
->reada
< 2 && (nread
> (256 * 1024) || nscan
> 32))
951 if(nread
> (1024 * 1024) || nscan
> 128)
954 if (search
< lowest_read
)
955 lowest_read
= search
;
956 if (search
> highest_read
)
957 highest_read
= search
;
961 * look for key in the tree. path is filled in with nodes along the way
962 * if key is found, we return zero and you can find the item in the leaf
963 * level of the path (level 0)
965 * If the key isn't found, the path points to the slot where it should
966 * be inserted, and 1 is returned. If there are other errors during the
967 * search a negative error number is returned.
969 * if ins_len > 0, nodes and leaves will be split as we walk down the
970 * tree. if ins_len < 0, nodes will be merged as we walk down the tree (if
973 int btrfs_search_slot(struct btrfs_trans_handle
*trans
, struct btrfs_root
974 *root
, struct btrfs_key
*key
, struct btrfs_path
*p
, int
977 struct extent_buffer
*b
;
982 int should_reada
= p
->reada
;
985 lowest_level
= p
->lowest_level
;
986 WARN_ON(lowest_level
&& ins_len
);
987 WARN_ON(p
->nodes
[0] != NULL
);
988 WARN_ON(!mutex_is_locked(&root
->fs_info
->fs_mutex
));
991 extent_buffer_get(b
);
993 level
= btrfs_header_level(b
);
996 wret
= btrfs_cow_block(trans
, root
, b
,
1001 free_extent_buffer(b
);
1005 BUG_ON(!cow
&& ins_len
);
1006 if (level
!= btrfs_header_level(b
))
1008 level
= btrfs_header_level(b
);
1009 p
->nodes
[level
] = b
;
1010 ret
= check_block(root
, p
, level
);
1013 ret
= bin_search(b
, key
, level
, &slot
);
1015 if (ret
&& slot
> 0)
1017 p
->slots
[level
] = slot
;
1018 if (ins_len
> 0 && btrfs_header_nritems(b
) >=
1019 BTRFS_NODEPTRS_PER_BLOCK(root
) - 1) {
1020 int sret
= split_node(trans
, root
, p
, level
);
1024 b
= p
->nodes
[level
];
1025 slot
= p
->slots
[level
];
1026 } else if (ins_len
< 0) {
1027 int sret
= balance_level(trans
, root
, p
,
1031 b
= p
->nodes
[level
];
1033 btrfs_release_path(NULL
, p
);
1036 slot
= p
->slots
[level
];
1037 BUG_ON(btrfs_header_nritems(b
) == 1);
1039 /* this is only true while dropping a snapshot */
1040 if (level
== lowest_level
)
1042 bytenr
= btrfs_node_blockptr(b
, slot
);
1044 reada_for_search(root
, p
, level
, slot
);
1045 b
= read_tree_block(root
, bytenr
,
1046 btrfs_level_size(root
, level
- 1));
1048 p
->slots
[level
] = slot
;
1049 if (ins_len
> 0 && btrfs_leaf_free_space(root
, b
) <
1050 sizeof(struct btrfs_item
) + ins_len
) {
1051 int sret
= split_leaf(trans
, root
, key
,
1064 * adjust the pointers going up the tree, starting at level
1065 * making sure the right key of each node is points to 'key'.
1066 * This is used after shifting pointers to the left, so it stops
1067 * fixing up pointers when a given leaf/node is not in slot 0 of the
1070 * If this fails to write a tree block, it returns -1, but continues
1071 * fixing up the blocks in ram so the tree is consistent.
1073 static int fixup_low_keys(struct btrfs_trans_handle
*trans
,
1074 struct btrfs_root
*root
, struct btrfs_path
*path
,
1075 struct btrfs_disk_key
*key
, int level
)
1079 struct extent_buffer
*t
;
1081 for (i
= level
; i
< BTRFS_MAX_LEVEL
; i
++) {
1082 int tslot
= path
->slots
[i
];
1083 if (!path
->nodes
[i
])
1086 btrfs_set_node_key(t
, key
, tslot
);
1087 btrfs_mark_buffer_dirty(path
->nodes
[i
]);
1095 * try to push data from one node into the next node left in the
1098 * returns 0 if some ptrs were pushed left, < 0 if there was some horrible
1099 * error, and > 0 if there was no room in the left hand block.
1101 static int push_node_left(struct btrfs_trans_handle
*trans
, struct btrfs_root
1102 *root
, struct extent_buffer
*dst
,
1103 struct extent_buffer
*src
)
1110 src_nritems
= btrfs_header_nritems(src
);
1111 dst_nritems
= btrfs_header_nritems(dst
);
1112 push_items
= BTRFS_NODEPTRS_PER_BLOCK(root
) - dst_nritems
;
1114 if (push_items
<= 0) {
1118 if (src_nritems
< push_items
)
1119 push_items
= src_nritems
;
1121 copy_extent_buffer(dst
, src
,
1122 btrfs_node_key_ptr_offset(dst_nritems
),
1123 btrfs_node_key_ptr_offset(0),
1124 push_items
* sizeof(struct btrfs_key_ptr
));
1126 if (push_items
< src_nritems
) {
1127 memmove_extent_buffer(src
, btrfs_node_key_ptr_offset(0),
1128 btrfs_node_key_ptr_offset(push_items
),
1129 (src_nritems
- push_items
) *
1130 sizeof(struct btrfs_key_ptr
));
1132 btrfs_set_header_nritems(src
, src_nritems
- push_items
);
1133 btrfs_set_header_nritems(dst
, dst_nritems
+ push_items
);
1134 btrfs_mark_buffer_dirty(src
);
1135 btrfs_mark_buffer_dirty(dst
);
1140 * try to push data from one node into the next node right in the
1143 * returns 0 if some ptrs were pushed, < 0 if there was some horrible
1144 * error, and > 0 if there was no room in the right hand block.
1146 * this will only push up to 1/2 the contents of the left node over
1148 static int balance_node_right(struct btrfs_trans_handle
*trans
,
1149 struct btrfs_root
*root
,
1150 struct extent_buffer
*dst
,
1151 struct extent_buffer
*src
)
1159 src_nritems
= btrfs_header_nritems(src
);
1160 dst_nritems
= btrfs_header_nritems(dst
);
1161 push_items
= BTRFS_NODEPTRS_PER_BLOCK(root
) - dst_nritems
;
1162 if (push_items
<= 0)
1165 max_push
= src_nritems
/ 2 + 1;
1166 /* don't try to empty the node */
1167 if (max_push
>= src_nritems
)
1170 if (max_push
< push_items
)
1171 push_items
= max_push
;
1173 memmove_extent_buffer(dst
, btrfs_node_key_ptr_offset(push_items
),
1174 btrfs_node_key_ptr_offset(0),
1176 sizeof(struct btrfs_key_ptr
));
1178 copy_extent_buffer(dst
, src
,
1179 btrfs_node_key_ptr_offset(0),
1180 btrfs_node_key_ptr_offset(src_nritems
- push_items
),
1181 push_items
* sizeof(struct btrfs_key_ptr
));
1183 btrfs_set_header_nritems(src
, src_nritems
- push_items
);
1184 btrfs_set_header_nritems(dst
, dst_nritems
+ push_items
);
1186 btrfs_mark_buffer_dirty(src
);
1187 btrfs_mark_buffer_dirty(dst
);
1192 * helper function to insert a new root level in the tree.
1193 * A new node is allocated, and a single item is inserted to
1194 * point to the existing root
1196 * returns zero on success or < 0 on failure.
1198 static int insert_new_root(struct btrfs_trans_handle
*trans
,
1199 struct btrfs_root
*root
,
1200 struct btrfs_path
*path
, int level
)
1202 struct extent_buffer
*lower
;
1203 struct extent_buffer
*c
;
1204 struct btrfs_disk_key lower_key
;
1206 BUG_ON(path
->nodes
[level
]);
1207 BUG_ON(path
->nodes
[level
-1] != root
->node
);
1209 c
= btrfs_alloc_free_block(trans
, root
, root
->nodesize
,
1210 root
->node
->start
, 0);
1213 memset_extent_buffer(c
, 0, 0, root
->nodesize
);
1214 btrfs_set_header_nritems(c
, 1);
1215 btrfs_set_header_level(c
, level
);
1216 btrfs_set_header_bytenr(c
, c
->start
);
1217 btrfs_set_header_generation(c
, trans
->transid
);
1218 btrfs_set_header_owner(c
, root
->root_key
.objectid
);
1219 lower
= path
->nodes
[level
-1];
1221 write_extent_buffer(c
, root
->fs_info
->fsid
,
1222 (unsigned long)btrfs_header_fsid(c
),
1225 btrfs_item_key(lower
, &lower_key
, 0);
1227 btrfs_node_key(lower
, &lower_key
, 0);
1228 btrfs_set_node_key(c
, &lower_key
, 0);
1229 btrfs_set_node_blockptr(c
, 0, lower
->start
);
1231 btrfs_mark_buffer_dirty(c
);
1233 /* the super has an extra ref to root->node */
1234 free_extent_buffer(root
->node
);
1236 extent_buffer_get(c
);
1237 path
->nodes
[level
] = c
;
1238 path
->slots
[level
] = 0;
1243 * worker function to insert a single pointer in a node.
1244 * the node should have enough room for the pointer already
1246 * slot and level indicate where you want the key to go, and
1247 * blocknr is the block the key points to.
1249 * returns zero on success and < 0 on any error
1251 static int insert_ptr(struct btrfs_trans_handle
*trans
, struct btrfs_root
1252 *root
, struct btrfs_path
*path
, struct btrfs_disk_key
1253 *key
, u64 bytenr
, int slot
, int level
)
1255 struct extent_buffer
*lower
;
1258 BUG_ON(!path
->nodes
[level
]);
1259 lower
= path
->nodes
[level
];
1260 nritems
= btrfs_header_nritems(lower
);
1263 if (nritems
== BTRFS_NODEPTRS_PER_BLOCK(root
))
1265 if (slot
!= nritems
) {
1266 memmove_extent_buffer(lower
,
1267 btrfs_node_key_ptr_offset(slot
+ 1),
1268 btrfs_node_key_ptr_offset(slot
),
1269 (nritems
- slot
) * sizeof(struct btrfs_key_ptr
));
1271 btrfs_set_node_key(lower
, key
, slot
);
1272 btrfs_set_node_blockptr(lower
, slot
, bytenr
);
1273 btrfs_set_header_nritems(lower
, nritems
+ 1);
1274 btrfs_mark_buffer_dirty(lower
);
1279 * split the node at the specified level in path in two.
1280 * The path is corrected to point to the appropriate node after the split
1282 * Before splitting this tries to make some room in the node by pushing
1283 * left and right, if either one works, it returns right away.
1285 * returns 0 on success and < 0 on failure
1287 static int split_node(struct btrfs_trans_handle
*trans
, struct btrfs_root
1288 *root
, struct btrfs_path
*path
, int level
)
1290 struct extent_buffer
*c
;
1291 struct extent_buffer
*split
;
1292 struct btrfs_disk_key disk_key
;
1298 c
= path
->nodes
[level
];
1299 if (c
== root
->node
) {
1300 /* trying to split the root, lets make a new one */
1301 ret
= insert_new_root(trans
, root
, path
, level
+ 1);
1305 ret
= push_nodes_for_insert(trans
, root
, path
, level
);
1306 c
= path
->nodes
[level
];
1307 if (!ret
&& btrfs_header_nritems(c
) <
1308 BTRFS_NODEPTRS_PER_BLOCK(root
) - 1)
1314 c_nritems
= btrfs_header_nritems(c
);
1315 split
= btrfs_alloc_free_block(trans
, root
, root
->nodesize
,
1318 return PTR_ERR(split
);
1320 btrfs_set_header_flags(split
, btrfs_header_flags(c
));
1321 btrfs_set_header_level(split
, btrfs_header_level(c
));
1322 btrfs_set_header_bytenr(split
, split
->start
);
1323 btrfs_set_header_generation(split
, trans
->transid
);
1324 btrfs_set_header_owner(split
, root
->root_key
.objectid
);
1325 write_extent_buffer(split
, root
->fs_info
->fsid
,
1326 (unsigned long)btrfs_header_fsid(split
),
1329 mid
= (c_nritems
+ 1) / 2;
1331 copy_extent_buffer(split
, c
,
1332 btrfs_node_key_ptr_offset(0),
1333 btrfs_node_key_ptr_offset(mid
),
1334 (c_nritems
- mid
) * sizeof(struct btrfs_key_ptr
));
1335 btrfs_set_header_nritems(split
, c_nritems
- mid
);
1336 btrfs_set_header_nritems(c
, mid
);
1339 btrfs_mark_buffer_dirty(c
);
1340 btrfs_mark_buffer_dirty(split
);
1342 btrfs_node_key(split
, &disk_key
, 0);
1343 wret
= insert_ptr(trans
, root
, path
, &disk_key
, split
->start
,
1344 path
->slots
[level
+ 1] + 1,
1349 if (path
->slots
[level
] >= mid
) {
1350 path
->slots
[level
] -= mid
;
1351 free_extent_buffer(c
);
1352 path
->nodes
[level
] = split
;
1353 path
->slots
[level
+ 1] += 1;
1355 free_extent_buffer(split
);
1361 * how many bytes are required to store the items in a leaf. start
1362 * and nr indicate which items in the leaf to check. This totals up the
1363 * space used both by the item structs and the item data
1365 static int leaf_space_used(struct extent_buffer
*l
, int start
, int nr
)
1368 int nritems
= btrfs_header_nritems(l
);
1369 int end
= min(nritems
, start
+ nr
) - 1;
1373 data_len
= btrfs_item_end_nr(l
, start
);
1374 data_len
= data_len
- btrfs_item_offset_nr(l
, end
);
1375 data_len
+= sizeof(struct btrfs_item
) * nr
;
1376 WARN_ON(data_len
< 0);
1381 * The space between the end of the leaf items and
1382 * the start of the leaf data. IOW, how much room
1383 * the leaf has left for both items and data
1385 int btrfs_leaf_free_space(struct btrfs_root
*root
, struct extent_buffer
*leaf
)
1387 int nritems
= btrfs_header_nritems(leaf
);
1389 ret
= BTRFS_LEAF_DATA_SIZE(root
) - leaf_space_used(leaf
, 0, nritems
);
1391 printk("leaf free space ret %d, leaf data size %lu, used %d nritems %d\n",
1392 ret
, (unsigned long) BTRFS_LEAF_DATA_SIZE(root
),
1393 leaf_space_used(leaf
, 0, nritems
), nritems
);
1399 * push some data in the path leaf to the right, trying to free up at
1400 * least data_size bytes. returns zero if the push worked, nonzero otherwise
1402 * returns 1 if the push failed because the other node didn't have enough
1403 * room, 0 if everything worked out and < 0 if there were major errors.
1405 static int push_leaf_right(struct btrfs_trans_handle
*trans
, struct btrfs_root
1406 *root
, struct btrfs_path
*path
, int data_size
)
1408 struct extent_buffer
*left
= path
->nodes
[0];
1409 struct extent_buffer
*right
;
1410 struct extent_buffer
*upper
;
1411 struct btrfs_disk_key disk_key
;
1417 struct btrfs_item
*item
;
1424 slot
= path
->slots
[1];
1425 if (!path
->nodes
[1]) {
1428 upper
= path
->nodes
[1];
1429 if (slot
>= btrfs_header_nritems(upper
) - 1)
1432 right
= read_tree_block(root
, btrfs_node_blockptr(upper
, slot
+ 1),
1434 free_space
= btrfs_leaf_free_space(root
, right
);
1435 if (free_space
< data_size
+ sizeof(struct btrfs_item
)) {
1436 free_extent_buffer(right
);
1440 /* cow and double check */
1441 ret
= btrfs_cow_block(trans
, root
, right
, upper
,
1444 free_extent_buffer(right
);
1447 free_space
= btrfs_leaf_free_space(root
, right
);
1448 if (free_space
< data_size
+ sizeof(struct btrfs_item
)) {
1449 free_extent_buffer(right
);
1453 left_nritems
= btrfs_header_nritems(left
);
1454 if (left_nritems
== 0) {
1455 free_extent_buffer(right
);
1459 for (i
= left_nritems
- 1; i
>= 1; i
--) {
1460 item
= btrfs_item_nr(left
, i
);
1462 if (path
->slots
[0] == i
)
1463 push_space
+= data_size
+ sizeof(*item
);
1465 if (!left
->map_token
) {
1466 map_extent_buffer(left
, (unsigned long)item
,
1467 sizeof(struct btrfs_item
),
1468 &left
->map_token
, &left
->kaddr
,
1469 &left
->map_start
, &left
->map_len
,
1473 this_item_size
= btrfs_item_size(left
, item
);
1474 if (this_item_size
+ sizeof(*item
) + push_space
> free_space
)
1477 push_space
+= this_item_size
+ sizeof(*item
);
1479 if (left
->map_token
) {
1480 unmap_extent_buffer(left
, left
->map_token
, KM_USER1
);
1481 left
->map_token
= NULL
;
1484 if (push_items
== 0) {
1485 free_extent_buffer(right
);
1489 if (push_items
== left_nritems
)
1492 /* push left to right */
1493 right_nritems
= btrfs_header_nritems(right
);
1494 push_space
= btrfs_item_end_nr(left
, left_nritems
- push_items
);
1495 push_space
-= leaf_data_end(root
, left
);
1497 /* make room in the right data area */
1498 data_end
= leaf_data_end(root
, right
);
1499 memmove_extent_buffer(right
,
1500 btrfs_leaf_data(right
) + data_end
- push_space
,
1501 btrfs_leaf_data(right
) + data_end
,
1502 BTRFS_LEAF_DATA_SIZE(root
) - data_end
);
1504 /* copy from the left data area */
1505 copy_extent_buffer(right
, left
, btrfs_leaf_data(right
) +
1506 BTRFS_LEAF_DATA_SIZE(root
) - push_space
,
1507 btrfs_leaf_data(left
) + leaf_data_end(root
, left
),
1510 memmove_extent_buffer(right
, btrfs_item_nr_offset(push_items
),
1511 btrfs_item_nr_offset(0),
1512 right_nritems
* sizeof(struct btrfs_item
));
1514 /* copy the items from left to right */
1515 copy_extent_buffer(right
, left
, btrfs_item_nr_offset(0),
1516 btrfs_item_nr_offset(left_nritems
- push_items
),
1517 push_items
* sizeof(struct btrfs_item
));
1519 /* update the item pointers */
1520 right_nritems
+= push_items
;
1521 btrfs_set_header_nritems(right
, right_nritems
);
1522 push_space
= BTRFS_LEAF_DATA_SIZE(root
);
1524 for (i
= 0; i
< right_nritems
; i
++) {
1525 item
= btrfs_item_nr(right
, i
);
1526 if (!right
->map_token
) {
1527 map_extent_buffer(right
, (unsigned long)item
,
1528 sizeof(struct btrfs_item
),
1529 &right
->map_token
, &right
->kaddr
,
1530 &right
->map_start
, &right
->map_len
,
1533 push_space
-= btrfs_item_size(right
, item
);
1534 btrfs_set_item_offset(right
, item
, push_space
);
1537 if (right
->map_token
) {
1538 unmap_extent_buffer(right
, right
->map_token
, KM_USER1
);
1539 right
->map_token
= NULL
;
1541 left_nritems
-= push_items
;
1542 btrfs_set_header_nritems(left
, left_nritems
);
1544 btrfs_mark_buffer_dirty(left
);
1545 btrfs_mark_buffer_dirty(right
);
1547 btrfs_item_key(right
, &disk_key
, 0);
1548 btrfs_set_node_key(upper
, &disk_key
, slot
+ 1);
1549 btrfs_mark_buffer_dirty(upper
);
1551 /* then fixup the leaf pointer in the path */
1552 if (path
->slots
[0] >= left_nritems
) {
1553 path
->slots
[0] -= left_nritems
;
1554 free_extent_buffer(path
->nodes
[0]);
1555 path
->nodes
[0] = right
;
1556 path
->slots
[1] += 1;
1558 free_extent_buffer(right
);
1563 * push some data in the path leaf to the left, trying to free up at
1564 * least data_size bytes. returns zero if the push worked, nonzero otherwise
1566 static int push_leaf_left(struct btrfs_trans_handle
*trans
, struct btrfs_root
1567 *root
, struct btrfs_path
*path
, int data_size
)
1569 struct btrfs_disk_key disk_key
;
1570 struct extent_buffer
*right
= path
->nodes
[0];
1571 struct extent_buffer
*left
;
1577 struct btrfs_item
*item
;
1578 u32 old_left_nritems
;
1583 u32 old_left_item_size
;
1585 slot
= path
->slots
[1];
1588 if (!path
->nodes
[1])
1591 right_nritems
= btrfs_header_nritems(right
);
1592 if (right_nritems
== 0) {
1596 left
= read_tree_block(root
, btrfs_node_blockptr(path
->nodes
[1],
1597 slot
- 1), root
->leafsize
);
1598 free_space
= btrfs_leaf_free_space(root
, left
);
1599 if (free_space
< data_size
+ sizeof(struct btrfs_item
)) {
1600 free_extent_buffer(left
);
1604 /* cow and double check */
1605 ret
= btrfs_cow_block(trans
, root
, left
,
1606 path
->nodes
[1], slot
- 1, &left
);
1608 /* we hit -ENOSPC, but it isn't fatal here */
1609 free_extent_buffer(left
);
1613 free_space
= btrfs_leaf_free_space(root
, left
);
1614 if (free_space
< data_size
+ sizeof(struct btrfs_item
)) {
1615 free_extent_buffer(left
);
1619 for (i
= 0; i
< right_nritems
- 1; i
++) {
1620 item
= btrfs_item_nr(right
, i
);
1621 if (!right
->map_token
) {
1622 map_extent_buffer(right
, (unsigned long)item
,
1623 sizeof(struct btrfs_item
),
1624 &right
->map_token
, &right
->kaddr
,
1625 &right
->map_start
, &right
->map_len
,
1629 if (path
->slots
[0] == i
)
1630 push_space
+= data_size
+ sizeof(*item
);
1632 this_item_size
= btrfs_item_size(right
, item
);
1633 if (this_item_size
+ sizeof(*item
) + push_space
> free_space
)
1637 push_space
+= this_item_size
+ sizeof(*item
);
1640 if (right
->map_token
) {
1641 unmap_extent_buffer(right
, right
->map_token
, KM_USER1
);
1642 right
->map_token
= NULL
;
1645 if (push_items
== 0) {
1646 free_extent_buffer(left
);
1649 if (push_items
== btrfs_header_nritems(right
))
1652 /* push data from right to left */
1653 copy_extent_buffer(left
, right
,
1654 btrfs_item_nr_offset(btrfs_header_nritems(left
)),
1655 btrfs_item_nr_offset(0),
1656 push_items
* sizeof(struct btrfs_item
));
1658 push_space
= BTRFS_LEAF_DATA_SIZE(root
) -
1659 btrfs_item_offset_nr(right
, push_items
-1);
1661 copy_extent_buffer(left
, right
, btrfs_leaf_data(left
) +
1662 leaf_data_end(root
, left
) - push_space
,
1663 btrfs_leaf_data(right
) +
1664 btrfs_item_offset_nr(right
, push_items
- 1),
1666 old_left_nritems
= btrfs_header_nritems(left
);
1667 BUG_ON(old_left_nritems
< 0);
1669 old_left_item_size
= btrfs_item_offset_nr(left
, old_left_nritems
- 1);
1670 for (i
= old_left_nritems
; i
< old_left_nritems
+ push_items
; i
++) {
1673 item
= btrfs_item_nr(left
, i
);
1674 if (!left
->map_token
) {
1675 map_extent_buffer(left
, (unsigned long)item
,
1676 sizeof(struct btrfs_item
),
1677 &left
->map_token
, &left
->kaddr
,
1678 &left
->map_start
, &left
->map_len
,
1682 ioff
= btrfs_item_offset(left
, item
);
1683 btrfs_set_item_offset(left
, item
,
1684 ioff
- (BTRFS_LEAF_DATA_SIZE(root
) - old_left_item_size
));
1686 btrfs_set_header_nritems(left
, old_left_nritems
+ push_items
);
1687 if (left
->map_token
) {
1688 unmap_extent_buffer(left
, left
->map_token
, KM_USER1
);
1689 left
->map_token
= NULL
;
1692 /* fixup right node */
1693 push_space
= btrfs_item_offset_nr(right
, push_items
- 1) -
1694 leaf_data_end(root
, right
);
1695 memmove_extent_buffer(right
, btrfs_leaf_data(right
) +
1696 BTRFS_LEAF_DATA_SIZE(root
) - push_space
,
1697 btrfs_leaf_data(right
) +
1698 leaf_data_end(root
, right
), push_space
);
1700 memmove_extent_buffer(right
, btrfs_item_nr_offset(0),
1701 btrfs_item_nr_offset(push_items
),
1702 (btrfs_header_nritems(right
) - push_items
) *
1703 sizeof(struct btrfs_item
));
1705 right_nritems
= btrfs_header_nritems(right
) - push_items
;
1706 btrfs_set_header_nritems(right
, right_nritems
);
1707 push_space
= BTRFS_LEAF_DATA_SIZE(root
);
1709 for (i
= 0; i
< right_nritems
; i
++) {
1710 item
= btrfs_item_nr(right
, i
);
1712 if (!right
->map_token
) {
1713 map_extent_buffer(right
, (unsigned long)item
,
1714 sizeof(struct btrfs_item
),
1715 &right
->map_token
, &right
->kaddr
,
1716 &right
->map_start
, &right
->map_len
,
1720 push_space
= push_space
- btrfs_item_size(right
, item
);
1721 btrfs_set_item_offset(right
, item
, push_space
);
1723 if (right
->map_token
) {
1724 unmap_extent_buffer(right
, right
->map_token
, KM_USER1
);
1725 right
->map_token
= NULL
;
1728 btrfs_mark_buffer_dirty(left
);
1729 btrfs_mark_buffer_dirty(right
);
1731 btrfs_item_key(right
, &disk_key
, 0);
1732 wret
= fixup_low_keys(trans
, root
, path
, &disk_key
, 1);
1736 /* then fixup the leaf pointer in the path */
1737 if (path
->slots
[0] < push_items
) {
1738 path
->slots
[0] += old_left_nritems
;
1739 free_extent_buffer(path
->nodes
[0]);
1740 path
->nodes
[0] = left
;
1741 path
->slots
[1] -= 1;
1743 free_extent_buffer(left
);
1744 path
->slots
[0] -= push_items
;
1746 BUG_ON(path
->slots
[0] < 0);
1751 * split the path's leaf in two, making sure there is at least data_size
1752 * available for the resulting leaf level of the path.
1754 * returns 0 if all went well and < 0 on failure.
1756 static int split_leaf(struct btrfs_trans_handle
*trans
, struct btrfs_root
1757 *root
, struct btrfs_key
*ins_key
,
1758 struct btrfs_path
*path
, int data_size
)
1760 struct extent_buffer
*l
;
1764 struct extent_buffer
*right
;
1765 int space_needed
= data_size
+ sizeof(struct btrfs_item
);
1771 int double_split
= 0;
1772 struct btrfs_disk_key disk_key
;
1774 /* first try to make some room by pushing left and right */
1775 if (ins_key
->type
!= BTRFS_DIR_ITEM_KEY
) {
1776 wret
= push_leaf_right(trans
, root
, path
, data_size
);
1781 wret
= push_leaf_left(trans
, root
, path
, data_size
);
1787 /* did the pushes work? */
1788 if (btrfs_leaf_free_space(root
, l
) >=
1789 sizeof(struct btrfs_item
) + data_size
) {
1796 if (!path
->nodes
[1]) {
1797 ret
= insert_new_root(trans
, root
, path
, 1);
1801 slot
= path
->slots
[0];
1802 nritems
= btrfs_header_nritems(l
);
1803 mid
= (nritems
+ 1)/ 2;
1805 right
= btrfs_alloc_free_block(trans
, root
, root
->leafsize
,
1808 return PTR_ERR(right
);
1810 memset_extent_buffer(right
, 0, 0, sizeof(struct btrfs_header
));
1811 btrfs_set_header_bytenr(right
, right
->start
);
1812 btrfs_set_header_generation(right
, trans
->transid
);
1813 btrfs_set_header_owner(right
, root
->root_key
.objectid
);
1814 btrfs_set_header_level(right
, 0);
1815 write_extent_buffer(right
, root
->fs_info
->fsid
,
1816 (unsigned long)btrfs_header_fsid(right
),
1821 leaf_space_used(l
, mid
, nritems
- mid
) + space_needed
>
1822 BTRFS_LEAF_DATA_SIZE(root
)) {
1823 if (slot
>= nritems
) {
1824 btrfs_cpu_key_to_disk(&disk_key
, ins_key
);
1825 btrfs_set_header_nritems(right
, 0);
1826 wret
= insert_ptr(trans
, root
, path
,
1827 &disk_key
, right
->start
,
1828 path
->slots
[1] + 1, 1);
1831 free_extent_buffer(path
->nodes
[0]);
1832 path
->nodes
[0] = right
;
1834 path
->slots
[1] += 1;
1838 if (mid
!= nritems
&&
1839 leaf_space_used(l
, mid
, nritems
- mid
) +
1840 space_needed
> BTRFS_LEAF_DATA_SIZE(root
)) {
1845 if (leaf_space_used(l
, 0, mid
+ 1) + space_needed
>
1846 BTRFS_LEAF_DATA_SIZE(root
)) {
1848 btrfs_cpu_key_to_disk(&disk_key
, ins_key
);
1849 btrfs_set_header_nritems(right
, 0);
1850 wret
= insert_ptr(trans
, root
, path
,
1856 free_extent_buffer(path
->nodes
[0]);
1857 path
->nodes
[0] = right
;
1859 if (path
->slots
[1] == 0) {
1860 wret
= fixup_low_keys(trans
, root
,
1861 path
, &disk_key
, 1);
1871 nritems
= nritems
- mid
;
1872 btrfs_set_header_nritems(right
, nritems
);
1873 data_copy_size
= btrfs_item_end_nr(l
, mid
) - leaf_data_end(root
, l
);
1875 copy_extent_buffer(right
, l
, btrfs_item_nr_offset(0),
1876 btrfs_item_nr_offset(mid
),
1877 nritems
* sizeof(struct btrfs_item
));
1879 copy_extent_buffer(right
, l
,
1880 btrfs_leaf_data(right
) + BTRFS_LEAF_DATA_SIZE(root
) -
1881 data_copy_size
, btrfs_leaf_data(l
) +
1882 leaf_data_end(root
, l
), data_copy_size
);
1884 rt_data_off
= BTRFS_LEAF_DATA_SIZE(root
) -
1885 btrfs_item_end_nr(l
, mid
);
1887 for (i
= 0; i
< nritems
; i
++) {
1888 struct btrfs_item
*item
= btrfs_item_nr(right
, i
);
1891 if (!right
->map_token
) {
1892 map_extent_buffer(right
, (unsigned long)item
,
1893 sizeof(struct btrfs_item
),
1894 &right
->map_token
, &right
->kaddr
,
1895 &right
->map_start
, &right
->map_len
,
1899 ioff
= btrfs_item_offset(right
, item
);
1900 btrfs_set_item_offset(right
, item
, ioff
+ rt_data_off
);
1903 if (right
->map_token
) {
1904 unmap_extent_buffer(right
, right
->map_token
, KM_USER1
);
1905 right
->map_token
= NULL
;
1908 btrfs_set_header_nritems(l
, mid
);
1910 btrfs_item_key(right
, &disk_key
, 0);
1911 wret
= insert_ptr(trans
, root
, path
, &disk_key
, right
->start
,
1912 path
->slots
[1] + 1, 1);
1916 btrfs_mark_buffer_dirty(right
);
1917 btrfs_mark_buffer_dirty(l
);
1918 BUG_ON(path
->slots
[0] != slot
);
1921 free_extent_buffer(path
->nodes
[0]);
1922 path
->nodes
[0] = right
;
1923 path
->slots
[0] -= mid
;
1924 path
->slots
[1] += 1;
1926 free_extent_buffer(right
);
1928 BUG_ON(path
->slots
[0] < 0);
1930 if (!double_split
) {
1934 right
= btrfs_alloc_free_block(trans
, root
, root
->leafsize
,
1937 return PTR_ERR(right
);
1939 memset_extent_buffer(right
, 0, 0, sizeof(struct btrfs_header
));
1940 btrfs_set_header_bytenr(right
, right
->start
);
1941 btrfs_set_header_generation(right
, trans
->transid
);
1942 btrfs_set_header_owner(right
, root
->root_key
.objectid
);
1943 btrfs_set_header_level(right
, 0);
1944 write_extent_buffer(right
, root
->fs_info
->fsid
,
1945 (unsigned long)btrfs_header_fsid(right
),
1948 btrfs_cpu_key_to_disk(&disk_key
, ins_key
);
1949 btrfs_set_header_nritems(right
, 0);
1950 wret
= insert_ptr(trans
, root
, path
,
1951 &disk_key
, right
->start
,
1955 if (path
->slots
[1] == 0) {
1956 wret
= fixup_low_keys(trans
, root
, path
, &disk_key
, 1);
1960 free_extent_buffer(path
->nodes
[0]);
1961 path
->nodes
[0] = right
;
1966 int btrfs_truncate_item(struct btrfs_trans_handle
*trans
,
1967 struct btrfs_root
*root
,
1968 struct btrfs_path
*path
,
1974 struct extent_buffer
*leaf
;
1975 struct btrfs_item
*item
;
1977 unsigned int data_end
;
1978 unsigned int old_data_start
;
1979 unsigned int old_size
;
1980 unsigned int size_diff
;
1983 slot_orig
= path
->slots
[0];
1984 leaf
= path
->nodes
[0];
1986 nritems
= btrfs_header_nritems(leaf
);
1987 data_end
= leaf_data_end(root
, leaf
);
1989 slot
= path
->slots
[0];
1990 old_data_start
= btrfs_item_offset_nr(leaf
, slot
);
1991 old_size
= btrfs_item_size_nr(leaf
, slot
);
1992 BUG_ON(old_size
<= new_size
);
1993 size_diff
= old_size
- new_size
;
1996 BUG_ON(slot
>= nritems
);
1999 * item0..itemN ... dataN.offset..dataN.size .. data0.size
2001 /* first correct the data pointers */
2002 for (i
= slot
; i
< nritems
; i
++) {
2004 item
= btrfs_item_nr(leaf
, i
);
2006 if (!leaf
->map_token
) {
2007 map_extent_buffer(leaf
, (unsigned long)item
,
2008 sizeof(struct btrfs_item
),
2009 &leaf
->map_token
, &leaf
->kaddr
,
2010 &leaf
->map_start
, &leaf
->map_len
,
2014 ioff
= btrfs_item_offset(leaf
, item
);
2015 btrfs_set_item_offset(leaf
, item
, ioff
+ size_diff
);
2018 if (leaf
->map_token
) {
2019 unmap_extent_buffer(leaf
, leaf
->map_token
, KM_USER1
);
2020 leaf
->map_token
= NULL
;
2023 /* shift the data */
2024 memmove_extent_buffer(leaf
, btrfs_leaf_data(leaf
) +
2025 data_end
+ size_diff
, btrfs_leaf_data(leaf
) +
2026 data_end
, old_data_start
+ new_size
- data_end
);
2028 item
= btrfs_item_nr(leaf
, slot
);
2029 btrfs_set_item_size(leaf
, item
, new_size
);
2030 btrfs_mark_buffer_dirty(leaf
);
2033 if (btrfs_leaf_free_space(root
, leaf
) < 0) {
2034 btrfs_print_leaf(root
, leaf
);
2040 int btrfs_extend_item(struct btrfs_trans_handle
*trans
,
2041 struct btrfs_root
*root
, struct btrfs_path
*path
,
2047 struct extent_buffer
*leaf
;
2048 struct btrfs_item
*item
;
2050 unsigned int data_end
;
2051 unsigned int old_data
;
2052 unsigned int old_size
;
2055 slot_orig
= path
->slots
[0];
2056 leaf
= path
->nodes
[0];
2058 nritems
= btrfs_header_nritems(leaf
);
2059 data_end
= leaf_data_end(root
, leaf
);
2061 if (btrfs_leaf_free_space(root
, leaf
) < data_size
) {
2062 btrfs_print_leaf(root
, leaf
);
2065 slot
= path
->slots
[0];
2066 old_data
= btrfs_item_end_nr(leaf
, slot
);
2069 if (slot
>= nritems
) {
2070 btrfs_print_leaf(root
, leaf
);
2071 printk("slot %d too large, nritems %d\n", slot
, nritems
);
2076 * item0..itemN ... dataN.offset..dataN.size .. data0.size
2078 /* first correct the data pointers */
2079 for (i
= slot
; i
< nritems
; i
++) {
2081 item
= btrfs_item_nr(leaf
, i
);
2083 if (!leaf
->map_token
) {
2084 map_extent_buffer(leaf
, (unsigned long)item
,
2085 sizeof(struct btrfs_item
),
2086 &leaf
->map_token
, &leaf
->kaddr
,
2087 &leaf
->map_start
, &leaf
->map_len
,
2090 ioff
= btrfs_item_offset(leaf
, item
);
2091 btrfs_set_item_offset(leaf
, item
, ioff
- data_size
);
2094 if (leaf
->map_token
) {
2095 unmap_extent_buffer(leaf
, leaf
->map_token
, KM_USER1
);
2096 leaf
->map_token
= NULL
;
2099 /* shift the data */
2100 memmove_extent_buffer(leaf
, btrfs_leaf_data(leaf
) +
2101 data_end
- data_size
, btrfs_leaf_data(leaf
) +
2102 data_end
, old_data
- data_end
);
2104 data_end
= old_data
;
2105 old_size
= btrfs_item_size_nr(leaf
, slot
);
2106 item
= btrfs_item_nr(leaf
, slot
);
2107 btrfs_set_item_size(leaf
, item
, old_size
+ data_size
);
2108 btrfs_mark_buffer_dirty(leaf
);
2111 if (btrfs_leaf_free_space(root
, leaf
) < 0) {
2112 btrfs_print_leaf(root
, leaf
);
2119 * Given a key and some data, insert an item into the tree.
2120 * This does all the path init required, making room in the tree if needed.
2122 int btrfs_insert_empty_item(struct btrfs_trans_handle
*trans
,
2123 struct btrfs_root
*root
,
2124 struct btrfs_path
*path
,
2125 struct btrfs_key
*cpu_key
, u32 data_size
)
2127 struct extent_buffer
*leaf
;
2128 struct btrfs_item
*item
;
2133 unsigned int data_end
;
2134 struct btrfs_disk_key disk_key
;
2136 btrfs_cpu_key_to_disk(&disk_key
, cpu_key
);
2138 /* create a root if there isn't one */
2142 ret
= btrfs_search_slot(trans
, root
, cpu_key
, path
, data_size
, 1);
2149 slot_orig
= path
->slots
[0];
2150 leaf
= path
->nodes
[0];
2152 nritems
= btrfs_header_nritems(leaf
);
2153 data_end
= leaf_data_end(root
, leaf
);
2155 if (btrfs_leaf_free_space(root
, leaf
) <
2156 sizeof(struct btrfs_item
) + data_size
) {
2157 btrfs_print_leaf(root
, leaf
);
2158 printk("not enough freespace need %u have %d\n",
2159 data_size
, btrfs_leaf_free_space(root
, leaf
));
2163 slot
= path
->slots
[0];
2166 if (slot
!= nritems
) {
2168 unsigned int old_data
= btrfs_item_end_nr(leaf
, slot
);
2170 if (old_data
< data_end
) {
2171 btrfs_print_leaf(root
, leaf
);
2172 printk("slot %d old_data %d data_end %d\n",
2173 slot
, old_data
, data_end
);
2177 * item0..itemN ... dataN.offset..dataN.size .. data0.size
2179 /* first correct the data pointers */
2180 WARN_ON(leaf
->map_token
);
2181 for (i
= slot
; i
< nritems
; i
++) {
2184 item
= btrfs_item_nr(leaf
, i
);
2185 if (!leaf
->map_token
) {
2186 map_extent_buffer(leaf
, (unsigned long)item
,
2187 sizeof(struct btrfs_item
),
2188 &leaf
->map_token
, &leaf
->kaddr
,
2189 &leaf
->map_start
, &leaf
->map_len
,
2193 ioff
= btrfs_item_offset(leaf
, item
);
2194 btrfs_set_item_offset(leaf
, item
, ioff
- data_size
);
2196 if (leaf
->map_token
) {
2197 unmap_extent_buffer(leaf
, leaf
->map_token
, KM_USER1
);
2198 leaf
->map_token
= NULL
;
2201 /* shift the items */
2202 memmove_extent_buffer(leaf
, btrfs_item_nr_offset(slot
+ 1),
2203 btrfs_item_nr_offset(slot
),
2204 (nritems
- slot
) * sizeof(struct btrfs_item
));
2206 /* shift the data */
2207 memmove_extent_buffer(leaf
, btrfs_leaf_data(leaf
) +
2208 data_end
- data_size
, btrfs_leaf_data(leaf
) +
2209 data_end
, old_data
- data_end
);
2210 data_end
= old_data
;
2213 /* setup the item for the new data */
2214 btrfs_set_item_key(leaf
, &disk_key
, slot
);
2215 item
= btrfs_item_nr(leaf
, slot
);
2216 btrfs_set_item_offset(leaf
, item
, data_end
- data_size
);
2217 btrfs_set_item_size(leaf
, item
, data_size
);
2218 btrfs_set_header_nritems(leaf
, nritems
+ 1);
2219 btrfs_mark_buffer_dirty(leaf
);
2223 ret
= fixup_low_keys(trans
, root
, path
, &disk_key
, 1);
2225 if (btrfs_leaf_free_space(root
, leaf
) < 0) {
2226 btrfs_print_leaf(root
, leaf
);
2234 * Given a key and some data, insert an item into the tree.
2235 * This does all the path init required, making room in the tree if needed.
2237 int btrfs_insert_item(struct btrfs_trans_handle
*trans
, struct btrfs_root
2238 *root
, struct btrfs_key
*cpu_key
, void *data
, u32
2242 struct btrfs_path
*path
;
2243 struct extent_buffer
*leaf
;
2246 path
= btrfs_alloc_path();
2248 ret
= btrfs_insert_empty_item(trans
, root
, path
, cpu_key
, data_size
);
2250 leaf
= path
->nodes
[0];
2251 ptr
= btrfs_item_ptr_offset(leaf
, path
->slots
[0]);
2252 write_extent_buffer(leaf
, data
, ptr
, data_size
);
2253 btrfs_mark_buffer_dirty(leaf
);
2255 btrfs_free_path(path
);
2260 * delete the pointer from a given node.
2262 * If the delete empties a node, the node is removed from the tree,
2263 * continuing all the way the root if required. The root is converted into
2264 * a leaf if all the nodes are emptied.
2266 static int del_ptr(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
2267 struct btrfs_path
*path
, int level
, int slot
)
2269 struct extent_buffer
*parent
= path
->nodes
[level
];
2274 nritems
= btrfs_header_nritems(parent
);
2275 if (slot
!= nritems
-1) {
2276 memmove_extent_buffer(parent
,
2277 btrfs_node_key_ptr_offset(slot
),
2278 btrfs_node_key_ptr_offset(slot
+ 1),
2279 sizeof(struct btrfs_key_ptr
) *
2280 (nritems
- slot
- 1));
2283 btrfs_set_header_nritems(parent
, nritems
);
2284 if (nritems
== 0 && parent
== root
->node
) {
2285 BUG_ON(btrfs_header_level(root
->node
) != 1);
2286 /* just turn the root into a leaf and break */
2287 btrfs_set_header_level(root
->node
, 0);
2288 } else if (slot
== 0) {
2289 struct btrfs_disk_key disk_key
;
2291 btrfs_node_key(parent
, &disk_key
, 0);
2292 wret
= fixup_low_keys(trans
, root
, path
, &disk_key
, level
+ 1);
2296 btrfs_mark_buffer_dirty(parent
);
2301 * delete the item at the leaf level in path. If that empties
2302 * the leaf, remove it from the tree
2304 int btrfs_del_item(struct btrfs_trans_handle
*trans
, struct btrfs_root
*root
,
2305 struct btrfs_path
*path
)
2308 struct extent_buffer
*leaf
;
2309 struct btrfs_item
*item
;
2316 leaf
= path
->nodes
[0];
2317 slot
= path
->slots
[0];
2318 doff
= btrfs_item_offset_nr(leaf
, slot
);
2319 dsize
= btrfs_item_size_nr(leaf
, slot
);
2320 nritems
= btrfs_header_nritems(leaf
);
2322 if (slot
!= nritems
- 1) {
2324 int data_end
= leaf_data_end(root
, leaf
);
2326 memmove_extent_buffer(leaf
, btrfs_leaf_data(leaf
) +
2328 btrfs_leaf_data(leaf
) + data_end
,
2331 for (i
= slot
+ 1; i
< nritems
; i
++) {
2334 item
= btrfs_item_nr(leaf
, i
);
2335 if (!leaf
->map_token
) {
2336 map_extent_buffer(leaf
, (unsigned long)item
,
2337 sizeof(struct btrfs_item
),
2338 &leaf
->map_token
, &leaf
->kaddr
,
2339 &leaf
->map_start
, &leaf
->map_len
,
2342 ioff
= btrfs_item_offset(leaf
, item
);
2343 btrfs_set_item_offset(leaf
, item
, ioff
+ dsize
);
2346 if (leaf
->map_token
) {
2347 unmap_extent_buffer(leaf
, leaf
->map_token
, KM_USER1
);
2348 leaf
->map_token
= NULL
;
2351 memmove_extent_buffer(leaf
, btrfs_item_nr_offset(slot
),
2352 btrfs_item_nr_offset(slot
+ 1),
2353 sizeof(struct btrfs_item
) *
2354 (nritems
- slot
- 1));
2356 btrfs_set_header_nritems(leaf
, nritems
- 1);
2359 /* delete the leaf if we've emptied it */
2361 if (leaf
== root
->node
) {
2362 btrfs_set_header_level(leaf
, 0);
2364 clean_tree_block(trans
, root
, leaf
);
2365 wait_on_tree_block_writeback(root
, leaf
);
2366 wret
= del_ptr(trans
, root
, path
, 1, path
->slots
[1]);
2369 wret
= btrfs_free_extent(trans
, root
,
2370 leaf
->start
, leaf
->len
, 1);
2375 int used
= leaf_space_used(leaf
, 0, nritems
);
2377 struct btrfs_disk_key disk_key
;
2379 btrfs_item_key(leaf
, &disk_key
, 0);
2380 wret
= fixup_low_keys(trans
, root
, path
,
2386 /* delete the leaf if it is mostly empty */
2387 if (used
< BTRFS_LEAF_DATA_SIZE(root
) / 3) {
2388 /* push_leaf_left fixes the path.
2389 * make sure the path still points to our leaf
2390 * for possible call to del_ptr below
2392 slot
= path
->slots
[1];
2393 extent_buffer_get(leaf
);
2395 wret
= push_leaf_right(trans
, root
, path
, 1);
2396 if (wret
< 0 && wret
!= -ENOSPC
)
2399 if (path
->nodes
[0] == leaf
&&
2400 btrfs_header_nritems(leaf
)) {
2401 wret
= push_leaf_left(trans
, root
, path
, 1);
2402 if (wret
< 0 && wret
!= -ENOSPC
)
2406 if (btrfs_header_nritems(leaf
) == 0) {
2407 u64 bytenr
= leaf
->start
;
2408 u32 blocksize
= leaf
->len
;
2410 clean_tree_block(trans
, root
, leaf
);
2411 wait_on_tree_block_writeback(root
, leaf
);
2413 wret
= del_ptr(trans
, root
, path
, 1, slot
);
2417 free_extent_buffer(leaf
);
2418 wret
= btrfs_free_extent(trans
, root
, bytenr
,
2423 btrfs_mark_buffer_dirty(leaf
);
2424 free_extent_buffer(leaf
);
2427 btrfs_mark_buffer_dirty(leaf
);
2434 * walk up the tree as far as required to find the next leaf.
2435 * returns 0 if it found something or 1 if there are no greater leaves.
2436 * returns < 0 on io errors.
2438 int btrfs_next_leaf(struct btrfs_root
*root
, struct btrfs_path
*path
)
2443 struct extent_buffer
*c
;
2444 struct extent_buffer
*next
= NULL
;
2446 while(level
< BTRFS_MAX_LEVEL
) {
2447 if (!path
->nodes
[level
])
2450 slot
= path
->slots
[level
] + 1;
2451 c
= path
->nodes
[level
];
2452 if (slot
>= btrfs_header_nritems(c
)) {
2457 bytenr
= btrfs_node_blockptr(c
, slot
);
2459 free_extent_buffer(next
);
2462 reada_for_search(root
, path
, level
, slot
);
2464 next
= read_tree_block(root
, bytenr
,
2465 btrfs_level_size(root
, level
-1));
2468 path
->slots
[level
] = slot
;
2471 c
= path
->nodes
[level
];
2472 free_extent_buffer(c
);
2473 path
->nodes
[level
] = next
;
2474 path
->slots
[level
] = 0;
2478 reada_for_search(root
, path
, level
, 0);
2479 next
= read_tree_block(root
, btrfs_node_blockptr(next
, 0),
2480 btrfs_level_size(root
, level
- 1));