irq_comm.c 12 KB

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