1*4882a593Smuzhiyun // SPDX-License-Identifier: GPL-2.0-only
2*4882a593Smuzhiyun /*
3*4882a593Smuzhiyun * From lib/bitmap.c
4*4882a593Smuzhiyun * Helper functions for bitmap.h.
5*4882a593Smuzhiyun */
6*4882a593Smuzhiyun #include <linux/bitmap.h>
7*4882a593Smuzhiyun
__bitmap_weight(const unsigned long * bitmap,int bits)8*4882a593Smuzhiyun int __bitmap_weight(const unsigned long *bitmap, int bits)
9*4882a593Smuzhiyun {
10*4882a593Smuzhiyun int k, w = 0, lim = bits/BITS_PER_LONG;
11*4882a593Smuzhiyun
12*4882a593Smuzhiyun for (k = 0; k < lim; k++)
13*4882a593Smuzhiyun w += hweight_long(bitmap[k]);
14*4882a593Smuzhiyun
15*4882a593Smuzhiyun if (bits % BITS_PER_LONG)
16*4882a593Smuzhiyun w += hweight_long(bitmap[k] & BITMAP_LAST_WORD_MASK(bits));
17*4882a593Smuzhiyun
18*4882a593Smuzhiyun return w;
19*4882a593Smuzhiyun }
20*4882a593Smuzhiyun
__bitmap_or(unsigned long * dst,const unsigned long * bitmap1,const unsigned long * bitmap2,int bits)21*4882a593Smuzhiyun void __bitmap_or(unsigned long *dst, const unsigned long *bitmap1,
22*4882a593Smuzhiyun const unsigned long *bitmap2, int bits)
23*4882a593Smuzhiyun {
24*4882a593Smuzhiyun int k;
25*4882a593Smuzhiyun int nr = BITS_TO_LONGS(bits);
26*4882a593Smuzhiyun
27*4882a593Smuzhiyun for (k = 0; k < nr; k++)
28*4882a593Smuzhiyun dst[k] = bitmap1[k] | bitmap2[k];
29*4882a593Smuzhiyun }
30*4882a593Smuzhiyun
bitmap_scnprintf(unsigned long * bitmap,int nbits,char * buf,size_t size)31*4882a593Smuzhiyun size_t bitmap_scnprintf(unsigned long *bitmap, int nbits,
32*4882a593Smuzhiyun char *buf, size_t size)
33*4882a593Smuzhiyun {
34*4882a593Smuzhiyun /* current bit is 'cur', most recently seen range is [rbot, rtop] */
35*4882a593Smuzhiyun int cur, rbot, rtop;
36*4882a593Smuzhiyun bool first = true;
37*4882a593Smuzhiyun size_t ret = 0;
38*4882a593Smuzhiyun
39*4882a593Smuzhiyun rbot = cur = find_first_bit(bitmap, nbits);
40*4882a593Smuzhiyun while (cur < nbits) {
41*4882a593Smuzhiyun rtop = cur;
42*4882a593Smuzhiyun cur = find_next_bit(bitmap, nbits, cur + 1);
43*4882a593Smuzhiyun if (cur < nbits && cur <= rtop + 1)
44*4882a593Smuzhiyun continue;
45*4882a593Smuzhiyun
46*4882a593Smuzhiyun if (!first)
47*4882a593Smuzhiyun ret += scnprintf(buf + ret, size - ret, ",");
48*4882a593Smuzhiyun
49*4882a593Smuzhiyun first = false;
50*4882a593Smuzhiyun
51*4882a593Smuzhiyun ret += scnprintf(buf + ret, size - ret, "%d", rbot);
52*4882a593Smuzhiyun if (rbot < rtop)
53*4882a593Smuzhiyun ret += scnprintf(buf + ret, size - ret, "-%d", rtop);
54*4882a593Smuzhiyun
55*4882a593Smuzhiyun rbot = cur;
56*4882a593Smuzhiyun }
57*4882a593Smuzhiyun return ret;
58*4882a593Smuzhiyun }
59*4882a593Smuzhiyun
__bitmap_and(unsigned long * dst,const unsigned long * bitmap1,const unsigned long * bitmap2,unsigned int bits)60*4882a593Smuzhiyun int __bitmap_and(unsigned long *dst, const unsigned long *bitmap1,
61*4882a593Smuzhiyun const unsigned long *bitmap2, unsigned int bits)
62*4882a593Smuzhiyun {
63*4882a593Smuzhiyun unsigned int k;
64*4882a593Smuzhiyun unsigned int lim = bits/BITS_PER_LONG;
65*4882a593Smuzhiyun unsigned long result = 0;
66*4882a593Smuzhiyun
67*4882a593Smuzhiyun for (k = 0; k < lim; k++)
68*4882a593Smuzhiyun result |= (dst[k] = bitmap1[k] & bitmap2[k]);
69*4882a593Smuzhiyun if (bits % BITS_PER_LONG)
70*4882a593Smuzhiyun result |= (dst[k] = bitmap1[k] & bitmap2[k] &
71*4882a593Smuzhiyun BITMAP_LAST_WORD_MASK(bits));
72*4882a593Smuzhiyun return result != 0;
73*4882a593Smuzhiyun }
74*4882a593Smuzhiyun
__bitmap_equal(const unsigned long * bitmap1,const unsigned long * bitmap2,unsigned int bits)75*4882a593Smuzhiyun int __bitmap_equal(const unsigned long *bitmap1,
76*4882a593Smuzhiyun const unsigned long *bitmap2, unsigned int bits)
77*4882a593Smuzhiyun {
78*4882a593Smuzhiyun unsigned int k, lim = bits/BITS_PER_LONG;
79*4882a593Smuzhiyun for (k = 0; k < lim; ++k)
80*4882a593Smuzhiyun if (bitmap1[k] != bitmap2[k])
81*4882a593Smuzhiyun return 0;
82*4882a593Smuzhiyun
83*4882a593Smuzhiyun if (bits % BITS_PER_LONG)
84*4882a593Smuzhiyun if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits))
85*4882a593Smuzhiyun return 0;
86*4882a593Smuzhiyun
87*4882a593Smuzhiyun return 1;
88*4882a593Smuzhiyun }
89