Lines Matching refs:memslots
840 rcu_assign_pointer(kvm->memslots[i], slots);
1027 struct kvm_memory_slot *mslots = slots->memslots;
1048 * the new slot's initial index into the memslots array.
1060 * current index into the memslots array.
1065 struct kvm_memory_slot *mslots = slots->memslots;
1074 * memslots with a higher GFN (than the target memslot) towards the
1095 * into the memslots array.
1101 struct kvm_memory_slot *mslots = slots->memslots;
1118 * Re-sort memslots based on their GFN to account for an added, deleted, or
1119 * moved memslot. Sorting memslots by GFN allows using a binary search during
1123 * at memslots[0] has the highest GFN.
1125 * The sorting algorithm takes advantage of having initially sorted memslots
1127 * by not swapping the updated memslot and instead only shifting other memslots
1144 * historical reasons. Originally, invalid memslots where denoted by having
1145 * GFN=0, thus sorting from highest->lowest naturally sorted invalid memslots
1147 * delete a memslot and thus does not rely on invalid memslots having GFN=0.
1151 * at memslots[0]. On x86, the largest memslot usually has one of the highest,
1156 * and uses an LRU pointer to improve performance for all memslots and GFNs.
1174 * Copy the memslot to its new position in memslots and update
1177 slots->memslots[i] = *memslot;
1205 rcu_assign_pointer(kvm->memslots[as_id], slots);
1212 * identifiable generation number while the memslots are in flux.
1234 * when deleting a memslot, as we need a complete duplicate of the memslots for
1275 * in the freshly allocated memslots, not in @old or @new.
1281 * We can re-use the old memslots, the only difference from the
1282 * newly installed memslots is the invalid flag, which will get
1284 * old memslots if preparing the new memory region fails.
1387 * when the memslots are re-sorted by update_memslots(), and the old
2635 * If the requested region crosses two memslots, we still