1 /*
2 * MPEG Audio decoder
3 * Copyright (c) 2001, 2002 Fabrice Bellard
4 *
5 * This file is part of FFmpeg.
6 *
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 /**
23 * @file
24 * MPEG Audio decoder
25 */
26
27 #include "config_components.h"
28
38
44
45 /*
46 * TODO:
47 * - test lsf / mpeg25 extensively.
48 */
49
52
53 #define BACKSTEP_SIZE 512
55 #define LAST_BUF_SIZE 2 * BACKSTEP_SIZE + EXTRABYTES
56
57 /* layer 3 "granule" */
70 int region_size[3];
/* number of huffman codes in each region */
76
82 /* next header (used in free format parsing) */
91 int adu_mode;
///< 0 for standard mp3, 1 for adu formatted mp3
100
101 #define HEADER_SIZE 4
102
104
106 /* intensity stereo coef table */
108
109 /* [i][j]: 2^(-j/3) * FRAC_ONE * 2^(i+2) / (2^(i+2) - 1) */
111 /* mult table for layer 2 group quantization */
112
113 #define SCALE_GEN(v) \
114 { FIXR_OLD(1.0 * (v)), FIXR_OLD(0.7937005259 * (v)), FIXR_OLD(0.6299605249 * (v)) }
115
120 };
121
122 /**
123 * Convert region offsets to region sizes and truncate
124 * size to big_values.
125 */
127 {
129 g->region_size[2] = 576 / 2;
130 for (
i = 0;
i < 3;
i++) {
131 k =
FFMIN(
g->region_size[
i],
g->big_values);
132 g->region_size[
i] = k - j;
133 j = k;
134 }
135 }
136
138 {
139 if (
g->block_type == 2) {
140 if (
s->sample_rate_index != 8)
141 g->region_size[0] = (36 / 2);
142 else
143 g->region_size[0] = (72 / 2);
144 } else {
145 if (
s->sample_rate_index <= 2)
146 g->region_size[0] = (36 / 2);
147 else if (
s->sample_rate_index != 8)
148 g->region_size[0] = (54 / 2);
149 else
150 g->region_size[0] = (108 / 2);
151 }
152 g->region_size[1] = (576 / 2);
153 }
154
156 int ra1, int ra2)
157 {
158 int l;
160 /* should not overflow */
161 l =
FFMIN(ra1 + ra2 + 2, 22);
163 }
164
166 {
167 if (
g->block_type == 2) {
168 if (
g->switch_point) {
169 if(
s->sample_rate_index == 8)
171 /* if switched mode, we handle the 36 first samples as
172 long blocks. For 8000Hz, we handle the 72 first
173 exponents as long blocks */
174 if (
s->sample_rate_index <= 2)
176 else
178
180 } else {
183 }
184 } else {
187 }
188 }
189
190 /* layer 1 unscaling */
191 /* n = number of bits of the mantissa minus 1 */
192 static inline int l1_unscale(
int n,
int mant,
int scale_factor)
193 {
196
202 /* NOTE: at this point, 1 <= shift >= 21 + 15 */
204 }
205
207 {
209
213
215 /* NOTE: at this point, 0 <= shift <= 21 */
219 }
220
221 /* compute value^(4/3) * 2^(exponent/4). It normalized to FRAC_BITS */
223 {
224 unsigned int m;
225 int e;
226
229 e -= exponent >> 2;
230 #ifdef DEBUG
231 if(e < 1)
233 #endif
235 return 0;
236 m = (m + ((1U << e) >> 1)) >> e;
237
238 return m;
239 }
240
242 {
244
245 /* scale factor multiply for layer 1 */
246 for (
i = 0;
i < 15;
i++) {
247 int n, norm;
249 norm = ((INT64_C(1) << n) *
FRAC_ONE) / ((1 << n) - 1);
253 ff_dlog(
NULL,
"%d: norm=%x s=%"PRIx32
" %"PRIx32
" %"PRIx32
"\n",
i,
254 (unsigned)norm,
258 }
259
260 /* compute n ^ (4/3) and store it in mantissa/exp format */
261
263
264 for (
i = 0;
i < 16;
i++) {
266 int e, k;
267
268 for (j = 0; j < 2; j++) {
269 e = -(j + 1) * ((
i + 1) >> 1);
277 }
278 }
279 RENAME(ff_mpa_synth_init)();
281 }
282
284 {
287
289
290 #if USE_FLOATS
291 {
294 if (!fdsp)
298 }
299 #endif
300
302
306 else
309
312
314
315 return 0;
316 }
317
318 #define C3 FIXHR(0.86602540378443864676/2)
319 #define C4 FIXHR(0.70710678118654752439/2) //0.5 / cos(pi*(9)/36)
320 #define C5 FIXHR(0.51763809020504152469/2) //0.5 / cos(pi*(5)/36)
321 #define C6 FIXHR(1.93185165257813657349/4) //0.5 / cos(pi*(15)/36)
322
323 /* 12 points IMDCT. We compute it "by hand" by factorizing obvious
324 cases. */
326 {
327 SUINTFLOAT in0, in1, in2, in3, in4, in5, t1, t2;
328
329 in0 = in[0*3];
330 in1 = in[1*3] + in[0*3];
331 in2 = in[2*3] + in[1*3];
332 in3 = in[3*3] + in[2*3];
333 in4 = in[4*3] + in[3*3];
334 in5 = in[5*3] + in[4*3];
335 in5 += in3;
336 in3 += in1;
337
340
341 t1 = in0 - in4;
343
348
350 in4 = in0 + in2;
351 in5 += 2*in1;
357
358 in0 -= in2;
364 }
365
367 {
370 int sec_byte_len = sec_len >> 3;
371 int sec_rem_bits = sec_len & 7;
373 uint8_t tmp_buf[4];
374 uint32_t crc_val =
av_crc(crc_tab, UINT16_MAX, &buf[2], 2);
375 crc_val =
av_crc(crc_tab, crc_val, &buf[6], sec_byte_len);
376
378 ((buf[6 + sec_byte_len] & (0xFF00U >> sec_rem_bits)) << 24) +
379 ((
s->crc << 16) >> sec_rem_bits));
380
381 crc_val =
av_crc(crc_tab, crc_val, tmp_buf, 3);
382
383 if (crc_val) {
387 }
388 }
389 return 0;
390 }
391
392 /* return the number of decoded frames */
394 {
395 int bound,
i, v, n, ch, j, mant;
399
403
405 bound = (
s->mode_ext + 1) * 4;
406 else
408
409 /* allocation bits */
411 for (ch = 0; ch <
s->nb_channels; ch++) {
413 }
414 }
417
418 /* scale factors */
420 for (ch = 0; ch <
s->nb_channels; ch++) {
421 if (allocation[ch][
i])
423 }
424 }
426 if (allocation[0][
i]) {
429 }
430 }
431
432 /* compute samples */
433 for (j = 0; j < 12; j++) {
435 for (ch = 0; ch <
s->nb_channels; ch++) {
436 n = allocation[ch][
i];
437 if (n) {
440 } else {
441 v = 0;
442 }
443 s->sb_samples[ch][j][
i] = v;
444 }
445 }
447 n = allocation[0][
i];
448 if (n) {
451 s->sb_samples[0][j][
i] = v;
453 s->sb_samples[1][j][
i] = v;
454 } else {
455 s->sb_samples[0][j][
i] = 0;
456 s->sb_samples[1][j][
i] = 0;
457 }
458 }
459 }
460 return 12;
461 }
462
464 {
465 int sblimit; /* number of used subbands */
473
474 /* select decoding table */
476 s->sample_rate,
s->lsf);
479
481 bound = (
s->mode_ext + 1) * 4;
482 else
484
486
487 /* sanity check */
490
491 /* parse bit allocation */
492 j = 0;
495 for (ch = 0; ch <
s->nb_channels; ch++)
497 j += 1 << bit_alloc_bits;
498 }
504 j += 1 << bit_alloc_bits;
505 }
506
507 /* scale codes */
508 for (
i = 0;
i < sblimit;
i++) {
509 for (ch = 0; ch <
s->nb_channels; ch++) {
512 }
513 }
514
518
519 /* scale factors */
520 for (
i = 0;
i < sblimit;
i++) {
521 for (ch = 0; ch <
s->nb_channels; ch++) {
523 sf = scale_factors[ch][
i];
524 switch (scale_code[ch][
i]) {
525 default:
526 case 0:
530 break;
531 case 2:
533 sf[1] = sf[0];
534 sf[2] = sf[0];
535 break;
536 case 1:
539 sf[1] = sf[0];
540 break;
541 case 3:
544 sf[1] = sf[2];
545 break;
546 }
547 }
548 }
549 }
550
551 /* samples */
552 for (k = 0; k < 3; k++) {
553 for (l = 0; l < 12; l += 3) {
554 j = 0;
557 for (ch = 0; ch <
s->nb_channels; ch++) {
560 scale = scale_factors[ch][
i][k];
564 int v2;
565 /* 3 values at the same time */
569
570 s->sb_samples[ch][k * 12 + l + 0][
i] =
572 s->sb_samples[ch][k * 12 + l + 1][
i] =
574 s->sb_samples[ch][k * 12 + l + 2][
i] =
576 } else {
577 for (m = 0; m < 3; m++) {
580 s->sb_samples[ch][k * 12 + l + m][
i] = v;
581 }
582 }
583 } else {
584 s->sb_samples[ch][k * 12 + l + 0][
i] = 0;
585 s->sb_samples[ch][k * 12 + l + 1][
i] = 0;
586 s->sb_samples[ch][k * 12 + l + 2][
i] = 0;
587 }
588 }
589 /* next subband in alloc table */
590 j += 1 << bit_alloc_bits;
591 }
592 /* XXX: find a way to avoid this duplication of code */
597 int mant, scale0, scale1;
598 scale0 = scale_factors[0][
i][k];
599 scale1 = scale_factors[1][
i][k];
603 /* 3 values at the same time */
608 s->sb_samples[0][k * 12 + l + 0][
i] =
610 s->sb_samples[1][k * 12 + l + 0][
i] =
614 s->sb_samples[0][k * 12 + l + 1][
i] =
616 s->sb_samples[1][k * 12 + l + 1][
i] =
618 s->sb_samples[0][k * 12 + l + 2][
i] =
620 s->sb_samples[1][k * 12 + l + 2][
i] =
622 } else {
623 for (m = 0; m < 3; m++) {
625 s->sb_samples[0][k * 12 + l + m][
i] =
627 s->sb_samples[1][k * 12 + l + m][
i] =
629 }
630 }
631 } else {
632 s->sb_samples[0][k * 12 + l + 0][
i] = 0;
633 s->sb_samples[0][k * 12 + l + 1][
i] = 0;
634 s->sb_samples[0][k * 12 + l + 2][
i] = 0;
635 s->sb_samples[1][k * 12 + l + 0][
i] = 0;
636 s->sb_samples[1][k * 12 + l + 1][
i] = 0;
637 s->sb_samples[1][k * 12 + l + 2][
i] = 0;
638 }
639 /* next subband in alloc table */
640 j += 1 << bit_alloc_bits;
641 }
642 /* fill remaining samples to zero */
644 for (ch = 0; ch <
s->nb_channels; ch++) {
645 s->sb_samples[ch][k * 12 + l + 0][
i] = 0;
646 s->sb_samples[ch][k * 12 + l + 1][
i] = 0;
647 s->sb_samples[ch][k * 12 + l + 2][
i] = 0;
648 }
649 }
650 }
651 }
652 return 3 * 12;
653 }
654
655 #define SPLIT(dst,sf,n) \
656 if (n == 3) { \
657 int m = (sf * 171) >> 9; \
658 dst = sf - 3 * m; \
659 sf = m; \
660 } else if (n == 4) { \
661 dst = sf & 3; \
662 sf >>= 2; \
663 } else if (n == 5) { \
664 int m = (sf * 205) >> 10; \
665 dst = sf - 5 * m; \
666 sf = m; \
667 } else if (n == 6) { \
668 int m = (sf * 171) >> 10; \
669 dst = sf - 6 * m; \
670 sf = m; \
671 } else { \
672 dst = 0; \
673 }
674
676 int n3)
677 {
678 SPLIT(slen[3], sf, n3)
679 SPLIT(slen[2], sf, n2)
680 SPLIT(slen[1], sf, n1)
681 slen[0] = sf;
682 }
683
685 int16_t *exponents)
686 {
687 const uint8_t *bstab, *pretab;
688 int len,
i, j, k, l, v0,
shift, gain, gains[3];
689 int16_t *exp_ptr;
690
691 exp_ptr = exponents;
692 gain =
g->global_gain - 210;
693 shift =
g->scalefac_scale + 1;
694
697 for (
i = 0;
i <
g->long_end;
i++) {
698 v0 = gain - ((
g->scale_factors[
i] + pretab[
i]) <<
shift) + 400;
700 for (j =
len; j > 0; j--)
701 *exp_ptr++ = v0;
702 }
703
704 if (
g->short_start < 13) {
706 gains[0] = gain - (
g->subblock_gain[0] << 3);
707 gains[1] = gain - (
g->subblock_gain[1] << 3);
708 gains[2] = gain - (
g->subblock_gain[2] << 3);
710 for (
i =
g->short_start;
i < 13;
i++) {
712 for (l = 0; l < 3; l++) {
713 v0 = gains[l] - (
g->scale_factors[k++] <<
shift) + 400;
714 for (j =
len; j > 0; j--)
715 *exp_ptr++ = v0;
716 }
717 }
718 }
719 }
720
722 int *end_pos2)
723 {
724 if (
s->in_gb.buffer && *
pos >=
s->gb.size_in_bits -
s->extrasize * 8) {
726 s->in_gb.buffer =
NULL;
730 *end_pos2 =
733 }
734 }
735
736 /* Following is an optimized code for
737 INTFLOAT v = *src
738 if(get_bits1(&s->gb))
739 v = -v;
740 *dst = v;
741 */
742 #if USE_FLOATS
743 #define READ_FLIP_SIGN(dst,src) \
744 v = AV_RN32A(src) ^ (get_bits1(&s->gb) << 31); \
745 AV_WN32A(dst, v);
746 #else
747 #define READ_FLIP_SIGN(dst,src) \
748 v = -get_bits1(&s->gb); \
749 *(dst) = (*(src) ^ v) - v;
750 #endif
751
753 int16_t *exponents, int end_pos2)
754 {
755 int s_index;
759 int end_pos =
FFMIN(end_pos2,
s->gb.size_in_bits -
s->extrasize * 8);
760
761 /* low frequencies (called big values) */
762 s_index = 0;
763 for (
i = 0;
i < 3;
i++) {
765 int j, k, l, linbits;
766 j =
g->region_size[
i];
767 if (j == 0)
768 continue;
769 /* select vlc table */
770 k =
g->table_select[
i];
773
774 if (!l) {
775 memset(&
g->sb_hybrid[s_index], 0,
sizeof(*
g->sb_hybrid) * 2 * j);
776 s_index += 2 * j;
777 continue;
778 }
780
781 /* read huffcode and compute each couple */
782 for (; j > 0; j--) {
783 int exponent, x, y;
784 int v;
786
790 break;
791 }
793
794 if (!y) {
795 g->sb_hybrid[s_index ] =
796 g->sb_hybrid[s_index + 1] = 0;
797 s_index += 2;
798 continue;
799 }
800
801 exponent= exponents[s_index];
802
803 ff_dlog(
s->avctx,
"region=%d n=%d y=%d exp=%d\n",
804 i,
g->region_size[
i] - j, y, exponent);
805 if (y & 16) {
806 x = y >> 5;
807 y = y & 0x0f;
808 if (x < 15) {
810 } else {
814 v = -v;
815 g->sb_hybrid[s_index] = v;
816 }
817 if (y < 15) {
819 } else {
823 v = -v;
824 g->sb_hybrid[s_index + 1] = v;
825 }
826 } else {
827 x = y >> 5;
828 y = y & 0x0f;
829 x += y;
830 if (x < 15) {
832 } else {
836 v = -v;
837 g->sb_hybrid[s_index+!!y] = v;
838 }
839 g->sb_hybrid[s_index + !y] = 0;
840 }
841 s_index += 2;
842 }
843 }
844
845 /* high frequencies */
847 last_pos = 0;
848 while (s_index <= 572) {
851 if (
pos >= end_pos) {
852 if (
pos > end_pos2 && last_pos) {
853 /* some encoders generate an incorrect size for this
854 part. We must go back into the data */
855 s_index -= 4;
859 s_index=0;
860 break;
861 }
864 break;
865 }
867
869 ff_dlog(
s->avctx,
"t=%d code=%d\n",
g->count1table_select,
code);
870 g->sb_hybrid[s_index + 0] =
871 g->sb_hybrid[s_index + 1] =
872 g->sb_hybrid[s_index + 2] =
873 g->sb_hybrid[s_index + 3] = 0;
875 static const int idxtab[16] = { 3,3,2,2,1,1,1,1,0,0,0,0,0,0,0,0 };
876 int v;
877 int pos = s_index + idxtab[
code];
880 }
881 s_index += 4;
882 }
883 /* skip extension bits */
887 s_index=0;
890 s_index = 0;
891 }
892 memset(&
g->sb_hybrid[s_index], 0,
sizeof(*
g->sb_hybrid) * (576 - s_index));
894
897
898 return 0;
899 }
900
901 /* Reorder short blocks from bitstream order to interleaved order. It
902 would be faster to do it in parsing, but the code would be far more
903 complicated */
905 {
909
910 if (
g->block_type != 2)
911 return;
912
913 if (
g->switch_point) {
914 if (
s->sample_rate_index != 8)
915 ptr =
g->sb_hybrid + 36;
916 else
917 ptr =
g->sb_hybrid + 72;
918 } else {
920 }
921
922 for (
i =
g->short_start;
i < 13;
i++) {
924 ptr1 = ptr;
926 for (j =
len; j > 0; j--) {
930 ptr++;
931 }
933 memcpy(ptr1,
tmp,
len * 3 *
sizeof(*ptr1));
934 }
935 }
936
937 #define ISQRT2 FIXR(0.70710678118654752440)
938
940 {
942 int sf_max, sf,
len, non_zero_found;
946 int non_zero_found_short[3];
947
948 /* intensity stereo */
952 sf_max = 7;
953 } else {
955 sf_max = 16;
956 }
957
960
961 non_zero_found_short[0] = 0;
962 non_zero_found_short[1] = 0;
963 non_zero_found_short[2] = 0;
966 /* for last band, use previous scale factor */
968 k -= 3;
970 for (l = 2; l >= 0; l--) {
973 if (!non_zero_found_short[l]) {
974 /* test if non zero band. if so, stop doing i-stereo */
975 for (j = 0; j <
len; j++) {
977 non_zero_found_short[l] = 1;
978 goto found1;
979 }
980 }
982 if (sf >= sf_max)
983 goto found1;
984
985 v1 = is_tab[0][sf];
986 v2 = is_tab[1][sf];
987 for (j = 0; j <
len; j++) {
988 tmp0 = tab0[j];
991 }
992 } else {
993 found1:
995 /* lower part of the spectrum : do ms stereo
996 if enabled */
997 for (j = 0; j <
len; j++) {
998 tmp0 = tab0[j];
1002 }
1003 }
1004 }
1005 }
1006 }
1007
1008 non_zero_found = non_zero_found_short[0] |
1009 non_zero_found_short[1] |
1010 non_zero_found_short[2];
1011
1016 /* test if non zero band. if so, stop doing i-stereo */
1017 if (!non_zero_found) {
1018 for (j = 0; j <
len; j++) {
1020 non_zero_found = 1;
1021 goto found2;
1022 }
1023 }
1024 /* for last band, use previous scale factor */
1025 k = (
i == 21) ? 20 :
i;
1027 if (sf >= sf_max)
1028 goto found2;
1029 v1 = is_tab[0][sf];
1030 v2 = is_tab[1][sf];
1031 for (j = 0; j <
len; j++) {
1032 tmp0 = tab0[j];
1035 }
1036 } else {
1037 found2:
1039 /* lower part of the spectrum : do ms stereo
1040 if enabled */
1041 for (j = 0; j <
len; j++) {
1042 tmp0 = tab0[j];
1046 }
1047 }
1048 }
1049 }
1051 /* ms stereo ONLY */
1052 /* NOTE: the 1/sqrt(2) normalization factor is included in the
1053 global gain */
1054 #if USE_FLOATS
1056 #else
1059 for (
i = 0;
i < 576;
i++) {
1062 tab0[
i] = tmp0 + tmp1;
1063 tab1[
i] = tmp0 - tmp1;
1064 }
1065 #endif
1066 }
1067 }
1068
1069 #if USE_FLOATS
1070 #if HAVE_MIPSFPU
1072 #endif /* HAVE_MIPSFPU */
1073 #else
1074 #if HAVE_MIPSDSP
1076 #endif /* HAVE_MIPSDSP */
1077 #endif /* USE_FLOATS */
1078
1079 #ifndef compute_antialias
1080 #if USE_FLOATS
1081 #define AA(j) do { \
1082 float tmp0 = ptr[-1-j]; \
1083 float tmp1 = ptr[ j]; \
1084 ptr[-1-j] = tmp0 * csa_table[j][0] - tmp1 * csa_table[j][1]; \
1085 ptr[ j] = tmp0 * csa_table[j][1] + tmp1 * csa_table[j][0]; \
1086 } while (0)
1087 #else
1088 #define AA(j) do { \
1089 SUINT tmp0 = ptr[-1-j]; \
1090 SUINT tmp1 = ptr[ j]; \
1091 SUINT tmp2 = MULH(tmp0 + tmp1, csa_table[j][0]); \
1092 ptr[-1-j] = 4 * (tmp2 - MULH(tmp1, csa_table[j][2])); \
1093 ptr[ j] = 4 * (tmp2 + MULH(tmp0, csa_table[j][3])); \
1094 } while (0)
1095 #endif
1096
1098 {
1101
1102 /* we antialias only "long" bands */
1103 if (
g->block_type == 2) {
1104 if (!
g->switch_point)
1105 return;
1106 /* XXX: check this for 8000Hz case */
1107 n = 1;
1108 } else {
1110 }
1111
1112 ptr =
g->sb_hybrid + 18;
1113 for (
i = n;
i > 0;
i--) {
1122
1123 ptr += 18;
1124 }
1125 }
1126 #endif /* compute_antialias */
1127
1130 {
1133 int i, j, mdct_long_end, sblimit;
1134
1135 /* find last non zero block */
1136 ptr =
g->sb_hybrid + 576;
1137 ptr1 =
g->sb_hybrid + 2 * 18;
1138 while (ptr >= ptr1) {
1140 ptr -= 6;
1142 if (p[0] | p[1] | p[2] | p[3] | p[4] | p[5])
1143 break;
1144 }
1145 sblimit = ((ptr -
g->sb_hybrid) / 18) + 1;
1146
1147 if (
g->block_type == 2) {
1148 /* XXX: check for 8000 Hz */
1149 if (
g->switch_point)
1150 mdct_long_end = 2;
1151 else
1152 mdct_long_end = 0;
1153 } else {
1154 mdct_long_end = sblimit;
1155 }
1156
1157 s->mpadsp.RENAME(imdct36_blocks)(sb_samples, mdct_buf,
g->sb_hybrid,
1158 mdct_long_end,
g->switch_point,
1160
1161 buf = mdct_buf + 4*18*(mdct_long_end >> 2) + (mdct_long_end & 3);
1162 ptr =
g->sb_hybrid + 18 * mdct_long_end;
1163
1164 for (j = mdct_long_end; j < sblimit; j++) {
1165 /* select frequency inversion */
1166 win =
RENAME(ff_mdct_win)[2 + (4 & -(j & 1))];
1167 out_ptr = sb_samples + j;
1168
1169 for (
i = 0;
i < 6;
i++) {
1170 *out_ptr = buf[4*
i];
1172 }
1174 for (
i = 0;
i < 6;
i++) {
1175 *out_ptr =
MULH3(out2[
i ],
win[
i ], 1) + buf[4*(
i + 6*1)];
1176 buf[4*(
i + 6*2)] =
MULH3(out2[
i + 6],
win[
i + 6], 1);
1178 }
1180 for (
i = 0;
i < 6;
i++) {
1181 *out_ptr =
MULH3(out2[
i ],
win[
i ], 1) + buf[4*(
i + 6*2)];
1182 buf[4*(
i + 6*0)] =
MULH3(out2[
i + 6],
win[
i + 6], 1);
1184 }
1186 for (
i = 0;
i < 6;
i++) {
1187 buf[4*(
i + 6*0)] =
MULH3(out2[
i ],
win[
i ], 1) + buf[4*(
i + 6*0)];
1188 buf[4*(
i + 6*1)] =
MULH3(out2[
i + 6],
win[
i + 6], 1);
1189 buf[4*(
i + 6*2)] = 0;
1190 }
1191 ptr += 18;
1192 buf += (j&3) != 3 ? 1 : (4*18-3);
1193 }
1194 /* zero bands */
1195 for (j = sblimit; j <
SBLIMIT; j++) {
1196 /* overlap */
1197 out_ptr = sb_samples + j;
1198 for (
i = 0;
i < 18;
i++) {
1199 *out_ptr = buf[4*
i];
1202 }
1203 buf += (j&3) != 3 ? 1 : (4*18-3);
1204 }
1205 }
1206
1207 /* main layer3 decoding function */
1209 {
1210 int nb_granules, main_data_begin;
1211 int gr, ch, blocksplit_flag,
i, j, k, n, bits_pos;
1213 int16_t exponents[576]; //FIXME try INTFLOAT
1215
1216 /* read side info */
1221 nb_granules = 1;
1222 } else {
1225 if (
s->nb_channels == 2)
1227 else
1229 nb_granules = 2;
1230 for (ch = 0; ch <
s->nb_channels; ch++) {
1231 s->granules[ch][0].scfsi = 0;
/* all scale factors are transmitted */
1232 s->granules[ch][1].scfsi =
get_bits(&
s->gb, 4);
1233 }
1234 }
1237
1238 for (gr = 0; gr < nb_granules; gr++) {
1239 for (ch = 0; ch <
s->nb_channels; ch++) {
1240 ff_dlog(
s->avctx,
"gr=%d ch=%d: side_info\n", gr, ch);
1241 g = &
s->granules[ch][gr];
1244 if (
g->big_values > 288) {
1247 }
1248
1250 /* if MS stereo only is selected, we precompute the
1251 1/sqrt(2) renormalization factor */
1254 g->global_gain -= 2;
1257 else
1260 if (blocksplit_flag) {
1262 if (
g->block_type == 0) {
1265 }
1267 for (
i = 0;
i < 2;
i++)
1269 for (
i = 0;
i < 3;
i++)
1272 } else {
1273 int region_address1, region_address2;
1275 g->switch_point = 0;
1276 for (
i = 0;
i < 3;
i++)
1278 /* compute huffman coded region sizes */
1281 ff_dlog(
s->avctx,
"region1=%d region2=%d\n",
1282 region_address1, region_address2);
1284 }
1287
1293 ff_dlog(
s->avctx,
"block_type=%d switch_point=%d\n",
1294 g->block_type,
g->switch_point);
1295 }
1296 }
1297
1304 /* now we get bits from the main_data_begin offset */
1305 ff_dlog(
s->avctx,
"seekback:%d, lastbuf:%d\n",
1306 main_data_begin,
s->last_buf_size);
1307
1308 memcpy(
s->last_buf +
s->last_buf_size, ptr,
s->extrasize);
1311 s->last_buf_size <<= 3;
1312 for (gr = 0; gr < nb_granules && (
s->last_buf_size >> 3) < main_data_begin; gr++) {
1313 for (ch = 0; ch <
s->nb_channels; ch++) {
1314 g = &
s->granules[ch][gr];
1315 s->last_buf_size +=
g->part2_3_length;
1316 memset(
g->sb_hybrid, 0,
sizeof(
g->sb_hybrid));
1318 }
1319 }
1320 skip =
s->last_buf_size - 8 * main_data_begin;
1321 if (
skip >=
s->gb.size_in_bits -
s->extrasize * 8 &&
s->in_gb.buffer) {
1324 s->in_gb.buffer =
NULL;
1326 } else {
1328 }
1329 } else {
1330 gr = 0;
1332 }
1333
1334 for (; gr < nb_granules; gr++) {
1335 for (ch = 0; ch <
s->nb_channels; ch++) {
1336 g = &
s->granules[ch][gr];
1338
1340 uint8_t *sc;
1341 int slen, slen1, slen2;
1342
1343 /* MPEG-1 scale factors */
1346 ff_dlog(
s->avctx,
"slen1=%d slen2=%d\n", slen1, slen2);
1347 if (
g->block_type == 2) {
1348 n =
g->switch_point ? 17 : 18;
1349 j = 0;
1350 if (slen1) {
1351 for (
i = 0;
i < n;
i++)
1352 g->scale_factors[j++] =
get_bits(&
s->gb, slen1);
1353 } else {
1354 for (
i = 0;
i < n;
i++)
1355 g->scale_factors[j++] = 0;
1356 }
1357 if (slen2) {
1358 for (
i = 0;
i < 18;
i++)
1359 g->scale_factors[j++] =
get_bits(&
s->gb, slen2);
1360 for (
i = 0;
i < 3;
i++)
1361 g->scale_factors[j++] = 0;
1362 } else {
1363 for (
i = 0;
i < 21;
i++)
1364 g->scale_factors[j++] = 0;
1365 }
1366 } else {
1367 sc =
s->granules[ch][0].scale_factors;
1368 j = 0;
1369 for (k = 0; k < 4; k++) {
1370 n = k == 0 ? 6 : 5;
1371 if ((
g->scfsi & (0x8 >> k)) == 0) {
1372 slen = (k < 2) ? slen1 : slen2;
1373 if (slen) {
1374 for (
i = 0;
i < n;
i++)
1375 g->scale_factors[j++] =
get_bits(&
s->gb, slen);
1376 } else {
1377 for (
i = 0;
i < n;
i++)
1378 g->scale_factors[j++] = 0;
1379 }
1380 } else {
1381 /* simply copy from last granule */
1382 for (
i = 0;
i < n;
i++) {
1383 g->scale_factors[j] = sc[j];
1384 j++;
1385 }
1386 }
1387 }
1388 g->scale_factors[j++] = 0;
1389 }
1390 } else {
1391 int tindex, tindex2, slen[4], sl, sf;
1392
1393 /* LSF scale factors */
1394 if (
g->block_type == 2)
1395 tindex =
g->switch_point ? 2 : 1;
1396 else
1397 tindex = 0;
1398
1399 sf =
g->scalefac_compress;
1401 /* intensity stereo case */
1402 sf >>= 1;
1403 if (sf < 180) {
1405 tindex2 = 3;
1406 } else if (sf < 244) {
1408 tindex2 = 4;
1409 } else {
1411 tindex2 = 5;
1412 }
1413 } else {
1414 /* normal case */
1415 if (sf < 400) {
1417 tindex2 = 0;
1418 } else if (sf < 500) {
1420 tindex2 = 1;
1421 } else {
1423 tindex2 = 2;
1425 }
1426 }
1427
1428 j = 0;
1429 for (k = 0; k < 4; k++) {
1431 sl = slen[k];
1432 if (sl) {
1433 for (
i = 0;
i < n;
i++)
1434 g->scale_factors[j++] =
get_bits(&
s->gb, sl);
1435 } else {
1436 for (
i = 0;
i < n;
i++)
1437 g->scale_factors[j++] = 0;
1438 }
1439 }
1440 /* XXX: should compute exact size */
1441 for (; j < 40; j++)
1442 g->scale_factors[j] = 0;
1443 }
1444
1446
1447 /* read Huffman coded residue */
1449 } /* ch */
1450
1453
1454 for (ch = 0; ch <
s->nb_channels; ch++) {
1455 g = &
s->granules[ch][gr];
1456
1460 }
1461 } /* gr */
1464 return nb_granules * 18;
1465 }
1466
1468 const uint8_t *buf, int buf_size)
1469 {
1470 int i, nb_frames, ch,
ret;
1472
1474 if (
s->error_protection)
1476
1478 case 1:
1479 s->avctx->frame_size = 384;
1481 break;
1482 case 2:
1483 s->avctx->frame_size = 1152;
1485 break;
1486 case 3:
1487 s->avctx->frame_size =
s->lsf ? 576 : 1152;
1488 default:
1490
1492 if (
s->in_gb.buffer) {
1498 } else
1501 s->in_gb.buffer =
NULL;
1503 }
1504
1512 }
1513 av_assert1(i <= buf_size - HEADER_SIZE && i >= 0);
1514 memcpy(
s->last_buf +
s->last_buf_size,
s->gb.buffer + buf_size -
HEADER_SIZE -
i,
i);
1515 s->last_buf_size +=
i;
1516 }
1517
1518 if(nb_frames < 0)
1519 return nb_frames;
1520
1521 /* get output buffer */
1524 s->frame->nb_samples =
s->avctx->frame_size;
1528 }
1529
1530 /* apply the synthesis filter */
1531 for (ch = 0; ch <
s->nb_channels; ch++) {
1532 int sample_stride;
1535 sample_stride = 1;
1536 } else {
1537 samples_ptr =
samples[0] + ch;
1538 sample_stride =
s->nb_channels;
1539 }
1540 for (
i = 0;
i < nb_frames;
i++) {
1541 RENAME(ff_mpa_synth_filter)(&
s->mpadsp,
s->synth_buf[ch],
1542 &(
s->synth_buf_offset[ch]),
1543 RENAME(ff_mpa_synth_window),
1544 &
s->dither_state, samples_ptr,
1545 sample_stride,
s->sb_samples[ch][
i]);
1546 samples_ptr += 32 * sample_stride;
1547 }
1548 }
1549
1550 return nb_frames * 32 *
sizeof(
OUT_INT) *
s->nb_channels;
1551 }
1552
1554 int *got_frame_ptr,
AVPacket *avpkt)
1555 {
1556 const uint8_t *buf = avpkt->
data;
1557 int buf_size = avpkt->
size;
1561
1562 int skipped = 0;
1563 while(buf_size && !*buf){
1564 buf++;
1565 buf_size--;
1566 skipped++;
1567 }
1568
1571
1575 return buf_size + skipped;
1576 }
1581 }
else if (
ret == 1) {
1582 /* free format: prepare to compute frame size */
1585 }
1586 /* update codec info */
1592
1593 if (
s->frame_size <= 0) {
1596 }
else if (
s->frame_size < buf_size) {
1598 buf_size=
s->frame_size;
1599 }
1600
1602
1606 *got_frame_ptr = 1;
1608 //FIXME maybe move the other codec info stuff from above here too
1609 } else {
1611 /* Only return an error if the bad frame makes up the whole packet or
1612 * the error is related to buffer management.
1613 * If there is more data in the packet, just consume the bad frame
1614 * instead of returning an error, which would discard the whole
1615 * packet. */
1616 *got_frame_ptr = 0;
1619 }
1621 return buf_size + skipped;
1622 }
1623
1625 {
1626 memset(
ctx->synth_buf, 0,
sizeof(
ctx->synth_buf));
1627 memset(
ctx->mdct_buf, 0,
sizeof(
ctx->mdct_buf));
1628 ctx->last_buf_size = 0;
1629 ctx->dither_state = 0;
1630 }
1631
1633 {
1635 }
1636
1637 #if CONFIG_MP3ADU_DECODER || CONFIG_MP3ADUFLOAT_DECODER
1639 int *got_frame_ptr,
AVPacket *avpkt)
1640 {
1641 const uint8_t *buf = avpkt->
data;
1642 int buf_size = avpkt->
size;
1646
1648
1649 // Discard too short frames
1653 }
1654
1655
1658
1659 // Get header and restore sync word
1661
1666 }
1667 /* update codec info */
1674
1675 s->frame_size =
len;
1676
1678
1683 }
1684
1685 *got_frame_ptr = 1;
1686
1687 return buf_size;
1688 }
1689 #endif /* CONFIG_MP3ADU_DECODER || CONFIG_MP3ADUFLOAT_DECODER */
1690
1691 #if CONFIG_MP3ON4_DECODER || CONFIG_MP3ON4FLOAT_DECODER
1692
1693 /**
1694 * Context for MP3On4 decoder
1695 */
1696 typedef struct MP3On4DecodeContext {
1697 int frames;
///< number of mp3 frames per block (number of mp3 decoder instances)
1698 int syncword; ///< syncword patch
1699 const uint8_t *coff; ///< channel offsets in output buffer
1700 MPADecodeContext *mp3decctx[5];
///< MPADecodeContext for every decoder instance
1701 } MP3On4DecodeContext;
1702
1704
1705 /* Next 3 arrays are indexed by channel config number (passed via codecdata) */
1706
1707 /* number of mp3 decoder instances */
1708 static const uint8_t mp3Frames[8] = { 0, 1, 1, 2, 3, 3, 4, 5 };
1709
1710 /* offsets into output buffer, assume output order is FL FR C LFE BL BR SL SR */
1711 static const uint8_t chan_offset[8][5] = {
1712 { 0 },
1713 { 0 }, // C
1714 { 0 }, // FLR
1715 { 2, 0 }, // C FLR
1716 { 2, 0, 3 }, // C FLR BS
1717 { 2, 0, 3 }, // C FLR BLRS
1718 { 2, 0, 4, 3 }, // C FLR BLRS LFE
1719 { 2, 0, 6, 4, 3 }, // C FLR BLRS BLR LFE
1720 };
1721
1722 /* mp3on4 channel layouts */
1723 static const int16_t chan_layout[8] = {
1724 0,
1732 };
1733
1735 {
1738
1739 for (
i = 0;
i <
s->frames;
i++)
1741
1742 return 0;
1743 }
1744
1745
1747 {
1751
1755 }
1756
1762 }
1767
1769 s->syncword = 0xffe00000;
1770 else
1771 s->syncword = 0xfff00000;
1772
1773 /* Init the first mp3 decoder in standard way, so that all tables get builded
1774 * We replace avctx->priv_data with the context of the first decoder so that
1775 * decode_init() does not have to be changed.
1776 * Other decoders will be initialized here copying data from the first context
1777 */
1778 // Allocate zeroed memory for the first decoder context
1780 if (!
s->mp3decctx[0])
1782 // Put decoder context in place to make init_decode() happy
1785 // Restore mp3on4 context pointer
1789 s->mp3decctx[0]->adu_mode = 1;
// Set adu mode
1790
1791 /* Create a separate codec/context for each frame (first is already ok).
1792 * Each frame is 1 or 2 channels - up to 5 frames allowed
1793 */
1794 for (
i = 1;
i <
s->frames;
i++) {
1796 if (!
s->mp3decctx[
i])
1798 s->mp3decctx[
i]->adu_mode = 1;
1799 s->mp3decctx[
i]->avctx = avctx;
1800 s->mp3decctx[
i]->mpadsp =
s->mp3decctx[0]->mpadsp;
1801 s->mp3decctx[
i]->butterflies_float =
s->mp3decctx[0]->butterflies_float;
1802 }
1803
1804 return 0;
1805 }
1806
1807
1809 {
1812
1813 for (
i = 0;
i <
s->frames;
i++)
1815 }
1816
1817
1819 int *got_frame_ptr,
AVPacket *avpkt)
1820 {
1821 const uint8_t *buf = avpkt->
data;
1822 int buf_size = avpkt->
size;
1830
1831 /* get output buffer */
1836
1837 // Discard too short frames
1840
1842
1843 ch = 0;
1844 for (fr = 0; fr <
s->frames; fr++) {
1847 m =
s->mp3decctx[fr];
1849
1853 }
1854 header = (
AV_RB32(buf) & 0x000fffff) |
s->syncword;
// patch header
1855
1860 }
1861
1865 "channel count\n");
1867 }
1868 ch += m->nb_channels;
1869
1870 outptr[0] = out_samples[
s->coff[fr]];
1871 if (m->nb_channels > 1)
1872 outptr[1] = out_samples[
s->coff[fr] + 1];
1873
1877 if (m->nb_channels > 1)
1880 }
1881
1885
1887 }
1891 }
1892
1893 /* update codec info */
1895
1897 *got_frame_ptr = 1;
1898
1899 return buf_size;
1900 }
1901 #endif /* CONFIG_MP3ON4_DECODER || CONFIG_MP3ON4FLOAT_DECODER */