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.

590 lines
19KB

  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 <stdlib.h>
  26. #include "libavutil/intreadwrite.h"
  27. #include "avcodec.h"
  28. #include "bytestream.h"
  29. #include "get_bits.h"
  30. #include "dsputil.h"
  31. #include "thread.h"
  32. enum {
  33. PRED_NONE = 0,
  34. PRED_LEFT,
  35. PRED_GRADIENT,
  36. PRED_MEDIAN,
  37. };
  38. typedef struct UtvideoContext {
  39. AVCodecContext *avctx;
  40. AVFrame pic;
  41. DSPContext dsp;
  42. uint32_t frame_info_size, flags, frame_info;
  43. int planes;
  44. int slices;
  45. int compression;
  46. int interlaced;
  47. int frame_pred;
  48. uint8_t *slice_bits;
  49. int slice_bits_size;
  50. } UtvideoContext;
  51. typedef struct HuffEntry {
  52. uint8_t sym;
  53. uint8_t len;
  54. } HuffEntry;
  55. static int huff_cmp(const void *a, const void *b)
  56. {
  57. const HuffEntry *aa = a, *bb = b;
  58. return (aa->len - bb->len)*256 + aa->sym - bb->sym;
  59. }
  60. static int build_huff(const uint8_t *src, VLC *vlc, int *fsym)
  61. {
  62. int i;
  63. HuffEntry he[256];
  64. int last;
  65. uint32_t codes[256];
  66. uint8_t bits[256];
  67. uint8_t syms[256];
  68. uint32_t code;
  69. *fsym = -1;
  70. for (i = 0; i < 256; i++) {
  71. he[i].sym = i;
  72. he[i].len = *src++;
  73. }
  74. qsort(he, 256, sizeof(*he), huff_cmp);
  75. if (!he[0].len) {
  76. *fsym = he[0].sym;
  77. return 0;
  78. }
  79. if (he[0].len > 32)
  80. return -1;
  81. last = 255;
  82. while (he[last].len == 255 && last)
  83. last--;
  84. code = 1;
  85. for (i = last; i >= 0; i--) {
  86. codes[i] = code >> (32 - he[i].len);
  87. bits[i] = he[i].len;
  88. syms[i] = he[i].sym;
  89. code += 0x80000000u >> (he[i].len - 1);
  90. }
  91. return ff_init_vlc_sparse(vlc, FFMIN(he[last].len, 9), last + 1,
  92. bits, sizeof(*bits), sizeof(*bits),
  93. codes, sizeof(*codes), sizeof(*codes),
  94. syms, sizeof(*syms), sizeof(*syms), 0);
  95. }
  96. static int decode_plane(UtvideoContext *c, int plane_no,
  97. uint8_t *dst, int step, int stride,
  98. int width, int height,
  99. const uint8_t *src, int use_pred)
  100. {
  101. int i, j, slice, pix;
  102. int sstart, send;
  103. VLC vlc;
  104. GetBitContext gb;
  105. int prev, fsym;
  106. const int cmask = ~(!plane_no && c->avctx->pix_fmt == PIX_FMT_YUV420P);
  107. if (build_huff(src, &vlc, &fsym)) {
  108. av_log(c->avctx, AV_LOG_ERROR, "Cannot build Huffman codes\n");
  109. return AVERROR_INVALIDDATA;
  110. }
  111. if (fsym >= 0) { // build_huff reported a symbol to fill slices with
  112. send = 0;
  113. for (slice = 0; slice < c->slices; slice++) {
  114. uint8_t *dest;
  115. sstart = send;
  116. send = (height * (slice + 1) / c->slices) & cmask;
  117. dest = dst + sstart * stride;
  118. prev = 0x80;
  119. for (j = sstart; j < send; j++) {
  120. for (i = 0; i < width * step; i += step) {
  121. pix = fsym;
  122. if (use_pred) {
  123. prev += pix;
  124. pix = prev;
  125. }
  126. dest[i] = pix;
  127. }
  128. dest += stride;
  129. }
  130. }
  131. return 0;
  132. }
  133. src += 256;
  134. send = 0;
  135. for (slice = 0; slice < c->slices; slice++) {
  136. uint8_t *dest;
  137. int slice_data_start, slice_data_end, slice_size;
  138. sstart = send;
  139. send = (height * (slice + 1) / c->slices) & cmask;
  140. dest = dst + sstart * stride;
  141. // slice offset and size validation was done earlier
  142. slice_data_start = slice ? AV_RL32(src + slice * 4 - 4) : 0;
  143. slice_data_end = AV_RL32(src + slice * 4);
  144. slice_size = slice_data_end - slice_data_start;
  145. if (!slice_size) {
  146. for (j = sstart; j < send; j++) {
  147. for (i = 0; i < width * step; i += step)
  148. dest[i] = 0x80;
  149. dest += stride;
  150. }
  151. continue;
  152. }
  153. memcpy(c->slice_bits, src + slice_data_start + c->slices * 4,
  154. slice_size);
  155. memset(c->slice_bits + slice_size, 0, FF_INPUT_BUFFER_PADDING_SIZE);
  156. c->dsp.bswap_buf((uint32_t *) c->slice_bits, (uint32_t *) c->slice_bits,
  157. (slice_data_end - slice_data_start + 3) >> 2);
  158. init_get_bits(&gb, c->slice_bits, slice_size * 8);
  159. prev = 0x80;
  160. for (j = sstart; j < send; j++) {
  161. for (i = 0; i < width * step; i += step) {
  162. if (get_bits_left(&gb) <= 0) {
  163. av_log(c->avctx, AV_LOG_ERROR,
  164. "Slice decoding ran out of bits\n");
  165. goto fail;
  166. }
  167. pix = get_vlc2(&gb, vlc.table, vlc.bits, 4);
  168. if (pix < 0) {
  169. av_log(c->avctx, AV_LOG_ERROR, "Decoding error\n");
  170. goto fail;
  171. }
  172. if (use_pred) {
  173. prev += pix;
  174. pix = prev;
  175. }
  176. dest[i] = pix;
  177. }
  178. dest += stride;
  179. }
  180. if (get_bits_left(&gb) > 32)
  181. av_log(c->avctx, AV_LOG_WARNING,
  182. "%d bits left after decoding slice\n", get_bits_left(&gb));
  183. }
  184. ff_free_vlc(&vlc);
  185. return 0;
  186. fail:
  187. ff_free_vlc(&vlc);
  188. return AVERROR_INVALIDDATA;
  189. }
  190. static const int rgb_order[4] = { 1, 2, 0, 3 };
  191. static void restore_rgb_planes(uint8_t *src, int step, int stride, int width,
  192. int height)
  193. {
  194. int i, j;
  195. uint8_t r, g, b;
  196. for (j = 0; j < height; j++) {
  197. for (i = 0; i < width * step; i += step) {
  198. r = src[i];
  199. g = src[i + 1];
  200. b = src[i + 2];
  201. src[i] = r + g - 0x80;
  202. src[i + 2] = b + g - 0x80;
  203. }
  204. src += stride;
  205. }
  206. }
  207. static void restore_median(uint8_t *src, int step, int stride,
  208. int width, int height, int slices, int rmode)
  209. {
  210. int i, j, slice;
  211. int A, B, C;
  212. uint8_t *bsrc;
  213. int slice_start, slice_height;
  214. const int cmask = ~rmode;
  215. for (slice = 0; slice < slices; slice++) {
  216. slice_start = ((slice * height) / slices) & cmask;
  217. slice_height = ((((slice + 1) * height) / slices) & cmask) -
  218. slice_start;
  219. bsrc = src + slice_start * stride;
  220. // first line - left neighbour prediction
  221. bsrc[0] += 0x80;
  222. A = bsrc[0];
  223. for (i = step; i < width * step; i += step) {
  224. bsrc[i] += A;
  225. A = bsrc[i];
  226. }
  227. bsrc += stride;
  228. if (slice_height == 1)
  229. continue;
  230. // second line - first element has top prediction, the rest uses median
  231. C = bsrc[-stride];
  232. bsrc[0] += C;
  233. A = bsrc[0];
  234. for (i = step; i < width * step; i += step) {
  235. B = bsrc[i - stride];
  236. bsrc[i] += mid_pred(A, B, (uint8_t)(A + B - C));
  237. C = B;
  238. A = bsrc[i];
  239. }
  240. bsrc += stride;
  241. // the rest of lines use continuous median prediction
  242. for (j = 2; j < slice_height; j++) {
  243. for (i = 0; i < width * step; i += step) {
  244. B = bsrc[i - stride];
  245. bsrc[i] += mid_pred(A, B, (uint8_t)(A + B - C));
  246. C = B;
  247. A = bsrc[i];
  248. }
  249. bsrc += stride;
  250. }
  251. }
  252. }
  253. /* UtVideo interlaced mode treats every two lines as a single one,
  254. * so restoring function should take care of possible padding between
  255. * two parts of the same "line".
  256. */
  257. static void restore_median_il(uint8_t *src, int step, int stride,
  258. int width, int height, int slices, int rmode)
  259. {
  260. int i, j, slice;
  261. int A, B, C;
  262. uint8_t *bsrc;
  263. int slice_start, slice_height;
  264. const int cmask = ~(rmode ? 3 : 1);
  265. const int stride2 = stride << 1;
  266. for (slice = 0; slice < slices; slice++) {
  267. slice_start = ((slice * height) / slices) & cmask;
  268. slice_height = ((((slice + 1) * height) / slices) & cmask) -
  269. slice_start;
  270. slice_height >>= 1;
  271. bsrc = src + slice_start * stride;
  272. // first line - left neighbour prediction
  273. bsrc[0] += 0x80;
  274. A = bsrc[0];
  275. for (i = step; i < width * step; i += step) {
  276. bsrc[i] += A;
  277. A = bsrc[i];
  278. }
  279. for (i = 0; i < width * step; i += step) {
  280. bsrc[stride + i] += A;
  281. A = bsrc[stride + i];
  282. }
  283. bsrc += stride2;
  284. if (slice_height == 1)
  285. continue;
  286. // second line - first element has top prediction, the rest uses median
  287. C = bsrc[-stride2];
  288. bsrc[0] += C;
  289. A = bsrc[0];
  290. for (i = step; i < width * step; i += step) {
  291. B = bsrc[i - stride2];
  292. bsrc[i] += mid_pred(A, B, (uint8_t)(A + B - C));
  293. C = B;
  294. A = bsrc[i];
  295. }
  296. for (i = 0; i < width * step; i += step) {
  297. B = bsrc[i - stride];
  298. bsrc[stride + i] += mid_pred(A, B, (uint8_t)(A + B - C));
  299. C = B;
  300. A = bsrc[stride + i];
  301. }
  302. bsrc += stride2;
  303. // the rest of lines use continuous median prediction
  304. for (j = 2; j < slice_height; j++) {
  305. for (i = 0; i < width * step; i += step) {
  306. B = bsrc[i - stride2];
  307. bsrc[i] += mid_pred(A, B, (uint8_t)(A + B - C));
  308. C = B;
  309. A = bsrc[i];
  310. }
  311. for (i = 0; i < width * step; i += step) {
  312. B = bsrc[i - stride];
  313. bsrc[i + stride] += mid_pred(A, B, (uint8_t)(A + B - C));
  314. C = B;
  315. A = bsrc[i + stride];
  316. }
  317. bsrc += stride2;
  318. }
  319. }
  320. }
  321. static int decode_frame(AVCodecContext *avctx, void *data, int *data_size,
  322. AVPacket *avpkt)
  323. {
  324. const uint8_t *buf = avpkt->data;
  325. int buf_size = avpkt->size;
  326. UtvideoContext *c = avctx->priv_data;
  327. int i, j;
  328. const uint8_t *plane_start[5];
  329. int plane_size, max_slice_size = 0, slice_start, slice_end, slice_size;
  330. int ret;
  331. GetByteContext gb;
  332. if (c->pic.data[0])
  333. ff_thread_release_buffer(avctx, &c->pic);
  334. c->pic.reference = 3;
  335. c->pic.buffer_hints = FF_BUFFER_HINTS_VALID;
  336. if ((ret = ff_thread_get_buffer(avctx, &c->pic)) < 0) {
  337. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  338. return ret;
  339. }
  340. /* parse plane structure to get frame flags and validate slice offsets */
  341. bytestream2_init(&gb, buf, buf_size);
  342. for (i = 0; i < c->planes; i++) {
  343. plane_start[i] = gb.buffer;
  344. if (bytestream2_get_bytes_left(&gb) < 256 + 4 * c->slices) {
  345. av_log(avctx, AV_LOG_ERROR, "Insufficient data for a plane\n");
  346. return AVERROR_INVALIDDATA;
  347. }
  348. bytestream2_skipu(&gb, 256);
  349. slice_start = 0;
  350. slice_end = 0;
  351. for (j = 0; j < c->slices; j++) {
  352. slice_end = bytestream2_get_le32u(&gb);
  353. slice_size = slice_end - slice_start;
  354. if (slice_end <= 0 || slice_size <= 0 ||
  355. bytestream2_get_bytes_left(&gb) < slice_end) {
  356. av_log(avctx, AV_LOG_ERROR, "Incorrect slice size\n");
  357. return AVERROR_INVALIDDATA;
  358. }
  359. slice_start = slice_end;
  360. max_slice_size = FFMAX(max_slice_size, slice_size);
  361. }
  362. plane_size = slice_end;
  363. bytestream2_skipu(&gb, plane_size);
  364. }
  365. plane_start[c->planes] = gb.buffer;
  366. if (bytestream2_get_bytes_left(&gb) < c->frame_info_size) {
  367. av_log(avctx, AV_LOG_ERROR, "Not enough data for frame information\n");
  368. return AVERROR_INVALIDDATA;
  369. }
  370. c->frame_info = bytestream2_get_le32u(&gb);
  371. av_log(avctx, AV_LOG_DEBUG, "frame information flags %X\n", c->frame_info);
  372. c->frame_pred = (c->frame_info >> 8) & 3;
  373. if (c->frame_pred == PRED_GRADIENT) {
  374. av_log_ask_for_sample(avctx, "Frame uses gradient prediction\n");
  375. return AVERROR_PATCHWELCOME;
  376. }
  377. av_fast_malloc(&c->slice_bits, &c->slice_bits_size,
  378. max_slice_size + FF_INPUT_BUFFER_PADDING_SIZE);
  379. if (!c->slice_bits) {
  380. av_log(avctx, AV_LOG_ERROR, "Cannot allocate temporary buffer\n");
  381. return AVERROR(ENOMEM);
  382. }
  383. switch (c->avctx->pix_fmt) {
  384. case PIX_FMT_RGB24:
  385. case PIX_FMT_RGBA:
  386. for (i = 0; i < c->planes; i++) {
  387. ret = decode_plane(c, i, c->pic.data[0] + rgb_order[i], c->planes,
  388. c->pic.linesize[0], avctx->width, avctx->height,
  389. plane_start[i], c->frame_pred == PRED_LEFT);
  390. if (ret)
  391. return ret;
  392. if (c->frame_pred == PRED_MEDIAN) {
  393. if (!c->interlaced) {
  394. restore_median(c->pic.data[0] + rgb_order[i], c->planes,
  395. c->pic.linesize[0], avctx->width,
  396. avctx->height, c->slices, 0);
  397. } else {
  398. restore_median_il(c->pic.data[0] + rgb_order[i], c->planes,
  399. c->pic.linesize[0], avctx->width,
  400. avctx->height, c->slices, 0);
  401. }
  402. }
  403. }
  404. restore_rgb_planes(c->pic.data[0], c->planes, c->pic.linesize[0],
  405. avctx->width, avctx->height);
  406. break;
  407. case PIX_FMT_YUV420P:
  408. for (i = 0; i < 3; i++) {
  409. ret = decode_plane(c, i, c->pic.data[i], 1, c->pic.linesize[i],
  410. avctx->width >> !!i, avctx->height >> !!i,
  411. plane_start[i], c->frame_pred == PRED_LEFT);
  412. if (ret)
  413. return ret;
  414. if (c->frame_pred == PRED_MEDIAN) {
  415. if (!c->interlaced) {
  416. restore_median(c->pic.data[i], 1, c->pic.linesize[i],
  417. avctx->width >> !!i, avctx->height >> !!i,
  418. c->slices, !i);
  419. } else {
  420. restore_median_il(c->pic.data[i], 1, c->pic.linesize[i],
  421. avctx->width >> !!i,
  422. avctx->height >> !!i,
  423. c->slices, !i);
  424. }
  425. }
  426. }
  427. break;
  428. case PIX_FMT_YUV422P:
  429. for (i = 0; i < 3; i++) {
  430. ret = decode_plane(c, i, c->pic.data[i], 1, c->pic.linesize[i],
  431. avctx->width >> !!i, avctx->height,
  432. plane_start[i], c->frame_pred == PRED_LEFT);
  433. if (ret)
  434. return ret;
  435. if (c->frame_pred == PRED_MEDIAN) {
  436. if (!c->interlaced) {
  437. restore_median(c->pic.data[i], 1, c->pic.linesize[i],
  438. avctx->width >> !!i, avctx->height,
  439. c->slices, 0);
  440. } else {
  441. restore_median_il(c->pic.data[i], 1, c->pic.linesize[i],
  442. avctx->width >> !!i, avctx->height,
  443. c->slices, 0);
  444. }
  445. }
  446. }
  447. break;
  448. }
  449. c->pic.key_frame = 1;
  450. c->pic.pict_type = AV_PICTURE_TYPE_I;
  451. c->pic.interlaced_frame = !!c->interlaced;
  452. *data_size = sizeof(AVFrame);
  453. *(AVFrame*)data = c->pic;
  454. /* always report that the buffer was completely consumed */
  455. return buf_size;
  456. }
  457. static av_cold int decode_init(AVCodecContext *avctx)
  458. {
  459. UtvideoContext * const c = avctx->priv_data;
  460. c->avctx = avctx;
  461. ff_dsputil_init(&c->dsp, avctx);
  462. if (avctx->extradata_size < 16) {
  463. av_log(avctx, AV_LOG_ERROR,
  464. "Insufficient extradata size %d, should be at least 16\n",
  465. avctx->extradata_size);
  466. return AVERROR_INVALIDDATA;
  467. }
  468. av_log(avctx, AV_LOG_DEBUG, "Encoder version %d.%d.%d.%d\n",
  469. avctx->extradata[3], avctx->extradata[2],
  470. avctx->extradata[1], avctx->extradata[0]);
  471. av_log(avctx, AV_LOG_DEBUG, "Original format %X\n",
  472. AV_RB32(avctx->extradata + 4));
  473. c->frame_info_size = AV_RL32(avctx->extradata + 8);
  474. c->flags = AV_RL32(avctx->extradata + 12);
  475. if (c->frame_info_size != 4)
  476. av_log_ask_for_sample(avctx, "Frame info is not 4 bytes\n");
  477. av_log(avctx, AV_LOG_DEBUG, "Encoding parameters %08X\n", c->flags);
  478. c->slices = (c->flags >> 24) + 1;
  479. c->compression = c->flags & 1;
  480. c->interlaced = c->flags & 0x800;
  481. c->slice_bits_size = 0;
  482. switch (avctx->codec_tag) {
  483. case MKTAG('U', 'L', 'R', 'G'):
  484. c->planes = 3;
  485. avctx->pix_fmt = PIX_FMT_RGB24;
  486. break;
  487. case MKTAG('U', 'L', 'R', 'A'):
  488. c->planes = 4;
  489. avctx->pix_fmt = PIX_FMT_RGBA;
  490. break;
  491. case MKTAG('U', 'L', 'Y', '0'):
  492. c->planes = 3;
  493. avctx->pix_fmt = PIX_FMT_YUV420P;
  494. break;
  495. case MKTAG('U', 'L', 'Y', '2'):
  496. c->planes = 3;
  497. avctx->pix_fmt = PIX_FMT_YUV422P;
  498. break;
  499. default:
  500. av_log(avctx, AV_LOG_ERROR, "Unknown Ut Video FOURCC provided (%08X)\n",
  501. avctx->codec_tag);
  502. return AVERROR_INVALIDDATA;
  503. }
  504. return 0;
  505. }
  506. static av_cold int decode_end(AVCodecContext *avctx)
  507. {
  508. UtvideoContext * const c = avctx->priv_data;
  509. if (c->pic.data[0])
  510. ff_thread_release_buffer(avctx, &c->pic);
  511. av_freep(&c->slice_bits);
  512. return 0;
  513. }
  514. AVCodec ff_utvideo_decoder = {
  515. .name = "utvideo",
  516. .type = AVMEDIA_TYPE_VIDEO,
  517. .id = AV_CODEC_ID_UTVIDEO,
  518. .priv_data_size = sizeof(UtvideoContext),
  519. .init = decode_init,
  520. .close = decode_end,
  521. .decode = decode_frame,
  522. .capabilities = CODEC_CAP_DR1 | CODEC_CAP_FRAME_THREADS,
  523. .long_name = NULL_IF_CONFIG_SMALL("Ut Video"),
  524. };