ebitmap.h 4.1 KB

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