2 * H263/MPEG4 backend for encoder and decoder
3 * Copyright (c) 2000,2001 Fabrice Bellard
5 * Copyright (c) 2001 Juan J. Sierralta P
6 * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
8 * This file is part of FFmpeg.
10 * FFmpeg is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU Lesser General Public
12 * License as published by the Free Software Foundation; either
13 * version 2.1 of the License, or (at your option) any later version.
15 * FFmpeg is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * Lesser General Public License for more details.
20 * You should have received a copy of the GNU Lesser General Public
21 * License along with FFmpeg; if not, write to the Free Software
22 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
33 #include "mpegvideo.h"
37 #include "mpegutils.h"
40 #include "mpeg4video.h"
43 void ff_h263_update_motion_val(MpegEncContext * s){
44 const int mb_xy = s->mb_y * s->mb_stride + s->mb_x;
45 //FIXME a lot of that is only needed for !low_delay
46 const int wrap = s->b8_stride;
47 const int xy = s->block_index[0];
49 s->current_picture.mbskip_table[mb_xy] = s->mb_skipped;
51 if(s->mv_type != MV_TYPE_8X8){
52 int motion_x, motion_y;
56 } else if (s->mv_type == MV_TYPE_16X16) {
57 motion_x = s->mv[0][0][0];
58 motion_y = s->mv[0][0][1];
59 } else /*if (s->mv_type == MV_TYPE_FIELD)*/ {
61 motion_x = s->mv[0][0][0] + s->mv[0][1][0];
62 motion_y = s->mv[0][0][1] + s->mv[0][1][1];
63 motion_x = (motion_x>>1) | (motion_x&1);
65 s->p_field_mv_table[i][0][mb_xy][0]= s->mv[0][i][0];
66 s->p_field_mv_table[i][0][mb_xy][1]= s->mv[0][i][1];
68 s->current_picture.ref_index[0][4*mb_xy ] =
69 s->current_picture.ref_index[0][4*mb_xy + 1] = s->field_select[0][0];
70 s->current_picture.ref_index[0][4*mb_xy + 2] =
71 s->current_picture.ref_index[0][4*mb_xy + 3] = s->field_select[0][1];
74 /* no update if 8X8 because it has been done during parsing */
75 s->current_picture.motion_val[0][xy][0] = motion_x;
76 s->current_picture.motion_val[0][xy][1] = motion_y;
77 s->current_picture.motion_val[0][xy + 1][0] = motion_x;
78 s->current_picture.motion_val[0][xy + 1][1] = motion_y;
79 s->current_picture.motion_val[0][xy + wrap][0] = motion_x;
80 s->current_picture.motion_val[0][xy + wrap][1] = motion_y;
81 s->current_picture.motion_val[0][xy + 1 + wrap][0] = motion_x;
82 s->current_picture.motion_val[0][xy + 1 + wrap][1] = motion_y;
85 if(s->encoding){ //FIXME encoding MUST be cleaned up
86 if (s->mv_type == MV_TYPE_8X8)
87 s->current_picture.mb_type[mb_xy] = MB_TYPE_L0 | MB_TYPE_8x8;
89 s->current_picture.mb_type[mb_xy] = MB_TYPE_INTRA;
91 s->current_picture.mb_type[mb_xy] = MB_TYPE_L0 | MB_TYPE_16x16;
95 int ff_h263_pred_dc(MpegEncContext * s, int n, int16_t **dc_val_ptr)
97 int x, y, wrap, a, c, pred_dc;
100 /* find prediction */
102 x = 2 * s->mb_x + (n & 1);
103 y = 2 * s->mb_y + ((n & 2) >> 1);
105 dc_val = s->dc_val[0];
110 dc_val = s->dc_val[n - 4 + 1];
115 a = dc_val[(x - 1) + (y) * wrap];
116 c = dc_val[(x) + (y - 1) * wrap];
118 /* No prediction outside GOB boundary */
119 if(s->first_slice_line && n!=3){
121 if(n!=1 && s->mb_x == s->resync_mb_x) a= 1024;
123 /* just DC prediction */
124 if (a != 1024 && c != 1024)
125 pred_dc = (a + c) >> 1;
131 /* we assume pred is positive */
132 *dc_val_ptr = &dc_val[x + y * wrap];
136 void ff_h263_loop_filter(MpegEncContext * s){
138 const int linesize = s->linesize;
139 const int uvlinesize= s->uvlinesize;
140 const int xy = s->mb_y * s->mb_stride + s->mb_x;
141 uint8_t *dest_y = s->dest[0];
142 uint8_t *dest_cb= s->dest[1];
143 uint8_t *dest_cr= s->dest[2];
145 // if(s->pict_type==AV_PICTURE_TYPE_B && !s->readable) return;
151 if (!IS_SKIP(s->current_picture.mb_type[xy])) {
153 s->h263dsp.h263_v_loop_filter(dest_y + 8 * linesize, linesize, qp_c);
154 s->h263dsp.h263_v_loop_filter(dest_y + 8 * linesize + 8, linesize, qp_c);
159 int qp_dt, qp_tt, qp_tc;
161 if (IS_SKIP(s->current_picture.mb_type[xy - s->mb_stride]))
164 qp_tt = s->current_picture.qscale_table[xy - s->mb_stride];
172 const int chroma_qp= s->chroma_qscale_table[qp_tc];
173 s->h263dsp.h263_v_loop_filter(dest_y, linesize, qp_tc);
174 s->h263dsp.h263_v_loop_filter(dest_y + 8, linesize, qp_tc);
176 s->h263dsp.h263_v_loop_filter(dest_cb, uvlinesize, chroma_qp);
177 s->h263dsp.h263_v_loop_filter(dest_cr, uvlinesize, chroma_qp);
181 s->h263dsp.h263_h_loop_filter(dest_y - 8 * linesize + 8, linesize, qp_tt);
184 if (qp_tt || IS_SKIP(s->current_picture.mb_type[xy - 1 - s->mb_stride]))
187 qp_dt = s->current_picture.qscale_table[xy - 1 - s->mb_stride];
190 const int chroma_qp= s->chroma_qscale_table[qp_dt];
191 s->h263dsp.h263_h_loop_filter(dest_y - 8 * linesize, linesize, qp_dt);
192 s->h263dsp.h263_h_loop_filter(dest_cb - 8 * uvlinesize, uvlinesize, chroma_qp);
193 s->h263dsp.h263_h_loop_filter(dest_cr - 8 * uvlinesize, uvlinesize, chroma_qp);
199 s->h263dsp.h263_h_loop_filter(dest_y + 8, linesize, qp_c);
200 if(s->mb_y + 1 == s->mb_height)
201 s->h263dsp.h263_h_loop_filter(dest_y + 8 * linesize + 8, linesize, qp_c);
206 if (qp_c || IS_SKIP(s->current_picture.mb_type[xy - 1]))
209 qp_lc = s->current_picture.qscale_table[xy - 1];
212 s->h263dsp.h263_h_loop_filter(dest_y, linesize, qp_lc);
213 if(s->mb_y + 1 == s->mb_height){
214 const int chroma_qp= s->chroma_qscale_table[qp_lc];
215 s->h263dsp.h263_h_loop_filter(dest_y + 8 * linesize, linesize, qp_lc);
216 s->h263dsp.h263_h_loop_filter(dest_cb, uvlinesize, chroma_qp);
217 s->h263dsp.h263_h_loop_filter(dest_cr, uvlinesize, chroma_qp);
223 void ff_h263_pred_acdc(MpegEncContext * s, int16_t *block, int n)
225 int x, y, wrap, a, c, pred_dc, scale, i;
226 int16_t *dc_val, *ac_val, *ac_val1;
228 /* find prediction */
230 x = 2 * s->mb_x + (n & 1);
231 y = 2 * s->mb_y + (n>> 1);
233 dc_val = s->dc_val[0];
234 ac_val = s->ac_val[0][0];
235 scale = s->y_dc_scale;
240 dc_val = s->dc_val[n - 4 + 1];
241 ac_val = s->ac_val[n - 4 + 1][0];
242 scale = s->c_dc_scale;
245 ac_val += ((y) * wrap + (x)) * 16;
251 a = dc_val[(x - 1) + (y) * wrap];
252 c = dc_val[(x) + (y - 1) * wrap];
254 /* No prediction outside GOB boundary */
255 if(s->first_slice_line && n!=3){
257 if(n!=1 && s->mb_x == s->resync_mb_x) a= 1024;
262 if (s->h263_aic_dir) {
263 /* left prediction */
267 block[s->idsp.idct_permutation[i << 3]] += ac_val[i];
276 block[s->idsp.idct_permutation[i]] += ac_val[i + 8];
282 /* just DC prediction */
283 if (a != 1024 && c != 1024)
284 pred_dc = (a + c) >> 1;
291 /* we assume pred is positive */
292 block[0]=block[0]*scale + pred_dc;
299 /* Update AC/DC tables */
300 dc_val[(x) + (y) * wrap] = block[0];
304 ac_val1[i] = block[s->idsp.idct_permutation[i << 3]];
307 ac_val1[8 + i] = block[s->idsp.idct_permutation[i]];
310 int16_t *ff_h263_pred_motion(MpegEncContext * s, int block, int dir,
314 int16_t *A, *B, *C, (*mot_val)[2];
315 static const int off[4]= {2, 1, 1, -1};
318 mot_val = s->current_picture.motion_val[dir] + s->block_index[block];
321 /* special case for first (slice) line */
322 if (s->first_slice_line && block<3) {
323 // we can't just change some MVs to simulate that as we need them for the B frames (and ME)
324 // and if we ever support non rectangular objects than we need to do a few ifs here anyway :(
325 if(block==0){ //most common case
326 if(s->mb_x == s->resync_mb_x){ //rare
328 }else if(s->mb_x + 1 == s->resync_mb_x && s->h263_pred){ //rare
329 C = mot_val[off[block] - wrap];
334 *px = mid_pred(A[0], 0, C[0]);
335 *py = mid_pred(A[1], 0, C[1]);
342 if(s->mb_x + 1 == s->resync_mb_x && s->h263_pred){ //rare
343 C = mot_val[off[block] - wrap];
344 *px = mid_pred(A[0], 0, C[0]);
345 *py = mid_pred(A[1], 0, C[1]);
351 B = mot_val[ - wrap];
352 C = mot_val[off[block] - wrap];
353 if(s->mb_x == s->resync_mb_x) //rare
356 *px = mid_pred(A[0], B[0], C[0]);
357 *py = mid_pred(A[1], B[1], C[1]);
360 B = mot_val[ - wrap];
361 C = mot_val[off[block] - wrap];
362 *px = mid_pred(A[0], B[0], C[0]);
363 *py = mid_pred(A[1], B[1], C[1]);