lagarith: Convert to the new bitstream reader
[libav.git] / libavcodec / lagarith.c
CommitLineData
d267b339
CEH
1/*
2 * Lagarith lossless decoder
3 * Copyright (c) 2009 Nathan Caldwell <saintdev (at) gmail.com>
4 *
2912e87a 5 * This file is part of Libav.
d267b339 6 *
2912e87a 7 * Libav is free software; you can redistribute it and/or
d267b339
CEH
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
2912e87a 12 * Libav is distributed in the hope that it will be useful,
d267b339
CEH
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
2912e87a 18 * License along with Libav; if not, write to the Free Software
d267b339
CEH
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22/**
f25a2ece 23 * @file
d267b339
CEH
24 * Lagarith lossless decoder
25 * @author Nathan Caldwell
26 */
27
cc8163e1
DB
28#include <inttypes.h>
29
d267b339 30#include "avcodec.h"
6fad5abc 31#include "bitstream.h"
d267b339 32#include "mathops.h"
0d439fbe 33#include "huffyuvdsp.h"
d267b339 34#include "lagarithrac.h"
f9150c8a 35#include "thread.h"
d267b339
CEH
36
37enum LagarithFrameType {
adbfc605
DB
38 FRAME_RAW = 1, /**< uncompressed */
39 FRAME_U_RGB24 = 2, /**< unaligned RGB24 */
40 FRAME_ARITH_YUY2 = 3, /**< arithmetic coded YUY2 */
41 FRAME_ARITH_RGB24 = 4, /**< arithmetic coded RGB24 */
42 FRAME_SOLID_GRAY = 5, /**< solid grayscale color frame */
43 FRAME_SOLID_COLOR = 6, /**< solid non-grayscale color frame */
44 FRAME_OLD_ARITH_RGB = 7, /**< obsolete arithmetic coded RGB (no longer encoded by upstream since version 1.1.0) */
45 FRAME_ARITH_RGBA = 8, /**< arithmetic coded RGBA */
46 FRAME_SOLID_RGBA = 9, /**< solid RGBA color frame */
47 FRAME_ARITH_YV12 = 10, /**< arithmetic coded YV12 */
48 FRAME_REDUCED_RES = 11, /**< reduced resolution YV12 frame */
d267b339
CEH
49};
50
51typedef struct LagarithContext {
52 AVCodecContext *avctx;
0d439fbe 53 HuffYUVDSPContext hdsp;
adbfc605
DB
54 int zeros; /**< number of consecutive zero bytes encountered */
55 int zeros_rem; /**< number of zero bytes remaining to output */
ffc638c2 56 uint8_t *rgb_planes;
4c3e1956 57 int rgb_planes_allocated;
ffc638c2 58 int rgb_stride;
d267b339
CEH
59} LagarithContext;
60
61/**
41ed7ab4 62 * Compute the 52-bit mantissa of 1/(double)denom.
d267b339
CEH
63 * This crazy format uses floats in an entropy coder and we have to match x86
64 * rounding exactly, thus ordinary floats aren't portable enough.
65 * @param denom denominator
41ed7ab4 66 * @return 52-bit mantissa
d267b339
CEH
67 * @see softfloat_mul
68 */
69static uint64_t softfloat_reciprocal(uint32_t denom)
70{
71 int shift = av_log2(denom - 1) + 1;
72 uint64_t ret = (1ULL << 52) / denom;
73 uint64_t err = (1ULL << 52) - ret * denom;
74 ret <<= shift;
75 err <<= shift;
76 err += denom / 2;
77 return ret + err / denom;
78}
79
80/**
81 * (uint32_t)(x*f), where f has the given mantissa, and exponent 0
82 * Used in combination with softfloat_reciprocal computes x/(double)denom.
41ed7ab4 83 * @param x 32-bit integer factor
d267b339 84 * @param mantissa mantissa of f with exponent 0
41ed7ab4 85 * @return 32-bit integer value (x*f)
d267b339
CEH
86 * @see softfloat_reciprocal
87 */
88static uint32_t softfloat_mul(uint32_t x, uint64_t mantissa)
89{
90 uint64_t l = x * (mantissa & 0xffffffff);
91 uint64_t h = x * (mantissa >> 32);
92 h += l >> 32;
93 l &= 0xffffffff;
94 l += 1 << av_log2(h >> 21);
95 h += l >> 32;
96 return h >> 20;
97}
98
99static uint8_t lag_calc_zero_run(int8_t x)
100{
101 return (x << 1) ^ (x >> 7);
102}
103
6fad5abc 104static int lag_decode_prob(BitstreamContext *bc, uint32_t *value)
d267b339
CEH
105{
106 static const uint8_t series[] = { 1, 2, 3, 5, 8, 13, 21 };
107 int i;
108 int bit = 0;
109 int bits = 0;
110 int prevbit = 0;
111 unsigned val;
112
113 for (i = 0; i < 7; i++) {
114 if (prevbit && bit)
115 break;
116 prevbit = bit;
6fad5abc 117 bit = bitstream_read_bit(bc);
d267b339
CEH
118 if (bit && !prevbit)
119 bits += series[i];
120 }
121 bits--;
122 if (bits < 0 || bits > 31) {
123 *value = 0;
124 return -1;
125 } else if (bits == 0) {
126 *value = 0;
127 return 0;
128 }
129
6fad5abc 130 val = bitstream_read(bc, bits);
d267b339
CEH
131 val |= 1 << bits;
132
133 *value = val - 1;
134
135 return 0;
136}
137
6fad5abc 138static int lag_read_prob_header(lag_rac *rac, BitstreamContext *bc)
d267b339
CEH
139{
140 int i, j, scale_factor;
141 unsigned prob, cumulative_target;
142 unsigned cumul_prob = 0;
143 unsigned scaled_cumul_prob = 0;
144
145 rac->prob[0] = 0;
146 rac->prob[257] = UINT_MAX;
147 /* Read probabilities from bitstream */
148 for (i = 1; i < 257; i++) {
6fad5abc 149 if (lag_decode_prob(bc, &rac->prob[i]) < 0) {
d267b339
CEH
150 av_log(rac->avctx, AV_LOG_ERROR, "Invalid probability encountered.\n");
151 return -1;
152 }
153 if ((uint64_t)cumul_prob + rac->prob[i] > UINT_MAX) {
154 av_log(rac->avctx, AV_LOG_ERROR, "Integer overflow encountered in cumulative probability calculation.\n");
155 return -1;
156 }
157 cumul_prob += rac->prob[i];
158 if (!rac->prob[i]) {
6fad5abc 159 if (lag_decode_prob(bc, &prob)) {
d267b339
CEH
160 av_log(rac->avctx, AV_LOG_ERROR, "Invalid probability run encountered.\n");
161 return -1;
162 }
163 if (prob > 257 - i)
164 prob = 257 - i;
165 for (j = 0; j < prob; j++)
166 rac->prob[++i] = 0;
167 }
168 }
169
170 if (!cumul_prob) {
171 av_log(rac->avctx, AV_LOG_ERROR, "All probabilities are 0!\n");
172 return -1;
173 }
174
175 /* Scale probabilities so cumulative probability is an even power of 2. */
176 scale_factor = av_log2(cumul_prob);
177
178 if (cumul_prob & (cumul_prob - 1)) {
179 uint64_t mul = softfloat_reciprocal(cumul_prob);
180 for (i = 1; i < 257; i++) {
181 rac->prob[i] = softfloat_mul(rac->prob[i], mul);
182 scaled_cumul_prob += rac->prob[i];
183 }
184
185 scale_factor++;
186 cumulative_target = 1 << scale_factor;
187
188 if (scaled_cumul_prob > cumulative_target) {
189 av_log(rac->avctx, AV_LOG_ERROR,
190 "Scaled probabilities are larger than target!\n");
191 return -1;
192 }
193
194 scaled_cumul_prob = cumulative_target - scaled_cumul_prob;
195
196 for (i = 1; scaled_cumul_prob; i = (i & 0x7f) + 1) {
197 if (rac->prob[i]) {
198 rac->prob[i]++;
199 scaled_cumul_prob--;
200 }
201 /* Comment from reference source:
202 * if (b & 0x80 == 0) { // order of operations is 'wrong'; it has been left this way
511cf612
DB
203 * // since the compression change is negligible and fixing it
204 * // breaks backwards compatibility
d267b339
CEH
205 * b =- (signed int)b;
206 * b &= 0xFF;
207 * } else {
208 * b++;
209 * b &= 0x7f;
210 * }
211 */
212 }
213 }
214
215 rac->scale = scale_factor;
216
217 /* Fill probability array with cumulative probability for each symbol. */
218 for (i = 1; i < 257; i++)
219 rac->prob[i] += rac->prob[i - 1];
220
221 return 0;
222}
223
224static void add_lag_median_prediction(uint8_t *dst, uint8_t *src1,
225 uint8_t *diff, int w, int *left,
226 int *left_top)
227{
0d439fbe 228 /* This is almost identical to add_hfyu_median_pred in huffyuvdsp.h.
41ed7ab4 229 * However the &0xFF on the gradient predictor yields incorrect output
d267b339
CEH
230 * for lagarith.
231 */
232 int i;
233 uint8_t l, lt;
234
235 l = *left;
236 lt = *left_top;
237
238 for (i = 0; i < w; i++) {
239 l = mid_pred(l, src1[i], l + src1[i] - lt) + diff[i];
240 lt = src1[i];
241 dst[i] = l;
242 }
243
244 *left = l;
245 *left_top = lt;
246}
247
248static void lag_pred_line(LagarithContext *l, uint8_t *buf,
249 int width, int stride, int line)
250{
251 int L, TL;
252
253 if (!line) {
2f970946 254 int i, align_width = (width - 1) & ~31;
d267b339 255 /* Left prediction only for first line */
0d439fbe 256 L = l->hdsp.add_hfyu_left_pred(buf + 1, buf + 1, align_width, buf[0]);
2f970946
KS
257 for (i = align_width + 1; i < width; i++)
258 buf[i] += buf[i - 1];
d267b339 259 } else {
0a82f527
RB
260 /* Left pixel is actually prev_row[width] */
261 L = buf[width - stride - 1];
262
263 if (line == 1) {
264 /* Second line, left predict first pixel, the rest of the line is median predicted
265 * NOTE: In the case of RGB this pixel is top predicted */
716d413c 266 TL = l->avctx->pix_fmt == AV_PIX_FMT_YUV420P ? buf[-stride] : L;
0a82f527
RB
267 } else {
268 /* Top left is 2 rows back, last pixel */
269 TL = buf[width - (2 * stride) - 1];
270 }
d267b339 271
0a82f527
RB
272 add_lag_median_prediction(buf, buf - stride, buf,
273 width, &L, &TL);
274 }
d267b339
CEH
275}
276
464e9ab0
KS
277static void lag_pred_line_yuy2(LagarithContext *l, uint8_t *buf,
278 int width, int stride, int line,
279 int is_luma)
280{
281 int L, TL;
282
283 if (!line) {
2f970946 284 int i, align_width;
464e9ab0
KS
285 if (is_luma) {
286 buf++;
287 width--;
288 }
2f970946
KS
289
290 align_width = (width - 1) & ~31;
0d439fbe 291 l->hdsp.add_hfyu_left_pred(buf + 1, buf + 1, align_width, buf[0]);
2f970946
KS
292
293 for (i = align_width + 1; i < width; i++)
294 buf[i] += buf[i - 1];
295
464e9ab0
KS
296 return;
297 }
298 if (line == 1) {
299 const int HEAD = is_luma ? 4 : 2;
300 int i;
301
302 L = buf[width - stride - 1];
303 TL = buf[HEAD - stride - 1];
304 for (i = 0; i < HEAD; i++) {
305 L += buf[i];
306 buf[i] = L;
307 }
2f970946
KS
308 for (; i < width; i++) {
309 L = mid_pred(L & 0xFF, buf[i - stride], (L + buf[i - stride] - TL) & 0xFF) + buf[i];
310 TL = buf[i - stride];
311 buf[i] = L;
312 }
464e9ab0
KS
313 } else {
314 TL = buf[width - (2 * stride) - 1];
315 L = buf[width - stride - 1];
0d439fbe 316 l->hdsp.add_hfyu_median_pred(buf, buf - stride, buf, width, &L, &TL);
464e9ab0 317 }
464e9ab0
KS
318}
319
d267b339
CEH
320static int lag_decode_line(LagarithContext *l, lag_rac *rac,
321 uint8_t *dst, int width, int stride,
322 int esc_count)
323{
324 int i = 0;
325 int ret = 0;
326
327 if (!esc_count)
328 esc_count = -1;
329
330 /* Output any zeros remaining from the previous run */
331handle_zeros:
332 if (l->zeros_rem) {
333 int count = FFMIN(l->zeros_rem, width - i);
334 memset(dst + i, 0, count);
335 i += count;
336 l->zeros_rem -= count;
337 }
338
339 while (i < width) {
340 dst[i] = lag_get_rac(rac);
341 ret++;
342
343 if (dst[i])
344 l->zeros = 0;
345 else
346 l->zeros++;
347
348 i++;
349 if (l->zeros == esc_count) {
350 int index = lag_get_rac(rac);
351 ret++;
352
353 l->zeros = 0;
354
355 l->zeros_rem = lag_calc_zero_run(index);
356 goto handle_zeros;
357 }
358 }
359 return ret;
360}
361
362static int lag_decode_zero_run_line(LagarithContext *l, uint8_t *dst,
0a82f527
RB
363 const uint8_t *src, const uint8_t *src_end,
364 int width, int esc_count)
d267b339
CEH
365{
366 int i = 0;
367 int count;
368 uint8_t zero_run = 0;
0a82f527 369 const uint8_t *src_start = src;
d267b339
CEH
370 uint8_t mask1 = -(esc_count < 2);
371 uint8_t mask2 = -(esc_count < 3);
372 uint8_t *end = dst + (width - 2);
373
374output_zeros:
375 if (l->zeros_rem) {
376 count = FFMIN(l->zeros_rem, width - i);
b631e4ed
MN
377 if (end - dst < count) {
378 av_log(l->avctx, AV_LOG_ERROR, "Too many zeros remaining.\n");
379 return AVERROR_INVALIDDATA;
380 }
381
d267b339
CEH
382 memset(dst, 0, count);
383 l->zeros_rem -= count;
384 dst += count;
385 }
386
387 while (dst < end) {
388 i = 0;
389 while (!zero_run && dst + i < end) {
390 i++;
0a82f527
RB
391 if (src + i >= src_end)
392 return AVERROR_INVALIDDATA;
d267b339
CEH
393 zero_run =
394 !(src[i] | (src[i + 1] & mask1) | (src[i + 2] & mask2));
395 }
396 if (zero_run) {
397 zero_run = 0;
398 i += esc_count;
399 memcpy(dst, src, i);
400 dst += i;
401 l->zeros_rem = lag_calc_zero_run(src[i]);
402
403 src += i + 1;
404 goto output_zeros;
405 } else {
406 memcpy(dst, src, i);
407 src += i;
0a82f527 408 dst += i;
d267b339
CEH
409 }
410 }
0a82f527 411 return src_start - src;
d267b339
CEH
412}
413
414
415
416static int lag_decode_arith_plane(LagarithContext *l, uint8_t *dst,
417 int width, int height, int stride,
418 const uint8_t *src, int src_size)
419{
420 int i = 0;
421 int read = 0;
422 uint32_t length;
423 uint32_t offset = 1;
424 int esc_count = src[0];
6fad5abc 425 BitstreamContext bc;
d267b339 426 lag_rac rac;
0a82f527 427 const uint8_t *src_end = src + src_size;
d267b339
CEH
428
429 rac.avctx = l->avctx;
430 l->zeros = 0;
431
432 if (esc_count < 4) {
433 length = width * height;
434 if (esc_count && AV_RL32(src + 1) < length) {
435 length = AV_RL32(src + 1);
436 offset += 4;
437 }
438
6fad5abc 439 bitstream_init(&bc, src + offset, src_size * 8);
d267b339 440
6fad5abc 441 if (lag_read_prob_header(&rac, &bc) < 0)
d267b339
CEH
442 return -1;
443
6fad5abc 444 ff_lag_rac_init(&rac, &bc, length - stride);
d267b339
CEH
445
446 for (i = 0; i < height; i++)
447 read += lag_decode_line(l, &rac, dst + (i * stride), width,
448 stride, esc_count);
449
450 if (read > length)
451 av_log(l->avctx, AV_LOG_WARNING,
cc8163e1 452 "Output more bytes than length (%d of %"PRIu32")\n", read,
d267b339
CEH
453 length);
454 } else if (esc_count < 8) {
455 esc_count -= 4;
456 if (esc_count > 0) {
457 /* Zero run coding only, no range coding. */
0a82f527
RB
458 for (i = 0; i < height; i++) {
459 int res = lag_decode_zero_run_line(l, dst + (i * stride), src,
460 src_end, width, esc_count);
461 if (res < 0)
462 return res;
463 src += res;
464 }
d267b339 465 } else {
0a82f527
RB
466 if (src_size < width * height)
467 return AVERROR_INVALIDDATA; // buffer not big enough
d267b339
CEH
468 /* Plane is stored uncompressed */
469 for (i = 0; i < height; i++) {
470 memcpy(dst + (i * stride), src, width);
471 src += width;
472 }
473 }
474 } else if (esc_count == 0xff) {
b0c8b8a6 475 /* Plane is a solid run of given value */
d267b339 476 for (i = 0; i < height; i++)
b0c8b8a6
RD
477 memset(dst + i * stride, src[1], width);
478 /* Do not apply prediction.
479 Note: memset to 0 above, setting first value to src[1]
480 and applying prediction gives the same result. */
481 return 0;
d267b339
CEH
482 } else {
483 av_log(l->avctx, AV_LOG_ERROR,
484 "Invalid zero run escape code! (%#x)\n", esc_count);
485 return -1;
486 }
487
716d413c 488 if (l->avctx->pix_fmt != AV_PIX_FMT_YUV422P) {
464e9ab0
KS
489 for (i = 0; i < height; i++) {
490 lag_pred_line(l, dst, width, stride, i);
491 dst += stride;
492 }
493 } else {
494 for (i = 0; i < height; i++) {
495 lag_pred_line_yuy2(l, dst, width, stride, i,
496 width == l->avctx->width);
497 dst += stride;
498 }
d267b339
CEH
499 }
500
501 return 0;
502}
503
504/**
505 * Decode a frame.
506 * @param avctx codec context
507 * @param data output AVFrame
508 * @param data_size size of output data or 0 if no picture is returned
509 * @param avpkt input packet
510 * @return number of consumed bytes on success or negative if decode fails
511 */
512static int lag_decode_frame(AVCodecContext *avctx,
df9b9567 513 void *data, int *got_frame, AVPacket *avpkt)
d267b339
CEH
514{
515 const uint8_t *buf = avpkt->data;
516 int buf_size = avpkt->size;
517 LagarithContext *l = avctx->priv_data;
759001c5
AK
518 ThreadFrame frame = { .f = data };
519 AVFrame *const p = data;
d267b339
CEH
520 uint8_t frametype = 0;
521 uint32_t offset_gu = 0, offset_bv = 0, offset_ry = 9;
1fdb5649 522 uint32_t offs[4];
ffc638c2 523 uint8_t *srcs[4], *dst;
7af507ea 524 int i, j, planes = 3;
d267b339 525
d267b339
CEH
526 p->key_frame = 1;
527
528 frametype = buf[0];
529
530 offset_gu = AV_RL32(buf + 1);
531 offset_bv = AV_RL32(buf + 5);
532
533 switch (frametype) {
ffc638c2 534 case FRAME_SOLID_RGBA:
716d413c 535 avctx->pix_fmt = AV_PIX_FMT_RGB32;
ffc638c2 536
759001c5 537 if (ff_thread_get_buffer(avctx, &frame, 0) < 0) {
ffc638c2
KS
538 av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
539 return -1;
540 }
541
542 dst = p->data[0];
543 for (j = 0; j < avctx->height; j++) {
544 for (i = 0; i < avctx->width; i++)
545 AV_WN32(dst + i * 4, offset_gu);
546 dst += p->linesize[0];
547 }
548 break;
549 case FRAME_ARITH_RGBA:
716d413c 550 avctx->pix_fmt = AV_PIX_FMT_RGB32;
7af507ea
TW
551 planes = 4;
552 offset_ry += 4;
553 offs[3] = AV_RL32(buf + 9);
554 case FRAME_ARITH_RGB24:
58637a0b
CEH
555 case FRAME_U_RGB24:
556 if (frametype == FRAME_ARITH_RGB24 || frametype == FRAME_U_RGB24)
716d413c 557 avctx->pix_fmt = AV_PIX_FMT_RGB24;
ffc638c2 558
759001c5 559 if (ff_thread_get_buffer(avctx, &frame, 0) < 0) {
ffc638c2
KS
560 av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
561 return -1;
562 }
7af507ea 563
ffc638c2
KS
564 offs[0] = offset_bv;
565 offs[1] = offset_gu;
7af507ea 566 offs[2] = offset_ry;
ffc638c2 567
4c3e1956
AK
568 l->rgb_stride = FFALIGN(avctx->width, 16);
569 av_fast_malloc(&l->rgb_planes, &l->rgb_planes_allocated,
570 l->rgb_stride * avctx->height * planes + 1);
ffc638c2 571 if (!l->rgb_planes) {
4c3e1956
AK
572 av_log(avctx, AV_LOG_ERROR, "cannot allocate temporary buffer\n");
573 return AVERROR(ENOMEM);
ffc638c2 574 }
7af507ea 575 for (i = 0; i < planes; i++)
ffc638c2 576 srcs[i] = l->rgb_planes + (i + 1) * l->rgb_stride * avctx->height - l->rgb_stride;
0a82f527
RB
577 if (offset_ry >= buf_size ||
578 offset_gu >= buf_size ||
579 offset_bv >= buf_size ||
580 (planes == 4 && offs[3] >= buf_size)) {
581 av_log(avctx, AV_LOG_ERROR,
582 "Invalid frame offsets\n");
583 return AVERROR_INVALIDDATA;
584 }
7af507ea 585 for (i = 0; i < planes; i++)
ffc638c2
KS
586 lag_decode_arith_plane(l, srcs[i],
587 avctx->width, avctx->height,
588 -l->rgb_stride, buf + offs[i],
0a82f527 589 buf_size - offs[i]);
ffc638c2 590 dst = p->data[0];
7af507ea 591 for (i = 0; i < planes; i++)
ffc638c2
KS
592 srcs[i] = l->rgb_planes + i * l->rgb_stride * avctx->height;
593 for (j = 0; j < avctx->height; j++) {
594 for (i = 0; i < avctx->width; i++) {
595 uint8_t r, g, b, a;
596 r = srcs[0][i];
597 g = srcs[1][i];
598 b = srcs[2][i];
ffc638c2
KS
599 r += g;
600 b += g;
7af507ea
TW
601 if (frametype == FRAME_ARITH_RGBA) {
602 a = srcs[3][i];
603 AV_WN32(dst + i * 4, MKBETAG(a, r, g, b));
604 } else {
605 dst[i * 3 + 0] = r;
606 dst[i * 3 + 1] = g;
607 dst[i * 3 + 2] = b;
608 }
ffc638c2
KS
609 }
610 dst += p->linesize[0];
7af507ea 611 for (i = 0; i < planes; i++)
ffc638c2
KS
612 srcs[i] += l->rgb_stride;
613 }
614 break;
464e9ab0 615 case FRAME_ARITH_YUY2:
716d413c 616 avctx->pix_fmt = AV_PIX_FMT_YUV422P;
464e9ab0 617
759001c5 618 if (ff_thread_get_buffer(avctx, &frame, 0) < 0) {
464e9ab0
KS
619 av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
620 return -1;
621 }
622
623 if (offset_ry >= buf_size ||
624 offset_gu >= buf_size ||
625 offset_bv >= buf_size) {
626 av_log(avctx, AV_LOG_ERROR,
627 "Invalid frame offsets\n");
628 return AVERROR_INVALIDDATA;
629 }
630
631 lag_decode_arith_plane(l, p->data[0], avctx->width, avctx->height,
632 p->linesize[0], buf + offset_ry,
633 buf_size - offset_ry);
464e9ab0
KS
634 lag_decode_arith_plane(l, p->data[1], avctx->width / 2,
635 avctx->height, p->linesize[1],
7191e1c4
RB
636 buf + offset_gu, buf_size - offset_gu);
637 lag_decode_arith_plane(l, p->data[2], avctx->width / 2,
638 avctx->height, p->linesize[2],
464e9ab0
KS
639 buf + offset_bv, buf_size - offset_bv);
640 break;
d267b339 641 case FRAME_ARITH_YV12:
716d413c 642 avctx->pix_fmt = AV_PIX_FMT_YUV420P;
d267b339 643
759001c5 644 if (ff_thread_get_buffer(avctx, &frame, 0) < 0) {
d267b339
CEH
645 av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
646 return -1;
647 }
648
0a82f527
RB
649 if (offset_ry >= buf_size ||
650 offset_gu >= buf_size ||
651 offset_bv >= buf_size) {
652 av_log(avctx, AV_LOG_ERROR,
653 "Invalid frame offsets\n");
654 return AVERROR_INVALIDDATA;
655 }
656
d267b339
CEH
657 lag_decode_arith_plane(l, p->data[0], avctx->width, avctx->height,
658 p->linesize[0], buf + offset_ry,
0a82f527 659 buf_size - offset_ry);
d267b339
CEH
660 lag_decode_arith_plane(l, p->data[2], avctx->width / 2,
661 avctx->height / 2, p->linesize[2],
0a82f527 662 buf + offset_gu, buf_size - offset_gu);
d267b339
CEH
663 lag_decode_arith_plane(l, p->data[1], avctx->width / 2,
664 avctx->height / 2, p->linesize[1],
0a82f527 665 buf + offset_bv, buf_size - offset_bv);
d267b339
CEH
666 break;
667 default:
668 av_log(avctx, AV_LOG_ERROR,
4f484037 669 "Unsupported Lagarith frame type: %#"PRIx8"\n", frametype);
d267b339
CEH
670 return -1;
671 }
672
df9b9567 673 *got_frame = 1;
d267b339
CEH
674
675 return buf_size;
676}
677
678static av_cold int lag_decode_init(AVCodecContext *avctx)
679{
680 LagarithContext *l = avctx->priv_data;
681 l->avctx = avctx;
682
0d439fbe 683 ff_huffyuvdsp_init(&l->hdsp);
d267b339
CEH
684
685 return 0;
686}
687
688static av_cold int lag_decode_end(AVCodecContext *avctx)
689{
690 LagarithContext *l = avctx->priv_data;
691
ffc638c2 692 av_freep(&l->rgb_planes);
d267b339
CEH
693
694 return 0;
695}
696
d36beb3f 697AVCodec ff_lagarith_decoder = {
ec6402b7 698 .name = "lagarith",
b2bed932 699 .long_name = NULL_IF_CONFIG_SMALL("Lagarith lossless"),
ec6402b7 700 .type = AVMEDIA_TYPE_VIDEO,
36ef5369 701 .id = AV_CODEC_ID_LAGARITH,
ec6402b7
AK
702 .priv_data_size = sizeof(LagarithContext),
703 .init = lag_decode_init,
704 .close = lag_decode_end,
705 .decode = lag_decode_frame,
def97856 706 .capabilities = AV_CODEC_CAP_DR1 | AV_CODEC_CAP_FRAME_THREADS,
d267b339 707};