bitops.h 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194
  1. #ifndef _LINUX_BITOPS_H
  2. #define _LINUX_BITOPS_H
  3. #include <asm/types.h>
  4. #ifdef __KERNEL__
  5. #define BIT(nr) (1UL << (nr))
  6. #define BIT_MASK(nr) (1UL << ((nr) % BITS_PER_LONG))
  7. #define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
  8. #define BITS_PER_BYTE 8
  9. #define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(long))
  10. #endif
  11. /*
  12. * Include this here because some architectures need generic_ffs/fls in
  13. * scope
  14. */
  15. #include <asm/bitops.h>
  16. #define for_each_bit(bit, addr, size) \
  17. for ((bit) = find_first_bit((addr), (size)); \
  18. (bit) < (size); \
  19. (bit) = find_next_bit((addr), (size), (bit) + 1))
  20. static __inline__ int get_bitmask_order(unsigned int count)
  21. {
  22. int order;
  23. order = fls(count);
  24. return order; /* We could be slightly more clever with -1 here... */
  25. }
  26. static __inline__ int get_count_order(unsigned int count)
  27. {
  28. int order;
  29. order = fls(count) - 1;
  30. if (count & (count - 1))
  31. order++;
  32. return order;
  33. }
  34. static inline unsigned long hweight_long(unsigned long w)
  35. {
  36. return sizeof(w) == 4 ? hweight32(w) : hweight64(w);
  37. }
  38. /**
  39. * rol32 - rotate a 32-bit value left
  40. * @word: value to rotate
  41. * @shift: bits to roll
  42. */
  43. static inline __u32 rol32(__u32 word, unsigned int shift)
  44. {
  45. return (word << shift) | (word >> (32 - shift));
  46. }
  47. /**
  48. * ror32 - rotate a 32-bit value right
  49. * @word: value to rotate
  50. * @shift: bits to roll
  51. */
  52. static inline __u32 ror32(__u32 word, unsigned int shift)
  53. {
  54. return (word >> shift) | (word << (32 - shift));
  55. }
  56. /**
  57. * rol16 - rotate a 16-bit value left
  58. * @word: value to rotate
  59. * @shift: bits to roll
  60. */
  61. static inline __u16 rol16(__u16 word, unsigned int shift)
  62. {
  63. return (word << shift) | (word >> (16 - shift));
  64. }
  65. /**
  66. * ror16 - rotate a 16-bit value right
  67. * @word: value to rotate
  68. * @shift: bits to roll
  69. */
  70. static inline __u16 ror16(__u16 word, unsigned int shift)
  71. {
  72. return (word >> shift) | (word << (16 - shift));
  73. }
  74. /**
  75. * rol8 - rotate an 8-bit value left
  76. * @word: value to rotate
  77. * @shift: bits to roll
  78. */
  79. static inline __u8 rol8(__u8 word, unsigned int shift)
  80. {
  81. return (word << shift) | (word >> (8 - shift));
  82. }
  83. /**
  84. * ror8 - rotate an 8-bit value right
  85. * @word: value to rotate
  86. * @shift: bits to roll
  87. */
  88. static inline __u8 ror8(__u8 word, unsigned int shift)
  89. {
  90. return (word >> shift) | (word << (8 - shift));
  91. }
  92. static inline unsigned fls_long(unsigned long l)
  93. {
  94. if (sizeof(l) == 4)
  95. return fls(l);
  96. return fls64(l);
  97. }
  98. /**
  99. * __ffs64 - find first set bit in a 64 bit word
  100. * @word: The 64 bit word
  101. *
  102. * On 64 bit arches this is a synomyn for __ffs
  103. * The result is not defined if no bits are set, so check that @word
  104. * is non-zero before calling this.
  105. */
  106. static inline unsigned long __ffs64(u64 word)
  107. {
  108. #if BITS_PER_LONG == 32
  109. if (((u32)word) == 0UL)
  110. return __ffs((u32)(word >> 32)) + 32;
  111. #elif BITS_PER_LONG != 64
  112. #error BITS_PER_LONG not 32 or 64
  113. #endif
  114. return __ffs((unsigned long)word);
  115. }
  116. #ifdef __KERNEL__
  117. #ifdef CONFIG_GENERIC_FIND_FIRST_BIT
  118. /**
  119. * find_first_bit - find the first set bit in a memory region
  120. * @addr: The address to start the search at
  121. * @size: The maximum size to search
  122. *
  123. * Returns the bit number of the first set bit.
  124. */
  125. extern unsigned long find_first_bit(const unsigned long *addr,
  126. unsigned long size);
  127. /**
  128. * find_first_zero_bit - find the first cleared bit in a memory region
  129. * @addr: The address to start the search at
  130. * @size: The maximum size to search
  131. *
  132. * Returns the bit number of the first cleared bit.
  133. */
  134. extern unsigned long find_first_zero_bit(const unsigned long *addr,
  135. unsigned long size);
  136. #endif /* CONFIG_GENERIC_FIND_FIRST_BIT */
  137. #ifdef CONFIG_GENERIC_FIND_LAST_BIT
  138. /**
  139. * find_last_bit - find the last set bit in a memory region
  140. * @addr: The address to start the search at
  141. * @size: The maximum size to search
  142. *
  143. * Returns the bit number of the first set bit, or size.
  144. */
  145. extern unsigned long find_last_bit(const unsigned long *addr,
  146. unsigned long size);
  147. #endif /* CONFIG_GENERIC_FIND_LAST_BIT */
  148. #ifdef CONFIG_GENERIC_FIND_NEXT_BIT
  149. /**
  150. * find_next_bit - find the next set bit in a memory region
  151. * @addr: The address to base the search on
  152. * @offset: The bitnumber to start searching at
  153. * @size: The bitmap size in bits
  154. */
  155. extern unsigned long find_next_bit(const unsigned long *addr,
  156. unsigned long size, unsigned long offset);
  157. /**
  158. * find_next_zero_bit - find the next cleared bit in a memory region
  159. * @addr: The address to base the search on
  160. * @offset: The bitnumber to start searching at
  161. * @size: The bitmap size in bits
  162. */
  163. extern unsigned long find_next_zero_bit(const unsigned long *addr,
  164. unsigned long size,
  165. unsigned long offset);
  166. #endif /* CONFIG_GENERIC_FIND_NEXT_BIT */
  167. #endif /* __KERNEL__ */
  168. #endif