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>
21 #include "transaction.h"
23 #include "print-tree.h"
25 int btrfs_find_last_root(struct btrfs_root *root, u64 objectid,
26 struct btrfs_root_item *item, struct btrfs_key *key)
28 struct btrfs_path *path;
29 struct btrfs_key search_key;
34 search_key.objectid = objectid;
35 search_key.flags = (u32)-1;
36 search_key.offset = (u64)-1;
38 path = btrfs_alloc_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);
54 printk("find last finds key %Lu %u %Lu slot %d search for obj %Lu\n", key->objectid, key->flags, key->offset, slot, objectid);
57 btrfs_release_path(root, path);
58 btrfs_free_path(path);
62 int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root
63 *root, struct btrfs_key *key, struct btrfs_root_item
66 struct btrfs_path *path;
70 struct btrfs_root_item *update_item;
72 path = btrfs_alloc_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));
98 int btrfs_find_dead_roots(struct btrfs_root *root)
100 struct btrfs_root *dead_root;
101 struct btrfs_item *item;
102 struct btrfs_root_item *ri;
103 struct btrfs_key key;
104 struct btrfs_path *path;
107 struct btrfs_leaf *leaf;
112 btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
114 path = btrfs_alloc_path();
117 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
121 leaf = btrfs_buffer_leaf(path->nodes[0]);
122 nritems = btrfs_header_nritems(&leaf->header);
123 slot = path->slots[0];
124 if (slot >= nritems) {
125 ret = btrfs_next_leaf(root, path);
128 leaf = btrfs_buffer_leaf(path->nodes[0]);
129 nritems = btrfs_header_nritems(&leaf->header);
130 slot = path->slots[0];
132 item = leaf->items + slot;
133 btrfs_disk_key_to_cpu(&key, &item->key);
134 if (btrfs_key_type(&key) != BTRFS_ROOT_ITEM_KEY)
136 ri = btrfs_item_ptr(leaf, slot, struct btrfs_root_item);
137 if (btrfs_root_refs(ri) != 0)
139 dead_root = btrfs_read_fs_root_no_radix(root->fs_info, &key);
144 printk("found dead root %Lu %u %Lu\n", key.objectid, key.flags, key.offset);
145 ret = btrfs_add_dead_root(dead_root,
146 &root->fs_info->dead_roots);
155 btrfs_free_path(path);
159 int btrfs_del_root(struct btrfs_trans_handle *trans, struct btrfs_root *root,
160 struct btrfs_key *key)
162 struct btrfs_path *path;
165 struct btrfs_root_item *ri;
167 path = btrfs_alloc_path();
169 ret = btrfs_search_slot(trans, root, key, path, -1, 1);
173 ri = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]),
174 path->slots[0], struct btrfs_root_item);
176 refs = btrfs_root_refs(ri);
178 ret = btrfs_del_item(trans, root, path);
180 btrfs_release_path(root, path);
181 btrfs_free_path(path);