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 | ||
62e2749e CM |
19 | #include "ctree.h" |
20 | #include "disk-io.h" | |
21 | #include "hash.h" | |
e089f05c | 22 | #include "transaction.h" |
62e2749e | 23 | |
d352ac68 CM |
24 | /* |
25 | * insert a name into a directory, doing overflow properly if there is a hash | |
26 | * collision. data_size indicates how big the item inserted should be. On | |
27 | * success a struct btrfs_dir_item pointer is returned, otherwise it is | |
28 | * an ERR_PTR. | |
29 | * | |
30 | * The name is not copied into the dir item, you have to do that yourself. | |
31 | */ | |
35b7e476 CM |
32 | static struct btrfs_dir_item *insert_with_overflow(struct btrfs_trans_handle |
33 | *trans, | |
34 | struct btrfs_root *root, | |
35 | struct btrfs_path *path, | |
36 | struct btrfs_key *cpu_key, | |
e06afa83 CM |
37 | u32 data_size, |
38 | const char *name, | |
39 | int name_len) | |
7fcde0e3 | 40 | { |
7fcde0e3 | 41 | int ret; |
7e38180e CM |
42 | char *ptr; |
43 | struct btrfs_item *item; | |
5f39d397 | 44 | struct extent_buffer *leaf; |
7fcde0e3 CM |
45 | |
46 | ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size); | |
7e38180e | 47 | if (ret == -EEXIST) { |
e06afa83 CM |
48 | struct btrfs_dir_item *di; |
49 | di = btrfs_match_dir_item_name(root, path, name, name_len); | |
50 | if (di) | |
51 | return ERR_PTR(-EEXIST); | |
7e38180e CM |
52 | ret = btrfs_extend_item(trans, root, path, data_size); |
53 | WARN_ON(ret > 0); | |
7fcde0e3 | 54 | } |
54aa1f4d CM |
55 | if (ret < 0) |
56 | return ERR_PTR(ret); | |
7e38180e | 57 | WARN_ON(ret > 0); |
5f39d397 CM |
58 | leaf = path->nodes[0]; |
59 | item = btrfs_item_nr(leaf, path->slots[0]); | |
7e38180e | 60 | ptr = btrfs_item_ptr(leaf, path->slots[0], char); |
5f39d397 CM |
61 | BUG_ON(data_size > btrfs_item_size(leaf, item)); |
62 | ptr += btrfs_item_size(leaf, item) - data_size; | |
7e38180e | 63 | return (struct btrfs_dir_item *)ptr; |
7fcde0e3 CM |
64 | } |
65 | ||
d352ac68 CM |
66 | /* |
67 | * xattrs work a lot like directories, this inserts an xattr item | |
68 | * into the tree | |
69 | */ | |
5103e947 | 70 | int btrfs_insert_xattr_item(struct btrfs_trans_handle *trans, |
f34f57a3 YZ |
71 | struct btrfs_root *root, |
72 | struct btrfs_path *path, u64 objectid, | |
73 | const char *name, u16 name_len, | |
74 | const void *data, u16 data_len) | |
5103e947 JB |
75 | { |
76 | int ret = 0; | |
5103e947 JB |
77 | struct btrfs_dir_item *dir_item; |
78 | unsigned long name_ptr, data_ptr; | |
79 | struct btrfs_key key, location; | |
80 | struct btrfs_disk_key disk_key; | |
81 | struct extent_buffer *leaf; | |
82 | u32 data_size; | |
83 | ||
f34f57a3 YZ |
84 | BUG_ON(name_len + data_len > BTRFS_MAX_XATTR_SIZE(root)); |
85 | ||
86 | key.objectid = objectid; | |
5103e947 | 87 | btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY); |
df68b8a7 | 88 | key.offset = btrfs_name_hash(name, name_len); |
5103e947 JB |
89 | |
90 | data_size = sizeof(*dir_item) + name_len + data_len; | |
91 | dir_item = insert_with_overflow(trans, root, path, &key, data_size, | |
92 | name, name_len); | |
93 | /* | |
94 | * FIXME: at some point we should handle xattr's that are larger than | |
95 | * what we can fit in our leaf. We set location to NULL b/c we arent | |
96 | * pointing at anything else, that will change if we store the xattr | |
97 | * data in a separate inode. | |
98 | */ | |
99 | BUG_ON(IS_ERR(dir_item)); | |
100 | memset(&location, 0, sizeof(location)); | |
101 | ||
102 | leaf = path->nodes[0]; | |
103 | btrfs_cpu_key_to_disk(&disk_key, &location); | |
104 | btrfs_set_dir_item_key(leaf, dir_item, &disk_key); | |
105 | btrfs_set_dir_type(leaf, dir_item, BTRFS_FT_XATTR); | |
106 | btrfs_set_dir_name_len(leaf, dir_item, name_len); | |
e02119d5 | 107 | btrfs_set_dir_transid(leaf, dir_item, trans->transid); |
5103e947 JB |
108 | btrfs_set_dir_data_len(leaf, dir_item, data_len); |
109 | name_ptr = (unsigned long)(dir_item + 1); | |
110 | data_ptr = (unsigned long)((char *)name_ptr + name_len); | |
111 | ||
112 | write_extent_buffer(leaf, name, name_ptr, name_len); | |
113 | write_extent_buffer(leaf, data, data_ptr, data_len); | |
114 | btrfs_mark_buffer_dirty(path->nodes[0]); | |
115 | ||
5103e947 JB |
116 | return ret; |
117 | } | |
118 | ||
d352ac68 CM |
119 | /* |
120 | * insert a directory item in the tree, doing all the magic for | |
121 | * both indexes. 'dir' indicates which objectid to insert it into, | |
122 | * 'location' is the key to stuff into the directory item, 'type' is the | |
123 | * type of the inode we're pointing to, and 'index' is the sequence number | |
124 | * to use for the second index (if one is created). | |
125 | */ | |
e089f05c | 126 | int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root |
16cdcec7 MX |
127 | *root, const char *name, int name_len, |
128 | struct inode *dir, struct btrfs_key *location, | |
129 | u8 type, u64 index) | |
62e2749e CM |
130 | { |
131 | int ret = 0; | |
e06afa83 | 132 | int ret2 = 0; |
5caf2a00 | 133 | struct btrfs_path *path; |
62e2749e | 134 | struct btrfs_dir_item *dir_item; |
5f39d397 CM |
135 | struct extent_buffer *leaf; |
136 | unsigned long name_ptr; | |
62e2749e | 137 | struct btrfs_key key; |
5f39d397 | 138 | struct btrfs_disk_key disk_key; |
62e2749e CM |
139 | u32 data_size; |
140 | ||
16cdcec7 | 141 | key.objectid = dir->i_ino; |
1d4f6404 | 142 | btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY); |
df68b8a7 | 143 | key.offset = btrfs_name_hash(name, name_len); |
b9473439 | 144 | |
5caf2a00 | 145 | path = btrfs_alloc_path(); |
16cdcec7 MX |
146 | if (!path) |
147 | return -ENOMEM; | |
b9473439 CM |
148 | path->leave_spinning = 1; |
149 | ||
16cdcec7 MX |
150 | btrfs_cpu_key_to_disk(&disk_key, location); |
151 | ||
62e2749e | 152 | data_size = sizeof(*dir_item) + name_len; |
e06afa83 CM |
153 | dir_item = insert_with_overflow(trans, root, path, &key, data_size, |
154 | name, name_len); | |
7e38180e CM |
155 | if (IS_ERR(dir_item)) { |
156 | ret = PTR_ERR(dir_item); | |
e06afa83 CM |
157 | if (ret == -EEXIST) |
158 | goto second_insert; | |
c2db1073 | 159 | goto out_free; |
7e38180e | 160 | } |
62e2749e | 161 | |
5f39d397 | 162 | leaf = path->nodes[0]; |
5f39d397 CM |
163 | btrfs_set_dir_item_key(leaf, dir_item, &disk_key); |
164 | btrfs_set_dir_type(leaf, dir_item, type); | |
5103e947 | 165 | btrfs_set_dir_data_len(leaf, dir_item, 0); |
5f39d397 | 166 | btrfs_set_dir_name_len(leaf, dir_item, name_len); |
e02119d5 | 167 | btrfs_set_dir_transid(leaf, dir_item, trans->transid); |
5f39d397 | 168 | name_ptr = (unsigned long)(dir_item + 1); |
c5739bba | 169 | |
5f39d397 CM |
170 | write_extent_buffer(leaf, name, name_ptr, name_len); |
171 | btrfs_mark_buffer_dirty(leaf); | |
7e38180e | 172 | |
e06afa83 | 173 | second_insert: |
7e38180e CM |
174 | /* FIXME, use some real flag for selecting the extra index */ |
175 | if (root == root->fs_info->tree_root) { | |
176 | ret = 0; | |
c2db1073 | 177 | goto out_free; |
7e38180e | 178 | } |
5caf2a00 | 179 | btrfs_release_path(root, path); |
7e38180e | 180 | |
16cdcec7 MX |
181 | ret2 = btrfs_insert_delayed_dir_index(trans, root, name, name_len, dir, |
182 | &disk_key, type, index); | |
c2db1073 | 183 | out_free: |
5caf2a00 | 184 | btrfs_free_path(path); |
e06afa83 CM |
185 | if (ret) |
186 | return ret; | |
187 | if (ret2) | |
188 | return ret2; | |
189 | return 0; | |
62e2749e CM |
190 | } |
191 | ||
d352ac68 CM |
192 | /* |
193 | * lookup a directory item based on name. 'dir' is the objectid | |
194 | * we're searching in, and 'mod' tells us if you plan on deleting the | |
195 | * item (use mod < 0) or changing the options (use mod > 0) | |
196 | */ | |
7e38180e CM |
197 | struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans, |
198 | struct btrfs_root *root, | |
199 | struct btrfs_path *path, u64 dir, | |
200 | const char *name, int name_len, | |
201 | int mod) | |
62e2749e | 202 | { |
1d4f6404 | 203 | int ret; |
62e2749e | 204 | struct btrfs_key key; |
1d4f6404 CM |
205 | int ins_len = mod < 0 ? -1 : 0; |
206 | int cow = mod != 0; | |
5f39d397 CM |
207 | struct btrfs_key found_key; |
208 | struct extent_buffer *leaf; | |
62e2749e CM |
209 | |
210 | key.objectid = dir; | |
1d4f6404 | 211 | btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY); |
5f39d397 | 212 | |
df68b8a7 | 213 | key.offset = btrfs_name_hash(name, name_len); |
5f39d397 | 214 | |
7e38180e CM |
215 | ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); |
216 | if (ret < 0) | |
217 | return ERR_PTR(ret); | |
218 | if (ret > 0) { | |
219 | if (path->slots[0] == 0) | |
220 | return NULL; | |
221 | path->slots[0]--; | |
7fcde0e3 | 222 | } |
7e38180e | 223 | |
5f39d397 CM |
224 | leaf = path->nodes[0]; |
225 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
226 | ||
227 | if (found_key.objectid != dir || | |
228 | btrfs_key_type(&found_key) != BTRFS_DIR_ITEM_KEY || | |
229 | found_key.offset != key.offset) | |
7e38180e CM |
230 | return NULL; |
231 | ||
232 | return btrfs_match_dir_item_name(root, path, name, name_len); | |
62e2749e CM |
233 | } |
234 | ||
d352ac68 CM |
235 | /* |
236 | * lookup a directory item based on index. 'dir' is the objectid | |
237 | * we're searching in, and 'mod' tells us if you plan on deleting the | |
238 | * item (use mod < 0) or changing the options (use mod > 0) | |
239 | * | |
240 | * The name is used to make sure the index really points to the name you were | |
241 | * looking for. | |
242 | */ | |
7e38180e CM |
243 | struct btrfs_dir_item * |
244 | btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans, | |
245 | struct btrfs_root *root, | |
246 | struct btrfs_path *path, u64 dir, | |
247 | u64 objectid, const char *name, int name_len, | |
248 | int mod) | |
249 | { | |
250 | int ret; | |
251 | struct btrfs_key key; | |
252 | int ins_len = mod < 0 ? -1 : 0; | |
253 | int cow = mod != 0; | |
254 | ||
255 | key.objectid = dir; | |
7e38180e CM |
256 | btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY); |
257 | key.offset = objectid; | |
258 | ||
259 | ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); | |
260 | if (ret < 0) | |
261 | return ERR_PTR(ret); | |
262 | if (ret > 0) | |
263 | return ERR_PTR(-ENOENT); | |
264 | return btrfs_match_dir_item_name(root, path, name, name_len); | |
265 | } | |
266 | ||
4df27c4d YZ |
267 | struct btrfs_dir_item * |
268 | btrfs_search_dir_index_item(struct btrfs_root *root, | |
269 | struct btrfs_path *path, u64 dirid, | |
270 | const char *name, int name_len) | |
271 | { | |
272 | struct extent_buffer *leaf; | |
273 | struct btrfs_dir_item *di; | |
274 | struct btrfs_key key; | |
275 | u32 nritems; | |
276 | int ret; | |
277 | ||
278 | key.objectid = dirid; | |
279 | key.type = BTRFS_DIR_INDEX_KEY; | |
280 | key.offset = 0; | |
281 | ||
282 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
283 | if (ret < 0) | |
284 | return ERR_PTR(ret); | |
285 | ||
286 | leaf = path->nodes[0]; | |
287 | nritems = btrfs_header_nritems(leaf); | |
288 | ||
289 | while (1) { | |
290 | if (path->slots[0] >= nritems) { | |
291 | ret = btrfs_next_leaf(root, path); | |
292 | if (ret < 0) | |
293 | return ERR_PTR(ret); | |
294 | if (ret > 0) | |
295 | break; | |
296 | leaf = path->nodes[0]; | |
297 | nritems = btrfs_header_nritems(leaf); | |
298 | continue; | |
299 | } | |
300 | ||
301 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
302 | if (key.objectid != dirid || key.type != BTRFS_DIR_INDEX_KEY) | |
303 | break; | |
304 | ||
305 | di = btrfs_match_dir_item_name(root, path, name, name_len); | |
306 | if (di) | |
307 | return di; | |
308 | ||
309 | path->slots[0]++; | |
310 | } | |
311 | return NULL; | |
312 | } | |
313 | ||
5103e947 JB |
314 | struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans, |
315 | struct btrfs_root *root, | |
316 | struct btrfs_path *path, u64 dir, | |
317 | const char *name, u16 name_len, | |
318 | int mod) | |
319 | { | |
320 | int ret; | |
321 | struct btrfs_key key; | |
322 | int ins_len = mod < 0 ? -1 : 0; | |
323 | int cow = mod != 0; | |
324 | struct btrfs_key found_key; | |
325 | struct extent_buffer *leaf; | |
326 | ||
327 | key.objectid = dir; | |
328 | btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY); | |
df68b8a7 | 329 | key.offset = btrfs_name_hash(name, name_len); |
5103e947 JB |
330 | ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); |
331 | if (ret < 0) | |
332 | return ERR_PTR(ret); | |
333 | if (ret > 0) { | |
334 | if (path->slots[0] == 0) | |
335 | return NULL; | |
336 | path->slots[0]--; | |
337 | } | |
338 | ||
339 | leaf = path->nodes[0]; | |
340 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
341 | ||
342 | if (found_key.objectid != dir || | |
343 | btrfs_key_type(&found_key) != BTRFS_XATTR_ITEM_KEY || | |
344 | found_key.offset != key.offset) | |
345 | return NULL; | |
346 | ||
347 | return btrfs_match_dir_item_name(root, path, name, name_len); | |
348 | } | |
349 | ||
d352ac68 CM |
350 | /* |
351 | * helper function to look at the directory item pointed to by 'path' | |
352 | * this walks through all the entries in a dir item and finds one | |
353 | * for a specific name. | |
354 | */ | |
7e38180e | 355 | struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root, |
7f5c1516 CM |
356 | struct btrfs_path *path, |
357 | const char *name, int name_len) | |
62e2749e | 358 | { |
62e2749e | 359 | struct btrfs_dir_item *dir_item; |
5f39d397 | 360 | unsigned long name_ptr; |
7e38180e CM |
361 | u32 total_len; |
362 | u32 cur = 0; | |
363 | u32 this_len; | |
5f39d397 | 364 | struct extent_buffer *leaf; |
a8a2ee0c | 365 | |
5f39d397 | 366 | leaf = path->nodes[0]; |
7e38180e | 367 | dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item); |
22a94d44 JB |
368 | if (verify_dir_item(root, leaf, dir_item)) |
369 | return NULL; | |
370 | ||
5f39d397 | 371 | total_len = btrfs_item_size_nr(leaf, path->slots[0]); |
d397712b | 372 | while (cur < total_len) { |
5f39d397 | 373 | this_len = sizeof(*dir_item) + |
5103e947 JB |
374 | btrfs_dir_name_len(leaf, dir_item) + |
375 | btrfs_dir_data_len(leaf, dir_item); | |
5f39d397 | 376 | name_ptr = (unsigned long)(dir_item + 1); |
7e38180e | 377 | |
5f39d397 CM |
378 | if (btrfs_dir_name_len(leaf, dir_item) == name_len && |
379 | memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0) | |
7e38180e CM |
380 | return dir_item; |
381 | ||
382 | cur += this_len; | |
383 | dir_item = (struct btrfs_dir_item *)((char *)dir_item + | |
384 | this_len); | |
385 | } | |
386 | return NULL; | |
62e2749e | 387 | } |
7e38180e | 388 | |
d352ac68 CM |
389 | /* |
390 | * given a pointer into a directory item, delete it. This | |
391 | * handles items that have more than one entry in them. | |
392 | */ | |
7e38180e CM |
393 | int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans, |
394 | struct btrfs_root *root, | |
395 | struct btrfs_path *path, | |
396 | struct btrfs_dir_item *di) | |
397 | { | |
398 | ||
5f39d397 | 399 | struct extent_buffer *leaf; |
7e38180e CM |
400 | u32 sub_item_len; |
401 | u32 item_len; | |
54aa1f4d | 402 | int ret = 0; |
7e38180e | 403 | |
5f39d397 | 404 | leaf = path->nodes[0]; |
5103e947 JB |
405 | sub_item_len = sizeof(*di) + btrfs_dir_name_len(leaf, di) + |
406 | btrfs_dir_data_len(leaf, di); | |
5f39d397 CM |
407 | item_len = btrfs_item_size_nr(leaf, path->slots[0]); |
408 | if (sub_item_len == item_len) { | |
7e38180e | 409 | ret = btrfs_del_item(trans, root, path); |
7e38180e | 410 | } else { |
5f39d397 CM |
411 | /* MARKER */ |
412 | unsigned long ptr = (unsigned long)di; | |
413 | unsigned long start; | |
414 | ||
415 | start = btrfs_item_ptr_offset(leaf, path->slots[0]); | |
416 | memmove_extent_buffer(leaf, ptr, ptr + sub_item_len, | |
7e38180e CM |
417 | item_len - (ptr + sub_item_len - start)); |
418 | ret = btrfs_truncate_item(trans, root, path, | |
179e29e4 | 419 | item_len - sub_item_len, 1); |
7e38180e | 420 | } |
411fc6bc | 421 | return ret; |
7e38180e | 422 | } |
22a94d44 JB |
423 | |
424 | int verify_dir_item(struct btrfs_root *root, | |
425 | struct extent_buffer *leaf, | |
426 | struct btrfs_dir_item *dir_item) | |
427 | { | |
428 | u16 namelen = BTRFS_NAME_LEN; | |
429 | u8 type = btrfs_dir_type(leaf, dir_item); | |
430 | ||
431 | if (type >= BTRFS_FT_MAX) { | |
432 | printk(KERN_CRIT "btrfs: invalid dir item type: %d\n", | |
433 | (int)type); | |
434 | return 1; | |
435 | } | |
436 | ||
437 | if (type == BTRFS_FT_XATTR) | |
438 | namelen = XATTR_NAME_MAX; | |
439 | ||
440 | if (btrfs_dir_name_len(leaf, dir_item) > namelen) { | |
441 | printk(KERN_CRIT "btrfS: invalid dir item name len: %u\n", | |
442 | (unsigned)btrfs_dir_data_len(leaf, dir_item)); | |
443 | return 1; | |
444 | } | |
445 | ||
446 | /* BTRFS_MAX_XATTR_SIZE is the same for all dir items */ | |
447 | if (btrfs_dir_data_len(leaf, dir_item) > BTRFS_MAX_XATTR_SIZE(root)) { | |
448 | printk(KERN_CRIT "btrfs: invalid dir item data len: %u\n", | |
449 | (unsigned)btrfs_dir_data_len(leaf, dir_item)); | |
450 | return 1; | |
451 | } | |
452 | ||
453 | return 0; | |
454 | } |