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.
39979 Commits
32 Branches
776MB
Tree: 593886b5dd
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '593886b5dd'
${ 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 "huffyuvdsp.h"

  35. #include "thread.h"

  36. 

  37. #define classic_shift_luma_table_size 42

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

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

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

  41.   69,68, 0

  42. };

  43. 

  44. #define classic_shift_chroma_table_size 59

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

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

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

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

  49. };

  50. 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  68. };

  69. 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  87. };

  88. 

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

  90. {

  91.     int i, val, repeat;

  92. 

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

  94.         repeat = get_bits(gb, 3);

  95.         val    = get_bits(gb, 5);

  96.         if (repeat == 0)

  97.             repeat = get_bits(gb, 8);

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

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

  100.             return -1;

  101.         }

  102.         while (repeat--)

  103.             dst[i++] = val;

  104.     }

  105.     return 0;

  106. }

  107. 

  108. static void generate_joint_tables(HYuvContext *s)

  109. {

  110.     uint16_t symbols[1 << VLC_BITS];

  111.     uint16_t bits[1 << VLC_BITS];

  112.     uint8_t len[1 << VLC_BITS];

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

  114.         int p, i, y, u;

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

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

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

  118.                 int limit = VLC_BITS - len0;

  119.                 if(limit <= 0)

  120.                     continue;

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

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

  123.                     if (len1 > limit)

  124.                         continue;

  125.                     len[i] = len0 + len1;

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

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

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

  129.                         i++;

  130.                 }

  131.             }

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

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

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

  135.         }

  136.     } else {

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

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

  139.         int p0 = s->decorrelate;

  140.         int p1 = !s->decorrelate;

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

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

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

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

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

  146.             int limit0 = VLC_BITS - len0;

  147.             if (limit0 < 2)

  148.                 continue;

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

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

  151.                 int limit1 = limit0 - len1;

  152.                 if (limit1 < 1)

  153.                     continue;

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

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

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

  157.                     if (len2 > limit1)

  158.                         continue;

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

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

  161.                     if (s->decorrelate) {

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

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

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

  165.                     } else {

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

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

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

  169.                     }

  170.                     i++;

  171.                 }

  172.             }

  173.         }

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

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

  176.     }

  177. }

  178. 

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

  180. {

  181.     GetBitContext gb;

  182.     int i;

  183. 

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

  185. 

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

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

  188.             return -1;

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

  190.             return -1;

  191.         }

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

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

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

  195.     }

  196. 

  197.     generate_joint_tables(s);

  198. 

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

  200. }

  201. 

  202. static int read_old_huffman_tables(HYuvContext *s)

  203. {

  204.     GetBitContext gb;

  205.     int i;

  206. 

  207.     init_get_bits(&gb, classic_shift_luma,

  208.                   classic_shift_luma_table_size * 8);

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

  210.         return -1;

  211. 

  212.     init_get_bits(&gb, classic_shift_chroma,

  213.                   classic_shift_chroma_table_size * 8);

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

  215.         return -1;

  216. 

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

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

  219. 

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

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

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

  223.     }

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

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

  226. 

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

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

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

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

  231.     }

  232. 

  233.     generate_joint_tables(s);

  234. 

  235.     return 0;

  236. }

  237. 

  238. static av_cold int decode_init(AVCodecContext *avctx)

  239. {

  240.     HYuvContext *s = avctx->priv_data;

  241. 

  242.     ff_huffyuv_common_init(avctx);

  243.     ff_huffyuvdsp_init(&s->hdsp);

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

  245. 

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

  247. 

  248.     s->bgr32 = 1;

  249. 

  250.     if (avctx->extradata_size) {

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

  252.             avctx->bits_per_coded_sample != 12)

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

  254.         else

  255.             s->version = 2;

  256.     } else

  257.         s->version = 0;

  258. 

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

  260.         int method, interlace;

  261. 

  262.         if (avctx->extradata_size < 4)

  263.             return -1;

  264. 

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

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

  267.         s->predictor = method & 63;

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

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

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

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

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

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

  274. 

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

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

  277.             return -1;

  278.     }else{

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

  280.         case 1:

  281.             s->predictor = LEFT;

  282.             s->decorrelate = 0;

  283.             break;

  284.         case 2:

  285.             s->predictor = LEFT;

  286.             s->decorrelate = 1;

  287.             break;

  288.         case 3:

  289.             s->predictor = PLANE;

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

  291.             break;

  292.         case 4:

  293.             s->predictor = MEDIAN;

  294.             s->decorrelate = 0;

  295.             break;

  296.         default:

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

  298.             s->decorrelate = 0;

  299.             break;

  300.         }

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

  302.         s->context = 0;

  303. 

  304.         if (read_old_huffman_tables(s) < 0)

  305.             return -1;

  306.     }

  307. 

  308.     switch (s->bitstream_bpp) {

  309.     case 12:

  310.         avctx->pix_fmt = AV_PIX_FMT_YUV420P;

  311.         break;

  312.     case 16:

  313.         if (s->yuy2) {

  314.             avctx->pix_fmt = AV_PIX_FMT_YUYV422;

  315.         } else {

  316.             avctx->pix_fmt = AV_PIX_FMT_YUV422P;

  317.         }

  318.         break;

  319.     case 24:

  320.     case 32:

  321.         if (s->bgr32) {

  322.             avctx->pix_fmt = AV_PIX_FMT_RGB32;

  323.         } else {

  324.             avctx->pix_fmt = AV_PIX_FMT_BGR24;

  325.         }

  326.         break;

  327.     default:

  328.         return AVERROR_INVALIDDATA;

  329.     }

  330. 

  331.     ff_huffyuv_alloc_temp(s);

  332. 

  333.     return 0;

  334. }

  335. 

  336. static av_cold int decode_init_thread_copy(AVCodecContext *avctx)

  337. {

  338.     HYuvContext *s = avctx->priv_data;

  339.     int i;

  340. 

  341.     ff_huffyuv_alloc_temp(s);

  342. 

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

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

  345. 

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

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

  348.                                 avctx->extradata_size) < 0)

  349.             return -1;

  350.     } else {

  351.         if (read_old_huffman_tables(s) < 0)

  352.             return -1;

  353.     }

  354. 

  355.     return 0;

  356. }

  357. 

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

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

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

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

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

  363.         dst0 = code>>8;\

  364.         dst1 = code;\

  365.     }else{\

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

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

  368.     }\

  369. }

  370. 

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

  372. {

  373.     int i;

  374. 

  375.     count /= 2;

  376. 

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

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

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

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

  381.         }

  382.     } else {

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

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

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

  386.         }

  387.     }

  388. }

  389. 

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

  391. {

  392.     int i;

  393. 

  394.     count/=2;

  395. 

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

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

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

  399.         }

  400.     } else {

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

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

  403.         }

  404.     }

  405. }

  406. 

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

  408.                                           int decorrelate, int alpha)

  409. {

  410.     int i;

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

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

  413.         if (code != -1) {

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

  415.         } else if(decorrelate) {

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

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

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

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

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

  421.         } else {

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

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

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

  425.         }

  426.         if (alpha)

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

  428.     }

  429. }

  430. 

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

  432. {

  433.     if (s->decorrelate) {

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

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

  436.         else

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

  438.     } else {

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

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

  441.         else

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

  443.     }

  444. }

  445. 

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

  447. {

  448.     int h, cy, i;

  449.     int offset[AV_NUM_DATA_POINTERS];

  450. 

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

  452.         return;

  453. 

  454.     h = y - s->last_slice_end;

  455.     y -= h;

  456. 

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

  458.         cy = y>>1;

  459.     } else {

  460.         cy = y;

  461.     }

  462. 

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

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

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

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

  467.         offset[i] = 0;

  468.     emms_c();

  469. 

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

  471. 

  472.     s->last_slice_end = y + h;

  473. }

  474. 

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

  476.                         AVPacket *avpkt)

  477. {

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

  479.     int buf_size = avpkt->size;

  480.     HYuvContext *s = avctx->priv_data;

  481.     const int width = s->width;

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

  483.     const int height = s->height;

  484.     int fake_ystride, fake_ustride, fake_vstride;

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

  486.     AVFrame * const p = data;

  487.     int table_size = 0;

  488. 

  489.     av_fast_malloc(&s->bitstream_buffer,

  490.                    &s->bitstream_buffer_size,

  491.                    buf_size + FF_INPUT_BUFFER_PADDING_SIZE);

  492.     if (!s->bitstream_buffer)

  493.         return AVERROR(ENOMEM);

  494. 

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

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

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

  498. 

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

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

  501.         return -1;

  502.     }

  503. 

  504.     if (s->context) {

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

  506.         if (table_size < 0)

  507.             return -1;

  508.     }

  509. 

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

  511.         return -1;

  512. 

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

  514.                   (buf_size-table_size) * 8);

  515. 

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

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

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

  519. 

  520.     s->last_slice_end = 0;

  521. 

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

  523.         int y, cy;

  524.         int lefty, leftu, leftv;

  525.         int lefttopy, lefttopu, lefttopv;

  526. 

  527.         if (s->yuy2) {

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

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

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

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

  532. 

  533.             av_log(avctx, AV_LOG_ERROR,

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

  535.             return -1;

  536.         } else {

  537. 

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

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

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

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

  542. 

  543.             switch (s->predictor) {

  544.             case LEFT:

  545.             case PLANE:

  546.                 decode_422_bitstream(s, width-2);

  547.                 lefty = s->hdsp.add_hfyu_left_pred(p->data[0] + 2, s->temp[0], width - 2, lefty);

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

  549.                     leftu = s->hdsp.add_hfyu_left_pred(p->data[1] + 1, s->temp[1], width2 - 1, leftu);

  550.                     leftv = s->hdsp.add_hfyu_left_pred(p->data[2] + 1, s->temp[2], width2 - 1, leftv);

  551.                 }

  552. 

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

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

  555. 

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

  557.                         decode_gray_bitstream(s, width);

  558. 

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

  560. 

  561.                         lefty = s->hdsp.add_hfyu_left_pred(ydst, s->temp[0], width, lefty);

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

  563.                             if (y > s->interlaced)

  564.                                 s->hdsp.add_bytes(ydst, ydst - fake_ystride, width);

  565.                         }

  566.                         y++;

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

  568.                     }

  569. 

  570.                     draw_slice(s, p, y);

  571. 

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

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

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

  575. 

  576.                     decode_422_bitstream(s, width);

  577.                     lefty = s->hdsp.add_hfyu_left_pred(ydst, s->temp[0], width, lefty);

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

  579.                         leftu = s->hdsp.add_hfyu_left_pred(udst, s->temp[1], width2, leftu);

  580.                         leftv = s->hdsp.add_hfyu_left_pred(vdst, s->temp[2], width2, leftv);

  581.                     }

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

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

  584.                             s->hdsp.add_bytes(ydst, ydst - fake_ystride, width);

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

  586.                                 s->hdsp.add_bytes(udst, udst - fake_ustride, width2);

  587.                                 s->hdsp.add_bytes(vdst, vdst - fake_vstride, width2);

  588.                             }

  589.                         }

  590.                     }

  591.                 }

  592.                 draw_slice(s, p, height);

  593. 

  594.                 break;

  595.             case MEDIAN:

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

  597.                 decode_422_bitstream(s, width - 2);

  598.                 lefty = s->hdsp.add_hfyu_left_pred(p->data[0] + 2, s->temp[0], width - 2, lefty);

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

  600.                     leftu = s->hdsp.add_hfyu_left_pred(p->data[1] + 1, s->temp[1], width2 - 1, leftu);

  601.                     leftv = s->hdsp.add_hfyu_left_pred(p->data[2] + 1, s->temp[2], width2 - 1, leftv);

  602.                 }

  603. 

  604.                 cy = y = 1;

  605. 

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

  607.                 if (s->interlaced) {

  608.                     decode_422_bitstream(s, width);

  609.                     lefty = s->hdsp.add_hfyu_left_pred(p->data[0] + p->linesize[0], s->temp[0], width, lefty);

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

  611.                         leftu = s->hdsp.add_hfyu_left_pred(p->data[1] + p->linesize[2], s->temp[1], width2, leftu);

  612.                         leftv = s->hdsp.add_hfyu_left_pred(p->data[2] + p->linesize[1], s->temp[2], width2, leftv);

  613.                     }

  614.                     y++; cy++;

  615.                 }

  616. 

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

  618.                 decode_422_bitstream(s, 4);

  619.                 lefty = s->hdsp.add_hfyu_left_pred(p->data[0] + fake_ystride, s->temp[0], 4, lefty);

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

  621.                     leftu = s->hdsp.add_hfyu_left_pred(p->data[1] + fake_ustride, s->temp[1], 2, leftu);

  622.                     leftv = s->hdsp.add_hfyu_left_pred(p->data[2] + fake_vstride, s->temp[2], 2, leftv);

  623.                 }

  624. 

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

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

  627.                 decode_422_bitstream(s, width - 4);

  628.                 s->hdsp.add_hfyu_median_pred(p->data[0] + fake_ystride + 4, p->data[0] + 4, s->temp[0], width - 4, &lefty, &lefttopy);

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

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

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

  632.                     s->hdsp.add_hfyu_median_pred(p->data[1] + fake_ustride + 2, p->data[1] + 2, s->temp[1], width2 - 2, &leftu, &lefttopu);

  633.                     s->hdsp.add_hfyu_median_pred(p->data[2] + fake_vstride + 2, p->data[2] + 2, s->temp[2], width2 - 2, &leftv, &lefttopv);

  634.                 }

  635.                 y++; cy++;

  636. 

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

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

  639. 

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

  641.                         while (2 * cy > y) {

  642.                             decode_gray_bitstream(s, width);

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

  644.                             s->hdsp.add_hfyu_median_pred(ydst, ydst - fake_ystride, s->temp[0], width, &lefty, &lefttopy);

  645.                             y++;

  646.                         }

  647.                         if (y >= height) break;

  648.                     }

  649.                     draw_slice(s, p, y);

  650. 

  651.                     decode_422_bitstream(s, width);

  652. 

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

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

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

  656. 

  657.                     s->hdsp.add_hfyu_median_pred(ydst, ydst - fake_ystride, s->temp[0], width, &lefty, &lefttopy);

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

  659.                         s->hdsp.add_hfyu_median_pred(udst, udst - fake_ustride, s->temp[1], width2, &leftu, &lefttopu);

  660.                         s->hdsp.add_hfyu_median_pred(vdst, vdst - fake_vstride, s->temp[2], width2, &leftv, &lefttopv);

  661.                     }

  662.                 }

  663. 

  664.                 draw_slice(s, p, height);

  665.                 break;

  666.             }

  667.         }

  668.     } else {

  669.         int y;

  670.         int leftr, leftg, leftb, lefta;

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

  672. 

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

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

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

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

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

  678.         } else {

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

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

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

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

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

  684.         }

  685. 

  686.         if (s->bgr32) {

  687.             switch (s->predictor) {

  688.             case LEFT:

  689.             case PLANE:

  690.                 decode_bgr_bitstream(s, width - 1);

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

  692. 

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

  694.                     decode_bgr_bitstream(s, width);

  695. 

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

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

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

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

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

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

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

  703.                                               fake_ystride, fake_ystride);

  704.                         }

  705.                     }

  706.                 }

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

  708.                 draw_slice(s, p, height);

  709.                 break;

  710.             default:

  711.                 av_log(avctx, AV_LOG_ERROR,

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

  713.             }

  714.         }else{

  715.             av_log(avctx, AV_LOG_ERROR,

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

  717.             return -1;

  718.         }

  719.     }

  720.     emms_c();

  721. 

  722.     *got_frame = 1;

  723. 

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

  725. }

  726. 

  727. static av_cold int decode_end(AVCodecContext *avctx)

  728. {

  729.     HYuvContext *s = avctx->priv_data;

  730.     int i;

  731. 

  732.     ff_huffyuv_common_end(s);

  733.     av_freep(&s->bitstream_buffer);

  734. 

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

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

  737.     }

  738. 

  739.     return 0;

  740. }

  741. 

  742. AVCodec ff_huffyuv_decoder = {

  743.     .name             = "huffyuv",

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

  745.     .type             = AVMEDIA_TYPE_VIDEO,

  746.     .id               = AV_CODEC_ID_HUFFYUV,

  747.     .priv_data_size   = sizeof(HYuvContext),

  748.     .init             = decode_init,

  749.     .close            = decode_end,

  750.     .decode           = decode_frame,

  751.     .capabilities     = CODEC_CAP_DR1 | CODEC_CAP_DRAW_HORIZ_BAND |

  752.                         CODEC_CAP_FRAME_THREADS,

  753.     .init_thread_copy = ONLY_IF_THREADS_ENABLED(decode_init_thread_copy),

  754. };

  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