34 #define BITSTREAM_READER_LE
37 #define BINK_FLAG_ALPHA 0x00100000
38 #define BINK_FLAG_GRAY 0x00020000
61 4, 8, 8, 5, 5, 11, 11, 4, 4, 7
65 0, 0, 0, 1, 1, 0, 1, 0, 0, 0
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)]
225 }
while (size && size2);
241 uint8_t tmp1[16] = { 0 }, tmp2[16], *
in = tmp1, *
out = tmp2;
246 for (i = 0; i < 16; i++)
252 for (i = 0; i <=
len; i++) {
254 tmp1[tree->
syms[i]] = 1;
256 for (i = 0; i < 16 && len < 16 - 1; i++)
261 for (i = 0; i < 16; i++)
263 for (i = 0; i <=
len; i++) {
265 for (t = 0; t < 16; t += size << 1)
266 merge(gb, out + t, in + t, size);
269 memcpy(tree->
syms, in, 16);
285 for (i = 0; i < 16; i++)
302 #define CHECK_READ_VAL(gb, b, t) \
303 if (!b->cur_dec || (b->cur_dec > b->cur_ptr)) \
305 t = get_bits(gb, b->len); \
348 v = (v ^ sign) - sign;
357 v = (v ^ sign) - sign;
392 if (dec_end - b->
cur_dec < run)
438 sign = ((int8_t) v) >> 7;
439 v = ((v & 0x7F) ^ sign) - sign;
450 sign = ((int8_t) v) >> 7;
451 v = ((v & 0x7F) ^ sign) - sign;
461 #define DC_START_BITS 11
464 int start_bits,
int has_sign)
466 int i, j,
len, len2, bsize, sign, v, v2;
467 int16_t *dst = (int16_t*)b->
cur_dec;
468 int16_t *dst_end = (int16_t*)b->
data_end;
471 v =
get_bits(gb, start_bits - has_sign);
474 v = (v ^ sign) - sign;
476 if (dst_end - dst < 1)
480 for (i = 0; i <
len; i += 8) {
481 len2 =
FFMIN(len - i, 8);
482 if (dst_end - dst < len2)
486 for (j = 0; j < len2; j++) {
490 v2 = (v2 ^ sign) - sign;
494 if (v < -32768 || v > 32767) {
500 for (j = 0; j < len2; j++)
545 const int mask = 1 << (bits - 1);
555 for (i = 0; i <
len; i++)
558 for (i = 0; i <
len; i++)
562 int16_t *dst = (int16_t*)b->
cur_dec;
565 for (i = 0; i <
len; i++)
568 for (i = 0; i <
len; i++)
600 const int32_t quant_matrices[16][64],
int q)
604 int i,
t,
bits, ccoef, mode, sign;
605 int list_start = 64, list_end = 64, list_pos;
611 coef_list[list_end] = 4; mode_list[list_end++] = 0;
612 coef_list[list_end] = 24; mode_list[list_end++] = 0;
613 coef_list[list_end] = 44; mode_list[list_end++] = 0;
614 coef_list[list_end] = 1; mode_list[list_end++] = 3;
615 coef_list[list_end] = 2; mode_list[list_end++] = 3;
616 coef_list[list_end] = 3; mode_list[list_end++] = 3;
618 for (bits =
get_bits(gb, 4) - 1; bits >= 0; bits--) {
619 list_pos = list_start;
620 while (list_pos < list_end) {
621 if (!(mode_list[list_pos] | coef_list[list_pos]) || !
get_bits1(gb)) {
625 ccoef = coef_list[list_pos];
626 mode = mode_list[list_pos];
629 coef_list[list_pos] = ccoef + 4;
630 mode_list[list_pos] = 1;
633 coef_list[list_pos] = 0;
634 mode_list[list_pos++] = 0;
636 for (i = 0; i < 4; i++, ccoef++) {
638 coef_list[--list_start] = ccoef;
639 mode_list[ list_start] = 3;
646 t = (t ^ sign) - sign;
648 block[scan[ccoef]] =
t;
649 coef_idx[coef_count++] = ccoef;
654 mode_list[list_pos] = 2;
655 for (i = 0; i < 3; i++) {
657 coef_list[list_end] = ccoef;
658 mode_list[list_end++] = 2;
667 t = (t ^ sign) - sign;
669 block[scan[ccoef]] =
t;
670 coef_idx[coef_count++] = ccoef;
671 coef_list[list_pos] = 0;
672 mode_list[list_pos++] = 0;
687 quant = quant_matrices[quant_idx];
689 block[0] = (block[0] * quant[0]) >> 11;
690 for (i = 0; i < coef_count; i++) {
691 int idx = coef_idx[i];
692 block[scan[idx]] = (block[scan[idx]] * quant[idx]) >> 11;
710 int i, sign,
mask, ccoef, mode;
711 int list_start = 64, list_end = 64, list_pos;
713 int nz_coeff_count = 0;
715 coef_list[list_end] = 4; mode_list[list_end++] = 0;
716 coef_list[list_end] = 24; mode_list[list_end++] = 0;
717 coef_list[list_end] = 44; mode_list[list_end++] = 0;
718 coef_list[list_end] = 0; mode_list[list_end++] = 2;
721 for (i = 0; i < nz_coeff_count; i++) {
724 if (block[nz_coeff[i]] < 0)
725 block[nz_coeff[i]] -=
mask;
727 block[nz_coeff[i]] +=
mask;
732 list_pos = list_start;
733 while (list_pos < list_end) {
734 if (!(coef_list[list_pos] | mode_list[list_pos]) || !
get_bits1(gb)) {
738 ccoef = coef_list[list_pos];
739 mode = mode_list[list_pos];
742 coef_list[list_pos] = ccoef + 4;
743 mode_list[list_pos] = 1;
746 coef_list[list_pos] = 0;
747 mode_list[list_pos++] = 0;
749 for (i = 0; i < 4; i++, ccoef++) {
751 coef_list[--list_start] = ccoef;
752 mode_list[ list_start] = 3;
754 nz_coeff[nz_coeff_count++] =
bink_scan[ccoef];
756 block[
bink_scan[ccoef]] = (mask ^ sign) - sign;
764 mode_list[list_pos] = 2;
765 for (i = 0; i < 3; i++) {
767 coef_list[list_end] = ccoef;
768 mode_list[list_end++] = 2;
772 nz_coeff[nz_coeff_count++] =
bink_scan[ccoef];
774 block[
bink_scan[ccoef]] = (mask ^ sign) - sign;
775 coef_list[list_pos] = 0;
776 mode_list[list_pos++] = 0;
795 for (i = 0; i < 8; i++)
796 memcpy(tmp + i*8, src + i*stride, 8);
797 for (i = 0; i < 8; i++)
798 memcpy(dst + i*stride, tmp + i*8, 8);
802 int plane_idx,
int is_key,
int is_chroma)
806 uint8_t *dst, *ref, *ref_start, *ref_end;
813 int ybias = is_key ? -15 : 0;
821 ref_start = frame->
data[plane_idx];
822 ref_end = frame->
data[plane_idx] + (bh * frame->
linesize[plane_idx] + bw) * 8;
824 for (i = 0; i < 64; i++)
825 coordmap[i] = (i & 7) + (i >> 3) * stride;
827 for (by = 0; by < bh; by++) {
834 for (bx = 0; bx < bw; bx++, dst += 8) {
855 for (j = 0; j <
run; j++)
856 dst[coordmap[*scan++]] = v;
858 for (j = 0; j <
run; j++)
866 memset(dctblock, 0,
sizeof(*dctblock) * 64);
875 ref = dst + xoff + yoff *
stride;
876 if (ref < ref_start || ref + 8*stride > ref_end) {
878 }
else if (ref + 8*stride < dst || ref >= dst + 8*stride) {
891 ref = dst + xoff + yoff *
stride;
892 if (ref < ref_start || ref + 8 * stride > ref_end) {
894 }
else if (ref + 8*stride < dst || ref >= dst + 8*stride) {
899 memset(dctblock, 0,
sizeof(*dctblock) * 64);
910 for (i = 0; i < 2; i++)
912 for (i = 0; i < 8; i++) {
914 for (j = 0; j < 8; j++, v >>= 1)
915 dst[i*stride + j] = col[v & 1];
921 ref = dst + xoff + yoff *
stride;
922 if (ref < ref_start || ref + 8 * stride > ref_end) {
924 }
else if (ref + 8*stride < dst || ref >= dst + 8*stride) {
931 for (i = 0; i < 8; i++)
948 int plane_idx,
int is_chroma)
952 uint8_t *dst, *prev, *ref, *ref_start, *ref_end;
971 : frame->
data[plane_idx];
973 + (bw - 1 + c->
last->
linesize[plane_idx] * (bh - 1)) * 8;
975 for (i = 0; i < 64; i++)
976 coordmap[i] = (i & 7) + (i >> 3) * stride;
978 for (by = 0; by < bh; by++) {
1002 : frame->
data[plane_idx]) + 8*by*stride;
1003 for (bx = 0; bx < bw; bx++, dst += 8, prev += 8) {
1032 for (j = 0; j <
run; j++)
1033 ublock[*scan++] = v;
1035 for (j = 0; j <
run; j++)
1043 memset(dctblock, 0,
sizeof(*dctblock) * 64);
1053 for (i = 0; i < 2; i++)
1055 for (j = 0; j < 8; j++) {
1057 for (i = 0; i < 8; i++, v >>= 1)
1058 ublock[i + j*8] = col[v & 1];
1062 for (j = 0; j < 8; j++)
1063 for (i = 0; i < 8; i++)
1079 ref = prev + xoff + yoff *
stride;
1080 if (ref < ref_start || ref > ref_end) {
1082 bx*8 + xoff, by*8 + yoff);
1100 for (j = 0; j <
run; j++)
1101 dst[coordmap[*scan++]] = v;
1103 for (j = 0; j <
run; j++)
1113 ref = prev + xoff + yoff *
stride;
1114 if (ref < ref_start || ref > ref_end) {
1116 bx*8 + xoff, by*8 + yoff);
1126 memset(dctblock, 0,
sizeof(*dctblock) * 64);
1138 ref = prev + xoff + yoff *
stride;
1140 memset(dctblock, 0,
sizeof(*dctblock) * 64);
1146 for (i = 0; i < 2; i++)
1148 for (i = 0; i < 8; i++) {
1150 for (j = 0; j < 8; j++, v >>= 1)
1151 dst[i*stride + j] = col[v & 1];
1155 for (i = 0; i < 8; i++)
1176 int plane, plane_idx, ret;
1177 int bits_count = pkt->
size << 3;
1203 for (plane = 0; plane < 3; plane++) {
1204 plane_idx = (!plane || !c->
swap_planes) ? plane : (plane ^ 3);
1240 for (j = 0; j < 8; j++) {
1241 for (i = 0; i < 8; i++) {
1244 s[j*8 + i] = cos(j * M_PI/16.0) * cos(i * M_PI/16.0) * 2.0;
1246 s[j*8 + i] = cos(j * M_PI/16.0) * sqrt(2.0);
1249 s[j*8 + i] = cos(i * M_PI/16.0) * sqrt(2.0);
1255 for (i = 0; i < 64; i++)
1258 for (j = 0; j < 16; j++) {
1259 for (i = 0; i < 64; i++) {
1260 int k = inv_bink_scan[i];
1279 static VLC_TYPE table[16 * 128][2];
1280 static int binkb_initialised = 0;
1292 if (!bink_trees[15].table) {
1293 for (i = 0; i < 16; i++) {
1295 bink_trees[i].
table = table + i*128;
1297 init_vlc(&bink_trees[i], maxbits, 16,
1320 if (!binkb_initialised) {
1322 binkb_initialised = 1;
1340 .
name =
"binkvideo",