2011-01-08 21:22:15 +00:00
|
|
|
/*
|
|
|
|
* Lagarith range decoder
|
|
|
|
* Copyright (c) 2009 Nathan Caldwell <saintdev (at) gmail.com>
|
|
|
|
* Copyright (c) 2009 David Conrad
|
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* This file is part of Libav.
|
2011-01-08 21:22:15 +00:00
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* Libav is free software; you can redistribute it and/or
|
2011-01-08 21:22:15 +00:00
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
2011-03-18 17:35:10 +00:00
|
|
|
* Libav is distributed in the hope that it will be useful,
|
2011-01-08 21:22:15 +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
|
2011-03-18 17:35:10 +00:00
|
|
|
* License along with Libav; if not, write to the Free Software
|
2011-01-08 21:22:15 +00:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
2011-06-04 22:59:52 +00:00
|
|
|
* @file
|
2011-01-08 21:22:15 +00:00
|
|
|
* Lagarith range decoder
|
|
|
|
* @author Nathan Caldwell
|
|
|
|
* @author David Conrad
|
|
|
|
*/
|
|
|
|
|
2016-04-10 18:05:32 +00:00
|
|
|
#include "bitstream.h"
|
2011-01-08 21:22:15 +00:00
|
|
|
#include "lagarithrac.h"
|
|
|
|
|
2016-04-10 18:05:32 +00:00
|
|
|
void ff_lag_rac_init(lag_rac *l, BitstreamContext *bc, int length)
|
2011-01-08 21:22:15 +00:00
|
|
|
{
|
2012-03-27 19:26:46 +00:00
|
|
|
int i, j, left;
|
2011-01-08 21:22:15 +00:00
|
|
|
|
|
|
|
/* According to reference decoder "1st byte is garbage",
|
2016-04-10 18:05:32 +00:00
|
|
|
* however, it gets skipped by the call to bitstream_align()
|
2011-01-08 21:22:15 +00:00
|
|
|
*/
|
2016-04-10 18:05:32 +00:00
|
|
|
bitstream_align(bc);
|
|
|
|
left = bitstream_bits_left(bc) >> 3;
|
2011-01-08 21:22:15 +00:00
|
|
|
l->bytestream_start =
|
2016-04-10 18:05:32 +00:00
|
|
|
l->bytestream = bc->buffer + bitstream_tell(bc) / 8;
|
2012-03-27 19:26:46 +00:00
|
|
|
l->bytestream_end = l->bytestream_start + FFMIN(length, left);
|
2011-01-08 21:22:15 +00:00
|
|
|
|
|
|
|
l->range = 0x80;
|
|
|
|
l->low = *l->bytestream >> 1;
|
2015-11-01 13:46:17 +00:00
|
|
|
l->hash_shift = FFMAX(l->scale, 8) - 8;
|
2011-01-08 21:22:15 +00:00
|
|
|
|
|
|
|
for (i = j = 0; i < 256; i++) {
|
|
|
|
unsigned r = i << l->hash_shift;
|
|
|
|
while (l->prob[j + 1] <= r)
|
|
|
|
j++;
|
|
|
|
l->range_hash[i] = j;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Add conversion factor to hash_shift so we don't have to in lag_get_rac. */
|
|
|
|
l->hash_shift += 23;
|
|
|
|
}
|