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.

782 lines
28KB

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