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.
19 #include <linux/module.h>
23 #include "transaction.h"
25 static struct btrfs_dir_item *insert_with_overflow(struct btrfs_trans_handle
27 struct btrfs_root *root,
28 struct btrfs_path *path,
29 struct btrfs_key *cpu_key,
36 struct btrfs_item *item;
37 struct btrfs_leaf *leaf;
39 ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);
41 struct btrfs_dir_item *di;
42 di = btrfs_match_dir_item_name(root, path, name, name_len);
44 return ERR_PTR(-EEXIST);
45 ret = btrfs_extend_item(trans, root, path, data_size);
53 leaf = btrfs_buffer_leaf(path->nodes[0]);
54 item = leaf->items + path->slots[0];
55 ptr = btrfs_item_ptr(leaf, path->slots[0], char);
56 BUG_ON(data_size > btrfs_item_size(item));
57 ptr += btrfs_item_size(item) - data_size;
58 return (struct btrfs_dir_item *)ptr;
61 int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
62 *root, const char *name, int name_len, u64 dir,
63 struct btrfs_key *location, u8 type)
67 struct btrfs_path *path;
68 struct btrfs_dir_item *dir_item;
75 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
76 ret = btrfs_name_hash(name, name_len, &key.offset);
78 path = btrfs_alloc_path();
79 data_size = sizeof(*dir_item) + name_len;
80 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
82 if (IS_ERR(dir_item)) {
83 ret = PTR_ERR(dir_item);
89 btrfs_cpu_key_to_disk(&dir_item->location, location);
90 btrfs_set_dir_type(dir_item, type);
91 btrfs_set_dir_flags(dir_item, 0);
92 btrfs_set_dir_name_len(dir_item, name_len);
93 name_ptr = (char *)(dir_item + 1);
95 btrfs_memcpy(root, path->nodes[0]->b_data, name_ptr, name, name_len);
96 btrfs_mark_buffer_dirty(path->nodes[0]);
99 /* FIXME, use some real flag for selecting the extra index */
100 if (root == root->fs_info->tree_root) {
104 btrfs_release_path(root, path);
106 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
107 key.offset = location->objectid;
108 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
110 if (IS_ERR(dir_item)) {
111 ret2 = PTR_ERR(dir_item);
114 btrfs_cpu_key_to_disk(&dir_item->location, location);
115 btrfs_set_dir_type(dir_item, type);
116 btrfs_set_dir_flags(dir_item, 0);
117 btrfs_set_dir_name_len(dir_item, name_len);
118 name_ptr = (char *)(dir_item + 1);
119 btrfs_memcpy(root, path->nodes[0]->b_data, name_ptr, name, name_len);
120 btrfs_mark_buffer_dirty(path->nodes[0]);
122 btrfs_free_path(path);
130 struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans,
131 struct btrfs_root *root,
132 struct btrfs_path *path, u64 dir,
133 const char *name, int name_len,
137 struct btrfs_key key;
138 int ins_len = mod < 0 ? -1 : 0;
140 struct btrfs_disk_key *found_key;
141 struct btrfs_leaf *leaf;
145 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
146 ret = btrfs_name_hash(name, name_len, &key.offset);
148 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
152 if (path->slots[0] == 0)
156 leaf = btrfs_buffer_leaf(path->nodes[0]);
157 found_key = &leaf->items[path->slots[0]].key;
159 if (btrfs_disk_key_objectid(found_key) != dir ||
160 btrfs_disk_key_type(found_key) != BTRFS_DIR_ITEM_KEY ||
161 btrfs_disk_key_offset(found_key) != key.offset)
164 return btrfs_match_dir_item_name(root, path, name, name_len);
167 struct btrfs_dir_item *
168 btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans,
169 struct btrfs_root *root,
170 struct btrfs_path *path, u64 dir,
171 u64 objectid, const char *name, int name_len,
175 struct btrfs_key key;
176 int ins_len = mod < 0 ? -1 : 0;
181 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
182 key.offset = objectid;
184 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
188 return ERR_PTR(-ENOENT);
189 return btrfs_match_dir_item_name(root, path, name, name_len);
192 struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root,
193 struct btrfs_path *path,
194 const char *name, int name_len)
196 struct btrfs_dir_item *dir_item;
201 struct btrfs_leaf *leaf;
203 leaf = btrfs_buffer_leaf(path->nodes[0]);
204 dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);
205 total_len = btrfs_item_size(leaf->items + path->slots[0]);
206 while(cur < total_len) {
207 this_len = sizeof(*dir_item) + btrfs_dir_name_len(dir_item);
208 name_ptr = (char *)(dir_item + 1);
210 if (btrfs_dir_name_len(dir_item) == name_len &&
211 memcmp(name_ptr, name, name_len) == 0)
215 dir_item = (struct btrfs_dir_item *)((char *)dir_item +
221 int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans,
222 struct btrfs_root *root,
223 struct btrfs_path *path,
224 struct btrfs_dir_item *di)
227 struct btrfs_leaf *leaf;
232 leaf = btrfs_buffer_leaf(path->nodes[0]);
233 sub_item_len = sizeof(*di) + btrfs_dir_name_len(di);
234 item_len = btrfs_item_size(leaf->items + path->slots[0]);
235 if (sub_item_len == btrfs_item_size(leaf->items + path->slots[0])) {
236 ret = btrfs_del_item(trans, root, path);
238 char *ptr = (char *)di;
239 char *start = btrfs_item_ptr(leaf, path->slots[0], char);
240 btrfs_memmove(root, leaf, ptr, ptr + sub_item_len,
241 item_len - (ptr + sub_item_len - start));
242 ret = btrfs_truncate_item(trans, root, path,
243 item_len - sub_item_len);