rematrix.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497
  1. /*
  2. * Copyright (C) 2011-2012 Michael Niedermayer (michaelni@gmx.at)
  3. *
  4. * This file is part of libswresample
  5. *
  6. * libswresample 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. * libswresample 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 libswresample; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  19. */
  20. #include "swresample_internal.h"
  21. #include "libavutil/audioconvert.h"
  22. #include "libavutil/avassert.h"
  23. #define ONE (1.0)
  24. #define R(x) x
  25. #define SAMPLE float
  26. #define COEFF float
  27. #define INTER float
  28. #define RENAME(x) x ## _float
  29. #include "rematrix_template.c"
  30. #undef SAMPLE
  31. #undef RENAME
  32. #undef R
  33. #undef ONE
  34. #undef COEFF
  35. #undef INTER
  36. #define ONE (1.0)
  37. #define R(x) x
  38. #define SAMPLE double
  39. #define COEFF double
  40. #define INTER double
  41. #define RENAME(x) x ## _double
  42. #include "rematrix_template.c"
  43. #undef SAMPLE
  44. #undef RENAME
  45. #undef R
  46. #undef ONE
  47. #undef COEFF
  48. #undef INTER
  49. #define ONE (-32768)
  50. #define R(x) (((x) + 16384)>>15)
  51. #define SAMPLE int16_t
  52. #define COEFF int
  53. #define INTER int
  54. #define RENAME(x) x ## _s16
  55. #include "rematrix_template.c"
  56. #define FRONT_LEFT 0
  57. #define FRONT_RIGHT 1
  58. #define FRONT_CENTER 2
  59. #define LOW_FREQUENCY 3
  60. #define BACK_LEFT 4
  61. #define BACK_RIGHT 5
  62. #define FRONT_LEFT_OF_CENTER 6
  63. #define FRONT_RIGHT_OF_CENTER 7
  64. #define BACK_CENTER 8
  65. #define SIDE_LEFT 9
  66. #define SIDE_RIGHT 10
  67. #define TOP_CENTER 11
  68. #define TOP_FRONT_LEFT 12
  69. #define TOP_FRONT_CENTER 13
  70. #define TOP_FRONT_RIGHT 14
  71. #define TOP_BACK_LEFT 15
  72. #define TOP_BACK_CENTER 16
  73. #define TOP_BACK_RIGHT 17
  74. int swr_set_matrix(struct SwrContext *s, const double *matrix, int stride)
  75. {
  76. int nb_in, nb_out, in, out;
  77. if (!s || s->in_convert) // s needs to be allocated but not initialized
  78. return AVERROR(EINVAL);
  79. memset(s->matrix, 0, sizeof(s->matrix));
  80. nb_in = av_get_channel_layout_nb_channels(s->in_ch_layout);
  81. nb_out = av_get_channel_layout_nb_channels(s->out_ch_layout);
  82. for (out = 0; out < nb_out; out++) {
  83. for (in = 0; in < nb_in; in++)
  84. s->matrix[out][in] = matrix[in];
  85. matrix += stride;
  86. }
  87. s->rematrix_custom = 1;
  88. return 0;
  89. }
  90. static int even(int64_t layout){
  91. if(!layout) return 1;
  92. if(layout&(layout-1)) return 1;
  93. return 0;
  94. }
  95. static int clean_layout(SwrContext *s, int64_t layout){
  96. if((layout & AV_CH_LAYOUT_STEREO_DOWNMIX) == AV_CH_LAYOUT_STEREO_DOWNMIX)
  97. return AV_CH_LAYOUT_STEREO;
  98. if(layout && layout != AV_CH_FRONT_CENTER && !(layout&(layout-1))) {
  99. char buf[128];
  100. av_get_channel_layout_string(buf, sizeof(buf), -1, layout);
  101. av_log(s, AV_LOG_VERBOSE, "Treating %s as mono\n", buf);
  102. return AV_CH_FRONT_CENTER;
  103. }
  104. return layout;
  105. }
  106. static int sane_layout(int64_t layout){
  107. if(!(layout & AV_CH_LAYOUT_SURROUND)) // at least 1 front speaker
  108. return 0;
  109. if(!even(layout & (AV_CH_FRONT_LEFT | AV_CH_FRONT_RIGHT))) // no asymetric front
  110. return 0;
  111. if(!even(layout & (AV_CH_SIDE_LEFT | AV_CH_SIDE_RIGHT))) // no asymetric side
  112. return 0;
  113. if(!even(layout & (AV_CH_BACK_LEFT | AV_CH_BACK_RIGHT)))
  114. return 0;
  115. if(!even(layout & (AV_CH_FRONT_LEFT_OF_CENTER | AV_CH_FRONT_RIGHT_OF_CENTER)))
  116. return 0;
  117. if(av_get_channel_layout_nb_channels(layout) >= SWR_CH_MAX)
  118. return 0;
  119. return 1;
  120. }
  121. av_cold static int auto_matrix(SwrContext *s)
  122. {
  123. int i, j, out_i;
  124. double matrix[64][64]={{0}};
  125. int64_t unaccounted, in_ch_layout, out_ch_layout;
  126. double maxcoef=0;
  127. char buf[128];
  128. const int matrix_encoding = s->matrix_encoding;
  129. in_ch_layout = clean_layout(s, s->in_ch_layout);
  130. if(!sane_layout(in_ch_layout)){
  131. av_get_channel_layout_string(buf, sizeof(buf), -1, s->in_ch_layout);
  132. av_log(s, AV_LOG_ERROR, "Input channel layout '%s' is not supported\n", buf);
  133. return AVERROR(EINVAL);
  134. }
  135. out_ch_layout = clean_layout(s, s->out_ch_layout);
  136. if(!sane_layout(out_ch_layout)){
  137. av_get_channel_layout_string(buf, sizeof(buf), -1, s->out_ch_layout);
  138. av_log(s, AV_LOG_ERROR, "Output channel layout '%s' is not supported\n", buf);
  139. return AVERROR(EINVAL);
  140. }
  141. memset(s->matrix, 0, sizeof(s->matrix));
  142. for(i=0; i<64; i++){
  143. if(in_ch_layout & out_ch_layout & (1ULL<<i))
  144. matrix[i][i]= 1.0;
  145. }
  146. unaccounted= in_ch_layout & ~out_ch_layout;
  147. //FIXME implement dolby surround
  148. //FIXME implement full ac3
  149. if(unaccounted & AV_CH_FRONT_CENTER){
  150. if((out_ch_layout & AV_CH_LAYOUT_STEREO) == AV_CH_LAYOUT_STEREO){
  151. if(in_ch_layout & AV_CH_LAYOUT_STEREO) {
  152. matrix[ FRONT_LEFT][FRONT_CENTER]+= s->clev;
  153. matrix[FRONT_RIGHT][FRONT_CENTER]+= s->clev;
  154. } else {
  155. matrix[ FRONT_LEFT][FRONT_CENTER]+= M_SQRT1_2;
  156. matrix[FRONT_RIGHT][FRONT_CENTER]+= M_SQRT1_2;
  157. }
  158. }else
  159. av_assert0(0);
  160. }
  161. if(unaccounted & AV_CH_LAYOUT_STEREO){
  162. if(out_ch_layout & AV_CH_FRONT_CENTER){
  163. matrix[FRONT_CENTER][ FRONT_LEFT]+= M_SQRT1_2;
  164. matrix[FRONT_CENTER][FRONT_RIGHT]+= M_SQRT1_2;
  165. if(in_ch_layout & AV_CH_FRONT_CENTER)
  166. matrix[FRONT_CENTER][ FRONT_CENTER] = s->clev*sqrt(2);
  167. }else
  168. av_assert0(0);
  169. }
  170. if(unaccounted & AV_CH_BACK_CENTER){
  171. if(out_ch_layout & AV_CH_BACK_LEFT){
  172. matrix[ BACK_LEFT][BACK_CENTER]+= M_SQRT1_2;
  173. matrix[BACK_RIGHT][BACK_CENTER]+= M_SQRT1_2;
  174. }else if(out_ch_layout & AV_CH_SIDE_LEFT){
  175. matrix[ SIDE_LEFT][BACK_CENTER]+= M_SQRT1_2;
  176. matrix[SIDE_RIGHT][BACK_CENTER]+= M_SQRT1_2;
  177. }else if(out_ch_layout & AV_CH_FRONT_LEFT){
  178. if (matrix_encoding == AV_MATRIX_ENCODING_DOLBY ||
  179. matrix_encoding == AV_MATRIX_ENCODING_DPLII) {
  180. if (unaccounted & (AV_CH_BACK_LEFT | AV_CH_SIDE_LEFT)) {
  181. matrix[FRONT_LEFT ][BACK_CENTER] -= s->slev * M_SQRT1_2;
  182. matrix[FRONT_RIGHT][BACK_CENTER] += s->slev * M_SQRT1_2;
  183. } else {
  184. matrix[FRONT_LEFT ][BACK_CENTER] -= s->slev;
  185. matrix[FRONT_RIGHT][BACK_CENTER] += s->slev;
  186. }
  187. } else {
  188. matrix[ FRONT_LEFT][BACK_CENTER]+= s->slev*M_SQRT1_2;
  189. matrix[FRONT_RIGHT][BACK_CENTER]+= s->slev*M_SQRT1_2;
  190. }
  191. }else if(out_ch_layout & AV_CH_FRONT_CENTER){
  192. matrix[ FRONT_CENTER][BACK_CENTER]+= s->slev*M_SQRT1_2;
  193. }else
  194. av_assert0(0);
  195. }
  196. if(unaccounted & AV_CH_BACK_LEFT){
  197. if(out_ch_layout & AV_CH_BACK_CENTER){
  198. matrix[BACK_CENTER][ BACK_LEFT]+= M_SQRT1_2;
  199. matrix[BACK_CENTER][BACK_RIGHT]+= M_SQRT1_2;
  200. }else if(out_ch_layout & AV_CH_SIDE_LEFT){
  201. if(in_ch_layout & AV_CH_SIDE_LEFT){
  202. matrix[ SIDE_LEFT][ BACK_LEFT]+= M_SQRT1_2;
  203. matrix[SIDE_RIGHT][BACK_RIGHT]+= M_SQRT1_2;
  204. }else{
  205. matrix[ SIDE_LEFT][ BACK_LEFT]+= 1.0;
  206. matrix[SIDE_RIGHT][BACK_RIGHT]+= 1.0;
  207. }
  208. }else if(out_ch_layout & AV_CH_FRONT_LEFT){
  209. if (matrix_encoding == AV_MATRIX_ENCODING_DOLBY) {
  210. matrix[FRONT_LEFT ][BACK_LEFT ] -= s->slev * M_SQRT1_2;
  211. matrix[FRONT_LEFT ][BACK_RIGHT] -= s->slev * M_SQRT1_2;
  212. matrix[FRONT_RIGHT][BACK_LEFT ] += s->slev * M_SQRT1_2;
  213. matrix[FRONT_RIGHT][BACK_RIGHT] += s->slev * M_SQRT1_2;
  214. } else if (matrix_encoding == AV_MATRIX_ENCODING_DPLII) {
  215. matrix[FRONT_LEFT ][BACK_LEFT ] -= s->slev * SQRT3_2;
  216. matrix[FRONT_LEFT ][BACK_RIGHT] -= s->slev * M_SQRT1_2;
  217. matrix[FRONT_RIGHT][BACK_LEFT ] += s->slev * M_SQRT1_2;
  218. matrix[FRONT_RIGHT][BACK_RIGHT] += s->slev * SQRT3_2;
  219. } else {
  220. matrix[ FRONT_LEFT][ BACK_LEFT] += s->slev;
  221. matrix[FRONT_RIGHT][BACK_RIGHT] += s->slev;
  222. }
  223. }else if(out_ch_layout & AV_CH_FRONT_CENTER){
  224. matrix[ FRONT_CENTER][BACK_LEFT ]+= s->slev*M_SQRT1_2;
  225. matrix[ FRONT_CENTER][BACK_RIGHT]+= s->slev*M_SQRT1_2;
  226. }else
  227. av_assert0(0);
  228. }
  229. if(unaccounted & AV_CH_SIDE_LEFT){
  230. if(out_ch_layout & AV_CH_BACK_LEFT){
  231. /* if back channels do not exist in the input, just copy side
  232. channels to back channels, otherwise mix side into back */
  233. if (in_ch_layout & AV_CH_BACK_LEFT) {
  234. matrix[BACK_LEFT ][SIDE_LEFT ] += M_SQRT1_2;
  235. matrix[BACK_RIGHT][SIDE_RIGHT] += M_SQRT1_2;
  236. } else {
  237. matrix[BACK_LEFT ][SIDE_LEFT ] += 1.0;
  238. matrix[BACK_RIGHT][SIDE_RIGHT] += 1.0;
  239. }
  240. }else if(out_ch_layout & AV_CH_BACK_CENTER){
  241. matrix[BACK_CENTER][ SIDE_LEFT]+= M_SQRT1_2;
  242. matrix[BACK_CENTER][SIDE_RIGHT]+= M_SQRT1_2;
  243. }else if(out_ch_layout & AV_CH_FRONT_LEFT){
  244. if (matrix_encoding == AV_MATRIX_ENCODING_DOLBY) {
  245. matrix[FRONT_LEFT ][SIDE_LEFT ] -= s->slev * M_SQRT1_2;
  246. matrix[FRONT_LEFT ][SIDE_RIGHT] -= s->slev * M_SQRT1_2;
  247. matrix[FRONT_RIGHT][SIDE_LEFT ] += s->slev * M_SQRT1_2;
  248. matrix[FRONT_RIGHT][SIDE_RIGHT] += s->slev * M_SQRT1_2;
  249. } else if (matrix_encoding == AV_MATRIX_ENCODING_DPLII) {
  250. matrix[FRONT_LEFT ][SIDE_LEFT ] -= s->slev * SQRT3_2;
  251. matrix[FRONT_LEFT ][SIDE_RIGHT] -= s->slev * M_SQRT1_2;
  252. matrix[FRONT_RIGHT][SIDE_LEFT ] += s->slev * M_SQRT1_2;
  253. matrix[FRONT_RIGHT][SIDE_RIGHT] += s->slev * SQRT3_2;
  254. } else {
  255. matrix[ FRONT_LEFT][ SIDE_LEFT] += s->slev;
  256. matrix[FRONT_RIGHT][SIDE_RIGHT] += s->slev;
  257. }
  258. }else if(out_ch_layout & AV_CH_FRONT_CENTER){
  259. matrix[ FRONT_CENTER][SIDE_LEFT ]+= s->slev*M_SQRT1_2;
  260. matrix[ FRONT_CENTER][SIDE_RIGHT]+= s->slev*M_SQRT1_2;
  261. }else
  262. av_assert0(0);
  263. }
  264. if(unaccounted & AV_CH_FRONT_LEFT_OF_CENTER){
  265. if(out_ch_layout & AV_CH_FRONT_LEFT){
  266. matrix[ FRONT_LEFT][ FRONT_LEFT_OF_CENTER]+= 1.0;
  267. matrix[FRONT_RIGHT][FRONT_RIGHT_OF_CENTER]+= 1.0;
  268. }else if(out_ch_layout & AV_CH_FRONT_CENTER){
  269. matrix[ FRONT_CENTER][ FRONT_LEFT_OF_CENTER]+= M_SQRT1_2;
  270. matrix[ FRONT_CENTER][FRONT_RIGHT_OF_CENTER]+= M_SQRT1_2;
  271. }else
  272. av_assert0(0);
  273. }
  274. /* mix LFE into front left/right or center */
  275. if (unaccounted & AV_CH_LOW_FREQUENCY) {
  276. if (out_ch_layout & AV_CH_FRONT_CENTER) {
  277. matrix[FRONT_CENTER][LOW_FREQUENCY] += s->lfe_mix_level;
  278. } else if (out_ch_layout & AV_CH_FRONT_LEFT) {
  279. matrix[FRONT_LEFT ][LOW_FREQUENCY] += s->lfe_mix_level * M_SQRT1_2;
  280. matrix[FRONT_RIGHT][LOW_FREQUENCY] += s->lfe_mix_level * M_SQRT1_2;
  281. } else
  282. av_assert0(0);
  283. }
  284. for(out_i=i=0; i<64; i++){
  285. double sum=0;
  286. int in_i=0;
  287. for(j=0; j<64; j++){
  288. s->matrix[out_i][in_i]= matrix[i][j];
  289. if(matrix[i][j]){
  290. sum += fabs(matrix[i][j]);
  291. }
  292. if(in_ch_layout & (1ULL<<j))
  293. in_i++;
  294. }
  295. maxcoef= FFMAX(maxcoef, sum);
  296. if(out_ch_layout & (1ULL<<i))
  297. out_i++;
  298. }
  299. if(s->rematrix_volume < 0)
  300. maxcoef = -s->rematrix_volume;
  301. if(( av_get_packed_sample_fmt(s->out_sample_fmt) < AV_SAMPLE_FMT_FLT
  302. || av_get_packed_sample_fmt(s->int_sample_fmt) < AV_SAMPLE_FMT_FLT) && maxcoef > 1.0){
  303. for(i=0; i<SWR_CH_MAX; i++)
  304. for(j=0; j<SWR_CH_MAX; j++){
  305. s->matrix[i][j] /= maxcoef;
  306. }
  307. }
  308. if(s->rematrix_volume > 0){
  309. for(i=0; i<SWR_CH_MAX; i++)
  310. for(j=0; j<SWR_CH_MAX; j++){
  311. s->matrix[i][j] *= s->rematrix_volume;
  312. }
  313. }
  314. for(i=0; i<av_get_channel_layout_nb_channels(out_ch_layout); i++){
  315. for(j=0; j<av_get_channel_layout_nb_channels(in_ch_layout); j++){
  316. av_log(NULL, AV_LOG_DEBUG, "%f ", s->matrix[i][j]);
  317. }
  318. av_log(NULL, AV_LOG_DEBUG, "\n");
  319. }
  320. return 0;
  321. }
  322. av_cold int swri_rematrix_init(SwrContext *s){
  323. int i, j;
  324. int nb_in = av_get_channel_layout_nb_channels(s->in_ch_layout);
  325. int nb_out = av_get_channel_layout_nb_channels(s->out_ch_layout);
  326. s->mix_any_f = NULL;
  327. if (!s->rematrix_custom) {
  328. int r = auto_matrix(s);
  329. if (r)
  330. return r;
  331. }
  332. if (s->midbuf.fmt == AV_SAMPLE_FMT_S16P){
  333. s->native_matrix = av_mallocz(nb_in * nb_out * sizeof(int));
  334. s->native_one = av_mallocz(sizeof(int));
  335. for (i = 0; i < nb_out; i++)
  336. for (j = 0; j < nb_in; j++)
  337. ((int*)s->native_matrix)[i * nb_in + j] = lrintf(s->matrix[i][j] * 32768);
  338. *((int*)s->native_one) = 32768;
  339. s->mix_1_1_f = (mix_1_1_func_type*)copy_s16;
  340. s->mix_2_1_f = (mix_2_1_func_type*)sum2_s16;
  341. s->mix_any_f = (mix_any_func_type*)get_mix_any_func_s16(s);
  342. }else if(s->midbuf.fmt == AV_SAMPLE_FMT_FLTP){
  343. s->native_matrix = av_mallocz(nb_in * nb_out * sizeof(float));
  344. s->native_one = av_mallocz(sizeof(float));
  345. for (i = 0; i < nb_out; i++)
  346. for (j = 0; j < nb_in; j++)
  347. ((float*)s->native_matrix)[i * nb_in + j] = s->matrix[i][j];
  348. *((float*)s->native_one) = 1.0;
  349. s->mix_1_1_f = (mix_1_1_func_type*)copy_float;
  350. s->mix_2_1_f = (mix_2_1_func_type*)sum2_float;
  351. s->mix_any_f = (mix_any_func_type*)get_mix_any_func_float(s);
  352. }else if(s->midbuf.fmt == AV_SAMPLE_FMT_DBLP){
  353. s->native_matrix = av_mallocz(nb_in * nb_out * sizeof(double));
  354. s->native_one = av_mallocz(sizeof(double));
  355. for (i = 0; i < nb_out; i++)
  356. for (j = 0; j < nb_in; j++)
  357. ((double*)s->native_matrix)[i * nb_in + j] = s->matrix[i][j];
  358. *((double*)s->native_one) = 1.0;
  359. s->mix_1_1_f = (mix_1_1_func_type*)copy_double;
  360. s->mix_2_1_f = (mix_2_1_func_type*)sum2_double;
  361. s->mix_any_f = (mix_any_func_type*)get_mix_any_func_double(s);
  362. }else
  363. av_assert0(0);
  364. //FIXME quantize for integeres
  365. for (i = 0; i < SWR_CH_MAX; i++) {
  366. int ch_in=0;
  367. for (j = 0; j < SWR_CH_MAX; j++) {
  368. s->matrix32[i][j]= lrintf(s->matrix[i][j] * 32768);
  369. if(s->matrix[i][j])
  370. s->matrix_ch[i][++ch_in]= j;
  371. }
  372. s->matrix_ch[i][0]= ch_in;
  373. }
  374. if(HAVE_YASM && HAVE_MMX) swri_rematrix_init_x86(s);
  375. return 0;
  376. }
  377. av_cold void swri_rematrix_free(SwrContext *s){
  378. av_freep(&s->native_matrix);
  379. av_freep(&s->native_one);
  380. av_freep(&s->native_simd_matrix);
  381. }
  382. int swri_rematrix(SwrContext *s, AudioData *out, AudioData *in, int len, int mustcopy){
  383. int out_i, in_i, i, j;
  384. int len1 = 0;
  385. int off = 0;
  386. if(s->mix_any_f) {
  387. s->mix_any_f(out->ch, (const uint8_t **)in->ch, s->native_matrix, len);
  388. return 0;
  389. }
  390. if(s->mix_2_1_simd || s->mix_1_1_simd){
  391. len1= len&~15;
  392. off = len1 * out->bps;
  393. }
  394. av_assert0(out->ch_count == av_get_channel_layout_nb_channels(s->out_ch_layout));
  395. av_assert0(in ->ch_count == av_get_channel_layout_nb_channels(s-> in_ch_layout));
  396. for(out_i=0; out_i<out->ch_count; out_i++){
  397. switch(s->matrix_ch[out_i][0]){
  398. case 0:
  399. if(mustcopy)
  400. memset(out->ch[out_i], 0, len * av_get_bytes_per_sample(s->int_sample_fmt));
  401. break;
  402. case 1:
  403. in_i= s->matrix_ch[out_i][1];
  404. if(s->matrix[out_i][in_i]!=1.0){
  405. if(s->mix_1_1_simd && len1)
  406. s->mix_1_1_simd(out->ch[out_i] , in->ch[in_i] , s->native_simd_matrix, in->ch_count*out_i + in_i, len1);
  407. if(len != len1)
  408. s->mix_1_1_f (out->ch[out_i]+off, in->ch[in_i]+off, s->native_matrix, in->ch_count*out_i + in_i, len-len1);
  409. }else if(mustcopy){
  410. memcpy(out->ch[out_i], in->ch[in_i], len*out->bps);
  411. }else{
  412. out->ch[out_i]= in->ch[in_i];
  413. }
  414. break;
  415. case 2: {
  416. int in_i1 = s->matrix_ch[out_i][1];
  417. int in_i2 = s->matrix_ch[out_i][2];
  418. if(s->mix_2_1_simd && len1)
  419. s->mix_2_1_simd(out->ch[out_i] , in->ch[in_i1] , in->ch[in_i2] , s->native_simd_matrix, in->ch_count*out_i + in_i1, in->ch_count*out_i + in_i2, len1);
  420. else
  421. s->mix_2_1_f (out->ch[out_i] , in->ch[in_i1] , in->ch[in_i2] , s->native_matrix, in->ch_count*out_i + in_i1, in->ch_count*out_i + in_i2, len1);
  422. if(len != len1)
  423. s->mix_2_1_f (out->ch[out_i]+off, in->ch[in_i1]+off, in->ch[in_i2]+off, s->native_matrix, in->ch_count*out_i + in_i1, in->ch_count*out_i + in_i2, len-len1);
  424. break;}
  425. default:
  426. if(s->int_sample_fmt == AV_SAMPLE_FMT_FLTP){
  427. for(i=0; i<len; i++){
  428. float v=0;
  429. for(j=0; j<s->matrix_ch[out_i][0]; j++){
  430. in_i= s->matrix_ch[out_i][1+j];
  431. v+= ((float*)in->ch[in_i])[i] * s->matrix[out_i][in_i];
  432. }
  433. ((float*)out->ch[out_i])[i]= v;
  434. }
  435. }else if(s->int_sample_fmt == AV_SAMPLE_FMT_DBLP){
  436. for(i=0; i<len; i++){
  437. double v=0;
  438. for(j=0; j<s->matrix_ch[out_i][0]; j++){
  439. in_i= s->matrix_ch[out_i][1+j];
  440. v+= ((double*)in->ch[in_i])[i] * s->matrix[out_i][in_i];
  441. }
  442. ((double*)out->ch[out_i])[i]= v;
  443. }
  444. }else{
  445. for(i=0; i<len; i++){
  446. int v=0;
  447. for(j=0; j<s->matrix_ch[out_i][0]; j++){
  448. in_i= s->matrix_ch[out_i][1+j];
  449. v+= ((int16_t*)in->ch[in_i])[i] * s->matrix32[out_i][in_i];
  450. }
  451. ((int16_t*)out->ch[out_i])[i]= (v + 16384)>>15;
  452. }
  453. }
  454. }
  455. }
  456. return 0;
  457. }