On 12/22/2013 03:32 AM, Aurelien Jarno wrote: > find_first_bit has started to be used heavily in TCG code. The current > implementation based on find_next_bit is not optimal and can't be > optimized be the compiler if the bit array has a fixed size, which is > the case most of the time. > > This new implementation does not use find_next_bit and is yet small > enough to be inlined. > > Cc: Richard Henderson <r...@twiddle.net> > Cc: Corentin Chary <corentin.ch...@gmail.com> > > Signed-off-by: Aurelien Jarno <aurel...@aurel32.net> > --- > include/qemu/bitops.h | 12 +++++++++++- > 1 file changed, 11 insertions(+), 1 deletion(-)
Reviewed-by: Richard Henderson <r...@twiddle.net> r~
