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
143 memcpy(&header[18], s->
md5sum, 16);
159 target = (samplerate * block_time_ms) / 1000;
160 for (i = 0; i < 16; i++) {
185 av_log(avctx,
AV_LOG_DEBUG,
" lpc type: Levinson-Durbin recursion with Welch window\n");
253 channels, FLAC_MAX_CHANNELS);
261 for (i = 4; i < 12; i++) {
271 if (freq % 1000 == 0 && freq < 255000) {
274 }
else if (freq % 10 == 0 && freq < 655350) {
277 }
else if (freq < 65535) {
300 s->
options.
block_time_ms = ((
int[]){ 27, 27, 27,105,105,105,105,105,105,105,105,105,105})[level];
307 FF_LPC_TYPE_LEVINSON})[level];
309 s->
options.
min_prediction_order = ((
int[]){ 2, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1})[level];
310 s->
options.
max_prediction_order = ((
int[]){ 3, 4, 4, 6, 8, 8, 8, 8, 12, 12, 12, 32, 32})[level];
317 ORDER_METHOD_SEARCH})[level];
325 s->
options.
min_partition_order = ((
int[]){ 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0})[level];
327 s->
options.
max_partition_order = ((
int[]){ 2, 2, 3, 3, 3, 8, 8, 8, 8, 8, 8, 8, 8})[level];
415 "output stream will have incorrect "
416 "channel layout.\n");
419 "will use Flac channel layout for "
420 "%d channels.\n", channels);
444 for (i = 0; i < 16; i++) {
463 for (ch = 0; ch < s->
channels; ch++) {
489 #define COPY_SAMPLES(bits) do { \
490 const int ## bits ## _t *samples0 = samples; \
492 for (i = 0, j = 0; i < frame->blocksize; i++) \
493 for (ch = 0; ch < s->channels; ch++, j++) \
494 frame->subframes[ch].samples[i] = samples0[j] >> shift; \
509 for (i = 0; i <
n; i++) {
512 count += (v >> k) + 1 + k;
521 int p, porder, psize;
535 count += pred_order * sub->
obits;
552 for (p = 0; p < 1 << porder; p++) {
565 #define rice_encode_count(sum, n, k) (((n)*((k)+1))+((sum-(n>>1))>>(k)))
577 sum2 = sum - (n >> 1);
578 k =
av_log2(av_clipl_int32(sum2 / n));
579 return FFMIN(k, max_param);
584 uint64_t *sums,
int n,
int pred_order)
587 int k, cnt, part, max_param;
592 part = (1 << porder);
595 cnt = (n >> porder) - pred_order;
596 for (i = 0; i < part; i++) {
614 uint32_t *
res, *res_end;
618 res = &data[pred_order];
619 res_end = &data[n >> pmax];
620 for (i = 0; i < parts; i++) {
622 while (res < res_end)
625 res_end += n >> pmax;
628 for (i = pmax - 1; i >= pmin; i--) {
630 for (j = 0; j < parts; j++)
631 sums[i][j] = sums[i+1][2*j] + sums[i+1][2*j+1];
653 for (i = 0; i <
n; i++)
654 udata[i] = (2*data[i]) ^ (data[i]>>31);
656 calc_sums(pmin, pmax, udata, n, pred_order, sums);
659 bits[pmin] = UINT32_MAX;
660 for (i = pmin; i <= pmax; i++) {
662 if (bits[i] <= bits[opt_porder]) {
669 return bits[opt_porder];
704 for (i = 0; i < order; i++)
708 for (i = order; i <
n; i++)
710 }
else if (order == 1) {
711 for (i = order; i <
n; i++)
712 res[i] = smp[i] - smp[i-1];
713 }
else if (order == 2) {
714 int a = smp[order-1] - smp[order-2];
715 for (i = order; i <
n; i += 2) {
716 int b = smp[i ] - smp[i-1];
718 a = smp[i+1] - smp[i ];
721 }
else if (order == 3) {
722 int a = smp[order-1] - smp[order-2];
723 int c = smp[order-1] - 2*smp[order-2] + smp[order-3];
724 for (i = order; i <
n; i += 2) {
725 int b = smp[i ] - smp[i-1];
728 a = smp[i+1] - smp[i ];
733 int a = smp[order-1] - smp[order-2];
734 int c = smp[order-1] - 2*smp[order-2] + smp[order-3];
735 int e = smp[order-1] - 3*smp[order-2] + 3*smp[order-3] - smp[order-4];
736 for (i = order; i <
n; i += 2) {
737 int b = smp[i ] - smp[i-1];
741 a = smp[i+1] - smp[i ];
753 int min_order, max_order, opt_order, omethod;
767 for (i = 1; i <
n; i++)
779 memcpy(res, smp, n *
sizeof(
int32_t));
795 bits[0] = UINT32_MAX;
796 for (i = min_order; i <= max_order; i++) {
799 if (bits[i] < bits[opt_order])
802 sub->
order = opt_order;
804 if (sub->
order != max_order) {
821 int levels = 1 << omethod;
824 int opt_index = levels-1;
825 opt_order = max_order-1;
826 bits[opt_index] = UINT32_MAX;
827 for (i = levels-1; i >= 0; i--) {
828 int last_order = order;
829 order = min_order + (((max_order-min_order+1) * (i+1)) / levels)-1;
830 order = av_clip(order, min_order - 1, max_order - 1);
831 if (order == last_order)
836 if (bits[i] < bits[opt_index]) {
846 bits[0] = UINT32_MAX;
847 for (i = min_order-1; i < max_order; i++) {
850 if (bits[i] < bits[opt_order])
858 opt_order = min_order - 1 + (max_order-min_order)/3;
859 memset(bits, -1,
sizeof(bits));
861 for (step = 16; step; step >>= 1) {
862 int last = opt_order;
863 for (i = last-step; i <= last+step; i += step) {
864 if (i < min_order-1 || i >= max_order || bits[i] < UINT32_MAX)
868 if (bits[i] < bits[opt_order])
875 sub->
order = opt_order;
878 for (i = 0; i < sub->
order; i++)
932 for (ch = 0; ch < s->
channels; ch++)
935 count += (8 - (count & 7)) & 7;
949 for (ch = 0; ch < s->
channels; ch++) {
987 sum[0] = sum[1] = sum[2] = sum[3] = 0;
988 for (i = 2; i <
n; i++) {
989 lt = left_ch[i] - 2*left_ch[i-1] + left_ch[i-2];
990 rt = right_ch[i] - 2*right_ch[i-1] + right_ch[i-2];
991 sum[2] +=
FFABS((lt + rt) >> 1);
992 sum[3] +=
FFABS(lt - rt);
997 for (i = 0; i < 4; i++) {
1003 score[0] = sum[0] + sum[1];
1004 score[1] = sum[0] + sum[3];
1005 score[2] = sum[1] + sum[3];
1006 score[3] = sum[2] + sum[3];
1010 for (i = 1; i < 4; i++)
1011 if (score[i] < score[best])
1048 for (i = 0; i <
n; i++) {
1050 left[i] = (tmp + right[i]) >> 1;
1051 right[i] = tmp - right[i];
1055 for (i = 0; i <
n; i++)
1056 right[i] = left[i] - right[i];
1059 for (i = 0; i <
n; i++)
1060 left[i] -= right[i];
1095 else if (frame->
bs_code[0] == 7)
1114 for (ch = 0; ch < s->
channels; ch++) {
1116 int i, p, porder, psize;
1132 while (res < frame_end)
1136 for (i = 0; i < sub->
order; i++)
1144 for (i = 0; i < sub->
order; i++)
1158 for (p = 0; p < 1 << porder; p++) {
1161 while (res < part_end)
1163 part_end =
FFMIN(frame_end, part_end + psize);
1204 buf = (
const uint8_t *)samples;
1207 (
const uint16_t *)samples, buf_size / 2);
1212 const int32_t *samples0 = samples;
1217 *tmp++ = (
v ) & 0xFF;
1218 *tmp++ = (v >> 8) & 0xFF;
1219 *tmp++ = (v >> 16) & 0xFF;
1233 int frame_bytes, out_bytes,
ret;
1267 if (frame_bytes < 0) {
1286 if (out_bytes < s->min_framesize)
1291 avpkt->
size = out_bytes;
1292 *got_packet_ptr = 1;
1310 #define FLAGS AV_OPT_FLAG_ENCODING_PARAM | AV_OPT_FLAG_AUDIO_PARAM
1313 {
"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" },
1318 {
"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 },
1321 {
"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" },
1328 {
"ch_mode",
"Stereo decorrelation mode", offsetof(
FlacEncodeContext, options.ch_mode),
AV_OPT_TYPE_INT, { .i64 = -1 }, -1,
FLAC_CHMODE_MID_SIDE,
FLAGS,
"ch_mode" },