1cabdff1aSopenharmony_ci/* 2cabdff1aSopenharmony_ci * Lagarith range decoder 3cabdff1aSopenharmony_ci * Copyright (c) 2009 Nathan Caldwell <saintdev (at) gmail.com> 4cabdff1aSopenharmony_ci * Copyright (c) 2009 David Conrad 5cabdff1aSopenharmony_ci * 6cabdff1aSopenharmony_ci * This file is part of FFmpeg. 7cabdff1aSopenharmony_ci * 8cabdff1aSopenharmony_ci * FFmpeg is free software; you can redistribute it and/or 9cabdff1aSopenharmony_ci * modify it under the terms of the GNU Lesser General Public 10cabdff1aSopenharmony_ci * License as published by the Free Software Foundation; either 11cabdff1aSopenharmony_ci * version 2.1 of the License, or (at your option) any later version. 12cabdff1aSopenharmony_ci * 13cabdff1aSopenharmony_ci * FFmpeg is distributed in the hope that it will be useful, 14cabdff1aSopenharmony_ci * but WITHOUT ANY WARRANTY; without even the implied warranty of 15cabdff1aSopenharmony_ci * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 16cabdff1aSopenharmony_ci * Lesser General Public License for more details. 17cabdff1aSopenharmony_ci * 18cabdff1aSopenharmony_ci * You should have received a copy of the GNU Lesser General Public 19cabdff1aSopenharmony_ci * License along with FFmpeg; if not, write to the Free Software 20cabdff1aSopenharmony_ci * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 21cabdff1aSopenharmony_ci */ 22cabdff1aSopenharmony_ci 23cabdff1aSopenharmony_ci/** 24cabdff1aSopenharmony_ci * @file 25cabdff1aSopenharmony_ci * Lagarith range decoder 26cabdff1aSopenharmony_ci * @author Nathan Caldwell 27cabdff1aSopenharmony_ci * @author David Conrad 28cabdff1aSopenharmony_ci */ 29cabdff1aSopenharmony_ci 30cabdff1aSopenharmony_ci#ifndef AVCODEC_LAGARITHRAC_H 31cabdff1aSopenharmony_ci#define AVCODEC_LAGARITHRAC_H 32cabdff1aSopenharmony_ci 33cabdff1aSopenharmony_ci#include <stdint.h> 34cabdff1aSopenharmony_ci#include "libavutil/intreadwrite.h" 35cabdff1aSopenharmony_ci#include "avcodec.h" 36cabdff1aSopenharmony_ci#include "get_bits.h" 37cabdff1aSopenharmony_ci 38cabdff1aSopenharmony_citypedef struct lag_rac { 39cabdff1aSopenharmony_ci AVCodecContext *avctx; 40cabdff1aSopenharmony_ci unsigned low; 41cabdff1aSopenharmony_ci unsigned range; 42cabdff1aSopenharmony_ci unsigned scale; /**< Number of bits of precision in range. */ 43cabdff1aSopenharmony_ci unsigned hash_shift; /**< Number of bits to shift to calculate hash for radix search. */ 44cabdff1aSopenharmony_ci 45cabdff1aSopenharmony_ci const uint8_t *bytestream_start; /**< Start of input bytestream. */ 46cabdff1aSopenharmony_ci const uint8_t *bytestream; /**< Current position in input bytestream. */ 47cabdff1aSopenharmony_ci const uint8_t *bytestream_end; /**< End position of input bytestream. */ 48cabdff1aSopenharmony_ci 49cabdff1aSopenharmony_ci int overread; 50cabdff1aSopenharmony_ci#define MAX_OVERREAD 4 51cabdff1aSopenharmony_ci 52cabdff1aSopenharmony_ci uint32_t prob[258]; /**< Table of cumulative probability for each symbol. */ 53cabdff1aSopenharmony_ci uint8_t range_hash[1024]; /**< Hash table mapping upper byte to approximate symbol. */ 54cabdff1aSopenharmony_ci} lag_rac; 55cabdff1aSopenharmony_ci 56cabdff1aSopenharmony_civoid ff_lag_rac_init(lag_rac *l, GetBitContext *gb, int length); 57cabdff1aSopenharmony_ci 58cabdff1aSopenharmony_ci/* TODO: Optimize */ 59cabdff1aSopenharmony_cistatic inline void lag_rac_refill(lag_rac *l) 60cabdff1aSopenharmony_ci{ 61cabdff1aSopenharmony_ci while (l->range <= 0x800000) { 62cabdff1aSopenharmony_ci l->low <<= 8; 63cabdff1aSopenharmony_ci l->range <<= 8; 64cabdff1aSopenharmony_ci l->low |= 0xff & (AV_RB16(l->bytestream) >> 1); 65cabdff1aSopenharmony_ci if (l->bytestream < l->bytestream_end) 66cabdff1aSopenharmony_ci l->bytestream++; 67cabdff1aSopenharmony_ci else 68cabdff1aSopenharmony_ci l->overread++; 69cabdff1aSopenharmony_ci } 70cabdff1aSopenharmony_ci} 71cabdff1aSopenharmony_ci 72cabdff1aSopenharmony_ci/** 73cabdff1aSopenharmony_ci * Decode a single byte from the compressed plane described by *l. 74cabdff1aSopenharmony_ci * @param l pointer to lag_rac for the current plane 75cabdff1aSopenharmony_ci * @return next byte of decoded data 76cabdff1aSopenharmony_ci */ 77cabdff1aSopenharmony_cistatic inline uint8_t lag_get_rac(lag_rac *l) 78cabdff1aSopenharmony_ci{ 79cabdff1aSopenharmony_ci unsigned range_scaled, low_scaled; 80cabdff1aSopenharmony_ci int val; 81cabdff1aSopenharmony_ci 82cabdff1aSopenharmony_ci lag_rac_refill(l); 83cabdff1aSopenharmony_ci 84cabdff1aSopenharmony_ci range_scaled = l->range >> l->scale; 85cabdff1aSopenharmony_ci 86cabdff1aSopenharmony_ci if (l->low < range_scaled * l->prob[255]) { 87cabdff1aSopenharmony_ci /* val = 0 is frequent enough to deserve a shortcut */ 88cabdff1aSopenharmony_ci if (l->low < range_scaled * l->prob[1]) { 89cabdff1aSopenharmony_ci val = 0; 90cabdff1aSopenharmony_ci } else { 91cabdff1aSopenharmony_ci low_scaled = l->low / (range_scaled<<(l->hash_shift)); 92cabdff1aSopenharmony_ci 93cabdff1aSopenharmony_ci val = l->range_hash[low_scaled]; 94cabdff1aSopenharmony_ci while (l->low >= range_scaled * l->prob[val + 1]) 95cabdff1aSopenharmony_ci val++; 96cabdff1aSopenharmony_ci } 97cabdff1aSopenharmony_ci 98cabdff1aSopenharmony_ci l->range = range_scaled * (l->prob[val + 1] - l->prob[val]); 99cabdff1aSopenharmony_ci } else { 100cabdff1aSopenharmony_ci val = 255; 101cabdff1aSopenharmony_ci l->range -= range_scaled * l->prob[255]; 102cabdff1aSopenharmony_ci } 103cabdff1aSopenharmony_ci 104cabdff1aSopenharmony_ci if (!l->range) 105cabdff1aSopenharmony_ci l->range = 0x80; 106cabdff1aSopenharmony_ci 107cabdff1aSopenharmony_ci l->low -= range_scaled * l->prob[val]; 108cabdff1aSopenharmony_ci 109cabdff1aSopenharmony_ci return val; 110cabdff1aSopenharmony_ci} 111cabdff1aSopenharmony_ci 112cabdff1aSopenharmony_ci 113cabdff1aSopenharmony_ci#endif /* AVCODEC_LAGARITHRAC_H */ 114