FFmpeg
 All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
h264_refs.c
Go to the documentation of this file.
1 /*
2  * H.26L/H.264/AVC/JVT/14496-10/... reference picture handling
3  * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
4  *
5  * This file is part of FFmpeg.
6  *
7  * FFmpeg is free software; you can redistribute it and/or
8  * modify it under the terms of the GNU Lesser General Public
9  * License as published by the Free Software Foundation; either
10  * version 2.1 of the License, or (at your option) any later version.
11  *
12  * FFmpeg is distributed in the hope that it will be useful,
13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15  * Lesser General Public License for more details.
16  *
17  * You should have received a copy of the GNU Lesser General Public
18  * License along with FFmpeg; if not, write to the Free Software
19  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20  */
21 
22 /**
23  * @file
24  * H.264 / AVC / MPEG4 part10 reference picture handling.
25  * @author Michael Niedermayer <michaelni@gmx.at>
26  */
27 
28 #include "libavutil/avassert.h"
29 #include "internal.h"
30 #include "dsputil.h"
31 #include "avcodec.h"
32 #include "h264.h"
33 #include "golomb.h"
34 
35 //#undef NDEBUG
36 #include <assert.h>
37 
38 
39 static void pic_as_field(Picture *pic, const int parity){
40  int i;
41  for (i = 0; i < 4; ++i) {
42  if (parity == PICT_BOTTOM_FIELD)
43  pic->f.data[i] += pic->f.linesize[i];
44  pic->f.reference = parity;
45  pic->f.linesize[i] *= 2;
46  }
47  pic->poc= pic->field_poc[parity == PICT_BOTTOM_FIELD];
48 }
49 
50 static int split_field_copy(Picture *dest, Picture *src,
51  int parity, int id_add){
52  int match = !!(src->f.reference & parity);
53 
54  if (match) {
55  *dest = *src;
56  if(parity != PICT_FRAME){
57  pic_as_field(dest, parity);
58  dest->pic_id *= 2;
59  dest->pic_id += id_add;
60  }
61  }
62 
63  return match;
64 }
65 
66 static int build_def_list(Picture *def, Picture **in, int len, int is_long, int sel){
67  int i[2]={0};
68  int index=0;
69 
70  while(i[0]<len || i[1]<len){
71  while (i[0] < len && !(in[ i[0] ] && (in[ i[0] ]->f.reference & sel)))
72  i[0]++;
73  while (i[1] < len && !(in[ i[1] ] && (in[ i[1] ]->f.reference & (sel^3))))
74  i[1]++;
75  if(i[0] < len){
76  in[ i[0] ]->pic_id= is_long ? i[0] : in[ i[0] ]->frame_num;
77  split_field_copy(&def[index++], in[ i[0]++ ], sel , 1);
78  }
79  if(i[1] < len){
80  in[ i[1] ]->pic_id= is_long ? i[1] : in[ i[1] ]->frame_num;
81  split_field_copy(&def[index++], in[ i[1]++ ], sel^3, 0);
82  }
83  }
84 
85  return index;
86 }
87 
88 static int add_sorted(Picture **sorted, Picture **src, int len, int limit, int dir){
89  int i, best_poc;
90  int out_i= 0;
91 
92  for(;;){
93  best_poc= dir ? INT_MIN : INT_MAX;
94 
95  for(i=0; i<len; i++){
96  const int poc= src[i]->poc;
97  if(((poc > limit) ^ dir) && ((poc < best_poc) ^ dir)){
98  best_poc= poc;
99  sorted[out_i]= src[i];
100  }
101  }
102  if(best_poc == (dir ? INT_MIN : INT_MAX))
103  break;
104  limit= sorted[out_i++]->poc - dir;
105  }
106  return out_i;
107 }
108 
110  MpegEncContext * const s = &h->s;
111  int i, len;
112 
114  Picture *sorted[32];
115  int cur_poc, list;
116  int lens[2];
117 
118  if(FIELD_PICTURE)
120  else
121  cur_poc= s->current_picture_ptr->poc;
122 
123  for(list= 0; list<2; list++){
124  len= add_sorted(sorted , h->short_ref, h->short_ref_count, cur_poc, 1^list);
125  len+=add_sorted(sorted+len, h->short_ref, h->short_ref_count, cur_poc, 0^list);
126  av_assert0(len<=32);
127  len= build_def_list(h->default_ref_list[list] , sorted , len, 0, s->picture_structure);
128  len+=build_def_list(h->default_ref_list[list]+len, h->long_ref, 16 , 1, s->picture_structure);
129  av_assert0(len<=32);
130 
131  if(len < h->ref_count[list])
132  memset(&h->default_ref_list[list][len], 0, sizeof(Picture)*(h->ref_count[list] - len));
133  lens[list]= len;
134  }
135 
136  if(lens[0] == lens[1] && lens[1] > 1){
137  for (i = 0; h->default_ref_list[0][i].f.data[0] == h->default_ref_list[1][i].f.data[0] && i < lens[0]; i++);
138  if(i == lens[0])
139  FFSWAP(Picture, h->default_ref_list[1][0], h->default_ref_list[1][1]);
140  }
141  }else{
143  len+= build_def_list(h->default_ref_list[0]+len, h-> long_ref, 16 , 1, s->picture_structure);
144  av_assert0(len<=32);
145  if(len < h->ref_count[0])
146  memset(&h->default_ref_list[0][len], 0, sizeof(Picture)*(h->ref_count[0] - len));
147  }
148 #ifdef TRACE
149  for (i=0; i<h->ref_count[0]; i++) {
150  tprintf(h->s.avctx, "List0: %s fn:%d 0x%p\n", (h->default_ref_list[0][i].long_ref ? "LT" : "ST"), h->default_ref_list[0][i].pic_id, h->default_ref_list[0][i].f.data[0]);
151  }
153  for (i=0; i<h->ref_count[1]; i++) {
154  tprintf(h->s.avctx, "List1: %s fn:%d 0x%p\n", (h->default_ref_list[1][i].long_ref ? "LT" : "ST"), h->default_ref_list[1][i].pic_id, h->default_ref_list[1][i].f.data[0]);
155  }
156  }
157 #endif
158  return 0;
159 }
160 
161 static void print_short_term(H264Context *h);
162 static void print_long_term(H264Context *h);
163 
164 /**
165  * Extract structure information about the picture described by pic_num in
166  * the current decoding context (frame or field). Note that pic_num is
167  * picture number without wrapping (so, 0<=pic_num<max_pic_num).
168  * @param pic_num picture number for which to extract structure information
169  * @param structure one of PICT_XXX describing structure of picture
170  * with pic_num
171  * @return frame number (short term) or long term index of picture
172  * described by pic_num
173  */
174 static int pic_num_extract(H264Context *h, int pic_num, int *structure){
175  MpegEncContext * const s = &h->s;
176 
177  *structure = s->picture_structure;
178  if(FIELD_PICTURE){
179  if (!(pic_num & 1))
180  /* opposite field */
181  *structure ^= PICT_FRAME;
182  pic_num >>= 1;
183  }
184 
185  return pic_num;
186 }
187 
189  MpegEncContext * const s = &h->s;
190  int list, index, pic_structure;
191 
192  print_short_term(h);
193  print_long_term(h);
194 
195  for(list=0; list<h->list_count; list++){
196  memcpy(h->ref_list[list], h->default_ref_list[list], sizeof(Picture)*h->ref_count[list]);
197 
198  if(get_bits1(&s->gb)){
199  int pred= h->curr_pic_num;
200 
201  for(index=0; ; index++){
202  unsigned int reordering_of_pic_nums_idc= get_ue_golomb_31(&s->gb);
203  unsigned int pic_id;
204  int i;
205  Picture *ref = NULL;
206 
207  if(reordering_of_pic_nums_idc==3)
208  break;
209 
210  if(index >= h->ref_count[list]){
211  av_log(h->s.avctx, AV_LOG_ERROR, "reference count overflow\n");
212  return -1;
213  }
214 
215  if(reordering_of_pic_nums_idc<3){
216  if(reordering_of_pic_nums_idc<2){
217  const unsigned int abs_diff_pic_num= get_ue_golomb(&s->gb) + 1;
218  int frame_num;
219 
220  if(abs_diff_pic_num > h->max_pic_num){
221  av_log(h->s.avctx, AV_LOG_ERROR, "abs_diff_pic_num overflow\n");
222  return -1;
223  }
224 
225  if(reordering_of_pic_nums_idc == 0) pred-= abs_diff_pic_num;
226  else pred+= abs_diff_pic_num;
227  pred &= h->max_pic_num - 1;
228 
229  frame_num = pic_num_extract(h, pred, &pic_structure);
230 
231  for(i= h->short_ref_count-1; i>=0; i--){
232  ref = h->short_ref[i];
233  assert(ref->f.reference);
234  assert(!ref->long_ref);
235  if(
236  ref->frame_num == frame_num &&
237  (ref->f.reference & pic_structure)
238  )
239  break;
240  }
241  if(i>=0)
242  ref->pic_id= pred;
243  }else{
244  int long_idx;
245  pic_id= get_ue_golomb(&s->gb); //long_term_pic_idx
246 
247  long_idx= pic_num_extract(h, pic_id, &pic_structure);
248 
249  if(long_idx>31){
250  av_log(h->s.avctx, AV_LOG_ERROR, "long_term_pic_idx overflow\n");
251  return -1;
252  }
253  ref = h->long_ref[long_idx];
254  assert(!(ref && !ref->f.reference));
255  if (ref && (ref->f.reference & pic_structure)) {
256  ref->pic_id= pic_id;
257  assert(ref->long_ref);
258  i=0;
259  }else{
260  i=-1;
261  }
262  }
263 
264  if (i < 0) {
265  av_log(h->s.avctx, AV_LOG_ERROR, "reference picture missing during reorder\n");
266  memset(&h->ref_list[list][index], 0, sizeof(Picture)); //FIXME
267  } else {
268  for(i=index; i+1<h->ref_count[list]; i++){
269  if(ref->long_ref == h->ref_list[list][i].long_ref && ref->pic_id == h->ref_list[list][i].pic_id)
270  break;
271  }
272  for(; i > index; i--){
273  h->ref_list[list][i]= h->ref_list[list][i-1];
274  }
275  h->ref_list[list][index]= *ref;
276  if (FIELD_PICTURE){
277  pic_as_field(&h->ref_list[list][index], pic_structure);
278  }
279  }
280  }else{
281  av_log(h->s.avctx, AV_LOG_ERROR, "illegal reordering_of_pic_nums_idc\n");
282  return -1;
283  }
284  }
285  }
286  }
287  for(list=0; list<h->list_count; list++){
288  for(index= 0; index < h->ref_count[list]; index++){
289  if (!h->ref_list[list][index].f.data[0]) {
290  int i;
291  av_log(h->s.avctx, AV_LOG_ERROR, "Missing reference picture, default is %d\n", h->default_ref_list[list][0].poc);
292  for (i=0; i<FF_ARRAY_ELEMS(h->last_pocs); i++)
293  h->last_pocs[i] = INT_MIN;
294  if (h->default_ref_list[list][0].f.data[0])
295  h->ref_list[list][index]= h->default_ref_list[list][0];
296  else
297  return -1;
298  }
299  }
300  }
301 
302  return 0;
303 }
304 
306  int list, i, j;
307  for(list=0; list<h->list_count; list++){
308  for(i=0; i<h->ref_count[list]; i++){
309  Picture *frame = &h->ref_list[list][i];
310  Picture *field = &h->ref_list[list][16+2*i];
311  field[0] = *frame;
312  for(j=0; j<3; j++)
313  field[0].f.linesize[j] <<= 1;
314  field[0].f.reference = PICT_TOP_FIELD;
315  field[0].poc= field[0].field_poc[0];
316  field[1] = field[0];
317  for(j=0; j<3; j++)
318  field[1].f.data[j] += frame->f.linesize[j];
319  field[1].f.reference = PICT_BOTTOM_FIELD;
320  field[1].poc= field[1].field_poc[1];
321 
322  h->luma_weight[16+2*i][list][0] = h->luma_weight[16+2*i+1][list][0] = h->luma_weight[i][list][0];
323  h->luma_weight[16+2*i][list][1] = h->luma_weight[16+2*i+1][list][1] = h->luma_weight[i][list][1];
324  for(j=0; j<2; j++){
325  h->chroma_weight[16+2*i][list][j][0] = h->chroma_weight[16+2*i+1][list][j][0] = h->chroma_weight[i][list][j][0];
326  h->chroma_weight[16+2*i][list][j][1] = h->chroma_weight[16+2*i+1][list][j][1] = h->chroma_weight[i][list][j][1];
327  }
328  }
329  }
330 }
331 
332 /**
333  * Mark a picture as no longer needed for reference. The refmask
334  * argument allows unreferencing of individual fields or the whole frame.
335  * If the picture becomes entirely unreferenced, but is being held for
336  * display purposes, it is marked as such.
337  * @param refmask mask of fields to unreference; the mask is bitwise
338  * anded with the reference marking of pic
339  * @return non-zero if pic becomes entirely unreferenced (except possibly
340  * for display purposes) zero if one of the fields remains in
341  * reference
342  */
343 static inline int unreference_pic(H264Context *h, Picture *pic, int refmask){
344  int i;
345  if (pic->f.reference &= refmask) {
346  return 0;
347  } else {
348  for(i = 0; h->delayed_pic[i]; i++)
349  if(pic == h->delayed_pic[i]){
350  pic->f.reference = DELAYED_PIC_REF;
351  break;
352  }
353  return 1;
354  }
355 }
356 
357 /**
358  * Find a Picture in the short term reference list by frame number.
359  * @param frame_num frame number to search for
360  * @param idx the index into h->short_ref where returned picture is found
361  * undefined if no picture found.
362  * @return pointer to the found picture, or NULL if no pic with the provided
363  * frame number is found
364  */
365 static Picture * find_short(H264Context *h, int frame_num, int *idx){
366  MpegEncContext * const s = &h->s;
367  int i;
368 
369  for(i=0; i<h->short_ref_count; i++){
370  Picture *pic= h->short_ref[i];
371  if(s->avctx->debug&FF_DEBUG_MMCO)
372  av_log(h->s.avctx, AV_LOG_DEBUG, "%d %d %p\n", i, pic->frame_num, pic);
373  if(pic->frame_num == frame_num) {
374  *idx = i;
375  return pic;
376  }
377  }
378  return NULL;
379 }
380 
381 /**
382  * Remove a picture from the short term reference list by its index in
383  * that list. This does no checking on the provided index; it is assumed
384  * to be valid. Other list entries are shifted down.
385  * @param i index into h->short_ref of picture to remove.
386  */
387 static void remove_short_at_index(H264Context *h, int i){
388  assert(i >= 0 && i < h->short_ref_count);
389  h->short_ref[i]= NULL;
390  if (--h->short_ref_count)
391  memmove(&h->short_ref[i], &h->short_ref[i+1], (h->short_ref_count - i)*sizeof(Picture*));
392 }
393 
394 /**
395  *
396  * @return the removed picture or NULL if an error occurs
397  */
398 static Picture * remove_short(H264Context *h, int frame_num, int ref_mask){
399  MpegEncContext * const s = &h->s;
400  Picture *pic;
401  int i;
402 
403  if(s->avctx->debug&FF_DEBUG_MMCO)
404  av_log(h->s.avctx, AV_LOG_DEBUG, "remove short %d count %d\n", frame_num, h->short_ref_count);
405 
406  pic = find_short(h, frame_num, &i);
407  if (pic){
408  if(unreference_pic(h, pic, ref_mask))
409  remove_short_at_index(h, i);
410  }
411 
412  return pic;
413 }
414 
415 /**
416  * Remove a picture from the long term reference list by its index in
417  * that list.
418  * @return the removed picture or NULL if an error occurs
419  */
420 static Picture * remove_long(H264Context *h, int i, int ref_mask){
421  Picture *pic;
422 
423  pic= h->long_ref[i];
424  if (pic){
425  if(unreference_pic(h, pic, ref_mask)){
426  assert(h->long_ref[i]->long_ref == 1);
427  h->long_ref[i]->long_ref= 0;
428  h->long_ref[i]= NULL;
429  h->long_ref_count--;
430  }
431  }
432 
433  return pic;
434 }
435 
437  int i;
438 
439  for(i=0; i<16; i++){
440  remove_long(h, i, 0);
441  }
442  assert(h->long_ref_count==0);
443 
444  for(i=0; i<h->short_ref_count; i++){
445  unreference_pic(h, h->short_ref[i], 0);
446  h->short_ref[i]= NULL;
447  }
448  h->short_ref_count=0;
449 
450  memset(h->default_ref_list, 0, sizeof(h->default_ref_list));
451  memset(h->ref_list, 0, sizeof(h->ref_list));
452 }
453 
454 /**
455  * print short term list
456  */
457 static void print_short_term(H264Context *h) {
458  uint32_t i;
459  if(h->s.avctx->debug&FF_DEBUG_MMCO) {
460  av_log(h->s.avctx, AV_LOG_DEBUG, "short term list:\n");
461  for(i=0; i<h->short_ref_count; i++){
462  Picture *pic= h->short_ref[i];
463  av_log(h->s.avctx, AV_LOG_DEBUG, "%d fn:%d poc:%d %p\n",
464  i, pic->frame_num, pic->poc, pic->f.data[0]);
465  }
466  }
467 }
468 
469 /**
470  * print long term list
471  */
472 static void print_long_term(H264Context *h) {
473  uint32_t i;
474  if(h->s.avctx->debug&FF_DEBUG_MMCO) {
475  av_log(h->s.avctx, AV_LOG_DEBUG, "long term list:\n");
476  for(i = 0; i < 16; i++){
477  Picture *pic= h->long_ref[i];
478  if (pic) {
479  av_log(h->s.avctx, AV_LOG_DEBUG, "%d fn:%d poc:%d %p\n",
480  i, pic->frame_num, pic->poc, pic->f.data[0]);
481  }
482  }
483  }
484 }
485 
486 static int check_opcodes(MMCO *mmco1, MMCO *mmco2, int n_mmcos)
487 {
488  int i;
489 
490  for (i = 0; i < n_mmcos; i++) {
491  if (mmco1[i].opcode != mmco2[i].opcode)
492  return -1;
493  }
494 
495  return 0;
496 }
497 
499 {
500  MpegEncContext * const s = &h->s;
501  MMCO mmco_temp[MAX_MMCO_COUNT], *mmco = first_slice ? h->mmco : mmco_temp;
502  int mmco_index = 0, i;
503 
504  if (h->short_ref_count &&
506  !(FIELD_PICTURE && !s->first_field &&
508  mmco[0].opcode = MMCO_SHORT2UNUSED;
509  mmco[0].short_pic_num = h->short_ref[h->short_ref_count - 1]->frame_num;
510  mmco_index = 1;
511  if (FIELD_PICTURE) {
512  mmco[0].short_pic_num *= 2;
513  mmco[1].opcode = MMCO_SHORT2UNUSED;
514  mmco[1].short_pic_num = mmco[0].short_pic_num + 1;
515  mmco_index = 2;
516  }
517  }
518 
519  if (first_slice) {
520  h->mmco_index = mmco_index;
521  } else if (!first_slice && mmco_index >= 0 &&
522  (mmco_index != h->mmco_index ||
523  (i = check_opcodes(h->mmco, mmco_temp, mmco_index)))) {
525  "Inconsistent MMCO state between slices [%d, %d, %d]\n",
526  mmco_index, h->mmco_index, i);
527  return AVERROR_INVALIDDATA;
528  }
529  return 0;
530 }
531 
532 int ff_h264_execute_ref_pic_marking(H264Context *h, MMCO *mmco, int mmco_count){
533  MpegEncContext * const s = &h->s;
534  int i, av_uninit(j);
535  int current_ref_assigned=0, err=0;
536  Picture *av_uninit(pic);
537 
538  if((s->avctx->debug&FF_DEBUG_MMCO) && mmco_count==0)
539  av_log(h->s.avctx, AV_LOG_DEBUG, "no mmco here\n");
540 
541  for(i=0; i<mmco_count; i++){
542  int av_uninit(structure), av_uninit(frame_num);
543  if(s->avctx->debug&FF_DEBUG_MMCO)
544  av_log(h->s.avctx, AV_LOG_DEBUG, "mmco:%d %d %d\n", h->mmco[i].opcode, h->mmco[i].short_pic_num, h->mmco[i].long_arg);
545 
546  if( mmco[i].opcode == MMCO_SHORT2UNUSED
547  || mmco[i].opcode == MMCO_SHORT2LONG){
548  frame_num = pic_num_extract(h, mmco[i].short_pic_num, &structure);
549  pic = find_short(h, frame_num, &j);
550  if(!pic){
551  if(mmco[i].opcode != MMCO_SHORT2LONG || !h->long_ref[mmco[i].long_arg]
552  || h->long_ref[mmco[i].long_arg]->frame_num != frame_num) {
553  av_log(h->s.avctx, AV_LOG_ERROR, "mmco: unref short failure\n");
554  err = AVERROR_INVALIDDATA;
555  }
556  continue;
557  }
558  }
559 
560  switch(mmco[i].opcode){
561  case MMCO_SHORT2UNUSED:
562  if(s->avctx->debug&FF_DEBUG_MMCO)
563  av_log(h->s.avctx, AV_LOG_DEBUG, "mmco: unref short %d count %d\n", h->mmco[i].short_pic_num, h->short_ref_count);
564  remove_short(h, frame_num, structure ^ PICT_FRAME);
565  break;
566  case MMCO_SHORT2LONG:
567  if (h->long_ref[mmco[i].long_arg] != pic)
568  remove_long(h, mmco[i].long_arg, 0);
569 
570  remove_short_at_index(h, j);
571  h->long_ref[ mmco[i].long_arg ]= pic;
572  if (h->long_ref[ mmco[i].long_arg ]){
573  h->long_ref[ mmco[i].long_arg ]->long_ref=1;
574  h->long_ref_count++;
575  }
576  break;
577  case MMCO_LONG2UNUSED:
578  j = pic_num_extract(h, mmco[i].long_arg, &structure);
579  pic = h->long_ref[j];
580  if (pic) {
581  remove_long(h, j, structure ^ PICT_FRAME);
582  } else if(s->avctx->debug&FF_DEBUG_MMCO)
583  av_log(h->s.avctx, AV_LOG_DEBUG, "mmco: unref long failure\n");
584  break;
585  case MMCO_LONG:
586  // Comment below left from previous code as it is an interresting note.
587  /* First field in pair is in short term list or
588  * at a different long term index.
589  * This is not allowed; see 7.4.3.3, notes 2 and 3.
590  * Report the problem and keep the pair where it is,
591  * and mark this field valid.
592  */
593 
594  if (h->long_ref[mmco[i].long_arg] != s->current_picture_ptr) {
595  remove_long(h, mmco[i].long_arg, 0);
596 
597  h->long_ref[ mmco[i].long_arg ]= s->current_picture_ptr;
598  h->long_ref[ mmco[i].long_arg ]->long_ref=1;
599  h->long_ref_count++;
600  }
601 
603  current_ref_assigned=1;
604  break;
605  case MMCO_SET_MAX_LONG:
606  assert(mmco[i].long_arg <= 16);
607  // just remove the long term which index is greater than new max
608  for(j = mmco[i].long_arg; j<16; j++){
609  remove_long(h, j, 0);
610  }
611  break;
612  case MMCO_RESET:
613  while(h->short_ref_count){
614  remove_short(h, h->short_ref[0]->frame_num, 0);
615  }
616  for(j = 0; j < 16; j++) {
617  remove_long(h, j, 0);
618  }
619  h->frame_num=
621  h->mmco_reset = 1;
623  for (j = 0; j < MAX_DELAYED_PIC_COUNT; j++)
624  h->last_pocs[j] = INT_MIN;
625  break;
626  default: assert(0);
627  }
628  }
629 
630  if (!current_ref_assigned) {
631  /* Second field of complementary field pair; the first field of
632  * which is already referenced. If short referenced, it
633  * should be first entry in short_ref. If not, it must exist
634  * in long_ref; trying to put it on the short list here is an
635  * error in the encoded bit stream (ref: 7.4.3.3, NOTE 2 and 3).
636  */
637  if (h->short_ref_count && h->short_ref[0] == s->current_picture_ptr) {
638  /* Just mark the second field valid */
640  } else if (s->current_picture_ptr->long_ref) {
641  av_log(h->s.avctx, AV_LOG_ERROR, "illegal short term reference "
642  "assignment for second field "
643  "in complementary field pair "
644  "(first field is long term)\n");
645  err = AVERROR_INVALIDDATA;
646  } else {
648  if(pic){
649  av_log(h->s.avctx, AV_LOG_ERROR, "illegal short term buffer state detected\n");
650  err = AVERROR_INVALIDDATA;
651  }
652 
653  if(h->short_ref_count)
654  memmove(&h->short_ref[1], &h->short_ref[0], h->short_ref_count*sizeof(Picture*));
655 
656  h->short_ref[0]= s->current_picture_ptr;
657  h->short_ref_count++;
659  }
660  }
661 
663 
664  /* We have too many reference frames, probably due to corrupted
665  * stream. Need to discard one frame. Prevents overrun of the
666  * short_ref and long_ref buffers.
667  */
669  "number of reference frames (%d+%d) exceeds max (%d; probably "
670  "corrupt input), discarding one\n",
672  err = AVERROR_INVALIDDATA;
673 
674  if (h->long_ref_count && !h->short_ref_count) {
675  for (i = 0; i < 16; ++i)
676  if (h->long_ref[i])
677  break;
678 
679  assert(i < 16);
680  remove_long(h, i, 0);
681  } else {
682  pic = h->short_ref[h->short_ref_count - 1];
683  remove_short(h, pic->frame_num, 0);
684  }
685  }
686 
687  print_short_term(h);
688  print_long_term(h);
689 
690  if(err >= 0 && h->long_ref_count==0 && h->short_ref_count<=2 && h->pps.ref_count[0]<=1 + (s->picture_structure != PICT_FRAME) && s->current_picture_ptr->f.pict_type == AV_PICTURE_TYPE_I){
691  s->current_picture_ptr->sync |= 1;
692  if(!h->s.avctx->has_b_frames)
693  h->sync = 2;
694  }
695 
696  return (h->s.avctx->err_recognition & AV_EF_EXPLODE) ? err : 0;
697 }
698 
700  int first_slice)
701 {
702  MpegEncContext * const s = &h->s;
703  int i, ret;
704  MMCO mmco_temp[MAX_MMCO_COUNT], *mmco = first_slice ? h->mmco : mmco_temp;
705  int mmco_index = 0;
706 
707  if (h->nal_unit_type == NAL_IDR_SLICE){ // FIXME fields
708  s->broken_link = get_bits1(gb) - 1;
709  if (get_bits1(gb)){
710  mmco[0].opcode = MMCO_LONG;
711  mmco[0].long_arg = 0;
712  mmco_index = 1;
713  }
714  } else {
715  if (get_bits1(gb)) { // adaptive_ref_pic_marking_mode_flag
716  for (i = 0; i < MAX_MMCO_COUNT; i++) {
717  MMCOOpcode opcode = get_ue_golomb_31(gb);
718 
719  mmco[i].opcode = opcode;
720  if (opcode == MMCO_SHORT2UNUSED || opcode == MMCO_SHORT2LONG){
721  mmco[i].short_pic_num =
722  (h->curr_pic_num - get_ue_golomb(gb) - 1) &
723  (h->max_pic_num - 1);
724 #if 0
725  if (mmco[i].short_pic_num >= h->short_ref_count ||
726  h->short_ref[ mmco[i].short_pic_num ] == NULL){
728  "illegal short ref in memory management control "
729  "operation %d\n", mmco);
730  return -1;
731  }
732 #endif
733  }
734  if (opcode == MMCO_SHORT2LONG || opcode == MMCO_LONG2UNUSED ||
735  opcode == MMCO_LONG || opcode == MMCO_SET_MAX_LONG) {
736  unsigned int long_arg = get_ue_golomb_31(gb);
737  if (long_arg >= 32 ||
738  (long_arg >= 16 && !(opcode == MMCO_SET_MAX_LONG &&
739  long_arg == 16) &&
740  !(opcode == MMCO_LONG2UNUSED && FIELD_PICTURE))){
742  "illegal long ref in memory management control "
743  "operation %d\n", opcode);
744  return -1;
745  }
746  mmco[i].long_arg = long_arg;
747  }
748 
749  if (opcode > (unsigned) MMCO_LONG){
751  "illegal memory management control operation %d\n",
752  opcode);
753  return -1;
754  }
755  if (opcode == MMCO_END)
756  break;
757  }
758  mmco_index = i;
759  } else {
760  if (first_slice) {
761  ret = ff_generate_sliding_window_mmcos(h, first_slice);
762  if (ret < 0 && s->avctx->err_recognition & AV_EF_EXPLODE)
763  return ret;
764  }
765  mmco_index = -1;
766  }
767  }
768 
769  if (first_slice && mmco_index != -1) {
770  h->mmco_index = mmco_index;
771  } else if (!first_slice && mmco_index >= 0 &&
772  (mmco_index != h->mmco_index ||
773  (i = check_opcodes(h->mmco, mmco_temp, mmco_index)))) {
775  "Inconsistent MMCO state between slices [%d, %d, %d]\n",
776  mmco_index, h->mmco_index, i);
777  return AVERROR_INVALIDDATA;
778  }
779 
780  return 0;
781 }