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.

1080 lines
38KB

  1. /*
  2. * Ut Video decoder
  3. * Copyright (c) 2011 Konstantin Shishkov
  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. * Ut Video decoder
  24. */
  25. #include <inttypes.h>
  26. #include <stdlib.h>
  27. #define UNCHECKED_BITSTREAM_READER 1
  28. #include "libavutil/intreadwrite.h"
  29. #include "avcodec.h"
  30. #include "bswapdsp.h"
  31. #include "bytestream.h"
  32. #include "get_bits.h"
  33. #include "internal.h"
  34. #include "thread.h"
  35. #include "utvideo.h"
  36. static int build_huff10(const uint8_t *src, VLC *vlc, int *fsym)
  37. {
  38. int i;
  39. HuffEntry he[1024];
  40. int last;
  41. uint32_t codes[1024];
  42. uint8_t bits[1024];
  43. uint16_t syms[1024];
  44. uint32_t code;
  45. *fsym = -1;
  46. for (i = 0; i < 1024; i++) {
  47. he[i].sym = i;
  48. he[i].len = *src++;
  49. }
  50. qsort(he, 1024, sizeof(*he), ff_ut10_huff_cmp_len);
  51. if (!he[0].len) {
  52. *fsym = he[0].sym;
  53. return 0;
  54. }
  55. last = 1023;
  56. while (he[last].len == 255 && last)
  57. last--;
  58. if (he[last].len > 32) {
  59. return -1;
  60. }
  61. code = 1;
  62. for (i = last; i >= 0; i--) {
  63. codes[i] = code >> (32 - he[i].len);
  64. bits[i] = he[i].len;
  65. syms[i] = he[i].sym;
  66. code += 0x80000000u >> (he[i].len - 1);
  67. }
  68. #define VLC_BITS 11
  69. return ff_init_vlc_sparse(vlc, VLC_BITS, last + 1,
  70. bits, sizeof(*bits), sizeof(*bits),
  71. codes, sizeof(*codes), sizeof(*codes),
  72. syms, sizeof(*syms), sizeof(*syms), 0);
  73. }
  74. static int build_huff(const uint8_t *src, VLC *vlc, int *fsym)
  75. {
  76. int i;
  77. HuffEntry he[256];
  78. int last;
  79. uint32_t codes[256];
  80. uint8_t bits[256];
  81. uint8_t syms[256];
  82. uint32_t code;
  83. *fsym = -1;
  84. for (i = 0; i < 256; i++) {
  85. he[i].sym = i;
  86. he[i].len = *src++;
  87. }
  88. qsort(he, 256, sizeof(*he), ff_ut_huff_cmp_len);
  89. if (!he[0].len) {
  90. *fsym = he[0].sym;
  91. return 0;
  92. }
  93. last = 255;
  94. while (he[last].len == 255 && last)
  95. last--;
  96. if (he[last].len > 32)
  97. return -1;
  98. code = 1;
  99. for (i = last; i >= 0; i--) {
  100. codes[i] = code >> (32 - he[i].len);
  101. bits[i] = he[i].len;
  102. syms[i] = he[i].sym;
  103. code += 0x80000000u >> (he[i].len - 1);
  104. }
  105. return ff_init_vlc_sparse(vlc, VLC_BITS, last + 1,
  106. bits, sizeof(*bits), sizeof(*bits),
  107. codes, sizeof(*codes), sizeof(*codes),
  108. syms, sizeof(*syms), sizeof(*syms), 0);
  109. }
  110. static int decode_plane10(UtvideoContext *c, int plane_no,
  111. uint16_t *dst, ptrdiff_t stride,
  112. int width, int height,
  113. const uint8_t *src, const uint8_t *huff,
  114. int use_pred)
  115. {
  116. int i, j, slice, pix, ret;
  117. int sstart, send;
  118. VLC vlc;
  119. GetBitContext gb;
  120. int prev, fsym;
  121. if ((ret = build_huff10(huff, &vlc, &fsym)) < 0) {
  122. av_log(c->avctx, AV_LOG_ERROR, "Cannot build Huffman codes\n");
  123. return ret;
  124. }
  125. if (fsym >= 0) { // build_huff reported a symbol to fill slices with
  126. send = 0;
  127. for (slice = 0; slice < c->slices; slice++) {
  128. uint16_t *dest;
  129. sstart = send;
  130. send = (height * (slice + 1) / c->slices);
  131. dest = dst + sstart * stride;
  132. prev = 0x200;
  133. for (j = sstart; j < send; j++) {
  134. for (i = 0; i < width; i++) {
  135. pix = fsym;
  136. if (use_pred) {
  137. prev += pix;
  138. prev &= 0x3FF;
  139. pix = prev;
  140. }
  141. dest[i] = pix;
  142. }
  143. dest += stride;
  144. }
  145. }
  146. return 0;
  147. }
  148. send = 0;
  149. for (slice = 0; slice < c->slices; slice++) {
  150. uint16_t *dest;
  151. int slice_data_start, slice_data_end, slice_size;
  152. sstart = send;
  153. send = (height * (slice + 1) / c->slices);
  154. dest = dst + sstart * stride;
  155. // slice offset and size validation was done earlier
  156. slice_data_start = slice ? AV_RL32(src + slice * 4 - 4) : 0;
  157. slice_data_end = AV_RL32(src + slice * 4);
  158. slice_size = slice_data_end - slice_data_start;
  159. if (!slice_size) {
  160. av_log(c->avctx, AV_LOG_ERROR, "Plane has more than one symbol "
  161. "yet a slice has a length of zero.\n");
  162. goto fail;
  163. }
  164. memset(c->slice_bits + slice_size, 0, AV_INPUT_BUFFER_PADDING_SIZE);
  165. c->bdsp.bswap_buf((uint32_t *) c->slice_bits,
  166. (uint32_t *)(src + slice_data_start + c->slices * 4),
  167. (slice_data_end - slice_data_start + 3) >> 2);
  168. init_get_bits(&gb, c->slice_bits, slice_size * 8);
  169. prev = 0x200;
  170. for (j = sstart; j < send; j++) {
  171. for (i = 0; i < width; i++) {
  172. pix = get_vlc2(&gb, vlc.table, VLC_BITS, 3);
  173. if (pix < 0) {
  174. av_log(c->avctx, AV_LOG_ERROR, "Decoding error\n");
  175. goto fail;
  176. }
  177. if (use_pred) {
  178. prev += pix;
  179. prev &= 0x3FF;
  180. pix = prev;
  181. }
  182. dest[i] = pix;
  183. }
  184. dest += stride;
  185. if (get_bits_left(&gb) < 0) {
  186. av_log(c->avctx, AV_LOG_ERROR,
  187. "Slice decoding ran out of bits\n");
  188. goto fail;
  189. }
  190. }
  191. if (get_bits_left(&gb) > 32)
  192. av_log(c->avctx, AV_LOG_WARNING,
  193. "%d bits left after decoding slice\n", get_bits_left(&gb));
  194. }
  195. ff_free_vlc(&vlc);
  196. return 0;
  197. fail:
  198. ff_free_vlc(&vlc);
  199. return AVERROR_INVALIDDATA;
  200. }
  201. static int compute_cmask(int plane_no, int interlaced, enum AVPixelFormat pix_fmt)
  202. {
  203. const int is_luma = (pix_fmt == AV_PIX_FMT_YUV420P) && !plane_no;
  204. if (interlaced)
  205. return ~(1 + 2 * is_luma);
  206. return ~is_luma;
  207. }
  208. static int decode_plane(UtvideoContext *c, int plane_no,
  209. uint8_t *dst, ptrdiff_t stride,
  210. int width, int height,
  211. const uint8_t *src, int use_pred)
  212. {
  213. int i, j, slice, pix;
  214. int sstart, send;
  215. VLC vlc;
  216. GetBitContext gb;
  217. int ret, prev, fsym;
  218. const int cmask = compute_cmask(plane_no, c->interlaced, c->avctx->pix_fmt);
  219. if (c->pack) {
  220. send = 0;
  221. for (slice = 0; slice < c->slices; slice++) {
  222. GetBitContext cbit, pbit;
  223. uint8_t *dest, *p;
  224. ret = init_get_bits8(&cbit, c->control_stream[plane_no][slice], c->control_stream_size[plane_no][slice]);
  225. if (ret < 0)
  226. return ret;
  227. ret = init_get_bits8(&pbit, c->packed_stream[plane_no][slice], c->packed_stream_size[plane_no][slice]);
  228. if (ret < 0)
  229. return ret;
  230. sstart = send;
  231. send = (height * (slice + 1) / c->slices) & cmask;
  232. dest = dst + sstart * stride;
  233. if (3 * ((dst + send * stride - dest + 7)/8) > get_bits_left(&cbit))
  234. return AVERROR_INVALIDDATA;
  235. for (p = dest; p < dst + send * stride; p += 8) {
  236. int bits = get_bits_le(&cbit, 3);
  237. if (bits == 0) {
  238. *(uint64_t *) p = 0;
  239. } else {
  240. uint32_t sub = 0x80 >> (8 - (bits + 1)), add;
  241. int k;
  242. if ((bits + 1) * 8 > get_bits_left(&pbit))
  243. return AVERROR_INVALIDDATA;
  244. for (k = 0; k < 8; k++) {
  245. p[k] = get_bits_le(&pbit, bits + 1);
  246. add = (~p[k] & sub) << (8 - bits);
  247. p[k] -= sub;
  248. p[k] += add;
  249. }
  250. }
  251. }
  252. }
  253. return 0;
  254. }
  255. if (build_huff(src, &vlc, &fsym)) {
  256. av_log(c->avctx, AV_LOG_ERROR, "Cannot build Huffman codes\n");
  257. return AVERROR_INVALIDDATA;
  258. }
  259. if (fsym >= 0) { // build_huff reported a symbol to fill slices with
  260. send = 0;
  261. for (slice = 0; slice < c->slices; slice++) {
  262. uint8_t *dest;
  263. sstart = send;
  264. send = (height * (slice + 1) / c->slices) & cmask;
  265. dest = dst + sstart * stride;
  266. prev = 0x80;
  267. for (j = sstart; j < send; j++) {
  268. for (i = 0; i < width; i++) {
  269. pix = fsym;
  270. if (use_pred) {
  271. prev += pix;
  272. pix = prev;
  273. }
  274. dest[i] = pix;
  275. }
  276. dest += stride;
  277. }
  278. }
  279. return 0;
  280. }
  281. src += 256;
  282. send = 0;
  283. for (slice = 0; slice < c->slices; slice++) {
  284. uint8_t *dest;
  285. int slice_data_start, slice_data_end, slice_size;
  286. sstart = send;
  287. send = (height * (slice + 1) / c->slices) & cmask;
  288. dest = dst + sstart * stride;
  289. // slice offset and size validation was done earlier
  290. slice_data_start = slice ? AV_RL32(src + slice * 4 - 4) : 0;
  291. slice_data_end = AV_RL32(src + slice * 4);
  292. slice_size = slice_data_end - slice_data_start;
  293. if (!slice_size) {
  294. av_log(c->avctx, AV_LOG_ERROR, "Plane has more than one symbol "
  295. "yet a slice has a length of zero.\n");
  296. goto fail;
  297. }
  298. memset(c->slice_bits + slice_size, 0, AV_INPUT_BUFFER_PADDING_SIZE);
  299. c->bdsp.bswap_buf((uint32_t *) c->slice_bits,
  300. (uint32_t *)(src + slice_data_start + c->slices * 4),
  301. (slice_data_end - slice_data_start + 3) >> 2);
  302. init_get_bits(&gb, c->slice_bits, slice_size * 8);
  303. prev = 0x80;
  304. for (j = sstart; j < send; j++) {
  305. for (i = 0; i < width; i++) {
  306. pix = get_vlc2(&gb, vlc.table, VLC_BITS, 3);
  307. if (pix < 0) {
  308. av_log(c->avctx, AV_LOG_ERROR, "Decoding error\n");
  309. goto fail;
  310. }
  311. if (use_pred) {
  312. prev += pix;
  313. pix = prev;
  314. }
  315. dest[i] = pix;
  316. }
  317. if (get_bits_left(&gb) < 0) {
  318. av_log(c->avctx, AV_LOG_ERROR,
  319. "Slice decoding ran out of bits\n");
  320. goto fail;
  321. }
  322. dest += stride;
  323. }
  324. if (get_bits_left(&gb) > 32)
  325. av_log(c->avctx, AV_LOG_WARNING,
  326. "%d bits left after decoding slice\n", get_bits_left(&gb));
  327. }
  328. ff_free_vlc(&vlc);
  329. return 0;
  330. fail:
  331. ff_free_vlc(&vlc);
  332. return AVERROR_INVALIDDATA;
  333. }
  334. #undef A
  335. #undef B
  336. #undef C
  337. static void restore_median_planar(UtvideoContext *c, uint8_t *src, ptrdiff_t stride,
  338. int width, int height, int slices, int rmode)
  339. {
  340. int i, j, slice;
  341. int A, B, C;
  342. uint8_t *bsrc;
  343. int slice_start, slice_height;
  344. const int cmask = ~rmode;
  345. for (slice = 0; slice < slices; slice++) {
  346. slice_start = ((slice * height) / slices) & cmask;
  347. slice_height = ((((slice + 1) * height) / slices) & cmask) -
  348. slice_start;
  349. if (!slice_height)
  350. continue;
  351. bsrc = src + slice_start * stride;
  352. // first line - left neighbour prediction
  353. bsrc[0] += 0x80;
  354. c->llviddsp.add_left_pred(bsrc, bsrc, width, 0);
  355. bsrc += stride;
  356. if (slice_height <= 1)
  357. continue;
  358. // second line - first element has top prediction, the rest uses median
  359. C = bsrc[-stride];
  360. bsrc[0] += C;
  361. A = bsrc[0];
  362. for (i = 1; i < FFMIN(width, 16); i++) { /* scalar loop (DSP need align 16) */
  363. B = bsrc[i - stride];
  364. bsrc[i] += mid_pred(A, B, (uint8_t)(A + B - C));
  365. C = B;
  366. A = bsrc[i];
  367. }
  368. if (width > 16)
  369. c->llviddsp.add_median_pred(bsrc + 16, bsrc - stride + 16,
  370. bsrc + 16, width - 16, &A, &B);
  371. bsrc += stride;
  372. // the rest of lines use continuous median prediction
  373. for (j = 2; j < slice_height; j++) {
  374. c->llviddsp.add_median_pred(bsrc, bsrc - stride,
  375. bsrc, width, &A, &B);
  376. bsrc += stride;
  377. }
  378. }
  379. }
  380. /* UtVideo interlaced mode treats every two lines as a single one,
  381. * so restoring function should take care of possible padding between
  382. * two parts of the same "line".
  383. */
  384. static void restore_median_planar_il(UtvideoContext *c, uint8_t *src, ptrdiff_t stride,
  385. int width, int height, int slices, int rmode)
  386. {
  387. int i, j, slice;
  388. int A, B, C;
  389. uint8_t *bsrc;
  390. int slice_start, slice_height;
  391. const int cmask = ~(rmode ? 3 : 1);
  392. const ptrdiff_t stride2 = stride << 1;
  393. for (slice = 0; slice < slices; slice++) {
  394. slice_start = ((slice * height) / slices) & cmask;
  395. slice_height = ((((slice + 1) * height) / slices) & cmask) -
  396. slice_start;
  397. slice_height >>= 1;
  398. if (!slice_height)
  399. continue;
  400. bsrc = src + slice_start * stride;
  401. // first line - left neighbour prediction
  402. bsrc[0] += 0x80;
  403. A = c->llviddsp.add_left_pred(bsrc, bsrc, width, 0);
  404. c->llviddsp.add_left_pred(bsrc + stride, bsrc + stride, width, A);
  405. bsrc += stride2;
  406. if (slice_height <= 1)
  407. continue;
  408. // second line - first element has top prediction, the rest uses median
  409. C = bsrc[-stride2];
  410. bsrc[0] += C;
  411. A = bsrc[0];
  412. for (i = 1; i < FFMIN(width, 16); i++) { /* scalar loop (DSP need align 16) */
  413. B = bsrc[i - stride2];
  414. bsrc[i] += mid_pred(A, B, (uint8_t)(A + B - C));
  415. C = B;
  416. A = bsrc[i];
  417. }
  418. if (width > 16)
  419. c->llviddsp.add_median_pred(bsrc + 16, bsrc - stride2 + 16,
  420. bsrc + 16, width - 16, &A, &B);
  421. c->llviddsp.add_median_pred(bsrc + stride, bsrc - stride,
  422. bsrc + stride, width, &A, &B);
  423. bsrc += stride2;
  424. // the rest of lines use continuous median prediction
  425. for (j = 2; j < slice_height; j++) {
  426. c->llviddsp.add_median_pred(bsrc, bsrc - stride2,
  427. bsrc, width, &A, &B);
  428. c->llviddsp.add_median_pred(bsrc + stride, bsrc - stride,
  429. bsrc + stride, width, &A, &B);
  430. bsrc += stride2;
  431. }
  432. }
  433. }
  434. static void restore_gradient_planar(UtvideoContext *c, uint8_t *src, ptrdiff_t stride,
  435. int width, int height, int slices, int rmode)
  436. {
  437. int i, j, slice;
  438. int A, B, C;
  439. uint8_t *bsrc;
  440. int slice_start, slice_height;
  441. const int cmask = ~rmode;
  442. int min_width = FFMIN(width, 32);
  443. for (slice = 0; slice < slices; slice++) {
  444. slice_start = ((slice * height) / slices) & cmask;
  445. slice_height = ((((slice + 1) * height) / slices) & cmask) -
  446. slice_start;
  447. if (!slice_height)
  448. continue;
  449. bsrc = src + slice_start * stride;
  450. // first line - left neighbour prediction
  451. bsrc[0] += 0x80;
  452. c->llviddsp.add_left_pred(bsrc, bsrc, width, 0);
  453. bsrc += stride;
  454. if (slice_height <= 1)
  455. continue;
  456. for (j = 1; j < slice_height; j++) {
  457. // second line - first element has top prediction, the rest uses gradient
  458. bsrc[0] = (bsrc[0] + bsrc[-stride]) & 0xFF;
  459. for (i = 1; i < min_width; i++) { /* dsp need align 32 */
  460. A = bsrc[i - stride];
  461. B = bsrc[i - (stride + 1)];
  462. C = bsrc[i - 1];
  463. bsrc[i] = (A - B + C + bsrc[i]) & 0xFF;
  464. }
  465. if (width > 32)
  466. c->llviddsp.add_gradient_pred(bsrc + 32, stride, width - 32);
  467. bsrc += stride;
  468. }
  469. }
  470. }
  471. static void restore_gradient_planar_il(UtvideoContext *c, uint8_t *src, ptrdiff_t stride,
  472. int width, int height, int slices, int rmode)
  473. {
  474. int i, j, slice;
  475. int A, B, C;
  476. uint8_t *bsrc;
  477. int slice_start, slice_height;
  478. const int cmask = ~(rmode ? 3 : 1);
  479. const ptrdiff_t stride2 = stride << 1;
  480. int min_width = FFMIN(width, 32);
  481. for (slice = 0; slice < slices; slice++) {
  482. slice_start = ((slice * height) / slices) & cmask;
  483. slice_height = ((((slice + 1) * height) / slices) & cmask) -
  484. slice_start;
  485. slice_height >>= 1;
  486. if (!slice_height)
  487. continue;
  488. bsrc = src + slice_start * stride;
  489. // first line - left neighbour prediction
  490. bsrc[0] += 0x80;
  491. A = c->llviddsp.add_left_pred(bsrc, bsrc, width, 0);
  492. c->llviddsp.add_left_pred(bsrc + stride, bsrc + stride, width, A);
  493. bsrc += stride2;
  494. if (slice_height <= 1)
  495. continue;
  496. for (j = 1; j < slice_height; j++) {
  497. // second line - first element has top prediction, the rest uses gradient
  498. bsrc[0] = (bsrc[0] + bsrc[-stride2]) & 0xFF;
  499. for (i = 1; i < min_width; i++) { /* dsp need align 32 */
  500. A = bsrc[i - stride2];
  501. B = bsrc[i - (stride2 + 1)];
  502. C = bsrc[i - 1];
  503. bsrc[i] = (A - B + C + bsrc[i]) & 0xFF;
  504. }
  505. if (width > 32)
  506. c->llviddsp.add_gradient_pred(bsrc + 32, stride2, width - 32);
  507. A = bsrc[-stride];
  508. B = bsrc[-(1 + stride + stride - width)];
  509. C = bsrc[width - 1];
  510. bsrc[stride] = (A - B + C + bsrc[stride]) & 0xFF;
  511. for (i = 1; i < width; i++) {
  512. A = bsrc[i - stride];
  513. B = bsrc[i - (1 + stride)];
  514. C = bsrc[i - 1 + stride];
  515. bsrc[i + stride] = (A - B + C + bsrc[i + stride]) & 0xFF;
  516. }
  517. bsrc += stride2;
  518. }
  519. }
  520. }
  521. static int decode_frame(AVCodecContext *avctx, void *data, int *got_frame,
  522. AVPacket *avpkt)
  523. {
  524. const uint8_t *buf = avpkt->data;
  525. int buf_size = avpkt->size;
  526. UtvideoContext *c = avctx->priv_data;
  527. int i, j;
  528. const uint8_t *plane_start[5];
  529. int plane_size, max_slice_size = 0, slice_start, slice_end, slice_size;
  530. int ret;
  531. GetByteContext gb;
  532. ThreadFrame frame = { .f = data };
  533. if ((ret = ff_thread_get_buffer(avctx, &frame, 0)) < 0)
  534. return ret;
  535. /* parse plane structure to get frame flags and validate slice offsets */
  536. bytestream2_init(&gb, buf, buf_size);
  537. if (c->pack) {
  538. const uint8_t *packed_stream;
  539. const uint8_t *control_stream;
  540. GetByteContext pb;
  541. uint32_t nb_cbs;
  542. int left;
  543. c->frame_info = PRED_GRADIENT << 8;
  544. if (bytestream2_get_byte(&gb) != 1)
  545. return AVERROR_INVALIDDATA;
  546. bytestream2_skip(&gb, 3);
  547. c->offset = bytestream2_get_le32(&gb);
  548. if (buf_size <= c->offset + 8LL)
  549. return AVERROR_INVALIDDATA;
  550. bytestream2_init(&pb, buf + 8 + c->offset, buf_size - 8 - c->offset);
  551. nb_cbs = bytestream2_get_le32(&pb);
  552. if (nb_cbs > c->offset)
  553. return AVERROR_INVALIDDATA;
  554. packed_stream = buf + 8;
  555. control_stream = packed_stream + (c->offset - nb_cbs);
  556. left = control_stream - packed_stream;
  557. for (i = 0; i < c->planes; i++) {
  558. for (j = 0; j < c->slices; j++) {
  559. c->packed_stream[i][j] = packed_stream;
  560. c->packed_stream_size[i][j] = bytestream2_get_le32(&pb);
  561. if (c->packed_stream_size[i][j] > left)
  562. return AVERROR_INVALIDDATA;
  563. left -= c->packed_stream_size[i][j];
  564. packed_stream += c->packed_stream_size[i][j];
  565. }
  566. }
  567. left = buf + buf_size - control_stream;
  568. for (i = 0; i < c->planes; i++) {
  569. for (j = 0; j < c->slices; j++) {
  570. c->control_stream[i][j] = control_stream;
  571. c->control_stream_size[i][j] = bytestream2_get_le32(&pb);
  572. if (c->control_stream_size[i][j] > left)
  573. return AVERROR_INVALIDDATA;
  574. left -= c->control_stream_size[i][j];
  575. control_stream += c->control_stream_size[i][j];
  576. }
  577. }
  578. } else if (c->pro) {
  579. if (bytestream2_get_bytes_left(&gb) < c->frame_info_size) {
  580. av_log(avctx, AV_LOG_ERROR, "Not enough data for frame information\n");
  581. return AVERROR_INVALIDDATA;
  582. }
  583. c->frame_info = bytestream2_get_le32u(&gb);
  584. c->slices = ((c->frame_info >> 16) & 0xff) + 1;
  585. for (i = 0; i < c->planes; i++) {
  586. plane_start[i] = gb.buffer;
  587. if (bytestream2_get_bytes_left(&gb) < 1024 + 4 * c->slices) {
  588. av_log(avctx, AV_LOG_ERROR, "Insufficient data for a plane\n");
  589. return AVERROR_INVALIDDATA;
  590. }
  591. slice_start = 0;
  592. slice_end = 0;
  593. for (j = 0; j < c->slices; j++) {
  594. slice_end = bytestream2_get_le32u(&gb);
  595. if (slice_end < 0 || slice_end < slice_start ||
  596. bytestream2_get_bytes_left(&gb) < slice_end + 1024LL) {
  597. av_log(avctx, AV_LOG_ERROR, "Incorrect slice size\n");
  598. return AVERROR_INVALIDDATA;
  599. }
  600. slice_size = slice_end - slice_start;
  601. slice_start = slice_end;
  602. max_slice_size = FFMAX(max_slice_size, slice_size);
  603. }
  604. plane_size = slice_end;
  605. bytestream2_skipu(&gb, plane_size);
  606. bytestream2_skipu(&gb, 1024);
  607. }
  608. plane_start[c->planes] = gb.buffer;
  609. } else {
  610. for (i = 0; i < c->planes; i++) {
  611. plane_start[i] = gb.buffer;
  612. if (bytestream2_get_bytes_left(&gb) < 256 + 4 * c->slices) {
  613. av_log(avctx, AV_LOG_ERROR, "Insufficient data for a plane\n");
  614. return AVERROR_INVALIDDATA;
  615. }
  616. bytestream2_skipu(&gb, 256);
  617. slice_start = 0;
  618. slice_end = 0;
  619. for (j = 0; j < c->slices; j++) {
  620. slice_end = bytestream2_get_le32u(&gb);
  621. if (slice_end < 0 || slice_end < slice_start ||
  622. bytestream2_get_bytes_left(&gb) < slice_end) {
  623. av_log(avctx, AV_LOG_ERROR, "Incorrect slice size\n");
  624. return AVERROR_INVALIDDATA;
  625. }
  626. slice_size = slice_end - slice_start;
  627. slice_start = slice_end;
  628. max_slice_size = FFMAX(max_slice_size, slice_size);
  629. }
  630. plane_size = slice_end;
  631. bytestream2_skipu(&gb, plane_size);
  632. }
  633. plane_start[c->planes] = gb.buffer;
  634. if (bytestream2_get_bytes_left(&gb) < c->frame_info_size) {
  635. av_log(avctx, AV_LOG_ERROR, "Not enough data for frame information\n");
  636. return AVERROR_INVALIDDATA;
  637. }
  638. c->frame_info = bytestream2_get_le32u(&gb);
  639. }
  640. av_log(avctx, AV_LOG_DEBUG, "frame information flags %"PRIX32"\n",
  641. c->frame_info);
  642. c->frame_pred = (c->frame_info >> 8) & 3;
  643. max_slice_size += 4*avctx->width;
  644. if (!c->pack) {
  645. av_fast_malloc(&c->slice_bits, &c->slice_bits_size,
  646. max_slice_size + AV_INPUT_BUFFER_PADDING_SIZE);
  647. if (!c->slice_bits) {
  648. av_log(avctx, AV_LOG_ERROR, "Cannot allocate temporary buffer\n");
  649. return AVERROR(ENOMEM);
  650. }
  651. }
  652. switch (c->avctx->pix_fmt) {
  653. case AV_PIX_FMT_GBRP:
  654. case AV_PIX_FMT_GBRAP:
  655. for (i = 0; i < c->planes; i++) {
  656. ret = decode_plane(c, i, frame.f->data[i],
  657. frame.f->linesize[i], avctx->width,
  658. avctx->height, plane_start[i],
  659. c->frame_pred == PRED_LEFT);
  660. if (ret)
  661. return ret;
  662. if (c->frame_pred == PRED_MEDIAN) {
  663. if (!c->interlaced) {
  664. restore_median_planar(c, frame.f->data[i],
  665. frame.f->linesize[i], avctx->width,
  666. avctx->height, c->slices, 0);
  667. } else {
  668. restore_median_planar_il(c, frame.f->data[i],
  669. frame.f->linesize[i],
  670. avctx->width, avctx->height, c->slices,
  671. 0);
  672. }
  673. } else if (c->frame_pred == PRED_GRADIENT) {
  674. if (!c->interlaced) {
  675. restore_gradient_planar(c, frame.f->data[i],
  676. frame.f->linesize[i], avctx->width,
  677. avctx->height, c->slices, 0);
  678. } else {
  679. restore_gradient_planar_il(c, frame.f->data[i],
  680. frame.f->linesize[i],
  681. avctx->width, avctx->height, c->slices,
  682. 0);
  683. }
  684. }
  685. }
  686. c->utdsp.restore_rgb_planes(frame.f->data[2], frame.f->data[0], frame.f->data[1],
  687. frame.f->linesize[2], frame.f->linesize[0], frame.f->linesize[1],
  688. avctx->width, avctx->height);
  689. break;
  690. case AV_PIX_FMT_GBRAP10:
  691. case AV_PIX_FMT_GBRP10:
  692. for (i = 0; i < c->planes; i++) {
  693. ret = decode_plane10(c, i, (uint16_t *)frame.f->data[i],
  694. frame.f->linesize[i] / 2, avctx->width,
  695. avctx->height, plane_start[i],
  696. plane_start[i + 1] - 1024,
  697. c->frame_pred == PRED_LEFT);
  698. if (ret)
  699. return ret;
  700. }
  701. c->utdsp.restore_rgb_planes10((uint16_t *)frame.f->data[2], (uint16_t *)frame.f->data[0], (uint16_t *)frame.f->data[1],
  702. frame.f->linesize[2] / 2, frame.f->linesize[0] / 2, frame.f->linesize[1] / 2,
  703. avctx->width, avctx->height);
  704. break;
  705. case AV_PIX_FMT_YUV420P:
  706. for (i = 0; i < 3; i++) {
  707. ret = decode_plane(c, i, frame.f->data[i], frame.f->linesize[i],
  708. avctx->width >> !!i, avctx->height >> !!i,
  709. plane_start[i], c->frame_pred == PRED_LEFT);
  710. if (ret)
  711. return ret;
  712. if (c->frame_pred == PRED_MEDIAN) {
  713. if (!c->interlaced) {
  714. restore_median_planar(c, frame.f->data[i], frame.f->linesize[i],
  715. avctx->width >> !!i, avctx->height >> !!i,
  716. c->slices, !i);
  717. } else {
  718. restore_median_planar_il(c, frame.f->data[i], frame.f->linesize[i],
  719. avctx->width >> !!i,
  720. avctx->height >> !!i,
  721. c->slices, !i);
  722. }
  723. } else if (c->frame_pred == PRED_GRADIENT) {
  724. if (!c->interlaced) {
  725. restore_gradient_planar(c, frame.f->data[i], frame.f->linesize[i],
  726. avctx->width >> !!i, avctx->height >> !!i,
  727. c->slices, !i);
  728. } else {
  729. restore_gradient_planar_il(c, frame.f->data[i], frame.f->linesize[i],
  730. avctx->width >> !!i,
  731. avctx->height >> !!i,
  732. c->slices, !i);
  733. }
  734. }
  735. }
  736. break;
  737. case AV_PIX_FMT_YUV422P:
  738. for (i = 0; i < 3; i++) {
  739. ret = decode_plane(c, i, frame.f->data[i], frame.f->linesize[i],
  740. avctx->width >> !!i, avctx->height,
  741. plane_start[i], c->frame_pred == PRED_LEFT);
  742. if (ret)
  743. return ret;
  744. if (c->frame_pred == PRED_MEDIAN) {
  745. if (!c->interlaced) {
  746. restore_median_planar(c, frame.f->data[i], frame.f->linesize[i],
  747. avctx->width >> !!i, avctx->height,
  748. c->slices, 0);
  749. } else {
  750. restore_median_planar_il(c, frame.f->data[i], frame.f->linesize[i],
  751. avctx->width >> !!i, avctx->height,
  752. c->slices, 0);
  753. }
  754. } else if (c->frame_pred == PRED_GRADIENT) {
  755. if (!c->interlaced) {
  756. restore_gradient_planar(c, frame.f->data[i], frame.f->linesize[i],
  757. avctx->width >> !!i, avctx->height,
  758. c->slices, 0);
  759. } else {
  760. restore_gradient_planar_il(c, frame.f->data[i], frame.f->linesize[i],
  761. avctx->width >> !!i, avctx->height,
  762. c->slices, 0);
  763. }
  764. }
  765. }
  766. break;
  767. case AV_PIX_FMT_YUV444P:
  768. for (i = 0; i < 3; i++) {
  769. ret = decode_plane(c, i, frame.f->data[i], frame.f->linesize[i],
  770. avctx->width, avctx->height,
  771. plane_start[i], c->frame_pred == PRED_LEFT);
  772. if (ret)
  773. return ret;
  774. if (c->frame_pred == PRED_MEDIAN) {
  775. if (!c->interlaced) {
  776. restore_median_planar(c, frame.f->data[i], frame.f->linesize[i],
  777. avctx->width, avctx->height,
  778. c->slices, 0);
  779. } else {
  780. restore_median_planar_il(c, frame.f->data[i], frame.f->linesize[i],
  781. avctx->width, avctx->height,
  782. c->slices, 0);
  783. }
  784. } else if (c->frame_pred == PRED_GRADIENT) {
  785. if (!c->interlaced) {
  786. restore_gradient_planar(c, frame.f->data[i], frame.f->linesize[i],
  787. avctx->width, avctx->height,
  788. c->slices, 0);
  789. } else {
  790. restore_gradient_planar_il(c, frame.f->data[i], frame.f->linesize[i],
  791. avctx->width, avctx->height,
  792. c->slices, 0);
  793. }
  794. }
  795. }
  796. break;
  797. case AV_PIX_FMT_YUV422P10:
  798. for (i = 0; i < 3; i++) {
  799. ret = decode_plane10(c, i, (uint16_t *)frame.f->data[i], frame.f->linesize[i] / 2,
  800. avctx->width >> !!i, avctx->height,
  801. plane_start[i], plane_start[i + 1] - 1024, c->frame_pred == PRED_LEFT);
  802. if (ret)
  803. return ret;
  804. }
  805. break;
  806. }
  807. frame.f->key_frame = 1;
  808. frame.f->pict_type = AV_PICTURE_TYPE_I;
  809. frame.f->interlaced_frame = !!c->interlaced;
  810. *got_frame = 1;
  811. /* always report that the buffer was completely consumed */
  812. return buf_size;
  813. }
  814. static av_cold int decode_init(AVCodecContext *avctx)
  815. {
  816. UtvideoContext * const c = avctx->priv_data;
  817. c->avctx = avctx;
  818. ff_utvideodsp_init(&c->utdsp);
  819. ff_bswapdsp_init(&c->bdsp);
  820. ff_llviddsp_init(&c->llviddsp);
  821. c->slice_bits_size = 0;
  822. switch (avctx->codec_tag) {
  823. case MKTAG('U', 'L', 'R', 'G'):
  824. c->planes = 3;
  825. avctx->pix_fmt = AV_PIX_FMT_GBRP;
  826. break;
  827. case MKTAG('U', 'L', 'R', 'A'):
  828. c->planes = 4;
  829. avctx->pix_fmt = AV_PIX_FMT_GBRAP;
  830. break;
  831. case MKTAG('U', 'L', 'Y', '0'):
  832. c->planes = 3;
  833. avctx->pix_fmt = AV_PIX_FMT_YUV420P;
  834. avctx->colorspace = AVCOL_SPC_BT470BG;
  835. break;
  836. case MKTAG('U', 'L', 'Y', '2'):
  837. c->planes = 3;
  838. avctx->pix_fmt = AV_PIX_FMT_YUV422P;
  839. avctx->colorspace = AVCOL_SPC_BT470BG;
  840. break;
  841. case MKTAG('U', 'L', 'Y', '4'):
  842. c->planes = 3;
  843. avctx->pix_fmt = AV_PIX_FMT_YUV444P;
  844. avctx->colorspace = AVCOL_SPC_BT470BG;
  845. break;
  846. case MKTAG('U', 'Q', 'Y', '2'):
  847. c->planes = 3;
  848. avctx->pix_fmt = AV_PIX_FMT_YUV422P10;
  849. break;
  850. case MKTAG('U', 'Q', 'R', 'G'):
  851. c->planes = 3;
  852. avctx->pix_fmt = AV_PIX_FMT_GBRP10;
  853. break;
  854. case MKTAG('U', 'Q', 'R', 'A'):
  855. c->planes = 4;
  856. avctx->pix_fmt = AV_PIX_FMT_GBRAP10;
  857. break;
  858. case MKTAG('U', 'L', 'H', '0'):
  859. c->planes = 3;
  860. avctx->pix_fmt = AV_PIX_FMT_YUV420P;
  861. avctx->colorspace = AVCOL_SPC_BT709;
  862. break;
  863. case MKTAG('U', 'L', 'H', '2'):
  864. c->planes = 3;
  865. avctx->pix_fmt = AV_PIX_FMT_YUV422P;
  866. avctx->colorspace = AVCOL_SPC_BT709;
  867. break;
  868. case MKTAG('U', 'L', 'H', '4'):
  869. c->planes = 3;
  870. avctx->pix_fmt = AV_PIX_FMT_YUV444P;
  871. avctx->colorspace = AVCOL_SPC_BT709;
  872. break;
  873. case MKTAG('U', 'M', 'Y', '2'):
  874. c->planes = 3;
  875. c->pack = 1;
  876. avctx->pix_fmt = AV_PIX_FMT_YUV422P;
  877. avctx->colorspace = AVCOL_SPC_BT470BG;
  878. break;
  879. case MKTAG('U', 'M', 'H', '2'):
  880. c->planes = 3;
  881. c->pack = 1;
  882. avctx->pix_fmt = AV_PIX_FMT_YUV422P;
  883. avctx->colorspace = AVCOL_SPC_BT709;
  884. break;
  885. case MKTAG('U', 'M', 'Y', '4'):
  886. c->planes = 3;
  887. c->pack = 1;
  888. avctx->pix_fmt = AV_PIX_FMT_YUV444P;
  889. avctx->colorspace = AVCOL_SPC_BT470BG;
  890. break;
  891. case MKTAG('U', 'M', 'H', '4'):
  892. c->planes = 3;
  893. c->pack = 1;
  894. avctx->pix_fmt = AV_PIX_FMT_YUV444P;
  895. avctx->colorspace = AVCOL_SPC_BT709;
  896. break;
  897. case MKTAG('U', 'M', 'R', 'G'):
  898. c->planes = 3;
  899. c->pack = 1;
  900. avctx->pix_fmt = AV_PIX_FMT_GBRP;
  901. break;
  902. case MKTAG('U', 'M', 'R', 'A'):
  903. c->planes = 4;
  904. c->pack = 1;
  905. avctx->pix_fmt = AV_PIX_FMT_GBRAP;
  906. break;
  907. default:
  908. av_log(avctx, AV_LOG_ERROR, "Unknown Ut Video FOURCC provided (%08X)\n",
  909. avctx->codec_tag);
  910. return AVERROR_INVALIDDATA;
  911. }
  912. if (c->pack && avctx->extradata_size >= 16) {
  913. av_log(avctx, AV_LOG_DEBUG, "Encoder version %d.%d.%d.%d\n",
  914. avctx->extradata[3], avctx->extradata[2],
  915. avctx->extradata[1], avctx->extradata[0]);
  916. av_log(avctx, AV_LOG_DEBUG, "Original format %"PRIX32"\n",
  917. AV_RB32(avctx->extradata + 4));
  918. c->compression = avctx->extradata[8];
  919. if (c->compression != 2)
  920. avpriv_request_sample(avctx, "Unknown compression type");
  921. c->slices = avctx->extradata[9] + 1;
  922. } else if (avctx->extradata_size >= 16) {
  923. av_log(avctx, AV_LOG_DEBUG, "Encoder version %d.%d.%d.%d\n",
  924. avctx->extradata[3], avctx->extradata[2],
  925. avctx->extradata[1], avctx->extradata[0]);
  926. av_log(avctx, AV_LOG_DEBUG, "Original format %"PRIX32"\n",
  927. AV_RB32(avctx->extradata + 4));
  928. c->frame_info_size = AV_RL32(avctx->extradata + 8);
  929. c->flags = AV_RL32(avctx->extradata + 12);
  930. if (c->frame_info_size != 4)
  931. avpriv_request_sample(avctx, "Frame info not 4 bytes");
  932. av_log(avctx, AV_LOG_DEBUG, "Encoding parameters %08"PRIX32"\n", c->flags);
  933. c->slices = (c->flags >> 24) + 1;
  934. c->compression = c->flags & 1;
  935. c->interlaced = c->flags & 0x800;
  936. } else if (avctx->extradata_size == 8) {
  937. av_log(avctx, AV_LOG_DEBUG, "Encoder version %d.%d.%d.%d\n",
  938. avctx->extradata[3], avctx->extradata[2],
  939. avctx->extradata[1], avctx->extradata[0]);
  940. av_log(avctx, AV_LOG_DEBUG, "Original format %"PRIX32"\n",
  941. AV_RB32(avctx->extradata + 4));
  942. c->interlaced = 0;
  943. c->pro = 1;
  944. c->frame_info_size = 4;
  945. } else {
  946. av_log(avctx, AV_LOG_ERROR,
  947. "Insufficient extradata size %d, should be at least 16\n",
  948. avctx->extradata_size);
  949. return AVERROR_INVALIDDATA;
  950. }
  951. return 0;
  952. }
  953. static av_cold int decode_end(AVCodecContext *avctx)
  954. {
  955. UtvideoContext * const c = avctx->priv_data;
  956. av_freep(&c->slice_bits);
  957. return 0;
  958. }
  959. AVCodec ff_utvideo_decoder = {
  960. .name = "utvideo",
  961. .long_name = NULL_IF_CONFIG_SMALL("Ut Video"),
  962. .type = AVMEDIA_TYPE_VIDEO,
  963. .id = AV_CODEC_ID_UTVIDEO,
  964. .priv_data_size = sizeof(UtvideoContext),
  965. .init = decode_init,
  966. .close = decode_end,
  967. .decode = decode_frame,
  968. .capabilities = AV_CODEC_CAP_DR1 | AV_CODEC_CAP_FRAME_THREADS,
  969. .caps_internal = FF_CODEC_CAP_INIT_THREADSAFE,
  970. };