pcm_params.h 8.0 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
#ifndef __SOUND_PCM_PARAMS_H
#define __SOUND_PCM_PARAMS_H

/*
 *  PCM params helpers
 *  Copyright (c) by Abramo Bagnara <abramo@alsa-project.org>
 *
 *
 *   This program is free software; you can redistribute it and/or modify
 *   it under the terms of the GNU 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 General Public License for more details.
 *
 *   You should have received a copy of the GNU General Public License
 *   along with this program; if not, write to the Free Software
 *   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
 *
 */

T
Takashi Iwai 已提交
25 26 27
extern int snd_pcm_hw_param_mask(struct snd_pcm_substream *pcm, struct snd_pcm_hw_params *params,
				 snd_pcm_hw_param_t var, const struct snd_mask *val);
extern unsigned int snd_pcm_hw_param_value_min(const struct snd_pcm_hw_params *params,
L
Linus Torvalds 已提交
28
					       snd_pcm_hw_param_t var, int *dir);
T
Takashi Iwai 已提交
29
extern unsigned int snd_pcm_hw_param_value_max(const struct snd_pcm_hw_params *params,
L
Linus Torvalds 已提交
30
					       snd_pcm_hw_param_t var, int *dir);
T
Takashi Iwai 已提交
31
extern int _snd_pcm_hw_param_min(struct snd_pcm_hw_params *params,
L
Linus Torvalds 已提交
32
				 snd_pcm_hw_param_t var, unsigned int val, int dir);
T
Takashi Iwai 已提交
33
extern int _snd_pcm_hw_param_setinteger(struct snd_pcm_hw_params *params,
L
Linus Torvalds 已提交
34
					snd_pcm_hw_param_t var);
T
Takashi Iwai 已提交
35
extern int _snd_pcm_hw_param_set(struct snd_pcm_hw_params *params,
L
Linus Torvalds 已提交
36 37 38 39 40 41 42
				 snd_pcm_hw_param_t var, unsigned int val, int dir);

#define SNDRV_MASK_BITS	64	/* we use so far 64bits only */
#define SNDRV_MASK_SIZE	(SNDRV_MASK_BITS / 32)
#define MASK_OFS(i)	((i) >> 5)
#define MASK_BIT(i)	(1U << ((i) & 31))

43
static inline unsigned int ld2(u_int32_t v)
L
Linus Torvalds 已提交
44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67
{
        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;
}

68
static inline size_t snd_mask_sizeof(void)
L
Linus Torvalds 已提交
69
{
T
Takashi Iwai 已提交
70
	return sizeof(struct snd_mask);
L
Linus Torvalds 已提交
71 72
}

73
static inline void snd_mask_none(struct snd_mask *mask)
L
Linus Torvalds 已提交
74 75 76 77
{
	memset(mask, 0, sizeof(*mask));
}

78
static inline void snd_mask_any(struct snd_mask *mask)
L
Linus Torvalds 已提交
79 80 81 82
{
	memset(mask, 0xff, SNDRV_MASK_SIZE * sizeof(u_int32_t));
}

83
static inline int snd_mask_empty(const struct snd_mask *mask)
L
Linus Torvalds 已提交
84 85 86 87 88 89 90 91
{
	int i;
	for (i = 0; i < SNDRV_MASK_SIZE; i++)
		if (mask->bits[i])
			return 0;
	return 1;
}

92
static inline unsigned int snd_mask_min(const struct snd_mask *mask)
L
Linus Torvalds 已提交
93 94 95 96 97 98 99 100 101
{
	int i;
	for (i = 0; i < SNDRV_MASK_SIZE; i++) {
		if (mask->bits[i])
			return ffs(mask->bits[i]) - 1 + (i << 5);
	}
	return 0;
}

102
static inline unsigned int snd_mask_max(const struct snd_mask *mask)
L
Linus Torvalds 已提交
103 104 105 106 107 108 109 110 111
{
	int i;
	for (i = SNDRV_MASK_SIZE - 1; i >= 0; i--) {
		if (mask->bits[i])
			return ld2(mask->bits[i]) + (i << 5);
	}
	return 0;
}

112
static inline void snd_mask_set(struct snd_mask *mask, unsigned int val)
L
Linus Torvalds 已提交
113 114 115 116
{
	mask->bits[MASK_OFS(val)] |= MASK_BIT(val);
}

