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"
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 = (u64)-1;
37 path = btrfs_alloc_path();
39 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
43 l = btrfs_buffer_leaf(path->nodes[0]);
44 BUG_ON(path->slots[0] == 0);
45 slot = path->slots[0] - 1;
46 if (btrfs_disk_key_objectid(&l->items[slot].key) != objectid) {
50 memcpy(item, btrfs_item_ptr(l, slot, struct btrfs_root_item),
52 btrfs_disk_key_to_cpu(key, &l->items[slot].key);
55 btrfs_release_path(root, path);
56 btrfs_free_path(path);
60 int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root
61 *root, struct btrfs_key *key, struct btrfs_root_item
64 struct btrfs_path *path;
68 struct btrfs_root_item *update_item;
70 path = btrfs_alloc_path();
72 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
76 l = btrfs_buffer_leaf(path->nodes[0]);
77 slot = path->slots[0];
78 update_item = btrfs_item_ptr(l, slot, struct btrfs_root_item);
79 btrfs_memcpy(root, l, update_item, item, sizeof(*item));
80 btrfs_mark_buffer_dirty(path->nodes[0]);
82 btrfs_release_path(root, path);
83 btrfs_free_path(path);
87 int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root
88 *root, struct btrfs_key *key, struct btrfs_root_item
92 ret = btrfs_insert_item(trans, root, key, item, sizeof(*item));
96 int btrfs_find_dead_roots(struct btrfs_root *root)
98 struct btrfs_root *dead_root;
99 struct btrfs_item *item;
100 struct btrfs_root_item *ri;
101 struct btrfs_key key;
102 struct btrfs_path *path;
105 struct btrfs_leaf *leaf;
110 btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
112 path = btrfs_alloc_path();
115 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
119 leaf = btrfs_buffer_leaf(path->nodes[0]);
120 nritems = btrfs_header_nritems(&leaf->header);
121 slot = path->slots[0];
122 if (slot >= nritems) {
123 ret = btrfs_next_leaf(root, path);
126 leaf = btrfs_buffer_leaf(path->nodes[0]);
127 nritems = btrfs_header_nritems(&leaf->header);
128 slot = path->slots[0];
130 item = leaf->items + slot;
131 btrfs_disk_key_to_cpu(&key, &item->key);
132 if (btrfs_key_type(&key) != BTRFS_ROOT_ITEM_KEY)
134 ri = btrfs_item_ptr(leaf, slot, struct btrfs_root_item);
135 if (btrfs_root_refs(ri) != 0)
137 dead_root = btrfs_read_fs_root_no_radix(root->fs_info, &key);
142 ret = btrfs_add_dead_root(dead_root,
143 &root->fs_info->dead_roots);
152 btrfs_free_path(path);
156 int btrfs_del_root(struct btrfs_trans_handle *trans, struct btrfs_root *root,
157 struct btrfs_key *key)
159 struct btrfs_path *path;
162 struct btrfs_root_item *ri;
164 path = btrfs_alloc_path();
166 ret = btrfs_search_slot(trans, root, key, path, -1, 1);
170 ri = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]),
171 path->slots[0], struct btrfs_root_item);
173 refs = btrfs_root_refs(ri);
175 ret = btrfs_del_item(trans, root, path);
177 btrfs_release_path(root, path);
178 btrfs_free_path(path);