You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

811 lines
29KB

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