117
static inline void snd_mask_reset(struct snd_mask *mask, unsigned int val)
L
Linus Torvalds 已提交
118 119 120 121
{
	mask->bits[MASK_OFS(val)] &= ~MASK_BIT(val);
}

122 123
static inline void snd_mask_set_range(struct snd_mask *mask,
				      unsigned int from, unsigned int to)
L
Linus Torvalds 已提交
124 125 126 127 128 129
{
	unsigned int i;
	for (i = from; i <= to; i++)
		mask->bits[MASK_OFS(i)] |= MASK_BIT(i);
}

130 131
static inline void snd_mask_reset_range(struct snd_mask *mask,
					unsigned int from, unsigned int to)
L
Linus Torvalds 已提交
132 133 134 135 136 137
{
	unsigned int i;
	for (i = from; i <= to; i++)
		mask->bits[MASK_OFS(i)] &= ~MASK_BIT(i);
}

138
static inline void snd_mask_leave(struct snd_mask *mask, unsigned int val)
L
Linus Torvalds 已提交
139 140 141 142 143 144 145
{
	unsigned int v;
	v = mask->bits[MASK_OFS(val)] & MASK_BIT(val);
	snd_mask_none(mask);
	mask->bits[MASK_OFS(val)] = v;
}

146 147
static inline void snd_mask_intersect(struct snd_mask *mask,
				      const struct snd_mask *v)
L
Linus Torvalds 已提交
148 149 150 151 152 153
{
	int i;
	for (i = 0; i < SNDRV_MASK_SIZE; i++)
		mask->bits[i] &= v->bits[i];
}

154 155
static inline int snd_mask_eq(const struct snd_mask *mask,
			      const struct snd_mask *v)
L
Linus Torvalds 已提交
156 157 158 159
{
	return ! memcmp(mask, v, SNDRV_MASK_SIZE * sizeof(u_int32_t));
}

160 161
static inline void snd_mask_copy(struct snd_mask *mask,
				 const struct snd_mask *v)
L
Linus Torvalds 已提交
162 163 164 165
{
	*mask = *v;
}

166
static inline int snd_mask_test(const struct snd_mask *mask, unsigned int val)
L
Linus Torvalds 已提交
167 168 169 170
{
	return mask->bits[MASK_OFS(val)] & MASK_BIT(val);
}

171
static inline int snd_mask_single(const struct snd_mask *mask)
L
Linus Torvalds 已提交
172 173 174 175 176 177 178 179 180 181 182 183 184 185
{
	int i, c = 0;
	for (i = 0; i < SNDRV_MASK_SIZE; i++) {
		if (! mask->bits[i])
			continue;
		if (mask->bits[i] & (mask->bits[i] - 1))
			return 0;
		if (c)
			return 0;
		c++;
	}
	return 1;
}

186 187
static inline int snd_mask_refine(struct snd_mask *mask,
				  const struct snd_mask *v)
L
Linus Torvalds 已提交
188
{
T
Takashi Iwai 已提交
189
	struct snd_mask old;
L
Linus Torvalds 已提交
190 191 192 193 194 195 196
	snd_mask_copy(&old, mask);
	snd_mask_intersect(mask, v);
	if (snd_mask_empty(mask))
		return -EINVAL;
	return !snd_mask_eq(mask, &old);
}

197
static inline int snd_mask_refine_first(struct snd_mask *mask)
L
Linus Torvalds 已提交
198 199 200 201 202 203 204
{
	if (snd_mask_single(mask))
		return 0;
	snd_mask_leave(mask, snd_mask_min(mask));
	return 1;
}

205
static inline int snd_mask_refine_last(struct snd_mask *mask)
L
Linus Torvalds 已提交
206 207 208 209 210 211 212
{
	if (snd_mask_single(mask))
		return 0;
	snd_mask_leave(mask, snd_mask_max(mask));
	return 1;
}

213
static inline int snd_mask_refine_min(struct snd_mask *mask, unsigned int val)
L
Linus Torvalds 已提交
214 215 216 217 218 219 220 221 222
{
	if (snd_mask_min(mask) >= val)
		return 0;
	snd_mask_reset_range(mask, 0, val - 1);
	if (snd_mask_empty(mask))
		return -EINVAL;
	return 1;
}

