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 17:23:21 +08:00
2014-06-10 07:44:01 +02:00
2014-06-16 18:26:21 +01:00
2014-06-16 13:24:35 +02:00
2014-06-16 13:24:35 +02:00
2014-06-16 13:24:41 +02:00
2014-06-05 16:10:33 +02:00
2014-06-05 16:10:33 +02:00
2014-06-05 16:10:33 +02:00
2014-06-10 09:50:27 +02:00
2014-06-05 16:10:33 +02:00
2014-06-16 12:27:47 +01:00
2014-06-13 12:34:57 +02:00
2014-06-16 18:26:21 +01:00
2014-06-16 13:24:35 +02:00
2014-06-09 15:43:40 +02:00
2014-06-16 17:23:21 +08:00
2014-06-16 18:26:21 +01:00
2014-06-05 16:10:33 +02:00
2014-05-20 11:57:52 +01:00
2014-06-09 15:43:40 +02:00
2014-05-24 00:07:29 +04:00
2014-05-28 17:36:21 +02:00
2014-04-18 10:33:36 +04:00
2014-06-16 17:23:21 +08:00
2014-06-09 15:43:40 +02:00
2014-05-28 14:28:46 +02:00
2014-05-24 00:07:29 +04:00
2014-06-05 16:10:33 +02:00
2014-04-17 20:39:32 +01:00
2014-05-07 16:16:43 +00:00
2014-06-11 00:25:06 +01:00

Read the documentation in qemu-doc.html or on http://wiki.qemu-project.org

- QEMU team
Description
No description provided
Readme 404 MiB
Languages
C 82.6%
C++ 6.5%
Python 3.4%
Dylan 2.9%
Shell 1.6%
Other 2.8%