2004-10-30 04:43:37 +03:00
|
|
|
/*
|
|
|
|
* Range coder
|
|
|
|
* Copyright (c) 2004 Michael Niedermayer <michaelni@gmx.at>
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* 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
|
|
|
|
* License along with this library; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*
|
|
|
|
*/
|
2005-12-17 20:14:38 +02:00
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
/**
|
|
|
|
* @file rangecoder.c
|
|
|
|
* 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>
|
|
|
|
|
|
|
|
#include "avcodec.h"
|
|
|
|
#include "common.h"
|
|
|
|
#include "rangecoder.h"
|
|
|
|
|
|
|
|
|
|
|
|
void ff_init_range_encoder(RangeCoder *c, uint8_t *buf, int buf_size){
|
2005-12-17 20:14:38 +02:00
|
|
|
c->bytestream_start=
|
2004-10-30 04:43:37 +03:00
|
|
|
c->bytestream= buf;
|
|
|
|
c->bytestream_end= buf + buf_size;
|
|
|
|
|
|
|
|
c->low= 0;
|
|
|
|
c->range= 0xFF00;
|
|
|
|
c->outstanding_count= 0;
|
|
|
|
c->outstanding_byte= -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ff_init_range_decoder(RangeCoder *c, const uint8_t *buf, int buf_size){
|
2005-09-07 00:25:35 +03:00
|
|
|
/* cast to avoid compiler warning */
|
|
|
|
ff_init_range_encoder(c, (uint8_t *) buf, buf_size);
|
2004-10-30 04:43:37 +03:00
|
|
|
|
|
|
|
c->low =(*c->bytestream++)<<8;
|
|
|
|
c->low+= *c->bytestream++;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ff_build_rac_states(RangeCoder *c, int factor, int max_p){
|
|
|
|
const int64_t one= 1LL<<32;
|
|
|
|
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));
|
|
|
|
memset(c-> one_state, 0, sizeof(c-> one_state));
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
for(i=1; i<256; i++){
|
2005-12-17 20:14:38 +02:00
|
|
|
if(c->one_state[i])
|
2004-10-30 04:43:37 +03:00
|
|
|
continue;
|
2005-12-17 20:14:38 +02:00
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
p= (i*one + 128) >> 8;
|
|
|
|
last_p8= i;
|
|
|
|
for(;;){
|
|
|
|
p+= ((one-p)*factor + one/2) >> 32;
|
|
|
|
p8= (256*p + one/2) >> 32; //FIXME try without the one
|
|
|
|
if(p8 <= last_p8) p8= last_p8+1;
|
|
|
|
if(p8 > max_p) p8= max_p;
|
|
|
|
if(p8 < last_p8)
|
|
|
|
break;
|
|
|
|
c->one_state[last_p8]= p8;
|
|
|
|
if(p8 == last_p8)
|
|
|
|
break;
|
|
|
|
last_p8= p8;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
#if 1
|
|
|
|
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;
|
2005-12-17 20:14:38 +02:00
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
p+= ((one-p)*factor + one/2) >> 32;
|
|
|
|
last_p8= p8;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
for(i=256-max_p; i<=max_p; i++){
|
2005-12-17 20:14:38 +02:00
|
|
|
if(c->one_state[i])
|
2004-10-30 04:43:37 +03:00
|
|
|
continue;
|
|
|
|
|
|
|
|
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;
|
|
|
|
}
|
2005-12-17 20:14:38 +02:00
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
for(i=0; i<256; i++)
|
|
|
|
c->zero_state[i]= 256-c->one_state[256-i];
|
|
|
|
#if 0
|
|
|
|
for(i=0; i<256; i++)
|
|
|
|
av_log(NULL, AV_LOG_DEBUG, "%3d %3d\n", i, c->one_state[i]);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* @return the number of bytes written
|
|
|
|
*/
|
|
|
|
int ff_rac_terminate(RangeCoder *c){
|
|
|
|
c->range=0xFF;
|
|
|
|
c->low +=0xFF;
|
|
|
|
renorm_encoder(c);
|
|
|
|
c->range=0xFF;
|
|
|
|
renorm_encoder(c);
|
|
|
|
|
|
|
|
assert(c->low == 0);
|
|
|
|
assert(c->range >= 0x100);
|
|
|
|
|
|
|
|
return c->bytestream - c->bytestream_start;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if 0 //selftest
|
|
|
|
#define SIZE 10240
|
|
|
|
int main(){
|
|
|
|
RangeCoder c;
|
|
|
|
uint8_t b[9*SIZE];
|
|
|
|
uint8_t r[9*SIZE];
|
|
|
|
int i;
|
|
|
|
uint8_t state[10]= {0};
|
2005-12-17 20:14:38 +02:00
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
ff_init_range_encoder(&c, b, SIZE);
|
|
|
|
ff_build_rac_states(&c, 0.05*(1LL<<32), 128+64+32+16);
|
2005-12-17 20:14:38 +02:00
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
memset(state, 128, sizeof(state));
|
|
|
|
|
|
|
|
for(i=0; i<SIZE; i++){
|
|
|
|
r[i]= random()%7;
|
|
|
|
}
|
2005-12-17 20:14:38 +02:00
|
|
|
|
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
for(i=0; i<SIZE; i++){
|
|
|
|
START_TIMER
|
|
|
|
put_rac(&c, state, r[i]&1);
|
|
|
|
STOP_TIMER("put_rac")
|
|
|
|
}
|
|
|
|
|
|
|
|
ff_put_rac_terminate(&c);
|
2005-12-17 20:14:38 +02:00
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
ff_init_range_decoder(&c, b, SIZE);
|
2005-12-17 20:14:38 +02:00
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
memset(state, 128, sizeof(state));
|
2005-12-17 20:14:38 +02:00
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
for(i=0; i<SIZE; i++){
|
|
|
|
START_TIMER
|
|
|
|
if( (r[i]&1) != get_rac(&c, state) )
|
|
|
|
av_log(NULL, AV_LOG_DEBUG, "rac failure at %d\n", i);
|
|
|
|
STOP_TIMER("get_rac")
|
|
|
|
}
|
2005-12-17 20:14:38 +02:00
|
|
|
|
2004-10-30 04:43:37 +03:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|