223
static inline int snd_mask_refine_max(struct snd_mask *mask, unsigned int val)
L
Linus Torvalds 已提交
224 225 226 227 228 229 230 231 232
{
	if (snd_mask_max(mask) <= val)
		return 0;
	snd_mask_reset_range(mask, val + 1, SNDRV_MASK_BITS);
	if (snd_mask_empty(mask))
		return -EINVAL;
	return 1;
}

233
static inline int snd_mask_refine_set(struct snd_mask *mask, unsigned int val)
L
Linus Torvalds 已提交
234 235 236 237 238 239 240 241 242
{
	int changed;
	changed = !snd_mask_single(mask);
	snd_mask_leave(mask, val);
	if (snd_mask_empty(mask))
		return -EINVAL;
	return changed;
}

243
static inline int snd_mask_value(const struct snd_mask *mask)
L
Linus Torvalds 已提交
244 245 246 247
{
	return snd_mask_min(mask);
}

248
static inline void snd_interval_any(struct snd_interval *i)
L
Linus Torvalds 已提交
249 250 251 252 253 254 255 256 257
{
	i->min = 0;
	i->openmin = 0;
	i->max = UINT_MAX;
	i->openmax = 0;
	i->integer = 0;
	i->empty = 0;
}

258
static inline void snd_interval_none(struct snd_interval *i)
L
Linus Torvalds 已提交
259 260 261 262
{
	i->empty = 1;
}

263
static inline int snd_interval_checkempty(const struct snd_interval *i)
L
Linus Torvalds 已提交
264 265 266 267 268
{
	return (i->min > i->max ||
		(i->min == i->max && (i->openmin || i->openmax)));
}

269
static inline int snd_interval_empty(const struct snd_interval *i)
L
Linus Torvalds 已提交
270 271 272 273
{
	return i->empty;
}

274
static inline int snd_interval_single(const struct snd_interval *i)
L
Linus Torvalds 已提交
275 276 277 278 279
{
	return (i->min == i->max || 
		(i->min + 1 == i->max && i->openmax));
}

280
static inline int snd_interval_value(const struct snd_interval *i)
L
Linus Torvalds 已提交
281 282 283 284
{
	return i->min;
}

285
static inline int snd_interval_min(const struct snd_interval *i)
L
Linus Torvalds 已提交
286 287 288 289
{
	return i->min;
}

290
static inline int snd_interval_max(const struct snd_interval *i)
L
Linus Torvalds 已提交
291 292 293 294 295 296 297 298
{
	unsigned int v;
	v = i->max;
	if (i->openmax)
		v--;
	return v;
}

299
static inline int snd_interval_test(const struct snd_interval *i, unsigned int val)
L
Linus Torvalds 已提交
300 301 302 303 304
{
	return !((i->min > val || (i->min == val && i->openmin) ||
		  i->max < val || (i->max == val && i->openmax)));
}

305
static inline void snd_interval_copy(struct snd_interval *d, const struct snd_interval *s)
L
Linus Torvalds 已提交
306 307 308 309
{
	*d = *s;
}

310
static inline int snd_interval_setinteger(struct snd_interval *i)
L
Linus Torvalds 已提交
311 312 313 314 315 316 317 318 319
{
	if (i->integer)
		return 0;
	if (i->openmin && i->openmax && i->min == i->max)
		return -EINVAL;
	i->integer = 1;
	return 1;
}

320
static inline int snd_interval_eq(const struct snd_interval *i1, const struct snd_interval *i2)
L
Linus Torvalds 已提交
321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345
{
	if (i1->empty)
		return i2->empty;
	if (i2->empty)
		return i1->empty;
	return i1->min == i2->min && i1->openmin == i2->openmin &&
		i1->max == i2->max && i1->openmax == i2->openmax;
}

static inline unsigned int add(unsigned int a, unsigned int b)
{
	if (a >= UINT_MAX - b)
		return UINT_MAX;
	return a + b;
}

static inline unsigned int sub(unsigned int a, unsigned int b)
{
	if (a > b)
		return a - b;
	return 0;
}

#endif /* __SOUND_PCM_PARAMS_H */