summaryrefslogtreecommitdiff
path: root/src/pcm/mask_inline.h
blob: 5f3e1a1ad0456e9350f3698cde5fe486c3ed2bd1 (plain)
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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
/*
 *  Mask inlines
 *  Copyright (c) 2000 by Abramo Bagnara <abramo@alsa-project.org>
 *
 *
 *   This library is free software; you can redistribute it and/or modify
 *   it under the terms of the GNU Library General Public License as
 *   published by the Free Software Foundation; either version 2 of
 *   the License, or (at your option) any later version.
 *
 *   This program is distributed in the hope that it will be useful,
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *   GNU Library General Public License for more details.
 *
 *   You should have received a copy of the GNU Library General Public
 *   License along with this library; if not, write to the Free Software
 *   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 */
  
#include <sys/types.h>
#include <assert.h>

#ifdef MASK_C
#define INLINE inline
#else
#define INLINE extern inline
#endif

#ifndef MASK_MASK
#define MASK_MAX 31
#endif

struct _mask {
	unsigned int bits;
};

#define mask_bits(mask) ((mask)->bits)

INLINE unsigned int ld2(u_int32_t v)
{
        unsigned r = 0;

        if (v >= 0x10000) {
                v >>= 16;
                r += 16;
        }
        if (v >= 0x100) {
                v >>= 8;
                r += 8;
        }
        if (v >= 0x10) {
                v >>= 4;
                r += 4;
        }
        if (v >= 4) {
                v >>= 2;
                r += 2;
        }
        if (v >= 2)
                r++;
        return r;
}

INLINE unsigned int hweight32(u_int32_t v)
{
        v = (v & 0x55555555) + ((v >> 1) & 0x55555555);
        v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
        v = (v & 0x0F0F0F0F) + ((v >> 4) & 0x0F0F0F0F);
        v = (v & 0x00FF00FF) + ((v >> 8) & 0x00FF00FF);
        return (v & 0x0000FFFF) + ((v >> 16) & 0x0000FFFF);
}

INLINE size_t mask_sizeof(void)
{
	return sizeof(mask_t);
}

INLINE void mask_none(mask_t *mask)
{
	mask_bits(mask) = 0;
}

INLINE void mask_any(mask_t *mask)
{
	mask_bits(mask) = ~0U;
}

INLINE void mask_load(mask_t *mask, unsigned int msk)
{
	mask_bits(mask) = msk;
}

INLINE int mask_empty(const mask_t *mask)
{
	return mask_bits(mask) == 0;
}

INLINE int mask_full(const mask_t *mask)
{
	return mask_bits(mask) == ~0U;
}

INLINE unsigned int mask_count(const mask_t *mask)
{
	return hweight32(mask_bits(mask));
}

INLINE unsigned int mask_min(const mask_t *mask)
{
	assert(!mask_empty(mask));
	return ffs(mask_bits(mask)) - 1;
}

INLINE unsigned int mask_max(const mask_t *mask)
{
	assert(!mask_empty(mask));
	return ld2(mask_bits(mask));
}

INLINE void mask_set(mask_t *mask, unsigned int val)
{
	assert(val <= MASK_MAX);
	mask_bits(mask) |= (1U << val);
}

INLINE void mask_reset(mask_t *mask, unsigned int val)
{
	assert(val <= MASK_MAX);
	mask_bits(mask) &= ~(1U << val);
}

INLINE void mask_set_range(mask_t *mask, unsigned int from, unsigned int to)
{
	assert(to <= MASK_MAX && from <= to);
	mask_bits(mask) |= ((1U << (from - to + 1)) - 1) << from;
}

INLINE void mask_reset_range(mask_t *mask, unsigned int from, unsigned int to)
{
	assert(to <= MASK_MAX && from <= to);
	mask_bits(mask) &= ~(((1U << (from - to + 1)) - 1) << from);
}

INLINE void mask_leave(mask_t *mask, unsigned int val)
{
	assert(val <= MASK_MAX);
	mask_bits(mask) &= 1U << val;
}

INLINE void mask_intersect(mask_t *mask, const mask_t *v)
{
	mask_bits(mask) &= mask_bits(v);
}

INLINE void mask_union(mask_t *mask, const mask_t *v)
{
	mask_bits(mask) |= mask_bits(v);
}

INLINE int mask_eq(const mask_t *mask, const mask_t *v)
{
	return mask_bits(mask) == mask_bits(v);
}

INLINE void mask_copy(mask_t *mask, const mask_t *v)
{
	mask_bits(mask) = mask_bits(v);
}

INLINE int mask_test(const mask_t *mask, unsigned int val)
{
	assert(val <= MASK_MAX);
	return mask_bits(mask) & (1U << val);
}

INLINE int mask_single(const mask_t *mask)
{
	assert(!mask_empty(mask));
	return !(mask_bits(mask) & (mask_bits(mask) - 1));
}

INLINE int mask_refine(mask_t *mask, const mask_t *v)
{
	mask_t old;
	assert(!mask_empty(mask));
	mask_copy(&old, mask);
	mask_intersect(mask, v);
	if (mask_empty(mask))
		return -EINVAL;
	return !mask_eq(mask, &old);
}

INLINE int mask_refine_first(mask_t *mask)
{
	assert(!mask_empty(mask));
	if (mask_single(mask))
		return 0;
	mask_leave(mask, mask_min(mask));
	return 1;
}

INLINE int mask_refine_last(mask_t *mask)
{
	assert(!mask_empty(mask));
	if (mask_single(mask))
		return 0;
	mask_leave(mask, mask_max(mask));
	return 1;
}

INLINE int mask_refine_min(mask_t *mask, unsigned int val)
{
	assert(!mask_empty(mask));
	if (mask_min(mask) >= val)
		return 0;
	mask_reset_range(mask, 0, val - 1);
	if (mask_empty(mask))
		return -EINVAL;
	return 1;
}

INLINE int mask_refine_max(mask_t *mask, unsigned int val)
{
	assert(!mask_empty(mask));
	if (mask_max(mask) <= val)
		return 0;
	mask_reset_range(mask, val + 1, MASK_MAX);
	if (mask_empty(mask))
		return -EINVAL;
	return 1;
}

INLINE int mask_refine_set(mask_t *mask, unsigned int val)
{
	int changed;
	assert(!mask_empty(mask));
	changed = !mask_single(mask);
	mask_leave(mask, val);
	if (mask_empty(mask))
		return -EINVAL;
	return changed;
}

INLINE int mask_value(const mask_t *mask)
{
	assert(!mask_empty(mask));
	return mask_min(mask);
}

INLINE int mask_always_eq(const mask_t *m1, const mask_t *m2)
{
	return mask_single(m1) && mask_single(m2) &&
		mask_value(m1) == mask_value(m2);
}

INLINE int mask_never_eq(const mask_t *m1, const mask_t *m2)
{
	return (mask_bits(m1) & mask_bits(m2)) == 0;
}