vorbis: Replace sized int_fast integer types with plain int/unsigned.
[libav.git] / libavcodec / vorbis.c
CommitLineData
0bde73d9 1/**
ba87f080 2 * @file
07c55d8e 3 * Common code for Vorbis I encoder and decoder
0bde73d9 4 * @author Denes Balatoni ( dbalatoni programozo hu )
a7adcf29 5 *
2912e87a 6 * This file is part of Libav.
b78e7197 7 *
2912e87a 8 * Libav is free software; you can redistribute it and/or
84a96d6a
DB
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
b78e7197 11 * version 2.1 of the License, or (at your option) any later version.
84a96d6a 12 *
2912e87a 13 * Libav is distributed in the hope that it will be useful,
84a96d6a
DB
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
17 *
18 * You should have received a copy of the GNU Lesser General Public
2912e87a 19 * License along with Libav; if not, write to the Free Software
5509bffa 20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
0bde73d9
MN
21 */
22
23#undef V_DEBUG
8dcf48a8 24//#define V_DEBUG
0bde73d9
MN
25
26#define ALT_BITSTREAM_READER_LE
27#include "avcodec.h"
9106a698 28#include "get_bits.h"
0bde73d9
MN
29
30#include "vorbis.h"
cc0ba5a5 31
cc0ba5a5 32
0bde73d9
MN
33/* Helper functions */
34
5e56b30e
DB
35// x^(1/n)
36unsigned int ff_vorbis_nth_root(unsigned int x, unsigned int n)
37{
a7adcf29 38 unsigned int ret = 0, i, j;
0bde73d9 39
07c55d8e
AJ
40 do {
41 ++ret;
a7adcf29
DB
42 for (i = 0, j = ret; i < n - 1; i++)
43 j *= ret;
44 } while (j <= x);
0bde73d9 45
ccd425e7 46 return ret - 1;
0bde73d9
MN
47}
48
07c55d8e 49// Generate vlc codes from vorbis huffman code lengths
0bde73d9 50
5e039e1b
RD
51// the two bits[p] > 32 checks should be redundant, all calling code should
52// already ensure that, but since it allows overwriting the stack it seems
53// reasonable to check redundantly.
cf3ac543 54int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, unsigned num)
5e56b30e 55{
a7adcf29
DB
56 uint_fast32_t exit_at_level[33] = {
57 404, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
58 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
0bde73d9 59
cf3ac543 60 unsigned i, j, p, code;
0bde73d9
MN
61
62#ifdef V_DEBUG
07c55d8e 63 GetBitContext gb;
43eb5908 64#endif
0bde73d9 65
a7adcf29 66 for (p = 0; (bits[p] == 0) && (p < num); ++p)
0b8e7ab0 67 ;
a7adcf29 68 if (p == num) {
07c55d8e
AJ
69// av_log(vc->avccontext, AV_LOG_INFO, "An empty codebook. Heh?! \n");
70 return 0;
0bde73d9
MN
71 }
72
a7adcf29 73 codes[p] = 0;
0b8e7ab0
DB
74 if (bits[p] > 32)
75 return 1;
a7adcf29
DB
76 for (i = 0; i < bits[p]; ++i)
77 exit_at_level[i+1] = 1 << i;
0bde73d9 78
07c55d8e 79#ifdef V_DEBUG
cf3ac543
DB
80 av_log(NULL, AV_LOG_INFO, " %u. of %u code len %d code %d - ", p, num, bits[p], codes[p]);
81 init_get_bits(&gb, (uint8_t *)&codes[p], bits[p]);
a7adcf29 82 for (i = 0; i < bits[p]; ++i)
07c55d8e 83 av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0");
07c55d8e
AJ
84 av_log(NULL, AV_LOG_INFO, "\n");
85#endif
0bde73d9 86
07c55d8e 87 ++p;
0bde73d9 88
a7adcf29 89 for (; p < num; ++p) {
0b8e7ab0 90 if (bits[p] > 32)
a7adcf29
DB
91 return 1;
92 if (bits[p] == 0)
93 continue;
07c55d8e 94 // find corresponding exit(node which the tree can grow further from)
a7adcf29 95 for (i = bits[p]; i > 0; --i)
0b8e7ab0
DB
96 if (exit_at_level[i])
97 break;
98 if (!i) // overspecified tree
a7adcf29
DB
99 return 1;
100 code = exit_at_level[i];
101 exit_at_level[i] = 0;
07c55d8e 102 // construct code (append 0s to end) and introduce new exits
a7adcf29
DB
103 for (j = i + 1 ;j <= bits[p]; ++j)
104 exit_at_level[j] = code + (1 << (j - 1));
105 codes[p] = code;
43eb5908 106
43eb5908 107#ifdef V_DEBUG
07c55d8e
AJ
108 av_log(NULL, AV_LOG_INFO, " %d. code len %d code %d - ", p, bits[p], codes[p]);
109 init_get_bits(&gb, (uint_fast8_t *)&codes[p], bits[p]);
a7adcf29 110 for (i = 0; i < bits[p]; ++i)
07c55d8e 111 av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0");
07c55d8e 112 av_log(NULL, AV_LOG_INFO, "\n");
43eb5908
AS
113#endif
114
43eb5908
AS
115 }
116
07c55d8e 117 //no exits should be left (underspecified tree - ie. unused valid vlcs - not allowed by SPEC)
a7adcf29 118 for (p = 1; p < 33; p++)
0b8e7ab0
DB
119 if (exit_at_level[p])
120 return 1;
0bde73d9 121
43eb5908
AS
122 return 0;
123}
7f09a560 124
5e56b30e
DB
125void ff_vorbis_ready_floor1_list(vorbis_floor1_entry * list, int values)
126{
2dac4acf 127 int i;
07c55d8e
AJ
128 list[0].sort = 0;
129 list[1].sort = 1;
130 for (i = 2; i < values; i++) {
131 int j;
a7adcf29 132 list[i].low = 0;
07c55d8e
AJ
133 list[i].high = 1;
134 list[i].sort = i;
135 for (j = 2; j < i; j++) {
136 int tmp = list[j].x;
137 if (tmp < list[i].x) {
0b8e7ab0 138 if (tmp > list[list[i].low].x)
a7adcf29 139 list[i].low = j;
2dac4acf 140 } else {
0b8e7ab0
DB
141 if (tmp < list[list[i].high].x)
142 list[i].high = j;
07c55d8e
AJ
143 }
144 }
145 }
146 for (i = 0; i < values - 1; i++) {
147 int j;
148 for (j = i + 1; j < values; j++) {
149 if (list[list[i].sort].x > list[list[j].sort].x) {
150 int tmp = list[i].sort;
151 list[i].sort = list[j].sort;
152 list[j].sort = tmp;
153 }
154 }
155 }
156}
157
5e56b30e
DB
158static inline void render_line_unrolled(intptr_t x, intptr_t y, int x1,
159 intptr_t sy, int ady, int adx,
a7adcf29 160 float *buf)
5e56b30e 161{
2f17f9c1 162 int err = -adx;
a7adcf29
DB
163 x -= x1 - 1;
164 buf += x1 - 1;
2f17f9c1
LM
165 while (++x < 0) {
166 err += ady;
167 if (err >= 0) {
168 err += ady - adx;
a7adcf29 169 y += sy;
2f17f9c1
LM
170 buf[x++] = ff_vorbis_floor1_inverse_db_table[y];
171 }
172 buf[x] = ff_vorbis_floor1_inverse_db_table[y];
173 }
174 if (x <= 0) {
175 if (err + ady >= 0)
176 y += sy;
177 buf[x] = ff_vorbis_floor1_inverse_db_table[y];
178 }
179}
180
a7adcf29 181static void render_line(int x0, int y0, int x1, int y1, float *buf)
5e56b30e 182{
a7adcf29 183 int dy = y1 - y0;
07c55d8e 184 int adx = x1 - x0;
2f17f9c1 185 int ady = FFABS(dy);
a7adcf29 186 int sy = dy < 0 ? -1 : 1;
2f17f9c1 187 buf[x0] = ff_vorbis_floor1_inverse_db_table[y0];
a7adcf29 188 if (ady*2 <= adx) { // optimized common case
2f17f9c1
LM
189 render_line_unrolled(x0, y0, x1, sy, ady, adx, buf);
190 } else {
8fc9376c 191 int base = dy / adx;
a7adcf29
DB
192 int x = x0;
193 int y = y0;
194 int err = -adx;
8fc9376c
LM
195 ady -= FFABS(base) * adx;
196 while (++x < x1) {
197 y += base;
198 err += ady;
199 if (err >= 0) {
200 err -= adx;
a7adcf29 201 y += sy;
8fc9376c
LM
202 }
203 buf[x] = ff_vorbis_floor1_inverse_db_table[y];
2dac4acf 204 }
2f17f9c1 205 }
2dac4acf
LM
206}
207
5e56b30e 208void ff_vorbis_floor1_render_list(vorbis_floor1_entry * list, int values,
a7adcf29
DB
209 uint_fast16_t *y_list, int *flag,
210 int multiplier, float *out, int samples)
5e56b30e 211{
07c55d8e
AJ
212 int lx, ly, i;
213 lx = 0;
214 ly = y_list[0] * multiplier;
215 for (i = 1; i < values; i++) {
216 int pos = list[i].sort;
217 if (flag[pos]) {
e1813a2f
LM
218 int x1 = list[pos].x;
219 int y1 = y_list[pos] * multiplier;
220 if (lx < samples)
221 render_line(lx, ly, FFMIN(x1,samples), y1, out);
222 lx = x1;
223 ly = y1;
0bde73d9 224 }
0b8e7ab0
DB
225 if (lx >= samples)
226 break;
0bde73d9 227 }
0b8e7ab0
DB
228 if (lx < samples)
229 render_line(lx, ly, samples, ly, out);
0bde73d9 230}