summaryrefslogtreecommitdiff
path: root/fs/btrfs/root-tree.c
diff options
context:
space:
mode:
authorFilipe Manana <fdmanana@suse.com>2019-02-20 14:11:43 +0300
committerDavid Sterba <dsterba@suse.com>2019-02-25 16:19:23 +0300
commit253002f2e3f4e2bbb0cbdd9e9fe2f5b9ec88f694 (patch)
treeb64bf4f94fe13788f18c5c02c3581309dcc150db /fs/btrfs/root-tree.c
parentcbca7d59fea4e81ee3bf724cf20018f96d53ccea (diff)
downloadlinux-253002f2e3f4e2bbb0cbdd9e9fe2f5b9ec88f694.tar.xz
Btrfs: remove assertion when searching for a key in a node/leaf
At ctree.c:key_search(), the assertion that verifies the first key on a child extent buffer corresponds to the key at a specific slot in the parent has a disadvantage: we effectively hit a BUG_ON() which requires rebooting the machine later. It also does not tell any information about which extent buffer is affected, from which root, the expected and found keys, etc. However as of commit 581c1760415c48 ("btrfs: Validate child tree block's level and first key"), that assertion is not needed since at the time we read an extent buffer from disk we validate that its first key matches the key, at the respective slot, in the parent extent buffer. Therefore just remove the assertion at key_search(). Reviewed-by: Qu Wenruo <wqu@suse.com> Signed-off-by: Filipe Manana <fdmanana@suse.com> Signed-off-by: David Sterba <dsterba@suse.com>
Diffstat (limited to 'fs/btrfs/root-tree.c')
0 files changed, 0 insertions, 0 deletions