Release 4.11 security/selinux/ss/ebitmap.h

/*
 * An extensible bitmap is a bitmap that supports an
 * arbitrary number of bits.  Extensible bitmaps are
 * used to represent sets of values, such as types,
 * roles, categories, and classes.
 *
 * Each extensible bitmap is implemented as a linked
 * list of bitmap nodes, where each bitmap node has
 * an explicitly specified starting bit position within
 * the total bitmap.
 *
 * Author : Stephen Smalley, <sds@epoch.ncsc.mil>
 */
#ifndef _SS_EBITMAP_H_

#define _SS_EBITMAP_H_

#include <net/netlabel.h>

#ifdef CONFIG_64BIT

#define	EBITMAP_NODE_SIZE	64
#else

#define	EBITMAP_NODE_SIZE	32
#endif


#define EBITMAP_UNIT_NUMS	((EBITMAP_NODE_SIZE-sizeof(void *)-sizeof(u32))\
                                        / sizeof(unsigned long))

#define EBITMAP_UNIT_SIZE	BITS_PER_LONG

#define EBITMAP_SIZE		(EBITMAP_UNIT_NUMS * EBITMAP_UNIT_SIZE)

#define EBITMAP_BIT		1ULL

#define EBITMAP_SHIFT_UNIT_SIZE(x)					\
	(((x) >> EBITMAP_UNIT_SIZE / 2) >> EBITMAP_UNIT_SIZE / 2)


struct ebitmap_node {
	
struct ebitmap_node *next;
	
unsigned long maps[EBITMAP_UNIT_NUMS];
	
u32 startbit;
};


struct ebitmap {
	
struct ebitmap_node *node;	/* first node in the bitmap */
	
u32 highbit;	/* highest position in the total bitmap */
};


#define ebitmap_length(e) ((e)->highbit)



static inline unsigned int ebitmap_start_positive(struct ebitmap *e,
						  struct ebitmap_node **n)
{
	unsigned int ofs;

	for (*n = e->node; *n; *n = (*n)->next) {
		ofs = find_first_bit((*n)->maps, EBITMAP_SIZE);
		if (ofs < EBITMAP_SIZE)
			return (*n)->startbit + ofs;
	}
	return ebitmap_length(e);
}

Contributors
Person
Tokens
Prop
Commits
CommitProp
KaiGai Kohei
53
63.86%
1
50.00%
Stephen D. Smalley
30
36.14%
1
50.00%
Total
83
100.00%
2
100.00%



static inline void ebitmap_init(struct ebitmap *e)
{
	memset(e, 0, sizeof(*e));
}

Contributors
Person
Tokens
Prop
Commits
CommitProp
Andrew Morton
25
100.00%
1
100.00%
Total
25
100.00%
1
100.00%



static inline unsigned int ebitmap_next_positive(struct ebitmap *e,
						 struct ebitmap_node **n,
						 unsigned int bit)
{
	unsigned int ofs;

	ofs = find_next_bit((*n)->maps, EBITMAP_SIZE, bit - (*n)->startbit + 1);
	if (ofs < EBITMAP_SIZE)
		return ofs + (*n)->startbit;

	for (*n = (*n)->next; *n; *n = (*n)->next) {
		ofs = find_first_bit((*n)->maps, EBITMAP_SIZE);
		if (ofs < EBITMAP_SIZE)
			return ofs + (*n)->startbit;
	}
	return ebitmap_length(e);
}

Contributors
Person
Tokens
Prop
Commits
CommitProp
KaiGai Kohei
76
58.02%
1
33.33%
Stephen D. Smalley
50
38.17%
1
33.33%
Andrew Morton
5
3.82%
1
33.33%
Total
131
100.00%
3
100.00%


#define EBITMAP_NODE_INDEX(node, bit)	\
	(((bit) - (node)->startbit) / EBITMAP_UNIT_SIZE)

#define EBITMAP_NODE_OFFSET(node, bit)	\
	(((bit) - (node)->startbit) % EBITMAP_UNIT_SIZE)



