summaryrefslogtreecommitdiffstats
path: root/fs/btrfs/tree-log.c
diff options
context:
space:
mode:
authorNaohiro Aota <naota@elisp.net>2015-06-30 11:25:43 +0900
committerChris Mason <clm@fb.com>2015-08-09 06:17:02 -0700
commitdd81d459a37d73cfa39896bd070e7b92e66e3628 (patch)
tree993856780c7913312bbe2676ffa721ab11b1091e /fs/btrfs/tree-log.c
parentd6589101b67a55107652050dfbf414403a93e351 (diff)
downloadop-kernel-dev-dd81d459a37d73cfa39896bd070e7b92e66e3628.zip
op-kernel-dev-dd81d459a37d73cfa39896bd070e7b92e66e3628.tar.gz
btrfs: fix search key advancing condition
The search key advancing condition used in copy_to_sk() is loose. It can advance the key even if it reaches sk->max_*: e.g. when the max key = (512, 1024, -1) and the current key = (512, 1025, 10), it increments the offset by 1, continues hopeless search from (512, 1025, 11). This issue make ioctl() to take unexpectedly long time scanning all the leaf a blocks one by one. This commit fix the problem using standard way of key comparison: btrfs_comp_cpu_keys() Signed-off-by: Naohiro Aota <naota@elisp.net> Reviewed-by: Filipe Manana <fdmanana@suse.com> Signed-off-by: Chris Mason <clm@fb.com>
Diffstat (limited to 'fs/btrfs/tree-log.c')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud