ebitmap.h 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. /*
  3. * An extensible bitmap is a bitmap that supports an
  4. * arbitrary number of bits. Extensible bitmaps are
  5. * used to represent sets of values, such as types,
  6. * roles, categories, and classes.
  7. *
  8. * Each extensible bitmap is implemented as a linked
  9. * list of bitmap nodes, where each bitmap node has
  10. * an explicitly specified starting bit position within
  11. * the total bitmap.
  12. *
  13. * Author : Stephen Smalley, <sds@tycho.nsa.gov>
  14. */
  15. #ifndef _SS_EBITMAP_H_
  16. #define _SS_EBITMAP_H_
  17. #include <net/netlabel.h>
  18. #ifdef CONFIG_64BIT
  19. #define EBITMAP_NODE_SIZE 64
  20. #else
  21. #define EBITMAP_NODE_SIZE 32
  22. #endif
  23. #define EBITMAP_UNIT_NUMS ((EBITMAP_NODE_SIZE-sizeof(void *)-sizeof(u32))\
  24. / sizeof(unsigned long))
  25. #define EBITMAP_UNIT_SIZE BITS_PER_LONG
  26. #define EBITMAP_SIZE (EBITMAP_UNIT_NUMS * EBITMAP_UNIT_SIZE)
  27. #define EBITMAP_BIT 1ULL
  28. #define EBITMAP_SHIFT_UNIT_SIZE(x) \
  29. (((x) >> EBITMAP_UNIT_SIZE / 2) >> EBITMAP_UNIT_SIZE / 2)
  30. struct ebitmap_node {
  31. struct ebitmap_node *next;
  32. unsigned long maps[EBITMAP_UNIT_NUMS];
  33. u32 startbit;
  34. };
  35. struct ebitmap {
  36. struct ebitmap_node *node; /* first node in the bitmap */
  37. u32 highbit; /* highest position in the total bitmap */
  38. };
  39. #define ebitmap_length(e) ((e)->highbit)
  40. static inline unsigned int ebitmap_start_positive(struct ebitmap *e,
  41. struct ebitmap_node **n)
  42. {
  43. unsigned int ofs;
  44. for (*n = e->node; *n; *n = (*n)->next) {
  45. ofs = find_first_bit((*n)->maps, EBITMAP_SIZE);
  46. if (ofs < EBITMAP_SIZE)
  47. return (*n)->startbit + ofs;
  48. }
  49. return ebitmap_length(e);
  50. }
  51. static inline void ebitmap_init(struct ebitmap *e)
  52. {
  53. memset(e, 0, sizeof(*e));
  54. }
  55. static inline unsigned int ebitmap_next_positive(struct ebitmap *e,
  56. struct ebitmap_node **n,
  57. unsigned int bit)
  58. {
  59. unsigned int ofs;
  60. ofs = find_next_bit((*n)->maps, EBITMAP_SIZE, bit - (*n)->startbit + 1);
  61. if (ofs < EBITMAP_SIZE)
  62. return ofs + (*n)->startbit;
  63. for (*n = (*n)->next; *n; *n = (*n)->next) {
  64. ofs = find_first_bit((*n)->maps, EBITMAP_SIZE);
  65. if (ofs < EBITMAP_SIZE)
  66. return ofs + (*n)->startbit;
  67. }
  68. return ebitmap_length(e);
  69. }
  70. #define EBITMAP_NODE_INDEX(node, bit) \
  71. (((bit) - (node)->startbit) / EBITMAP_UNIT_SIZE)
  72. #define EBITMAP_NODE_OFFSET(node, bit) \
  73. (((bit) - (node)->startbit) % EBITMAP_UNIT_SIZE)
  74. static inline int ebitmap_node_get_bit(struct ebitmap_node *n,
  75. unsigned int bit)
  76. {
  77. unsigned int index = EBITMAP_NODE_INDEX(n, bit);
  78. unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);
  79. BUG_ON(index >= EBITMAP_UNIT_NUMS);
  80. if ((n->maps[index] & (EBITMAP_BIT << ofs)))
  81. return 1;
  82. return 0;
  83. }
  84. static inline void ebitmap_node_set_bit(struct ebitmap_node *n,
  85. unsigned int bit)
  86. {
  87. unsigned int index = EBITMAP_NODE_INDEX(n, bit);
  88. unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);
  89. BUG_ON(index >= EBITMAP_UNIT_NUMS);
  90. n->maps[index] |= (EBITMAP_BIT << ofs);
  91. }
  92. static inline void ebitmap_node_clr_bit(struct ebitmap_node *n,
  93. unsigned int bit)
  94. {
  95. unsigned int index = EBITMAP_NODE_INDEX(n, bit);
  96. unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);
  97. BUG_ON(index >= EBITMAP_UNIT_NUMS);
  98. n->maps[index] &= ~(EBITMAP_BIT << ofs);
  99. }
  100. #define ebitmap_for_each_positive_bit(e, n, bit) \
  101. for (bit = ebitmap_start_positive(e, &n); \
  102. bit < ebitmap_length(e); \
  103. bit = ebitmap_next_positive(e, &n, bit)) \
  104. int ebitmap_cmp(struct ebitmap *e1, struct ebitmap *e2);
  105. int ebitmap_cpy(struct ebitmap *dst, struct ebitmap *src);
  106. int ebitmap_contains(struct ebitmap *e1, struct ebitmap *e2, u32 last_e2bit);
  107. int ebitmap_get_bit(struct ebitmap *e, unsigned long bit);
  108. int ebitmap_set_bit(struct ebitmap *e, unsigned long bit, int value);
  109. void ebitmap_destroy(struct ebitmap *e);
  110. int ebitmap_read(struct ebitmap *e, void *fp);
  111. int ebitmap_write(struct ebitmap *e, void *fp);
  112. #ifdef CONFIG_NETLABEL
  113. int ebitmap_netlbl_export(struct ebitmap *ebmap,
  114. struct netlbl_lsm_catmap **catmap);
  115. int ebitmap_netlbl_import(struct ebitmap *ebmap,
  116. struct netlbl_lsm_catmap *catmap);
  117. #else
  118. static inline int ebitmap_netlbl_export(struct ebitmap *ebmap,
  119. struct netlbl_lsm_catmap **catmap)
  120. {
  121. return -ENOMEM;
  122. }
  123. static inline int ebitmap_netlbl_import(struct ebitmap *ebmap,
  124. struct netlbl_lsm_catmap *catmap)
  125. {
  126. return -ENOMEM;
  127. }
  128. #endif
  129. #endif /* _SS_EBITMAP_H_ */