Annotation of src/usr.bin/aucat/aparams.c, Revision 1.8
1.8 ! ratchov 1: /* $OpenBSD: aparams.c,v 1.7 2009/07/25 10:52:18 ratchov Exp $ */
1.1 ratchov 2: /*
3: * Copyright (c) 2008 Alexandre Ratchov <alex@caoua.org>
4: *
5: * Permission to use, copy, modify, and distribute this software for any
6: * purpose with or without fee is hereby granted, provided that the above
7: * copyright notice and this permission notice appear in all copies.
8: *
9: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12: * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13: * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14: * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15: * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
16: */
17:
18: #include <stdio.h>
19: #include <stdlib.h>
20: #include <string.h>
21:
22: #include "aparams.h"
1.4 ratchov 23:
24: int aparams_ctltovol[128] = {
25: 0,
26: 256, 266, 276, 287, 299, 310, 323, 335,
27: 348, 362, 376, 391, 406, 422, 439, 456,
28: 474, 493, 512, 532, 553, 575, 597, 621,
29: 645, 670, 697, 724, 753, 782, 813, 845,
30: 878, 912, 948, 985, 1024, 1064, 1106, 1149,
31: 1195, 1241, 1290, 1341, 1393, 1448, 1505, 1564,
32: 1625, 1689, 1756, 1825, 1896, 1971, 2048, 2128,
33: 2212, 2299, 2389, 2483, 2580, 2682, 2787, 2896,
34: 3010, 3128, 3251, 3379, 3511, 3649, 3792, 3941,
35: 4096, 4257, 4424, 4598, 4778, 4966, 5161, 5363,
36: 5574, 5793, 6020, 6256, 6502, 6757, 7023, 7298,
37: 7585, 7883, 8192, 8514, 8848, 9195, 9556, 9931,
38: 10321, 10726, 11148, 11585, 12040, 12513, 13004, 13515,
39: 14045, 14596, 15170, 15765, 16384, 17027, 17696, 18390,
40: 19112, 19863, 20643, 21453, 22295, 23170, 24080, 25025,
41: 26008, 27029, 28090, 29193, 30339, 31530, 32768
42: };
1.8 ! ratchov 43:
! 44: /*
! 45: * Fake parameters for byte-streams
! 46: */
! 47: struct aparams aparams_none = { 1, 0, 0, 0, 0, 0, 0, 0 };
1.1 ratchov 48:
49: /*
1.2 ratchov 50: * Generate a string corresponding to the encoding in par,
1.7 ratchov 51: * return the length of the resulting string.
1.2 ratchov 52: */
53: int
54: aparams_enctostr(struct aparams *par, char *ostr)
55: {
56: char *p = ostr;
57:
58: *p++ = par->sig ? 's' : 'u';
59: if (par->bits > 9)
60: *p++ = '0' + par->bits / 10;
61: *p++ = '0' + par->bits % 10;
62: if (par->bps > 1) {
63: *p++ = par->le ? 'l' : 'b';
64: *p++ = 'e';
65: if (par->bps != APARAMS_BPS(par->bits) ||
66: par->bits < par->bps * 8) {
67: *p++ = par->bps + '0';
68: if (par->bits < par->bps * 8) {
69: *p++ = par->msb ? 'm' : 'l';
70: *p++ = 's';
71: *p++ = 'b';
72: }
73: }
74: }
75: *p++ = '\0';
76: return p - ostr - 1;
77: }
78:
79: /*
80: * Parse an encoding string, examples: s8, u8, s16, s16le, s24be ...
1.7 ratchov 81: * set *istr to the char following the encoding. Return the number
82: * of bytes consumed.
1.2 ratchov 83: */
84: int
85: aparams_strtoenc(struct aparams *par, char *istr)
86: {
87: char *p = istr;
88: int i, sig, bits, le, bps, msb;
1.6 ratchov 89:
1.2 ratchov 90: #define IS_SEP(c) \
91: (((c) < 'a' || (c) > 'z') && \
92: ((c) < 'A' || (c) > 'Z') && \
93: ((c) < '0' || (c) > '9'))
94:
95: /*
96: * get signedness
97: */
98: if (*p == 's') {
99: sig = 1;
100: } else if (*p == 'u') {
101: sig = 0;
102: } else
103: return 0;
104: p++;
1.6 ratchov 105:
1.2 ratchov 106: /*
107: * get number of bits per sample
108: */
109: bits = 0;
110: for (i = 0; i < 2; i++) {
111: if (*p < '0' || *p > '9')
112: break;
113: bits = (bits * 10) + *p - '0';
114: p++;
115: }
116: if (bits < BITS_MIN || bits > BITS_MAX)
117: return 0;
118: bps = APARAMS_BPS(bits);
119: msb = 1;
120: le = NATIVE_LE;
121:
122: /*
1.7 ratchov 123: * get (optional) endianness
1.2 ratchov 124: */
125: if (p[0] == 'l' && p[1] == 'e') {
126: le = 1;
127: p += 2;
128: } else if (p[0] == 'b' && p[1] == 'e') {
129: le = 0;
130: p += 2;
131: } else if (IS_SEP(*p)) {
132: goto done;
133: } else
134: return 0;
135:
136: /*
1.7 ratchov 137: * get (optional) number of bytes
1.2 ratchov 138: */
139: if (*p >= '0' && *p <= '9') {
140: bps = *p - '0';
141: if (bps < (bits + 7) / 8 ||
142: bps > (BITS_MAX + 7) / 8)
143: return 0;
144: p++;
145:
146: /*
1.7 ratchov 147: * get (optional) alignement
1.2 ratchov 148: */
149: if (p[0] == 'm' && p[1] == 's' && p[2] == 'b') {
150: msb = 1;
151: p += 3;
152: } else if (p[0] == 'l' && p[1] == 's' && p[2] == 'b') {
153: msb = 0;
154: p += 3;
155: } else if (IS_SEP(*p)) {
156: goto done;
157: } else
158: return 0;
159: } else if (!IS_SEP(*p))
160: return 0;
161:
162: done:
163: par->msb = msb;
164: par->sig = sig;
165: par->bits = bits;
166: par->bps = bps;
167: par->le = le;
168: return p - istr;
169: }
170:
171: /*
1.1 ratchov 172: * Initialise parameters structure with the defaults natively supported
173: * by the machine.
174: */
175: void
176: aparams_init(struct aparams *par, unsigned cmin, unsigned cmax, unsigned rate)
177: {
178: par->bps = 2; /* 2 bytes per sample */
179: par->bits = 16; /* 16 significant bits per sample */
180: par->sig = 1; /* samples are signed */
181: par->le = NATIVE_LE;
182: par->msb = 1; /* msb justified */
183: par->cmin = cmin;
184: par->cmax = cmax;
185: par->rate = rate;
186: }
187:
188: /*
189: * Print the format/channels/encoding on stderr.
190: */
191: void
192: aparams_print(struct aparams *par)
1.6 ratchov 193: {
1.2 ratchov 194: char enc[ENCMAX];
195:
196: aparams_enctostr(par, enc);
197: fprintf(stderr, "%s", enc);
1.1 ratchov 198: fprintf(stderr, ",%u:%u", par->cmin, par->cmax);
199: fprintf(stderr, ",%uHz", par->rate);
200: }
201:
202: void
203: aparams_print2(struct aparams *par1, struct aparams *par2)
204: {
205: aparams_print(par1);
206: fprintf(stderr, " -> ");
207: aparams_print(par2);
208: }
209:
210: /*
1.3 ratchov 211: * Return true if both encodings are the same.
1.1 ratchov 212: */
213: int
1.3 ratchov 214: aparams_eqenc(struct aparams *par1, struct aparams *par2)
1.1 ratchov 215: {
216: if (par1->bps != par2->bps ||
217: par1->bits != par2->bits ||
1.3 ratchov 218: par1->sig != par2->sig)
1.1 ratchov 219: return 0;
220: if ((par1->bits != 8 * par1->bps) && par1->msb != par2->msb)
221: return 0;
222: if (par1->bps > 1 && par1->le != par2->le)
223: return 0;
224: return 1;
225: }
1.3 ratchov 226:
227: /*
228: * Return true if both parameters are the same.
229: */
230: int
231: aparams_eq(struct aparams *par1, struct aparams *par2)
232: {
233: if (!aparams_eqenc(par1, par2) ||
234: par1->cmin != par2->cmin ||
235: par1->cmax != par2->cmax ||
236: par1->rate != par2->rate)
237: return 0;
238: return 1;
239: }
240:
241: /*
1.7 ratchov 242: * Return true if first channel range includes second range.
1.3 ratchov 243: */
244: int
245: aparams_subset(struct aparams *subset, struct aparams *set)
246: {
247: return subset->cmin >= set->cmin && subset->cmax <= set->cmax;
248: }
249:
250: /*
1.7 ratchov 251: * Grow channels range and sample rate of ``set'' in order ``subset'' to
1.5 ratchov 252: * become an actual subset of it.
253: */
254: void
255: aparams_grow(struct aparams *set, struct aparams *subset)
256: {
257: if (set->cmin > subset->cmin)
258: set->cmin = subset->cmin;
259: if (set->cmax < subset->cmax)
260: set->cmax = subset->cmax;
261: if (set->rate < subset->rate)
262: set->rate = subset->rate;
263: }
264:
265: /*
1.7 ratchov 266: * Return true if rates are the same.
1.3 ratchov 267: */
268: int
269: aparams_eqrate(struct aparams *p1, struct aparams *p2)
270: {
271: /* XXX: allow 1/9 halftone of difference */
272: return p1->rate == p2->rate;
273: }
274:
1.1 ratchov 275:
276: /*
277: * Return the number of bytes per frame with the given parameters.
278: */
279: unsigned
280: aparams_bpf(struct aparams *par)
281: {
282: return (par->cmax - par->cmin + 1) * par->bps;
283: }
1.2 ratchov 284:
285: void
286: aparams_copyenc(struct aparams *dst, struct aparams *src)
287: {
288: dst->sig = src->sig;
289: dst->le = src->le;
290: dst->msb = src->msb;
291: dst->bits = src->bits;
292: dst->bps = src->bps;
293: }