3
* Copyright (c) 2000 by Abramo Bagnara <abramo@alsa-project.org>
6
* This library is free software; you can redistribute it and/or modify
7
* it under the terms of the GNU Lesser General Public License as
8
* published by the Free Software Foundation; either version 2.1 of
9
* the License, or (at your option) any later version.
11
* This program is distributed in the hope that it will be useful,
12
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
* GNU Lesser General Public License for more details.
16
* You should have received a copy of the GNU Lesser General Public
17
* License along with this library; if not, write to the Free Software
18
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22
#include <sys/types.h>
24
#define MASK_INLINE static inline
26
#define MASK_MAX SND_MASK_MAX
27
#define MASK_SIZE (MASK_MAX / 32)
29
#define MASK_OFS(i) ((i) >> 5)
30
#define MASK_BIT(i) (1U << ((i) & 31))
32
MASK_INLINE unsigned int ld2(u_int32_t v)
57
MASK_INLINE unsigned int hweight32(u_int32_t v)
59
v = (v & 0x55555555) + ((v >> 1) & 0x55555555);
60
v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
61
v = (v & 0x0F0F0F0F) + ((v >> 4) & 0x0F0F0F0F);
62
v = (v & 0x00FF00FF) + ((v >> 8) & 0x00FF00FF);
63
return (v & 0x0000FFFF) + ((v >> 16) & 0x0000FFFF);
66
MASK_INLINE size_t snd_mask_sizeof(void)
68
return sizeof(snd_mask_t);
71
MASK_INLINE void snd_mask_none(snd_mask_t *mask)
73
memset(mask, 0, sizeof(*mask));
76
MASK_INLINE void snd_mask_any(snd_mask_t *mask)
78
memset(mask, 0xff, MASK_SIZE * sizeof(u_int32_t));
81
MASK_INLINE int snd_mask_empty(const snd_mask_t *mask)
84
for (i = 0; i < MASK_SIZE; i++)
90
MASK_INLINE int snd_mask_full(const snd_mask_t *mask)
93
for (i = 0; i < MASK_SIZE; i++)
94
if (mask->bits[i] != 0xffffffff)
99
MASK_INLINE unsigned int snd_mask_count(const snd_mask_t *mask)
102
for (i = 0; i < MASK_SIZE; i++)
103
w += hweight32(mask->bits[i]);
107
MASK_INLINE unsigned int snd_mask_min(const snd_mask_t *mask)
110
assert(!snd_mask_empty(mask));
111
for (i = 0; i < MASK_SIZE; i++) {
113
return ffs(mask->bits[i]) - 1 + (i << 5);
118
MASK_INLINE unsigned int snd_mask_max(const snd_mask_t *mask)
121
assert(!snd_mask_empty(mask));
122
for (i = MASK_SIZE - 1; i >= 0; i--) {
124
return ld2(mask->bits[i]) + (i << 5);
129
MASK_INLINE void snd_mask_set(snd_mask_t *mask, unsigned int val)
131
assert(val <= SND_MASK_MAX);
132
mask->bits[MASK_OFS(val)] |= MASK_BIT(val);
135
MASK_INLINE void snd_mask_reset(snd_mask_t *mask, unsigned int val)
137
assert(val <= SND_MASK_MAX);
138
mask->bits[MASK_OFS(val)] &= ~MASK_BIT(val);
141
MASK_INLINE void snd_mask_set_range(snd_mask_t *mask, unsigned int from, unsigned int to)
144
assert(to <= SND_MASK_MAX && from <= to);
145
for (i = from; i <= to; i++)
146
mask->bits[MASK_OFS(i)] |= MASK_BIT(i);
149
MASK_INLINE void snd_mask_reset_range(snd_mask_t *mask, unsigned int from, unsigned int to)
152
assert(to <= SND_MASK_MAX && from <= to);
153
for (i = from; i <= to; i++)
154
mask->bits[MASK_OFS(i)] &= ~MASK_BIT(i);
157
MASK_INLINE void snd_mask_leave(snd_mask_t *mask, unsigned int val)
160
assert(val <= SND_MASK_MAX);
161
v = mask->bits[MASK_OFS(val)] & MASK_BIT(val);
163
mask->bits[MASK_OFS(val)] = v;
166
MASK_INLINE void snd_mask_intersect(snd_mask_t *mask, const snd_mask_t *v)
169
for (i = 0; i < MASK_SIZE; i++)
170
mask->bits[i] &= v->bits[i];
173
MASK_INLINE void snd_mask_union(snd_mask_t *mask, const snd_mask_t *v)
176
for (i = 0; i < MASK_SIZE; i++)
177
mask->bits[i] |= v->bits[i];
180
MASK_INLINE int snd_mask_eq(const snd_mask_t *mask, const snd_mask_t *v)
182
return ! memcmp(mask, v, MASK_SIZE * 4);
185
MASK_INLINE void snd_mask_copy(snd_mask_t *mask, const snd_mask_t *v)
190
MASK_INLINE int snd_mask_test(const snd_mask_t *mask, unsigned int val)
192
assert(val <= SND_MASK_MAX);
193
return mask->bits[MASK_OFS(val)] & MASK_BIT(val);
196
MASK_INLINE int snd_mask_single(const snd_mask_t *mask)
199
assert(!snd_mask_empty(mask));
200
for (i = 0; i < MASK_SIZE; i++) {
203
if (mask->bits[i] & (mask->bits[i] - 1))
212
MASK_INLINE int snd_mask_refine(snd_mask_t *mask, const snd_mask_t *v)
215
if (snd_mask_empty(mask))
217
snd_mask_copy(&old, mask);
218
snd_mask_intersect(mask, v);
219
if (snd_mask_empty(mask))
221
return !snd_mask_eq(mask, &old);
224
MASK_INLINE int snd_mask_refine_first(snd_mask_t *mask)
226
if (snd_mask_empty(mask))
228
if (snd_mask_single(mask))
230
snd_mask_leave(mask, snd_mask_min(mask));
234
MASK_INLINE int snd_mask_refine_last(snd_mask_t *mask)
236
if (snd_mask_empty(mask))
238
if (snd_mask_single(mask))
240
snd_mask_leave(mask, snd_mask_max(mask));
244
MASK_INLINE int snd_mask_refine_min(snd_mask_t *mask, unsigned int val)
246
if (snd_mask_empty(mask))
248
if (snd_mask_min(mask) >= val)
250
snd_mask_reset_range(mask, 0, val - 1);
251
if (snd_mask_empty(mask))
256
MASK_INLINE int snd_mask_refine_max(snd_mask_t *mask, unsigned int val)
258
if (snd_mask_empty(mask))
260
if (snd_mask_max(mask) <= val)
262
snd_mask_reset_range(mask, val + 1, SND_MASK_MAX);
263
if (snd_mask_empty(mask))
268
MASK_INLINE int snd_mask_refine_set(snd_mask_t *mask, unsigned int val)
271
if (snd_mask_empty(mask))
273
changed = !snd_mask_single(mask);
274
snd_mask_leave(mask, val);
275
if (snd_mask_empty(mask))
280
MASK_INLINE int snd_mask_value(const snd_mask_t *mask)
282
assert(!snd_mask_empty(mask));
283
return snd_mask_min(mask);
286
MASK_INLINE int snd_mask_always_eq(const snd_mask_t *m1, const snd_mask_t *m2)
288
return snd_mask_single(m1) && snd_mask_single(m2) &&
289
snd_mask_value(m1) == snd_mask_value(m2);
292
MASK_INLINE int snd_mask_never_eq(const snd_mask_t *m1, const snd_mask_t *m2)
295
for (i = 0; i < MASK_SIZE; i++)
296
if (m1->bits[i] & m2->bits[i])