falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
26705 Commits
32 Branches
296MB
Tree: f51aeedd41
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'f51aeedd41'
${ noResults }
FFmpeg/libavcodec/ac3enc.c

1427 lines
42KB
Raw Blame History 

  1. /*

  2.  * The simplest AC-3 encoder

  3.  * Copyright (c) 2000 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.  * The simplest AC-3 encoder.

  25.  */

  26. //#define DEBUG

  27. //#define DEBUG_BITALLOC

  28. #include "libavcore/audioconvert.h"

  29. #include "libavutil/crc.h"

  30. #include "avcodec.h"

  31. #include "libavutil/common.h" /* for av_reverse */

  32. #include "put_bits.h"

  33. #include "ac3.h"

  34. #include "audioconvert.h"

  35. 

  36. typedef struct AC3EncodeContext {

  37.     PutBitContext pb;

  38.     int nb_channels;

  39.     int nb_all_channels;

  40.     int lfe_channel;

  41.     const uint8_t *channel_map;

  42.     int bit_rate;

  43.     unsigned int sample_rate;

  44.     unsigned int bitstream_id;

  45.     unsigned int frame_size_min; /* minimum frame size in case rounding is necessary */

  46.     unsigned int frame_size; /* current frame size in words */

  47.     unsigned int bits_written;

  48.     unsigned int samples_written;

  49.     int sr_shift;

  50.     unsigned int frame_size_code;

  51.     unsigned int sr_code; /* frequency */

  52.     unsigned int channel_mode;

  53.     int lfe;

  54.     unsigned int bitstream_mode;

  55.     short last_samples[AC3_MAX_CHANNELS][256];

  56.     unsigned int chbwcod[AC3_MAX_CHANNELS];

  57.     int nb_coefs[AC3_MAX_CHANNELS];

  58. 

  59.     /* bitrate allocation control */

  60.     int slow_gain_code, slow_decay_code, fast_decay_code, db_per_bit_code, floor_code;

  61.     AC3BitAllocParameters bit_alloc;

  62.     int coarse_snr_offset;

  63.     int fast_gain_code[AC3_MAX_CHANNELS];

  64.     int fine_snr_offset[AC3_MAX_CHANNELS];

  65.     /* mantissa encoding */

  66.     int mant1_cnt, mant2_cnt, mant4_cnt;

  67. } AC3EncodeContext;

  68. 

  69. static int16_t costab[64];

  70. static int16_t sintab[64];

  71. static int16_t xcos1[128];

  72. static int16_t xsin1[128];

  73. 

  74. #define MDCT_NBITS 9

  75. #define N         (1 << MDCT_NBITS)

  76. 

  77. /* new exponents are sent if their Norm 1 exceed this number */

  78. #define EXP_DIFF_THRESHOLD 1000

  79. 

  80. static inline int16_t fix15(float a)

  81. {

  82.     int v;

  83.     v = (int)(a * (float)(1 << 15));

  84.     if (v < -32767)

  85.         v = -32767;

  86.     else if (v > 32767)

  87.         v = 32767;

  88.     return v;

  89. }

  90. 

  91. typedef struct IComplex {

  92.     short re,im;

  93. } IComplex;

  94. 

  95. static av_cold void fft_init(int ln)

  96. {

  97.     int i, n;

  98.     float alpha;

  99. 

  100.     n = 1 << ln;

  101. 

  102.     for(i=0;i<(n/2);i++) {

  103.         alpha = 2 * M_PI * (float)i / (float)n;

  104.         costab[i] = fix15(cos(alpha));

  105.         sintab[i] = fix15(sin(alpha));

  106.     }

  107. }

  108. 

  109. /* butter fly op */

  110. #define BF(pre, pim, qre, qim, pre1, pim1, qre1, qim1) \

  111. {\

  112.   int ax, ay, bx, by;\

  113.   bx=pre1;\

  114.   by=pim1;\

  115.   ax=qre1;\

  116.   ay=qim1;\

  117.   pre = (bx + ax) >> 1;\

  118.   pim = (by + ay) >> 1;\

  119.   qre = (bx - ax) >> 1;\

  120.   qim = (by - ay) >> 1;\

  121. }

  122. 

  123. #define CMUL(pre, pim, are, aim, bre, bim) \

  124. {\

  125.    pre = (MUL16(are, bre) - MUL16(aim, bim)) >> 15;\

  126.    pim = (MUL16(are, bim) + MUL16(bre, aim)) >> 15;\

  127. }

  128. 

  129. 

  130. /* do a 2^n point complex fft on 2^ln points. */

  131. static void fft(IComplex *z, int ln)

  132. {

  133.     int        j, l, np, np2;

  134.     int        nblocks, nloops;

  135.     register IComplex *p,*q;

  136.     int tmp_re, tmp_im;

  137. 

  138.     np = 1 << ln;

  139. 

  140.     /* reverse */

  141.     for(j=0;j<np;j++) {

  142.         int k = av_reverse[j] >> (8 - ln);

  143.         if (k < j)

  144.             FFSWAP(IComplex, z[k], z[j]);

  145.     }

  146. 

  147.     /* pass 0 */

  148. 

  149.     p=&z[0];

  150.     j=(np >> 1);

  151.     do {

  152.         BF(p[0].re, p[0].im, p[1].re, p[1].im,

  153.            p[0].re, p[0].im, p[1].re, p[1].im);

  154.         p+=2;

  155.     } while (--j != 0);

  156. 

  157.     /* pass 1 */

  158. 

  159.     p=&z[0];

  160.     j=np >> 2;

  161.     do {

  162.         BF(p[0].re, p[0].im, p[2].re, p[2].im,

  163.            p[0].re, p[0].im, p[2].re, p[2].im);

  164.         BF(p[1].re, p[1].im, p[3].re, p[3].im,

  165.            p[1].re, p[1].im, p[3].im, -p[3].re);

  166.         p+=4;

  167.     } while (--j != 0);

  168. 

  169.     /* pass 2 .. ln-1 */

  170. 

  171.     nblocks = np >> 3;

  172.     nloops = 1 << 2;

  173.     np2 = np >> 1;

  174.     do {

  175.         p = z;

  176.         q = z + nloops;

  177.         for (j = 0; j < nblocks; ++j) {

  178. 

  179.             BF(p->re, p->im, q->re, q->im,

  180.                p->re, p->im, q->re, q->im);

  181. 

  182.             p++;

  183.             q++;

  184.             for(l = nblocks; l < np2; l += nblocks) {

  185.                 CMUL(tmp_re, tmp_im, costab[l], -sintab[l], q->re, q->im);

  186.                 BF(p->re, p->im, q->re, q->im,

  187.                    p->re, p->im, tmp_re, tmp_im);

  188.                 p++;

  189.                 q++;

  190.             }

  191.             p += nloops;

  192.             q += nloops;

  193.         }

  194.         nblocks = nblocks >> 1;

  195.         nloops = nloops << 1;

  196.     } while (nblocks != 0);

  197. }

  198. 

  199. /* do a 512 point mdct */

  200. static void mdct512(int32_t *out, int16_t *in)

  201. {

  202.     int i, re, im, re1, im1;

  203.     int16_t rot[N];

  204.     IComplex x[N/4];

  205. 

  206.     /* shift to simplify computations */

  207.     for(i=0;i<N/4;i++)

  208.         rot[i] = -in[i + 3*N/4];

  209.     for(i=N/4;i<N;i++)

  210.         rot[i] = in[i - N/4];

  211. 

  212.     /* pre rotation */

  213.     for(i=0;i<N/4;i++) {

  214.         re = ((int)rot[2*i] - (int)rot[N-1-2*i]) >> 1;

  215.         im = -((int)rot[N/2+2*i] - (int)rot[N/2-1-2*i]) >> 1;

  216.         CMUL(x[i].re, x[i].im, re, im, -xcos1[i], xsin1[i]);

  217.     }

  218. 

  219.     fft(x, MDCT_NBITS - 2);

  220. 

  221.     /* post rotation */

  222.     for(i=0;i<N/4;i++) {

  223.         re = x[i].re;

  224.         im = x[i].im;

  225.         CMUL(re1, im1, re, im, xsin1[i], xcos1[i]);

  226.         out[2*i] = im1;

  227.         out[N/2-1-2*i] = re1;

  228.     }

  229. }

  230. 

  231. /* XXX: use another norm ? */

  232. static int calc_exp_diff(uint8_t *exp1, uint8_t *exp2, int n)

  233. {

  234.     int sum, i;

  235.     sum = 0;

  236.     for(i=0;i<n;i++) {

  237.         sum += abs(exp1[i] - exp2[i]);

  238.     }

  239.     return sum;

  240. }

  241. 

  242. static void compute_exp_strategy(uint8_t exp_strategy[NB_BLOCKS][AC3_MAX_CHANNELS],

  243.                                  uint8_t exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  244.                                  int ch, int is_lfe)

  245. {

  246.     int i, j;

  247.     int exp_diff;

  248. 

  249.     /* estimate if the exponent variation & decide if they should be

  250.        reused in the next frame */

  251.     exp_strategy[0][ch] = EXP_NEW;

  252.     for(i=1;i<NB_BLOCKS;i++) {

  253.         exp_diff = calc_exp_diff(exp[i][ch], exp[i-1][ch], N/2);

  254.         dprintf(NULL, "exp_diff=%d\n", exp_diff);

  255.         if (exp_diff > EXP_DIFF_THRESHOLD)

  256.             exp_strategy[i][ch] = EXP_NEW;

  257.         else

  258.             exp_strategy[i][ch] = EXP_REUSE;

  259.     }

  260.     if (is_lfe)

  261.         return;

  262. 

  263.     /* now select the encoding strategy type : if exponents are often

  264.        recoded, we use a coarse encoding */

  265.     i = 0;

  266.     while (i < NB_BLOCKS) {

  267.         j = i + 1;

  268.         while (j < NB_BLOCKS && exp_strategy[j][ch] == EXP_REUSE)

  269.             j++;

  270.         switch(j - i) {

  271.         case 1:

  272.             exp_strategy[i][ch] = EXP_D45;

  273.             break;

  274.         case 2:

  275.         case 3:

  276.             exp_strategy[i][ch] = EXP_D25;

  277.             break;

  278.         default:

  279.             exp_strategy[i][ch] = EXP_D15;

  280.             break;

  281.         }

  282.         i = j;

  283.     }

  284. }

  285. 

  286. /* set exp[i] to min(exp[i], exp1[i]) */

  287. static void exponent_min(uint8_t exp[N/2], uint8_t exp1[N/2], int n)

  288. {

  289.     int i;

  290. 

  291.     for(i=0;i<n;i++) {

  292.         if (exp1[i] < exp[i])

  293.             exp[i] = exp1[i];

  294.     }

  295. }

  296. 

  297. /* update the exponents so that they are the ones the decoder will

  298.    decode. Return the number of bits used to code the exponents */

  299. static int encode_exp(uint8_t encoded_exp[N/2],

  300.                       uint8_t exp[N/2],

  301.                       int nb_exps,

  302.                       int exp_strategy)

  303. {

  304.     int group_size, nb_groups, i, j, k, exp_min;

  305.     uint8_t exp1[N/2];

  306. 

  307.     switch(exp_strategy) {

  308.     case EXP_D15:

  309.         group_size = 1;

  310.         break;

  311.     case EXP_D25:

  312.         group_size = 2;

  313.         break;

  314.     default:

  315.     case EXP_D45:

  316.         group_size = 4;

  317.         break;

  318.     }

  319.     nb_groups = ((nb_exps + (group_size * 3) - 4) / (3 * group_size)) * 3;

  320. 

  321.     /* for each group, compute the minimum exponent */

  322.     exp1[0] = exp[0]; /* DC exponent is handled separately */

  323.     k = 1;

  324.     for(i=1;i<=nb_groups;i++) {

  325.         exp_min = exp[k];

  326.         assert(exp_min >= 0 && exp_min <= 24);

  327.         for(j=1;j<group_size;j++) {

  328.             if (exp[k+j] < exp_min)

  329.                 exp_min = exp[k+j];

  330.         }

  331.         exp1[i] = exp_min;

  332.         k += group_size;

  333.     }

  334. 

  335.     /* constraint for DC exponent */

  336.     if (exp1[0] > 15)

  337.         exp1[0] = 15;

  338. 

  339.     /* Decrease the delta between each groups to within 2

  340.      * so that they can be differentially encoded */

  341.     for (i=1;i<=nb_groups;i++)

  342.         exp1[i] = FFMIN(exp1[i], exp1[i-1] + 2);

  343.     for (i=nb_groups-1;i>=0;i--)

  344.         exp1[i] = FFMIN(exp1[i], exp1[i+1] + 2);

  345. 

  346.     /* now we have the exponent values the decoder will see */

  347.     encoded_exp[0] = exp1[0];

  348.     k = 1;

  349.     for(i=1;i<=nb_groups;i++) {

  350.         for(j=0;j<group_size;j++) {

  351.             encoded_exp[k+j] = exp1[i];

  352.         }

  353.         k += group_size;

  354.     }

  355. 

  356. #if defined(DEBUG)

  357.     av_log(NULL, AV_LOG_DEBUG, "exponents: strategy=%d\n", exp_strategy);

  358.     for(i=0;i<=nb_groups * group_size;i++) {

  359.         av_log(NULL, AV_LOG_DEBUG, "%d ", encoded_exp[i]);

  360.     }

  361.     av_log(NULL, AV_LOG_DEBUG, "\n");

  362. #endif

  363. 

  364.     return 4 + (nb_groups / 3) * 7;

  365. }

  366. 

  367. /* return the size in bits taken by the mantissa */

  368. static int compute_mantissa_size(AC3EncodeContext *s, uint8_t *m, int nb_coefs)

  369. {

  370.     int bits, mant, i;

  371. 

  372.     bits = 0;

  373.     for(i=0;i<nb_coefs;i++) {

  374.         mant = m[i];

  375.         switch(mant) {

  376.         case 0:

  377.             /* nothing */

  378.             break;

  379.         case 1:

  380.             /* 3 mantissa in 5 bits */

  381.             if (s->mant1_cnt == 0)

  382.                 bits += 5;

  383.             if (++s->mant1_cnt == 3)

  384.                 s->mant1_cnt = 0;

  385.             break;

  386.         case 2:

  387.             /* 3 mantissa in 7 bits */

  388.             if (s->mant2_cnt == 0)

  389.                 bits += 7;

  390.             if (++s->mant2_cnt == 3)

  391.                 s->mant2_cnt = 0;

  392.             break;

  393.         case 3:

  394.             bits += 3;

  395.             break;

  396.         case 4:

  397.             /* 2 mantissa in 7 bits */

  398.             if (s->mant4_cnt == 0)

  399.                 bits += 7;

  400.             if (++s->mant4_cnt == 2)

  401.                 s->mant4_cnt = 0;

  402.             break;

  403.         case 14:

  404.             bits += 14;

  405.             break;

  406.         case 15:

  407.             bits += 16;

  408.             break;

  409.         default:

  410.             bits += mant - 1;

  411.             break;

  412.         }

  413.     }

  414.     return bits;

  415. }

  416. 

  417. 

  418. static void bit_alloc_masking(AC3EncodeContext *s,

  419.                               uint8_t encoded_exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  420.                               uint8_t exp_strategy[NB_BLOCKS][AC3_MAX_CHANNELS],

  421.                               int16_t psd[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  422.                               int16_t mask[NB_BLOCKS][AC3_MAX_CHANNELS][50])

  423. {

  424.     int blk, ch;

  425.     int16_t band_psd[NB_BLOCKS][AC3_MAX_CHANNELS][50];

  426. 

  427.     for(blk=0; blk<NB_BLOCKS; blk++) {

  428.         for(ch=0;ch<s->nb_all_channels;ch++) {

  429.             if(exp_strategy[blk][ch] == EXP_REUSE) {

  430.                 memcpy(psd[blk][ch], psd[blk-1][ch], (N/2)*sizeof(int16_t));

  431.                 memcpy(mask[blk][ch], mask[blk-1][ch], 50*sizeof(int16_t));

  432.             } else {

  433.                 ff_ac3_bit_alloc_calc_psd(encoded_exp[blk][ch], 0,

  434.                                           s->nb_coefs[ch],

  435.                                           psd[blk][ch], band_psd[blk][ch]);

  436.                 ff_ac3_bit_alloc_calc_mask(&s->bit_alloc, band_psd[blk][ch],

  437.                                            0, s->nb_coefs[ch],

  438.                                            ff_ac3_fast_gain_tab[s->fast_gain_code[ch]],

  439.                                            ch == s->lfe_channel,

  440.                                            DBA_NONE, 0, NULL, NULL, NULL,

  441.                                            mask[blk][ch]);

  442.             }

  443.         }

  444.     }

  445. }

  446. 

  447. static int bit_alloc(AC3EncodeContext *s,

  448.                      int16_t mask[NB_BLOCKS][AC3_MAX_CHANNELS][50],

  449.                      int16_t psd[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  450.                      uint8_t bap[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  451.                      int frame_bits, int coarse_snr_offset, int fine_snr_offset)

  452. {

  453.     int i, ch;

  454.     int snr_offset;

  455. 

  456.     snr_offset = (((coarse_snr_offset - 15) << 4) + fine_snr_offset) << 2;

  457. 

  458.     /* compute size */

  459.     for(i=0;i<NB_BLOCKS;i++) {

  460.         s->mant1_cnt = 0;

  461.         s->mant2_cnt = 0;

  462.         s->mant4_cnt = 0;

  463.         for(ch=0;ch<s->nb_all_channels;ch++) {

  464.             ff_ac3_bit_alloc_calc_bap(mask[i][ch], psd[i][ch], 0,

  465.                                       s->nb_coefs[ch], snr_offset,

  466.                                       s->bit_alloc.floor, ff_ac3_bap_tab,

  467.                                       bap[i][ch]);

  468.             frame_bits += compute_mantissa_size(s, bap[i][ch],

  469.                                                  s->nb_coefs[ch]);

  470.         }

  471.     }

  472. #if 0

  473.     printf("csnr=%d fsnr=%d frame_bits=%d diff=%d\n",

  474.            coarse_snr_offset, fine_snr_offset, frame_bits,

  475.            16 * s->frame_size - ((frame_bits + 7) & ~7));

  476. #endif

  477.     return 16 * s->frame_size - frame_bits;

  478. }

  479. 

  480. #define SNR_INC1 4

  481. 

  482. static int compute_bit_allocation(AC3EncodeContext *s,

  483.                                   uint8_t bap[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  484.                                   uint8_t encoded_exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],

  485.                                   uint8_t exp_strategy[NB_BLOCKS][AC3_MAX_CHANNELS],

  486.                                   int frame_bits)

  487. {

  488.     int i, ch;

  489.     int coarse_snr_offset, fine_snr_offset;

  490.     uint8_t bap1[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];

  491.     int16_t psd[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];

  492.     int16_t mask[NB_BLOCKS][AC3_MAX_CHANNELS][50];

  493.     static const int frame_bits_inc[8] = { 0, 0, 2, 2, 2, 4, 2, 4 };

  494. 

  495.     /* init default parameters */

  496.     s->slow_decay_code = 2;

  497.     s->fast_decay_code = 1;

  498.     s->slow_gain_code = 1;

  499.     s->db_per_bit_code = 2;

  500.     s->floor_code = 4;

  501.     for(ch=0;ch<s->nb_all_channels;ch++)

  502.         s->fast_gain_code[ch] = 4;

  503. 

  504.     /* compute real values */

  505.     s->bit_alloc.sr_code = s->sr_code;

  506.     s->bit_alloc.sr_shift = s->sr_shift;

  507.     s->bit_alloc.slow_decay = ff_ac3_slow_decay_tab[s->slow_decay_code] >> s->sr_shift;

  508.     s->bit_alloc.fast_decay = ff_ac3_fast_decay_tab[s->fast_decay_code] >> s->sr_shift;

  509.     s->bit_alloc.slow_gain = ff_ac3_slow_gain_tab[s->slow_gain_code];

  510.     s->bit_alloc.db_per_bit = ff_ac3_db_per_bit_tab[s->db_per_bit_code];

  511.     s->bit_alloc.floor = ff_ac3_floor_tab[s->floor_code];

  512. 

  513.     /* header size */

  514.     frame_bits += 65;

  515.     // if (s->channel_mode == 2)

  516.     //    frame_bits += 2;

  517.     frame_bits += frame_bits_inc[s->channel_mode];

  518. 

  519.     /* audio blocks */

  520.     for(i=0;i<NB_BLOCKS;i++) {

  521.         frame_bits += s->nb_channels * 2 + 2; /* blksw * c, dithflag * c, dynrnge, cplstre */

  522.         if (s->channel_mode == AC3_CHMODE_STEREO) {

  523.             frame_bits++; /* rematstr */

  524.             if(i==0) frame_bits += 4;

  525.         }

  526.         frame_bits += 2 * s->nb_channels; /* chexpstr[2] * c */

  527.         if (s->lfe)

  528.             frame_bits++; /* lfeexpstr */

  529.         for(ch=0;ch<s->nb_channels;ch++) {

  530.             if (exp_strategy[i][ch] != EXP_REUSE)

  531.                 frame_bits += 6 + 2; /* chbwcod[6], gainrng[2] */

  532.         }

  533.         frame_bits++; /* baie */

  534.         frame_bits++; /* snr */

  535.         frame_bits += 2; /* delta / skip */

  536.     }

  537.     frame_bits++; /* cplinu for block 0 */

  538.     /* bit alloc info */

  539.     /* sdcycod[2], fdcycod[2], sgaincod[2], dbpbcod[2], floorcod[3] */

  540.     /* csnroffset[6] */

  541.     /* (fsnoffset[4] + fgaincod[4]) * c */

  542.     frame_bits += 2*4 + 3 + 6 + s->nb_all_channels * (4 + 3);

  543. 

  544.     /* auxdatae, crcrsv */

  545.     frame_bits += 2;

  546. 

  547.     /* CRC */

  548.     frame_bits += 16;

  549. 

  550.     /* calculate psd and masking curve before doing bit allocation */

  551.     bit_alloc_masking(s, encoded_exp, exp_strategy, psd, mask);

  552. 

  553.     /* now the big work begins : do the bit allocation. Modify the snr

  554.        offset until we can pack everything in the requested frame size */

  555. 

  556.     coarse_snr_offset = s->coarse_snr_offset;

  557.     while (coarse_snr_offset >= 0 &&

  558.            bit_alloc(s, mask, psd, bap, frame_bits, coarse_snr_offset, 0) < 0)

  559.         coarse_snr_offset -= SNR_INC1;

  560.     if (coarse_snr_offset < 0) {

  561.         av_log(NULL, AV_LOG_ERROR, "Bit allocation failed. Try increasing the bitrate.\n");

  562.         return -1;

  563.     }

  564.     while ((coarse_snr_offset + SNR_INC1) <= 63 &&

  565.            bit_alloc(s, mask, psd, bap1, frame_bits,

  566.                      coarse_snr_offset + SNR_INC1, 0) >= 0) {

  567.         coarse_snr_offset += SNR_INC1;

  568.         memcpy(bap, bap1, sizeof(bap1));

  569.     }

  570.     while ((coarse_snr_offset + 1) <= 63 &&

  571.            bit_alloc(s, mask, psd, bap1, frame_bits, coarse_snr_offset + 1, 0) >= 0) {

  572.         coarse_snr_offset++;

  573.         memcpy(bap, bap1, sizeof(bap1));

  574.     }

  575. 

  576.     fine_snr_offset = 0;

  577.     while ((fine_snr_offset + SNR_INC1) <= 15 &&

  578.            bit_alloc(s, mask, psd, bap1, frame_bits,

  579.                      coarse_snr_offset, fine_snr_offset + SNR_INC1) >= 0) {

  580.         fine_snr_offset += SNR_INC1;

  581.         memcpy(bap, bap1, sizeof(bap1));

  582.     }

  583.     while ((fine_snr_offset + 1) <= 15 &&

  584.            bit_alloc(s, mask, psd, bap1, frame_bits,

  585.                      coarse_snr_offset, fine_snr_offset + 1) >= 0) {

  586.         fine_snr_offset++;

  587.         memcpy(bap, bap1, sizeof(bap1));

  588.     }

  589. 

  590.     s->coarse_snr_offset = coarse_snr_offset;

  591.     for(ch=0;ch<s->nb_all_channels;ch++)

  592.         s->fine_snr_offset[ch] = fine_snr_offset;

  593. #if defined(DEBUG_BITALLOC)

  594.     {

  595.         int j;

  596. 

  597.         for(i=0;i<6;i++) {

  598.             for(ch=0;ch<s->nb_all_channels;ch++) {

  599.                 printf("Block #%d Ch%d:\n", i, ch);

  600.                 printf("bap=");

  601.                 for(j=0;j<s->nb_coefs[ch];j++) {

  602.                     printf("%d ",bap[i][ch][j]);

  603.                 }

  604.                 printf("\n");

  605.             }

  606.         }

  607.     }

  608. #endif

  609.     return 0;

  610. }

  611. 

  612. static av_cold int set_channel_info(AC3EncodeContext *s, int channels,

  613.                                     int64_t *channel_layout)

  614. {

  615.     int ch_layout;

  616. 

  617.     if (channels < 1 || channels > AC3_MAX_CHANNELS)

  618.         return -1;

  619.     if ((uint64_t)*channel_layout > 0x7FF)

  620.         return -1;

  621.     ch_layout = *channel_layout;

  622.     if (!ch_layout)

  623.         ch_layout = avcodec_guess_channel_layout(channels, CODEC_ID_AC3, NULL);

  624.     if (av_get_channel_layout_nb_channels(ch_layout) != channels)

  625.         return -1;

  626. 

  627.     s->lfe = !!(ch_layout & AV_CH_LOW_FREQUENCY);

  628.     s->nb_all_channels = channels;

  629.     s->nb_channels = channels - s->lfe;

  630.     s->lfe_channel = s->lfe ? s->nb_channels : -1;

  631.     if (s->lfe)

  632.         ch_layout -= AV_CH_LOW_FREQUENCY;

  633. 

  634.     switch (ch_layout) {

  635.     case AV_CH_LAYOUT_MONO:           s->channel_mode = AC3_CHMODE_MONO;   break;

  636.     case AV_CH_LAYOUT_STEREO:         s->channel_mode = AC3_CHMODE_STEREO; break;

  637.     case AV_CH_LAYOUT_SURROUND:       s->channel_mode = AC3_CHMODE_3F;     break;

  638.     case AV_CH_LAYOUT_2_1:            s->channel_mode = AC3_CHMODE_2F1R;   break;

  639.     case AV_CH_LAYOUT_4POINT0:        s->channel_mode = AC3_CHMODE_3F1R;   break;

  640.     case AV_CH_LAYOUT_QUAD:

  641.     case AV_CH_LAYOUT_2_2:            s->channel_mode = AC3_CHMODE_2F2R;   break;

  642.     case AV_CH_LAYOUT_5POINT0:

  643.     case AV_CH_LAYOUT_5POINT0_BACK:   s->channel_mode = AC3_CHMODE_3F2R;   break;

  644.     default:

  645.         return -1;

  646.     }

  647. 

  648.     s->channel_map = ff_ac3_enc_channel_map[s->channel_mode][s->lfe];

  649.     *channel_layout = ch_layout;

  650.     if (s->lfe)

  651.         *channel_layout |= AV_CH_LOW_FREQUENCY;

  652. 

  653.     return 0;

  654. }

  655. 

  656. static av_cold int AC3_encode_init(AVCodecContext *avctx)

  657. {

  658.     int freq = avctx->sample_rate;

  659.     int bitrate = avctx->bit_rate;

  660.     AC3EncodeContext *s = avctx->priv_data;

  661.     int i, j, ch;

  662.     float alpha;

  663.     int bw_code;

  664. 

  665.     avctx->frame_size = AC3_FRAME_SIZE;

  666. 

  667.     ac3_common_init();

  668. 

  669.     if (!avctx->channel_layout) {

  670.         av_log(avctx, AV_LOG_WARNING, "No channel layout specified. The "

  671.                                       "encoder will guess the layout, but it "

  672.                                       "might be incorrect.\n");

  673.     }

  674.     if (set_channel_info(s, avctx->channels, &avctx->channel_layout)) {

  675.         av_log(avctx, AV_LOG_ERROR, "invalid channel layout\n");

  676.         return -1;

  677.     }

  678. 

  679.     /* frequency */

  680.     for(i=0;i<3;i++) {

  681.         for(j=0;j<3;j++)

  682.             if ((ff_ac3_sample_rate_tab[j] >> i) == freq)

  683.                 goto found;

  684.     }

  685.     return -1;

  686.  found:

  687.     s->sample_rate = freq;

  688.     s->sr_shift = i;

  689.     s->sr_code = j;

  690.     s->bitstream_id = 8 + s->sr_shift;

  691.     s->bitstream_mode = 0; /* complete main audio service */

  692. 

  693.     /* bitrate & frame size */

  694.     for(i=0;i<19;i++) {

  695.         if ((ff_ac3_bitrate_tab[i] >> s->sr_shift)*1000 == bitrate)

  696.             break;

  697.     }

  698.     if (i == 19)

  699.         return -1;

  700.     s->bit_rate = bitrate;

  701.     s->frame_size_code = i << 1;

  702.     s->frame_size_min = ff_ac3_frame_size_tab[s->frame_size_code][s->sr_code];

  703.     s->bits_written = 0;

  704.     s->samples_written = 0;

  705.     s->frame_size = s->frame_size_min;

  706. 

  707.     /* bit allocation init */

  708.     if(avctx->cutoff) {

  709.         /* calculate bandwidth based on user-specified cutoff frequency */

  710.         int cutoff = av_clip(avctx->cutoff, 1, s->sample_rate >> 1);

  711.         int fbw_coeffs = cutoff * 512 / s->sample_rate;

  712.         bw_code = av_clip((fbw_coeffs - 73) / 3, 0, 60);

  713.     } else {

  714.         /* use default bandwidth setting */

  715.         /* XXX: should compute the bandwidth according to the frame

  716.            size, so that we avoid annoying high frequency artifacts */

  717.         bw_code = 50;

  718.     }

  719.     for(ch=0;ch<s->nb_channels;ch++) {

  720.         /* bandwidth for each channel */

  721.         s->chbwcod[ch] = bw_code;

  722.         s->nb_coefs[ch] = bw_code * 3 + 73;

  723.     }

  724.     if (s->lfe) {

  725.         s->nb_coefs[s->lfe_channel] = 7; /* fixed */

  726.     }

  727.     /* initial snr offset */

  728.     s->coarse_snr_offset = 40;

  729. 

  730.     /* mdct init */

  731.     fft_init(MDCT_NBITS - 2);

  732.     for(i=0;i<N/4;i++) {

  733.         alpha = 2 * M_PI * (i + 1.0 / 8.0) / (float)N;

  734.         xcos1[i] = fix15(-cos(alpha));

  735.         xsin1[i] = fix15(-sin(alpha));

  736.     }

  737. 

  738.     avctx->coded_frame= avcodec_alloc_frame();

  739.     avctx->coded_frame->key_frame= 1;

  740. 

  741.     return 0;

  742. }

  743. 

  744. /* output the AC-3 frame header */

  745. static void output_frame_header(AC3EncodeContext *s, unsigned char *frame)

  746. {

  747.     init_put_bits(&s->pb, frame, AC3_MAX_CODED_FRAME_SIZE);

  748. 

  749.     put_bits(&s->pb, 16, 0x0b77); /* frame header */

  750.     put_bits(&s->pb, 16, 0); /* crc1: will be filled later */

  751.     put_bits(&s->pb, 2, s->sr_code);

  752.     put_bits(&s->pb, 6, s->frame_size_code + (s->frame_size - s->frame_size_min));

  753.     put_bits(&s->pb, 5, s->bitstream_id);

  754.     put_bits(&s->pb, 3, s->bitstream_mode);

  755.     put_bits(&s->pb, 3, s->channel_mode);

  756.     if ((s->channel_mode & 0x01) && s->channel_mode != AC3_CHMODE_MONO)

  757.         put_bits(&s->pb, 2, 1); /* XXX -4.5 dB */

  758.     if (s->channel_mode & 0x04)

  759.         put_bits(&s->pb, 2, 1); /* XXX -6 dB */

  760.     if (s->channel_mode == AC3_CHMODE_STEREO)

  761.         put_bits(&s->pb, 2, 0); /* surround not indicated */

  762.     put_bits(&s->pb, 1, s->lfe); /* LFE */

  763.     put_bits(&s->pb, 5, 31); /* dialog norm: -31 db */

  764.     put_bits(&s->pb, 1, 0); /* no compression control word */

  765.     put_bits(&s->pb, 1, 0); /* no lang code */

  766.     put_bits(&s->pb, 1, 0); /* no audio production info */

  767.     put_bits(&s->pb, 1, 0); /* no copyright */

  768.     put_bits(&s->pb, 1, 1); /* original bitstream */

  769.     put_bits(&s->pb, 1, 0); /* no time code 1 */

  770.     put_bits(&s->pb, 1, 0); /* no time code 2 */

  771.     put_bits(&s->pb, 1, 0); /* no additional bit stream info */

  772. }

  773. 

  774. /* symetric quantization on 'levels' levels */

  775. static inline int sym_quant(int c, int e, int levels)

  776. {

  777.     int v;

  778. 

  779.     if (c >= 0) {

  780.         v = (levels * (c << e)) >> 24;

  781.         v = (v + 1) >> 1;

  782.         v = (levels >> 1) + v;

  783.     } else {

  784.         v = (levels * ((-c) << e)) >> 24;

  785.         v = (v + 1) >> 1;

  786.         v = (levels >> 1) - v;

  787.     }

  788.     assert (v >= 0 && v < levels);

  789.     return v;

  790. }

  791. 

  792. /* asymetric quantization on 2^qbits levels */

  793. static inline int asym_quant(int c, int e, int qbits)

  794. {

  795.     int lshift, m, v;

  796. 

  797.     lshift = e + qbits - 24;

  798.     if (lshift >= 0)

  799.         v = c << lshift;

  800.     else

  801.         v = c >> (-lshift);

  802.     /* rounding */

  803.     v = (v + 1) >> 1;

  804.     m = (1 << (qbits-1));

  805.     if (v >= m)

  806.         v = m - 1;

  807.     assert(v >= -m);

  808.     return v & ((1 << qbits)-1);

  809. }

  810. 

  811. /* Output one audio block. There are NB_BLOCKS audio blocks in one AC-3

  812.    frame */

  813. static void output_audio_block(AC3EncodeContext *s,

  814.                                uint8_t exp_strategy[AC3_MAX_CHANNELS],

  815.                                uint8_t encoded_exp[AC3_MAX_CHANNELS][N/2],

  816.                                uint8_t bap[AC3_MAX_CHANNELS][N/2],

  817.                                int32_t mdct_coefs[AC3_MAX_CHANNELS][N/2],

  818.                                int8_t global_exp[AC3_MAX_CHANNELS],

  819.                                int block_num)

  820. {

  821.     int ch, nb_groups, group_size, i, baie, rbnd;

  822.     uint8_t *p;

  823.     uint16_t qmant[AC3_MAX_CHANNELS][N/2];

  824.     int exp0, exp1;

  825.     int mant1_cnt, mant2_cnt, mant4_cnt;

  826.     uint16_t *qmant1_ptr, *qmant2_ptr, *qmant4_ptr;

  827.     int delta0, delta1, delta2;

  828. 

  829.     for(ch=0;ch<s->nb_channels;ch++)

  830.         put_bits(&s->pb, 1, 0); /* 512 point MDCT */

  831.     for(ch=0;ch<s->nb_channels;ch++)

  832.         put_bits(&s->pb, 1, 1); /* no dither */

  833.     put_bits(&s->pb, 1, 0); /* no dynamic range */

  834.     if (block_num == 0) {

  835.         /* for block 0, even if no coupling, we must say it. This is a

  836.            waste of bit :-) */

  837.         put_bits(&s->pb, 1, 1); /* coupling strategy present */

  838.         put_bits(&s->pb, 1, 0); /* no coupling strategy */

  839.     } else {

  840.         put_bits(&s->pb, 1, 0); /* no new coupling strategy */

  841.     }

  842. 

  843.     if (s->channel_mode == AC3_CHMODE_STEREO)

  844.       {

  845.         if(block_num==0)

  846.           {

  847.             /* first block must define rematrixing (rematstr)  */

  848.             put_bits(&s->pb, 1, 1);

  849. 

  850.             /* dummy rematrixing rematflg(1:4)=0 */

  851.             for (rbnd=0;rbnd<4;rbnd++)

  852.               put_bits(&s->pb, 1, 0);

  853.           }

  854.         else

  855.           {

  856.             /* no matrixing (but should be used in the future) */

  857.             put_bits(&s->pb, 1, 0);

  858.           }

  859.       }

  860. 

  861. #if defined(DEBUG)

  862.     {

  863.       static int count = 0;

  864.       av_log(NULL, AV_LOG_DEBUG, "Block #%d (%d)\n", block_num, count++);

  865.     }

  866. #endif

  867.     /* exponent strategy */

  868.     for(ch=0;ch<s->nb_channels;ch++) {

  869.         put_bits(&s->pb, 2, exp_strategy[ch]);

  870.     }

  871. 

  872.     if (s->lfe) {

  873.         put_bits(&s->pb, 1, exp_strategy[s->lfe_channel]);

  874.     }

  875. 

  876.     for(ch=0;ch<s->nb_channels;ch++) {

  877.         if (exp_strategy[ch] != EXP_REUSE)

  878.             put_bits(&s->pb, 6, s->chbwcod[ch]);

  879.     }

  880. 

  881.     /* exponents */

  882.     for (ch = 0; ch < s->nb_all_channels; ch++) {

  883.         switch(exp_strategy[ch]) {

  884.         case EXP_REUSE:

  885.             continue;

  886.         case EXP_D15:

  887.             group_size = 1;

  888.             break;

  889.         case EXP_D25:

  890.             group_size = 2;

  891.             break;

  892.         default:

  893.         case EXP_D45:

  894.             group_size = 4;

  895.             break;

  896.         }

  897.         nb_groups = (s->nb_coefs[ch] + (group_size * 3) - 4) / (3 * group_size);

  898.         p = encoded_exp[ch];

  899. 

  900.         /* first exponent */

  901.         exp1 = *p++;

  902.         put_bits(&s->pb, 4, exp1);

  903. 

  904.         /* next ones are delta encoded */

  905.         for(i=0;i<nb_groups;i++) {

  906.             /* merge three delta in one code */

  907.             exp0 = exp1;

  908.             exp1 = p[0];

  909.             p += group_size;

  910.             delta0 = exp1 - exp0 + 2;

  911. 

  912.             exp0 = exp1;

  913.             exp1 = p[0];

  914.             p += group_size;

  915.             delta1 = exp1 - exp0 + 2;

  916. 

  917.             exp0 = exp1;

  918.             exp1 = p[0];

  919.             p += group_size;

  920.             delta2 = exp1 - exp0 + 2;

  921. 

  922.             put_bits(&s->pb, 7, ((delta0 * 5 + delta1) * 5) + delta2);

  923.         }

  924. 

  925.         if (ch != s->lfe_channel)

  926.             put_bits(&s->pb, 2, 0); /* no gain range info */

  927.     }

  928. 

  929.     /* bit allocation info */

  930.     baie = (block_num == 0);

  931.     put_bits(&s->pb, 1, baie);

  932.     if (baie) {

  933.         put_bits(&s->pb, 2, s->slow_decay_code);

  934.         put_bits(&s->pb, 2, s->fast_decay_code);

  935.         put_bits(&s->pb, 2, s->slow_gain_code);

  936.         put_bits(&s->pb, 2, s->db_per_bit_code);

  937.         put_bits(&s->pb, 3, s->floor_code);

  938.     }

  939. 

  940.     /* snr offset */

  941.     put_bits(&s->pb, 1, baie); /* always present with bai */

  942.     if (baie) {

  943.         put_bits(&s->pb, 6, s->coarse_snr_offset);

  944.         for(ch=0;ch<s->nb_all_channels;ch++) {

  945.             put_bits(&s->pb, 4, s->fine_snr_offset[ch]);

  946.             put_bits(&s->pb, 3, s->fast_gain_code[ch]);

  947.         }

  948.     }

  949. 

  950.     put_bits(&s->pb, 1, 0); /* no delta bit allocation */

  951.     put_bits(&s->pb, 1, 0); /* no data to skip */

  952. 

  953.     /* mantissa encoding : we use two passes to handle the grouping. A

  954.        one pass method may be faster, but it would necessitate to

  955.        modify the output stream. */

  956. 

  957.     /* first pass: quantize */

  958.     mant1_cnt = mant2_cnt = mant4_cnt = 0;

  959.     qmant1_ptr = qmant2_ptr = qmant4_ptr = NULL;

  960. 

  961.     for (ch = 0; ch < s->nb_all_channels; ch++) {

  962.         int b, c, e, v;

  963. 

  964.         for(i=0;i<s->nb_coefs[ch];i++) {

  965.             c = mdct_coefs[ch][i];

  966.             e = encoded_exp[ch][i] - global_exp[ch];

  967.             b = bap[ch][i];

  968.             switch(b) {

  969.             case 0:

  970.                 v = 0;

  971.                 break;

  972.             case 1:

  973.                 v = sym_quant(c, e, 3);

  974.                 switch(mant1_cnt) {

  975.                 case 0:

  976.                     qmant1_ptr = &qmant[ch][i];

  977.                     v = 9 * v;

  978.                     mant1_cnt = 1;

  979.                     break;

  980.                 case 1:

  981.                     *qmant1_ptr += 3 * v;

  982.                     mant1_cnt = 2;

  983.                     v = 128;

  984.                     break;

  985.                 default:

  986.                     *qmant1_ptr += v;

  987.                     mant1_cnt = 0;

  988.                     v = 128;

  989.                     break;

  990.                 }

  991.                 break;

  992.             case 2:

  993.                 v = sym_quant(c, e, 5);

  994.                 switch(mant2_cnt) {

  995.                 case 0:

  996.                     qmant2_ptr = &qmant[ch][i];

  997.                     v = 25 * v;

  998.                     mant2_cnt = 1;

  999.                     break;

  1000.                 case 1:

  1001.                     *qmant2_ptr += 5 * v;

  1002.                     mant2_cnt = 2;

  1003.                     v = 128;

  1004.                     break;

  1005.                 default:

  1006.                     *qmant2_ptr += v;

  1007.                     mant2_cnt = 0;

  1008.                     v = 128;

  1009.                     break;

  1010.                 }

  1011.                 break;

  1012.             case 3:

  1013.                 v = sym_quant(c, e, 7);

  1014.                 break;

  1015.             case 4:

  1016.                 v = sym_quant(c, e, 11);

  1017.                 switch(mant4_cnt) {

  1018.                 case 0:

  1019.                     qmant4_ptr = &qmant[ch][i];

  1020.                     v = 11 * v;

  1021.                     mant4_cnt = 1;

  1022.                     break;

  1023.                 default:

  1024.                     *qmant4_ptr += v;

  1025.                     mant4_cnt = 0;

  1026.                     v = 128;

  1027.                     break;

  1028.                 }

  1029.                 break;

  1030.             case 5:

  1031.                 v = sym_quant(c, e, 15);

  1032.                 break;

  1033.             case 14:

  1034.                 v = asym_quant(c, e, 14);

  1035.                 break;

  1036.             case 15:

  1037.                 v = asym_quant(c, e, 16);

  1038.                 break;

  1039.             default:

  1040.                 v = asym_quant(c, e, b - 1);

  1041.                 break;

  1042.             }

  1043.             qmant[ch][i] = v;

  1044.         }

  1045.     }

  1046. 

  1047.     /* second pass : output the values */

  1048.     for (ch = 0; ch < s->nb_all_channels; ch++) {

  1049.         int b, q;

  1050. 

  1051.         for(i=0;i<s->nb_coefs[ch];i++) {

  1052.             q = qmant[ch][i];

  1053.             b = bap[ch][i];

  1054.             switch(b) {

  1055.             case 0:

  1056.                 break;

  1057.             case 1:

  1058.                 if (q != 128)

  1059.                     put_bits(&s->pb, 5, q);

  1060.                 break;

  1061.             case 2:

  1062.                 if (q != 128)

  1063.                     put_bits(&s->pb, 7, q);

  1064.                 break;

  1065.             case 3:

  1066.                 put_bits(&s->pb, 3, q);

  1067.                 break;

  1068.             case 4:

  1069.                 if (q != 128)

  1070.                     put_bits(&s->pb, 7, q);

  1071.                 break;

  1072.             case 14:

  1073.                 put_bits(&s->pb, 14, q);

  1074.                 break;

  1075.             case 15:

  1076.                 put_bits(&s->pb, 16, q);

  1077.                 break;

  1078.             default:

  1079.                 put_bits(&s->pb, b - 1, q);

  1080.                 break;

  1081.             }

  1082.         }

  1083.     }

  1084. }

  1085. 

  1086. #define CRC16_POLY ((1 << 0) | (1 << 2) | (1 << 15) | (1 << 16))

  1087. 

  1088. static unsigned int mul_poly(unsigned int a, unsigned int b, unsigned int poly)

  1089. {

  1090.     unsigned int c;

  1091. 

  1092.     c = 0;

  1093.     while (a) {

  1094.         if (a & 1)

  1095.             c ^= b;

  1096.         a = a >> 1;

  1097.         b = b << 1;

  1098.         if (b & (1 << 16))

  1099.             b ^= poly;

  1100.     }

  1101.     return c;

  1102. }

  1103. 

  1104. static unsigned int pow_poly(unsigned int a, unsigned int n, unsigned int poly)

  1105. {

  1106.     unsigned int r;

  1107.     r = 1;

  1108.     while (n) {

  1109.         if (n & 1)

  1110.             r = mul_poly(r, a, poly);

  1111.         a = mul_poly(a, a, poly);

  1112.         n >>= 1;

  1113.     }

  1114.     return r;

  1115. }

  1116. 

  1117. 

  1118. /* compute log2(max(abs(tab[]))) */

  1119. static int log2_tab(int16_t *tab, int n)

  1120. {

  1121.     int i, v;

  1122. 

  1123.     v = 0;

  1124.     for(i=0;i<n;i++) {

  1125.         v |= abs(tab[i]);

  1126.     }

  1127.     return av_log2(v);

  1128. }

  1129. 

  1130. static void lshift_tab(int16_t *tab, int n, int lshift)

  1131. {

  1132.     int i;

  1133. 

  1134.     if (lshift > 0) {

  1135.         for(i=0;i<n;i++) {

  1136.             tab[i] <<= lshift;

  1137.         }

  1138.     } else if (lshift < 0) {

  1139.         lshift = -lshift;

  1140.         for(i=0;i<n;i++) {

  1141.             tab[i] >>= lshift;

  1142.         }

  1143.     }

  1144. }

  1145. 

  1146. /* fill the end of the frame and compute the two crcs */

  1147. static int output_frame_end(AC3EncodeContext *s)

  1148. {

  1149.     int frame_size, frame_size_58, n, crc1, crc2, crc_inv;

  1150.     uint8_t *frame;

  1151. 

  1152.     frame_size = s->frame_size; /* frame size in words */

  1153.     /* align to 8 bits */

  1154.     flush_put_bits(&s->pb);

  1155.     /* add zero bytes to reach the frame size */

  1156.     frame = s->pb.buf;

  1157.     n = 2 * s->frame_size - (put_bits_ptr(&s->pb) - frame) - 2;

  1158.     assert(n >= 0);

  1159.     if(n>0)

  1160.       memset(put_bits_ptr(&s->pb), 0, n);

  1161. 

  1162.     /* Now we must compute both crcs : this is not so easy for crc1

  1163.        because it is at the beginning of the data... */

  1164.     frame_size_58 = (frame_size >> 1) + (frame_size >> 3);

  1165.     crc1 = av_bswap16(av_crc(av_crc_get_table(AV_CRC_16_ANSI), 0,

  1166.                            frame + 4, 2 * frame_size_58 - 4));

  1167.     /* XXX: could precompute crc_inv */

  1168.     crc_inv = pow_poly((CRC16_POLY >> 1), (16 * frame_size_58) - 16, CRC16_POLY);

  1169.     crc1 = mul_poly(crc_inv, crc1, CRC16_POLY);

  1170.     AV_WB16(frame+2,crc1);

  1171. 

  1172.     crc2 = av_bswap16(av_crc(av_crc_get_table(AV_CRC_16_ANSI), 0,

  1173.                            frame + 2 * frame_size_58,

  1174.                            (frame_size - frame_size_58) * 2 - 2));

  1175.     AV_WB16(frame+2*frame_size-2,crc2);

  1176. 

  1177.     //    printf("n=%d frame_size=%d\n", n, frame_size);

  1178.     return frame_size * 2;

  1179. }

  1180. 

  1181. static int AC3_encode_frame(AVCodecContext *avctx,

  1182.                             unsigned char *frame, int buf_size, void *data)

  1183. {

  1184.     AC3EncodeContext *s = avctx->priv_data;

  1185.     const int16_t *samples = data;

  1186.     int i, j, k, v, ch;

  1187.     int16_t input_samples[N];

  1188.     int32_t mdct_coef[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];

  1189.     uint8_t exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];

  1190.     uint8_t exp_strategy[NB_BLOCKS][AC3_MAX_CHANNELS];

  1191.     uint8_t encoded_exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];

  1192.     uint8_t bap[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];

  1193.     int8_t exp_samples[NB_BLOCKS][AC3_MAX_CHANNELS];

  1194.     int frame_bits;

  1195. 

  1196.     frame_bits = 0;

  1197.     for(ch=0;ch<s->nb_all_channels;ch++) {

  1198.         int ich = s->channel_map[ch];

  1199.         /* fixed mdct to the six sub blocks & exponent computation */

  1200.         for(i=0;i<NB_BLOCKS;i++) {

  1201.             const int16_t *sptr;

  1202.             int sinc;

  1203. 

  1204.             /* compute input samples */

  1205.             memcpy(input_samples, s->last_samples[ich], N/2 * sizeof(int16_t));

  1206.             sinc = s->nb_all_channels;

  1207.             sptr = samples + (sinc * (N/2) * i) + ich;

  1208.             for(j=0;j<N/2;j++) {

  1209.                 v = *sptr;

  1210.                 input_samples[j + N/2] = v;

  1211.                 s->last_samples[ich][j] = v;

  1212.                 sptr += sinc;

  1213.             }

  1214. 

  1215.             /* apply the MDCT window */

  1216.             for(j=0;j<N/2;j++) {

  1217.                 input_samples[j] = MUL16(input_samples[j],

  1218.                                          ff_ac3_window[j]) >> 15;

  1219.                 input_samples[N-j-1] = MUL16(input_samples[N-j-1],

  1220.                                              ff_ac3_window[j]) >> 15;

  1221.             }

  1222. 

  1223.             /* Normalize the samples to use the maximum available

  1224.                precision */

  1225.             v = 14 - log2_tab(input_samples, N);

  1226.             if (v < 0)

  1227.                 v = 0;

  1228.             exp_samples[i][ch] = v - 9;

  1229.             lshift_tab(input_samples, N, v);

  1230. 

  1231.             /* do the MDCT */

  1232.             mdct512(mdct_coef[i][ch], input_samples);

  1233. 

  1234.             /* compute "exponents". We take into account the

  1235.                normalization there */

  1236.             for(j=0;j<N/2;j++) {

  1237.                 int e;

  1238.                 v = abs(mdct_coef[i][ch][j]);

  1239.                 if (v == 0)

  1240.                     e = 24;

  1241.                 else {

  1242.                     e = 23 - av_log2(v) + exp_samples[i][ch];

  1243.                     if (e >= 24) {

  1244.                         e = 24;

  1245.                         mdct_coef[i][ch][j] = 0;

  1246.                     }

  1247.                 }

  1248.                 exp[i][ch][j] = e;

  1249.             }

  1250.         }

  1251. 

  1252.         compute_exp_strategy(exp_strategy, exp, ch, ch == s->lfe_channel);

  1253. 

  1254.         /* compute the exponents as the decoder will see them. The

  1255.            EXP_REUSE case must be handled carefully : we select the

  1256.            min of the exponents */

  1257.         i = 0;

  1258.         while (i < NB_BLOCKS) {

  1259.             j = i + 1;

  1260.             while (j < NB_BLOCKS && exp_strategy[j][ch] == EXP_REUSE) {

  1261.                 exponent_min(exp[i][ch], exp[j][ch], s->nb_coefs[ch]);

  1262.                 j++;

  1263.             }

  1264.             frame_bits += encode_exp(encoded_exp[i][ch],

  1265.                                      exp[i][ch], s->nb_coefs[ch],

  1266.                                      exp_strategy[i][ch]);

  1267.             /* copy encoded exponents for reuse case */

  1268.             for(k=i+1;k<j;k++) {

  1269.                 memcpy(encoded_exp[k][ch], encoded_exp[i][ch],

  1270.                        s->nb_coefs[ch] * sizeof(uint8_t));

  1271.             }

  1272.             i = j;

  1273.         }

  1274.     }

  1275. 

  1276.     /* adjust for fractional frame sizes */

  1277.     while(s->bits_written >= s->bit_rate && s->samples_written >= s->sample_rate) {

  1278.         s->bits_written -= s->bit_rate;

  1279.         s->samples_written -= s->sample_rate;

  1280.     }

  1281.     s->frame_size = s->frame_size_min + (s->bits_written * s->sample_rate < s->samples_written * s->bit_rate);

  1282.     s->bits_written += s->frame_size * 16;

  1283.     s->samples_written += AC3_FRAME_SIZE;

  1284. 

  1285.     compute_bit_allocation(s, bap, encoded_exp, exp_strategy, frame_bits);

  1286.     /* everything is known... let's output the frame */

  1287.     output_frame_header(s, frame);

  1288. 

  1289.     for(i=0;i<NB_BLOCKS;i++) {

  1290.         output_audio_block(s, exp_strategy[i], encoded_exp[i],

  1291.                            bap[i], mdct_coef[i], exp_samples[i], i);

  1292.     }

  1293.     return output_frame_end(s);

  1294. }

  1295. 

  1296. static av_cold int AC3_encode_close(AVCodecContext *avctx)

  1297. {

  1298.     av_freep(&avctx->coded_frame);

  1299.     return 0;

  1300. }

  1301. 

  1302. #if 0

  1303. /*************************************************************************/

  1304. /* TEST */

  1305. 

  1306. #undef random

  1307. #define FN (N/4)

  1308. 

  1309. void fft_test(void)

  1310. {

  1311.     IComplex in[FN], in1[FN];

  1312.     int k, n, i;

  1313.     float sum_re, sum_im, a;

  1314. 

  1315.     /* FFT test */

  1316. 

  1317.     for(i=0;i<FN;i++) {

  1318.         in[i].re = random() % 65535 - 32767;

  1319.         in[i].im = random() % 65535 - 32767;

  1320.         in1[i] = in[i];

  1321.     }

  1322.     fft(in, 7);

  1323. 

  1324.     /* do it by hand */

  1325.     for(k=0;k<FN;k++) {

  1326.         sum_re = 0;

  1327.         sum_im = 0;

  1328.         for(n=0;n<FN;n++) {

  1329.             a = -2 * M_PI * (n * k) / FN;

  1330.             sum_re += in1[n].re * cos(a) - in1[n].im * sin(a);

  1331.             sum_im += in1[n].re * sin(a) + in1[n].im * cos(a);

  1332.         }

  1333.         printf("%3d: %6d,%6d %6.0f,%6.0f\n",

  1334.                k, in[k].re, in[k].im, sum_re / FN, sum_im / FN);

  1335.     }

  1336. }

  1337. 

  1338. void mdct_test(void)

  1339. {

  1340.     int16_t input[N];

  1341.     int32_t output[N/2];

  1342.     float input1[N];

  1343.     float output1[N/2];

  1344.     float s, a, err, e, emax;

  1345.     int i, k, n;

  1346. 

  1347.     for(i=0;i<N;i++) {

  1348.         input[i] = (random() % 65535 - 32767) * 9 / 10;

  1349.         input1[i] = input[i];

  1350.     }

  1351. 

  1352.     mdct512(output, input);

  1353. 

  1354.     /* do it by hand */

  1355.     for(k=0;k<N/2;k++) {

  1356.         s = 0;

  1357.         for(n=0;n<N;n++) {

  1358.             a = (2*M_PI*(2*n+1+N/2)*(2*k+1) / (4 * N));

  1359.             s += input1[n] * cos(a);

  1360.         }

  1361.         output1[k] = -2 * s / N;

  1362.     }

  1363. 

  1364.     err = 0;

  1365.     emax = 0;

  1366.     for(i=0;i<N/2;i++) {

  1367.         printf("%3d: %7d %7.0f\n", i, output[i], output1[i]);

  1368.         e = output[i] - output1[i];

  1369.         if (e > emax)

  1370.             emax = e;

  1371.         err += e * e;

  1372.     }

  1373.     printf("err2=%f emax=%f\n", err / (N/2), emax);

  1374. }

  1375. 

  1376. void test_ac3(void)

  1377. {

  1378.     AC3EncodeContext ctx;

  1379.     unsigned char frame[AC3_MAX_CODED_FRAME_SIZE];

  1380.     short samples[AC3_FRAME_SIZE];

  1381.     int ret, i;

  1382. 

  1383.     AC3_encode_init(&ctx, 44100, 64000, 1);

  1384. 

  1385.     fft_test();

  1386.     mdct_test();

  1387. 

  1388.     for(i=0;i<AC3_FRAME_SIZE;i++)

  1389.         samples[i] = (int)(sin(2*M_PI*i*1000.0/44100) * 10000);

  1390.     ret = AC3_encode_frame(&ctx, frame, samples);

  1391.     printf("ret=%d\n", ret);

  1392. }

  1393. #endif

  1394. 

  1395. AVCodec ac3_encoder = {

  1396.     "ac3",

  1397.     AVMEDIA_TYPE_AUDIO,

  1398.     CODEC_ID_AC3,

  1399.     sizeof(AC3EncodeContext),

  1400.     AC3_encode_init,

  1401.     AC3_encode_frame,

  1402.     AC3_encode_close,

  1403.     NULL,

  1404.     .sample_fmts = (const enum AVSampleFormat[]){AV_SAMPLE_FMT_S16,AV_SAMPLE_FMT_NONE},

  1405.     .long_name = NULL_IF_CONFIG_SMALL("ATSC A/52A (AC-3)"),

  1406.     .channel_layouts = (const int64_t[]){

  1407.         AV_CH_LAYOUT_MONO,

  1408.         AV_CH_LAYOUT_STEREO,

  1409.         AV_CH_LAYOUT_2_1,

  1410.         AV_CH_LAYOUT_SURROUND,

  1411.         AV_CH_LAYOUT_2_2,

  1412.         AV_CH_LAYOUT_QUAD,

  1413.         AV_CH_LAYOUT_4POINT0,

  1414.         AV_CH_LAYOUT_5POINT0,

  1415.         AV_CH_LAYOUT_5POINT0_BACK,

  1416.        (AV_CH_LAYOUT_MONO     | AV_CH_LOW_FREQUENCY),

  1417.        (AV_CH_LAYOUT_STEREO   | AV_CH_LOW_FREQUENCY),

  1418.        (AV_CH_LAYOUT_2_1      | AV_CH_LOW_FREQUENCY),

  1419.        (AV_CH_LAYOUT_SURROUND | AV_CH_LOW_FREQUENCY),

  1420.        (AV_CH_LAYOUT_2_2      | AV_CH_LOW_FREQUENCY),

  1421.        (AV_CH_LAYOUT_QUAD     | AV_CH_LOW_FREQUENCY),

  1422.        (AV_CH_LAYOUT_4POINT0  | AV_CH_LOW_FREQUENCY),

  1423.         AV_CH_LAYOUT_5POINT1,

  1424.         AV_CH_LAYOUT_5POINT1_BACK,

  1425.         0 },

  1426. };