forge/linux-pinenote
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

sched: simplify sched_find_first_bit()

Browse source 
simplify sched_rt.c's sched_find_first_bit() function: there are
only 100 RT priority levels left.

Signed-off-by: Ingo Molnar <mingo@elte.hu>
This commit is contained in:
Mike Galbraith 2007-07-09 18:52:00 +02:00 • committed by Ingo Molnar
parent 5e7eaade55
commit ff80a77f20
1 changed files with 8 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

21
include/asm-generic/bitops/sched.h
View file

@ -6,28 +6,23 @@
/* /*
* Every architecture must define this function. It's the fastest * Every architecture must define this function. It's the fastest
* way of searching a 140-bit bitmap where the first 100 bits are * way of searching a 100-bit bitmap. It's guaranteed that at least
* unlikely to be set. It's guaranteed that at least one of the 140 * one of the 100 bits is cleared.
* bits is cleared.
*/ */
static inline int sched_find_first_bit(const unsigned long *b) static inline int sched_find_first_bit(const unsigned long *b)
{ {
#if BITS_PER_LONG == 64 #if BITS_PER_LONG == 64
if (unlikely(b[0])) if (b[0])
return __ffs(b[0]); return __ffs(b[0]);
if (likely(b[1])) return __ffs(b[1]) + 64;
return __ffs(b[1]) + 64;
return __ffs(b[2]) + 128;
#elif BITS_PER_LONG == 32 #elif BITS_PER_LONG == 32
if (unlikely(b[0])) if (b[0])
return __ffs(b[0]); return __ffs(b[0]);
if (unlikely(b[1])) if (b[1])
return __ffs(b[1]) + 32; return __ffs(b[1]) + 32;
if (unlikely(b[2])) if (b[2])
return __ffs(b[2]) + 64; return __ffs(b[2]) + 64;
if (b[3]) return __ffs(b[3]) + 96;
return __ffs(b[3]) + 96;
return __ffs(b[4]) + 128;
#else #else
#error BITS_PER_LONG not defined #error BITS_PER_LONG not defined
#endif #endif