提交 e8b0d724 编写于 作者: F Filipe David Borba Manana 提交者: Chris Mason

Btrfs: fix btrfs_prev_leaf() previous key computation

If we decrement the key type, we must reset its offset to the largest
possible offset (u64)-1. If we decrement the key's objectid, then we
must reset the key's type and offset to their largest possible values,
(u8)-1 and (u64)-1 respectively. Not doing so can make us miss an
items in the tree.
Signed-off-by: NFilipe David Borba Manana <fdmanana@gmail.com>
Signed-off-by: NJosef Bacik <jbacik@fusionio.com>
Signed-off-by: NChris Mason <chris.mason@fusionio.com>
上级 e93ae26f
...@@ -4827,14 +4827,18 @@ static int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path) ...@@ -4827,14 +4827,18 @@ static int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path)
btrfs_item_key_to_cpu(path->nodes[0], &key, 0); btrfs_item_key_to_cpu(path->nodes[0], &key, 0);
if (key.offset > 0) if (key.offset > 0) {
key.offset--; key.offset--;
else if (key.type > 0) } else if (key.type > 0) {
key.type--; key.type--;
else if (key.objectid > 0) key.offset = (u64)-1;
} else if (key.objectid > 0) {
key.objectid--; key.objectid--;
else key.type = (u8)-1;
key.offset = (u64)-1;
} else {
return 1; return 1;
}
btrfs_release_path(path); btrfs_release_path(path);
ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册