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.

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