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.

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