i8259.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567
  1. /*
  2. * 8259 interrupt controller emulation
  3. *
  4. * Copyright (c) 2003-2004 Fabrice Bellard
  5. * Copyright (c) 2007 Intel Corporation
  6. *
  7. * Permission is hereby granted, free of charge, to any person obtaining a copy
  8. * of this software and associated documentation files (the "Software"), to deal
  9. * in the Software without restriction, including without limitation the rights
  10. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  11. * copies of the Software, and to permit persons to whom the Software is
  12. * furnished to do so, subject to the following conditions:
  13. *
  14. * The above copyright notice and this permission notice shall be included in
  15. * all copies or substantial portions of the Software.
  16. *
  17. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  18. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  19. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  20. * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  21. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  22. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  23. * THE SOFTWARE.
  24. * Authors:
  25. * Yaozu (Eddie) Dong <Eddie.dong@intel.com>
  26. * Port from Qemu.
  27. */
  28. #include <linux/mm.h>
  29. #include <linux/bitops.h>
  30. #include "irq.h"
  31. #include <linux/kvm_host.h>
  32. #include "trace.h"
  33. static void pic_lock(struct kvm_pic *s)
  34. __acquires(&s->lock)
  35. {
  36. spin_lock(&s->lock);
  37. }
  38. static void pic_unlock(struct kvm_pic *s)
  39. __releases(&s->lock)
  40. {
  41. struct kvm *kvm = s->kvm;
  42. unsigned acks = s->pending_acks;
  43. bool wakeup = s->wakeup_needed;
  44. struct kvm_vcpu *vcpu;
  45. s->pending_acks = 0;
  46. s->wakeup_needed = false;
  47. spin_unlock(&s->lock);
  48. while (acks) {
  49. kvm_notify_acked_irq(kvm, SELECT_PIC(__ffs(acks)),
  50. __ffs(acks));
  51. acks &= acks - 1;
  52. }
  53. if (wakeup) {
  54. vcpu = s->kvm->bsp_vcpu;
  55. if (vcpu)
  56. kvm_vcpu_kick(vcpu);
  57. }
  58. }
  59. static void pic_clear_isr(struct kvm_kpic_state *s, int irq)
  60. {
  61. s->isr &= ~(1 << irq);
  62. s->isr_ack |= (1 << irq);
  63. }
  64. void kvm_pic_clear_isr_ack(struct kvm *kvm)
  65. {
  66. struct kvm_pic *s = pic_irqchip(kvm);
  67. pic_lock(s);
  68. s->pics[0].isr_ack = 0xff;
  69. s->pics[1].isr_ack = 0xff;
  70. pic_unlock(s);
  71. }
  72. /*
  73. * set irq level. If an edge is detected, then the IRR is set to 1
  74. */
  75. static inline int pic_set_irq1(struct kvm_kpic_state *s, int irq, int level)
  76. {
  77. int mask, ret = 1;
  78. mask = 1 << irq;
  79. if (s->elcr & mask) /* level triggered */
  80. if (level) {
  81. ret = !(s->irr & mask);
  82. s->irr |= mask;
  83. s->last_irr |= mask;
  84. } else {
  85. s->irr &= ~mask;
  86. s->last_irr &= ~mask;
  87. }
  88. else /* edge triggered */
  89. if (level) {
  90. if ((s->last_irr & mask) == 0) {
  91. ret = !(s->irr & mask);
  92. s->irr |= mask;
  93. }
  94. s->last_irr |= mask;
  95. } else
  96. s->last_irr &= ~mask;
  97. return (s->imr & mask) ? -1 : ret;
  98. }
  99. /*
  100. * return the highest priority found in mask (highest = smallest
  101. * number). Return 8 if no irq
  102. */
  103. static inline int get_priority(struct kvm_kpic_state *s, int mask)
  104. {
  105. int priority;
  106. if (mask == 0)
  107. return 8;
  108. priority = 0;
  109. while ((mask & (1 << ((priority + s->priority_add) & 7))) == 0)
  110. priority++;
  111. return priority;
  112. }
  113. /*
  114. * return the pic wanted interrupt. return -1 if none
  115. */
  116. static int pic_get_irq(struct kvm_kpic_state *s)
  117. {
  118. int mask, cur_priority, priority;
  119. mask = s->irr & ~s->imr;
  120. priority = get_priority(s, mask);
  121. if (priority == 8)
  122. return -1;
  123. /*
  124. * compute current priority. If special fully nested mode on the
  125. * master, the IRQ coming from the slave is not taken into account
  126. * for the priority computation.
  127. */
  128. mask = s->isr;
  129. if (s->special_fully_nested_mode && s == &s->pics_state->pics[0])
  130. mask &= ~(1 << 2);
  131. cur_priority = get_priority(s, mask);
  132. if (priority < cur_priority)
  133. /*
  134. * higher priority found: an irq should be generated
  135. */
  136. return (priority + s->priority_add) & 7;
  137. else
  138. return -1;
  139. }
  140. /*
  141. * raise irq to CPU if necessary. must be called every time the active
  142. * irq may change
  143. */
  144. static void pic_update_irq(struct kvm_pic *s)
  145. {
  146. int irq2, irq;
  147. irq2 = pic_get_irq(&s->pics[1]);
  148. if (irq2 >= 0) {
  149. /*
  150. * if irq request by slave pic, signal master PIC
  151. */
  152. pic_set_irq1(&s->pics[0], 2, 1);
  153. pic_set_irq1(&s->pics[0], 2, 0);
  154. }
  155. irq = pic_get_irq(&s->pics[0]);
  156. if (irq >= 0)
  157. s->irq_request(s->irq_request_opaque, 1);
  158. else
  159. s->irq_request(s->irq_request_opaque, 0);
  160. }
  161. void kvm_pic_update_irq(struct kvm_pic *s)
  162. {
  163. pic_lock(s);
  164. pic_update_irq(s);
  165. pic_unlock(s);
  166. }
  167. int kvm_pic_set_irq(void *opaque, int irq, int level)
  168. {
  169. struct kvm_pic *s = opaque;
  170. int ret = -1;
  171. pic_lock(s);
  172. if (irq >= 0 && irq < PIC_NUM_PINS) {
  173. ret = pic_set_irq1(&s->pics[irq >> 3], irq & 7, level);
  174. pic_update_irq(s);
  175. trace_kvm_pic_set_irq(irq >> 3, irq & 7, s->pics[irq >> 3].elcr,
  176. s->pics[irq >> 3].imr, ret == 0);
  177. }
  178. pic_unlock(s);
  179. return ret;
  180. }
  181. /*
  182. * acknowledge interrupt 'irq'
  183. */
  184. static inline void pic_intack(struct kvm_kpic_state *s, int irq)
  185. {
  186. s->isr |= 1 << irq;
  187. if (s->auto_eoi) {
  188. if (s->rotate_on_auto_eoi)
  189. s->priority_add = (irq + 1) & 7;
  190. pic_clear_isr(s, irq);
  191. }
  192. /*
  193. * We don't clear a level sensitive interrupt here
  194. */
  195. if (!(s->elcr & (1 << irq)))
  196. s->irr &= ~(1 << irq);
  197. }
  198. int kvm_pic_read_irq(struct kvm *kvm)
  199. {
  200. int irq, irq2, intno;
  201. struct kvm_pic *s = pic_irqchip(kvm);
  202. pic_lock(s);
  203. irq = pic_get_irq(&s->pics[0]);
  204. if (irq >= 0) {
  205. pic_intack(&s->pics[0], irq);
  206. if (irq == 2) {
  207. irq2 = pic_get_irq(&s->pics[1]);
  208. if (irq2 >= 0)
  209. pic_intack(&s->pics[1], irq2);
  210. else
  211. /*
  212. * spurious IRQ on slave controller
  213. */
  214. irq2 = 7;
  215. intno = s->pics[1].irq_base + irq2;
  216. irq = irq2 + 8;
  217. } else
  218. intno = s->pics[0].irq_base + irq;
  219. } else {
  220. /*
  221. * spurious IRQ on host controller
  222. */
  223. irq = 7;
  224. intno = s->pics[0].irq_base + irq;
  225. }
  226. pic_update_irq(s);
  227. pic_unlock(s);
  228. kvm_notify_acked_irq(kvm, SELECT_PIC(irq), irq);
  229. return intno;
  230. }
  231. void kvm_pic_reset(struct kvm_kpic_state *s)
  232. {
  233. int irq, irqbase, n;
  234. struct kvm *kvm = s->pics_state->irq_request_opaque;
  235. struct kvm_vcpu *vcpu0 = kvm->bsp_vcpu;
  236. if (s == &s->pics_state->pics[0])
  237. irqbase = 0;
  238. else
  239. irqbase = 8;
  240. for (irq = 0; irq < PIC_NUM_PINS/2; irq++) {
  241. if (vcpu0 && kvm_apic_accept_pic_intr(vcpu0))
  242. if (s->irr & (1 << irq) || s->isr & (1 << irq)) {
  243. n = irq + irqbase;
  244. s->pics_state->pending_acks |= 1 << n;
  245. }
  246. }
  247. s->last_irr = 0;
  248. s->irr = 0;
  249. s->imr = 0;
  250. s->isr = 0;
  251. s->isr_ack = 0xff;
  252. s->priority_add = 0;
  253. s->irq_base = 0;
  254. s->read_reg_select = 0;
  255. s->poll = 0;
  256. s->special_mask = 0;
  257. s->init_state = 0;
  258. s->auto_eoi = 0;
  259. s->rotate_on_auto_eoi = 0;
  260. s->special_fully_nested_mode = 0;
  261. s->init4 = 0;
  262. }
  263. static void pic_ioport_write(void *opaque, u32 addr, u32 val)
  264. {
  265. struct kvm_kpic_state *s = opaque;
  266. int priority, cmd, irq;
  267. addr &= 1;
  268. if (addr == 0) {
  269. if (val & 0x10) {
  270. kvm_pic_reset(s); /* init */
  271. /*
  272. * deassert a pending interrupt
  273. */
  274. s->pics_state->irq_request(s->pics_state->
  275. irq_request_opaque, 0);
  276. s->init_state = 1;
  277. s->init4 = val & 1;
  278. if (val & 0x02)
  279. printk(KERN_ERR "single mode not supported");
  280. if (val & 0x08)
  281. printk(KERN_ERR
  282. "level sensitive irq not supported");
  283. } else if (val & 0x08) {
  284. if (val & 0x04)
  285. s->poll = 1;
  286. if (val & 0x02)
  287. s->read_reg_select = val & 1;
  288. if (val & 0x40)
  289. s->special_mask = (val >> 5) & 1;
  290. } else {
  291. cmd = val >> 5;
  292. switch (cmd) {
  293. case 0:
  294. case 4:
  295. s->rotate_on_auto_eoi = cmd >> 2;
  296. break;
  297. case 1: /* end of interrupt */
  298. case 5:
  299. priority = get_priority(s, s->isr);
  300. if (priority != 8) {
  301. irq = (priority + s->priority_add) & 7;
  302. pic_clear_isr(s, irq);
  303. if (cmd == 5)
  304. s->priority_add = (irq + 1) & 7;
  305. pic_update_irq(s->pics_state);
  306. }
  307. break;
  308. case 3:
  309. irq = val & 7;
  310. pic_clear_isr(s, irq);
  311. pic_update_irq(s->pics_state);
  312. break;
  313. case 6:
  314. s->priority_add = (val + 1) & 7;
  315. pic_update_irq(s->pics_state);
  316. break;
  317. case 7:
  318. irq = val & 7;
  319. s->priority_add = (irq + 1) & 7;
  320. pic_clear_isr(s, irq);
  321. pic_update_irq(s->pics_state);
  322. break;
  323. default:
  324. break; /* no operation */
  325. }
  326. }
  327. } else
  328. switch (s->init_state) {
  329. case 0: /* normal mode */
  330. s->imr = val;
  331. pic_update_irq(s->pics_state);
  332. break;
  333. case 1:
  334. s->irq_base = val & 0xf8;
  335. s->init_state = 2;
  336. break;
  337. case 2:
  338. if (s->init4)
  339. s->init_state = 3;
  340. else
  341. s->init_state = 0;
  342. break;
  343. case 3:
  344. s->special_fully_nested_mode = (val >> 4) & 1;
  345. s->auto_eoi = (val >> 1) & 1;
  346. s->init_state = 0;
  347. break;
  348. }
  349. }
  350. static u32 pic_poll_read(struct kvm_kpic_state *s, u32 addr1)
  351. {
  352. int ret;
  353. ret = pic_get_irq(s);
  354. if (ret >= 0) {
  355. if (addr1 >> 7) {
  356. s->pics_state->pics[0].isr &= ~(1 << 2);
  357. s->pics_state->pics[0].irr &= ~(1 << 2);
  358. }
  359. s->irr &= ~(1 << ret);
  360. pic_clear_isr(s, ret);
  361. if (addr1 >> 7 || ret != 2)
  362. pic_update_irq(s->pics_state);
  363. } else {
  364. ret = 0x07;
  365. pic_update_irq(s->pics_state);
  366. }
  367. return ret;
  368. }
  369. static u32 pic_ioport_read(void *opaque, u32 addr1)
  370. {
  371. struct kvm_kpic_state *s = opaque;
  372. unsigned int addr;
  373. int ret;
  374. addr = addr1;
  375. addr &= 1;
  376. if (s->poll) {
  377. ret = pic_poll_read(s, addr1);
  378. s->poll = 0;
  379. } else
  380. if (addr == 0)
  381. if (s->read_reg_select)
  382. ret = s->isr;
  383. else
  384. ret = s->irr;
  385. else
  386. ret = s->imr;
  387. return ret;
  388. }
  389. static void elcr_ioport_write(void *opaque, u32 addr, u32 val)
  390. {
  391. struct kvm_kpic_state *s = opaque;
  392. s->elcr = val & s->elcr_mask;
  393. }
  394. static u32 elcr_ioport_read(void *opaque, u32 addr1)
  395. {
  396. struct kvm_kpic_state *s = opaque;
  397. return s->elcr;
  398. }
  399. static int picdev_in_range(gpa_t addr)
  400. {
  401. switch (addr) {
  402. case 0x20:
  403. case 0x21:
  404. case 0xa0:
  405. case 0xa1:
  406. case 0x4d0:
  407. case 0x4d1:
  408. return 1;
  409. default:
  410. return 0;
  411. }
  412. }
  413. static inline struct kvm_pic *to_pic(struct kvm_io_device *dev)
  414. {
  415. return container_of(dev, struct kvm_pic, dev);
  416. }
  417. static int picdev_write(struct kvm_io_device *this,
  418. gpa_t addr, int len, const void *val)
  419. {
  420. struct kvm_pic *s = to_pic(this);
  421. unsigned char data = *(unsigned char *)val;
  422. if (!picdev_in_range(addr))
  423. return -EOPNOTSUPP;
  424. if (len != 1) {
  425. if (printk_ratelimit())
  426. printk(KERN_ERR "PIC: non byte write\n");
  427. return 0;
  428. }
  429. pic_lock(s);
  430. switch (addr) {
  431. case 0x20:
  432. case 0x21:
  433. case 0xa0:
  434. case 0xa1:
  435. pic_ioport_write(&s->pics[addr >> 7], addr, data);
  436. break;
  437. case 0x4d0:
  438. case 0x4d1:
  439. elcr_ioport_write(&s->pics[addr & 1], addr, data);
  440. break;
  441. }
  442. pic_unlock(s);
  443. return 0;
  444. }
  445. static int picdev_read(struct kvm_io_device *this,
  446. gpa_t addr, int len, void *val)
  447. {
  448. struct kvm_pic *s = to_pic(this);
  449. unsigned char data = 0;
  450. if (!picdev_in_range(addr))
  451. return -EOPNOTSUPP;
  452. if (len != 1) {
  453. if (printk_ratelimit())
  454. printk(KERN_ERR "PIC: non byte read\n");
  455. return 0;
  456. }
  457. pic_lock(s);
  458. switch (addr) {
  459. case 0x20:
  460. case 0x21:
  461. case 0xa0:
  462. case 0xa1:
  463. data = pic_ioport_read(&s->pics[addr >> 7], addr);
  464. break;
  465. case 0x4d0:
  466. case 0x4d1:
  467. data = elcr_ioport_read(&s->pics[addr & 1], addr);
  468. break;
  469. }
  470. *(unsigned char *)val = data;
  471. pic_unlock(s);
  472. return 0;
  473. }
  474. /*
  475. * callback when PIC0 irq status changed
  476. */
  477. static void pic_irq_request(void *opaque, int level)
  478. {
  479. struct kvm *kvm = opaque;
  480. struct kvm_vcpu *vcpu = kvm->bsp_vcpu;
  481. struct kvm_pic *s = pic_irqchip(kvm);
  482. int irq = pic_get_irq(&s->pics[0]);
  483. s->output = level;
  484. if (vcpu && level && (s->pics[0].isr_ack & (1 << irq))) {
  485. s->pics[0].isr_ack &= ~(1 << irq);
  486. s->wakeup_needed = true;
  487. }
  488. }
  489. static const struct kvm_io_device_ops picdev_ops = {
  490. .read = picdev_read,
  491. .write = picdev_write,
  492. };
  493. struct kvm_pic *kvm_create_pic(struct kvm *kvm)
  494. {
  495. struct kvm_pic *s;
  496. int ret;
  497. s = kzalloc(sizeof(struct kvm_pic), GFP_KERNEL);
  498. if (!s)
  499. return NULL;
  500. spin_lock_init(&s->lock);
  501. s->kvm = kvm;
  502. s->pics[0].elcr_mask = 0xf8;
  503. s->pics[1].elcr_mask = 0xde;
  504. s->irq_request = pic_irq_request;
  505. s->irq_request_opaque = kvm;
  506. s->pics[0].pics_state = s;
  507. s->pics[1].pics_state = s;
  508. /*
  509. * Initialize PIO device
  510. */
  511. kvm_iodevice_init(&s->dev, &picdev_ops);
  512. ret = kvm_io_bus_register_dev(kvm, &kvm->pio_bus, &s->dev);
  513. if (ret < 0) {
  514. kfree(s);
  515. return NULL;
  516. }
  517. return s;
  518. }