Aurelien Jarno 739b7a9075 bitops: provide an inline implementation of find_first_bit
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: Corentin Chary <corentin.chary@gmail.com>
Reviewed-by: Richard Henderson <rth@twiddle.net>
Signed-off-by: Aurelien Jarno <aurelien@aurel32.net>
2014-06-18 18:10:47 +02:00
..
2014-06-16 13:24:33 +02:00
2013-11-21 08:01:06 -08:00
2013-02-16 11:11:34 +00:00
2014-05-30 13:00:28 -06:00
2014-02-20 13:14:18 +01:00
2014-02-01 13:46:06 +04:00
2014-03-13 14:42:21 +01:00
2013-10-17 17:30:55 +02:00
2013-10-17 17:30:55 +02:00
2014-01-15 23:34:17 +04:00