49 for (i = 0; i < 256; i++) {
61 while (he[last].len == 255 && last)
64 if (he[last].len > 32)
68 for (i = last; i >= 0; i--) {
69 codes[i] = code >> (32 - he[i].
len);
72 code += 0x80000000
u >> (he[i].
len - 1);
76 bits,
sizeof(*bits),
sizeof(*bits),
77 codes,
sizeof(*codes),
sizeof(*codes),
78 syms,
sizeof(*syms),
sizeof(*syms), 0);
99 for (slice = 0; slice < c->
slices; slice++) {
103 send = (height * (slice + 1) / c->
slices) & cmask;
104 dest = dst + sstart * stride;
107 for (j = sstart; j < send; j++) {
108 for (i = 0; i < width * step; i += step) {
125 for (slice = 0; slice < c->
slices; slice++) {
127 int slice_data_start, slice_data_end, slice_size;
130 send = (height * (slice + 1) / c->
slices) & cmask;
131 dest = dst + sstart * stride;
134 slice_data_start = slice ?
AV_RL32(src + slice * 4 - 4) : 0;
135 slice_data_end =
AV_RL32(src + slice * 4);
136 slice_size = slice_data_end - slice_data_start;
140 "yet a slice has a length of zero.\n");
149 (slice_data_end - slice_data_start + 3) >> 2);
153 for (j = sstart; j < send; j++) {
154 for (i = 0; i < width * step; i += step) {
157 "Slice decoding ran out of bits\n");
192 for (j = 0; j <
height; j++) {
193 for (i = 0; i < width * step; i += step) {
197 src[i] = r + g - 0x80;
198 src[i + 2] = b + g - 0x80;
210 int slice_start, slice_height;
211 const int cmask = ~rmode;
213 for (slice = 0; slice < slices; slice++) {
214 slice_start = ((slice *
height) / slices) & cmask;
215 slice_height = ((((slice + 1) * height) / slices) & cmask) -
218 bsrc = src + slice_start * stride;
223 for (i = step; i < width * step; i += step) {
228 if (slice_height <= 1)
234 for (i = step; i < width * step; i += step) {
235 B = bsrc[i - stride];
242 for (j = 2; j < slice_height; j++) {
243 for (i = 0; i < width * step; i += step) {
244 B = bsrc[i - stride];
264 int slice_start, slice_height;
265 const int cmask = ~(rmode ? 3 : 1);
266 const int stride2 = stride << 1;
268 for (slice = 0; slice < slices; slice++) {
269 slice_start = ((slice *
height) / slices) & cmask;
270 slice_height = ((((slice + 1) * height) / slices) & cmask) -
274 bsrc = src + slice_start * stride;
279 for (i = step; i < width * step; i += step) {
283 for (i = 0; i < width * step; i += step) {
284 bsrc[stride + i] +=
A;
285 A = bsrc[stride + i];
288 if (slice_height <= 1)
294 for (i = step; i < width * step; i += step) {
295 B = bsrc[i - stride2];
300 for (i = 0; i < width * step; i += step) {
301 B = bsrc[i - stride];
304 A = bsrc[stride + i];
308 for (j = 2; j < slice_height; j++) {
309 for (i = 0; i < width * step; i += step) {
310 B = bsrc[i - stride2];
315 for (i = 0; i < width * step; i += step) {
316 B = bsrc[i - stride];
319 A = bsrc[i + stride];
330 int buf_size = avpkt->
size;
334 int plane_size, max_slice_size = 0, slice_start,
slice_end, slice_size;
344 for (i = 0; i < c->
planes; i++) {
345 plane_start[i] = gb.
buffer;
353 for (j = 0; j < c->
slices; j++) {
354 slice_end = bytestream2_get_le32u(&gb);
355 slice_size = slice_end - slice_start;
356 if (slice_end < 0 || slice_size < 0 ||
362 max_slice_size =
FFMAX(max_slice_size, slice_size);
394 for (i = 0; i < c->
planes; i++) {
397 avctx->
height, plane_start[i],
418 for (i = 0; i < 3; i++) {
439 for (i = 0; i < 3; i++) {
480 "Insufficient extradata size %d, should be at least 16\n",
503 case MKTAG(
'U',
'L',
'R',
'G'):
507 case MKTAG(
'U',
'L',
'R',
'A'):
511 case MKTAG(
'U',
'L',
'Y',
'0'):
516 case MKTAG(
'U',
'L',
'Y',
'2'):
521 case MKTAG(
'U',
'L',
'H',
'0'):
526 case MKTAG(
'U',
'L',
'H',
'2'):