coalesced_mmio.c 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184
  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 <kvm/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)
  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 - ring->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_vcpu *vcpu,
  54. struct kvm_io_device *this, gpa_t addr,
  55. int len, const void *val)
  56. {
  57. struct kvm_coalesced_mmio_dev *dev = to_mmio(this);
  58. struct kvm_coalesced_mmio_ring *ring = dev->kvm->coalesced_mmio_ring;
  59. if (!coalesced_mmio_in_range(dev, addr, len))
  60. return -EOPNOTSUPP;
  61. spin_lock(&dev->kvm->ring_lock);
  62. if (!coalesced_mmio_has_room(dev)) {
  63. spin_unlock(&dev->kvm->ring_lock);
  64. return -EOPNOTSUPP;
  65. }
  66. /* copy data in first free entry of the ring */
  67. ring->coalesced_mmio[ring->last].phys_addr = addr;
  68. ring->coalesced_mmio[ring->last].len = len;
  69. memcpy(ring->coalesced_mmio[ring->last].data, val, len);
  70. smp_wmb();
  71. ring->last = (ring->last + 1) % KVM_COALESCED_MMIO_MAX;
  72. spin_unlock(&dev->kvm->ring_lock);
  73. return 0;
  74. }
  75. static void coalesced_mmio_destructor(struct kvm_io_device *this)
  76. {
  77. struct kvm_coalesced_mmio_dev *dev = to_mmio(this);
  78. list_del(&dev->list);
  79. kfree(dev);
  80. }
  81. static const struct kvm_io_device_ops coalesced_mmio_ops = {
  82. .write = coalesced_mmio_write,
  83. .destructor = coalesced_mmio_destructor,
  84. };
  85. int kvm_coalesced_mmio_init(struct kvm *kvm)
  86. {
  87. struct page *page;
  88. int ret;
  89. ret = -ENOMEM;
  90. page = alloc_page(GFP_KERNEL | __GFP_ZERO);
  91. if (!page)
  92. goto out_err;
  93. ret = 0;
  94. kvm->coalesced_mmio_ring = page_address(page);
  95. /*
  96. * We're using this spinlock to sync access to the coalesced ring.
  97. * The list doesn't need it's own lock since device registration and
  98. * unregistration should only happen when kvm->slots_lock is held.
  99. */
  100. spin_lock_init(&kvm->ring_lock);
  101. INIT_LIST_HEAD(&kvm->coalesced_zones);
  102. out_err:
  103. return ret;
  104. }
  105. void kvm_coalesced_mmio_free(struct kvm *kvm)
  106. {
  107. if (kvm->coalesced_mmio_ring)
  108. free_page((unsigned long)kvm->coalesced_mmio_ring);
  109. }
  110. int kvm_vm_ioctl_register_coalesced_mmio(struct kvm *kvm,
  111. struct kvm_coalesced_mmio_zone *zone)
  112. {
  113. int ret;
  114. struct kvm_coalesced_mmio_dev *dev;
  115. dev = kzalloc(sizeof(struct kvm_coalesced_mmio_dev), GFP_KERNEL);
  116. if (!dev)
  117. return -ENOMEM;
  118. kvm_iodevice_init(&dev->dev, &coalesced_mmio_ops);
  119. dev->kvm = kvm;
  120. dev->zone = *zone;
  121. mutex_lock(&kvm->slots_lock);
  122. ret = kvm_io_bus_register_dev(kvm, KVM_MMIO_BUS, zone->addr,
  123. zone->size, &dev->dev);
  124. if (ret < 0)
  125. goto out_free_dev;
  126. list_add_tail(&dev->list, &kvm->coalesced_zones);
  127. mutex_unlock(&kvm->slots_lock);
  128. return 0;
  129. out_free_dev:
  130. mutex_unlock(&kvm->slots_lock);
  131. kfree(dev);
  132. return ret;
  133. }
  134. int kvm_vm_ioctl_unregister_coalesced_mmio(struct kvm *kvm,
  135. struct kvm_coalesced_mmio_zone *zone)
  136. {
  137. struct kvm_coalesced_mmio_dev *dev, *tmp;
  138. mutex_lock(&kvm->slots_lock);
  139. list_for_each_entry_safe(dev, tmp, &kvm->coalesced_zones, list)
  140. if (coalesced_mmio_in_range(dev, zone->addr, zone->size)) {
  141. kvm_io_bus_unregister_dev(kvm, KVM_MMIO_BUS, &dev->dev);
  142. kvm_iodevice_destructor(&dev->dev);
  143. }
  144. mutex_unlock(&kvm->slots_lock);
  145. return 0;
  146. }