From 8a6d48c0542876eb3acfc0970c0ab7872db08d5f Mon Sep 17 00:00:00 2001 From: Zheng Da Date: Sun, 6 Dec 2009 05:26:23 +0100 Subject: check in the original version of dde linux26. --- .../contrib/include/asm-generic/bitops/sched.h | 31 ++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 libdde_linux26/contrib/include/asm-generic/bitops/sched.h (limited to 'libdde_linux26/contrib/include/asm-generic/bitops/sched.h') diff --git a/libdde_linux26/contrib/include/asm-generic/bitops/sched.h b/libdde_linux26/contrib/include/asm-generic/bitops/sched.h new file mode 100644 index 00000000..604fab70 --- /dev/null +++ b/libdde_linux26/contrib/include/asm-generic/bitops/sched.h @@ -0,0 +1,31 @@ +#ifndef _ASM_GENERIC_BITOPS_SCHED_H_ +#define _ASM_GENERIC_BITOPS_SCHED_H_ + +#include /* unlikely() */ +#include + +/* + * Every architecture must define this function. It's the fastest + * way of searching a 100-bit bitmap. It's guaranteed that at least + * one of the 100 bits is cleared. + */ +static inline int sched_find_first_bit(const unsigned long *b) +{ +#if BITS_PER_LONG == 64 + if (b[0]) + return __ffs(b[0]); + return __ffs(b[1]) + 64; +#elif BITS_PER_LONG == 32 + if (b[0]) + return __ffs(b[0]); + if (b[1]) + return __ffs(b[1]) + 32; + if (b[2]) + return __ffs(b[2]) + 64; + return __ffs(b[3]) + 96; +#else +#error BITS_PER_LONG not defined +#endif +} + +#endif /* _ASM_GENERIC_BITOPS_SCHED_H_ */ -- cgit v1.2.3