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.

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