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.
22 #include "transaction.h"
24 static struct btrfs_dir_item *insert_with_overflow(struct btrfs_trans_handle
26 struct btrfs_root *root,
27 struct btrfs_path *path,
28 struct btrfs_key *cpu_key,
35 struct btrfs_item *item;
36 struct extent_buffer *leaf;
38 ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);
40 struct btrfs_dir_item *di;
41 di = btrfs_match_dir_item_name(root, path, name, name_len);
43 return ERR_PTR(-EEXIST);
44 ret = btrfs_extend_item(trans, root, path, data_size);
50 leaf = path->nodes[0];
51 item = btrfs_item_nr(leaf, path->slots[0]);
52 ptr = btrfs_item_ptr(leaf, path->slots[0], char);
53 BUG_ON(data_size > btrfs_item_size(leaf, item));
54 ptr += btrfs_item_size(leaf, item) - data_size;
55 return (struct btrfs_dir_item *)ptr;
58 int btrfs_insert_xattr_item(struct btrfs_trans_handle *trans,
59 struct btrfs_root *root, const char *name,
60 u16 name_len, const void *data, u16 data_len,
64 struct btrfs_path *path;
65 struct btrfs_dir_item *dir_item;
66 unsigned long name_ptr, data_ptr;
67 struct btrfs_key key, location;
68 struct btrfs_disk_key disk_key;
69 struct extent_buffer *leaf;
73 btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY);
74 key.offset = btrfs_name_hash(name, name_len);
75 path = btrfs_alloc_path();
78 if (name_len + data_len + sizeof(struct btrfs_dir_item) >
79 BTRFS_LEAF_DATA_SIZE(root) - sizeof(struct btrfs_item))
82 data_size = sizeof(*dir_item) + name_len + data_len;
83 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
86 * FIXME: at some point we should handle xattr's that are larger than
87 * what we can fit in our leaf. We set location to NULL b/c we arent
88 * pointing at anything else, that will change if we store the xattr
89 * data in a separate inode.
91 BUG_ON(IS_ERR(dir_item));
92 memset(&location, 0, sizeof(location));
94 leaf = path->nodes[0];
95 btrfs_cpu_key_to_disk(&disk_key, &location);
96 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
97 btrfs_set_dir_type(leaf, dir_item, BTRFS_FT_XATTR);
98 btrfs_set_dir_name_len(leaf, dir_item, name_len);
99 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
100 btrfs_set_dir_data_len(leaf, dir_item, data_len);
101 name_ptr = (unsigned long)(dir_item + 1);
102 data_ptr = (unsigned long)((char *)name_ptr + name_len);
104 write_extent_buffer(leaf, name, name_ptr, name_len);
105 write_extent_buffer(leaf, data, data_ptr, data_len);
106 btrfs_mark_buffer_dirty(path->nodes[0]);
108 btrfs_free_path(path);
112 int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
113 *root, const char *name, int name_len, u64 dir,
114 struct btrfs_key *location, u8 type, u64 index)
118 struct btrfs_path *path;
119 struct btrfs_dir_item *dir_item;
120 struct extent_buffer *leaf;
121 unsigned long name_ptr;
122 struct btrfs_key key;
123 struct btrfs_disk_key disk_key;
127 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
128 key.offset = btrfs_name_hash(name, name_len);
129 path = btrfs_alloc_path();
130 data_size = sizeof(*dir_item) + name_len;
131 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
133 if (IS_ERR(dir_item)) {
134 ret = PTR_ERR(dir_item);
140 leaf = path->nodes[0];
141 btrfs_cpu_key_to_disk(&disk_key, location);
142 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
143 btrfs_set_dir_type(leaf, dir_item, type);
144 btrfs_set_dir_data_len(leaf, dir_item, 0);
145 btrfs_set_dir_name_len(leaf, dir_item, name_len);
146 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
147 name_ptr = (unsigned long)(dir_item + 1);
149 write_extent_buffer(leaf, name, name_ptr, name_len);
150 btrfs_mark_buffer_dirty(leaf);
153 /* FIXME, use some real flag for selecting the extra index */
154 if (root == root->fs_info->tree_root) {
158 btrfs_release_path(root, path);
160 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
162 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
164 if (IS_ERR(dir_item)) {
165 ret2 = PTR_ERR(dir_item);
168 leaf = path->nodes[0];
169 btrfs_cpu_key_to_disk(&disk_key, location);
170 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
171 btrfs_set_dir_type(leaf, dir_item, type);
172 btrfs_set_dir_data_len(leaf, dir_item, 0);
173 btrfs_set_dir_name_len(leaf, dir_item, name_len);
174 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
175 name_ptr = (unsigned long)(dir_item + 1);
176 write_extent_buffer(leaf, name, name_ptr, name_len);
177 btrfs_mark_buffer_dirty(leaf);
179 btrfs_free_path(path);
187 struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans,
188 struct btrfs_root *root,
189 struct btrfs_path *path, u64 dir,
190 const char *name, int name_len,
194 struct btrfs_key key;
195 int ins_len = mod < 0 ? -1 : 0;
197 struct btrfs_key found_key;
198 struct extent_buffer *leaf;
201 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
203 key.offset = btrfs_name_hash(name, name_len);
205 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
209 if (path->slots[0] == 0)
214 leaf = path->nodes[0];
215 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
217 if (found_key.objectid != dir ||
218 btrfs_key_type(&found_key) != BTRFS_DIR_ITEM_KEY ||
219 found_key.offset != key.offset)
222 return btrfs_match_dir_item_name(root, path, name, name_len);
225 struct btrfs_dir_item *
226 btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans,
227 struct btrfs_root *root,
228 struct btrfs_path *path, u64 dir,
229 u64 objectid, const char *name, int name_len,
233 struct btrfs_key key;
234 int ins_len = mod < 0 ? -1 : 0;
238 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
239 key.offset = objectid;
241 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
245 return ERR_PTR(-ENOENT);
246 return btrfs_match_dir_item_name(root, path, name, name_len);
249 struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans,
250 struct btrfs_root *root,
251 struct btrfs_path *path, u64 dir,
252 const char *name, u16 name_len,
256 struct btrfs_key key;
257 int ins_len = mod < 0 ? -1 : 0;
259 struct btrfs_key found_key;
260 struct extent_buffer *leaf;
263 btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY);
264 key.offset = btrfs_name_hash(name, name_len);
265 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
269 if (path->slots[0] == 0)
274 leaf = path->nodes[0];
275 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
277 if (found_key.objectid != dir ||
278 btrfs_key_type(&found_key) != BTRFS_XATTR_ITEM_KEY ||
279 found_key.offset != key.offset)
282 return btrfs_match_dir_item_name(root, path, name, name_len);
285 struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root,
286 struct btrfs_path *path,
287 const char *name, int name_len)
289 struct btrfs_dir_item *dir_item;
290 unsigned long name_ptr;
294 struct extent_buffer *leaf;
296 leaf = path->nodes[0];
297 dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);
298 total_len = btrfs_item_size_nr(leaf, path->slots[0]);
299 while(cur < total_len) {
300 this_len = sizeof(*dir_item) +
301 btrfs_dir_name_len(leaf, dir_item) +
302 btrfs_dir_data_len(leaf, dir_item);
303 name_ptr = (unsigned long)(dir_item + 1);
305 if (btrfs_dir_name_len(leaf, dir_item) == name_len &&
306 memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0)
310 dir_item = (struct btrfs_dir_item *)((char *)dir_item +
316 int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans,
317 struct btrfs_root *root,
318 struct btrfs_path *path,
319 struct btrfs_dir_item *di)
322 struct extent_buffer *leaf;
327 leaf = path->nodes[0];
328 sub_item_len = sizeof(*di) + btrfs_dir_name_len(leaf, di) +
329 btrfs_dir_data_len(leaf, di);
330 item_len = btrfs_item_size_nr(leaf, path->slots[0]);
331 if (sub_item_len == item_len) {
332 ret = btrfs_del_item(trans, root, path);
335 unsigned long ptr = (unsigned long)di;
338 start = btrfs_item_ptr_offset(leaf, path->slots[0]);
339 memmove_extent_buffer(leaf, ptr, ptr + sub_item_len,
340 item_len - (ptr + sub_item_len - start));
341 ret = btrfs_truncate_item(trans, root, path,
342 item_len - sub_item_len, 1);