ebitmap.h 2.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
  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. #define MAPTYPE u64 /* portion of bitmap in each node */
  17. #define MAPSIZE (sizeof(MAPTYPE) * 8) /* number of bits in node bitmap */
  18. #define MAPBIT 1ULL /* a bit in the node bitmap */
  19. struct ebitmap_node {
  20. u32 startbit; /* starting position in the total bitmap */
  21. MAPTYPE map; /* this node's portion of the bitmap */
  22. struct ebitmap_node *next;
  23. };
  24. struct ebitmap {
  25. struct ebitmap_node *node; /* first node in the bitmap */
  26. u32 highbit; /* highest position in the total bitmap */
  27. };
  28. #define ebitmap_length(e) ((e)->highbit)
  29. #define ebitmap_startbit(e) ((e)->node ? (e)->node->startbit : 0)
  30. static inline unsigned int ebitmap_start(struct ebitmap *e,
  31. struct ebitmap_node **n)
  32. {
  33. *n = e->node;
  34. return ebitmap_startbit(e);
  35. }
  36. static inline void ebitmap_init(struct ebitmap *e)
  37. {
  38. memset(e, 0, sizeof(*e));
  39. }
  40. static inline unsigned int ebitmap_next(struct ebitmap_node **n,
  41. unsigned int bit)
  42. {
  43. if ((bit == ((*n)->startbit + MAPSIZE - 1)) &&
  44. (*n)->next) {
  45. *n = (*n)->next;
  46. return (*n)->startbit;
  47. }
  48. return (bit+1);
  49. }
  50. static inline int ebitmap_node_get_bit(struct ebitmap_node * n,
  51. unsigned int bit)
  52. {
  53. if (n->map & (MAPBIT << (bit - n->startbit)))
  54. return 1;
  55. return 0;
  56. }
  57. #define ebitmap_for_each_bit(e, n, bit) \
  58. for (bit = ebitmap_start(e, &n); bit < ebitmap_length(e); bit = ebitmap_next(&n, bit)) \
  59. int ebitmap_cmp(struct ebitmap *e1, struct ebitmap *e2);
  60. int ebitmap_cpy(struct ebitmap *dst, struct ebitmap *src);
  61. int ebitmap_contains(struct ebitmap *e1, struct ebitmap *e2);
  62. int ebitmap_get_bit(struct ebitmap *e, unsigned long bit);
  63. int ebitmap_set_bit(struct ebitmap *e, unsigned long bit, int value);
  64. void ebitmap_destroy(struct ebitmap *e);
  65. int ebitmap_read(struct ebitmap *e, void *fp);
  66. #endif /* _SS_EBITMAP_H_ */