67 return (aa->
len - bb->len)*256 + aa->
sym - bb->sym;
81 for (i = 0; i < 256; i++) {
85 qsort(he, 256,
sizeof(*he),
huff_cmp);
95 while (he[last].len == 255 && last)
99 for (i = last; i >= 0; i--) {
100 codes[i] = code >> (32 - he[i].
len);
103 code += 0x80000000u >> (he[i].
len - 1);
107 bits,
sizeof(*bits),
sizeof(*bits),
108 codes,
sizeof(*codes),
sizeof(*codes),
109 syms,
sizeof(*syms),
sizeof(*syms), 0);
115 const uint8_t *src,
int src_size,
int use_pred)
117 int i, j, slice, pix;
130 for (slice = 0; slice < c->
slices; slice++) {
134 send = (height * (slice + 1) / c->
slices) & cmask;
135 dest = dst + sstart *
stride;
138 for (j = sstart; j < send; j++) {
139 for (i = 0; i < width *
step; i +=
step) {
157 for (slice = 0; slice < c->
slices; slice++) {
159 int slice_data_start, slice_data_end, slice_size;
162 send = (height * (slice + 1) / c->
slices) & cmask;
163 dest = dst + sstart *
stride;
166 slice_data_start = slice ?
AV_RL32(src + slice * 4 - 4) : 0;
167 slice_data_end =
AV_RL32(src + slice * 4);
168 slice_size = slice_data_end - slice_data_start;
171 for (j = sstart; j < send; j++) {
172 for (i = 0; i < width *
step; i +=
step)
182 (slice_data_end - slice_data_start + 3) >> 2);
186 for (j = sstart; j < send; j++) {
187 for (i = 0; i < width *
step; i +=
step) {
225 for (j = 0; j <
height; j++) {
226 for (i = 0; i < width *
step; i +=
step) {
230 src[i] = r + g - 0x80;
231 src[i + 2] = b + g - 0x80;
243 int slice_start, slice_height;
244 const int cmask = ~rmode;
246 for (slice = 0; slice < slices; slice++) {
247 slice_start = ((slice *
height) / slices) & cmask;
248 slice_height = ((((slice + 1) * height) / slices) & cmask) - slice_start;
250 bsrc = src + slice_start *
stride;
255 for (i = step; i < width *
step; i +=
step) {
260 if (slice_height == 1)
266 for (i = step; i < width *
step; i +=
step) {
268 bsrc[i] +=
mid_pred(A, B, (uint8_t)(A + B - C));
274 for (j = 2; j < slice_height; j++) {
275 for (i = 0; i < width *
step; i +=
step) {
277 bsrc[i] +=
mid_pred(A, B, (uint8_t)(A + B - C));
296 int slice_start, slice_height;
297 const int cmask = ~(rmode ? 3 : 1);
298 const int stride2 = stride << 1;
300 for (slice = 0; slice < slices; slice++) {
301 slice_start = ((slice *
height) / slices) & cmask;
302 slice_height = ((((slice + 1) * height) / slices) & cmask) - slice_start;
305 bsrc = src + slice_start *
stride;
310 for (i = step; i < width *
step; i +=
step) {
314 for (i = 0; i < width *
step; i +=
step) {
315 bsrc[stride + i] +=
A;
316 A = bsrc[stride + i];
319 if (slice_height == 1)
325 for (i = step; i < width *
step; i +=
step) {
326 B = bsrc[i - stride2];
327 bsrc[i] +=
mid_pred(A, B, (uint8_t)(A + B - C));
331 for (i = 0; i < width *
step; i +=
step) {
333 bsrc[stride + i] +=
mid_pred(A, B, (uint8_t)(A + B - C));
335 A = bsrc[stride + i];
339 for (j = 2; j < slice_height; j++) {
340 for (i = 0; i < width *
step; i +=
step) {
341 B = bsrc[i - stride2];
342 bsrc[i] +=
mid_pred(A, B, (uint8_t)(A + B - C));
346 for (i = 0; i < width *
step; i +=
step) {
359 const uint8_t *buf = avpkt->
data;
360 int buf_size = avpkt->
size;
363 const uint8_t *plane_start[5];
364 int plane_size, max_slice_size = 0, slice_start,
slice_end, slice_size;
382 for (i = 0; i < c->
planes; i++) {
383 plane_start[i] = gb.
buffer;
391 for (j = 0; j < c->
slices; j++) {
392 slice_end = bytestream2_get_le32u(&gb);
393 slice_size = slice_end - slice_start;
394 if (slice_end <= 0 || slice_size <= 0 ||
400 max_slice_size =
FFMAX(max_slice_size, slice_size);
431 for (i = 0; i < c->
planes; i++) {
434 plane_start[i], plane_start[i + 1] - plane_start[i],
447 for (i = 0; i < 3; i++) {
450 plane_start[i], plane_start[i + 1] - plane_start[i],
469 for (i = 0; i < 3; i++) {
472 plane_start[i], plane_start[i + 1] - plane_start[i],
507 av_log(avctx,
AV_LOG_ERROR,
"Insufficient extradata size %d, should be at least 16\n",
529 case MKTAG(
'U',
'L',
'R',
'G'):
533 case MKTAG(
'U',
'L',
'R',
'A'):
537 case MKTAG(
'U',
'L',
'Y',
'0'):
541 case MKTAG(
'U',
'L',
'Y',
'2'):