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.
20 #include "transaction.h"
21 #include "print-tree.h"
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
29 *root, struct btrfs_key *ins_key,
30 struct btrfs_path *path, int data_size, int extend);
31 static int push_node_left(struct btrfs_trans_handle *trans,
32 struct btrfs_root *root, struct extent_buffer *dst,
33 struct extent_buffer *src, int empty);
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);
39 inline void btrfs_init_path(struct btrfs_path *p)
41 memset(p, 0, sizeof(*p));
44 struct btrfs_path *btrfs_alloc_path(void)
46 struct btrfs_path *path;
47 path = kzalloc(sizeof(struct btrfs_path), GFP_NOFS);
51 void btrfs_free_path(struct btrfs_path *p)
55 btrfs_release_path(p);
59 void btrfs_release_path(struct btrfs_path *p)
62 for (i = 0; i < BTRFS_MAX_LEVEL; i++) {
65 free_extent_buffer(p->nodes[i]);
67 memset(p, 0, sizeof(*p));
70 void add_root_to_dirty_list(struct btrfs_root *root)
72 if (root->track_dirty && list_empty(&root->dirty_list)) {
73 list_add(&root->dirty_list,
74 &root->fs_info->dirty_cowonly_roots);
78 int btrfs_copy_root(struct btrfs_trans_handle *trans,
79 struct btrfs_root *root,
80 struct extent_buffer *buf,
81 struct extent_buffer **cow_ret, u64 new_root_objectid)
83 struct extent_buffer *cow;
86 struct btrfs_root *new_root;
87 struct btrfs_disk_key disk_key;
89 new_root = kmalloc(sizeof(*new_root), GFP_NOFS);
93 memcpy(new_root, root, sizeof(*new_root));
94 new_root->root_key.objectid = new_root_objectid;
96 WARN_ON(root->ref_cows && trans->transid !=
97 root->fs_info->running_transaction->transid);
98 WARN_ON(root->ref_cows && trans->transid != root->last_trans);
100 level = btrfs_header_level(buf);
102 btrfs_item_key(buf, &disk_key, 0);
104 btrfs_node_key(buf, &disk_key, 0);
105 cow = btrfs_alloc_free_block(trans, new_root, buf->len,
106 new_root_objectid, &disk_key,
107 level, buf->start, 0);
113 copy_extent_buffer(cow, buf, 0, 0, cow->len);
114 btrfs_set_header_bytenr(cow, cow->start);
115 btrfs_set_header_generation(cow, trans->transid);
116 btrfs_set_header_backref_rev(cow, BTRFS_MIXED_BACKREF_REV);
117 btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN |
118 BTRFS_HEADER_FLAG_RELOC);
119 if (new_root_objectid == BTRFS_TREE_RELOC_OBJECTID)
120 btrfs_set_header_flag(cow, BTRFS_HEADER_FLAG_RELOC);
122 btrfs_set_header_owner(cow, new_root_objectid);
124 write_extent_buffer(cow, root->fs_info->fsid,
125 btrfs_header_fsid(), BTRFS_FSID_SIZE);
127 WARN_ON(btrfs_header_generation(buf) > trans->transid);
128 ret = btrfs_inc_ref(trans, new_root, cow, 0);
134 btrfs_mark_buffer_dirty(cow);
140 * check if the tree block can be shared by multiple trees
142 static int btrfs_block_can_be_shared(struct btrfs_root *root,
143 struct extent_buffer *buf)
146 * Tree blocks not in reference counted trees and tree roots
147 * are never shared. If a block was allocated after the last
148 * snapshot and the block was not allocated by tree relocation,
149 * we know the block is not shared.
151 if (root->ref_cows &&
152 buf != root->node && buf != root->commit_root &&
153 (btrfs_header_generation(buf) <=
154 btrfs_root_last_snapshot(&root->root_item) ||
155 btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC)))
157 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
158 if (root->ref_cows &&
159 btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV)
165 static noinline int update_ref_for_cow(struct btrfs_trans_handle *trans,
166 struct btrfs_root *root,
167 struct extent_buffer *buf,
168 struct extent_buffer *cow)
177 * Backrefs update rules:
179 * Always use full backrefs for extent pointers in tree block
180 * allocated by tree relocation.
182 * If a shared tree block is no longer referenced by its owner
183 * tree (btrfs_header_owner(buf) == root->root_key.objectid),
184 * use full backrefs for extent pointers in tree block.
186 * If a tree block is been relocating
187 * (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID),
188 * use full backrefs for extent pointers in tree block.
189 * The reason for this is some operations (such as drop tree)
190 * are only allowed for blocks use full backrefs.
193 if (btrfs_block_can_be_shared(root, buf)) {
194 ret = btrfs_lookup_extent_info(trans, root, buf->start,
195 btrfs_header_level(buf), 1,
201 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID ||
202 btrfs_header_backref_rev(buf) < BTRFS_MIXED_BACKREF_REV)
203 flags = BTRFS_BLOCK_FLAG_FULL_BACKREF;
208 owner = btrfs_header_owner(buf);
209 BUG_ON(!(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) &&
210 owner == BTRFS_TREE_RELOC_OBJECTID);
213 if ((owner == root->root_key.objectid ||
214 root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID) &&
215 !(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF)) {
216 ret = btrfs_inc_ref(trans, root, buf, 1);
219 if (root->root_key.objectid ==
220 BTRFS_TREE_RELOC_OBJECTID) {
221 ret = btrfs_dec_ref(trans, root, buf, 0);
223 ret = btrfs_inc_ref(trans, root, cow, 1);
226 new_flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF;
229 if (root->root_key.objectid ==
230 BTRFS_TREE_RELOC_OBJECTID)
231 ret = btrfs_inc_ref(trans, root, cow, 1);
233 ret = btrfs_inc_ref(trans, root, cow, 0);
236 if (new_flags != 0) {
237 ret = btrfs_set_block_flags(trans, root, buf->start,
238 btrfs_header_level(buf),
243 if (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF) {
244 if (root->root_key.objectid ==
245 BTRFS_TREE_RELOC_OBJECTID)
246 ret = btrfs_inc_ref(trans, root, cow, 1);
248 ret = btrfs_inc_ref(trans, root, cow, 0);
250 ret = btrfs_dec_ref(trans, root, buf, 1);
253 clean_tree_block(trans, root, buf);
258 int __btrfs_cow_block(struct btrfs_trans_handle *trans,
259 struct btrfs_root *root,
260 struct extent_buffer *buf,
261 struct extent_buffer *parent, int parent_slot,
262 struct extent_buffer **cow_ret,
263 u64 search_start, u64 empty_size)
265 struct extent_buffer *cow;
266 struct btrfs_disk_key disk_key;
269 WARN_ON(root->ref_cows && trans->transid !=
270 root->fs_info->running_transaction->transid);
271 WARN_ON(root->ref_cows && trans->transid != root->last_trans);
273 level = btrfs_header_level(buf);
276 btrfs_item_key(buf, &disk_key, 0);
278 btrfs_node_key(buf, &disk_key, 0);
280 cow = btrfs_alloc_free_block(trans, root, buf->len,
281 root->root_key.objectid, &disk_key,
282 level, search_start, empty_size);
286 copy_extent_buffer(cow, buf, 0, 0, cow->len);
287 btrfs_set_header_bytenr(cow, cow->start);
288 btrfs_set_header_generation(cow, trans->transid);
289 btrfs_set_header_backref_rev(cow, BTRFS_MIXED_BACKREF_REV);
290 btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN |
291 BTRFS_HEADER_FLAG_RELOC);
292 if (root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID)
293 btrfs_set_header_flag(cow, BTRFS_HEADER_FLAG_RELOC);
295 btrfs_set_header_owner(cow, root->root_key.objectid);
297 write_extent_buffer(cow, root->fs_info->fsid,
298 btrfs_header_fsid(), BTRFS_FSID_SIZE);
300 WARN_ON(!(buf->flags & EXTENT_BAD_TRANSID) &&
301 btrfs_header_generation(buf) > trans->transid);
303 update_ref_for_cow(trans, root, buf, cow);
305 if (buf == root->node) {
307 extent_buffer_get(cow);
309 btrfs_free_extent(trans, root, buf->start, buf->len,
310 0, root->root_key.objectid, level, 0);
311 free_extent_buffer(buf);
312 add_root_to_dirty_list(root);
314 btrfs_set_node_blockptr(parent, parent_slot,
316 WARN_ON(trans->transid == 0);
317 btrfs_set_node_ptr_generation(parent, parent_slot,
319 btrfs_mark_buffer_dirty(parent);
320 WARN_ON(btrfs_header_generation(parent) != trans->transid);
322 btrfs_free_extent(trans, root, buf->start, buf->len,
323 0, root->root_key.objectid, level, 1);
325 if (!list_empty(&buf->recow)) {
326 list_del_init(&buf->recow);
327 free_extent_buffer(buf);
329 free_extent_buffer(buf);
330 btrfs_mark_buffer_dirty(cow);
335 static inline int should_cow_block(struct btrfs_trans_handle *trans,
336 struct btrfs_root *root,
337 struct extent_buffer *buf)
339 if (btrfs_header_generation(buf) == trans->transid &&
340 !btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN) &&
341 !(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID &&
342 btrfs_header_flag(buf, BTRFS_HEADER_FLAG_RELOC)))
347 int btrfs_cow_block(struct btrfs_trans_handle *trans,
348 struct btrfs_root *root, struct extent_buffer *buf,
349 struct extent_buffer *parent, int parent_slot,
350 struct extent_buffer **cow_ret)
355 if (trans->transaction != root->fs_info->running_transaction) {
356 printk(KERN_CRIT "trans %Lu running %Lu\n", trans->transid,
357 root->fs_info->running_transaction->transid);
361 if (trans->transid != root->fs_info->generation) {
362 printk(KERN_CRIT "trans %llu running %llu\n",
363 (unsigned long long)trans->transid,
364 (unsigned long long)root->fs_info->generation);
367 if (!should_cow_block(trans, root, buf)) {
372 search_start = buf->start & ~((u64)SZ_1G - 1);
373 ret = __btrfs_cow_block(trans, root, buf, parent,
374 parent_slot, cow_ret, search_start, 0);
378 int btrfs_comp_cpu_keys(struct btrfs_key *k1, struct btrfs_key *k2)
380 if (k1->objectid > k2->objectid)
382 if (k1->objectid < k2->objectid)
384 if (k1->type > k2->type)
386 if (k1->type < k2->type)
388 if (k1->offset > k2->offset)
390 if (k1->offset < k2->offset)
396 * compare two keys in a memcmp fashion
398 static int btrfs_comp_keys(struct btrfs_disk_key *disk, struct btrfs_key *k2)
402 btrfs_disk_key_to_cpu(&k1, disk);
403 return btrfs_comp_cpu_keys(&k1, k2);
407 * The leaf data grows from end-to-front in the node.
408 * this returns the address of the start of the last item,
409 * which is the stop of the leaf data stack
411 static inline unsigned int leaf_data_end(struct btrfs_root *root,
412 struct extent_buffer *leaf)
414 u32 nr = btrfs_header_nritems(leaf);
416 return BTRFS_LEAF_DATA_SIZE(root);
417 return btrfs_item_offset_nr(leaf, nr - 1);
420 enum btrfs_tree_block_status
421 btrfs_check_node(struct btrfs_root *root, struct btrfs_disk_key *parent_key,
422 struct extent_buffer *buf)
425 struct btrfs_key cpukey;
426 struct btrfs_disk_key key;
427 u32 nritems = btrfs_header_nritems(buf);
428 enum btrfs_tree_block_status ret = BTRFS_TREE_BLOCK_INVALID_NRITEMS;
430 if (nritems == 0 || nritems > BTRFS_NODEPTRS_PER_BLOCK(root))
433 ret = BTRFS_TREE_BLOCK_INVALID_PARENT_KEY;
434 if (parent_key && parent_key->type) {
435 btrfs_node_key(buf, &key, 0);
436 if (memcmp(parent_key, &key, sizeof(key)))
439 ret = BTRFS_TREE_BLOCK_BAD_KEY_ORDER;
440 for (i = 0; nritems > 1 && i < nritems - 2; i++) {
441 btrfs_node_key(buf, &key, i);
442 btrfs_node_key_to_cpu(buf, &cpukey, i + 1);
443 if (btrfs_comp_keys(&key, &cpukey) >= 0)
446 return BTRFS_TREE_BLOCK_CLEAN;
448 if (btrfs_header_owner(buf) == BTRFS_EXTENT_TREE_OBJECTID) {
450 btrfs_disk_key_to_cpu(&cpukey, parent_key);
452 btrfs_node_key_to_cpu(buf, &cpukey, 0);
453 btrfs_add_corrupt_extent_record(root->fs_info, &cpukey,
454 buf->start, buf->len,
455 btrfs_header_level(buf));
460 enum btrfs_tree_block_status
461 btrfs_check_leaf(struct btrfs_root *root, struct btrfs_disk_key *parent_key,
462 struct extent_buffer *buf)
465 struct btrfs_key cpukey;
466 struct btrfs_disk_key key;
467 u32 nritems = btrfs_header_nritems(buf);
468 enum btrfs_tree_block_status ret = BTRFS_TREE_BLOCK_INVALID_NRITEMS;
470 if (nritems * sizeof(struct btrfs_item) > buf->len) {
471 fprintf(stderr, "invalid number of items %llu\n",
472 (unsigned long long)buf->start);
476 if (btrfs_header_level(buf) != 0) {
477 ret = BTRFS_TREE_BLOCK_INVALID_LEVEL;
478 fprintf(stderr, "leaf is not a leaf %llu\n",
479 (unsigned long long)btrfs_header_bytenr(buf));
482 if (btrfs_leaf_free_space(root, buf) < 0) {
483 ret = BTRFS_TREE_BLOCK_INVALID_FREE_SPACE;
484 fprintf(stderr, "leaf free space incorrect %llu %d\n",
485 (unsigned long long)btrfs_header_bytenr(buf),
486 btrfs_leaf_free_space(root, buf));
491 return BTRFS_TREE_BLOCK_CLEAN;
493 btrfs_item_key(buf, &key, 0);
494 if (parent_key && parent_key->type &&
495 memcmp(parent_key, &key, sizeof(key))) {
496 ret = BTRFS_TREE_BLOCK_INVALID_PARENT_KEY;
497 fprintf(stderr, "leaf parent key incorrect %llu\n",
498 (unsigned long long)btrfs_header_bytenr(buf));
501 for (i = 0; nritems > 1 && i < nritems - 1; i++) {
502 btrfs_item_key(buf, &key, i);
503 btrfs_item_key_to_cpu(buf, &cpukey, i + 1);
504 if (btrfs_comp_keys(&key, &cpukey) >= 0) {
505 ret = BTRFS_TREE_BLOCK_BAD_KEY_ORDER;
506 fprintf(stderr, "bad key ordering %d %d\n", i, i+1);
509 if (btrfs_item_offset_nr(buf, i) !=
510 btrfs_item_end_nr(buf, i + 1)) {
511 ret = BTRFS_TREE_BLOCK_INVALID_OFFSETS;
512 fprintf(stderr, "incorrect offsets %u %u\n",
513 btrfs_item_offset_nr(buf, i),
514 btrfs_item_end_nr(buf, i + 1));
517 if (i == 0 && btrfs_item_end_nr(buf, i) !=
518 BTRFS_LEAF_DATA_SIZE(root)) {
519 ret = BTRFS_TREE_BLOCK_INVALID_OFFSETS;
520 fprintf(stderr, "bad item end %u wanted %u\n",
521 btrfs_item_end_nr(buf, i),
522 (unsigned)BTRFS_LEAF_DATA_SIZE(root));
527 for (i = 0; i < nritems; i++) {
528 if (btrfs_item_end_nr(buf, i) > BTRFS_LEAF_DATA_SIZE(root)) {
529 btrfs_item_key(buf, &key, 0);
530 btrfs_print_key(&key);
532 ret = BTRFS_TREE_BLOCK_INVALID_OFFSETS;
533 fprintf(stderr, "slot end outside of leaf %llu > %llu\n",
534 (unsigned long long)btrfs_item_end_nr(buf, i),
535 (unsigned long long)BTRFS_LEAF_DATA_SIZE(root));
540 return BTRFS_TREE_BLOCK_CLEAN;
542 if (btrfs_header_owner(buf) == BTRFS_EXTENT_TREE_OBJECTID) {
544 btrfs_disk_key_to_cpu(&cpukey, parent_key);
546 btrfs_item_key_to_cpu(buf, &cpukey, 0);
548 btrfs_add_corrupt_extent_record(root->fs_info, &cpukey,
549 buf->start, buf->len, 0);
554 static int noinline check_block(struct btrfs_root *root,
555 struct btrfs_path *path, int level)
557 struct btrfs_disk_key key;
558 struct btrfs_disk_key *key_ptr = NULL;
559 struct extent_buffer *parent;
560 enum btrfs_tree_block_status ret;
562 if (path->skip_check_block)
564 if (path->nodes[level + 1]) {
565 parent = path->nodes[level + 1];
566 btrfs_node_key(parent, &key, path->slots[level + 1]);
570 ret = btrfs_check_leaf(root, key_ptr, path->nodes[0]);
572 ret = btrfs_check_node(root, key_ptr, path->nodes[level]);
573 if (ret == BTRFS_TREE_BLOCK_CLEAN)
579 * search for key in the extent_buffer. The items start at offset p,
580 * and they are item_size apart. There are 'max' items in p.
582 * the slot in the array is returned via slot, and it points to
583 * the place where you would insert key if it is not found in
586 * slot may point to max if the key is bigger than all of the keys
588 static int generic_bin_search(struct extent_buffer *eb, unsigned long p,
589 int item_size, struct btrfs_key *key,
596 unsigned long offset;
597 struct btrfs_disk_key *tmp;
600 mid = (low + high) / 2;
601 offset = p + mid * item_size;
603 tmp = (struct btrfs_disk_key *)(eb->data + offset);
604 ret = btrfs_comp_keys(tmp, key);
620 * simple bin_search frontend that does the right thing for
623 static int bin_search(struct extent_buffer *eb, struct btrfs_key *key,
624 int level, int *slot)
627 return generic_bin_search(eb,
628 offsetof(struct btrfs_leaf, items),
629 sizeof(struct btrfs_item),
630 key, btrfs_header_nritems(eb),
633 return generic_bin_search(eb,
634 offsetof(struct btrfs_node, ptrs),
635 sizeof(struct btrfs_key_ptr),
636 key, btrfs_header_nritems(eb),
640 struct extent_buffer *read_node_slot(struct btrfs_fs_info *fs_info,
641 struct extent_buffer *parent, int slot)
643 int level = btrfs_header_level(parent);
646 if (slot >= btrfs_header_nritems(parent))
652 return read_tree_block(fs_info, btrfs_node_blockptr(parent, slot),
654 btrfs_node_ptr_generation(parent, slot));
657 static int balance_level(struct btrfs_trans_handle *trans,
658 struct btrfs_root *root,
659 struct btrfs_path *path, int level)
661 struct extent_buffer *right = NULL;
662 struct extent_buffer *mid;
663 struct extent_buffer *left = NULL;
664 struct extent_buffer *parent = NULL;
665 struct btrfs_fs_info *fs_info = root->fs_info;
669 int orig_slot = path->slots[level];
675 mid = path->nodes[level];
676 WARN_ON(btrfs_header_generation(mid) != trans->transid);
678 orig_ptr = btrfs_node_blockptr(mid, orig_slot);
680 if (level < BTRFS_MAX_LEVEL - 1) {
681 parent = path->nodes[level + 1];
682 pslot = path->slots[level + 1];
686 * deal with the case where there is only one pointer in the root
687 * by promoting the node below to a root
690 struct extent_buffer *child;
692 if (btrfs_header_nritems(mid) != 1)
695 /* promote the child to a root */
696 child = read_node_slot(fs_info, mid, 0);
697 BUG_ON(!extent_buffer_uptodate(child));
698 ret = btrfs_cow_block(trans, root, child, mid, 0, &child);
702 add_root_to_dirty_list(root);
703 path->nodes[level] = NULL;
704 clean_tree_block(trans, root, mid);
705 /* once for the path */
706 free_extent_buffer(mid);
708 ret = btrfs_free_extent(trans, root, mid->start, mid->len,
709 0, root->root_key.objectid,
711 /* once for the root ptr */
712 free_extent_buffer(mid);
715 if (btrfs_header_nritems(mid) >
716 BTRFS_NODEPTRS_PER_BLOCK(root) / 4)
719 left = read_node_slot(fs_info, parent, pslot - 1);
720 if (extent_buffer_uptodate(left)) {
721 wret = btrfs_cow_block(trans, root, left,
722 parent, pslot - 1, &left);
728 right = read_node_slot(fs_info, parent, pslot + 1);
729 if (extent_buffer_uptodate(right)) {
730 wret = btrfs_cow_block(trans, root, right,
731 parent, pslot + 1, &right);
738 /* first, try to make some room in the middle buffer */
740 orig_slot += btrfs_header_nritems(left);
741 wret = push_node_left(trans, root, left, mid, 1);
747 * then try to empty the right most buffer into the middle
750 wret = push_node_left(trans, root, mid, right, 1);
751 if (wret < 0 && wret != -ENOSPC)
753 if (btrfs_header_nritems(right) == 0) {
754 u64 bytenr = right->start;
755 u32 blocksize = right->len;
757 clean_tree_block(trans, root, right);
758 free_extent_buffer(right);
760 wret = btrfs_del_ptr(root, path, level + 1, pslot + 1);
763 wret = btrfs_free_extent(trans, root, bytenr,
765 root->root_key.objectid,
770 struct btrfs_disk_key right_key;
771 btrfs_node_key(right, &right_key, 0);
772 btrfs_set_node_key(parent, &right_key, pslot + 1);
773 btrfs_mark_buffer_dirty(parent);
776 if (btrfs_header_nritems(mid) == 1) {
778 * we're not allowed to leave a node with one item in the
779 * tree during a delete. A deletion from lower in the tree
780 * could try to delete the only pointer in this node.
781 * So, pull some keys from the left.
782 * There has to be a left pointer at this point because
783 * otherwise we would have pulled some pointers from the
787 wret = balance_node_right(trans, root, mid, left);
793 wret = push_node_left(trans, root, left, mid, 1);
799 if (btrfs_header_nritems(mid) == 0) {
800 /* we've managed to empty the middle node, drop it */
801 u64 bytenr = mid->start;
802 u32 blocksize = mid->len;
803 clean_tree_block(trans, root, mid);
804 free_extent_buffer(mid);
806 wret = btrfs_del_ptr(root, path, level + 1, pslot);
809 wret = btrfs_free_extent(trans, root, bytenr, blocksize,
810 0, root->root_key.objectid,
815 /* update the parent key to reflect our changes */
816 struct btrfs_disk_key mid_key;
817 btrfs_node_key(mid, &mid_key, 0);
818 btrfs_set_node_key(parent, &mid_key, pslot);
819 btrfs_mark_buffer_dirty(parent);
822 /* update the path */
824 if (btrfs_header_nritems(left) > orig_slot) {
825 extent_buffer_get(left);
826 path->nodes[level] = left;
827 path->slots[level + 1] -= 1;
828 path->slots[level] = orig_slot;
830 free_extent_buffer(mid);
832 orig_slot -= btrfs_header_nritems(left);
833 path->slots[level] = orig_slot;
836 /* double check we haven't messed things up */
837 check_block(root, path, level);
839 btrfs_node_blockptr(path->nodes[level], path->slots[level]))
843 free_extent_buffer(right);
845 free_extent_buffer(left);
849 /* returns zero if the push worked, non-zero otherwise */
850 static int noinline push_nodes_for_insert(struct btrfs_trans_handle *trans,
851 struct btrfs_root *root,
852 struct btrfs_path *path, int level)
854 struct extent_buffer *right = NULL;
855 struct extent_buffer *mid;
856 struct extent_buffer *left = NULL;
857 struct extent_buffer *parent = NULL;
858 struct btrfs_fs_info *fs_info = root->fs_info;
862 int orig_slot = path->slots[level];
867 mid = path->nodes[level];
868 WARN_ON(btrfs_header_generation(mid) != trans->transid);
870 if (level < BTRFS_MAX_LEVEL - 1) {
871 parent = path->nodes[level + 1];
872 pslot = path->slots[level + 1];
878 left = read_node_slot(fs_info, parent, pslot - 1);
880 /* first, try to make some room in the middle buffer */
881 if (extent_buffer_uptodate(left)) {
883 left_nr = btrfs_header_nritems(left);
884 if (left_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) {
887 ret = btrfs_cow_block(trans, root, left, parent,
892 wret = push_node_left(trans, root,
899 struct btrfs_disk_key disk_key;
900 orig_slot += left_nr;
901 btrfs_node_key(mid, &disk_key, 0);
902 btrfs_set_node_key(parent, &disk_key, pslot);
903 btrfs_mark_buffer_dirty(parent);
904 if (btrfs_header_nritems(left) > orig_slot) {
905 path->nodes[level] = left;
906 path->slots[level + 1] -= 1;
907 path->slots[level] = orig_slot;
908 free_extent_buffer(mid);
911 btrfs_header_nritems(left);
912 path->slots[level] = orig_slot;
913 free_extent_buffer(left);
917 free_extent_buffer(left);
919 right= read_node_slot(fs_info, parent, pslot + 1);
922 * then try to empty the right most buffer into the middle
924 if (extent_buffer_uptodate(right)) {
926 right_nr = btrfs_header_nritems(right);
927 if (right_nr >= BTRFS_NODEPTRS_PER_BLOCK(root) - 1) {
930 ret = btrfs_cow_block(trans, root, right,
936 wret = balance_node_right(trans, root,
943 struct btrfs_disk_key disk_key;
945 btrfs_node_key(right, &disk_key, 0);
946 btrfs_set_node_key(parent, &disk_key, pslot + 1);
947 btrfs_mark_buffer_dirty(parent);
949 if (btrfs_header_nritems(mid) <= orig_slot) {
950 path->nodes[level] = right;
951 path->slots[level + 1] += 1;
952 path->slots[level] = orig_slot -
953 btrfs_header_nritems(mid);
954 free_extent_buffer(mid);
956 free_extent_buffer(right);
960 free_extent_buffer(right);
966 * readahead one full node of leaves
968 void reada_for_search(struct btrfs_root *root, struct btrfs_path *path,
969 int level, int slot, u64 objectid)
971 struct extent_buffer *node;
972 struct btrfs_disk_key disk_key;
978 int direction = path->reada;
979 struct extent_buffer *eb;
987 if (!path->nodes[level])
990 node = path->nodes[level];
991 search = btrfs_node_blockptr(node, slot);
992 blocksize = root->fs_info->nodesize;
993 eb = btrfs_find_tree_block(root, search, blocksize);
995 free_extent_buffer(eb);
999 highest_read = search;
1000 lowest_read = search;
1002 nritems = btrfs_header_nritems(node);
1005 if (direction < 0) {
1009 } else if (direction > 0) {
1014 if (path->reada < 0 && objectid) {
1015 btrfs_node_key(node, &disk_key, nr);
1016 if (btrfs_disk_key_objectid(&disk_key) != objectid)
1019 search = btrfs_node_blockptr(node, nr);
1020 if ((search >= lowest_read && search <= highest_read) ||
1021 (search < lowest_read && lowest_read - search <= 32768) ||
1022 (search > highest_read && search - highest_read <= 32768)) {
1023 readahead_tree_block(root, search, blocksize,
1024 btrfs_node_ptr_generation(node, nr));
1028 if (path->reada < 2 && (nread > SZ_256K || nscan > 32))
1030 if(nread > SZ_1M || nscan > 128)
1033 if (search < lowest_read)
1034 lowest_read = search;
1035 if (search > highest_read)
1036 highest_read = search;
1040 int btrfs_find_item(struct btrfs_root *fs_root, struct btrfs_path *found_path,
1041 u64 iobjectid, u64 ioff, u8 key_type,
1042 struct btrfs_key *found_key)
1045 struct btrfs_key key;
1046 struct extent_buffer *eb;
1047 struct btrfs_path *path;
1049 key.type = key_type;
1050 key.objectid = iobjectid;
1053 if (found_path == NULL) {
1054 path = btrfs_alloc_path();
1060 ret = btrfs_search_slot(NULL, fs_root, &key, path, 0, 0);
1061 if ((ret < 0) || (found_key == NULL))
1064 eb = path->nodes[0];
1065 if (ret && path->slots[0] >= btrfs_header_nritems(eb)) {
1066 ret = btrfs_next_leaf(fs_root, path);
1069 eb = path->nodes[0];
1072 btrfs_item_key_to_cpu(eb, found_key, path->slots[0]);
1073 if (found_key->type != key.type ||
1074 found_key->objectid != key.objectid) {
1080 if (path != found_path)
1081 btrfs_free_path(path);
1086 * look for key in the tree. path is filled in with nodes along the way
1087 * if key is found, we return zero and you can find the item in the leaf
1088 * level of the path (level 0)
1090 * If the key isn't found, the path points to the slot where it should
1091 * be inserted, and 1 is returned. If there are other errors during the
1092 * search a negative error number is returned.
1094 * if ins_len > 0, nodes and leaves will be split as we walk down the
1095 * tree. if ins_len < 0, nodes will be merged as we walk down the tree (if
1098 int btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root
1099 *root, struct btrfs_key *key, struct btrfs_path *p, int
1102 struct extent_buffer *b;
1106 int should_reada = p->reada;
1107 struct btrfs_fs_info *fs_info = root->fs_info;
1108 u8 lowest_level = 0;
1110 lowest_level = p->lowest_level;
1111 WARN_ON(lowest_level && ins_len > 0);
1112 WARN_ON(p->nodes[0] != NULL);
1114 WARN_ON(!mutex_is_locked(&root->fs_info->fs_mutex));
1118 extent_buffer_get(b);
1120 level = btrfs_header_level(b);
1123 wret = btrfs_cow_block(trans, root, b,
1124 p->nodes[level + 1],
1125 p->slots[level + 1],
1128 free_extent_buffer(b);
1132 BUG_ON(!cow && ins_len);
1133 if (level != btrfs_header_level(b))
1135 level = btrfs_header_level(b);
1136 p->nodes[level] = b;
1137 ret = check_block(root, p, level);
1140 ret = bin_search(b, key, level, &slot);
1142 if (ret && slot > 0)
1144 p->slots[level] = slot;
1145 if ((p->search_for_split || ins_len > 0) &&
1146 btrfs_header_nritems(b) >=
1147 BTRFS_NODEPTRS_PER_BLOCK(root) - 3) {
1148 int sret = split_node(trans, root, p, level);
1152 b = p->nodes[level];
1153 slot = p->slots[level];
1154 } else if (ins_len < 0) {
1155 int sret = balance_level(trans, root, p,
1159 b = p->nodes[level];
1161 btrfs_release_path(p);
1164 slot = p->slots[level];
1165 BUG_ON(btrfs_header_nritems(b) == 1);
1167 /* this is only true while dropping a snapshot */
1168 if (level == lowest_level)
1172 reada_for_search(root, p, level, slot,
1175 b = read_node_slot(fs_info, b, slot);
1176 if (!extent_buffer_uptodate(b))
1179 p->slots[level] = slot;
1181 ins_len > btrfs_leaf_free_space(root, b)) {
1182 int sret = split_leaf(trans, root, key,
1183 p, ins_len, ret == 0);
1195 * adjust the pointers going up the tree, starting at level
1196 * making sure the right key of each node is points to 'key'.
1197 * This is used after shifting pointers to the left, so it stops
1198 * fixing up pointers when a given leaf/node is not in slot 0 of the
1201 void btrfs_fixup_low_keys(struct btrfs_root *root, struct btrfs_path *path,
1202 struct btrfs_disk_key *key, int level)
1205 struct extent_buffer *t;
1207 for (i = level; i < BTRFS_MAX_LEVEL; i++) {
1208 int tslot = path->slots[i];
1209 if (!path->nodes[i])
1212 btrfs_set_node_key(t, key, tslot);
1213 btrfs_mark_buffer_dirty(path->nodes[i]);
1222 * This function isn't completely safe. It's the caller's responsibility
1223 * that the new key won't break the order
1225 int btrfs_set_item_key_safe(struct btrfs_root *root, struct btrfs_path *path,
1226 struct btrfs_key *new_key)
1228 struct btrfs_disk_key disk_key;
1229 struct extent_buffer *eb;
1232 eb = path->nodes[0];
1233 slot = path->slots[0];
1235 btrfs_item_key(eb, &disk_key, slot - 1);
1236 if (btrfs_comp_keys(&disk_key, new_key) >= 0)
1239 if (slot < btrfs_header_nritems(eb) - 1) {
1240 btrfs_item_key(eb, &disk_key, slot + 1);
1241 if (btrfs_comp_keys(&disk_key, new_key) <= 0)
1245 btrfs_cpu_key_to_disk(&disk_key, new_key);
1246 btrfs_set_item_key(eb, &disk_key, slot);
1247 btrfs_mark_buffer_dirty(eb);
1249 btrfs_fixup_low_keys(root, path, &disk_key, 1);
1254 * update an item key without the safety checks. This is meant to be called by
1257 void btrfs_set_item_key_unsafe(struct btrfs_root *root,
1258 struct btrfs_path *path,
1259 struct btrfs_key *new_key)
1261 struct btrfs_disk_key disk_key;
1262 struct extent_buffer *eb;
1265 eb = path->nodes[0];
1266 slot = path->slots[0];
1268 btrfs_cpu_key_to_disk(&disk_key, new_key);
1269 btrfs_set_item_key(eb, &disk_key, slot);
1270 btrfs_mark_buffer_dirty(eb);
1272 btrfs_fixup_low_keys(root, path, &disk_key, 1);
1276 * try to push data from one node into the next node left in the
1279 * returns 0 if some ptrs were pushed left, < 0 if there was some horrible
1280 * error, and > 0 if there was no room in the left hand block.
1282 static int push_node_left(struct btrfs_trans_handle *trans,
1283 struct btrfs_root *root, struct extent_buffer *dst,
1284 struct extent_buffer *src, int empty)
1291 src_nritems = btrfs_header_nritems(src);
1292 dst_nritems = btrfs_header_nritems(dst);
1293 push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems;
1294 WARN_ON(btrfs_header_generation(src) != trans->transid);
1295 WARN_ON(btrfs_header_generation(dst) != trans->transid);
1297 if (!empty && src_nritems <= 8)
1300 if (push_items <= 0) {
1305 push_items = min(src_nritems, push_items);
1306 if (push_items < src_nritems) {
1307 /* leave at least 8 pointers in the node if
1308 * we aren't going to empty it
1310 if (src_nritems - push_items < 8) {
1311 if (push_items <= 8)
1317 push_items = min(src_nritems - 8, push_items);
1319 copy_extent_buffer(dst, src,
1320 btrfs_node_key_ptr_offset(dst_nritems),
1321 btrfs_node_key_ptr_offset(0),
1322 push_items * sizeof(struct btrfs_key_ptr));
1324 if (push_items < src_nritems) {
1325 memmove_extent_buffer(src, btrfs_node_key_ptr_offset(0),
1326 btrfs_node_key_ptr_offset(push_items),
1327 (src_nritems - push_items) *
1328 sizeof(struct btrfs_key_ptr));
1330 btrfs_set_header_nritems(src, src_nritems - push_items);
1331 btrfs_set_header_nritems(dst, dst_nritems + push_items);
1332 btrfs_mark_buffer_dirty(src);
1333 btrfs_mark_buffer_dirty(dst);
1339 * try to push data from one node into the next node right in the
1342 * returns 0 if some ptrs were pushed, < 0 if there was some horrible
1343 * error, and > 0 if there was no room in the right hand block.
1345 * this will only push up to 1/2 the contents of the left node over
1347 static int balance_node_right(struct btrfs_trans_handle *trans,
1348 struct btrfs_root *root,
1349 struct extent_buffer *dst,
1350 struct extent_buffer *src)
1358 WARN_ON(btrfs_header_generation(src) != trans->transid);
1359 WARN_ON(btrfs_header_generation(dst) != trans->transid);
1361 src_nritems = btrfs_header_nritems(src);
1362 dst_nritems = btrfs_header_nritems(dst);
1363 push_items = BTRFS_NODEPTRS_PER_BLOCK(root) - dst_nritems;
1364 if (push_items <= 0) {
1368 if (src_nritems < 4) {
1372 max_push = src_nritems / 2 + 1;
1373 /* don't try to empty the node */
1374 if (max_push >= src_nritems) {
1378 if (max_push < push_items)
1379 push_items = max_push;
1381 memmove_extent_buffer(dst, btrfs_node_key_ptr_offset(push_items),
1382 btrfs_node_key_ptr_offset(0),
1384 sizeof(struct btrfs_key_ptr));
1386 copy_extent_buffer(dst, src,
1387 btrfs_node_key_ptr_offset(0),
1388 btrfs_node_key_ptr_offset(src_nritems - push_items),
1389 push_items * sizeof(struct btrfs_key_ptr));
1391 btrfs_set_header_nritems(src, src_nritems - push_items);
1392 btrfs_set_header_nritems(dst, dst_nritems + push_items);
1394 btrfs_mark_buffer_dirty(src);
1395 btrfs_mark_buffer_dirty(dst);
1401 * helper function to insert a new root level in the tree.
1402 * A new node is allocated, and a single item is inserted to
1403 * point to the existing root
1405 * returns zero on success or < 0 on failure.
1407 static int noinline insert_new_root(struct btrfs_trans_handle *trans,
1408 struct btrfs_root *root,
1409 struct btrfs_path *path, int level)
1412 struct extent_buffer *lower;
1413 struct extent_buffer *c;
1414 struct extent_buffer *old;
1415 struct btrfs_disk_key lower_key;
1417 BUG_ON(path->nodes[level]);
1418 BUG_ON(path->nodes[level-1] != root->node);
1420 lower = path->nodes[level-1];
1422 btrfs_item_key(lower, &lower_key, 0);
1424 btrfs_node_key(lower, &lower_key, 0);
1426 c = btrfs_alloc_free_block(trans, root, root->fs_info->nodesize,
1427 root->root_key.objectid, &lower_key,
1428 level, root->node->start, 0);
1433 memset_extent_buffer(c, 0, 0, sizeof(struct btrfs_header));
1434 btrfs_set_header_nritems(c, 1);
1435 btrfs_set_header_level(c, level);
1436 btrfs_set_header_bytenr(c, c->start);
1437 btrfs_set_header_generation(c, trans->transid);
1438 btrfs_set_header_backref_rev(c, BTRFS_MIXED_BACKREF_REV);
1439 btrfs_set_header_owner(c, root->root_key.objectid);
1441 write_extent_buffer(c, root->fs_info->fsid,
1442 btrfs_header_fsid(), BTRFS_FSID_SIZE);
1444 write_extent_buffer(c, root->fs_info->chunk_tree_uuid,
1445 btrfs_header_chunk_tree_uuid(c),
1448 btrfs_set_node_key(c, &lower_key, 0);
1449 btrfs_set_node_blockptr(c, 0, lower->start);
1450 lower_gen = btrfs_header_generation(lower);
1451 WARN_ON(lower_gen != trans->transid);
1453 btrfs_set_node_ptr_generation(c, 0, lower_gen);
1455 btrfs_mark_buffer_dirty(c);
1460 /* the super has an extra ref to root->node */
1461 free_extent_buffer(old);
1463 add_root_to_dirty_list(root);
1464 extent_buffer_get(c);
1465 path->nodes[level] = c;
1466 path->slots[level] = 0;
1471 * worker function to insert a single pointer in a node.
1472 * the node should have enough room for the pointer already
1474 * slot and level indicate where you want the key to go, and
1475 * blocknr is the block the key points to.
1477 * returns zero on success and < 0 on any error
1479 static int insert_ptr(struct btrfs_trans_handle *trans, struct btrfs_root
1480 *root, struct btrfs_path *path, struct btrfs_disk_key
1481 *key, u64 bytenr, int slot, int level)
1483 struct extent_buffer *lower;
1486 BUG_ON(!path->nodes[level]);
1487 lower = path->nodes[level];
1488 nritems = btrfs_header_nritems(lower);
1491 if (nritems == BTRFS_NODEPTRS_PER_BLOCK(root))
1493 if (slot < nritems) {
1494 /* shift the items */
1495 memmove_extent_buffer(lower,
1496 btrfs_node_key_ptr_offset(slot + 1),
1497 btrfs_node_key_ptr_offset(slot),
1498 (nritems - slot) * sizeof(struct btrfs_key_ptr));
1500 btrfs_set_node_key(lower, key, slot);
1501 btrfs_set_node_blockptr(lower, slot, bytenr);
1502 WARN_ON(trans->transid == 0);
1503 btrfs_set_node_ptr_generation(lower, slot, trans->transid);
1504 btrfs_set_header_nritems(lower, nritems + 1);
1505 btrfs_mark_buffer_dirty(lower);
1510 * split the node at the specified level in path in two.
1511 * The path is corrected to point to the appropriate node after the split
1513 * Before splitting this tries to make some room in the node by pushing
1514 * left and right, if either one works, it returns right away.
1516 * returns 0 on success and < 0 on failure
1518 static int split_node(struct btrfs_trans_handle *trans, struct btrfs_root
1519 *root, struct btrfs_path *path, int level)
1521 struct extent_buffer *c;
1522 struct extent_buffer *split;
1523 struct btrfs_disk_key disk_key;
1529 c = path->nodes[level];
1530 WARN_ON(btrfs_header_generation(c) != trans->transid);
1531 if (c == root->node) {
1532 /* trying to split the root, lets make a new one */
1533 ret = insert_new_root(trans, root, path, level + 1);
1537 ret = push_nodes_for_insert(trans, root, path, level);
1538 c = path->nodes[level];
1539 if (!ret && btrfs_header_nritems(c) <
1540 BTRFS_NODEPTRS_PER_BLOCK(root) - 3)
1546 c_nritems = btrfs_header_nritems(c);
1547 mid = (c_nritems + 1) / 2;
1548 btrfs_node_key(c, &disk_key, mid);
1550 split = btrfs_alloc_free_block(trans, root, root->fs_info->nodesize,
1551 root->root_key.objectid,
1552 &disk_key, level, c->start, 0);
1554 return PTR_ERR(split);
1556 memset_extent_buffer(split, 0, 0, sizeof(struct btrfs_header));
1557 btrfs_set_header_level(split, btrfs_header_level(c));
1558 btrfs_set_header_bytenr(split, split->start);
1559 btrfs_set_header_generation(split, trans->transid);
1560 btrfs_set_header_backref_rev(split, BTRFS_MIXED_BACKREF_REV);
1561 btrfs_set_header_owner(split, root->root_key.objectid);
1562 write_extent_buffer(split, root->fs_info->fsid,
1563 btrfs_header_fsid(), BTRFS_FSID_SIZE);
1564 write_extent_buffer(split, root->fs_info->chunk_tree_uuid,
1565 btrfs_header_chunk_tree_uuid(split),
1569 copy_extent_buffer(split, c,
1570 btrfs_node_key_ptr_offset(0),
1571 btrfs_node_key_ptr_offset(mid),
1572 (c_nritems - mid) * sizeof(struct btrfs_key_ptr));
1573 btrfs_set_header_nritems(split, c_nritems - mid);
1574 btrfs_set_header_nritems(c, mid);
1577 btrfs_mark_buffer_dirty(c);
1578 btrfs_mark_buffer_dirty(split);
1580 wret = insert_ptr(trans, root, path, &disk_key, split->start,
1581 path->slots[level + 1] + 1,
1586 if (path->slots[level] >= mid) {
1587 path->slots[level] -= mid;
1588 free_extent_buffer(c);
1589 path->nodes[level] = split;
1590 path->slots[level + 1] += 1;
1592 free_extent_buffer(split);
1598 * how many bytes are required to store the items in a leaf. start
1599 * and nr indicate which items in the leaf to check. This totals up the
1600 * space used both by the item structs and the item data
1602 static int leaf_space_used(struct extent_buffer *l, int start, int nr)
1605 int nritems = btrfs_header_nritems(l);
1606 int end = min(nritems, start + nr) - 1;
1610 data_len = btrfs_item_end_nr(l, start);
1611 data_len = data_len - btrfs_item_offset_nr(l, end);
1612 data_len += sizeof(struct btrfs_item) * nr;
1613 WARN_ON(data_len < 0);
1618 * The space between the end of the leaf items and
1619 * the start of the leaf data. IOW, how much room
1620 * the leaf has left for both items and data
1622 int btrfs_leaf_free_space(struct btrfs_root *root, struct extent_buffer *leaf)
1624 u32 nodesize = (root ? BTRFS_LEAF_DATA_SIZE(root) : leaf->len);
1625 int nritems = btrfs_header_nritems(leaf);
1627 ret = nodesize - leaf_space_used(leaf, 0, nritems);
1629 printk("leaf free space ret %d, leaf data size %u, used %d nritems %d\n",
1630 ret, nodesize, leaf_space_used(leaf, 0, nritems),
1637 * push some data in the path leaf to the right, trying to free up at
1638 * least data_size bytes. returns zero if the push worked, nonzero otherwise
1640 * returns 1 if the push failed because the other node didn't have enough
1641 * room, 0 if everything worked out and < 0 if there were major errors.
1643 static int push_leaf_right(struct btrfs_trans_handle *trans, struct btrfs_root
1644 *root, struct btrfs_path *path, int data_size,
1647 struct extent_buffer *left = path->nodes[0];
1648 struct extent_buffer *right;
1649 struct extent_buffer *upper;
1650 struct btrfs_disk_key disk_key;
1651 struct btrfs_fs_info *fs_info = root->fs_info;
1657 struct btrfs_item *item;
1665 slot = path->slots[1];
1666 if (!path->nodes[1]) {
1669 upper = path->nodes[1];
1670 if (slot >= btrfs_header_nritems(upper) - 1)
1673 right = read_node_slot(fs_info, upper, slot + 1);
1674 if (!extent_buffer_uptodate(right)) {
1676 return PTR_ERR(right);
1679 free_space = btrfs_leaf_free_space(root, right);
1680 if (free_space < data_size) {
1681 free_extent_buffer(right);
1685 /* cow and double check */
1686 ret = btrfs_cow_block(trans, root, right, upper,
1689 free_extent_buffer(right);
1692 free_space = btrfs_leaf_free_space(root, right);
1693 if (free_space < data_size) {
1694 free_extent_buffer(right);
1698 left_nritems = btrfs_header_nritems(left);
1699 if (left_nritems == 0) {
1700 free_extent_buffer(right);
1709 i = left_nritems - 1;
1711 item = btrfs_item_nr(i);
1713 if (path->slots[0] == i)
1714 push_space += data_size + sizeof(*item);
1716 this_item_size = btrfs_item_size(left, item);
1717 if (this_item_size + sizeof(*item) + push_space > free_space)
1720 push_space += this_item_size + sizeof(*item);
1726 if (push_items == 0) {
1727 free_extent_buffer(right);
1731 if (!empty && push_items == left_nritems)
1734 /* push left to right */
1735 right_nritems = btrfs_header_nritems(right);
1737 push_space = btrfs_item_end_nr(left, left_nritems - push_items);
1738 push_space -= leaf_data_end(root, left);
1740 /* make room in the right data area */
1741 data_end = leaf_data_end(root, right);
1742 memmove_extent_buffer(right,
1743 btrfs_leaf_data(right) + data_end - push_space,
1744 btrfs_leaf_data(right) + data_end,
1745 BTRFS_LEAF_DATA_SIZE(root) - data_end);
1747 /* copy from the left data area */
1748 copy_extent_buffer(right, left, btrfs_leaf_data(right) +
1749 BTRFS_LEAF_DATA_SIZE(root) - push_space,
1750 btrfs_leaf_data(left) + leaf_data_end(root, left),
1753 memmove_extent_buffer(right, btrfs_item_nr_offset(push_items),
1754 btrfs_item_nr_offset(0),
1755 right_nritems * sizeof(struct btrfs_item));
1757 /* copy the items from left to right */
1758 copy_extent_buffer(right, left, btrfs_item_nr_offset(0),
1759 btrfs_item_nr_offset(left_nritems - push_items),
1760 push_items * sizeof(struct btrfs_item));
1762 /* update the item pointers */
1763 right_nritems += push_items;
1764 btrfs_set_header_nritems(right, right_nritems);
1765 push_space = BTRFS_LEAF_DATA_SIZE(root);
1766 for (i = 0; i < right_nritems; i++) {
1767 item = btrfs_item_nr(i);
1768 push_space -= btrfs_item_size(right, item);
1769 btrfs_set_item_offset(right, item, push_space);
1772 left_nritems -= push_items;
1773 btrfs_set_header_nritems(left, left_nritems);
1776 btrfs_mark_buffer_dirty(left);
1777 btrfs_mark_buffer_dirty(right);
1779 btrfs_item_key(right, &disk_key, 0);
1780 btrfs_set_node_key(upper, &disk_key, slot + 1);
1781 btrfs_mark_buffer_dirty(upper);
1783 /* then fixup the leaf pointer in the path */
1784 if (path->slots[0] >= left_nritems) {
1785 path->slots[0] -= left_nritems;
1786 free_extent_buffer(path->nodes[0]);
1787 path->nodes[0] = right;
1788 path->slots[1] += 1;
1790 free_extent_buffer(right);
1795 * push some data in the path leaf to the left, trying to free up at
1796 * least data_size bytes. returns zero if the push worked, nonzero otherwise
1798 static int push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_root
1799 *root, struct btrfs_path *path, int data_size,
1802 struct btrfs_disk_key disk_key;
1803 struct extent_buffer *right = path->nodes[0];
1804 struct extent_buffer *left;
1805 struct btrfs_fs_info *fs_info = root->fs_info;
1811 struct btrfs_item *item;
1812 u32 old_left_nritems;
1817 u32 old_left_item_size;
1819 slot = path->slots[1];
1822 if (!path->nodes[1])
1825 right_nritems = btrfs_header_nritems(right);
1826 if (right_nritems == 0) {
1830 left = read_node_slot(fs_info, path->nodes[1], slot - 1);
1831 free_space = btrfs_leaf_free_space(root, left);
1832 if (free_space < data_size) {
1833 free_extent_buffer(left);
1837 /* cow and double check */
1838 ret = btrfs_cow_block(trans, root, left,
1839 path->nodes[1], slot - 1, &left);
1841 /* we hit -ENOSPC, but it isn't fatal here */
1842 free_extent_buffer(left);
1846 free_space = btrfs_leaf_free_space(root, left);
1847 if (free_space < data_size) {
1848 free_extent_buffer(left);
1855 nr = right_nritems - 1;
1857 for (i = 0; i < nr; i++) {
1858 item = btrfs_item_nr(i);
1860 if (path->slots[0] == i)
1861 push_space += data_size + sizeof(*item);
1863 this_item_size = btrfs_item_size(right, item);
1864 if (this_item_size + sizeof(*item) + push_space > free_space)
1868 push_space += this_item_size + sizeof(*item);
1871 if (push_items == 0) {
1872 free_extent_buffer(left);
1875 if (!empty && push_items == btrfs_header_nritems(right))
1878 /* push data from right to left */
1879 copy_extent_buffer(left, right,
1880 btrfs_item_nr_offset(btrfs_header_nritems(left)),
1881 btrfs_item_nr_offset(0),
1882 push_items * sizeof(struct btrfs_item));
1884 push_space = BTRFS_LEAF_DATA_SIZE(root) -
1885 btrfs_item_offset_nr(right, push_items -1);
1887 copy_extent_buffer(left, right, btrfs_leaf_data(left) +
1888 leaf_data_end(root, left) - push_space,
1889 btrfs_leaf_data(right) +
1890 btrfs_item_offset_nr(right, push_items - 1),
1892 old_left_nritems = btrfs_header_nritems(left);
1893 BUG_ON(old_left_nritems == 0);
1895 old_left_item_size = btrfs_item_offset_nr(left, old_left_nritems - 1);
1896 for (i = old_left_nritems; i < old_left_nritems + push_items; i++) {
1899 item = btrfs_item_nr(i);
1900 ioff = btrfs_item_offset(left, item);
1901 btrfs_set_item_offset(left, item,
1902 ioff - (BTRFS_LEAF_DATA_SIZE(root) - old_left_item_size));
1904 btrfs_set_header_nritems(left, old_left_nritems + push_items);
1906 /* fixup right node */
1907 if (push_items > right_nritems) {
1908 printk("push items %d nr %u\n", push_items, right_nritems);
1912 if (push_items < right_nritems) {
1913 push_space = btrfs_item_offset_nr(right, push_items - 1) -
1914 leaf_data_end(root, right);
1915 memmove_extent_buffer(right, btrfs_leaf_data(right) +
1916 BTRFS_LEAF_DATA_SIZE(root) - push_space,
1917 btrfs_leaf_data(right) +
1918 leaf_data_end(root, right), push_space);
1920 memmove_extent_buffer(right, btrfs_item_nr_offset(0),
1921 btrfs_item_nr_offset(push_items),
1922 (btrfs_header_nritems(right) - push_items) *
1923 sizeof(struct btrfs_item));
1925 right_nritems -= push_items;
1926 btrfs_set_header_nritems(right, right_nritems);
1927 push_space = BTRFS_LEAF_DATA_SIZE(root);
1928 for (i = 0; i < right_nritems; i++) {
1929 item = btrfs_item_nr(i);
1930 push_space = push_space - btrfs_item_size(right, item);
1931 btrfs_set_item_offset(right, item, push_space);
1934 btrfs_mark_buffer_dirty(left);
1936 btrfs_mark_buffer_dirty(right);
1938 btrfs_item_key(right, &disk_key, 0);
1939 btrfs_fixup_low_keys(root, path, &disk_key, 1);
1941 /* then fixup the leaf pointer in the path */
1942 if (path->slots[0] < push_items) {
1943 path->slots[0] += old_left_nritems;
1944 free_extent_buffer(path->nodes[0]);
1945 path->nodes[0] = left;
1946 path->slots[1] -= 1;
1948 free_extent_buffer(left);
1949 path->slots[0] -= push_items;
1951 BUG_ON(path->slots[0] < 0);
1956 * split the path's leaf in two, making sure there is at least data_size
1957 * available for the resulting leaf level of the path.
1959 * returns 0 if all went well and < 0 on failure.
1961 static noinline int copy_for_split(struct btrfs_trans_handle *trans,
1962 struct btrfs_root *root,
1963 struct btrfs_path *path,
1964 struct extent_buffer *l,
1965 struct extent_buffer *right,
1966 int slot, int mid, int nritems)
1973 struct btrfs_disk_key disk_key;
1975 nritems = nritems - mid;
1976 btrfs_set_header_nritems(right, nritems);
1977 data_copy_size = btrfs_item_end_nr(l, mid) - leaf_data_end(root, l);
1979 copy_extent_buffer(right, l, btrfs_item_nr_offset(0),
1980 btrfs_item_nr_offset(mid),
1981 nritems * sizeof(struct btrfs_item));
1983 copy_extent_buffer(right, l,
1984 btrfs_leaf_data(right) + BTRFS_LEAF_DATA_SIZE(root) -
1985 data_copy_size, btrfs_leaf_data(l) +
1986 leaf_data_end(root, l), data_copy_size);
1988 rt_data_off = BTRFS_LEAF_DATA_SIZE(root) -
1989 btrfs_item_end_nr(l, mid);
1991 for (i = 0; i < nritems; i++) {
1992 struct btrfs_item *item = btrfs_item_nr(i);
1993 u32 ioff = btrfs_item_offset(right, item);
1994 btrfs_set_item_offset(right, item, ioff + rt_data_off);
1997 btrfs_set_header_nritems(l, mid);
1999 btrfs_item_key(right, &disk_key, 0);
2000 wret = insert_ptr(trans, root, path, &disk_key, right->start,
2001 path->slots[1] + 1, 1);
2005 btrfs_mark_buffer_dirty(right);
2006 btrfs_mark_buffer_dirty(l);
2007 BUG_ON(path->slots[0] != slot);
2010 free_extent_buffer(path->nodes[0]);
2011 path->nodes[0] = right;
2012 path->slots[0] -= mid;
2013 path->slots[1] += 1;
2015 free_extent_buffer(right);
2018 BUG_ON(path->slots[0] < 0);
2024 * split the path's leaf in two, making sure there is at least data_size
2025 * available for the resulting leaf level of the path.
2027 * returns 0 if all went well and < 0 on failure.
2029 static noinline int split_leaf(struct btrfs_trans_handle *trans,
2030 struct btrfs_root *root,
2031 struct btrfs_key *ins_key,
2032 struct btrfs_path *path, int data_size,
2035 struct btrfs_disk_key disk_key;
2036 struct extent_buffer *l;
2040 struct extent_buffer *right;
2044 int num_doubles = 0;
2047 slot = path->slots[0];
2048 if (extend && data_size + btrfs_item_size_nr(l, slot) +
2049 sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(root))
2052 /* first try to make some room by pushing left and right */
2053 if (data_size && ins_key->type != BTRFS_DIR_ITEM_KEY) {
2054 wret = push_leaf_right(trans, root, path, data_size, 0);
2058 wret = push_leaf_left(trans, root, path, data_size, 0);
2064 /* did the pushes work? */
2065 if (btrfs_leaf_free_space(root, l) >= data_size)
2069 if (!path->nodes[1]) {
2070 ret = insert_new_root(trans, root, path, 1);
2077 slot = path->slots[0];
2078 nritems = btrfs_header_nritems(l);
2079 mid = (nritems + 1) / 2;
2083 leaf_space_used(l, mid, nritems - mid) + data_size >
2084 BTRFS_LEAF_DATA_SIZE(root)) {
2085 if (slot >= nritems) {
2089 if (mid != nritems &&
2090 leaf_space_used(l, mid, nritems - mid) +
2091 data_size > BTRFS_LEAF_DATA_SIZE(root)) {
2097 if (leaf_space_used(l, 0, mid) + data_size >
2098 BTRFS_LEAF_DATA_SIZE(root)) {
2099 if (!extend && data_size && slot == 0) {
2101 } else if ((extend || !data_size) && slot == 0) {
2105 if (mid != nritems &&
2106 leaf_space_used(l, mid, nritems - mid) +
2107 data_size > BTRFS_LEAF_DATA_SIZE(root)) {
2115 btrfs_cpu_key_to_disk(&disk_key, ins_key);
2117 btrfs_item_key(l, &disk_key, mid);
2119 right = btrfs_alloc_free_block(trans, root, root->fs_info->nodesize,
2120 root->root_key.objectid,
2121 &disk_key, 0, l->start, 0);
2122 if (IS_ERR(right)) {
2124 return PTR_ERR(right);
2127 memset_extent_buffer(right, 0, 0, sizeof(struct btrfs_header));
2128 btrfs_set_header_bytenr(right, right->start);
2129 btrfs_set_header_generation(right, trans->transid);
2130 btrfs_set_header_backref_rev(right, BTRFS_MIXED_BACKREF_REV);
2131 btrfs_set_header_owner(right, root->root_key.objectid);
2132 btrfs_set_header_level(right, 0);
2133 write_extent_buffer(right, root->fs_info->fsid,
2134 btrfs_header_fsid(), BTRFS_FSID_SIZE);
2136 write_extent_buffer(right, root->fs_info->chunk_tree_uuid,
2137 btrfs_header_chunk_tree_uuid(right),
2142 btrfs_set_header_nritems(right, 0);
2143 wret = insert_ptr(trans, root, path,
2144 &disk_key, right->start,
2145 path->slots[1] + 1, 1);
2149 free_extent_buffer(path->nodes[0]);
2150 path->nodes[0] = right;
2152 path->slots[1] += 1;
2154 btrfs_set_header_nritems(right, 0);
2155 wret = insert_ptr(trans, root, path,
2161 free_extent_buffer(path->nodes[0]);
2162 path->nodes[0] = right;
2164 if (path->slots[1] == 0) {
2165 btrfs_fixup_low_keys(root, path,
2169 btrfs_mark_buffer_dirty(right);
2173 ret = copy_for_split(trans, root, path, l, right, slot, mid, nritems);
2177 BUG_ON(num_doubles != 0);
2186 * This function splits a single item into two items,
2187 * giving 'new_key' to the new item and splitting the
2188 * old one at split_offset (from the start of the item).
2190 * The path may be released by this operation. After
2191 * the split, the path is pointing to the old item. The
2192 * new item is going to be in the same node as the old one.
2194 * Note, the item being split must be smaller enough to live alone on
2195 * a tree block with room for one extra struct btrfs_item
2197 * This allows us to split the item in place, keeping a lock on the
2198 * leaf the entire time.
2200 int btrfs_split_item(struct btrfs_trans_handle *trans,
2201 struct btrfs_root *root,
2202 struct btrfs_path *path,
2203 struct btrfs_key *new_key,
2204 unsigned long split_offset)
2207 struct extent_buffer *leaf;
2208 struct btrfs_key orig_key;
2209 struct btrfs_item *item;
2210 struct btrfs_item *new_item;
2215 struct btrfs_disk_key disk_key;
2218 leaf = path->nodes[0];
2219 btrfs_item_key_to_cpu(leaf, &orig_key, path->slots[0]);
2220 if (btrfs_leaf_free_space(root, leaf) >= sizeof(struct btrfs_item))
2223 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
2224 btrfs_release_path(path);
2226 path->search_for_split = 1;
2228 ret = btrfs_search_slot(trans, root, &orig_key, path, 0, 1);
2229 path->search_for_split = 0;
2231 /* if our item isn't there or got smaller, return now */
2232 if (ret != 0 || item_size != btrfs_item_size_nr(path->nodes[0],
2237 ret = split_leaf(trans, root, &orig_key, path, 0, 0);
2240 BUG_ON(btrfs_leaf_free_space(root, leaf) < sizeof(struct btrfs_item));
2241 leaf = path->nodes[0];
2244 item = btrfs_item_nr(path->slots[0]);
2245 orig_offset = btrfs_item_offset(leaf, item);
2246 item_size = btrfs_item_size(leaf, item);
2249 buf = kmalloc(item_size, GFP_NOFS);
2251 read_extent_buffer(leaf, buf, btrfs_item_ptr_offset(leaf,
2252 path->slots[0]), item_size);
2253 slot = path->slots[0] + 1;
2254 leaf = path->nodes[0];
2256 nritems = btrfs_header_nritems(leaf);
2258 if (slot < nritems) {
2259 /* shift the items */
2260 memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + 1),
2261 btrfs_item_nr_offset(slot),
2262 (nritems - slot) * sizeof(struct btrfs_item));
2266 btrfs_cpu_key_to_disk(&disk_key, new_key);
2267 btrfs_set_item_key(leaf, &disk_key, slot);
2269 new_item = btrfs_item_nr(slot);
2271 btrfs_set_item_offset(leaf, new_item, orig_offset);
2272 btrfs_set_item_size(leaf, new_item, item_size - split_offset);
2274 btrfs_set_item_offset(leaf, item,
2275 orig_offset + item_size - split_offset);
2276 btrfs_set_item_size(leaf, item, split_offset);
2278 btrfs_set_header_nritems(leaf, nritems + 1);
2280 /* write the data for the start of the original item */
2281 write_extent_buffer(leaf, buf,
2282 btrfs_item_ptr_offset(leaf, path->slots[0]),
2285 /* write the data for the new item */
2286 write_extent_buffer(leaf, buf + split_offset,
2287 btrfs_item_ptr_offset(leaf, slot),
2288 item_size - split_offset);
2289 btrfs_mark_buffer_dirty(leaf);
2292 if (btrfs_leaf_free_space(root, leaf) < 0) {
2293 btrfs_print_leaf(root, leaf);
2300 int btrfs_truncate_item(struct btrfs_root *root, struct btrfs_path *path,
2301 u32 new_size, int from_end)
2305 struct extent_buffer *leaf;
2306 struct btrfs_item *item;
2308 unsigned int data_end;
2309 unsigned int old_data_start;
2310 unsigned int old_size;
2311 unsigned int size_diff;
2314 leaf = path->nodes[0];
2315 slot = path->slots[0];
2317 old_size = btrfs_item_size_nr(leaf, slot);
2318 if (old_size == new_size)
2321 nritems = btrfs_header_nritems(leaf);
2322 data_end = leaf_data_end(root, leaf);
2324 old_data_start = btrfs_item_offset_nr(leaf, slot);
2326 size_diff = old_size - new_size;
2329 BUG_ON(slot >= nritems);
2332 * item0..itemN ... dataN.offset..dataN.size .. data0.size
2334 /* first correct the data pointers */
2335 for (i = slot; i < nritems; i++) {
2337 item = btrfs_item_nr(i);
2338 ioff = btrfs_item_offset(leaf, item);
2339 btrfs_set_item_offset(leaf, item, ioff + size_diff);
2342 /* shift the data */
2344 memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) +
2345 data_end + size_diff, btrfs_leaf_data(leaf) +
2346 data_end, old_data_start + new_size - data_end);
2348 struct btrfs_disk_key disk_key;
2351 btrfs_item_key(leaf, &disk_key, slot);
2353 if (btrfs_disk_key_type(&disk_key) == BTRFS_EXTENT_DATA_KEY) {
2355 struct btrfs_file_extent_item *fi;
2357 fi = btrfs_item_ptr(leaf, slot,
2358 struct btrfs_file_extent_item);
2359 fi = (struct btrfs_file_extent_item *)(
2360 (unsigned long)fi - size_diff);
2362 if (btrfs_file_extent_type(leaf, fi) ==
2363 BTRFS_FILE_EXTENT_INLINE) {
2364 ptr = btrfs_item_ptr_offset(leaf, slot);
2365 memmove_extent_buffer(leaf, ptr,
2367 offsetof(struct btrfs_file_extent_item,
2372 memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) +
2373 data_end + size_diff, btrfs_leaf_data(leaf) +
2374 data_end, old_data_start - data_end);
2376 offset = btrfs_disk_key_offset(&disk_key);
2377 btrfs_set_disk_key_offset(&disk_key, offset + size_diff);
2378 btrfs_set_item_key(leaf, &disk_key, slot);
2380 btrfs_fixup_low_keys(root, path, &disk_key, 1);
2383 item = btrfs_item_nr(slot);
2384 btrfs_set_item_size(leaf, item, new_size);
2385 btrfs_mark_buffer_dirty(leaf);
2388 if (btrfs_leaf_free_space(root, leaf) < 0) {
2389 btrfs_print_leaf(root, leaf);
2395 int btrfs_extend_item(struct btrfs_root *root, struct btrfs_path *path,
2400 struct extent_buffer *leaf;
2401 struct btrfs_item *item;
2403 unsigned int data_end;
2404 unsigned int old_data;
2405 unsigned int old_size;
2408 leaf = path->nodes[0];
2410 nritems = btrfs_header_nritems(leaf);
2411 data_end = leaf_data_end(root, leaf);
2413 if (btrfs_leaf_free_space(root, leaf) < data_size) {
2414 btrfs_print_leaf(root, leaf);
2417 slot = path->slots[0];
2418 old_data = btrfs_item_end_nr(leaf, slot);
2421 if (slot >= nritems) {
2422 btrfs_print_leaf(root, leaf);
2423 printk("slot %d too large, nritems %d\n", slot, nritems);
2428 * item0..itemN ... dataN.offset..dataN.size .. data0.size
2430 /* first correct the data pointers */
2431 for (i = slot; i < nritems; i++) {
2433 item = btrfs_item_nr(i);
2434 ioff = btrfs_item_offset(leaf, item);
2435 btrfs_set_item_offset(leaf, item, ioff - data_size);
2438 /* shift the data */
2439 memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) +
2440 data_end - data_size, btrfs_leaf_data(leaf) +
2441 data_end, old_data - data_end);
2443 data_end = old_data;
2444 old_size = btrfs_item_size_nr(leaf, slot);
2445 item = btrfs_item_nr(slot);
2446 btrfs_set_item_size(leaf, item, old_size + data_size);
2447 btrfs_mark_buffer_dirty(leaf);
2450 if (btrfs_leaf_free_space(root, leaf) < 0) {
2451 btrfs_print_leaf(root, leaf);
2458 * Given a key and some data, insert an item into the tree.
2459 * This does all the path init required, making room in the tree if needed.
2461 int btrfs_insert_empty_items(struct btrfs_trans_handle *trans,
2462 struct btrfs_root *root,
2463 struct btrfs_path *path,
2464 struct btrfs_key *cpu_key, u32 *data_size,
2467 struct extent_buffer *leaf;
2468 struct btrfs_item *item;
2475 unsigned int data_end;
2476 struct btrfs_disk_key disk_key;
2478 for (i = 0; i < nr; i++) {
2479 total_data += data_size[i];
2482 /* create a root if there isn't one */
2486 total_size = total_data + nr * sizeof(struct btrfs_item);
2487 ret = btrfs_search_slot(trans, root, cpu_key, path, total_size, 1);
2494 leaf = path->nodes[0];
2496 nritems = btrfs_header_nritems(leaf);
2497 data_end = leaf_data_end(root, leaf);
2499 if (btrfs_leaf_free_space(root, leaf) < total_size) {
2500 btrfs_print_leaf(root, leaf);
2501 printk("not enough freespace need %u have %d\n",
2502 total_size, btrfs_leaf_free_space(root, leaf));
2506 slot = path->slots[0];
2509 if (slot < nritems) {
2510 unsigned int old_data = btrfs_item_end_nr(leaf, slot);
2512 if (old_data < data_end) {
2513 btrfs_print_leaf(root, leaf);
2514 printk("slot %d old_data %d data_end %d\n",
2515 slot, old_data, data_end);
2519 * item0..itemN ... dataN.offset..dataN.size .. data0.size
2521 /* first correct the data pointers */
2522 for (i = slot; i < nritems; i++) {
2525 item = btrfs_item_nr(i);
2526 ioff = btrfs_item_offset(leaf, item);
2527 btrfs_set_item_offset(leaf, item, ioff - total_data);
2530 /* shift the items */
2531 memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot + nr),
2532 btrfs_item_nr_offset(slot),
2533 (nritems - slot) * sizeof(struct btrfs_item));
2535 /* shift the data */
2536 memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) +
2537 data_end - total_data, btrfs_leaf_data(leaf) +
2538 data_end, old_data - data_end);
2539 data_end = old_data;
2542 /* setup the item for the new data */
2543 for (i = 0; i < nr; i++) {
2544 btrfs_cpu_key_to_disk(&disk_key, cpu_key + i);
2545 btrfs_set_item_key(leaf, &disk_key, slot + i);
2546 item = btrfs_item_nr(slot + i);
2547 btrfs_set_item_offset(leaf, item, data_end - data_size[i]);
2548 data_end -= data_size[i];
2549 btrfs_set_item_size(leaf, item, data_size[i]);
2551 btrfs_set_header_nritems(leaf, nritems + nr);
2552 btrfs_mark_buffer_dirty(leaf);
2556 btrfs_cpu_key_to_disk(&disk_key, cpu_key);
2557 btrfs_fixup_low_keys(root, path, &disk_key, 1);
2560 if (btrfs_leaf_free_space(root, leaf) < 0) {
2561 btrfs_print_leaf(root, leaf);
2570 * Given a key and some data, insert an item into the tree.
2571 * This does all the path init required, making room in the tree if needed.
2573 int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root
2574 *root, struct btrfs_key *cpu_key, void *data, u32
2578 struct btrfs_path *path;
2579 struct extent_buffer *leaf;
2582 path = btrfs_alloc_path();
2586 ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);
2588 leaf = path->nodes[0];
2589 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
2590 write_extent_buffer(leaf, data, ptr, data_size);
2591 btrfs_mark_buffer_dirty(leaf);
2593 btrfs_free_path(path);
2598 * delete the pointer from a given node.
2600 * If the delete empties a node, the node is removed from the tree,
2601 * continuing all the way the root if required. The root is converted into
2602 * a leaf if all the nodes are emptied.
2604 int btrfs_del_ptr(struct btrfs_root *root, struct btrfs_path *path,
2605 int level, int slot)
2607 struct extent_buffer *parent = path->nodes[level];
2611 nritems = btrfs_header_nritems(parent);
2612 if (slot < nritems - 1) {
2613 /* shift the items */
2614 memmove_extent_buffer(parent,
2615 btrfs_node_key_ptr_offset(slot),
2616 btrfs_node_key_ptr_offset(slot + 1),
2617 sizeof(struct btrfs_key_ptr) *
2618 (nritems - slot - 1));
2621 btrfs_set_header_nritems(parent, nritems);
2622 if (nritems == 0 && parent == root->node) {
2623 BUG_ON(btrfs_header_level(root->node) != 1);
2624 /* just turn the root into a leaf and break */
2625 btrfs_set_header_level(root->node, 0);
2626 } else if (slot == 0) {
2627 struct btrfs_disk_key disk_key;
2629 btrfs_node_key(parent, &disk_key, 0);
2630 btrfs_fixup_low_keys(root, path, &disk_key, level + 1);
2632 btrfs_mark_buffer_dirty(parent);
2637 * a helper function to delete the leaf pointed to by path->slots[1] and
2640 * This deletes the pointer in path->nodes[1] and frees the leaf
2641 * block extent. zero is returned if it all worked out, < 0 otherwise.
2643 * The path must have already been setup for deleting the leaf, including
2644 * all the proper balancing. path->nodes[1] must be locked.
2646 static noinline int btrfs_del_leaf(struct btrfs_trans_handle *trans,
2647 struct btrfs_root *root,
2648 struct btrfs_path *path,
2649 struct extent_buffer *leaf)
2653 WARN_ON(btrfs_header_generation(leaf) != trans->transid);
2654 ret = btrfs_del_ptr(root, path, 1, path->slots[1]);
2658 ret = btrfs_free_extent(trans, root, leaf->start, leaf->len,
2659 0, root->root_key.objectid, 0, 0);
2664 * delete the item at the leaf level in path. If that empties
2665 * the leaf, remove it from the tree
2667 int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2668 struct btrfs_path *path, int slot, int nr)
2670 struct extent_buffer *leaf;
2671 struct btrfs_item *item;
2679 leaf = path->nodes[0];
2680 last_off = btrfs_item_offset_nr(leaf, slot + nr - 1);
2682 for (i = 0; i < nr; i++)
2683 dsize += btrfs_item_size_nr(leaf, slot + i);
2685 nritems = btrfs_header_nritems(leaf);
2687 if (slot + nr != nritems) {
2688 int data_end = leaf_data_end(root, leaf);
2690 memmove_extent_buffer(leaf, btrfs_leaf_data(leaf) +
2692 btrfs_leaf_data(leaf) + data_end,
2693 last_off - data_end);
2695 for (i = slot + nr; i < nritems; i++) {
2698 item = btrfs_item_nr(i);
2699 ioff = btrfs_item_offset(leaf, item);
2700 btrfs_set_item_offset(leaf, item, ioff + dsize);
2703 memmove_extent_buffer(leaf, btrfs_item_nr_offset(slot),
2704 btrfs_item_nr_offset(slot + nr),
2705 sizeof(struct btrfs_item) *
2706 (nritems - slot - nr));
2708 btrfs_set_header_nritems(leaf, nritems - nr);
2711 /* delete the leaf if we've emptied it */
2713 if (leaf == root->node) {
2714 btrfs_set_header_level(leaf, 0);
2716 clean_tree_block(trans, root, leaf);
2717 wret = btrfs_del_leaf(trans, root, path, leaf);
2723 int used = leaf_space_used(leaf, 0, nritems);
2725 struct btrfs_disk_key disk_key;
2727 btrfs_item_key(leaf, &disk_key, 0);
2728 btrfs_fixup_low_keys(root, path, &disk_key, 1);
2731 /* delete the leaf if it is mostly empty */
2732 if (used < BTRFS_LEAF_DATA_SIZE(root) / 4) {
2733 /* push_leaf_left fixes the path.
2734 * make sure the path still points to our leaf
2735 * for possible call to del_ptr below
2737 slot = path->slots[1];
2738 extent_buffer_get(leaf);
2740 wret = push_leaf_left(trans, root, path, 1, 1);
2741 if (wret < 0 && wret != -ENOSPC)
2744 if (path->nodes[0] == leaf &&
2745 btrfs_header_nritems(leaf)) {
2746 wret = push_leaf_right(trans, root, path, 1, 1);
2747 if (wret < 0 && wret != -ENOSPC)
2751 if (btrfs_header_nritems(leaf) == 0) {
2752 clean_tree_block(trans, root, leaf);
2753 path->slots[1] = slot;
2754 ret = btrfs_del_leaf(trans, root, path, leaf);
2756 free_extent_buffer(leaf);
2759 btrfs_mark_buffer_dirty(leaf);
2760 free_extent_buffer(leaf);
2763 btrfs_mark_buffer_dirty(leaf);
2770 * walk up the tree as far as required to find the previous leaf.
2771 * returns 0 if it found something or 1 if there are no lesser leaves.
2772 * returns < 0 on io errors.
2774 int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path)
2778 struct extent_buffer *c;
2779 struct extent_buffer *next = NULL;
2780 struct btrfs_fs_info *fs_info = root->fs_info;
2782 while(level < BTRFS_MAX_LEVEL) {
2783 if (!path->nodes[level])
2786 slot = path->slots[level];
2787 c = path->nodes[level];
2790 if (level == BTRFS_MAX_LEVEL)
2796 next = read_node_slot(fs_info, c, slot);
2797 if (!extent_buffer_uptodate(next)) {
2799 return PTR_ERR(next);
2804 path->slots[level] = slot;
2807 c = path->nodes[level];
2808 free_extent_buffer(c);
2809 slot = btrfs_header_nritems(next);
2812 path->nodes[level] = next;
2813 path->slots[level] = slot;
2816 next = read_node_slot(fs_info, next, slot);
2817 if (!extent_buffer_uptodate(next)) {
2819 return PTR_ERR(next);
2827 * walk up the tree as far as required to find the next leaf.
2828 * returns 0 if it found something or 1 if there are no greater leaves.
2829 * returns < 0 on io errors.
2831 int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path)
2835 struct extent_buffer *c;
2836 struct extent_buffer *next = NULL;
2837 struct btrfs_fs_info *fs_info = root->fs_info;
2839 while(level < BTRFS_MAX_LEVEL) {
2840 if (!path->nodes[level])
2843 slot = path->slots[level] + 1;
2844 c = path->nodes[level];
2845 if (slot >= btrfs_header_nritems(c)) {
2847 if (level == BTRFS_MAX_LEVEL)
2853 reada_for_search(root, path, level, slot, 0);
2855 next = read_node_slot(fs_info, c, slot);
2856 if (!extent_buffer_uptodate(next))
2860 path->slots[level] = slot;
2863 c = path->nodes[level];
2864 free_extent_buffer(c);
2865 path->nodes[level] = next;
2866 path->slots[level] = 0;
2870 reada_for_search(root, path, level, 0, 0);
2871 next = read_node_slot(fs_info, next, 0);
2872 if (!extent_buffer_uptodate(next))
2878 int btrfs_previous_item(struct btrfs_root *root,
2879 struct btrfs_path *path, u64 min_objectid,
2882 struct btrfs_key found_key;
2883 struct extent_buffer *leaf;
2888 if (path->slots[0] == 0) {
2889 ret = btrfs_prev_leaf(root, path);
2895 leaf = path->nodes[0];
2896 nritems = btrfs_header_nritems(leaf);
2899 if (path->slots[0] == nritems)
2902 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
2903 if (found_key.objectid < min_objectid)
2905 if (found_key.type == type)
2907 if (found_key.objectid == min_objectid &&
2908 found_key.type < type)
2915 * search in extent tree to find a previous Metadata/Data extent item with
2918 * returns 0 if something is found, 1 if nothing was found and < 0 on error
2920 int btrfs_previous_extent_item(struct btrfs_root *root,
2921 struct btrfs_path *path, u64 min_objectid)
2923 struct btrfs_key found_key;
2924 struct extent_buffer *leaf;
2929 if (path->slots[0] == 0) {
2930 ret = btrfs_prev_leaf(root, path);
2936 leaf = path->nodes[0];
2937 nritems = btrfs_header_nritems(leaf);
2940 if (path->slots[0] == nritems)
2943 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
2944 if (found_key.objectid < min_objectid)
2946 if (found_key.type == BTRFS_EXTENT_ITEM_KEY ||
2947 found_key.type == BTRFS_METADATA_ITEM_KEY)
2949 if (found_key.objectid == min_objectid &&
2950 found_key.type < BTRFS_EXTENT_ITEM_KEY)
2957 * Search in extent tree to found next meta/data extent
2958 * Caller needs to check for no-hole or skinny metadata features.
2960 int btrfs_next_extent_item(struct btrfs_root *root,
2961 struct btrfs_path *path, u64 max_objectid)
2963 struct btrfs_key found_key;
2967 ret = btrfs_next_item(root, path);
2970 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
2972 if (found_key.objectid > max_objectid)
2974 if (found_key.type == BTRFS_EXTENT_ITEM_KEY ||
2975 found_key.type == BTRFS_METADATA_ITEM_KEY)