blob: dd13e49e50499601ea3005c8ec4f8d5295609915 [file] [log] [blame]
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -08001/* Copyright (c) 2001-2011 Timothy B. Terriberry
Jean-Marc Valin8b2ff0d2009-10-17 21:40:10 -04002 Copyright (c) 2008-2009 Xiph.Org Foundation */
Gregory Maxwellf40bbf72009-02-03 20:36:57 -05003/*
4 Redistribution and use in source and binary forms, with or without
5 modification, are permitted provided that the following conditions
6 are met:
7
8 - Redistributions of source code must retain the above copyright
9 notice, this list of conditions and the following disclaimer.
10
11 - Redistributions in binary form must reproduce the above copyright
12 notice, this list of conditions and the following disclaimer in the
13 documentation and/or other materials provided with the distribution.
14
Gregory Maxwellf40bbf72009-02-03 20:36:57 -050015 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
16 ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
17 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
Jean-Marc Valincb05e7c2012-04-20 16:40:24 -040018 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
19 OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
Gregory Maxwellf40bbf72009-02-03 20:36:57 -050020 EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
21 PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
22 PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
23 LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
24 NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26*/
27
Jean-Marc Valind77d6a52011-07-29 17:33:06 -040028#include "opus_types.h"
Gregory Maxwell7830cf12013-10-17 15:56:52 -070029#include "opus_defines.h"
Jean-Marc Valinabe043f2008-01-31 14:26:29 +110030
Timothy B. Terriberry2ec8d9e2007-12-06 15:09:53 +110031#if !defined(_entcode_H)
32# define _entcode_H (1)
33# include <limits.h>
Timothy B. Terriberry30df6cf2010-12-21 08:42:26 -080034# include <stddef.h>
Timothy B. Terriberry2ec8d9e2007-12-06 15:09:53 +110035# include "ecintrin.h"
36
Timothy B. Terriberry9bac8c12011-03-02 16:24:32 -080037/*OPT: ec_window must be at least 32 bits, but if you have fast arithmetic on a
38 larger type, you can speed up the decoder by using it here.*/
Jean-Marc Valind77d6a52011-07-29 17:33:06 -040039typedef opus_uint32 ec_window;
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -080040typedef struct ec_ctx ec_ctx;
41typedef struct ec_ctx ec_enc;
42typedef struct ec_ctx ec_dec;
Timothy B. Terriberry2ec8d9e2007-12-06 15:09:53 +110043
Timothy B. Terriberry30df6cf2010-12-21 08:42:26 -080044# define EC_WINDOW_SIZE ((int)sizeof(ec_window)*CHAR_BIT)
45
46/*The number of bits to use for the range-coded part of unsigned integers.*/
47# define EC_UINT_BITS (8)
Timothy B. Terriberry2ec8d9e2007-12-06 15:09:53 +110048
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -080049/*The resolution of fractional-precision bit usage measurements, i.e.,
50 3 => 1/8th bits.*/
51# define BITRES 3
Timothy B. Terriberry2ec8d9e2007-12-06 15:09:53 +110052
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -080053/*The entropy encoder/decoder context.
54 We use the same structure for both, so that common functions like ec_tell()
55 can be used on either one.*/
56struct ec_ctx{
57 /*Buffered input/output.*/
58 unsigned char *buf;
59 /*The size of the buffer.*/
Jean-Marc Valind77d6a52011-07-29 17:33:06 -040060 opus_uint32 storage;
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -080061 /*The offset at which the last byte containing raw bits was read/written.*/
Jean-Marc Valind77d6a52011-07-29 17:33:06 -040062 opus_uint32 end_offs;
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -080063 /*Bits that will be read from/written at the end.*/
64 ec_window end_window;
65 /*Number of valid bits in end_window.*/
66 int nend_bits;
67 /*The total number of whole bits read/written.
68 This does not include partial bits currently in the range coder.*/
69 int nbits_total;
70 /*The offset at which the next range coder byte will be read/written.*/
Jean-Marc Valind77d6a52011-07-29 17:33:06 -040071 opus_uint32 offs;
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -080072 /*The number of values in the current range.*/
Jean-Marc Valind77d6a52011-07-29 17:33:06 -040073 opus_uint32 rng;
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -080074 /*In the decoder: the difference between the top of the current range and
75 the input value, minus one.
76 In the encoder: the low end of the current range.*/
Jean-Marc Valind77d6a52011-07-29 17:33:06 -040077 opus_uint32 val;
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -080078 /*In the decoder: the saved normalization factor from ec_decode().
79 In the encoder: the number of oustanding carry propagating symbols.*/
Jean-Marc Valind77d6a52011-07-29 17:33:06 -040080 opus_uint32 ext;
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -080081 /*A buffered input/output symbol, awaiting carry propagation.*/
82 int rem;
83 /*Nonzero if an error occurred.*/
84 int error;
Timothy B. Terriberry2ec8d9e2007-12-06 15:09:53 +110085};
86
Gregory Maxwell7830cf12013-10-17 15:56:52 -070087static OPUS_INLINE opus_uint32 ec_range_bytes(ec_ctx *_this){
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -080088 return _this->offs;
Jean-Marc Valinfd8fda92008-03-27 09:00:14 +110089}
90
Gregory Maxwell7830cf12013-10-17 15:56:52 -070091static OPUS_INLINE unsigned char *ec_get_buffer(ec_ctx *_this){
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -080092 return _this->buf;
Jean-Marc Valinfd8fda92008-03-27 09:00:14 +110093}
Timothy B. Terriberry2ec8d9e2007-12-06 15:09:53 +110094
Gregory Maxwell7830cf12013-10-17 15:56:52 -070095static OPUS_INLINE int ec_get_error(ec_ctx *_this){
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -080096 return _this->error;
97}
98
99/*Returns the number of bits "used" by the encoded or decoded symbols so far.
100 This same number can be computed in either the encoder or the decoder, and is
101 suitable for making coding decisions.
102 Return: The number of bits.
103 This will always be slightly larger than the exact value (e.g., all
104 rounding error is in the positive direction).*/
Gregory Maxwell7830cf12013-10-17 15:56:52 -0700105static OPUS_INLINE int ec_tell(ec_ctx *_this){
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -0800106 return _this->nbits_total-EC_ILOG(_this->rng);
107}
108
109/*Returns the number of bits "used" by the encoded or decoded symbols so far.
110 This same number can be computed in either the encoder or the decoder, and is
111 suitable for making coding decisions.
112 Return: The number of bits scaled by 2**BITRES.
113 This will always be slightly larger than the exact value (e.g., all
114 rounding error is in the positive direction).*/
Jean-Marc Valind77d6a52011-07-29 17:33:06 -0400115opus_uint32 ec_tell_frac(ec_ctx *_this);
Timothy B. Terriberrya093f4d2011-02-03 14:22:15 -0800116
Timothy B. Terriberry2ec8d9e2007-12-06 15:09:53 +1100117#endif