Mercurial > libavcodec.hg
annotate msmpeg4.c @ 1064:b32afefe7d33 libavcodec
* UINTX -> uintx_t INTX -> intx_t
| author | kabi |
|---|---|
| date | Tue, 11 Feb 2003 16:35:48 +0000 |
| parents | fdeac9642346 |
| children | 6da5ae9ee199 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 2 * MSMPEG4 backend for ffmpeg encoder and decoder | |
| 429 | 3 * Copyright (c) 2001 Fabrice Bellard. |
| 0 | 4 * |
| 429 | 5 * This library is free software; you can redistribute it and/or |
| 6 * modify it under the terms of the GNU Lesser General Public | |
| 7 * License as published by the Free Software Foundation; either | |
| 8 * version 2 of the License, or (at your option) any later version. | |
| 0 | 9 * |
| 429 | 10 * This library is distributed in the hope that it will be useful, |
| 0 | 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 429 | 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 13 * Lesser General Public License for more details. | |
| 0 | 14 * |
| 429 | 15 * You should have received a copy of the GNU Lesser General Public |
| 16 * License along with this library; if not, write to the Free Software | |
| 17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
|
411
5c8b3a717929
workaround dc_scale bug in old ffmpeg msmpeg4v3 encoder (set workaround_bugs=1 for this)
michaelni
parents:
396
diff
changeset
|
18 * |
| 457 | 19 * msmpeg4v1 & v2 stuff by Michael Niedermayer <michaelni@gmx.at> |
| 0 | 20 */ |
|
396
fce0a2520551
removed useless header includes - use av memory functions
glantau
parents:
347
diff
changeset
|
21 #include "avcodec.h" |
| 0 | 22 #include "dsputil.h" |
| 23 #include "mpegvideo.h" | |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
24 //#define PRINT_MB |
|
411
5c8b3a717929
workaround dc_scale bug in old ffmpeg msmpeg4v3 encoder (set workaround_bugs=1 for this)
michaelni
parents:
396
diff
changeset
|
25 |
| 0 | 26 /* |
| 27 * You can also call this codec : MPEG4 with a twist ! | |
| 28 * | |
| 29 * TODO: | |
| 30 * - (encoding) select best mv table (two choices) | |
| 31 * - (encoding) select best vlc/dc table | |
| 32 */ | |
| 33 //#define DEBUG | |
| 34 | |
| 531 | 35 #define DC_VLC_BITS 9 |
| 36 #define CBPY_VLC_BITS 6 | |
| 37 #define INTER_INTRA_VLC_BITS 3 | |
| 38 #define V1_INTRA_CBPC_VLC_BITS 6 | |
| 39 #define V1_INTER_CBPC_VLC_BITS 6 | |
| 40 #define V2_INTRA_CBPC_VLC_BITS 3 | |
| 41 #define V2_MB_TYPE_VLC_BITS 7 | |
| 42 #define MV_VLC_BITS 9 | |
| 43 #define V2_MV_VLC_BITS 9 | |
| 44 #define TEX_VLC_BITS 9 | |
| 45 #define MB_NON_INTRA_VLC_BITS 9 | |
| 46 #define MB_INTRA_VLC_BITS 9 | |
| 47 | |
| 578 | 48 #define II_BITRATE 128*1024 |
| 49 #define MBAC_BITRATE 50*1024 | |
| 50 | |
| 936 | 51 #define DEFAULT_INTER_INDEX 3 |
| 52 | |
| 1064 | 53 static uint32_t v2_dc_lum_table[512][2]; |
| 54 static uint32_t v2_dc_chroma_table[512][2]; | |
| 307 | 55 |
| 499 | 56 static inline void msmpeg4_encode_block(MpegEncContext * s, DCTELEM * block, int n); |
| 57 static inline int msmpeg4_decode_block(MpegEncContext * s, DCTELEM * block, | |
| 936 | 58 int n, int coded, const uint8_t *scantable); |
| 0 | 59 static int msmpeg4_decode_dc(MpegEncContext * s, int n, int *dir_ptr); |
| 60 static int msmpeg4_decode_motion(MpegEncContext * s, | |
| 61 int *mx_ptr, int *my_ptr); | |
| 310 | 62 static void msmpeg4v2_encode_motion(MpegEncContext * s, int val); |
| 468 | 63 static void init_h263_dc_for_msmpeg4(void); |
| 519 | 64 static inline void msmpeg4_memsetw(short *tab, int val, int n); |
| 601 | 65 static int get_size_of_code(MpegEncContext * s, RLTable *rl, int last, int run, int level, int intra); |
|
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
66 static int msmpeg4v12_decode_mb(MpegEncContext *s, DCTELEM block[6][64]); |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
67 static int msmpeg4v34_decode_mb(MpegEncContext *s, DCTELEM block[6][64]); |
| 936 | 68 static int wmv2_decode_mb(MpegEncContext *s, DCTELEM block[6][64]); |
| 0 | 69 |
| 1064 | 70 extern uint32_t inverse[256]; |
|
225
ae145876789d
use multiply instead of divides for DC prediction on X86
michaelni
parents:
221
diff
changeset
|
71 |
| 601 | 72 |
| 0 | 73 #ifdef DEBUG |
| 74 int intra_count = 0; | |
| 75 int frame_count = 0; | |
| 76 #endif | |
| 77 | |
| 78 #include "msmpeg4data.h" | |
| 79 | |
| 1064 | 80 static uint8_t rl_length[NB_RL_TABLES][MAX_LEVEL+1][MAX_RUN+1][2]; |
| 601 | 81 |
| 0 | 82 #ifdef STATS |
| 83 | |
| 84 const char *st_names[ST_NB] = { | |
| 85 "unknown", | |
| 86 "dc", | |
| 87 "intra_ac", | |
| 88 "inter_ac", | |
| 89 "intra_mb", | |
| 90 "inter_mb", | |
| 91 "mv", | |
| 92 }; | |
| 93 | |
| 94 int st_current_index = 0; | |
| 95 unsigned int st_bit_counts[ST_NB]; | |
| 96 unsigned int st_out_bit_counts[ST_NB]; | |
| 97 | |
| 98 #define set_stat(var) st_current_index = var; | |
| 99 | |
| 100 void print_stats(void) | |
| 101 { | |
| 102 unsigned int total; | |
| 103 int i; | |
| 104 | |
| 105 printf("Input:\n"); | |
| 106 total = 0; | |
| 107 for(i=0;i<ST_NB;i++) | |
| 108 total += st_bit_counts[i]; | |
| 109 if (total == 0) | |
| 110 total = 1; | |
| 111 for(i=0;i<ST_NB;i++) { | |
| 112 printf("%-10s : %10.1f %5.1f%%\n", | |
| 113 st_names[i], | |
| 114 (double)st_bit_counts[i] / 8.0, | |
| 115 (double)st_bit_counts[i] * 100.0 / total); | |
| 116 } | |
| 117 printf("%-10s : %10.1f %5.1f%%\n", | |
| 118 "total", | |
| 119 (double)total / 8.0, | |
| 120 100.0); | |
| 121 | |
| 122 printf("Output:\n"); | |
| 123 total = 0; | |
| 124 for(i=0;i<ST_NB;i++) | |
| 125 total += st_out_bit_counts[i]; | |
| 126 if (total == 0) | |
| 127 total = 1; | |
| 128 for(i=0;i<ST_NB;i++) { | |
| 129 printf("%-10s : %10.1f %5.1f%%\n", | |
| 130 st_names[i], | |
| 131 (double)st_out_bit_counts[i] / 8.0, | |
| 132 (double)st_out_bit_counts[i] * 100.0 / total); | |
| 133 } | |
| 134 printf("%-10s : %10.1f %5.1f%%\n", | |
| 135 "total", | |
| 136 (double)total / 8.0, | |
| 137 100.0); | |
| 138 } | |
| 139 | |
| 140 #else | |
| 141 | |
| 142 #define set_stat(var) | |
| 143 | |
| 144 #endif | |
| 145 | |
| 499 | 146 static void common_init(MpegEncContext * s) |
| 147 { | |
| 148 static int inited=0; | |
| 149 | |
| 150 switch(s->msmpeg4_version){ | |
| 151 case 1: | |
| 152 case 2: | |
| 153 s->y_dc_scale_table= | |
| 154 s->c_dc_scale_table= ff_mpeg1_dc_scale_table; | |
| 155 break; | |
| 156 case 3: | |
| 157 if(s->workaround_bugs){ | |
| 158 s->y_dc_scale_table= old_ff_y_dc_scale_table; | |
| 159 s->c_dc_scale_table= old_ff_c_dc_scale_table; | |
| 160 } else{ | |
| 161 s->y_dc_scale_table= ff_mpeg4_y_dc_scale_table; | |
| 162 s->c_dc_scale_table= ff_mpeg4_c_dc_scale_table; | |
| 163 } | |
| 164 break; | |
| 165 case 4: | |
| 936 | 166 case 5: |
| 499 | 167 s->y_dc_scale_table= wmv1_y_dc_scale_table; |
| 168 s->c_dc_scale_table= wmv1_c_dc_scale_table; | |
| 169 break; | |
| 170 } | |
| 171 | |
|
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
601
diff
changeset
|
172 |
| 936 | 173 if(s->msmpeg4_version>=4){ |
|
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
601
diff
changeset
|
174 ff_init_scantable(s, &s->intra_scantable , wmv1_scantable[1]); |
|
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
601
diff
changeset
|
175 ff_init_scantable(s, &s->intra_h_scantable, wmv1_scantable[2]); |
|
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
601
diff
changeset
|
176 ff_init_scantable(s, &s->intra_v_scantable, wmv1_scantable[3]); |
|
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
601
diff
changeset
|
177 ff_init_scantable(s, &s->inter_scantable , wmv1_scantable[0]); |
| 499 | 178 } |
|
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
601
diff
changeset
|
179 //Note the default tables are set in common_init in mpegvideo.c |
| 499 | 180 |
| 181 if(!inited){ | |
| 182 inited=1; | |
| 183 | |
| 184 init_h263_dc_for_msmpeg4(); | |
| 185 } | |
| 186 } | |
| 187 | |
| 0 | 188 /* build the table which associate a (x,y) motion vector to a vlc */ |
| 189 static void init_mv_table(MVTable *tab) | |
| 190 { | |
| 191 int i, x, y; | |
| 192 | |
| 1064 | 193 tab->table_mv_index = av_malloc(sizeof(uint16_t) * 4096); |
| 0 | 194 /* mark all entries as not used */ |
| 195 for(i=0;i<4096;i++) | |
| 196 tab->table_mv_index[i] = tab->n; | |
| 197 | |
| 198 for(i=0;i<tab->n;i++) { | |
| 199 x = tab->table_mvx[i]; | |
| 200 y = tab->table_mvy[i]; | |
| 201 tab->table_mv_index[(x << 6) | y] = i; | |
| 202 } | |
| 203 } | |
| 204 | |
| 205 static void code012(PutBitContext *pb, int n) | |
| 206 { | |
| 207 if (n == 0) { | |
| 208 put_bits(pb, 1, 0); | |
| 209 } else { | |
| 210 put_bits(pb, 1, 1); | |
| 211 put_bits(pb, 1, (n >= 2)); | |
| 212 } | |
| 213 } | |
| 214 | |
| 499 | 215 void ff_msmpeg4_encode_init(MpegEncContext *s) |
| 216 { | |
| 217 static int init_done=0; | |
| 218 int i; | |
| 219 | |
| 220 common_init(s); | |
| 221 if(s->msmpeg4_version>=4){ | |
| 222 s->min_qcoeff= -255; | |
| 223 s->max_qcoeff= 255; | |
| 224 } | |
| 225 | |
| 226 if (!init_done) { | |
| 227 /* init various encoding tables */ | |
| 228 init_done = 1; | |
| 229 init_mv_table(&mv_tables[0]); | |
| 230 init_mv_table(&mv_tables[1]); | |
| 231 for(i=0;i<NB_RL_TABLES;i++) | |
| 232 init_rl(&rl_table[i]); | |
| 601 | 233 |
| 234 for(i=0; i<NB_RL_TABLES; i++){ | |
| 235 int level; | |
| 236 for(level=0; level<=MAX_LEVEL; level++){ | |
| 237 int run; | |
| 238 for(run=0; run<=MAX_RUN; run++){ | |
| 239 int last; | |
| 240 for(last=0; last<2; last++){ | |
|
774
baa66649df35
mergeing inter & intra rl_length tables (50% smaller & no meassureable difference in filesize/quality)
michaelni
parents:
773
diff
changeset
|
241 rl_length[i][level][run][last]= get_size_of_code(s, &rl_table[ i], last, run, level, 0); |
| 601 | 242 } |
| 243 } | |
| 244 } | |
| 245 } | |
| 499 | 246 } |
| 247 } | |
| 248 | |
| 249 static int get_size_of_code(MpegEncContext * s, RLTable *rl, int last, int run, int level, int intra){ | |
| 250 int size=0; | |
| 251 int code; | |
| 252 int run_diff= intra ? 0 : 1; | |
| 253 | |
| 254 code = get_rl_index(rl, last, run, level); | |
| 255 size+= rl->table_vlc[code][1]; | |
| 256 if (code == rl->n) { | |
| 257 int level1, run1; | |
| 258 | |
| 259 level1 = level - rl->max_level[last][run]; | |
| 260 if (level1 < 1) | |
| 261 goto esc2; | |
| 262 code = get_rl_index(rl, last, run, level1); | |
| 263 if (code == rl->n) { | |
| 264 esc2: | |
| 265 size++; | |
| 266 if (level > MAX_LEVEL) | |
| 267 goto esc3; | |
| 268 run1 = run - rl->max_run[last][level] - run_diff; | |
| 269 if (run1 < 0) | |
| 270 goto esc3; | |
| 271 code = get_rl_index(rl, last, run1, level); | |
| 272 if (code == rl->n) { | |
| 273 esc3: | |
| 274 /* third escape */ | |
| 275 size+=1+1+6+8; | |
| 276 } else { | |
| 277 /* second escape */ | |
| 278 size+= 1+1+ rl->table_vlc[code][1]; | |
| 279 } | |
| 280 } else { | |
| 281 /* first escape */ | |
| 282 size+= 1+1+ rl->table_vlc[code][1]; | |
| 283 } | |
| 284 } else { | |
| 285 size++; | |
| 286 } | |
| 287 return size; | |
| 288 } | |
| 289 | |
| 290 static void find_best_tables(MpegEncContext * s) | |
| 291 { | |
| 292 int i; | |
| 293 int best =-1, best_size =9999999; | |
| 294 int chroma_best=-1, best_chroma_size=9999999; | |
| 601 | 295 |
| 499 | 296 for(i=0; i<3; i++){ |
| 297 int level; | |
| 298 int chroma_size=0; | |
| 299 int size=0; | |
| 300 | |
| 301 if(i>0){// ;) | |
| 302 size++; | |
| 303 chroma_size++; | |
| 304 } | |
| 305 for(level=0; level<=MAX_LEVEL; level++){ | |
| 306 int run; | |
| 307 for(run=0; run<=MAX_RUN; run++){ | |
| 308 int last; | |
| 601 | 309 const int last_size= size + chroma_size; |
| 499 | 310 for(last=0; last<2; last++){ |
| 311 int inter_count = s->ac_stats[0][0][level][run][last] + s->ac_stats[0][1][level][run][last]; | |
| 312 int intra_luma_count = s->ac_stats[1][0][level][run][last]; | |
| 313 int intra_chroma_count= s->ac_stats[1][1][level][run][last]; | |
| 601 | 314 |
| 499 | 315 if(s->pict_type==I_TYPE){ |
|
774
baa66649df35
mergeing inter & intra rl_length tables (50% smaller & no meassureable difference in filesize/quality)
michaelni
parents:
773
diff
changeset
|
316 size += intra_luma_count *rl_length[i ][level][run][last]; |
|
baa66649df35
mergeing inter & intra rl_length tables (50% smaller & no meassureable difference in filesize/quality)
michaelni
parents:
773
diff
changeset
|
317 chroma_size+= intra_chroma_count*rl_length[i+3][level][run][last]; |
| 499 | 318 }else{ |
|
774
baa66649df35
mergeing inter & intra rl_length tables (50% smaller & no meassureable difference in filesize/quality)
michaelni
parents:
773
diff
changeset
|
319 size+= intra_luma_count *rl_length[i ][level][run][last] |
|
baa66649df35
mergeing inter & intra rl_length tables (50% smaller & no meassureable difference in filesize/quality)
michaelni
parents:
773
diff
changeset
|
320 +intra_chroma_count*rl_length[i+3][level][run][last] |
|
baa66649df35
mergeing inter & intra rl_length tables (50% smaller & no meassureable difference in filesize/quality)
michaelni
parents:
773
diff
changeset
|
321 +inter_count *rl_length[i+3][level][run][last]; |
| 499 | 322 } |
| 323 } | |
| 601 | 324 if(last_size == size+chroma_size) break; |
| 499 | 325 } |
| 326 } | |
| 327 if(size<best_size){ | |
| 328 best_size= size; | |
| 329 best= i; | |
| 330 } | |
| 331 if(chroma_size<best_chroma_size){ | |
| 332 best_chroma_size= chroma_size; | |
| 333 chroma_best= i; | |
| 334 } | |
| 335 } | |
| 601 | 336 |
| 499 | 337 // printf("type:%d, best:%d, qp:%d, var:%d, mcvar:%d, size:%d //\n", |
| 338 // s->pict_type, best, s->qscale, s->mb_var_sum, s->mc_mb_var_sum, best_size); | |
| 339 | |
| 340 if(s->pict_type==P_TYPE) chroma_best= best; | |
| 341 | |
| 342 memset(s->ac_stats, 0, sizeof(int)*(MAX_LEVEL+1)*(MAX_RUN+1)*2*2*2); | |
| 343 | |
| 344 s->rl_table_index = best; | |
| 345 s->rl_chroma_table_index= chroma_best; | |
| 346 | |
| 347 if(s->pict_type != s->last_non_b_pict_type){ | |
| 348 s->rl_table_index= 2; | |
| 349 if(s->pict_type==I_TYPE) | |
| 350 s->rl_chroma_table_index= 1; | |
| 351 else | |
| 352 s->rl_chroma_table_index= 2; | |
| 353 } | |
| 354 | |
| 355 } | |
| 356 | |
| 457 | 357 /* write MSMPEG4 compatible frame header */ |
| 0 | 358 void msmpeg4_encode_picture_header(MpegEncContext * s, int picture_number) |
| 359 { | |
| 499 | 360 find_best_tables(s); |
| 0 | 361 |
| 362 align_put_bits(&s->pb); | |
| 363 put_bits(&s->pb, 2, s->pict_type - 1); | |
| 364 | |
| 365 put_bits(&s->pb, 5, s->qscale); | |
| 499 | 366 if(s->msmpeg4_version<=2){ |
| 367 s->rl_table_index = 2; | |
| 368 s->rl_chroma_table_index = 2; | |
| 369 } | |
| 310 | 370 |
| 0 | 371 s->dc_table_index = 1; |
| 372 s->mv_table_index = 1; /* only if P frame */ | |
| 373 s->use_skip_mb_code = 1; /* only if P frame */ | |
| 499 | 374 s->per_mb_rl_table = 0; |
| 759 | 375 if(s->msmpeg4_version==4) |
| 376 s->inter_intra_pred= (s->width*s->height < 320*240 && s->bit_rate<=II_BITRATE && s->pict_type==P_TYPE); | |
| 936 | 377 //printf("%d %d %d %d %d\n", s->pict_type, s->bit_rate, s->inter_intra_pred, s->width, s->height); |
| 499 | 378 |
| 0 | 379 if (s->pict_type == I_TYPE) { |
| 519 | 380 s->slice_height= s->mb_height/1; |
| 381 put_bits(&s->pb, 5, 0x16 + s->mb_height/s->slice_height); | |
| 499 | 382 |
| 383 if(s->msmpeg4_version==4){ | |
| 384 msmpeg4_encode_ext_header(s); | |
| 578 | 385 if(s->bit_rate>MBAC_BITRATE) |
| 519 | 386 put_bits(&s->pb, 1, s->per_mb_rl_table); |
| 499 | 387 } |
| 0 | 388 |
| 457 | 389 if(s->msmpeg4_version>2){ |
| 499 | 390 if(!s->per_mb_rl_table){ |
| 391 code012(&s->pb, s->rl_chroma_table_index); | |
| 392 code012(&s->pb, s->rl_table_index); | |
| 393 } | |
| 0 | 394 |
| 310 | 395 put_bits(&s->pb, 1, s->dc_table_index); |
| 396 } | |
| 0 | 397 } else { |
| 398 put_bits(&s->pb, 1, s->use_skip_mb_code); | |
| 399 | |
| 578 | 400 if(s->msmpeg4_version==4 && s->bit_rate>MBAC_BITRATE) |
| 499 | 401 put_bits(&s->pb, 1, s->per_mb_rl_table); |
| 402 | |
| 457 | 403 if(s->msmpeg4_version>2){ |
| 499 | 404 if(!s->per_mb_rl_table) |
| 405 code012(&s->pb, s->rl_table_index); | |
| 0 | 406 |
| 310 | 407 put_bits(&s->pb, 1, s->dc_table_index); |
| 0 | 408 |
| 310 | 409 put_bits(&s->pb, 1, s->mv_table_index); |
| 410 } | |
| 0 | 411 } |
| 412 | |
| 499 | 413 s->esc3_level_length= 0; |
| 414 s->esc3_run_length= 0; | |
| 0 | 415 |
| 416 #ifdef DEBUG | |
| 417 intra_count = 0; | |
| 418 printf("*****frame %d:\n", frame_count++); | |
| 419 #endif | |
| 420 } | |
| 421 | |
| 208 | 422 void msmpeg4_encode_ext_header(MpegEncContext * s) |
| 423 { | |
|
251
75091bfc577b
fixing msmpeg4 decoding if fps < 16 (i thought it was a indicator for the ext header, its the fps indeed)
michaelni
parents:
246
diff
changeset
|
424 put_bits(&s->pb, 5, s->frame_rate / FRAME_RATE_BASE); //yes 29.97 -> 29 |
| 208 | 425 |
| 847 | 426 put_bits(&s->pb, 11, FFMIN(s->bit_rate/1024, 2047)); |
| 208 | 427 |
| 457 | 428 if(s->msmpeg4_version<3) |
| 429 s->flipflop_rounding=0; | |
| 430 else{ | |
| 431 s->flipflop_rounding=1; | |
| 432 put_bits(&s->pb, 1, s->flipflop_rounding); | |
| 433 } | |
| 208 | 434 } |
| 435 | |
| 0 | 436 /* predict coded block */ |
| 1064 | 437 static inline int coded_block_pred(MpegEncContext * s, int n, uint8_t **coded_block_ptr) |
| 0 | 438 { |
| 299 | 439 int xy, wrap, pred, a, b, c; |
| 0 | 440 |
| 299 | 441 xy = s->block_index[n]; |
| 442 wrap = s->block_wrap[0]; | |
| 0 | 443 |
| 444 /* B C | |
| 445 * A X | |
| 446 */ | |
| 299 | 447 a = s->coded_block[xy - 1 ]; |
| 448 b = s->coded_block[xy - 1 - wrap]; | |
| 449 c = s->coded_block[xy - wrap]; | |
| 0 | 450 |
| 451 if (b == c) { | |
| 452 pred = a; | |
| 453 } else { | |
| 454 pred = c; | |
| 455 } | |
| 456 | |
| 457 /* store value */ | |
| 299 | 458 *coded_block_ptr = &s->coded_block[xy]; |
| 0 | 459 |
| 460 return pred; | |
| 461 } | |
| 462 | |
| 463 static void msmpeg4_encode_motion(MpegEncContext * s, | |
| 464 int mx, int my) | |
| 465 { | |
| 466 int code; | |
| 467 MVTable *mv; | |
| 468 | |
| 469 /* modulo encoding */ | |
| 470 /* WARNING : you cannot reach all the MVs even with the modulo | |
| 471 encoding. This is a somewhat strange compromise they took !!! */ | |
| 472 if (mx <= -64) | |
| 473 mx += 64; | |
| 474 else if (mx >= 64) | |
| 475 mx -= 64; | |
| 476 if (my <= -64) | |
| 477 my += 64; | |
| 478 else if (my >= 64) | |
| 479 my -= 64; | |
| 480 | |
| 481 mx += 32; | |
| 482 my += 32; | |
| 483 #if 0 | |
| 484 if ((unsigned)mx >= 64 || | |
| 485 (unsigned)my >= 64) | |
| 486 fprintf(stderr, "error mx=%d my=%d\n", mx, my); | |
| 487 #endif | |
| 488 mv = &mv_tables[s->mv_table_index]; | |
| 489 | |
| 490 code = mv->table_mv_index[(mx << 6) | my]; | |
| 491 set_stat(ST_MV); | |
| 492 put_bits(&s->pb, | |
| 493 mv->table_mv_bits[code], | |
| 494 mv->table_mv_code[code]); | |
| 495 if (code == mv->n) { | |
| 496 /* escape : code litterally */ | |
| 497 put_bits(&s->pb, 6, mx); | |
| 498 put_bits(&s->pb, 6, my); | |
| 499 } | |
| 500 } | |
| 501 | |
| 519 | 502 static inline void handle_slices(MpegEncContext *s){ |
| 503 if (s->mb_x == 0) { | |
| 504 if (s->slice_height && (s->mb_y % s->slice_height) == 0) { | |
| 983 | 505 if(s->msmpeg4_version < 4){ |
|
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
506 ff_mpeg4_clean_buffers(s); |
| 519 | 507 } |
| 508 s->first_slice_line = 1; | |
| 509 } else { | |
| 510 s->first_slice_line = 0; | |
| 511 } | |
| 512 } | |
| 513 } | |
| 514 | |
| 0 | 515 void msmpeg4_encode_mb(MpegEncContext * s, |
| 516 DCTELEM block[6][64], | |
| 517 int motion_x, int motion_y) | |
| 518 { | |
| 519 int cbp, coded_cbp, i; | |
| 520 int pred_x, pred_y; | |
| 1064 | 521 uint8_t *coded_block; |
| 0 | 522 |
| 519 | 523 handle_slices(s); |
| 524 | |
| 0 | 525 if (!s->mb_intra) { |
| 526 /* compute cbp */ | |
| 527 set_stat(ST_INTER_MB); | |
| 528 cbp = 0; | |
| 529 for (i = 0; i < 6; i++) { | |
| 530 if (s->block_last_index[i] >= 0) | |
| 531 cbp |= 1 << (5 - i); | |
| 532 } | |
| 533 if (s->use_skip_mb_code && (cbp | motion_x | motion_y) == 0) { | |
| 534 /* skip macroblock */ | |
| 535 put_bits(&s->pb, 1, 1); | |
| 536 return; | |
| 537 } | |
| 538 if (s->use_skip_mb_code) | |
| 539 put_bits(&s->pb, 1, 0); /* mb coded */ | |
| 540 | |
| 457 | 541 if(s->msmpeg4_version<=2){ |
| 310 | 542 put_bits(&s->pb, |
| 543 v2_mb_type[cbp&3][1], | |
| 544 v2_mb_type[cbp&3][0]); | |
| 545 if((cbp&3) != 3) coded_cbp= cbp ^ 0x3C; | |
| 546 else coded_cbp= cbp; | |
| 0 | 547 |
| 310 | 548 put_bits(&s->pb, |
| 549 cbpy_tab[coded_cbp>>2][1], | |
| 550 cbpy_tab[coded_cbp>>2][0]); | |
| 551 | |
| 552 h263_pred_motion(s, 0, &pred_x, &pred_y); | |
| 553 msmpeg4v2_encode_motion(s, motion_x - pred_x); | |
| 554 msmpeg4v2_encode_motion(s, motion_y - pred_y); | |
| 555 }else{ | |
| 556 put_bits(&s->pb, | |
| 557 table_mb_non_intra[cbp + 64][1], | |
| 558 table_mb_non_intra[cbp + 64][0]); | |
| 559 | |
| 560 /* motion vector */ | |
| 561 h263_pred_motion(s, 0, &pred_x, &pred_y); | |
| 562 msmpeg4_encode_motion(s, motion_x - pred_x, | |
| 563 motion_y - pred_y); | |
| 564 } | |
| 0 | 565 } else { |
| 566 /* compute cbp */ | |
| 567 cbp = 0; | |
| 568 coded_cbp = 0; | |
| 569 for (i = 0; i < 6; i++) { | |
| 570 int val, pred; | |
| 571 val = (s->block_last_index[i] >= 1); | |
| 572 cbp |= val << (5 - i); | |
| 573 if (i < 4) { | |
| 574 /* predict value for close blocks only for luma */ | |
| 575 pred = coded_block_pred(s, i, &coded_block); | |
| 576 *coded_block = val; | |
| 577 val = val ^ pred; | |
| 578 } | |
| 579 coded_cbp |= val << (5 - i); | |
| 580 } | |
| 581 #if 0 | |
| 582 if (coded_cbp) | |
| 583 printf("cbp=%x %x\n", cbp, coded_cbp); | |
| 584 #endif | |
| 585 | |
| 457 | 586 if(s->msmpeg4_version<=2){ |
| 310 | 587 if (s->pict_type == I_TYPE) { |
| 588 put_bits(&s->pb, | |
| 589 v2_intra_cbpc[cbp&3][1], v2_intra_cbpc[cbp&3][0]); | |
| 590 } else { | |
| 591 if (s->use_skip_mb_code) | |
| 592 put_bits(&s->pb, 1, 0); /* mb coded */ | |
| 593 put_bits(&s->pb, | |
| 594 v2_mb_type[(cbp&3) + 4][1], | |
| 595 v2_mb_type[(cbp&3) + 4][0]); | |
| 596 } | |
| 597 put_bits(&s->pb, 1, 0); /* no AC prediction yet */ | |
| 0 | 598 put_bits(&s->pb, |
| 310 | 599 cbpy_tab[cbp>>2][1], |
| 600 cbpy_tab[cbp>>2][0]); | |
| 601 }else{ | |
| 602 if (s->pict_type == I_TYPE) { | |
| 603 set_stat(ST_INTRA_MB); | |
| 604 put_bits(&s->pb, | |
| 605 table_mb_intra[coded_cbp][1], table_mb_intra[coded_cbp][0]); | |
| 606 } else { | |
| 607 if (s->use_skip_mb_code) | |
| 608 put_bits(&s->pb, 1, 0); /* mb coded */ | |
| 609 put_bits(&s->pb, | |
| 610 table_mb_non_intra[cbp][1], | |
| 611 table_mb_non_intra[cbp][0]); | |
| 612 } | |
| 613 set_stat(ST_INTRA_MB); | |
| 614 put_bits(&s->pb, 1, 0); /* no AC prediction yet */ | |
| 578 | 615 if(s->inter_intra_pred){ |
| 616 s->h263_aic_dir=0; | |
| 617 put_bits(&s->pb, table_inter_intra[s->h263_aic_dir][1], table_inter_intra[s->h263_aic_dir][0]); | |
| 618 } | |
| 0 | 619 } |
| 620 } | |
| 621 | |
| 622 for (i = 0; i < 6; i++) { | |
| 623 msmpeg4_encode_block(s, block[i], i); | |
| 624 } | |
| 625 } | |
| 626 | |
|
411
5c8b3a717929
workaround dc_scale bug in old ffmpeg msmpeg4v3 encoder (set workaround_bugs=1 for this)
michaelni
parents:
396
diff
changeset
|
627 /* old ffmpeg msmpeg4v3 mode */ |
| 1057 | 628 static void ff_old_msmpeg4_dc_scale(MpegEncContext * s) |
| 0 | 629 { |
|
411
5c8b3a717929
workaround dc_scale bug in old ffmpeg msmpeg4v3 encoder (set workaround_bugs=1 for this)
michaelni
parents:
396
diff
changeset
|
630 if (s->qscale < 5){ |
|
195
92f726205082
s->c_dc_scale was 7 if s->qscale==2 but should be 8 (the bug is visible in deep red areas in high bitrate clips) - patch by Michael Niedermayer <michaelni@gmx.at>
arpi_esp
parents:
186
diff
changeset
|
631 s->y_dc_scale = 8; |
|
92f726205082
s->c_dc_scale was 7 if s->qscale==2 but should be 8 (the bug is visible in deep red areas in high bitrate clips) - patch by Michael Niedermayer <michaelni@gmx.at>
arpi_esp
parents:
186
diff
changeset
|
632 s->c_dc_scale = 8; |
|
92f726205082
s->c_dc_scale was 7 if s->qscale==2 but should be 8 (the bug is visible in deep red areas in high bitrate clips) - patch by Michael Niedermayer <michaelni@gmx.at>
arpi_esp
parents:
186
diff
changeset
|
633 }else if (s->qscale < 9){ |
|
92f726205082
s->c_dc_scale was 7 if s->qscale==2 but should be 8 (the bug is visible in deep red areas in high bitrate clips) - patch by Michael Niedermayer <michaelni@gmx.at>
arpi_esp
parents:
186
diff
changeset
|
634 s->y_dc_scale = 2 * s->qscale; |
|
92f726205082
s->c_dc_scale was 7 if s->qscale==2 but should be 8 (the bug is visible in deep red areas in high bitrate clips) - patch by Michael Niedermayer <michaelni@gmx.at>
arpi_esp
parents:
186
diff
changeset
|
635 s->c_dc_scale = (s->qscale + 13)>>1; |
|
411
5c8b3a717929
workaround dc_scale bug in old ffmpeg msmpeg4v3 encoder (set workaround_bugs=1 for this)
michaelni
parents:
396
diff
changeset
|
636 }else{ |
|
195
92f726205082
s->c_dc_scale was 7 if s->qscale==2 but should be 8 (the bug is visible in deep red areas in high bitrate clips) - patch by Michael Niedermayer <michaelni@gmx.at>
arpi_esp
parents:
186
diff
changeset
|
637 s->y_dc_scale = s->qscale + 8; |
|
92f726205082
s->c_dc_scale was 7 if s->qscale==2 but should be 8 (the bug is visible in deep red areas in high bitrate clips) - patch by Michael Niedermayer <michaelni@gmx.at>
arpi_esp
parents:
186
diff
changeset
|
638 s->c_dc_scale = (s->qscale + 13)>>1; |
|
92f726205082
s->c_dc_scale was 7 if s->qscale==2 but should be 8 (the bug is visible in deep red areas in high bitrate clips) - patch by Michael Niedermayer <michaelni@gmx.at>
arpi_esp
parents:
186
diff
changeset
|
639 } |
| 0 | 640 } |
| 641 | |
| 499 | 642 static inline int msmpeg4v1_pred_dc(MpegEncContext * s, int n, |
| 1064 | 643 int32_t **dc_val_ptr) |
| 457 | 644 { |
| 645 int i; | |
| 646 | |
| 647 if (n < 4) { | |
| 648 i= 0; | |
| 649 } else { | |
| 650 i= n-3; | |
| 651 } | |
| 652 | |
| 653 *dc_val_ptr= &s->last_dc[i]; | |
| 654 return s->last_dc[i]; | |
| 655 } | |
| 656 | |
| 519 | 657 static int get_dc(uint8_t *src, int stride, int scale) |
| 658 { | |
| 659 int y; | |
| 660 int sum=0; | |
| 661 for(y=0; y<8; y++){ | |
| 662 int x; | |
| 663 for(x=0; x<8; x++){ | |
| 664 sum+=src[x + y*stride]; | |
| 665 } | |
| 666 } | |
| 667 return (sum + (scale>>1))/scale; | |
| 668 } | |
| 669 | |
| 0 | 670 /* dir = 0: left, dir = 1: top prediction */ |
| 499 | 671 static inline int msmpeg4_pred_dc(MpegEncContext * s, int n, |
| 1064 | 672 uint16_t **dc_val_ptr, int *dir_ptr) |
| 0 | 673 { |
| 299 | 674 int a, b, c, wrap, pred, scale; |
| 1064 | 675 int16_t *dc_val; |
| 0 | 676 |
| 677 /* find prediction */ | |
| 678 if (n < 4) { | |
| 679 scale = s->y_dc_scale; | |
| 680 } else { | |
| 681 scale = s->c_dc_scale; | |
| 682 } | |
| 457 | 683 |
| 299 | 684 wrap = s->block_wrap[n]; |
| 685 dc_val= s->dc_val[0] + s->block_index[n]; | |
| 0 | 686 |
| 687 /* B C | |
| 688 * A X | |
| 689 */ | |
| 299 | 690 a = dc_val[ - 1]; |
| 691 b = dc_val[ - 1 - wrap]; | |
| 692 c = dc_val[ - wrap]; | |
|
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
693 |
| 983 | 694 if(s->first_slice_line && (n&2)==0 && s->msmpeg4_version<4){ |
|
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
695 b=c=1024; |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
696 } |
| 0 | 697 |
| 698 /* XXX: the following solution consumes divisions, but it does not | |
| 699 necessitate to modify mpegvideo.c. The problem comes from the | |
| 700 fact they decided to store the quantized DC (which would lead | |
| 701 to problems if Q could vary !) */ | |
| 221 | 702 #if defined ARCH_X86 && !defined PIC |
| 204 | 703 asm volatile( |
| 704 "movl %3, %%eax \n\t" | |
| 705 "shrl $1, %%eax \n\t" | |
| 706 "addl %%eax, %2 \n\t" | |
| 707 "addl %%eax, %1 \n\t" | |
| 708 "addl %0, %%eax \n\t" | |
|
225
ae145876789d
use multiply instead of divides for DC prediction on X86
michaelni
parents:
221
diff
changeset
|
709 "mull %4 \n\t" |
|
ae145876789d
use multiply instead of divides for DC prediction on X86
michaelni
parents:
221
diff
changeset
|
710 "movl %%edx, %0 \n\t" |
| 204 | 711 "movl %1, %%eax \n\t" |
|
225
ae145876789d
use multiply instead of divides for DC prediction on X86
michaelni
parents:
221
diff
changeset
|
712 "mull %4 \n\t" |
|
ae145876789d
use multiply instead of divides for DC prediction on X86
michaelni
parents:
221
diff
changeset
|
713 "movl %%edx, %1 \n\t" |
| 204 | 714 "movl %2, %%eax \n\t" |
|
225
ae145876789d
use multiply instead of divides for DC prediction on X86
michaelni
parents:
221
diff
changeset
|
715 "mull %4 \n\t" |
|
ae145876789d
use multiply instead of divides for DC prediction on X86
michaelni
parents:
221
diff
changeset
|
716 "movl %%edx, %2 \n\t" |
| 228 | 717 : "+b" (a), "+c" (b), "+D" (c) |
| 718 : "g" (scale), "S" (inverse[scale]) | |
| 204 | 719 : "%eax", "%edx" |
| 720 ); | |
| 221 | 721 #else |
| 722 /* #elif defined (ARCH_ALPHA) */ | |
|
214
73df666cacc7
Alpha optimizations by Falk Hueffner <falk.hueffner@student.uni-tuebingen.de>
nickols_k
parents:
208
diff
changeset
|
723 /* Divisions are extremely costly on Alpha; optimize the most |
| 221 | 724 common case. But they are costly everywhere... |
| 725 */ | |
|
214
73df666cacc7
Alpha optimizations by Falk Hueffner <falk.hueffner@student.uni-tuebingen.de>
nickols_k
parents:
208
diff
changeset
|
726 if (scale == 8) { |
|
73df666cacc7
Alpha optimizations by Falk Hueffner <falk.hueffner@student.uni-tuebingen.de>
nickols_k
parents:
208
diff
changeset
|
727 a = (a + (8 >> 1)) / 8; |
|
73df666cacc7
Alpha optimizations by Falk Hueffner <falk.hueffner@student.uni-tuebingen.de>
nickols_k
parents:
208
diff
changeset
|
728 b = (b + (8 >> 1)) / 8; |
|
73df666cacc7
Alpha optimizations by Falk Hueffner <falk.hueffner@student.uni-tuebingen.de>
nickols_k
parents:
208
diff
changeset
|
729 c = (c + (8 >> 1)) / 8; |
|
73df666cacc7
Alpha optimizations by Falk Hueffner <falk.hueffner@student.uni-tuebingen.de>
nickols_k
parents:
208
diff
changeset
|
730 } else { |
|
73df666cacc7
Alpha optimizations by Falk Hueffner <falk.hueffner@student.uni-tuebingen.de>
nickols_k
parents:
208
diff
changeset
|
731 a = (a + (scale >> 1)) / scale; |
|
73df666cacc7
Alpha optimizations by Falk Hueffner <falk.hueffner@student.uni-tuebingen.de>
nickols_k
parents:
208
diff
changeset
|
732 b = (b + (scale >> 1)) / scale; |
|
73df666cacc7
Alpha optimizations by Falk Hueffner <falk.hueffner@student.uni-tuebingen.de>
nickols_k
parents:
208
diff
changeset
|
733 c = (c + (scale >> 1)) / scale; |
|
73df666cacc7
Alpha optimizations by Falk Hueffner <falk.hueffner@student.uni-tuebingen.de>
nickols_k
parents:
208
diff
changeset
|
734 } |
| 204 | 735 #endif |
| 0 | 736 /* XXX: WARNING: they did not choose the same test as MPEG4. This |
| 737 is very important ! */ | |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
738 if(s->msmpeg4_version>3){ |
| 519 | 739 if(s->inter_intra_pred){ |
| 740 uint8_t *dest; | |
| 741 int wrap; | |
| 742 | |
| 743 if(n==1){ | |
| 744 pred=a; | |
| 745 *dir_ptr = 0; | |
| 746 }else if(n==2){ | |
| 747 pred=c; | |
| 748 *dir_ptr = 1; | |
| 749 }else if(n==3){ | |
| 750 if (abs(a - b) < abs(b - c)) { | |
| 751 pred = c; | |
| 752 *dir_ptr = 1; | |
| 753 } else { | |
| 754 pred = a; | |
| 755 *dir_ptr = 0; | |
| 756 } | |
| 757 }else{ | |
| 758 if(n<4){ | |
| 759 wrap= s->linesize; | |
| 903 | 760 dest= s->current_picture.data[0] + (((n>>1) + 2*s->mb_y) * 8* wrap ) + ((n&1) + 2*s->mb_x) * 8; |
| 519 | 761 }else{ |
| 556 | 762 wrap= s->uvlinesize; |
| 903 | 763 dest= s->current_picture.data[n-3] + (s->mb_y * 8 * wrap) + s->mb_x * 8; |
| 519 | 764 } |
| 765 if(s->mb_x==0) a= (1024 + (scale>>1))/scale; | |
| 766 else a= get_dc(dest-8, wrap, scale*8); | |
| 767 if(s->mb_y==0) c= (1024 + (scale>>1))/scale; | |
| 768 else c= get_dc(dest-8*wrap, wrap, scale*8); | |
| 769 | |
| 770 if (s->h263_aic_dir==0) { | |
| 771 pred= a; | |
| 772 *dir_ptr = 0; | |
| 773 }else if (s->h263_aic_dir==1) { | |
| 774 if(n==0){ | |
| 775 pred= c; | |
| 776 *dir_ptr = 1; | |
| 777 }else{ | |
| 778 pred= a; | |
| 779 *dir_ptr = 0; | |
| 780 } | |
| 781 }else if (s->h263_aic_dir==2) { | |
| 782 if(n==0){ | |
| 783 pred= a; | |
| 784 *dir_ptr = 0; | |
| 785 }else{ | |
| 786 pred= c; | |
| 787 *dir_ptr = 1; | |
| 788 } | |
| 789 } else { | |
| 790 pred= c; | |
| 791 *dir_ptr = 1; | |
| 792 } | |
| 793 } | |
| 794 }else{ | |
| 795 if (abs(a - b) < abs(b - c)) { | |
| 796 pred = c; | |
| 797 *dir_ptr = 1; | |
| 798 } else { | |
| 799 pred = a; | |
| 800 *dir_ptr = 0; | |
| 801 } | |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
802 } |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
803 }else{ |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
804 if (abs(a - b) <= abs(b - c)) { |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
805 pred = c; |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
806 *dir_ptr = 1; |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
807 } else { |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
808 pred = a; |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
809 *dir_ptr = 0; |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
810 } |
| 0 | 811 } |
| 812 | |
| 813 /* update predictor */ | |
| 299 | 814 *dc_val_ptr = &dc_val[0]; |
| 0 | 815 return pred; |
| 816 } | |
| 817 | |
| 818 #define DC_MAX 119 | |
| 819 | |
| 820 static void msmpeg4_encode_dc(MpegEncContext * s, int level, int n, int *dir_ptr) | |
| 821 { | |
| 822 int sign, code; | |
| 823 int pred; | |
| 824 | |
| 457 | 825 if(s->msmpeg4_version==1){ |
| 1064 | 826 int32_t *dc_val; |
| 457 | 827 pred = msmpeg4v1_pred_dc(s, n, &dc_val); |
| 828 | |
| 829 /* update predictor */ | |
| 830 *dc_val= level; | |
| 831 }else{ | |
| 1064 | 832 uint16_t *dc_val; |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
833 pred = msmpeg4_pred_dc(s, n, &dc_val, dir_ptr); |
| 457 | 834 |
| 835 /* update predictor */ | |
| 836 if (n < 4) { | |
| 837 *dc_val = level * s->y_dc_scale; | |
| 838 } else { | |
| 839 *dc_val = level * s->c_dc_scale; | |
| 840 } | |
| 0 | 841 } |
| 842 | |
| 843 /* do the prediction */ | |
| 844 level -= pred; | |
| 845 | |
| 457 | 846 if(s->msmpeg4_version<=2){ |
| 310 | 847 if (n < 4) { |
| 848 put_bits(&s->pb, | |
| 849 v2_dc_lum_table[level+256][1], | |
| 850 v2_dc_lum_table[level+256][0]); | |
| 851 }else{ | |
| 852 put_bits(&s->pb, | |
| 853 v2_dc_chroma_table[level+256][1], | |
| 854 v2_dc_chroma_table[level+256][0]); | |
| 855 } | |
| 856 }else{ | |
| 857 sign = 0; | |
| 858 if (level < 0) { | |
| 859 level = -level; | |
| 860 sign = 1; | |
| 861 } | |
| 862 code = level; | |
| 863 if (code > DC_MAX) | |
| 864 code = DC_MAX; | |
| 0 | 865 |
| 310 | 866 if (s->dc_table_index == 0) { |
| 867 if (n < 4) { | |
| 868 put_bits(&s->pb, table0_dc_lum[code][1], table0_dc_lum[code][0]); | |
| 869 } else { | |
| 870 put_bits(&s->pb, table0_dc_chroma[code][1], table0_dc_chroma[code][0]); | |
| 871 } | |
| 0 | 872 } else { |
| 310 | 873 if (n < 4) { |
| 874 put_bits(&s->pb, table1_dc_lum[code][1], table1_dc_lum[code][0]); | |
| 875 } else { | |
| 876 put_bits(&s->pb, table1_dc_chroma[code][1], table1_dc_chroma[code][0]); | |
| 877 } | |
| 0 | 878 } |
| 310 | 879 |
| 880 if (code == DC_MAX) | |
| 881 put_bits(&s->pb, 8, level); | |
| 882 | |
| 883 if (level != 0) { | |
| 884 put_bits(&s->pb, 1, sign); | |
| 885 } | |
| 0 | 886 } |
| 887 } | |
| 888 | |
| 889 /* Encoding of a block. Very similar to MPEG4 except for a different | |
| 890 escape coding (same as H263) and more vlc tables. | |
| 891 */ | |
| 499 | 892 static inline void msmpeg4_encode_block(MpegEncContext * s, DCTELEM * block, int n) |
| 0 | 893 { |
| 894 int level, run, last, i, j, last_index; | |
| 895 int last_non_zero, sign, slevel; | |
| 896 int code, run_diff, dc_pred_dir; | |
| 897 const RLTable *rl; | |
| 1064 | 898 const uint8_t *scantable; |
| 0 | 899 |
| 900 if (s->mb_intra) { | |
| 901 set_stat(ST_DC); | |
| 902 msmpeg4_encode_dc(s, block[0], n, &dc_pred_dir); | |
| 903 i = 1; | |
| 904 if (n < 4) { | |
| 905 rl = &rl_table[s->rl_table_index]; | |
| 906 } else { | |
| 907 rl = &rl_table[3 + s->rl_chroma_table_index]; | |
| 908 } | |
| 909 run_diff = 0; | |
|
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
601
diff
changeset
|
910 scantable= s->intra_scantable.permutated; |
| 0 | 911 set_stat(ST_INTRA_AC); |
| 912 } else { | |
| 913 i = 0; | |
| 914 rl = &rl_table[3 + s->rl_table_index]; | |
| 457 | 915 if(s->msmpeg4_version<=2) |
| 310 | 916 run_diff = 0; |
| 917 else | |
| 918 run_diff = 1; | |
|
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
601
diff
changeset
|
919 scantable= s->inter_scantable.permutated; |
| 0 | 920 set_stat(ST_INTER_AC); |
| 921 } | |
| 922 | |
| 499 | 923 /* recalculate block_last_index for M$ wmv1 */ |
| 936 | 924 if(s->msmpeg4_version>=4 && s->block_last_index[n]>0){ |
| 499 | 925 for(last_index=63; last_index>=0; last_index--){ |
| 926 if(block[scantable[last_index]]) break; | |
| 927 } | |
|
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
928 s->block_last_index[n]= last_index; |
| 499 | 929 }else |
| 930 last_index = s->block_last_index[n]; | |
| 0 | 931 /* AC coefs */ |
| 932 last_non_zero = i - 1; | |
| 933 for (; i <= last_index; i++) { | |
| 499 | 934 j = scantable[i]; |
| 0 | 935 level = block[j]; |
| 936 if (level) { | |
| 937 run = i - last_non_zero - 1; | |
| 938 last = (i == last_index); | |
| 939 sign = 0; | |
| 940 slevel = level; | |
| 941 if (level < 0) { | |
| 942 sign = 1; | |
| 943 level = -level; | |
| 944 } | |
| 601 | 945 |
| 499 | 946 if(level<=MAX_LEVEL && run<=MAX_RUN){ |
| 947 s->ac_stats[s->mb_intra][n>3][level][run][last]++; | |
| 948 } | |
| 949 #if 0 | |
| 950 else | |
| 951 s->ac_stats[s->mb_intra][n>3][40][63][0]++; //esc3 like | |
| 952 #endif | |
| 0 | 953 code = get_rl_index(rl, last, run, level); |
| 954 put_bits(&s->pb, rl->table_vlc[code][1], rl->table_vlc[code][0]); | |
| 955 if (code == rl->n) { | |
| 956 int level1, run1; | |
| 957 | |
| 958 level1 = level - rl->max_level[last][run]; | |
| 959 if (level1 < 1) | |
| 960 goto esc2; | |
| 961 code = get_rl_index(rl, last, run, level1); | |
| 962 if (code == rl->n) { | |
| 963 esc2: | |
| 964 put_bits(&s->pb, 1, 0); | |
| 965 if (level > MAX_LEVEL) | |
| 966 goto esc3; | |
| 967 run1 = run - rl->max_run[last][level] - run_diff; | |
| 968 if (run1 < 0) | |
| 969 goto esc3; | |
| 970 code = get_rl_index(rl, last, run1, level); | |
| 971 if (code == rl->n) { | |
| 972 esc3: | |
| 973 /* third escape */ | |
| 974 put_bits(&s->pb, 1, 0); | |
| 975 put_bits(&s->pb, 1, last); | |
| 936 | 976 if(s->msmpeg4_version>=4){ |
| 499 | 977 if(s->esc3_level_length==0){ |
| 978 s->esc3_level_length=8; | |
| 979 s->esc3_run_length= 6; | |
| 980 if(s->qscale<8) | |
| 981 put_bits(&s->pb, 6, 3); | |
| 982 else | |
| 983 put_bits(&s->pb, 8, 3); | |
| 984 } | |
| 985 put_bits(&s->pb, s->esc3_run_length, run); | |
| 986 put_bits(&s->pb, 1, sign); | |
| 987 put_bits(&s->pb, s->esc3_level_length, level); | |
| 988 }else{ | |
| 989 put_bits(&s->pb, 6, run); | |
| 990 put_bits(&s->pb, 8, slevel & 0xff); | |
| 991 } | |
| 0 | 992 } else { |
| 993 /* second escape */ | |
| 994 put_bits(&s->pb, 1, 1); | |
| 995 put_bits(&s->pb, rl->table_vlc[code][1], rl->table_vlc[code][0]); | |
| 996 put_bits(&s->pb, 1, sign); | |
| 997 } | |
| 998 } else { | |
| 999 /* first escape */ | |
| 1000 put_bits(&s->pb, 1, 1); | |
| 1001 put_bits(&s->pb, rl->table_vlc[code][1], rl->table_vlc[code][0]); | |
| 1002 put_bits(&s->pb, 1, sign); | |
| 1003 } | |
| 1004 } else { | |
| 1005 put_bits(&s->pb, 1, sign); | |
| 1006 } | |
| 1007 last_non_zero = i; | |
| 1008 } | |
| 1009 } | |
| 1010 } | |
| 1011 | |
| 1012 /****************************************/ | |
| 1013 /* decoding stuff */ | |
| 1014 | |
| 936 | 1015 static VLC mb_non_intra_vlc[4]; |
| 0 | 1016 static VLC mb_intra_vlc; |
| 1017 static VLC dc_lum_vlc[2]; | |
| 1018 static VLC dc_chroma_vlc[2]; | |
| 307 | 1019 static VLC v2_dc_lum_vlc; |
| 1020 static VLC v2_dc_chroma_vlc; | |
| 1021 static VLC cbpy_vlc; | |
| 1022 static VLC v2_intra_cbpc_vlc; | |
| 1023 static VLC v2_mb_type_vlc; | |
| 1024 static VLC v2_mv_vlc; | |
| 457 | 1025 static VLC v1_intra_cbpc_vlc; |
| 1026 static VLC v1_inter_cbpc_vlc; | |
| 519 | 1027 static VLC inter_intra_vlc; |
| 307 | 1028 |
| 1029 /* this table is practically identical to the one from h263 except that its inverted */ | |
| 468 | 1030 static void init_h263_dc_for_msmpeg4(void) |
| 307 | 1031 { |
| 1032 int level, uni_code, uni_len; | |
| 1033 | |
| 309 | 1034 for(level=-256; level<256; level++){ |
| 307 | 1035 int size, v, l; |
| 1036 /* find number of bits */ | |
| 1037 size = 0; | |
| 1038 v = abs(level); | |
| 1039 while (v) { | |
| 1040 v >>= 1; | |
| 1041 size++; | |
| 1042 } | |
| 1043 | |
| 1044 if (level < 0) | |
| 1045 l= (-level) ^ ((1 << size) - 1); | |
| 1046 else | |
| 1047 l= level; | |
| 1048 | |
| 1049 /* luminance h263 */ | |
| 1050 uni_code= DCtab_lum[size][0]; | |
| 1051 uni_len = DCtab_lum[size][1]; | |
| 1052 uni_code ^= (1<<uni_len)-1; //M$ doesnt like compatibility | |
| 1053 | |
| 1054 if (size > 0) { | |
| 1055 uni_code<<=size; uni_code|=l; | |
| 1056 uni_len+=size; | |
| 1057 if (size > 8){ | |
| 1058 uni_code<<=1; uni_code|=1; | |
| 1059 uni_len++; | |
| 1060 } | |
| 1061 } | |
| 1062 v2_dc_lum_table[level+256][0]= uni_code; | |
| 1063 v2_dc_lum_table[level+256][1]= uni_len; | |
| 1064 | |
| 1065 /* chrominance h263 */ | |
| 1066 uni_code= DCtab_chrom[size][0]; | |
| 1067 uni_len = DCtab_chrom[size][1]; | |
| 1068 uni_code ^= (1<<uni_len)-1; //M$ doesnt like compatibility | |
| 1069 | |
| 1070 if (size > 0) { | |
| 1071 uni_code<<=size; uni_code|=l; | |
| 1072 uni_len+=size; | |
| 1073 if (size > 8){ | |
| 1074 uni_code<<=1; uni_code|=1; | |
| 1075 uni_len++; | |
| 1076 } | |
| 1077 } | |
| 1078 v2_dc_chroma_table[level+256][0]= uni_code; | |
| 1079 v2_dc_chroma_table[level+256][1]= uni_len; | |
| 1080 | |
| 1081 } | |
| 1082 } | |
| 0 | 1083 |
| 1084 /* init all vlc decoding tables */ | |
| 499 | 1085 int ff_msmpeg4_decode_init(MpegEncContext *s) |
| 0 | 1086 { |
| 483 | 1087 static int done = 0; |
| 0 | 1088 int i; |
| 1089 MVTable *mv; | |
| 1090 | |
| 499 | 1091 common_init(s); |
| 483 | 1092 |
| 1093 if (!done) { | |
| 1094 done = 1; | |
| 0 | 1095 |
| 483 | 1096 for(i=0;i<NB_RL_TABLES;i++) { |
| 1097 init_rl(&rl_table[i]); | |
| 1098 init_vlc_rl(&rl_table[i]); | |
| 1099 } | |
| 1100 for(i=0;i<2;i++) { | |
| 1101 mv = &mv_tables[i]; | |
| 531 | 1102 init_vlc(&mv->vlc, MV_VLC_BITS, mv->n + 1, |
| 483 | 1103 mv->table_mv_bits, 1, 1, |
| 1104 mv->table_mv_code, 2, 2); | |
| 1105 } | |
| 1106 | |
| 531 | 1107 init_vlc(&dc_lum_vlc[0], DC_VLC_BITS, 120, |
| 483 | 1108 &table0_dc_lum[0][1], 8, 4, |
| 1109 &table0_dc_lum[0][0], 8, 4); | |
| 531 | 1110 init_vlc(&dc_chroma_vlc[0], DC_VLC_BITS, 120, |
| 483 | 1111 &table0_dc_chroma[0][1], 8, 4, |
| 1112 &table0_dc_chroma[0][0], 8, 4); | |
| 531 | 1113 init_vlc(&dc_lum_vlc[1], DC_VLC_BITS, 120, |
| 483 | 1114 &table1_dc_lum[0][1], 8, 4, |
| 1115 &table1_dc_lum[0][0], 8, 4); | |
| 531 | 1116 init_vlc(&dc_chroma_vlc[1], DC_VLC_BITS, 120, |
| 483 | 1117 &table1_dc_chroma[0][1], 8, 4, |
| 1118 &table1_dc_chroma[0][0], 8, 4); | |
| 307 | 1119 |
| 531 | 1120 init_vlc(&v2_dc_lum_vlc, DC_VLC_BITS, 512, |
| 483 | 1121 &v2_dc_lum_table[0][1], 8, 4, |
| 1122 &v2_dc_lum_table[0][0], 8, 4); | |
| 531 | 1123 init_vlc(&v2_dc_chroma_vlc, DC_VLC_BITS, 512, |
| 483 | 1124 &v2_dc_chroma_table[0][1], 8, 4, |
| 1125 &v2_dc_chroma_table[0][0], 8, 4); | |
| 307 | 1126 |
| 531 | 1127 init_vlc(&cbpy_vlc, CBPY_VLC_BITS, 16, |
| 483 | 1128 &cbpy_tab[0][1], 2, 1, |
| 1129 &cbpy_tab[0][0], 2, 1); | |
| 531 | 1130 init_vlc(&v2_intra_cbpc_vlc, V2_INTRA_CBPC_VLC_BITS, 4, |
| 483 | 1131 &v2_intra_cbpc[0][1], 2, 1, |
| 1132 &v2_intra_cbpc[0][0], 2, 1); | |
| 531 | 1133 init_vlc(&v2_mb_type_vlc, V2_MB_TYPE_VLC_BITS, 8, |
| 483 | 1134 &v2_mb_type[0][1], 2, 1, |
| 1135 &v2_mb_type[0][0], 2, 1); | |
| 531 | 1136 init_vlc(&v2_mv_vlc, V2_MV_VLC_BITS, 33, |
| 483 | 1137 &mvtab[0][1], 2, 1, |
| 1138 &mvtab[0][0], 2, 1); | |
| 0 | 1139 |
| 936 | 1140 for(i=0; i<4; i++){ |
| 1141 init_vlc(&mb_non_intra_vlc[i], MB_NON_INTRA_VLC_BITS, 128, | |
| 1142 &wmv2_inter_table[i][0][1], 8, 4, | |
| 1143 &wmv2_inter_table[i][0][0], 8, 4); //FIXME name? | |
| 1144 } | |
| 1145 | |
| 531 | 1146 init_vlc(&mb_intra_vlc, MB_INTRA_VLC_BITS, 64, |
| 483 | 1147 &table_mb_intra[0][1], 4, 2, |
| 1148 &table_mb_intra[0][0], 4, 2); | |
| 457 | 1149 |
| 531 | 1150 init_vlc(&v1_intra_cbpc_vlc, V1_INTRA_CBPC_VLC_BITS, 8, |
| 483 | 1151 intra_MCBPC_bits, 1, 1, |
| 1152 intra_MCBPC_code, 1, 1); | |
| 531 | 1153 init_vlc(&v1_inter_cbpc_vlc, V1_INTER_CBPC_VLC_BITS, 25, |
| 483 | 1154 inter_MCBPC_bits, 1, 1, |
| 1155 inter_MCBPC_code, 1, 1); | |
| 519 | 1156 |
| 531 | 1157 init_vlc(&inter_intra_vlc, INTER_INTRA_VLC_BITS, 4, |
| 519 | 1158 &table_inter_intra[0][1], 2, 1, |
| 1159 &table_inter_intra[0][0], 2, 1); | |
| 483 | 1160 } |
|
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1161 |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1162 switch(s->msmpeg4_version){ |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1163 case 1: |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1164 case 2: |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1165 s->decode_mb= msmpeg4v12_decode_mb; |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1166 break; |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1167 case 3: |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1168 case 4: |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1169 s->decode_mb= msmpeg4v34_decode_mb; |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1170 break; |
| 936 | 1171 case 5: |
| 1172 s->decode_mb= wmv2_decode_mb; | |
| 1173 break; | |
|
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1174 } |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1175 |
|
769
9f8c4905928b
fixing decoding of streams with no keyframe at the start
michaelni
parents:
759
diff
changeset
|
1176 s->slice_height= s->mb_height; //to avoid 1/0 if the first frame isnt a keyframe |
|
9f8c4905928b
fixing decoding of streams with no keyframe at the start
michaelni
parents:
759
diff
changeset
|
1177 |
| 0 | 1178 return 0; |
| 1179 } | |
| 1180 | |
| 1181 static int decode012(GetBitContext *gb) | |
| 1182 { | |
| 1183 int n; | |
| 21 | 1184 n = get_bits1(gb); |
| 0 | 1185 if (n == 0) |
| 1186 return 0; | |
| 1187 else | |
| 21 | 1188 return get_bits1(gb) + 1; |
| 0 | 1189 } |
| 1190 | |
| 307 | 1191 int msmpeg4_decode_picture_header(MpegEncContext * s) |
|
300
d874359e58f1
msmpeg4v2 header parser & some dump bits code behind #if 0
michaelni
parents:
299
diff
changeset
|
1192 { |
| 499 | 1193 int code; |
|
300
d874359e58f1
msmpeg4v2 header parser & some dump bits code behind #if 0
michaelni
parents:
299
diff
changeset
|
1194 |
| 311 | 1195 #if 0 |
| 1196 { | |
| 1197 int i; | |
|
1025
1f9afd8b9131
GetBitContext.size is allways multiplied by 8 -> use size_in_bits to avoid useless *8 in a few inner loops
michaelni
parents:
983
diff
changeset
|
1198 for(i=0; i<s->gb.size_in_bits; i++) |
| 311 | 1199 printf("%d", get_bits1(&s->gb)); |
| 1200 // get_bits1(&s->gb); | |
| 1201 printf("END\n"); | |
| 1202 return -1; | |
| 1203 } | |
| 1204 #endif | |
| 457 | 1205 |
| 1206 if(s->msmpeg4_version==1){ | |
| 1207 int start_code, num; | |
| 1208 start_code = (get_bits(&s->gb, 16)<<16) | get_bits(&s->gb, 16); | |
| 1209 if(start_code!=0x00000100){ | |
| 1210 fprintf(stderr, "invalid startcode\n"); | |
| 1211 return -1; | |
| 1212 } | |
| 1213 | |
| 1214 num= get_bits(&s->gb, 5); // frame number */ | |
| 1215 } | |
| 1216 | |
|
300
d874359e58f1
msmpeg4v2 header parser & some dump bits code behind #if 0
michaelni
parents:
299
diff
changeset
|
1217 s->pict_type = get_bits(&s->gb, 2) + 1; |
|
d874359e58f1
msmpeg4v2 header parser & some dump bits code behind #if 0
michaelni
parents:
299
diff
changeset
|
1218 if (s->pict_type != I_TYPE && |
| 457 | 1219 s->pict_type != P_TYPE){ |
| 1220 fprintf(stderr, "invalid picture type\n"); | |
|
300
d874359e58f1
msmpeg4v2 header parser & some dump bits code behind #if 0
michaelni
parents:
299
diff
changeset
|
1221 return -1; |
| 457 | 1222 } |
| 519 | 1223 #if 0 |
| 1224 { | |
| 1225 static int had_i=0; | |
| 1226 if(s->pict_type == I_TYPE) had_i=1; | |
| 1227 if(!had_i) return -1; | |
| 1228 } | |
| 1229 #endif | |
|
300
d874359e58f1
msmpeg4v2 header parser & some dump bits code behind #if 0
michaelni
parents:
299
diff
changeset
|
1230 s->qscale = get_bits(&s->gb, 5); |
|
1063
fdeac9642346
check for qscale==0 (fixes 1/0 on one corrupted stream)
michaelni
parents:
1057
diff
changeset
|
1231 if(s->qscale==0){ |
|
fdeac9642346
check for qscale==0 (fixes 1/0 on one corrupted stream)
michaelni
parents:
1057
diff
changeset
|
1232 fprintf(stderr, "invalid qscale\n"); |
|
fdeac9642346
check for qscale==0 (fixes 1/0 on one corrupted stream)
michaelni
parents:
1057
diff
changeset
|
1233 return -1; |
|
fdeac9642346
check for qscale==0 (fixes 1/0 on one corrupted stream)
michaelni
parents:
1057
diff
changeset
|
1234 } |
|
300
d874359e58f1
msmpeg4v2 header parser & some dump bits code behind #if 0
michaelni
parents:
299
diff
changeset
|
1235 |
|
d874359e58f1
msmpeg4v2 header parser & some dump bits code behind #if 0
michaelni
parents:
299
diff
changeset
|
1236 if (s->pict_type == I_TYPE) { |
|
d874359e58f1
msmpeg4v2 header parser & some dump bits code behind #if 0
michaelni
parents:
299
diff
changeset
|
1237 code = get_bits(&s->gb, 5); |
| 457 | 1238 if(s->msmpeg4_version==1){ |
| 1239 if(code==0 || code>s->mb_height){ | |
| 1240 fprintf(stderr, "invalid slice height %d\n", code); | |
| 1241 return -1; | |
| 1242 } | |
| 1243 | |
| 1244 s->slice_height = code; | |
| 1245 }else{ | |
| 1246 /* 0x17: one slice, 0x18: two slices, ... */ | |
| 519 | 1247 if (code < 0x17){ |
| 1248 fprintf(stderr, "error, slice code was %X\n", code); | |
| 457 | 1249 return -1; |
| 519 | 1250 } |
| 457 | 1251 |
| 1252 s->slice_height = s->mb_height / (code - 0x16); | |
| 1253 } | |
| 311 | 1254 |
| 1255 switch(s->msmpeg4_version){ | |
| 457 | 1256 case 1: |
| 311 | 1257 case 2: |
| 307 | 1258 s->rl_chroma_table_index = 2; |
| 1259 s->rl_table_index = 2; | |
|
300
d874359e58f1
msmpeg4v2 header parser & some dump bits code behind #if 0
michaelni
parents:
299
diff
changeset
|
1260 |
| 307 | 1261 s->dc_table_index = 0; //not used |
| 311 | 1262 break; |
| 1263 case 3: | |
| 307 | 1264 s->rl_chroma_table_index = decode012(&s->gb); |
| 1265 s->rl_table_index = decode012(&s->gb); | |
| 0 | 1266 |
| 307 | 1267 s->dc_table_index = get_bits1(&s->gb); |
| 311 | 1268 break; |
| 1269 case 4: | |
| 499 | 1270 msmpeg4_decode_ext_header(s, (2+5+5+17+7)/8); |
| 1271 | |
| 578 | 1272 if(s->bit_rate > MBAC_BITRATE) s->per_mb_rl_table= get_bits1(&s->gb); |
| 1273 else s->per_mb_rl_table= 0; | |
| 519 | 1274 |
| 499 | 1275 if(!s->per_mb_rl_table){ |
| 1276 s->rl_chroma_table_index = decode012(&s->gb); | |
| 1277 s->rl_table_index = decode012(&s->gb); | |
| 311 | 1278 } |
| 1279 | |
| 499 | 1280 s->dc_table_index = get_bits1(&s->gb); |
| 519 | 1281 s->inter_intra_pred= 0; |
| 311 | 1282 break; |
| 307 | 1283 } |
| 0 | 1284 s->no_rounding = 1; |
| 519 | 1285 /* printf("qscale:%d rlc:%d rl:%d dc:%d mbrl:%d slice:%d \n", |
| 200 | 1286 s->qscale, |
| 1287 s->rl_chroma_table_index, | |
| 1288 s->rl_table_index, | |
| 499 | 1289 s->dc_table_index, |
| 519 | 1290 s->per_mb_rl_table, |
| 1291 s->slice_height);*/ | |
| 0 | 1292 } else { |
| 457 | 1293 switch(s->msmpeg4_version){ |
| 1294 case 1: | |
| 1295 case 2: | |
| 1296 if(s->msmpeg4_version==1) | |
| 1297 s->use_skip_mb_code = 1; | |
| 1298 else | |
| 1299 s->use_skip_mb_code = get_bits1(&s->gb); | |
| 307 | 1300 s->rl_table_index = 2; |
| 1301 s->rl_chroma_table_index = s->rl_table_index; | |
| 1302 s->dc_table_index = 0; //not used | |
| 1303 s->mv_table_index = 0; | |
| 457 | 1304 break; |
| 1305 case 3: | |
| 1306 s->use_skip_mb_code = get_bits1(&s->gb); | |
| 307 | 1307 s->rl_table_index = decode012(&s->gb); |
| 1308 s->rl_chroma_table_index = s->rl_table_index; | |
| 0 | 1309 |
| 307 | 1310 s->dc_table_index = get_bits1(&s->gb); |
| 1311 | |
| 1312 s->mv_table_index = get_bits1(&s->gb); | |
| 457 | 1313 break; |
| 499 | 1314 case 4: |
| 1315 s->use_skip_mb_code = get_bits1(&s->gb); | |
| 519 | 1316 |
| 578 | 1317 if(s->bit_rate > MBAC_BITRATE) s->per_mb_rl_table= get_bits1(&s->gb); |
| 1318 else s->per_mb_rl_table= 0; | |
| 519 | 1319 |
| 499 | 1320 if(!s->per_mb_rl_table){ |
| 1321 s->rl_table_index = decode012(&s->gb); | |
| 1322 s->rl_chroma_table_index = s->rl_table_index; | |
| 1323 } | |
| 1324 | |
| 1325 s->dc_table_index = get_bits1(&s->gb); | |
| 1326 | |
| 1327 s->mv_table_index = get_bits1(&s->gb); | |
| 578 | 1328 s->inter_intra_pred= (s->width*s->height < 320*240 && s->bit_rate<=II_BITRATE); |
| 499 | 1329 break; |
| 307 | 1330 } |
| 519 | 1331 /* printf("skip:%d rl:%d rlc:%d dc:%d mv:%d mbrl:%d qp:%d \n", |
| 200 | 1332 s->use_skip_mb_code, |
| 1333 s->rl_table_index, | |
| 1334 s->rl_chroma_table_index, | |
| 1335 s->dc_table_index, | |
| 499 | 1336 s->mv_table_index, |
| 519 | 1337 s->per_mb_rl_table, |
| 1338 s->qscale);*/ | |
| 208 | 1339 if(s->flipflop_rounding){ |
| 1340 s->no_rounding ^= 1; | |
| 1341 }else{ | |
| 1342 s->no_rounding = 0; | |
| 1343 } | |
| 0 | 1344 } |
| 936 | 1345 //printf("%d %d %d %d %d\n", s->pict_type, s->bit_rate, s->inter_intra_pred, s->width, s->height); |
| 499 | 1346 |
| 1347 s->esc3_level_length= 0; | |
| 1348 s->esc3_run_length= 0; | |
| 307 | 1349 |
| 0 | 1350 #ifdef DEBUG |
| 1351 printf("*****frame %d:\n", frame_count++); | |
| 1352 #endif | |
| 1353 return 0; | |
| 1354 } | |
| 1355 | |
| 208 | 1356 int msmpeg4_decode_ext_header(MpegEncContext * s, int buf_size) |
| 1357 { | |
| 457 | 1358 int left= buf_size*8 - get_bits_count(&s->gb); |
| 1359 int length= s->msmpeg4_version>=3 ? 17 : 16; | |
| 208 | 1360 /* the alt_bitstream reader could read over the end so we need to check it */ |
| 457 | 1361 if(left>=length && left<length+8) |
| 208 | 1362 { |
|
251
75091bfc577b
fixing msmpeg4 decoding if fps < 16 (i thought it was a indicator for the ext header, its the fps indeed)
michaelni
parents:
246
diff
changeset
|
1363 int fps; |
|
75091bfc577b
fixing msmpeg4 decoding if fps < 16 (i thought it was a indicator for the ext header, its the fps indeed)
michaelni
parents:
246
diff
changeset
|
1364 |
|
75091bfc577b
fixing msmpeg4 decoding if fps < 16 (i thought it was a indicator for the ext header, its the fps indeed)
michaelni
parents:
246
diff
changeset
|
1365 fps= get_bits(&s->gb, 5); |
| 578 | 1366 s->bit_rate= get_bits(&s->gb, 11)*1024; |
| 457 | 1367 if(s->msmpeg4_version>=3) |
| 1368 s->flipflop_rounding= get_bits1(&s->gb); | |
| 1369 else | |
| 1370 s->flipflop_rounding= 0; | |
|
251
75091bfc577b
fixing msmpeg4 decoding if fps < 16 (i thought it was a indicator for the ext header, its the fps indeed)
michaelni
parents:
246
diff
changeset
|
1371 |
| 578 | 1372 // printf("fps:%2d bps:%2d roundingType:%1d\n", fps, s->bit_rate/1024, s->flipflop_rounding); |
| 457 | 1373 } |
| 1374 else if(left<length+8) | |
| 1375 { | |
| 1376 s->flipflop_rounding= 0; | |
| 1377 printf("ext header missing, %d left\n", left); | |
| 208 | 1378 } |
| 1379 else | |
| 1380 { | |
| 457 | 1381 fprintf(stderr, "I frame too long, ignoring ext header\n"); |
| 208 | 1382 } |
|
251
75091bfc577b
fixing msmpeg4 decoding if fps < 16 (i thought it was a indicator for the ext header, its the fps indeed)
michaelni
parents:
246
diff
changeset
|
1383 |
| 208 | 1384 return 0; |
| 1385 } | |
| 1386 | |
|
440
000aeeac27a2
* started to cleanup name clashes for onetime compilation
kabi
parents:
429
diff
changeset
|
1387 static inline void msmpeg4_memsetw(short *tab, int val, int n) |
| 0 | 1388 { |
| 1389 int i; | |
| 1390 for(i=0;i<n;i++) | |
| 1391 tab[i] = val; | |
| 1392 } | |
| 1393 | |
| 310 | 1394 static void msmpeg4v2_encode_motion(MpegEncContext * s, int val) |
| 1395 { | |
| 1396 int range, bit_size, sign, code, bits; | |
| 1397 | |
| 1398 if (val == 0) { | |
| 1399 /* zero vector */ | |
| 1400 code = 0; | |
| 1401 put_bits(&s->pb, mvtab[code][1], mvtab[code][0]); | |
| 1402 } else { | |
| 1403 bit_size = s->f_code - 1; | |
| 1404 range = 1 << bit_size; | |
| 1405 if (val <= -64) | |
| 1406 val += 64; | |
| 1407 else if (val >= 64) | |
| 1408 val -= 64; | |
| 1409 | |
| 1410 if (val >= 0) { | |
| 1411 sign = 0; | |
| 1412 } else { | |
| 1413 val = -val; | |
| 1414 sign = 1; | |
| 1415 } | |
| 1416 val--; | |
| 1417 code = (val >> bit_size) + 1; | |
| 1418 bits = val & (range - 1); | |
| 1419 | |
| 1420 put_bits(&s->pb, mvtab[code][1] + 1, (mvtab[code][0] << 1) | sign); | |
| 1421 if (bit_size > 0) { | |
| 1422 put_bits(&s->pb, bit_size, bits); | |
| 1423 } | |
| 1424 } | |
| 1425 } | |
| 1426 | |
| 307 | 1427 /* this is identical to h263 except that its range is multiplied by 2 */ |
| 1428 static int msmpeg4v2_decode_motion(MpegEncContext * s, int pred, int f_code) | |
| 1429 { | |
| 1430 int code, val, sign, shift; | |
| 1431 | |
| 531 | 1432 code = get_vlc2(&s->gb, v2_mv_vlc.table, V2_MV_VLC_BITS, 2); |
| 457 | 1433 // printf("MV code %d at %d %d pred: %d\n", code, s->mb_x,s->mb_y, pred); |
| 307 | 1434 if (code < 0) |
| 1435 return 0xffff; | |
| 1436 | |
| 1437 if (code == 0) | |
| 1438 return pred; | |
| 1439 sign = get_bits1(&s->gb); | |
| 1440 shift = f_code - 1; | |
| 1441 val = (code - 1) << shift; | |
| 1442 if (shift > 0) | |
| 1443 val |= get_bits(&s->gb, shift); | |
| 1444 val++; | |
| 1445 if (sign) | |
| 1446 val = -val; | |
| 457 | 1447 |
| 307 | 1448 val += pred; |
| 1449 if (val <= -64) | |
| 1450 val += 64; | |
| 1451 else if (val >= 64) | |
| 1452 val -= 64; | |
| 1453 | |
| 1454 return val; | |
| 1455 } | |
| 1456 | |
|
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1457 static int msmpeg4v12_decode_mb(MpegEncContext *s, DCTELEM block[6][64]) |
| 307 | 1458 { |
| 1459 int cbp, code, i; | |
|
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1460 |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1461 s->error_status_table[s->mb_x + s->mb_y*s->mb_width]= 0; |
|
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1462 |
| 307 | 1463 if (s->pict_type == P_TYPE) { |
| 1464 if (s->use_skip_mb_code) { | |
| 1465 if (get_bits1(&s->gb)) { | |
| 1466 /* skip mb */ | |
| 1467 s->mb_intra = 0; | |
| 1468 for(i=0;i<6;i++) | |
| 1469 s->block_last_index[i] = -1; | |
| 1470 s->mv_dir = MV_DIR_FORWARD; | |
| 1471 s->mv_type = MV_TYPE_16X16; | |
| 1472 s->mv[0][0][0] = 0; | |
| 1473 s->mv[0][0][1] = 0; | |
| 1474 s->mb_skiped = 1; | |
| 1475 return 0; | |
| 1476 } | |
| 1477 } | |
| 1478 | |
| 457 | 1479 if(s->msmpeg4_version==2) |
| 531 | 1480 code = get_vlc2(&s->gb, v2_mb_type_vlc.table, V2_MB_TYPE_VLC_BITS, 1); |
| 457 | 1481 else |
| 531 | 1482 code = get_vlc2(&s->gb, v1_inter_cbpc_vlc.table, V1_INTER_CBPC_VLC_BITS, 3); |
| 457 | 1483 if(code<0 || code>7){ |
| 1484 fprintf(stderr, "cbpc %d invalid at %d %d\n", code, s->mb_x, s->mb_y); | |
| 1485 return -1; | |
| 1486 } | |
| 1487 | |
| 307 | 1488 s->mb_intra = code >>2; |
| 1489 | |
| 1490 cbp = code & 0x3; | |
| 1491 } else { | |
| 1492 s->mb_intra = 1; | |
| 457 | 1493 if(s->msmpeg4_version==2) |
| 531 | 1494 cbp= get_vlc2(&s->gb, v2_intra_cbpc_vlc.table, V2_INTRA_CBPC_VLC_BITS, 1); |
| 457 | 1495 else |
| 531 | 1496 cbp= get_vlc2(&s->gb, v1_intra_cbpc_vlc.table, V1_INTRA_CBPC_VLC_BITS, 1); |
| 457 | 1497 if(cbp<0 || cbp>3){ |
| 1498 fprintf(stderr, "cbpc %d invalid at %d %d\n", cbp, s->mb_x, s->mb_y); | |
| 1499 return -1; | |
| 1500 } | |
| 307 | 1501 } |
| 1502 | |
| 1503 if (!s->mb_intra) { | |
| 457 | 1504 int mx, my, cbpy; |
| 1505 | |
| 531 | 1506 cbpy= get_vlc2(&s->gb, cbpy_vlc.table, CBPY_VLC_BITS, 1); |
| 457 | 1507 if(cbpy<0){ |
| 1508 fprintf(stderr, "cbpy %d invalid at %d %d\n", cbp, s->mb_x, s->mb_y); | |
| 1509 return -1; | |
| 1510 } | |
| 307 | 1511 |
| 457 | 1512 cbp|= cbpy<<2; |
| 1513 if(s->msmpeg4_version==1 || (cbp&3) != 3) cbp^= 0x3C; | |
| 307 | 1514 |
| 1515 h263_pred_motion(s, 0, &mx, &my); | |
| 1516 mx= msmpeg4v2_decode_motion(s, mx, 1); | |
| 1517 my= msmpeg4v2_decode_motion(s, my, 1); | |
| 1518 | |
| 1519 s->mv_dir = MV_DIR_FORWARD; | |
| 1520 s->mv_type = MV_TYPE_16X16; | |
| 1521 s->mv[0][0][0] = mx; | |
| 1522 s->mv[0][0][1] = my; | |
| 1523 } else { | |
| 457 | 1524 if(s->msmpeg4_version==2){ |
| 1525 s->ac_pred = get_bits1(&s->gb); | |
| 531 | 1526 cbp|= get_vlc2(&s->gb, cbpy_vlc.table, CBPY_VLC_BITS, 1)<<2; //FIXME check errors |
| 457 | 1527 } else{ |
| 1528 s->ac_pred = 0; | |
| 531 | 1529 cbp|= get_vlc2(&s->gb, cbpy_vlc.table, CBPY_VLC_BITS, 1)<<2; //FIXME check errors |
| 457 | 1530 if(s->pict_type==P_TYPE) cbp^=0x3C; |
| 1531 } | |
| 307 | 1532 } |
| 1533 | |
| 1534 for (i = 0; i < 6; i++) { | |
| 936 | 1535 if (msmpeg4_decode_block(s, block[i], i, (cbp >> (5 - i)) & 1, NULL) < 0) |
| 307 | 1536 { |
| 457 | 1537 fprintf(stderr,"\nerror while decoding block: %d x %d (%d)\n", s->mb_x, s->mb_y, i); |
| 307 | 1538 return -1; |
| 1539 } | |
| 1540 } | |
| 1541 return 0; | |
| 1542 } | |
| 1543 | |
|
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1544 static int msmpeg4v34_decode_mb(MpegEncContext *s, DCTELEM block[6][64]) |
| 0 | 1545 { |
| 1546 int cbp, code, i; | |
| 1064 | 1547 uint8_t *coded_val; |
| 0 | 1548 |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1549 #ifdef PRINT_MB |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1550 if(s->mb_x==0){ |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1551 printf("\n"); |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1552 if(s->mb_y==0) printf("\n"); |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1553 } |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1554 #endif |
| 0 | 1555 |
|
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1556 s->error_status_table[s->mb_x + s->mb_y*s->mb_width]= 0; |
| 307 | 1557 |
| 0 | 1558 if (s->pict_type == P_TYPE) { |
| 1559 set_stat(ST_INTER_MB); | |
| 1560 if (s->use_skip_mb_code) { | |
| 21 | 1561 if (get_bits1(&s->gb)) { |
| 0 | 1562 /* skip mb */ |
| 1563 s->mb_intra = 0; | |
| 1564 for(i=0;i<6;i++) | |
| 1565 s->block_last_index[i] = -1; | |
| 1566 s->mv_dir = MV_DIR_FORWARD; | |
| 1567 s->mv_type = MV_TYPE_16X16; | |
| 1568 s->mv[0][0][0] = 0; | |
| 1569 s->mv[0][0][1] = 0; | |
|
7
1d3ac9654178
added skip macroblock optimization (big perf win on black regions for example)
glantau
parents:
0
diff
changeset
|
1570 s->mb_skiped = 1; |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1571 #ifdef PRINT_MB |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1572 printf("S "); |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1573 #endif |
| 0 | 1574 return 0; |
| 1575 } | |
| 1576 } | |
| 1577 | |
| 936 | 1578 code = get_vlc2(&s->gb, mb_non_intra_vlc[DEFAULT_INTER_INDEX].table, MB_NON_INTRA_VLC_BITS, 3); |
| 0 | 1579 if (code < 0) |
| 1580 return -1; | |
| 246 | 1581 //s->mb_intra = (code & 0x40) ? 0 : 1; |
| 1582 s->mb_intra = (~code & 0x40) >> 6; | |
| 0 | 1583 |
| 1584 cbp = code & 0x3f; | |
| 1585 } else { | |
| 1586 set_stat(ST_INTRA_MB); | |
| 1587 s->mb_intra = 1; | |
| 531 | 1588 code = get_vlc2(&s->gb, mb_intra_vlc.table, MB_INTRA_VLC_BITS, 2); |
| 0 | 1589 if (code < 0) |
| 1590 return -1; | |
| 1591 /* predict coded block pattern */ | |
| 1592 cbp = 0; | |
| 1593 for(i=0;i<6;i++) { | |
| 246 | 1594 int val = ((code >> (5 - i)) & 1); |
| 0 | 1595 if (i < 4) { |
| 246 | 1596 int pred = coded_block_pred(s, i, &coded_val); |
| 0 | 1597 val = val ^ pred; |
| 1598 *coded_val = val; | |
| 1599 } | |
| 1600 cbp |= val << (5 - i); | |
| 1601 } | |
| 1602 } | |
| 1603 | |
| 1604 if (!s->mb_intra) { | |
| 1605 int mx, my; | |
| 499 | 1606 //printf("P at %d %d\n", s->mb_x, s->mb_y); |
| 1607 if(s->per_mb_rl_table && cbp){ | |
| 1608 s->rl_table_index = decode012(&s->gb); | |
| 1609 s->rl_chroma_table_index = s->rl_table_index; | |
| 1610 } | |
| 0 | 1611 set_stat(ST_MV); |
| 1612 h263_pred_motion(s, 0, &mx, &my); | |
| 1613 if (msmpeg4_decode_motion(s, &mx, &my) < 0) | |
| 1614 return -1; | |
| 1615 s->mv_dir = MV_DIR_FORWARD; | |
| 1616 s->mv_type = MV_TYPE_16X16; | |
| 1617 s->mv[0][0][0] = mx; | |
| 1618 s->mv[0][0][1] = my; | |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1619 #ifdef PRINT_MB |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1620 printf("P "); |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1621 #endif |
| 0 | 1622 } else { |
| 499 | 1623 //printf("I at %d %d %d %06X\n", s->mb_x, s->mb_y, ((cbp&3)? 1 : 0) +((cbp&0x3C)? 2 : 0), show_bits(&s->gb, 24)); |
| 0 | 1624 set_stat(ST_INTRA_MB); |
| 21 | 1625 s->ac_pred = get_bits1(&s->gb); |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1626 #ifdef PRINT_MB |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1627 printf("%c", s->ac_pred ? 'A' : 'I'); |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1628 #endif |
| 519 | 1629 if(s->inter_intra_pred){ |
| 531 | 1630 s->h263_aic_dir= get_vlc2(&s->gb, inter_intra_vlc.table, INTER_INTRA_VLC_BITS, 1); |
| 519 | 1631 // printf("%d%d %d %d/", s->ac_pred, s->h263_aic_dir, s->mb_x, s->mb_y); |
| 1632 } | |
| 499 | 1633 if(s->per_mb_rl_table && cbp){ |
| 1634 s->rl_table_index = decode012(&s->gb); | |
| 1635 s->rl_chroma_table_index = s->rl_table_index; | |
| 1636 } | |
| 0 | 1637 } |
| 1638 | |
| 1639 for (i = 0; i < 6; i++) { | |
| 936 | 1640 if (msmpeg4_decode_block(s, block[i], i, (cbp >> (5 - i)) & 1, NULL) < 0) |
| 246 | 1641 { |
| 457 | 1642 fprintf(stderr,"\nerror while decoding block: %d x %d (%d)\n", s->mb_x, s->mb_y, i); |
| 1643 return -1; | |
| 246 | 1644 } |
| 0 | 1645 } |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1646 |
| 0 | 1647 return 0; |
| 1648 } | |
| 563 | 1649 //#define ERROR_DETAILS |
| 499 | 1650 static inline int msmpeg4_decode_block(MpegEncContext * s, DCTELEM * block, |
| 936 | 1651 int n, int coded, const uint8_t *scan_table) |
| 0 | 1652 { |
| 542 | 1653 int level, i, last, run, run_diff; |
| 0 | 1654 int dc_pred_dir; |
| 1655 RLTable *rl; | |
| 542 | 1656 RL_VLC_ELEM *rl_vlc; |
| 200 | 1657 int qmul, qadd; |
| 0 | 1658 |
| 1659 if (s->mb_intra) { | |
| 200 | 1660 qmul=1; |
| 1661 qadd=0; | |
| 1662 | |
| 0 | 1663 /* DC coef */ |
| 1664 set_stat(ST_DC); | |
| 1665 level = msmpeg4_decode_dc(s, n, &dc_pred_dir); | |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1666 #ifdef PRINT_MB |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1667 { |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1668 static int c; |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1669 if(n==0) c=0; |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1670 if(n==4) printf("%X", c); |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1671 c+= c +dc_pred_dir; |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1672 } |
|
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1673 #endif |
| 457 | 1674 if (level < 0){ |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1675 fprintf(stderr, "dc overflow- block: %d qscale: %d//\n", n, s->qscale); |
| 519 | 1676 if(s->inter_intra_pred) level=0; |
| 1677 else return -1; | |
| 457 | 1678 } |
| 0 | 1679 if (n < 4) { |
| 1680 rl = &rl_table[s->rl_table_index]; | |
| 457 | 1681 if(level > 256*s->y_dc_scale){ |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1682 fprintf(stderr, "dc overflow+ L qscale: %d//\n", s->qscale); |
| 519 | 1683 if(!s->inter_intra_pred) return -1; |
| 457 | 1684 } |
| 0 | 1685 } else { |
| 1686 rl = &rl_table[3 + s->rl_chroma_table_index]; | |
| 457 | 1687 if(level > 256*s->c_dc_scale){ |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1688 fprintf(stderr, "dc overflow+ C qscale: %d//\n", s->qscale); |
| 519 | 1689 if(!s->inter_intra_pred) return -1; |
| 457 | 1690 } |
| 0 | 1691 } |
| 457 | 1692 block[0] = level; |
| 200 | 1693 |
| 0 | 1694 run_diff = 0; |
| 542 | 1695 i = 0; |
| 0 | 1696 if (!coded) { |
| 1697 goto not_coded; | |
| 1698 } | |
| 1699 if (s->ac_pred) { | |
| 1700 if (dc_pred_dir == 0) | |
|
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
601
diff
changeset
|
1701 scan_table = s->intra_v_scantable.permutated; /* left */ |
| 0 | 1702 else |
|
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
601
diff
changeset
|
1703 scan_table = s->intra_h_scantable.permutated; /* top */ |
| 0 | 1704 } else { |
|
706
e65798d228ea
idct permutation cleanup, idct can be selected per context now
michaelni
parents:
601
diff
changeset
|
1705 scan_table = s->intra_scantable.permutated; |
| 0 | 1706 } |
| 1707 set_stat(ST_INTRA_AC); | |
| 542 | 1708 rl_vlc= rl->rl_vlc[0]; |
| 0 | 1709 } else { |
| 200 | 1710 qmul = s->qscale << 1; |
| 1711 qadd = (s->qscale - 1) | 1; | |
| 542 | 1712 i = -1; |
| 0 | 1713 rl = &rl_table[3 + s->rl_table_index]; |
| 307 | 1714 |
| 1715 if(s->msmpeg4_version==2) | |
| 1716 run_diff = 0; | |
| 1717 else | |
| 1718 run_diff = 1; | |
| 1719 | |
| 0 | 1720 if (!coded) { |
| 542 | 1721 s->block_last_index[n] = i; |
| 0 | 1722 return 0; |
| 1723 } | |
| 936 | 1724 if(!scan_table) |
| 1725 scan_table = s->inter_scantable.permutated; | |
| 0 | 1726 set_stat(ST_INTER_AC); |
| 542 | 1727 rl_vlc= rl->rl_vlc[s->qscale]; |
| 0 | 1728 } |
| 542 | 1729 { |
| 1730 OPEN_READER(re, &s->gb); | |
| 0 | 1731 for(;;) { |
| 542 | 1732 UPDATE_CACHE(re, &s->gb); |
| 1733 GET_RL_VLC(level, run, re, &s->gb, rl_vlc, TEX_VLC_BITS, 2); | |
| 1734 if (level==0) { | |
| 1735 int cache; | |
| 1736 cache= GET_CACHE(re, &s->gb); | |
| 0 | 1737 /* escape */ |
| 542 | 1738 if (s->msmpeg4_version==1 || (cache&0x80000000)==0) { |
| 1739 if (s->msmpeg4_version==1 || (cache&0x40000000)==0) { | |
| 0 | 1740 /* third escape */ |
| 542 | 1741 if(s->msmpeg4_version!=1) LAST_SKIP_BITS(re, &s->gb, 2); |
| 1742 UPDATE_CACHE(re, &s->gb); | |
| 499 | 1743 if(s->msmpeg4_version<=3){ |
| 542 | 1744 last= SHOW_UBITS(re, &s->gb, 1); SKIP_CACHE(re, &s->gb, 1); |
| 1745 run= SHOW_UBITS(re, &s->gb, 6); SKIP_CACHE(re, &s->gb, 6); | |
| 1746 level= SHOW_SBITS(re, &s->gb, 8); LAST_SKIP_CACHE(re, &s->gb, 8); | |
| 1747 SKIP_COUNTER(re, &s->gb, 1+6+8); | |
| 1748 }else{ | |
| 499 | 1749 int sign; |
| 542 | 1750 last= SHOW_UBITS(re, &s->gb, 1); SKIP_BITS(re, &s->gb, 1); |
| 499 | 1751 if(!s->esc3_level_length){ |
| 1752 int ll; | |
| 1753 //printf("ESC-3 %X at %d %d\n", show_bits(&s->gb, 24), s->mb_x, s->mb_y); | |
| 1754 if(s->qscale<8){ | |
| 542 | 1755 ll= SHOW_UBITS(re, &s->gb, 3); SKIP_BITS(re, &s->gb, 3); |
| 499 | 1756 if(ll==0){ |
| 542 | 1757 if(SHOW_UBITS(re, &s->gb, 1)) printf("cool a new vlc code ,contact the ffmpeg developers and upload the file\n"); |
| 1758 SKIP_BITS(re, &s->gb, 1); | |
| 499 | 1759 ll=8; |
| 1760 } | |
| 1761 }else{ | |
| 1762 ll=2; | |
| 542 | 1763 while(ll<8 && SHOW_UBITS(re, &s->gb, 1)==0){ |
| 1764 ll++; | |
| 1765 SKIP_BITS(re, &s->gb, 1); | |
| 1766 } | |
| 578 | 1767 if(ll<8) SKIP_BITS(re, &s->gb, 1); |
| 499 | 1768 } |
| 1769 | |
| 1770 s->esc3_level_length= ll; | |
| 542 | 1771 s->esc3_run_length= SHOW_UBITS(re, &s->gb, 2) + 3; SKIP_BITS(re, &s->gb, 2); |
| 499 | 1772 //printf("level length:%d, run length: %d\n", ll, s->esc3_run_length); |
| 578 | 1773 UPDATE_CACHE(re, &s->gb); |
| 499 | 1774 } |
| 542 | 1775 run= SHOW_UBITS(re, &s->gb, s->esc3_run_length); |
| 1776 SKIP_BITS(re, &s->gb, s->esc3_run_length); | |
| 1777 | |
| 1778 sign= SHOW_UBITS(re, &s->gb, 1); | |
| 1779 SKIP_BITS(re, &s->gb, 1); | |
| 1780 | |
| 1781 level= SHOW_UBITS(re, &s->gb, s->esc3_level_length); | |
| 1782 SKIP_BITS(re, &s->gb, s->esc3_level_length); | |
| 499 | 1783 if(sign) level= -level; |
| 1784 } | |
| 1785 //printf("level: %d, run: %d at %d %d\n", level, run, s->mb_x, s->mb_y); | |
| 457 | 1786 #if 0 // waste of time / this will detect very few errors |
| 1787 { | |
| 1788 const int abs_level= ABS(level); | |
| 1789 const int run1= run - rl->max_run[last][abs_level] - run_diff; | |
| 1790 if(abs_level<=MAX_LEVEL && run<=MAX_RUN){ | |
| 1791 if(abs_level <= rl->max_level[last][run]){ | |
| 1792 fprintf(stderr, "illegal 3. esc, vlc encoding possible\n"); | |
| 1793 return DECODING_AC_LOST; | |
| 1794 } | |
| 1795 if(abs_level <= rl->max_level[last][run]*2){ | |
| 1796 fprintf(stderr, "illegal 3. esc, esc 1 encoding possible\n"); | |
| 1797 return DECODING_AC_LOST; | |
| 1798 } | |
| 499 | 1799 if(run1>=0 && abs_level <= rl->max_level[last][run1]){ |
| 457 | 1800 fprintf(stderr, "illegal 3. esc, esc 2 encoding possible\n"); |
| 1801 return DECODING_AC_LOST; | |
| 1802 } | |
| 1803 } | |
| 1804 } | |
| 1805 #endif | |
| 246 | 1806 //level = level * qmul + (level>0) * qadd - (level<=0) * qadd ; |
| 1807 if (level>0) level= level * qmul + qadd; | |
| 457 | 1808 else level= level * qmul - qadd; |
| 1809 #if 0 // waste of time too :( | |
| 1810 if(level>2048 || level<-2048){ | |
| 1811 fprintf(stderr, "|level| overflow in 3. esc\n"); | |
| 1812 return DECODING_AC_LOST; | |
| 1813 } | |
| 1814 #endif | |
| 542 | 1815 i+= run + 1; |
| 1816 if(last) i+=192; | |
| 563 | 1817 #ifdef ERROR_DETAILS |
| 1818 if(run==66) | |
| 1819 fprintf(stderr, "illegal vlc code in ESC3 level=%d\n", level); | |
| 1820 else if((i>62 && i<192) || i>192+63) | |
| 1821 fprintf(stderr, "run overflow in ESC3 i=%d run=%d level=%d\n", i, run, level); | |
| 1822 #endif | |
| 0 | 1823 } else { |
| 1824 /* second escape */ | |
| 542 | 1825 #if MIN_CACHE_BITS < 23 |
| 1826 LAST_SKIP_BITS(re, &s->gb, 2); | |
| 1827 UPDATE_CACHE(re, &s->gb); | |
| 1828 #else | |
| 1829 SKIP_BITS(re, &s->gb, 2); | |
| 1830 #endif | |
| 1831 GET_RL_VLC(level, run, re, &s->gb, rl_vlc, TEX_VLC_BITS, 2); | |
| 1832 i+= run + rl->max_run[run>>7][level/qmul] + run_diff; //FIXME opt indexing | |
| 1833 level = (level ^ SHOW_SBITS(re, &s->gb, 1)) - SHOW_SBITS(re, &s->gb, 1); | |
| 1834 LAST_SKIP_BITS(re, &s->gb, 1); | |
| 563 | 1835 #ifdef ERROR_DETAILS |
| 1836 if(run==66) | |
| 1837 fprintf(stderr, "illegal vlc code in ESC2 level=%d\n", level); | |
| 1838 else if((i>62 && i<192) || i>192+63) | |
| 1839 fprintf(stderr, "run overflow in ESC2 i=%d run=%d level=%d\n", i, run, level); | |
| 1840 #endif | |
| 0 | 1841 } |
| 1842 } else { | |
| 1843 /* first escape */ | |
| 542 | 1844 #if MIN_CACHE_BITS < 22 |
| 1845 LAST_SKIP_BITS(re, &s->gb, 1); | |
| 1846 UPDATE_CACHE(re, &s->gb); | |
| 1847 #else | |
| 1848 SKIP_BITS(re, &s->gb, 1); | |
| 1849 #endif | |
| 1850 GET_RL_VLC(level, run, re, &s->gb, rl_vlc, TEX_VLC_BITS, 2); | |
| 1851 i+= run; | |
| 1852 level = level + rl->max_level[run>>7][(run-1)&63] * qmul;//FIXME opt indexing | |
| 1853 level = (level ^ SHOW_SBITS(re, &s->gb, 1)) - SHOW_SBITS(re, &s->gb, 1); | |
| 1854 LAST_SKIP_BITS(re, &s->gb, 1); | |
| 563 | 1855 #ifdef ERROR_DETAILS |
| 1856 if(run==66) | |
| 1857 fprintf(stderr, "illegal vlc code in ESC1 level=%d\n", level); | |
| 1858 else if((i>62 && i<192) || i>192+63) | |
| 1859 fprintf(stderr, "run overflow in ESC1 i=%d run=%d level=%d\n", i, run, level); | |
| 1860 #endif | |
| 0 | 1861 } |
| 1862 } else { | |
| 542 | 1863 i+= run; |
| 1864 level = (level ^ SHOW_SBITS(re, &s->gb, 1)) - SHOW_SBITS(re, &s->gb, 1); | |
| 1865 LAST_SKIP_BITS(re, &s->gb, 1); | |
| 563 | 1866 #ifdef ERROR_DETAILS |
| 1867 if(run==66) | |
| 1868 fprintf(stderr, "illegal vlc code level=%d\n", level); | |
| 1869 else if((i>62 && i<192) || i>192+63) | |
| 1870 fprintf(stderr, "run overflow i=%d run=%d level=%d\n", i, run, level); | |
| 1871 #endif | |
| 0 | 1872 } |
| 542 | 1873 if (i > 62){ |
| 1874 i-= 192; | |
| 1875 if(i&(~63)){ | |
|
1025
1f9afd8b9131
GetBitContext.size is allways multiplied by 8 -> use size_in_bits to avoid useless *8 in a few inner loops
michaelni
parents:
983
diff
changeset
|
1876 const int left= s->gb.size_in_bits - get_bits_count(&s->gb); |
|
745
25d7fb7c89be
better/cleaner error resilience (done in a 2nd pass after decoding)
michaelni
parents:
743
diff
changeset
|
1877 if(((i+192 == 64 && level/qmul==-1) || s->error_resilience<=1) && left>=0){ |
| 563 | 1878 fprintf(stderr, "ignoring overflow at %d %d\n", s->mb_x, s->mb_y); |
| 1879 break; | |
| 1880 }else{ | |
| 1881 fprintf(stderr, "ac-tex damaged at %d %d\n", s->mb_x, s->mb_y); | |
| 1882 return -1; | |
| 1883 } | |
| 542 | 1884 } |
| 1885 | |
| 1886 block[scan_table[i]] = level; | |
| 1887 break; | |
| 499 | 1888 } |
| 457 | 1889 |
| 542 | 1890 block[scan_table[i]] = level; |
| 0 | 1891 } |
| 542 | 1892 CLOSE_READER(re, &s->gb); |
| 1893 } | |
| 0 | 1894 not_coded: |
| 1895 if (s->mb_intra) { | |
| 1896 mpeg4_pred_ac(s, block, n, dc_pred_dir); | |
| 1897 if (s->ac_pred) { | |
| 542 | 1898 i = 63; /* XXX: not optimal */ |
| 0 | 1899 } |
| 1900 } | |
| 936 | 1901 if(s->msmpeg4_version>=4 && i>0) i=63; //FIXME/XXX optimize |
| 542 | 1902 s->block_last_index[n] = i; |
| 499 | 1903 |
| 0 | 1904 return 0; |
| 1905 } | |
| 1906 | |
| 1907 static int msmpeg4_decode_dc(MpegEncContext * s, int n, int *dir_ptr) | |
| 1908 { | |
| 1909 int level, pred; | |
| 1910 | |
| 457 | 1911 if(s->msmpeg4_version<=2){ |
| 307 | 1912 if (n < 4) { |
| 531 | 1913 level = get_vlc2(&s->gb, v2_dc_lum_vlc.table, DC_VLC_BITS, 3); |
| 307 | 1914 } else { |
| 531 | 1915 level = get_vlc2(&s->gb, v2_dc_chroma_vlc.table, DC_VLC_BITS, 3); |
| 307 | 1916 } |
| 309 | 1917 if (level < 0) |
| 307 | 1918 return -1; |
| 1919 level-=256; | |
| 1920 }else{ //FIXME optimize use unified tables & index | |
| 1921 if (n < 4) { | |
| 531 | 1922 level = get_vlc2(&s->gb, dc_lum_vlc[s->dc_table_index].table, DC_VLC_BITS, 3); |
| 307 | 1923 } else { |
| 531 | 1924 level = get_vlc2(&s->gb, dc_chroma_vlc[s->dc_table_index].table, DC_VLC_BITS, 3); |
| 307 | 1925 } |
| 457 | 1926 if (level < 0){ |
| 1927 fprintf(stderr, "illegal dc vlc\n"); | |
| 307 | 1928 return -1; |
| 457 | 1929 } |
| 307 | 1930 |
| 1931 if (level == DC_MAX) { | |
| 1932 level = get_bits(&s->gb, 8); | |
| 1933 if (get_bits1(&s->gb)) | |
| 1934 level = -level; | |
| 1935 } else if (level != 0) { | |
| 1936 if (get_bits1(&s->gb)) | |
| 1937 level = -level; | |
| 1938 } | |
| 0 | 1939 } |
| 1940 | |
| 457 | 1941 if(s->msmpeg4_version==1){ |
| 1064 | 1942 int32_t *dc_val; |
| 457 | 1943 pred = msmpeg4v1_pred_dc(s, n, &dc_val); |
| 1944 level += pred; | |
| 1945 | |
| 1946 /* update predictor */ | |
| 1947 *dc_val= level; | |
| 1948 }else{ | |
| 1064 | 1949 uint16_t *dc_val; |
|
501
2241bce35bb9
fixing wmv1 bugs, it was foolish to belive that m$ would use the same dc prediction as mpeg4 just cuz they changed it a bit from msmpeg4v3
michaelni
parents:
499
diff
changeset
|
1950 pred = msmpeg4_pred_dc(s, n, &dc_val, dir_ptr); |
| 457 | 1951 level += pred; |
| 0 | 1952 |
| 457 | 1953 /* update predictor */ |
| 1954 if (n < 4) { | |
| 1955 *dc_val = level * s->y_dc_scale; | |
| 1956 } else { | |
| 1957 *dc_val = level * s->c_dc_scale; | |
| 1958 } | |
| 0 | 1959 } |
| 1960 | |
| 1961 return level; | |
| 1962 } | |
| 1963 | |
| 1964 static int msmpeg4_decode_motion(MpegEncContext * s, | |
| 1965 int *mx_ptr, int *my_ptr) | |
| 1966 { | |
| 1967 MVTable *mv; | |
| 1968 int code, mx, my; | |
| 1969 | |
| 1970 mv = &mv_tables[s->mv_table_index]; | |
| 1971 | |
| 531 | 1972 code = get_vlc2(&s->gb, mv->vlc.table, MV_VLC_BITS, 2); |
| 499 | 1973 if (code < 0){ |
| 1974 fprintf(stderr, "illegal MV code at %d %d\n", s->mb_x, s->mb_y); | |
| 0 | 1975 return -1; |
| 499 | 1976 } |
| 0 | 1977 if (code == mv->n) { |
| 499 | 1978 //printf("MV ESC %X at %d %d\n", show_bits(&s->gb, 24), s->mb_x, s->mb_y); |
| 0 | 1979 mx = get_bits(&s->gb, 6); |
| 1980 my = get_bits(&s->gb, 6); | |
| 1981 } else { | |
| 1982 mx = mv->table_mvx[code]; | |
| 1983 my = mv->table_mvy[code]; | |
| 1984 } | |
| 1985 | |
| 1986 mx += *mx_ptr - 32; | |
| 1987 my += *my_ptr - 32; | |
| 1988 /* WARNING : they do not do exactly modulo encoding */ | |
| 1989 if (mx <= -64) | |
| 1990 mx += 64; | |
| 1991 else if (mx >= 64) | |
| 1992 mx -= 64; | |
| 1993 | |
| 1994 if (my <= -64) | |
| 1995 my += 64; | |
| 1996 else if (my >= 64) | |
| 1997 my -= 64; | |
| 1998 *mx_ptr = mx; | |
| 1999 *my_ptr = my; | |
| 2000 return 0; | |
| 2001 } | |
| 936 | 2002 |
| 2003 /* cleanest way to support it | |
| 2004 * there is too much shared between versions so that we cant have 1 file per version & 1 common | |
| 2005 * as allmost everything would be in the common file | |
| 2006 */ | |
| 2007 #include "wmv2.c" |
