History

flacenc: use uint64_t for bit counts

Needed to avoid integer overflows for 24-bit encoding.

Justin Ruggles committed 14 years ago

Commit 5ff998a1 parent e7833161 file · +33 −25Browse files

Unified · Split

libavcodec/flacenc.c+33−25
@@ -442,10 +442,10 @@ static void copy_samples(FlacEncodeContext *s, const int16_t *samples) · 441 unmodified lines
442442 }
443443
444444
445−static int rice_count_exact(int32_t *res, int n, int k)
445+static uint64_t rice_count_exact(int32_t *res, int n, int k)
446446 {
447447 int i;
448− int count = 0;
448+ uint64_t count = 0;
449449
450450 for (i = 0; i < n; i++) {
451451 int32_t v = -2 * res[i] - 1;
@@ -456,12 +456,12 @@ static int rice_count_exact(int32_t *res, int n, int k) · 4 unmodified lines
456456 }
457457
458458
459−static int subframe_count_exact(FlacEncodeContext *s, FlacSubframe *sub,
460− int pred_order)
459+static uint64_t subframe_count_exact(FlacEncodeContext *s, FlacSubframe *sub,
460+ int pred_order)
461461 {
462462 int p, porder, psize;
463463 int i, part_end;
464− int count = 0;
464+ uint64_t count = 0;
465465
466466 /* subframe header */
467467 count += 8;
@@ -508,25 +508,25 @@ static int subframe_count_exact(FlacEncodeContext *s, FlacSubframe *sub, · 40 unmodified lines
508508 /**
509509 * Solve for d/dk(rice_encode_count) = n-((sum-(n>>1))>>(k+1)) = 0.
510510 */
511−static int find_optimal_param(uint32_t sum, int n)
511+static int find_optimal_param(uint64_t sum, int n)
512512 {
513513 int k;
514− uint32_t sum2;
514+ uint64_t sum2;
515515
516516 if (sum <= n >> 1)
517517 return 0;
518518 sum2 = sum - (n >> 1);
519− k = av_log2(n < 256 ? FASTDIV(sum2, n) : sum2 / n);
519+ k = av_log2(av_clipl_int32(sum2 / n));
520520 return FFMIN(k, MAX_RICE_PARAM);
521521 }
522522
523523
524−static uint32_t calc_optimal_rice_params(RiceContext *rc, int porder,
525− uint32_t *sums, int n, int pred_order)
524+static uint64_t calc_optimal_rice_params(RiceContext *rc, int porder,
525+ uint64_t *sums, int n, int pred_order)
526526 {
527527 int i;
528528 int k, cnt, part;
529− uint32_t all_bits;
529+ uint64_t all_bits;
530530
531531 part = (1 << porder);
532532 all_bits = 4 * part;
@@ -546,7 +546,7 @@ static uint32_t calc_optimal_rice_params(RiceContext *rc, int porder, · 13 unmodified lines
546546
547547
548548 static void calc_sums(int pmin, int pmax, uint32_t *data, int n, int pred_order,
549− uint32_t sums[][MAX_PARTITIONS])
549+ uint64_t sums[][MAX_PARTITIONS])
550550 {
551551 int i, j;
552552 int parts;
@@ -557,7 +557,7 @@ static void calc_sums(int pmin, int pmax, uint32_t *data, int n, int pred_order, · 4 unmodified lines
557557 res = &data[pred_order];
558558 res_end = &data[n >> pmax];
559559 for (i = 0; i < parts; i++) {
560− uint32_t sum = 0;
560+ uint64_t sum = 0;
561561 while (res < res_end)
562562 sum += *(res++);
563563 sums[pmax][i] = sum;
@@ -572,15 +572,15 @@ static void calc_sums(int pmin, int pmax, uint32_t *data, int n, int pred_order, · 8 unmodified lines
572572 }
573573
574574
575−static uint32_t calc_rice_params(RiceContext *rc, int pmin, int pmax,
575+static uint64_t calc_rice_params(RiceContext *rc, int pmin, int pmax,
576576 int32_t *data, int n, int pred_order)
577577 {
578578 int i;
579− uint32_t bits[MAX_PARTITION_ORDER+1];
579+ uint64_t bits[MAX_PARTITION_ORDER+1];
580580 int opt_porder;
581581 RiceContext tmp_rc;
582582 uint32_t *udata;
583− uint32_t sums[MAX_PARTITION_ORDER+1][MAX_PARTITIONS];
583+ uint64_t sums[MAX_PARTITION_ORDER+1][MAX_PARTITIONS];
584584
585585 assert(pmin >= 0 && pmin <= MAX_PARTITION_ORDER);
586586 assert(pmax >= 0 && pmax <= MAX_PARTITION_ORDER);
@@ -616,7 +616,7 @@ static int get_max_p_order(int max_porder, int n, int order) · 29 unmodified lines
616616 }
617617
618618
619−static uint32_t find_subframe_rice_params(FlacEncodeContext *s,
619+static uint64_t find_subframe_rice_params(FlacEncodeContext *s,
620620 FlacSubframe *sub, int pred_order)
621621 {
622622 int pmin = get_max_p_order(s->options.min_partition_order,
@@ -624,7 +624,7 @@ static uint32_t find_subframe_rice_params(FlacEncodeContext *s, · 1 unmodified line
624624 int pmax = get_max_p_order(s->options.max_partition_order,
625625 s->frame.blocksize, pred_order);
626626
627− uint32_t bits = 8 + pred_order * sub->obits + 2 + 4;
627+ uint64_t bits = 8 + pred_order * sub->obits + 2 + 4;
628628 if (sub->type == FLAC_SUBFRAME_LPC)
629629 bits += 4 + 5 + pred_order * s->options.lpc_coeff_precision;
630630 bits += calc_rice_params(&sub->rc, pmin, pmax, sub->residual,
@@ -829,7 +829,7 @@ static int encode_residual_ch(FlacEncodeContext *s, int ch) · 198 unmodified lines
829829 sub->type = FLAC_SUBFRAME_FIXED;
830830 if (s->options.lpc_type == FF_LPC_TYPE_NONE ||
831831 s->options.lpc_type == FF_LPC_TYPE_FIXED || n <= max_order) {
832− uint32_t bits[MAX_FIXED_ORDER+1];
832+ uint64_t bits[MAX_FIXED_ORDER+1];
833833 if (max_order > MAX_FIXED_ORDER)
834834 max_order = MAX_FIXED_ORDER;
835835 opt_order = 0;
@@ -860,7 +860,7 @@ static int encode_residual_ch(FlacEncodeContext *s, int ch) · 24 unmodified lines
860860 omethod == ORDER_METHOD_4LEVEL ||
861861 omethod == ORDER_METHOD_8LEVEL) {
862862 int levels = 1 << omethod;
863− uint32_t bits[1 << ORDER_METHOD_8LEVEL];
863+ uint64_t bits[1 << ORDER_METHOD_8LEVEL];
864864 int order;
865865 int opt_index = levels-1;
866866 opt_order = max_order-1;
@@ -879,7 +879,7 @@ static int encode_residual_ch(FlacEncodeContext *s, int ch) · 12 unmodified lines
879879 opt_order++;
880880 } else if (omethod == ORDER_METHOD_SEARCH) {
881881 // brute-force optimal order search
882− uint32_t bits[MAX_LPC_ORDER];
882+ uint64_t bits[MAX_LPC_ORDER];
883883 opt_order = 0;
884884 bits[0] = UINT32_MAX;
885885 for (i = min_order-1; i < max_order; i++) {
@@ -890,7 +890,7 @@ static int encode_residual_ch(FlacEncodeContext *s, int ch) · 4 unmodified lines
890890 }
891891 opt_order++;
892892 } else if (omethod == ORDER_METHOD_LOG) {
893− uint32_t bits[MAX_LPC_ORDER];
893+ uint64_t bits[MAX_LPC_ORDER];
894894 int step;
895895
896896 opt_order = min_order - 1 + (max_order-min_order)/3;
@@ -962,7 +962,8 @@ static int count_frame_header(FlacEncodeContext *s) · 65 unmodified lines
962962
963963 static int encode_frame(FlacEncodeContext *s)
964964 {
965− int ch, count;
965+ int ch;
966+ uint64_t count;
966967
967968 count = count_frame_header(s);
968969
@@ -972,7 +973,10 @@ static int encode_frame(FlacEncodeContext *s) · 3 unmodified lines
972973 count += (8 - (count & 7)) & 7; // byte alignment
973974 count += 16; // CRC-16
974975
975− return count >> 3;
976+ count >>= 3;
977+ if (count > INT_MAX)
978+ return AVERROR_BUG;
979+ return count;
976980 }
977981
978982
@@ -1274,9 +1278,13 @@ static int flac_encode_frame(AVCodecContext *avctx, AVPacket *avpkt, · 295 unmodified lines
12741278
12751279 /* fallback to verbatim mode if the compressed frame is larger than it
12761280 would be if encoded uncompressed. */
1277− if (frame_bytes > s->max_framesize) {
1281+ if (frame_bytes < 0 || frame_bytes > s->max_framesize) {
12781282 s->frame.verbatim_only = 1;
12791283 frame_bytes = encode_frame(s);
1284+ if (frame_bytes < 0) {
1285+ av_log(avctx, AV_LOG_ERROR, "Bad frame count\n");
1286+ return frame_bytes;
1287+ }
12801288 }
12811289
12821290 if ((ret = ff_alloc_packet(avpkt, frame_bytes))) {

Keyboard shortcuts

General

Show keyboard shortcuts
?
Focus the current search
/

Issues and pull requests

Open filters
f

Issues, pull requests and Inbox

Select next item
j↓
Select previous item
k↑
Open selected item
Enter
Dismiss filters or clear selection
Esc

Repository code

Go to file
t