blob: f3a6075519ccc1d96e42157f95769a5ad6641a12 [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,
71 struct btrfs_root *root, const char *name,
72 u16 name_len, const void *data, u16 data_len,
73 u64 dir)
74{
75 int ret = 0;
76 struct btrfs_path *path;
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
84 key.objectid = dir;
85 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 path = btrfs_alloc_path();
88 if (!path)
89 return -ENOMEM;
Yan744f52f2008-01-14 13:26:08 -050090 if (name_len + data_len + sizeof(struct btrfs_dir_item) >
91 BTRFS_LEAF_DATA_SIZE(root) - sizeof(struct btrfs_item))
92 return -ENOSPC;
Josef Bacik5103e942007-11-16 11:45:54 -050093
94 data_size = sizeof(*dir_item) + name_len + data_len;
95 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
96 name, name_len);
97 /*
98 * FIXME: at some point we should handle xattr's that are larger than
99 * what we can fit in our leaf. We set location to NULL b/c we arent
100 * pointing at anything else, that will change if we store the xattr
101 * data in a separate inode.
102 */
103 BUG_ON(IS_ERR(dir_item));
104 memset(&location, 0, sizeof(location));
105
106 leaf = path->nodes[0];
107 btrfs_cpu_key_to_disk(&disk_key, &location);
108 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
109 btrfs_set_dir_type(leaf, dir_item, BTRFS_FT_XATTR);
110 btrfs_set_dir_name_len(leaf, dir_item, name_len);
Chris Masone02119d2008-09-05 16:13:11 -0400111 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
Josef Bacik5103e942007-11-16 11:45:54 -0500112 btrfs_set_dir_data_len(leaf, dir_item, data_len);
113 name_ptr = (unsigned long)(dir_item + 1);
114 data_ptr = (unsigned long)((char *)name_ptr + name_len);
115
116 write_extent_buffer(leaf, name, name_ptr, name_len);
117 write_extent_buffer(leaf, data, data_ptr, data_len);
118 btrfs_mark_buffer_dirty(path->nodes[0]);
119
120 btrfs_free_path(path);
121 return ret;
122}
123
Chris Masond352ac62008-09-29 15:18:18 -0400124/*
125 * insert a directory item in the tree, doing all the magic for
126 * both indexes. 'dir' indicates which objectid to insert it into,
127 * 'location' is the key to stuff into the directory item, 'type' is the
128 * type of the inode we're pointing to, and 'index' is the sequence number
129 * to use for the second index (if one is created).
130 */
Chris Masone089f052007-03-16 16:20:31 -0400131int btrfs_insert_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root
Chris Masond6e4a422007-04-06 15:37:36 -0400132 *root, const char *name, int name_len, u64 dir,
Josef Bacikaec74772008-07-24 12:12:38 -0400133 struct btrfs_key *location, u8 type, u64 index)
Chris Mason62e27492007-03-15 12:56:47 -0400134{
135 int ret = 0;
Chris Masone06afa82007-05-23 15:44:28 -0400136 int ret2 = 0;
Chris Mason5caf2a02007-04-02 11:20:42 -0400137 struct btrfs_path *path;
Chris Mason62e27492007-03-15 12:56:47 -0400138 struct btrfs_dir_item *dir_item;
Chris Mason5f39d392007-10-15 16:14:19 -0400139 struct extent_buffer *leaf;
140 unsigned long name_ptr;
Chris Mason62e27492007-03-15 12:56:47 -0400141 struct btrfs_key key;
Chris Mason5f39d392007-10-15 16:14:19 -0400142 struct btrfs_disk_key disk_key;
Chris Mason62e27492007-03-15 12:56:47 -0400143 u32 data_size;
144
145 key.objectid = dir;
Chris Mason1d4f6402007-03-15 15:18:43 -0400146 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
David Millerdf68b8a2008-02-15 10:40:52 -0500147 key.offset = btrfs_name_hash(name, name_len);
Chris Masonb9473432009-03-13 11:00:37 -0400148
Chris Mason5caf2a02007-04-02 11:20:42 -0400149 path = btrfs_alloc_path();
Chris Masonb9473432009-03-13 11:00:37 -0400150 path->leave_spinning = 1;
151
Chris Mason62e27492007-03-15 12:56:47 -0400152 data_size = sizeof(*dir_item) + name_len;
Chris Masone06afa82007-05-23 15:44:28 -0400153 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
154 name, name_len);
Chris Mason7e381802007-04-19 15:36:27 -0400155 if (IS_ERR(dir_item)) {
156 ret = PTR_ERR(dir_item);
Chris Masone06afa82007-05-23 15:44:28 -0400157 if (ret == -EEXIST)
158 goto second_insert;
Chris Mason62e27492007-03-15 12:56:47 -0400159 goto out;
Chris Mason7e381802007-04-19 15:36:27 -0400160 }
Chris Mason62e27492007-03-15 12:56:47 -0400161
Chris Mason5f39d392007-10-15 16:14:19 -0400162 leaf = path->nodes[0];
163 btrfs_cpu_key_to_disk(&disk_key, location);
164 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
165 btrfs_set_dir_type(leaf, dir_item, type);
Josef Bacik5103e942007-11-16 11:45:54 -0500166 btrfs_set_dir_data_len(leaf, dir_item, 0);
Chris Mason5f39d392007-10-15 16:14:19 -0400167 btrfs_set_dir_name_len(leaf, dir_item, name_len);
Chris Masone02119d2008-09-05 16:13:11 -0400168 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
Chris Mason5f39d392007-10-15 16:14:19 -0400169 name_ptr = (unsigned long)(dir_item + 1);
Chris Masonc5739bb2007-04-10 09:27:04 -0400170
Chris Mason5f39d392007-10-15 16:14:19 -0400171 write_extent_buffer(leaf, name, name_ptr, name_len);
172 btrfs_mark_buffer_dirty(leaf);
Chris Mason7e381802007-04-19 15:36:27 -0400173
Chris Masone06afa82007-05-23 15:44:28 -0400174second_insert:
Chris Mason7e381802007-04-19 15:36:27 -0400175 /* FIXME, use some real flag for selecting the extra index */
176 if (root == root->fs_info->tree_root) {
177 ret = 0;
178 goto out;
179 }
Chris Mason5caf2a02007-04-02 11:20:42 -0400180 btrfs_release_path(root, path);
Chris Mason7e381802007-04-19 15:36:27 -0400181
182 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
Josef Bacikaec74772008-07-24 12:12:38 -0400183 key.offset = index;
Chris Masone06afa82007-05-23 15:44:28 -0400184 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
185 name, name_len);
Chris Mason7e381802007-04-19 15:36:27 -0400186 if (IS_ERR(dir_item)) {
Chris Masone06afa82007-05-23 15:44:28 -0400187 ret2 = PTR_ERR(dir_item);
Chris Mason7e381802007-04-19 15:36:27 -0400188 goto out;
189 }
Chris Mason5f39d392007-10-15 16:14:19 -0400190 leaf = path->nodes[0];
191 btrfs_cpu_key_to_disk(&disk_key, location);
192 btrfs_set_dir_item_key(leaf, dir_item, &disk_key);
193 btrfs_set_dir_type(leaf, dir_item, type);
Josef Bacik5103e942007-11-16 11:45:54 -0500194 btrfs_set_dir_data_len(leaf, dir_item, 0);
Chris Mason5f39d392007-10-15 16:14:19 -0400195 btrfs_set_dir_name_len(leaf, dir_item, name_len);
Chris Masone02119d2008-09-05 16:13:11 -0400196 btrfs_set_dir_transid(leaf, dir_item, trans->transid);
Chris Mason5f39d392007-10-15 16:14:19 -0400197 name_ptr = (unsigned long)(dir_item + 1);
198 write_extent_buffer(leaf, name, name_ptr, name_len);
199 btrfs_mark_buffer_dirty(leaf);
Chris Mason7e381802007-04-19 15:36:27 -0400200out:
Chris Mason5caf2a02007-04-02 11:20:42 -0400201 btrfs_free_path(path);
Chris Masone06afa82007-05-23 15:44:28 -0400202 if (ret)
203 return ret;
204 if (ret2)
205 return ret2;
206 return 0;
Chris Mason62e27492007-03-15 12:56:47 -0400207}
208
Chris Masond352ac62008-09-29 15:18:18 -0400209/*
210 * lookup a directory item based on name. 'dir' is the objectid
211 * we're searching in, and 'mod' tells us if you plan on deleting the
212 * item (use mod < 0) or changing the options (use mod > 0)
213 */
Chris Mason7e381802007-04-19 15:36:27 -0400214struct btrfs_dir_item *btrfs_lookup_dir_item(struct btrfs_trans_handle *trans,
215 struct btrfs_root *root,
216 struct btrfs_path *path, u64 dir,
217 const char *name, int name_len,
218 int mod)
Chris Mason62e27492007-03-15 12:56:47 -0400219{
Chris Mason1d4f6402007-03-15 15:18:43 -0400220 int ret;
Chris Mason62e27492007-03-15 12:56:47 -0400221 struct btrfs_key key;
Chris Mason1d4f6402007-03-15 15:18:43 -0400222 int ins_len = mod < 0 ? -1 : 0;
223 int cow = mod != 0;
Chris Mason5f39d392007-10-15 16:14:19 -0400224 struct btrfs_key found_key;
225 struct extent_buffer *leaf;
Chris Mason62e27492007-03-15 12:56:47 -0400226
227 key.objectid = dir;
Chris Mason1d4f6402007-03-15 15:18:43 -0400228 btrfs_set_key_type(&key, BTRFS_DIR_ITEM_KEY);
Chris Mason5f39d392007-10-15 16:14:19 -0400229
David Millerdf68b8a2008-02-15 10:40:52 -0500230 key.offset = btrfs_name_hash(name, name_len);
Chris Mason5f39d392007-10-15 16:14:19 -0400231
Chris Mason7e381802007-04-19 15:36:27 -0400232 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
233 if (ret < 0)
234 return ERR_PTR(ret);
235 if (ret > 0) {
236 if (path->slots[0] == 0)
237 return NULL;
238 path->slots[0]--;
Chris Mason7fcde0e2007-04-05 12:13:21 -0400239 }
Chris Mason7e381802007-04-19 15:36:27 -0400240
Chris Mason5f39d392007-10-15 16:14:19 -0400241 leaf = path->nodes[0];
242 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
243
244 if (found_key.objectid != dir ||
245 btrfs_key_type(&found_key) != BTRFS_DIR_ITEM_KEY ||
246 found_key.offset != key.offset)
Chris Mason7e381802007-04-19 15:36:27 -0400247 return NULL;
248
249 return btrfs_match_dir_item_name(root, path, name, name_len);
Chris Mason62e27492007-03-15 12:56:47 -0400250}
251
Chris Masond352ac62008-09-29 15:18:18 -0400252/*
253 * lookup a directory item based on index. 'dir' is the objectid
254 * we're searching in, and 'mod' tells us if you plan on deleting the
255 * item (use mod < 0) or changing the options (use mod > 0)
256 *
257 * The name is used to make sure the index really points to the name you were
258 * looking for.
259 */
Chris Mason7e381802007-04-19 15:36:27 -0400260struct btrfs_dir_item *
261btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans,
262 struct btrfs_root *root,
263 struct btrfs_path *path, u64 dir,
264 u64 objectid, const char *name, int name_len,
265 int mod)
266{
267 int ret;
268 struct btrfs_key key;
269 int ins_len = mod < 0 ? -1 : 0;
270 int cow = mod != 0;
271
272 key.objectid = dir;
Chris Mason7e381802007-04-19 15:36:27 -0400273 btrfs_set_key_type(&key, BTRFS_DIR_INDEX_KEY);
274 key.offset = objectid;
275
276 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
277 if (ret < 0)
278 return ERR_PTR(ret);
279 if (ret > 0)
280 return ERR_PTR(-ENOENT);
281 return btrfs_match_dir_item_name(root, path, name, name_len);
282}
283
Yan, Zheng4df27c4d2009-09-21 15:56:00 -0400284struct btrfs_dir_item *
285btrfs_search_dir_index_item(struct btrfs_root *root,
286 struct btrfs_path *path, u64 dirid,
287 const char *name, int name_len)
288{
289 struct extent_buffer *leaf;
290 struct btrfs_dir_item *di;
291 struct btrfs_key key;
292 u32 nritems;
293 int ret;
294
295 key.objectid = dirid;
296 key.type = BTRFS_DIR_INDEX_KEY;
297 key.offset = 0;
298
299 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
300 if (ret < 0)
301 return ERR_PTR(ret);
302
303 leaf = path->nodes[0];
304 nritems = btrfs_header_nritems(leaf);
305
306 while (1) {
307 if (path->slots[0] >= nritems) {
308 ret = btrfs_next_leaf(root, path);
309 if (ret < 0)
310 return ERR_PTR(ret);
311 if (ret > 0)
312 break;
313 leaf = path->nodes[0];
314 nritems = btrfs_header_nritems(leaf);
315 continue;
316 }
317
318 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
319 if (key.objectid != dirid || key.type != BTRFS_DIR_INDEX_KEY)
320 break;
321
322 di = btrfs_match_dir_item_name(root, path, name, name_len);
323 if (di)
324 return di;
325
326 path->slots[0]++;
327 }
328 return NULL;
329}
330
Josef Bacik5103e942007-11-16 11:45:54 -0500331struct btrfs_dir_item *btrfs_lookup_xattr(struct btrfs_trans_handle *trans,
332 struct btrfs_root *root,
333 struct btrfs_path *path, u64 dir,
334 const char *name, u16 name_len,
335 int mod)
336{
337 int ret;
338 struct btrfs_key key;
339 int ins_len = mod < 0 ? -1 : 0;
340 int cow = mod != 0;
341 struct btrfs_key found_key;
342 struct extent_buffer *leaf;
343
344 key.objectid = dir;
345 btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY);
David Millerdf68b8a2008-02-15 10:40:52 -0500346 key.offset = btrfs_name_hash(name, name_len);
Josef Bacik5103e942007-11-16 11:45:54 -0500347 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
348 if (ret < 0)
349 return ERR_PTR(ret);
350 if (ret > 0) {
351 if (path->slots[0] == 0)
352 return NULL;
353 path->slots[0]--;
354 }
355
356 leaf = path->nodes[0];
357 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
358
359 if (found_key.objectid != dir ||
360 btrfs_key_type(&found_key) != BTRFS_XATTR_ITEM_KEY ||
361 found_key.offset != key.offset)
362 return NULL;
363
364 return btrfs_match_dir_item_name(root, path, name, name_len);
365}
366
Chris Masond352ac62008-09-29 15:18:18 -0400367/*
368 * helper function to look at the directory item pointed to by 'path'
369 * this walks through all the entries in a dir item and finds one
370 * for a specific name.
371 */
Chris Mason7e381802007-04-19 15:36:27 -0400372struct btrfs_dir_item *btrfs_match_dir_item_name(struct btrfs_root *root,
Chris Mason7f5c1512007-03-23 15:56:19 -0400373 struct btrfs_path *path,
374 const char *name, int name_len)
Chris Mason62e27492007-03-15 12:56:47 -0400375{
Chris Mason62e27492007-03-15 12:56:47 -0400376 struct btrfs_dir_item *dir_item;
Chris Mason5f39d392007-10-15 16:14:19 -0400377 unsigned long name_ptr;
Chris Mason7e381802007-04-19 15:36:27 -0400378 u32 total_len;
379 u32 cur = 0;
380 u32 this_len;
Chris Mason5f39d392007-10-15 16:14:19 -0400381 struct extent_buffer *leaf;
Chris Masona8a2ee02007-03-16 08:46:49 -0400382
Chris Mason5f39d392007-10-15 16:14:19 -0400383 leaf = path->nodes[0];
Chris Mason7e381802007-04-19 15:36:27 -0400384 dir_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);
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 }
435 return 0;
436}