[linux-block.git] / tools / lib / bitmap.c

// SPDX-License-Identifier: GPL-2.0-only
/*
 * From lib/bitmap.c
 * Helper functions for bitmap.h.
 */
#include <linux/bitmap.h>

unsigned int __bitmap_weight(const unsigned long *bitmap, int bits)
{
	unsigned int k, w = 0, lim = bits/BITS_PER_LONG;

	for (k = 0; k < lim; k++)
		w += hweight_long(bitmap[k]);

	if (bits % BITS_PER_LONG)
		w += hweight_long(bitmap[k] & BITMAP_LAST_WORD_MASK(bits));

	return w;
}

void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
		 const unsigned long *bitmap2, int bits)
{
	int k;
	int nr = BITS_TO_LONGS(bits);

	for (k = 0; k < nr; k++)
		dst[k] = bitmap1[k] | bitmap2[k];
}

size_t bitmap_scnprintf(unsigned long *bitmap, unsigned int nbits,
			char *buf, size_t size)
{
	/* current bit is 'cur', most recently seen range is [rbot, rtop] */
	unsigned int cur, rbot, rtop;
	bool first = true;
	size_t ret = 0;

	rbot = cur = find_first_bit(bitmap, nbits);
	while (cur < nbits) {
		rtop = cur;
		cur = find_next_bit(bitmap, nbits, cur + 1);
		if (cur < nbits && cur <= rtop + 1)
			continue;

		if (!first)
			ret += scnprintf(buf + ret, size - ret, ",");

		first = false;

		ret += scnprintf(buf + ret, size - ret, "%d", rbot);
		if (rbot < rtop)
			ret += scnprintf(buf + ret, size - ret, "-%d", rtop);

		rbot = cur;
	}
	return ret;
}

bool __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
		 const unsigned long *bitmap2, unsigned int bits)
{
	unsigned int k;
	unsigned int lim = bits/BITS_PER_LONG;
	unsigned long result = 0;

	for (k = 0; k < lim; k++)
		result |= (dst[k] = bitmap1[k] & bitmap2[k]);
	if (bits % BITS_PER_LONG)
		result |= (dst[k] = bitmap1[k] & bitmap2[k] &
			   BITMAP_LAST_WORD_MASK(bits));
	return result != 0;
}

bool __bitmap_equal(const unsigned long *bitmap1,
		    const unsigned long *bitmap2, unsigned int bits)
{
	unsigned int k, lim = bits/BITS_PER_LONG;
	for (k = 0; k < lim; ++k)
		if (bitmap1[k] != bitmap2[k])
			return false;

	if (bits % BITS_PER_LONG)
		if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
			return false;

	return true;
}

bool __bitmap_intersects(const unsigned long *bitmap1,
			 const unsigned long *bitmap2, unsigned int bits)
{
	unsigned int k, lim = bits/BITS_PER_LONG;
	for (k = 0; k < lim; ++k)
		if (bitmap1[k] & bitmap2[k])
			return true;

	if (bits % BITS_PER_LONG)
		if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
			return true;
	return false;
}

void __bitmap_clear(unsigned long *map, unsigned int start, int len)
{
	unsigned long *p = map + BIT_WORD(start);
	const unsigned int size = start + len;
	int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG);
	unsigned long mask_to_clear = BITMAP_FIRST_WORD_MASK(start);

	while (len - bits_to_clear >= 0) {
		*p &= ~mask_to_clear;
		len -= bits_to_clear;
		bits_to_clear = BITS_PER_LONG;
		mask_to_clear = ~0UL;
		p++;
	}
	if (len) {
		mask_to_clear &= BITMAP_LAST_WORD_MASK(size);
		*p &= ~mask_to_clear;
	}
}
Commit	Line	Data
40b0b3f8	1	// SPDX-License-Identifier: GPL-2.0-only
fb72014d ACM	2	/*
	3	* From lib/bitmap.c
	4	* Helper functions for bitmap.h.
fb72014d ACM	5	*/
	6	#include <linux/bitmap.h>
	7
4e23eeeb	8	unsigned int __bitmap_weight(const unsigned long *bitmap, int bits)
fb72014d	9	{
4e23eeeb	10	unsigned int k, w = 0, lim = bits/BITS_PER_LONG;
fb72014d ACM	11
	12	for (k = 0; k < lim; k++)
	13	w += hweight_long(bitmap[k]);
	14
	15	if (bits % BITS_PER_LONG)
	16	w += hweight_long(bitmap[k] & BITMAP_LAST_WORD_MASK(bits));
	17
	18	return w;
	19	}
