blob: c62f02f6ae693728ce9286d963b78708428a86fb [file] [log] [blame]
Chris Mason6cbd5572007-06-12 09:07:21 -04001/*
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
Chris Mason62e27492007-03-15 12:56:47 -040019#include "ctree.h"
20#include "disk-io.h"
21#include "hash.h"
Chris Masone089f052007-03-16 16:20:31 -040022#include "transaction.h"
Chris Mason62e27492007-03-15 12:56:47 -040023
Chris Masond352ac62008-09-29 15:18:18 -040024/*
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 */
Chris Mason35b7e472007-05-02 15:53:43 -040032static 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,
Chris Masone06afa82007-05-23 15:44:28 -040037 u32 data_size,
38 const char *name,
39 int name_len)
Chris Mason7fcde0e2007-04-05 12:13:21 -040040{
Chris Mason7fcde0e2007-04-05 12:13:21 -040041 int ret;
Chris Mason7e381802007-04-19 15:36:27 -040042 char *ptr;
43 struct btrfs_item *item;
Chris Mason5f39d392007-10-15 16:14:19 -040044 struct extent_buffer *leaf;
Chris Mason7fcde0e2007-04-05 12:13:21 -040045
46 ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);
Chris Mason7e381802007-04-19 15:36:27 -040047 if (ret == -EEXIST) {
Chris Masone06afa82007-05-23 15:44:28 -040048 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);
Chris Mason7e381802007-04-19 15:36:27 -040052 ret = btrfs_extend_item(trans, root, path, data_size);
53 WARN_ON(ret > 0);
Chris Mason7fcde0e2007-04-05 12:13:21 -040054 }
Chris Mason54aa1f42007-06-22 14:16:25 -040055 if (ret < 0)
56 return ERR_PTR(ret);
Chris Mason7e381802007-04-19 15:36:27 -040057 WARN_ON(ret > 0);
Chris Mason5f39d392007-10-15 16:14:19 -040058 leaf = path->nodes[0];
59 item = btrfs_item_nr(leaf, path->slots[0]);
Chris Mason7e381802007-04-19 15:36:27 -040060 ptr = btrfs_item_ptr(leaf, path->slots[0], char);
Chris Mason5f39d392007-10-15 16:14:19 -040061 BUG_ON(data_size > btrfs_item_size(leaf, item));
62 ptr += btrfs_item_size(leaf, item) - data_size;
Chris Mason7e381802007-04-19 15:36:27 -040063 return (struct btrfs_dir_item *)ptr;
Chris Mason7fcde0e2007-04-05 12:13:21 -040064}
65
Chris Masond352ac62008-09-29 15:18:18 -040066/*
67 * xattrs work a lot like directories, this inserts an xattr item
68 * into the tree
69 */
Josef Bacik5103e942007-11-16 11:45:54 -050070int btrfs_insert_xattr_item(struct btrfs_trans_handle *trans,
Yan, Zhengf34f57a2009-11-12 09:35:27 +000071 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)
Josef Bacik5103e942007-11-16 11:45:54 -050075{
76 int ret = 0;
Josef Bacik5103e942007-11-16 11:45:54 -050077 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
Yan, Zhengf34f57a2009-11-12 09:35:27 +000084 BUG_ON(name_len + data_len > BTRFS_MAX_XATTR_SIZE(root));
85
86 key.objectid = objectid;
Josef Bacik5103e942007-11-16 11:45:54 -050087 btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY);
David Millerdf68b8a2008-02-15 10:40:52 -050088 key.offset = btrfs_name_hash(name, name_len);
Josef Bacik5103e942007-11-16 11:45:54 -050089
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);
Chris Masone02119d2008-09-05 16:13:11 -0400107 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
Josef Bacik5103e942007-11-16 11:45:54 -0500108 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
Josef Bacik5103e942007-11-16 11:45:54 -0500116 return ret;
117}
118
Chris Masond352ac62008-09-29 15:18:18 -0400119/*
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 */
Chris Masone089f052007-03-16 16:20:31 -0400126int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
Chris Masond6e4a422007-04-06 15:37:36 -0400127 *root, const char *name, int name_len, u64 dir,
Josef Bacikaec74772008-07-24 12:12:38 -0400128 struct btrfs_key *location, u8 type, u64 index)
Chris Mason62e27492007-03-15 12:56:47 -0400129{
130 int ret = 0;
Chris Masone06afa82007-05-23 15:44:28 -0400131 int ret2 = 0;
Chris Mason5caf2a02007-04-02 11:20:42 -0400132 struct btrfs_path *path;
Chris Mason62e27492007-03-15 12:56:47 -0400133 struct btrfs_dir_item *dir_item;
Chris Mason5f39d392007-10-15 16:14:19 -0400134 struct extent_buffer *leaf;
135 unsigned long name_ptr;
Chris Mason62e27492007-03-15 12:56:47 -0400136 struct btrfs_key key;
Chris Mason5f39d392007-10-15 16:14:19 -0400137 struct btrfs_disk_key disk_key;
Chris Mason62e27492007-03-15 12:56:47 -0400138 u32 data_size;
139
140 key.objectid = dir;
Chris Mason1d4f6402007-03-15 15:18:43 -0400141 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
David Millerdf68b8a2008-02-15 10:40:52 -0500142 key.offset = btrfs_name_hash(name, name_len);
Chris Masonb9473432009-03-13 11:00:37 -0400143
Chris Mason5caf2a02007-04-02 11:20:42 -0400144 path = btrfs_alloc_path();
Chris Masonb9473432009-03-13 11:00:37 -0400145 path->leave_spinning = 1;
146
Chris Mason62e27492007-03-15 12:56:47 -0400147 data_size = sizeof(*dir_item) + name_len;
Chris Masone06afa82007-05-23 15:44:28 -0400148 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
149 name, name_len);
Chris Mason7e381802007-04-19 15:36:27 -0400150 if (IS_ERR(dir_item)) {
151 ret = PTR_ERR(dir_item);
Chris Masone06afa82007-05-23 15:44:28 -0400152 if (ret == -EEXIST)
153 goto second_insert;
Tsutomu Itohc2db1072011-03-01 06:48:31 +0000154 goto out_free;
Chris Mason7e381802007-04-19 15:36:27 -0400155 }
Chris Mason62e27492007-03-15 12:56:47 -0400156
Chris Mason5f39d392007-10-15 16:14:19 -0400157 leaf = path->nodes[0];
158 btrfs_cpu_key_to_disk(&disk_key, location);
159 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
160 btrfs_set_dir_type(leaf, dir_item, type);
Josef Bacik5103e942007-11-16 11:45:54 -0500161 btrfs_set_dir_data_len(leaf, dir_item, 0);
Chris Mason5f39d392007-10-15 16:14:19 -0400162 btrfs_set_dir_name_len(leaf, dir_item, name_len);
Chris Masone02119d2008-09-05 16:13:11 -0400163 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
Chris Mason5f39d392007-10-15 16:14:19 -0400164 name_ptr = (unsigned long)(dir_item + 1);
Chris Masonc5739bb2007-04-10 09:27:04 -0400165
Chris Mason5f39d392007-10-15 16:14:19 -0400166 write_extent_buffer(leaf, name, name_ptr, name_len);
167 btrfs_mark_buffer_dirty(leaf);
Chris Mason7e381802007-04-19 15:36:27 -0400168
Chris Masone06afa82007-05-23 15:44:28 -0400169second_insert:
Chris Mason7e381802007-04-19 15:36:27 -0400170 /* FIXME, use some real flag for selecting the extra index */
171 if (root == root->fs_info->tree_root) {
172 ret = 0;
Tsutomu Itohc2db1072011-03-01 06:48:31 +0000173 goto out_free;
Chris Mason7e381802007-04-19 15:36:27 -0400174 }
Chris Mason5caf2a02007-04-02 11:20:42 -0400175 btrfs_release_path(root, path);
Chris Mason7e381802007-04-19 15:36:27 -0400176
177 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
Josef Bacikaec74772008-07-24 12:12:38 -0400178 key.offset = index;
Chris Masone06afa82007-05-23 15:44:28 -0400179 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
180 name, name_len);
Chris Mason7e381802007-04-19 15:36:27 -0400181 if (IS_ERR(dir_item)) {
Chris Masone06afa82007-05-23 15:44:28 -0400182 ret2 = PTR_ERR(dir_item);
Tsutomu Itohc2db1072011-03-01 06:48:31 +0000183 goto out_free;
Chris Mason7e381802007-04-19 15:36:27 -0400184 }
Chris Mason5f39d392007-10-15 16:14:19 -0400185 leaf = path->nodes[0];
186 btrfs_cpu_key_to_disk(&disk_key, location);
187 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
188 btrfs_set_dir_type(leaf, dir_item, type);
Josef Bacik5103e942007-11-16 11:45:54 -0500189 btrfs_set_dir_data_len(leaf, dir_item, 0);
Chris Mason5f39d392007-10-15 16:14:19 -0400190 btrfs_set_dir_name_len(leaf, dir_item, name_len);
Chris Masone02119d2008-09-05 16:13:11 -0400191 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
Chris Mason5f39d392007-10-15 16:14:19 -0400192 name_ptr = (unsigned long)(dir_item + 1);
193 write_extent_buffer(leaf, name, name_ptr, name_len);
194 btrfs_mark_buffer_dirty(leaf);
Tsutomu Itohc2db1072011-03-01 06:48:31 +0000195
196out_free:
197
Chris Mason5caf2a02007-04-02 11:20:42 -0400198 btrfs_free_path(path);
Chris Masone06afa82007-05-23 15:44:28 -0400199 if (ret)
200 return ret;
201 if (ret2)
202 return ret2;
203 return 0;
Chris Mason62e27492007-03-15 12:56:47 -0400204}
205
Chris Masond352ac62008-09-29 15:18:18 -0400206/*
207 * lookup a directory item based on name. 'dir' is the objectid
208 * we're searching in, and 'mod' tells us if you plan on deleting the
209 * item (use mod < 0) or changing the options (use mod > 0)
210 */
Chris Mason7e381802007-04-19 15:36:27 -0400211struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans,
212 struct btrfs_root *root,
213 struct btrfs_path *path, u64 dir,
214 const char *name, int name_len,
215 int mod)
Chris Mason62e27492007-03-15 12:56:47 -0400216{
Chris Mason1d4f6402007-03-15 15:18:43 -0400217 int ret;
Chris Mason62e27492007-03-15 12:56:47 -0400218 struct btrfs_key key;
Chris Mason1d4f6402007-03-15 15:18:43 -0400219 int ins_len = mod < 0 ? -1 : 0;
220 int cow = mod != 0;
Chris Mason5f39d392007-10-15 16:14:19 -0400221 struct btrfs_key found_key;
222 struct extent_buffer *leaf;
Chris Mason62e27492007-03-15 12:56:47 -0400223
224 key.objectid = dir;
Chris Mason1d4f6402007-03-15 15:18:43 -0400225 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
Chris Mason5f39d392007-10-15 16:14:19 -0400226
David Millerdf68b8a2008-02-15 10:40:52 -0500227 key.offset = btrfs_name_hash(name, name_len);
Chris Mason5f39d392007-10-15 16:14:19 -0400228
Chris Mason7e381802007-04-19 15:36:27 -0400229 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
230 if (ret < 0)
231 return ERR_PTR(ret);
232 if (ret > 0) {
233 if (path->slots[0] == 0)
234 return NULL;
235 path->slots[0]--;
Chris Mason7fcde0e2007-04-05 12:13:21 -0400236 }
Chris Mason7e381802007-04-19 15:36:27 -0400237
Chris Mason5f39d392007-10-15 16:14:19 -0400238 leaf = path->nodes[0];
239 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
240
241 if (found_key.objectid != dir ||
242 btrfs_key_type(&found_key) != BTRFS_DIR_ITEM_KEY ||
243 found_key.offset != key.offset)
Chris Mason7e381802007-04-19 15:36:27 -0400244 return NULL;
245
246 return btrfs_match_dir_item_name(root, path, name, name_len);
Chris Mason62e27492007-03-15 12:56:47 -0400247}
248
Chris Masond352ac62008-09-29 15:18:18 -0400249/*
250 * lookup a directory item based on index. 'dir' is the objectid
251 * we're searching in, and 'mod' tells us if you plan on deleting the
252 * item (use mod < 0) or changing the options (use mod > 0)
253 *
254 * The name is used to make sure the index really points to the name you were
255 * looking for.
256 */
Chris Mason7e381802007-04-19 15:36:27 -0400257struct btrfs_dir_item *
258btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans,
259 struct btrfs_root *root,
260 struct btrfs_path *path, u64 dir,
261 u64 objectid, const char *name, int name_len,
262 int mod)
263{
264 int ret;
265 struct btrfs_key key;
266 int ins_len = mod < 0 ? -1 : 0;
267 int cow = mod != 0;
268
269 key.objectid = dir;
Chris Mason7e381802007-04-19 15:36:27 -0400270 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
271 key.offset = objectid;
272
273 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
274 if (ret < 0)
275 return ERR_PTR(ret);
276 if (ret > 0)
277 return ERR_PTR(-ENOENT);
278 return btrfs_match_dir_item_name(root, path, name, name_len);
279}
280
Yan, Zheng4df27c4d2009-09-21 15:56:00 -0400281struct btrfs_dir_item *
282btrfs_search_dir_index_item(struct btrfs_root *root,
283 struct btrfs_path *path, u64 dirid,
284 const char *name, int name_len)
285{
286 struct extent_buffer *leaf;
287 struct btrfs_dir_item *di;
288 struct btrfs_key key;
289 u32 nritems;
290 int ret;
291
292 key.objectid = dirid;
293 key.type = BTRFS_DIR_INDEX_KEY;
294 key.offset = 0;
295
296 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
297 if (ret < 0)
298 return ERR_PTR(ret);
299
300 leaf = path->nodes[0];
301 nritems = btrfs_header_nritems(leaf);
302
303 while (1) {
304 if (path->slots[0] >= nritems) {
305 ret = btrfs_next_leaf(root, path);
306 if (ret < 0)
307 return ERR_PTR(ret);
308 if (ret > 0)
309 break;
310 leaf = path->nodes[0];
311 nritems = btrfs_header_nritems(leaf);
312 continue;
313 }
314
315 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
316 if (key.objectid != dirid || key.type != BTRFS_DIR_INDEX_KEY)
317 break;
318
319 di = btrfs_match_dir_item_name(root, path, name, name_len);
320 if (di)
321 return di;
322
323 path->slots[0]++;
324 }
325 return NULL;
326}
327
Josef Bacik5103e942007-11-16 11:45:54 -0500328struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans,
329 struct btrfs_root *root,
330 struct btrfs_path *path, u64 dir,
331 const char *name, u16 name_len,
332 int mod)
333{
334 int ret;
335 struct btrfs_key key;
336 int ins_len = mod < 0 ? -1 : 0;
337 int cow = mod != 0;
338 struct btrfs_key found_key;
339 struct extent_buffer *leaf;
340
341 key.objectid = dir;
342 btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY);
David Millerdf68b8a2008-02-15 10:40:52 -0500343 key.offset = btrfs_name_hash(name, name_len);
Josef Bacik5103e942007-11-16 11:45:54 -0500344 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
345 if (ret < 0)
346 return ERR_PTR(ret);
347 if (ret > 0) {
348 if (path->slots[0] == 0)
349 return NULL;
350 path->slots[0]--;
351 }
352
353 leaf = path->nodes[0];
354 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
355
356 if (found_key.objectid != dir ||
357 btrfs_key_type(&found_key) != BTRFS_XATTR_ITEM_KEY ||
358 found_key.offset != key.offset)
359 return NULL;
360
361 return btrfs_match_dir_item_name(root, path, name, name_len);
362}
363
Chris Masond352ac62008-09-29 15:18:18 -0400364/*
365 * helper function to look at the directory item pointed to by 'path'
366 * this walks through all the entries in a dir item and finds one
367 * for a specific name.
368 */
Chris Mason7e381802007-04-19 15:36:27 -0400369struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root,
Chris Mason7f5c1512007-03-23 15:56:19 -0400370 struct btrfs_path *path,
371 const char *name, int name_len)
Chris Mason62e27492007-03-15 12:56:47 -0400372{
Chris Mason62e27492007-03-15 12:56:47 -0400373 struct btrfs_dir_item *dir_item;
Chris Mason5f39d392007-10-15 16:14:19 -0400374 unsigned long name_ptr;
Chris Mason7e381802007-04-19 15:36:27 -0400375 u32 total_len;
376 u32 cur = 0;
377 u32 this_len;
Chris Mason5f39d392007-10-15 16:14:19 -0400378 struct extent_buffer *leaf;
Chris Masona8a2ee02007-03-16 08:46:49 -0400379
Chris Mason5f39d392007-10-15 16:14:19 -0400380 leaf = path->nodes[0];
Chris Mason7e381802007-04-19 15:36:27 -0400381 dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);
Josef Bacik22a94d42011-03-16 16:47:17 -0400382 if (verify_dir_item(root, leaf, dir_item))
383 return NULL;
384
Chris Mason5f39d392007-10-15 16:14:19 -0400385 total_len = btrfs_item_size_nr(leaf, path->slots[0]);
Chris Masond3977122009-01-05 21:25:51 -0500386 while (cur < total_len) {
Chris Mason5f39d392007-10-15 16:14:19 -0400387 this_len = sizeof(*dir_item) +
Josef Bacik5103e942007-11-16 11:45:54 -0500388 btrfs_dir_name_len(leaf, dir_item) +
389 btrfs_dir_data_len(leaf, dir_item);
Chris Mason5f39d392007-10-15 16:14:19 -0400390 name_ptr = (unsigned long)(dir_item + 1);
Chris Mason7e381802007-04-19 15:36:27 -0400391
Chris Mason5f39d392007-10-15 16:14:19 -0400392 if (btrfs_dir_name_len(leaf, dir_item) == name_len &&
393 memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0)
Chris Mason7e381802007-04-19 15:36:27 -0400394 return dir_item;
395
396 cur += this_len;
397 dir_item = (struct btrfs_dir_item *)((char *)dir_item +
398 this_len);
399 }
400 return NULL;
Chris Mason62e27492007-03-15 12:56:47 -0400401}
Chris Mason7e381802007-04-19 15:36:27 -0400402
Chris Masond352ac62008-09-29 15:18:18 -0400403/*
404 * given a pointer into a directory item, delete it. This
405 * handles items that have more than one entry in them.
406 */
Chris Mason7e381802007-04-19 15:36:27 -0400407int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans,
408 struct btrfs_root *root,
409 struct btrfs_path *path,
410 struct btrfs_dir_item *di)
411{
412
Chris Mason5f39d392007-10-15 16:14:19 -0400413 struct extent_buffer *leaf;
Chris Mason7e381802007-04-19 15:36:27 -0400414 u32 sub_item_len;
415 u32 item_len;
Chris Mason54aa1f42007-06-22 14:16:25 -0400416 int ret = 0;
Chris Mason7e381802007-04-19 15:36:27 -0400417
Chris Mason5f39d392007-10-15 16:14:19 -0400418 leaf = path->nodes[0];
Josef Bacik5103e942007-11-16 11:45:54 -0500419 sub_item_len = sizeof(*di) + btrfs_dir_name_len(leaf, di) +
420 btrfs_dir_data_len(leaf, di);
Chris Mason5f39d392007-10-15 16:14:19 -0400421 item_len = btrfs_item_size_nr(leaf, path->slots[0]);
422 if (sub_item_len == item_len) {
Chris Mason7e381802007-04-19 15:36:27 -0400423 ret = btrfs_del_item(trans, root, path);
Chris Mason7e381802007-04-19 15:36:27 -0400424 } else {
Chris Mason5f39d392007-10-15 16:14:19 -0400425 /* MARKER */
426 unsigned long ptr = (unsigned long)di;
427 unsigned long start;
428
429 start = btrfs_item_ptr_offset(leaf, path->slots[0]);
430 memmove_extent_buffer(leaf, ptr, ptr + sub_item_len,
Chris Mason7e381802007-04-19 15:36:27 -0400431 item_len - (ptr + sub_item_len - start));
432 ret = btrfs_truncate_item(trans, root, path,
Chris Mason179e29e2007-11-01 11:28:41 -0400433 item_len - sub_item_len, 1);
Chris Mason7e381802007-04-19 15:36:27 -0400434 }
Andi Kleen411fc6b2010-10-29 15:14:31 -0400435 return ret;
Chris Mason7e381802007-04-19 15:36:27 -0400436}
Josef Bacik22a94d42011-03-16 16:47:17 -0400437
438int verify_dir_item(struct btrfs_root *root,
439 struct extent_buffer *leaf,
440 struct btrfs_dir_item *dir_item)
441{
442 u16 namelen = BTRFS_NAME_LEN;
443 u8 type = btrfs_dir_type(leaf, dir_item);
444
445 if (type >= BTRFS_FT_MAX) {
446 printk(KERN_CRIT "btrfs: invalid dir item type: %d\n",
447 (int)type);
448 return 1;
449 }
450
451 if (type == BTRFS_FT_XATTR)
452 namelen = XATTR_NAME_MAX;
453
454 if (btrfs_dir_name_len(leaf, dir_item) > namelen) {
455 printk(KERN_CRIT "btrfS: invalid dir item name len: %u\n",
456 (unsigned)btrfs_dir_data_len(leaf, dir_item));
457 return 1;
458 }
459
460 /* BTRFS_MAX_XATTR_SIZE is the same for all dir items */
461 if (btrfs_dir_data_len(leaf, dir_item) > BTRFS_MAX_XATTR_SIZE(root)) {
462 printk(KERN_CRIT "btrfs: invalid dir item data len: %u\n",
463 (unsigned)btrfs_dir_data_len(leaf, dir_item));
464 return 1;
465 }
466
467 return 0;
468}