Re: [Qemu-devel] [PATCH 12/15] openpic: IRQ_check: search the queue a word at a time

2013-01-03 Thread Scott Wood
On 01/03/2013 02:57:33 PM, Alexander Graf wrote: On 03.01.2013, at 21:32, Scott Wood wrote: > On 01/03/2013 02:31:30 PM, Alexander Graf wrote: >> Am 03.01.2013 um 21:07 schrieb Scott Wood : >> > On 01/03/2013 12:53:13 PM, Alexander Graf wrote: >> >> On 22.12.2012, at 03:15, Scott Wood wrote:

Re: [Qemu-devel] [PATCH 12/15] openpic: IRQ_check: search the queue a word at a time

2013-01-03 Thread Alexander Graf
On 03.01.2013, at 21:32, Scott Wood wrote: > On 01/03/2013 02:31:30 PM, Alexander Graf wrote: >> Am 03.01.2013 um 21:07 schrieb Scott Wood : >> > On 01/03/2013 12:53:13 PM, Alexander Graf wrote: >> >> On 22.12.2012, at 03:15, Scott Wood wrote: >> >> > Search the queue more efficiently by first lo

Re: [Qemu-devel] [PATCH 12/15] openpic: IRQ_check: search the queue a word at a time

2013-01-03 Thread Scott Wood
On 01/03/2013 02:31:30 PM, Alexander Graf wrote: Am 03.01.2013 um 21:07 schrieb Scott Wood : > On 01/03/2013 12:53:13 PM, Alexander Graf wrote: >> On 22.12.2012, at 03:15, Scott Wood wrote: >> > Search the queue more efficiently by first looking for a non-zero word, >> > and then using the c

Re: [Qemu-devel] [PATCH 12/15] openpic: IRQ_check: search the queue a word at a time

2013-01-03 Thread Alexander Graf
Am 03.01.2013 um 21:07 schrieb Scott Wood : > On 01/03/2013 12:53:13 PM, Alexander Graf wrote: >> On 22.12.2012, at 03:15, Scott Wood wrote: >> > 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 >

Re: [Qemu-devel] [PATCH 12/15] openpic: IRQ_check: search the queue a word at a time

2013-01-03 Thread Scott Wood
On 01/03/2013 12:53:13 PM, Alexander Graf wrote: On 22.12.2012, at 03:15, Scott Wood wrote: > 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(

Re: [Qemu-devel] [PATCH 12/15] openpic: IRQ_check: search the queue a word at a time

2013-01-03 Thread Alexander Graf
On 22.12.2012, at 03:15, Scott Wood wrote: > 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 tha

[Qemu-devel] [PATCH 12/15] openpic: IRQ_check: search the queue a word at a time

2012-12-21 Thread Scott Wood
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'