850f8127 JO	20
	21	void __bitmap_or(unsigned long dst, const unsigned long bitmap1,
	22	const unsigned long *bitmap2, int bits)
	23	{
	24	int k;
	25	int nr = BITS_TO_LONGS(bits);
	26
	27	for (k = 0; k < nr; k++)
	28	dst[k] = bitmap1[k] \| bitmap2[k];
	29	}
820d12b7	30
e5b9252d	31	size_t bitmap_scnprintf(unsigned long *bitmap, unsigned int nbits,
820d12b7 JO	32	char *buf, size_t size)
	33	{
	34	/* current bit is 'cur', most recently seen range is [rbot, rtop] */
e5b9252d	35	unsigned int cur, rbot, rtop;
820d12b7 JO	36	bool first = true;
	37	size_t ret = 0;
	38
	39	rbot = cur = find_first_bit(bitmap, nbits);
	40	while (cur < nbits) {
	41	rtop = cur;
	42	cur = find_next_bit(bitmap, nbits, cur + 1);
	43	if (cur < nbits && cur <= rtop + 1)
	44	continue;
	45
	46	if (!first)
	47	ret += scnprintf(buf + ret, size - ret, ",");
	48
	49	first = false;
	50
	51	ret += scnprintf(buf + ret, size - ret, "%d", rbot);
	52	if (rbot < rtop)
	53	ret += scnprintf(buf + ret, size - ret, "-%d", rtop);
	54
	55	rbot = cur;
	56	}
	57	return ret;
	58	}
741c74f5	59
e2863a78	60	bool __bitmap_and(unsigned long dst, const unsigned long bitmap1,
741c74f5 JO	61	const unsigned long *bitmap2, unsigned int bits)
	62	{
	63	unsigned int k;
	64	unsigned int lim = bits/BITS_PER_LONG;
	65	unsigned long result = 0;
	66
	67	for (k = 0; k < lim; k++)
	68	result \|= (dst[k] = bitmap1[k] & bitmap2[k]);
	69	if (bits % BITS_PER_LONG)
	70	result \|= (dst[k] = bitmap1[k] & bitmap2[k] &
	71	BITMAP_LAST_WORD_MASK(bits));
	72	return result != 0;
	73	}
8812ad41	74
005f1700 KC	75	bool __bitmap_equal(const unsigned long *bitmap1,
005f1700 KC	76	const unsigned long *bitmap2, unsigned int bits)
8812ad41 AB	77	{
	78	unsigned int k, lim = bits/BITS_PER_LONG;
	79	for (k = 0; k < lim; ++k)
	80	if (bitmap1[k] != bitmap2[k])
005f1700	81	return false;
8812ad41 AB	82
	83	if (bits % BITS_PER_LONG)
	84	if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
005f1700	85	return false;
8812ad41	86
005f1700	87	return true;
8812ad41	88	}
f20510d5	89
005f1700 KC	90	bool __bitmap_intersects(const unsigned long *bitmap1,
005f1700 KC	91	const unsigned long *bitmap2, unsigned int bits)
f20510d5 AB	92	{
	93	unsigned int k, lim = bits/BITS_PER_LONG;
	94	for (k = 0; k < lim; ++k)
	95	if (bitmap1[k] & bitmap2[k])
005f1700	96	return true;
f20510d5 AB	97
	98	if (bits % BITS_PER_LONG)
	99	if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
005f1700 KC	100	return true;
005f1700 KC	101	return false;
f20510d5	102	}
692a68ee WY	103
	104	void __bitmap_clear(unsigned long *map, unsigned int start, int len)
	105	{
	106	unsigned long *p = map + BIT_WORD(start);
	107	const unsigned int size = start + len;
	108	int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG);
	109	unsigned long mask_to_clear = BITMAP_FIRST_WORD_MASK(start);
	110
	111	while (len - bits_to_clear >= 0) {
	112	*p &= ~mask_to_clear;
	113	len -= bits_to_clear;
	114	bits_to_clear = BITS_PER_LONG;
	115	mask_to_clear = ~0UL;
	116	p++;
	117	}
	118	if (len) {
	119	mask_to_clear &= BITMAP_LAST_WORD_MASK(size);
	120	*p &= ~mask_to_clear;
	121	}
	122	}