Release 4.12 include/asm-generic/bitops/sched.h

#ifndef _ASM_GENERIC_BITOPS_SCHED_H_

#define _ASM_GENERIC_BITOPS_SCHED_H_

#include <linux/compiler.h>	/* unlikely() */
#include <asm/types.h>

/*
 * 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
}

Contributors
Person
Tokens
Prop
Commits
CommitProp
Akinobu Mita
120
100.00%
1
100.00%
Total
120
100.00%
1
100.00%

#endif /* _ASM_GENERIC_BITOPS_SCHED_H_ */
Overall Contributors
Person
Tokens
Prop
Commits
CommitProp
Akinobu Mita
136
99.27%
1
50.00%
Mike Galbraith
1
0.73%
1
50.00%
Total
137
100.00%
2
100.00%
Directory: include/asm-generic/bitops

Information contained on this website is for historical information purposes only and does not indicate or represent copyright ownership.