bitops.h 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358
  1. /*
  2. * U-Boot - bitops.h Routines for bit operations
  3. *
  4. * Copyright (c) 2005-2007 Analog Devices Inc.
  5. *
  6. * SPDX-License-Identifier: GPL-2.0+
  7. */
  8. #ifndef _BLACKFIN_BITOPS_H
  9. #define _BLACKFIN_BITOPS_H
  10. /*
  11. * Copyright 1992, Linus Torvalds.
  12. */
  13. #include <asm/byteorder.h>
  14. #include <asm/system.h>
  15. #include <asm-generic/bitops/fls.h>
  16. #include <asm-generic/bitops/__fls.h>
  17. #include <asm-generic/bitops/fls64.h>
  18. #include <asm-generic/bitops/__ffs.h>
  19. #ifdef __KERNEL__
  20. /*
  21. * Function prototypes to keep gcc -Wall happy
  22. */
  23. /*
  24. * The __ functions are not atomic
  25. */
  26. /*
  27. * ffz = Find First Zero in word. Undefined if no zero exists,
  28. * so code should check against ~0UL first..
  29. */
  30. static __inline__ unsigned long ffz(unsigned long word)
  31. {
  32. unsigned long result = 0;
  33. while (word & 1) {
  34. result++;
  35. word >>= 1;
  36. }
  37. return result;
  38. }
  39. static __inline__ void set_bit(int nr, volatile void *addr)
  40. {
  41. int *a = (int *)addr;
  42. int mask;
  43. unsigned long flags;
  44. a += nr >> 5;
  45. mask = 1 << (nr & 0x1f);
  46. local_irq_save(flags);
  47. *a |= mask;
  48. local_irq_restore(flags);
  49. }
  50. static __inline__ void __set_bit(int nr, volatile void *addr)
  51. {
  52. int *a = (int *)addr;
  53. int mask;
  54. a += nr >> 5;
  55. mask = 1 << (nr & 0x1f);
  56. *a |= mask;
  57. }
  58. #define PLATFORM__SET_BIT
  59. /*
  60. * clear_bit() doesn't provide any barrier for the compiler.
  61. */
  62. #define smp_mb__before_clear_bit() barrier()
  63. #define smp_mb__after_clear_bit() barrier()
  64. static __inline__ void clear_bit(int nr, volatile void *addr)
  65. {
  66. int *a = (int *)addr;
  67. int mask;
  68. unsigned long flags;
  69. a += nr >> 5;
  70. mask = 1 << (nr & 0x1f);
  71. local_irq_save(flags);
  72. *a &= ~mask;
  73. local_irq_restore(flags);
  74. }
  75. static __inline__ void change_bit(int nr, volatile void *addr)
  76. {
  77. int mask, flags;
  78. unsigned long *ADDR = (unsigned long *)addr;
  79. ADDR += nr >> 5;
  80. mask = 1 << (nr & 31);
  81. local_irq_save(flags);
  82. *ADDR ^= mask;
  83. local_irq_restore(flags);
  84. }
  85. static __inline__ void __change_bit(int nr, volatile void *addr)
  86. {
  87. int mask;
  88. unsigned long *ADDR = (unsigned long *)addr;
  89. ADDR += nr >> 5;
  90. mask = 1 << (nr & 31);
  91. *ADDR ^= mask;
  92. }
  93. static __inline__ int test_and_set_bit(int nr, volatile void *addr)
  94. {
  95. int mask, retval;
  96. volatile unsigned int *a = (volatile unsigned int *)addr;
  97. unsigned long flags;
  98. a += nr >> 5;
  99. mask = 1 << (nr & 0x1f);
  100. local_irq_save(flags);
  101. retval = (mask & *a) != 0;
  102. *a |= mask;
  103. local_irq_restore(flags);
  104. return retval;
  105. }
  106. static __inline__ int __test_and_set_bit(int nr, volatile void *addr)
  107. {
  108. int mask, retval;
  109. volatile unsigned int *a = (volatile unsigned int *)addr;
  110. a += nr >> 5;
  111. mask = 1 << (nr & 0x1f);
  112. retval = (mask & *a) != 0;
  113. *a |= mask;
  114. return retval;
  115. }
  116. static __inline__ int test_and_clear_bit(int nr, volatile void *addr)
  117. {
  118. int mask, retval;
  119. volatile unsigned int *a = (volatile unsigned int *)addr;
  120. unsigned long flags;
  121. a += nr >> 5;
  122. mask = 1 << (nr & 0x1f);
  123. local_irq_save(flags);
  124. retval = (mask & *a) != 0;
  125. *a &= ~mask;
  126. local_irq_restore(flags);
  127. return retval;
  128. }
  129. static __inline__ int __test_and_clear_bit(int nr, volatile void *addr)
  130. {
  131. int mask, retval;
  132. volatile unsigned int *a = (volatile unsigned int *)addr;
  133. a += nr >> 5;
  134. mask = 1 << (nr & 0x1f);
  135. retval = (mask & *a) != 0;
  136. *a &= ~mask;
  137. return retval;
  138. }
  139. static __inline__ int test_and_change_bit(int nr, volatile void *addr)
  140. {
  141. int mask, retval;
  142. volatile unsigned int *a = (volatile unsigned int *)addr;
  143. unsigned long flags;
  144. a += nr >> 5;
  145. mask = 1 << (nr & 0x1f);
  146. local_irq_save(flags);
  147. retval = (mask & *a) != 0;
  148. *a ^= mask;
  149. local_irq_restore(flags);
  150. return retval;
  151. }
  152. static __inline__ int __test_and_change_bit(int nr, volatile void *addr)
  153. {
  154. int mask, retval;
  155. volatile unsigned int *a = (volatile unsigned int *)addr;
  156. a += nr >> 5;
  157. mask = 1 << (nr & 0x1f);
  158. retval = (mask & *a) != 0;
  159. *a ^= mask;
  160. return retval;
  161. }
  162. /*
  163. * This routine doesn't need to be atomic.
  164. */
  165. static __inline__ int __constant_test_bit(int nr, const volatile void *addr)
  166. {
  167. return ((1UL << (nr & 31)) &
  168. (((const volatile unsigned int *)addr)[nr >> 5])) != 0;
  169. }
  170. static __inline__ int __test_bit(int nr, volatile void *addr)
  171. {
  172. int *a = (int *)addr;
  173. int mask;
  174. a += nr >> 5;
  175. mask = 1 << (nr & 0x1f);
  176. return ((mask & *a) != 0);
  177. }
  178. #define test_bit(nr,addr) \
  179. (__builtin_constant_p(nr) ? \
  180. __constant_test_bit((nr),(addr)) : \
  181. __test_bit((nr),(addr)))
  182. #define find_first_zero_bit(addr, size) \
  183. find_next_zero_bit((addr), (size), 0)
  184. static __inline__ int find_next_zero_bit(void *addr, int size, int offset)
  185. {
  186. unsigned long *p = ((unsigned long *)addr) + (offset >> 5);
  187. unsigned long result = offset & ~31UL;
  188. unsigned long tmp;
  189. if (offset >= size)
  190. return size;
  191. size -= result;
  192. offset &= 31UL;
  193. if (offset) {
  194. tmp = *(p++);
  195. tmp |= ~0UL >> (32 - offset);
  196. if (size < 32)
  197. goto found_first;
  198. if (~tmp)
  199. goto found_middle;
  200. size -= 32;
  201. result += 32;
  202. }
  203. while (size & ~31UL) {
  204. if (~(tmp = *(p++)))
  205. goto found_middle;
  206. result += 32;
  207. size -= 32;
  208. }
  209. if (!size)
  210. return result;
  211. tmp = *p;
  212. found_first:
  213. tmp |= ~0UL >> size;
  214. found_middle:
  215. return result + ffz(tmp);
  216. }
  217. /*
  218. * hweightN: returns the hamming weight (i.e. the number
  219. * of bits set) of a N-bit word
  220. */
  221. #define hweight32(x) generic_hweight32(x)
  222. #define hweight16(x) generic_hweight16(x)
  223. #define hweight8(x) generic_hweight8(x)
  224. static __inline__ int ext2_set_bit(int nr, volatile void *addr)
  225. {
  226. int mask, retval;
  227. unsigned long flags;
  228. volatile unsigned char *ADDR = (unsigned char *)addr;
  229. ADDR += nr >> 3;
  230. mask = 1 << (nr & 0x07);
  231. local_irq_save(flags);
  232. retval = (mask & *ADDR) != 0;
  233. *ADDR |= mask;
  234. local_irq_restore(flags);
  235. return retval;
  236. }
  237. static __inline__ int ext2_clear_bit(int nr, volatile void *addr)
  238. {
  239. int mask, retval;
  240. unsigned long flags;
  241. volatile unsigned char *ADDR = (unsigned char *)addr;
  242. ADDR += nr >> 3;
  243. mask = 1 << (nr & 0x07);
  244. local_irq_save(flags);
  245. retval = (mask & *ADDR) != 0;
  246. *ADDR &= ~mask;
  247. local_irq_restore(flags);
  248. return retval;
  249. }
  250. static __inline__ int ext2_test_bit(int nr, const volatile void *addr)
  251. {
  252. int mask;
  253. const volatile unsigned char *ADDR = (const unsigned char *)addr;
  254. ADDR += nr >> 3;
  255. mask = 1 << (nr & 0x07);
  256. return ((mask & *ADDR) != 0);
  257. }
  258. #define ext2_find_first_zero_bit(addr, size) \
  259. ext2_find_next_zero_bit((addr), (size), 0)
  260. static __inline__ unsigned long ext2_find_next_zero_bit(void *addr,
  261. unsigned long size,
  262. unsigned long offset)
  263. {
  264. unsigned long *p = ((unsigned long *)addr) + (offset >> 5);
  265. unsigned long result = offset & ~31UL;
  266. unsigned long tmp;
  267. if (offset >= size)
  268. return size;
  269. size -= result;
  270. offset &= 31UL;
  271. if (offset) {
  272. tmp = *(p++);
  273. tmp |= ~0UL >> (32 - offset);
  274. if (size < 32)
  275. goto found_first;
  276. if (~tmp)
  277. goto found_middle;
  278. size -= 32;
  279. result += 32;
  280. }
  281. while (size & ~31UL) {
  282. if (~(tmp = *(p++)))
  283. goto found_middle;
  284. result += 32;
  285. size -= 32;
  286. }
  287. if (!size)
  288. return result;
  289. tmp = *p;
  290. found_first:
  291. tmp |= ~0UL >> size;
  292. found_middle:
  293. return result + ffz(tmp);
  294. }
  295. /* Bitmap functions for the minix filesystem. */
  296. #define minix_test_and_set_bit(nr,addr) test_and_set_bit(nr,addr)
  297. #define minix_set_bit(nr,addr) set_bit(nr,addr)
  298. #define minix_test_and_clear_bit(nr,addr) test_and_clear_bit(nr,addr)
  299. #define minix_test_bit(nr,addr) test_bit(nr,addr)
  300. #define minix_find_first_zero_bit(addr,size) find_first_zero_bit(addr,size)
  301. #endif
  302. #endif