dirty_ring.c 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * KVM dirty ring implementation
  4. *
  5. * Copyright 2019 Red Hat, Inc.
  6. */
  7. #include <linux/kvm_host.h>
  8. #include <linux/kvm.h>
  9. #include <linux/vmalloc.h>
  10. #include <linux/kvm_dirty_ring.h>
  11. #include <trace/events/kvm.h>
  12. #include "kvm_mm.h"
  13. int __weak kvm_cpu_dirty_log_size(void)
  14. {
  15. return 0;
  16. }
  17. u32 kvm_dirty_ring_get_rsvd_entries(void)
  18. {
  19. return KVM_DIRTY_RING_RSVD_ENTRIES + kvm_cpu_dirty_log_size();
  20. }
  21. static u32 kvm_dirty_ring_used(struct kvm_dirty_ring *ring)
  22. {
  23. return READ_ONCE(ring->dirty_index) - READ_ONCE(ring->reset_index);
  24. }
  25. bool kvm_dirty_ring_soft_full(struct kvm_dirty_ring *ring)
  26. {
  27. return kvm_dirty_ring_used(ring) >= ring->soft_limit;
  28. }
  29. static bool kvm_dirty_ring_full(struct kvm_dirty_ring *ring)
  30. {
  31. return kvm_dirty_ring_used(ring) >= ring->size;
  32. }
  33. static void kvm_reset_dirty_gfn(struct kvm *kvm, u32 slot, u64 offset, u64 mask)
  34. {
  35. struct kvm_memory_slot *memslot;
  36. int as_id, id;
  37. as_id = slot >> 16;
  38. id = (u16)slot;
  39. if (as_id >= KVM_ADDRESS_SPACE_NUM || id >= KVM_USER_MEM_SLOTS)
  40. return;
  41. memslot = id_to_memslot(__kvm_memslots(kvm, as_id), id);
  42. if (!memslot || (offset + __fls(mask)) >= memslot->npages)
  43. return;
  44. KVM_MMU_LOCK(kvm);
  45. kvm_arch_mmu_enable_log_dirty_pt_masked(kvm, memslot, offset, mask);
  46. KVM_MMU_UNLOCK(kvm);
  47. }
  48. int kvm_dirty_ring_alloc(struct kvm_dirty_ring *ring, int index, u32 size)
  49. {
  50. ring->dirty_gfns = vzalloc(size);
  51. if (!ring->dirty_gfns)
  52. return -ENOMEM;
  53. ring->size = size / sizeof(struct kvm_dirty_gfn);
  54. ring->soft_limit = ring->size - kvm_dirty_ring_get_rsvd_entries();
  55. ring->dirty_index = 0;
  56. ring->reset_index = 0;
  57. ring->index = index;
  58. return 0;
  59. }
  60. static inline void kvm_dirty_gfn_set_invalid(struct kvm_dirty_gfn *gfn)
  61. {
  62. smp_store_release(&gfn->flags, 0);
  63. }
  64. static inline void kvm_dirty_gfn_set_dirtied(struct kvm_dirty_gfn *gfn)
  65. {
  66. gfn->flags = KVM_DIRTY_GFN_F_DIRTY;
  67. }
  68. static inline bool kvm_dirty_gfn_harvested(struct kvm_dirty_gfn *gfn)
  69. {
  70. return smp_load_acquire(&gfn->flags) & KVM_DIRTY_GFN_F_RESET;
  71. }
  72. int kvm_dirty_ring_reset(struct kvm *kvm, struct kvm_dirty_ring *ring)
  73. {
  74. u32 cur_slot, next_slot;
  75. u64 cur_offset, next_offset;
  76. unsigned long mask;
  77. int count = 0;
  78. struct kvm_dirty_gfn *entry;
  79. bool first_round = true;
  80. /* This is only needed to make compilers happy */
  81. cur_slot = cur_offset = mask = 0;
  82. while (true) {
  83. entry = &ring->dirty_gfns[ring->reset_index & (ring->size - 1)];
  84. if (!kvm_dirty_gfn_harvested(entry))
  85. break;
  86. next_slot = READ_ONCE(entry->slot);
  87. next_offset = READ_ONCE(entry->offset);
  88. /* Update the flags to reflect that this GFN is reset */
  89. kvm_dirty_gfn_set_invalid(entry);
  90. ring->reset_index++;
  91. count++;
  92. /*
  93. * Try to coalesce the reset operations when the guest is
  94. * scanning pages in the same slot.
  95. */
  96. if (!first_round && next_slot == cur_slot) {
  97. s64 delta = next_offset - cur_offset;
  98. if (delta >= 0 && delta < BITS_PER_LONG) {
  99. mask |= 1ull << delta;
  100. continue;
  101. }
  102. /* Backwards visit, careful about overflows! */
  103. if (delta > -BITS_PER_LONG && delta < 0 &&
  104. (mask << -delta >> -delta) == mask) {
  105. cur_offset = next_offset;
  106. mask = (mask << -delta) | 1;
  107. continue;
  108. }
  109. }
  110. kvm_reset_dirty_gfn(kvm, cur_slot, cur_offset, mask);
  111. cur_slot = next_slot;
  112. cur_offset = next_offset;
  113. mask = 1;
  114. first_round = false;
  115. }
  116. kvm_reset_dirty_gfn(kvm, cur_slot, cur_offset, mask);
  117. trace_kvm_dirty_ring_reset(ring);
  118. return count;
  119. }
  120. void kvm_dirty_ring_push(struct kvm_dirty_ring *ring, u32 slot, u64 offset)
  121. {
  122. struct kvm_dirty_gfn *entry;
  123. /* It should never get full */
  124. WARN_ON_ONCE(kvm_dirty_ring_full(ring));
  125. entry = &ring->dirty_gfns[ring->dirty_index & (ring->size - 1)];
  126. entry->slot = slot;
  127. entry->offset = offset;
  128. /*
  129. * Make sure the data is filled in before we publish this to
  130. * the userspace program. There's no paired kernel-side reader.
  131. */
  132. smp_wmb();
  133. kvm_dirty_gfn_set_dirtied(entry);
  134. ring->dirty_index++;
  135. trace_kvm_dirty_ring_push(ring, slot, offset);
  136. }
  137. struct page *kvm_dirty_ring_get_page(struct kvm_dirty_ring *ring, u32 offset)
  138. {
  139. return vmalloc_to_page((void *)ring->dirty_gfns + offset * PAGE_SIZE);
  140. }
  141. void kvm_dirty_ring_free(struct kvm_dirty_ring *ring)
  142. {
  143. vfree(ring->dirty_gfns);
  144. ring->dirty_gfns = NULL;
  145. }