Mercurial > libavcodec.hg
annotate vorbis.c @ 10310:d3644248015a libavcodec
some more linebreak and brace placement cosmetics
author | diego |
---|---|
date | Mon, 28 Sep 2009 21:46:22 +0000 |
parents | d157ccc267e7 |
children | 7bfcc66f807d |
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; | |
10310 | 42 for(i=0,j=ret;i<n-1;i++) |
43 j*=ret; | |
4971 | 44 } while (j<=x); |
45 | |
6750 | 46 return ret - 1; |
4971 | 47 } |
48 | |
49 // Generate vlc codes from vorbis huffman code lengths | |
50 | |
9934 | 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. | |
10309 | 54 int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, uint_fast32_t num) |
55 { | |
4971 | 56 uint_fast32_t exit_at_level[33]={404,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, |
57 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; | |
58 | |
59 uint_fast8_t i,j; | |
60 uint_fast32_t code,p; | |
61 | |
62 #ifdef V_DEBUG | |
63 GetBitContext gb; | |
64 #endif | |
65 | |
10310 | 66 for(p=0;(bits[p]==0) && (p<num);++p) |
67 ; | |
4971 | 68 if (p==num) { |
69 // av_log(vc->avccontext, AV_LOG_INFO, "An empty codebook. Heh?! \n"); | |
70 return 0; | |
71 } | |
72 | |
73 codes[p]=0; | |
10310 | 74 if (bits[p] > 32) |
75 return 1; | |
10309 | 76 for(i=0;i<bits[p];++i) |
4971 | 77 exit_at_level[i+1]=1<<i; |
78 | |
79 #ifdef V_DEBUG | |
80 av_log(NULL, AV_LOG_INFO, " %d. of %d code len %d code %d - ", p, num, bits[p], codes[p]); | |
81 init_get_bits(&gb, (uint_fast8_t *)&codes[p], bits[p]); | |
10309 | 82 for(i=0;i<bits[p];++i) |
4971 | 83 av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0"); |
84 av_log(NULL, AV_LOG_INFO, "\n"); | |
85 #endif | |
86 | |
87 ++p; | |
88 | |
89 for(;p<num;++p) { | |
10310 | 90 if (bits[p] > 32) |
91 return 1; | |
92 if (bits[p]==0) | |
93 continue; | |
4971 | 94 // find corresponding exit(node which the tree can grow further from) |
10309 | 95 for(i=bits[p];i>0;--i) |
10310 | 96 if (exit_at_level[i]) |
97 break; | |
98 if (!i) // overspecified tree | |
99 return 1; | |
4971 | 100 code=exit_at_level[i]; |
101 exit_at_level[i]=0; | |
102 // construct code (append 0s to end) and introduce new exits | |
10309 | 103 for(j=i+1;j<=bits[p];++j) |
4971 | 104 exit_at_level[j]=code+(1<<(j-1)); |
105 codes[p]=code; | |
106 | |
107 #ifdef V_DEBUG | |
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]); | |
10309 | 110 for(i=0;i<bits[p];++i) |
4971 | 111 av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0"); |
112 av_log(NULL, AV_LOG_INFO, "\n"); | |
113 #endif | |
114 | |
115 } | |
116 | |
117 //no exits should be left (underspecified tree - ie. unused valid vlcs - not allowed by SPEC) | |
118 for (p=1; p<33; p++) | |
10310 | 119 if (exit_at_level[p]) |
120 return 1; | |
4971 | 121 |
122 return 0; | |
123 } | |
124 | |
10309 | 125 void ff_vorbis_ready_floor1_list(vorbis_floor1_entry * list, int values) |
126 { | |
4971 | 127 int i; |
128 list[0].sort = 0; | |
129 list[1].sort = 1; | |
130 for (i = 2; i < values; i++) { | |
131 int j; | |
132 list[i].low = 0; | |
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) { | |
10310 | 138 if (tmp > list[list[i].low].x) |
139 list[i].low = j; | |
4971 | 140 } else { |
10310 | 141 if (tmp < list[list[i].high].x) |
142 list[i].high = j; | |
4971 | 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 | |
10309 | 158 static inline void render_line_unrolled(intptr_t x, intptr_t y, int x1, |
159 intptr_t sy, int ady, int adx, | |
160 float * buf) | |
161 { | |
10102
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
162 int err = -adx; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
163 x -= x1-1; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
164 buf += x1-1; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
165 while (++x < 0) { |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
166 err += ady; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
167 if (err >= 0) { |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
168 err += ady - adx; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
169 y += sy; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
170 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
|
171 } |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
172 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
|
173 } |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
174 if (x <= 0) { |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
175 if (err + ady >= 0) |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
176 y += sy; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
177 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
|
178 } |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
179 } |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
180 |
10309 | 181 static void render_line(int x0, int y0, int x1, int y1, float * buf) |
182 { | |
4971 | 183 int dy = y1 - y0; |
184 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
|
185 int ady = FFABS(dy); |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
186 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
|
187 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
|
188 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
|
189 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
|
190 } else { |
10103 | 191 int base = dy / adx; |
192 int x = x0; | |
193 int y = y0; | |
194 int err = -adx; | |
195 ady -= FFABS(base) * adx; | |
196 while (++x < x1) { | |
197 y += base; | |
198 err += ady; | |
199 if (err >= 0) { | |
200 err -= adx; | |
201 y += sy; | |
202 } | |
203 buf[x] = ff_vorbis_floor1_inverse_db_table[y]; | |
4971 | 204 } |
10102
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
205 } |
4971 | 206 } |
207 | |
10309 | 208 void ff_vorbis_floor1_render_list(vorbis_floor1_entry * list, int values, |
209 uint_fast16_t * y_list, int * flag, | |
210 int multiplier, float * out, int samples) | |
211 { | |
4971 | 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]) { | |
6340
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
218 int x1 = list[pos].x; |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
219 int y1 = y_list[pos] * multiplier; |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
220 if (lx < samples) |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
221 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
|
222 lx = x1; |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
223 ly = y1; |
4971 | 224 } |
10310 | 225 if (lx >= samples) |
226 break; | |
4971 | 227 } |
10310 | 228 if (lx < samples) |
229 render_line(lx, ly, samples, ly, out); | |
4971 | 230 } |