1 // SPDX-License-Identifier: GPL-2.0-only 2 /* 3 * Kernel-based Virtual Machine driver for Linux 4 * 5 * This module enables kernel and guest-mode vCPU access to guest physical 6 * memory with suitable invalidation mechanisms. 7 * 8 * Copyright © 2021 Amazon.com, Inc. or its affiliates. 9 * 10 * Authors: 11 * David Woodhouse <dwmw2@infradead.org> 12 */ 13 14 #include <linux/kvm_host.h> 15 #include <linux/kvm.h> 16 #include <linux/highmem.h> 17 #include <linux/module.h> 18 #include <linux/errno.h> 19 20 #include "kvm_mm.h" 21 22 /* 23 * MMU notifier 'invalidate_range_start' hook. 24 */ 25 void gfn_to_pfn_cache_invalidate_start(struct kvm *kvm, unsigned long start, 26 unsigned long end) 27 { 28 struct gfn_to_pfn_cache *gpc; 29 30 spin_lock(&kvm->gpc_lock); 31 list_for_each_entry(gpc, &kvm->gpc_list, list) { 32 read_lock_irq(&gpc->lock); 33 34 /* Only a single page so no need to care about length */ 35 if (gpc->valid && !is_error_noslot_pfn(gpc->pfn) && 36 gpc->uhva >= start && gpc->uhva < end) { 37 read_unlock_irq(&gpc->lock); 38 39 /* 40 * There is a small window here where the cache could 41 * be modified, and invalidation would no longer be 42 * necessary. Hence check again whether invalidation 43 * is still necessary once the write lock has been 44 * acquired. 45 */ 46 47 write_lock_irq(&gpc->lock); 48 if (gpc->valid && !is_error_noslot_pfn(gpc->pfn) && 49 gpc->uhva >= start && gpc->uhva < end) 50 gpc->valid = false; 51 write_unlock_irq(&gpc->lock); 52 continue; 53 } 54 55 read_unlock_irq(&gpc->lock); 56 } 57 spin_unlock(&kvm->gpc_lock); 58 } 59 60 static bool kvm_gpc_is_valid_len(gpa_t gpa, unsigned long uhva, 61 unsigned long len) 62 { 63 unsigned long offset = kvm_is_error_gpa(gpa) ? offset_in_page(uhva) : 64 offset_in_page(gpa); 65 66 /* 67 * The cached access must fit within a single page. The 'len' argument 68 * to activate() and refresh() exists only to enforce that. 69 */ 70 return offset + len <= PAGE_SIZE; 71 } 72 73 bool kvm_gpc_check(struct gfn_to_pfn_cache *gpc, unsigned long len) 74 { 75 struct kvm_memslots *slots = kvm_memslots(gpc->kvm); 76 77 if (!gpc->active) 78 return false; 79 80 /* 81 * If the page was cached from a memslot, make sure the memslots have 82 * not been re-configured. 83 */ 84 if (!kvm_is_error_gpa(gpc->gpa) && gpc->generation != slots->generation) 85 return false; 86 87 if (kvm_is_error_hva(gpc->uhva)) 88 return false; 89 90 if (!kvm_gpc_is_valid_len(gpc->gpa, gpc->uhva, len)) 91 return false; 92 93 if (!gpc->valid) 94 return false; 95 96 return true; 97 } 98 99 static void *gpc_map(kvm_pfn_t pfn) 100 { 101 if (pfn_valid(pfn)) 102 return kmap(pfn_to_page(pfn)); 103 104 #ifdef CONFIG_HAS_IOMEM 105 return memremap(pfn_to_hpa(pfn), PAGE_SIZE, MEMREMAP_WB); 106 #else 107 return NULL; 108 #endif 109 } 110 111 static void gpc_unmap(kvm_pfn_t pfn, void *khva) 112 { 113 /* Unmap the old pfn/page if it was mapped before. */ 114 if (is_error_noslot_pfn(pfn) || !khva) 115 return; 116 117 if (pfn_valid(pfn)) { 118 kunmap(pfn_to_page(pfn)); 119 return; 120 } 121 122 #ifdef CONFIG_HAS_IOMEM 123 memunmap(khva); 124 #endif 125 } 126 127 static inline bool mmu_notifier_retry_cache(struct kvm *kvm, unsigned long mmu_seq) 128 { 129 /* 130 * mn_active_invalidate_count acts for all intents and purposes 131 * like mmu_invalidate_in_progress here; but the latter cannot 132 * be used here because the invalidation of caches in the 133 * mmu_notifier event occurs _before_ mmu_invalidate_in_progress 134 * is elevated. 135 * 136 * Note, it does not matter that mn_active_invalidate_count 137 * is not protected by gpc->lock. It is guaranteed to 138 * be elevated before the mmu_notifier acquires gpc->lock, and 139 * isn't dropped until after mmu_invalidate_seq is updated. 140 */ 141 if (kvm->mn_active_invalidate_count) 142 return true; 143 144 /* 145 * Ensure mn_active_invalidate_count is read before 146 * mmu_invalidate_seq. This pairs with the smp_wmb() in 147 * mmu_notifier_invalidate_range_end() to guarantee either the 148 * old (non-zero) value of mn_active_invalidate_count or the 149 * new (incremented) value of mmu_invalidate_seq is observed. 150 */ 151 smp_rmb(); 152 return kvm->mmu_invalidate_seq != mmu_seq; 153 } 154 155 static kvm_pfn_t hva_to_pfn_retry(struct gfn_to_pfn_cache *gpc) 156 { 157 /* Note, the new page offset may be different than the old! */ 158 void *old_khva = (void *)PAGE_ALIGN_DOWN((uintptr_t)gpc->khva); 159 kvm_pfn_t new_pfn = KVM_PFN_ERR_FAULT; 160 void *new_khva = NULL; 161 unsigned long mmu_seq; 162 163 lockdep_assert_held(&gpc->refresh_lock); 164 165 lockdep_assert_held_write(&gpc->lock); 166 167 /* 168 * Invalidate the cache prior to dropping gpc->lock, the gpa=>uhva 169 * assets have already been updated and so a concurrent check() from a 170 * different task may not fail the gpa/uhva/generation checks. 171 */ 172 gpc->valid = false; 173 174 do { 175 mmu_seq = gpc->kvm->mmu_invalidate_seq; 176 smp_rmb(); 177 178 write_unlock_irq(&gpc->lock); 179 180 /* 181 * If the previous iteration "failed" due to an mmu_notifier 182 * event, release the pfn and unmap the kernel virtual address 183 * from the previous attempt. Unmapping might sleep, so this 184 * needs to be done after dropping the lock. Opportunistically 185 * check for resched while the lock isn't held. 186 */ 187 if (new_pfn != KVM_PFN_ERR_FAULT) { 188 /* 189 * Keep the mapping if the previous iteration reused 190 * the existing mapping and didn't create a new one. 191 */ 192 if (new_khva != old_khva) 193 gpc_unmap(new_pfn, new_khva); 194 195 kvm_release_pfn_clean(new_pfn); 196 197 cond_resched(); 198 } 199 200 /* We always request a writeable mapping */ 201 new_pfn = hva_to_pfn(gpc->uhva, false, false, NULL, true, NULL); 202 if (is_error_noslot_pfn(new_pfn)) 203 goto out_error; 204 205 /* 206 * Obtain a new kernel mapping if KVM itself will access the 207 * pfn. Note, kmap() and memremap() can both sleep, so this 208 * too must be done outside of gpc->lock! 209 */ 210 if (new_pfn == gpc->pfn) 211 new_khva = old_khva; 212 else 213 new_khva = gpc_map(new_pfn); 214 215 if (!new_khva) { 216 kvm_release_pfn_clean(new_pfn); 217 goto out_error; 218 } 219 220 write_lock_irq(&gpc->lock); 221 222 /* 223 * Other tasks must wait for _this_ refresh to complete before 224 * attempting to refresh. 225 */ 226 WARN_ON_ONCE(gpc->valid); 227 } while (mmu_notifier_retry_cache(gpc->kvm, mmu_seq)); 228 229 gpc->valid = true; 230 gpc->pfn = new_pfn; 231 gpc->khva = new_khva + offset_in_page(gpc->uhva); 232 233 /* 234 * Put the reference to the _new_ pfn. The pfn is now tracked by the 235 * cache and can be safely migrated, swapped, etc... as the cache will 236 * invalidate any mappings in response to relevant mmu_notifier events. 237 */ 238 kvm_release_pfn_clean(new_pfn); 239 240 return 0; 241 242 out_error: 243 write_lock_irq(&gpc->lock); 244 245 return -EFAULT; 246 } 247 248 static int __kvm_gpc_refresh(struct gfn_to_pfn_cache *gpc, gpa_t gpa, unsigned long uhva) 249 { 250 unsigned long page_offset; 251 bool unmap_old = false; 252 unsigned long old_uhva; 253 kvm_pfn_t old_pfn; 254 bool hva_change = false; 255 void *old_khva; 256 int ret; 257 258 /* Either gpa or uhva must be valid, but not both */ 259 if (WARN_ON_ONCE(kvm_is_error_gpa(gpa) == kvm_is_error_hva(uhva))) 260 return -EINVAL; 261 262 lockdep_assert_held(&gpc->refresh_lock); 263 264 write_lock_irq(&gpc->lock); 265 266 if (!gpc->active) { 267 ret = -EINVAL; 268 goto out_unlock; 269 } 270 271 old_pfn = gpc->pfn; 272 old_khva = (void *)PAGE_ALIGN_DOWN((uintptr_t)gpc->khva); 273 old_uhva = PAGE_ALIGN_DOWN(gpc->uhva); 274 275 if (kvm_is_error_gpa(gpa)) { 276 page_offset = offset_in_page(uhva); 277 278 gpc->gpa = INVALID_GPA; 279 gpc->memslot = NULL; 280 gpc->uhva = PAGE_ALIGN_DOWN(uhva); 281 282 if (gpc->uhva != old_uhva) 283 hva_change = true; 284 } else { 285 struct kvm_memslots *slots = kvm_memslots(gpc->kvm); 286 287 page_offset = offset_in_page(gpa); 288 289 if (gpc->gpa != gpa || gpc->generation != slots->generation || 290 kvm_is_error_hva(gpc->uhva)) { 291 gfn_t gfn = gpa_to_gfn(gpa); 292 293 gpc->gpa = gpa; 294 gpc->generation = slots->generation; 295 gpc->memslot = __gfn_to_memslot(slots, gfn); 296 gpc->uhva = gfn_to_hva_memslot(gpc->memslot, gfn); 297 298 if (kvm_is_error_hva(gpc->uhva)) { 299 ret = -EFAULT; 300 goto out; 301 } 302 303 /* 304 * Even if the GPA and/or the memslot generation changed, the 305 * HVA may still be the same. 306 */ 307 if (gpc->uhva != old_uhva) 308 hva_change = true; 309 } else { 310 gpc->uhva = old_uhva; 311 } 312 } 313 314 /* Note: the offset must be correct before calling hva_to_pfn_retry() */ 315 gpc->uhva += page_offset; 316 317 /* 318 * If the userspace HVA changed or the PFN was already invalid, 319 * drop the lock and do the HVA to PFN lookup again. 320 */ 321 if (!gpc->valid || hva_change) { 322 ret = hva_to_pfn_retry(gpc); 323 } else { 324 /* 325 * If the HVA→PFN mapping was already valid, don't unmap it. 326 * But do update gpc->khva because the offset within the page 327 * may have changed. 328 */ 329 gpc->khva = old_khva + page_offset; 330 ret = 0; 331 goto out_unlock; 332 } 333 334 out: 335 /* 336 * Invalidate the cache and purge the pfn/khva if the refresh failed. 337 * Some/all of the uhva, gpa, and memslot generation info may still be 338 * valid, leave it as is. 339 */ 340 if (ret) { 341 gpc->valid = false; 342 gpc->pfn = KVM_PFN_ERR_FAULT; 343 gpc->khva = NULL; 344 } 345 346 /* Detect a pfn change before dropping the lock! */ 347 unmap_old = (old_pfn != gpc->pfn); 348 349 out_unlock: 350 write_unlock_irq(&gpc->lock); 351 352 if (unmap_old) 353 gpc_unmap(old_pfn, old_khva); 354 355 return ret; 356 } 357 358 int kvm_gpc_refresh(struct gfn_to_pfn_cache *gpc, unsigned long len) 359 { 360 unsigned long uhva; 361 362 guard(mutex)(&gpc->refresh_lock); 363 364 if (!kvm_gpc_is_valid_len(gpc->gpa, gpc->uhva, len)) 365 return -EINVAL; 366 367 /* 368 * If the GPA is valid then ignore the HVA, as a cache can be GPA-based 369 * or HVA-based, not both. For GPA-based caches, the HVA will be 370 * recomputed during refresh if necessary. 371 */ 372 uhva = kvm_is_error_gpa(gpc->gpa) ? gpc->uhva : KVM_HVA_ERR_BAD; 373 374 return __kvm_gpc_refresh(gpc, gpc->gpa, uhva); 375 } 376 377 void kvm_gpc_init(struct gfn_to_pfn_cache *gpc, struct kvm *kvm) 378 { 379 rwlock_init(&gpc->lock); 380 mutex_init(&gpc->refresh_lock); 381 382 gpc->kvm = kvm; 383 gpc->pfn = KVM_PFN_ERR_FAULT; 384 gpc->gpa = INVALID_GPA; 385 gpc->uhva = KVM_HVA_ERR_BAD; 386 gpc->active = gpc->valid = false; 387 } 388 389 static int __kvm_gpc_activate(struct gfn_to_pfn_cache *gpc, gpa_t gpa, unsigned long uhva, 390 unsigned long len) 391 { 392 struct kvm *kvm = gpc->kvm; 393 394 if (!kvm_gpc_is_valid_len(gpa, uhva, len)) 395 return -EINVAL; 396 397 guard(mutex)(&gpc->refresh_lock); 398 399 if (!gpc->active) { 400 if (KVM_BUG_ON(gpc->valid, kvm)) 401 return -EIO; 402 403 spin_lock(&kvm->gpc_lock); 404 list_add(&gpc->list, &kvm->gpc_list); 405 spin_unlock(&kvm->gpc_lock); 406 407 /* 408 * Activate the cache after adding it to the list, a concurrent 409 * refresh must not establish a mapping until the cache is 410 * reachable by mmu_notifier events. 411 */ 412 write_lock_irq(&gpc->lock); 413 gpc->active = true; 414 write_unlock_irq(&gpc->lock); 415 } 416 return __kvm_gpc_refresh(gpc, gpa, uhva); 417 } 418 419 int kvm_gpc_activate(struct gfn_to_pfn_cache *gpc, gpa_t gpa, unsigned long len) 420 { 421 /* 422 * Explicitly disallow INVALID_GPA so that the magic value can be used 423 * by KVM to differentiate between GPA-based and HVA-based caches. 424 */ 425 if (WARN_ON_ONCE(kvm_is_error_gpa(gpa))) 426 return -EINVAL; 427 428 return __kvm_gpc_activate(gpc, gpa, KVM_HVA_ERR_BAD, len); 429 } 430 431 int kvm_gpc_activate_hva(struct gfn_to_pfn_cache *gpc, unsigned long uhva, unsigned long len) 432 { 433 if (!access_ok((void __user *)uhva, len)) 434 return -EINVAL; 435 436 return __kvm_gpc_activate(gpc, INVALID_GPA, uhva, len); 437 } 438 439 void kvm_gpc_deactivate(struct gfn_to_pfn_cache *gpc) 440 { 441 struct kvm *kvm = gpc->kvm; 442 kvm_pfn_t old_pfn; 443 void *old_khva; 444 445 guard(mutex)(&gpc->refresh_lock); 446 447 if (gpc->active) { 448 /* 449 * Deactivate the cache before removing it from the list, KVM 450 * must stall mmu_notifier events until all users go away, i.e. 451 * until gpc->lock is dropped and refresh is guaranteed to fail. 452 */ 453 write_lock_irq(&gpc->lock); 454 gpc->active = false; 455 gpc->valid = false; 456 457 /* 458 * Leave the GPA => uHVA cache intact, it's protected by the 459 * memslot generation. The PFN lookup needs to be redone every 460 * time as mmu_notifier protection is lost when the cache is 461 * removed from the VM's gpc_list. 462 */ 463 old_khva = gpc->khva - offset_in_page(gpc->khva); 464 gpc->khva = NULL; 465 466 old_pfn = gpc->pfn; 467 gpc->pfn = KVM_PFN_ERR_FAULT; 468 write_unlock_irq(&gpc->lock); 469 470 spin_lock(&kvm->gpc_lock); 471 list_del(&gpc->list); 472 spin_unlock(&kvm->gpc_lock); 473 474 gpc_unmap(old_pfn, old_khva); 475 } 476 } 477