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.

830 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. if (index == 0 || h->avctx->err_recognition & AV_EF_EXPLODE)
  288. return AVERROR_INVALIDDATA;
  289. else
  290. sl->ref_list[list][index] = sl->ref_list[list][index - 1];
  291. }
  292. }
  293. }
  294. return 0;
  295. }
  296. void ff_h264_fill_mbaff_ref_list(H264Context *h, H264SliceContext *sl)
  297. {
  298. int list, i, j;
  299. for (list = 0; list < sl->list_count; list++) { //FIXME try list_count
  300. for (i = 0; i < sl->ref_count[list]; i++) {
  301. H264Ref *frame = &sl->ref_list[list][i];
  302. H264Ref *field = &sl->ref_list[list][16 + 2 * i];
  303. field[0] = *frame;
  304. for (j = 0; j < 3; j++)
  305. field[0].linesize[j] <<= 1;
  306. field[0].reference = PICT_TOP_FIELD;
  307. field[0].poc = field[0].parent->field_poc[0];
  308. field[1] = field[0];
  309. for (j = 0; j < 3; j++)
  310. field[1].data[j] += frame->parent->f->linesize[j];
  311. field[1].reference = PICT_BOTTOM_FIELD;
  312. field[1].poc = field[1].parent->field_poc[1];
  313. sl->luma_weight[16 + 2 * i][list][0] = sl->luma_weight[16 + 2 * i + 1][list][0] = sl->luma_weight[i][list][0];
  314. sl->luma_weight[16 + 2 * i][list][1] = sl->luma_weight[16 + 2 * i + 1][list][1] = sl->luma_weight[i][list][1];
  315. for (j = 0; j < 2; j++) {
  316. 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];
  317. 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];
  318. }
  319. }
  320. }
  321. }
  322. /**
  323. * Mark a picture as no longer needed for reference. The refmask
  324. * argument allows unreferencing of individual fields or the whole frame.
  325. * If the picture becomes entirely unreferenced, but is being held for
  326. * display purposes, it is marked as such.
  327. * @param refmask mask of fields to unreference; the mask is bitwise
  328. * anded with the reference marking of pic
  329. * @return non-zero if pic becomes entirely unreferenced (except possibly
  330. * for display purposes) zero if one of the fields remains in
  331. * reference
  332. */
  333. static inline int unreference_pic(H264Context *h, H264Picture *pic, int refmask)
  334. {
  335. int i;
  336. if (pic->reference &= refmask) {
  337. return 0;
  338. } else {
  339. for(i = 0; h->delayed_pic[i]; i++)
  340. if(pic == h->delayed_pic[i]){
  341. pic->reference = DELAYED_PIC_REF;
  342. break;
  343. }
  344. return 1;
  345. }
  346. }
  347. /**
  348. * Find a H264Picture in the short term reference list by frame number.
  349. * @param frame_num frame number to search for
  350. * @param idx the index into h->short_ref where returned picture is found
  351. * undefined if no picture found.
  352. * @return pointer to the found picture, or NULL if no pic with the provided
  353. * frame number is found
  354. */
  355. static H264Picture *find_short(H264Context *h, int frame_num, int *idx)
  356. {
  357. int i;
  358. for (i = 0; i < h->short_ref_count; i++) {
  359. H264Picture *pic = h->short_ref[i];
  360. if (h->avctx->debug & FF_DEBUG_MMCO)
  361. av_log(h->avctx, AV_LOG_DEBUG, "%d %d %p\n", i, pic->frame_num, pic);
  362. if (pic->frame_num == frame_num) {
  363. *idx = i;
  364. return pic;
  365. }
  366. }
  367. return NULL;
  368. }
  369. /**
  370. * Remove a picture from the short term reference list by its index in
  371. * that list. This does no checking on the provided index; it is assumed
  372. * to be valid. Other list entries are shifted down.
  373. * @param i index into h->short_ref of picture to remove.
  374. */
  375. static void remove_short_at_index(H264Context *h, int i)
  376. {
  377. assert(i >= 0 && i < h->short_ref_count);
  378. h->short_ref[i] = NULL;
  379. if (--h->short_ref_count)
  380. memmove(&h->short_ref[i], &h->short_ref[i + 1],
  381. (h->short_ref_count - i) * sizeof(H264Picture*));
  382. }
  383. /**
  384. *
  385. * @return the removed picture or NULL if an error occurs
  386. */
  387. static H264Picture *remove_short(H264Context *h, int frame_num, int ref_mask)
  388. {
  389. H264Picture *pic;
  390. int i;
  391. if (h->avctx->debug & FF_DEBUG_MMCO)
  392. av_log(h->avctx, AV_LOG_DEBUG, "remove short %d count %d\n", frame_num, h->short_ref_count);
  393. pic = find_short(h, frame_num, &i);
  394. if (pic) {
  395. if (unreference_pic(h, pic, ref_mask))
  396. remove_short_at_index(h, i);
  397. }
  398. return pic;
  399. }
  400. /**
  401. * Remove a picture from the long term reference list by its index in
  402. * that list.
  403. * @return the removed picture or NULL if an error occurs
  404. */
  405. static H264Picture *remove_long(H264Context *h, int i, int ref_mask)
  406. {
  407. H264Picture *pic;
  408. pic = h->long_ref[i];
  409. if (pic) {
  410. if (unreference_pic(h, pic, ref_mask)) {
  411. assert(h->long_ref[i]->long_ref == 1);
  412. h->long_ref[i]->long_ref = 0;
  413. h->long_ref[i] = NULL;
  414. h->long_ref_count--;
  415. }
  416. }
  417. return pic;
  418. }
  419. void ff_h264_remove_all_refs(H264Context *h)
  420. {
  421. int i;
  422. for (i = 0; i < 16; i++) {
  423. remove_long(h, i, 0);
  424. }
  425. assert(h->long_ref_count == 0);
  426. for (i = 0; i < h->short_ref_count; i++) {
  427. unreference_pic(h, h->short_ref[i], 0);
  428. h->short_ref[i] = NULL;
  429. }
  430. h->short_ref_count = 0;
  431. }
  432. /**
  433. * print short term list
  434. */
  435. static void print_short_term(H264Context *h)
  436. {
  437. uint32_t i;
  438. if (h->avctx->debug & FF_DEBUG_MMCO) {
  439. av_log(h->avctx, AV_LOG_DEBUG, "short term list:\n");
  440. for (i = 0; i < h->short_ref_count; i++) {
  441. H264Picture *pic = h->short_ref[i];
  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. * print long term list
  449. */
  450. static void print_long_term(H264Context *h)
  451. {
  452. uint32_t i;
  453. if (h->avctx->debug & FF_DEBUG_MMCO) {
  454. av_log(h->avctx, AV_LOG_DEBUG, "long term list:\n");
  455. for (i = 0; i < 16; i++) {
  456. H264Picture *pic = h->long_ref[i];
  457. if (pic) {
  458. av_log(h->avctx, AV_LOG_DEBUG, "%"PRIu32" fn:%d poc:%d %p\n",
  459. i, pic->frame_num, pic->poc, pic->f->data[0]);
  460. }
  461. }
  462. }
  463. }
  464. static int check_opcodes(MMCO *mmco1, MMCO *mmco2, int n_mmcos)
  465. {
  466. int i;
  467. for (i = 0; i < n_mmcos; i++) {
  468. if (mmco1[i].opcode != mmco2[i].opcode)
  469. return -1;
  470. }
  471. return 0;
  472. }
  473. int ff_generate_sliding_window_mmcos(H264Context *h, int first_slice)
  474. {
  475. MMCO mmco_temp[MAX_MMCO_COUNT], *mmco = first_slice ? h->mmco : mmco_temp;
  476. int mmco_index = 0, i = 0;
  477. assert(h->long_ref_count + h->short_ref_count <= h->sps.ref_frame_count);
  478. if (h->short_ref_count &&
  479. h->long_ref_count + h->short_ref_count == h->sps.ref_frame_count &&
  480. !(FIELD_PICTURE(h) && !h->first_field && h->cur_pic_ptr->reference)) {
  481. mmco[0].opcode = MMCO_SHORT2UNUSED;
  482. mmco[0].short_pic_num = h->short_ref[h->short_ref_count - 1]->frame_num;
  483. mmco_index = 1;
  484. if (FIELD_PICTURE(h)) {
  485. mmco[0].short_pic_num *= 2;
  486. mmco[1].opcode = MMCO_SHORT2UNUSED;
  487. mmco[1].short_pic_num = mmco[0].short_pic_num + 1;
  488. mmco_index = 2;
  489. }
  490. }
  491. if (first_slice) {
  492. h->mmco_index = mmco_index;
  493. } else if (!first_slice && mmco_index >= 0 &&
  494. (mmco_index != h->mmco_index ||
  495. (i = check_opcodes(h->mmco, mmco_temp, mmco_index)))) {
  496. av_log(h->avctx, AV_LOG_ERROR,
  497. "Inconsistent MMCO state between slices [%d, %d, %d]\n",
  498. mmco_index, h->mmco_index, i);
  499. return AVERROR_INVALIDDATA;
  500. }
  501. return 0;
  502. }
  503. int ff_h264_execute_ref_pic_marking(H264Context *h, MMCO *mmco, int mmco_count)
  504. {
  505. int i, av_uninit(j);
  506. int current_ref_assigned = 0, err = 0;
  507. H264Picture *av_uninit(pic);
  508. if ((h->avctx->debug & FF_DEBUG_MMCO) && mmco_count == 0)
  509. av_log(h->avctx, AV_LOG_DEBUG, "no mmco here\n");
  510. for (i = 0; i < mmco_count; i++) {
  511. int av_uninit(structure), av_uninit(frame_num);
  512. if (h->avctx->debug & FF_DEBUG_MMCO)
  513. av_log(h->avctx, AV_LOG_DEBUG, "mmco:%d %d %d\n", h->mmco[i].opcode,
  514. h->mmco[i].short_pic_num, h->mmco[i].long_arg);
  515. if (mmco[i].opcode == MMCO_SHORT2UNUSED ||
  516. mmco[i].opcode == MMCO_SHORT2LONG) {
  517. frame_num = pic_num_extract(h, mmco[i].short_pic_num, &structure);
  518. pic = find_short(h, frame_num, &j);
  519. if (!pic) {
  520. if (mmco[i].opcode != MMCO_SHORT2LONG ||
  521. !h->long_ref[mmco[i].long_arg] ||
  522. h->long_ref[mmco[i].long_arg]->frame_num != frame_num) {
  523. av_log(h->avctx, AV_LOG_ERROR, "mmco: unref short failure\n");
  524. err = AVERROR_INVALIDDATA;
  525. }
  526. continue;
  527. }
  528. }
  529. switch (mmco[i].opcode) {
  530. case MMCO_SHORT2UNUSED:
  531. if (h->avctx->debug & FF_DEBUG_MMCO)
  532. av_log(h->avctx, AV_LOG_DEBUG, "mmco: unref short %d count %d\n",
  533. h->mmco[i].short_pic_num, h->short_ref_count);
  534. remove_short(h, frame_num, structure ^ PICT_FRAME);
  535. break;
  536. case MMCO_SHORT2LONG:
  537. if (h->long_ref[mmco[i].long_arg] != pic)
  538. remove_long(h, mmco[i].long_arg, 0);
  539. remove_short_at_index(h, j);
  540. h->long_ref[ mmco[i].long_arg ] = pic;
  541. if (h->long_ref[mmco[i].long_arg]) {
  542. h->long_ref[mmco[i].long_arg]->long_ref = 1;
  543. h->long_ref_count++;
  544. }
  545. break;
  546. case MMCO_LONG2UNUSED:
  547. j = pic_num_extract(h, mmco[i].long_arg, &structure);
  548. pic = h->long_ref[j];
  549. if (pic) {
  550. remove_long(h, j, structure ^ PICT_FRAME);
  551. } else if (h->avctx->debug & FF_DEBUG_MMCO)
  552. av_log(h->avctx, AV_LOG_DEBUG, "mmco: unref long failure\n");
  553. break;
  554. case MMCO_LONG:
  555. // Comment below left from previous code as it is an interresting note.
  556. /* First field in pair is in short term list or
  557. * at a different long term index.
  558. * This is not allowed; see 7.4.3.3, notes 2 and 3.
  559. * Report the problem and keep the pair where it is,
  560. * and mark this field valid.
  561. */
  562. if (h->short_ref[0] == h->cur_pic_ptr)
  563. remove_short_at_index(h, 0);
  564. /* make sure the current picture is not already assigned as a long ref */
  565. if (h->cur_pic_ptr->long_ref) {
  566. for (j = 0; j < FF_ARRAY_ELEMS(h->long_ref); j++) {
  567. if (h->long_ref[j] == h->cur_pic_ptr)
  568. remove_long(h, j, 0);
  569. }
  570. }
  571. if (h->long_ref[mmco[i].long_arg] != h->cur_pic_ptr) {
  572. remove_long(h, mmco[i].long_arg, 0);
  573. h->long_ref[mmco[i].long_arg] = h->cur_pic_ptr;
  574. h->long_ref[mmco[i].long_arg]->long_ref = 1;
  575. h->long_ref_count++;
  576. }
  577. h->cur_pic_ptr->reference |= h->picture_structure;
  578. current_ref_assigned = 1;
  579. break;
  580. case MMCO_SET_MAX_LONG:
  581. assert(mmco[i].long_arg <= 16);
  582. // just remove the long term which index is greater than new max
  583. for (j = mmco[i].long_arg; j < 16; j++) {
  584. remove_long(h, j, 0);
  585. }
  586. break;
  587. case MMCO_RESET:
  588. while (h->short_ref_count) {
  589. remove_short(h, h->short_ref[0]->frame_num, 0);
  590. }
  591. for (j = 0; j < 16; j++) {
  592. remove_long(h, j, 0);
  593. }
  594. h->frame_num = h->cur_pic_ptr->frame_num = 0;
  595. h->mmco_reset = 1;
  596. h->cur_pic_ptr->mmco_reset = 1;
  597. break;
  598. default: assert(0);
  599. }
  600. }
  601. if (!current_ref_assigned) {
  602. /* Second field of complementary field pair; the first field of
  603. * which is already referenced. If short referenced, it
  604. * should be first entry in short_ref. If not, it must exist
  605. * in long_ref; trying to put it on the short list here is an
  606. * error in the encoded bit stream (ref: 7.4.3.3, NOTE 2 and 3).
  607. */
  608. if (h->short_ref_count && h->short_ref[0] == h->cur_pic_ptr) {
  609. /* Just mark the second field valid */
  610. h->cur_pic_ptr->reference = PICT_FRAME;
  611. } else if (h->cur_pic_ptr->long_ref) {
  612. av_log(h->avctx, AV_LOG_ERROR, "illegal short term reference "
  613. "assignment for second field "
  614. "in complementary field pair "
  615. "(first field is long term)\n");
  616. err = AVERROR_INVALIDDATA;
  617. } else {
  618. pic = remove_short(h, h->cur_pic_ptr->frame_num, 0);
  619. if (pic) {
  620. av_log(h->avctx, AV_LOG_ERROR, "illegal short term buffer state detected\n");
  621. err = AVERROR_INVALIDDATA;
  622. }
  623. if (h->short_ref_count)
  624. memmove(&h->short_ref[1], &h->short_ref[0],
  625. h->short_ref_count * sizeof(H264Picture*));
  626. h->short_ref[0] = h->cur_pic_ptr;
  627. h->short_ref_count++;
  628. h->cur_pic_ptr->reference |= h->picture_structure;
  629. }
  630. }
  631. if (h->long_ref_count + h->short_ref_count -
  632. (h->short_ref[0] == h->cur_pic_ptr) > h->sps.ref_frame_count) {
  633. /* We have too many reference frames, probably due to corrupted
  634. * stream. Need to discard one frame. Prevents overrun of the
  635. * short_ref and long_ref buffers.
  636. */
  637. av_log(h->avctx, AV_LOG_ERROR,
  638. "number of reference frames (%d+%d) exceeds max (%d; probably "
  639. "corrupt input), discarding one\n",
  640. h->long_ref_count, h->short_ref_count, h->sps.ref_frame_count);
  641. err = AVERROR_INVALIDDATA;
  642. if (h->long_ref_count && !h->short_ref_count) {
  643. for (i = 0; i < 16; ++i)
  644. if (h->long_ref[i])
  645. break;
  646. assert(i < 16);
  647. remove_long(h, i, 0);
  648. } else {
  649. pic = h->short_ref[h->short_ref_count - 1];
  650. remove_short(h, pic->frame_num, 0);
  651. }
  652. }
  653. print_short_term(h);
  654. print_long_term(h);
  655. return (h->avctx->err_recognition & AV_EF_EXPLODE) ? err : 0;
  656. }
  657. int ff_h264_decode_ref_pic_marking(H264Context *h, GetBitContext *gb,
  658. int first_slice)
  659. {
  660. int i, ret;
  661. MMCO mmco_temp[MAX_MMCO_COUNT], *mmco = first_slice ? h->mmco : mmco_temp;
  662. int mmco_index = 0;
  663. if (h->nal_unit_type == NAL_IDR_SLICE) { // FIXME fields
  664. skip_bits1(gb); // broken_link
  665. if (get_bits1(gb)) {
  666. mmco[0].opcode = MMCO_LONG;
  667. mmco[0].long_arg = 0;
  668. mmco_index = 1;
  669. }
  670. } else {
  671. if (get_bits1(gb)) { // adaptive_ref_pic_marking_mode_flag
  672. for (i = 0; i < MAX_MMCO_COUNT; i++) {
  673. MMCOOpcode opcode = get_ue_golomb_31(gb);
  674. mmco[i].opcode = opcode;
  675. if (opcode == MMCO_SHORT2UNUSED || opcode == MMCO_SHORT2LONG) {
  676. mmco[i].short_pic_num =
  677. (h->curr_pic_num - get_ue_golomb(gb) - 1) &
  678. (h->max_pic_num - 1);
  679. #if 0
  680. if (mmco[i].short_pic_num >= h->short_ref_count ||
  681. !h->short_ref[mmco[i].short_pic_num]) {
  682. av_log(s->avctx, AV_LOG_ERROR,
  683. "illegal short ref in memory management control "
  684. "operation %d\n", mmco);
  685. return -1;
  686. }
  687. #endif
  688. }
  689. if (opcode == MMCO_SHORT2LONG || opcode == MMCO_LONG2UNUSED ||
  690. opcode == MMCO_LONG || opcode == MMCO_SET_MAX_LONG) {
  691. unsigned int long_arg = get_ue_golomb_31(gb);
  692. if (long_arg >= 32 ||
  693. (long_arg >= 16 && !(opcode == MMCO_SET_MAX_LONG &&
  694. long_arg == 16) &&
  695. !(opcode == MMCO_LONG2UNUSED && FIELD_PICTURE(h)))) {
  696. av_log(h->avctx, AV_LOG_ERROR,
  697. "illegal long ref in memory management control "
  698. "operation %d\n", opcode);
  699. return -1;
  700. }
  701. mmco[i].long_arg = long_arg;
  702. }
  703. if (opcode > (unsigned) MMCO_LONG) {
  704. av_log(h->avctx, AV_LOG_ERROR,
  705. "illegal memory management control operation %d\n",
  706. opcode);
  707. return -1;
  708. }
  709. if (opcode == MMCO_END)
  710. break;
  711. }
  712. mmco_index = i;
  713. } else {
  714. if (first_slice) {
  715. ret = ff_generate_sliding_window_mmcos(h, first_slice);
  716. if (ret < 0 && h->avctx->err_recognition & AV_EF_EXPLODE)
  717. return ret;
  718. }
  719. mmco_index = -1;
  720. }
  721. }
  722. if (first_slice && mmco_index != -1) {
  723. h->mmco_index = mmco_index;
  724. } else if (!first_slice && mmco_index >= 0 &&
  725. (mmco_index != h->mmco_index ||
  726. check_opcodes(h->mmco, mmco_temp, mmco_index))) {
  727. av_log(h->avctx, AV_LOG_ERROR,
  728. "Inconsistent MMCO state between slices [%d, %d]\n",
  729. mmco_index, h->mmco_index);
  730. return AVERROR_INVALIDDATA;
  731. }
  732. return 0;
  733. }