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 "hw/irq.h" 26 27 struct IRQState { 28 qemu_irq_handler handler; 29 void *opaque; 30 int n; 31 }; 32 33 void qemu_set_irq(qemu_irq irq, int level) 34 { 35 if (!irq) 36 return; 37 38 irq->handler(irq->opaque, irq->n, level); 39 } 40 41 qemu_irq *qemu_extend_irqs(qemu_irq *old, int n_old, qemu_irq_handler handler, 42 void *opaque, int n) 43 { 44 qemu_irq *s; 45 int i; 46 47 if (!old) { 48 n_old = 0; 49 } 50 s = old ? g_renew(qemu_irq, old, n + n_old) : g_new(qemu_irq, n); 51 for (i = n_old; i < n + n_old; i++) { 52 s[i] = qemu_allocate_irq(handler, opaque, i); 53 } 54 return s; 55 } 56 57 qemu_irq *qemu_allocate_irqs(qemu_irq_handler handler, void *opaque, int n) 58 { 59 return qemu_extend_irqs(NULL, 0, handler, opaque, n); 60 } 61 62 qemu_irq qemu_allocate_irq(qemu_irq_handler handler, void *opaque, int n) 63 { 64 struct IRQState *irq; 65 66 irq = g_new(struct IRQState, 1); 67 irq->handler = handler; 68 irq->opaque = opaque; 69 irq->n = n; 70 71 return irq; 72 } 73 74 void qemu_free_irqs(qemu_irq *s, int n) 75 { 76 int i; 77 for (i = 0; i < n; i++) { 78 qemu_free_irq(s[i]); 79 } 80 g_free(s); 81 } 82 83 void qemu_free_irq(qemu_irq irq) 84 { 85 g_free(irq); 86 } 87 88 static void qemu_notirq(void *opaque, int line, int level) 89 { 90 struct IRQState *irq = opaque; 91 92 irq->handler(irq->opaque, irq->n, !level); 93 } 94 95 qemu_irq qemu_irq_invert(qemu_irq irq) 96 { 97 /* The default state for IRQs is low, so raise the output now. */ 98 qemu_irq_raise(irq); 99 return qemu_allocate_irq(qemu_notirq, irq, 0); 100 } 101 102 static void qemu_splitirq(void *opaque, int line, int level) 103 { 104 struct IRQState **irq = opaque; 105 irq[0]->handler(irq[0]->opaque, irq[0]->n, level); 106 irq[1]->handler(irq[1]->opaque, irq[1]->n, level); 107 } 108 109 qemu_irq qemu_irq_split(qemu_irq irq1, qemu_irq irq2) 110 { 111 qemu_irq *s = g_malloc0(2 * sizeof(qemu_irq)); 112 s[0] = irq1; 113 s[1] = irq2; 114 return qemu_allocate_irq(qemu_splitirq, s, 0); 115 } 116 117 static void proxy_irq_handler(void *opaque, int n, int level) 118 { 119 qemu_irq **target = opaque; 120 121 if (*target) { 122 qemu_set_irq((*target)[n], level); 123 } 124 } 125 126 qemu_irq *qemu_irq_proxy(qemu_irq **target, int n) 127 { 128 return qemu_allocate_irqs(proxy_irq_handler, target, n); 129 } 130 131 void qemu_irq_intercept_in(qemu_irq *gpio_in, qemu_irq_handler handler, int n) 132 { 133 int i; 134 qemu_irq *old_irqs = qemu_allocate_irqs(NULL, NULL, n); 135 for (i = 0; i < n; i++) { 136 *old_irqs[i] = *gpio_in[i]; 137 gpio_in[i]->handler = handler; 138 gpio_in[i]->opaque = old_irqs; 139 } 140 } 141 142 void qemu_irq_intercept_out(qemu_irq **gpio_out, qemu_irq_handler handler, int n) 143 { 144 qemu_irq *old_irqs = *gpio_out; 145 *gpio_out = qemu_allocate_irqs(handler, old_irqs, n); 146 } 147