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.

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