cannam@154
|
1 /* Copyright (c) 2007-2008 CSIRO
|
cannam@154
|
2 Copyright (c) 2007-2010 Xiph.Org Foundation
|
cannam@154
|
3 Copyright (c) 2008 Gregory Maxwell
|
cannam@154
|
4 Written by Jean-Marc Valin and Gregory Maxwell */
|
cannam@154
|
5 /*
|
cannam@154
|
6 Redistribution and use in source and binary forms, with or without
|
cannam@154
|
7 modification, are permitted provided that the following conditions
|
cannam@154
|
8 are met:
|
cannam@154
|
9
|
cannam@154
|
10 - Redistributions of source code must retain the above copyright
|
cannam@154
|
11 notice, this list of conditions and the following disclaimer.
|
cannam@154
|
12
|
cannam@154
|
13 - Redistributions in binary form must reproduce the above copyright
|
cannam@154
|
14 notice, this list of conditions and the following disclaimer in the
|
cannam@154
|
15 documentation and/or other materials provided with the distribution.
|
cannam@154
|
16
|
cannam@154
|
17 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
cannam@154
|
18 ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
cannam@154
|
19 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
cannam@154
|
20 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
|
cannam@154
|
21 OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
cannam@154
|
22 EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
cannam@154
|
23 PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
cannam@154
|
24 PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
cannam@154
|
25 LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
cannam@154
|
26 NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
cannam@154
|
27 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
cannam@154
|
28 */
|
cannam@154
|
29
|
cannam@154
|
30 #ifdef HAVE_CONFIG_H
|
cannam@154
|
31 #include "config.h"
|
cannam@154
|
32 #endif
|
cannam@154
|
33
|
cannam@154
|
34 #define CELT_C
|
cannam@154
|
35
|
cannam@154
|
36 #include "os_support.h"
|
cannam@154
|
37 #include "mdct.h"
|
cannam@154
|
38 #include <math.h>
|
cannam@154
|
39 #include "celt.h"
|
cannam@154
|
40 #include "pitch.h"
|
cannam@154
|
41 #include "bands.h"
|
cannam@154
|
42 #include "modes.h"
|
cannam@154
|
43 #include "entcode.h"
|
cannam@154
|
44 #include "quant_bands.h"
|
cannam@154
|
45 #include "rate.h"
|
cannam@154
|
46 #include "stack_alloc.h"
|
cannam@154
|
47 #include "mathops.h"
|
cannam@154
|
48 #include "float_cast.h"
|
cannam@154
|
49 #include <stdarg.h>
|
cannam@154
|
50 #include "celt_lpc.h"
|
cannam@154
|
51 #include "vq.h"
|
cannam@154
|
52
|
cannam@154
|
53 #ifndef PACKAGE_VERSION
|
cannam@154
|
54 #define PACKAGE_VERSION "unknown"
|
cannam@154
|
55 #endif
|
cannam@154
|
56
|
cannam@154
|
57 #if defined(MIPSr1_ASM)
|
cannam@154
|
58 #include "mips/celt_mipsr1.h"
|
cannam@154
|
59 #endif
|
cannam@154
|
60
|
cannam@154
|
61
|
cannam@154
|
62 int resampling_factor(opus_int32 rate)
|
cannam@154
|
63 {
|
cannam@154
|
64 int ret;
|
cannam@154
|
65 switch (rate)
|
cannam@154
|
66 {
|
cannam@154
|
67 case 48000:
|
cannam@154
|
68 ret = 1;
|
cannam@154
|
69 break;
|
cannam@154
|
70 case 24000:
|
cannam@154
|
71 ret = 2;
|
cannam@154
|
72 break;
|
cannam@154
|
73 case 16000:
|
cannam@154
|
74 ret = 3;
|
cannam@154
|
75 break;
|
cannam@154
|
76 case 12000:
|
cannam@154
|
77 ret = 4;
|
cannam@154
|
78 break;
|
cannam@154
|
79 case 8000:
|
cannam@154
|
80 ret = 6;
|
cannam@154
|
81 break;
|
cannam@154
|
82 default:
|
cannam@154
|
83 #ifndef CUSTOM_MODES
|
cannam@154
|
84 celt_assert(0);
|
cannam@154
|
85 #endif
|
cannam@154
|
86 ret = 0;
|
cannam@154
|
87 break;
|
cannam@154
|
88 }
|
cannam@154
|
89 return ret;
|
cannam@154
|
90 }
|
cannam@154
|
91
|
cannam@154
|
92 #if !defined(OVERRIDE_COMB_FILTER_CONST) || defined(NON_STATIC_COMB_FILTER_CONST_C)
|
cannam@154
|
93 /* This version should be faster on ARM */
|
cannam@154
|
94 #ifdef OPUS_ARM_ASM
|
cannam@154
|
95 #ifndef NON_STATIC_COMB_FILTER_CONST_C
|
cannam@154
|
96 static
|
cannam@154
|
97 #endif
|
cannam@154
|
98 void comb_filter_const_c(opus_val32 *y, opus_val32 *x, int T, int N,
|
cannam@154
|
99 opus_val16 g10, opus_val16 g11, opus_val16 g12)
|
cannam@154
|
100 {
|
cannam@154
|
101 opus_val32 x0, x1, x2, x3, x4;
|
cannam@154
|
102 int i;
|
cannam@154
|
103 x4 = SHL32(x[-T-2], 1);
|
cannam@154
|
104 x3 = SHL32(x[-T-1], 1);
|
cannam@154
|
105 x2 = SHL32(x[-T], 1);
|
cannam@154
|
106 x1 = SHL32(x[-T+1], 1);
|
cannam@154
|
107 for (i=0;i<N-4;i+=5)
|
cannam@154
|
108 {
|
cannam@154
|
109 opus_val32 t;
|
cannam@154
|
110 x0=SHL32(x[i-T+2],1);
|
cannam@154
|
111 t = MAC16_32_Q16(x[i], g10, x2);
|
cannam@154
|
112 t = MAC16_32_Q16(t, g11, ADD32(x1,x3));
|
cannam@154
|
113 t = MAC16_32_Q16(t, g12, ADD32(x0,x4));
|
cannam@154
|
114 t = SATURATE(t, SIG_SAT);
|
cannam@154
|
115 y[i] = t;
|
cannam@154
|
116 x4=SHL32(x[i-T+3],1);
|
cannam@154
|
117 t = MAC16_32_Q16(x[i+1], g10, x1);
|
cannam@154
|
118 t = MAC16_32_Q16(t, g11, ADD32(x0,x2));
|
cannam@154
|
119 t = MAC16_32_Q16(t, g12, ADD32(x4,x3));
|
cannam@154
|
120 t = SATURATE(t, SIG_SAT);
|
cannam@154
|
121 y[i+1] = t;
|
cannam@154
|
122 x3=SHL32(x[i-T+4],1);
|
cannam@154
|
123 t = MAC16_32_Q16(x[i+2], g10, x0);
|
cannam@154
|
124 t = MAC16_32_Q16(t, g11, ADD32(x4,x1));
|
cannam@154
|
125 t = MAC16_32_Q16(t, g12, ADD32(x3,x2));
|
cannam@154
|
126 t = SATURATE(t, SIG_SAT);
|
cannam@154
|
127 y[i+2] = t;
|
cannam@154
|
128 x2=SHL32(x[i-T+5],1);
|
cannam@154
|
129 t = MAC16_32_Q16(x[i+3], g10, x4);
|
cannam@154
|
130 t = MAC16_32_Q16(t, g11, ADD32(x3,x0));
|
cannam@154
|
131 t = MAC16_32_Q16(t, g12, ADD32(x2,x1));
|
cannam@154
|
132 t = SATURATE(t, SIG_SAT);
|
cannam@154
|
133 y[i+3] = t;
|
cannam@154
|
134 x1=SHL32(x[i-T+6],1);
|
cannam@154
|
135 t = MAC16_32_Q16(x[i+4], g10, x3);
|
cannam@154
|
136 t = MAC16_32_Q16(t, g11, ADD32(x2,x4));
|
cannam@154
|
137 t = MAC16_32_Q16(t, g12, ADD32(x1,x0));
|
cannam@154
|
138 t = SATURATE(t, SIG_SAT);
|
cannam@154
|
139 y[i+4] = t;
|
cannam@154
|
140 }
|
cannam@154
|
141 #ifdef CUSTOM_MODES
|
cannam@154
|
142 for (;i<N;i++)
|
cannam@154
|
143 {
|
cannam@154
|
144 opus_val32 t;
|
cannam@154
|
145 x0=SHL32(x[i-T+2],1);
|
cannam@154
|
146 t = MAC16_32_Q16(x[i], g10, x2);
|
cannam@154
|
147 t = MAC16_32_Q16(t, g11, ADD32(x1,x3));
|
cannam@154
|
148 t = MAC16_32_Q16(t, g12, ADD32(x0,x4));
|
cannam@154
|
149 t = SATURATE(t, SIG_SAT);
|
cannam@154
|
150 y[i] = t;
|
cannam@154
|
151 x4=x3;
|
cannam@154
|
152 x3=x2;
|
cannam@154
|
153 x2=x1;
|
cannam@154
|
154 x1=x0;
|
cannam@154
|
155 }
|
cannam@154
|
156 #endif
|
cannam@154
|
157 }
|
cannam@154
|
158 #else
|
cannam@154
|
159 #ifndef NON_STATIC_COMB_FILTER_CONST_C
|
cannam@154
|
160 static
|
cannam@154
|
161 #endif
|
cannam@154
|
162 void comb_filter_const_c(opus_val32 *y, opus_val32 *x, int T, int N,
|
cannam@154
|
163 opus_val16 g10, opus_val16 g11, opus_val16 g12)
|
cannam@154
|
164 {
|
cannam@154
|
165 opus_val32 x0, x1, x2, x3, x4;
|
cannam@154
|
166 int i;
|
cannam@154
|
167 x4 = x[-T-2];
|
cannam@154
|
168 x3 = x[-T-1];
|
cannam@154
|
169 x2 = x[-T];
|
cannam@154
|
170 x1 = x[-T+1];
|
cannam@154
|
171 for (i=0;i<N;i++)
|
cannam@154
|
172 {
|
cannam@154
|
173 x0=x[i-T+2];
|
cannam@154
|
174 y[i] = x[i]
|
cannam@154
|
175 + MULT16_32_Q15(g10,x2)
|
cannam@154
|
176 + MULT16_32_Q15(g11,ADD32(x1,x3))
|
cannam@154
|
177 + MULT16_32_Q15(g12,ADD32(x0,x4));
|
cannam@154
|
178 y[i] = SATURATE(y[i], SIG_SAT);
|
cannam@154
|
179 x4=x3;
|
cannam@154
|
180 x3=x2;
|
cannam@154
|
181 x2=x1;
|
cannam@154
|
182 x1=x0;
|
cannam@154
|
183 }
|
cannam@154
|
184
|
cannam@154
|
185 }
|
cannam@154
|
186 #endif
|
cannam@154
|
187 #endif
|
cannam@154
|
188
|
cannam@154
|
189 #ifndef OVERRIDE_comb_filter
|
cannam@154
|
190 void comb_filter(opus_val32 *y, opus_val32 *x, int T0, int T1, int N,
|
cannam@154
|
191 opus_val16 g0, opus_val16 g1, int tapset0, int tapset1,
|
cannam@154
|
192 const opus_val16 *window, int overlap, int arch)
|
cannam@154
|
193 {
|
cannam@154
|
194 int i;
|
cannam@154
|
195 /* printf ("%d %d %f %f\n", T0, T1, g0, g1); */
|
cannam@154
|
196 opus_val16 g00, g01, g02, g10, g11, g12;
|
cannam@154
|
197 opus_val32 x0, x1, x2, x3, x4;
|
cannam@154
|
198 static const opus_val16 gains[3][3] = {
|
cannam@154
|
199 {QCONST16(0.3066406250f, 15), QCONST16(0.2170410156f, 15), QCONST16(0.1296386719f, 15)},
|
cannam@154
|
200 {QCONST16(0.4638671875f, 15), QCONST16(0.2680664062f, 15), QCONST16(0.f, 15)},
|
cannam@154
|
201 {QCONST16(0.7998046875f, 15), QCONST16(0.1000976562f, 15), QCONST16(0.f, 15)}};
|
cannam@154
|
202
|
cannam@154
|
203 if (g0==0 && g1==0)
|
cannam@154
|
204 {
|
cannam@154
|
205 /* OPT: Happens to work without the OPUS_MOVE(), but only because the current encoder already copies x to y */
|
cannam@154
|
206 if (x!=y)
|
cannam@154
|
207 OPUS_MOVE(y, x, N);
|
cannam@154
|
208 return;
|
cannam@154
|
209 }
|
cannam@154
|
210 /* When the gain is zero, T0 and/or T1 is set to zero. We need
|
cannam@154
|
211 to have then be at least 2 to avoid processing garbage data. */
|
cannam@154
|
212 T0 = IMAX(T0, COMBFILTER_MINPERIOD);
|
cannam@154
|
213 T1 = IMAX(T1, COMBFILTER_MINPERIOD);
|
cannam@154
|
214 g00 = MULT16_16_P15(g0, gains[tapset0][0]);
|
cannam@154
|
215 g01 = MULT16_16_P15(g0, gains[tapset0][1]);
|
cannam@154
|
216 g02 = MULT16_16_P15(g0, gains[tapset0][2]);
|
cannam@154
|
217 g10 = MULT16_16_P15(g1, gains[tapset1][0]);
|
cannam@154
|
218 g11 = MULT16_16_P15(g1, gains[tapset1][1]);
|
cannam@154
|
219 g12 = MULT16_16_P15(g1, gains[tapset1][2]);
|
cannam@154
|
220 x1 = x[-T1+1];
|
cannam@154
|
221 x2 = x[-T1 ];
|
cannam@154
|
222 x3 = x[-T1-1];
|
cannam@154
|
223 x4 = x[-T1-2];
|
cannam@154
|
224 /* If the filter didn't change, we don't need the overlap */
|
cannam@154
|
225 if (g0==g1 && T0==T1 && tapset0==tapset1)
|
cannam@154
|
226 overlap=0;
|
cannam@154
|
227 for (i=0;i<overlap;i++)
|
cannam@154
|
228 {
|
cannam@154
|
229 opus_val16 f;
|
cannam@154
|
230 x0=x[i-T1+2];
|
cannam@154
|
231 f = MULT16_16_Q15(window[i],window[i]);
|
cannam@154
|
232 y[i] = x[i]
|
cannam@154
|
233 + MULT16_32_Q15(MULT16_16_Q15((Q15ONE-f),g00),x[i-T0])
|
cannam@154
|
234 + MULT16_32_Q15(MULT16_16_Q15((Q15ONE-f),g01),ADD32(x[i-T0+1],x[i-T0-1]))
|
cannam@154
|
235 + MULT16_32_Q15(MULT16_16_Q15((Q15ONE-f),g02),ADD32(x[i-T0+2],x[i-T0-2]))
|
cannam@154
|
236 + MULT16_32_Q15(MULT16_16_Q15(f,g10),x2)
|
cannam@154
|
237 + MULT16_32_Q15(MULT16_16_Q15(f,g11),ADD32(x1,x3))
|
cannam@154
|
238 + MULT16_32_Q15(MULT16_16_Q15(f,g12),ADD32(x0,x4));
|
cannam@154
|
239 y[i] = SATURATE(y[i], SIG_SAT);
|
cannam@154
|
240 x4=x3;
|
cannam@154
|
241 x3=x2;
|
cannam@154
|
242 x2=x1;
|
cannam@154
|
243 x1=x0;
|
cannam@154
|
244
|
cannam@154
|
245 }
|
cannam@154
|
246 if (g1==0)
|
cannam@154
|
247 {
|
cannam@154
|
248 /* OPT: Happens to work without the OPUS_MOVE(), but only because the current encoder already copies x to y */
|
cannam@154
|
249 if (x!=y)
|
cannam@154
|
250 OPUS_MOVE(y+overlap, x+overlap, N-overlap);
|
cannam@154
|
251 return;
|
cannam@154
|
252 }
|
cannam@154
|
253
|
cannam@154
|
254 /* Compute the part with the constant filter. */
|
cannam@154
|
255 comb_filter_const(y+i, x+i, T1, N-i, g10, g11, g12, arch);
|
cannam@154
|
256 }
|
cannam@154
|
257 #endif /* OVERRIDE_comb_filter */
|
cannam@154
|
258
|
cannam@154
|
259 /* TF change table. Positive values mean better frequency resolution (longer
|
cannam@154
|
260 effective window), whereas negative values mean better time resolution
|
cannam@154
|
261 (shorter effective window). The second index is computed as:
|
cannam@154
|
262 4*isTransient + 2*tf_select + per_band_flag */
|
cannam@154
|
263 const signed char tf_select_table[4][8] = {
|
cannam@154
|
264 /*isTransient=0 isTransient=1 */
|
cannam@154
|
265 {0, -1, 0, -1, 0,-1, 0,-1}, /* 2.5 ms */
|
cannam@154
|
266 {0, -1, 0, -2, 1, 0, 1,-1}, /* 5 ms */
|
cannam@154
|
267 {0, -2, 0, -3, 2, 0, 1,-1}, /* 10 ms */
|
cannam@154
|
268 {0, -2, 0, -3, 3, 0, 1,-1}, /* 20 ms */
|
cannam@154
|
269 };
|
cannam@154
|
270
|
cannam@154
|
271
|
cannam@154
|
272 void init_caps(const CELTMode *m,int *cap,int LM,int C)
|
cannam@154
|
273 {
|
cannam@154
|
274 int i;
|
cannam@154
|
275 for (i=0;i<m->nbEBands;i++)
|
cannam@154
|
276 {
|
cannam@154
|
277 int N;
|
cannam@154
|
278 N=(m->eBands[i+1]-m->eBands[i])<<LM;
|
cannam@154
|
279 cap[i] = (m->cache.caps[m->nbEBands*(2*LM+C-1)+i]+64)*C*N>>2;
|
cannam@154
|
280 }
|
cannam@154
|
281 }
|
cannam@154
|
282
|
cannam@154
|
283
|
cannam@154
|
284
|
cannam@154
|
285 const char *opus_strerror(int error)
|
cannam@154
|
286 {
|
cannam@154
|
287 static const char * const error_strings[8] = {
|
cannam@154
|
288 "success",
|
cannam@154
|
289 "invalid argument",
|
cannam@154
|
290 "buffer too small",
|
cannam@154
|
291 "internal error",
|
cannam@154
|
292 "corrupted stream",
|
cannam@154
|
293 "request not implemented",
|
cannam@154
|
294 "invalid state",
|
cannam@154
|
295 "memory allocation failed"
|
cannam@154
|
296 };
|
cannam@154
|
297 if (error > 0 || error < -7)
|
cannam@154
|
298 return "unknown error";
|
cannam@154
|
299 else
|
cannam@154
|
300 return error_strings[-error];
|
cannam@154
|
301 }
|
cannam@154
|
302
|
cannam@154
|
303 const char *opus_get_version_string(void)
|
cannam@154
|
304 {
|
cannam@154
|
305 return "libopus " PACKAGE_VERSION
|
cannam@154
|
306 /* Applications may rely on the presence of this substring in the version
|
cannam@154
|
307 string to determine if they have a fixed-point or floating-point build
|
cannam@154
|
308 at runtime. */
|
cannam@154
|
309 #ifdef FIXED_POINT
|
cannam@154
|
310 "-fixed"
|
cannam@154
|
311 #endif
|
cannam@154
|
312 #ifdef FUZZING
|
cannam@154
|
313 "-fuzzing"
|
cannam@154
|
314 #endif
|
cannam@154
|
315 ;
|
cannam@154
|
316 }
|