dir-item.c 5.2 KB
Newer Older
1
#include <linux/module.h>
2 3 4
#include "ctree.h"
#include "disk-io.h"
#include "hash.h"
5
#include "transaction.h"
6

7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
int insert_with_overflow(struct btrfs_trans_handle *trans, struct btrfs_root
			    *root, struct btrfs_path *path, struct btrfs_key
			    *cpu_key, u32 data_size)
{
	int overflow;
	int ret;

	ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);
	overflow = btrfs_key_overflow(cpu_key);

	while(ret == -EEXIST && overflow < BTRFS_KEY_OVERFLOW_MAX) {
		overflow++;
		btrfs_set_key_overflow(cpu_key, overflow);
		btrfs_release_path(root, path);
		ret = btrfs_insert_empty_item(trans, root, path, cpu_key,
					      data_size);
	}
	return ret;
}

27
int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
28 29
			  *root, const char *name, int name_len, u64 dir,
			  struct btrfs_key *location, u8 type)
30 31
{
	int ret = 0;
32
	struct btrfs_path *path;
33 34 35 36 37 38 39
	struct btrfs_dir_item *dir_item;
	char *name_ptr;
	struct btrfs_key key;
	u32 data_size;

	key.objectid = dir;
	key.flags = 0;
40
	btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
C
Chris Mason 已提交
41
	ret = btrfs_name_hash(name, name_len, &key.offset);
42
	BUG_ON(ret);
43 44
	path = btrfs_alloc_path();
	btrfs_init_path(path);
45
	data_size = sizeof(*dir_item) + name_len;
46
	ret = insert_with_overflow(trans, root, path, &key, data_size);
47 48 49
	if (ret)
		goto out;

50 51
	dir_item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]),
				  path->slots[0],
52
				  struct btrfs_dir_item);
53
	btrfs_cpu_key_to_disk(&dir_item->location, location);
54 55
	btrfs_set_dir_type(dir_item, type);
	btrfs_set_dir_flags(dir_item, 0);
56
	btrfs_set_dir_name_len(dir_item, name_len);
57
	name_ptr = (char *)(dir_item + 1);
58 59 60 61
	/* FIXME, use some real flag for selecting the extra index */
	if (root == root->fs_info->tree_root)
		goto out;

62 63
	btrfs_memcpy(root, path->nodes[0]->b_data, name_ptr, name, name_len);
	btrfs_mark_buffer_dirty(path->nodes[0]);
C
Chris Mason 已提交
64 65 66
	btrfs_release_path(root, path);

	btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
67
	key.offset = location->objectid;
68
	ret = insert_with_overflow(trans, root, path, &key, data_size);
C
Chris Mason 已提交
69 70 71 72 73 74 75
	// FIXME clear the dirindex bit
	if (ret)
		goto out;

	dir_item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]),
				  path->slots[0],
				  struct btrfs_dir_item);
76
	btrfs_cpu_key_to_disk(&dir_item->location, location);
C
Chris Mason 已提交
77 78 79 80 81 82
	btrfs_set_dir_type(dir_item, type);
	btrfs_set_dir_flags(dir_item, 0);
	btrfs_set_dir_name_len(dir_item, name_len);
	name_ptr = (char *)(dir_item + 1);
	btrfs_memcpy(root, path->nodes[0]->b_data, name_ptr, name, name_len);
	btrfs_mark_buffer_dirty(path->nodes[0]);
83
out:
84 85
	btrfs_release_path(root, path);
	btrfs_free_path(path);
86 87 88
	return ret;
}

89
int btrfs_lookup_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
C
Chris Mason 已提交
90 91
			  *root, struct btrfs_path *path, u64 dir,
			  const char *name, int name_len, int mod)
92
{
93
	int ret;
94
	struct btrfs_key key;
95 96
	int ins_len = mod < 0 ? -1 : 0;
	int cow = mod != 0;
97 98
	struct btrfs_disk_key *found_key;
	struct btrfs_leaf *leaf;
C
Chris Mason 已提交
99
	u32 overflow;
100 101 102

	key.objectid = dir;
	key.flags = 0;
103
	btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
104
	btrfs_set_key_overflow(&key, BTRFS_KEY_OVERFLOW_MAX - 1);
105 106
	ret = btrfs_name_hash(name, name_len, &key.offset);
	BUG_ON(ret);
107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126
	while(1) {
		ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
		if (ret < 0)
			return ret;
		if (ret > 0) {
			if (path->slots[0] == 0)
				return 1;
			path->slots[0]--;
		}
		leaf = btrfs_buffer_leaf(path->nodes[0]);
		found_key = &leaf->items[path->slots[0]].key;

		if (btrfs_disk_key_objectid(found_key) != dir ||
		    btrfs_disk_key_type(found_key) != BTRFS_DIR_ITEM_KEY ||
		    btrfs_disk_key_offset(found_key) != key.offset)
			return 1;

		if (btrfs_match_dir_item_name(root, path, name, name_len))
			return 0;

C
Chris Mason 已提交
127 128
		overflow = btrfs_disk_key_overflow(found_key);
		if (overflow == 0)
129
			return 1;
C
Chris Mason 已提交
130
		btrfs_set_key_overflow(&key, overflow - 1);
131 132 133
		btrfs_release_path(root, path);
	}
	return 1;
134 135
}

136 137 138 139 140 141 142 143 144
int btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans,
				struct btrfs_root *root,
				struct btrfs_path *path, u64 dir,
				u64 objectid, int mod)
{
	int ret;
	struct btrfs_key key;
	int ins_len = mod < 0 ? -1 : 0;
	int cow = mod != 0;
145 146
	struct btrfs_disk_key *found_key;
	struct btrfs_leaf *leaf;
147 148 149 150

	key.objectid = dir;
	key.flags = 0;
	btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
151
	btrfs_set_key_overflow(&key, BTRFS_KEY_OVERFLOW_MAX - 1);
152 153
	key.offset = objectid;
	ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169
	if (ret < 0)
		return ret;
	if (ret > 0) {
		if (path->slots[0] == 0)
			return 1;
		path->slots[0]--;
	}
	leaf = btrfs_buffer_leaf(path->nodes[0]);
	found_key = &leaf->items[path->slots[0]].key;

	if (btrfs_disk_key_objectid(found_key) != dir ||
	    btrfs_disk_key_type(found_key) != BTRFS_DIR_INDEX_KEY)
		return 1;
	if (btrfs_disk_key_offset(found_key) == objectid)
		return 0;
	return 1;
170 171
}

172
int btrfs_match_dir_item_name(struct btrfs_root *root,
173 174
			      struct btrfs_path *path,
			      const char *name, int name_len)
175 176 177
{
	struct btrfs_dir_item *dir_item;
	char *name_ptr;
178

C
Chris Mason 已提交
179 180
	dir_item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]),
				  path->slots[0],
181
				  struct btrfs_dir_item);
182 183
	if (btrfs_dir_name_len(dir_item) != name_len)
		return 0;
184
	name_ptr = (char *)(dir_item + 1);
185
	if (memcmp(name_ptr, name, name_len))
186 187
		return 0;
	return 1;
188
}