irq_comm.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468
  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 <linux/slab.h>
  23. #include <trace/events/kvm.h>
  24. #include <asm/msidef.h>
  25. #ifdef CONFIG_IA64
  26. #include <asm/iosapic.h>
  27. #endif
  28. #include "irq.h"
  29. #include "ioapic.h"
  30. static inline int kvm_irq_line_state(unsigned long *irq_state,
  31. int irq_source_id, int level)
  32. {
  33. /* Logical OR for level trig interrupt */
  34. if (level)
  35. set_bit(irq_source_id, irq_state);
  36. else
  37. clear_bit(irq_source_id, irq_state);
  38. return !!(*irq_state);
  39. }
  40. static int kvm_set_pic_irq(struct kvm_kernel_irq_routing_entry *e,
  41. struct kvm *kvm, int irq_source_id, int level)
  42. {
  43. #ifdef CONFIG_X86
  44. struct kvm_pic *pic = pic_irqchip(kvm);
  45. level = kvm_irq_line_state(&pic->irq_states[e->irqchip.pin],
  46. irq_source_id, level);
  47. return kvm_pic_set_irq(pic, e->irqchip.pin, level);
  48. #else
  49. return -1;
  50. #endif
  51. }
  52. static int kvm_set_ioapic_irq(struct kvm_kernel_irq_routing_entry *e,
  53. struct kvm *kvm, int irq_source_id, int level)
  54. {
  55. struct kvm_ioapic *ioapic = kvm->arch.vioapic;
  56. level = kvm_irq_line_state(&ioapic->irq_states[e->irqchip.pin],
  57. irq_source_id, level);
  58. return kvm_ioapic_set_irq(ioapic, e->irqchip.pin, level);
  59. }
  60. inline static bool kvm_is_dm_lowest_prio(struct kvm_lapic_irq *irq)
  61. {
  62. #ifdef CONFIG_IA64
  63. return irq->delivery_mode ==
  64. (IOSAPIC_LOWEST_PRIORITY << IOSAPIC_DELIVERY_SHIFT);
  65. #else
  66. return irq->delivery_mode == APIC_DM_LOWEST;
  67. #endif
  68. }
  69. int kvm_irq_delivery_to_apic(struct kvm *kvm, struct kvm_lapic *src,
  70. struct kvm_lapic_irq *irq)
  71. {
  72. int i, r = -1;
  73. struct kvm_vcpu *vcpu, *lowest = NULL;
  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. /*
  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, irq_set[KVM_NR_IRQCHIPS];
  126. int ret = -1, i = 0;
  127. struct kvm_irq_routing_table *irq_rt;
  128. struct hlist_node *n;
  129. trace_kvm_set_irq(irq, level, irq_source_id);
  130. /* Not possible to detect if the guest uses the PIC or the
  131. * IOAPIC. So set the bit in both. The guest will ignore
  132. * writes to the unused one.
  133. */
  134. rcu_read_lock();
  135. irq_rt = rcu_dereference(kvm->irq_routing);
  136. if (irq < irq_rt->nr_rt_entries)
  137. hlist_for_each_entry(e, n, &irq_rt->map[irq], link)
  138. irq_set[i++] = *e;
  139. rcu_read_unlock();
  140. while(i--) {
  141. int r;
  142. r = irq_set[i].set(&irq_set[i], kvm, irq_source_id, level);
  143. if (r < 0)
  144. continue;
  145. ret = r + ((ret < 0) ? 0 : ret);
  146. }
  147. return ret;
  148. }
  149. void kvm_notify_acked_irq(struct kvm *kvm, unsigned irqchip, unsigned pin)
  150. {
  151. struct kvm_irq_ack_notifier *kian;
  152. struct hlist_node *n;
  153. int gsi;
  154. trace_kvm_ack_irq(irqchip, pin);
  155. rcu_read_lock();
  156. gsi = rcu_dereference(kvm->irq_routing)->chip[irqchip][pin];
  157. if (gsi != -1)
  158. hlist_for_each_entry_rcu(kian, n, &kvm->irq_ack_notifier_list,
  159. link)
  160. if (kian->gsi == gsi)
  161. kian->irq_acked(kian);
  162. rcu_read_unlock();
  163. }
  164. void kvm_register_irq_ack_notifier(struct kvm *kvm,
  165. struct kvm_irq_ack_notifier *kian)
  166. {
  167. mutex_lock(&kvm->irq_lock);
  168. hlist_add_head_rcu(&kian->link, &kvm->irq_ack_notifier_list);
  169. mutex_unlock(&kvm->irq_lock);
  170. }
  171. void kvm_unregister_irq_ack_notifier(struct kvm *kvm,
  172. struct kvm_irq_ack_notifier *kian)
  173. {
  174. mutex_lock(&kvm->irq_lock);
  175. hlist_del_init_rcu(&kian->link);
  176. mutex_unlock(&kvm->irq_lock);
  177. synchronize_rcu();
  178. }
  179. int kvm_request_irq_source_id(struct kvm *kvm)
  180. {
  181. unsigned long *bitmap = &kvm->arch.irq_sources_bitmap;
  182. int irq_source_id;
  183. mutex_lock(&kvm->irq_lock);
  184. irq_source_id = find_first_zero_bit(bitmap, BITS_PER_LONG);
  185. if (irq_source_id >= BITS_PER_LONG) {
  186. printk(KERN_WARNING "kvm: exhaust allocatable IRQ sources!\n");
  187. irq_source_id = -EFAULT;
  188. goto unlock;
  189. }
  190. ASSERT(irq_source_id != KVM_USERSPACE_IRQ_SOURCE_ID);
  191. set_bit(irq_source_id, bitmap);
  192. unlock:
  193. mutex_unlock(&kvm->irq_lock);
  194. return irq_source_id;
  195. }
  196. void kvm_free_irq_source_id(struct kvm *kvm, int irq_source_id)
  197. {
  198. int i;
  199. ASSERT(irq_source_id != KVM_USERSPACE_IRQ_SOURCE_ID);
  200. mutex_lock(&kvm->irq_lock);
  201. if (irq_source_id < 0 ||
  202. irq_source_id >= BITS_PER_LONG) {
  203. printk(KERN_ERR "kvm: IRQ source ID out of range!\n");
  204. goto unlock;
  205. }
  206. clear_bit(irq_source_id, &kvm->arch.irq_sources_bitmap);
  207. if (!irqchip_in_kernel(kvm))
  208. goto unlock;
  209. for (i = 0; i < KVM_IOAPIC_NUM_PINS; i++) {
  210. clear_bit(irq_source_id, &kvm->arch.vioapic->irq_states[i]);
  211. if (i >= 16)
  212. continue;
  213. #ifdef CONFIG_X86
  214. clear_bit(irq_source_id, &pic_irqchip(kvm)->irq_states[i]);
  215. #endif
  216. }
  217. unlock:
  218. mutex_unlock(&kvm->irq_lock);
  219. }
  220. void kvm_register_irq_mask_notifier(struct kvm *kvm, int irq,
  221. struct kvm_irq_mask_notifier *kimn)
  222. {
  223. mutex_lock(&kvm->irq_lock);
  224. kimn->irq = irq;
  225. hlist_add_head_rcu(&kimn->link, &kvm->mask_notifier_list);
  226. mutex_unlock(&kvm->irq_lock);
  227. }
  228. void kvm_unregister_irq_mask_notifier(struct kvm *kvm, int irq,
  229. struct kvm_irq_mask_notifier *kimn)
  230. {
  231. mutex_lock(&kvm->irq_lock);
  232. hlist_del_rcu(&kimn->link);
  233. mutex_unlock(&kvm->irq_lock);
  234. synchronize_rcu();
  235. }
  236. void kvm_fire_mask_notifiers(struct kvm *kvm, int irq, bool mask)
  237. {
  238. struct kvm_irq_mask_notifier *kimn;
  239. struct hlist_node *n;
  240. rcu_read_lock();
  241. hlist_for_each_entry_rcu(kimn, n, &kvm->mask_notifier_list, link)
  242. if (kimn->irq == irq)
  243. kimn->func(kimn, mask);
  244. rcu_read_unlock();
  245. }
  246. void kvm_free_irq_routing(struct kvm *kvm)
  247. {
  248. /* Called only during vm destruction. Nobody can use the pointer
  249. at this stage */
  250. kfree(kvm->irq_routing);
  251. }
  252. static int setup_routing_entry(struct kvm_irq_routing_table *rt,
  253. struct kvm_kernel_irq_routing_entry *e,
  254. const struct kvm_irq_routing_entry *ue)
  255. {
  256. int r = -EINVAL;
  257. int delta;
  258. unsigned max_pin;
  259. struct kvm_kernel_irq_routing_entry *ei;
  260. struct hlist_node *n;
  261. /*
  262. * Do not allow GSI to be mapped to the same irqchip more than once.
  263. * Allow only one to one mapping between GSI and MSI.
  264. */
  265. hlist_for_each_entry(ei, n, &rt->map[ue->gsi], link)
  266. if (ei->type == KVM_IRQ_ROUTING_MSI ||
  267. ue->u.irqchip.irqchip == ei->irqchip.irqchip)
  268. return r;
  269. e->gsi = ue->gsi;
  270. e->type = ue->type;
  271. switch (ue->type) {
  272. case KVM_IRQ_ROUTING_IRQCHIP:
  273. delta = 0;
  274. switch (ue->u.irqchip.irqchip) {
  275. case KVM_IRQCHIP_PIC_MASTER:
  276. e->set = kvm_set_pic_irq;
  277. max_pin = 16;
  278. break;
  279. case KVM_IRQCHIP_PIC_SLAVE:
  280. e->set = kvm_set_pic_irq;
  281. max_pin = 16;
  282. delta = 8;
  283. break;
  284. case KVM_IRQCHIP_IOAPIC:
  285. max_pin = KVM_IOAPIC_NUM_PINS;
  286. e->set = kvm_set_ioapic_irq;
  287. break;
  288. default:
  289. goto out;
  290. }
  291. e->irqchip.irqchip = ue->u.irqchip.irqchip;
  292. e->irqchip.pin = ue->u.irqchip.pin + delta;
  293. if (e->irqchip.pin >= max_pin)
  294. goto out;
  295. rt->chip[ue->u.irqchip.irqchip][e->irqchip.pin] = ue->gsi;
  296. break;
  297. case KVM_IRQ_ROUTING_MSI:
  298. e->set = kvm_set_msi;
  299. e->msi.address_lo = ue->u.msi.address_lo;
  300. e->msi.address_hi = ue->u.msi.address_hi;
  301. e->msi.data = ue->u.msi.data;
  302. break;
  303. default:
  304. goto out;
  305. }
  306. hlist_add_head(&e->link, &rt->map[e->gsi]);
  307. r = 0;
  308. out:
  309. return r;
  310. }
  311. int kvm_set_irq_routing(struct kvm *kvm,
  312. const struct kvm_irq_routing_entry *ue,
  313. unsigned nr,
  314. unsigned flags)
  315. {
  316. struct kvm_irq_routing_table *new, *old;
  317. u32 i, j, nr_rt_entries = 0;
  318. int r;
  319. for (i = 0; i < nr; ++i) {
  320. if (ue[i].gsi >= KVM_MAX_IRQ_ROUTES)
  321. return -EINVAL;
  322. nr_rt_entries = max(nr_rt_entries, ue[i].gsi);
  323. }
  324. nr_rt_entries += 1;
  325. new = kzalloc(sizeof(*new) + (nr_rt_entries * sizeof(struct hlist_head))
  326. + (nr * sizeof(struct kvm_kernel_irq_routing_entry)),
  327. GFP_KERNEL);
  328. if (!new)
  329. return -ENOMEM;
  330. new->rt_entries = (void *)&new->map[nr_rt_entries];
  331. new->nr_rt_entries = nr_rt_entries;
  332. for (i = 0; i < 3; i++)
  333. for (j = 0; j < KVM_IOAPIC_NUM_PINS; j++)
  334. new->chip[i][j] = -1;
  335. for (i = 0; i < nr; ++i) {
  336. r = -EINVAL;
  337. if (ue->flags)
  338. goto out;
  339. r = setup_routing_entry(new, &new->rt_entries[i], ue);
  340. if (r)
  341. goto out;
  342. ++ue;
  343. }
  344. mutex_lock(&kvm->irq_lock);
  345. old = kvm->irq_routing;
  346. rcu_assign_pointer(kvm->irq_routing, new);
  347. mutex_unlock(&kvm->irq_lock);
  348. synchronize_rcu();
  349. new = old;
  350. r = 0;
  351. out:
  352. kfree(new);
  353. return r;
  354. }
  355. #define IOAPIC_ROUTING_ENTRY(irq) \
  356. { .gsi = irq, .type = KVM_IRQ_ROUTING_IRQCHIP, \
  357. .u.irqchip.irqchip = KVM_IRQCHIP_IOAPIC, .u.irqchip.pin = (irq) }
  358. #define ROUTING_ENTRY1(irq) IOAPIC_ROUTING_ENTRY(irq)
  359. #ifdef CONFIG_X86
  360. # define PIC_ROUTING_ENTRY(irq) \
  361. { .gsi = irq, .type = KVM_IRQ_ROUTING_IRQCHIP, \
  362. .u.irqchip.irqchip = SELECT_PIC(irq), .u.irqchip.pin = (irq) % 8 }
  363. # define ROUTING_ENTRY2(irq) \
  364. IOAPIC_ROUTING_ENTRY(irq), PIC_ROUTING_ENTRY(irq)
  365. #else
  366. # define ROUTING_ENTRY2(irq) \
  367. IOAPIC_ROUTING_ENTRY(irq)
  368. #endif
  369. static const struct kvm_irq_routing_entry default_routing[] = {
  370. ROUTING_ENTRY2(0), ROUTING_ENTRY2(1),
  371. ROUTING_ENTRY2(2), ROUTING_ENTRY2(3),
  372. ROUTING_ENTRY2(4), ROUTING_ENTRY2(5),
  373. ROUTING_ENTRY2(6), ROUTING_ENTRY2(7),
  374. ROUTING_ENTRY2(8), ROUTING_ENTRY2(9),
  375. ROUTING_ENTRY2(10), ROUTING_ENTRY2(11),
  376. ROUTING_ENTRY2(12), ROUTING_ENTRY2(13),
  377. ROUTING_ENTRY2(14), ROUTING_ENTRY2(15),
  378. ROUTING_ENTRY1(16), ROUTING_ENTRY1(17),
  379. ROUTING_ENTRY1(18), ROUTING_ENTRY1(19),
  380. ROUTING_ENTRY1(20), ROUTING_ENTRY1(21),
  381. ROUTING_ENTRY1(22), ROUTING_ENTRY1(23),
  382. #ifdef CONFIG_IA64
  383. ROUTING_ENTRY1(24), ROUTING_ENTRY1(25),
  384. ROUTING_ENTRY1(26), ROUTING_ENTRY1(27),
  385. ROUTING_ENTRY1(28), ROUTING_ENTRY1(29),
  386. ROUTING_ENTRY1(30), ROUTING_ENTRY1(31),
  387. ROUTING_ENTRY1(32), ROUTING_ENTRY1(33),
  388. ROUTING_ENTRY1(34), ROUTING_ENTRY1(35),
  389. ROUTING_ENTRY1(36), ROUTING_ENTRY1(37),
  390. ROUTING_ENTRY1(38), ROUTING_ENTRY1(39),
  391. ROUTING_ENTRY1(40), ROUTING_ENTRY1(41),
  392. ROUTING_ENTRY1(42), ROUTING_ENTRY1(43),
  393. ROUTING_ENTRY1(44), ROUTING_ENTRY1(45),
  394. ROUTING_ENTRY1(46), ROUTING_ENTRY1(47),
  395. #endif
  396. };
  397. int kvm_setup_default_irq_routing(struct kvm *kvm)
  398. {
  399. return kvm_set_irq_routing(kvm, default_routing,
  400. ARRAY_SIZE(default_routing), 0);
  401. }