50 const uint8_t *val_table,
int nb_codes,
51 int use_static,
int is_ac)
54 uint16_t huff_code[256];
55 uint16_t huff_sym[256];
62 for (i = 0; i < 256; i++)
63 huff_sym[i] = i + 16 * is_ac;
66 huff_sym[0] = 16 * 256;
69 huff_code, 2, 2, huff_sym, 2, 2, use_static);
91 if (len > 14 && buf[12] == 1)
93 if (len > 14 && buf[12] == 2)
139 "error using external huffman table, switching back to internal\n");
182 for (i = 0; i < 64; i++) {
192 len -= 1 + 64 * (1+pr);
217 for (i = 1; i <= 16; i++) {
222 if (len < n || n > 256)
226 for (i = 0; i <
n; i++) {
237 class, index, code_max + 1);
238 if ((ret =
build_vlc(&s->
vlcs[
class][index], bits_table, val_table,
239 code_max + 1, 0,
class > 0)) < 0)
244 if ((ret =
build_vlc(&s->
vlcs[2][index], bits_table, val_table,
245 code_max + 1, 0, 0)) < 0)
266 if (bits > 16 || bits < 1) {
301 if (nb_components <= 0 ||
307 "nb_components changing in interlaced picture\n");
311 if (s->
ls && !(bits <= 8 || nb_components == 1)) {
313 "JPEG-LS that is not <= 8 "
314 "bits/component or 16-bit gray");
320 for (i = 0; i < nb_components; i++) {
326 if (h_count[i] > s->
h_max)
327 s->
h_max = h_count[i];
328 if (v_count[i] > s->
v_max)
329 s->
v_max = v_count[i];
335 if (!h_count[i] || !v_count[i]) {
337 "Invalid sampling factor in component %d %d:%d\n",
338 i, h_count[i], v_count[i]);
343 i, h_count[i], v_count[i],
355 memcmp(s->
h_count, h_count,
sizeof(h_count)) ||
356 memcmp(s->
v_count, v_count,
sizeof(v_count))) {
361 memcpy(s->
h_count, h_count,
sizeof(h_count));
362 memcpy(s->
v_count, v_count,
sizeof(v_count));
390 if (s->
v_max == 1 && s->
h_max == 1 && s->
lossless==1 && (nb_components==3 || nb_components==4))
395 pix_fmt_id = ((unsigned)s->
h_count[0] << 28) | (s->
v_count[0] << 24) |
402 if (!(pix_fmt_id & 0xD0D0D0D0))
403 pix_fmt_id -= (pix_fmt_id & 0xF0F0F0F0) >> 1;
404 if (!(pix_fmt_id & 0x0D0D0D0D))
405 pix_fmt_id -= (pix_fmt_id & 0x0F0F0F0F) >> 1;
407 for (i = 0; i < 8; i++) {
408 int j = 6 + (i&1) - (i&6);
409 int is = (pix_fmt_id >> (4*i)) & 0xF;
410 int js = (pix_fmt_id >> (4*j)) & 0xF;
412 if (is == 1 && js != 2 && (i < 2 || i > 5))
413 js = (pix_fmt_id >> ( 8 + 4*(i&1))) & 0xF;
414 if (is == 1 && js != 2 && (i < 2 || i > 5))
415 js = (pix_fmt_id >> (16 + 4*(i&1))) & 0xF;
417 if (is == 1 && js == 2) {
423 switch (pix_fmt_id) {
511 if (pix_fmt_id == 0x14111100)
544 if (pix_fmt_id == 0x42111100) {
548 }
else if (pix_fmt_id == 0x24111100) {
579 else if (s->
bits <= 8)
598 for (i = 0; i < 4; i++)
605 if (len != (8 + (3 * nb_components)))
617 int bw = (width + s->
h_max * 8 - 1) / (s->
h_max * 8);
618 int bh = (height + s->
v_max * 8 - 1) / (s->
v_max * 8);
638 if (code < 0 || code > 16) {
640 "mjpeg_decode_dc: bad vlc: %d:%d (%p)\n",
641 0, dc_index, &s->
vlcs[0][dc_index]);
653 int dc_index,
int ac_index, int16_t *quant_matrix)
659 if (val == 0xfffff) {
663 val = val * quant_matrix[0] + s->
last_dc[component];
673 i += ((unsigned)code) >> 4;
681 int sign = (~cache) >> 31;
682 level = (
NEG_USR32(sign ^ cache,code) ^ sign) - sign;
692 block[j] = level * quant_matrix[j];
701 int component,
int dc_index,
702 int16_t *quant_matrix,
int Al)
707 if (val == 0xfffff) {
711 val = (val * quant_matrix[0] << Al) + s->
last_dc[component];
719 uint8_t *last_nnz,
int ac_index,
720 int16_t *quant_matrix,
721 int ss,
int se,
int Al,
int *EOBRUN)
732 for (i = ss; ; i++) {
736 run = ((unsigned) code) >> 4;
745 int sign = (~cache) >> 31;
746 level = (
NEG_USR32(sign ^ cache,code) ^ sign) - sign;
754 block[j] = level * quant_matrix[j] << Al;
761 block[j] = level * quant_matrix[j] << Al;
790 #define REFINE_BIT(j) { \
791 UPDATE_CACHE(re, &s->gb); \
792 sign = block[j] >> 15; \
793 block[j] += SHOW_UBITS(re, &s->gb, 1) * \
794 ((quant_matrix[j] ^ sign) - sign) << Al; \
795 LAST_SKIP_BITS(re, &s->gb, 1); \
803 av_log(s->avctx, AV_LOG_ERROR, "error count: %d\n", i); \
808 j = s->scantable.permutated[i]; \
811 else if (run-- == 0) \
818 int ac_index, int16_t *quant_matrix,
819 int ss,
int se,
int Al,
int *EOBRUN)
821 int code, i = ss, j, sign,
val,
run;
822 int last =
FFMIN(se, *last_nnz);
833 run = ((unsigned) code) >> 4;
840 block[j] = ((quant_matrix[j]^
val) - val) << Al;
848 run = ((unsigned) code) >> 4;
869 for (; i <= last; i++) {
890 for (i = 0; i < nb_components; i++)
904 for (i = 0; i < nb_components; i++)
919 int left[4], top[4], topleft[4];
920 const int linesize = s->
linesize[0];
921 const int mask = ((1 << s->
bits) - 1) << point_transform;
937 for (i = 0; i < 4; i++)
940 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
944 ptr += linesize >> 1;
946 for (i = 0; i < 4; i++)
947 top[i] = left[i] = topleft[i] =
buffer[0][i];
949 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
957 top[i] = left[i]= topleft[i]= 1 << (s->
bits - 1);
959 if (mb_y == resync_mb_y || mb_y == resync_mb_y+1 && mb_x < resync_mb_x || !mb_x)
960 modified_predictor = 1;
962 for (i=0;i<nb_components;i++) {
968 PREDICT(pred, topleft[i], top[i], left[i], modified_predictor);
974 left[i] =
buffer[mb_x][i] =
975 mask & (pred + (dc * (1 << point_transform)));
984 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
985 ptr[4*mb_x + 2] =
buffer[mb_x][0] - ((
buffer[mb_x][1] +
buffer[mb_x][2] - 0x200) >> 2);
986 ptr[4*mb_x + 1] =
buffer[mb_x][1] + ptr[4*mb_x + 2];
987 ptr[4*mb_x + 3] =
buffer[mb_x][2] + ptr[4*mb_x + 2];
988 ptr[4*mb_x + 0] =
buffer[mb_x][3];
991 for(i=0; i<nb_components; i++) {
994 for(mb_x = 0; mb_x < s->
mb_width; mb_x++) {
995 ptr[4*mb_x+3-
c] =
buffer[mb_x][i];
997 }
else if(s->
bits == 9) {
1000 for(mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1001 ((uint16_t*)ptr)[4*mb_x+
c] =
buffer[mb_x][i];
1005 }
else if (s->
rct) {
1006 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1007 ptr[3*mb_x + 1] =
buffer[mb_x][0] - ((
buffer[mb_x][1] +
buffer[mb_x][2] - 0x200) >> 2);
1008 ptr[3*mb_x + 0] =
buffer[mb_x][1] + ptr[3*mb_x + 1];
1009 ptr[3*mb_x + 2] =
buffer[mb_x][2] + ptr[3*mb_x + 1];
1012 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1014 ptr[3*mb_x + 0] =
buffer[mb_x][1] + ptr[3*mb_x + 1];
1015 ptr[3*mb_x + 2] =
buffer[mb_x][2] + ptr[3*mb_x + 1];
1018 for(i=0; i<nb_components; i++) {
1021 for(mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1022 ptr[3*mb_x+2-
c] =
buffer[mb_x][i];
1024 }
else if(s->
bits == 9) {
1027 for(mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1028 ((uint16_t*)ptr)[3*mb_x+2-
c] =
buffer[mb_x][i];
1038 int point_transform,
int nb_components)
1040 int i, mb_x, mb_y,
mask;
1042 int resync_mb_y = 0;
1043 int resync_mb_x = 0;
1045 point_transform += bits - s->
bits;
1046 mask = ((1 << s->
bits) - 1) << point_transform;
1048 av_assert0(nb_components>=1 && nb_components<=4);
1050 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
1051 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1058 if(!mb_x || mb_y == resync_mb_y || mb_y == resync_mb_y+1 && mb_x < resync_mb_x || s->
interlaced){
1059 int toprow = mb_y == resync_mb_y || mb_y == resync_mb_y+1 && mb_x < resync_mb_x;
1060 int leftcol = !mb_x || mb_y == resync_mb_y && mb_x == resync_mb_x;
1061 for (i = 0; i < nb_components; i++) {
1064 int n, h,
v, x,
y,
c, j, linesize;
1073 if(bits>8) linesize /= 2;
1075 for(j=0; j<
n; j++) {
1081 if ( h * mb_x + x >= s->
width
1082 || v * mb_y + y >= s->
height) {
1084 }
else if (bits<=8) {
1087 if(x==0 && leftcol){
1088 pred= 1 << (bits - 1);
1093 if(x==0 && leftcol){
1094 pred= ptr[-linesize];
1096 PREDICT(pred, ptr[-linesize-1], ptr[-linesize], ptr[-1], predictor);
1101 ptr += linesize >> 1;
1103 *ptr= pred + (dc << point_transform);
1105 ptr16 = (uint16_t*)(s->
picture_ptr->
data[c] + 2*(linesize * (v * mb_y + y)) + 2*(h * mb_x + x));
1107 if(x==0 && leftcol){
1108 pred= 1 << (bits - 1);
1113 if(x==0 && leftcol){
1114 pred= ptr16[-linesize];
1116 PREDICT(pred, ptr16[-linesize-1], ptr16[-linesize], ptr16[-1], predictor);
1121 ptr16 += linesize >> 1;
1123 *ptr16= pred + (dc << point_transform);
1132 for (i = 0; i < nb_components; i++) {
1135 int n, h,
v, x,
y,
c, j, linesize,
dc;
1144 if(bits>8) linesize /= 2;
1146 for (j = 0; j <
n; j++) {
1152 if ( h * mb_x + x >= s->
width
1153 || v * mb_y + y >= s->
height) {
1155 }
else if (bits<=8) {
1157 (linesize * (v * mb_y +
y)) +
1159 PREDICT(pred, ptr[-linesize-1], ptr[-linesize], ptr[-1], predictor);
1162 *ptr = pred + (dc << point_transform);
1164 ptr16 = (uint16_t*)(s->
picture_ptr->
data[c] + 2*(linesize * (v * mb_y + y)) + 2*(h * mb_x + x));
1165 PREDICT(pred, ptr16[-linesize-1], ptr16[-linesize], ptr16[-1], predictor);
1168 *ptr16= pred + (dc << point_transform);
1189 int linesize,
int lowres)
1194 case 1:
copy_block4(dst, src, linesize, linesize, 4);
1196 case 2:
copy_block2(dst, src, linesize, linesize, 2);
1198 case 3: *dst = *
src;
1205 int block_x, block_y;
1208 for (block_y=0; block_y<
size; block_y++)
1209 for (block_x=0; block_x<
size; block_x++)
1210 *(uint16_t*)(ptr + 2*block_x + block_y*linesize) <<= 16 - s->
bits;
1212 for (block_y=0; block_y<
size; block_y++)
1213 for (block_x=0; block_x<
size; block_x++)
1214 *(ptr + block_x + block_y*linesize) <<= 8 - s->
bits;
1219 int Al,
const uint8_t *mb_bitmask,
1220 int mb_bitmask_size,
1223 int i, mb_x, mb_y, chroma_h_shift, chroma_v_shift, chroma_width, chroma_height;
1228 int bytes_per_pixel = 1 + (s->
bits > 8);
1245 for (i = 0; i < nb_components; i++) {
1248 reference_data[
c] = reference ? reference->
data[
c] :
NULL;
1253 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
1254 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1265 for (i = 0; i < nb_components; i++) {
1267 int n, h,
v, x,
y,
c, j;
1275 for (j = 0; j <
n; j++) {
1276 block_offset = (((linesize[
c] * (v * mb_y +
y) * 8) +
1277 (h * mb_x + x) * 8 * bytes_per_pixel) >> s->
avctx->
lowres);
1280 block_offset += linesize[
c] >> 1;
1281 if ( 8*(h * mb_x + x) < ((c == 1) || (c == 2) ? chroma_width : s->
width)
1282 && 8*(v * mb_y + y) < ((c == 1) || (c == 2) ? chroma_height : s->
height)) {
1283 ptr = data[
c] + block_offset;
1298 "error y=%d x=%d\n", mb_y, mb_x);
1318 "error y=%d x=%d\n", mb_y, mb_x);
1322 av_dlog(s->
avctx,
"mb: %d %d processed\n", mb_y, mb_x);
1325 (v * mb_y + y) * 8, (h * mb_x + x) * 8);
1340 int se,
int Ah,
int Al)
1348 if (se < ss || se > 63) {
1359 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
1363 for (mb_x = 0; mb_x < s->
mb_width; mb_x++,
block++, last_nnz++) {
1370 quant_matrix, ss, se, Al, &EOBRUN);
1373 quant_matrix, ss, se, Al, &EOBRUN);
1376 "error y=%d x=%d\n", mb_y, mb_x);
1391 const int bytes_per_pixel = 1 + (s->
bits > 8);
1392 const int block_size = s->
lossless ? 1 : 8;
1399 int mb_width = (s->
width + h * block_size - 1) / (h * block_size);
1400 int mb_height = (s->
height + v * block_size - 1) / (v * block_size);
1406 data += linesize >> 1;
1408 for (mb_y = 0; mb_y < mb_height; mb_y++) {
1412 for (mb_x = 0; mb_x < mb_width; mb_x++,
block++) {
1423 int mb_bitmask_size,
const AVFrame *reference)
1425 int len, nb_components, i, h,
v,
predictor, point_transform;
1427 const int block_size = s->
lossless ? 1 : 8;
1428 int ilv, prev_shift;
1432 "Can not process SOS before SOF, skipping\n");
1442 "decode_sos: nb_components (%d) unsupported\n", nb_components);
1445 if (len != 6 + 2 * nb_components) {
1449 for (i = 0; i < nb_components; i++) {
1458 "decode_sos: index(%d) out of components\n", index);
1474 index = (index+2)%3;
1494 prev_shift = point_transform = 0;
1496 if (nb_components > 1) {
1500 }
else if (!s->
ls) {
1503 s->
mb_width = (s->
width + h * block_size - 1) / (h * block_size);
1512 s->
lossless ?
"lossless" :
"sequential DCT", s->
rgb ?
"RGB" :
"",
1522 for (i = 0; i < nb_components; i++)
1532 point_transform, ilv)) < 0)
1541 nb_components)) < 0)
1550 point_transform)) < 0)
1554 prev_shift, point_transform,
1555 mb_bitmask, mb_bitmask_size, reference)) < 0)
1639 int t_w, t_h, v1, v2;
1651 "mjpeg: JFIF header found (version: %x.%x) SAR=%d/%d\n",
1660 if (len -10 - (t_w * t_h * 3) > 0)
1661 len -= t_w * t_h * 3;
1683 "Pegasus lossless jpeg header found\n");
1713 if (
id ==
AV_RL32(
"colr") && len > 0) {
1720 if (
id ==
AV_RL32(
"xfrm") && len > 0) {
1748 }
else if (type == 1) {
1760 if (!(flags & 0x04)) {
1770 int ret,
le, ifd_offset, bytes_read;
1827 "mjpeg: error, decode_app parser read over the end\n");
1841 for (i = 0; i < len - 2; i++)
1843 if (i > 0 && cbuf[i - 1] ==
'\n')
1852 if (!strncmp(cbuf,
"AVID", 4)) {
1854 }
else if (!strcmp(cbuf,
"CS=ITU601"))
1856 else if ((!strncmp(cbuf,
"Intel(R) JPEG Library, version 1", 32) && s->
avctx->
codec_tag) ||
1857 (!strncmp(cbuf,
"Metasoft MJPEG Codec", 20)))
1876 buf_ptr = *pbuf_ptr;
1877 while (buf_end - buf_ptr > 1) {
1880 if ((v == 0xff) && (v2 >= 0xc0) && (v2 <= 0xfe) && buf_ptr < buf_end) {
1889 av_dlog(
NULL,
"find_marker skipped %d bytes\n", skipped);
1890 *pbuf_ptr = buf_ptr;
1896 const uint8_t **unescaped_buf_ptr,
1897 int *unescaped_buf_size)
1907 if (start_code ==
SOS && !s->
ls) {
1911 while (src < buf_end) {
1917 while (src < buf_end && x == 0xff)
1920 if (x >= 0xd0 && x <= 0xd7)
1927 *unescaped_buf_ptr = s->
buffer;
1928 *unescaped_buf_size = dst - s->
buffer;
1929 memset(s->
buffer + *unescaped_buf_size, 0,
1933 (buf_end - *buf_ptr) - (dst - s->
buffer));
1934 }
else if (start_code ==
SOS && s->
ls) {
1942 while (src + t < buf_end) {
1945 while ((src + t < buf_end) && x == 0xff)
1960 if (x == 0xFF &&
b < t) {
1972 *unescaped_buf_ptr = dst;
1973 *unescaped_buf_size = (bit_count + 7) >> 3;
1974 memset(s->
buffer + *unescaped_buf_size, 0,
1977 *unescaped_buf_ptr = *buf_ptr;
1978 *unescaped_buf_size = buf_end - *buf_ptr;
1989 int buf_size = avpkt->
size;
1991 const uint8_t *buf_end, *buf_ptr;
1992 const uint8_t *unescaped_buf_ptr;
1994 int unescaped_buf_size;
2005 buf_end = buf + buf_size;
2006 while (buf_ptr < buf_end) {
2010 &unescaped_buf_size);
2012 if (start_code < 0) {
2014 }
else if (unescaped_buf_size > INT_MAX / 8) {
2016 "MJPEG packet 0x%x too big (%d/%d), corrupt data?\n",
2017 start_code, unescaped_buf_size, buf_size);
2021 start_code, buf_end - buf_ptr);
2035 if (start_code >= 0xd0 && start_code <= 0xd7)
2037 "restart marker: %d\n", start_code & 0x0f);
2039 else if (start_code >=
APP0 && start_code <=
APP15)
2042 else if (start_code ==
COM)
2048 (start_code ==
SOF48 || start_code ==
LSE)) {
2053 switch (start_code) {
2109 "Found EOI before any SOF, ignoring\n");
2127 int qpw = (s->
width + 15) / 16;
2130 memset(qp_table_buf->
data, qp, qpw);
2159 "mjpeg: unsupported coding type (%x)\n", start_code);
2166 "marker parser used %d bytes (%d bits)\n",
2198 for (p = 0; p<4; p++) {
2211 for (i = 0; i < h; i++) {
2212 if (is16bit) ((uint16_t*)line)[w - 1] = ((uint16_t*)line)[(w - 1) / 2];
2213 else line[w - 1] = line[(w - 1) / 2];
2214 for (index = w - 2; index > 0; index--) {
2216 ((uint16_t*)line)[
index] = (((uint16_t*)line)[index / 2] + ((uint16_t*)line)[(index + 1) / 2]) >> 1;
2218 line[
index] = (line[index / 2] + line[(index + 1) / 2]) >> 1;
2241 for (p = 0; p < 4; p++) {
2252 for (i = h - 1; i; i--) {
2255 if (src1 == src2 || i == h - 1) {
2256 memcpy(dst, src1, w);
2258 for (index = 0; index < w; index++)
2259 dst[index] = (src1[index] + src2[index]) >> 1;
2268 for (index=0; index<4; index++) {
2272 if(index && index<3){
2278 for (i=0; i<h/2; i++) {
2280 FFSWAP(
int, dst[j], dst2[j]);
2290 for (i=0; i<h; i++) {
2293 for (index=0; index<4; index++) {
2297 for (j=0; j<w; j++) {
2299 int r = dst[0][j] * k;
2300 int g = dst[1][j] * k;
2301 int b = dst[2][j] * k;
2302 dst[0][j] = g*257 >> 16;
2303 dst[1][j] = b*257 >> 16;
2304 dst[2][j] = r*257 >> 16;
2312 for (i=0; i<h; i++) {
2315 for (index=0; index<4; index++) {
2319 for (j=0; j<w; j++) {
2321 int r = (255 - dst[0][j]) * k;
2322 int g = (128 - dst[1][j]) * k;
2323 int b = (128 - dst[2][j]) * k;
2324 dst[0][j] = r*257 >> 16;
2325 dst[1][j] = (g*257 >> 16) + 128;
2326 dst[2][j] = (b*257 >> 16) + 128;
2347 return buf_ptr -
buf;
2370 for (i = 0; i < 3; i++) {
2371 for (j = 0; j < 4; j++)
2388 #if CONFIG_MJPEG_DECODER
2389 #define OFFSET(x) offsetof(MJpegDecodeContext, x)
2390 #define VD AV_OPT_FLAG_VIDEO_PARAM | AV_OPT_FLAG_DECODING_PARAM
2392 {
"extern_huff",
"Use external huffman table.",
2397 static const AVClass mjpegdec_class = {
2416 .priv_class = &mjpegdec_class,
2419 #if CONFIG_THP_DECODER