pcm_params.h 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366
  1. #ifndef __SOUND_PCM_PARAMS_H
  2. #define __SOUND_PCM_PARAMS_H
  3. /*
  4. * PCM params helpers
  5. * Copyright (c) by Abramo Bagnara <abramo@alsa-project.org>
  6. *
  7. *
  8. * This program is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published by
  10. * the Free Software Foundation; either version 2 of the License, or
  11. * (at your option) any later version.
  12. *
  13. * This program is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program; if not, write to the Free Software
  20. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  21. *
  22. */
  23. extern int snd_pcm_hw_param_mask(struct snd_pcm_substream *pcm, struct snd_pcm_hw_params *params,
  24. snd_pcm_hw_param_t var, const struct snd_mask *val);
  25. extern unsigned int snd_pcm_hw_param_value_min(const struct snd_pcm_hw_params *params,
  26. snd_pcm_hw_param_t var, int *dir);
  27. extern unsigned int snd_pcm_hw_param_value_max(const struct snd_pcm_hw_params *params,
  28. snd_pcm_hw_param_t var, int *dir);
  29. extern int _snd_pcm_hw_param_min(struct snd_pcm_hw_params *params,
  30. snd_pcm_hw_param_t var, unsigned int val, int dir);
  31. extern int _snd_pcm_hw_param_setinteger(struct snd_pcm_hw_params *params,
  32. snd_pcm_hw_param_t var);
  33. extern int _snd_pcm_hw_param_set(struct snd_pcm_hw_params *params,
  34. snd_pcm_hw_param_t var, unsigned int val, int dir);
  35. /* To share the same code we have alsa-lib */
  36. #define INLINE static inline
  37. #define assert(a) (void)(a)
  38. #define SNDRV_MASK_BITS 64 /* we use so far 64bits only */
  39. #define SNDRV_MASK_SIZE (SNDRV_MASK_BITS / 32)
  40. #define MASK_OFS(i) ((i) >> 5)
  41. #define MASK_BIT(i) (1U << ((i) & 31))
  42. INLINE unsigned int ld2(u_int32_t v)
  43. {
  44. unsigned r = 0;
  45. if (v >= 0x10000) {
  46. v >>= 16;
  47. r += 16;
  48. }
  49. if (v >= 0x100) {
  50. v >>= 8;
  51. r += 8;
  52. }
  53. if (v >= 0x10) {
  54. v >>= 4;
  55. r += 4;
  56. }
  57. if (v >= 4) {
  58. v >>= 2;
  59. r += 2;
  60. }
  61. if (v >= 2)
  62. r++;
  63. return r;
  64. }
  65. INLINE size_t snd_mask_sizeof(void)
  66. {
  67. return sizeof(struct snd_mask);
  68. }
  69. INLINE void snd_mask_none(struct snd_mask *mask)
  70. {
  71. memset(mask, 0, sizeof(*mask));
  72. }
  73. INLINE void snd_mask_any(struct snd_mask *mask)
  74. {
  75. memset(mask, 0xff, SNDRV_MASK_SIZE * sizeof(u_int32_t));
  76. }
  77. INLINE int snd_mask_empty(const struct snd_mask *mask)
  78. {
  79. int i;
  80. for (i = 0; i < SNDRV_MASK_SIZE; i++)
  81. if (mask->bits[i])
  82. return 0;
  83. return 1;
  84. }
  85. INLINE unsigned int snd_mask_min(const struct snd_mask *mask)
  86. {
  87. int i;
  88. assert(!snd_mask_empty(mask));
  89. for (i = 0; i < SNDRV_MASK_SIZE; i++) {
  90. if (mask->bits[i])
  91. return ffs(mask->bits[i]) - 1 + (i << 5);
  92. }
  93. return 0;
  94. }
  95. INLINE unsigned int snd_mask_max(const struct snd_mask *mask)
  96. {
  97. int i;
  98. assert(!snd_mask_empty(mask));
  99. for (i = SNDRV_MASK_SIZE - 1; i >= 0; i--) {
  100. if (mask->bits[i])
  101. return ld2(mask->bits[i]) + (i << 5);
  102. }
  103. return 0;
  104. }
  105. INLINE void snd_mask_set(struct snd_mask *mask, unsigned int val)
  106. {
  107. assert(val <= SNDRV_MASK_BITS);
  108. mask->bits[MASK_OFS(val)] |= MASK_BIT(val);
  109. }
  110. INLINE void snd_mask_reset(struct snd_mask *mask, unsigned int val)
  111. {
  112. assert(val <= SNDRV_MASK_BITS);
  113. mask->bits[MASK_OFS(val)] &= ~MASK_BIT(val);
  114. }
  115. INLINE void snd_mask_set_range(struct snd_mask *mask, unsigned int from, unsigned int to)
  116. {
  117. unsigned int i;
  118. assert(to <= SNDRV_MASK_BITS && from <= to);
  119. for (i = from; i <= to; i++)
  120. mask->bits[MASK_OFS(i)] |= MASK_BIT(i);
  121. }
  122. INLINE void snd_mask_reset_range(struct snd_mask *mask, unsigned int from, unsigned int to)
  123. {
  124. unsigned int i;
  125. assert(to <= SNDRV_MASK_BITS && from <= to);
  126. for (i = from; i <= to; i++)
  127. mask->bits[MASK_OFS(i)] &= ~MASK_BIT(i);
  128. }
  129. INLINE void snd_mask_leave(struct snd_mask *mask, unsigned int val)
  130. {
  131. unsigned int v;
  132. assert(val <= SNDRV_MASK_BITS);
  133. v = mask->bits[MASK_OFS(val)] & MASK_BIT(val);
  134. snd_mask_none(mask);
  135. mask->bits[MASK_OFS(val)] = v;
  136. }
  137. INLINE void snd_mask_intersect(struct snd_mask *mask, const struct snd_mask *v)
  138. {
  139. int i;
  140. for (i = 0; i < SNDRV_MASK_SIZE; i++)
  141. mask->bits[i] &= v->bits[i];
  142. }
  143. INLINE int snd_mask_eq(const struct snd_mask *mask, const struct snd_mask *v)
  144. {
  145. return ! memcmp(mask, v, SNDRV_MASK_SIZE * sizeof(u_int32_t));
  146. }
  147. INLINE void snd_mask_copy(struct snd_mask *mask, const struct snd_mask *v)
  148. {
  149. *mask = *v;
  150. }
  151. INLINE int snd_mask_test(const struct snd_mask *mask, unsigned int val)
  152. {
  153. assert(val <= SNDRV_MASK_BITS);
  154. return mask->bits[MASK_OFS(val)] & MASK_BIT(val);
  155. }
  156. INLINE int snd_mask_single(const struct snd_mask *mask)
  157. {
  158. int i, c = 0;
  159. assert(!snd_mask_empty(mask));
  160. for (i = 0; i < SNDRV_MASK_SIZE; i++) {
  161. if (! mask->bits[i])
  162. continue;
  163. if (mask->bits[i] & (mask->bits[i] - 1))
  164. return 0;
  165. if (c)
  166. return 0;
  167. c++;
  168. }
  169. return 1;
  170. }
  171. INLINE int snd_mask_refine(struct snd_mask *mask, const struct snd_mask *v)
  172. {
  173. struct snd_mask old;
  174. assert(!snd_mask_empty(mask));
  175. snd_mask_copy(&old, mask);
  176. snd_mask_intersect(mask, v);
  177. if (snd_mask_empty(mask))
  178. return -EINVAL;
  179. return !snd_mask_eq(mask, &old);
  180. }
  181. INLINE int snd_mask_refine_first(struct snd_mask *mask)
  182. {
  183. assert(!snd_mask_empty(mask));
  184. if (snd_mask_single(mask))
  185. return 0;
  186. snd_mask_leave(mask, snd_mask_min(mask));
  187. return 1;
  188. }
  189. INLINE int snd_mask_refine_last(struct snd_mask *mask)
  190. {
  191. assert(!snd_mask_empty(mask));
  192. if (snd_mask_single(mask))
  193. return 0;
  194. snd_mask_leave(mask, snd_mask_max(mask));
  195. return 1;
  196. }
  197. INLINE int snd_mask_refine_min(struct snd_mask *mask, unsigned int val)
  198. {
  199. assert(!snd_mask_empty(mask));
  200. if (snd_mask_min(mask) >= val)
  201. return 0;
  202. snd_mask_reset_range(mask, 0, val - 1);
  203. if (snd_mask_empty(mask))
  204. return -EINVAL;
  205. return 1;
  206. }
  207. INLINE int snd_mask_refine_max(struct snd_mask *mask, unsigned int val)
  208. {
  209. assert(!snd_mask_empty(mask));
  210. if (snd_mask_max(mask) <= val)
  211. return 0;
  212. snd_mask_reset_range(mask, val + 1, SNDRV_MASK_BITS);
  213. if (snd_mask_empty(mask))
  214. return -EINVAL;
  215. return 1;
  216. }
  217. INLINE int snd_mask_refine_set(struct snd_mask *mask, unsigned int val)
  218. {
  219. int changed;
  220. assert(!snd_mask_empty(mask));
  221. changed = !snd_mask_single(mask);
  222. snd_mask_leave(mask, val);
  223. if (snd_mask_empty(mask))
  224. return -EINVAL;
  225. return changed;
  226. }
  227. INLINE int snd_mask_value(const struct snd_mask *mask)
  228. {
  229. assert(!snd_mask_empty(mask));
  230. return snd_mask_min(mask);
  231. }
  232. INLINE void snd_interval_any(struct snd_interval *i)
  233. {
  234. i->min = 0;
  235. i->openmin = 0;
  236. i->max = UINT_MAX;
  237. i->openmax = 0;
  238. i->integer = 0;
  239. i->empty = 0;
  240. }
  241. INLINE void snd_interval_none(struct snd_interval *i)
  242. {
  243. i->empty = 1;
  244. }
  245. INLINE int snd_interval_checkempty(const struct snd_interval *i)
  246. {
  247. return (i->min > i->max ||
  248. (i->min == i->max && (i->openmin || i->openmax)));
  249. }
  250. INLINE int snd_interval_empty(const struct snd_interval *i)
  251. {
  252. return i->empty;
  253. }
  254. INLINE int snd_interval_single(const struct snd_interval *i)
  255. {
  256. assert(!snd_interval_empty(i));
  257. return (i->min == i->max ||
  258. (i->min + 1 == i->max && i->openmax));
  259. }
  260. INLINE int snd_interval_value(const struct snd_interval *i)
  261. {
  262. assert(snd_interval_single(i));
  263. return i->min;
  264. }
  265. INLINE int snd_interval_min(const struct snd_interval *i)
  266. {
  267. assert(!snd_interval_empty(i));
  268. return i->min;
  269. }
  270. INLINE int snd_interval_max(const struct snd_interval *i)
  271. {
  272. unsigned int v;
  273. assert(!snd_interval_empty(i));
  274. v = i->max;
  275. if (i->openmax)
  276. v--;
  277. return v;
  278. }
  279. INLINE int snd_interval_test(const struct snd_interval *i, unsigned int val)
  280. {
  281. return !((i->min > val || (i->min == val && i->openmin) ||
  282. i->max < val || (i->max == val && i->openmax)));
  283. }
  284. INLINE void snd_interval_copy(struct snd_interval *d, const struct snd_interval *s)
  285. {
  286. *d = *s;
  287. }
  288. INLINE int snd_interval_setinteger(struct snd_interval *i)
  289. {
  290. if (i->integer)
  291. return 0;
  292. if (i->openmin && i->openmax && i->min == i->max)
  293. return -EINVAL;
  294. i->integer = 1;
  295. return 1;
  296. }
  297. INLINE int snd_interval_eq(const struct snd_interval *i1, const struct snd_interval *i2)
  298. {
  299. if (i1->empty)
  300. return i2->empty;
  301. if (i2->empty)
  302. return i1->empty;
  303. return i1->min == i2->min && i1->openmin == i2->openmin &&
  304. i1->max == i2->max && i1->openmax == i2->openmax;
  305. }
  306. static inline unsigned int add(unsigned int a, unsigned int b)
  307. {
  308. if (a >= UINT_MAX - b)
  309. return UINT_MAX;
  310. return a + b;
  311. }
  312. static inline unsigned int sub(unsigned int a, unsigned int b)
  313. {
  314. if (a > b)
  315. return a - b;
  316. return 0;
  317. }
  318. #undef INLINE
  319. #undef assert
  320. #endif /* __SOUND_PCM_PARAMS_H */