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.

797 lines
28KB

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