/
flacenc.c
1769 lines (1519 loc) · 60.8 KB
/
flacenc.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* FLAC audio encoder
* Copyright (c) 2006 Justin Ruggles <justin.ruggles@gmail.com>
*
* 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
*/
#include "libavutil/avassert.h"
#include "libavutil/channel_layout.h"
#include "libavutil/crc.h"
#include "libavutil/intmath.h"
#include "libavutil/md5.h"
#include "libavutil/mem.h"
#include "libavutil/opt.h"
#include "avcodec.h"
#include "bswapdsp.h"
#include "codec_internal.h"
#include "encode.h"
#include "put_bits.h"
#include "lpc.h"
#include "flac.h"
#include "flacdata.h"
#include "flacencdsp.h"
#define FLAC_SUBFRAME_CONSTANT 0
#define FLAC_SUBFRAME_VERBATIM 1
#define FLAC_SUBFRAME_FIXED 8
#define FLAC_SUBFRAME_LPC 32
#define MAX_FIXED_ORDER 4
#define MAX_PARTITION_ORDER 8
#define MAX_PARTITIONS (1 << MAX_PARTITION_ORDER)
#define MAX_LPC_PRECISION 15
#define MIN_LPC_SHIFT 0
#define MAX_LPC_SHIFT 15
enum CodingMode {
CODING_MODE_RICE = 4,
CODING_MODE_RICE2 = 5,
};
typedef struct CompressionOptions {
int compression_level;
int block_time_ms;
enum FFLPCType lpc_type;
int lpc_passes;
int lpc_coeff_precision;
int min_prediction_order;
int max_prediction_order;
int prediction_order_method;
int min_partition_order;
int max_partition_order;
int ch_mode;
int exact_rice_parameters;
int multi_dim_quant;
} CompressionOptions;
typedef struct RiceContext {
enum CodingMode coding_mode;
int porder;
int params[MAX_PARTITIONS];
} RiceContext;
typedef struct FlacSubframe {
int type;
int type_code;
int obits;
int wasted;
int order;
int32_t coefs[MAX_LPC_ORDER];
int shift;
RiceContext rc;
uint32_t rc_udata[FLAC_MAX_BLOCKSIZE];
uint64_t rc_sums[32][MAX_PARTITIONS];
int32_t samples[FLAC_MAX_BLOCKSIZE];
int32_t residual[FLAC_MAX_BLOCKSIZE+11];
} FlacSubframe;
typedef struct FlacFrame {
FlacSubframe subframes[FLAC_MAX_CHANNELS];
int64_t samples_33bps[FLAC_MAX_BLOCKSIZE];
int blocksize;
int bs_code[2];
uint8_t crc8;
int ch_mode;
int verbatim_only;
} FlacFrame;
typedef struct FlacEncodeContext {
AVClass *class;
PutBitContext pb;
int channels;
int samplerate;
int sr_code[2];
int bps_code;
int max_blocksize;
int min_framesize;
int max_framesize;
int max_encoded_framesize;
uint32_t frame_count;
uint64_t sample_count;
uint8_t md5sum[16];
FlacFrame frame;
CompressionOptions options;
AVCodecContext *avctx;
LPCContext lpc_ctx;
struct AVMD5 *md5ctx;
uint8_t *md5_buffer;
unsigned int md5_buffer_size;
BswapDSPContext bdsp;
FLACEncDSPContext flac_dsp;
int flushed;
int64_t next_pts;
} FlacEncodeContext;
/**
* Write 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 */
put_bits(&pb, 16, s->max_blocksize);
put_bits(&pb, 16, s->max_blocksize);
put_bits(&pb, 24, s->min_framesize);
put_bits(&pb, 24, s->max_framesize);
put_bits(&pb, 20, s->samplerate);
put_bits(&pb, 3, s->channels-1);
put_bits(&pb, 5, s->avctx->bits_per_raw_sample - 1);
/* 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);
flush_put_bits(&pb);
memcpy(&header[18], s->md5sum, 16);
}
/**
* Calculate an estimate for the maximum frame size based on verbatim mode.
* @param blocksize block size, in samples
* @param ch number of channels
* @param bps bits-per-sample
*/
static int flac_get_max_frame_size(int blocksize, int ch, int bps)
{
/* Technically, there is no limit to FLAC frame size, but an encoder
should not write a frame that is larger than if verbatim encoding mode
were to be used. */
int count;
count = 16; /* frame header */
count += ch * ((7+bps+7)/8); /* subframe headers */
if (ch == 2) {
/* for stereo, need to account for using decorrelation */
count += (( 2*bps+1) * blocksize + 7) / 8;
} else {
count += ( ch*bps * blocksize + 7) / 8;
}
count += 2; /* frame footer */
return count;
}
/**
* Set blocksize based on samplerate.
* Choose the closest predefined blocksize >= BLOCK_TIME_MS milliseconds.
*/
static int select_blocksize(int samplerate, int block_time_ms)
{
int i;
int target;
int blocksize;
av_assert0(samplerate > 0);
blocksize = ff_flac_blocksize_table[1];
target = (samplerate * block_time_ms) / 1000;
for (i = 0; i < 16; i++) {
if (target >= ff_flac_blocksize_table[i] &&
ff_flac_blocksize_table[i] > blocksize) {
blocksize = ff_flac_blocksize_table[i];
}
}
return blocksize;
}
static av_cold void dprint_compression_options(FlacEncodeContext *s)
{
AVCodecContext *avctx = s->avctx;
CompressionOptions *opt = &s->options;
av_log(avctx, AV_LOG_DEBUG, " compression: %d\n", opt->compression_level);
switch (opt->lpc_type) {
case FF_LPC_TYPE_NONE:
av_log(avctx, AV_LOG_DEBUG, " lpc type: None\n");
break;
case FF_LPC_TYPE_FIXED:
av_log(avctx, AV_LOG_DEBUG, " lpc type: Fixed pre-defined coefficients\n");
break;
case FF_LPC_TYPE_LEVINSON:
av_log(avctx, AV_LOG_DEBUG, " lpc type: Levinson-Durbin recursion with Welch window\n");
break;
case FF_LPC_TYPE_CHOLESKY:
av_log(avctx, AV_LOG_DEBUG, " lpc type: Cholesky factorization, %d pass%s\n",
opt->lpc_passes, opt->lpc_passes == 1 ? "" : "es");
break;
}
av_log(avctx, AV_LOG_DEBUG, " prediction order: %d, %d\n",
opt->min_prediction_order, opt->max_prediction_order);
switch (opt->prediction_order_method) {
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;
case ORDER_METHOD_LOG:
av_log(avctx, AV_LOG_DEBUG, " order method: %s\n", "log search");
break;
}
av_log(avctx, AV_LOG_DEBUG, " partition order: %d, %d\n",
opt->min_partition_order, opt->max_partition_order);
av_log(avctx, AV_LOG_DEBUG, " block size: %d\n", avctx->frame_size);
av_log(avctx, AV_LOG_DEBUG, " lpc precision: %d\n",
opt->lpc_coeff_precision);
}
static av_cold int flac_encode_init(AVCodecContext *avctx)
{
int freq = avctx->sample_rate;
int channels = avctx->ch_layout.nb_channels;
FlacEncodeContext *s = avctx->priv_data;
int i, level, ret;
uint8_t *streaminfo;
s->avctx = avctx;
switch (avctx->sample_fmt) {
case AV_SAMPLE_FMT_S16:
avctx->bits_per_raw_sample = 16;
s->bps_code = 4;
break;
case AV_SAMPLE_FMT_S32:
if (avctx->bits_per_raw_sample <= 24) {
if (avctx->bits_per_raw_sample < 24)
av_log(avctx, AV_LOG_WARNING, "encoding as 24 bits-per-sample\n");
avctx->bits_per_raw_sample = 24;
s->bps_code = 6;
} else if (avctx->strict_std_compliance > FF_COMPLIANCE_EXPERIMENTAL) {
av_log(avctx, AV_LOG_WARNING,
"encoding as 24 bits-per-sample, more is considered "
"experimental. Add -strict experimental if you want "
"to encode more than 24 bits-per-sample\n");
avctx->bits_per_raw_sample = 24;
s->bps_code = 6;
} else {
avctx->bits_per_raw_sample = 32;
s->bps_code = 7;
}
break;
}
if (channels < 1 || channels > FLAC_MAX_CHANNELS) {
av_log(avctx, AV_LOG_ERROR, "%d channels not supported (max %d)\n",
channels, FLAC_MAX_CHANNELS);
return AVERROR(EINVAL);
}
s->channels = channels;
/* find samplerate in table */
if (freq < 1)
return AVERROR(EINVAL);
for (i = 1; i < 12; i++) {
if (freq == ff_flac_sample_rate_table[i]) {
s->samplerate = ff_flac_sample_rate_table[i];
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 if (freq < 1048576) {
s->sr_code[0] = 0;
s->sr_code[1] = 0;
} else {
av_log(avctx, AV_LOG_ERROR, "%d Hz not supported\n", freq);
return AVERROR(EINVAL);
}
s->samplerate = freq;
}
/* 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;
level = s->options.compression_level;
if (level > 12) {
av_log(avctx, AV_LOG_ERROR, "invalid compression level: %d\n",
s->options.compression_level);
return AVERROR(EINVAL);
}
s->options.block_time_ms = ((int[]){ 27, 27, 27,105,105,105,105,105,105,105,105,105,105})[level];
if (s->options.lpc_type == FF_LPC_TYPE_DEFAULT)
s->options.lpc_type = ((int[]){ FF_LPC_TYPE_FIXED, FF_LPC_TYPE_FIXED, FF_LPC_TYPE_FIXED,
FF_LPC_TYPE_LEVINSON, FF_LPC_TYPE_LEVINSON, FF_LPC_TYPE_LEVINSON,
FF_LPC_TYPE_LEVINSON, FF_LPC_TYPE_LEVINSON, FF_LPC_TYPE_LEVINSON,
FF_LPC_TYPE_LEVINSON, FF_LPC_TYPE_LEVINSON, FF_LPC_TYPE_LEVINSON,
FF_LPC_TYPE_LEVINSON})[level];
if (s->options.min_prediction_order < 0)
s->options.min_prediction_order = ((int[]){ 2, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1})[level];
if (s->options.max_prediction_order < 0)
s->options.max_prediction_order = ((int[]){ 3, 4, 4, 6, 8, 8, 8, 8, 12, 12, 12, 32, 32})[level];
if (s->options.prediction_order_method < 0)
s->options.prediction_order_method = ((int[]){ ORDER_METHOD_EST, ORDER_METHOD_EST, ORDER_METHOD_EST,
ORDER_METHOD_EST, ORDER_METHOD_EST, ORDER_METHOD_EST,
ORDER_METHOD_4LEVEL, ORDER_METHOD_LOG, ORDER_METHOD_4LEVEL,
ORDER_METHOD_LOG, ORDER_METHOD_SEARCH, ORDER_METHOD_LOG,
ORDER_METHOD_SEARCH})[level];
if (s->options.min_partition_order > s->options.max_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 AVERROR(EINVAL);
}
if (s->options.min_partition_order < 0)
s->options.min_partition_order = ((int[]){ 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0})[level];
if (s->options.max_partition_order < 0)
s->options.max_partition_order = ((int[]){ 2, 2, 3, 3, 3, 8, 8, 8, 8, 8, 8, 8, 8})[level];
if (s->options.lpc_type == FF_LPC_TYPE_NONE) {
s->options.min_prediction_order = 0;
s->options.max_prediction_order = 0;
} else if (s->options.lpc_type == FF_LPC_TYPE_FIXED) {
if (s->options.min_prediction_order > MAX_FIXED_ORDER) {
av_log(avctx, AV_LOG_WARNING,
"invalid min prediction order %d, clamped to %d\n",
s->options.min_prediction_order, MAX_FIXED_ORDER);
s->options.min_prediction_order = MAX_FIXED_ORDER;
}
if (s->options.max_prediction_order > MAX_FIXED_ORDER) {
av_log(avctx, AV_LOG_WARNING,
"invalid max prediction order %d, clamped to %d\n",
s->options.max_prediction_order, MAX_FIXED_ORDER);
s->options.max_prediction_order = MAX_FIXED_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 AVERROR(EINVAL);
}
if (avctx->frame_size > 0) {
if (avctx->frame_size < FLAC_MIN_BLOCKSIZE ||
avctx->frame_size > FLAC_MAX_BLOCKSIZE) {
av_log(avctx, AV_LOG_ERROR, "invalid block size: %d\n",
avctx->frame_size);
return AVERROR(EINVAL);
}
} else {
s->avctx->frame_size = select_blocksize(s->samplerate, s->options.block_time_ms);
}
s->max_blocksize = s->avctx->frame_size;
/* set maximum encoded frame size in verbatim mode */
s->max_framesize = flac_get_max_frame_size(s->avctx->frame_size,
s->channels,
s->avctx->bits_per_raw_sample);
/* initialize MD5 context */
s->md5ctx = av_md5_alloc();
if (!s->md5ctx)
return AVERROR(ENOMEM);
av_md5_init(s->md5ctx);
streaminfo = av_malloc(FLAC_STREAMINFO_SIZE);
if (!streaminfo)
return AVERROR(ENOMEM);
write_streaminfo(s, streaminfo);
avctx->extradata = streaminfo;
avctx->extradata_size = FLAC_STREAMINFO_SIZE;
s->frame_count = 0;
s->min_framesize = s->max_framesize;
if ((channels == 3 &&
av_channel_layout_compare(&avctx->ch_layout, &(AVChannelLayout)AV_CHANNEL_LAYOUT_SURROUND)) ||
(channels == 4 &&
av_channel_layout_compare(&avctx->ch_layout, &(AVChannelLayout)AV_CHANNEL_LAYOUT_2_2) &&
av_channel_layout_compare(&avctx->ch_layout, &(AVChannelLayout)AV_CHANNEL_LAYOUT_QUAD)) ||
(channels == 5 &&
av_channel_layout_compare(&avctx->ch_layout, &(AVChannelLayout)AV_CHANNEL_LAYOUT_5POINT0) &&
av_channel_layout_compare(&avctx->ch_layout, &(AVChannelLayout)AV_CHANNEL_LAYOUT_5POINT0_BACK)) ||
(channels == 6 &&
av_channel_layout_compare(&avctx->ch_layout, &(AVChannelLayout)AV_CHANNEL_LAYOUT_5POINT1) &&
av_channel_layout_compare(&avctx->ch_layout, &(AVChannelLayout)AV_CHANNEL_LAYOUT_5POINT1_BACK))) {
if (avctx->ch_layout.order != AV_CHANNEL_ORDER_UNSPEC) {
av_log(avctx, AV_LOG_ERROR, "Channel layout not supported by Flac, "
"output stream will have incorrect "
"channel layout.\n");
} else {
av_log(avctx, AV_LOG_WARNING, "No channel layout specified. The encoder "
"will use Flac channel layout for "
"%d channels.\n", channels);
}
}
ret = ff_lpc_init(&s->lpc_ctx, avctx->frame_size,
s->options.max_prediction_order, FF_LPC_TYPE_LEVINSON);
ff_bswapdsp_init(&s->bdsp);
ff_flacencdsp_init(&s->flac_dsp);
dprint_compression_options(s);
return ret;
}
static void init_frame(FlacEncodeContext *s, int nb_samples)
{
int i, ch;
FlacFrame *frame;
frame = &s->frame;
for (i = 0; i < 16; i++) {
if (nb_samples == ff_flac_blocksize_table[i]) {
frame->blocksize = ff_flac_blocksize_table[i];
frame->bs_code[0] = i;
frame->bs_code[1] = 0;
break;
}
}
if (i == 16) {
frame->blocksize = nb_samples;
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++) {
FlacSubframe *sub = &frame->subframes[ch];
sub->wasted = 0;
sub->obits = s->avctx->bits_per_raw_sample;
if (sub->obits > 16)
sub->rc.coding_mode = CODING_MODE_RICE2;
else
sub->rc.coding_mode = CODING_MODE_RICE;
}
frame->verbatim_only = 0;
}
/**
* Copy channel-interleaved input samples into separate subframes.
*/
static void copy_samples(FlacEncodeContext *s, const void *samples)
{
int i, j, ch;
FlacFrame *frame;
int shift = av_get_bytes_per_sample(s->avctx->sample_fmt) * 8 -
s->avctx->bits_per_raw_sample;
#define COPY_SAMPLES(bits) do { \
const int ## bits ## _t *samples0 = samples; \
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] = samples0[j] >> shift; \
} while (0)
if (s->avctx->sample_fmt == AV_SAMPLE_FMT_S16)
COPY_SAMPLES(16);
else
COPY_SAMPLES(32);
}
static uint64_t rice_count_exact(const int32_t *res, int n, int k)
{
int i;
uint64_t count = 0;
for (i = 0; i < n; i++) {
unsigned v = ((unsigned)(res[i]) << 1) ^ (res[i] >> 31);
count += (v >> k) + 1 + k;
}
return count;
}
static uint64_t subframe_count_exact(FlacEncodeContext *s, FlacSubframe *sub,
int pred_order)
{
int p, porder, psize;
int i, part_end;
uint64_t count = 0;
/* subframe header */
count += 8;
if (sub->wasted)
count += sub->wasted;
/* subframe */
if (sub->type == FLAC_SUBFRAME_CONSTANT) {
count += sub->obits;
} else if (sub->type == FLAC_SUBFRAME_VERBATIM) {
count += s->frame.blocksize * sub->obits;
} else {
/* warm-up samples */
count += pred_order * sub->obits;
/* LPC coefficients */
if (sub->type == FLAC_SUBFRAME_LPC)
count += 4 + 5 + pred_order * s->options.lpc_coeff_precision;
/* rice-encoded block */
count += 2;
/* partition order */
porder = sub->rc.porder;
psize = s->frame.blocksize >> porder;
count += 4;
/* residual */
i = pred_order;
part_end = psize;
for (p = 0; p < 1 << porder; p++) {
int k = sub->rc.params[p];
count += sub->rc.coding_mode;
count += rice_count_exact(&sub->residual[i], part_end - i, k);
i = part_end;
part_end = FFMIN(s->frame.blocksize, part_end + psize);
}
}
return count;
}
#define rice_encode_count(sum, n, k) (((n)*((k)+1))+((sum-(n>>1))>>(k)))
/**
* Solve for d/dk(rice_encode_count) = n-((sum-(n>>1))>>(k+1)) = 0.
*/
static int find_optimal_param(uint64_t sum, int n, int max_param)
{
int k;
uint64_t sum2;
if (sum <= n >> 1)
return 0;
sum2 = sum - (n >> 1);
k = av_log2(av_clipl_int32(sum2 / n));
return FFMIN(k, max_param);
}
static int find_optimal_param_exact(uint64_t sums[32][MAX_PARTITIONS], int i, int max_param)
{
int bestk = 0;
int64_t bestbits = INT64_MAX;
int k;
for (k = 0; k <= max_param; k++) {
int64_t bits = sums[k][i];
if (bits < bestbits) {
bestbits = bits;
bestk = k;
}
}
return bestk;
}
static uint64_t calc_optimal_rice_params(RiceContext *rc, int porder,
uint64_t sums[32][MAX_PARTITIONS],
int n, int pred_order, int max_param, int exact)
{
int i;
int k, cnt, part;
uint64_t all_bits;
part = (1 << porder);
all_bits = 4 * part;
cnt = (n >> porder) - pred_order;
for (i = 0; i < part; i++) {
if (exact) {
k = find_optimal_param_exact(sums, i, max_param);
all_bits += sums[k][i];
} else {
k = find_optimal_param(sums[0][i], cnt, max_param);
all_bits += rice_encode_count(sums[0][i], cnt, k);
}
rc->params[i] = k;
cnt = n >> porder;
}
rc->porder = porder;
return all_bits;
}
static void calc_sum_top(int pmax, int kmax, const uint32_t *data, int n, int pred_order,
uint64_t sums[32][MAX_PARTITIONS])
{
int i, k;
int parts;
const uint32_t *res, *res_end;
/* sums for highest level */
parts = (1 << pmax);
for (k = 0; k <= kmax; k++) {
res = &data[pred_order];
res_end = &data[n >> pmax];
for (i = 0; i < parts; i++) {
if (kmax) {
uint64_t sum = (1LL + k) * (res_end - res);
while (res < res_end)
sum += *(res++) >> k;
sums[k][i] = sum;
} else {
uint64_t sum = 0;
while (res < res_end)
sum += *(res++);
sums[k][i] = sum;
}
res_end += n >> pmax;
}
}
}
static void calc_sum_next(int level, uint64_t sums[32][MAX_PARTITIONS], int kmax)
{
int i, k;
int parts = (1 << level);
for (i = 0; i < parts; i++) {
for (k=0; k<=kmax; k++)
sums[k][i] = sums[k][2*i] + sums[k][2*i+1];
}
}
static uint64_t calc_rice_params(RiceContext *rc,
uint32_t udata[FLAC_MAX_BLOCKSIZE],
uint64_t sums[32][MAX_PARTITIONS],
int pmin, int pmax,
const int32_t *data, int n, int pred_order, int exact)
{
int i;
uint64_t bits[MAX_PARTITION_ORDER+1];
int opt_porder;
RiceContext tmp_rc;
int kmax = (1 << rc->coding_mode) - 2;
av_assert1(pmin >= 0 && pmin <= MAX_PARTITION_ORDER);
av_assert1(pmax >= 0 && pmax <= MAX_PARTITION_ORDER);
av_assert1(pmin <= pmax);
tmp_rc.coding_mode = rc->coding_mode;
for (i = pred_order; i < n; i++)
udata[i] = ((unsigned)(data[i]) << 1) ^ (data[i] >> 31);
calc_sum_top(pmax, exact ? kmax : 0, udata, n, pred_order, sums);
opt_porder = pmin;
bits[pmin] = UINT32_MAX;
for (i = pmax; ; ) {
bits[i] = calc_optimal_rice_params(&tmp_rc, i, sums, n, pred_order, kmax, exact);
if (bits[i] < bits[opt_porder] || pmax == pmin) {
opt_porder = i;
*rc = tmp_rc;
}
if (i == pmin)
break;
calc_sum_next(--i, sums, exact ? kmax : 0);
}
return bits[opt_porder];
}
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;
}
static uint64_t find_subframe_rice_params(FlacEncodeContext *s,
FlacSubframe *sub, int pred_order)
{
int pmin = get_max_p_order(s->options.min_partition_order,
s->frame.blocksize, pred_order);
int pmax = get_max_p_order(s->options.max_partition_order,
s->frame.blocksize, pred_order);
uint64_t bits = 8 + pred_order * sub->obits + 2 + sub->rc.coding_mode;
if (sub->type == FLAC_SUBFRAME_LPC)
bits += 4 + 5 + pred_order * s->options.lpc_coeff_precision;
bits += calc_rice_params(&sub->rc, sub->rc_udata, sub->rc_sums, pmin, pmax, sub->residual,
s->frame.blocksize, pred_order, s->options.exact_rice_parameters);
return bits;
}
static void encode_residual_fixed(int32_t *res, const int32_t *smp, int n,
int order)
{
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) {
int a = smp[order-1] - smp[order-2];
for (i = order; i < n; i += 2) {
int b = smp[i ] - smp[i-1];
res[i] = b - a;
a = smp[i+1] - smp[i ];
res[i+1] = a - b;
}
} else if (order == 3) {
int a = smp[order-1] - smp[order-2];
int c = smp[order-1] - 2*smp[order-2] + smp[order-3];
for (i = order; i < n; i += 2) {
int b = smp[i ] - smp[i-1];
int d = b - a;
res[i] = d - c;
a = smp[i+1] - smp[i ];
c = a - b;
res[i+1] = c - d;
}
} else {
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];
for (i = order; i < n; i += 2) {
int b = smp[i ] - smp[i-1];
int d = b - a;
int f = d - c;
res[i ] = f - e;
a = smp[i+1] - smp[i ];
c = a - b;
e = c - d;
res[i+1] = e - f;
}
}
}
/* These four functions check for every residual whether it can be
* contained in <INT32_MIN,INT32_MAX]. In case it doesn't, the
* function that called this function has to try something else.
* Each function is duplicated, once for int32_t input, once for
* int64_t input */
#define ENCODE_RESIDUAL_FIXED_WITH_RESIDUAL_LIMIT() \
{ \
for (int i = 0; i < order; i++) \
res[i] = smp[i]; \
if (order == 0) { \
for (int i = order; i < n; i++) { \
if (smp[i] == INT32_MIN) \
return 1; \
res[i] = smp[i]; \
} \
} else if (order == 1) { \
for (int i = order; i < n; i++) { \
int64_t res64 = (int64_t)smp[i] - smp[i-1]; \
if (res64 <= INT32_MIN || res64 > INT32_MAX) \
return 1; \
res[i] = res64; \
} \
} else if (order == 2) { \
for (int i = order; i < n; i++) { \
int64_t res64 = (int64_t)smp[i] - 2*(int64_t)smp[i-1] + smp[i-2]; \
if (res64 <= INT32_MIN || res64 > INT32_MAX) \
return 1; \
res[i] = res64; \
} \
} else if (order == 3) { \
for (int i = order; i < n; i++) { \
int64_t res64 = (int64_t)smp[i] - 3*(int64_t)smp[i-1] + 3*(int64_t)smp[i-2] - smp[i-3]; \
if (res64 <= INT32_MIN || res64 > INT32_MAX) \
return 1; \
res[i] = res64; \
} \
} else { \
for (int i = order; i < n; i++) { \
int64_t res64 = (int64_t)smp[i] - 4*(int64_t)smp[i-1] + 6*(int64_t)smp[i-2] - 4*(int64_t)smp[i-3] + smp[i-4]; \
if (res64 <= INT32_MIN || res64 > INT32_MAX) \
return 1; \
res[i] = res64; \
} \
} \
return 0; \
}
static int encode_residual_fixed_with_residual_limit(int32_t *res, const int32_t *smp,
int n, int order)
{
ENCODE_RESIDUAL_FIXED_WITH_RESIDUAL_LIMIT();
}
static int encode_residual_fixed_with_residual_limit_33bps(int32_t *res, const int64_t *smp,
int n, int order)
{
ENCODE_RESIDUAL_FIXED_WITH_RESIDUAL_LIMIT();
}
#define LPC_ENCODE_WITH_RESIDUAL_LIMIT() \
{ \
for (int i = 0; i < order; i++) \
res[i] = smp[i]; \
for (int i = order; i < len; i++) { \
int64_t p = 0, tmp; \
for (int j = 0; j < order; j++) \
p += (int64_t)coefs[j]*smp[(i-1)-j]; \
p >>= shift; \
tmp = smp[i] - p; \
if (tmp <= INT32_MIN || tmp > INT32_MAX) \
return 1; \
res[i] = tmp; \
} \
return 0; \
}
static int lpc_encode_with_residual_limit(int32_t *res, const int32_t *smp, int len,
int order, int32_t *coefs, int shift)
{
LPC_ENCODE_WITH_RESIDUAL_LIMIT();
}
static int lpc_encode_with_residual_limit_33bps(int32_t *res, const int64_t *smp, int len,
int order, int32_t *coefs, int shift)
{
LPC_ENCODE_WITH_RESIDUAL_LIMIT();
}
static int lpc_encode_choose_datapath(FlacEncodeContext *s, int32_t bps,
int32_t *res, const int32_t *smp,
const int64_t *smp_33bps, int len,
int order, int32_t *coefs, int shift)
{
uint64_t max_residual_value = 0;
int64_t max_sample_value = ((int64_t)(1) << (bps-1));
/* This calculates the max size of any residual with the current
* predictor, so we know whether we need to check the residual */
for (int i = 0; i < order; i++)
max_residual_value += FFABS(max_sample_value * coefs[i]);
max_residual_value >>= shift;
max_residual_value += max_sample_value;
if (bps > 32) {
if (lpc_encode_with_residual_limit_33bps(res, smp_33bps, len, order, coefs, shift))
return 1;
} else if (max_residual_value > INT32_MAX) {
if (lpc_encode_with_residual_limit(res, smp, len, order, coefs, shift))
return 1;
} else if (bps + s->options.lpc_coeff_precision + av_log2(order) <= 32) {
s->flac_dsp.lpc16_encode(res, smp, len, order, coefs, shift);
} else {
s->flac_dsp.lpc32_encode(res, smp, len, order, coefs, shift);
}
return 0;
}
#define DEFAULT_TO_VERBATIM() \
{ \
sub->type = sub->type_code = FLAC_SUBFRAME_VERBATIM; \
if (sub->obits <= 32) \
memcpy(res, smp, n * sizeof(int32_t)); \
return subframe_count_exact(s, sub, 0); \
}
static int encode_residual_ch(FlacEncodeContext *s, int ch)
{
int i, n;
int min_order, max_order, opt_order, omethod;
FlacFrame *frame;
FlacSubframe *sub;
int32_t coefs[MAX_LPC_ORDER][MAX_LPC_ORDER];
int shift[MAX_LPC_ORDER];
int32_t *res, *smp;
int64_t *smp_33bps;
frame = &s->frame;
sub = &frame->subframes[ch];
res = sub->residual;
smp = sub->samples;
smp_33bps = frame->samples_33bps;
n = frame->blocksize;
/* CONSTANT */
if (sub->obits > 32) {
for (i = 1; i < n; i++)
if(smp_33bps[i] != smp_33bps[0])
break;
if (i == n) {
sub->type = sub->type_code = FLAC_SUBFRAME_CONSTANT;
return subframe_count_exact(s, sub, 0);
}
} else {
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 subframe_count_exact(s, sub, 0);
}
}
/* VERBATIM */
if (frame->verbatim_only || n < 5) {
DEFAULT_TO_VERBATIM();
}
min_order = s->options.min_prediction_order;
max_order = s->options.max_prediction_order;
omethod = s->options.prediction_order_method;