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.

808 lines
30KB

  1. /*
  2. * huffyuv decoder
  3. *
  4. * Copyright (c) 2002-2003 Michael Niedermayer <michaelni@gmx.at>
  5. *
  6. * see http://www.pcisys.net/~melanson/codecs/huffyuv.txt for a description of
  7. * the algorithm used
  8. *
  9. * This file is part of Libav.
  10. *
  11. * Libav is free software; you can redistribute it and/or
  12. * modify it under the terms of the GNU Lesser General Public
  13. * License as published by the Free Software Foundation; either
  14. * version 2.1 of the License, or (at your option) any later version.
  15. *
  16. * Libav is distributed in the hope that it will be useful,
  17. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  18. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  19. * Lesser General Public License for more details.
  20. *
  21. * You should have received a copy of the GNU Lesser General Public
  22. * License along with Libav; if not, write to the Free Software
  23. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  24. */
  25. /**
  26. * @file
  27. * huffyuv decoder
  28. */
  29. #include "avcodec.h"
  30. #include "get_bits.h"
  31. #include "huffyuv.h"
  32. #include "huffyuvdsp.h"
  33. #include "thread.h"
  34. #define classic_shift_luma_table_size 42
  35. static const unsigned char classic_shift_luma[classic_shift_luma_table_size + FF_INPUT_BUFFER_PADDING_SIZE] = {
  36. 34, 36, 35, 69, 135, 232, 9, 16, 10, 24, 11, 23, 12, 16, 13, 10,
  37. 14, 8, 15, 8, 16, 8, 17, 20, 16, 10, 207, 206, 205, 236, 11, 8,
  38. 10, 21, 9, 23, 8, 8, 199, 70, 69, 68, 0
  39. };
  40. #define classic_shift_chroma_table_size 59
  41. static const unsigned char classic_shift_chroma[classic_shift_chroma_table_size + FF_INPUT_BUFFER_PADDING_SIZE] = {
  42. 66, 36, 37, 38, 39, 40, 41, 75, 76, 77, 110, 239, 144, 81, 82, 83,
  43. 84, 85, 118, 183, 56, 57, 88, 89, 56, 89, 154, 57, 58, 57, 26, 141,
  44. 57, 56, 58, 57, 58, 57, 184, 119, 214, 245, 116, 83, 82, 49, 80, 79,
  45. 78, 77, 44, 75, 41, 40, 39, 38, 37, 36, 34, 0
  46. };
  47. static const unsigned char classic_add_luma[256] = {
  48. 3, 9, 5, 12, 10, 35, 32, 29, 27, 50, 48, 45, 44, 41, 39, 37,
  49. 73, 70, 68, 65, 64, 61, 58, 56, 53, 50, 49, 46, 44, 41, 38, 36,
  50. 68, 65, 63, 61, 58, 55, 53, 51, 48, 46, 45, 43, 41, 39, 38, 36,
  51. 35, 33, 32, 30, 29, 27, 26, 25, 48, 47, 46, 44, 43, 41, 40, 39,
  52. 37, 36, 35, 34, 32, 31, 30, 28, 27, 26, 24, 23, 22, 20, 19, 37,
  53. 35, 34, 33, 31, 30, 29, 27, 26, 24, 23, 21, 20, 18, 17, 15, 29,
  54. 27, 26, 24, 22, 21, 19, 17, 16, 14, 26, 25, 23, 21, 19, 18, 16,
  55. 15, 27, 25, 23, 21, 19, 17, 16, 14, 26, 25, 23, 21, 18, 17, 14,
  56. 12, 17, 19, 13, 4, 9, 2, 11, 1, 7, 8, 0, 16, 3, 14, 6,
  57. 12, 10, 5, 15, 18, 11, 10, 13, 15, 16, 19, 20, 22, 24, 27, 15,
  58. 18, 20, 22, 24, 26, 14, 17, 20, 22, 24, 27, 15, 18, 20, 23, 25,
  59. 28, 16, 19, 22, 25, 28, 32, 36, 21, 25, 29, 33, 38, 42, 45, 49,
  60. 28, 31, 34, 37, 40, 42, 44, 47, 49, 50, 52, 54, 56, 57, 59, 60,
  61. 62, 64, 66, 67, 69, 35, 37, 39, 40, 42, 43, 45, 47, 48, 51, 52,
  62. 54, 55, 57, 59, 60, 62, 63, 66, 67, 69, 71, 72, 38, 40, 42, 43,
  63. 46, 47, 49, 51, 26, 28, 30, 31, 33, 34, 18, 19, 11, 13, 7, 8,
  64. };
  65. static const unsigned char classic_add_chroma[256] = {
  66. 3, 1, 2, 2, 2, 2, 3, 3, 7, 5, 7, 5, 8, 6, 11, 9,
  67. 7, 13, 11, 10, 9, 8, 7, 5, 9, 7, 6, 4, 7, 5, 8, 7,
  68. 11, 8, 13, 11, 19, 15, 22, 23, 20, 33, 32, 28, 27, 29, 51, 77,
  69. 43, 45, 76, 81, 46, 82, 75, 55, 56, 144, 58, 80, 60, 74, 147, 63,
  70. 143, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
  71. 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 27, 30, 21, 22,
  72. 17, 14, 5, 6, 100, 54, 47, 50, 51, 53, 106, 107, 108, 109, 110, 111,
  73. 112, 113, 114, 115, 4, 117, 118, 92, 94, 121, 122, 3, 124, 103, 2, 1,
  74. 0, 129, 130, 131, 120, 119, 126, 125, 136, 137, 138, 139, 140, 141, 142, 134,
  75. 135, 132, 133, 104, 64, 101, 62, 57, 102, 95, 93, 59, 61, 28, 97, 96,
  76. 52, 49, 48, 29, 32, 25, 24, 46, 23, 98, 45, 44, 43, 20, 42, 41,
  77. 19, 18, 99, 40, 15, 39, 38, 16, 13, 12, 11, 37, 10, 9, 8, 36,
  78. 7, 128, 127, 105, 123, 116, 35, 34, 33, 145, 31, 79, 42, 146, 78, 26,
  79. 83, 48, 49, 50, 44, 47, 26, 31, 30, 18, 17, 19, 21, 24, 25, 13,
  80. 14, 16, 17, 18, 20, 21, 12, 14, 15, 9, 10, 6, 9, 6, 5, 8,
  81. 6, 12, 8, 10, 7, 9, 6, 4, 6, 2, 2, 3, 3, 3, 3, 2,
  82. };
  83. static int read_len_table(uint8_t *dst, GetBitContext *gb)
  84. {
  85. int i, val, repeat;
  86. for (i = 0; i < 256;) {
  87. repeat = get_bits(gb, 3);
  88. val = get_bits(gb, 5);
  89. if (repeat == 0)
  90. repeat = get_bits(gb, 8);
  91. if (i + repeat > 256 || get_bits_left(gb) < 0) {
  92. av_log(NULL, AV_LOG_ERROR, "Error reading huffman table\n");
  93. return AVERROR_INVALIDDATA;
  94. }
  95. while (repeat--)
  96. dst[i++] = val;
  97. }
  98. return 0;
  99. }
  100. static int generate_joint_tables(HYuvContext *s)
  101. {
  102. uint16_t symbols[1 << VLC_BITS];
  103. uint16_t bits[1 << VLC_BITS];
  104. uint8_t len[1 << VLC_BITS];
  105. int ret;
  106. if (s->bitstream_bpp < 24) {
  107. int p, i, y, u;
  108. for (p = 0; p < 3; p++) {
  109. for (i = y = 0; y < 256; y++) {
  110. int len0 = s->len[0][y];
  111. int limit = VLC_BITS - len0;
  112. if (limit <= 0)
  113. continue;
  114. for (u = 0; u < 256; u++) {
  115. int len1 = s->len[p][u];
  116. if (len1 > limit)
  117. continue;
  118. len[i] = len0 + len1;
  119. bits[i] = (s->bits[0][y] << len1) + s->bits[p][u];
  120. symbols[i] = (y << 8) + u;
  121. if (symbols[i] != 0xffff) // reserved to mean "invalid"
  122. i++;
  123. }
  124. }
  125. ff_free_vlc(&s->vlc[3 + p]);
  126. if ((ret = ff_init_vlc_sparse(&s->vlc[3 + p], VLC_BITS, i, len, 1, 1,
  127. bits, 2, 2, symbols, 2, 2, 0)) < 0)
  128. return ret;
  129. }
  130. } else {
  131. uint8_t (*map)[4] = (uint8_t(*)[4]) s->pix_bgr_map;
  132. int i, b, g, r, code;
  133. int p0 = s->decorrelate;
  134. int p1 = !s->decorrelate;
  135. /* Restrict the range to +/-16 because that's pretty much guaranteed
  136. * to cover all the combinations that fit in 11 bits total, and it
  137. * does not matter if we miss a few rare codes. */
  138. for (i = 0, g = -16; g < 16; g++) {
  139. int len0 = s->len[p0][g & 255];
  140. int limit0 = VLC_BITS - len0;
  141. if (limit0 < 2)
  142. continue;
  143. for (b = -16; b < 16; b++) {
  144. int len1 = s->len[p1][b & 255];
  145. int limit1 = limit0 - len1;
  146. if (limit1 < 1)
  147. continue;
  148. code = (s->bits[p0][g & 255] << len1) + s->bits[p1][b & 255];
  149. for (r = -16; r < 16; r++) {
  150. int len2 = s->len[2][r & 255];
  151. if (len2 > limit1)
  152. continue;
  153. len[i] = len0 + len1 + len2;
  154. bits[i] = (code << len2) + s->bits[2][r & 255];
  155. if (s->decorrelate) {
  156. map[i][G] = g;
  157. map[i][B] = g + b;
  158. map[i][R] = g + r;
  159. } else {
  160. map[i][B] = g;
  161. map[i][G] = b;
  162. map[i][R] = r;
  163. }
  164. i++;
  165. }
  166. }
  167. }
  168. ff_free_vlc(&s->vlc[3]);
  169. if ((ret = init_vlc(&s->vlc[3], VLC_BITS, i, len, 1, 1,
  170. bits, 2, 2, 0)) < 0)
  171. return ret;
  172. }
  173. return 0;
  174. }
  175. static int read_huffman_tables(HYuvContext *s, const uint8_t *src, int length)
  176. {
  177. GetBitContext gb;
  178. int i, ret;
  179. if ((ret = init_get_bits(&gb, src, length * 8)) < 0)
  180. return ret;
  181. for (i = 0; i < 3; i++) {
  182. if ((ret = read_len_table(s->len[i], &gb)) < 0)
  183. return ret;
  184. if ((ret = ff_huffyuv_generate_bits_table(s->bits[i], s->len[i])) < 0)
  185. return ret;
  186. ff_free_vlc(&s->vlc[i]);
  187. if ((ret = init_vlc(&s->vlc[i], VLC_BITS, 256, s->len[i], 1, 1,
  188. s->bits[i], 4, 4, 0)) < 0)
  189. return ret;
  190. }
  191. if ((ret = generate_joint_tables(s)) < 0)
  192. return ret;
  193. return (get_bits_count(&gb) + 7) / 8;
  194. }
  195. static int read_old_huffman_tables(HYuvContext *s)
  196. {
  197. GetBitContext gb;
  198. int i, ret;
  199. if ((ret = init_get_bits(&gb, classic_shift_luma,
  200. classic_shift_luma_table_size * 8)) < 0)
  201. return ret;
  202. if ((ret = read_len_table(s->len[0], &gb)) < 0)
  203. return ret;
  204. if ((ret = init_get_bits(&gb, classic_shift_chroma,
  205. classic_shift_chroma_table_size * 8)) < 0)
  206. return ret;
  207. if ((ret = read_len_table(s->len[1], &gb)) < 0)
  208. return ret;
  209. for (i = 0; i < 256; i++)
  210. s->bits[0][i] = classic_add_luma[i];
  211. for (i = 0; i < 256; i++)
  212. s->bits[1][i] = classic_add_chroma[i];
  213. if (s->bitstream_bpp >= 24) {
  214. memcpy(s->bits[1], s->bits[0], 256 * sizeof(uint32_t));
  215. memcpy(s->len[1], s->len[0], 256 * sizeof(uint8_t));
  216. }
  217. memcpy(s->bits[2], s->bits[1], 256 * sizeof(uint32_t));
  218. memcpy(s->len[2], s->len[1], 256 * sizeof(uint8_t));
  219. for (i = 0; i < 3; i++) {
  220. ff_free_vlc(&s->vlc[i]);
  221. if ((ret = init_vlc(&s->vlc[i], VLC_BITS, 256, s->len[i], 1, 1,
  222. s->bits[i], 4, 4, 0)) < 0)
  223. return ret;
  224. }
  225. if ((ret = generate_joint_tables(s)) < 0)
  226. return ret;
  227. return 0;
  228. }
  229. static av_cold int decode_init(AVCodecContext *avctx)
  230. {
  231. HYuvContext *s = avctx->priv_data;
  232. int ret;
  233. ff_huffyuv_common_init(avctx);
  234. ff_huffyuvdsp_init(&s->hdsp);
  235. memset(s->vlc, 0, 3 * sizeof(VLC));
  236. s->interlaced = s->height > 288;
  237. s->bgr32 = 1;
  238. if (avctx->extradata_size) {
  239. if ((avctx->bits_per_coded_sample & 7) &&
  240. avctx->bits_per_coded_sample != 12)
  241. s->version = 1; // do such files exist at all?
  242. else
  243. s->version = 2;
  244. } else
  245. s->version = 0;
  246. if (s->version == 2) {
  247. int method, interlace;
  248. if (avctx->extradata_size < 4)
  249. return AVERROR_INVALIDDATA;
  250. method = avctx->extradata[0];
  251. s->decorrelate = method & 64 ? 1 : 0;
  252. s->predictor = method & 63;
  253. s->bitstream_bpp = avctx->extradata[1];
  254. if (s->bitstream_bpp == 0)
  255. s->bitstream_bpp = avctx->bits_per_coded_sample & ~7;
  256. interlace = (avctx->extradata[2] & 0x30) >> 4;
  257. s->interlaced = (interlace == 1) ? 1 : (interlace == 2) ? 0 : s->interlaced;
  258. s->context = avctx->extradata[2] & 0x40 ? 1 : 0;
  259. if ((ret = read_huffman_tables(s, avctx->extradata + 4,
  260. avctx->extradata_size - 4)) < 0)
  261. return ret;
  262. } else {
  263. switch (avctx->bits_per_coded_sample & 7) {
  264. case 1:
  265. s->predictor = LEFT;
  266. s->decorrelate = 0;
  267. break;
  268. case 2:
  269. s->predictor = LEFT;
  270. s->decorrelate = 1;
  271. break;
  272. case 3:
  273. s->predictor = PLANE;
  274. s->decorrelate = avctx->bits_per_coded_sample >= 24;
  275. break;
  276. case 4:
  277. s->predictor = MEDIAN;
  278. s->decorrelate = 0;
  279. break;
  280. default:
  281. s->predictor = LEFT; // OLD
  282. s->decorrelate = 0;
  283. break;
  284. }
  285. s->bitstream_bpp = avctx->bits_per_coded_sample & ~7;
  286. s->context = 0;
  287. if ((ret = read_old_huffman_tables(s)) < 0)
  288. return ret;
  289. }
  290. switch (s->bitstream_bpp) {
  291. case 12:
  292. avctx->pix_fmt = AV_PIX_FMT_YUV420P;
  293. break;
  294. case 16:
  295. if (s->yuy2)
  296. avctx->pix_fmt = AV_PIX_FMT_YUYV422;
  297. else
  298. avctx->pix_fmt = AV_PIX_FMT_YUV422P;
  299. break;
  300. case 24:
  301. case 32:
  302. if (s->bgr32)
  303. avctx->pix_fmt = AV_PIX_FMT_RGB32;
  304. else
  305. avctx->pix_fmt = AV_PIX_FMT_BGR24;
  306. break;
  307. default:
  308. return AVERROR_INVALIDDATA;
  309. }
  310. if ((ret = ff_huffyuv_alloc_temp(s)) < 0)
  311. return ret;
  312. return 0;
  313. }
  314. static av_cold int decode_init_thread_copy(AVCodecContext *avctx)
  315. {
  316. HYuvContext *s = avctx->priv_data;
  317. int i, ret;
  318. if ((ret = ff_huffyuv_alloc_temp(s)) < 0)
  319. return ret;
  320. for (i = 0; i < 6; i++)
  321. s->vlc[i].table = NULL;
  322. if (s->version == 2) {
  323. if ((ret = read_huffman_tables(s, avctx->extradata + 4,
  324. avctx->extradata_size)) < 0)
  325. return ret;
  326. } else {
  327. if ((ret = read_old_huffman_tables(s)) < 0)
  328. return ret;
  329. }
  330. return 0;
  331. }
  332. /* TODO instead of restarting the read when the code isn't in the first level
  333. * of the joint table, jump into the 2nd level of the individual table. */
  334. #define READ_2PIX(dst0, dst1, plane1) \
  335. { \
  336. uint16_t code = get_vlc2(&s->gb, s->vlc[3 + plane1].table, \
  337. VLC_BITS, 1); \
  338. if (code != 0xffff) { \
  339. dst0 = code >> 8; \
  340. dst1 = code; \
  341. } else { \
  342. dst0 = get_vlc2(&s->gb, s->vlc[0].table, VLC_BITS, 3); \
  343. dst1 = get_vlc2(&s->gb, s->vlc[plane1].table, VLC_BITS, 3); \
  344. } \
  345. }
  346. static void decode_422_bitstream(HYuvContext *s, int count)
  347. {
  348. int i;
  349. count /= 2;
  350. if (count >= (get_bits_left(&s->gb)) / (31 * 4)) {
  351. for (i = 0; i < count && get_bits_left(&s->gb) > 0; i++) {
  352. READ_2PIX(s->temp[0][2 * i], s->temp[1][i], 1);
  353. READ_2PIX(s->temp[0][2 * i + 1], s->temp[2][i], 2);
  354. }
  355. } else {
  356. for (i = 0; i < count; i++) {
  357. READ_2PIX(s->temp[0][2 * i], s->temp[1][i], 1);
  358. READ_2PIX(s->temp[0][2 * i + 1], s->temp[2][i], 2);
  359. }
  360. }
  361. }
  362. static void decode_gray_bitstream(HYuvContext *s, int count)
  363. {
  364. int i;
  365. count /= 2;
  366. if (count >= (get_bits_left(&s->gb)) / (31 * 2)) {
  367. for (i = 0; i < count && get_bits_left(&s->gb) > 0; i++) {
  368. READ_2PIX(s->temp[0][2 * i], s->temp[0][2 * i + 1], 0);
  369. }
  370. } else {
  371. for (i = 0; i < count; i++) {
  372. READ_2PIX(s->temp[0][2 * i], s->temp[0][2 * i + 1], 0);
  373. }
  374. }
  375. }
  376. static av_always_inline void decode_bgr_1(HYuvContext *s, int count,
  377. int decorrelate, int alpha)
  378. {
  379. int i;
  380. for (i = 0; i < count; i++) {
  381. int code = get_vlc2(&s->gb, s->vlc[3].table, VLC_BITS, 1);
  382. if (code != -1) {
  383. *(uint32_t *) &s->temp[0][4 * i] = s->pix_bgr_map[code];
  384. } else if (decorrelate) {
  385. s->temp[0][4 * i + G] = get_vlc2(&s->gb, s->vlc[1].table, VLC_BITS, 3);
  386. s->temp[0][4 * i + B] = get_vlc2(&s->gb, s->vlc[0].table, VLC_BITS, 3) +
  387. s->temp[0][4 * i + G];
  388. s->temp[0][4 * i + R] = get_vlc2(&s->gb, s->vlc[2].table, VLC_BITS, 3) +
  389. s->temp[0][4 * i + G];
  390. } else {
  391. s->temp[0][4 * i + B] = get_vlc2(&s->gb, s->vlc[0].table, VLC_BITS, 3);
  392. s->temp[0][4 * i + G] = get_vlc2(&s->gb, s->vlc[1].table, VLC_BITS, 3);
  393. s->temp[0][4 * i + R] = get_vlc2(&s->gb, s->vlc[2].table, VLC_BITS, 3);
  394. }
  395. if (alpha)
  396. s->temp[0][4 * i + A] = get_vlc2(&s->gb, s->vlc[2].table, VLC_BITS, 3);
  397. }
  398. }
  399. static void decode_bgr_bitstream(HYuvContext *s, int count)
  400. {
  401. if (s->decorrelate) {
  402. if (s->bitstream_bpp == 24)
  403. decode_bgr_1(s, count, 1, 0);
  404. else
  405. decode_bgr_1(s, count, 1, 1);
  406. } else {
  407. if (s->bitstream_bpp == 24)
  408. decode_bgr_1(s, count, 0, 0);
  409. else
  410. decode_bgr_1(s, count, 0, 1);
  411. }
  412. }
  413. static void draw_slice(HYuvContext *s, AVFrame *frame, int y)
  414. {
  415. int h, cy, i;
  416. int offset[AV_NUM_DATA_POINTERS];
  417. if (s->avctx->draw_horiz_band == NULL)
  418. return;
  419. h = y - s->last_slice_end;
  420. y -= h;
  421. if (s->bitstream_bpp == 12)
  422. cy = y >> 1;
  423. else
  424. cy = y;
  425. offset[0] = frame->linesize[0] * y;
  426. offset[1] = frame->linesize[1] * cy;
  427. offset[2] = frame->linesize[2] * cy;
  428. for (i = 3; i < AV_NUM_DATA_POINTERS; i++)
  429. offset[i] = 0;
  430. emms_c();
  431. s->avctx->draw_horiz_band(s->avctx, frame, offset, y, 3, h);
  432. s->last_slice_end = y + h;
  433. }
  434. static int decode_frame(AVCodecContext *avctx, void *data, int *got_frame,
  435. AVPacket *avpkt)
  436. {
  437. const uint8_t *buf = avpkt->data;
  438. int buf_size = avpkt->size;
  439. HYuvContext *s = avctx->priv_data;
  440. const int width = s->width;
  441. const int width2 = s->width >> 1;
  442. const int height = s->height;
  443. int fake_ystride, fake_ustride, fake_vstride;
  444. ThreadFrame frame = { .f = data };
  445. AVFrame *const p = data;
  446. int table_size = 0, ret;
  447. av_fast_malloc(&s->bitstream_buffer,
  448. &s->bitstream_buffer_size,
  449. buf_size + FF_INPUT_BUFFER_PADDING_SIZE);
  450. if (!s->bitstream_buffer)
  451. return AVERROR(ENOMEM);
  452. memset(s->bitstream_buffer + buf_size, 0, FF_INPUT_BUFFER_PADDING_SIZE);
  453. s->bdsp.bswap_buf((uint32_t *) s->bitstream_buffer,
  454. (const uint32_t *) buf, buf_size / 4);
  455. if ((ret = ff_thread_get_buffer(avctx, &frame, 0)) < 0) {
  456. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  457. return ret;
  458. }
  459. if (s->context) {
  460. table_size = read_huffman_tables(s, s->bitstream_buffer, buf_size);
  461. if (table_size < 0)
  462. return table_size;
  463. }
  464. if ((unsigned) (buf_size - table_size) >= INT_MAX / 8)
  465. return AVERROR_INVALIDDATA;
  466. if ((ret = init_get_bits(&s->gb, s->bitstream_buffer + table_size,
  467. (buf_size - table_size) * 8)) < 0)
  468. return ret;
  469. fake_ystride = s->interlaced ? p->linesize[0] * 2 : p->linesize[0];
  470. fake_ustride = s->interlaced ? p->linesize[1] * 2 : p->linesize[1];
  471. fake_vstride = s->interlaced ? p->linesize[2] * 2 : p->linesize[2];
  472. s->last_slice_end = 0;
  473. if (s->bitstream_bpp < 24) {
  474. int y, cy;
  475. int lefty, leftu, leftv;
  476. int lefttopy, lefttopu, lefttopv;
  477. if (s->yuy2) {
  478. p->data[0][3] = get_bits(&s->gb, 8);
  479. p->data[0][2] = get_bits(&s->gb, 8);
  480. p->data[0][1] = get_bits(&s->gb, 8);
  481. p->data[0][0] = get_bits(&s->gb, 8);
  482. avpriv_report_missing_feature(avctx, "YUY2 output");
  483. return AVERROR_PATCHWELCOME;
  484. } else {
  485. leftv =
  486. p->data[2][0] = get_bits(&s->gb, 8);
  487. lefty =
  488. p->data[0][1] = get_bits(&s->gb, 8);
  489. leftu =
  490. p->data[1][0] = get_bits(&s->gb, 8);
  491. p->data[0][0] = get_bits(&s->gb, 8);
  492. switch (s->predictor) {
  493. case LEFT:
  494. case PLANE:
  495. decode_422_bitstream(s, width - 2);
  496. lefty = s->hdsp.add_hfyu_left_pred(p->data[0] + 2, s->temp[0],
  497. width - 2, lefty);
  498. if (!(s->flags & CODEC_FLAG_GRAY)) {
  499. leftu = s->hdsp.add_hfyu_left_pred(p->data[1] + 1, s->temp[1], width2 - 1, leftu);
  500. leftv = s->hdsp.add_hfyu_left_pred(p->data[2] + 1, s->temp[2], width2 - 1, leftv);
  501. }
  502. for (cy = y = 1; y < s->height; y++, cy++) {
  503. uint8_t *ydst, *udst, *vdst;
  504. if (s->bitstream_bpp == 12) {
  505. decode_gray_bitstream(s, width);
  506. ydst = p->data[0] + p->linesize[0] * y;
  507. lefty = s->hdsp.add_hfyu_left_pred(ydst, s->temp[0],
  508. width, lefty);
  509. if (s->predictor == PLANE) {
  510. if (y > s->interlaced)
  511. s->hdsp.add_bytes(ydst, ydst - fake_ystride, width);
  512. }
  513. y++;
  514. if (y >= s->height)
  515. break;
  516. }
  517. draw_slice(s, p, y);
  518. ydst = p->data[0] + p->linesize[0] * y;
  519. udst = p->data[1] + p->linesize[1] * cy;
  520. vdst = p->data[2] + p->linesize[2] * cy;
  521. decode_422_bitstream(s, width);
  522. lefty = s->hdsp.add_hfyu_left_pred(ydst, s->temp[0],
  523. width, lefty);
  524. if (!(s->flags & CODEC_FLAG_GRAY)) {
  525. leftu = s->hdsp.add_hfyu_left_pred(udst, s->temp[1], width2, leftu);
  526. leftv = s->hdsp.add_hfyu_left_pred(vdst, s->temp[2], width2, leftv);
  527. }
  528. if (s->predictor == PLANE) {
  529. if (cy > s->interlaced) {
  530. s->hdsp.add_bytes(ydst, ydst - fake_ystride, width);
  531. if (!(s->flags & CODEC_FLAG_GRAY)) {
  532. s->hdsp.add_bytes(udst, udst - fake_ustride, width2);
  533. s->hdsp.add_bytes(vdst, vdst - fake_vstride, width2);
  534. }
  535. }
  536. }
  537. }
  538. draw_slice(s, p, height);
  539. break;
  540. case MEDIAN:
  541. /* first line except first 2 pixels is left predicted */
  542. decode_422_bitstream(s, width - 2);
  543. lefty = s->hdsp.add_hfyu_left_pred(p->data[0] + 2, s->temp[0],
  544. width - 2, lefty);
  545. if (!(s->flags & CODEC_FLAG_GRAY)) {
  546. leftu = s->hdsp.add_hfyu_left_pred(p->data[1] + 1, s->temp[1], width2 - 1, leftu);
  547. leftv = s->hdsp.add_hfyu_left_pred(p->data[2] + 1, s->temp[2], width2 - 1, leftv);
  548. }
  549. cy = y = 1;
  550. /* second line is left predicted for interlaced case */
  551. if (s->interlaced) {
  552. decode_422_bitstream(s, width);
  553. lefty = s->hdsp.add_hfyu_left_pred(p->data[0] + p->linesize[0],
  554. s->temp[0], width, lefty);
  555. if (!(s->flags & CODEC_FLAG_GRAY)) {
  556. leftu = s->hdsp.add_hfyu_left_pred(p->data[1] + p->linesize[2], s->temp[1], width2, leftu);
  557. leftv = s->hdsp.add_hfyu_left_pred(p->data[2] + p->linesize[1], s->temp[2], width2, leftv);
  558. }
  559. y++;
  560. cy++;
  561. }
  562. /* next 4 pixels are left predicted too */
  563. decode_422_bitstream(s, 4);
  564. lefty = s->hdsp.add_hfyu_left_pred(p->data[0] + fake_ystride,
  565. s->temp[0], 4, lefty);
  566. if (!(s->flags & CODEC_FLAG_GRAY)) {
  567. leftu = s->hdsp.add_hfyu_left_pred(p->data[1] + fake_ustride, s->temp[1], 2, leftu);
  568. leftv = s->hdsp.add_hfyu_left_pred(p->data[2] + fake_vstride, s->temp[2], 2, leftv);
  569. }
  570. /* next line except the first 4 pixels is median predicted */
  571. lefttopy = p->data[0][3];
  572. decode_422_bitstream(s, width - 4);
  573. s->hdsp.add_hfyu_median_pred(p->data[0] + fake_ystride + 4,
  574. p->data[0] + 4, s->temp[0],
  575. width - 4, &lefty, &lefttopy);
  576. if (!(s->flags & CODEC_FLAG_GRAY)) {
  577. lefttopu = p->data[1][1];
  578. lefttopv = p->data[2][1];
  579. s->hdsp.add_hfyu_median_pred(p->data[1] + fake_ustride + 2, p->data[1] + 2, s->temp[1], width2 - 2, &leftu, &lefttopu);
  580. s->hdsp.add_hfyu_median_pred(p->data[2] + fake_vstride + 2, p->data[2] + 2, s->temp[2], width2 - 2, &leftv, &lefttopv);
  581. }
  582. y++;
  583. cy++;
  584. for (; y < height; y++, cy++) {
  585. uint8_t *ydst, *udst, *vdst;
  586. if (s->bitstream_bpp == 12) {
  587. while (2 * cy > y) {
  588. decode_gray_bitstream(s, width);
  589. ydst = p->data[0] + p->linesize[0] * y;
  590. s->hdsp.add_hfyu_median_pred(ydst, ydst - fake_ystride,
  591. s->temp[0], width,
  592. &lefty, &lefttopy);
  593. y++;
  594. }
  595. if (y >= height)
  596. break;
  597. }
  598. draw_slice(s, p, y);
  599. decode_422_bitstream(s, width);
  600. ydst = p->data[0] + p->linesize[0] * y;
  601. udst = p->data[1] + p->linesize[1] * cy;
  602. vdst = p->data[2] + p->linesize[2] * cy;
  603. s->hdsp.add_hfyu_median_pred(ydst, ydst - fake_ystride,
  604. s->temp[0], width,
  605. &lefty, &lefttopy);
  606. if (!(s->flags & CODEC_FLAG_GRAY)) {
  607. s->hdsp.add_hfyu_median_pred(udst, udst - fake_ustride, s->temp[1], width2, &leftu, &lefttopu);
  608. s->hdsp.add_hfyu_median_pred(vdst, vdst - fake_vstride, s->temp[2], width2, &leftv, &lefttopv);
  609. }
  610. }
  611. draw_slice(s, p, height);
  612. break;
  613. }
  614. }
  615. } else {
  616. int y;
  617. int leftr, leftg, leftb, lefta;
  618. const int last_line = (height - 1) * p->linesize[0];
  619. if (s->bitstream_bpp == 32) {
  620. lefta = p->data[0][last_line + A] = get_bits(&s->gb, 8);
  621. leftr = p->data[0][last_line + R] = get_bits(&s->gb, 8);
  622. leftg = p->data[0][last_line + G] = get_bits(&s->gb, 8);
  623. leftb = p->data[0][last_line + B] = get_bits(&s->gb, 8);
  624. } else {
  625. leftr = p->data[0][last_line + R] = get_bits(&s->gb, 8);
  626. leftg = p->data[0][last_line + G] = get_bits(&s->gb, 8);
  627. leftb = p->data[0][last_line + B] = get_bits(&s->gb, 8);
  628. lefta = p->data[0][last_line + A] = 255;
  629. skip_bits(&s->gb, 8);
  630. }
  631. if (s->bgr32) {
  632. switch (s->predictor) {
  633. case LEFT:
  634. case PLANE:
  635. decode_bgr_bitstream(s, width - 1);
  636. s->hdsp.add_hfyu_left_pred_bgr32(p->data[0] + last_line + 4,
  637. s->temp[0], width - 1, &leftr,
  638. &leftg, &leftb, &lefta);
  639. for (y = s->height - 2; y >= 0; y--) { // Yes it is stored upside down.
  640. decode_bgr_bitstream(s, width);
  641. s->hdsp.add_hfyu_left_pred_bgr32(p->data[0] + p->linesize[0] * y,
  642. s->temp[0], width, &leftr,
  643. &leftg, &leftb, &lefta);
  644. if (s->predictor == PLANE) {
  645. if (s->bitstream_bpp != 32)
  646. lefta = 0;
  647. if ((y & s->interlaced) == 0 &&
  648. y < s->height - 1 - s->interlaced) {
  649. s->hdsp.add_bytes(p->data[0] + p->linesize[0] * y,
  650. p->data[0] + p->linesize[0] * y +
  651. fake_ystride, fake_ystride);
  652. }
  653. }
  654. }
  655. // just 1 large slice as this is not possible in reverse order
  656. draw_slice(s, p, height);
  657. break;
  658. default:
  659. av_log(avctx, AV_LOG_ERROR,
  660. "prediction type not supported!\n");
  661. }
  662. } else {
  663. avpriv_report_missing_feature(avctx, "BGR24 output");
  664. return AVERROR_PATCHWELCOME;
  665. }
  666. }
  667. emms_c();
  668. *got_frame = 1;
  669. return (get_bits_count(&s->gb) + 31) / 32 * 4 + table_size;
  670. }
  671. static av_cold int decode_end(AVCodecContext *avctx)
  672. {
  673. HYuvContext *s = avctx->priv_data;
  674. int i;
  675. ff_huffyuv_common_end(s);
  676. av_freep(&s->bitstream_buffer);
  677. for (i = 0; i < 6; i++)
  678. ff_free_vlc(&s->vlc[i]);
  679. return 0;
  680. }
  681. AVCodec ff_huffyuv_decoder = {
  682. .name = "huffyuv",
  683. .long_name = NULL_IF_CONFIG_SMALL("Huffyuv / HuffYUV"),
  684. .type = AVMEDIA_TYPE_VIDEO,
  685. .id = AV_CODEC_ID_HUFFYUV,
  686. .priv_data_size = sizeof(HYuvContext),
  687. .init = decode_init,
  688. .close = decode_end,
  689. .decode = decode_frame,
  690. .capabilities = CODEC_CAP_DR1 | CODEC_CAP_DRAW_HORIZ_BAND |
  691. CODEC_CAP_FRAME_THREADS,
  692. .init_thread_copy = ONLY_IF_THREADS_ENABLED(decode_init_thread_copy),
  693. };
  694. #if CONFIG_FFVHUFF_DECODER
  695. AVCodec ff_ffvhuff_decoder = {
  696. .name = "ffvhuff",
  697. .long_name = NULL_IF_CONFIG_SMALL("Huffyuv FFmpeg variant"),
  698. .type = AVMEDIA_TYPE_VIDEO,
  699. .id = AV_CODEC_ID_FFVHUFF,
  700. .priv_data_size = sizeof(HYuvContext),
  701. .init = decode_init,
  702. .close = decode_end,
  703. .decode = decode_frame,
  704. .capabilities = CODEC_CAP_DR1 | CODEC_CAP_DRAW_HORIZ_BAND |
  705. CODEC_CAP_FRAME_THREADS,
  706. .init_thread_copy = ONLY_IF_THREADS_ENABLED(decode_init_thread_copy),
  707. };
  708. #endif /* CONFIG_FFVHUFF_DECODER */