Go to the documentation of this file.
47 #define EPIC_PIX_STACK_SIZE 1024
48 #define EPIC_PIX_STACK_MAX (EPIC_PIX_STACK_SIZE - 1)
66 8, 6, 6, 7, 6, 5, 8, 7,
67 7, 7, 9, 9, 8, 10, 12, 20,
68 13, 12, 11, 11, 12, 25, 18, 19,
69 15, 20, 29, 26, 31, 30, 29, 26,
70 28, 28, 32, 36, 46, 39, 32, 34,
71 44, 35, 28, 28, 40, 55, 41, 44,
72 48, 49, 52, 52, 52, 31, 39, 57,
73 61, 56, 50, 60, 46, 51, 52, 50,
77 9, 9, 9, 12, 11, 12, 24, 13,
78 13, 24, 50, 33, 28, 33, 50, 50,
79 50, 50, 50, 50, 50, 50, 50, 50,
80 50, 50, 50, 50, 50, 50, 50, 50,
81 50, 50, 50, 50, 50, 50, 50, 50,
82 50, 50, 50, 50, 50, 50, 50, 50,
83 50, 50, 50, 50, 50, 50, 50, 50,
84 50, 50, 50, 50, 50, 50, 50, 50,
98 #define EPIC_HASH_SIZE 256
190 c->idsp.idct_permutation);
199 for (
i = 0;
i < 2;
i++) {
208 uint8_t *
dst,
int *dst_size)
210 const uint8_t *src_end =
src + src_size;
211 uint8_t *dst_start =
dst;
213 while (
src < src_end) {
218 if (x == 0xFF && !*
src)
221 *dst_size =
dst - dst_start;
225 int plane, int16_t *
block)
228 const int is_chroma = !!plane;
234 c->bdsp.clear_block(
block);
235 dc =
get_vlc2(gb,
c->dc_vlc[is_chroma].table, 9, 2);
240 dc =
dc * qmat[0] +
c->prev_dc[plane];
242 c->prev_dc[plane] =
dc;
272 const uint8_t *
src,
int src_size,
273 uint8_t *
dst,
int dst_stride,
274 const uint8_t *
mask,
int mask_stride,
int num_mbs,
278 int mb_w, mb_h, mb_x, mb_y,
i, j;
282 const int ridx = swapuv ? 2 : 0;
294 mb_h = (
height + 15) >> 4;
297 num_mbs = mb_w * mb_h * 4;
299 for (
i = 0;
i < 3;
i++)
300 c->prev_dc[
i] = 1024;
303 c->bdsp.clear_blocks(
c->block[0]);
304 for (mb_y = 0; mb_y < mb_h; mb_y++) {
305 for (mb_x = 0; mb_x < mb_w; mb_x++) {
307 !
mask[mb_x * 2 + mask_stride] &&
308 !
mask[mb_x * 2 + 1 + mask_stride]) {
312 for (j = 0; j < 2; j++) {
313 for (
i = 0;
i < 2;
i++) {
314 if (
mask && !
mask[mb_x * 2 +
i + j * mask_stride])
318 c->block[
i + j * 2])) != 0)
320 c->idsp.idct(
c->block[
i + j * 2]);
323 for (
i = 1;
i < 3;
i++) {
326 c->idsp.idct(
c->block[
i + 3]);
329 for (j = 0; j < 16; j++) {
330 uint8_t *
out =
dst + bx * 3 + (by + j) * dst_stride;
331 for (
i = 0;
i < 16;
i++) {
334 Y =
c->block[(j >> 3) * 2 + (
i >> 3)][(
i & 7) + (j & 7) * 8];
335 U =
c->block[4][(
i >> 1) + (j >> 1) * 8] - 128;
336 V =
c->block[5][(
i >> 1) + (j >> 1) * 8] - 128;
348 mask += mask_stride * 2;
354 #define LOAD_NEIGHBOURS(x) \
355 W = curr_row[(x) - 1]; \
356 N = above_row[(x)]; \
357 WW = curr_row[(x) - 2]; \
358 NW = above_row[(x) - 1]; \
359 NE = above_row[(x) + 1]; \
360 NN = above2_row[(x)]; \
361 NNW = above2_row[(x) - 1]; \
362 NWW = above_row[(x) - 2]; \
363 NNE = above2_row[(x) + 1]
365 #define UPDATE_NEIGHBOURS(x) \
371 NE = above_row[(x) + 1]; \
372 NNE = above2_row[(x) + 1]
383 h = (
h * 33) ^ ((
key >> 24) & 0xFF);
384 h = (
h * 33) ^ ((
key >> 16) & 0xFF);
385 h = (
h * 33) ^ ((
key >> 8) & 0xFF);
386 h = (
h * 33) ^ (
key & 0xFF);
401 for (
i = 0;
i <
hash->bucket_fill[idx];
i++)
413 if (
hash->bucket_size[idx] > INT_MAX /
sizeof(**
hash->bucket))
416 if (!(
hash->bucket_fill[idx] <
hash->bucket_size[idx])) {
417 int new_size =
hash->bucket_size[idx] + 16;
422 hash->bucket_size[idx] = new_size;
425 ret = &
hash->bucket[idx][
hash->bucket_fill[idx]++];
426 memset(
ret, 0,
sizeof(*
ret));
447 hash_elem->
list = new_elem;
468 for (j = 0; j <
hash->bucket_fill[
i]; j++) {
477 hash->bucket_size[
i] =
478 hash->bucket_fill[
i] = 0;
487 for (
i = 0;
i < n;
i++)
494 #define TOSIGNED(val) (((val) >> 1) ^ -((val) & 1))
497 int N,
int W,
int NW)
504 const uint32_t *curr_row,
505 const uint32_t *above_row)
509 int GN, GW, GNW,
R,
G,
B;
514 NW = above_row[x - 1];
525 ((NW >>
R_shift) & 0xFF) - GNW);
530 ((NW >>
B_shift) & 0xFF) - GNW);
533 pred = curr_row[x - 1];
547 if (
R<0 ||
G<0 || B<0 || R > 255 ||
G > 255 ||
B > 255) {
556 uint32_t *pPix, uint32_t
pix)
567 const uint32_t *curr_row,
568 const uint32_t *above_row, uint32_t *pPix)
581 pix = curr_row[x - 1];
588 if (!
dc->stack_pos ||
dc->stack[0] !=
pix) {
598 const uint32_t *curr_row,
599 const uint32_t *above_row,
600 const uint32_t *above2_row,
601 uint32_t *pPix,
int *pRun)
603 int idx, got_pixel = 0, WWneW, old_WWneW = 0;
604 uint32_t
W, WW,
N,
NN, NW, NE, NWW, NNW, NNE;
610 if (
dc->next_run_pos == x) {
614 idx = (WW !=
W) << 7 |
639 NWneW = *pRun ? NWneW : NW !=
W;
642 switch (((NW !=
N) << 2) | (NWneW << 1) | WWneW) {
651 (*pRun ? old_WWneW : WW !=
W) << 7 |
676 if (x + *pRun >= tile_width - 1)
681 if (!NWneW && NW ==
N &&
N == NE) {
683 int start_pos = x + *pRun;
686 uint32_t
pix = above_row[start_pos + 1];
687 for (
pos = start_pos + 2;
pos < tile_width;
pos++)
688 if (!(above_row[
pos] ==
pix))
690 run =
pos - start_pos - 1;
701 : &
dc->runlen_zeroes[
pos])) {
709 if (x + *pRun >= tile_width - 1)
728 dc->next_run_pos = x + *pRun;
733 uint32_t *pPix, uint32_t
pix)
744 int tile_width,
const uint32_t *curr_row,
745 const uint32_t *above_row, uint32_t *pPix)
751 uint32_t NW = above_row[x - 1];
760 if (
pos < tile_width - 1 && y) {
761 uint32_t NE = above_row[
pos + 1];
776 if (!hash_elem || !hash_elem->
list)
801 int tile_width,
int stride)
805 uint32_t *curr_row =
NULL, *above_row =
NULL, *above2_row;
807 for (y = 0; y < tile_height; y++,
out +=
stride) {
808 above2_row = above_row;
809 above_row = curr_row;
810 curr_row = (uint32_t *)
out;
812 for (x = 0,
dc->next_run_pos = 0; x < tile_width;) {
816 pix = curr_row[x - 1];
818 if (y >= 1 && x >= 2 &&
819 pix != curr_row[x - 2] &&
pix != above_row[x - 1] &&
820 pix != above_row[x - 2] &&
pix != above_row[x] &&
828 if (y < 2 || x < 2 || x == tile_width - 1) {
840 tile_width, curr_row,
842 uint32_t ref_pix = curr_row[x - 1];
857 for (;
run > 0; x++,
run--)
867 const uint8_t *
src,
size_t src_size,
870 uint8_t prefix,
mask = 0x80;
871 int extrabytes, tile_width, tile_height, awidth, aheight;
881 for (extrabytes = 0; (prefix &
mask) && (extrabytes < 7); extrabytes++)
883 if (extrabytes > 3 || src_size < extrabytes) {
888 els_dsize = prefix & ((0x80 >> extrabytes) - 1);
889 while (extrabytes-- > 0) {
890 els_dsize = (els_dsize << 8) | *
src++;
894 if (src_size < els_dsize) {
896 els_dsize, src_size);
900 tile_width =
FFMIN(
c->width - tile_x *
c->tile_width,
c->tile_width);
901 tile_height =
FFMIN(
c->height - tile_y *
c->tile_height,
c->tile_height);
902 awidth =
FFALIGN(tile_width, 16);
903 aheight =
FFALIGN(tile_height, 16);
912 uint8_t tr_r, tr_g, tr_b, *buf;
915 memset(&
c->ec, 0,
sizeof(
c->ec));
923 if (
c->ec.els_ctx.err != 0) {
925 "ePIC: couldn't decode transparency pixel!\n");
938 "ePIC: tile decoding failed, frame=%"PRId64
", tile_x=%d, tile_y=%d\n",
944 dst =
c->framebuf + tile_x *
c->tile_width * 3 +
945 tile_y *
c->tile_height *
c->framebuf_stride;
947 for (j = 0; j < tile_height; j++) {
949 in = (uint32_t *) buf;
950 for (
i = 0;
i < tile_width;
i++) {
956 buf +=
c->epic_buf_stride;
957 dst +=
c->framebuf_stride;
960 if (src_size > els_dsize) {
963 int bstride =
FFALIGN(tile_width, 16) >> 3;
965 int estride =
c->epic_buf_stride >> 2;
968 src_size -= els_dsize;
970 in = (uint32_t *)
c->epic_buf;
973 memset(
c->kempf_flags, 0,
974 (aheight >> 3) * bstride *
sizeof(*
c->kempf_flags));
975 for (j = 0; j < tile_height; j += 8) {
976 for (
i = 0;
i < tile_width;
i += 8) {
977 c->kempf_flags[(
i >> 3) + (j >> 3) * bstride] = 0;
978 for (k = 0; k < 8 * 8; k++) {
979 if (in[
i + (k & 7) + (k >> 3) * estride] == tr) {
980 c->kempf_flags[(
i >> 3) + (j >> 3) * bstride] = 1;
989 memset(
c->jpeg_tile, 0,
c->tile_stride * aheight);
991 c->jpeg_tile,
c->tile_stride,
992 c->kempf_flags, bstride, nblocks,
c->swapuv);
994 in = (uint32_t *)
c->epic_buf;
995 dst =
c->framebuf + tile_x *
c->tile_width * 3 +
996 tile_y *
c->tile_height *
c->framebuf_stride;
998 for (j = 0; j < tile_height; j++) {
999 for (
i = 0;
i < tile_width;
i++)
1001 memcpy(
dst +
i * 3, jpg +
i * 3, 3);
1002 in +=
c->epic_buf_stride >> 2;
1003 dst +=
c->framebuf_stride;
1004 jpg +=
c->tile_stride;
1008 dst =
c->framebuf + tile_x *
c->tile_width * 3 +
1009 tile_y *
c->tile_height *
c->framebuf_stride;
1011 dst,
c->framebuf_stride,
NULL, 0, 0,
c->swapuv);
1019 const uint8_t *jpeg_tile,
int tile_stride,
1021 const uint8_t *pal,
int npal,
int tidx)
1031 if (npal <= 2) nb = 1;
1032 else if (npal <= 4) nb = 2;
1033 else if (npal <= 16) nb = 4;
1042 memcpy(
dst +
i * 3, pal + col * 3, 3);
1044 memcpy(
dst +
i * 3, jpeg_tile +
i * 3, 3);
1053 const uint8_t *
src,
int src_size)
1056 int hdr, zsize, npal, tidx = -1,
ret;
1057 const uint8_t *src_end =
src + src_size;
1058 uint8_t pal[768], transp[3];
1059 uLongf dlen = (
c->tile_width + 1) *
c->tile_height;
1061 int nblocks, cblocks, bstride;
1062 int bits, bitbuf, coded;
1063 uint8_t *
dst =
c->framebuf + tile_x *
c->tile_width * 3 +
1064 tile_y *
c->tile_height *
c->framebuf_stride;
1069 width =
FFMIN(
c->width - tile_x *
c->tile_width,
c->tile_width);
1070 height =
FFMIN(
c->height - tile_y *
c->tile_height,
c->tile_height);
1073 sub_type = hdr >> 5;
1074 if (sub_type == 0) {
1075 memcpy(transp,
src, 3);
1077 for (
int j = 0; j <
height; j++,
dst +=
c->framebuf_stride)
1079 memcpy(
dst +
i * 3, transp, 3);
1081 }
else if (sub_type == 1) {
1083 dst,
c->framebuf_stride,
NULL, 0, 0, 0);
1086 if (sub_type != 2) {
1087 memcpy(transp,
src, 3);
1091 if (src_end -
src < npal * 3)
1093 memcpy(pal,
src, npal * 3);
1095 if (sub_type != 2) {
1096 for (
int i = 0;
i < npal;
i++) {
1097 if (!memcmp(pal +
i * 3, transp, 3)) {
1104 if (src_end -
src < 2)
1106 zsize = (
src[0] << 8) |
src[1];
1109 if (src_end -
src < zsize + (sub_type != 2))
1112 ret = uncompress(
c->kempf_buf, &dlen,
src, zsize);
1117 if (sub_type == 2) {
1123 nblocks = *
src++ + 1;
1140 if (cblocks > nblocks)
1142 c->kempf_flags[j * 2 +
i * 2 * bstride] =
1143 c->kempf_flags[j * 2 + 1 +
i * 2 * bstride] =
1144 c->kempf_flags[j * 2 + (
i * 2 + 1) * bstride] =
1145 c->kempf_flags[j * 2 + 1 + (
i * 2 + 1) * bstride] = coded;
1149 memset(
c->jpeg_tile, 0,
c->tile_stride *
height);
1151 c->jpeg_tile,
c->tile_stride,
1152 c->kempf_flags, bstride, nblocks * 4, 0);
1155 c->jpeg_tile,
c->tile_stride,
1165 c->framebuf_stride =
FFALIGN(
c->width + 15, 16) * 3;
1166 aligned_height =
c->height + 15;
1168 av_fast_mallocz(&
c->framebuf, &
c->framebuf_allocated,
c->framebuf_stride * aligned_height);
1172 if (!
c->synth_tile || !
c->jpeg_tile ||
1173 (
c->compression == 2 && !
c->epic_buf_base) ||
1174 c->old_tile_w <
c->tile_width ||
1175 c->old_tile_h <
c->tile_height) {
1176 c->tile_stride =
FFALIGN(
c->tile_width, 16) * 3;
1177 c->epic_buf_stride =
FFALIGN(
c->tile_width * 4, 16);
1178 aligned_height =
FFALIGN(
c->tile_height, 16);
1185 c->synth_tile =
av_mallocz(
c->tile_stride * aligned_height);
1186 c->jpeg_tile =
av_mallocz(
c->tile_stride * aligned_height);
1187 c->kempf_buf =
av_mallocz((
c->tile_width + 1) * aligned_height +
1189 c->kempf_flags =
av_mallocz(
c->tile_width * aligned_height);
1190 if (!
c->synth_tile || !
c->jpeg_tile ||
1191 !
c->kempf_buf || !
c->kempf_flags)
1193 if (
c->compression == 2) {
1194 c->epic_buf_base =
av_mallocz(
c->epic_buf_stride * aligned_height + 4);
1195 if (!
c->epic_buf_base)
1197 c->epic_buf =
c->epic_buf_base + 4;
1210 uint32_t cur_size, cursor_w, cursor_h, cursor_stride;
1211 uint32_t cursor_hot_x, cursor_hot_y;
1212 int cursor_fmt, err;
1214 cur_size = bytestream2_get_be32(gb);
1215 cursor_w = bytestream2_get_byte(gb);
1216 cursor_h = bytestream2_get_byte(gb);
1217 cursor_hot_x = bytestream2_get_byte(gb);
1218 cursor_hot_y = bytestream2_get_byte(gb);
1219 cursor_fmt = bytestream2_get_byte(gb);
1221 cursor_stride =
FFALIGN(cursor_w, cursor_fmt==1 ? 32 : 1) * 4;
1223 if (cursor_w < 1 || cursor_w > 256 ||
1224 cursor_h < 1 || cursor_h > 256) {
1226 cursor_w, cursor_h);
1229 if (cursor_hot_x > cursor_w || cursor_hot_y > cursor_h) {
1231 cursor_hot_x, cursor_hot_y);
1232 cursor_hot_x =
FFMIN(cursor_hot_x, cursor_w - 1);
1233 cursor_hot_y =
FFMIN(cursor_hot_y, cursor_h - 1);
1236 c->cursor_w *
c->cursor_h / 4 > cur_size) {
1241 if (cursor_fmt != 1 && cursor_fmt != 32) {
1247 if ((err =
av_reallocp(&
c->cursor, cursor_stride * cursor_h)) < 0) {
1252 c->cursor_w = cursor_w;
1253 c->cursor_h = cursor_h;
1254 c->cursor_hot_x = cursor_hot_x;
1255 c->cursor_hot_y = cursor_hot_y;
1256 c->cursor_fmt = cursor_fmt;
1257 c->cursor_stride = cursor_stride;
1260 switch (
c->cursor_fmt) {
1262 for (j = 0; j <
c->cursor_h; j++) {
1263 for (
i = 0;
i <
c->cursor_w;
i += 32) {
1264 bits = bytestream2_get_be32(gb);
1265 for (k = 0; k < 32; k++) {
1266 dst[0] = !!(
bits & 0x80000000);
1274 for (j = 0; j <
c->cursor_h; j++) {
1275 for (
i = 0;
i <
c->cursor_w;
i += 32) {
1276 bits = bytestream2_get_be32(gb);
1277 for (k = 0; k < 32; k++) {
1278 int mask_bit = !!(
bits & 0x80000000);
1279 switch (
dst[0] * 2 + mask_bit) {
1307 for (j = 0; j <
c->cursor_h; j++) {
1308 for (
i = 0;
i <
c->cursor_w;
i++) {
1309 int val = bytestream2_get_be32(gb);
1323 #define APPLY_ALPHA(src, new, alpha) \
1324 src = (src * (256 - alpha) + new * alpha) >> 8
1330 const uint8_t *cursor;
1335 x =
c->cursor_x -
c->cursor_hot_x;
1336 y =
c->cursor_y -
c->cursor_hot_y;
1342 if (x +
w >
c->width)
1344 if (y +
h >
c->height)
1358 cursor += -y *
c->cursor_stride;
1363 for (j = 0; j <
h; j++) {
1364 for (
i = 0;
i <
w;
i++) {
1365 uint8_t
alpha = cursor[
i * 4];
1371 cursor +=
c->cursor_stride;
1376 int *got_picture_ptr,
AVPacket *avpkt)
1378 const uint8_t *buf = avpkt->
data;
1379 int buf_size = avpkt->
size;
1384 uint32_t chunk_size, r_mask, g_mask, b_mask;
1389 if (buf_size < 12) {
1391 "Frame should have at least 12 bytes, got %d instead\n",
1398 magic = bytestream2_get_be32(&bc);
1399 if ((magic & ~0xF) !=
MKBETAG(
'G',
'2',
'M',
'0') ||
1400 (magic & 0xF) < 2 || (magic & 0xF) > 5) {
1405 c->swapuv = magic ==
MKBETAG(
'G',
'2',
'M',
'2');
1408 chunk_size = bytestream2_get_le32(&bc) - 1;
1409 chunk_type = bytestream2_get_byte(&bc);
1413 chunk_size, chunk_type);
1416 switch (chunk_type) {
1420 if (chunk_size < 21) {
1425 c->width = bytestream2_get_be32(&bc);
1426 c->height = bytestream2_get_be32(&bc);
1427 if (
c->width < 16 ||
c->height < 16) {
1429 "Invalid frame dimensions %dx%d\n",
1430 c->width,
c->height);
1434 if (
c->width != avctx->
width ||
c->height != avctx->
height) {
1439 c->compression = bytestream2_get_be32(&bc);
1440 if (
c->compression != 2 &&
c->compression != 3) {
1446 c->tile_width = bytestream2_get_be32(&bc);
1447 c->tile_height = bytestream2_get_be32(&bc);
1448 if (
c->tile_width <= 0 ||
c->tile_height <= 0 ||
1449 ((
c->tile_width |
c->tile_height) & 0xF) ||
1450 c->tile_width * (uint64_t)
c->tile_height >= INT_MAX / 4 ||
1454 "Invalid tile dimensions %dx%d\n",
1455 c->tile_width,
c->tile_height);
1459 c->tiles_x = (
c->width +
c->tile_width - 1) /
c->tile_width;
1460 c->tiles_y = (
c->height +
c->tile_height - 1) /
c->tile_height;
1461 c->bpp = bytestream2_get_byte(&bc);
1464 (chunk_size - 21) < 16) {
1466 "Display info: missing bitmasks!\n");
1470 r_mask = bytestream2_get_be32(&bc);
1471 g_mask = bytestream2_get_be32(&bc);
1472 b_mask = bytestream2_get_be32(&bc);
1473 if (r_mask != 0xFF0000 || g_mask != 0xFF00 || b_mask != 0xFF) {
1475 "Bitmasks: R=%"PRIX32
", G=%"PRIX32
", B=%"PRIX32,
1476 r_mask, g_mask, b_mask);
1492 if (!
c->tiles_x || !
c->tiles_y) {
1494 "No display info - skipping tile\n");
1497 if (chunk_size < 2) {
1502 c->tile_x = bytestream2_get_byte(&bc);
1503 c->tile_y = bytestream2_get_byte(&bc);
1504 if (
c->tile_x >=
c->tiles_x ||
c->tile_y >=
c->tiles_y) {
1506 "Invalid tile pos %d,%d (in %dx%d grid)\n",
1507 c->tile_x,
c->tile_y,
c->tiles_x,
c->tiles_y);
1511 switch (
c->compression) {
1515 chunk_size - 2, avctx);
1523 if (
ret &&
c->framebuf)
1525 c->tile_x,
c->tile_y);
1528 if (chunk_size < 5) {
1533 c->cursor_x = bytestream2_get_be16(&bc);
1534 c->cursor_y = bytestream2_get_be16(&bc);
1537 if (chunk_size < 8) {
1560 if (
c->width &&
c->height &&
c->framebuf) {
1572 c->framebuf +
i *
c->framebuf_stride,
1576 *got_picture_ptr = 1;
1604 c->orig_width = avctx->
width;
1605 c->orig_height = avctx->
height;
1624 c->framebuf_allocated = 0;
#define EPIC_PIX_STACK_SIZE
unsigned ff_els_decode_unsigned(ElsDecCtx *ctx, ElsUnsignedRung *ur)
static int epic_add_pixel_to_cache(ePICPixHash *hash, uint32_t key, uint32_t pix)
static void skip_bits_long(GetBitContext *s, int n)
Skips the specified number of bits.
#define AV_LOG_WARNING
Something somehow does not look correct.
struct ePICPixListElem * list
int ff_els_decode_bit(ElsDecCtx *ctx, uint8_t *rung)
#define FF_CODEC_CAP_INIT_CLEANUP
The codec allows calling the close function for deallocation even if the init function returned a fai...
static int chunk_start(AVFormatContext *s)
static int get_bits_left(GetBitContext *gb)
Filter the word “frame” indicates either a video frame or a group of audio as stored in an AVFrame structure Format for each input and each output the list of supported formats For video that means pixel format For audio that means channel sample they are references to shared objects When the negotiation mechanism computes the intersection of the formats supported at each end of a all references to both lists are replaced with a reference to the intersection And when a single format is eventually chosen for a link amongst the remaining all references to the list are updated That means that if a filter requires that its input and output have the same format amongst a supported all it has to do is use a reference to the same list of formats query_formats can leave some formats unset and return AVERROR(EAGAIN) to cause the negotiation mechanism toagain later. That can be used by filters with complex requirements to use the format negotiated on one link to set the formats supported on another. Frame references ownership and permissions
static av_always_inline int bytestream2_get_bytes_left(const GetByteContext *g)
static av_always_inline int bytestream2_tell(const GetByteContext *g)
void ff_els_decoder_init(ElsDecCtx *ctx, const uint8_t *in, size_t data_size)
static int jpg_decode_block(JPGContext *c, GetBitContext *gb, int plane, int16_t *block)
This structure describes decoded (raw) audio or video data.
uint8_t permutated_scantable[64]
static int epic_predict_from_NW_NE(ePICContext *dc, int x, int y, int run, int tile_width, const uint32_t *curr_row, const uint32_t *above_row, uint32_t *pPix)
const uint8_t ff_mjpeg_val_dc[]
int flags
Frame flags, a combination of AV_FRAME_FLAGS.
const uint8_t ff_mjpeg_bits_ac_chrominance[]
int ff_set_dimensions(AVCodecContext *s, int width, int height)
static uint8_t hash[HASH_SIZE]
av_cold void ff_idctdsp_init(IDCTDSPContext *c, AVCodecContext *avctx)
static int rle(uint8_t *dst, const uint8_t *src, int compressed_size, int uncompressed_size)
uint8_t * data[AV_NUM_DATA_POINTERS]
pointer to the picture/channel planes.
static void jpg_unescape(const uint8_t *src, int src_size, uint8_t *dst, int *dst_size)
static av_cold int g2m_decode_init(AVCodecContext *avctx)
av_cold void ff_permute_scantable(uint8_t dst[64], const uint8_t src[64], const uint8_t permutation[64])
static av_cold void close(AVCodecParserContext *s)
int bucket_size[EPIC_HASH_SIZE]
static av_always_inline void bytestream2_skip(GetByteContext *g, unsigned int size)
static unsigned int get_bits(GetBitContext *s, int n)
Read 1-25 bits.
static ePICPixHashElem * epic_hash_find(const ePICPixHash *hash, uint32_t key)
AVCodec p
The public AVCodec.
static int epic_decode_tile(ePICContext *dc, uint8_t *out, int tile_height, int tile_width, int stride)
uint8_t prev_row_rung[14]
static double val(void *priv, double ch)
static int epic_handle_edges(ePICContext *dc, int x, int y, const uint32_t *curr_row, const uint32_t *above_row, uint32_t *pPix)
static void g2m_paint_cursor(G2MContext *c, uint8_t *dst, int stride)
int av_image_check_size2(unsigned int w, unsigned int h, int64_t max_pixels, enum AVPixelFormat pix_fmt, int log_offset, void *log_ctx)
Check if the given dimension of an image is valid, meaning that all bytes of a plane of an image with...
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
#define FF_ARRAY_ELEMS(a)
static int init_get_bits8(GetBitContext *s, const uint8_t *buffer, int byte_size)
Initialize GetBitContext.
#define AV_FRAME_FLAG_KEY
A flag to mark frames that are keyframes.
#define FF_CODEC_DECODE_CB(func)
av_cold void ff_blockdsp_init(BlockDSPContext *c)
uint8_t nw_pred_rung[256]
static FFFrameBucket * bucket(FFFrameQueue *fq, size_t idx)
static AVFormatContext * ctx
#define APPLY_ALPHA(src, new, alpha)
int64_t max_pixels
The number of pixels per image to maximally accept.
static int epic_decode_from_cache(ePICContext *dc, uint32_t W, uint32_t *pPix)
#define CODEC_LONG_NAME(str)
static av_cold int g2m_decode_end(AVCodecContext *avctx)
static int epic_jb_decode_tile(G2MContext *c, int tile_x, int tile_y, const uint8_t *src, size_t src_size, AVCodecContext *avctx)
ePICPixHashElem * bucket[EPIC_HASH_SIZE]
#define AVERROR_PATCHWELCOME
Not yet implemented in FFmpeg, patches welcome.
ElsUnsignedRung unsigned_rung
static ePICPixHashElem * epic_hash_add(ePICPixHash *hash, uint32_t key)
const FFCodec ff_g2m_decoder
static av_cold int jpg_init(AVCodecContext *avctx, JPGContext *c)
@ AV_PICTURE_TYPE_I
Intra.
void av_fast_mallocz(void *ptr, unsigned int *size, size_t min_size)
Allocate and clear a buffer, reusing the given one if large enough.
#define FF_PTR_ADD(ptr, off)
Filter the word “frame” indicates either a video frame or a group of audio as stored in an AVFrame structure Format for each input and each output the list of supported formats For video that means pixel format For audio that means channel sample they are references to shared objects When the negotiation mechanism computes the intersection of the formats supported at each end of a all references to both lists are replaced with a reference to the intersection And when a single format is eventually chosen for a link amongst the remaining list
#define EPIC_PIX_STACK_MAX
static int g2m_load_cursor(AVCodecContext *avctx, G2MContext *c, GetByteContext *gb)
const uint8_t ff_mjpeg_val_ac_chrominance[]
static av_always_inline int get_vlc2(GetBitContext *s, const VLCElem *table, int bits, int max_depth)
Parse a vlc code.
static int epic_predict_pixel2(ePICContext *dc, uint8_t *rung, uint32_t *pPix, uint32_t pix)
Undefined Behavior In the C some operations are like signed integer dereferencing freed accessing outside allocated Undefined Behavior must not occur in a C it is not safe even if the output of undefined operations is unused The unsafety may seem nit picking but Optimizing compilers have in fact optimized code on the assumption that no undefined Behavior occurs Optimizing code based on wrong assumptions can and has in some cases lead to effects beyond the output of computations The signed integer overflow problem in speed critical code Code which is highly optimized and works with signed integers sometimes has the problem that often the output of the computation does not c
static int g2m_decode_frame(AVCodecContext *avctx, AVFrame *pic, int *got_picture_ptr, AVPacket *avpkt)
enum AVPictureType pict_type
Picture type of the frame.
int ff_get_buffer(AVCodecContext *avctx, AVFrame *frame, int flags)
Get a buffer for a frame.
int(* init)(AVBSFContext *ctx)
@ AV_PIX_FMT_RGB24
packed RGB 8:8:8, 24bpp, RGBRGB...
#define AV_CODEC_CAP_DR1
Codec uses get_buffer() or get_encode_buffer() for allocating buffers and supports custom allocators.
const uint8_t ff_mjpeg_val_ac_luminance[]
Tag MUST be and< 10hcoeff half pel interpolation filter coefficients, hcoeff[0] are the 2 middle coefficients[1] are the next outer ones and so on, resulting in a filter like:...eff[2], hcoeff[1], hcoeff[0], hcoeff[0], hcoeff[1], hcoeff[2] ... the sign of the coefficients is not explicitly stored but alternates after each coeff and coeff[0] is positive, so ...,+,-,+,-,+,+,-,+,-,+,... hcoeff[0] is not explicitly stored but found by subtracting the sum of all stored coefficients with signs from 32 hcoeff[0]=32 - hcoeff[1] - hcoeff[2] - ... a good choice for hcoeff and htaps is htaps=6 hcoeff={40,-10, 2} an alternative which requires more computations at both encoder and decoder side and may or may not be better is htaps=8 hcoeff={42,-14, 6,-2}ref_frames minimum of the number of available reference frames and max_ref_frames for example the first frame after a key frame always has ref_frames=1spatial_decomposition_type wavelet type 0 is a 9/7 symmetric compact integer wavelet 1 is a 5/3 symmetric compact integer wavelet others are reserved stored as delta from last, last is reset to 0 if always_reset||keyframeqlog quality(logarithmic quantizer scale) stored as delta from last, last is reset to 0 if always_reset||keyframemv_scale stored as delta from last, last is reset to 0 if always_reset||keyframe FIXME check that everything works fine if this changes between framesqbias dequantization bias stored as delta from last, last is reset to 0 if always_reset||keyframeblock_max_depth maximum depth of the block tree stored as delta from last, last is reset to 0 if always_reset||keyframequant_table quantization tableHighlevel bitstream structure:==============================--------------------------------------------|Header|--------------------------------------------|------------------------------------|||Block0||||split?||||yes no||||......... intra?||||:Block01 :yes no||||:Block02 :....... ..........||||:Block03 ::y DC ::ref index:||||:Block04 ::cb DC ::motion x :||||......... :cr DC ::motion y :||||....... ..........|||------------------------------------||------------------------------------|||Block1|||...|--------------------------------------------|------------ ------------ ------------|||Y subbands||Cb subbands||Cr subbands||||--- ---||--- ---||--- ---|||||LL0||HL0||||LL0||HL0||||LL0||HL0|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||LH0||HH0||||LH0||HH0||||LH0||HH0|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||HL1||LH1||||HL1||LH1||||HL1||LH1|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||HH1||HL2||||HH1||HL2||||HH1||HL2|||||...||...||...|||------------ ------------ ------------|--------------------------------------------Decoding process:=================------------|||Subbands|------------||||------------|Intra DC||||LL0 subband prediction ------------|\ Dequantization ------------------- \||Reference frames|\ IDWT|------- -------|Motion \|||Frame 0||Frame 1||Compensation . OBMC v -------|------- -------|--------------. \------> Frame n output Frame Frame<----------------------------------/|...|------------------- Range Coder:============Binary Range Coder:------------------- The implemented range coder is an adapted version based upon "Range encoding: an algorithm for removing redundancy from a digitised message." by G. N. N. Martin. The symbols encoded by the Snow range coder are bits(0|1). The associated probabilities are not fix but change depending on the symbol mix seen so far. bit seen|new state ---------+----------------------------------------------- 0|256 - state_transition_table[256 - old_state];1|state_transition_table[old_state];state_transition_table={ 0, 0, 0, 0, 0, 0, 0, 0, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 190, 191, 192, 194, 194, 195, 196, 197, 198, 199, 200, 201, 202, 202, 204, 205, 206, 207, 208, 209, 209, 210, 211, 212, 213, 215, 215, 216, 217, 218, 219, 220, 220, 222, 223, 224, 225, 226, 227, 227, 229, 229, 230, 231, 232, 234, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 248, 0, 0, 0, 0, 0, 0, 0};FIXME Range Coding of integers:------------------------- FIXME Neighboring Blocks:===================left and top are set to the respective blocks unless they are outside of the image in which case they are set to the Null block top-left is set to the top left block unless it is outside of the image in which case it is set to the left block if this block has no larger parent block or it is at the left side of its parent block and the top right block is not outside of the image then the top right block is used for top-right else the top-left block is used Null block y, cb, cr are 128 level, ref, mx and my are 0 Motion Vector Prediction:=========================1. the motion vectors of all the neighboring blocks are scaled to compensate for the difference of reference frames scaled_mv=(mv *(256 *(current_reference+1)/(mv.reference+1))+128)> the median of the scaled top and top right vectors is used as motion vector prediction the used motion vector is the sum of the predictor and(mvx_diff, mvy_diff) *mv_scale Intra DC Prediction block[y][x] dc[1]
#define DECLARE_ALIGNED(n, t, v)
uint8_t ptrdiff_t const uint8_t ptrdiff_t int intptr_t intptr_t int int16_t * dst
#define i(width, name, range_min, range_max)
const uint8_t ff_mjpeg_bits_ac_luminance[]
struct ePICPixListElem * next
int av_reallocp(void *ptr, size_t size)
Allocate, reallocate, or free a block of memory through a pointer to a pointer.
#define MKBETAG(a, b, c, d)
void avpriv_report_missing_feature(void *avc, const char *msg,...) av_printf_format(2
Log a generic warning message about a missing feature.
static int get_xbits(GetBitContext *s, int n)
Read MPEG-1 dc-style VLC (sign bit + mantissa with no MSB).
void ff_els_decoder_uninit(ElsUnsignedRung *rung)
unsigned int framebuf_allocated
int bucket_fill[EPIC_HASH_SIZE]
static int kempf_decode_tile(G2MContext *c, int tile_x, int tile_y, const uint8_t *src, int src_size)
static int djb2_hash(uint32_t key)
static av_cold void jpg_free_context(JPGContext *ctx)
const char * name
Name of the codec implementation.
static const uint8_t luma_quant[64]
enum AVPixelFormat pix_fmt
Pixel format, see AV_PIX_FMT_xxx.
const uint8_t ff_zigzag_direct[64]
int64_t frame_num
Frame counter, set by libavcodec.
void ff_vlc_free(VLC *vlc)
static int kempf_restore_buf(const uint8_t *src, int len, uint8_t *dst, int stride, const uint8_t *jpeg_tile, int tile_stride, int width, int height, const uint8_t *pal, int npal, int tidx)
static const float pred[4]
#define AV_INPUT_BUFFER_PADDING_SIZE
uint8_t ne_pred_rung[256]
main external API structure.
static void epic_hash_init(ePICPixHash *hash)
static int g2m_init_buffers(G2MContext *c)
uint8_t runlen_zeroes[14]
static int epic_predict_pixel(ePICContext *dc, uint8_t *rung, uint32_t *pPix, uint32_t pix)
const uint8_t ff_mjpeg_bits_dc_chrominance[]
#define UPDATE_NEIGHBOURS(x)
static int jpg_decode_data(JPGContext *c, int width, int height, const uint8_t *src, int src_size, uint8_t *dst, int dst_stride, const uint8_t *mask, int mask_stride, int num_mbs, int swapuv)
#define LOAD_NEIGHBOURS(x)
@ AV_PICTURE_TYPE_P
Predicted.
static const uint8_t chroma_quant[64]
#define avpriv_request_sample(...)
static int epic_cache_entries_for_pixel(const ePICPixHash *hash, uint32_t pix)
const FF_VISIBILITY_PUSH_HIDDEN uint8_t ff_mjpeg_bits_dc_luminance[]
static const int16_t alpha[]
int ff_mjpeg_build_vlc(VLC *vlc, const uint8_t *bits_table, const uint8_t *val_table, int is_ac, void *logctx)
This structure stores compressed data.
static int epic_decode_component_pred(ePICContext *dc, int N, int W, int NW)
static int epic_decode_run_length(ePICContext *dc, int x, int y, int tile_width, const uint32_t *curr_row, const uint32_t *above_row, const uint32_t *above2_row, uint32_t *pPix, int *pRun)
int width
picture width / height.
uint32_t stack[EPIC_PIX_STACK_SIZE]
static av_always_inline void bytestream2_init(GetByteContext *g, const uint8_t *buf, int buf_size)
int linesize[AV_NUM_DATA_POINTERS]
For video, a positive or negative value, which is typically indicating the size in bytes of each pict...
The exact code depends on how similar the blocks are and how related they are to the block
#define AVERROR_INVALIDDATA
Invalid data found when processing input.
static void epic_free_pixel_cache(ePICPixHash *hash)
static uint32_t epic_decode_pixel_pred(ePICContext *dc, int x, int y, const uint32_t *curr_row, const uint32_t *above_row)
static void yuv2rgb(uint8_t *out, int ridx, int Y, int U, int V)
static int is_pixel_on_stack(const ePICContext *dc, uint32_t pix)