Mercurial > libavcodec.hg
annotate vorbis.c @ 10143:c5e8a5a044c3 libavcodec
The ff_cos_tabs table itself is constant, too, so mark it as such.
author | reimar |
---|---|
date | Sun, 06 Sep 2009 08:53:14 +0000 |
parents | 8078ecd2fe4c |
children | d157ccc267e7 |
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 | |
35 unsigned int ff_vorbis_nth_root(unsigned int x, unsigned int n) { // x^(1/n) | |
36 unsigned int ret=0, i, j; | |
37 | |
38 do { | |
39 ++ret; | |
40 for(i=0,j=ret;i<n-1;i++) j*=ret; | |
41 } while (j<=x); | |
42 | |
6750 | 43 return ret - 1; |
4971 | 44 } |
45 | |
46 // Generate vlc codes from vorbis huffman code lengths | |
47 | |
9934 | 48 // the two bits[p] > 32 checks should be redundant, all calling code should |
49 // already ensure that, but since it allows overwriting the stack it seems | |
50 // reasonable to check redundantly. | |
4971 | 51 int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, uint_fast32_t num) { |
52 uint_fast32_t exit_at_level[33]={404,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, | |
53 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; | |
54 | |
55 uint_fast8_t i,j; | |
56 uint_fast32_t code,p; | |
57 | |
58 #ifdef V_DEBUG | |
59 GetBitContext gb; | |
60 #endif | |
61 | |
62 for(p=0;(bits[p]==0) && (p<num);++p); | |
63 if (p==num) { | |
64 // av_log(vc->avccontext, AV_LOG_INFO, "An empty codebook. Heh?! \n"); | |
65 return 0; | |
66 } | |
67 | |
68 codes[p]=0; | |
9934 | 69 if (bits[p] > 32) return 1; |
4971 | 70 for(i=0;i<bits[p];++i) { |
71 exit_at_level[i+1]=1<<i; | |
72 } | |
73 | |
74 #ifdef V_DEBUG | |
75 av_log(NULL, AV_LOG_INFO, " %d. of %d code len %d code %d - ", p, num, bits[p], codes[p]); | |
76 init_get_bits(&gb, (uint_fast8_t *)&codes[p], bits[p]); | |
77 for(i=0;i<bits[p];++i) { | |
78 av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0"); | |
79 } | |
80 av_log(NULL, AV_LOG_INFO, "\n"); | |
81 #endif | |
82 | |
83 ++p; | |
84 | |
85 for(;p<num;++p) { | |
9934 | 86 if (bits[p] > 32) return 1; |
4971 | 87 if (bits[p]==0) continue; |
88 // find corresponding exit(node which the tree can grow further from) | |
89 for(i=bits[p];i>0;--i) { | |
90 if (exit_at_level[i]) break; | |
91 } | |
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 | |
96 for(j=i+1;j<=bits[p];++j) { | |
97 exit_at_level[j]=code+(1<<(j-1)); | |
98 } | |
99 codes[p]=code; | |
100 | |
101 #ifdef V_DEBUG | |
102 av_log(NULL, AV_LOG_INFO, " %d. code len %d code %d - ", p, bits[p], codes[p]); | |
103 init_get_bits(&gb, (uint_fast8_t *)&codes[p], bits[p]); | |
104 for(i=0;i<bits[p];++i) { | |
105 av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0"); | |
106 } | |
107 av_log(NULL, AV_LOG_INFO, "\n"); | |
108 #endif | |
109 | |
110 } | |
111 | |
112 //no exits should be left (underspecified tree - ie. unused valid vlcs - not allowed by SPEC) | |
113 for (p=1; p<33; p++) | |
114 if (exit_at_level[p]) return 1; | |
115 | |
116 return 0; | |
117 } | |
118 | |
8306
ddecbc18fe94
Rename all vorbis encoder related typedefs to not use _t for POSIX compatibility
ods15
parents:
6750
diff
changeset
|
119 void ff_vorbis_ready_floor1_list(vorbis_floor1_entry * list, int values) { |
4971 | 120 int i; |
121 list[0].sort = 0; | |
122 list[1].sort = 1; | |
123 for (i = 2; i < values; i++) { | |
124 int j; | |
125 list[i].low = 0; | |
126 list[i].high = 1; | |
127 list[i].sort = i; | |
128 for (j = 2; j < i; j++) { | |
129 int tmp = list[j].x; | |
130 if (tmp < list[i].x) { | |
131 if (tmp > list[list[i].low].x) list[i].low = j; | |
132 } else { | |
133 if (tmp < list[list[i].high].x) list[i].high = j; | |
134 } | |
135 } | |
136 } | |
137 for (i = 0; i < values - 1; i++) { | |
138 int j; | |
139 for (j = i + 1; j < values; j++) { | |
140 if (list[list[i].sort].x > list[list[j].sort].x) { | |
141 int tmp = list[i].sort; | |
142 list[i].sort = list[j].sort; | |
143 list[j].sort = tmp; | |
144 } | |
145 } | |
146 } | |
147 } | |
148 | |
10102
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
149 static inline void render_line_unrolled(intptr_t x, intptr_t y, int x1, intptr_t sy, int ady, int adx, float * buf) { |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
150 int err = -adx; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
151 x -= x1-1; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
152 buf += x1-1; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
153 while (++x < 0) { |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
154 err += ady; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
155 if (err >= 0) { |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
156 err += ady - adx; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
157 y += sy; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
158 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
|
159 } |
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 if (x <= 0) { |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
163 if (err + ady >= 0) |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
164 y += sy; |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
165 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
|
166 } |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
167 } |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
168 |
6340
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
169 static void render_line(int x0, int y0, int x1, int y1, float * buf) { |
4971 | 170 int dy = y1 - y0; |
171 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
|
172 int ady = FFABS(dy); |
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
173 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
|
174 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
|
175 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
|
176 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
|
177 } else { |
10103 | 178 int base = dy / adx; |
179 int x = x0; | |
180 int y = y0; | |
181 int err = -adx; | |
182 ady -= FFABS(base) * adx; | |
183 while (++x < x1) { | |
184 y += base; | |
185 err += ady; | |
186 if (err >= 0) { | |
187 err -= adx; | |
188 y += sy; | |
189 } | |
190 buf[x] = ff_vorbis_floor1_inverse_db_table[y]; | |
4971 | 191 } |
10102
76eeb9e3599b
1.5x faster ff_vorbis_floor1_render_list, 5% faster vorbis decoding on Core2.
lorenm
parents:
9934
diff
changeset
|
192 } |
4971 | 193 } |
194 | |
8306
ddecbc18fe94
Rename all vorbis encoder related typedefs to not use _t for POSIX compatibility
ods15
parents:
6750
diff
changeset
|
195 void ff_vorbis_floor1_render_list(vorbis_floor1_entry * list, int values, uint_fast16_t * y_list, int * flag, int multiplier, float * out, int samples) { |
4971 | 196 int lx, ly, i; |
197 lx = 0; | |
198 ly = y_list[0] * multiplier; | |
199 for (i = 1; i < values; i++) { | |
200 int pos = list[i].sort; | |
201 if (flag[pos]) { | |
6340
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
202 int x1 = list[pos].x; |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
203 int y1 = y_list[pos] * multiplier; |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
204 if (lx < samples) |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
205 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
|
206 lx = x1; |
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
207 ly = y1; |
4971 | 208 } |
209 if (lx >= samples) break; | |
210 } | |
6340
575e0a847f0c
30% faster ff_vorbis_floor1_render_list, 3% faster overall
lorenm
parents:
5215
diff
changeset
|
211 if (lx < samples) render_line(lx, ly, samples, ly, out); |
4971 | 212 } |