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 "internal.h"
  27. #include "avcodec.h"
  28. #include "h264.h"
  29. #include "golomb.h"
  30. #include <assert.h>
  31. #define COPY_PICTURE(dst, src) \
  32. do {\
  33. *(dst) = *(src);\
  34. (dst)->f.extended_data = (dst)->f.data;\
  35. (dst)->tf.f = &(dst)->f;\
  36. } while (0)
  37. static void pic_as_field(Picture *pic, const int parity){
  38. int i;
  39. for (i = 0; i < 4; ++i) {
  40. if (parity == PICT_BOTTOM_FIELD)
  41. pic->f.data[i] += pic->f.linesize[i];
  42. pic->reference = parity;
  43. pic->f.linesize[i] *= 2;
  44. }
  45. pic->poc= pic->field_poc[parity == PICT_BOTTOM_FIELD];
  46. }
  47. static int split_field_copy(Picture *dest, Picture *src, int parity, int id_add)
  48. {
  49. int match = !!(src->reference & parity);
  50. if (match) {
  51. COPY_PICTURE(dest, src);
  52. if (parity != PICT_FRAME) {
  53. pic_as_field(dest, parity);
  54. dest->pic_id *= 2;
  55. dest->pic_id += id_add;
  56. }
  57. }
  58. return match;
  59. }
  60. static int build_def_list(Picture *def, int def_len,
  61. Picture **in, int len, int is_long, int sel)
  62. {
  63. int i[2] = { 0 };
  64. int index = 0;
  65. while ((i[0] < len || i[1] < len) && index < def_len) {
  66. while (i[0] < len && !(in[i[0]] && (in[i[0]]->reference & sel)))
  67. i[0]++;
  68. while (i[1] < len && !(in[i[1]] && (in[i[1]]->reference & (sel ^ 3))))
  69. i[1]++;
  70. if (i[0] < len && index < def_len) {
  71. in[i[0]]->pic_id = is_long ? i[0] : in[i[0]]->frame_num;
  72. split_field_copy(&def[index++], in[i[0]++], sel, 1);
  73. }
  74. if (i[1] < len && index < def_len) {
  75. in[i[1]]->pic_id = is_long ? i[1] : in[i[1]]->frame_num;
  76. split_field_copy(&def[index++], in[i[1]++], sel ^ 3, 0);
  77. }
  78. }
  79. return index;
  80. }
  81. static int add_sorted(Picture **sorted, Picture **src, int len, int limit, int dir)
  82. {
  83. int i, best_poc;
  84. int out_i = 0;
  85. for (;;) {
  86. best_poc = dir ? INT_MIN : INT_MAX;
  87. for (i = 0; i < len; i++) {
  88. const int poc = src[i]->poc;
  89. if (((poc > limit) ^ dir) && ((poc < best_poc) ^ dir)) {
  90. best_poc = poc;
  91. sorted[out_i] = src[i];
  92. }
  93. }
  94. if (best_poc == (dir ? INT_MIN : INT_MAX))
  95. break;
  96. limit = sorted[out_i++]->poc - dir;
  97. }
  98. return out_i;
  99. }
  100. int ff_h264_fill_default_ref_list(H264Context *h)
  101. {
  102. int i, len;
  103. if (h->slice_type_nos == AV_PICTURE_TYPE_B) {
  104. Picture *sorted[32];
  105. int cur_poc, list;
  106. int lens[2];
  107. if (FIELD_PICTURE(h))
  108. cur_poc = h->cur_pic_ptr->field_poc[h->picture_structure == PICT_BOTTOM_FIELD];
  109. else
  110. cur_poc = h->cur_pic_ptr->poc;
  111. for (list = 0; list < 2; list++) {
  112. len = add_sorted(sorted, h->short_ref, h->short_ref_count, cur_poc, 1 ^ list);
  113. len += add_sorted(sorted + len, h->short_ref, h->short_ref_count, cur_poc, 0 ^ list);
  114. assert(len <= 32);
  115. len = build_def_list(h->default_ref_list[list], FF_ARRAY_ELEMS(h->default_ref_list[0]),
  116. sorted, len, 0, h->picture_structure);
  117. len += build_def_list(h->default_ref_list[list] + len,
  118. FF_ARRAY_ELEMS(h->default_ref_list[0]) - len,
  119. h->long_ref, 16, 1, h->picture_structure);
  120. if (len < h->ref_count[list])
  121. memset(&h->default_ref_list[list][len], 0, sizeof(Picture) * (h->ref_count[list] - len));
  122. lens[list] = len;
  123. }
  124. if (lens[0] == lens[1] && lens[1] > 1) {
  125. for (i = 0; i < lens[0] &&
  126. h->default_ref_list[0][i].f.buf[0]->buffer ==
  127. h->default_ref_list[1][i].f.buf[0]->buffer; i++);
  128. if (i == lens[0]) {
  129. Picture tmp;
  130. COPY_PICTURE(&tmp, &h->default_ref_list[1][0]);
  131. COPY_PICTURE(&h->default_ref_list[1][0], &h->default_ref_list[1][1]);
  132. COPY_PICTURE(&h->default_ref_list[1][1], &tmp);
  133. }
  134. }
  135. } else {
  136. len = build_def_list(h->default_ref_list[0], FF_ARRAY_ELEMS(h->default_ref_list[0]),
  137. h->short_ref, h->short_ref_count, 0, h->picture_structure);
  138. len += build_def_list(h->default_ref_list[0] + len,
  139. FF_ARRAY_ELEMS(h->default_ref_list[0]) - len,
  140. h-> long_ref, 16, 1, h->picture_structure);
  141. if (len < h->ref_count[0])
  142. memset(&h->default_ref_list[0][len], 0, sizeof(Picture) * (h->ref_count[0] - len));
  143. }
  144. #ifdef TRACE
  145. for (i = 0; i < h->ref_count[0]; i++) {
  146. tprintf(h->avctx, "List0: %s fn:%d 0x%p\n",
  147. (h->default_ref_list[0][i].long_ref ? "LT" : "ST"),
  148. h->default_ref_list[0][i].pic_id,
  149. h->default_ref_list[0][i].f.data[0]);
  150. }
  151. if (h->slice_type_nos == AV_PICTURE_TYPE_B) {
  152. for (i = 0; i < h->ref_count[1]; i++) {
  153. tprintf(h->avctx, "List1: %s fn:%d 0x%p\n",
  154. (h->default_ref_list[1][i].long_ref ? "LT" : "ST"),
  155. h->default_ref_list[1][i].pic_id,
  156. h->default_ref_list[1][i].f.data[0]);
  157. }
  158. }
  159. #endif
  160. return 0;
  161. }
  162. static void print_short_term(H264Context *h);
  163. static void print_long_term(H264Context *h);
  164. /**
  165. * Extract structure information about the picture described by pic_num in
  166. * the current decoding context (frame or field). Note that pic_num is
  167. * picture number without wrapping (so, 0<=pic_num<max_pic_num).
  168. * @param pic_num picture number for which to extract structure information
  169. * @param structure one of PICT_XXX describing structure of picture
  170. * with pic_num
  171. * @return frame number (short term) or long term index of picture
  172. * described by pic_num
  173. */
  174. static int pic_num_extract(H264Context *h, int pic_num, int *structure)
  175. {
  176. *structure = h->picture_structure;
  177. if (FIELD_PICTURE(h)) {
  178. if (!(pic_num & 1))
  179. /* opposite field */
  180. *structure ^= PICT_FRAME;
  181. pic_num >>= 1;
  182. }
  183. return pic_num;
  184. }
  185. int ff_h264_decode_ref_pic_list_reordering(H264Context *h)
  186. {
  187. int list, index, pic_structure, i;
  188. print_short_term(h);
  189. print_long_term(h);
  190. for (list = 0; list < h->list_count; list++) {
  191. for (i = 0; i < h->ref_count[list]; i++)
  192. COPY_PICTURE(&h->ref_list[list][i], &h->default_ref_list[list][i]);
  193. if (get_bits1(&h->gb)) {
  194. int pred = h->curr_pic_num;
  195. for (index = 0; ; index++) {
  196. unsigned int reordering_of_pic_nums_idc = get_ue_golomb_31(&h->gb);
  197. unsigned int pic_id;
  198. int i;
  199. Picture *ref = NULL;
  200. if (reordering_of_pic_nums_idc == 3)
  201. break;
  202. if (index >= h->ref_count[list]) {
  203. av_log(h->avctx, AV_LOG_ERROR, "reference count overflow\n");
  204. return -1;
  205. }
  206. switch (reordering_of_pic_nums_idc) {
  207. case 0:
  208. case 1: {
  209. const unsigned int abs_diff_pic_num = get_ue_golomb(&h->gb) + 1;
  210. int frame_num;
  211. if (abs_diff_pic_num > h->max_pic_num) {
  212. av_log(h->avctx, AV_LOG_ERROR,
  213. "abs_diff_pic_num overflow\n");
  214. return AVERROR_INVALIDDATA;
  215. }
  216. if (reordering_of_pic_nums_idc == 0)
  217. pred -= abs_diff_pic_num;
  218. else
  219. pred += abs_diff_pic_num;
  220. pred &= h->max_pic_num - 1;
  221. frame_num = pic_num_extract(h, pred, &pic_structure);
  222. for (i = h->short_ref_count - 1; i >= 0; i--) {
  223. ref = h->short_ref[i];
  224. assert(ref->reference);
  225. assert(!ref->long_ref);
  226. if (ref->frame_num == frame_num &&
  227. (ref->reference & pic_structure))
  228. break;
  229. }
  230. if (i >= 0)
  231. ref->pic_id = pred;
  232. break;
  233. }
  234. case 2: {
  235. int long_idx;
  236. pic_id = get_ue_golomb(&h->gb); // long_term_pic_idx
  237. long_idx = pic_num_extract(h, pic_id, &pic_structure);
  238. if (long_idx > 31) {
  239. av_log(h->avctx, AV_LOG_ERROR,
  240. "long_term_pic_idx overflow\n");
  241. return AVERROR_INVALIDDATA;
  242. }
  243. ref = h->long_ref[long_idx];
  244. assert(!(ref && !ref->reference));
  245. if (ref && (ref->reference & pic_structure)) {
  246. ref->pic_id = pic_id;
  247. assert(ref->long_ref);
  248. i = 0;
  249. } else {
  250. i = -1;
  251. }
  252. break;
  253. }
  254. default:
  255. av_log(h->avctx, AV_LOG_ERROR,
  256. "illegal reordering_of_pic_nums_idc\n");
  257. return AVERROR_INVALIDDATA;
  258. }
  259. if (i < 0) {
  260. av_log(h->avctx, AV_LOG_ERROR,
  261. "reference picture missing during reorder\n");
  262. memset(&h->ref_list[list][index], 0, sizeof(Picture)); // FIXME
  263. } else {
  264. for (i = index; i + 1 < h->ref_count[list]; i++) {
  265. if (ref->long_ref == h->ref_list[list][i].long_ref &&
  266. ref->pic_id == h->ref_list[list][i].pic_id)
  267. break;
  268. }
  269. for (; i > index; i--) {
  270. COPY_PICTURE(&h->ref_list[list][i], &h->ref_list[list][i - 1]);
  271. }
  272. COPY_PICTURE(&h->ref_list[list][index], ref);
  273. if (FIELD_PICTURE(h)) {
  274. pic_as_field(&h->ref_list[list][index], pic_structure);
  275. }
  276. }
  277. }
  278. }
  279. }
  280. for (list = 0; list < h->list_count; list++) {
  281. for (index = 0; index < h->ref_count[list]; index++) {
  282. if (!h->ref_list[list][index].f.buf[0]) {
  283. av_log(h->avctx, AV_LOG_ERROR, "Missing reference picture\n");
  284. if (h->default_ref_list[list][0].f.buf[0])
  285. COPY_PICTURE(&h->ref_list[list][index], &h->default_ref_list[list][0]);
  286. else
  287. return -1;
  288. }
  289. }
  290. }
  291. return 0;
  292. }
  293. void ff_h264_fill_mbaff_ref_list(H264Context *h)
  294. {
  295. int list, i, j;
  296. for (list = 0; list < 2; list++) { //FIXME try list_count
  297. for (i = 0; i < h->ref_count[list]; i++) {
  298. Picture *frame = &h->ref_list[list][i];
  299. Picture *field = &h->ref_list[list][16 + 2 * i];
  300. COPY_PICTURE(field, frame);
  301. for (j = 0; j < 3; j++)
  302. field[0].f.linesize[j] <<= 1;
  303. field[0].reference = PICT_TOP_FIELD;
  304. field[0].poc = field[0].field_poc[0];
  305. COPY_PICTURE(field + 1, field);
  306. for (j = 0; j < 3; j++)
  307. field[1].f.data[j] += frame->f.linesize[j];
  308. field[1].reference = PICT_BOTTOM_FIELD;
  309. field[1].poc = field[1].field_poc[1];
  310. h->luma_weight[16 + 2 * i][list][0] = h->luma_weight[16 + 2 * i + 1][list][0] = h->luma_weight[i][list][0];
  311. h->luma_weight[16 + 2 * i][list][1] = h->luma_weight[16 + 2 * i + 1][list][1] = h->luma_weight[i][list][1];
  312. for (j = 0; j < 2; j++) {
  313. h->chroma_weight[16 + 2 * i][list][j][0] = h->chroma_weight[16 + 2 * i + 1][list][j][0] = h->chroma_weight[i][list][j][0];
  314. h->chroma_weight[16 + 2 * i][list][j][1] = h->chroma_weight[16 + 2 * i + 1][list][j][1] = h->chroma_weight[i][list][j][1];
  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, Picture *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 Picture 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 Picture *find_short(H264Context *h, int frame_num, int *idx)
  353. {
  354. int i;
  355. for (i = 0; i < h->short_ref_count; i++) {
  356. Picture *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(Picture*));
  379. }
  380. /**
  381. *
  382. * @return the removed picture or NULL if an error occurs
  383. */
  384. static Picture *remove_short(H264Context *h, int frame_num, int ref_mask)
  385. {
  386. Picture *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 Picture *remove_long(H264Context *h, int i, int ref_mask)
  403. {
  404. Picture *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. Picture *pic = h->short_ref[i];
  439. av_log(h->avctx, AV_LOG_DEBUG, "%d 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. Picture *pic = h->long_ref[i];
  454. if (pic) {
  455. av_log(h->avctx, AV_LOG_DEBUG, "%d 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;
  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. Picture *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. if (h->long_ref[mmco[i].long_arg] != h->cur_pic_ptr) {
  562. remove_long(h, mmco[i].long_arg, 0);
  563. h->long_ref[mmco[i].long_arg] = h->cur_pic_ptr;
  564. h->long_ref[mmco[i].long_arg]->long_ref = 1;
  565. h->long_ref_count++;
  566. }
  567. h->cur_pic_ptr->reference |= h->picture_structure;
  568. current_ref_assigned = 1;
  569. break;
  570. case MMCO_SET_MAX_LONG:
  571. assert(mmco[i].long_arg <= 16);
  572. // just remove the long term which index is greater than new max
  573. for (j = mmco[i].long_arg; j < 16; j++) {
  574. remove_long(h, j, 0);
  575. }
  576. break;
  577. case MMCO_RESET:
  578. while (h->short_ref_count) {
  579. remove_short(h, h->short_ref[0]->frame_num, 0);
  580. }
  581. for (j = 0; j < 16; j++) {
  582. remove_long(h, j, 0);
  583. }
  584. h->frame_num = h->cur_pic_ptr->frame_num = 0;
  585. h->mmco_reset = 1;
  586. h->cur_pic_ptr->mmco_reset = 1;
  587. break;
  588. default: assert(0);
  589. }
  590. }
  591. if (!current_ref_assigned) {
  592. /* Second field of complementary field pair; the first field of
  593. * which is already referenced. If short referenced, it
  594. * should be first entry in short_ref. If not, it must exist
  595. * in long_ref; trying to put it on the short list here is an
  596. * error in the encoded bit stream (ref: 7.4.3.3, NOTE 2 and 3).
  597. */
  598. if (h->short_ref_count && h->short_ref[0] == h->cur_pic_ptr) {
  599. /* Just mark the second field valid */
  600. h->cur_pic_ptr->reference = PICT_FRAME;
  601. } else if (h->cur_pic_ptr->long_ref) {
  602. av_log(h->avctx, AV_LOG_ERROR, "illegal short term reference "
  603. "assignment for second field "
  604. "in complementary field pair "
  605. "(first field is long term)\n");
  606. err = AVERROR_INVALIDDATA;
  607. } else {
  608. pic = remove_short(h, h->cur_pic_ptr->frame_num, 0);
  609. if (pic) {
  610. av_log(h->avctx, AV_LOG_ERROR, "illegal short term buffer state detected\n");
  611. err = AVERROR_INVALIDDATA;
  612. }
  613. if (h->short_ref_count)
  614. memmove(&h->short_ref[1], &h->short_ref[0],
  615. h->short_ref_count * sizeof(Picture*));
  616. h->short_ref[0] = h->cur_pic_ptr;
  617. h->short_ref_count++;
  618. h->cur_pic_ptr->reference |= h->picture_structure;
  619. }
  620. }
  621. if (h->long_ref_count + h->short_ref_count -
  622. (h->short_ref[0] == h->cur_pic_ptr) > h->sps.ref_frame_count) {
  623. /* We have too many reference frames, probably due to corrupted
  624. * stream. Need to discard one frame. Prevents overrun of the
  625. * short_ref and long_ref buffers.
  626. */
  627. av_log(h->avctx, AV_LOG_ERROR,
  628. "number of reference frames (%d+%d) exceeds max (%d; probably "
  629. "corrupt input), discarding one\n",
  630. h->long_ref_count, h->short_ref_count, h->sps.ref_frame_count);
  631. err = AVERROR_INVALIDDATA;
  632. if (h->long_ref_count && !h->short_ref_count) {
  633. for (i = 0; i < 16; ++i)
  634. if (h->long_ref[i])
  635. break;
  636. assert(i < 16);
  637. remove_long(h, i, 0);
  638. } else {
  639. pic = h->short_ref[h->short_ref_count - 1];
  640. remove_short(h, pic->frame_num, 0);
  641. }
  642. }
  643. print_short_term(h);
  644. print_long_term(h);
  645. return (h->avctx->err_recognition & AV_EF_EXPLODE) ? err : 0;
  646. }
  647. int ff_h264_decode_ref_pic_marking(H264Context *h, GetBitContext *gb,
  648. int first_slice)
  649. {
  650. int i, ret;
  651. MMCO mmco_temp[MAX_MMCO_COUNT], *mmco = first_slice ? h->mmco : mmco_temp;
  652. int mmco_index = 0;
  653. if (h->nal_unit_type == NAL_IDR_SLICE) { // FIXME fields
  654. skip_bits1(gb); // broken_link
  655. if (get_bits1(gb)) {
  656. mmco[0].opcode = MMCO_LONG;
  657. mmco[0].long_arg = 0;
  658. mmco_index = 1;
  659. }
  660. } else {
  661. if (get_bits1(gb)) { // adaptive_ref_pic_marking_mode_flag
  662. for (i = 0; i < MAX_MMCO_COUNT; i++) {
  663. MMCOOpcode opcode = get_ue_golomb_31(gb);
  664. mmco[i].opcode = opcode;
  665. if (opcode == MMCO_SHORT2UNUSED || opcode == MMCO_SHORT2LONG) {
  666. mmco[i].short_pic_num =
  667. (h->curr_pic_num - get_ue_golomb(gb) - 1) &
  668. (h->max_pic_num - 1);
  669. #if 0
  670. if (mmco[i].short_pic_num >= h->short_ref_count ||
  671. h->short_ref[ mmco[i].short_pic_num ] == NULL){
  672. av_log(s->avctx, AV_LOG_ERROR,
  673. "illegal short ref in memory management control "
  674. "operation %d\n", mmco);
  675. return -1;
  676. }
  677. #endif
  678. }
  679. if (opcode == MMCO_SHORT2LONG || opcode == MMCO_LONG2UNUSED ||
  680. opcode == MMCO_LONG || opcode == MMCO_SET_MAX_LONG) {
  681. unsigned int long_arg = get_ue_golomb_31(gb);
  682. if (long_arg >= 32 ||
  683. (long_arg >= 16 && !(opcode == MMCO_SET_MAX_LONG &&
  684. long_arg == 16) &&
  685. !(opcode == MMCO_LONG2UNUSED && FIELD_PICTURE(h)))) {
  686. av_log(h->avctx, AV_LOG_ERROR,
  687. "illegal long ref in memory management control "
  688. "operation %d\n", opcode);
  689. return -1;
  690. }
  691. mmco[i].long_arg = long_arg;
  692. }
  693. if (opcode > (unsigned) MMCO_LONG) {
  694. av_log(h->avctx, AV_LOG_ERROR,
  695. "illegal memory management control operation %d\n",
  696. opcode);
  697. return -1;
  698. }
  699. if (opcode == MMCO_END)
  700. break;
  701. }
  702. mmco_index = i;
  703. } else {
  704. if (first_slice) {
  705. ret = ff_generate_sliding_window_mmcos(h, first_slice);
  706. if (ret < 0 && h->avctx->err_recognition & AV_EF_EXPLODE)
  707. return ret;
  708. }
  709. mmco_index = -1;
  710. }
  711. }
  712. if (first_slice && mmco_index != -1) {
  713. h->mmco_index = mmco_index;
  714. } else if (!first_slice && mmco_index >= 0 &&
  715. (mmco_index != h->mmco_index ||
  716. check_opcodes(h->mmco, mmco_temp, mmco_index))) {
  717. av_log(h->avctx, AV_LOG_ERROR,
  718. "Inconsistent MMCO state between slices [%d, %d]\n",
  719. mmco_index, h->mmco_index);
  720. return AVERROR_INVALIDDATA;
  721. }
  722. return 0;
  723. }