inode-map.c 4.2 KB
Newer Older
1
#include <linux/module.h>
2 3 4 5
#include "ctree.h"
#include "disk-io.h"
#include "transaction.h"

C
Chris Mason 已提交
6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36
int btrfs_find_highest_inode(struct btrfs_root *fs_root, u64 *objectid)
{
	struct btrfs_path *path;
	int ret;
	struct btrfs_leaf *l;
	struct btrfs_root *root = fs_root->fs_info->inode_root;
	struct btrfs_key search_key;
	int slot;

	path = btrfs_alloc_path();
	BUG_ON(!path);

	search_key.objectid = (u64)-1;
	search_key.offset = (u64)-1;
	ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
	if (ret < 0)
		goto error;
	BUG_ON(ret == 0);
	if (path->slots[0] > 0) {
		slot = path->slots[0] - 1;
		l = btrfs_buffer_leaf(path->nodes[0]);
		*objectid = btrfs_disk_key_objectid(&l->items[slot].key);
	} else {
		*objectid = BTRFS_FIRST_FREE_OBJECTID;
	}
	ret = 0;
error:
	btrfs_free_path(path);
	return ret;
}

37 38 39 40 41 42 43
/*
 * walks the btree of allocated inodes and find a hole.
 */
int btrfs_find_free_objectid(struct btrfs_trans_handle *trans,
			     struct btrfs_root *fs_root,
			     u64 dirid, u64 *objectid)
{
C
Chris Mason 已提交
44
	struct btrfs_path *path;
45 46 47 48
	struct btrfs_key key;
	int ret;
	u64 hole_size = 0;
	int slot = 0;
C
Chris Mason 已提交
49
	u64 last_ino = 0;
50 51 52 53 54 55
	int start_found;
	struct btrfs_leaf *l;
	struct btrfs_root *root = fs_root->fs_info->inode_root;
	struct btrfs_key search_key;
	u64 search_start = dirid;

56 57 58 59
	path = btrfs_alloc_path();
	BUG_ON(!path);
	search_key.flags = 0;
	btrfs_set_key_type(&search_key, BTRFS_INODE_MAP_ITEM_KEY);
60

61
	search_start = fs_root->fs_info->last_inode_alloc;
62
	search_start = max(search_start, BTRFS_FIRST_FREE_OBJECTID);
63 64 65
	search_key.objectid = search_start;
	search_key.offset = 0;

C
Chris Mason 已提交
66
	btrfs_init_path(path);
67
	start_found = 0;
C
Chris Mason 已提交
68
	ret = btrfs_search_slot(trans, root, &search_key, path, 0, 0);
69 70 71
	if (ret < 0)
		goto error;

C
Chris Mason 已提交
72 73
	if (path->slots[0] > 0)
		path->slots[0]--;
74 75

	while (1) {
C
Chris Mason 已提交
76 77
		l = btrfs_buffer_leaf(path->nodes[0]);
		slot = path->slots[0];
78
		if (slot >= btrfs_header_nritems(&l->header)) {
C
Chris Mason 已提交
79
			ret = btrfs_next_leaf(root, path);
80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106
			if (ret == 0)
				continue;
			if (ret < 0)
				goto error;
			if (!start_found) {
				*objectid = search_start;
				start_found = 1;
				goto found;
			}
			*objectid = last_ino > search_start ?
				last_ino : search_start;
			goto found;
		}
		btrfs_disk_key_to_cpu(&key, &l->items[slot].key);
		if (key.objectid >= search_start) {
			if (start_found) {
				if (last_ino < search_start)
					last_ino = search_start;
				hole_size = key.objectid - last_ino;
				if (hole_size > 0) {
					*objectid = last_ino;
					goto found;
				}
			}
		}
		start_found = 1;
		last_ino = key.objectid + 1;
C
Chris Mason 已提交
107
		path->slots[0]++;
108 109 110 111
	}
	// FIXME -ENOSPC
found:
	root->fs_info->last_inode_alloc = *objectid;
C
Chris Mason 已提交
112 113
	btrfs_release_path(root, path);
	btrfs_free_path(path);
114 115 116
	BUG_ON(*objectid < search_start);
	return 0;
error:
C
Chris Mason 已提交
117 118
	btrfs_release_path(root, path);
	btrfs_free_path(path);
119 120 121 122 123 124 125 126
	return ret;
}

int btrfs_insert_inode_map(struct btrfs_trans_handle *trans,
			   struct btrfs_root *fs_root,
			   u64 objectid, struct btrfs_key *location)
{
	int ret = 0;
C
Chris Mason 已提交
127
	struct btrfs_path *path;
128 129 130 131 132 133 134 135
	struct btrfs_inode_map_item *inode_item;
	struct btrfs_key key;
	struct btrfs_root *inode_root = fs_root->fs_info->inode_root;

	key.objectid = objectid;
	key.flags = 0;
	btrfs_set_key_type(&key, BTRFS_INODE_MAP_ITEM_KEY);
	key.offset = 0;
C
Chris Mason 已提交
136 137 138 139
	path = btrfs_alloc_path();
	BUG_ON(!path);
	btrfs_init_path(path);
	ret = btrfs_insert_empty_item(trans, inode_root, path, &key,
140 141 142 143
				      sizeof(struct btrfs_inode_map_item));
	if (ret)
		goto out;

C
Chris Mason 已提交
144 145
	inode_item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]),
				    path->slots[0], struct btrfs_inode_map_item);
146
	btrfs_cpu_key_to_disk(&inode_item->key, location);
C
Chris Mason 已提交
147
	btrfs_mark_buffer_dirty(path->nodes[0]);
C
Chris Mason 已提交
148 149
	if (objectid > fs_root->fs_info->highest_inode)
		fs_root->fs_info->highest_inode = objectid;
150
out:
C
Chris Mason 已提交
151 152
	btrfs_release_path(inode_root, path);
	btrfs_free_path(path);
153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173
	return ret;
}

int btrfs_lookup_inode_map(struct btrfs_trans_handle *trans,
			   struct btrfs_root *fs_root, struct btrfs_path *path,
			   u64 objectid, int mod)
{
	int ret;
	struct btrfs_key key;
	int ins_len = mod < 0 ? -1 : 0;
	int cow = mod != 0;
	struct btrfs_root *inode_root = fs_root->fs_info->inode_root;

	key.objectid = objectid;
	key.flags = 0;
	key.offset = 0;
	btrfs_set_key_type(&key, BTRFS_INODE_MAP_ITEM_KEY);
	ret = btrfs_search_slot(trans, inode_root, &key, path, ins_len, cow);
	return ret;
}