irq.c 2.6 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
  1. /*
  2. * QEMU IRQ/GPIO common code.
  3. *
  4. * Copyright (c) 2007 CodeSourcery.
  5. *
  6. * Permission is hereby granted, free of charge, to any person obtaining a copy
  7. * of this software and associated documentation files (the "Software"), to deal
  8. * in the Software without restriction, including without limitation the rights
  9. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  10. * copies of the Software, and to permit persons to whom the Software is
  11. * furnished to do so, subject to the following conditions:
  12. *
  13. * The above copyright notice and this permission notice shall be included in
  14. * all copies or substantial portions of the Software.
  15. *
  16. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  17. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  18. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  19. * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  20. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  21. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  22. * THE SOFTWARE.
  23. */
  24. #include "qemu-common.h"
  25. #include "irq.h"
  26. struct IRQState {
  27. qemu_irq_handler handler;
  28. void *opaque;
  29. int n;
  30. };
  31. void qemu_set_irq(qemu_irq irq, int level)
  32. {
  33. if (!irq)
  34. return;
  35. irq->handler(irq->opaque, irq->n, level);
  36. }
  37. qemu_irq *qemu_allocate_irqs(qemu_irq_handler handler, void *opaque, int n)
  38. {
  39. qemu_irq *s;
  40. struct IRQState *p;
  41. int i;
  42. s = (qemu_irq *)qemu_mallocz(sizeof(qemu_irq) * n);
  43. p = (struct IRQState *)qemu_mallocz(sizeof(struct IRQState) * n);
  44. for (i = 0; i < n; i++) {
  45. p->handler = handler;
  46. p->opaque = opaque;
  47. p->n = i;
  48. s[i] = p;
  49. p++;
  50. }
  51. return s;
  52. }
  53. void qemu_free_irqs(qemu_irq *s)
  54. {
  55. qemu_free(s[0]);
  56. qemu_free(s);
  57. }
  58. static void qemu_notirq(void *opaque, int line, int level)
  59. {
  60. struct IRQState *irq = opaque;
  61. irq->handler(irq->opaque, irq->n, !level);
  62. }
  63. qemu_irq qemu_irq_invert(qemu_irq irq)
  64. {
  65. /* The default state for IRQs is low, so raise the output now. */
  66. qemu_irq_raise(irq);
  67. return qemu_allocate_irqs(qemu_notirq, irq, 1)[0];
  68. }
  69. static void qemu_splitirq(void *opaque, int line, int level)
  70. {
  71. struct IRQState **irq = opaque;
  72. irq[0]->handler(irq[0]->opaque, irq[0]->n, level);
  73. irq[1]->handler(irq[1]->opaque, irq[1]->n, level);
  74. }
  75. qemu_irq qemu_irq_split(qemu_irq irq1, qemu_irq irq2)
  76. {
  77. qemu_irq *s = qemu_mallocz(2 * sizeof(qemu_irq));
  78. s[0] = irq1;
  79. s[1] = irq2;
  80. return qemu_allocate_irqs(qemu_splitirq, s, 1)[0];
  81. }