libavcodec.hg: ac3enc.c comparison

comparison ac3enc.c @ 2967:ef2149182f1c libavcodec

COSMETICS: Remove all trailing whitespace.

author	diego
date	Sat, 17 Dec 2005 18:14:38 +0000
parents	6ff5dc0dbaf0
children	bfabfdf9ce55

comparison

equal deleted inserted replaced

-:564788471dd4
+:ef2149182f1c
 int lfe;
 unsigned int bsmod;
 short last_samples[AC3_MAX_CHANNELS][256];
 unsigned int chbwcod[AC3_MAX_CHANNELS];
 int nb_coefs[AC3_MAX_CHANNELS];
 /* bitrate allocation control */
 int sgaincod, sdecaycod, fdecaycod, dbkneecod, floorcod;
 AC3BitAllocParameters bit_alloc;
 int csnroffst;
 int fgaincod[AC3_MAX_CHANNELS];
 int fsnroffst[AC3_MAX_CHANNELS];
 /* mantissa encoding */
 {
 int v;
 v = (int)(a * (float)(1 << 15));
 if (v < -32767)
 v = -32767;
 else if (v > 32767)
 v = 32767;
 return v;
 }
 static inline int calc_lowcomp1(int a, int b0, int b1)
 {
 if ((b0 + 256) == b1) {
 a = 384 ;
 } else if (b0 > b1) {
 a = a - 64;
 if (a < 0) a=0;
 }
 return a;
 }
 static inline int calc_lowcomp(int a, int b0, int b1, int bin)
 {
 if (bin < 7) {
 if ((b0 + 256) == b1) {
 a = 384 ;
 } else if (b0 > b1) {
 a = a - 64;
 if (a < 0) a=0;
 }
 } else if (bin < 20) {
 if ((b0 + 256) == b1) {
 /* AC3 bit allocation. The algorithm is the one described in the AC3
 spec. */
 void ac3_parametric_bit_allocation(AC3BitAllocParameters *s, uint8_t *bap,
 int8_t *exp, int start, int end,
 int snroffset, int fgain, int is_lfe,
 int deltbae,int deltnseg,
 uint8_t *deltoffst, uint8_t *deltlen, uint8_t *deltba)
 {
 int bin,i,j,k,end1,v,v1,bndstrt,bndend,lowcomp,begin;
 int fastleak,slowleak,address,tmp;
 int16_t psd[256]; /* scaled exponents */
 } while (end > bndtab[k]);
 /* excitation function */
 bndstrt = masktab[start];
 bndend = masktab[end-1] + 1;
 if (bndstrt == 0) {
 lowcomp = 0;
 lowcomp = calc_lowcomp1(lowcomp, bndpsd[0], bndpsd[1]) ;
 excite[0] = bndpsd[0] - fgain - lowcomp ;
 lowcomp = calc_lowcomp1(lowcomp, bndpsd[1], bndpsd[2]) ;
 begin = bin + 1 ;
 break ;
 }
 }
 }
 end1=bndend;
 if (end1 > 22) end1=22;
 for (bin = begin; bin < end1; bin++) {
 if (!(is_lfe && bin == 6))
 lowcomp = calc_lowcomp(lowcomp, bndpsd[bin], bndpsd[bin+1], bin) ;
 fastleak -= s->fdecay ;
 v = bndpsd[bin] - fgain;
 if (fastleak < v) fastleak = v;
 slowleak -= s->sdecay ;
 v = bndpsd[bin] - s->sgain;
 if (slowleak < v) slowleak = v;
 v=fastleak - lowcomp;
 if (slowleak > v) v=slowleak;
 excite[bin] = v;
 }
 begin = 22;
 } else {
 /* coupling channel */
 begin = bndstrt;
 fastleak = (s->cplfleak << 8) + 768;
 slowleak = (s->cplsleak << 8) + 768;
 }
 for (bin = begin; bin < bndend; bin++) {
 }
 }
 }
 /* compute bit allocation */
 i = start ;
 j = masktab[start] ;
 do {
 v=mask[j];
 v -= snroffset ;
 /* pass 0 */
 p=&z[0];
 j=(np >> 1);
 do {
 BF(p[0].re, p[0].im, p[1].re, p[1].im,
 p[0].re, p[0].im, p[1].re, p[1].im);
 p+=2;
 } while (--j != 0);
 /* pass 1 */
 p=&z[0];
 j=np >> 2;
 do {
 BF(p[0].re, p[0].im, p[2].re, p[2].im,
 p[0].re, p[0].im, p[2].re, p[2].im);
 BF(p[1].re, p[1].im, p[3].re, p[3].im,
 p[1].re, p[1].im, p[3].im, -p[3].re);
 p+=4;
 } while (--j != 0);
 /* pass 2 .. ln-1 */
 q = z + nloops;
 for (j = 0; j < nblocks; ++j) {
 BF(p->re, p->im, q->re, q->im,
 p->re, p->im, q->re, q->im);
 p++;
 q++;
 for(l = nblocks; l < np2; l += nblocks) {
 CMUL(tmp_re, tmp_im, costab[l], -sintab[l], q->re, q->im);
 BF(p->re, p->im, q->re, q->im,
 /* do a 512 point mdct */
 static void mdct512(int32_t *out, int16_t *in)
 {
 int i, re, im, re1, im1;
 int16_t rot[N];
 IComplex x[N/4];
 /* shift to simplify computations */
 for(i=0;i<N/4;i++)
 rot[i] = -in[i + 3*N/4];
 for(i=N/4;i<N;i++)
 rot[i] = in[i - N/4];
 /* pre rotation */
 for(i=0;i<N/4;i++) {
 re = ((int)rot[2*i] - (int)rot[N-1-2*i]) >> 1;
 im = -((int)rot[N/2+2*i] - (int)rot[N/2-1-2*i]) >> 1;
 CMUL(x[i].re, x[i].im, re, im, -xcos1[i], xsin1[i]);
 }
 fft(x, MDCT_NBITS - 2);
 /* post rotation */
 for(i=0;i<N/4;i++) {
 re = x[i].re;
 im = x[i].im;
 CMUL(re1, im1, re, im, xsin1[i], xcos1[i]);
 uint8_t exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],
 int ch, int is_lfe)
 {
 int i, j;
 int exp_diff;
 /* estimate if the exponent variation & decide if they should be
 reused in the next frame */
 exp_strategy[0][ch] = EXP_NEW;
 for(i=1;i<NB_BLOCKS;i++) {
 exp_diff = calc_exp_diff(exp[i][ch], exp[i-1][ch], N/2);
 #ifdef DEBUG
 av_log(NULL, AV_LOG_DEBUG, "exp_diff=%d\n", exp_diff);
 #endif
 if (exp_diff > EXP_DIFF_THRESHOLD)
 exp_strategy[i][ch] = EXP_NEW;
 else
 for(i=0;i<n;i++) {
 if (exp1[i] < exp[i])
 exp[i] = exp1[i];
 }
 }
 /* update the exponents so that they are the ones the decoder will
 decode. Return the number of bits used to code the exponents */
 static int encode_exp(uint8_t encoded_exp[N/2],
 uint8_t exp[N/2],
 int nb_exps,
 int exp_strategy)
 {
 int group_size, nb_groups, i, j, k, exp_min;
 uint8_t exp1[N/2];
 for(j=0;j<group_size;j++) {
 encoded_exp[k+j] = exp1[i];
 }
 k += group_size;
 }
 #if defined(DEBUG)
 av_log(NULL, AV_LOG_DEBUG, "exponents: strategy=%d\n", exp_strategy);
 for(i=0;i<=nb_groups * group_size;i++) {
 av_log(NULL, AV_LOG_DEBUG, "%d ", encoded_exp[i]);
 }
 case 0:
 /* nothing */
 break;
 case 1:
 /* 3 mantissa in 5 bits */
 if (s->mant1_cnt == 0)
 bits += 5;
 if (++s->mant1_cnt == 3)
 s->mant1_cnt = 0;
 break;
 case 2:
 /* 3 mantissa in 7 bits */
 if (s->mant2_cnt == 0)
 bits += 7;
 if (++s->mant2_cnt == 3)
 s->mant2_cnt = 0;
 break;
 case 3:
 break;
 case 4:
 /* 2 mantissa in 7 bits */
 if (s->mant4_cnt == 0)
 bits += 7;
 if (++s->mant4_cnt == 2)
 s->mant4_cnt = 0;
 break;
 case 14:
 bits += 14;
 break;
 for(i=0;i<NB_BLOCKS;i++) {
 s->mant1_cnt = 0;
 s->mant2_cnt = 0;
 s->mant4_cnt = 0;
 for(ch=0;ch<s->nb_all_channels;ch++) {
 ac3_parametric_bit_allocation(&s->bit_alloc,
 bap[i][ch], (int8_t *)encoded_exp[i][ch],
 0, s->nb_coefs[ch],
 (((csnroffst-15) << 4) +
 fsnroffst) << 2,
 fgaintab[s->fgaincod[ch]],
 ch == s->lfe_channel,
 2, 0, NULL, NULL, NULL);
 frame_bits += compute_mantissa_size(s, bap[i][ch],
 s->nb_coefs[ch]);
 }
 }
 #if 0
 printf("csnr=%d fsnr=%d frame_bits=%d diff=%d\n",
 csnroffst, fsnroffst, frame_bits,
 16 * s->frame_size - ((frame_bits + 7) & ~7));
 #endif
 return 16 * s->frame_size - frame_bits;
 }
 s->sdecaycod = 2;
 s->fdecaycod = 1;
 s->sgaincod = 1;
 s->dbkneecod = 2;
 s->floorcod = 4;
 for(ch=0;ch<s->nb_all_channels;ch++)
 s->fgaincod[ch] = 4;
 /* compute real values */
 s->bit_alloc.fscod = s->fscod;
 s->bit_alloc.halfratecod = s->halfratecod;
 s->bit_alloc.sdecay = sdecaytab[s->sdecaycod] >> s->halfratecod;
 s->bit_alloc.fdecay = fdecaytab[s->fdecaycod] >> s->halfratecod;
 s->bit_alloc.sgain = sgaintab[s->sgaincod];
 s->bit_alloc.dbknee = dbkneetab[s->dbkneecod];
 s->bit_alloc.floor = floortab[s->floorcod];
 /* header size */
 frame_bits += 65;
 // if (s->acmod == 2)
 //    frame_bits += 2;
 frame_bits += frame_bits_inc[s->acmod];
 /* now the big work begins : do the bit allocation. Modify the snr
 offset until we can pack everything in the requested frame size */
 csnroffst = s->csnroffst;
 while (csnroffst >= 0 &&
 	   bit_alloc(s, bap, encoded_exp, exp_strategy, frame_bits, csnroffst, 0) < 0)
 	csnroffst -= SNR_INC1;
 if (csnroffst < 0) {
 	av_log(NULL, AV_LOG_ERROR, "Yack, Error !!!\n");
 	return -1;
 }
 while ((csnroffst + SNR_INC1) <= 63 &&
 bit_alloc(s, bap1, encoded_exp, exp_strategy, frame_bits,
 csnroffst + SNR_INC1, 0) >= 0) {
 csnroffst += SNR_INC1;
 memcpy(bap, bap1, sizeof(bap1));
 }
 while ((csnroffst + 1) <= 63 &&
 bit_alloc(s, bap1, encoded_exp, exp_strategy, frame_bits, csnroffst + 1, 0) >= 0) {
 csnroffst++;
 memcpy(bap, bap1, sizeof(bap1));
 }
 fsnroffst = 0;
 while ((fsnroffst + SNR_INC1) <= 15 &&
 bit_alloc(s, bap1, encoded_exp, exp_strategy, frame_bits,
 csnroffst, fsnroffst + SNR_INC1) >= 0) {
 fsnroffst += SNR_INC1;
 memcpy(bap, bap1, sizeof(bap1));
 }
 while ((fsnroffst + 1) <= 15 &&
 bit_alloc(s, bap1, encoded_exp, exp_strategy, frame_bits,
 csnroffst, fsnroffst + 1) >= 0) {
 fsnroffst++;
 memcpy(bap, bap1, sizeof(bap1));
 }
 s->csnroffst = csnroffst;
 for(ch=0;ch<s->nb_all_channels;ch++)
 s->fsnroffst[ch] = fsnroffst;
 #if defined(DEBUG_BITALLOC)
 {
 	0x07, /* L C R SL SR */
 	0x07, /* L C R SL SR (+LFE) */
 };
 avctx->frame_size = AC3_FRAME_SIZE;
 /* number of channels */
 if (channels < 1 || channels > 6)
 	return -1;
 s->acmod = acmod_defs[channels - 1];
 s->lfe = (channels == 6) ? 1 : 0;
 s->nb_channels = channels > 5 ? 5 : channels;
 s->lfe_channel = s->lfe ? 5 : -1;
 /* frequency */
 for(i=0;i<3;i++) {
 for(j=0;j<3;j++)
 if ((ac3_freqs[j] >> i) == freq)
 goto found;
 }
 return -1;
 found:
 s->sample_rate = freq;
 s->halfratecod = i;
 s->fscod = j;
 s->bsid = 8 + s->halfratecod;
 s->bsmod = 0; /* complete main audio service */
 s->bit_rate = bitrate;
 s->frmsizecod = i << 1;
 s->frame_size_min = (bitrate * 1000 * AC3_FRAME_SIZE) / (freq * 16);
 /* for now we do not handle fractional sizes */
 s->frame_size = s->frame_size_min;
 /* bit allocation init */
 for(ch=0;ch<s->nb_channels;ch++) {
 /* bandwidth for each channel */
 /* XXX: should compute the bandwidth according to the frame
 size, so that we avoid anoying high freq artefacts */
 xcos1[i] = fix15(-cos(alpha));
 xsin1[i] = fix15(-sin(alpha));
 }
 ac3_crc_init();
 avctx->coded_frame= avcodec_alloc_frame();
 avctx->coded_frame->key_frame= 1;
 return 0;
 }
 int exp0, exp1;
 int mant1_cnt, mant2_cnt, mant4_cnt;
 uint16_t *qmant1_ptr, *qmant2_ptr, *qmant4_ptr;
 int delta0, delta1, delta2;
 for(ch=0;ch<s->nb_channels;ch++)
 put_bits(&s->pb, 1, 0); /* 512 point MDCT */
 for(ch=0;ch<s->nb_channels;ch++)
 put_bits(&s->pb, 1, 1); /* no dither */
 put_bits(&s->pb, 1, 0); /* no dynamic range */
 if (block_num == 0) {
 /* for block 0, even if no coupling, we must say it. This is a
 waste of bit :-) */
 if (s->acmod == 2)
 {
 	if(block_num==0)
 	  {
 	    /* first block must define rematrixing (rematstr)  */
 	    put_bits(&s->pb, 1, 1);
 	    /* dummy rematrixing rematflg(1:4)=0 */
 	    for (rbnd=0;rbnd<4;rbnd++)
 	      put_bits(&s->pb, 1, 0);
 	  }
 	else
 	  {
 	    /* no matrixing (but should be used in the future) */
 	    put_bits(&s->pb, 1, 0);
 	  }
 }
 #if defined(DEBUG)
 {
 static int count = 0;
 av_log(NULL, AV_LOG_DEBUG, "Block #%d (%d)\n", block_num, count++);
 }
 #endif
 /* exponent strategy */
 for(ch=0;ch<s->nb_channels;ch++) {
 put_bits(&s->pb, 2, exp_strategy[ch]);
 }
 if (s->lfe) {
 	put_bits(&s->pb, 1, exp_strategy[s->lfe_channel]);
 }
 for(ch=0;ch<s->nb_channels;ch++) {
 if (exp_strategy[ch] != EXP_REUSE)
 put_bits(&s->pb, 6, s->chbwcod[ch]);
 }
 /* exponents */
 for (ch = 0; ch < s->nb_all_channels; ch++) {
 switch(exp_strategy[ch]) {
 case EXP_REUSE:
 continue;
 for(ch=0;ch<s->nb_all_channels;ch++) {
 put_bits(&s->pb, 4, s->fsnroffst[ch]);
 put_bits(&s->pb, 3, s->fgaincod[ch]);
 }
 }
 put_bits(&s->pb, 1, 0); /* no delta bit allocation */
 put_bits(&s->pb, 1, 0); /* no data to skip */
 /* mantissa encoding : we use two passes to handle the grouping. A
 one pass method may be faster, but it would necessitate to
 }
 /* second pass : output the values */
 for (ch = 0; ch < s->nb_all_channels; ch++) {
 int b, q;
 for(i=0;i<s->nb_coefs[ch];i++) {
 q = qmant[ch][i];
 b = bap[ch][i];
 switch(b) {
 case 0:
 break;
 case 1:
 if (q != 128)
 put_bits(&s->pb, 5, q);
 break;
 case 2:
 if (q != 128)
 put_bits(&s->pb, 7, q);
 break;
 case 3:
 put_bits(&s->pb, 3, q);
 break;
 unsigned int c, n, k;
 for(n=0;n<256;n++) {
 c = n << 8;
 for (k = 0; k < 8; k++) {
 if (c & (1 << 15))
 c = ((c << 1) & 0xffff) ^ (CRC16_POLY & 0xffff);
 else
 c = c << 1;
 }
 crc_table[n] = c;
 frame = s->pb.buf;
 n = 2 * s->frame_size - (pbBufPtr(&s->pb) - frame) - 2;
 assert(n >= 0);
 if(n>0)
 memset(pbBufPtr(&s->pb), 0, n);
 /* Now we must compute both crcs : this is not so easy for crc1
 because it is at the beginning of the data... */
 frame_size_58 = (frame_size >> 1) + (frame_size >> 3);
 crc1 = ac3_crc(frame + 4, (2 * frame_size_58) - 4, 0);
 /* XXX: could precompute crc_inv */
 crc_inv = pow_poly((CRC16_POLY >> 1), (16 * frame_size_58) - 16, CRC16_POLY);
 crc1 = mul_poly(crc_inv, crc1, CRC16_POLY);
 frame[2] = crc1 >> 8;
 frame[3] = crc1;
 crc2 = ac3_crc(frame + 2 * frame_size_58, (frame_size - frame_size_58) * 2 - 2, 0);
 frame[2*frame_size - 2] = crc2 >> 8;
 frame[2*frame_size - 1] = crc2;
 //    printf("n=%d frame_size=%d\n", n, frame_size);
 sinc = s->nb_all_channels;
 sptr = samples + (sinc * (N/2) * i) + ch;
 for(j=0;j<N/2;j++) {
 v = *sptr;
 input_samples[j + N/2] = v;
 s->last_samples[ch][j] = v;
 sptr += sinc;
 }
 /* apply the MDCT window */
 for(j=0;j<N/2;j++) {
 input_samples[j] = MUL16(input_samples[j],
 ac3_window[j]) >> 15;
 input_samples[N-j-1] = MUL16(input_samples[N-j-1],
 ac3_window[j]) >> 15;
 }
 /* Normalize the samples to use the maximum available
 precision */
 v = 14 - log2_tab(input_samples, N);
 if (v < 0)
 v = 0;
 exp_samples[i][ch] = v - 8;
 lshift_tab(input_samples, N, v);
 /* do the MDCT */
 mdct512(mdct_coef[i][ch], input_samples);
 /* compute "exponents". We take into account the
 normalization there */
 for(j=0;j<N/2;j++) {
 int e;
 v = abs(mdct_coef[i][ch][j]);
 }
 }
 exp[i][ch][j] = e;
 }
 }
 compute_exp_strategy(exp_strategy, exp, ch, ch == s->lfe_channel);
 /* compute the exponents as the decoder will see them. The
 EXP_REUSE case must be handled carefully : we select the
 min of the exponents */
 while (j < NB_BLOCKS && exp_strategy[j][ch] == EXP_REUSE) {
 exponent_min(exp[i][ch], exp[j][ch], s->nb_coefs[ch]);
 j++;
 }
 frame_bits += encode_exp(encoded_exp[i][ch],
 exp[i][ch], s->nb_coefs[ch],
 exp_strategy[i][ch]);
 /* copy encoded exponents for reuse case */
 for(k=i+1;k<j;k++) {
 memcpy(encoded_exp[k][ch], encoded_exp[i][ch],
 s->nb_coefs[ch] * sizeof(uint8_t));
 }
 i = j;
 }
 }
 compute_bit_allocation(s, bap, encoded_exp, exp_strategy, frame_bits);
 /* everything is known... let's output the frame */
 output_frame_header(s, frame);
 for(i=0;i<NB_BLOCKS;i++) {
 output_audio_block(s, exp_strategy[i], encoded_exp[i],
 bap[i], mdct_coef[i], exp_samples[i], i);
 }
 return output_frame_end(s);
 }
 for(n=0;n<FN;n++) {
 a = -2 * M_PI * (n * k) / FN;
 sum_re += in1[n].re * cos(a) - in1[n].im * sin(a);
 sum_im += in1[n].re * sin(a) + in1[n].im * cos(a);
 }
 printf("%3d: %6d,%6d %6.0f,%6.0f\n",
 k, in[k].re, in[k].im, sum_re / FN, sum_im / FN);
 }
 }
 void mdct_test(void)
 {
 input[i] = (random() % 65535 - 32767) * 9 / 10;
 input1[i] = input[i];
 }
 mdct512(output, input);
 /* do it by hand */
 for(k=0;k<N/2;k++) {
 s = 0;
 for(n=0;n<N;n++) {
 a = (2*M_PI*(2*n+1+N/2)*(2*k+1) / (4 * N));
 s += input1[n] * cos(a);
 }
 output1[k] = -2 * s / N;
 }
 err = 0;
 emax = 0;
 for(i=0;i<N/2;i++) {
 printf("%3d: %7d %7.0f\n", i, output[i], output1[i]);
 e = output[i] - output1[i];
 {
 AC3EncodeContext ctx;
 unsigned char frame[AC3_MAX_CODED_FRAME_SIZE];
 short samples[AC3_FRAME_SIZE];
 int ret, i;
 AC3_encode_init(&ctx, 44100, 64000, 1);
 fft_test();
 mdct_test();

Mercurial > libavcodec.hg

comparison ac3enc.c @ 2967:ef2149182f1c libavcodec