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;
252 bsrc = src + slice_start *
stride;
257 for (i = step; i < width *
step; i +=
step) {
262 if (slice_height == 1)
268 for (i = step; i < width *
step; i +=
step) {
270 bsrc[i] +=
mid_pred(A, B, (uint8_t)(A + B - C));
276 for (j = 2; j < slice_height; j++) {
277 for (i = 0; i < width *
step; i +=
step) {
279 bsrc[i] +=
mid_pred(A, B, (uint8_t)(A + B - C));
298 int slice_start, slice_height;
299 const int cmask = ~(rmode ? 3 : 1);
300 const int stride2 = stride << 1;
302 for (slice = 0; slice < slices; slice++) {
303 slice_start = ((slice *
height) / slices) & cmask;
304 slice_height = ((((slice + 1) * height) / slices) & cmask) - slice_start;
309 bsrc = src + slice_start *
stride;
314 for (i = step; i < width *
step; i +=
step) {
318 for (i = 0; i < width *
step; i +=
step) {
319 bsrc[stride + i] +=
A;
320 A = bsrc[stride + i];
323 if (slice_height == 1)
329 for (i = step; i < width *
step; i +=
step) {
330 B = bsrc[i - stride2];
331 bsrc[i] +=
mid_pred(A, B, (uint8_t)(A + B - C));
335 for (i = 0; i < width *
step; i +=
step) {
337 bsrc[stride + i] +=
mid_pred(A, B, (uint8_t)(A + B - C));
339 A = bsrc[stride + i];
343 for (j = 2; j < slice_height; j++) {
344 for (i = 0; i < width *
step; i +=
step) {
345 B = bsrc[i - stride2];
346 bsrc[i] +=
mid_pred(A, B, (uint8_t)(A + B - C));
350 for (i = 0; i < width *
step; i +=
step) {
363 const uint8_t *buf = avpkt->
data;
364 int buf_size = avpkt->
size;
367 const uint8_t *plane_start[5];
368 int plane_size, max_slice_size = 0, slice_start,
slice_end, slice_size;
386 for (i = 0; i < c->
planes; i++) {
387 plane_start[i] = gb.
buffer;
395 for (j = 0; j < c->
slices; j++) {
396 slice_end = bytestream2_get_le32u(&gb);
397 slice_size = slice_end - slice_start;
398 if (slice_end <= 0 || slice_size <= 0 ||
404 max_slice_size =
FFMAX(max_slice_size, slice_size);
435 for (i = 0; i < c->
planes; i++) {
438 plane_start[i], plane_start[i + 1] - plane_start[i],
451 for (i = 0; i < 3; i++) {
454 plane_start[i], plane_start[i + 1] - plane_start[i],
473 for (i = 0; i < 3; i++) {
476 plane_start[i], plane_start[i + 1] - plane_start[i],
511 av_log(avctx,
AV_LOG_ERROR,
"Insufficient extradata size %d, should be at least 16\n",
533 case MKTAG(
'U',
'L',
'R',
'G'):
537 case MKTAG(
'U',
'L',
'R',
'A'):
541 case MKTAG(
'U',
'L',
'Y',
'0'):
545 case MKTAG(
'U',
'L',
'Y',
'2'):