2004-10-30 04:43:37 +03:00
|
|
|
/*
|
|
|
|
* Range coder
|
|
|
|
* Copyright (c) 2004 Michael Niedermayer <michaelni@gmx.at>
|
|
|
|
*
|
2011-03-18 19:35:10 +02:00
|
|
|
* This file is part of Libav.
|
2006-10-07 18:30:46 +03:00
|
|
|
*
|
2011-03-18 19:35:10 +02:00
|
|
|
* Libav is free software; you can redistribute it and/or
|
2004-10-30 04:43:37 +03:00
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
2006-10-07 18:30:46 +03:00
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
2004-10-30 04:43:37 +03:00
|
|
|
*
|
2011-03-18 19:35:10 +02:00
|
|
|
* Libav is distributed in the hope that it will be useful,
|
2004-10-30 04:43:37 +03: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 19:35:10 +02:00
|
|
|
* License along with Libav; if not, write to the Free Software
|
2006-01-13 00:43:26 +02:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
2004-10-30 04:43:37 +03:00
|
|
|
*/
|
2005-12-17 20:14:38 +02:00
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
/**
|
2010-04-20 17:45:34 +03:00
|
|
|
* @file
|
2004-10-30 04:43:37 +03:00
|
|
|
* Range coder.
|
|
|
|
* based upon
|
|
|
|
* "Range encoding: an algorithm for removing redundancy from a digitised
|
|
|
|
* message.
|
|
|
|
* G. N. N. Martin Presented in March 1979 to the Video &
|
|
|
|
* Data Recording Conference,
|
|
|
|
* IBM UK Scientific Center held in Southampton July 24-27 1979."
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
|
2013-02-01 12:31:59 +03:00
|
|
|
#include "libavutil/attributes.h"
|
2015-10-02 12:43:42 +02:00
|
|
|
#include "libavutil/intreadwrite.h"
|
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
#include "avcodec.h"
|
|
|
|
#include "rangecoder.h"
|
|
|
|
|
2013-02-01 12:31:59 +03:00
|
|
|
av_cold void ff_init_range_encoder(RangeCoder *c, uint8_t *buf, int buf_size)
|
2012-10-05 20:05:00 +03:00
|
|
|
{
|
|
|
|
c->bytestream_start =
|
|
|
|
c->bytestream = buf;
|
|
|
|
c->bytestream_end = buf + buf_size;
|
|
|
|
c->low = 0;
|
|
|
|
c->range = 0xFF00;
|
|
|
|
c->outstanding_count = 0;
|
|
|
|
c->outstanding_byte = -1;
|
2004-10-30 04:43:37 +03:00
|
|
|
}
|
|
|
|
|
2013-02-01 12:31:59 +03:00
|
|
|
av_cold void ff_init_range_decoder(RangeCoder *c, const uint8_t *buf,
|
|
|
|
int buf_size)
|
2012-10-05 20:05:00 +03:00
|
|
|
{
|
2005-09-07 00:25:35 +03:00
|
|
|
/* cast to avoid compiler warning */
|
2012-10-05 20:05:00 +03:00
|
|
|
ff_init_range_encoder(c, (uint8_t *)buf, buf_size);
|
2004-10-30 04:43:37 +03:00
|
|
|
|
2016-03-21 16:19:30 +02:00
|
|
|
c->low = AV_RB16(c->bytestream);
|
2015-10-02 12:43:42 +02:00
|
|
|
c->bytestream += 2;
|
2004-10-30 04:43:37 +03:00
|
|
|
}
|
|
|
|
|
2012-10-05 20:05:00 +03:00
|
|
|
void ff_build_rac_states(RangeCoder *c, int factor, int max_p)
|
|
|
|
{
|
|
|
|
const int64_t one = 1LL << 32;
|
2004-10-30 04:43:37 +03:00
|
|
|
int64_t p;
|
2005-02-24 21:08:50 +02:00
|
|
|
int last_p8, p8, i;
|
2004-10-30 04:43:37 +03:00
|
|
|
|
|
|
|
memset(c->zero_state, 0, sizeof(c->zero_state));
|
2012-10-05 20:05:00 +03:00
|
|
|
memset(c->one_state, 0, sizeof(c->one_state));
|
|
|
|
|
|
|
|
last_p8 = 0;
|
|
|
|
p = one / 2;
|
|
|
|
for (i = 0; i < 128; i++) {
|
|
|
|
p8 = (256 * p + one / 2) >> 32; // FIXME: try without the one
|
|
|
|
if (p8 <= last_p8)
|
|
|
|
p8 = last_p8 + 1;
|
|
|
|
if (last_p8 && last_p8 < 256 && p8 <= max_p)
|
|
|
|
c->one_state[last_p8] = p8;
|
|
|
|
|
|
|
|
p += ((one - p) * factor + one / 2) >> 32;
|
|
|
|
last_p8 = p8;
|
2004-10-30 04:43:37 +03:00
|
|
|
}
|
2007-01-26 04:29:23 +02:00
|
|
|
|
2012-10-05 20:05:00 +03:00
|
|
|
for (i = 256 - max_p; i <= max_p; i++) {
|
|
|
|
if (c->one_state[i])
|
2004-10-30 04:43:37 +03:00
|
|
|
continue;
|
|
|
|
|
2012-10-05 20:05:00 +03:00
|
|
|
p = (i * one + 128) >> 8;
|
|
|
|
p += ((one - p) * factor + one / 2) >> 32;
|
|
|
|
p8 = (256 * p + one / 2) >> 32; // FIXME: try without the one
|
|
|
|
if (p8 <= i)
|
|
|
|
p8 = i + 1;
|
|
|
|
if (p8 > max_p)
|
|
|
|
p8 = max_p;
|
|
|
|
c->one_state[i] = p8;
|
2004-10-30 04:43:37 +03:00
|
|
|
}
|
2005-12-17 20:14:38 +02:00
|
|
|
|
2012-10-05 20:05:00 +03:00
|
|
|
for (i = 1; i < 255; i++)
|
|
|
|
c->zero_state[i] = 256 - c->one_state[256 - i];
|
2004-10-30 04:43:37 +03:00
|
|
|
}
|
|
|
|
|
2012-10-05 20:05:00 +03:00
|
|
|
/* Return the number of bytes written. */
|
|
|
|
int ff_rac_terminate(RangeCoder *c)
|
|
|
|
{
|
|
|
|
c->range = 0xFF;
|
|
|
|
c->low += 0xFF;
|
2004-10-30 04:43:37 +03:00
|
|
|
renorm_encoder(c);
|
2012-10-05 20:05:00 +03:00
|
|
|
c->range = 0xFF;
|
2004-10-30 04:43:37 +03:00
|
|
|
renorm_encoder(c);
|
|
|
|
|
2012-10-05 20:05:00 +03:00
|
|
|
assert(c->low == 0);
|
2004-10-30 04:43:37 +03:00
|
|
|
assert(c->range >= 0x100);
|
|
|
|
|
|
|
|
return c->bytestream - c->bytestream_start;
|
|
|
|
}
|