Mercurial > libavcodec.hg
annotate vorbis.c @ 10309:d157ccc267e7 libavcodec
brace placement and linebreak cosmetics
author | diego |
---|---|
date | Mon, 28 Sep 2009 21:13:47 +0000 |
parents | 8078ecd2fe4c |
children | d3644248015a |
rev | line source |
---|---|
4971 | 1 /** |
8718
e9d9d946f213
Use full internal pathname in doxygen @file directives.
diego
parents:
8306
diff
changeset
|
2 * @file libavcodec/vorbis.c |
4971 | 3 * Common code for Vorbis I encoder and decoder |
4 * @author Denes Balatoni ( dbalatoni programozo hu ) | |
5 | |
6 * This file is part of FFmpeg. | |
7 * | |
8 * FFmpeg is free software; you can redistribute it and/or | |
9 * modify it under the terms of the GNU Lesser General Public | |
10 * License as published by the Free Software Foundation; either | |
11 * version 2.1 of the License, or (at your option) any later version. | |
12 * | |
13 * FFmpeg is distributed in the hope that it will be useful, | |
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 | |
19 * License along with FFmpeg; if not, write to the Free Software | |
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | |
21 */ | |
22 | |
23 #undef V_DEBUG | |
24 //#define V_DEBUG | |
25 | |
26 #define ALT_BITSTREAM_READER_LE | |
27 #include "avcodec.h" | |
9428 | 28 #include "get_bits.h" |
4971 | 29 |
30 #include "vorbis.h" | |
31 | |
32 | |
33 /* Helper functions */ | |
34 | |
10309 | 35 // x^(1/n) |
36 unsigned int ff_vorbis_nth_root(unsigned int x, unsigned int n) | |
37 { | |
4971 | 38 unsigned int ret=0, i, j; |
39 | |
40 do { | |
41 ++ret; | |
42 for(i=0,j=ret;i<n-1;i++) j*=ret; | |
43 } while (j<=x); | |
44 | |
6750 | 45 return ret - 1; |
4971 | 46 } |
47 | |
48 // Generate vlc codes from vorbis huffman code lengths | |
49 | |
9934 | 50 // the two bits[p] > 32 checks should be redundant, all calling code should |
51 // already ensure that, but since it allows overwriting the stack it seems | |
52 // reasonable to check redundantly. | |
10309 | 53 int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, uint_fast32_t num) |
54 { | |
4971 | 55 uint_fast32_t exit_at_level[33]={404,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, |
56 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; | |
57 | |
58 uint_fast8_t i,j; | |
59 uint_fast32_t code,p; | |
60 | |
61 #ifdef V_DEBUG | |
62 GetBitContext gb; | |
63 #endif | |
64 | |
65 for(p=0;(bits[p]==0) && (p<num);++p); | |
66 if (p==num) { | |
67 // av_log(vc->avccontext, AV_LOG_INFO, "An empty codebook. Heh?! \n"); | |
68 return 0; | |
69 } | |
70 | |
71 codes[p]=0; | |
9934 | 72 if (bits[p] > 32) return 1; |
10309 | 73 for(i=0;i<bits[p];++i) |
4971 | 74 exit_at_level[i+1]=1<<i; |
75 | |
76 #ifdef V_DEBUG | |
77 av_log(NULL, AV_LOG_INFO, " %d. of %d code len %d code %d - ", p, num, bits[p], codes[p]); | |
78 init_get_bits(&gb, (uint_fast8_t *)&codes[p], bits[p]); | |
10309 | 79 for(i=0;i<bits[p];++i) |
4971 | 80 av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0"); |
81 av_log(NULL, AV_LOG_INFO, "\n"); | |
82 #endif | |
83 | |
84 ++p; | |
85 | |
86 for(;p<num;++p) { | |
9934 | 87 if (bits[p] > 32) return 1; |
4971 | 88 if (bits[p]==0) continue; |
89 // find corresponding exit(node which the tree can grow further from) | |
10309 | 90 for(i=bits[p];i>0;--i) |
4971 | 91 if (exit_at_level[i]) break; |
92 if (!i) return 1; // overspecified tree | |
93 code=exit_at_level[i]; | |
94 exit_at_level[i]=0; | |
95 // construct code (append 0s to end) and introduce new exits | |
10309 | 96 for(j=i+1;j<=bits[p];++j) |
4971 | 97 exit_at_level[j]=code+(1<<(j-1)); |
98 codes[p]=code; | |
99 | |
100 #ifdef V_DEBUG | |
101 av_log(NULL, AV_LOG_INFO, " %d. code len %d code %d - ", p, bits[p], codes[p]); | |
102 init_get_bits(&gb, (uint_fast8_t *)&codes[p], bits[p]); | |
10309 | 103 for(i=0;i<bits[p];++i) |
4971 | 104 av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0"); |
105 av_log(NULL, AV_LOG_INFO, "\n"); | |
106 #endif | |
107 | |
108 } | |
109 | |
110 //no exits should be left (underspecified tree - ie. unused valid vlcs - not allowed by SPEC) | |
111 for (p=1; p<33; p++) | |
112 if (exit_at_level[p]) return 1; | |
113 | |
114 return 0; | |
115 } | |
116 | |
10309 | 117 void ff_vorbis_ready_floor1_list(vorbis_floor1_entry * list, int values) |
118 { | |
4971 | 119 int i; |
120 list[0].sort = 0; | |
121 list[1].sort = 1; | |
122 for (i = 2; i < values; i++) { | |
123 int j; | |
124 list[i].low = 0; | |
125 list[i].high = 1; | |
126 list[i].sort = i; | |
127 for (j = 2; j < i; j++) { | |
128 int tmp = list[j].x; | |
129 if (tmp < list[i].x) { | |
130 if (tmp > list[list[i].low].x) list[i].low = j; | |
131 } else { | |
132 if (tmp < list[list[i].high].x) list[i].high = j; | |
133 } | |
134 } | |
135 } | |
136 for (i = 0; i < values - 1; i++) { | |
137 int j; | |
138 for (j = i + 1; j < values; j++) { | |
139 if (list[list[i].sort].x > list[list[j].sort].x) { | |
140 int tmp = list[i].sort; | |
141 list[i].sort = list[j].sort; | |
142 list[j].sort = tmp; | |
143 } | |
144 } | |
145 } | |
146 } | |
147 | |
10309 | 148 static inline void render_line_unrolled(intptr_t x, intptr_t y, int x1, |
149 intptr_t sy, int ady, int adx, | |
150 float * buf) | |
151 { | |
10102
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
152 int err = -adx; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
153 x -= x1-1; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
154 buf += x1-1; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
155 while (++x < 0) { |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
156 err += ady; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
157 if (err >= 0) { |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
158 err += ady - adx; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
159 y += sy; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
160 buf[x++] = ff_vorbis_floor1_inverse_db_table[y]; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
161 } |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
162 buf[x] = ff_vorbis_floor1_inverse_db_table[y]; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
163 } |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
164 if (x <= 0) { |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
165 if (err + ady >= 0) |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
166 y += sy; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
167 buf[x] = ff_vorbis_floor1_inverse_db_table[y]; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
168 } |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
169 } |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
170 |
10309 | 171 static void render_line(int x0, int y0, int x1, int y1, float * buf) |
172 { | |
4971 | 173 int dy = y1 - y0; |
174 int adx = x1 - x0; | |
10102
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
175 int ady = FFABS(dy); |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
176 int sy = dy<0 ? -1 : 1; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
177 buf[x0] = ff_vorbis_floor1_inverse_db_table[y0]; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
178 if(ady*2<=adx) { // optimized common case |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
179 render_line_unrolled(x0, y0, x1, sy, ady, adx, buf); |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
180 } else { |
10103 | 181 int base = dy / adx; |
182 int x = x0; | |
183 int y = y0; | |
184 int err = -adx; | |
185 ady -= FFABS(base) * adx; | |
186 while (++x < x1) { | |
187 y += base; | |
188 err += ady; | |
189 if (err >= 0) { | |
190 err -= adx; | |
191 y += sy; | |
192 } | |
193 buf[x] = ff_vorbis_floor1_inverse_db_table[y]; | |
4971 | 194 } |
10102
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
195 } |
4971 | 196 } |
197 | |
10309 | 198 void ff_vorbis_floor1_render_list(vorbis_floor1_entry * list, int values, |
199 uint_fast16_t * y_list, int * flag, | |
200 int multiplier, float * out, int samples) | |
201 { | |
4971 | 202 int lx, ly, i; |
203 lx = 0; | |
204 ly = y_list[0] * multiplier; | |
205 for (i = 1; i < values; i++) { | |
206 int pos = list[i].sort; | |
207 if (flag[pos]) { | |
6340
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
208 int x1 = list[pos].x; |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
209 int y1 = y_list[pos] * multiplier; |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
210 if (lx < samples) |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
211 render_line(lx, ly, FFMIN(x1,samples), y1, out); |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
212 lx = x1; |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
213 ly = y1; |
4971 | 214 } |
215 if (lx >= samples) break; | |
216 } | |
6340
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
217 if (lx < samples) render_line(lx, ly, samples, ly, out); |
4971 | 218 } |