bitmap.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309
  1. #ifndef __LINUX_BITMAP_H
  2. #define __LINUX_BITMAP_H
  3. #ifndef __ASSEMBLY__
  4. #include <linux/types.h>
  5. #include <linux/bitops.h>
  6. #include <linux/string.h>
  7. #include <linux/kernel.h>
  8. /*
  9. * bitmaps provide bit arrays that consume one or more unsigned
  10. * longs. The bitmap interface and available operations are listed
  11. * here, in bitmap.h
  12. *
  13. * Function implementations generic to all architectures are in
  14. * lib/bitmap.c. Functions implementations that are architecture
  15. * specific are in various include/asm-<arch>/bitops.h headers
  16. * and other arch/<arch> specific files.
  17. *
  18. * See lib/bitmap.c for more details.
  19. */
  20. /*
  21. * The available bitmap operations and their rough meaning in the
  22. * case that the bitmap is a single unsigned long are thus:
  23. *
  24. * Note that nbits should be always a compile time evaluable constant.
  25. * Otherwise many inlines will generate horrible code.
  26. *
  27. * bitmap_zero(dst, nbits) *dst = 0UL
  28. * bitmap_fill(dst, nbits) *dst = ~0UL
  29. * bitmap_copy(dst, src, nbits) *dst = *src
  30. * bitmap_and(dst, src1, src2, nbits) *dst = *src1 & *src2
  31. * bitmap_or(dst, src1, src2, nbits) *dst = *src1 | *src2
  32. * bitmap_xor(dst, src1, src2, nbits) *dst = *src1 ^ *src2
  33. * bitmap_andnot(dst, src1, src2, nbits) *dst = *src1 & ~(*src2)
  34. * bitmap_complement(dst, src, nbits) *dst = ~(*src)
  35. * bitmap_equal(src1, src2, nbits) Are *src1 and *src2 equal?
  36. * bitmap_intersects(src1, src2, nbits) Do *src1 and *src2 overlap?
  37. * bitmap_subset(src1, src2, nbits) Is *src1 a subset of *src2?
  38. * bitmap_empty(src, nbits) Are all bits zero in *src?
  39. * bitmap_full(src, nbits) Are all bits set in *src?
  40. * bitmap_weight(src, nbits) Hamming Weight: number set bits
  41. * bitmap_set(dst, pos, nbits) Set specified bit area
  42. * bitmap_clear(dst, pos, nbits) Clear specified bit area
  43. * bitmap_find_next_zero_area(buf, len, pos, n, mask) Find bit free area
  44. * bitmap_shift_right(dst, src, n, nbits) *dst = *src >> n
  45. * bitmap_shift_left(dst, src, n, nbits) *dst = *src << n
  46. * bitmap_remap(dst, src, old, new, nbits) *dst = map(old, new)(src)
  47. * bitmap_bitremap(oldbit, old, new, nbits) newbit = map(old, new)(oldbit)
  48. * bitmap_onto(dst, orig, relmap, nbits) *dst = orig relative to relmap
  49. * bitmap_fold(dst, orig, sz, nbits) dst bits = orig bits mod sz
  50. * bitmap_scnprintf(buf, len, src, nbits) Print bitmap src to buf
  51. * bitmap_parse(buf, buflen, dst, nbits) Parse bitmap dst from kernel buf
  52. * bitmap_parse_user(ubuf, ulen, dst, nbits) Parse bitmap dst from user buf
  53. * bitmap_scnlistprintf(buf, len, src, nbits) Print bitmap src as list to buf
  54. * bitmap_parselist(buf, dst, nbits) Parse bitmap dst from kernel buf
  55. * bitmap_parselist_user(buf, dst, nbits) Parse bitmap dst from user buf
  56. * bitmap_find_free_region(bitmap, bits, order) Find and allocate bit region
  57. * bitmap_release_region(bitmap, pos, order) Free specified bit region
  58. * bitmap_allocate_region(bitmap, pos, order) Allocate specified bit region
  59. */
  60. /*
  61. * Also the following operations in asm/bitops.h apply to bitmaps.
  62. *
  63. * set_bit(bit, addr) *addr |= bit
  64. * clear_bit(bit, addr) *addr &= ~bit
  65. * change_bit(bit, addr) *addr ^= bit
  66. * test_bit(bit, addr) Is bit set in *addr?
  67. * test_and_set_bit(bit, addr) Set bit and return old value
  68. * test_and_clear_bit(bit, addr) Clear bit and return old value
  69. * test_and_change_bit(bit, addr) Change bit and return old value
  70. * find_first_zero_bit(addr, nbits) Position first zero bit in *addr
  71. * find_first_bit(addr, nbits) Position first set bit in *addr
  72. * find_next_zero_bit(addr, nbits, bit) Position next zero bit in *addr >= bit
  73. * find_next_bit(addr, nbits, bit) Position next set bit in *addr >= bit
  74. */
  75. /*
  76. * The DECLARE_BITMAP(name,bits) macro, in linux/types.h, can be used
  77. * to declare an array named 'name' of just enough unsigned longs to
  78. * contain all bit positions from 0 to 'bits' - 1.
  79. */
  80. /*
  81. * lib/bitmap.c provides these functions:
  82. */
  83. extern int __bitmap_empty(const unsigned long *bitmap, int bits);
  84. extern int __bitmap_full(const unsigned long *bitmap, int bits);
  85. extern int __bitmap_equal(const unsigned long *bitmap1,
  86. const unsigned long *bitmap2, int bits);
  87. extern void __bitmap_complement(unsigned long *dst, const unsigned long *src,
  88. int bits);
  89. extern void __bitmap_shift_right(unsigned long *dst,
  90. const unsigned long *src, int shift, int bits);
  91. extern void __bitmap_shift_left(unsigned long *dst,
  92. const unsigned long *src, int shift, int bits);
  93. extern int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
  94. const unsigned long *bitmap2, int bits);
  95. extern void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
  96. const unsigned long *bitmap2, int bits);
  97. extern void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
  98. const unsigned long *bitmap2, int bits);
  99. extern int __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
  100. const unsigned long *bitmap2, int bits);
  101. extern int __bitmap_intersects(const unsigned long *bitmap1,
  102. const unsigned long *bitmap2, int bits);
  103. extern int __bitmap_subset(const unsigned long *bitmap1,
  104. const unsigned long *bitmap2, int bits);
  105. extern int __bitmap_weight(const unsigned long *bitmap, int bits);
  106. extern void bitmap_set(unsigned long *map, int i, int len);
  107. extern void bitmap_clear(unsigned long *map, int start, int nr);
  108. extern unsigned long bitmap_find_next_zero_area(unsigned long *map,
  109. unsigned long size,
  110. unsigned long start,
  111. unsigned int nr,
  112. unsigned long align_mask);
  113. extern int bitmap_scnprintf(char *buf, unsigned int len,
  114. const unsigned long *src, int nbits);
  115. extern int __bitmap_parse(const char *buf, unsigned int buflen, int is_user,
  116. unsigned long *dst, int nbits);
  117. extern int bitmap_parse_user(const char __user *ubuf, unsigned int ulen,
  118. unsigned long *dst, int nbits);
  119. extern int bitmap_scnlistprintf(char *buf, unsigned int len,
  120. const unsigned long *src, int nbits);
  121. extern int bitmap_parselist(const char *buf, unsigned long *maskp,
  122. int nmaskbits);
  123. extern int bitmap_parselist_user(const char __user *ubuf, unsigned int ulen,
  124. unsigned long *dst, int nbits);
  125. extern void bitmap_remap(unsigned long *dst, const unsigned long *src,
  126. const unsigned long *old, const unsigned long *new, int bits);
  127. extern int bitmap_bitremap(int oldbit,
  128. const unsigned long *old, const unsigned long *new, int bits);
  129. extern void bitmap_onto(unsigned long *dst, const unsigned long *orig,
  130. const unsigned long *relmap, int bits);
  131. extern void bitmap_fold(unsigned long *dst, const unsigned long *orig,
  132. int sz, int bits);
  133. extern int bitmap_find_free_region(unsigned long *bitmap, int bits, int order);
  134. extern void bitmap_release_region(unsigned long *bitmap, int pos, int order);
  135. extern int bitmap_allocate_region(unsigned long *bitmap, int pos, int order);
  136. extern void bitmap_copy_le(void *dst, const unsigned long *src, int nbits);
  137. extern int bitmap_ord_to_pos(const unsigned long *bitmap, int n, int bits);
  138. #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) % BITS_PER_LONG))
  139. #define BITMAP_LAST_WORD_MASK(nbits) \
  140. ( \
  141. ((nbits) % BITS_PER_LONG) ? \
  142. (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \
  143. )
  144. #define small_const_nbits(nbits) \
  145. (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG)
  146. static inline void bitmap_zero(unsigned long *dst, int nbits)
  147. {
  148. if (small_const_nbits(nbits))
  149. *dst = 0UL;
  150. else {
  151. int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
  152. memset(dst, 0, len);
  153. }
  154. }
  155. static inline void bitmap_fill(unsigned long *dst, int nbits)
  156. {
  157. size_t nlongs = BITS_TO_LONGS(nbits);
  158. if (!small_const_nbits(nbits)) {
  159. int len = (nlongs - 1) * sizeof(unsigned long);
  160. memset(dst, 0xff, len);
  161. }
  162. dst[nlongs - 1] = BITMAP_LAST_WORD_MASK(nbits);
  163. }
  164. static inline void bitmap_copy(unsigned long *dst, const unsigned long *src,
  165. int nbits)
  166. {
  167. if (small_const_nbits(nbits))
  168. *dst = *src;
  169. else {
  170. int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
  171. memcpy(dst, src, len);
  172. }
  173. }
  174. static inline int bitmap_and(unsigned long *dst, const unsigned long *src1,
  175. const unsigned long *src2, int nbits)
  176. {
  177. if (small_const_nbits(nbits))
  178. return (*dst = *src1 & *src2) != 0;
  179. return __bitmap_and(dst, src1, src2, nbits);
  180. }
  181. static inline void bitmap_or(unsigned long *dst, const unsigned long *src1,
  182. const unsigned long *src2, int nbits)
  183. {
  184. if (small_const_nbits(nbits))
  185. *dst = *src1 | *src2;
  186. else
  187. __bitmap_or(dst, src1, src2, nbits);
  188. }
  189. static inline void bitmap_xor(unsigned long *dst, const unsigned long *src1,
  190. const unsigned long *src2, int nbits)
  191. {
  192. if (small_const_nbits(nbits))
  193. *dst = *src1 ^ *src2;
  194. else
  195. __bitmap_xor(dst, src1, src2, nbits);
  196. }
  197. static inline int bitmap_andnot(unsigned long *dst, const unsigned long *src1,
  198. const unsigned long *src2, int nbits)
  199. {
  200. if (small_const_nbits(nbits))
  201. return (*dst = *src1 & ~(*src2)) != 0;
  202. return __bitmap_andnot(dst, src1, src2, nbits);
  203. }
  204. static inline void bitmap_complement(unsigned long *dst, const unsigned long *src,
  205. int nbits)
  206. {
  207. if (small_const_nbits(nbits))
  208. *dst = ~(*src) & BITMAP_LAST_WORD_MASK(nbits);
  209. else
  210. __bitmap_complement(dst, src, nbits);
  211. }
  212. static inline int bitmap_equal(const unsigned long *src1,
  213. const unsigned long *src2, int nbits)
  214. {
  215. if (small_const_nbits(nbits))
  216. return ! ((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits));
  217. else
  218. return __bitmap_equal(src1, src2, nbits);
  219. }
  220. static inline int bitmap_intersects(const unsigned long *src1,
  221. const unsigned long *src2, int nbits)
  222. {
  223. if (small_const_nbits(nbits))
  224. return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0;
  225. else
  226. return __bitmap_intersects(src1, src2, nbits);
  227. }
  228. static inline int bitmap_subset(const unsigned long *src1,
  229. const unsigned long *src2, int nbits)
  230. {
  231. if (small_const_nbits(nbits))
  232. return ! ((*src1 & ~(*src2)) & BITMAP_LAST_WORD_MASK(nbits));
  233. else
  234. return __bitmap_subset(src1, src2, nbits);
  235. }
  236. static inline int bitmap_empty(const unsigned long *src, int nbits)
  237. {
  238. if (small_const_nbits(nbits))
  239. return ! (*src & BITMAP_LAST_WORD_MASK(nbits));
  240. else
  241. return __bitmap_empty(src, nbits);
  242. }
  243. static inline int bitmap_full(const unsigned long *src, int nbits)
  244. {
  245. if (small_const_nbits(nbits))
  246. return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits));
  247. else
  248. return __bitmap_full(src, nbits);
  249. }
  250. static inline int bitmap_weight(const unsigned long *src, int nbits)
  251. {
  252. if (small_const_nbits(nbits))
  253. return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits));
  254. return __bitmap_weight(src, nbits);
  255. }
  256. static inline void bitmap_shift_right(unsigned long *dst,
  257. const unsigned long *src, int n, int nbits)
  258. {
  259. if (small_const_nbits(nbits))
  260. *dst = *src >> n;
  261. else
  262. __bitmap_shift_right(dst, src, n, nbits);
  263. }
  264. static inline void bitmap_shift_left(unsigned long *dst,
  265. const unsigned long *src, int n, int nbits)
  266. {
  267. if (small_const_nbits(nbits))
  268. *dst = (*src << n) & BITMAP_LAST_WORD_MASK(nbits);
  269. else
  270. __bitmap_shift_left(dst, src, n, nbits);
  271. }
  272. static inline int bitmap_parse(const char *buf, unsigned int buflen,
  273. unsigned long *maskp, int nmaskbits)
  274. {
  275. return __bitmap_parse(buf, buflen, 0, maskp, nmaskbits);
  276. }
  277. #endif /* __ASSEMBLY__ */
  278. #endif /* __LINUX_BITMAP_H */