aboutsummaryrefslogtreecommitdiffstats
path: root/virt
diff options
context:
space:
mode:
authorPaolo Bonzini <pbonzini@redhat.com>2014-12-27 12:01:00 -0500
committerPaolo Bonzini <pbonzini@redhat.com>2014-12-28 04:01:17 -0500
commitefbeec7098eee2b3d2359d0cc24bbba0436e7f21 (patch)
tree6b90f8b272f263d093b2f40a3aa471030616bbe1 /virt
parenta629df7eadffb03e6ce4a8616e62ea29fdf69b6b (diff)
kvm: fix sorting of memslots with base_gfn == 0
Before commit 0e60b0799fed (kvm: change memslot sorting rule from size to GFN, 2014-12-01), the memslots' sorting key was npages, meaning that a valid memslot couldn't have its sorting key equal to zero. On the other hand, a valid memslot can have base_gfn == 0, and invalid memslots are identified by base_gfn == npages == 0. Because of this, commit 0e60b0799fed broke the invariant that invalid memslots are at the end of the mslots array. When a memslot with base_gfn == 0 was created, any invalid memslot before it were left in place. This can be fixed by changing the insertion to use a ">=" comparison instead of "<=", but some care is needed to avoid breaking the case of deleting a memslot; see the comment in update_memslots. Thanks to Tiejun Chen for posting an initial patch for this bug. Reported-by: Jamie Heilman <jamie@audible.transient.net> Reported-by: Andy Lutomirski <luto@amacapital.net> Tested-by: Jamie Heilman <jamie@audible.transient.net> Signed-off-by: Paolo Bonzini <pbonzini@redhat.com>
Diffstat (limited to 'virt')
-rw-r--r--virt/kvm/kvm_main.c22
1 files changed, 17 insertions, 5 deletions
diff --git a/virt/kvm/kvm_main.c b/virt/kvm/kvm_main.c
index f5283438ee05..050974c051b5 100644
--- a/virt/kvm/kvm_main.c
+++ b/virt/kvm/kvm_main.c
@@ -687,11 +687,23 @@ static void update_memslots(struct kvm_memslots *slots,
687 slots->id_to_index[mslots[i].id] = i; 687 slots->id_to_index[mslots[i].id] = i;
688 i++; 688 i++;
689 } 689 }
690 while (i > 0 && 690
691 new->base_gfn > mslots[i - 1].base_gfn) { 691 /*
692 mslots[i] = mslots[i - 1]; 692 * The ">=" is needed when creating a slot with base_gfn == 0,
693 slots->id_to_index[mslots[i].id] = i; 693 * so that it moves before all those with base_gfn == npages == 0.
694 i--; 694 *
695 * On the other hand, if new->npages is zero, the above loop has
696 * already left i pointing to the beginning of the empty part of
697 * mslots, and the ">=" would move the hole backwards in this
698 * case---which is wrong. So skip the loop when deleting a slot.
699 */
700 if (new->npages) {
701 while (i > 0 &&
702 new->base_gfn >= mslots[i - 1].base_gfn) {
703 mslots[i] = mslots[i - 1];
704 slots->id_to_index[mslots[i].id] = i;
705 i--;
706 }
695 } 707 }
696 708
697 mslots[i] = *new; 709 mslots[i] = *new;