1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
/* $OpenBSD: bitmap.h,v 1.1 2019/04/14 10:14:53 jsg Exp $ */
/*
* Copyright (c) 2013, 2014, 2015 Mark Kettenis
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#ifndef _LINUX_BITMAP_H
#define _LINUX_BITMAP_H
#include <linux/bitops.h>
#define bitmap_empty(p, n) (find_first_bit(p, n) == n)
static inline void
bitmap_set(void *p, int b, u_int n)
{
u_int end = b + n;
for (; b < end; b++)
__set_bit(b, p);
}
static inline void
bitmap_clear(void *p, int b, u_int n)
{
u_int end = b + n;
for (; b < end; b++)
__clear_bit(b, p);
}
static inline void
bitmap_zero(void *p, u_int n)
{
u_int *ptr = p;
u_int b;
for (b = 0; b < n; b += 32)
ptr[b >> 5] = 0;
}
static inline void
bitmap_or(void *d, void *s1, void *s2, u_int n)
{
u_int *dst = d;
u_int *src1 = s1;
u_int *src2 = s2;
u_int b;
for (b = 0; b < n; b += 32)
dst[b >> 5] = src1[b >> 5] | src2[b >> 5];
}
static inline void
bitmap_complement(void *d, void *s, u_int n)
{
u_int *dst = d;
u_int *src = s;
u_int b;
for (b = 0; b < n; b += 32)
dst[b >> 5] = ~src[b >> 5];
}
static inline int
bitmap_weight(void *p, u_int n)
{
u_int *ptr = p;
u_int b;
int sum = 0;
for (b = 0; b < n; b += 32)
sum += hweight32(ptr[b >> 5]);
return sum;
}
#endif
|
