irq_comm.c 12 KB

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