blob: fc8df866e91988bdbcbee0d9e50f770ebd0de905 [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
Eric Sandeen48a3b632013-04-25 20:41:01 +000024static struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root,
25 struct btrfs_path *path,
26 const char *name, int name_len);
27
Chris Masond352ac62008-09-29 15:18:18 -040028/*
29 * insert a name into a directory, doing overflow properly if there is a hash
30 * collision. data_size indicates how big the item inserted should be. On
31 * success a struct btrfs_dir_item pointer is returned, otherwise it is
32 * an ERR_PTR.
33 *
34 * The name is not copied into the dir item, you have to do that yourself.
35 */
Chris Mason35b7e472007-05-02 15:53:43 -040036static struct btrfs_dir_item *insert_with_overflow(struct btrfs_trans_handle
37 *trans,
38 struct btrfs_root *root,
39 struct btrfs_path *path,
40 struct btrfs_key *cpu_key,
Chris Masone06afa82007-05-23 15:44:28 -040041 u32 data_size,
42 const char *name,
43 int name_len)
Chris Mason7fcde0e2007-04-05 12:13:21 -040044{
Chris Mason7fcde0e2007-04-05 12:13:21 -040045 int ret;
Chris Mason7e381802007-04-19 15:36:27 -040046 char *ptr;
47 struct btrfs_item *item;
Chris Mason5f39d392007-10-15 16:14:19 -040048 struct extent_buffer *leaf;
Chris Mason7fcde0e2007-04-05 12:13:21 -040049
50 ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);
Chris Mason7e381802007-04-19 15:36:27 -040051 if (ret == -EEXIST) {
Chris Masone06afa82007-05-23 15:44:28 -040052 struct btrfs_dir_item *di;
53 di = btrfs_match_dir_item_name(root, path, name, name_len);
54 if (di)
55 return ERR_PTR(-EEXIST);
Tsutomu Itoh4b90c682013-04-16 05:18:49 +000056 btrfs_extend_item(root, path, data_size);
Jeff Mahoney143bede2012-03-01 14:56:26 +010057 } else if (ret < 0)
Chris Mason54aa1f42007-06-22 14:16:25 -040058 return ERR_PTR(ret);
Chris Mason7e381802007-04-19 15:36:27 -040059 WARN_ON(ret > 0);
Chris Mason5f39d392007-10-15 16:14:19 -040060 leaf = path->nodes[0];
Ross Kirkdd3cc162013-09-16 15:58:09 +010061 item = btrfs_item_nr(path->slots[0]);
Chris Mason7e381802007-04-19 15:36:27 -040062 ptr = btrfs_item_ptr(leaf, path->slots[0], char);
Chris Mason5f39d392007-10-15 16:14:19 -040063 BUG_ON(data_size > btrfs_item_size(leaf, item));
64 ptr += btrfs_item_size(leaf, item) - data_size;
Chris Mason7e381802007-04-19 15:36:27 -040065 return (struct btrfs_dir_item *)ptr;
Chris Mason7fcde0e2007-04-05 12:13:21 -040066}
67
Chris Masond352ac62008-09-29 15:18:18 -040068/*
69 * xattrs work a lot like directories, this inserts an xattr item
70 * into the tree
71 */
Josef Bacik5103e942007-11-16 11:45:54 -050072int btrfs_insert_xattr_item(struct btrfs_trans_handle *trans,
Yan, Zhengf34f57a2009-11-12 09:35:27 +000073 struct btrfs_root *root,
74 struct btrfs_path *path, u64 objectid,
75 const char *name, u16 name_len,
76 const void *data, u16 data_len)
Josef Bacik5103e942007-11-16 11:45:54 -050077{
78 int ret = 0;
Josef Bacik5103e942007-11-16 11:45:54 -050079 struct btrfs_dir_item *dir_item;
80 unsigned long name_ptr, data_ptr;
81 struct btrfs_key key, location;
82 struct btrfs_disk_key disk_key;
83 struct extent_buffer *leaf;
84 u32 data_size;
85
Yan, Zhengf34f57a2009-11-12 09:35:27 +000086 BUG_ON(name_len + data_len > BTRFS_MAX_XATTR_SIZE(root));
87
88 key.objectid = objectid;
David Sterba962a2982014-06-04 18:41:45 +020089 key.type = BTRFS_XATTR_ITEM_KEY;
David Millerdf68b8a2008-02-15 10:40:52 -050090 key.offset = btrfs_name_hash(name, name_len);
Josef Bacik5103e942007-11-16 11:45:54 -050091
92 data_size = sizeof(*dir_item) + name_len + data_len;
93 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
94 name, name_len);
Josef Bacikfa092002011-05-27 12:06:11 -040095 if (IS_ERR(dir_item))
96 return PTR_ERR(dir_item);
Josef Bacik5103e942007-11-16 11:45:54 -050097 memset(&location, 0, sizeof(location));
98
99 leaf = path->nodes[0];
100 btrfs_cpu_key_to_disk(&disk_key, &location);
101 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
102 btrfs_set_dir_type(leaf, dir_item, BTRFS_FT_XATTR);
103 btrfs_set_dir_name_len(leaf, dir_item, name_len);
Chris Masone02119d2008-09-05 16:13:11 -0400104 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
Josef Bacik5103e942007-11-16 11:45:54 -0500105 btrfs_set_dir_data_len(leaf, dir_item, data_len);
106 name_ptr = (unsigned long)(dir_item + 1);
107 data_ptr = (unsigned long)((char *)name_ptr + name_len);
108
109 write_extent_buffer(leaf, name, name_ptr, name_len);
110 write_extent_buffer(leaf, data, data_ptr, data_len);
111 btrfs_mark_buffer_dirty(path->nodes[0]);
112
Josef Bacik5103e942007-11-16 11:45:54 -0500113 return ret;
114}
115
Chris Masond352ac62008-09-29 15:18:18 -0400116/*
117 * insert a directory item in the tree, doing all the magic for
118 * both indexes. 'dir' indicates which objectid to insert it into,
119 * 'location' is the key to stuff into the directory item, 'type' is the
120 * type of the inode we're pointing to, and 'index' is the sequence number
121 * to use for the second index (if one is created).
Jeff Mahoney79787ea2012-03-12 16:03:00 +0100122 * Will return 0 or -ENOMEM
Chris Masond352ac62008-09-29 15:18:18 -0400123 */
Chris Masone089f052007-03-16 16:20:31 -0400124int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
Miao Xie16cdcec2011-04-22 18:12:22 +0800125 *root, const char *name, int name_len,
126 struct inode *dir, struct btrfs_key *location,
127 u8 type, u64 index)
Chris Mason62e27492007-03-15 12:56:47 -0400128{
129 int ret = 0;
Chris Masone06afa82007-05-23 15:44:28 -0400130 int ret2 = 0;
Chris Mason5caf2a02007-04-02 11:20:42 -0400131 struct btrfs_path *path;
Chris Mason62e27492007-03-15 12:56:47 -0400132 struct btrfs_dir_item *dir_item;
Chris Mason5f39d392007-10-15 16:14:19 -0400133 struct extent_buffer *leaf;
134 unsigned long name_ptr;
Chris Mason62e27492007-03-15 12:56:47 -0400135 struct btrfs_key key;
Chris Mason5f39d392007-10-15 16:14:19 -0400136 struct btrfs_disk_key disk_key;
Chris Mason62e27492007-03-15 12:56:47 -0400137 u32 data_size;
138
Chris Mason0d0ca302011-05-22 07:11:22 -0400139 key.objectid = btrfs_ino(dir);
David Sterba962a2982014-06-04 18:41:45 +0200140 key.type = BTRFS_DIR_ITEM_KEY;
David Millerdf68b8a2008-02-15 10:40:52 -0500141 key.offset = btrfs_name_hash(name, name_len);
Chris Masonb9473432009-03-13 11:00:37 -0400142
Chris Mason5caf2a02007-04-02 11:20:42 -0400143 path = btrfs_alloc_path();
Miao Xie16cdcec2011-04-22 18:12:22 +0800144 if (!path)
145 return -ENOMEM;
Chris Masonb9473432009-03-13 11:00:37 -0400146 path->leave_spinning = 1;
147
Miao Xie16cdcec2011-04-22 18:12:22 +0800148 btrfs_cpu_key_to_disk(&disk_key, location);
149
Chris Mason62e27492007-03-15 12:56:47 -0400150 data_size = sizeof(*dir_item) + name_len;
Chris Masone06afa82007-05-23 15:44:28 -0400151 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
152 name, name_len);
Chris Mason7e381802007-04-19 15:36:27 -0400153 if (IS_ERR(dir_item)) {
154 ret = PTR_ERR(dir_item);
Chris Masone06afa82007-05-23 15:44:28 -0400155 if (ret == -EEXIST)
156 goto second_insert;
Tsutomu Itohc2db1072011-03-01 06:48:31 +0000157 goto out_free;
Chris Mason7e381802007-04-19 15:36:27 -0400158 }
Chris Mason62e27492007-03-15 12:56:47 -0400159
Chris Mason5f39d392007-10-15 16:14:19 -0400160 leaf = path->nodes[0];
Chris Mason5f39d392007-10-15 16:14:19 -0400161 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
162 btrfs_set_dir_type(leaf, dir_item, type);
Josef Bacik5103e942007-11-16 11:45:54 -0500163 btrfs_set_dir_data_len(leaf, dir_item, 0);
Chris Mason5f39d392007-10-15 16:14:19 -0400164 btrfs_set_dir_name_len(leaf, dir_item, name_len);
Chris Masone02119d2008-09-05 16:13:11 -0400165 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
Chris Mason5f39d392007-10-15 16:14:19 -0400166 name_ptr = (unsigned long)(dir_item + 1);
Chris Masonc5739bb2007-04-10 09:27:04 -0400167
Chris Mason5f39d392007-10-15 16:14:19 -0400168 write_extent_buffer(leaf, name, name_ptr, name_len);
169 btrfs_mark_buffer_dirty(leaf);
Chris Mason7e381802007-04-19 15:36:27 -0400170
Chris Masone06afa82007-05-23 15:44:28 -0400171second_insert:
Chris Mason7e381802007-04-19 15:36:27 -0400172 /* FIXME, use some real flag for selecting the extra index */
173 if (root == root->fs_info->tree_root) {
174 ret = 0;
Tsutomu Itohc2db1072011-03-01 06:48:31 +0000175 goto out_free;
Chris Mason7e381802007-04-19 15:36:27 -0400176 }
David Sterbab3b4aa72011-04-21 01:20:15 +0200177 btrfs_release_path(path);
Chris Mason7e381802007-04-19 15:36:27 -0400178
Miao Xie16cdcec2011-04-22 18:12:22 +0800179 ret2 = btrfs_insert_delayed_dir_index(trans, root, name, name_len, dir,
180 &disk_key, type, index);
Tsutomu Itohc2db1072011-03-01 06:48:31 +0000181out_free:
Chris Mason5caf2a02007-04-02 11:20:42 -0400182 btrfs_free_path(path);
Chris Masone06afa82007-05-23 15:44:28 -0400183 if (ret)
184 return ret;
185 if (ret2)
186 return ret2;
187 return 0;
Chris Mason62e27492007-03-15 12:56:47 -0400188}
189
Chris Masond352ac62008-09-29 15:18:18 -0400190/*
191 * lookup a directory item based on name. 'dir' is the objectid
192 * we're searching in, and 'mod' tells us if you plan on deleting the
193 * item (use mod < 0) or changing the options (use mod > 0)
194 */
Chris Mason7e381802007-04-19 15:36:27 -0400195struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans,
196 struct btrfs_root *root,
197 struct btrfs_path *path, u64 dir,
198 const char *name, int name_len,
199 int mod)
Chris Mason62e27492007-03-15 12:56:47 -0400200{
Chris Mason1d4f6402007-03-15 15:18:43 -0400201 int ret;
Chris Mason62e27492007-03-15 12:56:47 -0400202 struct btrfs_key key;
Chris Mason1d4f6402007-03-15 15:18:43 -0400203 int ins_len = mod < 0 ? -1 : 0;
204 int cow = mod != 0;
Chris Mason62e27492007-03-15 12:56:47 -0400205
206 key.objectid = dir;
David Sterba962a2982014-06-04 18:41:45 +0200207 key.type = BTRFS_DIR_ITEM_KEY;
Chris Mason5f39d392007-10-15 16:14:19 -0400208
David Millerdf68b8a2008-02-15 10:40:52 -0500209 key.offset = btrfs_name_hash(name, name_len);
Chris Mason5f39d392007-10-15 16:14:19 -0400210
Chris Mason7e381802007-04-19 15:36:27 -0400211 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
212 if (ret < 0)
213 return ERR_PTR(ret);
Li Zefan85d85a72011-07-14 03:17:52 +0000214 if (ret > 0)
Chris Mason7e381802007-04-19 15:36:27 -0400215 return NULL;
216
217 return btrfs_match_dir_item_name(root, path, name, name_len);
Chris Mason62e27492007-03-15 12:56:47 -0400218}
219
Chris Mason9c520572012-12-17 14:26:57 -0500220int btrfs_check_dir_item_collision(struct btrfs_root *root, u64 dir,
221 const char *name, int name_len)
222{
223 int ret;
224 struct btrfs_key key;
225 struct btrfs_dir_item *di;
226 int data_size;
227 struct extent_buffer *leaf;
228 int slot;
229 struct btrfs_path *path;
230
231
232 path = btrfs_alloc_path();
233 if (!path)
234 return -ENOMEM;
235
236 key.objectid = dir;
David Sterba962a2982014-06-04 18:41:45 +0200237 key.type = BTRFS_DIR_ITEM_KEY;
Chris Mason9c520572012-12-17 14:26:57 -0500238 key.offset = btrfs_name_hash(name, name_len);
239
240 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
241
242 /* return back any errors */
243 if (ret < 0)
244 goto out;
245
246 /* nothing found, we're safe */
247 if (ret > 0) {
248 ret = 0;
249 goto out;
250 }
251
252 /* we found an item, look for our name in the item */
253 di = btrfs_match_dir_item_name(root, path, name, name_len);
254 if (di) {
255 /* our exact name was found */
256 ret = -EEXIST;
257 goto out;
258 }
259
260 /*
261 * see if there is room in the item to insert this
262 * name
263 */
Filipe David Borba Manana878f2d22013-11-27 16:06:16 +0000264 data_size = sizeof(*di) + name_len;
Chris Mason9c520572012-12-17 14:26:57 -0500265 leaf = path->nodes[0];
266 slot = path->slots[0];
267 if (data_size + btrfs_item_size_nr(leaf, slot) +
268 sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(root)) {
269 ret = -EOVERFLOW;
270 } else {
271 /* plenty of insertion room */
272 ret = 0;
273 }
274out:
275 btrfs_free_path(path);
276 return ret;
277}
278
Chris Masond352ac62008-09-29 15:18:18 -0400279/*
280 * lookup a directory item based on index. 'dir' is the objectid
281 * we're searching in, and 'mod' tells us if you plan on deleting the
282 * item (use mod < 0) or changing the options (use mod > 0)
283 *
284 * The name is used to make sure the index really points to the name you were
285 * looking for.
286 */
Chris Mason7e381802007-04-19 15:36:27 -0400287struct btrfs_dir_item *
288btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans,
289 struct btrfs_root *root,
290 struct btrfs_path *path, u64 dir,
291 u64 objectid, const char *name, int name_len,
292 int mod)
293{
294 int ret;
295 struct btrfs_key key;
296 int ins_len = mod < 0 ? -1 : 0;
297 int cow = mod != 0;
298
299 key.objectid = dir;
David Sterba962a2982014-06-04 18:41:45 +0200300 key.type = BTRFS_DIR_INDEX_KEY;
Chris Mason7e381802007-04-19 15:36:27 -0400301 key.offset = objectid;
302
303 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
304 if (ret < 0)
305 return ERR_PTR(ret);
306 if (ret > 0)
307 return ERR_PTR(-ENOENT);
308 return btrfs_match_dir_item_name(root, path, name, name_len);
309}
310
Yan, Zheng4df27c4d2009-09-21 15:56:00 -0400311struct btrfs_dir_item *
312btrfs_search_dir_index_item(struct btrfs_root *root,
313 struct btrfs_path *path, u64 dirid,
314 const char *name, int name_len)
315{
316 struct extent_buffer *leaf;
317 struct btrfs_dir_item *di;
318 struct btrfs_key key;
319 u32 nritems;
320 int ret;
321
322 key.objectid = dirid;
323 key.type = BTRFS_DIR_INDEX_KEY;
324 key.offset = 0;
325
326 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
327 if (ret < 0)
328 return ERR_PTR(ret);
329
330 leaf = path->nodes[0];
331 nritems = btrfs_header_nritems(leaf);
332
333 while (1) {
334 if (path->slots[0] >= nritems) {
335 ret = btrfs_next_leaf(root, path);
336 if (ret < 0)
337 return ERR_PTR(ret);
338 if (ret > 0)
339 break;
340 leaf = path->nodes[0];
341 nritems = btrfs_header_nritems(leaf);
342 continue;
343 }
344
345 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
346 if (key.objectid != dirid || key.type != BTRFS_DIR_INDEX_KEY)
347 break;
348
349 di = btrfs_match_dir_item_name(root, path, name, name_len);
350 if (di)
351 return di;
352
353 path->slots[0]++;
354 }
355 return NULL;
356}
357
Josef Bacik5103e942007-11-16 11:45:54 -0500358struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans,
359 struct btrfs_root *root,
360 struct btrfs_path *path, u64 dir,
361 const char *name, u16 name_len,
362 int mod)
363{
364 int ret;
365 struct btrfs_key key;
366 int ins_len = mod < 0 ? -1 : 0;
367 int cow = mod != 0;
Josef Bacik5103e942007-11-16 11:45:54 -0500368
369 key.objectid = dir;
David Sterba962a2982014-06-04 18:41:45 +0200370 key.type = BTRFS_XATTR_ITEM_KEY;
David Millerdf68b8a2008-02-15 10:40:52 -0500371 key.offset = btrfs_name_hash(name, name_len);
Josef Bacik5103e942007-11-16 11:45:54 -0500372 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
373 if (ret < 0)
374 return ERR_PTR(ret);
Li Zefan85d85a72011-07-14 03:17:52 +0000375 if (ret > 0)
Josef Bacik5103e942007-11-16 11:45:54 -0500376 return NULL;
377
378 return btrfs_match_dir_item_name(root, path, name, name_len);
379}
380
Chris Masond352ac62008-09-29 15:18:18 -0400381/*
382 * helper function to look at the directory item pointed to by 'path'
383 * this walks through all the entries in a dir item and finds one
384 * for a specific name.
385 */
Eric Sandeen48a3b632013-04-25 20:41:01 +0000386static struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root,
Chris Mason7f5c1512007-03-23 15:56:19 -0400387 struct btrfs_path *path,
388 const char *name, int name_len)
Chris Mason62e27492007-03-15 12:56:47 -0400389{
Chris Mason62e27492007-03-15 12:56:47 -0400390 struct btrfs_dir_item *dir_item;
Chris Mason5f39d392007-10-15 16:14:19 -0400391 unsigned long name_ptr;
Chris Mason7e381802007-04-19 15:36:27 -0400392 u32 total_len;
393 u32 cur = 0;
394 u32 this_len;
Chris Mason5f39d392007-10-15 16:14:19 -0400395 struct extent_buffer *leaf;
Chris Masona8a2ee02007-03-16 08:46:49 -0400396
Chris Mason5f39d392007-10-15 16:14:19 -0400397 leaf = path->nodes[0];
Chris Mason7e381802007-04-19 15:36:27 -0400398 dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);
Josef Bacik22a94d42011-03-16 16:47:17 -0400399 if (verify_dir_item(root, leaf, dir_item))
400 return NULL;
401
Chris Mason5f39d392007-10-15 16:14:19 -0400402 total_len = btrfs_item_size_nr(leaf, path->slots[0]);
Chris Masond3977122009-01-05 21:25:51 -0500403 while (cur < total_len) {
Chris Mason5f39d392007-10-15 16:14:19 -0400404 this_len = sizeof(*dir_item) +
Josef Bacik5103e942007-11-16 11:45:54 -0500405 btrfs_dir_name_len(leaf, dir_item) +
406 btrfs_dir_data_len(leaf, dir_item);
Chris Mason5f39d392007-10-15 16:14:19 -0400407 name_ptr = (unsigned long)(dir_item + 1);
Chris Mason7e381802007-04-19 15:36:27 -0400408
Chris Mason5f39d392007-10-15 16:14:19 -0400409 if (btrfs_dir_name_len(leaf, dir_item) == name_len &&
410 memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0)
Chris Mason7e381802007-04-19 15:36:27 -0400411 return dir_item;
412
413 cur += this_len;
414 dir_item = (struct btrfs_dir_item *)((char *)dir_item +
415 this_len);
416 }
417 return NULL;
Chris Mason62e27492007-03-15 12:56:47 -0400418}
Chris Mason7e381802007-04-19 15:36:27 -0400419
Chris Masond352ac62008-09-29 15:18:18 -0400420/*
421 * given a pointer into a directory item, delete it. This
422 * handles items that have more than one entry in them.
423 */
Chris Mason7e381802007-04-19 15:36:27 -0400424int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans,
425 struct btrfs_root *root,
426 struct btrfs_path *path,
427 struct btrfs_dir_item *di)
428{
429
Chris Mason5f39d392007-10-15 16:14:19 -0400430 struct extent_buffer *leaf;
Chris Mason7e381802007-04-19 15:36:27 -0400431 u32 sub_item_len;
432 u32 item_len;
Chris Mason54aa1f42007-06-22 14:16:25 -0400433 int ret = 0;
Chris Mason7e381802007-04-19 15:36:27 -0400434
Chris Mason5f39d392007-10-15 16:14:19 -0400435 leaf = path->nodes[0];
Josef Bacik5103e942007-11-16 11:45:54 -0500436 sub_item_len = sizeof(*di) + btrfs_dir_name_len(leaf, di) +
437 btrfs_dir_data_len(leaf, di);
Chris Mason5f39d392007-10-15 16:14:19 -0400438 item_len = btrfs_item_size_nr(leaf, path->slots[0]);
439 if (sub_item_len == item_len) {
Chris Mason7e381802007-04-19 15:36:27 -0400440 ret = btrfs_del_item(trans, root, path);
Chris Mason7e381802007-04-19 15:36:27 -0400441 } else {
Chris Mason5f39d392007-10-15 16:14:19 -0400442 /* MARKER */
443 unsigned long ptr = (unsigned long)di;
444 unsigned long start;
445
446 start = btrfs_item_ptr_offset(leaf, path->slots[0]);
447 memmove_extent_buffer(leaf, ptr, ptr + sub_item_len,
Chris Mason7e381802007-04-19 15:36:27 -0400448 item_len - (ptr + sub_item_len - start));
Tsutomu Itohafe5fea2013-04-16 05:18:22 +0000449 btrfs_truncate_item(root, path, item_len - sub_item_len, 1);
Chris Mason7e381802007-04-19 15:36:27 -0400450 }
Andi Kleen411fc6b2010-10-29 15:14:31 -0400451 return ret;
Chris Mason7e381802007-04-19 15:36:27 -0400452}
Josef Bacik22a94d42011-03-16 16:47:17 -0400453
454int verify_dir_item(struct btrfs_root *root,
455 struct extent_buffer *leaf,
456 struct btrfs_dir_item *dir_item)
457{
458 u16 namelen = BTRFS_NAME_LEN;
459 u8 type = btrfs_dir_type(leaf, dir_item);
460
461 if (type >= BTRFS_FT_MAX) {
Frank Holtonefe120a2013-12-20 11:37:06 -0500462 btrfs_crit(root->fs_info, "invalid dir item type: %d",
Josef Bacik22a94d42011-03-16 16:47:17 -0400463 (int)type);
464 return 1;
465 }
466
467 if (type == BTRFS_FT_XATTR)
468 namelen = XATTR_NAME_MAX;
469
470 if (btrfs_dir_name_len(leaf, dir_item) > namelen) {
Frank Holtonefe120a2013-12-20 11:37:06 -0500471 btrfs_crit(root->fs_info, "invalid dir item name len: %u",
Josef Bacik22a94d42011-03-16 16:47:17 -0400472 (unsigned)btrfs_dir_data_len(leaf, dir_item));
473 return 1;
474 }
475
476 /* BTRFS_MAX_XATTR_SIZE is the same for all dir items */
Filipe David Borba Mananae46f5382013-10-28 16:28:30 +0000477 if ((btrfs_dir_data_len(leaf, dir_item) +
478 btrfs_dir_name_len(leaf, dir_item)) > BTRFS_MAX_XATTR_SIZE(root)) {
Frank Holtonefe120a2013-12-20 11:37:06 -0500479 btrfs_crit(root->fs_info, "invalid dir item name + data len: %u + %u",
Filipe David Borba Mananae46f5382013-10-28 16:28:30 +0000480 (unsigned)btrfs_dir_name_len(leaf, dir_item),
Josef Bacik22a94d42011-03-16 16:47:17 -0400481 (unsigned)btrfs_dir_data_len(leaf, dir_item));
482 return 1;
483 }
484
485 return 0;
486}