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
30KB

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