2006-06-24 13:20:15 +03:00
|
|
|
/**
|
|
|
|
* FLAC audio encoder
|
2008-08-17 01:42:59 +03:00
|
|
|
* Copyright (c) 2006 Justin Ruggles <justin.ruggles@gmail.com>
|
2006-06-24 13:20:15 +03:00
|
|
|
*
|
2006-10-07 18:30:46 +03:00
|
|
|
* This file is part of FFmpeg.
|
|
|
|
*
|
|
|
|
* FFmpeg is free software; you can redistribute it and/or
|
2006-06-24 13:20:15 +03:00
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
2006-10-07 18:30:46 +03:00
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
2006-06-24 13:20:15 +03:00
|
|
|
*
|
2006-10-07 18:30:46 +03:00
|
|
|
* FFmpeg is distributed in the hope that it will be useful,
|
2006-06-24 13:20:15 +03:00
|
|
|
* 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
|
2006-10-07 18:30:46 +03:00
|
|
|
* License along with FFmpeg; if not, write to the Free Software
|
2006-06-24 13:20:15 +03:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
|
|
|
|
2008-05-09 14:56:36 +03:00
|
|
|
#include "libavutil/crc.h"
|
2008-09-15 00:39:54 +03:00
|
|
|
#include "libavutil/md5.h"
|
2006-06-24 13:20:15 +03:00
|
|
|
#include "avcodec.h"
|
2009-04-13 19:20:26 +03:00
|
|
|
#include "get_bits.h"
|
2007-09-30 01:31:18 +03:00
|
|
|
#include "dsputil.h"
|
2006-06-24 13:20:15 +03:00
|
|
|
#include "golomb.h"
|
2008-08-16 20:18:20 +03:00
|
|
|
#include "lpc.h"
|
2009-03-19 05:04:21 +02:00
|
|
|
#include "flac.h"
|
2009-03-21 03:16:38 +02:00
|
|
|
#include "flacdata.h"
|
2006-06-24 13:20:15 +03:00
|
|
|
|
|
|
|
#define FLAC_SUBFRAME_CONSTANT 0
|
|
|
|
#define FLAC_SUBFRAME_VERBATIM 1
|
|
|
|
#define FLAC_SUBFRAME_FIXED 8
|
|
|
|
#define FLAC_SUBFRAME_LPC 32
|
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
#define MAX_FIXED_ORDER 4
|
|
|
|
#define MAX_PARTITION_ORDER 8
|
|
|
|
#define MAX_PARTITIONS (1 << MAX_PARTITION_ORDER)
|
|
|
|
#define MAX_LPC_PRECISION 15
|
|
|
|
#define MAX_LPC_SHIFT 15
|
|
|
|
#define MAX_RICE_PARAM 14
|
|
|
|
|
|
|
|
typedef struct CompressionOptions {
|
|
|
|
int compression_level;
|
|
|
|
int block_time_ms;
|
|
|
|
int use_lpc;
|
|
|
|
int lpc_coeff_precision;
|
|
|
|
int min_prediction_order;
|
|
|
|
int max_prediction_order;
|
|
|
|
int prediction_order_method;
|
|
|
|
int min_partition_order;
|
|
|
|
int max_partition_order;
|
|
|
|
} CompressionOptions;
|
|
|
|
|
2006-06-28 00:01:21 +03:00
|
|
|
typedef struct RiceContext {
|
|
|
|
int porder;
|
2006-07-02 13:22:31 +03:00
|
|
|
int params[MAX_PARTITIONS];
|
2006-06-28 00:01:21 +03:00
|
|
|
} RiceContext;
|
|
|
|
|
2006-06-24 13:20:15 +03:00
|
|
|
typedef struct FlacSubframe {
|
|
|
|
int type;
|
|
|
|
int type_code;
|
|
|
|
int obits;
|
|
|
|
int order;
|
2006-07-02 13:22:31 +03:00
|
|
|
int32_t coefs[MAX_LPC_ORDER];
|
|
|
|
int shift;
|
2006-06-28 00:01:21 +03:00
|
|
|
RiceContext rc;
|
2006-06-24 13:20:15 +03:00
|
|
|
int32_t samples[FLAC_MAX_BLOCKSIZE];
|
2007-09-26 02:34:48 +03:00
|
|
|
int32_t residual[FLAC_MAX_BLOCKSIZE+1];
|
2006-06-24 13:20:15 +03:00
|
|
|
} FlacSubframe;
|
|
|
|
|
|
|
|
typedef struct FlacFrame {
|
2009-03-19 05:04:21 +02:00
|
|
|
FlacSubframe subframes[FLAC_MAX_CHANNELS];
|
2006-06-24 13:20:15 +03:00
|
|
|
int blocksize;
|
|
|
|
int bs_code[2];
|
|
|
|
uint8_t crc8;
|
|
|
|
int ch_mode;
|
|
|
|
} FlacFrame;
|
|
|
|
|
|
|
|
typedef struct FlacEncodeContext {
|
|
|
|
PutBitContext pb;
|
2009-03-21 03:20:28 +02:00
|
|
|
int channels;
|
|
|
|
int samplerate;
|
2006-06-24 13:20:15 +03:00
|
|
|
int sr_code[2];
|
2009-04-16 05:28:49 +03:00
|
|
|
int max_blocksize;
|
2008-09-15 01:25:50 +03:00
|
|
|
int min_framesize;
|
2009-03-21 03:20:28 +02:00
|
|
|
int max_framesize;
|
2008-09-15 01:25:50 +03:00
|
|
|
int max_encoded_framesize;
|
2006-06-24 13:20:15 +03:00
|
|
|
uint32_t frame_count;
|
2008-09-14 23:00:36 +03:00
|
|
|
uint64_t sample_count;
|
2008-09-15 00:39:54 +03:00
|
|
|
uint8_t md5sum[16];
|
2006-06-24 13:20:15 +03:00
|
|
|
FlacFrame frame;
|
2006-07-02 13:22:31 +03:00
|
|
|
CompressionOptions options;
|
2006-06-28 00:01:21 +03:00
|
|
|
AVCodecContext *avctx;
|
2007-09-30 01:31:18 +03:00
|
|
|
DSPContext dsp;
|
2008-09-15 00:39:54 +03:00
|
|
|
struct AVMD5 *md5ctx;
|
2006-06-24 13:20:15 +03:00
|
|
|
} FlacEncodeContext;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Writes streaminfo metadata block to byte array
|
|
|
|
*/
|
|
|
|
static void write_streaminfo(FlacEncodeContext *s, uint8_t *header)
|
|
|
|
{
|
|
|
|
PutBitContext pb;
|
|
|
|
|
|
|
|
memset(header, 0, FLAC_STREAMINFO_SIZE);
|
|
|
|
init_put_bits(&pb, header, FLAC_STREAMINFO_SIZE);
|
|
|
|
|
|
|
|
/* streaminfo metadata block */
|
2009-04-16 05:28:49 +03:00
|
|
|
put_bits(&pb, 16, s->max_blocksize);
|
|
|
|
put_bits(&pb, 16, s->max_blocksize);
|
2008-09-15 01:25:50 +03:00
|
|
|
put_bits(&pb, 24, s->min_framesize);
|
2006-06-24 13:20:15 +03:00
|
|
|
put_bits(&pb, 24, s->max_framesize);
|
|
|
|
put_bits(&pb, 20, s->samplerate);
|
|
|
|
put_bits(&pb, 3, s->channels-1);
|
|
|
|
put_bits(&pb, 5, 15); /* bits per sample - 1 */
|
2008-09-14 23:00:36 +03:00
|
|
|
/* write 36-bit sample count in 2 put_bits() calls */
|
|
|
|
put_bits(&pb, 24, (s->sample_count & 0xFFFFFF000LL) >> 12);
|
|
|
|
put_bits(&pb, 12, s->sample_count & 0x000000FFFLL);
|
2006-06-24 13:20:15 +03:00
|
|
|
flush_put_bits(&pb);
|
2008-09-15 00:39:54 +03:00
|
|
|
memcpy(&header[18], s->md5sum, 16);
|
2006-06-24 13:20:15 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Sets blocksize based on samplerate
|
|
|
|
* Chooses the closest predefined blocksize >= BLOCK_TIME_MS milliseconds
|
|
|
|
*/
|
2006-07-02 13:22:31 +03:00
|
|
|
static int select_blocksize(int samplerate, int block_time_ms)
|
2006-06-24 13:20:15 +03:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int target;
|
|
|
|
int blocksize;
|
|
|
|
|
|
|
|
assert(samplerate > 0);
|
2009-03-21 03:16:38 +02:00
|
|
|
blocksize = ff_flac_blocksize_table[1];
|
2006-07-02 13:22:31 +03:00
|
|
|
target = (samplerate * block_time_ms) / 1000;
|
2006-06-24 16:56:29 +03:00
|
|
|
for(i=0; i<16; i++) {
|
2009-03-21 03:16:38 +02:00
|
|
|
if(target >= ff_flac_blocksize_table[i] && ff_flac_blocksize_table[i] > blocksize) {
|
|
|
|
blocksize = ff_flac_blocksize_table[i];
|
2006-06-24 13:20:15 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return blocksize;
|
|
|
|
}
|
|
|
|
|
2008-03-21 05:11:20 +02:00
|
|
|
static av_cold int flac_encode_init(AVCodecContext *avctx)
|
2006-06-24 13:20:15 +03:00
|
|
|
{
|
|
|
|
int freq = avctx->sample_rate;
|
|
|
|
int channels = avctx->channels;
|
|
|
|
FlacEncodeContext *s = avctx->priv_data;
|
2006-07-02 14:06:27 +03:00
|
|
|
int i, level;
|
2006-06-24 13:20:15 +03:00
|
|
|
uint8_t *streaminfo;
|
|
|
|
|
2006-06-28 00:01:21 +03:00
|
|
|
s->avctx = avctx;
|
|
|
|
|
2007-09-30 01:31:18 +03:00
|
|
|
dsputil_init(&s->dsp, avctx);
|
|
|
|
|
2006-06-24 13:20:15 +03:00
|
|
|
if(avctx->sample_fmt != SAMPLE_FMT_S16) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2009-03-19 05:04:21 +02:00
|
|
|
if(channels < 1 || channels > FLAC_MAX_CHANNELS) {
|
2006-06-24 13:20:15 +03:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
s->channels = channels;
|
|
|
|
|
|
|
|
/* find samplerate in table */
|
|
|
|
if(freq < 1)
|
|
|
|
return -1;
|
|
|
|
for(i=4; i<12; i++) {
|
2009-03-21 03:16:38 +02:00
|
|
|
if(freq == ff_flac_sample_rate_table[i]) {
|
|
|
|
s->samplerate = ff_flac_sample_rate_table[i];
|
2006-06-24 13:20:15 +03:00
|
|
|
s->sr_code[0] = i;
|
|
|
|
s->sr_code[1] = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* if not in table, samplerate is non-standard */
|
|
|
|
if(i == 12) {
|
|
|
|
if(freq % 1000 == 0 && freq < 255000) {
|
|
|
|
s->sr_code[0] = 12;
|
|
|
|
s->sr_code[1] = freq / 1000;
|
|
|
|
} else if(freq % 10 == 0 && freq < 655350) {
|
|
|
|
s->sr_code[0] = 14;
|
|
|
|
s->sr_code[1] = freq / 10;
|
|
|
|
} else if(freq < 65535) {
|
|
|
|
s->sr_code[0] = 13;
|
|
|
|
s->sr_code[1] = freq;
|
|
|
|
} else {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
s->samplerate = freq;
|
|
|
|
}
|
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
/* set compression option defaults based on avctx->compression_level */
|
|
|
|
if(avctx->compression_level < 0) {
|
|
|
|
s->options.compression_level = 5;
|
|
|
|
} else {
|
|
|
|
s->options.compression_level = avctx->compression_level;
|
|
|
|
}
|
|
|
|
av_log(avctx, AV_LOG_DEBUG, " compression: %d\n", s->options.compression_level);
|
|
|
|
|
2006-07-02 14:06:27 +03:00
|
|
|
level= s->options.compression_level;
|
2006-07-16 16:34:47 +03:00
|
|
|
if(level > 12) {
|
2006-07-02 13:22:31 +03:00
|
|
|
av_log(avctx, AV_LOG_ERROR, "invalid compression level: %d\n",
|
|
|
|
s->options.compression_level);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2006-07-16 16:34:47 +03:00
|
|
|
s->options.block_time_ms = ((int[]){ 27, 27, 27,105,105,105,105,105,105,105,105,105,105})[level];
|
|
|
|
s->options.use_lpc = ((int[]){ 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1})[level];
|
|
|
|
s->options.min_prediction_order= ((int[]){ 2, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1})[level];
|
|
|
|
s->options.max_prediction_order= ((int[]){ 3, 4, 4, 6, 8, 8, 8, 8, 12, 12, 12, 32, 32})[level];
|
|
|
|
s->options.prediction_order_method = ((int[]){ ORDER_METHOD_EST, ORDER_METHOD_EST, ORDER_METHOD_EST,
|
|
|
|
ORDER_METHOD_EST, ORDER_METHOD_EST, ORDER_METHOD_EST,
|
2006-07-16 20:04:54 +03:00
|
|
|
ORDER_METHOD_4LEVEL, ORDER_METHOD_LOG, ORDER_METHOD_4LEVEL,
|
|
|
|
ORDER_METHOD_LOG, ORDER_METHOD_SEARCH, ORDER_METHOD_LOG,
|
2006-07-16 16:34:47 +03:00
|
|
|
ORDER_METHOD_SEARCH})[level];
|
2006-07-16 20:08:25 +03:00
|
|
|
s->options.min_partition_order = ((int[]){ 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0})[level];
|
|
|
|
s->options.max_partition_order = ((int[]){ 2, 2, 3, 3, 3, 8, 8, 8, 8, 8, 8, 8, 8})[level];
|
2006-07-02 14:06:27 +03:00
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
/* set compression option overrides from AVCodecContext */
|
|
|
|
if(avctx->use_lpc >= 0) {
|
2007-02-25 12:27:12 +02:00
|
|
|
s->options.use_lpc = av_clip(avctx->use_lpc, 0, 11);
|
2006-07-02 13:22:31 +03:00
|
|
|
}
|
2006-07-14 21:48:38 +03:00
|
|
|
if(s->options.use_lpc == 1)
|
|
|
|
av_log(avctx, AV_LOG_DEBUG, " use lpc: Levinson-Durbin recursion with Welch window\n");
|
|
|
|
else if(s->options.use_lpc > 1)
|
|
|
|
av_log(avctx, AV_LOG_DEBUG, " use lpc: Cholesky factorization\n");
|
2006-07-02 13:22:31 +03:00
|
|
|
|
|
|
|
if(avctx->min_prediction_order >= 0) {
|
|
|
|
if(s->options.use_lpc) {
|
|
|
|
if(avctx->min_prediction_order < MIN_LPC_ORDER ||
|
|
|
|
avctx->min_prediction_order > MAX_LPC_ORDER) {
|
|
|
|
av_log(avctx, AV_LOG_ERROR, "invalid min prediction order: %d\n",
|
|
|
|
avctx->min_prediction_order);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if(avctx->min_prediction_order > MAX_FIXED_ORDER) {
|
|
|
|
av_log(avctx, AV_LOG_ERROR, "invalid min prediction order: %d\n",
|
|
|
|
avctx->min_prediction_order);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
s->options.min_prediction_order = avctx->min_prediction_order;
|
|
|
|
}
|
|
|
|
if(avctx->max_prediction_order >= 0) {
|
|
|
|
if(s->options.use_lpc) {
|
|
|
|
if(avctx->max_prediction_order < MIN_LPC_ORDER ||
|
|
|
|
avctx->max_prediction_order > MAX_LPC_ORDER) {
|
|
|
|
av_log(avctx, AV_LOG_ERROR, "invalid max prediction order: %d\n",
|
|
|
|
avctx->max_prediction_order);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if(avctx->max_prediction_order > MAX_FIXED_ORDER) {
|
|
|
|
av_log(avctx, AV_LOG_ERROR, "invalid max prediction order: %d\n",
|
|
|
|
avctx->max_prediction_order);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
s->options.max_prediction_order = avctx->max_prediction_order;
|
|
|
|
}
|
|
|
|
if(s->options.max_prediction_order < s->options.min_prediction_order) {
|
|
|
|
av_log(avctx, AV_LOG_ERROR, "invalid prediction orders: min=%d max=%d\n",
|
|
|
|
s->options.min_prediction_order, s->options.max_prediction_order);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
av_log(avctx, AV_LOG_DEBUG, " prediction order: %d, %d\n",
|
|
|
|
s->options.min_prediction_order, s->options.max_prediction_order);
|
|
|
|
|
|
|
|
if(avctx->prediction_order_method >= 0) {
|
2006-07-16 18:46:45 +03:00
|
|
|
if(avctx->prediction_order_method > ORDER_METHOD_LOG) {
|
2006-07-02 13:22:31 +03:00
|
|
|
av_log(avctx, AV_LOG_ERROR, "invalid prediction order method: %d\n",
|
|
|
|
avctx->prediction_order_method);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
s->options.prediction_order_method = avctx->prediction_order_method;
|
|
|
|
}
|
2006-07-16 16:34:47 +03:00
|
|
|
switch(s->options.prediction_order_method) {
|
2006-07-02 13:22:31 +03:00
|
|
|
case ORDER_METHOD_EST: av_log(avctx, AV_LOG_DEBUG, " order method: %s\n",
|
|
|
|
"estimate"); break;
|
|
|
|
case ORDER_METHOD_2LEVEL: av_log(avctx, AV_LOG_DEBUG, " order method: %s\n",
|
|
|
|
"2-level"); break;
|
|
|
|
case ORDER_METHOD_4LEVEL: av_log(avctx, AV_LOG_DEBUG, " order method: %s\n",
|
|
|
|
"4-level"); break;
|
|
|
|
case ORDER_METHOD_8LEVEL: av_log(avctx, AV_LOG_DEBUG, " order method: %s\n",
|
|
|
|
"8-level"); break;
|
|
|
|
case ORDER_METHOD_SEARCH: av_log(avctx, AV_LOG_DEBUG, " order method: %s\n",
|
|
|
|
"full search"); break;
|
2006-07-16 18:46:45 +03:00
|
|
|
case ORDER_METHOD_LOG: av_log(avctx, AV_LOG_DEBUG, " order method: %s\n",
|
|
|
|
"log search"); break;
|
2006-07-02 13:22:31 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
if(avctx->min_partition_order >= 0) {
|
|
|
|
if(avctx->min_partition_order > MAX_PARTITION_ORDER) {
|
|
|
|
av_log(avctx, AV_LOG_ERROR, "invalid min partition order: %d\n",
|
|
|
|
avctx->min_partition_order);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
s->options.min_partition_order = avctx->min_partition_order;
|
|
|
|
}
|
|
|
|
if(avctx->max_partition_order >= 0) {
|
|
|
|
if(avctx->max_partition_order > MAX_PARTITION_ORDER) {
|
|
|
|
av_log(avctx, AV_LOG_ERROR, "invalid max partition order: %d\n",
|
|
|
|
avctx->max_partition_order);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
s->options.max_partition_order = avctx->max_partition_order;
|
|
|
|
}
|
|
|
|
if(s->options.max_partition_order < s->options.min_partition_order) {
|
|
|
|
av_log(avctx, AV_LOG_ERROR, "invalid partition orders: min=%d max=%d\n",
|
|
|
|
s->options.min_partition_order, s->options.max_partition_order);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
av_log(avctx, AV_LOG_DEBUG, " partition order: %d, %d\n",
|
|
|
|
s->options.min_partition_order, s->options.max_partition_order);
|
|
|
|
|
|
|
|
if(avctx->frame_size > 0) {
|
|
|
|
if(avctx->frame_size < FLAC_MIN_BLOCKSIZE ||
|
2006-07-08 19:39:58 +03:00
|
|
|
avctx->frame_size > FLAC_MAX_BLOCKSIZE) {
|
2006-07-02 13:22:31 +03:00
|
|
|
av_log(avctx, AV_LOG_ERROR, "invalid block size: %d\n",
|
|
|
|
avctx->frame_size);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
} else {
|
2008-03-31 03:29:52 +03:00
|
|
|
s->avctx->frame_size = select_blocksize(s->samplerate, s->options.block_time_ms);
|
2006-07-02 13:22:31 +03:00
|
|
|
}
|
2009-04-16 05:28:49 +03:00
|
|
|
s->max_blocksize = s->avctx->frame_size;
|
2008-03-31 03:29:52 +03:00
|
|
|
av_log(avctx, AV_LOG_DEBUG, " block size: %d\n", s->avctx->frame_size);
|
2006-07-02 13:22:31 +03:00
|
|
|
|
|
|
|
/* set LPC precision */
|
|
|
|
if(avctx->lpc_coeff_precision > 0) {
|
|
|
|
if(avctx->lpc_coeff_precision > MAX_LPC_PRECISION) {
|
|
|
|
av_log(avctx, AV_LOG_ERROR, "invalid lpc coeff precision: %d\n",
|
|
|
|
avctx->lpc_coeff_precision);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
s->options.lpc_coeff_precision = avctx->lpc_coeff_precision;
|
|
|
|
} else {
|
2008-03-30 19:01:10 +03:00
|
|
|
/* default LPC precision */
|
|
|
|
s->options.lpc_coeff_precision = 15;
|
2006-07-02 13:22:31 +03:00
|
|
|
}
|
|
|
|
av_log(avctx, AV_LOG_DEBUG, " lpc precision: %d\n",
|
|
|
|
s->options.lpc_coeff_precision);
|
2006-06-24 13:20:15 +03:00
|
|
|
|
2006-06-26 09:00:07 +03:00
|
|
|
/* set maximum encoded frame size in verbatim mode */
|
2009-03-21 03:54:31 +02:00
|
|
|
s->max_framesize = ff_flac_get_max_frame_size(s->avctx->frame_size,
|
|
|
|
s->channels, 16);
|
2006-06-24 13:20:15 +03:00
|
|
|
|
2008-09-15 00:39:54 +03:00
|
|
|
/* initialize MD5 context */
|
|
|
|
s->md5ctx = av_malloc(av_md5_size);
|
|
|
|
if(!s->md5ctx)
|
|
|
|
return AVERROR_NOMEM;
|
|
|
|
av_md5_init(s->md5ctx);
|
|
|
|
|
2006-06-24 13:20:15 +03:00
|
|
|
streaminfo = av_malloc(FLAC_STREAMINFO_SIZE);
|
|
|
|
write_streaminfo(s, streaminfo);
|
|
|
|
avctx->extradata = streaminfo;
|
|
|
|
avctx->extradata_size = FLAC_STREAMINFO_SIZE;
|
|
|
|
|
|
|
|
s->frame_count = 0;
|
2009-03-21 02:50:19 +02:00
|
|
|
s->min_framesize = s->max_framesize;
|
2006-06-24 13:20:15 +03:00
|
|
|
|
|
|
|
avctx->coded_frame = avcodec_alloc_frame();
|
|
|
|
avctx->coded_frame->key_frame = 1;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-06-26 09:00:07 +03:00
|
|
|
static void init_frame(FlacEncodeContext *s)
|
2006-06-24 13:20:15 +03:00
|
|
|
{
|
|
|
|
int i, ch;
|
|
|
|
FlacFrame *frame;
|
|
|
|
|
|
|
|
frame = &s->frame;
|
|
|
|
|
|
|
|
for(i=0; i<16; i++) {
|
2009-03-21 03:16:38 +02:00
|
|
|
if(s->avctx->frame_size == ff_flac_blocksize_table[i]) {
|
|
|
|
frame->blocksize = ff_flac_blocksize_table[i];
|
2006-06-24 13:20:15 +03:00
|
|
|
frame->bs_code[0] = i;
|
|
|
|
frame->bs_code[1] = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if(i == 16) {
|
2008-03-31 03:29:52 +03:00
|
|
|
frame->blocksize = s->avctx->frame_size;
|
2006-06-24 13:20:15 +03:00
|
|
|
if(frame->blocksize <= 256) {
|
|
|
|
frame->bs_code[0] = 6;
|
|
|
|
frame->bs_code[1] = frame->blocksize-1;
|
|
|
|
} else {
|
|
|
|
frame->bs_code[0] = 7;
|
|
|
|
frame->bs_code[1] = frame->blocksize-1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for(ch=0; ch<s->channels; ch++) {
|
|
|
|
frame->subframes[ch].obits = 16;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy channel-interleaved input samples into separate subframes
|
|
|
|
*/
|
|
|
|
static void copy_samples(FlacEncodeContext *s, int16_t *samples)
|
|
|
|
{
|
|
|
|
int i, j, ch;
|
|
|
|
FlacFrame *frame;
|
|
|
|
|
|
|
|
frame = &s->frame;
|
|
|
|
for(i=0,j=0; i<frame->blocksize; i++) {
|
|
|
|
for(ch=0; ch<s->channels; ch++,j++) {
|
|
|
|
frame->subframes[ch].samples[i] = samples[j];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-06-28 00:01:21 +03:00
|
|
|
|
|
|
|
#define rice_encode_count(sum, n, k) (((n)*((k)+1))+((sum-(n>>1))>>(k)))
|
|
|
|
|
2007-09-29 08:41:27 +03:00
|
|
|
/**
|
|
|
|
* Solve for d/dk(rice_encode_count) = n-((sum-(n>>1))>>(k+1)) = 0
|
|
|
|
*/
|
2006-06-28 00:01:21 +03:00
|
|
|
static int find_optimal_param(uint32_t sum, int n)
|
|
|
|
{
|
2007-09-29 08:41:27 +03:00
|
|
|
int k;
|
|
|
|
uint32_t sum2;
|
|
|
|
|
|
|
|
if(sum <= n>>1)
|
|
|
|
return 0;
|
|
|
|
sum2 = sum-(n>>1);
|
|
|
|
k = av_log2(n<256 ? FASTDIV(sum2,n) : sum2/n);
|
|
|
|
return FFMIN(k, MAX_RICE_PARAM);
|
2006-06-28 00:01:21 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
static uint32_t calc_optimal_rice_params(RiceContext *rc, int porder,
|
|
|
|
uint32_t *sums, int n, int pred_order)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int k, cnt, part;
|
|
|
|
uint32_t all_bits;
|
|
|
|
|
|
|
|
part = (1 << porder);
|
2007-10-27 16:39:19 +03:00
|
|
|
all_bits = 4 * part;
|
2006-06-28 00:01:21 +03:00
|
|
|
|
|
|
|
cnt = (n >> porder) - pred_order;
|
|
|
|
for(i=0; i<part; i++) {
|
|
|
|
k = find_optimal_param(sums[i], cnt);
|
|
|
|
rc->params[i] = k;
|
|
|
|
all_bits += rice_encode_count(sums[i], cnt, k);
|
2007-10-27 16:39:19 +03:00
|
|
|
cnt = n >> porder;
|
2006-06-28 00:01:21 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
rc->porder = porder;
|
|
|
|
|
|
|
|
return all_bits;
|
|
|
|
}
|
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
static void calc_sums(int pmin, int pmax, uint32_t *data, int n, int pred_order,
|
|
|
|
uint32_t sums[][MAX_PARTITIONS])
|
2006-06-28 00:01:21 +03:00
|
|
|
{
|
|
|
|
int i, j;
|
2006-07-02 12:30:51 +03:00
|
|
|
int parts;
|
|
|
|
uint32_t *res, *res_end;
|
2006-06-28 00:01:21 +03:00
|
|
|
|
|
|
|
/* sums for highest level */
|
|
|
|
parts = (1 << pmax);
|
|
|
|
res = &data[pred_order];
|
2006-07-02 12:30:51 +03:00
|
|
|
res_end = &data[n >> pmax];
|
2006-06-28 00:01:21 +03:00
|
|
|
for(i=0; i<parts; i++) {
|
2007-09-29 04:54:25 +03:00
|
|
|
uint32_t sum = 0;
|
2006-07-02 12:30:51 +03:00
|
|
|
while(res < res_end){
|
2007-09-29 04:54:25 +03:00
|
|
|
sum += *(res++);
|
2006-06-28 00:01:21 +03:00
|
|
|
}
|
2007-09-29 04:54:25 +03:00
|
|
|
sums[pmax][i] = sum;
|
2006-07-02 12:30:51 +03:00
|
|
|
res_end+= n >> pmax;
|
2006-06-28 00:01:21 +03:00
|
|
|
}
|
|
|
|
/* sums for lower levels */
|
2006-07-02 13:22:31 +03:00
|
|
|
for(i=pmax-1; i>=pmin; i--) {
|
2006-06-28 00:01:21 +03:00
|
|
|
parts = (1 << i);
|
|
|
|
for(j=0; j<parts; j++) {
|
|
|
|
sums[i][j] = sums[i+1][2*j] + sums[i+1][2*j+1];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
static uint32_t calc_rice_params(RiceContext *rc, int pmin, int pmax,
|
|
|
|
int32_t *data, int n, int pred_order)
|
2006-06-28 00:01:21 +03:00
|
|
|
{
|
|
|
|
int i;
|
2006-07-02 13:22:31 +03:00
|
|
|
uint32_t bits[MAX_PARTITION_ORDER+1];
|
2006-06-28 00:01:21 +03:00
|
|
|
int opt_porder;
|
2006-07-02 13:22:31 +03:00
|
|
|
RiceContext tmp_rc;
|
2006-06-28 00:01:21 +03:00
|
|
|
uint32_t *udata;
|
2006-07-02 13:22:31 +03:00
|
|
|
uint32_t sums[MAX_PARTITION_ORDER+1][MAX_PARTITIONS];
|
2006-06-28 00:01:21 +03:00
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
assert(pmin >= 0 && pmin <= MAX_PARTITION_ORDER);
|
|
|
|
assert(pmax >= 0 && pmax <= MAX_PARTITION_ORDER);
|
|
|
|
assert(pmin <= pmax);
|
2006-06-28 00:01:21 +03:00
|
|
|
|
|
|
|
udata = av_malloc(n * sizeof(uint32_t));
|
|
|
|
for(i=0; i<n; i++) {
|
|
|
|
udata[i] = (2*data[i]) ^ (data[i]>>31);
|
|
|
|
}
|
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
calc_sums(pmin, pmax, udata, n, pred_order, sums);
|
2006-06-28 00:01:21 +03:00
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
opt_porder = pmin;
|
|
|
|
bits[pmin] = UINT32_MAX;
|
|
|
|
for(i=pmin; i<=pmax; i++) {
|
|
|
|
bits[i] = calc_optimal_rice_params(&tmp_rc, i, sums[i], n, pred_order);
|
|
|
|
if(bits[i] <= bits[opt_porder]) {
|
2006-06-28 00:01:21 +03:00
|
|
|
opt_porder = i;
|
2006-07-02 15:40:39 +03:00
|
|
|
*rc= tmp_rc;
|
2006-06-28 00:01:21 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
av_freep(&udata);
|
2006-07-02 13:22:31 +03:00
|
|
|
return bits[opt_porder];
|
2006-06-28 00:01:21 +03:00
|
|
|
}
|
|
|
|
|
2006-07-03 12:20:26 +03:00
|
|
|
static int get_max_p_order(int max_porder, int n, int order)
|
|
|
|
{
|
|
|
|
int porder = FFMIN(max_porder, av_log2(n^(n-1)));
|
|
|
|
if(order > 0)
|
|
|
|
porder = FFMIN(porder, av_log2(n/order));
|
|
|
|
return porder;
|
|
|
|
}
|
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
static uint32_t calc_rice_params_fixed(RiceContext *rc, int pmin, int pmax,
|
|
|
|
int32_t *data, int n, int pred_order,
|
|
|
|
int bps)
|
2006-06-28 00:01:21 +03:00
|
|
|
{
|
|
|
|
uint32_t bits;
|
2006-07-03 12:20:26 +03:00
|
|
|
pmin = get_max_p_order(pmin, n, pred_order);
|
|
|
|
pmax = get_max_p_order(pmax, n, pred_order);
|
2006-06-28 00:01:21 +03:00
|
|
|
bits = pred_order*bps + 6;
|
2006-07-02 13:22:31 +03:00
|
|
|
bits += calc_rice_params(rc, pmin, pmax, data, n, pred_order);
|
|
|
|
return bits;
|
|
|
|
}
|
|
|
|
|
|
|
|
static uint32_t calc_rice_params_lpc(RiceContext *rc, int pmin, int pmax,
|
|
|
|
int32_t *data, int n, int pred_order,
|
|
|
|
int bps, int precision)
|
|
|
|
{
|
|
|
|
uint32_t bits;
|
2006-07-03 12:20:26 +03:00
|
|
|
pmin = get_max_p_order(pmin, n, pred_order);
|
|
|
|
pmax = get_max_p_order(pmax, n, pred_order);
|
2006-07-02 13:22:31 +03:00
|
|
|
bits = pred_order*bps + 4 + 5 + pred_order*precision + 6;
|
|
|
|
bits += calc_rice_params(rc, pmin, pmax, data, n, pred_order);
|
2006-06-28 00:01:21 +03:00
|
|
|
return bits;
|
|
|
|
}
|
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
/**
|
|
|
|
* Apply Welch window function to audio block
|
|
|
|
*/
|
|
|
|
static void apply_welch_window(const int32_t *data, int len, double *w_data)
|
|
|
|
{
|
|
|
|
int i, n2;
|
|
|
|
double w;
|
|
|
|
double c;
|
|
|
|
|
2008-02-09 16:45:36 +02:00
|
|
|
assert(!(len&1)); //the optimization in r11881 does not support odd len
|
|
|
|
//if someone wants odd len extend the change in r11881
|
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
n2 = (len >> 1);
|
|
|
|
c = 2.0 / (len - 1.0);
|
2008-02-09 05:42:48 +02:00
|
|
|
|
|
|
|
w_data+=n2;
|
|
|
|
data+=n2;
|
2006-07-02 13:22:31 +03:00
|
|
|
for(i=0; i<n2; i++) {
|
2008-02-09 05:42:48 +02:00
|
|
|
w = c - n2 + i;
|
2006-07-02 13:22:31 +03:00
|
|
|
w = 1.0 - (w * w);
|
2008-02-09 05:42:48 +02:00
|
|
|
w_data[-i-1] = data[-i-1] * w;
|
|
|
|
w_data[+i ] = data[+i ] * w;
|
2006-07-02 13:22:31 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Calculates autocorrelation data from audio samples
|
|
|
|
* A Welch window function is applied before calculation.
|
|
|
|
*/
|
2007-09-30 01:31:18 +03:00
|
|
|
void ff_flac_compute_autocorr(const int32_t *data, int len, int lag,
|
|
|
|
double *autoc)
|
2006-07-02 13:22:31 +03:00
|
|
|
{
|
2007-09-28 09:06:18 +03:00
|
|
|
int i, j;
|
2007-09-29 10:43:52 +03:00
|
|
|
double tmp[len + lag + 1];
|
2006-07-02 16:01:01 +03:00
|
|
|
double *data1= tmp + lag;
|
2006-07-02 13:22:31 +03:00
|
|
|
|
|
|
|
apply_welch_window(data, len, data1);
|
|
|
|
|
2007-09-28 09:06:18 +03:00
|
|
|
for(j=0; j<lag; j++)
|
|
|
|
data1[j-lag]= 0.0;
|
2007-09-29 10:43:52 +03:00
|
|
|
data1[len] = 0.0;
|
2006-07-02 16:01:01 +03:00
|
|
|
|
2007-09-28 09:06:18 +03:00
|
|
|
for(j=0; j<lag; j+=2){
|
|
|
|
double sum0 = 1.0, sum1 = 1.0;
|
2009-04-13 21:07:02 +03:00
|
|
|
for(i=j; i<len; i++){
|
2007-09-28 09:06:18 +03:00
|
|
|
sum0 += data1[i] * data1[i-j];
|
|
|
|
sum1 += data1[i] * data1[i-j-1];
|
2006-07-02 13:22:31 +03:00
|
|
|
}
|
2007-09-28 09:06:18 +03:00
|
|
|
autoc[j ] = sum0;
|
|
|
|
autoc[j+1] = sum1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(j==lag){
|
|
|
|
double sum = 1.0;
|
2009-04-13 21:07:02 +03:00
|
|
|
for(i=j-1; i<len; i+=2){
|
2007-09-29 10:43:52 +03:00
|
|
|
sum += data1[i ] * data1[i-j ]
|
|
|
|
+ data1[i+1] * data1[i-j+1];
|
|
|
|
}
|
2007-09-28 09:06:18 +03:00
|
|
|
autoc[j] = sum;
|
2006-07-02 13:22:31 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-06-28 00:01:21 +03:00
|
|
|
static void encode_residual_verbatim(int32_t *res, int32_t *smp, int n)
|
|
|
|
{
|
|
|
|
assert(n > 0);
|
|
|
|
memcpy(res, smp, n * sizeof(int32_t));
|
|
|
|
}
|
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
static void encode_residual_fixed(int32_t *res, const int32_t *smp, int n,
|
|
|
|
int order)
|
2006-06-28 00:01:21 +03:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for(i=0; i<order; i++) {
|
|
|
|
res[i] = smp[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
if(order==0){
|
|
|
|
for(i=order; i<n; i++)
|
|
|
|
res[i]= smp[i];
|
|
|
|
}else if(order==1){
|
|
|
|
for(i=order; i<n; i++)
|
|
|
|
res[i]= smp[i] - smp[i-1];
|
|
|
|
}else if(order==2){
|
2007-09-30 02:21:57 +03:00
|
|
|
int a = smp[order-1] - smp[order-2];
|
2007-09-30 02:44:34 +03:00
|
|
|
for(i=order; i<n; i+=2) {
|
2007-09-30 02:21:57 +03:00
|
|
|
int b = smp[i] - smp[i-1];
|
|
|
|
res[i]= b - a;
|
2007-09-30 02:44:34 +03:00
|
|
|
a = smp[i+1] - smp[i];
|
|
|
|
res[i+1]= a - b;
|
2007-09-30 02:21:57 +03:00
|
|
|
}
|
2006-06-28 00:01:21 +03:00
|
|
|
}else if(order==3){
|
2007-09-30 02:21:57 +03:00
|
|
|
int a = smp[order-1] - smp[order-2];
|
|
|
|
int c = smp[order-1] - 2*smp[order-2] + smp[order-3];
|
2007-09-30 02:44:34 +03:00
|
|
|
for(i=order; i<n; i+=2) {
|
2007-09-30 02:21:57 +03:00
|
|
|
int b = smp[i] - smp[i-1];
|
|
|
|
int d = b - a;
|
|
|
|
res[i]= d - c;
|
2007-09-30 02:44:34 +03:00
|
|
|
a = smp[i+1] - smp[i];
|
|
|
|
c = a - b;
|
|
|
|
res[i+1]= c - d;
|
2007-09-30 02:21:57 +03:00
|
|
|
}
|
2006-06-28 00:01:21 +03:00
|
|
|
}else{
|
2007-09-30 02:21:57 +03:00
|
|
|
int a = smp[order-1] - smp[order-2];
|
|
|
|
int c = smp[order-1] - 2*smp[order-2] + smp[order-3];
|
|
|
|
int e = smp[order-1] - 3*smp[order-2] + 3*smp[order-3] - smp[order-4];
|
2007-09-30 02:44:34 +03:00
|
|
|
for(i=order; i<n; i+=2) {
|
2007-09-30 02:21:57 +03:00
|
|
|
int b = smp[i] - smp[i-1];
|
|
|
|
int d = b - a;
|
|
|
|
int f = d - c;
|
|
|
|
res[i]= f - e;
|
2007-09-30 02:44:34 +03:00
|
|
|
a = smp[i+1] - smp[i];
|
|
|
|
c = a - b;
|
|
|
|
e = c - d;
|
|
|
|
res[i+1]= e - f;
|
2007-09-30 02:21:57 +03:00
|
|
|
}
|
2006-06-28 00:01:21 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-09-27 05:42:00 +03:00
|
|
|
#define LPC1(x) {\
|
2007-09-30 06:36:13 +03:00
|
|
|
int c = coefs[(x)-1];\
|
2007-09-27 05:42:00 +03:00
|
|
|
p0 += c*s;\
|
2007-09-30 06:36:13 +03:00
|
|
|
s = smp[i-(x)+1];\
|
|
|
|
p1 += c*s;\
|
2007-09-27 05:42:00 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
static av_always_inline void encode_residual_lpc_unrolled(
|
|
|
|
int32_t *res, const int32_t *smp, int n,
|
|
|
|
int order, const int32_t *coefs, int shift, int big)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for(i=order; i<n; i+=2) {
|
2007-09-30 06:36:13 +03:00
|
|
|
int s = smp[i-order];
|
|
|
|
int p0 = 0, p1 = 0;
|
2007-09-27 05:42:00 +03:00
|
|
|
if(big) {
|
|
|
|
switch(order) {
|
|
|
|
case 32: LPC1(32)
|
|
|
|
case 31: LPC1(31)
|
|
|
|
case 30: LPC1(30)
|
|
|
|
case 29: LPC1(29)
|
|
|
|
case 28: LPC1(28)
|
|
|
|
case 27: LPC1(27)
|
|
|
|
case 26: LPC1(26)
|
|
|
|
case 25: LPC1(25)
|
|
|
|
case 24: LPC1(24)
|
|
|
|
case 23: LPC1(23)
|
|
|
|
case 22: LPC1(22)
|
|
|
|
case 21: LPC1(21)
|
|
|
|
case 20: LPC1(20)
|
|
|
|
case 19: LPC1(19)
|
|
|
|
case 18: LPC1(18)
|
|
|
|
case 17: LPC1(17)
|
|
|
|
case 16: LPC1(16)
|
|
|
|
case 15: LPC1(15)
|
|
|
|
case 14: LPC1(14)
|
|
|
|
case 13: LPC1(13)
|
|
|
|
case 12: LPC1(12)
|
|
|
|
case 11: LPC1(11)
|
|
|
|
case 10: LPC1(10)
|
|
|
|
case 9: LPC1( 9)
|
|
|
|
LPC1( 8)
|
|
|
|
LPC1( 7)
|
|
|
|
LPC1( 6)
|
|
|
|
LPC1( 5)
|
|
|
|
LPC1( 4)
|
|
|
|
LPC1( 3)
|
|
|
|
LPC1( 2)
|
2007-09-30 06:36:13 +03:00
|
|
|
LPC1( 1)
|
2007-09-27 05:42:00 +03:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
switch(order) {
|
|
|
|
case 8: LPC1( 8)
|
|
|
|
case 7: LPC1( 7)
|
|
|
|
case 6: LPC1( 6)
|
|
|
|
case 5: LPC1( 5)
|
|
|
|
case 4: LPC1( 4)
|
|
|
|
case 3: LPC1( 3)
|
|
|
|
case 2: LPC1( 2)
|
2007-09-30 06:36:13 +03:00
|
|
|
case 1: LPC1( 1)
|
2007-09-27 05:42:00 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
res[i ] = smp[i ] - (p0 >> shift);
|
|
|
|
res[i+1] = smp[i+1] - (p1 >> shift);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
static void encode_residual_lpc(int32_t *res, const int32_t *smp, int n,
|
|
|
|
int order, const int32_t *coefs, int shift)
|
|
|
|
{
|
2007-09-27 05:42:00 +03:00
|
|
|
int i;
|
2006-07-02 13:22:31 +03:00
|
|
|
for(i=0; i<order; i++) {
|
|
|
|
res[i] = smp[i];
|
|
|
|
}
|
2009-01-14 01:44:16 +02:00
|
|
|
#if CONFIG_SMALL
|
2007-09-26 02:30:29 +03:00
|
|
|
for(i=order; i<n; i+=2) {
|
2007-09-27 05:42:00 +03:00
|
|
|
int j;
|
2007-09-30 06:36:13 +03:00
|
|
|
int s = smp[i];
|
|
|
|
int p0 = 0, p1 = 0;
|
|
|
|
for(j=0; j<order; j++) {
|
|
|
|
int c = coefs[j];
|
2007-09-26 02:30:29 +03:00
|
|
|
p1 += c*s;
|
2007-09-30 06:36:13 +03:00
|
|
|
s = smp[i-j-1];
|
|
|
|
p0 += c*s;
|
2006-07-02 13:22:31 +03:00
|
|
|
}
|
2007-09-30 06:36:13 +03:00
|
|
|
res[i ] = smp[i ] - (p0 >> shift);
|
2007-09-26 02:30:29 +03:00
|
|
|
res[i+1] = smp[i+1] - (p1 >> shift);
|
2006-07-02 13:22:31 +03:00
|
|
|
}
|
2007-09-27 05:42:00 +03:00
|
|
|
#else
|
|
|
|
switch(order) {
|
|
|
|
case 1: encode_residual_lpc_unrolled(res, smp, n, 1, coefs, shift, 0); break;
|
|
|
|
case 2: encode_residual_lpc_unrolled(res, smp, n, 2, coefs, shift, 0); break;
|
|
|
|
case 3: encode_residual_lpc_unrolled(res, smp, n, 3, coefs, shift, 0); break;
|
|
|
|
case 4: encode_residual_lpc_unrolled(res, smp, n, 4, coefs, shift, 0); break;
|
|
|
|
case 5: encode_residual_lpc_unrolled(res, smp, n, 5, coefs, shift, 0); break;
|
|
|
|
case 6: encode_residual_lpc_unrolled(res, smp, n, 6, coefs, shift, 0); break;
|
|
|
|
case 7: encode_residual_lpc_unrolled(res, smp, n, 7, coefs, shift, 0); break;
|
|
|
|
case 8: encode_residual_lpc_unrolled(res, smp, n, 8, coefs, shift, 0); break;
|
|
|
|
default: encode_residual_lpc_unrolled(res, smp, n, order, coefs, shift, 1); break;
|
|
|
|
}
|
|
|
|
#endif
|
2006-07-02 13:22:31 +03:00
|
|
|
}
|
|
|
|
|
2006-06-28 00:01:21 +03:00
|
|
|
static int encode_residual(FlacEncodeContext *ctx, int ch)
|
|
|
|
{
|
2006-07-02 13:22:31 +03:00
|
|
|
int i, n;
|
2006-07-16 16:34:47 +03:00
|
|
|
int min_order, max_order, opt_order, precision, omethod;
|
2006-07-03 12:20:26 +03:00
|
|
|
int min_porder, max_porder;
|
2006-06-28 00:01:21 +03:00
|
|
|
FlacFrame *frame;
|
|
|
|
FlacSubframe *sub;
|
2006-07-02 13:22:31 +03:00
|
|
|
int32_t coefs[MAX_LPC_ORDER][MAX_LPC_ORDER];
|
|
|
|
int shift[MAX_LPC_ORDER];
|
2006-06-28 00:01:21 +03:00
|
|
|
int32_t *res, *smp;
|
|
|
|
|
|
|
|
frame = &ctx->frame;
|
|
|
|
sub = &frame->subframes[ch];
|
|
|
|
res = sub->residual;
|
|
|
|
smp = sub->samples;
|
|
|
|
n = frame->blocksize;
|
|
|
|
|
|
|
|
/* CONSTANT */
|
|
|
|
for(i=1; i<n; i++) {
|
|
|
|
if(smp[i] != smp[0]) break;
|
|
|
|
}
|
|
|
|
if(i == n) {
|
|
|
|
sub->type = sub->type_code = FLAC_SUBFRAME_CONSTANT;
|
|
|
|
res[0] = smp[0];
|
|
|
|
return sub->obits;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* VERBATIM */
|
|
|
|
if(n < 5) {
|
|
|
|
sub->type = sub->type_code = FLAC_SUBFRAME_VERBATIM;
|
|
|
|
encode_residual_verbatim(res, smp, n);
|
|
|
|
return sub->obits * n;
|
|
|
|
}
|
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
min_order = ctx->options.min_prediction_order;
|
|
|
|
max_order = ctx->options.max_prediction_order;
|
|
|
|
min_porder = ctx->options.min_partition_order;
|
|
|
|
max_porder = ctx->options.max_partition_order;
|
|
|
|
precision = ctx->options.lpc_coeff_precision;
|
2006-07-16 16:34:47 +03:00
|
|
|
omethod = ctx->options.prediction_order_method;
|
2006-06-28 00:01:21 +03:00
|
|
|
|
|
|
|
/* FIXED */
|
2006-07-02 13:22:31 +03:00
|
|
|
if(!ctx->options.use_lpc || max_order == 0 || (n <= max_order)) {
|
|
|
|
uint32_t bits[MAX_FIXED_ORDER+1];
|
|
|
|
if(max_order > MAX_FIXED_ORDER) max_order = MAX_FIXED_ORDER;
|
|
|
|
opt_order = 0;
|
|
|
|
bits[0] = UINT32_MAX;
|
|
|
|
for(i=min_order; i<=max_order; i++) {
|
|
|
|
encode_residual_fixed(res, smp, n, i);
|
2006-07-03 12:20:26 +03:00
|
|
|
bits[i] = calc_rice_params_fixed(&sub->rc, min_porder, max_porder, res,
|
2006-07-02 13:22:31 +03:00
|
|
|
n, i, sub->obits);
|
|
|
|
if(bits[i] < bits[opt_order]) {
|
|
|
|
opt_order = i;
|
|
|
|
}
|
2006-06-28 00:01:21 +03:00
|
|
|
}
|
2006-07-02 13:22:31 +03:00
|
|
|
sub->order = opt_order;
|
|
|
|
sub->type = FLAC_SUBFRAME_FIXED;
|
|
|
|
sub->type_code = sub->type | sub->order;
|
|
|
|
if(sub->order != max_order) {
|
|
|
|
encode_residual_fixed(res, smp, n, sub->order);
|
2006-07-03 12:20:26 +03:00
|
|
|
return calc_rice_params_fixed(&sub->rc, min_porder, max_porder, res, n,
|
2006-07-02 13:22:31 +03:00
|
|
|
sub->order, sub->obits);
|
|
|
|
}
|
|
|
|
return bits[sub->order];
|
2006-06-28 00:01:21 +03:00
|
|
|
}
|
2006-07-02 13:22:31 +03:00
|
|
|
|
|
|
|
/* LPC */
|
2008-08-17 00:32:03 +03:00
|
|
|
opt_order = ff_lpc_calc_coefs(&ctx->dsp, smp, n, min_order, max_order,
|
|
|
|
precision, coefs, shift, ctx->options.use_lpc,
|
|
|
|
omethod, MAX_LPC_SHIFT, 0);
|
2006-07-16 16:34:47 +03:00
|
|
|
|
|
|
|
if(omethod == ORDER_METHOD_2LEVEL ||
|
|
|
|
omethod == ORDER_METHOD_4LEVEL ||
|
|
|
|
omethod == ORDER_METHOD_8LEVEL) {
|
|
|
|
int levels = 1 << omethod;
|
|
|
|
uint32_t bits[levels];
|
|
|
|
int order;
|
|
|
|
int opt_index = levels-1;
|
|
|
|
opt_order = max_order-1;
|
|
|
|
bits[opt_index] = UINT32_MAX;
|
|
|
|
for(i=levels-1; i>=0; i--) {
|
|
|
|
order = min_order + (((max_order-min_order+1) * (i+1)) / levels)-1;
|
|
|
|
if(order < 0) order = 0;
|
|
|
|
encode_residual_lpc(res, smp, n, order+1, coefs[order], shift[order]);
|
|
|
|
bits[i] = calc_rice_params_lpc(&sub->rc, min_porder, max_porder,
|
|
|
|
res, n, order+1, sub->obits, precision);
|
|
|
|
if(bits[i] < bits[opt_index]) {
|
|
|
|
opt_index = i;
|
|
|
|
opt_order = order;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
opt_order++;
|
|
|
|
} else if(omethod == ORDER_METHOD_SEARCH) {
|
|
|
|
// brute-force optimal order search
|
|
|
|
uint32_t bits[MAX_LPC_ORDER];
|
|
|
|
opt_order = 0;
|
|
|
|
bits[0] = UINT32_MAX;
|
|
|
|
for(i=min_order-1; i<max_order; i++) {
|
|
|
|
encode_residual_lpc(res, smp, n, i+1, coefs[i], shift[i]);
|
|
|
|
bits[i] = calc_rice_params_lpc(&sub->rc, min_porder, max_porder,
|
|
|
|
res, n, i+1, sub->obits, precision);
|
|
|
|
if(bits[i] < bits[opt_order]) {
|
|
|
|
opt_order = i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
opt_order++;
|
2006-07-16 18:46:45 +03:00
|
|
|
} else if(omethod == ORDER_METHOD_LOG) {
|
|
|
|
uint32_t bits[MAX_LPC_ORDER];
|
|
|
|
int step;
|
|
|
|
|
|
|
|
opt_order= min_order - 1 + (max_order-min_order)/3;
|
|
|
|
memset(bits, -1, sizeof(bits));
|
|
|
|
|
|
|
|
for(step=16 ;step; step>>=1){
|
|
|
|
int last= opt_order;
|
|
|
|
for(i=last-step; i<=last+step; i+= step){
|
|
|
|
if(i<min_order-1 || i>=max_order || bits[i] < UINT32_MAX)
|
|
|
|
continue;
|
|
|
|
encode_residual_lpc(res, smp, n, i+1, coefs[i], shift[i]);
|
|
|
|
bits[i] = calc_rice_params_lpc(&sub->rc, min_porder, max_porder,
|
|
|
|
res, n, i+1, sub->obits, precision);
|
|
|
|
if(bits[i] < bits[opt_order])
|
|
|
|
opt_order= i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
opt_order++;
|
2006-07-16 16:34:47 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
sub->order = opt_order;
|
2006-07-02 13:22:31 +03:00
|
|
|
sub->type = FLAC_SUBFRAME_LPC;
|
|
|
|
sub->type_code = sub->type | (sub->order-1);
|
|
|
|
sub->shift = shift[sub->order-1];
|
|
|
|
for(i=0; i<sub->order; i++) {
|
|
|
|
sub->coefs[i] = coefs[sub->order-1][i];
|
2006-06-28 00:01:21 +03:00
|
|
|
}
|
2006-07-02 13:22:31 +03:00
|
|
|
encode_residual_lpc(res, smp, n, sub->order, sub->coefs, sub->shift);
|
2006-07-03 12:20:26 +03:00
|
|
|
return calc_rice_params_lpc(&sub->rc, min_porder, max_porder, res, n, sub->order,
|
2006-07-02 13:22:31 +03:00
|
|
|
sub->obits, precision);
|
2006-06-28 00:01:21 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
static int encode_residual_v(FlacEncodeContext *ctx, int ch)
|
|
|
|
{
|
|
|
|
int i, n;
|
|
|
|
FlacFrame *frame;
|
|
|
|
FlacSubframe *sub;
|
|
|
|
int32_t *res, *smp;
|
|
|
|
|
|
|
|
frame = &ctx->frame;
|
|
|
|
sub = &frame->subframes[ch];
|
|
|
|
res = sub->residual;
|
|
|
|
smp = sub->samples;
|
|
|
|
n = frame->blocksize;
|
|
|
|
|
|
|
|
/* CONSTANT */
|
|
|
|
for(i=1; i<n; i++) {
|
|
|
|
if(smp[i] != smp[0]) break;
|
|
|
|
}
|
|
|
|
if(i == n) {
|
|
|
|
sub->type = sub->type_code = FLAC_SUBFRAME_CONSTANT;
|
|
|
|
res[0] = smp[0];
|
|
|
|
return sub->obits;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* VERBATIM */
|
|
|
|
sub->type = sub->type_code = FLAC_SUBFRAME_VERBATIM;
|
|
|
|
encode_residual_verbatim(res, smp, n);
|
|
|
|
return sub->obits * n;
|
|
|
|
}
|
|
|
|
|
2006-06-26 09:00:07 +03:00
|
|
|
static int estimate_stereo_mode(int32_t *left_ch, int32_t *right_ch, int n)
|
|
|
|
{
|
|
|
|
int i, best;
|
|
|
|
int32_t lt, rt;
|
2006-06-28 00:01:21 +03:00
|
|
|
uint64_t sum[4];
|
2006-06-26 09:00:07 +03:00
|
|
|
uint64_t score[4];
|
2006-06-28 00:01:21 +03:00
|
|
|
int k;
|
2006-06-26 09:00:07 +03:00
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
/* calculate sum of 2nd order residual for each channel */
|
2006-06-28 00:01:21 +03:00
|
|
|
sum[0] = sum[1] = sum[2] = sum[3] = 0;
|
2006-06-26 09:00:07 +03:00
|
|
|
for(i=2; i<n; i++) {
|
|
|
|
lt = left_ch[i] - 2*left_ch[i-1] + left_ch[i-2];
|
|
|
|
rt = right_ch[i] - 2*right_ch[i-1] + right_ch[i-2];
|
2006-10-12 02:17:58 +03:00
|
|
|
sum[2] += FFABS((lt + rt) >> 1);
|
|
|
|
sum[3] += FFABS(lt - rt);
|
|
|
|
sum[0] += FFABS(lt);
|
|
|
|
sum[1] += FFABS(rt);
|
2006-06-28 00:01:21 +03:00
|
|
|
}
|
2006-07-02 13:22:31 +03:00
|
|
|
/* estimate bit counts */
|
2006-06-28 00:01:21 +03:00
|
|
|
for(i=0; i<4; i++) {
|
|
|
|
k = find_optimal_param(2*sum[i], n);
|
|
|
|
sum[i] = rice_encode_count(2*sum[i], n, k);
|
2006-06-26 09:00:07 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/* calculate score for each mode */
|
2006-06-28 00:01:21 +03:00
|
|
|
score[0] = sum[0] + sum[1];
|
|
|
|
score[1] = sum[0] + sum[3];
|
|
|
|
score[2] = sum[1] + sum[3];
|
|
|
|
score[3] = sum[2] + sum[3];
|
2006-06-26 09:00:07 +03:00
|
|
|
|
|
|
|
/* return mode with lowest score */
|
|
|
|
best = 0;
|
|
|
|
for(i=1; i<4; i++) {
|
|
|
|
if(score[i] < score[best]) {
|
|
|
|
best = i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if(best == 0) {
|
2009-03-21 02:44:42 +02:00
|
|
|
return FLAC_CHMODE_INDEPENDENT;
|
2006-06-26 09:00:07 +03:00
|
|
|
} else if(best == 1) {
|
|
|
|
return FLAC_CHMODE_LEFT_SIDE;
|
|
|
|
} else if(best == 2) {
|
|
|
|
return FLAC_CHMODE_RIGHT_SIDE;
|
|
|
|
} else {
|
|
|
|
return FLAC_CHMODE_MID_SIDE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Perform stereo channel decorrelation
|
|
|
|
*/
|
|
|
|
static void channel_decorrelation(FlacEncodeContext *ctx)
|
|
|
|
{
|
|
|
|
FlacFrame *frame;
|
|
|
|
int32_t *left, *right;
|
|
|
|
int i, n;
|
|
|
|
|
|
|
|
frame = &ctx->frame;
|
|
|
|
n = frame->blocksize;
|
|
|
|
left = frame->subframes[0].samples;
|
|
|
|
right = frame->subframes[1].samples;
|
|
|
|
|
|
|
|
if(ctx->channels != 2) {
|
2009-03-21 02:44:42 +02:00
|
|
|
frame->ch_mode = FLAC_CHMODE_INDEPENDENT;
|
2006-06-26 09:00:07 +03:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
frame->ch_mode = estimate_stereo_mode(left, right, n);
|
|
|
|
|
|
|
|
/* perform decorrelation and adjust bits-per-sample */
|
2009-03-21 02:44:42 +02:00
|
|
|
if(frame->ch_mode == FLAC_CHMODE_INDEPENDENT) {
|
2006-06-26 09:00:07 +03:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
if(frame->ch_mode == FLAC_CHMODE_MID_SIDE) {
|
|
|
|
int32_t tmp;
|
|
|
|
for(i=0; i<n; i++) {
|
|
|
|
tmp = left[i];
|
|
|
|
left[i] = (tmp + right[i]) >> 1;
|
|
|
|
right[i] = tmp - right[i];
|
|
|
|
}
|
|
|
|
frame->subframes[1].obits++;
|
|
|
|
} else if(frame->ch_mode == FLAC_CHMODE_LEFT_SIDE) {
|
|
|
|
for(i=0; i<n; i++) {
|
|
|
|
right[i] = left[i] - right[i];
|
|
|
|
}
|
|
|
|
frame->subframes[1].obits++;
|
|
|
|
} else {
|
|
|
|
for(i=0; i<n; i++) {
|
|
|
|
left[i] -= right[i];
|
|
|
|
}
|
|
|
|
frame->subframes[0].obits++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-06-28 00:01:21 +03:00
|
|
|
static void write_utf8(PutBitContext *pb, uint32_t val)
|
2006-06-24 13:20:15 +03:00
|
|
|
{
|
2006-11-06 12:32:48 +02:00
|
|
|
uint8_t tmp;
|
|
|
|
PUT_UTF8(val, tmp, put_bits(pb, 8, tmp);)
|
2006-06-24 13:20:15 +03:00
|
|
|
}
|
|
|
|
|
2006-06-28 00:01:21 +03:00
|
|
|
static void output_frame_header(FlacEncodeContext *s)
|
2006-06-24 13:20:15 +03:00
|
|
|
{
|
|
|
|
FlacFrame *frame;
|
|
|
|
int crc;
|
|
|
|
|
|
|
|
frame = &s->frame;
|
|
|
|
|
|
|
|
put_bits(&s->pb, 16, 0xFFF8);
|
|
|
|
put_bits(&s->pb, 4, frame->bs_code[0]);
|
|
|
|
put_bits(&s->pb, 4, s->sr_code[0]);
|
2009-03-21 02:44:42 +02:00
|
|
|
if(frame->ch_mode == FLAC_CHMODE_INDEPENDENT) {
|
2009-03-21 02:45:44 +02:00
|
|
|
put_bits(&s->pb, 4, s->channels-1);
|
2006-06-24 13:20:15 +03:00
|
|
|
} else {
|
|
|
|
put_bits(&s->pb, 4, frame->ch_mode);
|
|
|
|
}
|
|
|
|
put_bits(&s->pb, 3, 4); /* bits-per-sample code */
|
|
|
|
put_bits(&s->pb, 1, 0);
|
|
|
|
write_utf8(&s->pb, s->frame_count);
|
2006-06-26 09:00:07 +03:00
|
|
|
if(frame->bs_code[0] == 6) {
|
|
|
|
put_bits(&s->pb, 8, frame->bs_code[1]);
|
|
|
|
} else if(frame->bs_code[0] == 7) {
|
|
|
|
put_bits(&s->pb, 16, frame->bs_code[1]);
|
2006-06-24 13:20:15 +03:00
|
|
|
}
|
2006-06-26 09:00:07 +03:00
|
|
|
if(s->sr_code[0] == 12) {
|
|
|
|
put_bits(&s->pb, 8, s->sr_code[1]);
|
|
|
|
} else if(s->sr_code[0] > 12) {
|
|
|
|
put_bits(&s->pb, 16, s->sr_code[1]);
|
2006-06-24 13:20:15 +03:00
|
|
|
}
|
|
|
|
flush_put_bits(&s->pb);
|
2008-01-05 01:09:58 +02:00
|
|
|
crc = av_crc(av_crc_get_table(AV_CRC_8_ATM), 0,
|
|
|
|
s->pb.buf, put_bits_count(&s->pb)>>3);
|
2006-06-24 13:20:15 +03:00
|
|
|
put_bits(&s->pb, 8, crc);
|
|
|
|
}
|
|
|
|
|
2006-06-28 00:01:21 +03:00
|
|
|
static void output_subframe_constant(FlacEncodeContext *s, int ch)
|
|
|
|
{
|
|
|
|
FlacSubframe *sub;
|
|
|
|
int32_t res;
|
|
|
|
|
|
|
|
sub = &s->frame.subframes[ch];
|
|
|
|
res = sub->residual[0];
|
|
|
|
put_sbits(&s->pb, sub->obits, res);
|
|
|
|
}
|
|
|
|
|
2006-06-24 13:20:15 +03:00
|
|
|
static void output_subframe_verbatim(FlacEncodeContext *s, int ch)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
FlacFrame *frame;
|
|
|
|
FlacSubframe *sub;
|
|
|
|
int32_t res;
|
|
|
|
|
|
|
|
frame = &s->frame;
|
|
|
|
sub = &frame->subframes[ch];
|
|
|
|
|
|
|
|
for(i=0; i<frame->blocksize; i++) {
|
|
|
|
res = sub->residual[i];
|
|
|
|
put_sbits(&s->pb, sub->obits, res);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-06-28 00:01:21 +03:00
|
|
|
static void output_residual(FlacEncodeContext *ctx, int ch)
|
2006-06-24 13:20:15 +03:00
|
|
|
{
|
2006-06-28 00:01:21 +03:00
|
|
|
int i, j, p, n, parts;
|
2006-06-24 13:20:15 +03:00
|
|
|
int k, porder, psize, res_cnt;
|
|
|
|
FlacFrame *frame;
|
|
|
|
FlacSubframe *sub;
|
2006-06-28 00:01:21 +03:00
|
|
|
int32_t *res;
|
2006-06-24 13:20:15 +03:00
|
|
|
|
|
|
|
frame = &ctx->frame;
|
|
|
|
sub = &frame->subframes[ch];
|
2006-06-28 00:01:21 +03:00
|
|
|
res = sub->residual;
|
|
|
|
n = frame->blocksize;
|
2006-06-24 13:20:15 +03:00
|
|
|
|
|
|
|
/* rice-encoded block */
|
|
|
|
put_bits(&ctx->pb, 2, 0);
|
|
|
|
|
|
|
|
/* partition order */
|
2006-06-28 00:01:21 +03:00
|
|
|
porder = sub->rc.porder;
|
|
|
|
psize = n >> porder;
|
|
|
|
parts = (1 << porder);
|
2006-06-24 13:20:15 +03:00
|
|
|
put_bits(&ctx->pb, 4, porder);
|
|
|
|
res_cnt = psize - sub->order;
|
|
|
|
|
|
|
|
/* residual */
|
|
|
|
j = sub->order;
|
2006-06-28 00:01:21 +03:00
|
|
|
for(p=0; p<parts; p++) {
|
|
|
|
k = sub->rc.params[p];
|
2006-06-24 13:20:15 +03:00
|
|
|
put_bits(&ctx->pb, 4, k);
|
|
|
|
if(p == 1) res_cnt = psize;
|
2006-06-28 00:01:21 +03:00
|
|
|
for(i=0; i<res_cnt && j<n; i++, j++) {
|
|
|
|
set_sr_golomb_flac(&ctx->pb, res[j], k, INT32_MAX, 0);
|
2006-06-24 13:20:15 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-06-28 00:01:21 +03:00
|
|
|
static void output_subframe_fixed(FlacEncodeContext *ctx, int ch)
|
2006-06-24 13:20:15 +03:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
FlacFrame *frame;
|
|
|
|
FlacSubframe *sub;
|
|
|
|
|
|
|
|
frame = &ctx->frame;
|
|
|
|
sub = &frame->subframes[ch];
|
|
|
|
|
|
|
|
/* warm-up samples */
|
|
|
|
for(i=0; i<sub->order; i++) {
|
|
|
|
put_sbits(&ctx->pb, sub->obits, sub->residual[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* residual */
|
|
|
|
output_residual(ctx, ch);
|
|
|
|
}
|
|
|
|
|
2006-07-02 13:22:31 +03:00
|
|
|
static void output_subframe_lpc(FlacEncodeContext *ctx, int ch)
|
|
|
|
{
|
|
|
|
int i, cbits;
|
|
|
|
FlacFrame *frame;
|
|
|
|
FlacSubframe *sub;
|
|
|
|
|
|
|
|
frame = &ctx->frame;
|
|
|
|
sub = &frame->subframes[ch];
|
|
|
|
|
|
|
|
/* warm-up samples */
|
|
|
|
for(i=0; i<sub->order; i++) {
|
|
|
|
put_sbits(&ctx->pb, sub->obits, sub->residual[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* LPC coefficients */
|
|
|
|
cbits = ctx->options.lpc_coeff_precision;
|
|
|
|
put_bits(&ctx->pb, 4, cbits-1);
|
|
|
|
put_sbits(&ctx->pb, 5, sub->shift);
|
|
|
|
for(i=0; i<sub->order; i++) {
|
|
|
|
put_sbits(&ctx->pb, cbits, sub->coefs[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* residual */
|
|
|
|
output_residual(ctx, ch);
|
|
|
|
}
|
|
|
|
|
2006-06-24 13:20:15 +03:00
|
|
|
static void output_subframes(FlacEncodeContext *s)
|
|
|
|
{
|
|
|
|
FlacFrame *frame;
|
|
|
|
FlacSubframe *sub;
|
|
|
|
int ch;
|
|
|
|
|
|
|
|
frame = &s->frame;
|
|
|
|
|
|
|
|
for(ch=0; ch<s->channels; ch++) {
|
|
|
|
sub = &frame->subframes[ch];
|
|
|
|
|
|
|
|
/* subframe header */
|
|
|
|
put_bits(&s->pb, 1, 0);
|
|
|
|
put_bits(&s->pb, 6, sub->type_code);
|
|
|
|
put_bits(&s->pb, 1, 0); /* no wasted bits */
|
|
|
|
|
|
|
|
/* subframe */
|
2006-06-28 00:01:21 +03:00
|
|
|
if(sub->type == FLAC_SUBFRAME_CONSTANT) {
|
|
|
|
output_subframe_constant(s, ch);
|
|
|
|
} else if(sub->type == FLAC_SUBFRAME_VERBATIM) {
|
2006-06-24 13:20:15 +03:00
|
|
|
output_subframe_verbatim(s, ch);
|
2006-06-28 00:01:21 +03:00
|
|
|
} else if(sub->type == FLAC_SUBFRAME_FIXED) {
|
2006-06-24 13:20:15 +03:00
|
|
|
output_subframe_fixed(s, ch);
|
2006-07-02 13:22:31 +03:00
|
|
|
} else if(sub->type == FLAC_SUBFRAME_LPC) {
|
|
|
|
output_subframe_lpc(s, ch);
|
2006-06-24 13:20:15 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void output_frame_footer(FlacEncodeContext *s)
|
|
|
|
{
|
|
|
|
int crc;
|
|
|
|
flush_put_bits(&s->pb);
|
2008-01-05 01:09:58 +02:00
|
|
|
crc = bswap_16(av_crc(av_crc_get_table(AV_CRC_16_ANSI), 0,
|
|
|
|
s->pb.buf, put_bits_count(&s->pb)>>3));
|
2006-06-24 13:20:15 +03:00
|
|
|
put_bits(&s->pb, 16, crc);
|
|
|
|
flush_put_bits(&s->pb);
|
|
|
|
}
|
|
|
|
|
2008-09-15 00:39:54 +03:00
|
|
|
static void update_md5_sum(FlacEncodeContext *s, int16_t *samples)
|
|
|
|
{
|
|
|
|
#ifdef WORDS_BIGENDIAN
|
|
|
|
int i;
|
|
|
|
for(i = 0; i < s->frame.blocksize*s->channels; i++) {
|
|
|
|
int16_t smp = le2me_16(samples[i]);
|
|
|
|
av_md5_update(s->md5ctx, (uint8_t *)&smp, 2);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
av_md5_update(s->md5ctx, (uint8_t *)samples, s->frame.blocksize*s->channels*2);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2006-06-24 13:20:15 +03:00
|
|
|
static int flac_encode_frame(AVCodecContext *avctx, uint8_t *frame,
|
|
|
|
int buf_size, void *data)
|
|
|
|
{
|
|
|
|
int ch;
|
|
|
|
FlacEncodeContext *s;
|
|
|
|
int16_t *samples = data;
|
|
|
|
int out_bytes;
|
2008-08-17 19:10:46 +03:00
|
|
|
int reencoded=0;
|
2006-06-24 13:20:15 +03:00
|
|
|
|
|
|
|
s = avctx->priv_data;
|
|
|
|
|
2008-08-17 19:10:46 +03:00
|
|
|
if(buf_size < s->max_framesize*2) {
|
|
|
|
av_log(avctx, AV_LOG_ERROR, "output buffer too small\n");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-09-14 23:00:36 +03:00
|
|
|
/* when the last block is reached, update the header in extradata */
|
|
|
|
if (!data) {
|
2008-09-15 01:25:50 +03:00
|
|
|
s->max_framesize = s->max_encoded_framesize;
|
2008-09-15 00:39:54 +03:00
|
|
|
av_md5_final(s->md5ctx, s->md5sum);
|
2008-09-14 23:00:36 +03:00
|
|
|
write_streaminfo(s, avctx->extradata);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-06-26 09:00:07 +03:00
|
|
|
init_frame(s);
|
2006-06-24 13:20:15 +03:00
|
|
|
|
|
|
|
copy_samples(s, samples);
|
|
|
|
|
2006-06-26 09:00:07 +03:00
|
|
|
channel_decorrelation(s);
|
|
|
|
|
2006-06-24 13:20:15 +03:00
|
|
|
for(ch=0; ch<s->channels; ch++) {
|
|
|
|
encode_residual(s, ch);
|
|
|
|
}
|
2008-08-17 19:10:46 +03:00
|
|
|
|
|
|
|
write_frame:
|
2006-06-24 13:20:15 +03:00
|
|
|
init_put_bits(&s->pb, frame, buf_size);
|
|
|
|
output_frame_header(s);
|
|
|
|
output_subframes(s);
|
|
|
|
output_frame_footer(s);
|
|
|
|
out_bytes = put_bits_count(&s->pb) >> 3;
|
|
|
|
|
2008-08-17 19:10:46 +03:00
|
|
|
if(out_bytes > s->max_framesize) {
|
|
|
|
if(reencoded) {
|
2006-06-24 13:20:15 +03:00
|
|
|
/* still too large. must be an error. */
|
|
|
|
av_log(avctx, AV_LOG_ERROR, "error encoding frame\n");
|
|
|
|
return -1;
|
|
|
|
}
|
2008-08-17 19:10:46 +03:00
|
|
|
|
|
|
|
/* frame too large. use verbatim mode */
|
|
|
|
for(ch=0; ch<s->channels; ch++) {
|
|
|
|
encode_residual_v(s, ch);
|
|
|
|
}
|
|
|
|
reencoded = 1;
|
|
|
|
goto write_frame;
|
2006-06-24 13:20:15 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
s->frame_count++;
|
2008-09-14 23:00:36 +03:00
|
|
|
s->sample_count += avctx->frame_size;
|
2008-09-15 00:39:54 +03:00
|
|
|
update_md5_sum(s, samples);
|
2008-09-15 01:25:50 +03:00
|
|
|
if (out_bytes > s->max_encoded_framesize)
|
|
|
|
s->max_encoded_framesize = out_bytes;
|
2009-03-21 02:50:19 +02:00
|
|
|
if (out_bytes < s->min_framesize)
|
|
|
|
s->min_framesize = out_bytes;
|
2008-09-14 23:00:36 +03:00
|
|
|
|
2006-06-24 13:20:15 +03:00
|
|
|
return out_bytes;
|
|
|
|
}
|
|
|
|
|
2008-03-21 05:11:20 +02:00
|
|
|
static av_cold int flac_encode_close(AVCodecContext *avctx)
|
2006-06-24 13:20:15 +03:00
|
|
|
{
|
2008-09-15 00:39:54 +03:00
|
|
|
if (avctx->priv_data) {
|
|
|
|
FlacEncodeContext *s = avctx->priv_data;
|
|
|
|
av_freep(&s->md5ctx);
|
|
|
|
}
|
2006-06-26 09:00:07 +03:00
|
|
|
av_freep(&avctx->extradata);
|
|
|
|
avctx->extradata_size = 0;
|
2006-06-24 13:20:15 +03:00
|
|
|
av_freep(&avctx->coded_frame);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
AVCodec flac_encoder = {
|
|
|
|
"flac",
|
|
|
|
CODEC_TYPE_AUDIO,
|
|
|
|
CODEC_ID_FLAC,
|
|
|
|
sizeof(FlacEncodeContext),
|
|
|
|
flac_encode_init,
|
|
|
|
flac_encode_frame,
|
|
|
|
flac_encode_close,
|
|
|
|
NULL,
|
2008-09-14 23:00:36 +03:00
|
|
|
.capabilities = CODEC_CAP_SMALL_LAST_FRAME | CODEC_CAP_DELAY,
|
2008-07-31 13:47:31 +03:00
|
|
|
.sample_fmts = (enum SampleFormat[]){SAMPLE_FMT_S16,SAMPLE_FMT_NONE},
|
2008-06-13 00:50:13 +03:00
|
|
|
.long_name = NULL_IF_CONFIG_SMALL("FLAC (Free Lossless Audio Codec)"),
|
2006-06-24 13:20:15 +03:00
|
|
|
};
|