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.
21 #include "kerncompat.h"
22 #include "radix-tree.h"
26 #include "transaction.h"
28 static struct btrfs_dir_item *insert_with_overflow(struct
29 btrfs_trans_handle *trans,
30 struct btrfs_root *root,
31 struct btrfs_path *path,
32 struct btrfs_key *cpu_key,
39 struct btrfs_item *item;
40 struct btrfs_leaf *leaf;
41 ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);
43 struct btrfs_dir_item *di;
44 di = btrfs_match_dir_item_name(root, path, name, name_len);
47 ret = btrfs_extend_item(trans, root, path, data_size);
52 leaf = &path->nodes[0]->leaf;
53 item = leaf->items + path->slots[0];
54 ptr = btrfs_item_ptr(leaf, path->slots[0], char);
55 BUG_ON(data_size > btrfs_item_size(item));
56 ptr += btrfs_item_size(item) - data_size;
57 return (struct btrfs_dir_item *)ptr;
60 int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
61 *root, char *name, int name_len, u64 dir,
62 struct btrfs_key *location, u8 type)
65 struct btrfs_path path;
66 struct btrfs_dir_item *dir_item;
72 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
73 if (name_len == 1 && *name == '.')
75 else if (name_len == 2 && name[0] == '.' && name[1] == '.')
78 ret = btrfs_name_hash(name, name_len, &key.offset);
80 btrfs_init_path(&path);
81 data_size = sizeof(*dir_item) + name_len;
82 dir_item = insert_with_overflow(trans, root, &path, &key, data_size,
88 btrfs_cpu_key_to_disk(&dir_item->location, location);
89 btrfs_set_dir_type(dir_item, type);
90 btrfs_set_dir_name_len(dir_item, name_len);
91 btrfs_set_dir_data_len(dir_item, 0);
92 name_ptr = (char *)(dir_item + 1);
93 memcpy(name_ptr, name, name_len);
95 /* FIXME, use some real flag for selecting the extra index */
96 if (root == root->fs_info->tree_root)
99 btrfs_release_path(root, &path);
100 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
101 key.offset = location->objectid;
102 dir_item = insert_with_overflow(trans, root, &path, &key, data_size,
108 btrfs_cpu_key_to_disk(&dir_item->location, location);
109 btrfs_set_dir_type(dir_item, type);
110 btrfs_set_dir_name_len(dir_item, name_len);
111 btrfs_set_dir_data_len(dir_item, 0);
112 name_ptr = (char *)(dir_item + 1);
113 memcpy(name_ptr, name, name_len);
115 btrfs_release_path(root, &path);
118 struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans,
119 struct btrfs_root *root,
120 struct btrfs_path *path, u64 dir,
121 char *name, int name_len, int mod)
124 struct btrfs_key key;
125 int ins_len = mod < 0 ? -1 : 0;
127 struct btrfs_key found_key;
128 struct btrfs_leaf *leaf;
130 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
131 ret = btrfs_name_hash(name, name_len, &key.offset);
133 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
137 if (path->slots[0] == 0)
142 leaf = &path->nodes[0]->leaf;
143 btrfs_disk_key_to_cpu(&found_key, &leaf->items[path->slots[0]].key);
145 if (found_key.objectid != dir ||
146 btrfs_key_type(&found_key) != BTRFS_DIR_ITEM_KEY ||
147 found_key.offset != key.offset)
150 return btrfs_match_dir_item_name(root, path, name, name_len);
153 struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root,
154 struct btrfs_path *path,
155 const char *name, int name_len)
161 struct btrfs_leaf *leaf;
162 struct btrfs_dir_item *dir_item;
164 leaf = &path->nodes[0]->leaf;
165 dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);
166 total_len = btrfs_item_size(leaf->items + path->slots[0]);
167 while(cur < total_len) {
168 this_len = sizeof(*dir_item) + btrfs_dir_name_len(dir_item) +
169 btrfs_dir_data_len(dir_item);
170 name_ptr = (char *)(dir_item + 1);
172 if (btrfs_dir_name_len(dir_item) == name_len &&
173 memcmp(name, name_ptr, name_len) == 0)
177 dir_item = (struct btrfs_dir_item *)((char *)dir_item +
183 int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans,
184 struct btrfs_root *root,
185 struct btrfs_path *path,
186 struct btrfs_dir_item *di)
189 struct btrfs_leaf *leaf;
194 leaf = &path->nodes[0]->leaf;
195 sub_item_len = sizeof(*di) + btrfs_dir_name_len(di) +
196 btrfs_dir_data_len(di);
197 item_len = btrfs_item_size(leaf->items + path->slots[0]);
198 if (sub_item_len == item_len) {
199 ret = btrfs_del_item(trans, root, path);
201 char *ptr = (char *)di;
202 char *start = btrfs_item_ptr(leaf, path->slots[0], char);
203 memmove(ptr, ptr + sub_item_len,
204 item_len - (ptr + sub_item_len - start));
205 ret = btrfs_truncate_item(trans, root, path,
206 item_len - sub_item_len, 1);