irq_comm.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450
  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. */
  21. #include <linux/kvm_host.h>
  22. #include <trace/events/kvm.h>
  23. #include <asm/msidef.h>
  24. #ifdef CONFIG_IA64
  25. #include <asm/iosapic.h>
  26. #endif
  27. #include "irq.h"
  28. #include "ioapic.h"
  29. static inline int kvm_irq_line_state(unsigned long *irq_state,
  30. int irq_source_id, int level)
  31. {
  32. /* Logical OR for level trig interrupt */
  33. if (level)
  34. set_bit(irq_source_id, irq_state);
  35. else
  36. clear_bit(irq_source_id, irq_state);
  37. return !!(*irq_state);
  38. }
  39. static int kvm_set_pic_irq(struct kvm_kernel_irq_routing_entry *e,
  40. struct kvm *kvm, int irq_source_id, int level)
  41. {
  42. #ifdef CONFIG_X86
  43. struct kvm_pic *pic = pic_irqchip(kvm);
  44. level = kvm_irq_line_state(&pic->irq_states[e->irqchip.pin],
  45. irq_source_id, level);
  46. return kvm_pic_set_irq(pic, e->irqchip.pin, level);
  47. #else
  48. return -1;
  49. #endif
  50. }
  51. static int kvm_set_ioapic_irq(struct kvm_kernel_irq_routing_entry *e,
  52. struct kvm *kvm, int irq_source_id, int level)
  53. {
  54. struct kvm_ioapic *ioapic = kvm->arch.vioapic;
  55. level = kvm_irq_line_state(&ioapic->irq_states[e->irqchip.pin],
  56. irq_source_id, level);
  57. return kvm_ioapic_set_irq(ioapic, e->irqchip.pin, level);
  58. }
  59. inline static bool kvm_is_dm_lowest_prio(struct kvm_lapic_irq *irq)
  60. {
  61. #ifdef CONFIG_IA64
  62. return irq->delivery_mode ==
  63. (IOSAPIC_LOWEST_PRIORITY << IOSAPIC_DELIVERY_SHIFT);
  64. #else
  65. return irq->delivery_mode == APIC_DM_LOWEST;
  66. #endif
  67. }
  68. int kvm_irq_delivery_to_apic(struct kvm *kvm, struct kvm_lapic *src,
  69. struct kvm_lapic_irq *irq)
  70. {
  71. int i, r = -1;
  72. struct kvm_vcpu *vcpu, *lowest = NULL;
  73. WARN_ON(!mutex_is_locked(&kvm->irq_lock));
  74. if (irq->dest_mode == 0 && irq->dest_id == 0xff &&
  75. kvm_is_dm_lowest_prio(irq))
  76. printk(KERN_INFO "kvm: apic: phys broadcast and lowest prio\n");
  77. kvm_for_each_vcpu(i, vcpu, kvm) {
  78. if (!kvm_apic_present(vcpu))
  79. continue;
  80. if (!kvm_apic_match_dest(vcpu, src, irq->shorthand,
  81. irq->dest_id, irq->dest_mode))
  82. continue;
  83. if (!kvm_is_dm_lowest_prio(irq)) {
  84. if (r < 0)
  85. r = 0;
  86. r += kvm_apic_set_irq(vcpu, irq);
  87. } else {
  88. if (!lowest)
  89. lowest = vcpu;
  90. else if (kvm_apic_compare_prio(vcpu, lowest) < 0)
  91. lowest = vcpu;
  92. }
  93. }
  94. if (lowest)
  95. r = kvm_apic_set_irq(lowest, irq);
  96. return r;
  97. }
  98. static int kvm_set_msi(struct kvm_kernel_irq_routing_entry *e,
  99. struct kvm *kvm, int irq_source_id, int level)
  100. {
  101. struct kvm_lapic_irq irq;
  102. if (!level)
  103. return -1;
  104. trace_kvm_msi_set_irq(e->msi.address_lo, e->msi.data);
  105. irq.dest_id = (e->msi.address_lo &
  106. MSI_ADDR_DEST_ID_MASK) >> MSI_ADDR_DEST_ID_SHIFT;
  107. irq.vector = (e->msi.data &
  108. MSI_DATA_VECTOR_MASK) >> MSI_DATA_VECTOR_SHIFT;
  109. irq.dest_mode = (1 << MSI_ADDR_DEST_MODE_SHIFT) & e->msi.address_lo;
  110. irq.trig_mode = (1 << MSI_DATA_TRIGGER_SHIFT) & e->msi.data;
  111. irq.delivery_mode = e->msi.data & 0x700;
  112. irq.level = 1;
  113. irq.shorthand = 0;
  114. /* TODO Deal with RH bit of MSI message address */
  115. return kvm_irq_delivery_to_apic(kvm, NULL, &irq);
  116. }
  117. /* This should be called with the kvm->irq_lock mutex held
  118. * Return value:
  119. * < 0 Interrupt was ignored (masked or not delivered for other reasons)
  120. * = 0 Interrupt was coalesced (previous irq is still pending)
  121. * > 0 Number of CPUs interrupt was delivered to
  122. */
  123. int kvm_set_irq(struct kvm *kvm, int irq_source_id, u32 irq, int level)
  124. {
  125. struct kvm_kernel_irq_routing_entry *e;
  126. int ret = -1;
  127. struct kvm_irq_routing_table *irq_rt;
  128. struct hlist_node *n;
  129. trace_kvm_set_irq(irq, level, irq_source_id);
  130. WARN_ON(!mutex_is_locked(&kvm->irq_lock));
  131. /* Not possible to detect if the guest uses the PIC or the
  132. * IOAPIC. So set the bit in both. The guest will ignore
  133. * writes to the unused one.
  134. */
  135. irq_rt = kvm->irq_routing;
  136. if (irq < irq_rt->nr_rt_entries)
  137. hlist_for_each_entry(e, n, &irq_rt->map[irq], link) {
  138. int r = e->set(e, kvm, irq_source_id, level);
  139. if (r < 0)
  140. continue;
  141. ret = r + ((ret < 0) ? 0 : ret);
  142. }
  143. return ret;
  144. }
  145. void kvm_notify_acked_irq(struct kvm *kvm, unsigned irqchip, unsigned pin)
  146. {
  147. struct kvm_irq_ack_notifier *kian;
  148. struct hlist_node *n;
  149. int gsi;
  150. trace_kvm_ack_irq(irqchip, pin);
  151. gsi = kvm->irq_routing->chip[irqchip][pin];
  152. if (gsi != -1)
  153. hlist_for_each_entry(kian, n, &kvm->arch.irq_ack_notifier_list,
  154. link)
  155. if (kian->gsi == gsi)
  156. kian->irq_acked(kian);
  157. }
  158. void kvm_register_irq_ack_notifier(struct kvm *kvm,
  159. struct kvm_irq_ack_notifier *kian)
  160. {
  161. mutex_lock(&kvm->irq_lock);
  162. hlist_add_head(&kian->link, &kvm->arch.irq_ack_notifier_list);
  163. mutex_unlock(&kvm->irq_lock);
  164. }
  165. void kvm_unregister_irq_ack_notifier(struct kvm *kvm,
  166. struct kvm_irq_ack_notifier *kian)
  167. {
  168. mutex_lock(&kvm->irq_lock);
  169. hlist_del_init(&kian->link);
  170. mutex_unlock(&kvm->irq_lock);
  171. }
  172. int kvm_request_irq_source_id(struct kvm *kvm)
  173. {
  174. unsigned long *bitmap = &kvm->arch.irq_sources_bitmap;
  175. int irq_source_id;
  176. mutex_lock(&kvm->irq_lock);
  177. irq_source_id = find_first_zero_bit(bitmap,
  178. sizeof(kvm->arch.irq_sources_bitmap));
  179. if (irq_source_id >= sizeof(kvm->arch.irq_sources_bitmap)) {
  180. printk(KERN_WARNING "kvm: exhaust allocatable IRQ sources!\n");
  181. return -EFAULT;
  182. }
  183. ASSERT(irq_source_id != KVM_USERSPACE_IRQ_SOURCE_ID);
  184. set_bit(irq_source_id, bitmap);
  185. mutex_unlock(&kvm->irq_lock);
  186. return irq_source_id;
  187. }
  188. void kvm_free_irq_source_id(struct kvm *kvm, int irq_source_id)
  189. {
  190. int i;
  191. ASSERT(irq_source_id != KVM_USERSPACE_IRQ_SOURCE_ID);
  192. mutex_lock(&kvm->irq_lock);
  193. if (irq_source_id < 0 ||
  194. irq_source_id >= sizeof(kvm->arch.irq_sources_bitmap)) {
  195. printk(KERN_ERR "kvm: IRQ source ID out of range!\n");
  196. return;
  197. }
  198. for (i = 0; i < KVM_IOAPIC_NUM_PINS; i++) {
  199. clear_bit(irq_source_id, &kvm->arch.vioapic->irq_states[i]);
  200. if (i >= 16)
  201. continue;
  202. #ifdef CONFIG_X86
  203. clear_bit(irq_source_id, &pic_irqchip(kvm)->irq_states[i]);
  204. #endif
  205. }
  206. clear_bit(irq_source_id, &kvm->arch.irq_sources_bitmap);
  207. mutex_unlock(&kvm->irq_lock);
  208. }
  209. void kvm_register_irq_mask_notifier(struct kvm *kvm, int irq,
  210. struct kvm_irq_mask_notifier *kimn)
  211. {
  212. mutex_lock(&kvm->irq_lock);
  213. kimn->irq = irq;
  214. hlist_add_head(&kimn->link, &kvm->mask_notifier_list);
  215. mutex_unlock(&kvm->irq_lock);
  216. }
  217. void kvm_unregister_irq_mask_notifier(struct kvm *kvm, int irq,
  218. struct kvm_irq_mask_notifier *kimn)
  219. {
  220. mutex_lock(&kvm->irq_lock);
  221. hlist_del(&kimn->link);
  222. mutex_unlock(&kvm->irq_lock);
  223. }
  224. void kvm_fire_mask_notifiers(struct kvm *kvm, int irq, bool mask)
  225. {
  226. struct kvm_irq_mask_notifier *kimn;
  227. struct hlist_node *n;
  228. WARN_ON(!mutex_is_locked(&kvm->irq_lock));
  229. hlist_for_each_entry(kimn, n, &kvm->mask_notifier_list, link)
  230. if (kimn->irq == irq)
  231. kimn->func(kimn, mask);
  232. }
  233. void kvm_free_irq_routing(struct kvm *kvm)
  234. {
  235. mutex_lock(&kvm->irq_lock);
  236. kfree(kvm->irq_routing);
  237. mutex_unlock(&kvm->irq_lock);
  238. }
  239. static int setup_routing_entry(struct kvm_irq_routing_table *rt,
  240. struct kvm_kernel_irq_routing_entry *e,
  241. const struct kvm_irq_routing_entry *ue)
  242. {
  243. int r = -EINVAL;
  244. int delta;
  245. struct kvm_kernel_irq_routing_entry *ei;
  246. struct hlist_node *n;
  247. /*
  248. * Do not allow GSI to be mapped to the same irqchip more than once.
  249. * Allow only one to one mapping between GSI and MSI.
  250. */
  251. hlist_for_each_entry(ei, n, &rt->map[ue->gsi], link)
  252. if (ei->type == KVM_IRQ_ROUTING_MSI ||
  253. ue->u.irqchip.irqchip == ei->irqchip.irqchip)
  254. return r;
  255. e->gsi = ue->gsi;
  256. e->type = ue->type;
  257. switch (ue->type) {
  258. case KVM_IRQ_ROUTING_IRQCHIP:
  259. delta = 0;
  260. switch (ue->u.irqchip.irqchip) {
  261. case KVM_IRQCHIP_PIC_MASTER:
  262. e->set = kvm_set_pic_irq;
  263. break;
  264. case KVM_IRQCHIP_PIC_SLAVE:
  265. e->set = kvm_set_pic_irq;
  266. delta = 8;
  267. break;
  268. case KVM_IRQCHIP_IOAPIC:
  269. e->set = kvm_set_ioapic_irq;
  270. break;
  271. default:
  272. goto out;
  273. }
  274. e->irqchip.irqchip = ue->u.irqchip.irqchip;
  275. e->irqchip.pin = ue->u.irqchip.pin + delta;
  276. if (e->irqchip.pin >= KVM_IOAPIC_NUM_PINS)
  277. goto out;
  278. rt->chip[ue->u.irqchip.irqchip][e->irqchip.pin] = ue->gsi;
  279. break;
  280. case KVM_IRQ_ROUTING_MSI:
  281. e->set = kvm_set_msi;
  282. e->msi.address_lo = ue->u.msi.address_lo;
  283. e->msi.address_hi = ue->u.msi.address_hi;
  284. e->msi.data = ue->u.msi.data;
  285. break;
  286. default:
  287. goto out;
  288. }
  289. hlist_add_head(&e->link, &rt->map[e->gsi]);
  290. r = 0;
  291. out:
  292. return r;
  293. }
  294. int kvm_set_irq_routing(struct kvm *kvm,
  295. const struct kvm_irq_routing_entry *ue,
  296. unsigned nr,
  297. unsigned flags)
  298. {
  299. struct kvm_irq_routing_table *new, *old;
  300. u32 i, j, nr_rt_entries = 0;
  301. int r;
  302. for (i = 0; i < nr; ++i) {
  303. if (ue[i].gsi >= KVM_MAX_IRQ_ROUTES)
  304. return -EINVAL;
  305. nr_rt_entries = max(nr_rt_entries, ue[i].gsi);
  306. }
  307. nr_rt_entries += 1;
  308. new = kzalloc(sizeof(*new) + (nr_rt_entries * sizeof(struct hlist_head))
  309. + (nr * sizeof(struct kvm_kernel_irq_routing_entry)),
  310. GFP_KERNEL);
  311. if (!new)
  312. return -ENOMEM;
  313. new->rt_entries = (void *)&new->map[nr_rt_entries];
  314. new->nr_rt_entries = nr_rt_entries;
  315. for (i = 0; i < 3; i++)
  316. for (j = 0; j < KVM_IOAPIC_NUM_PINS; j++)
  317. new->chip[i][j] = -1;
  318. for (i = 0; i < nr; ++i) {
  319. r = -EINVAL;
  320. if (ue->flags)
  321. goto out;
  322. r = setup_routing_entry(new, &new->rt_entries[i], ue);
  323. if (r)
  324. goto out;
  325. ++ue;
  326. }
  327. mutex_lock(&kvm->irq_lock);
  328. old = kvm->irq_routing;
  329. kvm->irq_routing = new;
  330. mutex_unlock(&kvm->irq_lock);
  331. new = old;
  332. r = 0;
  333. out:
  334. kfree(new);
  335. return r;
  336. }
  337. #define IOAPIC_ROUTING_ENTRY(irq) \
  338. { .gsi = irq, .type = KVM_IRQ_ROUTING_IRQCHIP, \
  339. .u.irqchip.irqchip = KVM_IRQCHIP_IOAPIC, .u.irqchip.pin = (irq) }
  340. #define ROUTING_ENTRY1(irq) IOAPIC_ROUTING_ENTRY(irq)
  341. #ifdef CONFIG_X86
  342. # define PIC_ROUTING_ENTRY(irq) \
  343. { .gsi = irq, .type = KVM_IRQ_ROUTING_IRQCHIP, \
  344. .u.irqchip.irqchip = SELECT_PIC(irq), .u.irqchip.pin = (irq) % 8 }
  345. # define ROUTING_ENTRY2(irq) \
  346. IOAPIC_ROUTING_ENTRY(irq), PIC_ROUTING_ENTRY(irq)
  347. #else
  348. # define ROUTING_ENTRY2(irq) \
  349. IOAPIC_ROUTING_ENTRY(irq)
  350. #endif
  351. static const struct kvm_irq_routing_entry default_routing[] = {
  352. ROUTING_ENTRY2(0), ROUTING_ENTRY2(1),
  353. ROUTING_ENTRY2(2), ROUTING_ENTRY2(3),
  354. ROUTING_ENTRY2(4), ROUTING_ENTRY2(5),
  355. ROUTING_ENTRY2(6), ROUTING_ENTRY2(7),
  356. ROUTING_ENTRY2(8), ROUTING_ENTRY2(9),
  357. ROUTING_ENTRY2(10), ROUTING_ENTRY2(11),
  358. ROUTING_ENTRY2(12), ROUTING_ENTRY2(13),
  359. ROUTING_ENTRY2(14), ROUTING_ENTRY2(15),
  360. ROUTING_ENTRY1(16), ROUTING_ENTRY1(17),
  361. ROUTING_ENTRY1(18), ROUTING_ENTRY1(19),
  362. ROUTING_ENTRY1(20), ROUTING_ENTRY1(21),
  363. ROUTING_ENTRY1(22), ROUTING_ENTRY1(23),
  364. #ifdef CONFIG_IA64
  365. ROUTING_ENTRY1(24), ROUTING_ENTRY1(25),
  366. ROUTING_ENTRY1(26), ROUTING_ENTRY1(27),
  367. ROUTING_ENTRY1(28), ROUTING_ENTRY1(29),
  368. ROUTING_ENTRY1(30), ROUTING_ENTRY1(31),
  369. ROUTING_ENTRY1(32), ROUTING_ENTRY1(33),
  370. ROUTING_ENTRY1(34), ROUTING_ENTRY1(35),
  371. ROUTING_ENTRY1(36), ROUTING_ENTRY1(37),
  372. ROUTING_ENTRY1(38), ROUTING_ENTRY1(39),
  373. ROUTING_ENTRY1(40), ROUTING_ENTRY1(41),
  374. ROUTING_ENTRY1(42), ROUTING_ENTRY1(43),
  375. ROUTING_ENTRY1(44), ROUTING_ENTRY1(45),
  376. ROUTING_ENTRY1(46), ROUTING_ENTRY1(47),
  377. #endif
  378. };
  379. int kvm_setup_default_irq_routing(struct kvm *kvm)
  380. {
  381. return kvm_set_irq_routing(kvm, default_routing,
  382. ARRAY_SIZE(default_routing), 0);
  383. }