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/module.h>
22 #include "print-tree.h"
24 int btrfs_find_last_root(struct btrfs_root *root, u64 objectid,
25 struct btrfs_root_item *item, struct btrfs_key *key)
27 struct btrfs_path *path;
28 struct btrfs_key search_key;
33 search_key.objectid = objectid;
34 search_key.flags = (u32)-1;
35 search_key.offset = (u32)-1;
37 path = btrfs_alloc_path();
39 btrfs_init_path(path);
40 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
44 l = btrfs_buffer_leaf(path->nodes[0]);
45 BUG_ON(path->slots[0] == 0);
46 slot = path->slots[0] - 1;
47 if (btrfs_disk_key_objectid(&l->items[slot].key) != objectid) {
51 memcpy(item, btrfs_item_ptr(l, slot, struct btrfs_root_item),
53 btrfs_disk_key_to_cpu(key, &l->items[slot].key);
56 btrfs_release_path(root, path);
57 btrfs_free_path(path);
61 int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root
62 *root, struct btrfs_key *key, struct btrfs_root_item
65 struct btrfs_path *path;
69 struct btrfs_root_item *update_item;
71 path = btrfs_alloc_path();
73 btrfs_init_path(path);
74 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
78 l = btrfs_buffer_leaf(path->nodes[0]);
79 slot = path->slots[0];
80 update_item = btrfs_item_ptr(l, slot, struct btrfs_root_item);
81 btrfs_memcpy(root, l, update_item, item, sizeof(*item));
82 btrfs_mark_buffer_dirty(path->nodes[0]);
84 btrfs_release_path(root, path);
85 btrfs_free_path(path);
89 int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root
90 *root, struct btrfs_key *key, struct btrfs_root_item
94 ret = btrfs_insert_item(trans, root, key, item, sizeof(*item));
99 int btrfs_del_root(struct btrfs_trans_handle *trans, struct btrfs_root *root,
100 struct btrfs_key *key)
102 struct btrfs_path *path;
105 struct btrfs_root_item *ri;
107 path = btrfs_alloc_path();
109 btrfs_init_path(path);
110 ret = btrfs_search_slot(trans, root, key, path, -1, 1);
114 ri = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]),
115 path->slots[0], struct btrfs_root_item);
117 refs = btrfs_root_refs(ri);
120 ret = btrfs_del_item(trans, root, path);
122 btrfs_set_root_refs(ri, refs - 1);
124 mark_buffer_dirty(path->nodes[0]);
127 btrfs_release_path(root, path);
128 btrfs_free_path(path);