dm btree remove: fix a bug when rebalancing nodes after removal
authorJoe Thornber <ejt@redhat.com>
Wed, 21 Oct 2015 17:36:49 +0000 (18:36 +0100)
committerMike Snitzer <snitzer@redhat.com>
Fri, 23 Oct 2015 18:02:55 +0000 (14:02 -0400)
commit2871c69e025e8bc507651d5a9cf81a8a7da9d24b
treee1101ed40df4065187db2cde572f449ff708bb67
parentba30670f4d5292c4e7f7980bbd5071f7c4794cdd
dm btree remove: fix a bug when rebalancing nodes after removal

Commit 4c7e309340ff ("dm btree remove: fix bug in redistribute3") wasn't
a complete fix for redistribute3().

The redistribute3 function takes 3 btree nodes and shares out the entries
evenly between them.  If the three nodes in total contained
(MAX_ENTRIES * 3) - 1 entries between them then this was erroneously getting
rebalanced as (MAX_ENTRIES - 1) on the left and right, and (MAX_ENTRIES + 1) in
the center.

Fix this issue by being more careful about calculating the target number
of entries for the left and right nodes.

Unit tested in userspace using this program:
https://github.com/jthornber/redistribute3-test/blob/master/redistribute3_t.c

Signed-off-by: Joe Thornber <ejt@redhat.com>
Signed-off-by: Mike Snitzer <snitzer@redhat.com>
Cc: stable@vger.kernel.org
drivers/md/persistent-data/dm-btree-remove.c