2006-03-27 22:22:50 +00:00
|
|
|
/*
|
|
|
|
* RTJpeg decoding functions
|
|
|
|
* Copyright (c) 2006 Reimar Doeffinger
|
|
|
|
*
|
2006-10-07 15:30:46 +00:00
|
|
|
* This file is part of FFmpeg.
|
|
|
|
*
|
|
|
|
* FFmpeg is free software; you can redistribute it and/or
|
2006-03-27 22:22:50 +00:00
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
2006-10-07 15:30:46 +00:00
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
2006-03-27 22:22:50 +00:00
|
|
|
*
|
2006-10-07 15:30:46 +00:00
|
|
|
* FFmpeg is distributed in the hope that it will be useful,
|
2006-03-27 22:22:50 +00:00
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
2006-10-07 15:30:46 +00:00
|
|
|
* License along with FFmpeg; if not, write to the Free Software
|
2006-03-27 22:22:50 +00:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
2008-05-09 11:56:36 +00:00
|
|
|
#include "libavutil/common.h"
|
2009-04-13 16:20:26 +00:00
|
|
|
#include "get_bits.h"
|
2006-03-27 22:22:50 +00:00
|
|
|
#include "dsputil.h"
|
|
|
|
#include "rtjpeg.h"
|
|
|
|
|
|
|
|
#define PUT_COEFF(c) \
|
|
|
|
i = scan[coeff--]; \
|
|
|
|
block[i] = (c) * quant[i];
|
|
|
|
|
2011-10-30 17:27:33 +00:00
|
|
|
/// aligns the bitstream to the given power of two
|
2006-03-27 22:22:50 +00:00
|
|
|
#define ALIGN(a) \
|
|
|
|
n = (-get_bits_count(gb)) & (a - 1); \
|
|
|
|
if (n) {skip_bits(gb, n);}
|
|
|
|
|
|
|
|
/**
|
2011-06-23 20:41:54 +00:00
|
|
|
* @brief read one block from stream
|
|
|
|
* @param gb contains stream data
|
|
|
|
* @param block where data is written to
|
|
|
|
* @param scan array containing the mapping stream address -> block position
|
|
|
|
* @param quant quantization factors
|
|
|
|
* @return 0 means the block is not coded, < 0 means an error occurred.
|
2006-03-27 22:22:50 +00:00
|
|
|
*
|
|
|
|
* Note: GetBitContext is used to make the code simpler, since all data is
|
|
|
|
* aligned this could be done faster in a different way, e.g. as it is done
|
2008-04-08 15:16:48 +00:00
|
|
|
* in MPlayer libmpcodecs/native/rtjpegn.c.
|
2006-03-27 22:22:50 +00:00
|
|
|
*/
|
2013-01-20 00:02:29 +00:00
|
|
|
static inline int get_block(GetBitContext *gb, int16_t *block, const uint8_t *scan,
|
2008-02-01 16:20:27 +00:00
|
|
|
const uint32_t *quant) {
|
2006-03-27 22:22:50 +00:00
|
|
|
int coeff, i, n;
|
|
|
|
int8_t ac;
|
|
|
|
uint8_t dc = get_bits(gb, 8);
|
|
|
|
|
|
|
|
// block not coded
|
|
|
|
if (dc == 255)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
// number of non-zero coefficients
|
|
|
|
coeff = get_bits(gb, 6);
|
2011-11-05 21:07:22 +00:00
|
|
|
if (get_bits_left(gb) < (coeff << 1))
|
2009-05-24 09:06:06 +00:00
|
|
|
return -1;
|
2009-05-24 09:03:45 +00:00
|
|
|
|
2006-03-27 22:22:50 +00:00
|
|
|
// normally we would only need to clear the (63 - coeff) last values,
|
|
|
|
// but since we do not know where they are we just clear the whole block
|
2013-01-20 00:02:29 +00:00
|
|
|
memset(block, 0, 64 * sizeof(int16_t));
|
2006-03-27 22:22:50 +00:00
|
|
|
|
|
|
|
// 2 bits per coefficient
|
|
|
|
while (coeff) {
|
|
|
|
ac = get_sbits(gb, 2);
|
|
|
|
if (ac == -2)
|
|
|
|
break; // continue with more bits
|
|
|
|
PUT_COEFF(ac);
|
|
|
|
}
|
|
|
|
|
|
|
|
// 4 bits per coefficient
|
|
|
|
ALIGN(4);
|
2011-11-05 21:07:22 +00:00
|
|
|
if (get_bits_left(gb) < (coeff << 2))
|
2009-05-24 09:06:06 +00:00
|
|
|
return -1;
|
2006-03-27 22:22:50 +00:00
|
|
|
while (coeff) {
|
|
|
|
ac = get_sbits(gb, 4);
|
|
|
|
if (ac == -8)
|
|
|
|
break; // continue with more bits
|
|
|
|
PUT_COEFF(ac);
|
|
|
|
}
|
|
|
|
|
|
|
|
// 8 bits per coefficient
|
|
|
|
ALIGN(8);
|
2011-11-05 21:07:22 +00:00
|
|
|
if (get_bits_left(gb) < (coeff << 3))
|
2009-05-24 09:06:06 +00:00
|
|
|
return -1;
|
2006-03-27 22:22:50 +00:00
|
|
|
while (coeff) {
|
|
|
|
ac = get_sbits(gb, 8);
|
|
|
|
PUT_COEFF(ac);
|
|
|
|
}
|
|
|
|
|
|
|
|
PUT_COEFF(dc);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2011-06-23 20:41:54 +00:00
|
|
|
* @brief decode one rtjpeg YUV420 frame
|
2012-02-15 11:55:19 +00:00
|
|
|
* @param c context, must be initialized via ff_rtjpeg_decode_init
|
2011-06-23 20:41:54 +00:00
|
|
|
* @param f AVFrame to place decoded frame into. If parts of the frame
|
2006-03-27 22:22:50 +00:00
|
|
|
* are not coded they are left unchanged, so consider initializing it
|
2011-06-23 20:41:54 +00:00
|
|
|
* @param buf buffer containing input data
|
|
|
|
* @param buf_size length of input data in bytes
|
|
|
|
* @return number of bytes consumed from the input buffer
|
2006-03-27 22:22:50 +00:00
|
|
|
*/
|
2012-02-15 11:55:19 +00:00
|
|
|
int ff_rtjpeg_decode_frame_yuv420(RTJpegContext *c, AVFrame *f,
|
|
|
|
const uint8_t *buf, int buf_size) {
|
2006-03-27 22:22:50 +00:00
|
|
|
GetBitContext gb;
|
|
|
|
int w = c->w / 16, h = c->h / 16;
|
|
|
|
int x, y;
|
2006-11-06 17:56:08 +00:00
|
|
|
uint8_t *y1 = f->data[0], *y2 = f->data[0] + 8 * f->linesize[0];
|
|
|
|
uint8_t *u = f->data[1], *v = f->data[2];
|
2006-03-27 22:22:50 +00:00
|
|
|
init_get_bits(&gb, buf, buf_size * 8);
|
|
|
|
for (y = 0; y < h; y++) {
|
|
|
|
for (x = 0; x < w; x++) {
|
2011-11-05 21:26:42 +00:00
|
|
|
#define BLOCK(quant, dst, stride) do { \
|
|
|
|
int res = get_block(&gb, block, c->scan, quant); \
|
|
|
|
if (res < 0) \
|
|
|
|
return res; \
|
|
|
|
if (res > 0) \
|
|
|
|
c->dsp->idct_put(dst, stride, block); \
|
|
|
|
} while (0)
|
2013-01-20 00:02:29 +00:00
|
|
|
int16_t *block = c->block;
|
2011-11-05 21:26:42 +00:00
|
|
|
BLOCK(c->lquant, y1, f->linesize[0]);
|
2006-03-27 22:22:50 +00:00
|
|
|
y1 += 8;
|
2011-11-05 21:26:42 +00:00
|
|
|
BLOCK(c->lquant, y1, f->linesize[0]);
|
2006-03-27 22:22:50 +00:00
|
|
|
y1 += 8;
|
2011-11-05 21:26:42 +00:00
|
|
|
BLOCK(c->lquant, y2, f->linesize[0]);
|
2006-03-27 22:22:50 +00:00
|
|
|
y2 += 8;
|
2011-11-05 21:26:42 +00:00
|
|
|
BLOCK(c->lquant, y2, f->linesize[0]);
|
2006-03-27 22:22:50 +00:00
|
|
|
y2 += 8;
|
2011-11-05 21:26:42 +00:00
|
|
|
BLOCK(c->cquant, u, f->linesize[1]);
|
2006-03-27 22:22:50 +00:00
|
|
|
u += 8;
|
2011-11-05 21:26:42 +00:00
|
|
|
BLOCK(c->cquant, v, f->linesize[2]);
|
2006-03-27 22:22:50 +00:00
|
|
|
v += 8;
|
|
|
|
}
|
|
|
|
y1 += 2 * 8 * (f->linesize[0] - w);
|
|
|
|
y2 += 2 * 8 * (f->linesize[0] - w);
|
|
|
|
u += 8 * (f->linesize[1] - w);
|
|
|
|
v += 8 * (f->linesize[2] - w);
|
|
|
|
}
|
|
|
|
return get_bits_count(&gb) / 8;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2011-06-23 20:41:54 +00:00
|
|
|
* @brief initialize an RTJpegContext, may be called multiple times
|
|
|
|
* @param c context to initialize
|
|
|
|
* @param dsp specifies the idct to use for decoding
|
|
|
|
* @param width width of image, will be rounded down to the nearest multiple
|
2006-03-27 22:22:50 +00:00
|
|
|
* of 16 for decoding
|
2011-06-23 20:41:54 +00:00
|
|
|
* @param height height of image, will be rounded down to the nearest multiple
|
2006-03-27 22:22:50 +00:00
|
|
|
* of 16 for decoding
|
2011-06-23 20:41:54 +00:00
|
|
|
* @param lquant luma quantization table to use
|
|
|
|
* @param cquant chroma quantization table to use
|
2006-03-27 22:22:50 +00:00
|
|
|
*/
|
2012-02-15 11:55:19 +00:00
|
|
|
void ff_rtjpeg_decode_init(RTJpegContext *c, DSPContext *dsp,
|
|
|
|
int width, int height,
|
|
|
|
const uint32_t *lquant, const uint32_t *cquant) {
|
2006-03-27 22:22:50 +00:00
|
|
|
int i;
|
|
|
|
c->dsp = dsp;
|
|
|
|
for (i = 0; i < 64; i++) {
|
|
|
|
int z = ff_zigzag_direct[i];
|
|
|
|
int p = c->dsp->idct_permutation[i];
|
|
|
|
z = ((z << 3) | (z >> 3)) & 63; // rtjpeg uses a transposed variant
|
|
|
|
|
|
|
|
// permute the scan and quantization tables for the chosen idct
|
|
|
|
c->scan[i] = c->dsp->idct_permutation[z];
|
|
|
|
c->lquant[p] = lquant[i];
|
|
|
|
c->cquant[p] = cquant[i];
|
|
|
|
}
|
|
|
|
c->w = width;
|
|
|
|
c->h = height;
|
|
|
|
}
|