root / hw / irq.c @ 4118a970
History | View | Annotate | Download (1.7 kB)
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 "vl.h" |
25 |
|
26 |
struct IRQState {
|
27 |
qemu_irq_handler handler; |
28 |
void *opaque;
|
29 |
int n;
|
30 |
}; |
31 |
|
32 |
void qemu_set_irq(qemu_irq irq, int level) |
33 |
{ |
34 |
if (!irq)
|
35 |
return;
|
36 |
|
37 |
irq->handler(irq->opaque, irq->n, level); |
38 |
} |
39 |
|
40 |
qemu_irq *qemu_allocate_irqs(qemu_irq_handler handler, void *opaque, int n) |
41 |
{ |
42 |
qemu_irq *s; |
43 |
struct IRQState *p;
|
44 |
int i;
|
45 |
|
46 |
s = (qemu_irq *)qemu_mallocz(sizeof(qemu_irq) * n);
|
47 |
p = (struct IRQState *)qemu_mallocz(sizeof(struct IRQState) * n); |
48 |
for (i = 0; i < n; i++) { |
49 |
p->handler = handler; |
50 |
p->opaque = opaque; |
51 |
p->n = i; |
52 |
s[i] = p; |
53 |
p++; |
54 |
} |
55 |
return s;
|
56 |
} |
57 |
|