bitops.h 4.4 KB

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