irq_comm.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412
  1. /*
  2. * irq_comm.c: Common API for in kernel interrupt controller
  3. * Copyright (c) 2007, Intel Corporation.
  4. *
  5. * This program is free software; you can redistribute it and/or modify it
  6. * under the terms and conditions of the GNU General Public License,
  7. * version 2, as published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope it will be useful, but WITHOUT
  10. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11. * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
  12. * more details.
  13. *
  14. * You should have received a copy of the GNU General Public License along with
  15. * this program; if not, write to the Free Software Foundation, Inc., 59 Temple
  16. * Place - Suite 330, Boston, MA 02111-1307 USA.
  17. * Authors:
  18. * Yaozu (Eddie) Dong <Eddie.dong@intel.com>
  19. *
  20. * Copyright 2010 Red Hat, Inc. and/or its affiliates.
  21. */
  22. #include <linux/kvm_host.h>
  23. #include <linux/slab.h>
  24. #include <linux/export.h>
  25. #include <trace/events/kvm.h>
  26. #include <asm/msidef.h>
  27. #include "irq.h"
  28. #include "ioapic.h"
  29. #include "lapic.h"
  30. #include "hyperv.h"
  31. static int kvm_set_pic_irq(struct kvm_kernel_irq_routing_entry *e,
  32. struct kvm *kvm, int irq_source_id, int level,
  33. bool line_status)
  34. {
  35. struct kvm_pic *pic = pic_irqchip(kvm);
  36. return kvm_pic_set_irq(pic, e->irqchip.pin, irq_source_id, level);
  37. }
  38. static int kvm_set_ioapic_irq(struct kvm_kernel_irq_routing_entry *e,
  39. struct kvm *kvm, int irq_source_id, int level,
  40. bool line_status)
  41. {
  42. struct kvm_ioapic *ioapic = kvm->arch.vioapic;
  43. return kvm_ioapic_set_irq(ioapic, e->irqchip.pin, irq_source_id, level,
  44. line_status);
  45. }
  46. int kvm_irq_delivery_to_apic(struct kvm *kvm, struct kvm_lapic *src,
  47. struct kvm_lapic_irq *irq, unsigned long *dest_map)
  48. {
  49. int i, r = -1;
  50. struct kvm_vcpu *vcpu, *lowest = NULL;
  51. if (irq->dest_mode == 0 && irq->dest_id == 0xff &&
  52. kvm_lowest_prio_delivery(irq)) {
  53. printk(KERN_INFO "kvm: apic: phys broadcast and lowest prio\n");
  54. irq->delivery_mode = APIC_DM_FIXED;
  55. }
  56. if (kvm_irq_delivery_to_apic_fast(kvm, src, irq, &r, dest_map))
  57. return r;
  58. kvm_for_each_vcpu(i, vcpu, kvm) {
  59. if (!kvm_apic_present(vcpu))
  60. continue;
  61. if (!kvm_apic_match_dest(vcpu, src, irq->shorthand,
  62. irq->dest_id, irq->dest_mode))
  63. continue;
  64. if (!kvm_lowest_prio_delivery(irq)) {
  65. if (r < 0)
  66. r = 0;
  67. r += kvm_apic_set_irq(vcpu, irq, dest_map);
  68. } else if (kvm_lapic_enabled(vcpu)) {
  69. if (!lowest)
  70. lowest = vcpu;
  71. else if (kvm_apic_compare_prio(vcpu, lowest) < 0)
  72. lowest = vcpu;
  73. }
  74. }
  75. if (lowest)
  76. r = kvm_apic_set_irq(lowest, irq, dest_map);
  77. return r;
  78. }
  79. void kvm_set_msi_irq(struct kvm_kernel_irq_routing_entry *e,
  80. struct kvm_lapic_irq *irq)
  81. {
  82. trace_kvm_msi_set_irq(e->msi.address_lo, e->msi.data);
  83. irq->dest_id = (e->msi.address_lo &
  84. MSI_ADDR_DEST_ID_MASK) >> MSI_ADDR_DEST_ID_SHIFT;
  85. irq->vector = (e->msi.data &
  86. MSI_DATA_VECTOR_MASK) >> MSI_DATA_VECTOR_SHIFT;
  87. irq->dest_mode = (1 << MSI_ADDR_DEST_MODE_SHIFT) & e->msi.address_lo;
  88. irq->trig_mode = (1 << MSI_DATA_TRIGGER_SHIFT) & e->msi.data;
  89. irq->delivery_mode = e->msi.data & 0x700;
  90. irq->msi_redir_hint = ((e->msi.address_lo
  91. & MSI_ADDR_REDIRECTION_LOWPRI) > 0);
  92. irq->level = 1;
  93. irq->shorthand = 0;
  94. }
  95. EXPORT_SYMBOL_GPL(kvm_set_msi_irq);
  96. int kvm_set_msi(struct kvm_kernel_irq_routing_entry *e,
  97. struct kvm *kvm, int irq_source_id, int level, bool line_status)
  98. {
  99. struct kvm_lapic_irq irq;
  100. if (!level)
  101. return -1;
  102. kvm_set_msi_irq(e, &irq);
  103. return kvm_irq_delivery_to_apic(kvm, NULL, &irq, NULL);
  104. }
  105. int kvm_arch_set_irq_inatomic(struct kvm_kernel_irq_routing_entry *e,
  106. struct kvm *kvm, int irq_source_id, int level,
  107. bool line_status)
  108. {
  109. struct kvm_lapic_irq irq;
  110. int r;
  111. if (unlikely(e->type != KVM_IRQ_ROUTING_MSI))
  112. return -EWOULDBLOCK;
  113. kvm_set_msi_irq(e, &irq);
  114. if (kvm_irq_delivery_to_apic_fast(kvm, NULL, &irq, &r, NULL))
  115. return r;
  116. else
  117. return -EWOULDBLOCK;
  118. }
  119. int kvm_request_irq_source_id(struct kvm *kvm)
  120. {
  121. unsigned long *bitmap = &kvm->arch.irq_sources_bitmap;
  122. int irq_source_id;
  123. mutex_lock(&kvm->irq_lock);
  124. irq_source_id = find_first_zero_bit(bitmap, BITS_PER_LONG);
  125. if (irq_source_id >= BITS_PER_LONG) {
  126. printk(KERN_WARNING "kvm: exhaust allocatable IRQ sources!\n");
  127. irq_source_id = -EFAULT;
  128. goto unlock;
  129. }
  130. ASSERT(irq_source_id != KVM_USERSPACE_IRQ_SOURCE_ID);
  131. ASSERT(irq_source_id != KVM_IRQFD_RESAMPLE_IRQ_SOURCE_ID);
  132. set_bit(irq_source_id, bitmap);
  133. unlock:
  134. mutex_unlock(&kvm->irq_lock);
  135. return irq_source_id;
  136. }
  137. void kvm_free_irq_source_id(struct kvm *kvm, int irq_source_id)
  138. {
  139. ASSERT(irq_source_id != KVM_USERSPACE_IRQ_SOURCE_ID);
  140. ASSERT(irq_source_id != KVM_IRQFD_RESAMPLE_IRQ_SOURCE_ID);
  141. mutex_lock(&kvm->irq_lock);
  142. if (irq_source_id < 0 ||
  143. irq_source_id >= BITS_PER_LONG) {
  144. printk(KERN_ERR "kvm: IRQ source ID out of range!\n");
  145. goto unlock;
  146. }
  147. clear_bit(irq_source_id, &kvm->arch.irq_sources_bitmap);
  148. if (!ioapic_in_kernel(kvm))
  149. goto unlock;
  150. kvm_ioapic_clear_all(kvm->arch.vioapic, irq_source_id);
  151. kvm_pic_clear_all(pic_irqchip(kvm), irq_source_id);
  152. unlock:
  153. mutex_unlock(&kvm->irq_lock);
  154. }
  155. void kvm_register_irq_mask_notifier(struct kvm *kvm, int irq,
  156. struct kvm_irq_mask_notifier *kimn)
  157. {
  158. mutex_lock(&kvm->irq_lock);
  159. kimn->irq = irq;
  160. hlist_add_head_rcu(&kimn->link, &kvm->arch.mask_notifier_list);
  161. mutex_unlock(&kvm->irq_lock);
  162. }
  163. void kvm_unregister_irq_mask_notifier(struct kvm *kvm, int irq,
  164. struct kvm_irq_mask_notifier *kimn)
  165. {
  166. mutex_lock(&kvm->irq_lock);
  167. hlist_del_rcu(&kimn->link);
  168. mutex_unlock(&kvm->irq_lock);
  169. synchronize_srcu(&kvm->irq_srcu);
  170. }
  171. void kvm_fire_mask_notifiers(struct kvm *kvm, unsigned irqchip, unsigned pin,
  172. bool mask)
  173. {
  174. struct kvm_irq_mask_notifier *kimn;
  175. int idx, gsi;
  176. idx = srcu_read_lock(&kvm->irq_srcu);
  177. gsi = kvm_irq_map_chip_pin(kvm, irqchip, pin);
  178. if (gsi != -1)
  179. hlist_for_each_entry_rcu(kimn, &kvm->arch.mask_notifier_list, link)
  180. if (kimn->irq == gsi)
  181. kimn->func(kimn, mask);
  182. srcu_read_unlock(&kvm->irq_srcu, idx);
  183. }
  184. static int kvm_hv_set_sint(struct kvm_kernel_irq_routing_entry *e,
  185. struct kvm *kvm, int irq_source_id, int level,
  186. bool line_status)
  187. {
  188. if (!level)
  189. return -1;
  190. return kvm_hv_synic_set_irq(kvm, e->hv_sint.vcpu, e->hv_sint.sint);
  191. }
  192. int kvm_set_routing_entry(struct kvm_kernel_irq_routing_entry *e,
  193. const struct kvm_irq_routing_entry *ue)
  194. {
  195. int r = -EINVAL;
  196. int delta;
  197. unsigned max_pin;
  198. switch (ue->type) {
  199. case KVM_IRQ_ROUTING_IRQCHIP:
  200. delta = 0;
  201. switch (ue->u.irqchip.irqchip) {
  202. case KVM_IRQCHIP_PIC_MASTER:
  203. e->set = kvm_set_pic_irq;
  204. max_pin = PIC_NUM_PINS;
  205. break;
  206. case KVM_IRQCHIP_PIC_SLAVE:
  207. e->set = kvm_set_pic_irq;
  208. max_pin = PIC_NUM_PINS;
  209. delta = 8;
  210. break;
  211. case KVM_IRQCHIP_IOAPIC:
  212. max_pin = KVM_IOAPIC_NUM_PINS;
  213. e->set = kvm_set_ioapic_irq;
  214. break;
  215. default:
  216. goto out;
  217. }
  218. e->irqchip.irqchip = ue->u.irqchip.irqchip;
  219. e->irqchip.pin = ue->u.irqchip.pin + delta;
  220. if (e->irqchip.pin >= max_pin)
  221. goto out;
  222. break;
  223. case KVM_IRQ_ROUTING_MSI:
  224. e->set = kvm_set_msi;
  225. e->msi.address_lo = ue->u.msi.address_lo;
  226. e->msi.address_hi = ue->u.msi.address_hi;
  227. e->msi.data = ue->u.msi.data;
  228. break;
  229. case KVM_IRQ_ROUTING_HV_SINT:
  230. e->set = kvm_hv_set_sint;
  231. e->hv_sint.vcpu = ue->u.hv_sint.vcpu;
  232. e->hv_sint.sint = ue->u.hv_sint.sint;
  233. break;
  234. default:
  235. goto out;
  236. }
  237. r = 0;
  238. out:
  239. return r;
  240. }
  241. bool kvm_intr_is_single_vcpu(struct kvm *kvm, struct kvm_lapic_irq *irq,
  242. struct kvm_vcpu **dest_vcpu)
  243. {
  244. int i, r = 0;
  245. struct kvm_vcpu *vcpu;
  246. if (kvm_intr_is_single_vcpu_fast(kvm, irq, dest_vcpu))
  247. return true;
  248. kvm_for_each_vcpu(i, vcpu, kvm) {
  249. if (!kvm_apic_present(vcpu))
  250. continue;
  251. if (!kvm_apic_match_dest(vcpu, NULL, irq->shorthand,
  252. irq->dest_id, irq->dest_mode))
  253. continue;
  254. if (++r == 2)
  255. return false;
  256. *dest_vcpu = vcpu;
  257. }
  258. return r == 1;
  259. }
  260. EXPORT_SYMBOL_GPL(kvm_intr_is_single_vcpu);
  261. #define IOAPIC_ROUTING_ENTRY(irq) \
  262. { .gsi = irq, .type = KVM_IRQ_ROUTING_IRQCHIP, \
  263. .u.irqchip = { .irqchip = KVM_IRQCHIP_IOAPIC, .pin = (irq) } }
  264. #define ROUTING_ENTRY1(irq) IOAPIC_ROUTING_ENTRY(irq)
  265. #define PIC_ROUTING_ENTRY(irq) \
  266. { .gsi = irq, .type = KVM_IRQ_ROUTING_IRQCHIP, \
  267. .u.irqchip = { .irqchip = SELECT_PIC(irq), .pin = (irq) % 8 } }
  268. #define ROUTING_ENTRY2(irq) \
  269. IOAPIC_ROUTING_ENTRY(irq), PIC_ROUTING_ENTRY(irq)
  270. static const struct kvm_irq_routing_entry default_routing[] = {
  271. ROUTING_ENTRY2(0), ROUTING_ENTRY2(1),
  272. ROUTING_ENTRY2(2), ROUTING_ENTRY2(3),
  273. ROUTING_ENTRY2(4), ROUTING_ENTRY2(5),
  274. ROUTING_ENTRY2(6), ROUTING_ENTRY2(7),
  275. ROUTING_ENTRY2(8), ROUTING_ENTRY2(9),
  276. ROUTING_ENTRY2(10), ROUTING_ENTRY2(11),
  277. ROUTING_ENTRY2(12), ROUTING_ENTRY2(13),
  278. ROUTING_ENTRY2(14), ROUTING_ENTRY2(15),
  279. ROUTING_ENTRY1(16), ROUTING_ENTRY1(17),
  280. ROUTING_ENTRY1(18), ROUTING_ENTRY1(19),
  281. ROUTING_ENTRY1(20), ROUTING_ENTRY1(21),
  282. ROUTING_ENTRY1(22), ROUTING_ENTRY1(23),
  283. };
  284. int kvm_setup_default_irq_routing(struct kvm *kvm)
  285. {
  286. return kvm_set_irq_routing(kvm, default_routing,
  287. ARRAY_SIZE(default_routing), 0);
  288. }
  289. static const struct kvm_irq_routing_entry empty_routing[] = {};
  290. int kvm_setup_empty_irq_routing(struct kvm *kvm)
  291. {
  292. return kvm_set_irq_routing(kvm, empty_routing, 0, 0);
  293. }
  294. void kvm_arch_post_irq_routing_update(struct kvm *kvm)
  295. {
  296. if (ioapic_in_kernel(kvm) || !irqchip_in_kernel(kvm))
  297. return;
  298. kvm_make_scan_ioapic_request(kvm);
  299. }
  300. void kvm_scan_ioapic_routes(struct kvm_vcpu *vcpu,
  301. ulong *ioapic_handled_vectors)
  302. {
  303. struct kvm *kvm = vcpu->kvm;
  304. struct kvm_kernel_irq_routing_entry *entry;
  305. struct kvm_irq_routing_table *table;
  306. u32 i, nr_ioapic_pins;
  307. int idx;
  308. /* kvm->irq_routing must be read after clearing
  309. * KVM_SCAN_IOAPIC. */
  310. smp_mb();
  311. idx = srcu_read_lock(&kvm->irq_srcu);
  312. table = srcu_dereference(kvm->irq_routing, &kvm->irq_srcu);
  313. nr_ioapic_pins = min_t(u32, table->nr_rt_entries,
  314. kvm->arch.nr_reserved_ioapic_pins);
  315. for (i = 0; i < nr_ioapic_pins; ++i) {
  316. hlist_for_each_entry(entry, &table->map[i], link) {
  317. u32 dest_id, dest_mode;
  318. bool level;
  319. if (entry->type != KVM_IRQ_ROUTING_MSI)
  320. continue;
  321. dest_id = (entry->msi.address_lo >> 12) & 0xff;
  322. dest_mode = (entry->msi.address_lo >> 2) & 0x1;
  323. level = entry->msi.data & MSI_DATA_TRIGGER_LEVEL;
  324. if (level && kvm_apic_match_dest(vcpu, NULL, 0,
  325. dest_id, dest_mode)) {
  326. u32 vector = entry->msi.data & 0xff;
  327. __set_bit(vector,
  328. ioapic_handled_vectors);
  329. }
  330. }
  331. }
  332. srcu_read_unlock(&kvm->irq_srcu, idx);
  333. }
  334. int kvm_arch_set_irq(struct kvm_kernel_irq_routing_entry *irq, struct kvm *kvm,
  335. int irq_source_id, int level, bool line_status)
  336. {
  337. switch (irq->type) {
  338. case KVM_IRQ_ROUTING_HV_SINT:
  339. return kvm_hv_set_sint(irq, kvm, irq_source_id, level,
  340. line_status);
  341. default:
  342. return -EWOULDBLOCK;
  343. }
  344. }
  345. void kvm_arch_irq_routing_update(struct kvm *kvm)
  346. {
  347. kvm_hv_irq_routing_update(kvm);
  348. }