3 * Copyright (c) 2011 Konstantin Shishkov
5 * This file is part of FFmpeg.
7 * FFmpeg is free software; you can redistribute it and/or
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.
12 * FFmpeg is distributed in the hope that it will be useful,
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.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
30 #include "libavutil/intreadwrite.h"
33 #include "bytestream.h"
39 static int build_huff10(const uint8_t *src, VLC *vlc, int *fsym)
50 for (i = 0; i < 1024; i++) {
54 qsort(he, 1024, sizeof(*he), ff_ut10_huff_cmp_len);
62 while (he[last].len == 255 && last)
65 if (he[last].len > 32) {
70 for (i = last; i >= 0; i--) {
71 codes[i] = code >> (32 - he[i].len);
74 code += 0x80000000u >> (he[i].len - 1);
77 return ff_init_vlc_sparse(vlc, FFMIN(he[last].len, 11), last + 1,
78 bits, sizeof(*bits), sizeof(*bits),
79 codes, sizeof(*codes), sizeof(*codes),
80 syms, sizeof(*syms), sizeof(*syms), 0);
83 static int build_huff(const uint8_t *src, VLC *vlc, int *fsym)
94 for (i = 0; i < 256; i++) {
98 qsort(he, 256, sizeof(*he), ff_ut_huff_cmp_len);
106 while (he[last].len == 255 && last)
109 if (he[last].len > 32)
113 for (i = last; i >= 0; i--) {
114 codes[i] = code >> (32 - he[i].len);
117 code += 0x80000000u >> (he[i].len - 1);
120 return ff_init_vlc_sparse(vlc, FFMIN(he[last].len, 11), last + 1,
121 bits, sizeof(*bits), sizeof(*bits),
122 codes, sizeof(*codes), sizeof(*codes),
123 syms, sizeof(*syms), sizeof(*syms), 0);
126 static int decode_plane10(UtvideoContext *c, int plane_no,
127 uint16_t *dst, int step, ptrdiff_t stride,
128 int width, int height,
129 const uint8_t *src, const uint8_t *huff,
132 int i, j, slice, pix, ret;
138 if ((ret = build_huff10(huff, &vlc, &fsym)) < 0) {
139 av_log(c->avctx, AV_LOG_ERROR, "Cannot build Huffman codes\n");
142 if (fsym >= 0) { // build_huff reported a symbol to fill slices with
144 for (slice = 0; slice < c->slices; slice++) {
148 send = (height * (slice + 1) / c->slices);
149 dest = dst + sstart * stride;
152 for (j = sstart; j < send; j++) {
153 for (i = 0; i < width * step; i += step) {
169 for (slice = 0; slice < c->slices; slice++) {
171 int slice_data_start, slice_data_end, slice_size;
174 send = (height * (slice + 1) / c->slices);
175 dest = dst + sstart * stride;
177 // slice offset and size validation was done earlier
178 slice_data_start = slice ? AV_RL32(src + slice * 4 - 4) : 0;
179 slice_data_end = AV_RL32(src + slice * 4);
180 slice_size = slice_data_end - slice_data_start;
183 av_log(c->avctx, AV_LOG_ERROR, "Plane has more than one symbol "
184 "yet a slice has a length of zero.\n");
188 memcpy(c->slice_bits, src + slice_data_start + c->slices * 4,
190 memset(c->slice_bits + slice_size, 0, AV_INPUT_BUFFER_PADDING_SIZE);
191 c->bdsp.bswap_buf((uint32_t *) c->slice_bits,
192 (uint32_t *) c->slice_bits,
193 (slice_data_end - slice_data_start + 3) >> 2);
194 init_get_bits(&gb, c->slice_bits, slice_size * 8);
197 for (j = sstart; j < send; j++) {
198 for (i = 0; i < width * step; i += step) {
199 if (get_bits_left(&gb) <= 0) {
200 av_log(c->avctx, AV_LOG_ERROR,
201 "Slice decoding ran out of bits\n");
204 pix = get_vlc2(&gb, vlc.table, vlc.bits, 3);
206 av_log(c->avctx, AV_LOG_ERROR, "Decoding error\n");
218 if (get_bits_left(&gb) > 32)
219 av_log(c->avctx, AV_LOG_WARNING,
220 "%d bits left after decoding slice\n", get_bits_left(&gb));
228 return AVERROR_INVALIDDATA;
231 static int decode_plane(UtvideoContext *c, int plane_no,
232 uint8_t *dst, int step, ptrdiff_t stride,
233 int width, int height,
234 const uint8_t *src, int use_pred)
236 int i, j, slice, pix;
241 const int cmask = c->interlaced ? ~(1 + 2 * (!plane_no && c->avctx->pix_fmt == AV_PIX_FMT_YUV420P)) : ~(!plane_no && c->avctx->pix_fmt == AV_PIX_FMT_YUV420P);
243 if (build_huff(src, &vlc, &fsym)) {
244 av_log(c->avctx, AV_LOG_ERROR, "Cannot build Huffman codes\n");
245 return AVERROR_INVALIDDATA;
247 if (fsym >= 0) { // build_huff reported a symbol to fill slices with
249 for (slice = 0; slice < c->slices; slice++) {
253 send = (height * (slice + 1) / c->slices) & cmask;
254 dest = dst + sstart * stride;
257 for (j = sstart; j < send; j++) {
258 for (i = 0; i < width * step; i += step) {
275 for (slice = 0; slice < c->slices; slice++) {
277 int slice_data_start, slice_data_end, slice_size;
280 send = (height * (slice + 1) / c->slices) & cmask;
281 dest = dst + sstart * stride;
283 // slice offset and size validation was done earlier
284 slice_data_start = slice ? AV_RL32(src + slice * 4 - 4) : 0;
285 slice_data_end = AV_RL32(src + slice * 4);
286 slice_size = slice_data_end - slice_data_start;
289 av_log(c->avctx, AV_LOG_ERROR, "Plane has more than one symbol "
290 "yet a slice has a length of zero.\n");
294 memcpy(c->slice_bits, src + slice_data_start + c->slices * 4,
296 memset(c->slice_bits + slice_size, 0, AV_INPUT_BUFFER_PADDING_SIZE);
297 c->bdsp.bswap_buf((uint32_t *) c->slice_bits,
298 (uint32_t *) c->slice_bits,
299 (slice_data_end - slice_data_start + 3) >> 2);
300 init_get_bits(&gb, c->slice_bits, slice_size * 8);
303 for (j = sstart; j < send; j++) {
304 for (i = 0; i < width * step; i += step) {
305 if (get_bits_left(&gb) <= 0) {
306 av_log(c->avctx, AV_LOG_ERROR,
307 "Slice decoding ran out of bits\n");
310 pix = get_vlc2(&gb, vlc.table, vlc.bits, 3);
312 av_log(c->avctx, AV_LOG_ERROR, "Decoding error\n");
323 if (get_bits_left(&gb) > 32)
324 av_log(c->avctx, AV_LOG_WARNING,
325 "%d bits left after decoding slice\n", get_bits_left(&gb));
333 return AVERROR_INVALIDDATA;
336 static void restore_rgb_planes(uint8_t *src, int step, ptrdiff_t stride,
337 int width, int height)
342 for (j = 0; j < height; j++) {
343 for (i = 0; i < width * step; i += step) {
347 src[i] = r + g - 0x80;
348 src[i + 2] = b + g - 0x80;
354 static void restore_rgb_planes10(AVFrame *frame, int width, int height)
356 uint16_t *src_r = (uint16_t *)frame->data[2];
357 uint16_t *src_g = (uint16_t *)frame->data[0];
358 uint16_t *src_b = (uint16_t *)frame->data[1];
362 for (j = 0; j < height; j++) {
363 for (i = 0; i < width; i++) {
367 src_r[i] = (r + g - 0x200) & 0x3FF;
368 src_b[i] = (b + g - 0x200) & 0x3FF;
370 src_r += frame->linesize[2] / 2;
371 src_g += frame->linesize[0] / 2;
372 src_b += frame->linesize[1] / 2;
380 static void restore_median_planar(UtvideoContext *c, uint8_t *src, ptrdiff_t stride,
381 int width, int height, int slices, int rmode)
386 int slice_start, slice_height;
387 const int cmask = ~rmode;
389 for (slice = 0; slice < slices; slice++) {
390 slice_start = ((slice * height) / slices) & cmask;
391 slice_height = ((((slice + 1) * height) / slices) & cmask) -
396 bsrc = src + slice_start * stride;
398 // first line - left neighbour prediction
400 c->llviddsp.add_left_pred(bsrc, bsrc, width, 0);
402 if (slice_height <= 1)
404 // second line - first element has top prediction, the rest uses median
408 for (i = 1; i < width; i++) {
409 B = bsrc[i - stride];
410 bsrc[i] += mid_pred(A, B, (uint8_t)(A + B - C));
415 // the rest of lines use continuous median prediction
416 for (j = 2; j < slice_height; j++) {
417 c->llviddsp.add_median_pred(bsrc, bsrc - stride,
418 bsrc, width, &A, &B);
424 /* UtVideo interlaced mode treats every two lines as a single one,
425 * so restoring function should take care of possible padding between
426 * two parts of the same "line".
428 static void restore_median_planar_il(UtvideoContext *c, uint8_t *src, ptrdiff_t stride,
429 int width, int height, int slices, int rmode)
434 int slice_start, slice_height;
435 const int cmask = ~(rmode ? 3 : 1);
436 const ptrdiff_t stride2 = stride << 1;
438 for (slice = 0; slice < slices; slice++) {
439 slice_start = ((slice * height) / slices) & cmask;
440 slice_height = ((((slice + 1) * height) / slices) & cmask) -
446 bsrc = src + slice_start * stride;
448 // first line - left neighbour prediction
450 A = c->llviddsp.add_left_pred(bsrc, bsrc, width, 0);
451 c->llviddsp.add_left_pred(bsrc + stride, bsrc + stride, width, A);
453 if (slice_height <= 1)
455 // second line - first element has top prediction, the rest uses median
459 for (i = 1; i < width; i++) {
460 B = bsrc[i - stride2];
461 bsrc[i] += mid_pred(A, B, (uint8_t)(A + B - C));
465 c->llviddsp.add_median_pred(bsrc + stride, bsrc - stride,
466 bsrc + stride, width, &A, &B);
468 // the rest of lines use continuous median prediction
469 for (j = 2; j < slice_height; j++) {
470 c->llviddsp.add_median_pred(bsrc, bsrc - stride2,
471 bsrc, width, &A, &B);
472 c->llviddsp.add_median_pred(bsrc + stride, bsrc - stride,
473 bsrc + stride, width, &A, &B);
479 static void restore_median_packed(uint8_t *src, int step, ptrdiff_t stride,
480 int width, int height, int slices, int rmode)
485 int slice_start, slice_height;
486 const int cmask = ~rmode;
488 for (slice = 0; slice < slices; slice++) {
489 slice_start = ((slice * height) / slices) & cmask;
490 slice_height = ((((slice + 1) * height) / slices) & cmask) -
495 bsrc = src + slice_start * stride;
497 // first line - left neighbour prediction
500 for (i = step; i < width * step; i += step) {
505 if (slice_height <= 1)
507 // second line - first element has top prediction, the rest uses median
511 for (i = step; i < width * step; i += step) {
512 B = bsrc[i - stride];
513 bsrc[i] += mid_pred(A, B, (uint8_t)(A + B - C));
518 // the rest of lines use continuous median prediction
519 for (j = 2; j < slice_height; j++) {
520 for (i = 0; i < width * step; i += step) {
521 B = bsrc[i - stride];
522 bsrc[i] += mid_pred(A, B, (uint8_t)(A + B - C));
531 /* UtVideo interlaced mode treats every two lines as a single one,
532 * so restoring function should take care of possible padding between
533 * two parts of the same "line".
535 static void restore_median_packed_il(uint8_t *src, int step, ptrdiff_t stride,
536 int width, int height, int slices, int rmode)
541 int slice_start, slice_height;
542 const int cmask = ~(rmode ? 3 : 1);
543 const ptrdiff_t stride2 = stride << 1;
545 for (slice = 0; slice < slices; slice++) {
546 slice_start = ((slice * height) / slices) & cmask;
547 slice_height = ((((slice + 1) * height) / slices) & cmask) -
553 bsrc = src + slice_start * stride;
555 // first line - left neighbour prediction
558 for (i = step; i < width * step; i += step) {
562 for (i = 0; i < width * step; i += step) {
563 bsrc[stride + i] += A;
564 A = bsrc[stride + i];
567 if (slice_height <= 1)
569 // second line - first element has top prediction, the rest uses median
573 for (i = step; i < width * step; i += step) {
574 B = bsrc[i - stride2];
575 bsrc[i] += mid_pred(A, B, (uint8_t)(A + B - C));
579 for (i = 0; i < width * step; i += step) {
580 B = bsrc[i - stride];
581 bsrc[stride + i] += mid_pred(A, B, (uint8_t)(A + B - C));
583 A = bsrc[stride + i];
586 // the rest of lines use continuous median prediction
587 for (j = 2; j < slice_height; j++) {
588 for (i = 0; i < width * step; i += step) {
589 B = bsrc[i - stride2];
590 bsrc[i] += mid_pred(A, B, (uint8_t)(A + B - C));
594 for (i = 0; i < width * step; i += step) {
595 B = bsrc[i - stride];
596 bsrc[i + stride] += mid_pred(A, B, (uint8_t)(A + B - C));
598 A = bsrc[i + stride];
605 static void restore_gradient_planar(UtvideoContext *c, uint8_t *src, ptrdiff_t stride,
606 int width, int height, int slices, int rmode)
611 int slice_start, slice_height;
612 const int cmask = ~rmode;
614 for (slice = 0; slice < slices; slice++) {
615 slice_start = ((slice * height) / slices) & cmask;
616 slice_height = ((((slice + 1) * height) / slices) & cmask) -
621 bsrc = src + slice_start * stride;
623 // first line - left neighbour prediction
625 c->llviddsp.add_left_pred(bsrc, bsrc, width, 0);
627 if (slice_height <= 1)
629 for (j = 1; j < slice_height; j++) {
630 // second line - first element has top prediction, the rest uses gradient
631 bsrc[0] = (bsrc[0] + bsrc[-stride]) & 0xFF;
632 for (i = 1; i < width; i++) {
633 A = bsrc[i - stride];
634 B = bsrc[i - (stride + 1)];
636 bsrc[i] = (A - B + C + bsrc[i]) & 0xFF;
643 static void restore_gradient_planar_il(UtvideoContext *c, uint8_t *src, ptrdiff_t stride,
644 int width, int height, int slices, int rmode)
649 int slice_start, slice_height;
650 const int cmask = ~(rmode ? 3 : 1);
651 const ptrdiff_t stride2 = stride << 1;
653 for (slice = 0; slice < slices; slice++) {
654 slice_start = ((slice * height) / slices) & cmask;
655 slice_height = ((((slice + 1) * height) / slices) & cmask) -
661 bsrc = src + slice_start * stride;
663 // first line - left neighbour prediction
665 A = c->llviddsp.add_left_pred(bsrc, bsrc, width, 0);
666 c->llviddsp.add_left_pred(bsrc + stride, bsrc + stride, width, A);
668 if (slice_height <= 1)
670 for (j = 1; j < slice_height; j++) {
671 // second line - first element has top prediction, the rest uses gradient
672 bsrc[0] = (bsrc[0] + bsrc[-stride2]) & 0xFF;
673 for (i = 1; i < width; i++) {
674 A = bsrc[i - stride2];
675 B = bsrc[i - (stride2 + 1)];
677 bsrc[i] = (A - B + C + bsrc[i]) & 0xFF;
680 B = bsrc[-(1 + stride + stride - width)];
682 bsrc[stride] = (A - B + C + bsrc[stride]) & 0xFF;
683 for (i = 1; i < width; i++) {
684 A = bsrc[i - stride];
685 B = bsrc[i - (1 + stride)];
686 C = bsrc[i - 1 + stride];
687 bsrc[i + stride] = (A - B + C + bsrc[i + stride]) & 0xFF;
694 static void restore_gradient_packed(uint8_t *src, int step, ptrdiff_t stride,
695 int width, int height, int slices, int rmode)
700 int slice_start, slice_height;
701 const int cmask = ~rmode;
703 for (slice = 0; slice < slices; slice++) {
704 slice_start = ((slice * height) / slices) & cmask;
705 slice_height = ((((slice + 1) * height) / slices) & cmask) -
710 bsrc = src + slice_start * stride;
712 // first line - left neighbour prediction
715 for (i = step; i < width * step; i += step) {
720 if (slice_height <= 1)
722 for (j = 1; j < slice_height; j++) {
723 // second line - first element has top prediction, the rest uses gradient
726 for (i = step; i < width * step; i += step) {
727 A = bsrc[i - stride];
728 B = bsrc[i - (stride + step)];
730 bsrc[i] = (A - B + C + bsrc[i]) & 0xFF;
737 static void restore_gradient_packed_il(uint8_t *src, int step, ptrdiff_t stride,
738 int width, int height, int slices, int rmode)
743 int slice_start, slice_height;
744 const int cmask = ~(rmode ? 3 : 1);
745 const ptrdiff_t stride2 = stride << 1;
747 for (slice = 0; slice < slices; slice++) {
748 slice_start = ((slice * height) / slices) & cmask;
749 slice_height = ((((slice + 1) * height) / slices) & cmask) -
755 bsrc = src + slice_start * stride;
757 // first line - left neighbour prediction
760 for (i = step; i < width * step; i += step) {
764 for (i = 0; i < width * step; i += step) {
765 bsrc[stride + i] += A;
766 A = bsrc[stride + i];
769 if (slice_height <= 1)
771 for (j = 1; j < slice_height; j++) {
772 // second line - first element has top prediction, the rest uses gradient
775 for (i = step; i < width * step; i += step) {
776 A = bsrc[i - stride2];
777 B = bsrc[i - (stride2 + step)];
779 bsrc[i] = (A - B + C + bsrc[i]) & 0xFF;
782 B = bsrc[-(step + stride + stride - width * step)];
783 C = bsrc[width * step - step];
784 bsrc[stride] = (A - B + C + bsrc[stride]) & 0xFF;
785 for (i = step; i < width * step; i += step) {
786 A = bsrc[i - stride];
787 B = bsrc[i - (step + stride)];
788 C = bsrc[i - step + stride];
789 bsrc[i + stride] = (A - B + C + bsrc[i + stride]) & 0xFF;
796 static int decode_frame(AVCodecContext *avctx, void *data, int *got_frame,
799 const uint8_t *buf = avpkt->data;
800 int buf_size = avpkt->size;
801 UtvideoContext *c = avctx->priv_data;
803 const uint8_t *plane_start[5];
804 int plane_size, max_slice_size = 0, slice_start, slice_end, slice_size;
807 ThreadFrame frame = { .f = data };
809 if ((ret = ff_thread_get_buffer(avctx, &frame, 0)) < 0)
812 /* parse plane structure to get frame flags and validate slice offsets */
813 bytestream2_init(&gb, buf, buf_size);
815 if (bytestream2_get_bytes_left(&gb) < c->frame_info_size) {
816 av_log(avctx, AV_LOG_ERROR, "Not enough data for frame information\n");
817 return AVERROR_INVALIDDATA;
819 c->frame_info = bytestream2_get_le32u(&gb);
820 c->slices = ((c->frame_info >> 16) & 0xff) + 1;
821 for (i = 0; i < c->planes; i++) {
822 plane_start[i] = gb.buffer;
823 if (bytestream2_get_bytes_left(&gb) < 1024 + 4 * c->slices) {
824 av_log(avctx, AV_LOG_ERROR, "Insufficient data for a plane\n");
825 return AVERROR_INVALIDDATA;
829 for (j = 0; j < c->slices; j++) {
830 slice_end = bytestream2_get_le32u(&gb);
831 if (slice_end < 0 || slice_end < slice_start ||
832 bytestream2_get_bytes_left(&gb) < slice_end) {
833 av_log(avctx, AV_LOG_ERROR, "Incorrect slice size\n");
834 return AVERROR_INVALIDDATA;
836 slice_size = slice_end - slice_start;
837 slice_start = slice_end;
838 max_slice_size = FFMAX(max_slice_size, slice_size);
840 plane_size = slice_end;
841 bytestream2_skipu(&gb, plane_size);
842 bytestream2_skipu(&gb, 1024);
844 plane_start[c->planes] = gb.buffer;
846 for (i = 0; i < c->planes; i++) {
847 plane_start[i] = gb.buffer;
848 if (bytestream2_get_bytes_left(&gb) < 256 + 4 * c->slices) {
849 av_log(avctx, AV_LOG_ERROR, "Insufficient data for a plane\n");
850 return AVERROR_INVALIDDATA;
852 bytestream2_skipu(&gb, 256);
855 for (j = 0; j < c->slices; j++) {
856 slice_end = bytestream2_get_le32u(&gb);
857 if (slice_end < 0 || slice_end < slice_start ||
858 bytestream2_get_bytes_left(&gb) < slice_end) {
859 av_log(avctx, AV_LOG_ERROR, "Incorrect slice size\n");
860 return AVERROR_INVALIDDATA;
862 slice_size = slice_end - slice_start;
863 slice_start = slice_end;
864 max_slice_size = FFMAX(max_slice_size, slice_size);
866 plane_size = slice_end;
867 bytestream2_skipu(&gb, plane_size);
869 plane_start[c->planes] = gb.buffer;
870 if (bytestream2_get_bytes_left(&gb) < c->frame_info_size) {
871 av_log(avctx, AV_LOG_ERROR, "Not enough data for frame information\n");
872 return AVERROR_INVALIDDATA;
874 c->frame_info = bytestream2_get_le32u(&gb);
876 av_log(avctx, AV_LOG_DEBUG, "frame information flags %"PRIX32"\n",
879 c->frame_pred = (c->frame_info >> 8) & 3;
881 av_fast_malloc(&c->slice_bits, &c->slice_bits_size,
882 max_slice_size + AV_INPUT_BUFFER_PADDING_SIZE);
884 if (!c->slice_bits) {
885 av_log(avctx, AV_LOG_ERROR, "Cannot allocate temporary buffer\n");
886 return AVERROR(ENOMEM);
889 switch (c->avctx->pix_fmt) {
890 case AV_PIX_FMT_RGB24:
891 case AV_PIX_FMT_RGBA:
892 for (i = 0; i < c->planes; i++) {
893 ret = decode_plane(c, i, frame.f->data[0] + ff_ut_rgb_order[i],
894 c->planes, frame.f->linesize[0], avctx->width,
895 avctx->height, plane_start[i],
896 c->frame_pred == PRED_LEFT);
899 if (c->frame_pred == PRED_MEDIAN) {
900 if (!c->interlaced) {
901 restore_median_packed(frame.f->data[0] + ff_ut_rgb_order[i],
902 c->planes, frame.f->linesize[0], avctx->width,
903 avctx->height, c->slices, 0);
905 restore_median_packed_il(frame.f->data[0] + ff_ut_rgb_order[i],
906 c->planes, frame.f->linesize[0],
907 avctx->width, avctx->height, c->slices,
910 } else if (c->frame_pred == PRED_GRADIENT) {
911 if (!c->interlaced) {
912 restore_gradient_packed(frame.f->data[0] + ff_ut_rgb_order[i],
913 c->planes, frame.f->linesize[0], avctx->width,
914 avctx->height, c->slices, 0);
916 restore_gradient_packed_il(frame.f->data[0] + ff_ut_rgb_order[i],
917 c->planes, frame.f->linesize[0],
918 avctx->width, avctx->height, c->slices,
923 restore_rgb_planes(frame.f->data[0], c->planes, frame.f->linesize[0],
924 avctx->width, avctx->height);
926 case AV_PIX_FMT_GBRAP10:
927 case AV_PIX_FMT_GBRP10:
928 for (i = 0; i < c->planes; i++) {
929 ret = decode_plane10(c, i, (uint16_t *)frame.f->data[i], 1,
930 frame.f->linesize[i] / 2, avctx->width,
931 avctx->height, plane_start[i],
932 plane_start[i + 1] - 1024,
933 c->frame_pred == PRED_LEFT);
937 restore_rgb_planes10(frame.f, avctx->width, avctx->height);
939 case AV_PIX_FMT_YUV420P:
940 for (i = 0; i < 3; i++) {
941 ret = decode_plane(c, i, frame.f->data[i], 1, frame.f->linesize[i],
942 avctx->width >> !!i, avctx->height >> !!i,
943 plane_start[i], c->frame_pred == PRED_LEFT);
946 if (c->frame_pred == PRED_MEDIAN) {
947 if (!c->interlaced) {
948 restore_median_planar(c, frame.f->data[i], frame.f->linesize[i],
949 avctx->width >> !!i, avctx->height >> !!i,
952 restore_median_planar_il(c, frame.f->data[i], frame.f->linesize[i],
954 avctx->height >> !!i,
957 } else if (c->frame_pred == PRED_GRADIENT) {
958 if (!c->interlaced) {
959 restore_gradient_planar(c, frame.f->data[i], frame.f->linesize[i],
960 avctx->width >> !!i, avctx->height >> !!i,
963 restore_gradient_planar_il(c, frame.f->data[i], frame.f->linesize[i],
965 avctx->height >> !!i,
971 case AV_PIX_FMT_YUV422P:
972 for (i = 0; i < 3; i++) {
973 ret = decode_plane(c, i, frame.f->data[i], 1, frame.f->linesize[i],
974 avctx->width >> !!i, avctx->height,
975 plane_start[i], c->frame_pred == PRED_LEFT);
978 if (c->frame_pred == PRED_MEDIAN) {
979 if (!c->interlaced) {
980 restore_median_planar(c, frame.f->data[i], frame.f->linesize[i],
981 avctx->width >> !!i, avctx->height,
984 restore_median_planar_il(c, frame.f->data[i], frame.f->linesize[i],
985 avctx->width >> !!i, avctx->height,
988 } else if (c->frame_pred == PRED_GRADIENT) {
989 if (!c->interlaced) {
990 restore_gradient_planar(c, frame.f->data[i], frame.f->linesize[i],
991 avctx->width >> !!i, avctx->height,
994 restore_gradient_planar_il(c, frame.f->data[i], frame.f->linesize[i],
995 avctx->width >> !!i, avctx->height,
1001 case AV_PIX_FMT_YUV444P:
1002 for (i = 0; i < 3; i++) {
1003 ret = decode_plane(c, i, frame.f->data[i], 1, frame.f->linesize[i],
1004 avctx->width, avctx->height,
1005 plane_start[i], c->frame_pred == PRED_LEFT);
1008 if (c->frame_pred == PRED_MEDIAN) {
1009 if (!c->interlaced) {
1010 restore_median_planar(c, frame.f->data[i], frame.f->linesize[i],
1011 avctx->width, avctx->height,
1014 restore_median_planar_il(c, frame.f->data[i], frame.f->linesize[i],
1015 avctx->width, avctx->height,
1018 } else if (c->frame_pred == PRED_GRADIENT) {
1019 if (!c->interlaced) {
1020 restore_gradient_planar(c, frame.f->data[i], frame.f->linesize[i],
1021 avctx->width, avctx->height,
1024 restore_gradient_planar_il(c, frame.f->data[i], frame.f->linesize[i],
1025 avctx->width, avctx->height,
1031 case AV_PIX_FMT_YUV422P10:
1032 for (i = 0; i < 3; i++) {
1033 ret = decode_plane10(c, i, (uint16_t *)frame.f->data[i], 1, frame.f->linesize[i] / 2,
1034 avctx->width >> !!i, avctx->height,
1035 plane_start[i], plane_start[i + 1] - 1024, c->frame_pred == PRED_LEFT);
1042 frame.f->key_frame = 1;
1043 frame.f->pict_type = AV_PICTURE_TYPE_I;
1044 frame.f->interlaced_frame = !!c->interlaced;
1048 /* always report that the buffer was completely consumed */
1052 static av_cold int decode_init(AVCodecContext *avctx)
1054 UtvideoContext * const c = avctx->priv_data;
1058 ff_bswapdsp_init(&c->bdsp);
1059 ff_llviddsp_init(&c->llviddsp);
1061 if (avctx->extradata_size >= 16) {
1062 av_log(avctx, AV_LOG_DEBUG, "Encoder version %d.%d.%d.%d\n",
1063 avctx->extradata[3], avctx->extradata[2],
1064 avctx->extradata[1], avctx->extradata[0]);
1065 av_log(avctx, AV_LOG_DEBUG, "Original format %"PRIX32"\n",
1066 AV_RB32(avctx->extradata + 4));
1067 c->frame_info_size = AV_RL32(avctx->extradata + 8);
1068 c->flags = AV_RL32(avctx->extradata + 12);
1070 if (c->frame_info_size != 4)
1071 avpriv_request_sample(avctx, "Frame info not 4 bytes");
1072 av_log(avctx, AV_LOG_DEBUG, "Encoding parameters %08"PRIX32"\n", c->flags);
1073 c->slices = (c->flags >> 24) + 1;
1074 c->compression = c->flags & 1;
1075 c->interlaced = c->flags & 0x800;
1076 } else if (avctx->extradata_size == 8) {
1077 av_log(avctx, AV_LOG_DEBUG, "Encoder version %d.%d.%d.%d\n",
1078 avctx->extradata[3], avctx->extradata[2],
1079 avctx->extradata[1], avctx->extradata[0]);
1080 av_log(avctx, AV_LOG_DEBUG, "Original format %"PRIX32"\n",
1081 AV_RB32(avctx->extradata + 4));
1084 c->frame_info_size = 4;
1086 av_log(avctx, AV_LOG_ERROR,
1087 "Insufficient extradata size %d, should be at least 16\n",
1088 avctx->extradata_size);
1089 return AVERROR_INVALIDDATA;
1092 c->slice_bits_size = 0;
1094 switch (avctx->codec_tag) {
1095 case MKTAG('U', 'L', 'R', 'G'):
1097 avctx->pix_fmt = AV_PIX_FMT_RGB24;
1099 case MKTAG('U', 'L', 'R', 'A'):
1101 avctx->pix_fmt = AV_PIX_FMT_RGBA;
1103 case MKTAG('U', 'L', 'Y', '0'):
1105 avctx->pix_fmt = AV_PIX_FMT_YUV420P;
1106 avctx->colorspace = AVCOL_SPC_BT470BG;
1108 case MKTAG('U', 'L', 'Y', '2'):
1110 avctx->pix_fmt = AV_PIX_FMT_YUV422P;
1111 avctx->colorspace = AVCOL_SPC_BT470BG;
1113 case MKTAG('U', 'L', 'Y', '4'):
1115 avctx->pix_fmt = AV_PIX_FMT_YUV444P;
1116 avctx->colorspace = AVCOL_SPC_BT470BG;
1118 case MKTAG('U', 'Q', 'Y', '2'):
1120 avctx->pix_fmt = AV_PIX_FMT_YUV422P10;
1122 case MKTAG('U', 'Q', 'R', 'G'):
1124 avctx->pix_fmt = AV_PIX_FMT_GBRP10;
1126 case MKTAG('U', 'Q', 'R', 'A'):
1128 avctx->pix_fmt = AV_PIX_FMT_GBRAP10;
1130 case MKTAG('U', 'L', 'H', '0'):
1132 avctx->pix_fmt = AV_PIX_FMT_YUV420P;
1133 avctx->colorspace = AVCOL_SPC_BT709;
1135 case MKTAG('U', 'L', 'H', '2'):
1137 avctx->pix_fmt = AV_PIX_FMT_YUV422P;
1138 avctx->colorspace = AVCOL_SPC_BT709;
1140 case MKTAG('U', 'L', 'H', '4'):
1142 avctx->pix_fmt = AV_PIX_FMT_YUV444P;
1143 avctx->colorspace = AVCOL_SPC_BT709;
1146 av_log(avctx, AV_LOG_ERROR, "Unknown Ut Video FOURCC provided (%08X)\n",
1148 return AVERROR_INVALIDDATA;
1154 static av_cold int decode_end(AVCodecContext *avctx)
1156 UtvideoContext * const c = avctx->priv_data;
1158 av_freep(&c->slice_bits);
1163 AVCodec ff_utvideo_decoder = {
1165 .long_name = NULL_IF_CONFIG_SMALL("Ut Video"),
1166 .type = AVMEDIA_TYPE_VIDEO,
1167 .id = AV_CODEC_ID_UTVIDEO,
1168 .priv_data_size = sizeof(UtvideoContext),
1169 .init = decode_init,
1170 .close = decode_end,
1171 .decode = decode_frame,
1172 .capabilities = AV_CODEC_CAP_DR1 | AV_CODEC_CAP_FRAME_THREADS,
1173 .caps_internal = FF_CODEC_CAP_INIT_THREADSAFE,