blob: c1a074d0696ff897258c576c127af7fd8d513846 [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);
Jeff Mahoney143bede2012-03-01 14:56:26 +010052 btrfs_extend_item(trans, root, path, data_size);
53 } else if (ret < 0)
Chris Mason54aa1f42007-06-22 14:16:25 -040054 return ERR_PTR(ret);
Chris Mason7e381802007-04-19 15:36:27 -040055 WARN_ON(ret > 0);
Chris Mason5f39d392007-10-15 16:14:19 -040056 leaf = path->nodes[0];
57 item = btrfs_item_nr(leaf, path->slots[0]);
Chris Mason7e381802007-04-19 15:36:27 -040058 ptr = btrfs_item_ptr(leaf, path->slots[0], char);
Chris Mason5f39d392007-10-15 16:14:19 -040059 BUG_ON(data_size > btrfs_item_size(leaf, item));
60 ptr += btrfs_item_size(leaf, item) - data_size;
Chris Mason7e381802007-04-19 15:36:27 -040061 return (struct btrfs_dir_item *)ptr;
Chris Mason7fcde0e2007-04-05 12:13:21 -040062}
63
Chris Masond352ac62008-09-29 15:18:18 -040064/*
65 * xattrs work a lot like directories, this inserts an xattr item
66 * into the tree
67 */
Josef Bacik5103e942007-11-16 11:45:54 -050068int btrfs_insert_xattr_item(struct btrfs_trans_handle *trans,
Yan, Zhengf34f57a2009-11-12 09:35:27 +000069 struct btrfs_root *root,
70 struct btrfs_path *path, u64 objectid,
71 const char *name, u16 name_len,
72 const void *data, u16 data_len)
Josef Bacik5103e942007-11-16 11:45:54 -050073{
74 int ret = 0;
Josef Bacik5103e942007-11-16 11:45:54 -050075 struct btrfs_dir_item *dir_item;
76 unsigned long name_ptr, data_ptr;
77 struct btrfs_key key, location;
78 struct btrfs_disk_key disk_key;
79 struct extent_buffer *leaf;
80 u32 data_size;
81
Yan, Zhengf34f57a2009-11-12 09:35:27 +000082 BUG_ON(name_len + data_len > BTRFS_MAX_XATTR_SIZE(root));
83
84 key.objectid = objectid;
Josef Bacik5103e942007-11-16 11:45:54 -050085 btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY);
David Millerdf68b8a2008-02-15 10:40:52 -050086 key.offset = btrfs_name_hash(name, name_len);
Josef Bacik5103e942007-11-16 11:45:54 -050087
88 data_size = sizeof(*dir_item) + name_len + data_len;
89 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
90 name, name_len);
Josef Bacikfa092002011-05-27 12:06:11 -040091 if (IS_ERR(dir_item))
92 return PTR_ERR(dir_item);
Josef Bacik5103e942007-11-16 11:45:54 -050093 memset(&location, 0, sizeof(location));
94
95 leaf = path->nodes[0];
96 btrfs_cpu_key_to_disk(&disk_key, &location);
97 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
98 btrfs_set_dir_type(leaf, dir_item, BTRFS_FT_XATTR);
99 btrfs_set_dir_name_len(leaf, dir_item, name_len);
Chris Masone02119d2008-09-05 16:13:11 -0400100 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
Josef Bacik5103e942007-11-16 11:45:54 -0500101 btrfs_set_dir_data_len(leaf, dir_item, data_len);
102 name_ptr = (unsigned long)(dir_item + 1);
103 data_ptr = (unsigned long)((char *)name_ptr + name_len);
104
105 write_extent_buffer(leaf, name, name_ptr, name_len);
106 write_extent_buffer(leaf, data, data_ptr, data_len);
107 btrfs_mark_buffer_dirty(path->nodes[0]);
108
Josef Bacik5103e942007-11-16 11:45:54 -0500109 return ret;
110}
111
Chris Masond352ac62008-09-29 15:18:18 -0400112/*
113 * insert a directory item in the tree, doing all the magic for
114 * both indexes. 'dir' indicates which objectid to insert it into,
115 * 'location' is the key to stuff into the directory item, 'type' is the
116 * type of the inode we're pointing to, and 'index' is the sequence number
117 * to use for the second index (if one is created).
Jeff Mahoney79787ea2012-03-12 16:03:00 +0100118 * Will return 0 or -ENOMEM
Chris Masond352ac62008-09-29 15:18:18 -0400119 */
Chris Masone089f052007-03-16 16:20:31 -0400120int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
Miao Xie16cdcec2011-04-22 18:12:22 +0800121 *root, const char *name, int name_len,
122 struct inode *dir, struct btrfs_key *location,
123 u8 type, u64 index)
Chris Mason62e27492007-03-15 12:56:47 -0400124{
125 int ret = 0;
Chris Masone06afa82007-05-23 15:44:28 -0400126 int ret2 = 0;
Chris Mason5caf2a02007-04-02 11:20:42 -0400127 struct btrfs_path *path;
Chris Mason62e27492007-03-15 12:56:47 -0400128 struct btrfs_dir_item *dir_item;
Chris Mason5f39d392007-10-15 16:14:19 -0400129 struct extent_buffer *leaf;
130 unsigned long name_ptr;
Chris Mason62e27492007-03-15 12:56:47 -0400131 struct btrfs_key key;
Chris Mason5f39d392007-10-15 16:14:19 -0400132 struct btrfs_disk_key disk_key;
Chris Mason62e27492007-03-15 12:56:47 -0400133 u32 data_size;
134
Chris Mason0d0ca302011-05-22 07:11:22 -0400135 key.objectid = btrfs_ino(dir);
Chris Mason1d4f6402007-03-15 15:18:43 -0400136 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
David Millerdf68b8a2008-02-15 10:40:52 -0500137 key.offset = btrfs_name_hash(name, name_len);
Chris Masonb9473432009-03-13 11:00:37 -0400138
Chris Mason5caf2a02007-04-02 11:20:42 -0400139 path = btrfs_alloc_path();
Miao Xie16cdcec2011-04-22 18:12:22 +0800140 if (!path)
141 return -ENOMEM;
Chris Masonb9473432009-03-13 11:00:37 -0400142 path->leave_spinning = 1;
143
Miao Xie16cdcec2011-04-22 18:12:22 +0800144 btrfs_cpu_key_to_disk(&disk_key, location);
145
Chris Mason62e27492007-03-15 12:56:47 -0400146 data_size = sizeof(*dir_item) + name_len;
Chris Masone06afa82007-05-23 15:44:28 -0400147 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
148 name, name_len);
Chris Mason7e381802007-04-19 15:36:27 -0400149 if (IS_ERR(dir_item)) {
150 ret = PTR_ERR(dir_item);
Chris Masone06afa82007-05-23 15:44:28 -0400151 if (ret == -EEXIST)
152 goto second_insert;
Tsutomu Itohc2db1072011-03-01 06:48:31 +0000153 goto out_free;
Chris Mason7e381802007-04-19 15:36:27 -0400154 }
Chris Mason62e27492007-03-15 12:56:47 -0400155
Chris Mason5f39d392007-10-15 16:14:19 -0400156 leaf = path->nodes[0];
Chris Mason5f39d392007-10-15 16:14:19 -0400157 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
158 btrfs_set_dir_type(leaf, dir_item, type);
Josef Bacik5103e942007-11-16 11:45:54 -0500159 btrfs_set_dir_data_len(leaf, dir_item, 0);
Chris Mason5f39d392007-10-15 16:14:19 -0400160 btrfs_set_dir_name_len(leaf, dir_item, name_len);
Chris Masone02119d2008-09-05 16:13:11 -0400161 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
Chris Mason5f39d392007-10-15 16:14:19 -0400162 name_ptr = (unsigned long)(dir_item + 1);
Chris Masonc5739bb2007-04-10 09:27:04 -0400163
Chris Mason5f39d392007-10-15 16:14:19 -0400164 write_extent_buffer(leaf, name, name_ptr, name_len);
165 btrfs_mark_buffer_dirty(leaf);
Chris Mason7e381802007-04-19 15:36:27 -0400166
Chris Masone06afa82007-05-23 15:44:28 -0400167second_insert:
Chris Mason7e381802007-04-19 15:36:27 -0400168 /* FIXME, use some real flag for selecting the extra index */
169 if (root == root->fs_info->tree_root) {
170 ret = 0;
Tsutomu Itohc2db1072011-03-01 06:48:31 +0000171 goto out_free;
Chris Mason7e381802007-04-19 15:36:27 -0400172 }
David Sterbab3b4aa72011-04-21 01:20:15 +0200173 btrfs_release_path(path);
Chris Mason7e381802007-04-19 15:36:27 -0400174
Miao Xie16cdcec2011-04-22 18:12:22 +0800175 ret2 = btrfs_insert_delayed_dir_index(trans, root, name, name_len, dir,
176 &disk_key, type, index);
Tsutomu Itohc2db1072011-03-01 06:48:31 +0000177out_free:
Chris Mason5caf2a02007-04-02 11:20:42 -0400178 btrfs_free_path(path);
Chris Masone06afa82007-05-23 15:44:28 -0400179 if (ret)
180 return ret;
181 if (ret2)
182 return ret2;
183 return 0;
Chris Mason62e27492007-03-15 12:56:47 -0400184}
185
Chris Masond352ac62008-09-29 15:18:18 -0400186/*
187 * lookup a directory item based on name. 'dir' is the objectid
188 * we're searching in, and 'mod' tells us if you plan on deleting the
189 * item (use mod < 0) or changing the options (use mod > 0)
190 */
Chris Mason7e381802007-04-19 15:36:27 -0400191struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans,
192 struct btrfs_root *root,
193 struct btrfs_path *path, u64 dir,
194 const char *name, int name_len,
195 int mod)
Chris Mason62e27492007-03-15 12:56:47 -0400196{
Chris Mason1d4f6402007-03-15 15:18:43 -0400197 int ret;
Chris Mason62e27492007-03-15 12:56:47 -0400198 struct btrfs_key key;
Chris Mason1d4f6402007-03-15 15:18:43 -0400199 int ins_len = mod < 0 ? -1 : 0;
200 int cow = mod != 0;
Chris Mason62e27492007-03-15 12:56:47 -0400201
202 key.objectid = dir;
Chris Mason1d4f6402007-03-15 15:18:43 -0400203 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
Chris Mason5f39d392007-10-15 16:14:19 -0400204
David Millerdf68b8a2008-02-15 10:40:52 -0500205 key.offset = btrfs_name_hash(name, name_len);
Chris Mason5f39d392007-10-15 16:14:19 -0400206
Chris Mason7e381802007-04-19 15:36:27 -0400207 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
208 if (ret < 0)
209 return ERR_PTR(ret);
Li Zefan85d85a72011-07-14 03:17:52 +0000210 if (ret > 0)
Chris Mason7e381802007-04-19 15:36:27 -0400211 return NULL;
212
213 return btrfs_match_dir_item_name(root, path, name, name_len);
Chris Mason62e27492007-03-15 12:56:47 -0400214}
215
Chris Masond352ac62008-09-29 15:18:18 -0400216/*
217 * lookup a directory item based on index. 'dir' is the objectid
218 * we're searching in, and 'mod' tells us if you plan on deleting the
219 * item (use mod < 0) or changing the options (use mod > 0)
220 *
221 * The name is used to make sure the index really points to the name you were
222 * looking for.
223 */
Chris Mason7e381802007-04-19 15:36:27 -0400224struct btrfs_dir_item *
225btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans,
226 struct btrfs_root *root,
227 struct btrfs_path *path, u64 dir,
228 u64 objectid, const char *name, int name_len,
229 int mod)
230{
231 int ret;
232 struct btrfs_key key;
233 int ins_len = mod < 0 ? -1 : 0;
234 int cow = mod != 0;
235
236 key.objectid = dir;
Chris Mason7e381802007-04-19 15:36:27 -0400237 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
238 key.offset = objectid;
239
240 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
241 if (ret < 0)
242 return ERR_PTR(ret);
243 if (ret > 0)
244 return ERR_PTR(-ENOENT);
245 return btrfs_match_dir_item_name(root, path, name, name_len);
246}
247
Yan, Zheng4df27c4d2009-09-21 15:56:00 -0400248struct btrfs_dir_item *
249btrfs_search_dir_index_item(struct btrfs_root *root,
250 struct btrfs_path *path, u64 dirid,
251 const char *name, int name_len)
252{
253 struct extent_buffer *leaf;
254 struct btrfs_dir_item *di;
255 struct btrfs_key key;
256 u32 nritems;
257 int ret;
258
259 key.objectid = dirid;
260 key.type = BTRFS_DIR_INDEX_KEY;
261 key.offset = 0;
262
263 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
264 if (ret < 0)
265 return ERR_PTR(ret);
266
267 leaf = path->nodes[0];
268 nritems = btrfs_header_nritems(leaf);
269
270 while (1) {
271 if (path->slots[0] >= nritems) {
272 ret = btrfs_next_leaf(root, path);
273 if (ret < 0)
274 return ERR_PTR(ret);
275 if (ret > 0)
276 break;
277 leaf = path->nodes[0];
278 nritems = btrfs_header_nritems(leaf);
279 continue;
280 }
281
282 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
283 if (key.objectid != dirid || key.type != BTRFS_DIR_INDEX_KEY)
284 break;
285
286 di = btrfs_match_dir_item_name(root, path, name, name_len);
287 if (di)
288 return di;
289
290 path->slots[0]++;
291 }
292 return NULL;
293}
294
Josef Bacik5103e942007-11-16 11:45:54 -0500295struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans,
296 struct btrfs_root *root,
297 struct btrfs_path *path, u64 dir,
298 const char *name, u16 name_len,
299 int mod)
300{
301 int ret;
302 struct btrfs_key key;
303 int ins_len = mod < 0 ? -1 : 0;
304 int cow = mod != 0;
Josef Bacik5103e942007-11-16 11:45:54 -0500305
306 key.objectid = dir;
307 btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY);
David Millerdf68b8a2008-02-15 10:40:52 -0500308 key.offset = btrfs_name_hash(name, name_len);
Josef Bacik5103e942007-11-16 11:45:54 -0500309 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
310 if (ret < 0)
311 return ERR_PTR(ret);
Li Zefan85d85a72011-07-14 03:17:52 +0000312 if (ret > 0)
Josef Bacik5103e942007-11-16 11:45:54 -0500313 return NULL;
314
315 return btrfs_match_dir_item_name(root, path, name, name_len);
316}
317
Chris Masond352ac62008-09-29 15:18:18 -0400318/*
319 * helper function to look at the directory item pointed to by 'path'
320 * this walks through all the entries in a dir item and finds one
321 * for a specific name.
322 */
Chris Mason7e381802007-04-19 15:36:27 -0400323struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root,
Chris Mason7f5c1512007-03-23 15:56:19 -0400324 struct btrfs_path *path,
325 const char *name, int name_len)
Chris Mason62e27492007-03-15 12:56:47 -0400326{
Chris Mason62e27492007-03-15 12:56:47 -0400327 struct btrfs_dir_item *dir_item;
Chris Mason5f39d392007-10-15 16:14:19 -0400328 unsigned long name_ptr;
Chris Mason7e381802007-04-19 15:36:27 -0400329 u32 total_len;
330 u32 cur = 0;
331 u32 this_len;
Chris Mason5f39d392007-10-15 16:14:19 -0400332 struct extent_buffer *leaf;
Chris Masona8a2ee02007-03-16 08:46:49 -0400333
Chris Mason5f39d392007-10-15 16:14:19 -0400334 leaf = path->nodes[0];
Chris Mason7e381802007-04-19 15:36:27 -0400335 dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);
Josef Bacik22a94d42011-03-16 16:47:17 -0400336 if (verify_dir_item(root, leaf, dir_item))
337 return NULL;
338
Chris Mason5f39d392007-10-15 16:14:19 -0400339 total_len = btrfs_item_size_nr(leaf, path->slots[0]);
Chris Masond3977122009-01-05 21:25:51 -0500340 while (cur < total_len) {
Chris Mason5f39d392007-10-15 16:14:19 -0400341 this_len = sizeof(*dir_item) +
Josef Bacik5103e942007-11-16 11:45:54 -0500342 btrfs_dir_name_len(leaf, dir_item) +
343 btrfs_dir_data_len(leaf, dir_item);
Chris Mason5f39d392007-10-15 16:14:19 -0400344 name_ptr = (unsigned long)(dir_item + 1);
Chris Mason7e381802007-04-19 15:36:27 -0400345
Chris Mason5f39d392007-10-15 16:14:19 -0400346 if (btrfs_dir_name_len(leaf, dir_item) == name_len &&
347 memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0)
Chris Mason7e381802007-04-19 15:36:27 -0400348 return dir_item;
349
350 cur += this_len;
351 dir_item = (struct btrfs_dir_item *)((char *)dir_item +
352 this_len);
353 }
354 return NULL;
Chris Mason62e27492007-03-15 12:56:47 -0400355}
Chris Mason7e381802007-04-19 15:36:27 -0400356
Chris Masond352ac62008-09-29 15:18:18 -0400357/*
358 * given a pointer into a directory item, delete it. This
359 * handles items that have more than one entry in them.
360 */
Chris Mason7e381802007-04-19 15:36:27 -0400361int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans,
362 struct btrfs_root *root,
363 struct btrfs_path *path,
364 struct btrfs_dir_item *di)
365{
366
Chris Mason5f39d392007-10-15 16:14:19 -0400367 struct extent_buffer *leaf;
Chris Mason7e381802007-04-19 15:36:27 -0400368 u32 sub_item_len;
369 u32 item_len;
Chris Mason54aa1f42007-06-22 14:16:25 -0400370 int ret = 0;
Chris Mason7e381802007-04-19 15:36:27 -0400371
Chris Mason5f39d392007-10-15 16:14:19 -0400372 leaf = path->nodes[0];
Josef Bacik5103e942007-11-16 11:45:54 -0500373 sub_item_len = sizeof(*di) + btrfs_dir_name_len(leaf, di) +
374 btrfs_dir_data_len(leaf, di);
Chris Mason5f39d392007-10-15 16:14:19 -0400375 item_len = btrfs_item_size_nr(leaf, path->slots[0]);
376 if (sub_item_len == item_len) {
Chris Mason7e381802007-04-19 15:36:27 -0400377 ret = btrfs_del_item(trans, root, path);
Chris Mason7e381802007-04-19 15:36:27 -0400378 } else {
Chris Mason5f39d392007-10-15 16:14:19 -0400379 /* MARKER */
380 unsigned long ptr = (unsigned long)di;
381 unsigned long start;
382
383 start = btrfs_item_ptr_offset(leaf, path->slots[0]);
384 memmove_extent_buffer(leaf, ptr, ptr + sub_item_len,
Chris Mason7e381802007-04-19 15:36:27 -0400385 item_len - (ptr + sub_item_len - start));
Jeff Mahoney143bede2012-03-01 14:56:26 +0100386 btrfs_truncate_item(trans, root, path,
387 item_len - sub_item_len, 1);
Chris Mason7e381802007-04-19 15:36:27 -0400388 }
Andi Kleen411fc6b2010-10-29 15:14:31 -0400389 return ret;
Chris Mason7e381802007-04-19 15:36:27 -0400390}
Josef Bacik22a94d42011-03-16 16:47:17 -0400391
392int verify_dir_item(struct btrfs_root *root,
393 struct extent_buffer *leaf,
394 struct btrfs_dir_item *dir_item)
395{
396 u16 namelen = BTRFS_NAME_LEN;
397 u8 type = btrfs_dir_type(leaf, dir_item);
398
399 if (type >= BTRFS_FT_MAX) {
400 printk(KERN_CRIT "btrfs: invalid dir item type: %d\n",
401 (int)type);
402 return 1;
403 }
404
405 if (type == BTRFS_FT_XATTR)
406 namelen = XATTR_NAME_MAX;
407
408 if (btrfs_dir_name_len(leaf, dir_item) > namelen) {
Sergei Trofimovich9694b3f2011-05-20 20:20:31 +0000409 printk(KERN_CRIT "btrfs: invalid dir item name len: %u\n",
Josef Bacik22a94d42011-03-16 16:47:17 -0400410 (unsigned)btrfs_dir_data_len(leaf, dir_item));
411 return 1;
412 }
413
414 /* BTRFS_MAX_XATTR_SIZE is the same for all dir items */
415 if (btrfs_dir_data_len(leaf, dir_item) > BTRFS_MAX_XATTR_SIZE(root)) {
416 printk(KERN_CRIT "btrfs: invalid dir item data len: %u\n",
417 (unsigned)btrfs_dir_data_len(leaf, dir_item));
418 return 1;
419 }
420
421 return 0;
422}