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.

804 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. if (reordering_of_pic_nums_idc < 3) {
  207. if (reordering_of_pic_nums_idc < 2) {
  208. const unsigned int abs_diff_pic_num = get_ue_golomb(&h->gb) + 1;
  209. int frame_num;
  210. if (abs_diff_pic_num > h->max_pic_num) {
  211. av_log(h->avctx, AV_LOG_ERROR, "abs_diff_pic_num overflow\n");
  212. return -1;
  213. }
  214. if (reordering_of_pic_nums_idc == 0)
  215. pred -= abs_diff_pic_num;
  216. else
  217. pred += abs_diff_pic_num;
  218. pred &= h->max_pic_num - 1;
  219. frame_num = pic_num_extract(h, pred, &pic_structure);
  220. for (i = h->short_ref_count - 1; i >= 0; i--) {
  221. ref = h->short_ref[i];
  222. assert(ref->reference);
  223. assert(!ref->long_ref);
  224. if (ref->frame_num == frame_num &&
  225. (ref->reference & pic_structure))
  226. break;
  227. }
  228. if (i >= 0)
  229. ref->pic_id = pred;
  230. } else {
  231. int long_idx;
  232. pic_id = get_ue_golomb(&h->gb); //long_term_pic_idx
  233. long_idx = pic_num_extract(h, pic_id, &pic_structure);
  234. if (long_idx > 31) {
  235. av_log(h->avctx, AV_LOG_ERROR, "long_term_pic_idx overflow\n");
  236. return -1;
  237. }
  238. ref = h->long_ref[long_idx];
  239. assert(!(ref && !ref->reference));
  240. if (ref && (ref->reference & pic_structure)) {
  241. ref->pic_id = pic_id;
  242. assert(ref->long_ref);
  243. i = 0;
  244. } else {
  245. i = -1;
  246. }
  247. }
  248. if (i < 0) {
  249. av_log(h->avctx, AV_LOG_ERROR, "reference picture missing during reorder\n");
  250. memset(&h->ref_list[list][index], 0, sizeof(Picture)); //FIXME
  251. } else {
  252. for (i = index; i + 1 < h->ref_count[list]; i++) {
  253. if (ref->long_ref == h->ref_list[list][i].long_ref &&
  254. ref->pic_id == h->ref_list[list][i].pic_id)
  255. break;
  256. }
  257. for (; i > index; i--) {
  258. COPY_PICTURE(&h->ref_list[list][i], &h->ref_list[list][i - 1]);
  259. }
  260. COPY_PICTURE(&h->ref_list[list][index], ref);
  261. if (FIELD_PICTURE(h)) {
  262. pic_as_field(&h->ref_list[list][index], pic_structure);
  263. }
  264. }
  265. } else {
  266. av_log(h->avctx, AV_LOG_ERROR, "illegal reordering_of_pic_nums_idc\n");
  267. return -1;
  268. }
  269. }
  270. }
  271. }
  272. for (list = 0; list < h->list_count; list++) {
  273. for (index = 0; index < h->ref_count[list]; index++) {
  274. if (!h->ref_list[list][index].f.buf[0]) {
  275. av_log(h->avctx, AV_LOG_ERROR, "Missing reference picture\n");
  276. if (h->default_ref_list[list][0].f.buf[0])
  277. COPY_PICTURE(&h->ref_list[list][index], &h->default_ref_list[list][0]);
  278. else
  279. return -1;
  280. }
  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 < 2; list++) { //FIXME try list_count
  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. }
  421. /**
  422. * print short term list
  423. */
  424. static void print_short_term(H264Context *h)
  425. {
  426. uint32_t i;
  427. if (h->avctx->debug & FF_DEBUG_MMCO) {
  428. av_log(h->avctx, AV_LOG_DEBUG, "short term list:\n");
  429. for (i = 0; i < h->short_ref_count; i++) {
  430. Picture *pic = h->short_ref[i];
  431. av_log(h->avctx, AV_LOG_DEBUG, "%d fn:%d poc:%d %p\n",
  432. i, pic->frame_num, pic->poc, pic->f.data[0]);
  433. }
  434. }
  435. }
  436. /**
  437. * print long term list
  438. */
  439. static void print_long_term(H264Context *h)
  440. {
  441. uint32_t i;
  442. if (h->avctx->debug & FF_DEBUG_MMCO) {
  443. av_log(h->avctx, AV_LOG_DEBUG, "long term list:\n");
  444. for (i = 0; i < 16; i++) {
  445. Picture *pic = h->long_ref[i];
  446. if (pic) {
  447. av_log(h->avctx, AV_LOG_DEBUG, "%d fn:%d poc:%d %p\n",
  448. i, pic->frame_num, pic->poc, pic->f.data[0]);
  449. }
  450. }
  451. }
  452. }
  453. static int check_opcodes(MMCO *mmco1, MMCO *mmco2, int n_mmcos)
  454. {
  455. int i;
  456. for (i = 0; i < n_mmcos; i++) {
  457. if (mmco1[i].opcode != mmco2[i].opcode)
  458. return -1;
  459. }
  460. return 0;
  461. }
  462. int ff_generate_sliding_window_mmcos(H264Context *h, int first_slice)
  463. {
  464. MMCO mmco_temp[MAX_MMCO_COUNT], *mmco = first_slice ? h->mmco : mmco_temp;
  465. int mmco_index = 0, i;
  466. assert(h->long_ref_count + h->short_ref_count <= h->sps.ref_frame_count);
  467. if (h->short_ref_count &&
  468. h->long_ref_count + h->short_ref_count == h->sps.ref_frame_count &&
  469. !(FIELD_PICTURE(h) && !h->first_field && h->cur_pic_ptr->reference)) {
  470. mmco[0].opcode = MMCO_SHORT2UNUSED;
  471. mmco[0].short_pic_num = h->short_ref[h->short_ref_count - 1]->frame_num;
  472. mmco_index = 1;
  473. if (FIELD_PICTURE(h)) {
  474. mmco[0].short_pic_num *= 2;
  475. mmco[1].opcode = MMCO_SHORT2UNUSED;
  476. mmco[1].short_pic_num = mmco[0].short_pic_num + 1;
  477. mmco_index = 2;
  478. }
  479. }
  480. if (first_slice) {
  481. h->mmco_index = mmco_index;
  482. } else if (!first_slice && mmco_index >= 0 &&
  483. (mmco_index != h->mmco_index ||
  484. (i = check_opcodes(h->mmco, mmco_temp, mmco_index)))) {
  485. av_log(h->avctx, AV_LOG_ERROR,
  486. "Inconsistent MMCO state between slices [%d, %d, %d]\n",
  487. mmco_index, h->mmco_index, i);
  488. return AVERROR_INVALIDDATA;
  489. }
  490. return 0;
  491. }
  492. int ff_h264_execute_ref_pic_marking(H264Context *h, MMCO *mmco, int mmco_count)
  493. {
  494. int i, av_uninit(j);
  495. int current_ref_assigned = 0, err = 0;
  496. Picture *av_uninit(pic);
  497. if ((h->avctx->debug & FF_DEBUG_MMCO) && mmco_count == 0)
  498. av_log(h->avctx, AV_LOG_DEBUG, "no mmco here\n");
  499. for (i = 0; i < mmco_count; i++) {
  500. int av_uninit(structure), av_uninit(frame_num);
  501. if (h->avctx->debug & FF_DEBUG_MMCO)
  502. av_log(h->avctx, AV_LOG_DEBUG, "mmco:%d %d %d\n", h->mmco[i].opcode,
  503. h->mmco[i].short_pic_num, h->mmco[i].long_arg);
  504. if (mmco[i].opcode == MMCO_SHORT2UNUSED ||
  505. mmco[i].opcode == MMCO_SHORT2LONG) {
  506. frame_num = pic_num_extract(h, mmco[i].short_pic_num, &structure);
  507. pic = find_short(h, frame_num, &j);
  508. if (!pic) {
  509. if (mmco[i].opcode != MMCO_SHORT2LONG ||
  510. !h->long_ref[mmco[i].long_arg] ||
  511. h->long_ref[mmco[i].long_arg]->frame_num != frame_num) {
  512. av_log(h->avctx, AV_LOG_ERROR, "mmco: unref short failure\n");
  513. err = AVERROR_INVALIDDATA;
  514. }
  515. continue;
  516. }
  517. }
  518. switch (mmco[i].opcode) {
  519. case MMCO_SHORT2UNUSED:
  520. if (h->avctx->debug & FF_DEBUG_MMCO)
  521. av_log(h->avctx, AV_LOG_DEBUG, "mmco: unref short %d count %d\n",
  522. h->mmco[i].short_pic_num, h->short_ref_count);
  523. remove_short(h, frame_num, structure ^ PICT_FRAME);
  524. break;
  525. case MMCO_SHORT2LONG:
  526. if (h->long_ref[mmco[i].long_arg] != pic)
  527. remove_long(h, mmco[i].long_arg, 0);
  528. remove_short_at_index(h, j);
  529. h->long_ref[ mmco[i].long_arg ] = pic;
  530. if (h->long_ref[mmco[i].long_arg]) {
  531. h->long_ref[mmco[i].long_arg]->long_ref = 1;
  532. h->long_ref_count++;
  533. }
  534. break;
  535. case MMCO_LONG2UNUSED:
  536. j = pic_num_extract(h, mmco[i].long_arg, &structure);
  537. pic = h->long_ref[j];
  538. if (pic) {
  539. remove_long(h, j, structure ^ PICT_FRAME);
  540. } else if (h->avctx->debug & FF_DEBUG_MMCO)
  541. av_log(h->avctx, AV_LOG_DEBUG, "mmco: unref long failure\n");
  542. break;
  543. case MMCO_LONG:
  544. // Comment below left from previous code as it is an interresting note.
  545. /* First field in pair is in short term list or
  546. * at a different long term index.
  547. * This is not allowed; see 7.4.3.3, notes 2 and 3.
  548. * Report the problem and keep the pair where it is,
  549. * and mark this field valid.
  550. */
  551. if (h->long_ref[mmco[i].long_arg] != h->cur_pic_ptr) {
  552. remove_long(h, mmco[i].long_arg, 0);
  553. h->long_ref[mmco[i].long_arg] = h->cur_pic_ptr;
  554. h->long_ref[mmco[i].long_arg]->long_ref = 1;
  555. h->long_ref_count++;
  556. }
  557. h->cur_pic_ptr->reference |= h->picture_structure;
  558. current_ref_assigned = 1;
  559. break;
  560. case MMCO_SET_MAX_LONG:
  561. assert(mmco[i].long_arg <= 16);
  562. // just remove the long term which index is greater than new max
  563. for (j = mmco[i].long_arg; j < 16; j++) {
  564. remove_long(h, j, 0);
  565. }
  566. break;
  567. case MMCO_RESET:
  568. while (h->short_ref_count) {
  569. remove_short(h, h->short_ref[0]->frame_num, 0);
  570. }
  571. for (j = 0; j < 16; j++) {
  572. remove_long(h, j, 0);
  573. }
  574. h->frame_num = h->cur_pic_ptr->frame_num = 0;
  575. h->mmco_reset = 1;
  576. h->cur_pic_ptr->mmco_reset = 1;
  577. break;
  578. default: assert(0);
  579. }
  580. }
  581. if (!current_ref_assigned) {
  582. /* Second field of complementary field pair; the first field of
  583. * which is already referenced. If short referenced, it
  584. * should be first entry in short_ref. If not, it must exist
  585. * in long_ref; trying to put it on the short list here is an
  586. * error in the encoded bit stream (ref: 7.4.3.3, NOTE 2 and 3).
  587. */
  588. if (h->short_ref_count && h->short_ref[0] == h->cur_pic_ptr) {
  589. /* Just mark the second field valid */
  590. h->cur_pic_ptr->reference = PICT_FRAME;
  591. } else if (h->cur_pic_ptr->long_ref) {
  592. av_log(h->avctx, AV_LOG_ERROR, "illegal short term reference "
  593. "assignment for second field "
  594. "in complementary field pair "
  595. "(first field is long term)\n");
  596. err = AVERROR_INVALIDDATA;
  597. } else {
  598. pic = remove_short(h, h->cur_pic_ptr->frame_num, 0);
  599. if (pic) {
  600. av_log(h->avctx, AV_LOG_ERROR, "illegal short term buffer state detected\n");
  601. err = AVERROR_INVALIDDATA;
  602. }
  603. if (h->short_ref_count)
  604. memmove(&h->short_ref[1], &h->short_ref[0],
  605. h->short_ref_count * sizeof(Picture*));
  606. h->short_ref[0] = h->cur_pic_ptr;
  607. h->short_ref_count++;
  608. h->cur_pic_ptr->reference |= h->picture_structure;
  609. }
  610. }
  611. if (h->long_ref_count + h->short_ref_count -
  612. (h->short_ref[0] == h->cur_pic_ptr) > h->sps.ref_frame_count) {
  613. /* We have too many reference frames, probably due to corrupted
  614. * stream. Need to discard one frame. Prevents overrun of the
  615. * short_ref and long_ref buffers.
  616. */
  617. av_log(h->avctx, AV_LOG_ERROR,
  618. "number of reference frames (%d+%d) exceeds max (%d; probably "
  619. "corrupt input), discarding one\n",
  620. h->long_ref_count, h->short_ref_count, h->sps.ref_frame_count);
  621. err = AVERROR_INVALIDDATA;
  622. if (h->long_ref_count && !h->short_ref_count) {
  623. for (i = 0; i < 16; ++i)
  624. if (h->long_ref[i])
  625. break;
  626. assert(i < 16);
  627. remove_long(h, i, 0);
  628. } else {
  629. pic = h->short_ref[h->short_ref_count - 1];
  630. remove_short(h, pic->frame_num, 0);
  631. }
  632. }
  633. print_short_term(h);
  634. print_long_term(h);
  635. return (h->avctx->err_recognition & AV_EF_EXPLODE) ? err : 0;
  636. }
  637. int ff_h264_decode_ref_pic_marking(H264Context *h, GetBitContext *gb,
  638. int first_slice)
  639. {
  640. int i, ret;
  641. MMCO mmco_temp[MAX_MMCO_COUNT], *mmco = first_slice ? h->mmco : mmco_temp;
  642. int mmco_index = 0;
  643. if (h->nal_unit_type == NAL_IDR_SLICE) { // FIXME fields
  644. skip_bits1(gb); // broken_link
  645. if (get_bits1(gb)) {
  646. mmco[0].opcode = MMCO_LONG;
  647. mmco[0].long_arg = 0;
  648. mmco_index = 1;
  649. }
  650. } else {
  651. if (get_bits1(gb)) { // adaptive_ref_pic_marking_mode_flag
  652. for (i = 0; i < MAX_MMCO_COUNT; i++) {
  653. MMCOOpcode opcode = get_ue_golomb_31(gb);
  654. mmco[i].opcode = opcode;
  655. if (opcode == MMCO_SHORT2UNUSED || opcode == MMCO_SHORT2LONG) {
  656. mmco[i].short_pic_num =
  657. (h->curr_pic_num - get_ue_golomb(gb) - 1) &
  658. (h->max_pic_num - 1);
  659. #if 0
  660. if (mmco[i].short_pic_num >= h->short_ref_count ||
  661. h->short_ref[ mmco[i].short_pic_num ] == NULL){
  662. av_log(s->avctx, AV_LOG_ERROR,
  663. "illegal short ref in memory management control "
  664. "operation %d\n", mmco);
  665. return -1;
  666. }
  667. #endif
  668. }
  669. if (opcode == MMCO_SHORT2LONG || opcode == MMCO_LONG2UNUSED ||
  670. opcode == MMCO_LONG || opcode == MMCO_SET_MAX_LONG) {
  671. unsigned int long_arg = get_ue_golomb_31(gb);
  672. if (long_arg >= 32 ||
  673. (long_arg >= 16 && !(opcode == MMCO_SET_MAX_LONG &&
  674. long_arg == 16) &&
  675. !(opcode == MMCO_LONG2UNUSED && FIELD_PICTURE(h)))) {
  676. av_log(h->avctx, AV_LOG_ERROR,
  677. "illegal long ref in memory management control "
  678. "operation %d\n", opcode);
  679. return -1;
  680. }
  681. mmco[i].long_arg = long_arg;
  682. }
  683. if (opcode > (unsigned) MMCO_LONG) {
  684. av_log(h->avctx, AV_LOG_ERROR,
  685. "illegal memory management control operation %d\n",
  686. opcode);
  687. return -1;
  688. }
  689. if (opcode == MMCO_END)
  690. break;
  691. }
  692. mmco_index = i;
  693. } else {
  694. if (first_slice) {
  695. ret = ff_generate_sliding_window_mmcos(h, first_slice);
  696. if (ret < 0 && h->avctx->err_recognition & AV_EF_EXPLODE)
  697. return ret;
  698. }
  699. mmco_index = -1;
  700. }
  701. }
  702. if (first_slice && mmco_index != -1) {
  703. h->mmco_index = mmco_index;
  704. } else if (!first_slice && mmco_index >= 0 &&
  705. (mmco_index != h->mmco_index ||
  706. check_opcodes(h->mmco, mmco_temp, mmco_index))) {
  707. av_log(h->avctx, AV_LOG_ERROR,
  708. "Inconsistent MMCO state between slices [%d, %d]\n",
  709. mmco_index, h->mmco_index);
  710. return AVERROR_INVALIDDATA;
  711. }
  712. return 0;
  713. }