1 /*
2 * Bink video decoder
3 * Copyright (c) 2009 Konstantin Shishkov
4 * Copyright (C) 2011 Peter Ross <pross@xvid.org>
5 *
6 * This file is part of FFmpeg.
7 *
8 * FFmpeg is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
12 *
13 * FFmpeg is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
17 *
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with FFmpeg; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 */
22
33
34 #define BITSTREAM_READER_LE
36
37 #define BINK_FLAG_ALPHA 0x00100000
38 #define BINK_FLAG_GRAY 0x00020000
39
41
42 /**
43 * IDs for different data types used in old version of Bink video codec
44 */
56
58 };
59
61 4, 8, 8, 5, 5, 11, 11, 4, 4, 7
62 };
63
65 0, 0, 0, 1, 1, 0, 1, 0, 0, 0
66 };
67
70
71 /**
72 * IDs for different data types used in Bink video codec
73 */
84
86 };
87
88 /**
89 * data needed to decode 4-bit Huffman-coded value
90 */
92 int vlc_num;
///< tree number (in bink_trees[])
95
96 #define GET_HUFF(gb, tree) (tree).syms[get_vlc2(gb, bink_trees[(tree).vlc_num].table,\
97 bink_trees[(tree).vlc_num].bits, 1)]
98
99 /**
100 * data structure used for decoding single Bink data type
101 */
103 int len;
///< length of number of entries to decode (in bits)
110
111 /*
112 * Decoder context
113 */
124
126 Tree col_high[16];
///< trees for decoding high nibble in "colours" data type
127 int col_lastval;
///< value of last decoded high nibble in "colours" data type
129
130 /**
131 * Bink video block types
132 */
136 MOTION_BLOCK,
///< block is copied from previous frame with some offset
137 RUN_BLOCK,
///< block is composed from runs of colours with custom scan order
142 PATTERN_BLOCK,
///< block is filled with two colours following custom pattern
144 };
145
146 /**
147 * Initialize length in all bundles.
148 *
149 * @param c decoder context
150 * @param width plane width
151 * @param bw plane width in 8x8 blocks
152 */
154 {
156
158
160
162
167
169
171 }
172
173 /**
174 * Allocate memory for bundles.
175 *
176 * @param c decoder context
177 */
179 {
180 int bw, bh, blocks;
181 int i;
182
185 blocks = bw * bh;
186
192 }
193
194 return 0;
195 }
196
197 /**
198 * Free memory used by bundles.
199 *
200 * @param c decoder context
201 */
203 {
204 int i;
207 }
208
209 /**
210 * Merge two consequent lists of equal size depending on bits read.
211 *
212 * @param gb context for reading bits
213 * @param dst buffer where merged list will be written to
214 * @param src pointer to the head of the first list (the second lists starts at src+size)
215 * @param size input lists size
216 */
218 {
221
222 do {
224 *dst++ = *src++;
225 size--;
226 } else {
227 *dst++ = *src2++;
228 size2--;
229 }
230 } while (size && size2);
231
232 while (size--)
233 *dst++ = *src++;
234 while (size2--)
235 *dst++ = *src2++;
236 }
237
238 /**
239 * Read information about Huffman tree used to decode data.
240 *
241 * @param gb context for reading bits
242 * @param tree pointer for storing tree data
243 */
245 {
246 uint8_t tmp1[16] = { 0 }, tmp2[16], *
in = tmp1, *
out = tmp2;
248
251 for (i = 0; i < 16; i++)
253 return;
254 }
257 for (i = 0; i <=
len; i++) {
259 tmp1[tree->
syms[i]] = 1;
260 }
261 for (i = 0; i < 16 && len < 16 - 1; i++)
262 if (!tmp1[i])
264 } else {
266 for (i = 0; i < 16; i++)
267 in[i] = i;
268 for (i = 0; i <=
len; i++) {
270 for (t = 0; t < 16; t += size << 1)
271 merge(gb, out + t, in + t, size);
273 }
274 memcpy(tree->
syms, in, 16);
275 }
276 }
277
278 /**
279 * Prepare bundle for decoding data.
280 *
281 * @param gb context for reading bits
282 * @param c decoder context
283 * @param bundle_num number of the bundle to initialize
284 */
286 {
287 int i;
288
290 for (i = 0; i < 16; i++)
293 }
298 }
299
300 /**
301 * common check before starting decoding bundle data
302 *
303 * @param gb context for reading bits
304 * @param b bundle
305 * @param t variable where number of elements to decode will be stored
306 */
307 #define CHECK_READ_VAL(gb, b, t) \
308 if (!b->cur_dec || (b->cur_dec > b->cur_ptr)) \
309 return 0; \
310 t = get_bits(gb, b->len); \
311 if (!t) { \
312 b->cur_dec = NULL; \
313 return 0; \
314 } \
315
317 {
318 int t, v;
320
326 }
331 } else {
334 }
335 return 0;
336 }
337
339 {
340 int t, sign, v;
342
348 }
351 if (v) {
353 v = (v ^ sign) - sign;
354 }
357 } else {
360 if (v) {
362 v = (v ^ sign) - sign;
363 }
365 }
366 }
367 return 0;
368 }
369
371
373 {
374 int t, v;
375 int last = 0;
377
383 }
388 } else {
391 if (v < 12) {
392 last = v;
394 } else {
396
397 if (dec_end - b->
cur_dec < run)
401 }
402 }
403 }
404 return 0;
405 }
406
408 {
409 int t, v;
411
417 }
422 }
423
424 return 0;
425 }
426
428 {
429 int t, sign, v;
431
437 }
443 sign = ((int8_t) v) >> 7;
444 v = ((v & 0x7F) ^ sign) - sign;
445 v += 0x80;
446 }
449 } else {
455 sign = ((int8_t) v) >> 7;
456 v = ((v & 0x7F) ^ sign) - sign;
457 v += 0x80;
458 }
460 }
461 }
462 return 0;
463 }
464
465 /** number of bits used to store first DC value in bundle */
466 #define DC_START_BITS 11
467
469 int start_bits, int has_sign)
470 {
471 int i, j,
len, len2, bsize, sign, v, v2;
472 int16_t *dst = (int16_t*)b->
cur_dec;
473 int16_t *dst_end = (int16_t*)b->
data_end;
474
476 v =
get_bits(gb, start_bits - has_sign);
477 if (v && has_sign) {
479 v = (v ^ sign) - sign;
480 }
481 if (dst_end - dst < 1)
483 *dst++ = v;
484 len--;
485 for (i = 0; i <
len; i += 8) {
486 len2 =
FFMIN(len - i, 8);
487 if (dst_end - dst < len2)
490 if (bsize) {
491 for (j = 0; j < len2; j++) {
493 if (v2) {
495 v2 = (v2 ^ sign) - sign;
496 }
497 v += v2;
498 *dst++ = v;
499 if (v < -32768 || v > 32767) {
502 }
503 }
504 } else {
505 for (j = 0; j < len2; j++)
506 *dst++ = v;
507 }
508 }
509
511 return 0;
512 }
513
514 /**
515 * Retrieve next value from bundle.
516 *
517 * @param c decoder context
518 * @param bundle bundle number
519 */
521 {
522 int ret;
523
530 return ret;
531 }
532
534 {
538 }
539
541 {
542 int i;
545 }
546
548 {
550 const int mask = 1 << (bits - 1);
554
558 if (bits <= 8) {
559 if (!issigned) {
560 for (i = 0; i <
len; i++)
562 } else {
563 for (i = 0; i <
len; i++)
565 }
566 } else {
567 int16_t *dst = (int16_t*)b->
cur_dec;
568
570 for (i = 0; i <
len; i++)
572 } else {
573 for (i = 0; i <
len; i++)
575 }
577 }
578 return 0;
579 }
580
582 {
583 int16_t ret;
585
586 if (bits <= 8) {
589 }
592 return ret;
593 }
594
595 /**
596 * Read 8x8 block of DCT coefficients.
597 *
598 * @param gb context for reading bits
599 * @param block place for storing coefficients
600 * @param scan scan order table
601 * @param quant_matrices quantization matrices
602 * @return 0 for success, negative value in other cases
603 */
605 const int32_t quant_matrices[16][64],
int q)
606 {
607 int coef_list[128];
608 int mode_list[128];
610 int list_start = 64, list_end = 64, list_pos;
611 int coef_count = 0;
612 int coef_idx[64];
613 int quant_idx;
615
616 coef_list[list_end] = 4; mode_list[list_end++] = 0;
617 coef_list[list_end] = 24; mode_list[list_end++] = 0;
618 coef_list[list_end] = 44; mode_list[list_end++] = 0;
619 coef_list[list_end] = 1; mode_list[list_end++] = 3;
620 coef_list[list_end] = 2; mode_list[list_end++] = 3;
621 coef_list[list_end] = 3; mode_list[list_end++] = 3;
622
623 for (bits =
get_bits(gb, 4) - 1; bits >= 0; bits--) {
624 list_pos = list_start;
625 while (list_pos < list_end) {
626 if (!(mode_list[list_pos] | coef_list[list_pos]) || !
get_bits1(gb)) {
627 list_pos++;
628 continue;
629 }
630 ccoef = coef_list[list_pos];
631 mode = mode_list[list_pos];
632 switch (mode) {
633 case 0:
634 coef_list[list_pos] = ccoef + 4;
635 mode_list[list_pos] = 1;
636 case 2:
637 if (mode == 2) {
638 coef_list[list_pos] = 0;
639 mode_list[list_pos++] = 0;
640 }
641 for (i = 0; i < 4; i++, ccoef++) {
643 coef_list[--list_start] = ccoef;
644 mode_list[ list_start] = 3;
645 } else {
646 if (!bits) {
648 } else {
651 t = (t ^ sign) - sign;
652 }
653 block[scan[ccoef]] = t;
654 coef_idx[coef_count++] = ccoef;
655 }
656 }
657 break;
658 case 1:
659 mode_list[list_pos] = 2;
660 for (i = 0; i < 3; i++) {
661 ccoef += 4;
662 coef_list[list_end] = ccoef;
663 mode_list[list_end++] = 2;
664 }
665 break;
666 case 3:
667 if (!bits) {
669 } else {
672 t = (t ^ sign) - sign;
673 }
674 block[scan[ccoef]] = t;
675 coef_idx[coef_count++] = ccoef;
676 coef_list[list_pos] = 0;
677 mode_list[list_pos++] = 0;
678 break;
679 }
680 }
681 }
682
683 if (q == -1) {
685 } else {
686 quant_idx = q;
687 if (quant_idx > 15
U) {
690 }
691 }
692
693 quant = quant_matrices[quant_idx];
694
695 block[0] = (block[0] * quant[0]) >> 11;
696 for (i = 0; i < coef_count; i++) {
697 int idx = coef_idx[i];
698 block[scan[idx]] = (block[scan[idx]] * quant[idx]) >> 11;
699 }
700
701 return 0;
702 }
703
704 /**
705 * Read 8x8 block with residue after motion compensation.
706 *
707 * @param gb context for reading bits
708 * @param block place to store read data
709 * @param masks_count number of masks to decode
710 * @return 0 on success, negative value in other cases
711 */
713 {
714 int coef_list[128];
715 int mode_list[128];
717 int list_start = 64, list_end = 64, list_pos;
718 int nz_coeff[64];
719 int nz_coeff_count = 0;
720
721 coef_list[list_end] = 4; mode_list[list_end++] = 0;
722 coef_list[list_end] = 24; mode_list[list_end++] = 0;
723 coef_list[list_end] = 44; mode_list[list_end++] = 0;
724 coef_list[list_end] = 0; mode_list[list_end++] = 2;
725
727 for (i = 0; i < nz_coeff_count; i++) {
729 continue;
730 if (block[nz_coeff[i]] < 0)
731 block[nz_coeff[i]] -=
mask;
732 else
733 block[nz_coeff[i]] +=
mask;
734 masks_count--;
735 if (masks_count < 0)
736 return 0;
737 }
738 list_pos = list_start;
739 while (list_pos < list_end) {
740 if (!(coef_list[list_pos] | mode_list[list_pos]) || !
get_bits1(gb)) {
741 list_pos++;
742 continue;
743 }
744 ccoef = coef_list[list_pos];
745 mode = mode_list[list_pos];
746 switch (mode) {
747 case 0:
748 coef_list[list_pos] = ccoef + 4;
749 mode_list[list_pos] = 1;
750 case 2:
751 if (mode == 2) {
752 coef_list[list_pos] = 0;
753 mode_list[list_pos++] = 0;
754 }
755 for (i = 0; i < 4; i++, ccoef++) {
757 coef_list[--list_start] = ccoef;
758 mode_list[ list_start] = 3;
759 } else {
760 nz_coeff[nz_coeff_count++] =
bink_scan[ccoef];
762 block[
bink_scan[ccoef]] = (mask ^ sign) - sign;
763 masks_count--;
764 if (masks_count < 0)
765 return 0;
766 }
767 }
768 break;
769 case 1:
770 mode_list[list_pos] = 2;
771 for (i = 0; i < 3; i++) {
772 ccoef += 4;
773 coef_list[list_end] = ccoef;
774 mode_list[list_end++] = 2;
775 }
776 break;
777 case 3:
778 nz_coeff[nz_coeff_count++] =
bink_scan[ccoef];
780 block[
bink_scan[ccoef]] = (mask ^ sign) - sign;
781 coef_list[list_pos] = 0;
782 mode_list[list_pos++] = 0;
783 masks_count--;
784 if (masks_count < 0)
785 return 0;
786 break;
787 }
788 }
789 }
790
791 return 0;
792 }
793
794 /**
795 * Copy 8x8 block from source to destination, where src and dst may be overlapped
796 */
798 {
800 int i;
801 for (i = 0; i < 8; i++)
802 memcpy(tmp + i*8, src + i*stride, 8);
803 for (i = 0; i < 8; i++)
804 memcpy(dst + i*stride, tmp + i*8, 8);
805 }
806
808 int plane_idx, int is_key, int is_chroma)
809 {
811 int i, j, bx, by;
812 uint8_t *dst, *ref, *ref_start, *ref_end;
813 int v, col[2];
815 int xoff, yoff;
818 int coordmap[64];
819 int ybias = is_key ? -15 : 0;
820 int qp;
821
825
827 ref_start = frame->
data[plane_idx];
828 ref_end = frame->
data[plane_idx] + (bh * frame->
linesize[plane_idx] + bw) * 8;
829
830 for (i = 0; i < 64; i++)
831 coordmap[i] = (i & 7) + (i >> 3) * stride;
832
833 for (by = 0; by < bh; by++) {
836 return ret;
837 }
838
840 for (bx = 0; bx < bw; bx++, dst += 8) {
842 switch (blk) {
843 case 0:
844 break;
845 case 1:
847 i = 0;
848 do {
850
853
855 if (i > 64) {
858 }
859 if (mode) {
861 for (j = 0; j <
run; j++)
862 dst[coordmap[*scan++]] = v;
863 } else {
864 for (j = 0; j <
run; j++)
866 }
867 } while (i < 63);
868 if (i == 63)
870 break;
871 case 2:
872 memset(dctblock, 0, sizeof(*dctblock) * 64);
877 break;
878 case 3:
881 ref = dst + xoff + yoff *
stride;
882 if (ref < ref_start || ref + 8*stride > ref_end) {
886 } else {
888 }
893 break;
894 case 4:
897 ref = dst + xoff + yoff *
stride;
898 if (ref < ref_start || ref + 8 * stride > ref_end) {
902 } else {
904 }
905 memset(dctblock, 0, sizeof(*dctblock) * 64);
910 break;
911 case 5:
914 break;
915 case 6:
916 for (i = 0; i < 2; i++)
918 for (i = 0; i < 8; i++) {
920 for (j = 0; j < 8; j++, v >>= 1)
921 dst[i*stride + j] = col[v & 1];
922 }
923 break;
924 case 7:
927 ref = dst + xoff + yoff *
stride;
928 if (ref < ref_start || ref + 8 * stride > ref_end) {
932 } else {
934 }
935 break;
936 case 8:
937 for (i = 0; i < 8; i++)
940 break;
941 default:
944 }
945 }
946 }
947 if (
get_bits_count(gb) & 0x1F)
//next plane data starts at 32-bit boundary
949
950 return 0;
951 }
952
957 {
961 if (ref < ref_start || ref > ref_end) {
963 xoff, yoff);
965 }
967
968 return 0;
969 }
970
972 int plane_idx, int is_chroma)
973 {
975 int i, j, bx, by;
976 uint8_t *dst, *prev, *ref_start, *ref_end;
977 int v, col[2];
982 int coordmap[64];
983
988
992
994 : frame->
data[plane_idx];
995 ref_end = ref_start
996 + (bw - 1 + c->
last->
linesize[plane_idx] * (bh - 1)) * 8;
997
998 for (i = 0; i < 64; i++)
999 coordmap[i] = (i & 7) + (i >> 3) * stride;
1000
1001 for (by = 0; by < bh; by++) {
1003 return ret;
1005 return ret;
1007 return ret;
1009 return ret;
1011 return ret;
1013 return ret;
1015 return ret;
1017 return ret;
1019 return ret;
1020
1021 if (by == bh)
1022 break;
1025 : frame->
data[plane_idx]) + 8*by*stride;
1026 for (bx = 0; bx < bw; bx++, dst += 8, prev += 8) {
1028 // 16x16 block type on odd line means part of the already decoded block, so skip it
1030 bx++;
1031 dst += 8;
1032 prev += 8;
1033 continue;
1034 }
1035 switch (blk) {
1038 break;
1041 switch (blk) {
1044 i = 0;
1045 do {
1047
1049 if (i > 64) {
1052 }
1055 for (j = 0; j <
run; j++)
1056 ublock[*scan++] = v;
1057 } else {
1058 for (j = 0; j <
run; j++)
1060 }
1061 } while (i < 63);
1062 if (i == 63)
1064 break;
1066 memset(dctblock, 0, sizeof(*dctblock) * 64);
1070 break;
1074 break;
1076 for (i = 0; i < 2; i++)
1078 for (j = 0; j < 8; j++) {
1080 for (i = 0; i < 8; i++, v >>= 1)
1081 ublock[i + j*8] = col[v & 1];
1082 }
1083 break;
1085 for (j = 0; j < 8; j++)
1086 for (i = 0; i < 8; i++)
1088 break;
1089 default:
1092 }
1095 bx++;
1096 dst += 8;
1097 prev += 8;
1098 break;
1101 ref_start, ref_end);
1102 if (ret < 0)
1103 return ret;
1104 break;
1107 i = 0;
1108 do {
1110
1112 if (i > 64) {
1115 }
1118 for (j = 0; j <
run; j++)
1119 dst[coordmap[*scan++]] = v;
1120 } else {
1121 for (j = 0; j <
run; j++)
1123 }
1124 } while (i < 63);
1125 if (i == 63)
1127 break;
1130 ref_start, ref_end);
1131 if (ret < 0)
1132 return ret;
1137 break;
1139 memset(dctblock, 0, sizeof(*dctblock) * 64);
1143 break;
1147 break;
1150 ref_start, ref_end);
1151 if (ret < 0)
1152 return ret;
1153 memset(dctblock, 0, sizeof(*dctblock) * 64);
1157 break;
1159 for (i = 0; i < 2; i++)
1161 for (i = 0; i < 8; i++) {
1163 for (j = 0; j < 8; j++, v >>= 1)
1164 dst[i*stride + j] = col[v & 1];
1165 }
1166 break;
1168 for (i = 0; i < 8; i++)
1171 break;
1172 default:
1175 }
1176 }
1177 }
1178 if (
get_bits_count(gb) & 0x1F)
//next plane data starts at 32-bit boundary
1180
1181 return 0;
1182 }
1183
1185 {
1189 int plane, plane_idx, ret;
1190 int bits_count = pkt->
size << 3;
1191
1194 return ret;
1195 } else {
1197 return ret;
1199 return ret;
1200 }
1201
1207 return ret;
1208 }
1211
1213
1214 for (plane = 0; plane < 3; plane++) {
1215 plane_idx = (!plane || !c->
swap_planes) ? plane : (plane ^ 3);
1216
1219 return ret;
1220 } else {
1223 return ret;
1224 }
1226 break;
1227 }
1228 emms_c();
1229
1233 return ret;
1234 }
1235
1236 *got_frame = 1;
1237
1238 /* always report that the buffer was completely consumed */
1240 }
1241
1242 /**
1243 * Caclulate quantization tables for version b
1244 */
1246 {
1248 static const int s[64]={
1249 1073741824,1489322693,1402911301,1262586814,1073741824, 843633538, 581104888, 296244703,
1250 1489322693,2065749918,1945893874,1751258219,1489322693,1170153332, 806015634, 410903207,
1251 1402911301,1945893874,1832991949,1649649171,1402911301,1102260336, 759250125, 387062357,
1252 1262586814,1751258219,1649649171,1484645031,1262586814, 992008094, 683307060, 348346918,
1253 1073741824,1489322693,1402911301,1262586814,1073741824, 843633538, 581104888, 296244703,
1254 843633538,1170153332,1102260336, 992008094, 843633538, 662838617, 456571181, 232757969,
1255 581104888, 806015634, 759250125, 683307060, 581104888, 456571181, 314491699, 160326478,
1256 296244703, 410903207, 387062357, 348346918, 296244703, 232757969, 160326478, 81733730,
1257 };
1258 int i, j;
1259 #define C (1LL<<30)
1260 for (i = 0; i < 64; i++)
1262
1263 for (j = 0; j < 16; j++) {
1264 for (i = 0; i < 64; i++) {
1265 int k = inv_bink_scan[i];
1270 }
1271 }
1272 }
1273
1275 {
1278 static int binkb_initialised = 0;
1279 int i, ret;
1281
1286 }
1290 if (!bink_trees[15].table) {
1291 for (i = 0; i < 16; i++) {
1293 bink_trees[i].
table = table + i*128;
1295 init_vlc(&bink_trees[i], maxbits, 16,
1298 }
1299 }
1301
1305
1307 return ret;
1308
1310
1314
1317 return ret;
1318 }
1319
1321 if (!binkb_initialised) {
1323 binkb_initialised = 1;
1324 }
1325 }
1326
1327 return 0;
1328 }
1329
1331 {
1333
1335
1337 return 0;
1338 }
1339
1341 {
1343
1345 }
1346
1348 .
name =
"binkvideo",
1358 };
const char const char void * val
#define AVERROR_INVALIDDATA
Invalid data found when processing input.
static const uint8_t bink_tree_lens[16][16]
8-bit values for 2-colour pattern fill
This structure describes decoded (raw) audio or video data.
ptrdiff_t const GLvoid * data
av_cold void ff_binkdsp_init(BinkDSPContext *c)
static const uint8_t bink_tree_bits[16][16]
void(* clear_block)(int16_t *block)
#define CHECK_READ_VAL(gb, b, t)
common check before starting decoding bundle data
static unsigned int get_bits(GetBitContext *s, int n)
Read 1-25 bits.
#define AV_LOG_WARNING
Something somehow does not look correct.
void(* scale_block)(const uint8_t src[64], uint8_t *dst, int linesize)
static void skip_bits_long(GetBitContext *s, int n)
static av_cold int init(AVCodecContext *avctx)
static const uint8_t binkb_den[16]
static int read_residue(GetBitContext *gb, int16_t block[64], int masks_count)
Read 8x8 block with residue after motion compensation.
enum AVPixelFormat pix_fmt
Pixel format, see AV_PIX_FMT_xxx.
8-bit values for 2-colour pattern fill
static const uint8_t bink_scan[64]
Bink DCT and residue 8x8 block scan order.
Tree col_high[16]
trees for decoding high nibble in "colours" data type
16x16 block types (a subset of 8x8 block types)
void(* add_pixels8)(uint8_t *pixels, int16_t *block, int line_size)
int len
length of number of entries to decode (in bits)
Macro definitions for various function/variable attributes.
static int32_t binkb_inter_quant[16][64]
quantizer values for interblocks with DCT
static av_cold void binkb_init_bundle(BinkContext *c, int bundle_num)
static int read_patterns(AVCodecContext *avctx, GetBitContext *gb, Bundle *b)
X components of motion value.
planar YUV 4:2:0, 20bpp, (1 Cr & Cb sample per 2x2 Y & A samples)
motion block with DCT applied to the difference
AVFrame * av_frame_alloc(void)
Allocate an AVFrame and set its fields to default values.
static int binkb_get_value(BinkContext *c, int bundle_num)
static void put_pixels8x8_overlapped(uint8_t *dst, uint8_t *src, int stride)
Copy 8x8 block from source to destination, where src and dst may be overlapped.
Tree tree
Huffman tree-related data.
BlockTypes
Bink video block types.
int av_frame_ref(AVFrame *dst, const AVFrame *src)
Set up a new reference to the data described by the source frame.
uint8_t * extradata
some codecs need / can use extradata like Huffman tables.
static const int32_t bink_inter_quant[16][64]
static int get_bits_count(const GetBitContext *s)
int vlc_num
tree number (in bink_trees[])
bitstream reader API header.
static int read_runs(AVCodecContext *avctx, GetBitContext *gb, Bundle *b)
data structure used for decoding single Bink data type
static const uint8_t bink_patterns[16][64]
uint8_t * data
buffer for decoded symbols
block is copied from previous frame with some offset
static int read_dct_coeffs(GetBitContext *gb, int32_t block[64], const uint8_t *scan, const int32_t quant_matrices[16][64], int q)
Read 8x8 block of DCT coefficients.
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
uint8_t * data_end
buffer end
static const uint16_t mask[17]
void av_frame_free(AVFrame **frame)
Free the frame and any dynamically allocated objects in it, e.g.
static const struct endianess table[]
#define NULL_IF_CONFIG_SMALL(x)
Return NULL if CONFIG_SMALL is true, otherwise the argument without modification. ...
static av_cold void free_bundles(BinkContext *c)
Free memory used by bundles.
int flags
AV_CODEC_FLAG_*.
const char * name
Name of the codec implementation.
int col_lastval
value of last decoded high nibble in "colours" data type
DC values for interblocks with DCT.
av_cold void ff_hpeldsp_init(HpelDSPContext *c, int flags)
block is composed from runs of colours with custom scan order
common internal API header
block is filled with single colour
static av_cold void binkb_calc_quant(void)
Caclulate quantization tables for version b.
int av_image_check_size(unsigned int w, unsigned int h, int log_offset, void *log_ctx)
Check if the given dimension of an image is valid, meaning that all bytes of the image can be address...
int ff_reget_buffer(AVCodecContext *avctx, AVFrame *frame)
Identical in function to av_frame_make_writable(), except it uses ff_get_buffer() to allocate the buf...
int width
picture width / height.
static int binkb_decode_plane(BinkContext *c, AVFrame *frame, GetBitContext *gb, int plane_idx, int is_key, int is_chroma)
Y components of motion value.
number of coefficients for residue blocks
static const uint8_t binkb_inter_seed[64]
#define INIT_VLC_USE_NEW_STATIC
static const uint8_t binkb_runbits[64]
static int bink_decode_plane(BinkContext *c, AVFrame *frame, GetBitContext *gb, int plane_idx, int is_chroma)
data needed to decode 4-bit Huffman-coded value
uint8_t * cur_dec
pointer to the not yet decoded part of the buffer
Libavcodec external API header.
quantizer values for intrablocks with DCT
av_cold void ff_blockdsp_init(BlockDSPContext *c, AVCodecContext *avctx)
int linesize[AV_NUM_DATA_POINTERS]
For video, size in bytes of each picture line.
#define DC_START_BITS
number of bits used to store first DC value in bundle
main external API structure.
int ff_get_buffer(AVCodecContext *avctx, AVFrame *frame, int flags)
Get a buffer for a frame.
unsigned int codec_tag
fourcc (LSB first, so "ABCD" -> ('D'<<24) + ('C'<<16) + ('B'<<8) + 'A').
uint8_t pi<< 24) CONV_FUNC_GROUP(AV_SAMPLE_FMT_FLT, float, AV_SAMPLE_FMT_U8, uint8_t,(*(constuint8_t *) pi-0x80)*(1.0f/(1<< 7))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_DBL, double, AV_SAMPLE_FMT_U8, uint8_t,(*(constuint8_t *) pi-0x80)*(1.0/(1<< 7))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_U8, uint8_t, AV_SAMPLE_FMT_S16, int16_t,(*(constint16_t *) pi >>8)+0x80) CONV_FUNC_GROUP(AV_SAMPLE_FMT_FLT, float, AV_SAMPLE_FMT_S16, int16_t,*(constint16_t *) pi *(1.0f/(1<< 15))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_DBL, double, AV_SAMPLE_FMT_S16, int16_t,*(constint16_t *) pi *(1.0/(1<< 15))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_U8, uint8_t, AV_SAMPLE_FMT_S32, int32_t,(*(constint32_t *) pi >>24)+0x80) CONV_FUNC_GROUP(AV_SAMPLE_FMT_FLT, float, AV_SAMPLE_FMT_S32, int32_t,*(constint32_t *) pi *(1.0f/(1U<< 31))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_DBL, double, AV_SAMPLE_FMT_S32, int32_t,*(constint32_t *) pi *(1.0/(1U<< 31))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_U8, uint8_t, AV_SAMPLE_FMT_FLT, float, av_clip_uint8(lrintf(*(constfloat *) pi *(1<< 7))+0x80)) CONV_FUNC_GROUP(AV_SAMPLE_FMT_S16, int16_t, AV_SAMPLE_FMT_FLT, float, av_clip_int16(lrintf(*(constfloat *) pi *(1<< 15)))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_S32, int32_t, AV_SAMPLE_FMT_FLT, float, av_clipl_int32(llrintf(*(constfloat *) pi *(1U<< 31)))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_U8, uint8_t, AV_SAMPLE_FMT_DBL, double, av_clip_uint8(lrint(*(constdouble *) pi *(1<< 7))+0x80)) CONV_FUNC_GROUP(AV_SAMPLE_FMT_S16, int16_t, AV_SAMPLE_FMT_DBL, double, av_clip_int16(lrint(*(constdouble *) pi *(1<< 15)))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_S32, int32_t, AV_SAMPLE_FMT_DBL, double, av_clipl_int32(llrint(*(constdouble *) pi *(1U<< 31))))#defineSET_CONV_FUNC_GROUP(ofmt, ifmt) staticvoidset_generic_function(AudioConvert *ac){}voidff_audio_convert_free(AudioConvert **ac){if(!*ac) return;ff_dither_free(&(*ac) ->dc);av_freep(ac);}AudioConvert *ff_audio_convert_alloc(AVAudioResampleContext *avr, enumAVSampleFormatout_fmt, enumAVSampleFormatin_fmt, intchannels, intsample_rate, intapply_map){AudioConvert *ac;intin_planar, out_planar;ac=av_mallocz(sizeof(*ac));if(!ac) returnNULL;ac->avr=avr;ac->out_fmt=out_fmt;ac->in_fmt=in_fmt;ac->channels=channels;ac->apply_map=apply_map;if(avr->dither_method!=AV_RESAMPLE_DITHER_NONE &&av_get_packed_sample_fmt(out_fmt)==AV_SAMPLE_FMT_S16 &&av_get_bytes_per_sample(in_fmt)>2){ac->dc=ff_dither_alloc(avr, out_fmt, in_fmt, channels, sample_rate, apply_map);if(!ac->dc){av_free(ac);returnNULL;}returnac;}in_planar=ff_sample_fmt_is_planar(in_fmt, channels);out_planar=ff_sample_fmt_is_planar(out_fmt, channels);if(in_planar==out_planar){ac->func_type=CONV_FUNC_TYPE_FLAT;ac->planes=in_planar?ac->channels:1;}elseif(in_planar) ac->func_type=CONV_FUNC_TYPE_INTERLEAVE;elseac->func_type=CONV_FUNC_TYPE_DEINTERLEAVE;set_generic_function(ac);if(ARCH_AARCH64) ff_audio_convert_init_aarch64(ac);if(ARCH_ARM) ff_audio_convert_init_arm(ac);if(ARCH_X86) ff_audio_convert_init_x86(ac);returnac;}intff_audio_convert(AudioConvert *ac, AudioData *out, AudioData *in){intuse_generic=1;intlen=in->nb_samples;intp;if(ac->dc){av_log(ac->avr, AV_LOG_TRACE,"%dsamples-audio_convert:%sto%s(dithered)\n", len, av_get_sample_fmt_name(ac->in_fmt), av_get_sample_fmt_name(ac->out_fmt));returnff_convert_dither(ac-> in
#define init_vlc(vlc, nb_bits, nb_codes,bits, bits_wrap, bits_size,codes, codes_wrap, codes_size,flags)
op_pixels_func put_pixels_tab[4][4]
Halfpel motion compensation with rounding (a+b+1)>>1.
static av_cold int decode_init(AVCodecContext *avctx)
static unsigned int get_bits1(GetBitContext *s)
static const int32_t bink_intra_quant[16][64]
DC values for interblocks with DCT.
Sources
IDs for different data types used in Bink video codec.
block is filled with two colours following custom pattern
static av_cold void binkb_init_bundles(BinkContext *c)
static int32_t binkb_intra_quant[16][64]
static int init_get_bits(GetBitContext *s, const uint8_t *buffer, int bit_size)
Initialize GetBitContext.
static const uint8_t binkb_num[16]
#define GET_HUFF(gb, tree)
run lengths for special fill block
Y components of motion value.
static VLC bink_trees[16]
static void merge(GetBitContext *gb, uint8_t *dst, uint8_t *src, int size)
Merge two consequent lists of equal size depending on bits read.
void av_frame_unref(AVFrame *frame)
Unreference all the buffers referenced by frame and reset the frame fields.
Bundle bundle[BINKB_NB_SRC]
bundles for decoding all data types
static void flush(AVCodecContext *avctx)
uint8_t * data[AV_NUM_DATA_POINTERS]
pointer to the picture/channel planes.
pixel values used for different block types
void(* idct_add)(uint8_t *dest, int line_size, int32_t *block)
X components of motion value.
static int decode(AVCodecContext *avctx, void *data, int *got_sub, AVPacket *avpkt)
uint8_t * cur_ptr
pointer to the data that is not read from buffer yet
GLint GLenum GLboolean GLsizei stride
static const uint8_t binkb_intra_seed[64]
planar YUV 4:2:0, 12bpp, (1 Cr & Cb sample per 2x2 Y samples)
static int binkb_read_bundle(BinkContext *c, GetBitContext *gb, int bundle_num)
common internal api header.
static void init_lengths(BinkContext *c, int width, int bw)
Initialize length in all bundles.
static av_cold int init_bundles(BinkContext *c)
Allocate memory for bundles.
static int read_colors(GetBitContext *gb, Bundle *b, BinkContext *c)
static int read_block_types(AVCodecContext *avctx, GetBitContext *gb, Bundle *b)
static void read_tree(GetBitContext *gb, Tree *tree)
Read information about Huffman tree used to decode data.
uint8_t syms[16]
leaf value to symbol mapping
static int read_dcs(AVCodecContext *avctx, GetBitContext *gb, Bundle *b, int start_bits, int has_sign)
static int decode_frame(AVCodecContext *avctx, void *data, int *got_frame, AVPacket *pkt)
DC values for intrablocks with DCT.
static int read_motion_values(AVCodecContext *avctx, GetBitContext *gb, Bundle *b)
motion block with some difference added
VLC_TYPE(* table)[2]
code, bits
void(* idct_put)(uint8_t *dest, int line_size, int32_t *block)
static int bink_put_pixels(BinkContext *c, uint8_t *dst, uint8_t *prev, int stride, uint8_t *ref_start, uint8_t *ref_end)
static const int binkb_bundle_sizes[BINKB_NB_SRC]
int version
internal Bink file version
static const int binkb_bundle_signed[BINKB_NB_SRC]
static av_cold int decode_end(AVCodecContext *avctx)
#define LOCAL_ALIGNED_16(t, v,...)
#define FFSWAP(type, a, b)
static void read_bundle(GetBitContext *gb, BinkContext *c, int bundle_num)
Prepare bundle for decoding data.
static const uint8_t bink_rlelens[4]
pixel values used for different block types
uint64_t_TMPL AV_WL64 unsigned int_TMPL AV_RL32
static int get_value(BinkContext *c, int bundle)
Retrieve next value from bundle.
This structure stores compressed data.
#define AV_GET_BUFFER_FLAG_REF
The decoder will keep a reference to the frame and may reuse it later.
void * av_mallocz(size_t size)
Allocate a block of size bytes with alignment suitable for all memory accesses (including vectors if ...
DC values for intrablocks with DCT.
#define AV_CODEC_CAP_DR1
Codec uses get_buffer() for allocating buffers and supports custom allocators.
OldSources
IDs for different data types used in old version of Bink video codec.
op_fill_func fill_block_tab[2]