Commit | Line | Data |
---|---|---|
b2441318 | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
6d29ea23 AM |
2 | #ifndef _ASM_GENERIC_BITOPS_SCHED_H_ |
3 | #define _ASM_GENERIC_BITOPS_SCHED_H_ | |
4 | ||
5 | #include <linux/compiler.h> /* unlikely() */ | |
6 | #include <asm/types.h> | |
7 | ||
8 | /* | |
9 | * Every architecture must define this function. It's the fastest | |
ff80a77f MG |
10 | * way of searching a 100-bit bitmap. It's guaranteed that at least |
11 | * one of the 100 bits is cleared. | |
6d29ea23 AM |
12 | */ |
13 | static inline int sched_find_first_bit(const unsigned long *b) | |
14 | { | |
15 | #if BITS_PER_LONG == 64 | |
ff80a77f | 16 | if (b[0]) |
6d29ea23 | 17 | return __ffs(b[0]); |
ff80a77f | 18 | return __ffs(b[1]) + 64; |
6d29ea23 | 19 | #elif BITS_PER_LONG == 32 |
ff80a77f | 20 | if (b[0]) |
6d29ea23 | 21 | return __ffs(b[0]); |
ff80a77f | 22 | if (b[1]) |
6d29ea23 | 23 | return __ffs(b[1]) + 32; |
ff80a77f | 24 | if (b[2]) |
6d29ea23 | 25 | return __ffs(b[2]) + 64; |
ff80a77f | 26 | return __ffs(b[3]) + 96; |
6d29ea23 AM |
27 | #else |
28 | #error BITS_PER_LONG not defined | |
29 | #endif | |
30 | } | |
31 | ||
32 | #endif /* _ASM_GENERIC_BITOPS_SCHED_H_ */ |