bitmap.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324
  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_find_next_zero_area_off(buf, len, pos, n, mask) as above
  45. * bitmap_shift_right(dst, src, n, nbits) *dst = *src >> n
  46. * bitmap_shift_left(dst, src, n, nbits) *dst = *src << n
  47. * bitmap_remap(dst, src, old, new, nbits) *dst = map(old, new)(src)
  48. * bitmap_bitremap(oldbit, old, new, nbits) newbit = map(old, new)(oldbit)
  49. * bitmap_onto(dst, orig, relmap, nbits) *dst = orig relative to relmap
  50. * bitmap_fold(dst, orig, sz, nbits) dst bits = orig bits mod sz
  51. * bitmap_scnprintf(buf, len, src, nbits) Print bitmap src to buf
  52. * bitmap_parse(buf, buflen, dst, nbits) Parse bitmap dst from kernel buf
  53. * bitmap_parse_user(ubuf, ulen, dst, nbits) Parse bitmap dst from user buf
  54. * bitmap_scnlistprintf(buf, len, src, nbits) Print bitmap src as list to buf
  55. * bitmap_parselist(buf, dst, nbits) Parse bitmap dst from kernel buf
  56. * bitmap_parselist_user(buf, dst, nbits) Parse bitmap dst from user buf
  57. * bitmap_find_free_region(bitmap, bits, order) Find and allocate bit region
  58. * bitmap_release_region(bitmap, pos, order) Free specified bit region
  59. * bitmap_allocate_region(bitmap, pos, order) Allocate specified bit region
  60. */
  61. /*
  62. * Also the following operations in asm/bitops.h apply to bitmaps.
  63. *
  64. * set_bit(bit, addr) *addr |= bit
  65. * clear_bit(bit, addr) *addr &= ~bit
  66. * change_bit(bit, addr) *addr ^= bit
  67. * test_bit(bit, addr) Is bit set in *addr?
  68. * test_and_set_bit(bit, addr) Set bit and return old value
  69. * test_and_clear_bit(bit, addr) Clear bit and return old value
  70. * test_and_change_bit(bit, addr) Change bit and return old value
  71. * find_first_zero_bit(addr, nbits) Position first zero bit in *addr
  72. * find_first_bit(addr, nbits) Position first set bit in *addr
  73. * find_next_zero_bit(addr, nbits, bit) Position next zero bit in *addr >= bit
  74. * find_next_bit(addr, nbits, bit) Position next set bit in *addr >= bit
  75. */
  76. /*
  77. * The DECLARE_BITMAP(name,bits) macro, in linux/types.h, can be used
  78. * to declare an array named 'name' of just enough unsigned longs to
  79. * contain all bit positions from 0 to 'bits' - 1.
  80. */
  81. /*
  82. * lib/bitmap.c provides these functions:
  83. */
  84. extern int __bitmap_empty(const unsigned long *bitmap, int bits);
  85. extern int __bitmap_full(const unsigned long *bitmap, int bits);
  86. extern int __bitmap_equal(const unsigned long *bitmap1,
  87. const unsigned long *bitmap2, int bits);
  88. extern void __bitmap_complement(unsigned long *dst, const unsigned long *src,
  89. int bits);
  90. extern void __bitmap_shift_right(unsigned long *dst,
  91. const unsigned long *src, int shift, int bits);
  92. extern void __bitmap_shift_left(unsigned long *dst,
  93. const unsigned long *src, int shift, int bits);
  94. extern int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
  95. const unsigned long *bitmap2, int bits);
  96. extern void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
  97. const unsigned long *bitmap2, int bits);
  98. extern void __bitmap_xor(unsigned long *dst, const unsigned long *bitmap1,
  99. const unsigned long *bitmap2, int bits);
  100. extern int __bitmap_andnot(unsigned long *dst, const unsigned long *bitmap1,
  101. const unsigned long *bitmap2, int bits);
  102. extern int __bitmap_intersects(const unsigned long *bitmap1,
  103. const unsigned long *bitmap2, int bits);
  104. extern int __bitmap_subset(const unsigned long *bitmap1,
  105. const unsigned long *bitmap2, int bits);
  106. extern int __bitmap_weight(const unsigned long *bitmap, int bits);
  107. extern void bitmap_set(unsigned long *map, int i, int len);
  108. extern void bitmap_clear(unsigned long *map, int start, int nr);
  109. extern unsigned long bitmap_find_next_zero_area_off(unsigned long *map,
  110. unsigned long size,
  111. unsigned long start,
  112. unsigned int nr,
  113. unsigned long align_mask,
  114. unsigned long align_offset);
  115. static inline unsigned long
  116. bitmap_find_next_zero_area(unsigned long *map,
  117. unsigned long size,
  118. unsigned long start,
  119. unsigned int nr,
  120. unsigned long align_mask)
  121. {
  122. return bitmap_find_next_zero_area_off(map, size, start, nr,
  123. align_mask, 0);
  124. }
  125. extern int bitmap_scnprintf(char *buf, unsigned int len,
  126. const unsigned long *src, int nbits);
  127. extern int __bitmap_parse(const char *buf, unsigned int buflen, int is_user,
  128. unsigned long *dst, int nbits);
  129. extern int bitmap_parse_user(const char __user *ubuf, unsigned int ulen,
  130. unsigned long *dst, int nbits);
  131. extern int bitmap_scnlistprintf(char *buf, unsigned int len,
  132. const unsigned long *src, int nbits);
  133. extern int bitmap_parselist(const char *buf, unsigned long *maskp,
  134. int nmaskbits);
  135. extern int bitmap_parselist_user(const char __user *ubuf, unsigned int ulen,
  136. unsigned long *dst, int nbits);
  137. extern void bitmap_remap(unsigned long *dst, const unsigned long *src,
  138. const unsigned long *old, const unsigned long *new, int bits);
  139. extern int bitmap_bitremap(int oldbit,
  140. const unsigned long *old, const unsigned long *new, int bits);
  141. extern void bitmap_onto(unsigned long *dst, const unsigned long *orig,
  142. const unsigned long *relmap, int bits);
  143. extern void bitmap_fold(unsigned long *dst, const unsigned long *orig,
  144. int sz, int bits);
  145. extern int bitmap_find_free_region(unsigned long *bitmap, int bits, int order);
  146. extern void bitmap_release_region(unsigned long *bitmap, int pos, int order);
  147. extern int bitmap_allocate_region(unsigned long *bitmap, int pos, int order);
  148. extern void bitmap_copy_le(void *dst, const unsigned long *src, int nbits);
  149. extern int bitmap_ord_to_pos(const unsigned long *bitmap, int n, int bits);
  150. #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) % BITS_PER_LONG))
  151. #define BITMAP_LAST_WORD_MASK(nbits) \
  152. ( \
  153. ((nbits) % BITS_PER_LONG) ? \
  154. (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \
  155. )
  156. #define small_const_nbits(nbits) \
  157. (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG)
  158. static inline void bitmap_zero(unsigned long *dst, int nbits)
  159. {
  160. if (small_const_nbits(nbits))
  161. *dst = 0UL;
  162. else {
  163. int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
  164. memset(dst, 0, len);
  165. }
  166. }
  167. static inline void bitmap_fill(unsigned long *dst, int nbits)
  168. {
  169. size_t nlongs = BITS_TO_LONGS(nbits);
  170. if (!small_const_nbits(nbits)) {
  171. int len = (nlongs - 1) * sizeof(unsigned long);
  172. memset(dst, 0xff, len);
  173. }
  174. dst[nlongs - 1] = BITMAP_LAST_WORD_MASK(nbits);
  175. }
  176. static inline void bitmap_copy(unsigned long *dst, const unsigned long *src,
  177. int nbits)
  178. {
  179. if (small_const_nbits(nbits))
  180. *dst = *src;
  181. else {
  182. int len = BITS_TO_LONGS(nbits) * sizeof(unsigned long);
  183. memcpy(dst, src, len);
  184. }
  185. }
  186. static inline int bitmap_and(unsigned long *dst, const unsigned long *src1,
  187. const unsigned long *src2, int nbits)
  188. {
  189. if (small_const_nbits(nbits))
  190. return (*dst = *src1 & *src2) != 0;
  191. return __bitmap_and(dst, src1, src2, nbits);
  192. }
  193. static inline void bitmap_or(unsigned long *dst, const unsigned long *src1,
  194. const unsigned long *src2, int nbits)
  195. {
  196. if (small_const_nbits(nbits))
  197. *dst = *src1 | *src2;
  198. else
  199. __bitmap_or(dst, src1, src2, nbits);
  200. }
  201. static inline void bitmap_xor(unsigned long *dst, const unsigned long *src1,
  202. const unsigned long *src2, int nbits)
  203. {
  204. if (small_const_nbits(nbits))
  205. *dst = *src1 ^ *src2;
  206. else
  207. __bitmap_xor(dst, src1, src2, nbits);
  208. }
  209. static inline int bitmap_andnot(unsigned long *dst, const unsigned long *src1,
  210. const unsigned long *src2, int nbits)
  211. {
  212. if (small_const_nbits(nbits))
  213. return (*dst = *src1 & ~(*src2)) != 0;
  214. return __bitmap_andnot(dst, src1, src2, nbits);
  215. }
  216. static inline void bitmap_complement(unsigned long *dst, const unsigned long *src,
  217. int nbits)
  218. {
  219. if (small_const_nbits(nbits))
  220. *dst = ~(*src) & BITMAP_LAST_WORD_MASK(nbits);
  221. else
  222. __bitmap_complement(dst, src, nbits);
  223. }
  224. static inline int bitmap_equal(const unsigned long *src1,
  225. const unsigned long *src2, int nbits)
  226. {
  227. if (small_const_nbits(nbits))
  228. return ! ((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits));
  229. else
  230. return __bitmap_equal(src1, src2, nbits);
  231. }
  232. static inline int bitmap_intersects(const unsigned long *src1,
  233. const unsigned long *src2, int nbits)
  234. {
  235. if (small_const_nbits(nbits))
  236. return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0;
  237. else
  238. return __bitmap_intersects(src1, src2, nbits);
  239. }
  240. static inline int bitmap_subset(const unsigned long *src1,
  241. const unsigned long *src2, int nbits)
  242. {
  243. if (small_const_nbits(nbits))
  244. return ! ((*src1 & ~(*src2)) & BITMAP_LAST_WORD_MASK(nbits));
  245. else
  246. return __bitmap_subset(src1, src2, nbits);
  247. }
  248. static inline int bitmap_empty(const unsigned long *src, int nbits)
  249. {
  250. if (small_const_nbits(nbits))
  251. return ! (*src & BITMAP_LAST_WORD_MASK(nbits));
  252. else
  253. return __bitmap_empty(src, nbits);
  254. }
  255. static inline int bitmap_full(const unsigned long *src, int nbits)
  256. {
  257. if (small_const_nbits(nbits))
  258. return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits));
  259. else
  260. return __bitmap_full(src, nbits);
  261. }
  262. static inline int bitmap_weight(const unsigned long *src, int nbits)
  263. {
  264. if (small_const_nbits(nbits))
  265. return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits));
  266. return __bitmap_weight(src, nbits);
  267. }
  268. static inline void bitmap_shift_right(unsigned long *dst,
  269. const unsigned long *src, int n, int nbits)
  270. {
  271. if (small_const_nbits(nbits))
  272. *dst = *src >> n;
  273. else
  274. __bitmap_shift_right(dst, src, n, nbits);
  275. }
  276. static inline void bitmap_shift_left(unsigned long *dst,
  277. const unsigned long *src, int n, int nbits)
  278. {
  279. if (small_const_nbits(nbits))
  280. *dst = (*src << n) & BITMAP_LAST_WORD_MASK(nbits);
  281. else
  282. __bitmap_shift_left(dst, src, n, nbits);
  283. }
  284. static inline int bitmap_parse(const char *buf, unsigned int buflen,
  285. unsigned long *maskp, int nmaskbits)
  286. {
  287. return __bitmap_parse(buf, buflen, 0, maskp, nmaskbits);
  288. }
  289. #endif /* __ASSEMBLY__ */
  290. #endif /* __LINUX_BITMAP_H */