Go to the documentation of this file.
95 const uint8_t *syms,
int mod_three_bits_offset,
int *
offset)
97 int counts[17] = {0}, codes[17];
107 codes[0] = counts[0] = 0;
108 for (
int i = 0;
i < 16;
i++) {
109 codes[
i+1] = (codes[
i] + counts[
i]) << 1;
116 const void *symp = syms;
119 if (mod_three_bits_offset > 0) {
123 for (
int i = 0,
mask = (1 << mod_three_bits_offset) - 1;
i <
size; ++
i) {
128 if (!mod_three_bits_offset)
131 symbol_size = !!symp;
146 int mod_three_bits_offset,
int *
offset)
161 for(j = 0; j < 2; j++){
168 for(k = 0; k < 4; k++){
173 for(j = 0; j < 4; j++){
184 for(j = 0; j < 4; j++){
188 for(j = 0; j < 2; j++){
213 int pattern,
code, cbp=0;
215 static const int cbp_masks[3] = {0x100000, 0x010000, 0x110000};
216 static const int shifts[4] = { 0, 2, 8, 10 };
217 const int *curshift =
shifts;
221 pattern =
code & 0xF;
231 for(
i = 0;
i < 4;
i++){
232 t = (
code >> (6 - 2*
i)) & 3;
236 cbp |= cbp_masks[2] <<
i;
252 coef = 22 + ((1 << coef) |
get_bits(gb, coef));
258 *
dst = (coef*q + 8) >> 4;
291 int q_dc,
int q_ac1,
int q_ac2)
311 int fc,
int sc,
int q_dc,
int q_ac1,
int q_ac2)
315 int pattern =
flags & 0x7;
354 for(
i = 0;
i < 5;
i++)
379 int mb_pos =
s->mb_x +
s->mb_y *
s->mb_stride;
387 fill_rectangle(intra_types, 4, 4,
r->intra_types_stride, t,
sizeof(intra_types[0]));
396 if(
r->decode_intra_types(
r, gb, intra_types) < 0)
414 int mb_pos =
s->mb_x +
s->mb_y *
s->mb_stride;
417 r->block_type =
r->decode_mb_info(
r);
418 if(
r->block_type == -1)
421 r->mb_type[mb_pos] =
r->block_type;
432 fill_rectangle(intra_types, 4, 4,
r->intra_types_stride, 0,
sizeof(intra_types[0]));
438 if (
IS_INTRA(
s->cur_pic.mb_type[mb_pos])) {
441 fill_rectangle(intra_types, 4, 4,
r->intra_types_stride, t,
sizeof(intra_types[0]));
444 if(
r->decode_intra_types(
r, gb, intra_types) < 0)
451 for(
i = 0;
i < 16;
i++)
452 intra_types[(
i & 3) + (
i>>2) *
r->intra_types_stride] = 0;
473 static const uint8_t
part_sizes_w[
RV34_MB_TYPES] = { 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2 };
476 static const uint8_t
part_sizes_h[
RV34_MB_TYPES] = { 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2 };
491 int mv_pos =
s->mb_x * 2 +
s->mb_y * 2 *
s->b8_stride;
492 int A[2] = {0},
B[2],
C[2];
497 int16_t (*motion_val)[2] =
s->cur_pic.motion_val[0];
499 mv_pos += (subblock_no & 1) + (subblock_no >> 1)*
s->b8_stride;
504 A[0] = motion_val[mv_pos-1][0];
505 A[1] = motion_val[mv_pos-1][1];
508 B[0] = motion_val[mv_pos-
s->b8_stride][0];
509 B[1] = motion_val[mv_pos-
s->b8_stride][1];
515 if(avail[-4] && (avail[-1] ||
r->rv30)){
516 C[0] = motion_val[mv_pos-
s->b8_stride-1][0];
517 C[1] = motion_val[mv_pos-
s->b8_stride-1][1];
523 C[0] = motion_val[mv_pos-
s->b8_stride+c_off][0];
524 C[1] = motion_val[mv_pos-
s->b8_stride+c_off][1];
528 mx +=
r->dmv[dmv_no][0];
529 my +=
r->dmv[dmv_no][1];
532 motion_val[mv_pos +
i + j*
s->b8_stride][0] =
mx;
533 motion_val[mv_pos +
i + j*
s->b8_stride][1] =
my;
538 #define GET_PTS_DIFF(a, b) (((a) - (b) + 8192) & 0x1FFF)
545 int mul = dir ? -
r->mv_weight2 :
r->mv_weight1;
547 return (
int)(
val * (
SUINT)mul + 0x2000) >> 14;
554 int A_avail,
int B_avail,
int C_avail,
557 if(A_avail + B_avail + C_avail != 3){
558 *
mx =
A[0] +
B[0] +
C[0];
559 *
my =
A[1] +
B[1] +
C[1];
560 if(A_avail + B_avail + C_avail == 2){
576 int mb_pos =
s->mb_x +
s->mb_y *
s->mb_stride;
577 int mv_pos =
s->mb_x * 2 +
s->mb_y * 2 *
s->b8_stride;
578 int A[2] = { 0 },
B[2] = { 0 },
C[2] = { 0 };
579 int has_A = 0, has_B = 0, has_C = 0;
592 B[0] = cur_pic->
motion_val[dir][mv_pos -
s->b8_stride][0];
593 B[1] = cur_pic->
motion_val[dir][mv_pos -
s->b8_stride][1];
596 if(
r->avail_cache[6-4] && (
r->avail_cache[6-2] &
type) &
mask){
597 C[0] = cur_pic->
motion_val[dir][mv_pos -
s->b8_stride + 2][0];
598 C[1] = cur_pic->
motion_val[dir][mv_pos -
s->b8_stride + 2][1];
600 }
else if((
s->mb_x+1) ==
s->mb_width && (
r->avail_cache[6-5] &
type) &
mask){
601 C[0] = cur_pic->
motion_val[dir][mv_pos -
s->b8_stride - 1][0];
602 C[1] = cur_pic->
motion_val[dir][mv_pos -
s->b8_stride - 1][1];
608 mx +=
r->dmv[dir][0];
609 my +=
r->dmv[dir][1];
611 for(j = 0; j < 2; j++){
612 for(
i = 0;
i < 2;
i++){
628 int mv_pos =
s->mb_x * 2 +
s->mb_y * 2 *
s->b8_stride;
629 int A[2] = {0},
B[2],
C[2];
635 A[0] =
s->cur_pic.motion_val[0][mv_pos - 1][0];
636 A[1] =
s->cur_pic.motion_val[0][mv_pos - 1][1];
639 B[0] =
s->cur_pic.motion_val[0][mv_pos -
s->b8_stride][0];
640 B[1] =
s->cur_pic.motion_val[0][mv_pos -
s->b8_stride][1];
646 if(avail[-4] && (avail[-1])){
647 C[0] =
s->cur_pic.motion_val[0][mv_pos -
s->b8_stride - 1][0];
648 C[1] =
s->cur_pic.motion_val[0][mv_pos -
s->b8_stride - 1][1];
654 C[0] =
s->cur_pic.motion_val[0][mv_pos -
s->b8_stride + 2][0];
655 C[1] =
s->cur_pic.motion_val[0][mv_pos -
s->b8_stride + 2][1];
661 for(j = 0; j < 2; j++){
662 for(
i = 0;
i < 2;
i++){
663 for(k = 0; k < 2; k++){
664 s->cur_pic.motion_val[k][mv_pos +
i + j*
s->b8_stride][0] =
mx;
665 s->cur_pic.motion_val[k][mv_pos +
i + j*
s->b8_stride][1] =
my;
689 const int xoff,
const int yoff,
int mv_off,
691 const int thirdpel,
int weighted,
697 const uint8_t *srcY, *srcU, *srcV;
698 int dxy,
mx,
my, umx, umy, lx, ly, uvmx, uvmy, src_x, src_y, uvsrc_x, uvsrc_y;
699 int mv_pos =
s->mb_x * 2 +
s->mb_y * 2 *
s->b8_stride + mv_off;
702 int16_t *motion_val =
s->cur_pic.motion_val[dir][mv_pos];
705 int chroma_mx, chroma_my;
706 mx = (motion_val[0] + (3 << 24)) / 3 - (1 << 24);
707 my = (motion_val[1] + (3 << 24)) / 3 - (1 << 24);
708 lx = (motion_val[0] + (3 << 24)) % 3;
709 ly = (motion_val[1] + (3 << 24)) % 3;
710 chroma_mx = motion_val[0] / 2;
711 chroma_my = motion_val[1] / 2;
712 umx = (chroma_mx + (3 << 24)) / 3 - (1 << 24);
713 umy = (chroma_my + (3 << 24)) / 3 - (1 << 24);
718 mx = motion_val[0] >> 2;
719 my = motion_val[1] >> 2;
720 lx = motion_val[0] & 3;
721 ly = motion_val[1] & 3;
722 cx = motion_val[0] / 2;
723 cy = motion_val[1] / 2;
726 uvmx = (cx & 3) << 1;
727 uvmy = (cy & 3) << 1;
729 if(uvmx == 6 && uvmy == 6)
735 int mb_row =
s->mb_y + ((yoff +
my + 5 + 8 *
height) >> 4);
736 const ThreadProgress *
p = dir ? &
s->next_pic.ptr->progress : &
s->last_pic.ptr->progress;
741 srcY = dir ?
s->next_pic.data[0] :
s->last_pic.data[0];
742 srcU = dir ?
s->next_pic.data[1] :
s->last_pic.data[1];
743 srcV = dir ?
s->next_pic.data[2] :
s->last_pic.data[2];
744 src_x =
s->mb_x * 16 + xoff +
mx;
745 src_y =
s->mb_y * 16 + yoff +
my;
746 uvsrc_x =
s->mb_x * 8 + (xoff >> 1) + umx;
747 uvsrc_y =
s->mb_y * 8 + (yoff >> 1) + umy;
748 srcY += src_y *
s->linesize + src_x;
749 srcU += uvsrc_y *
s->uvlinesize + uvsrc_x;
750 srcV += uvsrc_y *
s->uvlinesize + uvsrc_x;
751 if(
s->h_edge_pos - (
width << 3) < 6 ||
s->v_edge_pos - (
height << 3) < 6 ||
752 (
unsigned)(src_x - !!lx*2) >
s->h_edge_pos - !!lx*2 - (
width <<3) - 4 ||
753 (unsigned)(src_y - !!ly*2) >
s->v_edge_pos - !!ly*2 - (
height<<3) - 4) {
754 srcY -= 2 + 2*
s->linesize;
755 s->vdsp.emulated_edge_mc(
s->sc.edge_emu_buffer, srcY,
756 s->linesize,
s->linesize,
758 src_x - 2, src_y - 2,
759 s->h_edge_pos,
s->v_edge_pos);
760 srcY =
s->sc.edge_emu_buffer + 2 + 2*
s->linesize;
764 Y =
s->dest[0] + xoff + yoff *
s->linesize;
765 U =
s->dest[1] + (xoff>>1) + (yoff>>1)*
s->uvlinesize;
766 V =
s->dest[2] + (xoff>>1) + (yoff>>1)*
s->uvlinesize;
768 Y =
r->tmp_b_block_y [dir] + xoff + yoff *
s->linesize;
769 U =
r->tmp_b_block_uv[dir*2] + (xoff>>1) + (yoff>>1)*
s->uvlinesize;
770 V =
r->tmp_b_block_uv[dir*2+1] + (xoff>>1) + (yoff>>1)*
s->uvlinesize;
774 qpel_mc[1][dxy](
Y, srcY,
s->linesize);
778 qpel_mc[1][dxy](
Y, srcY,
s->linesize);
779 Y += 8 *
s->linesize;
780 srcY += 8 *
s->linesize;
783 qpel_mc[!is16x16][dxy](
Y, srcY,
s->linesize);
785 uint8_t *uvbuf =
s->sc.edge_emu_buffer;
787 s->vdsp.emulated_edge_mc(uvbuf, srcU,
788 s->uvlinesize,
s->uvlinesize,
791 s->h_edge_pos >> 1,
s->v_edge_pos >> 1);
793 uvbuf += 9*
s->uvlinesize;
795 s->vdsp.emulated_edge_mc(uvbuf, srcV,
796 s->uvlinesize,
s->uvlinesize,
799 s->h_edge_pos >> 1,
s->v_edge_pos >> 1);
807 const int xoff,
const int yoff,
int mv_off,
810 rv34_mc(
r, block_type, xoff, yoff, mv_off,
width,
height, dir,
r->rv30, 0,
811 r->rdsp.put_pixels_tab,
812 r->rdsp.put_chroma_pixels_tab);
817 r->rdsp.rv40_weight_pixels_tab[
r->scaled_weight][0](
r->s.dest[0],
823 r->rdsp.rv40_weight_pixels_tab[
r->scaled_weight][1](
r->s.dest[1],
824 r->tmp_b_block_uv[0],
825 r->tmp_b_block_uv[2],
829 r->rdsp.rv40_weight_pixels_tab[
r->scaled_weight][1](
r->s.dest[2],
830 r->tmp_b_block_uv[1],
831 r->tmp_b_block_uv[3],
841 rv34_mc(
r, block_type, 0, 0, 0, 2, 2, 0,
r->rv30, weighted,
842 r->rdsp.put_pixels_tab,
843 r->rdsp.put_chroma_pixels_tab);
845 rv34_mc(
r, block_type, 0, 0, 0, 2, 2, 1,
r->rv30, 0,
846 r->rdsp.avg_pixels_tab,
847 r->rdsp.avg_chroma_pixels_tab);
849 rv34_mc(
r, block_type, 0, 0, 0, 2, 2, 1,
r->rv30, 1,
850 r->rdsp.put_pixels_tab,
851 r->rdsp.put_chroma_pixels_tab);
859 int weighted = !
r->rv30 &&
r->weight1 != 8192;
861 for(j = 0; j < 2; j++)
862 for(
i = 0;
i < 2;
i++){
865 r->rdsp.put_pixels_tab,
866 r->rdsp.put_chroma_pixels_tab);
869 weighted ?
r->rdsp.put_pixels_tab :
r->rdsp.avg_pixels_tab,
870 weighted ?
r->rdsp.put_chroma_pixels_tab :
r->rdsp.avg_chroma_pixels_tab);
877 static const int num_mvs[
RV34_MB_TYPES] = { 0, 0, 1, 4, 1, 1, 0, 0, 2, 2, 2, 1 };
888 int mv_pos =
s->mb_x * 2 +
s->mb_y * 2 *
s->b8_stride;
891 memset(
r->dmv, 0,
sizeof(
r->dmv));
897 r->dmv[
i][0] =
r->dmv[
i][1] = 0;
904 ZERO8x2(
s->cur_pic.motion_val[0][
s->mb_x * 2 +
s->mb_y * 2 *
s->b8_stride],
s->b8_stride);
908 ZERO8x2(
s->cur_pic.motion_val[0][
s->mb_x * 2 +
s->mb_y * 2 *
s->b8_stride],
s->b8_stride);
918 next_bt =
s->next_pic.mb_type[
s->mb_x +
s->mb_y *
s->mb_stride];
920 ZERO8x2(
s->cur_pic.motion_val[0][
s->mb_x * 2 +
s->mb_y * 2 *
s->b8_stride],
s->b8_stride);
921 ZERO8x2(
s->cur_pic.motion_val[1][
s->mb_x * 2 +
s->mb_y * 2 *
s->b8_stride],
s->b8_stride);
923 for(j = 0; j < 2; j++)
924 for(
i = 0;
i < 2;
i++)
925 for(k = 0; k < 2; k++)
926 for(l = 0; l < 2; l++)
927 s->cur_pic.motion_val[l][mv_pos +
i + j*
s->b8_stride][k] =
calc_add_mv(
r, l,
s->next_pic.motion_val[0][mv_pos +
i + j*
s->b8_stride][k]);
932 ZERO8x2(
s->cur_pic.motion_val[0][
s->mb_x * 2 +
s->mb_y * 2 *
s->b8_stride],
s->b8_stride);
941 r->dmv[1][0] =
r->dmv[0][0];
942 r->dmv[1][1] =
r->dmv[0][1];
970 rv34_mc_1mv (
r, block_type, (
i&1)<<3, (
i&2)<<2, (
i&1)+(
i>>1)*
s->b8_stride, 1, 1, 0);
1019 prev = (uint8_t*)&topleft;
1041 uint8_t *pdst,
int stride,
1042 int fc,
int sc,
int q_dc,
int q_ac)
1044 int16_t *
const ptr =
r->block;
1046 fc, sc, q_dc, q_ac, q_ac);
1048 r->rdsp.rv34_idct_add(pdst,
stride, ptr);
1050 r->rdsp.rv34_idct_dc_add(pdst,
stride, ptr[0]);
1062 uint8_t *
dst =
s->dest[0];
1063 int16_t *
const ptr =
r->block;
1064 int i, j, itype, has_ac;
1066 memset(block16, 0, 16 *
sizeof(*block16));
1070 r->rdsp.rv34_inv_transform(block16);
1072 r->rdsp.rv34_inv_transform_dc(block16);
1075 itype =
adjust_pred16(itype,
r->avail_cache[6-4],
r->avail_cache[6-1]);
1076 r->h.pred16x16[itype](
dst,
s->linesize);
1078 for(j = 0; j < 4; j++){
1079 for(
i = 0; i < 4; i++, cbp >>= 1){
1080 int dc = block16[
i + j*4];
1089 r->rdsp.rv34_idct_add(
dst+4*
i,
s->linesize, ptr);
1091 r->rdsp.rv34_idct_dc_add(
dst+4*
i,
s->linesize,
dc);
1094 dst += 4*
s->linesize;
1099 itype =
adjust_pred16(itype,
r->avail_cache[6-4],
r->avail_cache[6-1]);
1104 for(j = 1; j < 3; j++){
1106 r->h.pred8x8[itype](
dst,
s->uvlinesize);
1107 for(
i = 0; i < 4; i++, cbp >>= 1){
1109 if(!(cbp & 1))
continue;
1110 pdst =
dst + (
i&1)*4 + (
i&2)*2*
s->uvlinesize;
1113 r->chroma_vlc, 1, q_dc, q_ac);
1121 uint8_t *
dst =
s->dest[0];
1122 int avail[6*8] = {0};
1124 int idx, q_ac, q_dc;
1127 if(
r->avail_cache[1])
1129 if(
r->avail_cache[2])
1130 avail[1] = avail[2] = 1;
1131 if(
r->avail_cache[3])
1132 avail[3] = avail[4] = 1;
1133 if(
r->avail_cache[4])
1135 if(
r->avail_cache[5])
1136 avail[8] = avail[16] = 1;
1137 if(
r->avail_cache[9])
1138 avail[24] = avail[32] = 1;
1141 for(j = 0; j < 4; j++){
1143 for(
i = 0; i < 4; i++, cbp >>= 1,
dst += 4, idx++){
1146 if(!(cbp & 1))
continue;
1149 r->luma_vlc, 0, q_ac, q_ac);
1151 dst +=
s->linesize * 4 - 4*4;
1152 intra_types +=
r->intra_types_stride;
1155 intra_types -=
r->intra_types_stride * 4;
1160 for(k = 0; k < 2; k++){
1164 for(j = 0; j < 2; j++){
1165 int* acache =
r->avail_cache + 6 + j*4;
1166 for(
i = 0; i < 2; i++, cbp >>= 1, acache++){
1167 int itype =
ittrans[intra_types[
i*2+j*2*
r->intra_types_stride]];
1171 if(!(cbp&1))
continue;
1174 r->chroma_vlc, 1, q_dc, q_ac);
1177 dst += 4*
s->uvlinesize;
1185 d = motion_val[0][0] - motion_val[-
step][0];
1188 d = motion_val[0][1] - motion_val[-
step][1];
1197 int hmvmask = 0, vmvmask = 0,
i, j;
1198 int midx =
s->mb_x * 2 +
s->mb_y * 2 *
s->b8_stride;
1199 int16_t (*motion_val)[2] = &
s->cur_pic.motion_val[0][midx];
1200 for(j = 0; j < 16; j += 8){
1201 for(
i = 0;
i < 2;
i++){
1203 vmvmask |= 0x11 << (j +
i*2);
1205 hmvmask |= 0x03 << (j +
i*2);
1207 motion_val +=
s->b8_stride;
1209 if(
s->first_slice_line)
1214 vmvmask |= (vmvmask & 0x4444) >> 1;
1215 hmvmask |= (hmvmask & 0x0F00) >> 4;
1217 r->deblock_coefs[
s->mb_x - 1 +
s->mb_y*
s->mb_stride] |= (vmvmask & 0x1111) << 3;
1218 if(!
s->first_slice_line)
1219 r->deblock_coefs[
s->mb_x + (
s->mb_y - 1)*
s->mb_stride] |= (hmvmask & 0xF) << 12;
1221 return hmvmask | vmvmask;
1228 uint8_t *
dst =
s->dest[0];
1229 int16_t *
const ptr =
r->block;
1230 int mb_pos =
s->mb_x +
s->mb_y *
s->mb_stride;
1232 int q_dc, q_ac, has_ac;
1237 memset(
r->avail_cache, 0,
sizeof(
r->avail_cache));
1239 dist = (
s->mb_x -
s->resync_mb_x) + (
s->mb_y -
s->resync_mb_y) *
s->mb_width;
1242 r->avail_cache[9] =
s->cur_pic.mb_type[mb_pos - 1];
1243 if(dist >=
s->mb_width)
1245 r->avail_cache[3] =
s->cur_pic.mb_type[mb_pos -
s->mb_stride];
1246 if(((
s->mb_x+1) <
s->mb_width) && dist >=
s->mb_width - 1)
1247 r->avail_cache[4] =
s->cur_pic.mb_type[mb_pos -
s->mb_stride + 1];
1248 if(
s->mb_x && dist >
s->mb_width)
1249 r->avail_cache[1] =
s->cur_pic.mb_type[mb_pos -
s->mb_stride - 1];
1251 s->qscale =
r->si.quant;
1253 r->cbp_luma [mb_pos] = cbp;
1254 r->cbp_chroma[mb_pos] = cbp >> 16;
1256 s->cur_pic.qscale_table[mb_pos] =
s->qscale;
1261 if (
IS_INTRA(
s->cur_pic.mb_type[mb_pos])) {
1270 memset(block16, 0, 16 *
sizeof(*block16));
1274 r->rdsp.rv34_inv_transform(block16);
1276 r->rdsp.rv34_inv_transform_dc(block16);
1280 for(j = 0; j < 4; j++){
1281 for(
i = 0; i < 4; i++, cbp >>= 1){
1282 int dc = block16[
i + j*4];
1291 r->rdsp.rv34_idct_add(
dst+4*
i,
s->linesize, ptr);
1293 r->rdsp.rv34_idct_dc_add(
dst+4*
i,
s->linesize,
dc);
1296 dst += 4*
s->linesize;
1303 for(j = 0; j < 4; j++){
1304 for(
i = 0; i < 4; i++, cbp >>= 1){
1305 if(!(cbp & 1))
continue;
1308 r->luma_vlc, 0, q_ac, q_ac);
1310 dst += 4*
s->linesize;
1317 for(j = 1; j < 3; j++){
1319 for(
i = 0; i < 4; i++, cbp >>= 1){
1321 if(!(cbp & 1))
continue;
1322 pdst =
dst + (
i&1)*4 + (
i&2)*2*
s->uvlinesize;
1325 r->chroma_vlc, 1, q_dc, q_ac);
1336 int mb_pos =
s->mb_x +
s->mb_y *
s->mb_stride;
1339 memset(
r->avail_cache, 0,
sizeof(
r->avail_cache));
1341 dist = (
s->mb_x -
s->resync_mb_x) + (
s->mb_y -
s->resync_mb_y) *
s->mb_width;
1344 r->avail_cache[9] =
s->cur_pic.mb_type[mb_pos - 1];
1345 if(dist >=
s->mb_width)
1347 r->avail_cache[3] =
s->cur_pic.mb_type[mb_pos -
s->mb_stride];
1348 if(((
s->mb_x+1) <
s->mb_width) && dist >=
s->mb_width - 1)
1349 r->avail_cache[4] =
s->cur_pic.mb_type[mb_pos -
s->mb_stride + 1];
1350 if(
s->mb_x && dist >
s->mb_width)
1351 r->avail_cache[1] =
s->cur_pic.mb_type[mb_pos -
s->mb_stride - 1];
1353 s->qscale =
r->si.quant;
1355 r->cbp_luma [mb_pos] = cbp;
1356 r->cbp_chroma[mb_pos] = cbp >> 16;
1357 r->deblock_coefs[mb_pos] = 0xFFFF;
1358 s->cur_pic.qscale_table[mb_pos] =
s->qscale;
1375 if(
s->mb_y >=
s->mb_height)
1377 if (!
r->mb_num_left)
1379 if (
r->mb_skip_run > 1)
1391 r->intra_types =
NULL;
1402 r->intra_types_stride =
r->s.mb_width * 4 + 4;
1404 r->cbp_chroma =
av_mallocz(
r->s.mb_stride *
r->s.mb_height *
1405 sizeof(*
r->cbp_chroma));
1407 sizeof(*
r->cbp_luma));
1408 r->deblock_coefs =
av_mallocz(
r->s.mb_stride *
r->s.mb_height *
1409 sizeof(*
r->deblock_coefs));
1410 r->intra_types_hist =
av_malloc(
r->intra_types_stride * 4 * 2 *
1411 sizeof(*
r->intra_types_hist));
1413 sizeof(*
r->mb_type));
1415 if (!(
r->cbp_chroma &&
r->cbp_luma &&
r->deblock_coefs &&
1416 r->intra_types_hist &&
r->mb_type)) {
1417 r->s.context_reinit = 1;
1422 r->intra_types =
r->intra_types_hist +
r->intra_types_stride * 4;
1439 int mb_pos, slice_type;
1443 res =
r->parse_slice_header(
r, gb, &
r->si);
1450 if (slice_type !=
s->pict_type) {
1454 if (
s->width !=
r->si.width ||
s->height !=
r->si.height) {
1460 s->qscale =
r->si.quant;
1461 r->mb_num_left =
r->si.end -
r->si.start;
1464 mb_pos =
s->mb_x +
s->mb_y *
s->mb_width;
1465 if(
r->si.start != mb_pos){
1467 s->mb_x =
r->si.start %
s->mb_width;
1468 s->mb_y =
r->si.start /
s->mb_width;
1470 memset(
r->intra_types_hist, -1,
r->intra_types_stride * 4 * 2 *
sizeof(*
r->intra_types_hist));
1471 s->first_slice_line = 1;
1472 s->resync_mb_x =
s->mb_x;
1473 s->resync_mb_y =
s->mb_y;
1489 if (++
s->mb_x ==
s->mb_width) {
1494 memmove(
r->intra_types_hist,
r->intra_types,
r->intra_types_stride * 4 *
sizeof(*
r->intra_types_hist));
1495 memset(
r->intra_types, -1,
r->intra_types_stride * 4 *
sizeof(*
r->intra_types_hist));
1497 if(
r->loop_filter &&
s->mb_y >= 2)
1498 r->loop_filter(
r,
s->mb_y - 2);
1505 if(
s->mb_x ==
s->resync_mb_x)
1506 s->first_slice_line=0;
1511 return s->mb_y ==
s->mb_height;
1569 r->cur_pts = r1->cur_pts;
1570 r->last_pts = r1->last_pts;
1571 r->next_pts = r1->next_pts;
1573 memset(&
r->si, 0,
sizeof(
r->si));
1580 if (n < slice_count) {
1590 int got_picture = 0,
ret;
1602 }
else if (
s->last_pic.ptr) {
1624 int *got_picture_ptr,
AVPacket *avpkt)
1626 const uint8_t *buf = avpkt->
data;
1627 int buf_size = avpkt->
size;
1633 const uint8_t *slices_hdr =
NULL;
1639 if (buf_size == 0) {
1641 if (
s->next_pic.ptr) {
1646 *got_picture_ptr = 1;
1651 slice_count = (*buf++) + 1;
1652 slices_hdr = buf + 4;
1653 buf += 8 * slice_count;
1654 buf_size -= 1 + 8 * slice_count;
1658 if(offset < 0 || offset > buf_size){
1663 if (
r->parse_slice_header(
r, &
r->gb, &si) < 0 || si.
start) {
1669 "reference data.\n");
1678 if (si.
start == 0) {
1679 if (
r->mb_num_left > 0 &&
s->cur_pic.ptr) {
1682 if (!
s->context_reinit)
1687 if (
s->width != si.
width ||
s->height != si.
height ||
s->context_reinit) {
1697 s->width,
s->height,
s->avctx->sample_aspect_ratio,
1716 if (!
r->tmp_b_block_base) {
1719 r->tmp_b_block_base =
av_malloc(
s->linesize * 48);
1720 if (!
r->tmp_b_block_base)
1722 for (
i = 0;
i < 2;
i++)
1723 r->tmp_b_block_y[
i] =
r->tmp_b_block_base
1724 +
i * 16 *
s->linesize;
1726 r->tmp_b_block_uv[
i] =
r->tmp_b_block_base + 32 *
s->linesize
1727 + (
i >> 1) * 8 *
s->uvlinesize
1730 r->cur_pts = si.
pts;
1732 r->last_pts =
r->next_pts;
1733 r->next_pts =
r->cur_pts;
1740 r->mv_weight1 =
r->mv_weight2 =
r->weight1 =
r->weight2 = 8192;
1741 r->scaled_weight = 0;
1743 if (
FFMAX(dist0, dist1) > refdist)
1746 r->mv_weight1 = (dist0 << 14) / refdist;
1747 r->mv_weight2 = (dist1 << 14) / refdist;
1748 if((
r->mv_weight1|
r->mv_weight2) & 511){
1749 r->weight1 =
r->mv_weight1;
1750 r->weight2 =
r->mv_weight2;
1751 r->scaled_weight = 0;
1753 r->weight1 =
r->mv_weight1 >> 9;
1754 r->weight2 =
r->mv_weight2 >> 9;
1755 r->scaled_weight = 1;
1759 s->mb_x =
s->mb_y = 0;
1761 }
else if (
s->context_reinit) {
1763 "reinitialize (start MB is %d).\n", si.
start);
1765 }
else if (HAVE_THREADS &&
1768 "multithreading mode (start MB is %d).\n", si.
start);
1772 for(
i = 0;
i < slice_count;
i++){
1777 if(offset < 0 || offset > offset1 || offset1 > buf_size){
1783 r->si.end =
s->mb_width *
s->mb_height;
1784 r->mb_num_left =
r->s.mb_x +
r->s.mb_y*
r->s.mb_width -
r->si.start;
1786 if(
i+1 < slice_count){
1788 if (offset2 < offset1 || offset2 > buf_size) {
1793 if (
r->parse_slice_header(
r, &
r->gb, &si) < 0) {
1804 if (
s->cur_pic.ptr) {
1807 r->loop_filter(
r,
s->mb_height - 1);
1812 *got_picture_ptr =
ret;
1813 }
else if (HAVE_THREADS &&
av_cold int ff_mpv_common_init(MpegEncContext *s)
init common structure for both encoder and decoder.
static const int rv34_mb_type_to_lavc[12]
translation of RV30/40 macroblock types to lavc ones
void(* h264_chroma_mc_func)(uint8_t *dst, const uint8_t *src, ptrdiff_t srcStride, int h, int x, int y)
#define AV_LOG_WARNING
Something somehow does not look correct.
static const uint16_t rv34_qscale_tab[32]
This table is used for dequantizing.
void ff_thread_progress_report(ThreadProgress *pro, int n)
This function is a no-op in no-op mode; otherwise it notifies other threads that a certain level of p...
static void rv34_output_intra(RV34DecContext *r, int8_t *intra_types, int cbp)
static int get_bits_left(GetBitContext *gb)
av_cold int ff_rv34_decode_end(AVCodecContext *avctx)
Filter the word “frame” indicates either a video frame or a group of audio as stored in an AVFrame structure Format for each input and each output the list of supported formats For video that means pixel format For audio that means channel sample they are references to shared objects When the negotiation mechanism computes the intersection of the formats supported at each end of a all references to both lists are replaced with a reference to the intersection And when a single format is eventually chosen for a link amongst the remaining all references to the list are updated That means that if a filter requires that its input and output have the same format amongst a supported all it has to do is use a reference to the same list of formats query_formats can leave some formats unset and return AVERROR(EAGAIN) to cause the negotiation mechanism toagain later. That can be used by filters with complex requirements to use the format negotiated on one link to set the formats supported on another. Frame references ownership and permissions
av_cold int ff_mpv_decode_init(MpegEncContext *s, AVCodecContext *avctx)
Initialize the given MpegEncContext for decoding.
static void rv34_pred_mv_rv3(RV34DecContext *r, int block_type, int dir)
motion vector prediction - RV3 version
ThreadProgress is an API to easily notify other threads about progress of any kind as long as it can ...
static const uint8_t rv34_table_inter_secondpat[NUM_INTER_TABLES][2][OTHERBLK_VLC_SIZE]
static const int ittrans16[4]
mapping of RV30/40 intra 16x16 prediction types to standard H.264 types
static const int num_mvs[RV34_MB_TYPES]
number of motion vectors in each macroblock type
static const int chroma_coeffs[3]
int ff_rv34_get_start_offset(GetBitContext *gb, int mb_size)
Decode starting slice position.
This structure describes decoded (raw) audio or video data.
trying all byte sequences megabyte in length and selecting the best looking sequence will yield cases to try But a word about which is also called distortion Distortion can be quantified by almost any quality measurement one chooses the sum of squared differences is used but more complex methods that consider psychovisual effects can be used as well It makes no difference in this discussion First step
#define u(width, name, range_min, range_max)
int ff_rv34_decode_update_thread_context(AVCodecContext *dst, const AVCodecContext *src)
static const uint16_t table[]
static int rv34_decoder_realloc(RV34DecContext *r)
static int check_slice_end(RV34DecContext *r, MpegEncContext *s)
void ff_er_add_slice(ERContext *s, int startx, int starty, int endx, int endy, int status)
Add a slice.
void ff_init_block_index(MpegEncContext *s)
static void decode_subblock(int16_t *dst, int flags, const int is_block2, GetBitContext *gb, const VLCElem *vlc, int q)
Decode 2x2 subblock of coefficients.
static int rv34_set_deblock_coef(RV34DecContext *r)
#define MB_TYPE_INTRA16x16
int ff_set_dimensions(AVCodecContext *s, int width, int height)
Check that the provided frame dimensions are valid and set them on the codec context.
static int init_get_bits(GetBitContext *s, const uint8_t *buffer, int bit_size)
Initialize GetBitContext.
uint32_t * mb_type
types and macros are defined in mpegutils.h
static const uint8_t avail_indexes[4]
availability index for subblocks
int16_t(*[2] motion_val)[2]
static unsigned int get_bits(GetBitContext *s, int n)
Read 1-25 bits.
static int adjust_pred16(int itype, int up, int left)
uint8_t ptrdiff_t const uint8_t ptrdiff_t int intptr_t mx
@ RV34_MB_B_FORWARD
B-frame macroblock, forward prediction.
static int rv34_decoder_alloc(RV34DecContext *r)
enum AVDiscard skip_frame
Skip decoding for selected frames.
static void rv34_pred_mv(RV34DecContext *r, int block_type, int subblock_no, int dmv_no)
motion vector prediction
static av_cold void rv34_gen_vlc(const uint8_t *bits, int size, const VLCElem **vlcp, int mod_three_bits_offset, int *offset)
const VLCElem * first_pattern[4]
VLCs used for decoding coefficients in the first subblock.
static int rv34_decode_block(int16_t *dst, GetBitContext *gb, const RV34VLC *rvlc, int fc, int sc, int q_dc, int q_ac1, int q_ac2)
Decode coefficients for 4x4 block.
@ RV34_MB_B_DIRECT
Bidirectionally predicted B-frame macroblock, no motion vectors.
static double val(void *priv, double ch)
it s the only field you need to keep assuming you have a context There is some magic you don t need to care about around this just let it vf type
static const uint8_t rv34_count_ones[16]
number of ones in nibble minus one
static const uint8_t rv34_table_intra_firstpat[NUM_INTRA_TABLES][4][FIRSTBLK_VLC_SIZE]
static const uint8_t quant[64]
s EdgeDetect Foobar g libavfilter vf_edgedetect c libavfilter vf_foobar c edit libavfilter and add an entry for foobar following the pattern of the other filters edit libavfilter allfilters and add an entry for foobar following the pattern of the other filters configure make j< whatever > ffmpeg ffmpeg i you should get a foobar png with Lena edge detected That s your new playground is ready Some little details about what s going which in turn will define variables for the build system and the C
static int ff_thread_once(char *control, void(*routine)(void))
#define AV_LOG_TRACE
Extremely verbose debugging, useful for libav* development.
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
#define FF_ARRAY_ELEMS(a)
av_cold int ff_rv34_decode_init(AVCodecContext *avctx)
Initialize decoder.
static void rv34_pred_4x4_block(RV34DecContext *r, uint8_t *dst, int stride, int itype, int up, int left, int down, int right)
Perform 4x4 intra prediction.
static int rv34_decode_intra_macroblock(RV34DecContext *r, int8_t *intra_types)
static void ZERO8x2(void *dst, int stride)
VLC tables used by the decoder.
int has_b_frames
Size of the frame reordering buffer in the decoder.
void ff_er_frame_end(ERContext *s, int *decode_error_flags)
Indicate that a frame has finished decoding and perform error concealment in case it has been enabled...
static void rv34_mc_1mv(RV34DecContext *r, const int block_type, const int xoff, const int yoff, int mv_off, const int width, const int height, int dir)
static int rv34_decode_inter_macroblock(RV34DecContext *r, int8_t *intra_types)
static RV34VLC intra_vlcs[NUM_INTRA_TABLES]
#define VERT_LEFT_PRED_RV40_NODOWN
VLC cbp[2][4]
VLCs used for coded block patterns decoding.
#define fc(width, name, range_min, range_max)
void ff_mpeg_er_frame_start(MpegEncContext *s)
static int calc_add_mv(RV34DecContext *r, int dir, int val)
Calculate motion vector component that should be added for direct blocks.
#define LOCAL_ALIGNED_16(t, v,...)
#define av_assert0(cond)
assert() equivalent, that is always enabled.
@ AV_PIX_FMT_YUV420P
planar YUV 4:2:0, 12bpp, (1 Cr & Cb sample per 2x2 Y samples)
static int finish_frame(AVCodecContext *avctx, AVFrame *pict)
static const uint16_t rv34_mb_max_sizes[6]
maximum number of macroblocks for each of the possible slice offset sizes
static void decode_coeff(int16_t *dst, int coef, int esc, GetBitContext *gb, const VLCElem *vlc, int q)
Get one coefficient value from the bitstream and store it.
uint8_t ptrdiff_t const uint8_t ptrdiff_t int intptr_t intptr_t my
void ff_mpv_unref_picture(MPVWorkPicture *pic)
const VLCElem * second_pattern[2]
VLCs used for decoding coefficients in the subblocks 2 and 3.
@ AVDISCARD_ALL
discard all
static const uint8_t rv34_inter_coeff[NUM_INTER_TABLES][COEFF_VLC_SIZE]
void ff_thread_progress_await(const ThreadProgress *pro_c, int n)
This function is a no-op in no-op mode; otherwise it waits until other threads have reached a certain...
int ff_mpv_export_qp_table(const MpegEncContext *s, AVFrame *f, const MPVPicture *p, int qp_type)
const VLCElem * cbppattern[2]
VLCs used for pattern of coded block patterns decoding.
#define GET_PTS_DIFF(a, b)
static int rv34_decode_slice(RV34DecContext *r, int end, const uint8_t *buf, int buf_size)
static av_cold void rv34_init_tables(void)
Initialize all tables.
@ RV34_MB_SKIP
Skipped block.
Rational number (pair of numerator and denominator).
av_cold int ff_mpv_decode_close(AVCodecContext *avctx)
static const uint8_t rv34_table_intra_cbppat[NUM_INTRA_TABLES][2][CBPPAT_VLC_SIZE]
const VLCElem * third_pattern[2]
VLCs used for decoding coefficients in the last subblock.
int type
slice type (intra, inter)
static void decode_subblock3(int16_t *dst, int flags, GetBitContext *gb, const VLCElem *vlc, int q_dc, int q_ac1, int q_ac2)
@ AV_PICTURE_TYPE_I
Intra.
static unsigned int get_bits1(GetBitContext *s)
static const uint8_t rv34_table_intra_secondpat[NUM_INTRA_TABLES][2][OTHERBLK_VLC_SIZE]
static av_always_inline int get_vlc2(GetBitContext *s, const VLCElem *table, int bits, int max_depth)
Parse a vlc code.
#define FF_MPV_QSCALE_TYPE_MPEG1
static int rv34_decode_mv(RV34DecContext *r, int block_type)
Decode motion vector differences and perform motion vector reconstruction and motion compensation.
void(* qpel_mc_func)(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
@ RV34_MB_P_8x8
P-frame macroblock, 8x8 motion compensation partitions.
static const uint8_t rv34_table_intra_thirdpat[NUM_INTRA_TABLES][2][OTHERBLK_VLC_SIZE]
static av_cold void rv34_gen_vlc_ext(const uint8_t *bits, int size, VLC *vlc, const uint8_t *syms, int mod_three_bits_offset, int *offset)
Generate VLC from codeword lengths.
static void rv34_mc_2mv_skip(RV34DecContext *r)
@ AVDISCARD_NONKEY
discard all frames except keyframes
static void decode_subblock1(int16_t *dst, int flags, GetBitContext *gb, const VLCElem *vlc, int q)
Decode a single coefficient.
static const uint8_t rv34_cbp_code[16]
values used to reconstruct coded block pattern
static int is_mv_diff_gt_3(int16_t(*motion_val)[2], int step)
Tag MUST be and< 10hcoeff half pel interpolation filter coefficients, hcoeff[0] are the 2 middle coefficients[1] are the next outer ones and so on, resulting in a filter like:...eff[2], hcoeff[1], hcoeff[0], hcoeff[0], hcoeff[1], hcoeff[2] ... the sign of the coefficients is not explicitly stored but alternates after each coeff and coeff[0] is positive, so ...,+,-,+,-,+,+,-,+,-,+,... hcoeff[0] is not explicitly stored but found by subtracting the sum of all stored coefficients with signs from 32 hcoeff[0]=32 - hcoeff[1] - hcoeff[2] - ... a good choice for hcoeff and htaps is htaps=6 hcoeff={40,-10, 2} an alternative which requires more computations at both encoder and decoder side and may or may not be better is htaps=8 hcoeff={42,-14, 6,-2}ref_frames minimum of the number of available reference frames and max_ref_frames for example the first frame after a key frame always has ref_frames=1spatial_decomposition_type wavelet type 0 is a 9/7 symmetric compact integer wavelet 1 is a 5/3 symmetric compact integer wavelet others are reserved stored as delta from last, last is reset to 0 if always_reset||keyframeqlog quality(logarithmic quantizer scale) stored as delta from last, last is reset to 0 if always_reset||keyframemv_scale stored as delta from last, last is reset to 0 if always_reset||keyframe FIXME check that everything works fine if this changes between framesqbias dequantization bias stored as delta from last, last is reset to 0 if always_reset||keyframeblock_max_depth maximum depth of the block tree stored as delta from last, last is reset to 0 if always_reset||keyframequant_table quantization tableHighlevel bitstream structure:==============================--------------------------------------------|Header|--------------------------------------------|------------------------------------|||Block0||||split?||||yes no||||......... intra?||||:Block01 :yes no||||:Block02 :....... ..........||||:Block03 ::y DC ::ref index:||||:Block04 ::cb DC ::motion x :||||......... :cr DC ::motion y :||||....... ..........|||------------------------------------||------------------------------------|||Block1|||...|--------------------------------------------|------------ ------------ ------------|||Y subbands||Cb subbands||Cr subbands||||--- ---||--- ---||--- ---|||||LL0||HL0||||LL0||HL0||||LL0||HL0|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||LH0||HH0||||LH0||HH0||||LH0||HH0|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||HL1||LH1||||HL1||LH1||||HL1||LH1|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||HH1||HL2||||HH1||HL2||||HH1||HL2|||||...||...||...|||------------ ------------ ------------|--------------------------------------------Decoding process:=================------------|||Subbands|------------||||------------|Intra DC||||LL0 subband prediction ------------|\ Dequantization ------------------- \||Reference frames|\ IDWT|------- -------|Motion \|||Frame 0||Frame 1||Compensation . OBMC v -------|------- -------|--------------. \------> Frame n output Frame Frame<----------------------------------/|...|------------------- Range Coder:============Binary Range Coder:------------------- The implemented range coder is an adapted version based upon "Range encoding: an algorithm for removing redundancy from a digitised message." by G. N. N. Martin. The symbols encoded by the Snow range coder are bits(0|1). The associated probabilities are not fix but change depending on the symbol mix seen so far. bit seen|new state ---------+----------------------------------------------- 0|256 - state_transition_table[256 - old_state];1|state_transition_table[old_state];state_transition_table={ 0, 0, 0, 0, 0, 0, 0, 0, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 190, 191, 192, 194, 194, 195, 196, 197, 198, 199, 200, 201, 202, 202, 204, 205, 206, 207, 208, 209, 209, 210, 211, 212, 213, 215, 215, 216, 217, 218, 219, 220, 220, 222, 223, 224, 225, 226, 227, 227, 229, 229, 230, 231, 232, 234, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 248, 0, 0, 0, 0, 0, 0, 0};FIXME Range Coding of integers:------------------------- FIXME Neighboring Blocks:===================left and top are set to the respective blocks unless they are outside of the image in which case they are set to the Null block top-left is set to the top left block unless it is outside of the image in which case it is set to the left block if this block has no larger parent block or it is at the left side of its parent block and the top right block is not outside of the image then the top right block is used for top-right else the top-left block is used Null block y, cb, cr are 128 level, ref, mx and my are 0 Motion Vector Prediction:=========================1. the motion vectors of all the neighboring blocks are scaled to compensate for the difference of reference frames scaled_mv=(mv *(256 *(current_reference+1)/(mv.reference+1))+128)> the median of the scaled top and top right vectors is used as motion vector prediction the used motion vector is the sum of the predictor and(mvx_diff, mvy_diff) *mv_scale Intra DC Prediction block[y][x] dc[1]
int av_frame_ref(AVFrame *dst, const AVFrame *src)
Set up a new reference to the data described by the source frame.
@ RV34_MB_B_BACKWARD
B-frame macroblock, backward prediction.
int ff_rv34_decode_frame(AVCodecContext *avctx, AVFrame *pict, int *got_picture_ptr, AVPacket *avpkt)
uint8_t ptrdiff_t const uint8_t ptrdiff_t int intptr_t intptr_t int int16_t * dst
#define i(width, name, range_min, range_max)
static AVRational update_sar(int old_w, int old_h, AVRational sar, int new_w, int new_h)
#define FIRSTBLK_VLC_SIZE
static int get_interleaved_se_golomb(GetBitContext *gb)
@ RV34_MB_P_8x16
P-frame macroblock, 8x16 motion compensation partitions.
static int rv34_decode_cbp(GetBitContext *gb, const RV34VLC *vlc, int table)
Decode coded block pattern.
uint64_t_TMPL AV_WL64 unsigned int_TMPL AV_WL32 unsigned int_TMPL AV_WL24 unsigned int_TMPL AV_WL16 uint64_t_TMPL AV_WB64 unsigned int_TMPL AV_RB32
static const uint8_t rv34_inter_cbppat[NUM_INTER_TABLES][CBPPAT_VLC_SIZE]
int ff_mpv_frame_start(MpegEncContext *s, AVCodecContext *avctx)
generic function called after decoding the header and before a frame is decoded.
it s the only field you need to keep assuming you have a context There is some magic you don t need to care about around this just let it vf offset
#define OTHERBLK_VLC_SIZE
int ff_vlc_init_sparse(VLC *vlc, int nb_bits, int nb_codes, const void *bits, int bits_wrap, int bits_size, const void *codes, int codes_wrap, int codes_size, const void *symbols, int symbols_wrap, int symbols_size, int flags)
Build VLC decoding tables suitable for use with get_vlc2().
static void rv34_output_i16x16(RV34DecContext *r, int8_t *intra_types, int cbp)
@ RV34_MB_TYPE_INTRA16x16
Intra macroblock with DCs in a separate 4x4 block.
#define AV_LOG_INFO
Standard information.
static void rv34_pred_mv_b(RV34DecContext *r, int block_type, int dir)
motion vector prediction for B-frames
#define FF_THREAD_FRAME
Decode more than one frame at once.
static const uint8_t rv34_table_inter_thirdpat[NUM_INTER_TABLES][2][OTHERBLK_VLC_SIZE]
#define DIAG_DOWN_LEFT_PRED_RV40_NODOWN
void ff_print_debug_info(const MpegEncContext *s, const MPVPicture *p, AVFrame *pict)
#define av_assert2(cond)
assert() equivalent, that does lie in speed critical code.
static const uint8_t part_sizes_h[RV34_MB_TYPES]
macroblock partition height in 8x8 blocks
and forward the test the status of outputs and forward it to the corresponding return FFERROR_NOT_READY If the filters stores internally one or a few frame for some it can consider them to be part of the FIFO and delay acknowledging a status change accordingly Example code
static unsigned int show_bits(GetBitContext *s, int n)
Show 1-25 bits.
static const uint8_t rv34_table_inter_firstpat[NUM_INTER_TABLES][2][FIRSTBLK_VLC_SIZE]
#define HOR_UP_PRED_RV40_NODOWN
static void rv34_mc_2mv(RV34DecContext *r, const int block_type)
#define av_assert1(cond)
assert() equivalent, that does not lie in speed critical code.
static const uint8_t rv34_table_intra_cbp[NUM_INTRA_TABLES][8][CBP_VLC_SIZE]
#define MB_TYPE_BACKWARD_MV
@ RV34_MB_TYPE_INTRA
Intra macroblock.
static VLCElem table_data[117592]
static const uint8_t rv34_quant_to_vlc_set[2][32]
tables used to translate a quantizer value into a VLC set for decoding The first table is used for in...
essential slice information
enum AVPixelFormat pix_fmt
Pixel format, see AV_PIX_FMT_xxx.
static int get_slice_offset(AVCodecContext *avctx, const uint8_t *buf, int n, int slice_count, int buf_size)
static int mod(int a, int b)
Modulo operation with only positive remainders.
const VLCElem * coefficient
VLCs used for decoding big coefficients.
static void rv4_weight(RV34DecContext *r)
the pkt_dts and pkt_pts fields in AVFrame will work as usual Restrictions on codec whose streams don t reset across will not work because their bitstreams cannot be decoded in parallel *The contents of buffers must not be read before as well as code calling up to before the decode process starts Call ff_thread_finish_setup() afterwards. If some code can 't be moved
Tag MUST be and< 10hcoeff half pel interpolation filter coefficients, hcoeff[0] are the 2 middle coefficients[1] are the next outer ones and so on, resulting in a filter like:...eff[2], hcoeff[1], hcoeff[0], hcoeff[0], hcoeff[1], hcoeff[2] ... the sign of the coefficients is not explicitly stored but alternates after each coeff and coeff[0] is positive, so ...,+,-,+,-,+,+,-,+,-,+,... hcoeff[0] is not explicitly stored but found by subtracting the sum of all stored coefficients with signs from 32 hcoeff[0]=32 - hcoeff[1] - hcoeff[2] - ... a good choice for hcoeff and htaps is htaps=6 hcoeff={40,-10, 2} an alternative which requires more computations at both encoder and decoder side and may or may not be better is htaps=8 hcoeff={42,-14, 6,-2}ref_frames minimum of the number of available reference frames and max_ref_frames for example the first frame after a key frame always has ref_frames=1spatial_decomposition_type wavelet type 0 is a 9/7 symmetric compact integer wavelet 1 is a 5/3 symmetric compact integer wavelet others are reserved stored as delta from last, last is reset to 0 if always_reset||keyframeqlog quality(logarithmic quantizer scale) stored as delta from last, last is reset to 0 if always_reset||keyframemv_scale stored as delta from last, last is reset to 0 if always_reset||keyframe FIXME check that everything works fine if this changes between framesqbias dequantization bias stored as delta from last, last is reset to 0 if always_reset||keyframeblock_max_depth maximum depth of the block tree stored as delta from last, last is reset to 0 if always_reset||keyframequant_table quantization tableHighlevel bitstream structure:==============================--------------------------------------------|Header|--------------------------------------------|------------------------------------|||Block0||||split?||||yes no||||......... intra?||||:Block01 :yes no||||:Block02 :....... ..........||||:Block03 ::y DC ::ref index:||||:Block04 ::cb DC ::motion x :||||......... :cr DC ::motion y :||||....... ..........|||------------------------------------||------------------------------------|||Block1|||...|--------------------------------------------|------------ ------------ ------------|||Y subbands||Cb subbands||Cr subbands||||--- ---||--- ---||--- ---|||||LL0||HL0||||LL0||HL0||||LL0||HL0|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||LH0||HH0||||LH0||HH0||||LH0||HH0|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||HL1||LH1||||HL1||LH1||||HL1||LH1|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||HH1||HL2||||HH1||HL2||||HH1||HL2|||||...||...||...|||------------ ------------ ------------|--------------------------------------------Decoding process:=================------------|||Subbands|------------||||------------|Intra DC||||LL0 subband prediction ------------|\ Dequantization ------------------- \||Reference frames|\ IDWT|------- -------|Motion \|||Frame 0||Frame 1||Compensation . OBMC v -------|------- -------|--------------. \------> Frame n output Frame Frame<----------------------------------/|...|------------------- Range Coder:============Binary Range Coder:------------------- The implemented range coder is an adapted version based upon "Range encoding: an algorithm for removing redundancy from a digitised message." by G. N. N. Martin. The symbols encoded by the Snow range coder are bits(0|1). The associated probabilities are not fix but change depending on the symbol mix seen so far. bit seen|new state ---------+----------------------------------------------- 0|256 - state_transition_table[256 - old_state];1|state_transition_table[old_state];state_transition_table={ 0, 0, 0, 0, 0, 0, 0, 0, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 190, 191, 192, 194, 194, 195, 196, 197, 198, 199, 200, 201, 202, 202, 204, 205, 206, 207, 208, 209, 209, 210, 211, 212, 213, 215, 215, 216, 217, 218, 219, 220, 220, 222, 223, 224, 225, 226, 227, 227, 229, 229, 230, 231, 232, 234, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 248, 0, 0, 0, 0, 0, 0, 0};FIXME Range Coding of integers:------------------------- FIXME Neighboring Blocks:===================left and top are set to the respective blocks unless they are outside of the image in which case they are set to the Null block top-left is set to the top left block unless it is outside of the image in which case it is set to the left block if this block has no larger parent block or it is at the left side of its parent block and the top right block is not outside of the image then the top right block is used for top-right else the top-left block is used Null block y, cb, cr are 128 level, ref, mx and my are 0 Motion Vector Prediction:=========================1. the motion vectors of all the neighboring blocks are scaled to compensate for the difference of reference frames scaled_mv=(mv *(256 *(current_reference+1)/(mv.reference+1))+128)> the median of the scaled left
uint64_t_TMPL AV_WL64 unsigned int_TMPL AV_RL32
static const uint8_t rv34_inter_cbp[NUM_INTER_TABLES][4][CBP_VLC_SIZE]
int ff_mpeg_update_thread_context(AVCodecContext *dst, const AVCodecContext *src)
update_thread_context for mpegvideo-based decoders.
main external API structure.
#define VLC_INIT_STATIC_OVERLONG
static int rv34_decode_inter_mb_header(RV34DecContext *r, int8_t *intra_types)
Decode inter macroblock header and return CBP in case of success, -1 otherwise.
av_cold void ff_h264_pred_init(H264PredContext *h, int codec_id, const int bit_depth, int chroma_format_idc)
Set the intra prediction function pointers.
@ AV_PICTURE_TYPE_B
Bi-dir predicted.
static const uint8_t rv34_intra_coeff[NUM_INTRA_TABLES][COEFF_VLC_SIZE]
static const uint8_t part_sizes_w[RV34_MB_TYPES]
macroblock partition width in 8x8 blocks
static const int ittrans[9]
mapping of RV30/40 intra prediction types to standard H.264 types
static void fill_rectangle(int x, int y, int w, int h)
static const uint8_t rv34_chroma_quant[2][32]
quantizer values used for AC and DC coefficients in chroma blocks
void ff_mpv_frame_end(MpegEncContext *s)
static int rv34_decode_intra_mb_header(RV34DecContext *r, int8_t *intra_types)
Decode intra macroblock header and return CBP in case of success, -1 otherwise.
static const uint8_t rv34_mb_bits_sizes[6]
bits needed to code the slice offset for the given size
IDirect3DDxgiInterfaceAccess _COM_Outptr_ void ** p
static void rv34_process_block(RV34DecContext *r, uint8_t *pdst, int stride, int fc, int sc, int q_dc, int q_ac)
AVRational av_mul_q(AVRational b, AVRational c)
Multiply two rationals.
@ RV34_MB_P_MIX16x16
P-frame macroblock with DCs in a separate 4x4 block, one motion vector.
@ AV_PICTURE_TYPE_P
Predicted.
static void rv34_mc(RV34DecContext *r, const int block_type, const int xoff, const int yoff, int mv_off, const int width, const int height, int dir, const int thirdpel, int weighted, qpel_mc_func(*qpel_mc)[16], h264_chroma_mc_func(*chroma_mc))
generic motion compensation function
#define MB_TYPE_SEPARATE_DC
@ RV34_MB_P_16x8
P-frame macroblock, 16x8 motion compensation partitions.
This structure stores compressed data.
static RV34VLC inter_vlcs[NUM_INTER_TABLES]
@ RV34_MB_P_16x16
P-frame macroblock, one motion frame.
static RV34VLC * choose_vlc_set(int quant, int mod, int type)
Select VLC set for decoding from current quantizer, modifier and frame type.
static const double coeff[2][5]
#define AVERROR_INVALIDDATA
Invalid data found when processing input.
@ RV34_MB_B_BIDIR
Bidirectionally predicted B-frame macroblock, two motion vectors.
static const uint8_t modulo_three_table[108]
precalculated results of division by three and modulo three for values 0-107
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...
@ AVDISCARD_NONREF
discard all non reference
#define MB_TYPE_FORWARD_MV
static void rv34_decoder_free(RV34DecContext *r)
av_cold int ff_mpv_common_frame_size_change(MpegEncContext *s)
static const uint8_t shifts[2][12]
static void rv34_pred_b_vector(int A[2], int B[2], int C[2], int A_avail, int B_avail, int C_avail, int *mx, int *my)
Predict motion vector for B-frame macroblock.