-
Eric Blake authored
We need an accurate count of the number of bits set in a bitmap after a merge. In particular, since the merge operation short-circuits a merge from an empty source, if you have bitmaps A, B, and C where B started empty, then merge C into B, and B into A, an inaccurate count meant that A did not get the contents of C. In the worst case, we may falsely regard the bitmap as empty when it has had new writes merged into it. Fixes: be58721d CC: qemu-stable@nongnu.org Signed-off-by:
Eric Blake <eblake@redhat.com>
Signed-off-by:
John Snow <jsnow@redhat.com>
Reviewed-by:
Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com>
Message-id: 20181002233314.30159-1-jsnow@redhat.com
Signed-off-by:
John Snow <jsnow@redhat.com>Eric Blake authoredWe need an accurate count of the number of bits set in a bitmap after a merge. In particular, since the merge operation short-circuits a merge from an empty source, if you have bitmaps A, B, and C where B started empty, then merge C into B, and B into A, an inaccurate count meant that A did not get the contents of C. In the worst case, we may falsely regard the bitmap as empty when it has had new writes merged into it. Fixes: be58721d CC: qemu-stable@nongnu.org Signed-off-by:
Eric Blake <eblake@redhat.com>
Signed-off-by:
John Snow <jsnow@redhat.com>
Reviewed-by:
Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com>
Message-id: 20181002233314.30159-1-jsnow@redhat.com
Signed-off-by:
John Snow <jsnow@redhat.com>
Loading