blob: 9637b8c71085b2ea7d4e7505c6c83df9226fe16a [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
Waiman Longa767f682013-07-23 17:38:41 -040019#ifdef CONFIG_64BIT
20#define EBITMAP_NODE_SIZE 64
21#else
22#define EBITMAP_NODE_SIZE 32
23#endif
24
25#define EBITMAP_UNIT_NUMS ((EBITMAP_NODE_SIZE-sizeof(void *)-sizeof(u32))\
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090026 / sizeof(unsigned long))
27#define EBITMAP_UNIT_SIZE BITS_PER_LONG
28#define EBITMAP_SIZE (EBITMAP_UNIT_NUMS * EBITMAP_UNIT_SIZE)
29#define EBITMAP_BIT 1ULL
KaiGai Kohei087feb92007-10-03 23:42:56 +090030#define EBITMAP_SHIFT_UNIT_SIZE(x) \
31 (((x) >> EBITMAP_UNIT_SIZE / 2) >> EBITMAP_UNIT_SIZE / 2)
Linus Torvalds1da177e2005-04-16 15:20:36 -070032
33struct ebitmap_node {
Linus Torvalds1da177e2005-04-16 15:20:36 -070034 struct ebitmap_node *next;
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090035 unsigned long maps[EBITMAP_UNIT_NUMS];
36 u32 startbit;
Linus Torvalds1da177e2005-04-16 15:20:36 -070037};
38
39struct ebitmap {
40 struct ebitmap_node *node; /* first node in the bitmap */
41 u32 highbit; /* highest position in the total bitmap */
42};
43
44#define ebitmap_length(e) ((e)->highbit)
Linus Torvalds1da177e2005-04-16 15:20:36 -070045
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090046static inline unsigned int ebitmap_start_positive(struct ebitmap *e,
47 struct ebitmap_node **n)
Stephen Smalley782ebb92005-09-03 15:55:16 -070048{
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090049 unsigned int ofs;
50
51 for (*n = e->node; *n; *n = (*n)->next) {
52 ofs = find_first_bit((*n)->maps, EBITMAP_SIZE);
53 if (ofs < EBITMAP_SIZE)
54 return (*n)->startbit + ofs;
55 }
56 return ebitmap_length(e);
Stephen Smalley782ebb92005-09-03 15:55:16 -070057}
58
Linus Torvalds1da177e2005-04-16 15:20:36 -070059static inline void ebitmap_init(struct ebitmap *e)
60{
61 memset(e, 0, sizeof(*e));
62}
63
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090064static inline unsigned int ebitmap_next_positive(struct ebitmap *e,
65 struct ebitmap_node **n,
66 unsigned int bit)
Stephen Smalley782ebb92005-09-03 15:55:16 -070067{
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090068 unsigned int ofs;
Stephen Smalley782ebb92005-09-03 15:55:16 -070069
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090070 ofs = find_next_bit((*n)->maps, EBITMAP_SIZE, bit - (*n)->startbit + 1);
71 if (ofs < EBITMAP_SIZE)
72 return ofs + (*n)->startbit;
73
74 for (*n = (*n)->next; *n; *n = (*n)->next) {
75 ofs = find_first_bit((*n)->maps, EBITMAP_SIZE);
76 if (ofs < EBITMAP_SIZE)
77 return ofs + (*n)->startbit;
78 }
79 return ebitmap_length(e);
Stephen Smalley782ebb92005-09-03 15:55:16 -070080}
81
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090082#define EBITMAP_NODE_INDEX(node, bit) \
83 (((bit) - (node)->startbit) / EBITMAP_UNIT_SIZE)
84#define EBITMAP_NODE_OFFSET(node, bit) \
85 (((bit) - (node)->startbit) % EBITMAP_UNIT_SIZE)
86
87static inline int ebitmap_node_get_bit(struct ebitmap_node *n,
Stephen Smalley782ebb92005-09-03 15:55:16 -070088 unsigned int bit)
89{
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090090 unsigned int index = EBITMAP_NODE_INDEX(n, bit);
91 unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);
92
93 BUG_ON(index >= EBITMAP_UNIT_NUMS);
94 if ((n->maps[index] & (EBITMAP_BIT << ofs)))
Stephen Smalley782ebb92005-09-03 15:55:16 -070095 return 1;
96 return 0;
97}
98
KaiGai Kohei9fe79ad2007-09-29 02:20:55 +090099static inline void ebitmap_node_set_bit(struct ebitmap_node *n,
100 unsigned int bit)
101{
102 unsigned int index = EBITMAP_NODE_INDEX(n, bit);
103 unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);
104
105 BUG_ON(index >= EBITMAP_UNIT_NUMS);
106 n->maps[index] |= (EBITMAP_BIT << ofs);
107}
108
109static inline void ebitmap_node_clr_bit(struct ebitmap_node *n,
110 unsigned int bit)
111{
112 unsigned int index = EBITMAP_NODE_INDEX(n, bit);
113 unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);
114
115 BUG_ON(index >= EBITMAP_UNIT_NUMS);
116 n->maps[index] &= ~(EBITMAP_BIT << ofs);
117}
118
119#define ebitmap_for_each_positive_bit(e, n, bit) \
120 for (bit = ebitmap_start_positive(e, &n); \
121 bit < ebitmap_length(e); \
122 bit = ebitmap_next_positive(e, &n, bit)) \
Stephen Smalley782ebb92005-09-03 15:55:16 -0700123
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124int ebitmap_cmp(struct ebitmap *e1, struct ebitmap *e2);
125int ebitmap_cpy(struct ebitmap *dst, struct ebitmap *src);
Waiman Longfee71142013-07-23 17:38:41 -0400126int ebitmap_contains(struct ebitmap *e1, struct ebitmap *e2, u32 last_e2bit);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127int ebitmap_get_bit(struct ebitmap *e, unsigned long bit);
128int ebitmap_set_bit(struct ebitmap *e, unsigned long bit, int value);
129void ebitmap_destroy(struct ebitmap *e);
130int ebitmap_read(struct ebitmap *e, void *fp);
Eric Pariscee74f42010-10-13 17:50:25 -0400131int ebitmap_write(struct ebitmap *e, void *fp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700132
Paul Moore02752762006-11-29 13:18:18 -0500133#ifdef CONFIG_NETLABEL
134int ebitmap_netlbl_export(struct ebitmap *ebmap,
Paul Moore4fbe63d2014-08-01 11:17:37 -0400135 struct netlbl_lsm_catmap **catmap);
Paul Moore02752762006-11-29 13:18:18 -0500136int ebitmap_netlbl_import(struct ebitmap *ebmap,
Paul Moore4fbe63d2014-08-01 11:17:37 -0400137 struct netlbl_lsm_catmap *catmap);
Paul Moore02752762006-11-29 13:18:18 -0500138#else
139static inline int ebitmap_netlbl_export(struct ebitmap *ebmap,
Paul Moore4fbe63d2014-08-01 11:17:37 -0400140 struct netlbl_lsm_catmap **catmap)
Paul Moore02752762006-11-29 13:18:18 -0500141{
142 return -ENOMEM;
143}
144static inline int ebitmap_netlbl_import(struct ebitmap *ebmap,
Paul Moore4fbe63d2014-08-01 11:17:37 -0400145 struct netlbl_lsm_catmap *catmap)
Paul Moore02752762006-11-29 13:18:18 -0500146{
147 return -ENOMEM;
148}
149#endif
150
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151#endif /* _SS_EBITMAP_H_ */