static inline int ebitmap_node_get_bit(struct ebitmap_node *n,
				       unsigned int bit)
{
	unsigned int index = EBITMAP_NODE_INDEX(n, bit);
	unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);

	BUG_ON(index >= EBITMAP_UNIT_NUMS);
	if ((n->maps[index] & (EBITMAP_BIT << ofs)))
		return 1;
	return 0;
}

Contributors
Person
Tokens
Prop
Commits
CommitProp
KaiGai Kohei
36
52.94%
1
33.33%
Stephen D. Smalley
29
42.65%
1
33.33%
Andrew Morton
3
4.41%
1
33.33%
Total
68
100.00%
3
100.00%



static inline void ebitmap_node_set_bit(struct ebitmap_node *n,
					unsigned int bit)
{
	unsigned int index = EBITMAP_NODE_INDEX(n, bit);
	unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);

	BUG_ON(index >= EBITMAP_UNIT_NUMS);
	n->maps[index] |= (EBITMAP_BIT << ofs);
}

Contributors
Person
Tokens
Prop
Commits
CommitProp
KaiGai Kohei
58
100.00%
1
100.00%
Total
58
100.00%
1
100.00%



static inline void ebitmap_node_clr_bit(struct ebitmap_node *n,
					unsigned int bit)
{
	unsigned int index = EBITMAP_NODE_INDEX(n, bit);
	unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);

	BUG_ON(index >= EBITMAP_UNIT_NUMS);
	n->maps[index] &= ~(EBITMAP_BIT << ofs);
}

Contributors
Person
Tokens
Prop
Commits
CommitProp
KaiGai Kohei
59
100.00%
1
100.00%
Total
59
100.00%
1
100.00%


#define ebitmap_for_each_positive_bit(e, n, bit)	\
	for (bit = ebitmap_start_positive(e, &n);       \
             bit < ebitmap_length(e);                   \
             bit = ebitmap_next_positive(e, &n, bit))   \

int ebitmap_cmp(struct ebitmap *e1, struct ebitmap *e2);
int ebitmap_cpy(struct ebitmap *dst, struct ebitmap *src);
int ebitmap_contains(struct ebitmap *e1, struct ebitmap *e2, u32 last_e2bit);
int ebitmap_get_bit(struct ebitmap *e, unsigned long bit);
int ebitmap_set_bit(struct ebitmap *e, unsigned long bit, int value);
void ebitmap_destroy(struct ebitmap *e);
int ebitmap_read(struct ebitmap *e, void *fp);
int ebitmap_write(struct ebitmap *e, void *fp);

#ifdef CONFIG_NETLABEL
int ebitmap_netlbl_export(struct ebitmap *ebmap,
			  struct netlbl_lsm_catmap **catmap);
int ebitmap_netlbl_import(struct ebitmap *ebmap,
			  struct netlbl_lsm_catmap *catmap);
#else


static inline int ebitmap_netlbl_export(struct ebitmap *ebmap,
					struct netlbl_lsm_catmap **catmap)
{
	return -ENOMEM;
}
Contributors
Person
Tokens
Prop
Commits
CommitProp
Paul Moore
22
100.00%
2
100.00%
Total
22
100.00%
2
100.00%



static inline int ebitmap_netlbl_import(struct ebitmap *ebmap,
					struct netlbl_lsm_catmap *catmap)
{
	return -ENOMEM;
}
Contributors
Person
Tokens
Prop
Commits
CommitProp
Paul Moore
21
100.00%
2
100.00%
Total
21
100.00%
2
100.00%

#endif

#endif	/* _SS_EBITMAP_H_ */
Overall Contributors
Person
Tokens
Prop
Commits
CommitProp
KaiGai Kohei
330
45.58%
2
22.22%
Andrew Morton
161
22.24%
1
11.11%
Stephen D. Smalley
119
16.44%
1
11.11%
Paul Moore
82
11.33%
2
22.22%
Waiman Long
19
2.62%
2
22.22%
Eric Paris
13
1.80%
1
11.11%
Total
724
100.00%
9
100.00%
Directory: security/selinux/ss

Information contained on this website is for historical information purposes only and does not indicate or represent copyright ownership.