mirror of
https://github.com/FFmpeg/FFmpeg.git
synced 2024-11-21 10:55:51 +02:00
4fa0e24736
* newdev/master: (33 commits) Fix an infinite loop when RoQ encoded generated a frame with a size greater than the maximum valid size. Add kbdwin.o to AC3 decoder Detect byte-swapped AC-3 and support decoding it directly. cosmetics: indentation Always copy input data for AC3 decoder. ac3enc: make sym_quant() branch-free cosmetics: indentation Add a CPU flag for the Atom processor. id3v2: skip broken tags with invalid size id3v2: don't explicitly skip padding Make sure kbhit() is in conio.h fate: update wmv8-drm reference vc1: make P-frame deblock filter bit-exact. configure: Add the -D parameter to the dlltool command amr: Set the AVFMT_GENERIC_INDEX flag amr: Set the pkt->pos field properly to the start of the packet amr: Set the codec->bit_rate field based on the last packet rtsp: Specify unicast for TCP interleaved streams, too Set the correct target for mingw64 dlltool applehttp: Change the variable for stream position in seconds into int64_t ... Conflicts: ffmpeg.c ffplay.c libavcodec/ac3dec.c libavformat/avio.h libavformat/id3v2.c Merged-by: Michael Niedermayer <michaelni@gmx.at>
112 lines
3.5 KiB
C
112 lines
3.5 KiB
C
/*
|
|
* Copyright (c) 2000, 2001, 2002 Fabrice Bellard
|
|
* Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
|
|
*
|
|
* This file is part of FFmpeg.
|
|
*
|
|
* FFmpeg is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
*
|
|
* FFmpeg is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with FFmpeg; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#ifndef AVCODEC_FFT_H
|
|
#define AVCODEC_FFT_H
|
|
|
|
#include <stdint.h>
|
|
#include "config.h"
|
|
#include "libavutil/mem.h"
|
|
#include "avfft.h"
|
|
|
|
/* FFT computation */
|
|
|
|
struct FFTContext {
|
|
int nbits;
|
|
int inverse;
|
|
uint16_t *revtab;
|
|
FFTComplex *tmp_buf;
|
|
int mdct_size; /* size of MDCT (i.e. number of input data * 2) */
|
|
int mdct_bits; /* n = 2^nbits */
|
|
/* pre/post rotation tables */
|
|
FFTSample *tcos;
|
|
FFTSample *tsin;
|
|
/**
|
|
* Do the permutation needed BEFORE calling fft_calc().
|
|
*/
|
|
void (*fft_permute)(struct FFTContext *s, FFTComplex *z);
|
|
/**
|
|
* Do a complex FFT with the parameters defined in ff_fft_init(). The
|
|
* input data must be permuted before. No 1.0/sqrt(n) normalization is done.
|
|
*/
|
|
void (*fft_calc)(struct FFTContext *s, FFTComplex *z);
|
|
void (*imdct_calc)(struct FFTContext *s, FFTSample *output, const FFTSample *input);
|
|
void (*imdct_half)(struct FFTContext *s, FFTSample *output, const FFTSample *input);
|
|
void (*mdct_calc)(struct FFTContext *s, FFTSample *output, const FFTSample *input);
|
|
int fft_permutation;
|
|
#define FF_FFT_PERM_DEFAULT 0
|
|
#define FF_FFT_PERM_SWAP_LSBS 1
|
|
int mdct_permutation;
|
|
#define FF_MDCT_PERM_NONE 0
|
|
#define FF_MDCT_PERM_INTERLEAVE 1
|
|
};
|
|
|
|
#if CONFIG_HARDCODED_TABLES
|
|
#define COSTABLE_CONST const
|
|
#else
|
|
#define COSTABLE_CONST
|
|
#endif
|
|
|
|
#define COSTABLE(size) \
|
|
COSTABLE_CONST DECLARE_ALIGNED(16, FFTSample, ff_cos_##size)[size/2]
|
|
|
|
extern COSTABLE(16);
|
|
extern COSTABLE(32);
|
|
extern COSTABLE(64);
|
|
extern COSTABLE(128);
|
|
extern COSTABLE(256);
|
|
extern COSTABLE(512);
|
|
extern COSTABLE(1024);
|
|
extern COSTABLE(2048);
|
|
extern COSTABLE(4096);
|
|
extern COSTABLE(8192);
|
|
extern COSTABLE(16384);
|
|
extern COSTABLE(32768);
|
|
extern COSTABLE(65536);
|
|
extern COSTABLE_CONST FFTSample* const ff_cos_tabs[17];
|
|
|
|
/**
|
|
* Initialize the cosine table in ff_cos_tabs[index]
|
|
* \param index index in ff_cos_tabs array of the table to initialize
|
|
*/
|
|
void ff_init_ff_cos_tabs(int index);
|
|
|
|
/**
|
|
* Set up a complex FFT.
|
|
* @param nbits log2 of the length of the input array
|
|
* @param inverse if 0 perform the forward transform, if 1 perform the inverse
|
|
*/
|
|
int ff_fft_init(FFTContext *s, int nbits, int inverse);
|
|
|
|
void ff_fft_init_altivec(FFTContext *s);
|
|
void ff_fft_init_mmx(FFTContext *s);
|
|
void ff_fft_init_arm(FFTContext *s);
|
|
|
|
void ff_fft_end(FFTContext *s);
|
|
|
|
int ff_mdct_init(FFTContext *s, int nbits, int inverse, double scale);
|
|
void ff_imdct_calc_c(FFTContext *s, FFTSample *output, const FFTSample *input);
|
|
void ff_imdct_half_c(FFTContext *s, FFTSample *output, const FFTSample *input);
|
|
void ff_mdct_calc_c(FFTContext *s, FFTSample *output, const FFTSample *input);
|
|
void ff_mdct_end(FFTContext *s);
|
|
|
|
#endif /* AVCODEC_FFT_H */
|