Commit | Line | Data |
---|---|---|
6cbd5570 CM |
1 | /* |
2 | * Copyright (C) 2007 Oracle. All rights reserved. | |
3 | * | |
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. | |
7 | * | |
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. | |
12 | * | |
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. | |
17 | */ | |
18 | ||
2e635a27 | 19 | #include <linux/module.h> |
62e2749e CM |
20 | #include "ctree.h" |
21 | #include "disk-io.h" | |
22 | #include "hash.h" | |
e089f05c | 23 | #include "transaction.h" |
62e2749e | 24 | |
35b7e476 CM |
25 | static struct btrfs_dir_item *insert_with_overflow(struct btrfs_trans_handle |
26 | *trans, | |
27 | struct btrfs_root *root, | |
28 | struct btrfs_path *path, | |
29 | struct btrfs_key *cpu_key, | |
e06afa83 CM |
30 | u32 data_size, |
31 | const char *name, | |
32 | int name_len) | |
7fcde0e3 | 33 | { |
7fcde0e3 | 34 | int ret; |
7e38180e CM |
35 | char *ptr; |
36 | struct btrfs_item *item; | |
37 | struct btrfs_leaf *leaf; | |
7fcde0e3 CM |
38 | |
39 | ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size); | |
7e38180e | 40 | if (ret == -EEXIST) { |
e06afa83 CM |
41 | struct btrfs_dir_item *di; |
42 | di = btrfs_match_dir_item_name(root, path, name, name_len); | |
43 | if (di) | |
44 | return ERR_PTR(-EEXIST); | |
7e38180e CM |
45 | ret = btrfs_extend_item(trans, root, path, data_size); |
46 | WARN_ON(ret > 0); | |
47 | if (ret) | |
48 | return ERR_PTR(ret); | |
7fcde0e3 | 49 | } |
54aa1f4d CM |
50 | if (ret < 0) |
51 | return ERR_PTR(ret); | |
7e38180e CM |
52 | WARN_ON(ret > 0); |
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; | |
7fcde0e3 CM |
59 | } |
60 | ||
e089f05c | 61 | int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root |
d6e4a428 CM |
62 | *root, const char *name, int name_len, u64 dir, |
63 | struct btrfs_key *location, u8 type) | |
62e2749e CM |
64 | { |
65 | int ret = 0; | |
e06afa83 | 66 | int ret2 = 0; |
5caf2a00 | 67 | struct btrfs_path *path; |
62e2749e CM |
68 | struct btrfs_dir_item *dir_item; |
69 | char *name_ptr; | |
70 | struct btrfs_key key; | |
71 | u32 data_size; | |
72 | ||
73 | key.objectid = dir; | |
74 | key.flags = 0; | |
1d4f6404 | 75 | btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY); |
e20d96d6 | 76 | ret = btrfs_name_hash(name, name_len, &key.offset); |
62e2749e | 77 | BUG_ON(ret); |
5caf2a00 | 78 | path = btrfs_alloc_path(); |
62e2749e | 79 | data_size = sizeof(*dir_item) + name_len; |
e06afa83 CM |
80 | dir_item = insert_with_overflow(trans, root, path, &key, data_size, |
81 | name, name_len); | |
7e38180e CM |
82 | if (IS_ERR(dir_item)) { |
83 | ret = PTR_ERR(dir_item); | |
e06afa83 CM |
84 | if (ret == -EEXIST) |
85 | goto second_insert; | |
62e2749e | 86 | goto out; |
7e38180e | 87 | } |
62e2749e | 88 | |
d6e4a428 | 89 | btrfs_cpu_key_to_disk(&dir_item->location, location); |
62e2749e CM |
90 | btrfs_set_dir_type(dir_item, type); |
91 | btrfs_set_dir_flags(dir_item, 0); | |
a8a2ee0c | 92 | btrfs_set_dir_name_len(dir_item, name_len); |
62e2749e | 93 | name_ptr = (char *)(dir_item + 1); |
c5739bba CM |
94 | |
95 | btrfs_memcpy(root, path->nodes[0]->b_data, name_ptr, name, name_len); | |
96 | btrfs_mark_buffer_dirty(path->nodes[0]); | |
7e38180e | 97 | |
e06afa83 | 98 | second_insert: |
7e38180e CM |
99 | /* FIXME, use some real flag for selecting the extra index */ |
100 | if (root == root->fs_info->tree_root) { | |
101 | ret = 0; | |
102 | goto out; | |
103 | } | |
5caf2a00 | 104 | btrfs_release_path(root, path); |
7e38180e CM |
105 | |
106 | btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY); | |
107 | key.offset = location->objectid; | |
e06afa83 CM |
108 | dir_item = insert_with_overflow(trans, root, path, &key, data_size, |
109 | name, name_len); | |
7e38180e | 110 | if (IS_ERR(dir_item)) { |
e06afa83 | 111 | ret2 = PTR_ERR(dir_item); |
7e38180e CM |
112 | goto out; |
113 | } | |
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]); | |
121 | out: | |
5caf2a00 | 122 | btrfs_free_path(path); |
e06afa83 CM |
123 | if (ret) |
124 | return ret; | |
125 | if (ret2) | |
126 | return ret2; | |
127 | return 0; | |
62e2749e CM |
128 | } |
129 | ||
7e38180e CM |
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, | |
134 | int mod) | |
62e2749e | 135 | { |
1d4f6404 | 136 | int ret; |
62e2749e | 137 | struct btrfs_key key; |
1d4f6404 CM |
138 | int ins_len = mod < 0 ? -1 : 0; |
139 | int cow = mod != 0; | |
7fcde0e3 CM |
140 | struct btrfs_disk_key *found_key; |
141 | struct btrfs_leaf *leaf; | |
62e2749e CM |
142 | |
143 | key.objectid = dir; | |
144 | key.flags = 0; | |
1d4f6404 | 145 | btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY); |
62e2749e CM |
146 | ret = btrfs_name_hash(name, name_len, &key.offset); |
147 | BUG_ON(ret); | |
7e38180e CM |
148 | ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); |
149 | if (ret < 0) | |
150 | return ERR_PTR(ret); | |
151 | if (ret > 0) { | |
152 | if (path->slots[0] == 0) | |
153 | return NULL; | |
154 | path->slots[0]--; | |
7fcde0e3 | 155 | } |
7e38180e CM |
156 | leaf = btrfs_buffer_leaf(path->nodes[0]); |
157 | found_key = &leaf->items[path->slots[0]].key; | |
158 | ||
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) | |
162 | return NULL; | |
163 | ||
164 | return btrfs_match_dir_item_name(root, path, name, name_len); | |
62e2749e CM |
165 | } |
166 | ||
7e38180e CM |
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, | |
172 | int mod) | |
173 | { | |
174 | int ret; | |
175 | struct btrfs_key key; | |
176 | int ins_len = mod < 0 ? -1 : 0; | |
177 | int cow = mod != 0; | |
178 | ||
179 | key.objectid = dir; | |
180 | key.flags = 0; | |
181 | btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY); | |
182 | key.offset = objectid; | |
183 | ||
184 | ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); | |
185 | if (ret < 0) | |
186 | return ERR_PTR(ret); | |
187 | if (ret > 0) | |
188 | return ERR_PTR(-ENOENT); | |
189 | return btrfs_match_dir_item_name(root, path, name, name_len); | |
190 | } | |
191 | ||
192 | struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root, | |
7f5c1516 CM |
193 | struct btrfs_path *path, |
194 | const char *name, int name_len) | |
62e2749e | 195 | { |
62e2749e CM |
196 | struct btrfs_dir_item *dir_item; |
197 | char *name_ptr; | |
7e38180e CM |
198 | u32 total_len; |
199 | u32 cur = 0; | |
200 | u32 this_len; | |
201 | struct btrfs_leaf *leaf; | |
a8a2ee0c | 202 | |
7e38180e CM |
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); | |
209 | ||
210 | if (btrfs_dir_name_len(dir_item) == name_len && | |
211 | memcmp(name_ptr, name, name_len) == 0) | |
212 | return dir_item; | |
213 | ||
214 | cur += this_len; | |
215 | dir_item = (struct btrfs_dir_item *)((char *)dir_item + | |
216 | this_len); | |
217 | } | |
218 | return NULL; | |
62e2749e | 219 | } |
7e38180e CM |
220 | |
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) | |
225 | { | |
226 | ||
227 | struct btrfs_leaf *leaf; | |
228 | u32 sub_item_len; | |
229 | u32 item_len; | |
54aa1f4d | 230 | int ret = 0; |
7e38180e CM |
231 | |
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); | |
7e38180e CM |
237 | } else { |
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); | |
7e38180e CM |
244 | } |
245 | return 0; | |
246 | } | |
247 |