29 #include "libavutil/intreadwrite.h"
48 for (i = 0; i < 256; i++) {
62 while (he[last].len == 255 && last)
66 for (i = last; i >= 0; i--) {
67 codes[i] = code >> (32 - he[i].
len);
70 code += 0x80000000
u >> (he[i].
len - 1);
74 bits,
sizeof(*bits),
sizeof(*bits),
75 codes,
sizeof(*codes),
sizeof(*codes),
76 syms,
sizeof(*syms),
sizeof(*syms), 0);
82 const uint8_t *src,
int use_pred)
97 for (slice = 0; slice < c->
slices; slice++) {
101 send = (height * (slice + 1) / c->
slices) & cmask;
102 dest = dst + sstart *
stride;
105 for (j = sstart; j < send; j++) {
106 for (i = 0; i < width * step; i += step) {
123 for (slice = 0; slice < c->
slices; slice++) {
125 int slice_data_start, slice_data_end, slice_size;
128 send = (height * (slice + 1) / c->
slices) & cmask;
129 dest = dst + sstart *
stride;
132 slice_data_start = slice ?
AV_RL32(src + slice * 4 - 4) : 0;
133 slice_data_end =
AV_RL32(src + slice * 4);
134 slice_size = slice_data_end - slice_data_start;
138 "yet a slice has a length of zero.\n");
146 (slice_data_end - slice_data_start + 3) >> 2);
150 for (j = sstart; j < send; j++) {
151 for (i = 0; i < width * step; i += step) {
154 "Slice decoding ran out of bits\n");
189 for (j = 0; j <
height; j++) {
190 for (i = 0; i < width * step; i += step) {
194 src[i] = r + g - 0x80;
195 src[i + 2] = b + g - 0x80;
207 int slice_start, slice_height;
208 const int cmask = ~rmode;
210 for (slice = 0; slice < slices; slice++) {
211 slice_start = ((slice *
height) / slices) & cmask;
212 slice_height = ((((slice + 1) * height) / slices) & cmask) -
217 bsrc = src + slice_start *
stride;
222 for (i = step; i < width * step; i += step) {
227 if (slice_height <= 1)
233 for (i = step; i < width * step; i += step) {
241 for (j = 2; j < slice_height; j++) {
242 for (i = 0; i < width * step; i += step) {
263 int slice_start, slice_height;
264 const int cmask = ~(rmode ? 3 : 1);
265 const int stride2 = stride << 1;
267 for (slice = 0; slice < slices; slice++) {
268 slice_start = ((slice *
height) / slices) & cmask;
269 slice_height = ((((slice + 1) * height) / slices) & cmask) -
275 bsrc = src + slice_start *
stride;
280 for (i = step; i < width * step; i += step) {
284 for (i = 0; i < width * step; i += step) {
285 bsrc[stride + i] += A;
286 A = bsrc[stride + i];
289 if (slice_height <= 1)
295 for (i = step; i < width * step; i += step) {
296 B = bsrc[i - stride2];
301 for (i = 0; i < width * step; i += step) {
305 A = bsrc[stride + i];
309 for (j = 2; j < slice_height; j++) {
310 for (i = 0; i < width * step; i += step) {
311 B = bsrc[i - stride2];
316 for (i = 0; i < width * step; i += step) {
331 int buf_size = avpkt->
size;
335 int plane_size, max_slice_size = 0, slice_start,
slice_end, slice_size;
351 for (i = 0; i < c->
planes; i++) {
352 plane_start[i] = gb.
buffer;
360 for (j = 0; j < c->
slices; j++) {
361 slice_end = bytestream2_get_le32u(&gb);
362 slice_size = slice_end - slice_start;
363 if (slice_end < 0 || slice_size < 0 ||
369 max_slice_size =
FFMAX(max_slice_size, slice_size);
400 for (i = 0; i < c->
planes; i++) {
403 avctx->
height, plane_start[i],
424 for (i = 0; i < 3; i++) {
445 for (i = 0; i < 3; i++) {
487 "Insufficient extradata size %d, should be at least 16\n",
510 case MKTAG(
'U',
'L',
'R',
'G'):
514 case MKTAG(
'U',
'L',
'R',
'A'):
518 case MKTAG(
'U',
'L',
'Y',
'0'):
522 case MKTAG(
'U',
'L',
'Y',
'2'):