bitops.h 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257
  1. /*
  2. * PowerPC atomic bit operations.
  3. *
  4. * Merged version by David Gibson <david@gibson.dropbear.id.au>.
  5. * Based on ppc64 versions by: Dave Engebretsen, Todd Inglett, Don
  6. * Reed, Pat McCarthy, Peter Bergner, Anton Blanchard. They
  7. * originally took it from the ppc32 code.
  8. *
  9. * Within a word, bits are numbered LSB first. Lot's of places make
  10. * this assumption by directly testing bits with (val & (1<<nr)).
  11. * This can cause confusion for large (> 1 word) bitmaps on a
  12. * big-endian system because, unlike little endian, the number of each
  13. * bit depends on the word size.
  14. *
  15. * The bitop functions are defined to work on unsigned longs, so for a
  16. * ppc64 system the bits end up numbered:
  17. * |63..............0|127............64|191...........128|255...........192|
  18. * and on ppc32:
  19. * |31.....0|63....32|95....64|127...96|159..128|191..160|223..192|255..224|
  20. *
  21. * There are a few little-endian macros used mostly for filesystem
  22. * bitmaps, these work on similar bit arrays layouts, but
  23. * byte-oriented:
  24. * |7...0|15...8|23...16|31...24|39...32|47...40|55...48|63...56|
  25. *
  26. * The main difference is that bit 3-5 (64b) or 3-4 (32b) in the bit
  27. * number field needs to be reversed compared to the big-endian bit
  28. * fields. This can be achieved by XOR with 0x38 (64b) or 0x18 (32b).
  29. *
  30. * This program is free software; you can redistribute it and/or
  31. * modify it under the terms of the GNU General Public License
  32. * as published by the Free Software Foundation; either version
  33. * 2 of the License, or (at your option) any later version.
  34. */
  35. #ifndef _ASM_POWERPC_BITOPS_H
  36. #define _ASM_POWERPC_BITOPS_H
  37. #ifdef __KERNEL__
  38. #ifndef _LINUX_BITOPS_H
  39. #error only <linux/bitops.h> can be included directly
  40. #endif
  41. #include <linux/compiler.h>
  42. #include <asm/asm-compat.h>
  43. #include <asm/synch.h>
  44. #include <asm/asm-405.h>
  45. /* PPC bit number conversion */
  46. #define PPC_BITLSHIFT(be) (BITS_PER_LONG - 1 - (be))
  47. #define PPC_BIT(bit) (1UL << PPC_BITLSHIFT(bit))
  48. #define PPC_BITMASK(bs, be) ((PPC_BIT(bs) - PPC_BIT(be)) | PPC_BIT(bs))
  49. /* Put a PPC bit into a "normal" bit position */
  50. #define PPC_BITEXTRACT(bits, ppc_bit, dst_bit) \
  51. ((((bits) >> PPC_BITLSHIFT(ppc_bit)) & 1) << (dst_bit))
  52. #define PPC_BITLSHIFT32(be) (32 - 1 - (be))
  53. #define PPC_BIT32(bit) (1UL << PPC_BITLSHIFT32(bit))
  54. #define PPC_BITMASK32(bs, be) ((PPC_BIT32(bs) - PPC_BIT32(be))|PPC_BIT32(bs))
  55. #define PPC_BITLSHIFT8(be) (8 - 1 - (be))
  56. #define PPC_BIT8(bit) (1UL << PPC_BITLSHIFT8(bit))
  57. #define PPC_BITMASK8(bs, be) ((PPC_BIT8(bs) - PPC_BIT8(be))|PPC_BIT8(bs))
  58. #include <asm/barrier.h>
  59. /* Macro for generating the ***_bits() functions */
  60. #define DEFINE_BITOP(fn, op, prefix) \
  61. static __inline__ void fn(unsigned long mask, \
  62. volatile unsigned long *_p) \
  63. { \
  64. unsigned long old; \
  65. unsigned long *p = (unsigned long *)_p; \
  66. __asm__ __volatile__ ( \
  67. prefix \
  68. "1:" PPC_LLARX(%0,0,%3,0) "\n" \
  69. stringify_in_c(op) "%0,%0,%2\n" \
  70. PPC405_ERR77(0,%3) \
  71. PPC_STLCX "%0,0,%3\n" \
  72. "bne- 1b\n" \
  73. : "=&r" (old), "+m" (*p) \
  74. : "r" (mask), "r" (p) \
  75. : "cc", "memory"); \
  76. }
  77. DEFINE_BITOP(set_bits, or, "")
  78. DEFINE_BITOP(clear_bits, andc, "")
  79. DEFINE_BITOP(clear_bits_unlock, andc, PPC_RELEASE_BARRIER)
  80. DEFINE_BITOP(change_bits, xor, "")
  81. static __inline__ void set_bit(int nr, volatile unsigned long *addr)
  82. {
  83. set_bits(BIT_MASK(nr), addr + BIT_WORD(nr));
  84. }
  85. static __inline__ void clear_bit(int nr, volatile unsigned long *addr)
  86. {
  87. clear_bits(BIT_MASK(nr), addr + BIT_WORD(nr));
  88. }
  89. static __inline__ void clear_bit_unlock(int nr, volatile unsigned long *addr)
  90. {
  91. clear_bits_unlock(BIT_MASK(nr), addr + BIT_WORD(nr));
  92. }
  93. static __inline__ void change_bit(int nr, volatile unsigned long *addr)
  94. {
  95. change_bits(BIT_MASK(nr), addr + BIT_WORD(nr));
  96. }
  97. /* Like DEFINE_BITOP(), with changes to the arguments to 'op' and the output
  98. * operands. */
  99. #define DEFINE_TESTOP(fn, op, prefix, postfix, eh) \
  100. static __inline__ unsigned long fn( \
  101. unsigned long mask, \
  102. volatile unsigned long *_p) \
  103. { \
  104. unsigned long old, t; \
  105. unsigned long *p = (unsigned long *)_p; \
  106. __asm__ __volatile__ ( \
  107. prefix \
  108. "1:" PPC_LLARX(%0,0,%3,eh) "\n" \
  109. stringify_in_c(op) "%1,%0,%2\n" \
  110. PPC405_ERR77(0,%3) \
  111. PPC_STLCX "%1,0,%3\n" \
  112. "bne- 1b\n" \
  113. postfix \
  114. : "=&r" (old), "=&r" (t) \
  115. : "r" (mask), "r" (p) \
  116. : "cc", "memory"); \
  117. return (old & mask); \
  118. }
  119. DEFINE_TESTOP(test_and_set_bits, or, PPC_ATOMIC_ENTRY_BARRIER,
  120. PPC_ATOMIC_EXIT_BARRIER, 0)
  121. DEFINE_TESTOP(test_and_set_bits_lock, or, "",
  122. PPC_ACQUIRE_BARRIER, 1)
  123. DEFINE_TESTOP(test_and_clear_bits, andc, PPC_ATOMIC_ENTRY_BARRIER,
  124. PPC_ATOMIC_EXIT_BARRIER, 0)
  125. DEFINE_TESTOP(test_and_change_bits, xor, PPC_ATOMIC_ENTRY_BARRIER,
  126. PPC_ATOMIC_EXIT_BARRIER, 0)
  127. static __inline__ int test_and_set_bit(unsigned long nr,
  128. volatile unsigned long *addr)
  129. {
  130. return test_and_set_bits(BIT_MASK(nr), addr + BIT_WORD(nr)) != 0;
  131. }
  132. static __inline__ int test_and_set_bit_lock(unsigned long nr,
  133. volatile unsigned long *addr)
  134. {
  135. return test_and_set_bits_lock(BIT_MASK(nr),
  136. addr + BIT_WORD(nr)) != 0;
  137. }
  138. static __inline__ int test_and_clear_bit(unsigned long nr,
  139. volatile unsigned long *addr)
  140. {
  141. return test_and_clear_bits(BIT_MASK(nr), addr + BIT_WORD(nr)) != 0;
  142. }
  143. static __inline__ int test_and_change_bit(unsigned long nr,
  144. volatile unsigned long *addr)
  145. {
  146. return test_and_change_bits(BIT_MASK(nr), addr + BIT_WORD(nr)) != 0;
  147. }
  148. #ifdef CONFIG_PPC64
  149. static __inline__ unsigned long clear_bit_unlock_return_word(int nr,
  150. volatile unsigned long *addr)
  151. {
  152. unsigned long old, t;
  153. unsigned long *p = (unsigned long *)addr + BIT_WORD(nr);
  154. unsigned long mask = BIT_MASK(nr);
  155. __asm__ __volatile__ (
  156. PPC_RELEASE_BARRIER
  157. "1:" PPC_LLARX(%0,0,%3,0) "\n"
  158. "andc %1,%0,%2\n"
  159. PPC405_ERR77(0,%3)
  160. PPC_STLCX "%1,0,%3\n"
  161. "bne- 1b\n"
  162. : "=&r" (old), "=&r" (t)
  163. : "r" (mask), "r" (p)
  164. : "cc", "memory");
  165. return old;
  166. }
  167. /* This is a special function for mm/filemap.c */
  168. #define clear_bit_unlock_is_negative_byte(nr, addr) \
  169. (clear_bit_unlock_return_word(nr, addr) & BIT_MASK(PG_waiters))
  170. #endif /* CONFIG_PPC64 */
  171. #include <asm-generic/bitops/non-atomic.h>
  172. static __inline__ void __clear_bit_unlock(int nr, volatile unsigned long *addr)
  173. {
  174. __asm__ __volatile__(PPC_RELEASE_BARRIER "" ::: "memory");
  175. __clear_bit(nr, addr);
  176. }
  177. /*
  178. * Return the zero-based bit position (LE, not IBM bit numbering) of
  179. * the most significant 1-bit in a double word.
  180. */
  181. #define __ilog2(x) ilog2(x)
  182. #include <asm-generic/bitops/ffz.h>
  183. #include <asm-generic/bitops/builtin-__ffs.h>
  184. #include <asm-generic/bitops/builtin-ffs.h>
  185. /*
  186. * fls: find last (most-significant) bit set.
  187. * Note fls(0) = 0, fls(1) = 1, fls(0x80000000) = 32.
  188. */
  189. static __inline__ int fls(unsigned int x)
  190. {
  191. return 32 - __builtin_clz(x);
  192. }
  193. #include <asm-generic/bitops/builtin-__fls.h>
  194. static __inline__ int fls64(__u64 x)
  195. {
  196. return 64 - __builtin_clzll(x);
  197. }
  198. #ifdef CONFIG_PPC64
  199. unsigned int __arch_hweight8(unsigned int w);
  200. unsigned int __arch_hweight16(unsigned int w);
  201. unsigned int __arch_hweight32(unsigned int w);
  202. unsigned long __arch_hweight64(__u64 w);
  203. #include <asm-generic/bitops/const_hweight.h>
  204. #else
  205. #include <asm-generic/bitops/hweight.h>
  206. #endif
  207. #include <asm-generic/bitops/find.h>
  208. /* Little-endian versions */
  209. #include <asm-generic/bitops/le.h>
  210. /* Bitmap functions for the ext2 filesystem */
  211. #include <asm-generic/bitops/ext2-atomic-setbit.h>
  212. #include <asm-generic/bitops/sched.h>
  213. #endif /* __KERNEL__ */
  214. #endif /* _ASM_POWERPC_BITOPS_H */