2004-10-30 03:43:37 +02:00
|
|
|
/*
|
|
|
|
* Range coder
|
|
|
|
* Copyright (c) 2004 Michael Niedermayer <michaelni@gmx.at>
|
|
|
|
*
|
2011-03-18 18:35:10 +01:00
|
|
|
* This file is part of Libav.
|
2006-10-07 17:30:46 +02:00
|
|
|
*
|
2011-03-18 18:35:10 +01:00
|
|
|
* Libav is free software; you can redistribute it and/or
|
2004-10-30 03:43:37 +02:00
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
2006-10-07 17:30:46 +02:00
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
2004-10-30 03:43:37 +02:00
|
|
|
*
|
2011-03-18 18:35:10 +01:00
|
|
|
* Libav is distributed in the hope that it will be useful,
|
2004-10-30 03:43:37 +02: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
|
2011-03-18 18:35:10 +01:00
|
|
|
* License along with Libav; if not, write to the Free Software
|
2006-01-12 23:43:26 +01:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
2004-10-30 03:43:37 +02:00
|
|
|
*/
|
2005-12-17 19:14:38 +01:00
|
|
|
|
2004-10-30 03:43:37 +02:00
|
|
|
/**
|
2010-04-20 16:45:34 +02:00
|
|
|
* @file
|
2004-10-30 03:43:37 +02:00
|
|
|
* Range coder.
|
|
|
|
*/
|
|
|
|
|
2008-08-31 09:39:47 +02:00
|
|
|
#ifndef AVCODEC_RANGECODER_H
|
|
|
|
#define AVCODEC_RANGECODER_H
|
2007-06-17 02:01:30 +02:00
|
|
|
|
2007-06-17 00:59:13 +02:00
|
|
|
#include <stdint.h>
|
|
|
|
#include <assert.h>
|
2012-10-05 19:05:00 +02:00
|
|
|
|
2008-05-09 13:56:36 +02:00
|
|
|
#include "libavutil/common.h"
|
2007-06-17 00:59:13 +02:00
|
|
|
|
2012-10-05 19:05:00 +02:00
|
|
|
typedef struct RangeCoder {
|
2004-10-30 03:43:37 +02:00
|
|
|
int low;
|
|
|
|
int range;
|
|
|
|
int outstanding_count;
|
|
|
|
int outstanding_byte;
|
|
|
|
uint8_t zero_state[256];
|
2012-10-05 19:05:00 +02:00
|
|
|
uint8_t one_state[256];
|
2004-10-30 03:43:37 +02:00
|
|
|
uint8_t *bytestream_start;
|
|
|
|
uint8_t *bytestream;
|
|
|
|
uint8_t *bytestream_end;
|
2012-10-05 19:05:00 +02:00
|
|
|
} RangeCoder;
|
2004-10-30 03:43:37 +02:00
|
|
|
|
|
|
|
void ff_init_range_encoder(RangeCoder *c, uint8_t *buf, int buf_size);
|
|
|
|
void ff_init_range_decoder(RangeCoder *c, const uint8_t *buf, int buf_size);
|
|
|
|
int ff_rac_terminate(RangeCoder *c);
|
|
|
|
void ff_build_rac_states(RangeCoder *c, int factor, int max_p);
|
|
|
|
|
2012-10-05 19:05:00 +02:00
|
|
|
static inline void renorm_encoder(RangeCoder *c)
|
|
|
|
{
|
|
|
|
// FIXME: optimize
|
|
|
|
while (c->range < 0x100) {
|
|
|
|
if (c->outstanding_byte < 0) {
|
|
|
|
c->outstanding_byte = c->low >> 8;
|
|
|
|
} else if (c->low <= 0xFF00) {
|
2004-10-30 03:43:37 +02:00
|
|
|
*c->bytestream++ = c->outstanding_byte;
|
2012-10-05 19:05:00 +02:00
|
|
|
for (; c->outstanding_count; c->outstanding_count--)
|
2004-10-30 03:43:37 +02:00
|
|
|
*c->bytestream++ = 0xFF;
|
2012-10-05 19:05:00 +02:00
|
|
|
c->outstanding_byte = c->low >> 8;
|
|
|
|
} else if (c->low >= 0x10000) {
|
2004-10-30 03:43:37 +02:00
|
|
|
*c->bytestream++ = c->outstanding_byte + 1;
|
2012-10-05 19:05:00 +02:00
|
|
|
for (; c->outstanding_count; c->outstanding_count--)
|
2004-10-30 03:43:37 +02:00
|
|
|
*c->bytestream++ = 0x00;
|
2012-10-05 19:05:00 +02:00
|
|
|
c->outstanding_byte = (c->low >> 8) & 0xFF;
|
|
|
|
} else {
|
2004-10-30 03:43:37 +02:00
|
|
|
c->outstanding_count++;
|
|
|
|
}
|
2005-12-17 19:14:38 +01:00
|
|
|
|
2012-10-05 19:05:00 +02:00
|
|
|
c->low = (c->low & 0xFF) << 8;
|
2004-10-30 03:43:37 +02:00
|
|
|
c->range <<= 8;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-10-05 19:05:00 +02:00
|
|
|
static inline int get_rac_count(RangeCoder *c)
|
|
|
|
{
|
|
|
|
int x = c->bytestream - c->bytestream_start + c->outstanding_count;
|
|
|
|
if (c->outstanding_byte >= 0)
|
2007-05-29 18:51:55 +02:00
|
|
|
x++;
|
2012-10-05 19:05:00 +02:00
|
|
|
return 8 * x - av_log2(c->range);
|
2007-05-29 18:51:55 +02:00
|
|
|
}
|
|
|
|
|
2012-10-05 19:05:00 +02:00
|
|
|
static inline void put_rac(RangeCoder *c, uint8_t *const state, int bit)
|
|
|
|
{
|
|
|
|
int range1 = (c->range * (*state)) >> 8;
|
2004-10-30 03:43:37 +02:00
|
|
|
|
|
|
|
assert(*state);
|
|
|
|
assert(range1 < c->range);
|
|
|
|
assert(range1 > 0);
|
2012-10-05 19:05:00 +02:00
|
|
|
if (!bit) {
|
2004-10-30 03:43:37 +02:00
|
|
|
c->range -= range1;
|
2012-10-05 19:05:00 +02:00
|
|
|
*state = c->zero_state[*state];
|
|
|
|
} else {
|
|
|
|
c->low += c->range - range1;
|
2004-10-30 03:43:37 +02:00
|
|
|
c->range = range1;
|
2012-10-05 19:05:00 +02:00
|
|
|
*state = c->one_state[*state];
|
2004-10-30 03:43:37 +02:00
|
|
|
}
|
2005-12-17 19:14:38 +01:00
|
|
|
|
2004-10-30 03:43:37 +02:00
|
|
|
renorm_encoder(c);
|
|
|
|
}
|
|
|
|
|
2012-10-05 19:05:00 +02:00
|
|
|
static inline void refill(RangeCoder *c)
|
|
|
|
{
|
|
|
|
if (c->range < 0x100) {
|
2004-10-30 03:43:37 +02:00
|
|
|
c->range <<= 8;
|
2012-10-05 19:05:00 +02:00
|
|
|
c->low <<= 8;
|
|
|
|
if (c->bytestream < c->bytestream_end)
|
|
|
|
c->low += c->bytestream[0];
|
2004-10-30 03:43:37 +02:00
|
|
|
c->bytestream++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-10-05 19:05:00 +02:00
|
|
|
static inline int get_rac(RangeCoder *c, uint8_t *const state)
|
|
|
|
{
|
|
|
|
int range1 = (c->range * (*state)) >> 8;
|
2005-12-17 19:14:38 +01:00
|
|
|
|
2004-10-30 03:43:37 +02:00
|
|
|
c->range -= range1;
|
|
|
|
#if 1
|
2012-10-05 19:05:00 +02:00
|
|
|
if (c->low < c->range) {
|
|
|
|
*state = c->zero_state[*state];
|
2004-10-30 03:43:37 +02:00
|
|
|
refill(c);
|
|
|
|
return 0;
|
2012-10-05 19:05:00 +02:00
|
|
|
} else {
|
|
|
|
c->low -= c->range;
|
|
|
|
*state = c->one_state[*state];
|
2004-10-30 03:43:37 +02:00
|
|
|
c->range = range1;
|
|
|
|
refill(c);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
#else
|
2014-09-02 23:23:03 +02:00
|
|
|
{
|
|
|
|
int one_mask one_mask = (c->range - c->low - 1) >> 31;
|
2005-12-17 19:14:38 +01:00
|
|
|
|
2014-09-02 23:23:03 +02:00
|
|
|
c->low -= c->range & one_mask;
|
|
|
|
c->range += (range1 - c->range) & one_mask;
|
2005-12-17 19:14:38 +01:00
|
|
|
|
2014-09-02 23:23:03 +02:00
|
|
|
*state = c->zero_state[(*state) + (256 & one_mask)];
|
|
|
|
}
|
2004-10-30 03:43:37 +02:00
|
|
|
refill(c);
|
|
|
|
|
2012-10-05 19:05:00 +02:00
|
|
|
return one_mask & 1;
|
2004-10-30 03:43:37 +02:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2008-08-31 09:39:47 +02:00
|
|
|
#endif /* AVCODEC_RANGECODER_H */
|