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 Libav.
10 * Libav 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 * Libav 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 Libav; 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];
144 // if(s->pict_type==AV_PICTURE_TYPE_B && !s->readable) return;
150 if (!IS_SKIP(s->current_picture.mb_type[xy])) {
152 s->h263dsp.h263_v_loop_filter(dest_y + 8 * linesize, linesize, qp_c);
153 s->h263dsp.h263_v_loop_filter(dest_y + 8 * linesize + 8, linesize, qp_c);
158 int qp_dt, qp_tt, qp_tc;
160 if (IS_SKIP(s->current_picture.mb_type[xy - s->mb_stride]))
163 qp_tt = s->current_picture.qscale_table[xy - s->mb_stride];
171 const int chroma_qp= s->chroma_qscale_table[qp_tc];
172 s->h263dsp.h263_v_loop_filter(dest_y, linesize, qp_tc);
173 s->h263dsp.h263_v_loop_filter(dest_y + 8, linesize, qp_tc);
175 s->h263dsp.h263_v_loop_filter(dest_cb, uvlinesize, chroma_qp);
176 s->h263dsp.h263_v_loop_filter(dest_cr, uvlinesize, chroma_qp);
180 s->h263dsp.h263_h_loop_filter(dest_y - 8 * linesize + 8, linesize, qp_tt);
183 if (qp_tt || IS_SKIP(s->current_picture.mb_type[xy - 1 - s->mb_stride]))
186 qp_dt = s->current_picture.qscale_table[xy - 1 - s->mb_stride];
189 const int chroma_qp= s->chroma_qscale_table[qp_dt];
190 s->h263dsp.h263_h_loop_filter(dest_y - 8 * linesize, linesize, qp_dt);
191 s->h263dsp.h263_h_loop_filter(dest_cb - 8 * uvlinesize, uvlinesize, chroma_qp);
192 s->h263dsp.h263_h_loop_filter(dest_cr - 8 * uvlinesize, uvlinesize, chroma_qp);
198 s->h263dsp.h263_h_loop_filter(dest_y + 8, linesize, qp_c);
199 if(s->mb_y + 1 == s->mb_height)
200 s->h263dsp.h263_h_loop_filter(dest_y + 8 * linesize + 8, linesize, qp_c);
205 if (qp_c || IS_SKIP(s->current_picture.mb_type[xy - 1]))
208 qp_lc = s->current_picture.qscale_table[xy - 1];
211 s->h263dsp.h263_h_loop_filter(dest_y, linesize, qp_lc);
212 if(s->mb_y + 1 == s->mb_height){
213 const int chroma_qp= s->chroma_qscale_table[qp_lc];
214 s->h263dsp.h263_h_loop_filter(dest_y + 8 * linesize, linesize, qp_lc);
215 s->h263dsp.h263_h_loop_filter(dest_cb, uvlinesize, chroma_qp);
216 s->h263dsp.h263_h_loop_filter(dest_cr, uvlinesize, chroma_qp);
222 void ff_h263_pred_acdc(MpegEncContext * s, int16_t *block, int n)
224 int x, y, wrap, a, c, pred_dc, scale, i;
225 int16_t *dc_val, *ac_val, *ac_val1;
227 /* find prediction */
229 x = 2 * s->mb_x + (n & 1);
230 y = 2 * s->mb_y + (n>> 1);
232 dc_val = s->dc_val[0];
233 ac_val = s->ac_val[0][0];
234 scale = s->y_dc_scale;
239 dc_val = s->dc_val[n - 4 + 1];
240 ac_val = s->ac_val[n - 4 + 1][0];
241 scale = s->c_dc_scale;
244 ac_val += ((y) * wrap + (x)) * 16;
250 a = dc_val[(x - 1) + (y) * wrap];
251 c = dc_val[(x) + (y - 1) * wrap];
253 /* No prediction outside GOB boundary */
254 if(s->first_slice_line && n!=3){
256 if(n!=1 && s->mb_x == s->resync_mb_x) a= 1024;
261 if (s->h263_aic_dir) {
262 /* left prediction */
266 block[s->idsp.idct_permutation[i << 3]] += ac_val[i];
275 block[s->idsp.idct_permutation[i]] += ac_val[i + 8];
281 /* just DC prediction */
282 if (a != 1024 && c != 1024)
283 pred_dc = (a + c) >> 1;
290 /* we assume pred is positive */
291 block[0]=block[0]*scale + pred_dc;
298 /* Update AC/DC tables */
299 dc_val[(x) + (y) * wrap] = block[0];
303 ac_val1[i] = block[s->idsp.idct_permutation[i << 3]];
306 ac_val1[8 + i] = block[s->idsp.idct_permutation[i]];
309 int16_t *ff_h263_pred_motion(MpegEncContext * s, int block, int dir,
313 int16_t *A, *B, *C, (*mot_val)[2];
314 static const int off[4]= {2, 1, 1, -1};
317 mot_val = s->current_picture.motion_val[dir] + s->block_index[block];
320 /* special case for first (slice) line */
321 if (s->first_slice_line && block<3) {
322 // we can't just change some MVs to simulate that as we need them for the B-frames (and ME)
323 // and if we ever support non rectangular objects than we need to do a few ifs here anyway :(
324 if(block==0){ //most common case
325 if(s->mb_x == s->resync_mb_x){ //rare
327 }else if(s->mb_x + 1 == s->resync_mb_x && s->h263_pred){ //rare
328 C = mot_val[off[block] - wrap];
333 *px = mid_pred(A[0], 0, C[0]);
334 *py = mid_pred(A[1], 0, C[1]);
341 if(s->mb_x + 1 == s->resync_mb_x && s->h263_pred){ //rare
342 C = mot_val[off[block] - wrap];
343 *px = mid_pred(A[0], 0, C[0]);
344 *py = mid_pred(A[1], 0, C[1]);
350 B = mot_val[ - wrap];
351 C = mot_val[off[block] - wrap];
352 if(s->mb_x == s->resync_mb_x) //rare
355 *px = mid_pred(A[0], B[0], C[0]);
356 *py = mid_pred(A[1], B[1], C[1]);
359 B = mot_val[ - wrap];
360 C = mot_val[off[block] - wrap];
361 *px = mid_pred(A[0], B[0], C[0]);
362 *py = mid_pred(A[1], B[1], C[1]);