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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
/*
* Copyright (c) 2013-2015 Richard Braun.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*
* Arbitrary-length bit arrays.
*
* Most functions do not check whether the given parameters are valid. This
* is the responsibility of the caller.
*
* Upstream site with license notes :
* http://git.sceen.net/rbraun/librbraun.git/
*/
#ifndef _BITMAP_H
#define _BITMAP_H
#include <limits.h>
#include <string.h>
#include "bitmap_i.h"
#include "x86/atomic.h"
#define BITMAP_DECLARE(name, nr_bits) unsigned long name[BITMAP_LONGS(nr_bits)]
int bitmap_cmp(const unsigned long *a, const unsigned long *b, int nr_bits);
static inline void
bitmap_zero(unsigned long *bm, int nr_bits)
{
int n;
n = BITMAP_LONGS(nr_bits);
memset(bm, 0, n * sizeof(unsigned long));
}
static inline void
bitmap_fill(unsigned long *bm, int nr_bits)
{
int n;
n = BITMAP_LONGS(nr_bits);
memset(bm, 0xff, n * sizeof(unsigned long));
}
static inline void
bitmap_copy(unsigned long *dest, const unsigned long *src, int nr_bits)
{
int n;
n = BITMAP_LONGS(nr_bits);
memcpy(dest, src, n * sizeof(unsigned long));
}
static inline void
bitmap_set(unsigned long *bm, int bit)
{
if (bit >= LONG_BIT)
bitmap_lookup(bm, bit);
*bm |= bitmap_mask(bit);
}
static inline void
bitmap_set_atomic(unsigned long *bm, int bit)
{
if (bit >= LONG_BIT)
bitmap_lookup(bm, bit);
atomic_or_ulong(bm, bitmap_mask(bit));
}
static inline void
bitmap_clear(unsigned long *bm, int bit)
{
if (bit >= LONG_BIT)
bitmap_lookup(bm, bit);
*bm &= ~bitmap_mask(bit);
}
static inline void
bitmap_clear_atomic(unsigned long *bm, int bit)
{
if (bit >= LONG_BIT)
bitmap_lookup(bm, bit);
atomic_and_ulong(bm, ~bitmap_mask(bit));
}
static inline int
bitmap_test(const unsigned long *bm, int bit)
{
if (bit >= LONG_BIT)
bitmap_lookup(bm, bit);
return ((*bm & bitmap_mask(bit)) != 0);
}
static inline void
bitmap_and(unsigned long *a, const unsigned long *b, int nr_bits)
{
int i, n;
n = BITMAP_LONGS(nr_bits);
for (i = 0; i < n; i++)
a[i] &= b[i];
}
static inline void
bitmap_or(unsigned long *a, const unsigned long *b, int nr_bits)
{
int i, n;
n = BITMAP_LONGS(nr_bits);
for (i = 0; i < n; i++)
a[i] |= b[i];
}
static inline void
bitmap_xor(unsigned long *a, const unsigned long *b, int nr_bits)
{
int i, n;
n = BITMAP_LONGS(nr_bits);
for (i = 0; i < n; i++)
a[i] ^= b[i];
}
static inline int
bitmap_find_next(const unsigned long *bm, int nr_bits, int bit)
{
return bitmap_find_next_bit(bm, nr_bits, bit, 0);
}
static inline int
bitmap_find_first(const unsigned long *bm, int nr_bits)
{
return bitmap_find_next(bm, nr_bits, 0);
}
static inline int
bitmap_find_next_zero(const unsigned long *bm, int nr_bits, int bit)
{
return bitmap_find_next_bit(bm, nr_bits, bit, 1);
}
static inline int
bitmap_find_first_zero(const unsigned long *bm, int nr_bits)
{
return bitmap_find_next_zero(bm, nr_bits, 0);
}
#define bitmap_for_each(bm, nr_bits, bit) \
for ((bit) = 0; \
((bit) < nr_bits) \
&& (((bit) = bitmap_find_next(bm, nr_bits, bit)) != -1); \
(bit)++)
#define bitmap_for_each_zero(bm, nr_bits, bit) \
for ((bit) = 0; \
((bit) < nr_bits) \
&& (((bit) = bitmap_find_next_zero(bm, nr_bits, bit)) != -1); \
(bit)++)
#endif /* _BITMAP_H */
|
