2 * H.263/MPEG-4 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"
39 #include "mpeg4video.h"
42 void ff_h263_update_motion_val(MpegEncContext * s){
43 const int mb_xy = s->mb_y * s->mb_stride + s->mb_x;
44 //FIXME a lot of that is only needed for !low_delay
45 const int wrap = s->b8_stride;
46 const int xy = s->block_index[0];
48 s->current_picture.mbskip_table[mb_xy] = s->mb_skipped;
50 if(s->mv_type != MV_TYPE_8X8){
51 int motion_x, motion_y;
55 } else if (s->mv_type == MV_TYPE_16X16) {
56 motion_x = s->mv[0][0][0];
57 motion_y = s->mv[0][0][1];
58 } else /*if (s->mv_type == MV_TYPE_FIELD)*/ {
60 motion_x = s->mv[0][0][0] + s->mv[0][1][0];
61 motion_y = s->mv[0][0][1] + s->mv[0][1][1];
62 motion_x = (motion_x>>1) | (motion_x&1);
64 s->p_field_mv_table[i][0][mb_xy][0]= s->mv[0][i][0];
65 s->p_field_mv_table[i][0][mb_xy][1]= s->mv[0][i][1];
67 s->current_picture.ref_index[0][4*mb_xy ] =
68 s->current_picture.ref_index[0][4*mb_xy + 1] = s->field_select[0][0];
69 s->current_picture.ref_index[0][4*mb_xy + 2] =
70 s->current_picture.ref_index[0][4*mb_xy + 3] = s->field_select[0][1];
73 /* no update if 8X8 because it has been done during parsing */
74 s->current_picture.motion_val[0][xy][0] = motion_x;
75 s->current_picture.motion_val[0][xy][1] = motion_y;
76 s->current_picture.motion_val[0][xy + 1][0] = motion_x;
77 s->current_picture.motion_val[0][xy + 1][1] = motion_y;
78 s->current_picture.motion_val[0][xy + wrap][0] = motion_x;
79 s->current_picture.motion_val[0][xy + wrap][1] = motion_y;
80 s->current_picture.motion_val[0][xy + 1 + wrap][0] = motion_x;
81 s->current_picture.motion_val[0][xy + 1 + wrap][1] = motion_y;
84 if(s->encoding){ //FIXME encoding MUST be cleaned up
85 if (s->mv_type == MV_TYPE_8X8)
86 s->current_picture.mb_type[mb_xy] = MB_TYPE_L0 | MB_TYPE_8x8;
88 s->current_picture.mb_type[mb_xy] = MB_TYPE_INTRA;
90 s->current_picture.mb_type[mb_xy] = MB_TYPE_L0 | MB_TYPE_16x16;
94 int ff_h263_pred_dc(MpegEncContext * s, int n, int16_t **dc_val_ptr)
96 int x, y, wrap, a, c, pred_dc;
101 x = 2 * s->mb_x + (n & 1);
102 y = 2 * s->mb_y + ((n & 2) >> 1);
104 dc_val = s->dc_val[0];
109 dc_val = s->dc_val[n - 4 + 1];
114 a = dc_val[(x - 1) + (y) * wrap];
115 c = dc_val[(x) + (y - 1) * wrap];
117 /* No prediction outside GOB boundary */
118 if(s->first_slice_line && n!=3){
120 if(n!=1 && s->mb_x == s->resync_mb_x) a= 1024;
122 /* just DC prediction */
123 if (a != 1024 && c != 1024)
124 pred_dc = (a + c) >> 1;
130 /* we assume pred is positive */
131 *dc_val_ptr = &dc_val[x + y * wrap];
135 void ff_h263_loop_filter(MpegEncContext * s){
137 const int linesize = s->linesize;
138 const int uvlinesize= s->uvlinesize;
139 const int xy = s->mb_y * s->mb_stride + s->mb_x;
140 uint8_t *dest_y = s->dest[0];
141 uint8_t *dest_cb= s->dest[1];
142 uint8_t *dest_cr= s->dest[2];
148 if (!IS_SKIP(s->current_picture.mb_type[xy])) {
150 s->h263dsp.h263_v_loop_filter(dest_y + 8 * linesize, linesize, qp_c);
151 s->h263dsp.h263_v_loop_filter(dest_y + 8 * linesize + 8, linesize, qp_c);
156 int qp_dt, qp_tt, qp_tc;
158 if (IS_SKIP(s->current_picture.mb_type[xy - s->mb_stride]))
161 qp_tt = s->current_picture.qscale_table[xy - s->mb_stride];
169 const int chroma_qp= s->chroma_qscale_table[qp_tc];
170 s->h263dsp.h263_v_loop_filter(dest_y, linesize, qp_tc);
171 s->h263dsp.h263_v_loop_filter(dest_y + 8, linesize, qp_tc);
173 s->h263dsp.h263_v_loop_filter(dest_cb, uvlinesize, chroma_qp);
174 s->h263dsp.h263_v_loop_filter(dest_cr, uvlinesize, chroma_qp);
178 s->h263dsp.h263_h_loop_filter(dest_y - 8 * linesize + 8, linesize, qp_tt);
181 if (qp_tt || IS_SKIP(s->current_picture.mb_type[xy - 1 - s->mb_stride]))
184 qp_dt = s->current_picture.qscale_table[xy - 1 - s->mb_stride];
187 const int chroma_qp= s->chroma_qscale_table[qp_dt];
188 s->h263dsp.h263_h_loop_filter(dest_y - 8 * linesize, linesize, qp_dt);
189 s->h263dsp.h263_h_loop_filter(dest_cb - 8 * uvlinesize, uvlinesize, chroma_qp);
190 s->h263dsp.h263_h_loop_filter(dest_cr - 8 * uvlinesize, uvlinesize, chroma_qp);
196 s->h263dsp.h263_h_loop_filter(dest_y + 8, linesize, qp_c);
197 if(s->mb_y + 1 == s->mb_height)
198 s->h263dsp.h263_h_loop_filter(dest_y + 8 * linesize + 8, linesize, qp_c);
203 if (qp_c || IS_SKIP(s->current_picture.mb_type[xy - 1]))
206 qp_lc = s->current_picture.qscale_table[xy - 1];
209 s->h263dsp.h263_h_loop_filter(dest_y, linesize, qp_lc);
210 if(s->mb_y + 1 == s->mb_height){
211 const int chroma_qp= s->chroma_qscale_table[qp_lc];
212 s->h263dsp.h263_h_loop_filter(dest_y + 8 * linesize, linesize, qp_lc);
213 s->h263dsp.h263_h_loop_filter(dest_cb, uvlinesize, chroma_qp);
214 s->h263dsp.h263_h_loop_filter(dest_cr, uvlinesize, chroma_qp);
220 void ff_h263_pred_acdc(MpegEncContext * s, int16_t *block, int n)
222 int x, y, wrap, a, c, pred_dc, scale, i;
223 int16_t *dc_val, *ac_val, *ac_val1;
225 /* find prediction */
227 x = 2 * s->mb_x + (n & 1);
228 y = 2 * s->mb_y + (n>> 1);
230 dc_val = s->dc_val[0];
231 ac_val = s->ac_val[0][0];
232 scale = s->y_dc_scale;
237 dc_val = s->dc_val[n - 4 + 1];
238 ac_val = s->ac_val[n - 4 + 1][0];
239 scale = s->c_dc_scale;
242 ac_val += ((y) * wrap + (x)) * 16;
248 a = dc_val[(x - 1) + (y) * wrap];
249 c = dc_val[(x) + (y - 1) * wrap];
251 /* No prediction outside GOB boundary */
252 if(s->first_slice_line && n!=3){
254 if(n!=1 && s->mb_x == s->resync_mb_x) a= 1024;
259 if (s->h263_aic_dir) {
260 /* left prediction */
264 block[s->idsp.idct_permutation[i << 3]] += ac_val[i];
273 block[s->idsp.idct_permutation[i]] += ac_val[i + 8];
279 /* just DC prediction */
280 if (a != 1024 && c != 1024)
281 pred_dc = (a + c) >> 1;
288 /* we assume pred is positive */
289 block[0]=block[0]*scale + pred_dc;
296 /* Update AC/DC tables */
297 dc_val[(x) + (y) * wrap] = block[0];
301 ac_val1[i] = block[s->idsp.idct_permutation[i << 3]];
304 ac_val1[8 + i] = block[s->idsp.idct_permutation[i]];
307 int16_t *ff_h263_pred_motion(MpegEncContext * s, int block, int dir,
311 int16_t *A, *B, *C, (*mot_val)[2];
312 static const int off[4]= {2, 1, 1, -1};
315 mot_val = s->current_picture.motion_val[dir] + s->block_index[block];
318 /* special case for first (slice) line */
319 if (s->first_slice_line && block<3) {
320 // we can't just change some MVs to simulate that as we need them for the B-frames (and ME)
321 // and if we ever support non rectangular objects than we need to do a few ifs here anyway :(
322 if(block==0){ //most common case
323 if(s->mb_x == s->resync_mb_x){ //rare
325 }else if(s->mb_x + 1 == s->resync_mb_x && s->h263_pred){ //rare
326 C = mot_val[off[block] - wrap];
331 *px = mid_pred(A[0], 0, C[0]);
332 *py = mid_pred(A[1], 0, C[1]);
339 if(s->mb_x + 1 == s->resync_mb_x && s->h263_pred){ //rare
340 C = mot_val[off[block] - wrap];
341 *px = mid_pred(A[0], 0, C[0]);
342 *py = mid_pred(A[1], 0, C[1]);
348 B = mot_val[ - wrap];
349 C = mot_val[off[block] - wrap];
350 if(s->mb_x == s->resync_mb_x) //rare
353 *px = mid_pred(A[0], B[0], C[0]);
354 *py = mid_pred(A[1], B[1], C[1]);
357 B = mot_val[ - wrap];
358 C = mot_val[off[block] - wrap];
359 *px = mid_pred(A[0], B[0], C[0]);
360 *py = mid_pred(A[1], B[1], C[1]);