1 #ifndef _ASM_GENERIC_BITOPS_SCHED_H_
2 #define _ASM_GENERIC_BITOPS_SCHED_H_
4 #include <linux/compiler.h> /* unlikely() */
8 * Every architecture must define this function. It's the fastest
9 * way of searching a 100-bit bitmap. It's guaranteed that at least
10 * one of the 100 bits is cleared.
12 static inline int sched_find_first_bit(const unsigned long *b)
14 #if BITS_PER_LONG == 64
17 return __ffs(b[1]) + 64;
18 #elif BITS_PER_LONG == 32
22 return __ffs(b[1]) + 32;
24 return __ffs(b[2]) + 64;
25 return __ffs(b[3]) + 96;
27 #error BITS_PER_LONG not defined
31 #endif /* _ASM_GENERIC_BITOPS_SCHED_H_ */