coalesced_mmio.c 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186
  1. /*
  2. * KVM coalesced MMIO
  3. *
  4. * Copyright (c) 2008 Bull S.A.S.
  5. * Copyright 2009 Red Hat, Inc. and/or its affiliates.
  6. *
  7. * Author: Laurent Vivier <Laurent.Vivier@bull.net>
  8. *
  9. */
  10. #include "iodev.h"
  11. #include <linux/kvm_host.h>
  12. #include <linux/slab.h>
  13. #include <linux/kvm.h>
  14. #include "coalesced_mmio.h"
  15. static inline struct kvm_coalesced_mmio_dev *to_mmio(struct kvm_io_device *dev)
  16. {
  17. return container_of(dev, struct kvm_coalesced_mmio_dev, dev);
  18. }
  19. static int coalesced_mmio_in_range(struct kvm_coalesced_mmio_dev *dev,
  20. gpa_t addr, int len)
  21. {
  22. /* is it in a batchable area ?
  23. * (addr,len) is fully included in
  24. * (zone->addr, zone->size)
  25. */
  26. if (len < 0)
  27. return 0;
  28. if (addr + len < addr)
  29. return 0;
  30. if (addr < dev->zone.addr)
  31. return 0;
  32. if (addr + len > dev->zone.addr + dev->zone.size)
  33. return 0;
  34. return 1;
  35. }
  36. static int coalesced_mmio_has_room(struct kvm_coalesced_mmio_dev *dev, u32 last)
  37. {
  38. struct kvm_coalesced_mmio_ring *ring;
  39. unsigned avail;
  40. /* Are we able to batch it ? */
  41. /* last is the first free entry
  42. * check if we don't meet the first used entry
  43. * there is always one unused entry in the buffer
  44. */
  45. ring = dev->kvm->coalesced_mmio_ring;
  46. avail = (ring->first - last - 1) % KVM_COALESCED_MMIO_MAX;
  47. if (avail == 0) {
  48. /* full */
  49. return 0;
  50. }
  51. return 1;
  52. }
  53. static int coalesced_mmio_write(struct kvm_io_device *this,
  54. gpa_t addr, int len, const void *val)
  55. {
  56. struct kvm_coalesced_mmio_dev *dev = to_mmio(this);
  57. struct kvm_coalesced_mmio_ring *ring = dev->kvm->coalesced_mmio_ring;
  58. __u32 insert;
  59. if (!coalesced_mmio_in_range(dev, addr, len))
  60. return -EOPNOTSUPP;
  61. spin_lock(&dev->kvm->ring_lock);
  62. insert = ACCESS_ONCE(ring->last);
  63. if (!coalesced_mmio_has_room(dev, insert) ||
  64. insert >= KVM_COALESCED_MMIO_MAX) {
  65. spin_unlock(&dev->kvm->ring_lock);
  66. return -EOPNOTSUPP;
  67. }
  68. /* copy data in first free entry of the ring */
  69. ring->coalesced_mmio[insert].phys_addr = addr;
  70. ring->coalesced_mmio[insert].len = len;
  71. memcpy(ring->coalesced_mmio[insert].data, val, len);
  72. smp_wmb();
  73. ring->last = (insert + 1) % KVM_COALESCED_MMIO_MAX;
  74. spin_unlock(&dev->kvm->ring_lock);
  75. return 0;
  76. }
  77. static void coalesced_mmio_destructor(struct kvm_io_device *this)
  78. {
  79. struct kvm_coalesced_mmio_dev *dev = to_mmio(this);
  80. list_del(&dev->list);
  81. kfree(dev);
  82. }
  83. static const struct kvm_io_device_ops coalesced_mmio_ops = {
  84. .write = coalesced_mmio_write,
  85. .destructor = coalesced_mmio_destructor,
  86. };
  87. int kvm_coalesced_mmio_init(struct kvm *kvm)
  88. {
  89. struct page *page;
  90. int ret;
  91. ret = -ENOMEM;
  92. page = alloc_page(GFP_KERNEL | __GFP_ZERO);
  93. if (!page)
  94. goto out_err;
  95. ret = 0;
  96. kvm->coalesced_mmio_ring = page_address(page);
  97. /*
  98. * We're using this spinlock to sync access to the coalesced ring.
  99. * The list doesn't need it's own lock since device registration and
  100. * unregistration should only happen when kvm->slots_lock is held.
  101. */
  102. spin_lock_init(&kvm->ring_lock);
  103. INIT_LIST_HEAD(&kvm->coalesced_zones);
  104. out_err:
  105. return ret;
  106. }
  107. void kvm_coalesced_mmio_free(struct kvm *kvm)
  108. {
  109. if (kvm->coalesced_mmio_ring)
  110. free_page((unsigned long)kvm->coalesced_mmio_ring);
  111. }
  112. int kvm_vm_ioctl_register_coalesced_mmio(struct kvm *kvm,
  113. struct kvm_coalesced_mmio_zone *zone)
  114. {
  115. int ret;
  116. struct kvm_coalesced_mmio_dev *dev;
  117. dev = kzalloc(sizeof(struct kvm_coalesced_mmio_dev), GFP_KERNEL);
  118. if (!dev)
  119. return -ENOMEM;
  120. kvm_iodevice_init(&dev->dev, &coalesced_mmio_ops);
  121. dev->kvm = kvm;
  122. dev->zone = *zone;
  123. mutex_lock(&kvm->slots_lock);
  124. ret = kvm_io_bus_register_dev(kvm, KVM_MMIO_BUS, zone->addr,
  125. zone->size, &dev->dev);
  126. if (ret < 0)
  127. goto out_free_dev;
  128. list_add_tail(&dev->list, &kvm->coalesced_zones);
  129. mutex_unlock(&kvm->slots_lock);
  130. return 0;
  131. out_free_dev:
  132. mutex_unlock(&kvm->slots_lock);
  133. kfree(dev);
  134. return ret;
  135. }
  136. int kvm_vm_ioctl_unregister_coalesced_mmio(struct kvm *kvm,
  137. struct kvm_coalesced_mmio_zone *zone)
  138. {
  139. struct kvm_coalesced_mmio_dev *dev, *tmp;
  140. mutex_lock(&kvm->slots_lock);
  141. list_for_each_entry_safe(dev, tmp, &kvm->coalesced_zones, list)
  142. if (coalesced_mmio_in_range(dev, zone->addr, zone->size)) {
  143. kvm_io_bus_unregister_dev(kvm, KVM_MMIO_BUS, &dev->dev);
  144. kvm_iodevice_destructor(&dev->dev);
  145. }
  146. mutex_unlock(&kvm->slots_lock);
  147. return 0;
  148. }