mirror of https://github.com/xemu-project/xemu.git
openpic: IRQ_check: search the queue a word at a time
Search the queue more efficiently by first looking for a non-zero word, and then using the common bit-searching function to find the bit within the word. It would be even nicer if bitops_ffsl() could be hooked up to the compiler intrinsic so that bit-searching instructions could be used, but that's another matter. Signed-off-by: Scott Wood <scottwood@freescale.com> Signed-off-by: Alexander Graf <agraf@suse.de>
This commit is contained in:
parent
6c5e84c25f
commit
4417c73305
28
hw/openpic.c
28
hw/openpic.c
|
@ -277,21 +277,25 @@ static inline int IRQ_testbit(IRQQueue *q, int n_IRQ)
|
||||||
|
|
||||||
static void IRQ_check(OpenPICState *opp, IRQQueue *q)
|
static void IRQ_check(OpenPICState *opp, IRQQueue *q)
|
||||||
{
|
{
|
||||||
int next, i;
|
int irq = -1;
|
||||||
int priority;
|
int next = -1;
|
||||||
|
int priority = -1;
|
||||||
|
|
||||||
next = -1;
|
for (;;) {
|
||||||
priority = -1;
|
irq = find_next_bit(q->queue, opp->max_irq, irq + 1);
|
||||||
for (i = 0; i < opp->max_irq; i++) {
|
if (irq == opp->max_irq) {
|
||||||
if (IRQ_testbit(q, i)) {
|
break;
|
||||||
DPRINTF("IRQ_check: irq %d set ivpr_pr=%d pr=%d\n",
|
}
|
||||||
i, IVPR_PRIORITY(opp->src[i].ivpr), priority);
|
|
||||||
if (IVPR_PRIORITY(opp->src[i].ivpr) > priority) {
|
DPRINTF("IRQ_check: irq %d set ivpr_pr=%d pr=%d\n",
|
||||||
next = i;
|
irq, IVPR_PRIORITY(opp->src[irq].ivpr), priority);
|
||||||
priority = IVPR_PRIORITY(opp->src[i].ivpr);
|
|
||||||
}
|
if (IVPR_PRIORITY(opp->src[irq].ivpr) > priority) {
|
||||||
|
next = irq;
|
||||||
|
priority = IVPR_PRIORITY(opp->src[irq].ivpr);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
q->next = next;
|
q->next = next;
|
||||||
q->priority = priority;
|
q->priority = priority;
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue