inode-map.c 2.5 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
int btrfs_find_highest_inode(struct btrfs_root *root, u64 *objectid)
C
Chris Mason 已提交
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
{
	struct btrfs_path *path;
	int ret;
	struct btrfs_leaf *l;
	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;
}

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

54 55 56
	path = btrfs_alloc_path();
	BUG_ON(!path);
	search_key.flags = 0;
C
Chris Mason 已提交
57
	search_start = root->last_inode_alloc;
58
	search_start = max(search_start, BTRFS_FIRST_FREE_OBJECTID);
59 60 61
	search_key.objectid = search_start;
	search_key.offset = 0;

C
Chris Mason 已提交
62
	btrfs_init_path(path);
63
	start_found = 0;
C
Chris Mason 已提交
64
	ret = btrfs_search_slot(trans, root, &search_key, path, 0, 0);
65 66 67
	if (ret < 0)
		goto error;

C
Chris Mason 已提交
68 69
	if (path->slots[0] > 0)
		path->slots[0]--;
70 71

	while (1) {
C
Chris Mason 已提交
72 73
		l = btrfs_buffer_leaf(path->nodes[0]);
		slot = path->slots[0];
74
		if (slot >= btrfs_header_nritems(&l->header)) {
C
Chris Mason 已提交
75
			ret = btrfs_next_leaf(root, path);
76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102
			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 已提交
103
		path->slots[0]++;
104 105 106
	}
	// FIXME -ENOSPC
found:
C
Chris Mason 已提交
107
	root->last_inode_alloc = *objectid;
C
Chris Mason 已提交
108 109
	btrfs_release_path(root, path);
	btrfs_free_path(path);
110 111 112
	BUG_ON(*objectid < search_start);
	return 0;
error:
C
Chris Mason 已提交
113 114
	btrfs_release_path(root, path);
	btrfs_free_path(path);
115 116
	return ret;
}