Blame view

kernel/linux-rt-4.4.41/include/asm-generic/bitops/sched.h 721 Bytes
5113f6f70   김현기   kernel add
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
  #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
  }
  
  #endif /* _ASM_GENERIC_BITOPS_SCHED_H_ */