Go to the documentation of this file.
31 if (!num_reuse_blocks)
34 for (
i = 0;
i < nb_coefs;
i++) {
37 for (
blk = 0;
blk < num_reuse_blocks;
blk++) {
39 if (next_exp < min_exp)
58 uint32_t *src32 = (uint32_t *)
src;
59 const uint32_t
mask = ~(((1 <<
shift) - 1) << 16);
62 for (
i = 0;
i <
len;
i += 8) {
92 const float scale = 1 << 24;
108 int snr_offset,
int floor,
111 int bin, band, band_end;
114 if (snr_offset == -960) {
122 int m = (
FFMAX(
mask[band] - snr_offset - floor, 0) & 0x1FE0) + floor;
126 for (; bin < band_end; bin++) {
127 int address = av_clip_uintp2((psd[bin] - m) >> 5, 6);
130 }
while (
end > band_end);
137 mant_cnt[bap[
len]]++;
141 0, 0, 0, 3, 0, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16
151 bits += (mant_cnt[
blk][1] / 3) * 5;
154 bits += ((mant_cnt[
blk][2] / 3) + (mant_cnt[
blk][4] >> 1)) * 7;
158 for (bap = 5; bap < 16; bap++)
168 for (
i = 0;
i < nb_coefs;
i++) {
169 int v =
abs(coef[
i]);
181 sum[0] = sum[1] = sum[2] = sum[3] = 0;
183 for (
i = 0;
i <
len;
i++) {
188 MAC64(sum[0], lt, lt);
189 MAC64(sum[1], rt, rt);
191 MAC64(sum[3], sd, sd);
202 sum[0] = sum[1] = sum[2] = sum[3] = 0;
204 for (
i = 0;
i <
len;
i++) {
221 float front_mix = matrix[0][0];
222 float center_mix = matrix[0][1];
223 float surround_mix = matrix[0][3];
225 for (
i = 0;
i <
len;
i++) {
243 float front_mix = matrix[0][0];
244 float center_mix = matrix[0][1];
245 float surround_mix = matrix[0][3];
247 for (
i = 0;
i <
len;
i++) {
257 int out_ch,
int in_ch,
int len)
263 for (
i = 0;
i <
len;
i++) {
265 for (j = 0; j < in_ch; j++) {
272 }
else if (out_ch == 1) {
273 for (
i = 0;
i <
len;
i++) {
275 for (j = 0; j < in_ch; j++)
287 int16_t front_mix = matrix[0][0];
288 int16_t center_mix = matrix[0][1];
289 int16_t surround_mix = matrix[0][3];
291 for (
i = 0;
i <
len;
i++) {
293 (int64_t)
samples[1][
i] * center_mix +
294 (int64_t)
samples[3][
i] * surround_mix;
296 v1 = (int64_t)
samples[1][
i] * center_mix +
297 (int64_t)
samples[2][
i] * front_mix +
298 (int64_t)
samples[4][
i] * surround_mix;
310 int16_t front_mix = matrix[0][0];
311 int16_t center_mix = matrix[0][1];
312 int16_t surround_mix = matrix[0][3];
314 for (
i = 0;
i <
len;
i++) {
316 (int64_t)
samples[1][
i] * center_mix +
317 (int64_t)
samples[2][
i] * front_mix +
318 (int64_t)
samples[3][
i] * surround_mix +
319 (int64_t)
samples[4][
i] * surround_mix;
326 int out_ch,
int in_ch,
int len)
331 for (
i = 0;
i <
len;
i++) {
333 for (j = 0; j < in_ch; j++) {
335 v1 += (int64_t)
samples[j][
i] * matrix[1][j];
340 }
else if (out_ch == 1) {
341 for (
i = 0;
i <
len;
i++) {
343 for (j = 0; j < in_ch; j++)
351 int out_ch,
int in_ch,
int len)
353 if (
c->in_channels != in_ch ||
c->out_channels != out_ch) {
354 c->in_channels = in_ch;
355 c->out_channels = out_ch;
356 c->downmix_fixed =
NULL;
358 if (in_ch == 5 && out_ch == 2 &&
359 !(matrix[1][0] | matrix[0][2] |
360 matrix[1][3] | matrix[0][4] |
361 (matrix[0][1] ^ matrix[1][1]) |
362 (matrix[0][0] ^ matrix[1][2]))) {
364 }
else if (in_ch == 5 && out_ch == 1 &&
365 matrix[0][0] == matrix[0][2] &&
366 matrix[0][3] == matrix[0][4]) {
371 if (
c->downmix_fixed)
383 for (
i = 0;
i < len2;
i++) {
391 int out_ch,
int in_ch,
int len)
393 if (
c->in_channels != in_ch ||
c->out_channels != out_ch) {
394 int **matrix_cmp = (
int **)matrix;
396 c->in_channels = in_ch;
397 c->out_channels = out_ch;
400 if (in_ch == 5 && out_ch == 2 &&
401 !(matrix_cmp[1][0] | matrix_cmp[0][2] |
402 matrix_cmp[1][3] | matrix_cmp[0][4] |
403 (matrix_cmp[0][1] ^ matrix_cmp[1][1]) |
404 (matrix_cmp[0][0] ^ matrix_cmp[1][2]))) {
406 }
else if (in_ch == 5 && out_ch == 1 &&
407 matrix_cmp[0][0] == matrix_cmp[0][2] &&
408 matrix_cmp[0][3] == matrix_cmp[0][4]) {
438 c->downmix_fixed =
NULL;
static int ac3_max_msb_abs_int16_c(const int16_t *src, int len)
static int ac3_compute_mantissa_size_c(uint16_t mant_cnt[6][16])
const uint8_t ff_ac3_bin_to_band_tab[253]
Map each frequency coefficient bin to the critical band that contains it.
filter_frame For filters that do not use the this method is called when a frame is pushed to the filter s input It can be called at any time except in a reentrant way If the input frame is enough to produce output
static void ac3_rshift_int32_c(int32_t *src, unsigned int len, unsigned int shift)
static av_cold int end(AVCodecContext *avctx)
void ff_ac3dsp_init_arm(AC3DSPContext *c, int bit_exact)
static void ac3_lshift_int16_c(int16_t *src, unsigned int len, unsigned int shift)
static void ac3_sum_square_butterfly_float_c(float sum[4], const float *coef0, const float *coef1, int len)
static SDL_Window * window
static void apply_window_int16_c(int16_t *output, const int16_t *input, const int16_t *window, unsigned int len)
static void ac3_downmix_c(float **samples, float **matrix, int out_ch, int in_ch, int len)
static void ac3_update_bap_counts_c(uint16_t mant_cnt[16], uint8_t *bap, int len)
void ff_ac3dsp_set_downmix_x86(AC3DSPContext *c)
static const uint16_t mask[17]
const uint8_t ff_ac3_band_start_tab[AC3_CRITICAL_BANDS+1]
Starting frequency coefficient bin for each critical band.
void ff_ac3dsp_init_mips(AC3DSPContext *c, int bit_exact)
const uint16_t ff_ac3_bap_bits[16]
Number of mantissa bits written for each bap value.
static void ac3_extract_exponents_c(uint8_t *exp, int32_t *coef, int nb_coefs)
Undefined Behavior In the C some operations are like signed integer dereferencing freed accessing outside allocated Undefined Behavior must not occur in a C it is not safe even if the output of undefined operations is unused The unsafety may seem nit picking but Optimizing compilers have in fact optimized code on the assumption that no undefined Behavior occurs Optimizing code based on wrong assumptions can and has in some cases lead to effects beyond the output of computations The signed integer overflow problem in speed critical code Code which is highly optimized and works with signed integers sometimes has the problem that often the output of the computation does not c
static void ac3_downmix_5_to_1_symmetric_c_fixed(int32_t **samples, int16_t **matrix, int len)
static void float_to_fixed24_c(int32_t *dst, const float *src, unsigned int len)
static void ac3_downmix_5_to_2_symmetric_c(float **samples, float **matrix, int len)
and forward the test the status of outputs and forward it to the corresponding return FFERROR_NOT_READY If the filters stores internally one or a few frame for some input
static void ac3_sum_square_butterfly_int32_c(int64_t sum[4], const int32_t *coef0, const int32_t *coef1, int len)
static void ac3_bit_alloc_calc_bap_c(int16_t *mask, int16_t *psd, int start, int end, int snr_offset, int floor, const uint8_t *bap_tab, uint8_t *bap)
#define DECLARE_ALIGNED(n, t, v)
#define i(width, name, range_min, range_max)
static void ac3_downmix_5_to_2_symmetric_c_fixed(int32_t **samples, int16_t **matrix, int len)
void ff_ac3dsp_init_x86(AC3DSPContext *c, int bit_exact)
void ff_ac3dsp_downmix(AC3DSPContext *c, float **samples, float **matrix, int out_ch, int in_ch, int len)
void ff_ac3dsp_downmix_fixed(AC3DSPContext *c, int32_t **samples, int16_t **matrix, int out_ch, int in_ch, int len)
Filter the word “frame” indicates either a video frame or a group of audio samples
static const uint8_t bap_tab[64]
static int shift(int a, int b)
av_cold void ff_ac3dsp_init(AC3DSPContext *c, int bit_exact)
static void ac3_downmix_5_to_1_symmetric_c(float **samples, float **matrix, int len)
static void ac3_exponent_min_c(uint8_t *exp, int num_reuse_blocks, int nb_coefs)
static void ac3_downmix_c_fixed(int32_t **samples, int16_t **matrix, int out_ch, int in_ch, int len)