blob: 0dc1a033275e1caa4dbdb1133d5bcb57f316dd11 [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);
Tsutomu Itoh4b90c682013-04-16 05:18:49 +000052 btrfs_extend_item(root, path, data_size);
Jeff Mahoney143bede2012-03-01 14:56:26 +010053 } 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];
Ross Kirkdd3cc162013-09-16 15:58:09 +010057 item = btrfs_item_nr(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;
David Sterba962a2982014-06-04 18:41:45 +020085 key.type = 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);
David Sterba962a2982014-06-04 18:41:45 +0200136 key.type = 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;
David Sterba962a2982014-06-04 18:41:45 +0200203 key.type = 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 Mason9c520572012-12-17 14:26:57 -0500216int btrfs_check_dir_item_collision(struct btrfs_root *root, u64 dir,
217 const char *name, int name_len)
218{
219 int ret;
220 struct btrfs_key key;
221 struct btrfs_dir_item *di;
222 int data_size;
223 struct extent_buffer *leaf;
224 int slot;
225 struct btrfs_path *path;
226
227
228 path = btrfs_alloc_path();
229 if (!path)
230 return -ENOMEM;
231
232 key.objectid = dir;
David Sterba962a2982014-06-04 18:41:45 +0200233 key.type = BTRFS_DIR_ITEM_KEY;
Chris Mason9c520572012-12-17 14:26:57 -0500234 key.offset = btrfs_name_hash(name, name_len);
235
236 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
237
238 /* return back any errors */
239 if (ret < 0)
240 goto out;
241
242 /* nothing found, we're safe */
243 if (ret > 0) {
244 ret = 0;
245 goto out;
246 }
247
248 /* we found an item, look for our name in the item */
249 di = btrfs_match_dir_item_name(root, path, name, name_len);
250 if (di) {
251 /* our exact name was found */
252 ret = -EEXIST;
253 goto out;
254 }
255
256 /*
257 * see if there is room in the item to insert this
258 * name
259 */
Filipe David Borba Manana878f2d22013-11-27 16:06:16 +0000260 data_size = sizeof(*di) + name_len;
Chris Mason9c520572012-12-17 14:26:57 -0500261 leaf = path->nodes[0];
262 slot = path->slots[0];
263 if (data_size + btrfs_item_size_nr(leaf, slot) +
264 sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(root)) {
265 ret = -EOVERFLOW;
266 } else {
267 /* plenty of insertion room */
268 ret = 0;
269 }
270out:
271 btrfs_free_path(path);
272 return ret;
273}
274
Chris Masond352ac62008-09-29 15:18:18 -0400275/*
276 * lookup a directory item based on index. 'dir' is the objectid
277 * we're searching in, and 'mod' tells us if you plan on deleting the
278 * item (use mod < 0) or changing the options (use mod > 0)
279 *
280 * The name is used to make sure the index really points to the name you were
281 * looking for.
282 */
Chris Mason7e381802007-04-19 15:36:27 -0400283struct btrfs_dir_item *
284btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans,
285 struct btrfs_root *root,
286 struct btrfs_path *path, u64 dir,
287 u64 objectid, const char *name, int name_len,
288 int mod)
289{
290 int ret;
291 struct btrfs_key key;
292 int ins_len = mod < 0 ? -1 : 0;
293 int cow = mod != 0;
294
295 key.objectid = dir;
David Sterba962a2982014-06-04 18:41:45 +0200296 key.type = BTRFS_DIR_INDEX_KEY;
Chris Mason7e381802007-04-19 15:36:27 -0400297 key.offset = objectid;
298
299 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
300 if (ret < 0)
301 return ERR_PTR(ret);
302 if (ret > 0)
303 return ERR_PTR(-ENOENT);
304 return btrfs_match_dir_item_name(root, path, name, name_len);
305}
306
Yan, Zheng4df27c4d2009-09-21 15:56:00 -0400307struct btrfs_dir_item *
308btrfs_search_dir_index_item(struct btrfs_root *root,
309 struct btrfs_path *path, u64 dirid,
310 const char *name, int name_len)
311{
312 struct extent_buffer *leaf;
313 struct btrfs_dir_item *di;
314 struct btrfs_key key;
315 u32 nritems;
316 int ret;
317
318 key.objectid = dirid;
319 key.type = BTRFS_DIR_INDEX_KEY;
320 key.offset = 0;
321
322 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
323 if (ret < 0)
324 return ERR_PTR(ret);
325
326 leaf = path->nodes[0];
327 nritems = btrfs_header_nritems(leaf);
328
329 while (1) {
330 if (path->slots[0] >= nritems) {
331 ret = btrfs_next_leaf(root, path);
332 if (ret < 0)
333 return ERR_PTR(ret);
334 if (ret > 0)
335 break;
336 leaf = path->nodes[0];
337 nritems = btrfs_header_nritems(leaf);
338 continue;
339 }
340
341 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
342 if (key.objectid != dirid || key.type != BTRFS_DIR_INDEX_KEY)
343 break;
344
345 di = btrfs_match_dir_item_name(root, path, name, name_len);
346 if (di)
347 return di;
348
349 path->slots[0]++;
350 }
351 return NULL;
352}
353
Josef Bacik5103e942007-11-16 11:45:54 -0500354struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans,
355 struct btrfs_root *root,
356 struct btrfs_path *path, u64 dir,
357 const char *name, u16 name_len,
358 int mod)
359{
360 int ret;
361 struct btrfs_key key;
362 int ins_len = mod < 0 ? -1 : 0;
363 int cow = mod != 0;
Josef Bacik5103e942007-11-16 11:45:54 -0500364
365 key.objectid = dir;
David Sterba962a2982014-06-04 18:41:45 +0200366 key.type = BTRFS_XATTR_ITEM_KEY;
David Millerdf68b8a2008-02-15 10:40:52 -0500367 key.offset = btrfs_name_hash(name, name_len);
Josef Bacik5103e942007-11-16 11:45:54 -0500368 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
369 if (ret < 0)
370 return ERR_PTR(ret);
Li Zefan85d85a72011-07-14 03:17:52 +0000371 if (ret > 0)
Josef Bacik5103e942007-11-16 11:45:54 -0500372 return NULL;
373
374 return btrfs_match_dir_item_name(root, path, name, name_len);
375}
376
Chris Masond352ac62008-09-29 15:18:18 -0400377/*
378 * helper function to look at the directory item pointed to by 'path'
379 * this walks through all the entries in a dir item and finds one
380 * for a specific name.
381 */
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000382struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root,
383 struct btrfs_path *path,
384 const char *name, int name_len)
Chris Mason62e27492007-03-15 12:56:47 -0400385{
Chris Mason62e27492007-03-15 12:56:47 -0400386 struct btrfs_dir_item *dir_item;
Chris Mason5f39d392007-10-15 16:14:19 -0400387 unsigned long name_ptr;
Chris Mason7e381802007-04-19 15:36:27 -0400388 u32 total_len;
389 u32 cur = 0;
390 u32 this_len;
Chris Mason5f39d392007-10-15 16:14:19 -0400391 struct extent_buffer *leaf;
Chris Masona8a2ee02007-03-16 08:46:49 -0400392
Chris Mason5f39d392007-10-15 16:14:19 -0400393 leaf = path->nodes[0];
Chris Mason7e381802007-04-19 15:36:27 -0400394 dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);
Josef Bacik22a94d42011-03-16 16:47:17 -0400395 if (verify_dir_item(root, leaf, dir_item))
396 return NULL;
397
Chris Mason5f39d392007-10-15 16:14:19 -0400398 total_len = btrfs_item_size_nr(leaf, path->slots[0]);
Chris Masond3977122009-01-05 21:25:51 -0500399 while (cur < total_len) {
Chris Mason5f39d392007-10-15 16:14:19 -0400400 this_len = sizeof(*dir_item) +
Josef Bacik5103e942007-11-16 11:45:54 -0500401 btrfs_dir_name_len(leaf, dir_item) +
402 btrfs_dir_data_len(leaf, dir_item);
Chris Mason5f39d392007-10-15 16:14:19 -0400403 name_ptr = (unsigned long)(dir_item + 1);
Chris Mason7e381802007-04-19 15:36:27 -0400404
Chris Mason5f39d392007-10-15 16:14:19 -0400405 if (btrfs_dir_name_len(leaf, dir_item) == name_len &&
406 memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0)
Chris Mason7e381802007-04-19 15:36:27 -0400407 return dir_item;
408
409 cur += this_len;
410 dir_item = (struct btrfs_dir_item *)((char *)dir_item +
411 this_len);
412 }
413 return NULL;
Chris Mason62e27492007-03-15 12:56:47 -0400414}
Chris Mason7e381802007-04-19 15:36:27 -0400415
Chris Masond352ac62008-09-29 15:18:18 -0400416/*
417 * given a pointer into a directory item, delete it. This
418 * handles items that have more than one entry in them.
419 */
Chris Mason7e381802007-04-19 15:36:27 -0400420int btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans,
421 struct btrfs_root *root,
422 struct btrfs_path *path,
423 struct btrfs_dir_item *di)
424{
425
Chris Mason5f39d392007-10-15 16:14:19 -0400426 struct extent_buffer *leaf;
Chris Mason7e381802007-04-19 15:36:27 -0400427 u32 sub_item_len;
428 u32 item_len;
Chris Mason54aa1f42007-06-22 14:16:25 -0400429 int ret = 0;
Chris Mason7e381802007-04-19 15:36:27 -0400430
Chris Mason5f39d392007-10-15 16:14:19 -0400431 leaf = path->nodes[0];
Josef Bacik5103e942007-11-16 11:45:54 -0500432 sub_item_len = sizeof(*di) + btrfs_dir_name_len(leaf, di) +
433 btrfs_dir_data_len(leaf, di);
Chris Mason5f39d392007-10-15 16:14:19 -0400434 item_len = btrfs_item_size_nr(leaf, path->slots[0]);
435 if (sub_item_len == item_len) {
Chris Mason7e381802007-04-19 15:36:27 -0400436 ret = btrfs_del_item(trans, root, path);
Chris Mason7e381802007-04-19 15:36:27 -0400437 } else {
Chris Mason5f39d392007-10-15 16:14:19 -0400438 /* MARKER */
439 unsigned long ptr = (unsigned long)di;
440 unsigned long start;
441
442 start = btrfs_item_ptr_offset(leaf, path->slots[0]);
443 memmove_extent_buffer(leaf, ptr, ptr + sub_item_len,
Chris Mason7e381802007-04-19 15:36:27 -0400444 item_len - (ptr + sub_item_len - start));
Tsutomu Itohafe5fea2013-04-16 05:18:22 +0000445 btrfs_truncate_item(root, path, item_len - sub_item_len, 1);
Chris Mason7e381802007-04-19 15:36:27 -0400446 }
Andi Kleen411fc6b2010-10-29 15:14:31 -0400447 return ret;
Chris Mason7e381802007-04-19 15:36:27 -0400448}
Josef Bacik22a94d42011-03-16 16:47:17 -0400449
450int verify_dir_item(struct btrfs_root *root,
451 struct extent_buffer *leaf,
452 struct btrfs_dir_item *dir_item)
453{
454 u16 namelen = BTRFS_NAME_LEN;
455 u8 type = btrfs_dir_type(leaf, dir_item);
456
457 if (type >= BTRFS_FT_MAX) {
Frank Holtonefe120a2013-12-20 11:37:06 -0500458 btrfs_crit(root->fs_info, "invalid dir item type: %d",
Josef Bacik22a94d42011-03-16 16:47:17 -0400459 (int)type);
460 return 1;
461 }
462
463 if (type == BTRFS_FT_XATTR)
464 namelen = XATTR_NAME_MAX;
465
466 if (btrfs_dir_name_len(leaf, dir_item) > namelen) {
Frank Holtonefe120a2013-12-20 11:37:06 -0500467 btrfs_crit(root->fs_info, "invalid dir item name len: %u",
Josef Bacik22a94d42011-03-16 16:47:17 -0400468 (unsigned)btrfs_dir_data_len(leaf, dir_item));
469 return 1;
470 }
471
472 /* BTRFS_MAX_XATTR_SIZE is the same for all dir items */
Filipe David Borba Mananae46f5382013-10-28 16:28:30 +0000473 if ((btrfs_dir_data_len(leaf, dir_item) +
474 btrfs_dir_name_len(leaf, dir_item)) > BTRFS_MAX_XATTR_SIZE(root)) {
Jeff Mahoney5d163e02016-09-20 10:05:00 -0400475 btrfs_crit(root->fs_info,
476 "invalid dir item name + data len: %u + %u",
477 (unsigned)btrfs_dir_name_len(leaf, dir_item),
478 (unsigned)btrfs_dir_data_len(leaf, dir_item));
Josef Bacik22a94d42011-03-16 16:47:17 -0400479 return 1;
480 }
481
482 return 0;
483}