1 #include <linux/module.h>
4 #include "transaction.h"
7 * walks the btree of allocated inodes and find a hole.
9 int btrfs_find_free_objectid(struct btrfs_trans_handle *trans,
10 struct btrfs_root *fs_root,
11 u64 dirid, u64 *objectid)
13 struct btrfs_path *path;
21 struct btrfs_root *root = fs_root->fs_info->inode_root;
22 struct btrfs_key search_key;
23 u64 search_start = dirid;
25 path = btrfs_alloc_path();
28 btrfs_set_key_type(&search_key, BTRFS_INODE_MAP_ITEM_KEY);
30 search_start = fs_root->fs_info->last_inode_alloc;
31 if (search_start == 0) {
32 struct btrfs_disk_key *last_key;
33 btrfs_init_path(path);
34 search_key.objectid = (u64)-1;
35 search_key.offset = (u64)-1;
36 ret = btrfs_search_slot(trans, root, &search_key, path, 0, 0);
40 if (path->slots[0] > 0)
42 l = btrfs_buffer_leaf(path->nodes[0]);
43 last_key = &l->items[path->slots[0]].key;
44 search_start = btrfs_disk_key_objectid(last_key);
46 search_start = max(search_start, BTRFS_FIRST_FREE_OBJECTID);
47 search_key.objectid = search_start;
48 search_key.offset = 0;
50 btrfs_init_path(path);
52 ret = btrfs_search_slot(trans, root, &search_key, path, 0, 0);
56 if (path->slots[0] > 0)
60 l = btrfs_buffer_leaf(path->nodes[0]);
61 slot = path->slots[0];
62 if (slot >= btrfs_header_nritems(&l->header)) {
63 ret = btrfs_next_leaf(root, path);
69 *objectid = search_start;
73 *objectid = last_ino > search_start ?
74 last_ino : search_start;
77 btrfs_disk_key_to_cpu(&key, &l->items[slot].key);
78 if (key.objectid >= search_start) {
80 if (last_ino < search_start)
81 last_ino = search_start;
82 hole_size = key.objectid - last_ino;
90 last_ino = key.objectid + 1;
95 root->fs_info->last_inode_alloc = *objectid;
96 btrfs_release_path(root, path);
97 btrfs_free_path(path);
98 BUG_ON(*objectid < search_start);
101 btrfs_release_path(root, path);
102 btrfs_free_path(path);
106 int btrfs_insert_inode_map(struct btrfs_trans_handle *trans,
107 struct btrfs_root *fs_root,
108 u64 objectid, struct btrfs_key *location)
111 struct btrfs_path *path;
112 struct btrfs_inode_map_item *inode_item;
113 struct btrfs_key key;
114 struct btrfs_root *inode_root = fs_root->fs_info->inode_root;
116 key.objectid = objectid;
118 btrfs_set_key_type(&key, BTRFS_INODE_MAP_ITEM_KEY);
120 path = btrfs_alloc_path();
122 btrfs_init_path(path);
123 ret = btrfs_insert_empty_item(trans, inode_root, path, &key,
124 sizeof(struct btrfs_inode_map_item));
128 inode_item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]),
129 path->slots[0], struct btrfs_inode_map_item);
130 btrfs_cpu_key_to_disk(&inode_item->key, location);
131 btrfs_mark_buffer_dirty(path->nodes[0]);
133 btrfs_release_path(inode_root, path);
134 btrfs_free_path(path);
138 int btrfs_lookup_inode_map(struct btrfs_trans_handle *trans,
139 struct btrfs_root *fs_root, struct btrfs_path *path,
140 u64 objectid, int mod)
143 struct btrfs_key key;
144 int ins_len = mod < 0 ? -1 : 0;
146 struct btrfs_root *inode_root = fs_root->fs_info->inode_root;
148 key.objectid = objectid;
151 btrfs_set_key_type(&key, BTRFS_INODE_MAP_ITEM_KEY);
152 ret = btrfs_search_slot(trans, inode_root, &key, path, ins_len, cow);