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();
79 data_size = sizeof(*dir_item) + name_len + data_len;
80 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
83 * FIXME: at some point we should handle xattr's that are larger than
84 * what we can fit in our leaf. We set location to NULL b/c we arent
85 * pointing at anything else, that will change if we store the xattr
86 * data in a separate inode.
88 BUG_ON(IS_ERR(dir_item));
89 memset(&location, 0, sizeof(location));
91 leaf = path->nodes[0];
92 btrfs_cpu_key_to_disk(&disk_key, &location);
93 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
94 btrfs_set_dir_type(leaf, dir_item, BTRFS_FT_XATTR);
95 btrfs_set_dir_name_len(leaf, dir_item, name_len);
96 btrfs_set_dir_data_len(leaf, dir_item, data_len);
97 name_ptr = (unsigned long)(dir_item + 1);
98 data_ptr = (unsigned long)((char *)name_ptr + name_len);
100 write_extent_buffer(leaf, name, name_ptr, name_len);
101 write_extent_buffer(leaf, data, data_ptr, data_len);
102 btrfs_mark_buffer_dirty(path->nodes[0]);
104 btrfs_free_path(path);
108 int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
109 *root, const char *name, int name_len, u64 dir,
110 struct btrfs_key *location, u8 type, u64 index)
114 struct btrfs_path *path;
115 struct btrfs_dir_item *dir_item;
116 struct extent_buffer *leaf;
117 unsigned long name_ptr;
118 struct btrfs_key key;
119 struct btrfs_disk_key disk_key;
123 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
124 key.offset = btrfs_name_hash(name, name_len);
125 path = btrfs_alloc_path();
128 data_size = sizeof(*dir_item) + name_len;
129 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
131 if (IS_ERR(dir_item)) {
132 ret = PTR_ERR(dir_item);
136 leaf = path->nodes[0];
137 btrfs_cpu_key_to_disk(&disk_key, location);
138 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
139 btrfs_set_dir_type(leaf, dir_item, type);
140 btrfs_set_dir_data_len(leaf, dir_item, 0);
141 btrfs_set_dir_name_len(leaf, dir_item, name_len);
142 name_ptr = (unsigned long)(dir_item + 1);
144 write_extent_buffer(leaf, name, name_ptr, name_len);
145 btrfs_mark_buffer_dirty(leaf);
147 /* FIXME, use some real flag for selecting the extra index */
148 if (root == root->fs_info->tree_root) {
152 btrfs_release_path(root, path);
154 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
156 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
158 if (IS_ERR(dir_item)) {
159 ret2 = PTR_ERR(dir_item);
162 leaf = path->nodes[0];
163 btrfs_cpu_key_to_disk(&disk_key, location);
164 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
165 btrfs_set_dir_type(leaf, dir_item, type);
166 btrfs_set_dir_data_len(leaf, dir_item, 0);
167 btrfs_set_dir_name_len(leaf, dir_item, name_len);
168 name_ptr = (unsigned long)(dir_item + 1);
169 write_extent_buffer(leaf, name, name_ptr, name_len);
170 btrfs_mark_buffer_dirty(leaf);
172 btrfs_free_path(path);
180 struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans,
181 struct btrfs_root *root,
182 struct btrfs_path *path, u64 dir,
183 const char *name, int name_len,
187 struct btrfs_key key;
188 int ins_len = mod < 0 ? -1 : 0;
190 struct btrfs_key found_key;
191 struct extent_buffer *leaf;
194 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
196 key.offset = btrfs_name_hash(name, name_len);
198 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
202 if (path->slots[0] == 0)
207 leaf = path->nodes[0];
208 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
210 if (found_key.objectid != dir ||
211 btrfs_key_type(&found_key) != BTRFS_DIR_ITEM_KEY ||
212 found_key.offset != key.offset)
215 return btrfs_match_dir_item_name(root, path, name, name_len);
218 struct btrfs_dir_item *
219 btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans,
220 struct btrfs_root *root,
221 struct btrfs_path *path, u64 dir,
222 u64 objectid, const char *name, int name_len,
226 struct btrfs_key key;
227 int ins_len = mod < 0 ? -1 : 0;
231 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
232 key.offset = objectid;
234 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
238 return ERR_PTR(-ENOENT);
239 return btrfs_match_dir_item_name(root, path, name, name_len);
242 struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans,
243 struct btrfs_root *root,
244 struct btrfs_path *path, u64 dir,
245 const char *name, u16 name_len,
249 struct btrfs_key key;
250 int ins_len = mod < 0 ? -1 : 0;
252 struct btrfs_key found_key;
253 struct extent_buffer *leaf;
256 btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY);
257 key.offset = btrfs_name_hash(name, name_len);
258 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
262 if (path->slots[0] == 0)
267 leaf = path->nodes[0];
268 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
270 if (found_key.objectid != dir ||
271 btrfs_key_type(&found_key) != BTRFS_XATTR_ITEM_KEY ||
272 found_key.offset != key.offset)
275 return btrfs_match_dir_item_name(root, path, name, name_len);
278 struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root,
279 struct btrfs_path *path,
280 const char *name, int name_len)
282 struct btrfs_dir_item *dir_item;
283 unsigned long name_ptr;
287 struct extent_buffer *leaf;
289 leaf = path->nodes[0];
290 dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);
291 total_len = btrfs_item_size_nr(leaf, path->slots[0]);
292 while(cur < total_len) {
293 this_len = sizeof(*dir_item) +
294 btrfs_dir_name_len(leaf, dir_item) +
295 btrfs_dir_data_len(leaf, dir_item);
296 name_ptr = (unsigned long)(dir_item + 1);
298 if (btrfs_dir_name_len(leaf, dir_item) == name_len &&
299 memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0)
303 dir_item = (struct btrfs_dir_item *)((char *)dir_item +
309 int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans,
310 struct btrfs_root *root,
311 struct btrfs_path *path,
312 struct btrfs_dir_item *di)
315 struct extent_buffer *leaf;
320 leaf = path->nodes[0];
321 sub_item_len = sizeof(*di) + btrfs_dir_name_len(leaf, di) +
322 btrfs_dir_data_len(leaf, di);
323 item_len = btrfs_item_size_nr(leaf, path->slots[0]);
324 if (sub_item_len == item_len) {
325 ret = btrfs_del_item(trans, root, path);
328 unsigned long ptr = (unsigned long)di;
331 start = btrfs_item_ptr_offset(leaf, path->slots[0]);
332 memmove_extent_buffer(leaf, ptr, ptr + sub_item_len,
333 item_len - (ptr + sub_item_len - start));
334 ret = btrfs_truncate_item(trans, root, path,
335 item_len - sub_item_len, 1);