N 201 libavcodec/ac3enc.c int16_t rot[N];
N 202 libavcodec/ac3enc.c IComplex x[N/4];
N 205 libavcodec/ac3enc.c for(i=0;i<N/4;i++)
N 206 libavcodec/ac3enc.c rot[i] = -in[i + 3*N/4];
N 207 libavcodec/ac3enc.c for(i=N/4;i<N;i++)
N 208 libavcodec/ac3enc.c rot[i] = in[i - N/4];
N 211 libavcodec/ac3enc.c for(i=0;i<N/4;i++) {
N 212 libavcodec/ac3enc.c re = ((int)rot[2*i] - (int)rot[N-1-2*i]) >> 1;
N 213 libavcodec/ac3enc.c im = -((int)rot[N/2+2*i] - (int)rot[N/2-1-2*i]) >> 1;
N 220 libavcodec/ac3enc.c for(i=0;i<N/4;i++) {
N 225 libavcodec/ac3enc.c out[N/2-1-2*i] = re1;
N 241 libavcodec/ac3enc.c uint8_t exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],
N 251 libavcodec/ac3enc.c exp_diff = calc_exp_diff(exp[i][ch], exp[i-1][ch], N/2);
N 287 libavcodec/ac3enc.c static void exponent_min(uint8_t exp[N/2], uint8_t exp1[N/2], int n)
N 299 libavcodec/ac3enc.c static int encode_exp(uint8_t encoded_exp[N/2],
N 300 libavcodec/ac3enc.c uint8_t exp[N/2],
N 305 libavcodec/ac3enc.c uint8_t exp1[N/2];
N 419 libavcodec/ac3enc.c uint8_t encoded_exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],
N 421 libavcodec/ac3enc.c int16_t psd[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],
N 430 libavcodec/ac3enc.c memcpy(psd[blk][ch], psd[blk-1][ch], (N/2)*sizeof(int16_t));
N 449 libavcodec/ac3enc.c int16_t psd[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],
N 450 libavcodec/ac3enc.c uint8_t bap[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],
N 483 libavcodec/ac3enc.c uint8_t bap[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],
N 484 libavcodec/ac3enc.c uint8_t encoded_exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2],
N 490 libavcodec/ac3enc.c uint8_t bap1[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];
N 491 libavcodec/ac3enc.c int16_t psd[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];
N 696 libavcodec/ac3enc.c for(i=0;i<N/4;i++) {
N 697 libavcodec/ac3enc.c alpha = 2 * M_PI * (i + 1.0 / 8.0) / (float)N;
N 779 libavcodec/ac3enc.c uint8_t encoded_exp[AC3_MAX_CHANNELS][N/2],
N 780 libavcodec/ac3enc.c uint8_t bap[AC3_MAX_CHANNELS][N/2],
N 781 libavcodec/ac3enc.c int32_t mdct_coefs[AC3_MAX_CHANNELS][N/2],
N 787 libavcodec/ac3enc.c uint16_t qmant[AC3_MAX_CHANNELS][N/2];
N 1151 libavcodec/ac3enc.c int16_t input_samples[N];
N 1152 libavcodec/ac3enc.c int32_t mdct_coef[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];
N 1153 libavcodec/ac3enc.c uint8_t exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];
N 1155 libavcodec/ac3enc.c uint8_t encoded_exp[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];
N 1156 libavcodec/ac3enc.c uint8_t bap[NB_BLOCKS][AC3_MAX_CHANNELS][N/2];
N 1168 libavcodec/ac3enc.c memcpy(input_samples, s->last_samples[ch], N/2 * sizeof(int16_t));
N 1170 libavcodec/ac3enc.c sptr = samples + (sinc * (N/2) * i) + ch;
N 1171 libavcodec/ac3enc.c for(j=0;j<N/2;j++) {
N 1173 libavcodec/ac3enc.c input_samples[j + N/2] = v;
N 1179 libavcodec/ac3enc.c for(j=0;j<N/2;j++) {
N 1182 libavcodec/ac3enc.c input_samples[N-j-1] = MUL16(input_samples[N-j-1],
N 1188 libavcodec/ac3enc.c v = 14 - log2_tab(input_samples, N);
N 1192 libavcodec/ac3enc.c lshift_tab(input_samples, N, v);
N 1199 libavcodec/ac3enc.c for(j=0;j<N/2;j++) {
N 1270 libavcodec/ac3enc.c #define FN (N/4)
N 1303 libavcodec/ac3enc.c int16_t input[N];
N 1304 libavcodec/ac3enc.c int32_t output[N/2];
N 1305 libavcodec/ac3enc.c float input1[N];
N 1306 libavcodec/ac3enc.c float output1[N/2];
N 1310 libavcodec/ac3enc.c for(i=0;i<N;i++) {
N 1318 libavcodec/ac3enc.c for(k=0;k<N/2;k++) {
N 1320 libavcodec/ac3enc.c for(n=0;n<N;n++) {
N 1321 libavcodec/ac3enc.c a = (2*M_PI*(2*n+1+N/2)*(2*k+1) / (4 * N));
N 1324 libavcodec/ac3enc.c output1[k] = -2 * s / N;
N 1329 libavcodec/ac3enc.c for(i=0;i<N/2;i++) {
N 1336 libavcodec/ac3enc.c printf("err2=%f emax=%f\n", err / (N/2), emax);
N 46 libavcodec/jpegls.c state->N[i] = 1;
N 40 libavcodec/jpegls.h int A[367], B[367], C[365], N[367];
N 80 libavcodec/jpegls.h if(state->N[Q] == state->reset){
N 83 libavcodec/jpegls.h state->N[Q] >>=1;
N 85 libavcodec/jpegls.h state->N[Q]++;
N 95 libavcodec/jpegls.h if(state->B[Q] <= -state->N[Q]) {
N 96 libavcodec/jpegls.h state->B[Q]= FFMAX(state->B[Q] + state->N[Q], 1-state->N[Q]);
N 100 libavcodec/jpegls.h state->B[Q]= FFMIN(state->B[Q] - state->N[Q], 0);
N 93 libavcodec/jpeglsdec.c for(k = 0; (state->N[Q] << k) < state->A[Q]; k++);
N 107 libavcodec/jpeglsdec.c if(!state->near && !k && (2 * state->B[Q] <= -state->N[Q]))
N 124 libavcodec/jpeglsdec.c temp += state->N[Q] >> 1;
N 126 libavcodec/jpeglsdec.c for(k = 0; (state->N[Q] << k) < temp; k++);
N 135 libavcodec/jpeglsdec.c if(!k && (RItype || ret) && (2 * state->B[Q] < state->N[Q]))
N 45 libavcodec/jpeglsenc.c for(k = 0; (state->N[Q] << k) < state->A[Q]; k++);
N 47 libavcodec/jpeglsenc.c map = !state->near && !k && (2 * state->B[Q] <= -state->N[Q]);
N 73 libavcodec/jpeglsenc.c temp += state->N[Q] >> 1;
N 74 libavcodec/jpeglsenc.c for(k = 0; (state->N[Q] << k) < temp; k++);
N 76 libavcodec/jpeglsenc.c if(!k && err && (2 * state->B[Q] < state->N[Q]))