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.
59907 Commits
32 Branches
390MB
Tree: 2fd39642c9
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '2fd39642c9'
${ noResults }
FFmpeg/libavcodec/huffyuvdec.c

1114 lines
39KB
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 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.  * yuva, gray, 4:4:4, 4:1:1, 4:1:0 and >8 bit per sample support sponsored by NOA

  26.  */

  27. 

  28. /**

  29.  * @file

  30.  * huffyuv decoder

  31.  */

  32. 

  33. #include "avcodec.h"

  34. #include "get_bits.h"

  35. #include "huffyuv.h"

  36. #include "thread.h"

  37. #include "libavutil/pixdesc.h"

  38. 

  39. #define classic_shift_luma_table_size 42

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

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

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

  43.   69,68, 0,

  44.   0,0,0,0,0,0,0,0,

  45. };

  46. 

  47. #define classic_shift_chroma_table_size 59

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

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

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

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

  52.   0,0,0,0,0,0,0,0,

  53. };

  54. 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  72. };

  73. 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  91. };

  92. 

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

  94. {

  95.     int i, val, repeat;

  96. 

  97.     for (i = 0; i < n;) {

  98.         repeat = get_bits(gb, 3);

  99.         val    = get_bits(gb, 5);

  100.         if (repeat == 0)

  101.             repeat = get_bits(gb, 8);

  102.         if (i + repeat > n || get_bits_left(gb) < 0) {

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

  104.             return -1;

  105.         }

  106.         while (repeat--)

  107.             dst[i++] = val;

  108.     }

  109.     return 0;

  110. }

  111. 

  112. static int generate_joint_tables(HYuvContext *s)

  113. {

  114.     uint16_t symbols[1 << VLC_BITS];

  115.     uint16_t bits[1 << VLC_BITS];

  116.     uint8_t len[1 << VLC_BITS];

  117.     int ret;

  118. 

  119.     if (s->bitstream_bpp < 24 || s->version > 2) {

  120.         int p, i, y, u;

  121.         for (p = 0; p < 4; p++) {

  122.             int p0 = s->version > 2 ? p : 0;

  123.             for (i = y = 0; y < s->n; y++) {

  124.                 int len0 = s->len[p0][y];

  125.                 int limit = VLC_BITS - len0;

  126.                 if(limit <= 0 || !len0)

  127.                     continue;

  128.                 for (u = 0; u < s->n; u++) {

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

  130.                     if (len1 > limit || !len1)

  131.                         continue;

  132.                     av_assert0(i < (1 << VLC_BITS));

  133.                     len[i] = len0 + len1;

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

  135.                     symbols[i] = (y << 8) + u; //FIXME

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

  137.                         i++;

  138.                 }

  139.             }

  140.             ff_free_vlc(&s->vlc[4 + p]);

  141.             if ((ret = ff_init_vlc_sparse(&s->vlc[4 + p], VLC_BITS, i, len, 1, 1,

  142.                                           bits, 2, 2, symbols, 2, 2, 0)) < 0)

  143.                 return ret;

  144.         }

  145.     } else {

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

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

  148.         int p0 = s->decorrelate;

  149.         int p1 = !s->decorrelate;

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

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

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

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

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

  155.             int limit0 = VLC_BITS - len0;

  156.             if (limit0 < 2 || !len0)

  157.                 continue;

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

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

  160.                 int limit1 = limit0 - len1;

  161.                 if (limit1 < 1 || !len1)

  162.                     continue;

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

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

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

  166.                     if (len2 > limit1 || !len2)

  167.                         continue;

  168.                     av_assert0(i < (1 << VLC_BITS));

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

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

  171.                     if (s->decorrelate) {

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

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

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

  175.                     } else {

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

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

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

  179.                     }

  180.                     i++;

  181.                 }

  182.             }

  183.         }

  184.         ff_free_vlc(&s->vlc[4]);

  185.         if ((ret = init_vlc(&s->vlc[4], VLC_BITS, i, len, 1, 1, bits, 2, 2, 0)) < 0)

  186.             return ret;

  187.     }

  188.     return 0;

  189. }

  190. 

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

  192. {

  193.     GetBitContext gb;

  194.     int i;

  195.     int ret;

  196.     int count = 3;

  197. 

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

  199. 

  200.     if (s->version > 2)

  201.         count = 1 + s->alpha + 2*s->chroma;

  202. 

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

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

  205.             return -1;

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

  207.             return -1;

  208.         }

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

  210.         if ((ret = init_vlc(&s->vlc[i], VLC_BITS, s->n, s->len[i], 1, 1,

  211.                            s->bits[i], 4, 4, 0)) < 0)

  212.             return ret;

  213.     }

  214. 

  215.     if ((ret = generate_joint_tables(s)) < 0)

  216.         return ret;

  217. 

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

  219. }

  220. 

  221. static int read_old_huffman_tables(HYuvContext *s)

  222. {

  223.     GetBitContext gb;

  224.     int i;

  225.     int ret;

  226. 

  227.     init_get_bits(&gb, classic_shift_luma,

  228.                   classic_shift_luma_table_size * 8);

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

  230.         return -1;

  231. 

  232.     init_get_bits(&gb, classic_shift_chroma,

  233.                   classic_shift_chroma_table_size * 8);

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

  235.         return -1;

  236. 

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

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

  239. 

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

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

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

  243.     }

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

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

  246. 

  247.     for (i = 0; i < 4; i++) {

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

  249.         if ((ret = init_vlc(&s->vlc[i], VLC_BITS, 256, s->len[i], 1, 1,

  250.                             s->bits[i], 4, 4, 0)) < 0)

  251.             return ret;

  252.     }

  253. 

  254.     if ((ret = generate_joint_tables(s)) < 0)

  255.         return ret;

  256. 

  257.     return 0;

  258. }

  259. 

  260. static av_cold int decode_init(AVCodecContext *avctx)

  261. {

  262.     HYuvContext *s = avctx->priv_data;

  263. 

  264.     ff_huffyuv_common_init(avctx);

  265.     memset(s->vlc, 0, 4 * sizeof(VLC));

  266. 

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

  268. 

  269.     s->bgr32 = 1;

  270. 

  271.     if (avctx->extradata_size) {

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

  273.             avctx->bits_per_coded_sample != 12)

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

  275.         else if (avctx->extradata_size > 3 && avctx->extradata[3] == 0)

  276.             s->version = 2;

  277.         else

  278.             s->version = 3;

  279.     } else

  280.         s->version = 0;

  281. 

  282.     s->bps = 8;

  283.     s->n = 1<<s->bps;

  284.     s->chroma = 1;

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

  286.         int method, interlace;

  287. 

  288.         if (avctx->extradata_size < 4)

  289.             return -1;

  290. 

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

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

  293.         s->predictor = method & 63;

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

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

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

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

  298.         } else {

  299.             s->bps = (avctx->extradata[1] >> 4) + 1;

  300.             s->n = 1<<s->bps;

  301.             s->chroma_h_shift = avctx->extradata[1] & 3;

  302.             s->chroma_v_shift = (avctx->extradata[1] >> 2) & 3;

  303.             s->yuv   = !!(((uint8_t*)avctx->extradata)[2] & 1);

  304.             s->chroma= !!(((uint8_t*)avctx->extradata)[2] & 3);

  305.             s->alpha = !!(((uint8_t*)avctx->extradata)[2] & 4);

  306.         }

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

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

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

  310. 

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

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

  313.             return AVERROR_INVALIDDATA;

  314.     }else{

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

  316.         case 1:

  317.             s->predictor = LEFT;

  318.             s->decorrelate = 0;

  319.             break;

  320.         case 2:

  321.             s->predictor = LEFT;

  322.             s->decorrelate = 1;

  323.             break;

  324.         case 3:

  325.             s->predictor = PLANE;

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

  327.             break;

  328.         case 4:

  329.             s->predictor = MEDIAN;

  330.             s->decorrelate = 0;

  331.             break;

  332.         default:

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

  334.             s->decorrelate = 0;

  335.             break;

  336.         }

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

  338.         s->context = 0;

  339. 

  340.         if (read_old_huffman_tables(s) < 0)

  341.             return AVERROR_INVALIDDATA;

  342.     }

  343. 

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

  345.         switch (s->bitstream_bpp) {

  346.         case 12:

  347.             avctx->pix_fmt = AV_PIX_FMT_YUV420P;

  348.             s->yuv = 1;

  349.             break;

  350.         case 16:

  351.             if (s->yuy2) {

  352.                 avctx->pix_fmt = AV_PIX_FMT_YUYV422;

  353.             } else {

  354.                 avctx->pix_fmt = AV_PIX_FMT_YUV422P;

  355.             }

  356.             s->yuv = 1;

  357.             break;

  358.         case 24:

  359.         case 32:

  360.             if (s->bgr32) {

  361.                 avctx->pix_fmt = AV_PIX_FMT_RGB32;

  362.                 s->alpha = 1;

  363.             } else {

  364.                 avctx->pix_fmt = AV_PIX_FMT_BGR24;

  365.             }

  366.             break;

  367.         default:

  368.             return AVERROR_INVALIDDATA;

  369.         }

  370.         av_pix_fmt_get_chroma_sub_sample(avctx->pix_fmt,

  371.                                          &s->chroma_h_shift,

  372.                                          &s->chroma_v_shift);

  373.     } else {

  374.         switch ( (s->chroma<<10) | (s->yuv<<9) | (s->alpha<<8) | ((s->bps-1)<<4) | s->chroma_h_shift | (s->chroma_v_shift<<2)) {

  375.         case 0x070:

  376.             avctx->pix_fmt = AV_PIX_FMT_GRAY8;

  377.             break;

  378.         case 0x170:

  379.             avctx->pix_fmt = AV_PIX_FMT_GRAY8A;

  380.             break;

  381.         case 0x470:

  382.             avctx->pix_fmt = AV_PIX_FMT_GBRP;

  383.             break;

  384.         case 0x570:

  385.             avctx->pix_fmt = AV_PIX_FMT_GBRAP;

  386.             break;

  387.         case 0x670:

  388.             avctx->pix_fmt = AV_PIX_FMT_YUV444P;

  389.             break;

  390.         case 0x680:

  391.             avctx->pix_fmt = AV_PIX_FMT_YUV444P9;

  392.             break;

  393.         case 0x690:

  394.             avctx->pix_fmt = AV_PIX_FMT_YUV444P10;

  395.             break;

  396.         case 0x6B0:

  397.             avctx->pix_fmt = AV_PIX_FMT_YUV444P12;

  398.             break;

  399.         case 0x6D0:

  400.             avctx->pix_fmt = AV_PIX_FMT_YUV444P14;

  401.             break;

  402.         case 0x671:

  403.             avctx->pix_fmt = AV_PIX_FMT_YUV422P;

  404.             break;

  405.         case 0x681:

  406.             avctx->pix_fmt = AV_PIX_FMT_YUV422P9;

  407.             break;

  408.         case 0x691:

  409.             avctx->pix_fmt = AV_PIX_FMT_YUV422P10;

  410.             break;

  411.         case 0x6B1:

  412.             avctx->pix_fmt = AV_PIX_FMT_YUV422P12;

  413.             break;

  414.         case 0x6D1:

  415.             avctx->pix_fmt = AV_PIX_FMT_YUV422P14;

  416.             break;

  417.         case 0x672:

  418.             avctx->pix_fmt = AV_PIX_FMT_YUV411P;

  419.             break;

  420.         case 0x674:

  421.             avctx->pix_fmt = AV_PIX_FMT_YUV440P;

  422.             break;

  423.         case 0x675:

  424.             avctx->pix_fmt = AV_PIX_FMT_YUV420P;

  425.             break;

  426.         case 0x685:

  427.             avctx->pix_fmt = AV_PIX_FMT_YUV420P9;

  428.             break;

  429.         case 0x695:

  430.             avctx->pix_fmt = AV_PIX_FMT_YUV420P10;

  431.             break;

  432.         case 0x6B5:

  433.             avctx->pix_fmt = AV_PIX_FMT_YUV420P12;

  434.             break;

  435.         case 0x6D5:

  436.             avctx->pix_fmt = AV_PIX_FMT_YUV420P14;

  437.             break;

  438.         case 0x67A:

  439.             avctx->pix_fmt = AV_PIX_FMT_YUV410P;

  440.             break;

  441.         case 0x770:

  442.             avctx->pix_fmt = AV_PIX_FMT_YUVA444P;

  443.             break;

  444.         case 0x780:

  445.             avctx->pix_fmt = AV_PIX_FMT_YUVA444P9;

  446.             break;

  447.         case 0x790:

  448.             avctx->pix_fmt = AV_PIX_FMT_YUVA444P10;

  449.             break;

  450.         case 0x771:

  451.             avctx->pix_fmt = AV_PIX_FMT_YUVA422P;

  452.             break;

  453.         case 0x781:

  454.             avctx->pix_fmt = AV_PIX_FMT_YUVA422P9;

  455.             break;

  456.         case 0x791:

  457.             avctx->pix_fmt = AV_PIX_FMT_YUVA422P10;

  458.             break;

  459.         case 0x775:

  460.             avctx->pix_fmt = AV_PIX_FMT_YUVA420P;

  461.             break;

  462.         case 0x785:

  463.             avctx->pix_fmt = AV_PIX_FMT_YUVA420P9;

  464.             break;

  465.         case 0x795:

  466.             avctx->pix_fmt = AV_PIX_FMT_YUVA420P10;

  467.             break;

  468.         default:

  469.             return AVERROR_INVALIDDATA;

  470.         }

  471.     }

  472. 

  473. 

  474.     if ((avctx->pix_fmt == AV_PIX_FMT_YUV422P || avctx->pix_fmt == AV_PIX_FMT_YUV420P) && avctx->width & 1) {

  475.         av_log(avctx, AV_LOG_ERROR, "width must be even for this colorspace\n");

  476.         return AVERROR_INVALIDDATA;

  477.     }

  478.     if (s->predictor == MEDIAN && avctx->pix_fmt == AV_PIX_FMT_YUV422P && avctx->width%4) {

  479.         av_log(avctx, AV_LOG_ERROR, "width must be a multiple of 4 this colorspace and predictor\n");

  480.         return AVERROR_INVALIDDATA;

  481.     }

  482.     if (ff_huffyuv_alloc_temp(s)) {

  483.         ff_huffyuv_common_end(s);

  484.         return AVERROR(ENOMEM);

  485.     }

  486. 

  487.     return 0;

  488. }

  489. 

  490. static av_cold int decode_init_thread_copy(AVCodecContext *avctx)

  491. {

  492.     HYuvContext *s = avctx->priv_data;

  493.     int i;

  494. 

  495.     if (ff_huffyuv_alloc_temp(s)) {

  496.         ff_huffyuv_common_end(s);

  497.         return AVERROR(ENOMEM);

  498.     }

  499. 

  500.     for (i = 0; i < 8; i++)

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

  502. 

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

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

  505.                                 avctx->extradata_size) < 0)

  506.             return AVERROR_INVALIDDATA;

  507.     } else {

  508.         if (read_old_huffman_tables(s) < 0)

  509.             return AVERROR_INVALIDDATA;

  510.     }

  511. 

  512.     return 0;

  513. }

  514. 

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

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

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

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

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

  520.         dst0 = code>>8;\

  521.         dst1 = code;\

  522.     }else{\

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

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

  525.     }\

  526. }

  527. 

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

  529. {

  530.     int i;

  531. 

  532.     count /= 2;

  533. 

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

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

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

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

  538.         }

  539.         for (; i < count; i++)

  540.             s->temp[0][2 * i    ] = s->temp[1][i] =

  541.             s->temp[0][2 * i + 1] = s->temp[2][i] = 128;

  542.     } else {

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

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

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

  546.         }

  547.     }

  548. }

  549. 

  550. #define READ_2PIX_PLANE(dst0, dst1, plane){\

  551.     uint16_t code = get_vlc2(&s->gb, s->vlc[4+plane].table, VLC_BITS, 1);\

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

  553.         dst0 = code>>8;\

  554.         dst1 = code;\

  555.     }else{\

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

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

  558.     }\

  559. }

  560. #define READ_2PIX_PLANE16(dst0, dst1, plane){\

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

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

  563. }

  564. static void decode_plane_bitstream(HYuvContext *s, int count, int plane)

  565. {

  566.     int i;

  567. 

  568.     count/=2;

  569. 

  570.     if (s->bps <= 8) {

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

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

  573.                 READ_2PIX_PLANE(s->temp[0][2 * i], s->temp[0][2 * i + 1], plane);

  574.             }

  575.         } else {

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

  577.                 READ_2PIX_PLANE(s->temp[0][2 * i], s->temp[0][2 * i + 1], plane);

  578.             }

  579.         }

  580.     } else {

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

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

  583.                 READ_2PIX_PLANE16(s->temp16[0][2 * i], s->temp16[0][2 * i + 1], plane);

  584.             }

  585.         } else {

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

  587.                 READ_2PIX_PLANE16(s->temp16[0][2 * i], s->temp16[0][2 * i + 1], plane);

  588.             }

  589.         }

  590.     }

  591. }

  592. 

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

  594. {

  595.     int i;

  596. 

  597.     count/=2;

  598. 

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

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

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

  602.         }

  603.     } else {

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

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

  606.         }

  607.     }

  608. }

  609. 

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

  611.                                           int decorrelate, int alpha)

  612. {

  613.     int i;

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

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

  616.         if (code != -1) {

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

  618.         } else if(decorrelate) {

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

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

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

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

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

  624.         } else {

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

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

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

  628.         }

  629.         if (alpha)

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

  631.     }

  632. }

  633. 

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

  635. {

  636.     if (s->decorrelate) {

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

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

  639.         else

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

  641.     } else {

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

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

  644.         else

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

  646.     }

  647. }

  648. 

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

  650. {

  651.     int h, cy, i;

  652.     int offset[AV_NUM_DATA_POINTERS];

  653. 

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

  655.         return;

  656. 

  657.     h = y - s->last_slice_end;

  658.     y -= h;

  659. 

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

  661.         cy = y>>1;

  662.     } else {

  663.         cy = y;

  664.     }

  665. 

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

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

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

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

  670.         offset[i] = 0;

  671.     emms_c();

  672. 

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

  674. 

  675.     s->last_slice_end = y + h;

  676. }

  677. 

  678. static int left_prediction(HYuvContext *s, uint8_t *dst, const uint8_t *src, int w, int acc)

  679. {

  680.     if (s->bps <= 8) {

  681.         return s->dsp.add_hfyu_left_prediction(dst, src, w, acc);

  682.     } else {

  683.         //FIXME optimize

  684.         unsigned mask = s->n-1;

  685.         int i;

  686.         const uint16_t *src16 = (const uint16_t *)src;

  687.         uint16_t       *dst16 = (      uint16_t *)dst;

  688. 

  689.         for(i=0; i<w-1; i++){

  690.             acc+= src16[i];

  691.             dst16[i]= acc & mask;

  692.             i++;

  693.             acc+= src16[i];

  694.             dst16[i]= acc & mask;

  695.         }

  696. 

  697.         for(; i<w; i++){

  698.             acc+= src16[i];

  699.             dst16[i]= acc & mask;

  700.         }

  701. 

  702.         return acc;

  703.     }

  704. }

  705. 

  706. static void add_bytes(HYuvContext *s, uint8_t *dst, uint8_t *src, int w)

  707. {

  708.     if (s->bps <= 8) {

  709.         s->dsp.add_bytes(dst, src, w);

  710.     } else {

  711.         //FIXME optimize

  712.         const uint16_t *src16 = (const uint16_t *)src;

  713.         uint16_t       *dst16 = (      uint16_t *)dst;

  714.         long i;

  715.         unsigned long msb = 0x1000100010001ULL << (s->bps-1);

  716.         unsigned long lsb = msb - 0x1000100010001ULL;

  717.         unsigned long mask = lsb + msb;

  718.         for (i = 0; i <= w - (int)sizeof(long)/2; i += sizeof(long)/2) {

  719.             long a = *(long*)(src16+i);

  720.             long b = *(long*)(dst16+i);

  721.             *(long*)(dst16+i) = ((a&lsb) + (b&lsb)) ^ ((a^b)&msb);

  722.         }

  723.         for(; i<w; i++)

  724.             dst16[i] = (dst16[i] + src16[i]) & mask;

  725.     }

  726. }

  727. 

  728. static void add_median_prediction(HYuvContext *s, uint8_t *dst, const uint8_t *src, const uint8_t *diff, int w, int *left, int *left_top)

  729. {

  730.     if (s->bps <= 8) {

  731.         s->dsp.add_hfyu_median_prediction(dst, src, diff, w, left, left_top);

  732.     } else {

  733.         //FIXME optimize

  734.         unsigned mask = s->n-1;

  735.         int i;

  736.         uint16_t l, lt;

  737.         const uint16_t *src16  = (const uint16_t *)src;

  738.         const uint16_t *diff16 = (const uint16_t *)diff;

  739.         uint16_t       *dst16  = (      uint16_t *)dst;

  740. 

  741.         l  = *left;

  742.         lt = *left_top;

  743. 

  744.         for(i=0; i<w; i++){

  745.             l  = (mid_pred(l, src16[i], (l + src16[i] - lt) & mask) + diff16[i]) & mask;

  746.             lt = src16[i];

  747.             dst16[i] = l;

  748.         }

  749. 

  750.         *left     = l;

  751.         *left_top = lt;

  752.     }

  753. }

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

  755.                         AVPacket *avpkt)

  756. {

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

  758.     int buf_size = avpkt->size;

  759.     HYuvContext *s = avctx->priv_data;

  760.     const int width = s->width;

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

  762.     const int height = s->height;

  763.     int fake_ystride, fake_ustride, fake_vstride;

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

  765.     AVFrame * const p = data;

  766.     int table_size = 0, ret;

  767. 

  768.     av_fast_padded_malloc(&s->bitstream_buffer,

  769.                    &s->bitstream_buffer_size,

  770.                    buf_size);

  771.     if (!s->bitstream_buffer)

  772.         return AVERROR(ENOMEM);

  773. 

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

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

  776. 

  777.     if ((ret = ff_thread_get_buffer(avctx, &frame, 0)) < 0)

  778.         return ret;

  779. 

  780.     if (s->context) {

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

  782.         if (table_size < 0)

  783.             return AVERROR_INVALIDDATA;

  784.     }

  785. 

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

  787.         return AVERROR_INVALIDDATA;

  788. 

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

  790.                   (buf_size-table_size) * 8);

  791. 

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

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

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

  795. 

  796.     s->last_slice_end = 0;

  797. 

  798.     if (s->version > 2) {

  799.         int plane;

  800.         for(plane = 0; plane < 1 + 2*s->chroma + s->alpha; plane++) {

  801.             int left, lefttop, y;

  802.             int w = width;

  803.             int h = height;

  804.             int fake_stride = fake_ystride;

  805. 

  806.             if (s->chroma && (plane == 1 || plane == 2)) {

  807.                 w >>= s->chroma_h_shift;

  808.                 h >>= s->chroma_v_shift;

  809.                 fake_stride = plane == 1 ? fake_ustride : fake_vstride;

  810.             }

  811. 

  812.             switch (s->predictor) {

  813.             case LEFT:

  814.             case PLANE:

  815.                 decode_plane_bitstream(s, w, plane);

  816.                 left = left_prediction(s, p->data[plane], s->temp[0], w, 0);

  817. 

  818.                 for (y = 1; y < h; y++) {

  819.                     uint8_t *dst = p->data[plane] + p->linesize[plane]*y;

  820. 

  821.                     decode_plane_bitstream(s, w, plane);

  822.                     left = left_prediction(s, dst, s->temp[0], w, left);

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

  824.                         if (y > s->interlaced) {

  825.                             add_bytes(s, dst, dst - fake_stride, w);

  826.                         }

  827.                     }

  828.                 }

  829. 

  830.                 break;

  831.             case MEDIAN:

  832.                 decode_plane_bitstream(s, w, plane);

  833.                 left= left_prediction(s, p->data[plane], s->temp[0], w, 0);

  834. 

  835.                 y = 1;

  836. 

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

  838.                 if (s->interlaced) {

  839.                     decode_plane_bitstream(s, w, plane);

  840.                     left = left_prediction(s, p->data[plane] + p->linesize[plane], s->temp[0], w, left);

  841.                     y++;

  842.                 }

  843. 

  844.                 lefttop = p->data[plane][0];

  845.                 decode_plane_bitstream(s, w, plane);

  846.                 add_median_prediction(s, p->data[plane] + fake_stride, p->data[plane], s->temp[0], w, &left, &lefttop);

  847.                 y++;

  848. 

  849.                 for (; y<h; y++) {

  850.                     uint8_t *dst;

  851. 

  852.                     decode_plane_bitstream(s, w, plane);

  853. 

  854.                     dst = p->data[plane] + p->linesize[plane] * y;

  855. 

  856.                     add_median_prediction(s, dst, dst - fake_stride, s->temp[0], w, &left, &lefttop);

  857.                 }

  858. 

  859.                 break;

  860.             }

  861.         }

  862.         draw_slice(s, p, height);

  863.     } else if (s->bitstream_bpp < 24) {

  864.         int y, cy;

  865.         int lefty, leftu, leftv;

  866.         int lefttopy, lefttopu, lefttopv;

  867. 

  868.         if (s->yuy2) {

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

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

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

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

  873. 

  874.             av_log(avctx, AV_LOG_ERROR,

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

  876.             return AVERROR_PATCHWELCOME;

  877.         } else {

  878. 

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

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

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

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

  883. 

  884.             switch (s->predictor) {

  885.             case LEFT:

  886.             case PLANE:

  887.                 decode_422_bitstream(s, width-2);

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

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

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

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

  892.                 }

  893. 

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

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

  896. 

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

  898.                         decode_gray_bitstream(s, width);

  899. 

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

  901. 

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

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

  904.                             if (y > s->interlaced)

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

  906.                         }

  907.                         y++;

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

  909.                     }

  910. 

  911.                     draw_slice(s, p, y);

  912. 

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

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

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

  916. 

  917.                     decode_422_bitstream(s, width);

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

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

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

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

  922.                     }

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

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

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

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

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

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

  929.                             }

  930.                         }

  931.                     }

  932.                 }

  933.                 draw_slice(s, p, height);

  934. 

  935.                 break;

  936.             case MEDIAN:

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

  938.                 decode_422_bitstream(s, width - 2);

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

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

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

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

  943.                 }

  944. 

  945.                 cy = y = 1;

  946. 

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

  948.                 if (s->interlaced) {

  949.                     decode_422_bitstream(s, width);

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

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

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

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

  954.                     }

  955.                     y++; cy++;

  956.                 }

  957. 

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

  959.                 decode_422_bitstream(s, 4);

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

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

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

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

  964.                 }

  965. 

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

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

  968.                 decode_422_bitstream(s, width - 4);

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

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

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

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

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

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

  975.                 }

  976.                 y++; cy++;

  977. 

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

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

  980. 

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

  982.                         while (2 * cy > y) {

  983.                             decode_gray_bitstream(s, width);

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

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

  986.                             y++;

  987.                         }

  988.                         if (y >= height) break;

  989.                     }

  990.                     draw_slice(s, p, y);

  991. 

  992.                     decode_422_bitstream(s, width);

  993. 

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

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

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

  997. 

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

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

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

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

  1002.                     }

  1003.                 }

  1004. 

  1005.                 draw_slice(s, p, height);

  1006.                 break;

  1007.             }

  1008.         }

  1009.     } else {

  1010.         int y;

  1011.         int leftr, leftg, leftb, lefta;

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

  1013. 

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

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

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

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

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

  1019.         } else {

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

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

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

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

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

  1025.         }

  1026. 

  1027.         if (s->bgr32) {

  1028.             switch (s->predictor) {

  1029.             case LEFT:

  1030.             case PLANE:

  1031.                 decode_bgr_bitstream(s, width - 1);

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

  1033. 

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

  1035.                     decode_bgr_bitstream(s, width);

  1036. 

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

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

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

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

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

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

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

  1044.                                              fake_ystride, fake_ystride);

  1045.                         }

  1046.                     }

  1047.                 }

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

  1049.                 draw_slice(s, p, height);

  1050.                 break;

  1051.             default:

  1052.                 av_log(avctx, AV_LOG_ERROR,

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

  1054.             }

  1055.         }else{

  1056.             av_log(avctx, AV_LOG_ERROR,

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

  1058.             return AVERROR_PATCHWELCOME;

  1059.         }

  1060.     }

  1061.     emms_c();

  1062. 

  1063.     *got_frame = 1;

  1064. 

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

  1066. }

  1067. 

  1068. static av_cold int decode_end(AVCodecContext *avctx)

  1069. {

  1070.     HYuvContext *s = avctx->priv_data;

  1071.     int i;

  1072. 

  1073.     ff_huffyuv_common_end(s);

  1074.     av_freep(&s->bitstream_buffer);

  1075. 

  1076.     for (i = 0; i < 8; i++) {

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

  1078.     }

  1079. 

  1080.     return 0;

  1081. }

  1082. 

  1083. #if CONFIG_HUFFYUV_DECODER

  1084. AVCodec ff_huffyuv_decoder = {

  1085.     .name             = "huffyuv",

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

  1087.     .type             = AVMEDIA_TYPE_VIDEO,

  1088.     .id               = AV_CODEC_ID_HUFFYUV,

  1089.     .priv_data_size   = sizeof(HYuvContext),

  1090.     .init             = decode_init,

  1091.     .close            = decode_end,

  1092.     .decode           = decode_frame,

  1093.     .capabilities     = CODEC_CAP_DR1 | CODEC_CAP_DRAW_HORIZ_BAND |

  1094.                         CODEC_CAP_FRAME_THREADS,

  1095.     .init_thread_copy = ONLY_IF_THREADS_ENABLED(decode_init_thread_copy),

  1096. };

  1097. #endif

  1098. 

  1099. #if CONFIG_FFVHUFF_DECODER

  1100. AVCodec ff_ffvhuff_decoder = {

  1101.     .name             = "ffvhuff",

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

  1103.     .type             = AVMEDIA_TYPE_VIDEO,

  1104.     .id               = AV_CODEC_ID_FFVHUFF,

  1105.     .priv_data_size   = sizeof(HYuvContext),

  1106.     .init             = decode_init,

  1107.     .close            = decode_end,

  1108.     .decode           = decode_frame,

  1109.     .capabilities     = CODEC_CAP_DR1 | CODEC_CAP_DRAW_HORIZ_BAND |

  1110.                         CODEC_CAP_FRAME_THREADS,

  1111.     .init_thread_copy = ONLY_IF_THREADS_ENABLED(decode_init_thread_copy),

  1112. };

  1113. #endif