@@ -4393,9 +4393,9 @@ again:
for (i = 0; i < btrfs_header_nritems(buf); i++) {
unsigned int shift = 0, offset;
- if (i == 0 && btrfs_item_end(buf, i) !=
+ if (i == 0 && btrfs_item_data_end(buf, i) !=
BTRFS_LEAF_DATA_SIZE(gfs_info)) {
- if (btrfs_item_end(buf, i) >
+ if (btrfs_item_data_end(buf, i) >
BTRFS_LEAF_DATA_SIZE(gfs_info)) {
ret = delete_bogus_item(root, path, buf, i);
if (!ret)
@@ -4406,10 +4406,10 @@ again:
break;
}
shift = BTRFS_LEAF_DATA_SIZE(gfs_info) -
- btrfs_item_end(buf, i);
- } else if (i > 0 && btrfs_item_end(buf, i) !=
+ btrfs_item_data_end(buf, i);
+ } else if (i > 0 && btrfs_item_data_end(buf, i) !=
btrfs_item_offset(buf, i - 1)) {
- if (btrfs_item_end(buf, i) >
+ if (btrfs_item_data_end(buf, i) >
btrfs_item_offset(buf, i - 1)) {
ret = delete_bogus_item(root, path, buf, i);
if (!ret)
@@ -4419,7 +4419,7 @@ again:
break;
}
shift = btrfs_item_offset(buf, i - 1) -
- btrfs_item_end(buf, i);
+ btrfs_item_data_end(buf, i);
}
if (!shift)
continue;
@@ -1938,7 +1938,7 @@ static int leaf_space_used(struct extent_buffer *l, int start, int nr)
if (!nr)
return 0;
- data_len = btrfs_item_end(l, start);
+ data_len = btrfs_item_data_end(l, start);
data_len = data_len - btrfs_item_offset(l, end);
data_len += sizeof(struct btrfs_item) * nr;
WARN_ON(data_len < 0);
@@ -2066,7 +2066,7 @@ static int push_leaf_right(struct btrfs_trans_handle *trans, struct btrfs_root
/* push left to right */
right_nritems = btrfs_header_nritems(right);
- push_space = btrfs_item_end(left, left_nritems - push_items);
+ push_space = btrfs_item_data_end(left, left_nritems - push_items);
push_space -= leaf_data_end(left);
/* make room in the right data area */
@@ -2301,7 +2301,7 @@ static noinline int copy_for_split(struct btrfs_trans_handle *trans,
nritems = nritems - mid;
btrfs_set_header_nritems(right, nritems);
- data_copy_size = btrfs_item_end(l, mid) - leaf_data_end(l);
+ data_copy_size = btrfs_item_data_end(l, mid) - leaf_data_end(l);
copy_extent_buffer(right, l, btrfs_leaf_data(right),
btrfs_item_nr_offset(l, mid),
@@ -2313,7 +2313,7 @@ static noinline int copy_for_split(struct btrfs_trans_handle *trans,
btrfs_leaf_data(l) + leaf_data_end(l), data_copy_size);
rt_data_off = BTRFS_LEAF_DATA_SIZE(root->fs_info) -
- btrfs_item_end(l, mid);
+ btrfs_item_data_end(l, mid);
for (i = 0; i < nritems; i++) {
u32 ioff = btrfs_item_offset(right, i);
@@ -2734,7 +2734,7 @@ int btrfs_extend_item(struct btrfs_root *root, struct btrfs_path *path,
BUG();
}
slot = path->slots[0];
- old_data = btrfs_item_end(leaf, slot);
+ old_data = btrfs_item_data_end(leaf, slot);
BUG_ON(slot < 0);
if (slot >= nritems) {
@@ -2823,7 +2823,7 @@ int btrfs_insert_empty_items(struct btrfs_trans_handle *trans,
BUG_ON(slot < 0);
if (slot < nritems) {
- unsigned int old_data = btrfs_item_end(leaf, slot);
+ unsigned int old_data = btrfs_item_data_end(leaf, slot);
if (old_data < data_end) {
btrfs_print_leaf(leaf, BTRFS_PRINT_TREE_DEFAULT);
@@ -2022,7 +2022,7 @@ static inline void btrfs_set_item_##member(struct extent_buffer *eb, \
BTRFS_ITEM_SETGET_FUNCS(size)
BTRFS_ITEM_SETGET_FUNCS(offset)
-static inline u32 btrfs_item_end(struct extent_buffer *eb, int nr)
+static inline u32 btrfs_item_data_end(struct extent_buffer *eb, int nr)
{
return btrfs_item_offset(eb, nr) + btrfs_item_size(eb, nr);
}
This matches what we did in the kernel, btrfs_item_data_end is more inline with what the helper does, which is give us the offset of the end of the data portion of the item, not the offset of the end of the item itself. Signed-off-by: Josef Bacik <josef@toxicpanda.com> --- check/main.c | 12 ++++++------ kernel-shared/ctree.c | 12 ++++++------ kernel-shared/ctree.h | 2 +- 3 files changed, 13 insertions(+), 13 deletions(-)