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