30 #define BITSTREAM_READER_LE
33 #define BINK_FLAG_ALPHA 0x00100000
34 #define BINK_FLAG_GRAY 0x00020000
57 4, 8, 8, 5, 5, 11, 11, 4, 4, 7
61 0, 0, 0, 1, 1, 0, 1, 0, 0, 0
92 #define GET_HUFF(gb, tree) (tree).syms[get_vlc2(gb, bink_trees[(tree).vlc_num].table,\
93 bink_trees[(tree).vlc_num].bits, 1)]
207 uint8_t *src2 = src +
size;
218 }
while (size && size2);
234 uint8_t tmp1[16], tmp2[16], *in = tmp1, *out = tmp2;
239 for (i = 0; i < 16; i++)
245 memset(tmp1, 0,
sizeof(tmp1));
246 for (i = 0; i <=
len; i++) {
248 tmp1[tree->
syms[i]] = 1;
250 for (i = 0; i < 16 && len < 16 - 1; i++)
255 for (i = 0; i < 16; i++)
257 for (i = 0; i <=
len; i++) {
259 for (t = 0; t < 16; t += size << 1)
260 merge(gb, out + t, in + t, size);
261 FFSWAP(uint8_t*, in, out);
263 memcpy(tree->
syms, in, 16);
279 for (i = 0; i < 16; i++)
296 #define CHECK_READ_VAL(gb, b, t) \
297 if (!b->cur_dec || (b->cur_dec > b->cur_ptr)) \
299 t = get_bits(gb, b->len); \
308 const uint8_t *dec_end;
330 const uint8_t *dec_end;
342 v = (v ^ sign) - sign;
351 v = (v ^ sign) - sign;
365 const uint8_t *dec_end;
386 if (dec_end - b->
cur_dec < run)
399 const uint8_t *dec_end;
419 const uint8_t *dec_end;
432 sign = ((int8_t) v) >> 7;
433 v = ((v & 0x7F) ^ sign) - sign;
444 sign = ((int8_t) v) >> 7;
445 v = ((v & 0x7F) ^ sign) - sign;
455 #define DC_START_BITS 11
458 int start_bits,
int has_sign)
460 int i, j,
len, len2, bsize, sign,
v, v2;
461 int16_t *dst = (int16_t*)b->
cur_dec;
462 int16_t *dst_end = (int16_t*)b->
data_end;
465 v =
get_bits(gb, start_bits - has_sign);
468 v = (v ^ sign) - sign;
470 if (dst_end - dst < 1)
474 for (i = 0; i <
len; i += 8) {
475 len2 =
FFMIN(len - i, 8);
476 if (dst_end - dst < len2)
480 for (j = 0; j < len2; j++) {
484 v2 = (v2 ^ sign) - sign;
488 if (v < -32768 || v > 32767) {
494 for (j = 0; j < len2; j++)
539 const int mask = 1 << (bits - 1);
549 for (i = 0; i <
len; i++)
552 for (i = 0; i <
len; i++)
556 int16_t *dst = (int16_t*)b->
cur_dec;
559 for (i = 0; i <
len; i++)
562 for (i = 0; i <
len; i++)
594 const int32_t quant_matrices[16][64],
int q)
598 int i,
t,
bits, ccoef, mode, sign;
599 int list_start = 64, list_end = 64, list_pos;
603 const int32_t *
quant;
605 coef_list[list_end] = 4; mode_list[list_end++] = 0;
606 coef_list[list_end] = 24; mode_list[list_end++] = 0;
607 coef_list[list_end] = 44; mode_list[list_end++] = 0;
608 coef_list[list_end] = 1; mode_list[list_end++] = 3;
609 coef_list[list_end] = 2; mode_list[list_end++] = 3;
610 coef_list[list_end] = 3; mode_list[list_end++] = 3;
612 for (bits =
get_bits(gb, 4) - 1; bits >= 0; bits--) {
613 list_pos = list_start;
614 while (list_pos < list_end) {
615 if (!(mode_list[list_pos] | coef_list[list_pos]) || !
get_bits1(gb)) {
619 ccoef = coef_list[list_pos];
620 mode = mode_list[list_pos];
623 coef_list[list_pos] = ccoef + 4;
624 mode_list[list_pos] = 1;
627 coef_list[list_pos] = 0;
628 mode_list[list_pos++] = 0;
630 for (i = 0; i < 4; i++, ccoef++) {
632 coef_list[--list_start] = ccoef;
633 mode_list[ list_start] = 3;
640 t = (t ^ sign) - sign;
642 block[scan[ccoef]] =
t;
643 coef_idx[coef_count++] = ccoef;
648 mode_list[list_pos] = 2;
649 for (i = 0; i < 3; i++) {
651 coef_list[list_end] = ccoef;
652 mode_list[list_end++] = 2;
661 t = (t ^ sign) - sign;
663 block[scan[ccoef]] =
t;
664 coef_idx[coef_count++] = ccoef;
665 coef_list[list_pos] = 0;
666 mode_list[list_pos++] = 0;
678 quant = quant_matrices[quant_idx];
680 block[0] = (block[0] * quant[0]) >> 11;
681 for (i = 0; i < coef_count; i++) {
682 int idx = coef_idx[i];
683 block[scan[idx]] = (block[scan[idx]] * quant[idx]) >> 11;
701 int i, sign,
mask, ccoef, mode;
702 int list_start = 64, list_end = 64, list_pos;
704 int nz_coeff_count = 0;
706 coef_list[list_end] = 4; mode_list[list_end++] = 0;
707 coef_list[list_end] = 24; mode_list[list_end++] = 0;
708 coef_list[list_end] = 44; mode_list[list_end++] = 0;
709 coef_list[list_end] = 0; mode_list[list_end++] = 2;
712 for (i = 0; i < nz_coeff_count; i++) {
715 if (block[nz_coeff[i]] < 0)
716 block[nz_coeff[i]] -=
mask;
718 block[nz_coeff[i]] +=
mask;
723 list_pos = list_start;
724 while (list_pos < list_end) {
725 if (!(coef_list[list_pos] | mode_list[list_pos]) || !
get_bits1(gb)) {
729 ccoef = coef_list[list_pos];
730 mode = mode_list[list_pos];
733 coef_list[list_pos] = ccoef + 4;
734 mode_list[list_pos] = 1;
737 coef_list[list_pos] = 0;
738 mode_list[list_pos++] = 0;
740 for (i = 0; i < 4; i++, ccoef++) {
742 coef_list[--list_start] = ccoef;
743 mode_list[ list_start] = 3;
745 nz_coeff[nz_coeff_count++] =
bink_scan[ccoef];
747 block[
bink_scan[ccoef]] = (mask ^ sign) - sign;
755 mode_list[list_pos] = 2;
756 for (i = 0; i < 3; i++) {
758 coef_list[list_end] = ccoef;
759 mode_list[list_end++] = 2;
763 nz_coeff[nz_coeff_count++] =
bink_scan[ccoef];
765 block[
bink_scan[ccoef]] = (mask ^ sign) - sign;
766 coef_list[list_pos] = 0;
767 mode_list[list_pos++] = 0;
786 for (i = 0; i < 8; i++)
787 memcpy(tmp + i*8, src + i*stride, 8);
788 for (i = 0; i < 8; i++)
789 memcpy(dst + i*stride, tmp + i*8, 8);
793 int is_key,
int is_chroma)
797 uint8_t *dst, *ref, *ref_start, *ref_end;
804 int ybias = is_key ? -15 : 0;
812 ref_start = c->
pic.
data[plane_idx];
815 for (i = 0; i < 64; i++)
816 coordmap[i] = (i & 7) + (i >> 3) * stride;
818 for (by = 0; by < bh; by++) {
825 for (bx = 0; bx < bw; bx++, dst += 8) {
846 for (j = 0; j <
run; j++)
847 dst[coordmap[*scan++]] = v;
849 for (j = 0; j <
run; j++)
857 memset(dctblock, 0,
sizeof(*dctblock) * 64);
866 ref = dst + xoff + yoff *
stride;
867 if (ref < ref_start || ref + 8*stride > ref_end) {
869 }
else if (ref + 8*stride < dst || ref >= dst + 8*stride) {
882 ref = dst + xoff + yoff *
stride;
883 if (ref < ref_start || ref + 8 * stride > ref_end) {
885 }
else if (ref + 8*stride < dst || ref >= dst + 8*stride) {
890 memset(dctblock, 0,
sizeof(*dctblock) * 64);
901 for (i = 0; i < 2; i++)
903 for (i = 0; i < 8; i++) {
905 for (j = 0; j < 8; j++, v >>= 1)
906 dst[i*stride + j] = col[v & 1];
912 ref = dst + xoff + yoff *
stride;
913 if (ref < ref_start || ref + 8 * stride > ref_end) {
915 }
else if (ref + 8*stride < dst || ref >= dst + 8*stride) {
922 for (i = 0; i < 8; i++)
943 uint8_t *dst, *prev, *ref, *ref_start, *ref_end;
964 + (bw - 1 + c->
last.
linesize[plane_idx] * (bh - 1)) * 8;
966 for (i = 0; i < 64; i++)
967 coordmap[i] = (i & 7) + (i >> 3) * stride;
969 for (by = 0; by < bh; by++) {
993 : c->
pic.
data[plane_idx]) + 8*by*stride;
994 for (bx = 0; bx < bw; bx++, dst += 8, prev += 8) {
1023 for (j = 0; j <
run; j++)
1024 ublock[*scan++] = v;
1026 for (j = 0; j <
run; j++)
1034 memset(dctblock, 0,
sizeof(*dctblock) * 64);
1044 for (i = 0; i < 2; i++)
1046 for (j = 0; j < 8; j++) {
1048 for (i = 0; i < 8; i++, v >>= 1)
1049 ublock[i + j*8] = col[v & 1];
1053 for (j = 0; j < 8; j++)
1054 for (i = 0; i < 8; i++)
1070 ref = prev + xoff + yoff *
stride;
1071 if (ref < ref_start || ref > ref_end) {
1073 bx*8 + xoff, by*8 + yoff);
1091 for (j = 0; j <
run; j++)
1092 dst[coordmap[*scan++]] = v;
1094 for (j = 0; j <
run; j++)
1104 ref = prev + xoff + yoff *
stride;
1105 if (ref < ref_start || ref > ref_end) {
1107 bx*8 + xoff, by*8 + yoff);
1117 memset(dctblock, 0,
sizeof(*dctblock) * 64);
1129 ref = prev + xoff + yoff *
stride;
1131 memset(dctblock, 0,
sizeof(*dctblock) * 64);
1137 for (i = 0; i < 2; i++)
1139 for (i = 0; i < 8; i++) {
1141 for (j = 0; j < 8; j++, v >>= 1)
1142 dst[i*stride + j] = col[v & 1];
1146 for (i = 0; i < 8; i++)
1166 int plane, plane_idx;
1167 int bits_count = pkt->
size << 3;
1194 for (plane = 0; plane < 3; plane++) {
1195 plane_idx = (!plane || !c->
swap_planes) ? plane : (plane ^ 3);
1224 uint8_t inv_bink_scan[64];
1228 for (j = 0; j < 8; j++) {
1229 for (i = 0; i < 8; i++) {
1232 s[j*8 + i] = cos(j *
M_PI/16.0) * cos(i *
M_PI/16.0) * 2.0;
1234 s[j*8 + i] = cos(j *
M_PI/16.0) * sqrt(2.0);
1237 s[j*8 + i] = cos(i *
M_PI/16.0) * sqrt(2.0);
1243 for (i = 0; i < 64; i++)
1246 for (j = 0; j < 16; j++) {
1247 for (i = 0; i < 64; i++) {
1248 int k = inv_bink_scan[i];
1267 static VLC_TYPE table[16 * 128][2];
1268 static int binkb_initialised = 0;
1280 if (!bink_trees[15].table) {
1281 for (i = 0; i < 16; i++) {
1283 bink_trees[i].
table = table + i*128;
1285 init_vlc(&bink_trees[i], maxbits, 16,
1307 if (!binkb_initialised) {
1309 binkb_initialised = 1;
1330 .
name =
"binkvideo",