irqchip.c 5.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235
  1. /*
  2. * irqchip.c: Common API for in kernel interrupt controllers
  3. * Copyright (c) 2007, Intel Corporation.
  4. * Copyright 2010 Red Hat, Inc. and/or its affiliates.
  5. * Copyright (c) 2013, Alexander Graf <agraf@suse.de>
  6. *
  7. * This program is free software; you can redistribute it and/or modify it
  8. * under the terms and conditions of the GNU General Public License,
  9. * version 2, as published by the Free Software Foundation.
  10. *
  11. * This program is distributed in the hope it will be useful, but WITHOUT
  12. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13. * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
  14. * more details.
  15. *
  16. * You should have received a copy of the GNU General Public License along with
  17. * this program; if not, write to the Free Software Foundation, Inc., 59 Temple
  18. * Place - Suite 330, Boston, MA 02111-1307 USA.
  19. *
  20. * This file is derived from virt/kvm/irq_comm.c.
  21. *
  22. * Authors:
  23. * Yaozu (Eddie) Dong <Eddie.dong@intel.com>
  24. * Alexander Graf <agraf@suse.de>
  25. */
  26. #include <linux/kvm_host.h>
  27. #include <linux/slab.h>
  28. #include <linux/srcu.h>
  29. #include <linux/export.h>
  30. #include <trace/events/kvm.h>
  31. #include "irq.h"
  32. int kvm_irq_map_gsi(struct kvm *kvm,
  33. struct kvm_kernel_irq_routing_entry *entries, int gsi)
  34. {
  35. struct kvm_irq_routing_table *irq_rt;
  36. struct kvm_kernel_irq_routing_entry *e;
  37. int n = 0;
  38. irq_rt = srcu_dereference_check(kvm->irq_routing, &kvm->irq_srcu,
  39. lockdep_is_held(&kvm->irq_lock));
  40. if (irq_rt && gsi < irq_rt->nr_rt_entries) {
  41. hlist_for_each_entry(e, &irq_rt->map[gsi], link) {
  42. entries[n] = *e;
  43. ++n;
  44. }
  45. }
  46. return n;
  47. }
  48. int kvm_irq_map_chip_pin(struct kvm *kvm, unsigned irqchip, unsigned pin)
  49. {
  50. struct kvm_irq_routing_table *irq_rt;
  51. irq_rt = srcu_dereference(kvm->irq_routing, &kvm->irq_srcu);
  52. return irq_rt->chip[irqchip][pin];
  53. }
  54. int kvm_send_userspace_msi(struct kvm *kvm, struct kvm_msi *msi)
  55. {
  56. struct kvm_kernel_irq_routing_entry route;
  57. if (!irqchip_in_kernel(kvm) || msi->flags != 0)
  58. return -EINVAL;
  59. route.msi.address_lo = msi->address_lo;
  60. route.msi.address_hi = msi->address_hi;
  61. route.msi.data = msi->data;
  62. return kvm_set_msi(&route, kvm, KVM_USERSPACE_IRQ_SOURCE_ID, 1, false);
  63. }
  64. /*
  65. * Return value:
  66. * < 0 Interrupt was ignored (masked or not delivered for other reasons)
  67. * = 0 Interrupt was coalesced (previous irq is still pending)
  68. * > 0 Number of CPUs interrupt was delivered to
  69. */
  70. int kvm_set_irq(struct kvm *kvm, int irq_source_id, u32 irq, int level,
  71. bool line_status)
  72. {
  73. struct kvm_kernel_irq_routing_entry irq_set[KVM_NR_IRQCHIPS];
  74. int ret = -1, i, idx;
  75. trace_kvm_set_irq(irq, level, irq_source_id);
  76. /* Not possible to detect if the guest uses the PIC or the
  77. * IOAPIC. So set the bit in both. The guest will ignore
  78. * writes to the unused one.
  79. */
  80. idx = srcu_read_lock(&kvm->irq_srcu);
  81. i = kvm_irq_map_gsi(kvm, irq_set, irq);
  82. srcu_read_unlock(&kvm->irq_srcu, idx);
  83. while (i--) {
  84. int r;
  85. r = irq_set[i].set(&irq_set[i], kvm, irq_source_id, level,
  86. line_status);
  87. if (r < 0)
  88. continue;
  89. ret = r + ((ret < 0) ? 0 : ret);
  90. }
  91. return ret;
  92. }
  93. static void free_irq_routing_table(struct kvm_irq_routing_table *rt)
  94. {
  95. int i;
  96. if (!rt)
  97. return;
  98. for (i = 0; i < rt->nr_rt_entries; ++i) {
  99. struct kvm_kernel_irq_routing_entry *e;
  100. struct hlist_node *n;
  101. hlist_for_each_entry_safe(e, n, &rt->map[i], link) {
  102. hlist_del(&e->link);
  103. kfree(e);
  104. }
  105. }
  106. kfree(rt);
  107. }
  108. void kvm_free_irq_routing(struct kvm *kvm)
  109. {
  110. /* Called only during vm destruction. Nobody can use the pointer
  111. at this stage */
  112. struct kvm_irq_routing_table *rt = rcu_access_pointer(kvm->irq_routing);
  113. free_irq_routing_table(rt);
  114. }
  115. static int setup_routing_entry(struct kvm_irq_routing_table *rt,
  116. struct kvm_kernel_irq_routing_entry *e,
  117. const struct kvm_irq_routing_entry *ue)
  118. {
  119. int r = -EINVAL;
  120. struct kvm_kernel_irq_routing_entry *ei;
  121. /*
  122. * Do not allow GSI to be mapped to the same irqchip more than once.
  123. * Allow only one to one mapping between GSI and non-irqchip routing.
  124. */
  125. hlist_for_each_entry(ei, &rt->map[ue->gsi], link)
  126. if (ei->type != KVM_IRQ_ROUTING_IRQCHIP ||
  127. ue->type != KVM_IRQ_ROUTING_IRQCHIP ||
  128. ue->u.irqchip.irqchip == ei->irqchip.irqchip)
  129. return r;
  130. e->gsi = ue->gsi;
  131. e->type = ue->type;
  132. r = kvm_set_routing_entry(e, ue);
  133. if (r)
  134. goto out;
  135. if (e->type == KVM_IRQ_ROUTING_IRQCHIP)
  136. rt->chip[e->irqchip.irqchip][e->irqchip.pin] = e->gsi;
  137. hlist_add_head(&e->link, &rt->map[e->gsi]);
  138. r = 0;
  139. out:
  140. return r;
  141. }
  142. int kvm_set_irq_routing(struct kvm *kvm,
  143. const struct kvm_irq_routing_entry *ue,
  144. unsigned nr,
  145. unsigned flags)
  146. {
  147. struct kvm_irq_routing_table *new, *old;
  148. u32 i, j, nr_rt_entries = 0;
  149. int r;
  150. for (i = 0; i < nr; ++i) {
  151. if (ue[i].gsi >= KVM_MAX_IRQ_ROUTES)
  152. return -EINVAL;
  153. nr_rt_entries = max(nr_rt_entries, ue[i].gsi);
  154. }
  155. nr_rt_entries += 1;
  156. new = kzalloc(sizeof(*new) + (nr_rt_entries * sizeof(struct hlist_head)),
  157. GFP_KERNEL);
  158. if (!new)
  159. return -ENOMEM;
  160. new->nr_rt_entries = nr_rt_entries;
  161. for (i = 0; i < KVM_NR_IRQCHIPS; i++)
  162. for (j = 0; j < KVM_IRQCHIP_NUM_PINS; j++)
  163. new->chip[i][j] = -1;
  164. for (i = 0; i < nr; ++i) {
  165. struct kvm_kernel_irq_routing_entry *e;
  166. r = -ENOMEM;
  167. e = kzalloc(sizeof(*e), GFP_KERNEL);
  168. if (!e)
  169. goto out;
  170. r = -EINVAL;
  171. if (ue->flags) {
  172. kfree(e);
  173. goto out;
  174. }
  175. r = setup_routing_entry(new, e, ue);
  176. if (r) {
  177. kfree(e);
  178. goto out;
  179. }
  180. ++ue;
  181. }
  182. mutex_lock(&kvm->irq_lock);
  183. old = kvm->irq_routing;
  184. rcu_assign_pointer(kvm->irq_routing, new);
  185. kvm_irq_routing_update(kvm);
  186. mutex_unlock(&kvm->irq_lock);
  187. kvm_arch_irq_routing_update(kvm);
  188. synchronize_srcu_expedited(&kvm->irq_srcu);
  189. new = old;
  190. r = 0;
  191. out:
  192. free_irq_routing_table(new);
  193. return r;
  194. }