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.

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