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.

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