selinux/ss/ebitmap.c

13  *          Applied standard bit operations to improve bitmap scanning.
82 	u32 bit;
87 	ebitmap_for_each_positive_bit(e1, n, bit)
89 		if (ebitmap_get_bit(e2, bit)) {
90 			rc = ebitmap_set_bit(dst, bit, 1);
215  * if last_e2bit is non-zero, the highest set bit in e2 cannot exceed
260 int ebitmap_get_bit(const struct ebitmap *e, u32 bit)
264 	if (e->highbit < bit)
268 	while (n && (n->startbit <= bit)) {
269 		if ((n->startbit + EBITMAP_SIZE) > bit)
270 			return ebitmap_node_get_bit(n, bit);
277 int ebitmap_set_bit(struct ebitmap *e, u32 bit, int value)
283 	while (n && n->startbit <= bit) {
284 		if ((n->startbit + EBITMAP_SIZE) > bit) {
286 				ebitmap_node_set_bit(n, bit);
290 				ebitmap_node_clr_bit(n, bit);
327 	new->startbit = bit - (bit % EBITMAP_SIZE);
328 	ebitmap_node_set_bit(new, bit);
385 		       "match my size %u (high bit was %u)\n",
411 			pr_err("SELinux: ebitmap start bit (%u) is "
417 			pr_err("SELinux: ebitmap start bit (%u) is "
440 			pr_err("SELinux: ebitmap: start bit %u"
441 			       " comes after start bit %u\n",
465 		pr_err("SELinux: ebitmap: high bit %u is not equal to the expected value %zu\n",
484 	u32 bit, count, last_bit, last_startbit;
494 	ebitmap_for_each_positive_bit(e, n, bit)
497 		    rounddown(bit, BITS_PER_U64) > last_startbit) {
499 			last_startbit = rounddown(bit, BITS_PER_U64);
501 		last_bit = roundup(bit + 1, BITS_PER_U64);
512 	ebitmap_for_each_positive_bit(e, n, bit)
515 		    rounddown(bit, BITS_PER_U64) > last_startbit) {
518 			/* this is the very first bit */
520 				last_startbit = rounddown(bit, BITS_PER_U64);
521 				map = (u64)1 << (bit - last_startbit);
538 			last_startbit = rounddown(bit, BITS_PER_U64);
540 		map |= (u64)1 << (bit - last_startbit);