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.

791 lines
29KB

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