1 /*
2 * Copyright (c) 2012 Justin Ruggles <justin.ruggles@gmail.com>
3 *
4 * This file is part of Libav.
5 *
6 * Libav is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
10 *
11 * Libav 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 GNU
14 * Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with Libav; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20
21 #include <stdint.h>
22
30
32
41
49
59 };
60
63 int out_channels, int ptr_align, int samples_align,
65 {
69 char chan_str[16];
74 if (ptr_align == 1 && samples_align == 1) {
77 } else {
79 }
80 if (in_channels) {
81 if (out_channels)
82 snprintf(chan_str,
sizeof(chan_str),
"[%d to %d] ",
83 in_channels, out_channels);
84 else
85 snprintf(chan_str,
sizeof(chan_str),
"[%d to any] ",
86 in_channels);
87 } else if (out_channels) {
88 snprintf(chan_str,
sizeof(chan_str),
"[any to %d] ",
89 out_channels);
90 } else {
91 snprintf(chan_str,
sizeof(chan_str),
"[any to any] ");
92 }
96 }
97 }
98
99 #define MIX_FUNC_NAME(fmt, cfmt) mix_any_ ## fmt ##_## cfmt ##_c
100
101 #define MIX_FUNC_GENERIC(fmt, cfmt, stype, ctype, sumtype, expr) \
102 static void MIX_FUNC_NAME(fmt, cfmt)(stype **samples, ctype **matrix, \
103 int len, int out_ch, int in_ch) \
104 { \
105 int i, in, out; \
106 stype temp[AVRESAMPLE_MAX_CHANNELS]; \
107 for (i = 0; i < len; i++) { \
108 for (out = 0; out < out_ch; out++) { \
109 sumtype sum = 0; \
110 for (in = 0; in < in_ch; in++) \
111 sum += samples[in][i] * matrix[out][in]; \
112 temp[out] = expr; \
113 } \
114 for (out = 0; out < out_ch; out++) \
115 samples[out][i] = temp[out]; \
116 } \
117 }
118
122 MIX_FUNC_GENERIC(S16P, Q8, int16_t, int16_t, int32_t, av_clip_int16(sum >> 8))
123
124 /* TODO: templatize the channel-specific C functions */
125
126 static
void mix_2_to_1_fltp_flt_c(
float **samples,
float **matrix,
int len,
127 int out_ch, int in_ch)
128 {
129 float *src0 = samples[0];
130 float *src1 = samples[1];
131 float *dst = src0;
132 float m0 = matrix[0][0];
133 float m1 = matrix[0][1];
134
135 while (len > 4) {
136 *dst++ = *src0++ * m0 + *src1++ * m1;
137 *dst++ = *src0++ * m0 + *src1++ * m1;
138 *dst++ = *src0++ * m0 + *src1++ * m1;
139 *dst++ = *src0++ * m0 + *src1++ * m1;
140 len -= 4;
141 }
142 while (len > 0) {
143 *dst++ = *src0++ * m0 + *src1++ * m1;
144 len--;
145 }
146 }
147
149 int out_ch, int in_ch)
150 {
151 int16_t *src0 = samples[0];
152 int16_t *src1 = samples[1];
153 int16_t *dst = src0;
154 float m0 = matrix[0][0];
155 float m1 = matrix[0][1];
156
157 while (len > 4) {
158 *dst++ = av_clip_int16(
lrintf(*src0++ * m0 + *src1++ * m1));
159 *dst++ = av_clip_int16(
lrintf(*src0++ * m0 + *src1++ * m1));
160 *dst++ = av_clip_int16(
lrintf(*src0++ * m0 + *src1++ * m1));
161 *dst++ = av_clip_int16(
lrintf(*src0++ * m0 + *src1++ * m1));
162 len -= 4;
163 }
164 while (len > 0) {
165 *dst++ = av_clip_int16(
lrintf(*src0++ * m0 + *src1++ * m1));
166 len--;
167 }
168 }
169
171 int out_ch, int in_ch)
172 {
173 int16_t *src0 = samples[0];
174 int16_t *src1 = samples[1];
175 int16_t *dst = src0;
176 int16_t m0 = matrix[0][0];
177 int16_t m1 = matrix[0][1];
178
179 while (len > 4) {
180 *dst++ = (*src0++ * m0 + *src1++ * m1) >> 8;
181 *dst++ = (*src0++ * m0 + *src1++ * m1) >> 8;
182 *dst++ = (*src0++ * m0 + *src1++ * m1) >> 8;
183 *dst++ = (*src0++ * m0 + *src1++ * m1) >> 8;
184 len -= 4;
185 }
186 while (len > 0) {
187 *dst++ = (*src0++ * m0 + *src1++ * m1) >> 8;
188 len--;
189 }
190 }
191
193 int out_ch, int in_ch)
194 {
196 float *dst0 = samples[0];
197 float *dst1 = samples[1];
199 float m0 = matrix[0][0];
200 float m1 = matrix[1][0];
201
202 while (len > 4) {
203 v = *src++;
204 *dst0++ = v * m1;
205 *dst1++ = v * m0;
206 v = *src++;
207 *dst0++ = v * m1;
208 *dst1++ = v * m0;
209 v = *src++;
210 *dst0++ = v * m1;
211 *dst1++ = v * m0;
212 v = *src++;
213 *dst0++ = v * m1;
214 *dst1++ = v * m0;
215 len -= 4;
216 }
217 while (len > 0) {
218 v = *src++;
219 *dst0++ = v * m1;
220 *dst1++ = v * m0;
221 len--;
222 }
223 }
224
226 int out_ch, int in_ch)
227 {
229 float *src0 = samples[0];
230 float *src1 = samples[1];
231 float *src2 = samples[2];
232 float *src3 = samples[3];
233 float *src4 = samples[4];
234 float *src5 = samples[5];
235 float *dst0 = src0;
236 float *dst1 = src1;
237 float *m0 = matrix[0];
238 float *m1 = matrix[1];
239
240 while (len > 0) {
241 v0 = *src0++;
242 v1 = *src1++;
243 *dst0++ = v0 * m0[0] +
244 v1 * m0[1] +
245 *src2 * m0[2] +
246 *src3 * m0[3] +
247 *src4 * m0[4] +
248 *src5 * m0[5];
249 *dst1++ = v0 * m1[0] +
250 v1 * m1[1] +
251 *src2++ * m1[2] +
252 *src3++ * m1[3] +
253 *src4++ * m1[4] +
254 *src5++ * m1[5];
255 len--;
256 }
257 }
258
260 int out_ch, int in_ch)
261 {
263 float *dst0 = samples[0];
264 float *dst1 = samples[1];
265 float *dst2 = samples[2];
266 float *dst3 = samples[3];
267 float *dst4 = samples[4];
268 float *dst5 = samples[5];
269 float *src0 = dst0;
270 float *src1 = dst1;
271
272 while (len > 0) {
273 v0 = *src0++;
274 v1 = *src1++;
275 *dst0++ = v0 * matrix[0][0] + v1 * matrix[0][1];
276 *dst1++ = v0 * matrix[1][0] + v1 * matrix[1][1];
277 *dst2++ = v0 * matrix[2][0] + v1 * matrix[2][1];
278 *dst3++ = v0 * matrix[3][0] + v1 * matrix[3][1];
279 *dst4++ = v0 * matrix[4][0] + v1 * matrix[4][1];
280 *dst5++ = v0 * matrix[5][0] + v1 * matrix[5][1];
281 len--;
282 }
283 }
284
286 {
289
290 /* no need to set a mix function when we're skipping mixing */
292 return 0;
293
294 /* any-to-any C versions */
295
298
301
304
307
308 /* channel-specific C versions */
309
311 2, 1, 1, 1, "C", mix_2_to_1_fltp_flt_c);
312
315
318
321
324
327
328 if (ARCH_X86)
330
337 }
338 return 0;
339 }
340
342 {
345
347 if (!am)
348 return NULL;
350
354 "mixing: %s\n",
356 goto error;
357 }
358
365
366 /* build matrix if the user did not already set one */
369 if (ret < 0)
370 goto error;
372 } else {
374 sizeof(*matrix_dbl));
375 if (!matrix_dbl)
376 goto error;
377
384 matrix_dbl,
387 if (ret < 0) {
389 goto error;
390 }
391
393 if (ret < 0) {
396 goto error;
397 }
398
400 }
401
402 return am;
403
404 error:
406 return NULL;
407 }
408
410 {
412
413 if (!*am_p)
414 return;
415 am = *am_p;
416
420 }
424
426 }
427
429 {
430 int use_generic = 1;
432 int i, j;
433
434 /* determine whether to use the optimized function based on pointer and
435 samples alignment in both the input and output */
440 len = aligned_len;
441 use_generic = 0;
442 }
443 }
444 av_dlog(am->
avr,
"audio_mix: %d samples - %d to %d channels (%s)\n",
447
451
456 continue;
457 data0[j++] = src->
data[i];
458 }
459 data = data0;
460 } else {
462 }
463
464 if (use_generic)
467 else
470 }
471
476 }
477
479
480 return 0;
481 }
482
484 {
485 int i, o, i0, o0;
486
491 }
492
493 #define GET_MATRIX_CONVERT(suffix, scale) \
494 if (!am->matrix_ ## suffix[0]) { \
495 av_log(am->avr, AV_LOG_ERROR, "matrix is not set\n"); \
496 return AVERROR(EINVAL); \
497 } \
498 for (o = 0, o0 = 0; o < am->out_channels; o++) { \
499 for (i = 0, i0 = 0; i < am->in_channels; i++) { \
500 if (am->input_skip[i] || am->output_zero[o]) \
501 matrix[o * stride + i] = 0.0; \
502 else \
503 matrix[o * stride + i] = am->matrix_ ## suffix[o0][i0] * \
504 (scale); \
505 if (!am->input_skip[i]) \
506 i0++; \
507 } \
508 if (!am->output_zero[o]) \
509 o0++; \
510 }
511
515 break;
518 break;
521 break;
522 default:
525 }
526
527 return 0;
528 }
529
531 {
532 int i, o;
533
537
538 /* exclude output channels if they can be zeroed instead of mixed */
541
542 /* check if the output is always silent */
544 if (matrix[o * stride + i] != 0.0) {
545 zero = 0;
546 break;
547 }
548 }
549 /* check if the corresponding input channel makes a contribution to
550 any output channel */
551 if (o < am->in_channels) {
553 if (matrix[i * stride + o] != 0.0) {
554 zero = 0;
555 break;
556 }
557 }
558 }
559 if (zero) {
562 }
563 }
566 return;
567 }
568
569 /* skip input channels that contribute fully only to the corresponding
570 output channel */
572 int skip = 1;
573
575 int i0;
576 if ((o != i && matrix[o * stride + i] != 0.0) ||
577 (o == i && matrix[o * stride + i] != 1.0)) {
578 skip = 0;
579 break;
580 }
581 /* if the input contributes fully to the output, also check that no
582 other inputs contribute to this output */
583 if (o == i) {
585 if (i0 != i && matrix[o * stride + i0] != 0.0) {
586 skip = 0;
587 break;
588 }
589 }
590 }
591 }
592 if (skip) {
595 }
596 }
597 /* skip input channels that do not contribute to any output channel */
599 int contrib = 0;
600
602 if (matrix[o * stride + i] != 0.0) {
603 contrib = 1;
604 break;
605 }
606 }
607 if (!contrib) {
610 }
611 }
614 return;
615 }
616
617 /* skip output channels that only get full contribution from the
618 corresponding input channel */
620 int skip = 1;
621 int o0;
622
624 if ((o != i && matrix[o * stride + i] != 0.0) ||
625 (o == i && matrix[o * stride + i] != 1.0)) {
626 skip = 0;
627 break;
628 }
629 }
630 /* check if the corresponding input channel makes a contribution to
631 any other output channel */
632 i = o;
634 if (o0 != i && matrix[o0 * stride + i] != 0.0) {
635 skip = 0;
636 break;
637 }
638 }
639 if (skip) {
642 }
643 }
646 return;
647 }
648 }
649
651 {
652 int i, o, i0, o0,
ret;
653 char in_layout_name[128];
654 char out_layout_name[128];
655
660 }
661
665 }
666
669
671
672 #define CONVERT_MATRIX(type, expr) \
673 am->matrix_## type[0] = av_mallocz(am->out_matrix_channels * \
674 am->in_matrix_channels * \
675 sizeof(*am->matrix_## type[0])); \
676 if (!am->matrix_## type[0]) \
677 return AVERROR(ENOMEM); \
678 for (o = 0, o0 = 0; o < am->out_channels; o++) { \
679 if (am->output_zero[o] || am->output_skip[o]) \
680 continue; \
681 if (o0 > 0) \
682 am->matrix_## type[o0] = am->matrix_## type[o0 - 1] + \
683 am->in_matrix_channels; \
684 for (i = 0, i0 = 0; i < am->in_channels; i++) { \
685 double v; \
686 if (am->input_skip[i]) \
687 continue; \
688 v = matrix[o * stride + i]; \
689 am->matrix_## type[o0][i0] = expr; \
690 i0++; \
691 } \
692 o0++; \
693 } \
694 am->matrix = (void **)am->matrix_## type;
695
700 break;
703 break;
706 break;
707 default:
710 }
711 }
712
714 if (ret < 0)
716
722 in_layout_name, out_layout_name);
731 else
734 }
736 }
737
738 return 0;
739 }