37 #define FLAC_SUBFRAME_CONSTANT 0
38 #define FLAC_SUBFRAME_VERBATIM 1
39 #define FLAC_SUBFRAME_FIXED 8
40 #define FLAC_SUBFRAME_LPC 32
42 #define MAX_FIXED_ORDER 4
43 #define MAX_PARTITION_ORDER 8
44 #define MAX_PARTITIONS (1 << MAX_PARTITION_ORDER)
45 #define MAX_LPC_PRECISION 15
46 #define MAX_LPC_SHIFT 15
146 memcpy(&header[18], s->
md5sum, 16);
162 target = (samplerate * block_time_ms) / 1000;
163 for (i = 0; i < 16; i++) {
188 av_log(avctx,
AV_LOG_DEBUG,
" lpc type: Levinson-Durbin recursion with Welch window\n");
256 channels, FLAC_MAX_CHANNELS);
264 for (i = 4; i < 12; i++) {
274 if (freq % 1000 == 0 && freq < 255000) {
277 }
else if (freq % 10 == 0 && freq < 655350) {
280 }
else if (freq < 65535) {
303 s->
options.
block_time_ms = ((
int[]){ 27, 27, 27,105,105,105,105,105,105,105,105,105,105})[level];
310 FF_LPC_TYPE_LEVINSON})[level];
312 s->
options.
min_prediction_order = ((
int[]){ 2, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1})[level];
313 s->
options.
max_prediction_order = ((
int[]){ 3, 4, 4, 6, 8, 8, 8, 8, 12, 12, 12, 32, 32})[level];
320 ORDER_METHOD_SEARCH})[level];
328 s->
options.
min_partition_order = ((
int[]){ 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0})[level];
330 s->
options.
max_partition_order = ((
int[]){ 2, 2, 3, 3, 3, 8, 8, 8, 8, 8, 8, 8, 8})[level];
418 "output stream will have incorrect "
419 "channel layout.\n");
422 "will use Flac channel layout for "
423 "%d channels.\n", channels);
447 for (i = 0; i < 16; i++) {
466 for (ch = 0; ch < s->
channels; ch++) {
492 #define COPY_SAMPLES(bits) do { \
493 const int ## bits ## _t *samples0 = samples; \
495 for (i = 0, j = 0; i < frame->blocksize; i++) \
496 for (ch = 0; ch < s->channels; ch++, j++) \
497 frame->subframes[ch].samples[i] = samples0[j] >> shift; \
512 for (i = 0; i <
n; i++) {
515 count += (v >> k) + 1 + k;
524 int p, porder, psize;
538 count += pred_order * sub->
obits;
555 for (p = 0; p < 1 << porder; p++) {
568 #define rice_encode_count(sum, n, k) (((n)*((k)+1))+((sum-(n>>1))>>(k)))
580 sum2 = sum - (n >> 1);
581 k =
av_log2(av_clipl_int32(sum2 / n));
582 return FFMIN(k, max_param);
587 uint64_t *sums,
int n,
int pred_order)
590 int k, cnt, part, max_param;
595 part = (1 << porder);
598 cnt = (n >> porder) - pred_order;
599 for (i = 0; i < part; i++) {
617 uint32_t *res, *res_end;
621 res = &data[pred_order];
622 res_end = &data[n >> pmax];
623 for (i = 0; i < parts; i++) {
625 while (res < res_end)
628 res_end += n >> pmax;
635 int parts = (1 <<
level);
636 for (i = 0; i < parts; i++)
637 sums[i] = sums[2*i] + sums[2*i+1];
657 for (i = 0; i <
n; i++)
658 udata[i] = (2*data[i]) ^ (data[i]>>31);
663 bits[pmin] = UINT32_MAX;
666 if (bits[i] < bits[opt_porder]) {
676 return bits[opt_porder];
711 for (i = 0; i < order; i++)
715 for (i = order; i <
n; i++)
717 }
else if (order == 1) {
718 for (i = order; i <
n; i++)
719 res[i] = smp[i] - smp[i-1];
720 }
else if (order == 2) {
721 int a = smp[order-1] - smp[order-2];
722 for (i = order; i <
n; i += 2) {
723 int b = smp[i ] - smp[i-1];
725 a = smp[i+1] - smp[i ];
728 }
else if (order == 3) {
729 int a = smp[order-1] - smp[order-2];
730 int c = smp[order-1] - 2*smp[order-2] + smp[order-3];
731 for (i = order; i <
n; i += 2) {
732 int b = smp[i ] - smp[i-1];
735 a = smp[i+1] - smp[i ];
740 int a = smp[order-1] - smp[order-2];
741 int c = smp[order-1] - 2*smp[order-2] + smp[order-3];
742 int e = smp[order-1] - 3*smp[order-2] + 3*smp[order-3] - smp[order-4];
743 for (i = order; i <
n; i += 2) {
744 int b = smp[i ] - smp[i-1];
748 a = smp[i+1] - smp[i ];
760 int min_order, max_order, opt_order, omethod;
774 for (i = 1; i <
n; i++)
786 memcpy(res, smp, n *
sizeof(
int32_t));
802 bits[0] = UINT32_MAX;
803 for (i = min_order; i <= max_order; i++) {
806 if (bits[i] < bits[opt_order])
809 sub->
order = opt_order;
811 if (sub->
order != max_order) {
828 int levels = 1 << omethod;
831 int opt_index = levels-1;
832 opt_order = max_order-1;
833 bits[opt_index] = UINT32_MAX;
834 for (i = levels-1; i >= 0; i--) {
835 int last_order = order;
836 order = min_order + (((max_order-min_order+1) * (i+1)) / levels)-1;
837 order = av_clip(order, min_order - 1, max_order - 1);
838 if (order == last_order)
843 if (bits[i] < bits[opt_index]) {
853 bits[0] = UINT32_MAX;
854 for (i = min_order-1; i < max_order; i++) {
857 if (bits[i] < bits[opt_order])
865 opt_order = min_order - 1 + (max_order-min_order)/3;
866 memset(bits, -1,
sizeof(bits));
868 for (step = 16; step; step >>= 1) {
869 int last = opt_order;
870 for (i = last-step; i <= last+step; i += step) {
871 if (i < min_order-1 || i >= max_order || bits[i] < UINT32_MAX)
875 if (bits[i] < bits[opt_order])
882 sub->
order = opt_order;
885 for (i = 0; i < sub->
order; i++)
939 for (ch = 0; ch < s->
channels; ch++)
942 count += (8 - (count & 7)) & 7;
956 for (ch = 0; ch < s->
channels; ch++) {
994 sum[0] = sum[1] = sum[2] = sum[3] = 0;
995 for (i = 2; i <
n; i++) {
996 lt = left_ch[i] - 2*left_ch[i-1] + left_ch[i-2];
997 rt = right_ch[i] - 2*right_ch[i-1] + right_ch[i-2];
998 sum[2] +=
FFABS((lt + rt) >> 1);
999 sum[3] +=
FFABS(lt - rt);
1000 sum[0] +=
FFABS(lt);
1001 sum[1] +=
FFABS(rt);
1004 for (i = 0; i < 4; i++) {
1010 score[0] = sum[0] + sum[1];
1011 score[1] = sum[0] + sum[3];
1012 score[2] = sum[1] + sum[3];
1013 score[3] = sum[2] + sum[3];
1017 for (i = 1; i < 4; i++)
1018 if (score[i] < score[best])
1055 for (i = 0; i <
n; i++) {
1057 left[i] = (tmp + right[i]) >> 1;
1058 right[i] = tmp - right[i];
1062 for (i = 0; i <
n; i++)
1063 right[i] = left[i] - right[i];
1066 for (i = 0; i <
n; i++)
1067 left[i] -= right[i];
1102 else if (frame->
bs_code[0] == 7)
1121 for (ch = 0; ch < s->
channels; ch++) {
1123 int i, p, porder, psize;
1139 while (res < frame_end)
1143 for (i = 0; i < sub->
order; i++)
1151 for (i = 0; i < sub->
order; i++)
1165 for (p = 0; p < 1 << porder; p++) {
1168 while (res < part_end)
1170 part_end =
FFMIN(frame_end, part_end + psize);
1211 buf = (
const uint8_t *)samples;
1214 (
const uint16_t *) samples, buf_size / 2);
1219 const int32_t *samples0 = samples;
1224 *tmp++ = (
v ) & 0xFF;
1225 *tmp++ = (v >> 8) & 0xFF;
1226 *tmp++ = (v >> 16) & 0xFF;
1240 int frame_bytes, out_bytes,
ret;
1259 *got_packet_ptr = 1;
1288 if (frame_bytes < 0) {
1307 if (out_bytes < s->min_framesize)
1312 avpkt->
size = out_bytes;
1316 *got_packet_ptr = 1;
1334 #define FLAGS AV_OPT_FLAG_ENCODING_PARAM | AV_OPT_FLAG_AUDIO_PARAM
1337 {
"lpc_type",
"LPC algorithm", offsetof(
FlacEncodeContext, options.lpc_type),
AV_OPT_TYPE_INT, {.i64 =
FF_LPC_TYPE_DEFAULT },
FF_LPC_TYPE_DEFAULT,
FF_LPC_TYPE_NB-1,
FLAGS,
"lpc_type" },
1342 {
"lpc_passes",
"Number of passes to use for Cholesky factorization during LPC analysis", offsetof(
FlacEncodeContext, options.lpc_passes),
AV_OPT_TYPE_INT, {.i64 = 2 }, 1, INT_MAX,
FLAGS },
1345 {
"prediction_order_method",
"Search method for selecting prediction order", offsetof(
FlacEncodeContext, options.prediction_order_method),
AV_OPT_TYPE_INT, {.i64 = -1 }, -1,
ORDER_METHOD_LOG,
FLAGS,
"predm" },
1352 {
"ch_mode",
"Stereo decorrelation mode", offsetof(
FlacEncodeContext, options.ch_mode),
AV_OPT_TYPE_INT, { .i64 = -1 }, -1,
FLAC_CHMODE_MID_SIDE,
FLAGS,
"ch_mode" },