blob: e38a327dd703aed9c9dab8a9f06bc7a32ca15ce8 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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
Paul Moore02752762006-11-29 13:18:18 -050017#include <net/netlabel.h>
18
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090019#define EBITMAP_UNIT_NUMS ((32 - sizeof(void *) - sizeof(u32)) \
20 / sizeof(unsigned long))
21#define EBITMAP_UNIT_SIZE BITS_PER_LONG
22#define EBITMAP_SIZE (EBITMAP_UNIT_NUMS * EBITMAP_UNIT_SIZE)
23#define EBITMAP_BIT 1ULL
Linus Torvalds1da177e2005-04-16 15:20:36 -070024
25struct ebitmap_node {
Linus Torvalds1da177e2005-04-16 15:20:36 -070026 struct ebitmap_node *next;
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090027 unsigned long maps[EBITMAP_UNIT_NUMS];
28 u32 startbit;
Linus Torvalds1da177e2005-04-16 15:20:36 -070029};
30
31struct ebitmap {
32 struct ebitmap_node *node; /* first node in the bitmap */
33 u32 highbit; /* highest position in the total bitmap */
34};
35
36#define ebitmap_length(e) ((e)->highbit)
37#define ebitmap_startbit(e) ((e)->node ? (e)->node->startbit : 0)
38
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090039static inline unsigned int ebitmap_start_positive(struct ebitmap *e,
40 struct ebitmap_node **n)
Stephen Smalley782ebb92005-09-03 15:55:16 -070041{
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090042 unsigned int ofs;
43
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);
Stephen Smalley782ebb92005-09-03 15:55:16 -070050}
51
Linus Torvalds1da177e2005-04-16 15:20:36 -070052static inline void ebitmap_init(struct ebitmap *e)
53{
54 memset(e, 0, sizeof(*e));
55}
56
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090057static inline unsigned int ebitmap_next_positive(struct ebitmap *e,
58 struct ebitmap_node **n,
59 unsigned int bit)
Stephen Smalley782ebb92005-09-03 15:55:16 -070060{
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090061 unsigned int ofs;
Stephen Smalley782ebb92005-09-03 15:55:16 -070062
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090063 ofs = find_next_bit((*n)->maps, EBITMAP_SIZE, bit - (*n)->startbit + 1);
64 if (ofs < EBITMAP_SIZE)
65 return ofs + (*n)->startbit;
66
67 for (*n = (*n)->next; *n; *n = (*n)->next) {
68 ofs = find_first_bit((*n)->maps, EBITMAP_SIZE);
69 if (ofs < EBITMAP_SIZE)
70 return ofs + (*n)->startbit;
71 }
72 return ebitmap_length(e);
Stephen Smalley782ebb92005-09-03 15:55:16 -070073}
74
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090075#define EBITMAP_NODE_INDEX(node, bit) \
76 (((bit) - (node)->startbit) / EBITMAP_UNIT_SIZE)
77#define EBITMAP_NODE_OFFSET(node, bit) \
78 (((bit) - (node)->startbit) % EBITMAP_UNIT_SIZE)
79
80static inline int ebitmap_node_get_bit(struct ebitmap_node *n,
Stephen Smalley782ebb92005-09-03 15:55:16 -070081 unsigned int bit)
82{
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090083 unsigned int index = EBITMAP_NODE_INDEX(n, bit);
84 unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);
85
86 BUG_ON(index >= EBITMAP_UNIT_NUMS);
87 if ((n->maps[index] & (EBITMAP_BIT << ofs)))
Stephen Smalley782ebb92005-09-03 15:55:16 -070088 return 1;
89 return 0;
90}
91
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090092static inline void ebitmap_node_set_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
98 BUG_ON(index >= EBITMAP_UNIT_NUMS);
99 n->maps[index] |= (EBITMAP_BIT << ofs);
100}
101
102static inline void ebitmap_node_clr_bit(struct ebitmap_node *n,
103 unsigned int bit)
104{
105 unsigned int index = EBITMAP_NODE_INDEX(n, bit);
106 unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);
107
108 BUG_ON(index >= EBITMAP_UNIT_NUMS);
109 n->maps[index] &= ~(EBITMAP_BIT << ofs);
110}
111
112#define ebitmap_for_each_positive_bit(e, n, bit) \
113 for (bit = ebitmap_start_positive(e, &n); \
114 bit < ebitmap_length(e); \
115 bit = ebitmap_next_positive(e, &n, bit)) \
Stephen Smalley782ebb92005-09-03 15:55:16 -0700116
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117int ebitmap_cmp(struct ebitmap *e1, struct ebitmap *e2);
118int ebitmap_cpy(struct ebitmap *dst, struct ebitmap *src);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119int ebitmap_contains(struct ebitmap *e1, struct ebitmap *e2);
120int ebitmap_get_bit(struct ebitmap *e, unsigned long bit);
121int ebitmap_set_bit(struct ebitmap *e, unsigned long bit, int value);
122void ebitmap_destroy(struct ebitmap *e);
123int ebitmap_read(struct ebitmap *e, void *fp);
124
Paul Moore02752762006-11-29 13:18:18 -0500125#ifdef CONFIG_NETLABEL
126int ebitmap_netlbl_export(struct ebitmap *ebmap,
127 struct netlbl_lsm_secattr_catmap **catmap);
128int ebitmap_netlbl_import(struct ebitmap *ebmap,
129 struct netlbl_lsm_secattr_catmap *catmap);
130#else
131static inline int ebitmap_netlbl_export(struct ebitmap *ebmap,
132 struct netlbl_lsm_secattr_catmap **catmap)
133{
134 return -ENOMEM;
135}
136static inline int ebitmap_netlbl_import(struct ebitmap *ebmap,
137 struct netlbl_lsm_secattr_catmap *catmap)
138{
139 return -ENOMEM;
140}
141#endif
142
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143#endif /* _SS_EBITMAP_H_ */