falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
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.
38308 Commits
32 Branches
320MB
Tree: ce1e8045e0
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'ce1e8045e0'
${ noResults }
FFmpeg/libavcodec/huffyuvdec.c

771 lines
27KB
Raw Blame History 

  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. /**

  27.  * @file

  28.  * huffyuv decoder

  29.  */

  30. 

  31. #include "avcodec.h"

  32. #include "get_bits.h"

  33. #include "huffyuv.h"

  34. #include "thread.h"

  35. 

  36. #define classic_shift_luma_table_size 42

  37. static const unsigned char classic_shift_luma[classic_shift_luma_table_size + FF_INPUT_BUFFER_PADDING_SIZE] = {

  38.   34,36,35,69,135,232,9,16,10,24,11,23,12,16,13,10,14,8,15,8,

  39.   16,8,17,20,16,10,207,206,205,236,11,8,10,21,9,23,8,8,199,70,

  40.   69,68, 0

  41. };

  42. 

  43. #define classic_shift_chroma_table_size 59

  44. static const unsigned char classic_shift_chroma[classic_shift_chroma_table_size + FF_INPUT_BUFFER_PADDING_SIZE] = {

  45.   66,36,37,38,39,40,41,75,76,77,110,239,144,81,82,83,84,85,118,183,

  46.   56,57,88,89,56,89,154,57,58,57,26,141,57,56,58,57,58,57,184,119,

  47.   214,245,116,83,82,49,80,79,78,77,44,75,41,40,39,38,37,36,34, 0

  48. };

  49. 

  50. static const unsigned char classic_add_luma[256] = {

  51.     3,  9,  5, 12, 10, 35, 32, 29, 27, 50, 48, 45, 44, 41, 39, 37,

  52.    73, 70, 68, 65, 64, 61, 58, 56, 53, 50, 49, 46, 44, 41, 38, 36,

  53.    68, 65, 63, 61, 58, 55, 53, 51, 48, 46, 45, 43, 41, 39, 38, 36,

  54.    35, 33, 32, 30, 29, 27, 26, 25, 48, 47, 46, 44, 43, 41, 40, 39,

  55.    37, 36, 35, 34, 32, 31, 30, 28, 27, 26, 24, 23, 22, 20, 19, 37,

  56.    35, 34, 33, 31, 30, 29, 27, 26, 24, 23, 21, 20, 18, 17, 15, 29,

  57.    27, 26, 24, 22, 21, 19, 17, 16, 14, 26, 25, 23, 21, 19, 18, 16,

  58.    15, 27, 25, 23, 21, 19, 17, 16, 14, 26, 25, 23, 21, 18, 17, 14,

  59.    12, 17, 19, 13,  4,  9,  2, 11,  1,  7,  8,  0, 16,  3, 14,  6,

  60.    12, 10,  5, 15, 18, 11, 10, 13, 15, 16, 19, 20, 22, 24, 27, 15,

  61.    18, 20, 22, 24, 26, 14, 17, 20, 22, 24, 27, 15, 18, 20, 23, 25,

  62.    28, 16, 19, 22, 25, 28, 32, 36, 21, 25, 29, 33, 38, 42, 45, 49,

  63.    28, 31, 34, 37, 40, 42, 44, 47, 49, 50, 52, 54, 56, 57, 59, 60,

  64.    62, 64, 66, 67, 69, 35, 37, 39, 40, 42, 43, 45, 47, 48, 51, 52,

  65.    54, 55, 57, 59, 60, 62, 63, 66, 67, 69, 71, 72, 38, 40, 42, 43,

  66.    46, 47, 49, 51, 26, 28, 30, 31, 33, 34, 18, 19, 11, 13,  7,  8,

  67. };

  68. 

  69. static const unsigned char classic_add_chroma[256] = {

  70.     3,  1,  2,  2,  2,  2,  3,  3,  7,  5,  7,  5,  8,  6, 11,  9,

  71.     7, 13, 11, 10,  9,  8,  7,  5,  9,  7,  6,  4,  7,  5,  8,  7,

  72.    11,  8, 13, 11, 19, 15, 22, 23, 20, 33, 32, 28, 27, 29, 51, 77,

  73.    43, 45, 76, 81, 46, 82, 75, 55, 56,144, 58, 80, 60, 74,147, 63,

  74.   143, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79,

  75.    80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 27, 30, 21, 22,

  76.    17, 14,  5,  6,100, 54, 47, 50, 51, 53,106,107,108,109,110,111,

  77.   112,113,114,115,  4,117,118, 92, 94,121,122,  3,124,103,  2,  1,

  78.     0,129,130,131,120,119,126,125,136,137,138,139,140,141,142,134,

  79.   135,132,133,104, 64,101, 62, 57,102, 95, 93, 59, 61, 28, 97, 96,

  80.    52, 49, 48, 29, 32, 25, 24, 46, 23, 98, 45, 44, 43, 20, 42, 41,

  81.    19, 18, 99, 40, 15, 39, 38, 16, 13, 12, 11, 37, 10,  9,  8, 36,

  82.     7,128,127,105,123,116, 35, 34, 33,145, 31, 79, 42,146, 78, 26,

  83.    83, 48, 49, 50, 44, 47, 26, 31, 30, 18, 17, 19, 21, 24, 25, 13,

  84.    14, 16, 17, 18, 20, 21, 12, 14, 15,  9, 10,  6,  9,  6,  5,  8,

  85.     6, 12,  8, 10,  7,  9,  6,  4,  6,  2,  2,  3,  3,  3,  3,  2,

  86. };

  87. 

  88. static int read_len_table(uint8_t *dst, GetBitContext *gb)

  89. {

  90.     int i, val, repeat;

  91. 

  92.     for (i = 0; i < 256;) {

  93.         repeat = get_bits(gb, 3);

  94.         val    = get_bits(gb, 5);

  95.         if (repeat == 0)

  96.             repeat = get_bits(gb, 8);

  97.         if (i + repeat > 256 || get_bits_left(gb) < 0) {

  98.             av_log(NULL, AV_LOG_ERROR, "Error reading huffman table\n");

  99.             return -1;

  100.         }

  101.         while (repeat--)

  102.             dst[i++] = val;

  103.     }

  104.     return 0;

  105. }

  106. 

  107. static void generate_joint_tables(HYuvContext *s)

  108. {

  109.     uint16_t symbols[1 << VLC_BITS];

  110.     uint16_t bits[1 << VLC_BITS];

  111.     uint8_t len[1 << VLC_BITS];

  112.     if (s->bitstream_bpp < 24) {

  113.         int p, i, y, u;

  114.         for (p = 0; p < 3; p++) {

  115.             for (i = y = 0; y < 256; y++) {

  116.                 int len0 = s->len[0][y];

  117.                 int limit = VLC_BITS - len0;

  118.                 if(limit <= 0)

  119.                     continue;

  120.                 for (u = 0; u < 256; u++) {

  121.                     int len1 = s->len[p][u];

  122.                     if (len1 > limit)

  123.                         continue;

  124.                     len[i] = len0 + len1;

  125.                     bits[i] = (s->bits[0][y] << len1) + s->bits[p][u];

  126.                     symbols[i] = (y << 8) + u;

  127.                     if(symbols[i] != 0xffff) // reserved to mean "invalid"

  128.                         i++;

  129.                 }

  130.             }

  131.             ff_free_vlc(&s->vlc[3 + p]);

  132.             ff_init_vlc_sparse(&s->vlc[3 + p], VLC_BITS, i, len, 1, 1,

  133.                                bits, 2, 2, symbols, 2, 2, 0);

  134.         }

  135.     } else {

  136.         uint8_t (*map)[4] = (uint8_t(*)[4])s->pix_bgr_map;

  137.         int i, b, g, r, code;

  138.         int p0 = s->decorrelate;

  139.         int p1 = !s->decorrelate;

  140.         // restrict the range to +/-16 because that's pretty much guaranteed to

  141.         // cover all the combinations that fit in 11 bits total, and it doesn't

  142.         // matter if we miss a few rare codes.

  143.         for (i = 0, g = -16; g < 16; g++) {

  144.             int len0 = s->len[p0][g & 255];

  145.             int limit0 = VLC_BITS - len0;

  146.             if (limit0 < 2)

  147.                 continue;

  148.             for (b = -16; b < 16; b++) {

  149.                 int len1 = s->len[p1][b & 255];

  150.                 int limit1 = limit0 - len1;

  151.                 if (limit1 < 1)

  152.                     continue;

  153.                 code = (s->bits[p0][g & 255] << len1) + s->bits[p1][b & 255];

  154.                 for (r = -16; r < 16; r++) {

  155.                     int len2 = s->len[2][r & 255];

  156.                     if (len2 > limit1)

  157.                         continue;

  158.                     len[i] = len0 + len1 + len2;

  159.                     bits[i] = (code << len2) + s->bits[2][r & 255];

  160.                     if (s->decorrelate) {

  161.                         map[i][G] = g;

  162.                         map[i][B] = g + b;

  163.                         map[i][R] = g + r;

  164.                     } else {

  165.                         map[i][B] = g;

  166.                         map[i][G] = b;

  167.                         map[i][R] = r;

  168.                     }

  169.                     i++;

  170.                 }

  171.             }

  172.         }

  173.         ff_free_vlc(&s->vlc[3]);

  174.         init_vlc(&s->vlc[3], VLC_BITS, i, len, 1, 1, bits, 2, 2, 0);

  175.     }

  176. }

  177. 

  178. static int read_huffman_tables(HYuvContext *s, const uint8_t *src, int length)

  179. {

  180.     GetBitContext gb;

  181.     int i;

  182. 

  183.     init_get_bits(&gb, src, length * 8);

  184. 

  185.     for (i = 0; i < 3; i++) {

  186.         if (read_len_table(s->len[i], &gb) < 0)

  187.             return -1;

  188.         if (ff_huffyuv_generate_bits_table(s->bits[i], s->len[i]) < 0) {

  189.             return -1;

  190.         }

  191.         ff_free_vlc(&s->vlc[i]);

  192.         init_vlc(&s->vlc[i], VLC_BITS, 256, s->len[i], 1, 1,

  193.                  s->bits[i], 4, 4, 0);

  194.     }

  195. 

  196.     generate_joint_tables(s);

  197. 

  198.     return (get_bits_count(&gb) + 7) / 8;

  199. }

  200. 

  201. static int read_old_huffman_tables(HYuvContext *s)

  202. {

  203.     GetBitContext gb;

  204.     int i;

  205. 

  206.     init_get_bits(&gb, classic_shift_luma,

  207.                   classic_shift_luma_table_size * 8);

  208.     if (read_len_table(s->len[0], &gb) < 0)

  209.         return -1;

  210. 

  211.     init_get_bits(&gb, classic_shift_chroma,

  212.                   classic_shift_chroma_table_size * 8);

  213.     if (read_len_table(s->len[1], &gb) < 0)

  214.         return -1;

  215. 

  216.     for(i=0; i<256; i++) s->bits[0][i] = classic_add_luma  [i];

  217.     for(i=0; i<256; i++) s->bits[1][i] = classic_add_chroma[i];

  218. 

  219.     if (s->bitstream_bpp >= 24) {

  220.         memcpy(s->bits[1], s->bits[0], 256 * sizeof(uint32_t));

  221.         memcpy(s->len[1] , s->len [0], 256 * sizeof(uint8_t));

  222.     }

  223.     memcpy(s->bits[2], s->bits[1], 256 * sizeof(uint32_t));

  224.     memcpy(s->len[2] , s->len [1], 256 * sizeof(uint8_t));

  225. 

  226.     for (i = 0; i < 3; i++) {

  227.         ff_free_vlc(&s->vlc[i]);

  228.         init_vlc(&s->vlc[i], VLC_BITS, 256, s->len[i], 1, 1,

  229.                  s->bits[i], 4, 4, 0);

  230.     }

  231. 

  232.     generate_joint_tables(s);

  233. 

  234.     return 0;

  235. }

  236. 

  237. static av_cold int decode_init(AVCodecContext *avctx)

  238. {

  239.     HYuvContext *s = avctx->priv_data;

  240. 

  241.     ff_huffyuv_common_init(avctx);

  242.     memset(s->vlc, 0, 3 * sizeof(VLC));

  243. 

  244.     s->interlaced = s->height > 288;

  245. 

  246.     s->bgr32 = 1;

  247. 

  248.     if (avctx->extradata_size) {

  249.         if ((avctx->bits_per_coded_sample & 7) &&

  250.             avctx->bits_per_coded_sample != 12)

  251.             s->version = 1; // do such files exist at all?

  252.         else

  253.             s->version = 2;

  254.     } else

  255.         s->version = 0;

  256. 

  257.     if (s->version == 2) {

  258.         int method, interlace;

  259. 

  260.         if (avctx->extradata_size < 4)

  261.             return -1;

  262. 

  263.         method = ((uint8_t*)avctx->extradata)[0];

  264.         s->decorrelate = method & 64 ? 1 : 0;

  265.         s->predictor = method & 63;

  266.         s->bitstream_bpp = ((uint8_t*)avctx->extradata)[1];

  267.         if (s->bitstream_bpp == 0)

  268.             s->bitstream_bpp = avctx->bits_per_coded_sample & ~7;

  269.         interlace = (((uint8_t*)avctx->extradata)[2] & 0x30) >> 4;

  270.         s->interlaced = (interlace == 1) ? 1 : (interlace == 2) ? 0 : s->interlaced;

  271.         s->context = ((uint8_t*)avctx->extradata)[2] & 0x40 ? 1 : 0;

  272. 

  273.         if ( read_huffman_tables(s, ((uint8_t*)avctx->extradata) + 4,

  274.                                  avctx->extradata_size - 4) < 0)

  275.             return -1;

  276.     }else{

  277.         switch (avctx->bits_per_coded_sample & 7) {

  278.         case 1:

  279.             s->predictor = LEFT;

  280.             s->decorrelate = 0;

  281.             break;

  282.         case 2:

  283.             s->predictor = LEFT;

  284.             s->decorrelate = 1;

  285.             break;

  286.         case 3:

  287.             s->predictor = PLANE;

  288.             s->decorrelate = avctx->bits_per_coded_sample >= 24;

  289.             break;

  290.         case 4:

  291.             s->predictor = MEDIAN;

  292.             s->decorrelate = 0;

  293.             break;

  294.         default:

  295.             s->predictor = LEFT; //OLD

  296.             s->decorrelate = 0;

  297.             break;

  298.         }

  299.         s->bitstream_bpp = avctx->bits_per_coded_sample & ~7;

  300.         s->context = 0;

  301. 

  302.         if (read_old_huffman_tables(s) < 0)

  303.             return -1;

  304.     }

  305. 

  306.     switch (s->bitstream_bpp) {

  307.     case 12:

  308.         avctx->pix_fmt = AV_PIX_FMT_YUV420P;

  309.         break;

  310.     case 16:

  311.         if (s->yuy2) {

  312.             avctx->pix_fmt = AV_PIX_FMT_YUYV422;

  313.         } else {

  314.             avctx->pix_fmt = AV_PIX_FMT_YUV422P;

  315.         }

  316.         break;

  317.     case 24:

  318.     case 32:

  319.         if (s->bgr32) {

  320.             avctx->pix_fmt = AV_PIX_FMT_RGB32;

  321.         } else {

  322.             avctx->pix_fmt = AV_PIX_FMT_BGR24;

  323.         }

  324.         break;

  325.     default:

  326.         return AVERROR_INVALIDDATA;

  327.     }

  328. 

  329.     ff_huffyuv_alloc_temp(s);

  330. 

  331.     return 0;

  332. }

  333. 

  334. static av_cold int decode_init_thread_copy(AVCodecContext *avctx)

  335. {

  336.     HYuvContext *s = avctx->priv_data;

  337.     int i;

  338. 

  339.     ff_huffyuv_alloc_temp(s);

  340. 

  341.     for (i = 0; i < 6; i++)

  342.         s->vlc[i].table = NULL;

  343. 

  344.     if (s->version == 2) {

  345.         if (read_huffman_tables(s, ((uint8_t*)avctx->extradata) + 4,

  346.                                 avctx->extradata_size) < 0)

  347.             return -1;

  348.     } else {

  349.         if (read_old_huffman_tables(s) < 0)

  350.             return -1;

  351.     }

  352. 

  353.     return 0;

  354. }

  355. 

  356. /* TODO instead of restarting the read when the code isn't in the first level

  357.  * of the joint table, jump into the 2nd level of the individual table. */

  358. #define READ_2PIX(dst0, dst1, plane1){\

  359.     uint16_t code = get_vlc2(&s->gb, s->vlc[3+plane1].table, VLC_BITS, 1);\

  360.     if(code != 0xffff){\

  361.         dst0 = code>>8;\

  362.         dst1 = code;\

  363.     }else{\

  364.         dst0 = get_vlc2(&s->gb, s->vlc[0].table, VLC_BITS, 3);\

  365.         dst1 = get_vlc2(&s->gb, s->vlc[plane1].table, VLC_BITS, 3);\

  366.     }\

  367. }

  368. 

  369. static void decode_422_bitstream(HYuvContext *s, int count)

  370. {

  371.     int i;

  372. 

  373.     count /= 2;

  374. 

  375.     if (count >= (get_bits_left(&s->gb)) / (31 * 4)) {

  376.         for (i = 0; i < count && get_bits_left(&s->gb) > 0; i++) {

  377.             READ_2PIX(s->temp[0][2 * i    ], s->temp[1][i], 1);

  378.             READ_2PIX(s->temp[0][2 * i + 1], s->temp[2][i], 2);

  379.         }

  380.     } else {

  381.         for (i = 0; i < count; i++) {

  382.             READ_2PIX(s->temp[0][2 * i    ], s->temp[1][i], 1);

  383.             READ_2PIX(s->temp[0][2 * i + 1], s->temp[2][i], 2);

  384.         }

  385.     }

  386. }

  387. 

  388. static void decode_gray_bitstream(HYuvContext *s, int count)

  389. {

  390.     int i;

  391. 

  392.     count/=2;

  393. 

  394.     if (count >= (get_bits_left(&s->gb)) / (31 * 2)) {

  395.         for (i = 0; i < count && get_bits_left(&s->gb) > 0; i++) {

  396.             READ_2PIX(s->temp[0][2 * i], s->temp[0][2 * i + 1], 0);

  397.         }

  398.     } else {

  399.         for(i=0; i<count; i++){

  400.             READ_2PIX(s->temp[0][2 * i], s->temp[0][2 * i + 1], 0);

  401.         }

  402.     }

  403. }

  404. 

  405. static av_always_inline void decode_bgr_1(HYuvContext *s, int count,

  406.                                           int decorrelate, int alpha)

  407. {

  408.     int i;

  409.     for (i = 0; i < count; i++) {

  410.         int code = get_vlc2(&s->gb, s->vlc[3].table, VLC_BITS, 1);

  411.         if (code != -1) {

  412.             *(uint32_t*)&s->temp[0][4 * i] = s->pix_bgr_map[code];

  413.         } else if(decorrelate) {

  414.             s->temp[0][4 * i + G] = get_vlc2(&s->gb, s->vlc[1].table, VLC_BITS, 3);

  415.             s->temp[0][4 * i + B] = get_vlc2(&s->gb, s->vlc[0].table, VLC_BITS, 3) +

  416.                                     s->temp[0][4 * i + G];

  417.             s->temp[0][4 * i + R] = get_vlc2(&s->gb, s->vlc[2].table, VLC_BITS, 3) +

  418.                                     s->temp[0][4 * i + G];

  419.         } else {

  420.             s->temp[0][4 * i + B] = get_vlc2(&s->gb, s->vlc[0].table, VLC_BITS, 3);

  421.             s->temp[0][4 * i + G] = get_vlc2(&s->gb, s->vlc[1].table, VLC_BITS, 3);

  422.             s->temp[0][4 * i + R] = get_vlc2(&s->gb, s->vlc[2].table, VLC_BITS, 3);

  423.         }

  424.         if (alpha)

  425.             s->temp[0][4 * i + A] = get_vlc2(&s->gb, s->vlc[2].table, VLC_BITS, 3);

  426.     }

  427. }

  428. 

  429. static void decode_bgr_bitstream(HYuvContext *s, int count)

  430. {

  431.     if (s->decorrelate) {

  432.         if (s->bitstream_bpp==24)

  433.             decode_bgr_1(s, count, 1, 0);

  434.         else

  435.             decode_bgr_1(s, count, 1, 1);

  436.     } else {

  437.         if (s->bitstream_bpp==24)

  438.             decode_bgr_1(s, count, 0, 0);

  439.         else

  440.             decode_bgr_1(s, count, 0, 1);

  441.     }

  442. }

  443. 

  444. static void draw_slice(HYuvContext *s, AVFrame *frame, int y)

  445. {

  446.     int h, cy, i;

  447.     int offset[AV_NUM_DATA_POINTERS];

  448. 

  449.     if (s->avctx->draw_horiz_band==NULL)

  450.         return;

  451. 

  452.     h = y - s->last_slice_end;

  453.     y -= h;

  454. 

  455.     if (s->bitstream_bpp == 12) {

  456.         cy = y>>1;

  457.     } else {

  458.         cy = y;

  459.     }

  460. 

  461.     offset[0] = frame->linesize[0] * y;

  462.     offset[1] = frame->linesize[1] * cy;

  463.     offset[2] = frame->linesize[2] * cy;

  464.     for (i = 3; i < AV_NUM_DATA_POINTERS; i++)

  465.         offset[i] = 0;

  466.     emms_c();

  467. 

  468.     s->avctx->draw_horiz_band(s->avctx, frame, offset, y, 3, h);

  469. 

  470.     s->last_slice_end = y + h;

  471. }

  472. 

  473. static int decode_frame(AVCodecContext *avctx, void *data, int *got_frame,

  474.                         AVPacket *avpkt)

  475. {

  476.     const uint8_t *buf = avpkt->data;

  477.     int buf_size = avpkt->size;

  478.     HYuvContext *s = avctx->priv_data;

  479.     const int width = s->width;

  480.     const int width2 = s->width>>1;

  481.     const int height = s->height;

  482.     int fake_ystride, fake_ustride, fake_vstride;

  483.     ThreadFrame frame = { .f = data };

  484.     AVFrame * const p = data;

  485.     int table_size = 0;

  486. 

  487.     av_fast_malloc(&s->bitstream_buffer,

  488.                    &s->bitstream_buffer_size,

  489.                    buf_size + FF_INPUT_BUFFER_PADDING_SIZE);

  490.     if (!s->bitstream_buffer)

  491.         return AVERROR(ENOMEM);

  492. 

  493.     memset(s->bitstream_buffer + buf_size, 0, FF_INPUT_BUFFER_PADDING_SIZE);

  494.     s->dsp.bswap_buf((uint32_t*)s->bitstream_buffer,

  495.                      (const uint32_t*)buf, buf_size / 4);

  496. 

  497.     if (ff_thread_get_buffer(avctx, &frame, 0) < 0) {

  498.         av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");

  499.         return -1;

  500.     }

  501. 

  502.     if (s->context) {

  503.         table_size = read_huffman_tables(s, s->bitstream_buffer, buf_size);

  504.         if (table_size < 0)

  505.             return -1;

  506.     }

  507. 

  508.     if ((unsigned)(buf_size-table_size) >= INT_MAX / 8)

  509.         return -1;

  510. 

  511.     init_get_bits(&s->gb, s->bitstream_buffer+table_size,

  512.                   (buf_size-table_size) * 8);

  513. 

  514.     fake_ystride = s->interlaced ? p->linesize[0] * 2  : p->linesize[0];

  515.     fake_ustride = s->interlaced ? p->linesize[1] * 2  : p->linesize[1];

  516.     fake_vstride = s->interlaced ? p->linesize[2] * 2  : p->linesize[2];

  517. 

  518.     s->last_slice_end = 0;

  519. 

  520.     if (s->bitstream_bpp < 24) {

  521.         int y, cy;

  522.         int lefty, leftu, leftv;

  523.         int lefttopy, lefttopu, lefttopv;

  524. 

  525.         if (s->yuy2) {

  526.             p->data[0][3] = get_bits(&s->gb, 8);

  527.             p->data[0][2] = get_bits(&s->gb, 8);

  528.             p->data[0][1] = get_bits(&s->gb, 8);

  529.             p->data[0][0] = get_bits(&s->gb, 8);

  530. 

  531.             av_log(avctx, AV_LOG_ERROR,

  532.                    "YUY2 output is not implemented yet\n");

  533.             return -1;

  534.         } else {

  535. 

  536.             leftv = p->data[2][0] = get_bits(&s->gb, 8);

  537.             lefty = p->data[0][1] = get_bits(&s->gb, 8);

  538.             leftu = p->data[1][0] = get_bits(&s->gb, 8);

  539.                     p->data[0][0] = get_bits(&s->gb, 8);

  540. 

  541.             switch (s->predictor) {

  542.             case LEFT:

  543.             case PLANE:

  544.                 decode_422_bitstream(s, width-2);

  545.                 lefty = s->dsp.add_hfyu_left_prediction(p->data[0] + 2, s->temp[0], width-2, lefty);

  546.                 if (!(s->flags&CODEC_FLAG_GRAY)) {

  547.                     leftu = s->dsp.add_hfyu_left_prediction(p->data[1] + 1, s->temp[1], width2 - 1, leftu);

  548.                     leftv = s->dsp.add_hfyu_left_prediction(p->data[2] + 1, s->temp[2], width2 - 1, leftv);

  549.                 }

  550. 

  551.                 for (cy = y = 1; y < s->height; y++, cy++) {

  552.                     uint8_t *ydst, *udst, *vdst;

  553. 

  554.                     if (s->bitstream_bpp == 12) {

  555.                         decode_gray_bitstream(s, width);

  556. 

  557.                         ydst = p->data[0] + p->linesize[0] * y;

  558. 

  559.                         lefty = s->dsp.add_hfyu_left_prediction(ydst, s->temp[0], width, lefty);

  560.                         if (s->predictor == PLANE) {

  561.                             if (y > s->interlaced)

  562.                                 s->dsp.add_bytes(ydst, ydst - fake_ystride, width);

  563.                         }

  564.                         y++;

  565.                         if (y >= s->height) break;

  566.                     }

  567. 

  568.                     draw_slice(s, p, y);

  569. 

  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. 

  574.                     decode_422_bitstream(s, width);

  575.                     lefty = s->dsp.add_hfyu_left_prediction(ydst, s->temp[0], width, lefty);

  576.                     if (!(s->flags & CODEC_FLAG_GRAY)) {

  577.                         leftu= s->dsp.add_hfyu_left_prediction(udst, s->temp[1], width2, leftu);

  578.                         leftv= s->dsp.add_hfyu_left_prediction(vdst, s->temp[2], width2, leftv);

  579.                     }

  580.                     if (s->predictor == PLANE) {

  581.                         if (cy > s->interlaced) {

  582.                             s->dsp.add_bytes(ydst, ydst - fake_ystride, width);

  583.                             if (!(s->flags & CODEC_FLAG_GRAY)) {

  584.                                 s->dsp.add_bytes(udst, udst - fake_ustride, width2);

  585.                                 s->dsp.add_bytes(vdst, vdst - fake_vstride, width2);

  586.                             }

  587.                         }

  588.                     }

  589.                 }

  590.                 draw_slice(s, p, height);

  591. 

  592.                 break;

  593.             case MEDIAN:

  594.                 /* first line except first 2 pixels is left predicted */

  595.                 decode_422_bitstream(s, width - 2);

  596.                 lefty= s->dsp.add_hfyu_left_prediction(p->data[0] + 2, s->temp[0], width - 2, lefty);

  597.                 if (!(s->flags & CODEC_FLAG_GRAY)) {

  598.                     leftu = s->dsp.add_hfyu_left_prediction(p->data[1] + 1, s->temp[1], width2 - 1, leftu);

  599.                     leftv = s->dsp.add_hfyu_left_prediction(p->data[2] + 1, s->temp[2], width2 - 1, leftv);

  600.                 }

  601. 

  602.                 cy = y = 1;

  603. 

  604.                 /* second line is left predicted for interlaced case */

  605.                 if (s->interlaced) {

  606.                     decode_422_bitstream(s, width);

  607.                     lefty = s->dsp.add_hfyu_left_prediction(p->data[0] + p->linesize[0], s->temp[0], width, lefty);

  608.                     if (!(s->flags & CODEC_FLAG_GRAY)) {

  609.                         leftu = s->dsp.add_hfyu_left_prediction(p->data[1] + p->linesize[2], s->temp[1], width2, leftu);

  610.                         leftv = s->dsp.add_hfyu_left_prediction(p->data[2] + p->linesize[1], s->temp[2], width2, leftv);

  611.                     }

  612.                     y++; cy++;

  613.                 }

  614. 

  615.                 /* next 4 pixels are left predicted too */

  616.                 decode_422_bitstream(s, 4);

  617.                 lefty = s->dsp.add_hfyu_left_prediction(p->data[0] + fake_ystride, s->temp[0], 4, lefty);

  618.                 if (!(s->flags&CODEC_FLAG_GRAY)) {

  619.                     leftu = s->dsp.add_hfyu_left_prediction(p->data[1] + fake_ustride, s->temp[1], 2, leftu);

  620.                     leftv = s->dsp.add_hfyu_left_prediction(p->data[2] + fake_vstride, s->temp[2], 2, leftv);

  621.                 }

  622. 

  623.                 /* next line except the first 4 pixels is median predicted */

  624.                 lefttopy = p->data[0][3];

  625.                 decode_422_bitstream(s, width - 4);

  626.                 s->dsp.add_hfyu_median_prediction(p->data[0] + fake_ystride+4, p->data[0]+4, s->temp[0], width-4, &lefty, &lefttopy);

  627.                 if (!(s->flags&CODEC_FLAG_GRAY)) {

  628.                     lefttopu = p->data[1][1];

  629.                     lefttopv = p->data[2][1];

  630.                     s->dsp.add_hfyu_median_prediction(p->data[1] + fake_ustride+2, p->data[1] + 2, s->temp[1], width2 - 2, &leftu, &lefttopu);

  631.                     s->dsp.add_hfyu_median_prediction(p->data[2] + fake_vstride+2, p->data[2] + 2, s->temp[2], width2 - 2, &leftv, &lefttopv);

  632.                 }

  633.                 y++; cy++;

  634. 

  635.                 for (; y<height; y++, cy++) {

  636.                     uint8_t *ydst, *udst, *vdst;

  637. 

  638.                     if (s->bitstream_bpp == 12) {

  639.                         while (2 * cy > y) {

  640.                             decode_gray_bitstream(s, width);

  641.                             ydst = p->data[0] + p->linesize[0] * y;

  642.                             s->dsp.add_hfyu_median_prediction(ydst, ydst - fake_ystride, s->temp[0], width, &lefty, &lefttopy);

  643.                             y++;

  644.                         }

  645.                         if (y >= height) break;

  646.                     }

  647.                     draw_slice(s, p, y);

  648. 

  649.                     decode_422_bitstream(s, width);

  650. 

  651.                     ydst = p->data[0] + p->linesize[0] * y;

  652.                     udst = p->data[1] + p->linesize[1] * cy;

  653.                     vdst = p->data[2] + p->linesize[2] * cy;

  654. 

  655.                     s->dsp.add_hfyu_median_prediction(ydst, ydst - fake_ystride, s->temp[0], width, &lefty, &lefttopy);

  656.                     if (!(s->flags & CODEC_FLAG_GRAY)) {

  657.                         s->dsp.add_hfyu_median_prediction(udst, udst - fake_ustride, s->temp[1], width2, &leftu, &lefttopu);

  658.                         s->dsp.add_hfyu_median_prediction(vdst, vdst - fake_vstride, s->temp[2], width2, &leftv, &lefttopv);

  659.                     }

  660.                 }

  661. 

  662.                 draw_slice(s, p, height);

  663.                 break;

  664.             }

  665.         }

  666.     } else {

  667.         int y;

  668.         int leftr, leftg, leftb, lefta;

  669.         const int last_line = (height - 1) * p->linesize[0];

  670. 

  671.         if (s->bitstream_bpp == 32) {

  672.             lefta = p->data[0][last_line+A] = get_bits(&s->gb, 8);

  673.             leftr = p->data[0][last_line+R] = get_bits(&s->gb, 8);

  674.             leftg = p->data[0][last_line+G] = get_bits(&s->gb, 8);

  675.             leftb = p->data[0][last_line+B] = get_bits(&s->gb, 8);

  676.         } else {

  677.             leftr = p->data[0][last_line+R] = get_bits(&s->gb, 8);

  678.             leftg = p->data[0][last_line+G] = get_bits(&s->gb, 8);

  679.             leftb = p->data[0][last_line+B] = get_bits(&s->gb, 8);

  680.             lefta = p->data[0][last_line+A] = 255;

  681.             skip_bits(&s->gb, 8);

  682.         }

  683. 

  684.         if (s->bgr32) {

  685.             switch (s->predictor) {

  686.             case LEFT:

  687.             case PLANE:

  688.                 decode_bgr_bitstream(s, width - 1);

  689.                 s->dsp.add_hfyu_left_prediction_bgr32(p->data[0] + last_line+4, s->temp[0], width - 1, &leftr, &leftg, &leftb, &lefta);

  690. 

  691.                 for (y = s->height - 2; y >= 0; y--) { //Yes it is stored upside down.

  692.                     decode_bgr_bitstream(s, width);

  693. 

  694.                     s->dsp.add_hfyu_left_prediction_bgr32(p->data[0] + p->linesize[0]*y, s->temp[0], width, &leftr, &leftg, &leftb, &lefta);

  695.                     if (s->predictor == PLANE) {

  696.                         if (s->bitstream_bpp != 32) lefta = 0;

  697.                         if ((y & s->interlaced) == 0 &&

  698.                             y < s->height - 1 - s->interlaced) {

  699.                             s->dsp.add_bytes(p->data[0] + p->linesize[0] * y,

  700.                                              p->data[0] + p->linesize[0] * y +

  701.                                              fake_ystride, fake_ystride);

  702.                         }

  703.                     }

  704.                 }

  705.                 // just 1 large slice as this is not possible in reverse order

  706.                 draw_slice(s, p, height);

  707.                 break;

  708.             default:

  709.                 av_log(avctx, AV_LOG_ERROR,

  710.                        "prediction type not supported!\n");

  711.             }

  712.         }else{

  713.             av_log(avctx, AV_LOG_ERROR,

  714.                    "BGR24 output is not implemented yet\n");

  715.             return -1;

  716.         }

  717.     }

  718.     emms_c();

  719. 

  720.     *got_frame = 1;

  721. 

  722.     return (get_bits_count(&s->gb) + 31) / 32 * 4 + table_size;

  723. }

  724. 

  725. static av_cold int decode_end(AVCodecContext *avctx)

  726. {

  727.     HYuvContext *s = avctx->priv_data;

  728.     int i;

  729. 

  730.     ff_huffyuv_common_end(s);

  731.     av_freep(&s->bitstream_buffer);

  732. 

  733.     for (i = 0; i < 6; i++) {

  734.         ff_free_vlc(&s->vlc[i]);

  735.     }

  736. 

  737.     return 0;

  738. }

  739. 

  740. #if CONFIG_HUFFYUV_DECODER

  741. AVCodec ff_huffyuv_decoder = {

  742.     .name             = "huffyuv",

  743.     .long_name        = NULL_IF_CONFIG_SMALL("Huffyuv / HuffYUV"),

  744.     .type             = AVMEDIA_TYPE_VIDEO,

  745.     .id               = AV_CODEC_ID_HUFFYUV,

  746.     .priv_data_size   = sizeof(HYuvContext),

  747.     .init             = decode_init,

  748.     .close            = decode_end,

  749.     .decode           = decode_frame,

  750.     .capabilities     = CODEC_CAP_DR1 | CODEC_CAP_DRAW_HORIZ_BAND |

  751.                         CODEC_CAP_FRAME_THREADS,

  752.     .init_thread_copy = ONLY_IF_THREADS_ENABLED(decode_init_thread_copy),

  753. };

  754. #endif

  755. 

  756. #if CONFIG_FFVHUFF_DECODER

  757. AVCodec ff_ffvhuff_decoder = {

  758.     .name             = "ffvhuff",

  759.     .long_name        = NULL_IF_CONFIG_SMALL("Huffyuv FFmpeg variant"),

  760.     .type             = AVMEDIA_TYPE_VIDEO,

  761.     .id               = AV_CODEC_ID_FFVHUFF,

  762.     .priv_data_size   = sizeof(HYuvContext),

  763.     .init             = decode_init,

  764.     .close            = decode_end,

  765.     .decode           = decode_frame,

  766.     .capabilities     = CODEC_CAP_DR1 | CODEC_CAP_DRAW_HORIZ_BAND |

  767.                         CODEC_CAP_FRAME_THREADS,

  768.     .init_thread_copy = ONLY_IF_THREADS_ENABLED(decode_init_thread_copy),

  769. };

  770. #endif