Coverage Report

Created: 2026-09-14 08:00

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/opus/celt/celt_lpc.c
Line
Count
Source
1
/* Copyright (c) 2009-2010 Xiph.Org Foundation
2
   Written by Jean-Marc Valin */
3
/*
4
   Redistribution and use in source and binary forms, with or without
5
   modification, are permitted provided that the following conditions
6
   are met:
7
8
   - Redistributions of source code must retain the above copyright
9
   notice, this list of conditions and the following disclaimer.
10
11
   - Redistributions in binary form must reproduce the above copyright
12
   notice, this list of conditions and the following disclaimer in the
13
   documentation and/or other materials provided with the distribution.
14
15
   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
16
   ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
17
   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
18
   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
19
   OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
20
   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
21
   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
22
   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
23
   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
24
   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25
   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26
*/
27
28
#ifdef HAVE_CONFIG_H
29
#include "config.h"
30
#endif
31
32
#include "celt_lpc.h"
33
#include "stack_alloc.h"
34
#include "mathops.h"
35
#include "pitch.h"
36
37
void _celt_lpc(
38
      opus_val16       *_lpc, /* out: [0...p-1] LPC coefficients      */
39
const opus_val32 *ac,  /* in:  [0...p] autocorrelation values  */
40
int          p
41
)
42
53.4k
{
43
53.4k
   int i, j;
44
53.4k
   opus_val32 r;
45
53.4k
   opus_val32 error = ac[0];
46
#ifdef FIXED_POINT
47
   opus_val32 lpc[CELT_LPC_ORDER];
48
#else
49
53.4k
   float *lpc = _lpc;
50
53.4k
#endif
51
52
53.4k
   OPUS_CLEAR(lpc, p);
53
#ifdef FIXED_POINT
54
   if (ac[0] != 0)
55
#else
56
53.4k
   if (ac[0] > 1e-10f)
57
53.0k
#endif
58
53.0k
   {
59
670k
      for (i = 0; i < p; i++) {
60
         /* Sum up this iteration's reflection coefficient */
61
631k
         opus_val32 rr = 0;
62
#if defined (FIXED_POINT) && OPUS_FAST_INT64
63
         opus_int64 acc = 0;
64
         for (j = 0; j < i; j++)
65
            acc += (opus_int64)(lpc[j]) * (opus_int64)(ac[i - j]);
66
         rr = (opus_val32)SHR64(acc, 31);
67
#else
68
6.63M
         for (j = 0; j < i; j++)
69
6.00M
            rr += MULT32_32_Q31(lpc[j],ac[i - j]);
70
631k
#endif
71
631k
         rr += SHR32(ac[i + 1],6);
72
631k
         r = -frac_div32(SHL32(rr,6), error);
73
         /*  Update LPC coefficients and total error */
74
631k
         lpc[i] = SHR32(r,6);
75
3.78M
         for (j = 0; j < (i+1)>>1; j++)
76
3.15M
         {
77
3.15M
            opus_val32 tmp1, tmp2;
78
3.15M
            tmp1 = lpc[j];
79
3.15M
            tmp2 = lpc[i-1-j];
80
3.15M
            lpc[j]     = tmp1 + MULT32_32_Q31(r,tmp2);
81
3.15M
            lpc[i-1-j] = tmp2 + MULT32_32_Q31(r,tmp1);
82
3.15M
         }
83
84
631k
         error = error - MULT32_32_Q31(MULT32_32_Q31(r,r),error);
85
         /* Bail out once we get 30 dB gain */
86
#ifdef FIXED_POINT
87
         if (error<=SHR32(ac[0],10))
88
            break;
89
#else
90
631k
         if (error<=.001f*ac[0])
91
14.3k
            break;
92
631k
#endif
93
631k
      }
94
53.0k
   }
95
#ifdef FIXED_POINT
96
   {
97
      /* Convert the int32 lpcs to int16 and ensure there are no wrap-arounds.
98
         This reuses the logic in silk_LPC_fit() and silk_bwexpander_32(). Any bug
99
         fixes should also be applied there. */
100
      int iter, idx = 0;
101
      opus_val32 maxabs, absval, chirp_Q16, chirp_minus_one_Q16;
102
103
      for (iter = 0; iter < 10; iter++) {
104
         maxabs = 0;
105
         for (i = 0; i < p; i++) {
106
            absval = ABS32(lpc[i]);
107
            if (absval > maxabs) {
108
               maxabs = absval;
109
               idx = i;
110
            }
111
         }
112
         maxabs = PSHR32(maxabs, 13);  /* Q25->Q12 */
113
114
         if (maxabs > 32767) {
115
            maxabs = MIN32(maxabs, 163838);
116
            chirp_Q16 = QCONST32(0.999, 16) - DIV32(SHL32(maxabs - 32767, 14),
117
                                                    SHR32(MULT32_32_32(maxabs, idx + 1), 2));
118
            chirp_minus_one_Q16 = chirp_Q16 - 65536;
119
120
            /* Apply bandwidth expansion. */
121
            for (i = 0; i < p - 1; i++) {
122
               lpc[i] = MULT32_32_Q16(chirp_Q16, lpc[i]);
123
               chirp_Q16 += PSHR32(MULT32_32_32(chirp_Q16, chirp_minus_one_Q16), 16);
124
            }
125
            lpc[p - 1] = MULT32_32_Q16(chirp_Q16, lpc[p - 1]);
126
         } else {
127
            break;
128
         }
129
      }
130
131
      if (iter == 10) {
132
         /* If the coeffs still do not fit into the 16 bit range after 10 iterations,
133
            fall back to the A(z)=1 filter. */
134
         OPUS_CLEAR(lpc, p);
135
         _lpc[0] = 4096;  /* Q12 */
136
      } else {
137
         for (i = 0; i < p; i++) {
138
            _lpc[i] = EXTRACT16(PSHR32(lpc[i], 13));  /* Q25->Q12 */
139
         }
140
      }
141
   }
142
#endif
143
53.4k
}
144
145
146
void celt_fir_c(
147
         const opus_val16 *x,
148
         const opus_val16 *num,
149
         opus_val16 *y,
150
         int N,
151
         int ord,
152
         int arch)
153
68.9k
{
154
68.9k
   int i,j;
155
68.9k
   VARDECL(opus_val16, rnum);
156
68.9k
   SAVE_STACK;
157
68.9k
   celt_assert(x != y);
158
68.9k
   ALLOC(rnum, ord, opus_val16);
159
1.72M
   for(i=0;i<ord;i++)
160
1.65M
      rnum[i] = num[ord-i-1];
161
9.03M
   for (i=0;i<N-3;i+=4)
162
8.96M
   {
163
8.96M
      opus_val32 sum[4];
164
8.96M
      sum[0] = SHL32(EXTEND32(x[i  ]), SIG_SHIFT);
165
8.96M
      sum[1] = SHL32(EXTEND32(x[i+1]), SIG_SHIFT);
166
8.96M
      sum[2] = SHL32(EXTEND32(x[i+2]), SIG_SHIFT);
167
8.96M
      sum[3] = SHL32(EXTEND32(x[i+3]), SIG_SHIFT);
168
#if defined(OPUS_CHECK_ASM) && defined(FIXED_POINT)
169
      {
170
         opus_val32 sum_c[4];
171
         memcpy(sum_c, sum, sizeof(sum_c));
172
         xcorr_kernel_c(rnum, x+i-ord, sum_c, ord);
173
#endif
174
8.96M
         xcorr_kernel(rnum, x+i-ord, sum, ord, arch);
175
#if defined(OPUS_CHECK_ASM) && defined(FIXED_POINT)
176
         celt_assert(memcmp(sum, sum_c, sizeof(sum)) == 0);
177
      }
178
#endif
179
8.96M
      y[i  ] = SROUND16(sum[0], SIG_SHIFT);
180
8.96M
      y[i+1] = SROUND16(sum[1], SIG_SHIFT);
181
8.96M
      y[i+2] = SROUND16(sum[2], SIG_SHIFT);
182
8.96M
      y[i+3] = SROUND16(sum[3], SIG_SHIFT);
183
8.96M
   }
184
109k
   for (;i<N;i++)
185
40.6k
   {
186
40.6k
      opus_val32 sum = SHL32(EXTEND32(x[i]), SIG_SHIFT);
187
1.01M
      for (j=0;j<ord;j++)
188
974k
         sum = MAC16_16(sum,rnum[j],x[i+j-ord]);
189
40.6k
      y[i] = SROUND16(sum, SIG_SHIFT);
190
40.6k
   }
191
68.9k
   RESTORE_STACK;
192
68.9k
}
193
194
void celt_iir(const opus_val32 *_x,
195
         const opus_val16 *den,
196
         opus_val32 *_y,
197
         int N,
198
         int ord,
199
         opus_val16 *mem,
200
         int arch)
201
68.9k
{
202
#ifdef SMALL_FOOTPRINT
203
   int i,j;
204
   (void)arch;
205
   for (i=0;i<N;i++)
206
   {
207
      opus_val32 sum = _x[i];
208
      for (j=0;j<ord;j++)
209
      {
210
         sum -= MULT16_16(den[j],mem[j]);
211
      }
212
      for (j=ord-1;j>=1;j--)
213
      {
214
         mem[j]=mem[j-1];
215
      }
216
      mem[0] = SROUND16(sum, SIG_SHIFT);
217
      _y[i] = sum;
218
   }
219
#else
220
68.9k
   int i,j;
221
68.9k
   VARDECL(opus_val16, rden);
222
68.9k
   VARDECL(opus_val16, y);
223
68.9k
   SAVE_STACK;
224
225
68.9k
   celt_assert((ord&3)==0);
226
68.9k
   ALLOC(rden, ord, opus_val16);
227
68.9k
   ALLOC(y, N+ord, opus_val16);
228
1.72M
   for(i=0;i<ord;i++)
229
1.65M
      rden[i] = den[ord-i-1];
230
1.72M
   for(i=0;i<ord;i++)
231
1.65M
      y[i] = -mem[ord-i-1];
232
34.9M
   for(;i<N+ord;i++)
233
34.9M
      y[i]=0;
234
8.80M
   for (i=0;i<N-3;i+=4)
235
8.73M
   {
236
      /* Unroll by 4 as if it were an FIR filter */
237
8.73M
      opus_val32 sum[4];
238
8.73M
      sum[0]=_x[i];
239
8.73M
      sum[1]=_x[i+1];
240
8.73M
      sum[2]=_x[i+2];
241
8.73M
      sum[3]=_x[i+3];
242
#if defined(OPUS_CHECK_ASM) && defined(FIXED_POINT)
243
      {
244
         opus_val32 sum_c[4];
245
         memcpy(sum_c, sum, sizeof(sum_c));
246
         xcorr_kernel_c(rden, y+i, sum_c, ord);
247
#endif
248
8.73M
         xcorr_kernel(rden, y+i, sum, ord, arch);
249
#if defined(OPUS_CHECK_ASM) && defined(FIXED_POINT)
250
         celt_assert(memcmp(sum, sum_c, sizeof(sum)) == 0);
251
      }
252
#endif
253
      /* Patch up the result to compensate for the fact that this is an IIR */
254
8.73M
      y[i+ord  ] = -SROUND16(sum[0],SIG_SHIFT);
255
8.73M
      _y[i  ] = sum[0];
256
8.73M
      sum[1] = MAC16_16(sum[1], y[i+ord  ], den[0]);
257
8.73M
      y[i+ord+1] = -SROUND16(sum[1],SIG_SHIFT);
258
8.73M
      _y[i+1] = sum[1];
259
8.73M
      sum[2] = MAC16_16(sum[2], y[i+ord+1], den[0]);
260
8.73M
      sum[2] = MAC16_16(sum[2], y[i+ord  ], den[1]);
261
8.73M
      y[i+ord+2] = -SROUND16(sum[2],SIG_SHIFT);
262
8.73M
      _y[i+2] = sum[2];
263
264
8.73M
      sum[3] = MAC16_16(sum[3], y[i+ord+2], den[0]);
265
8.73M
      sum[3] = MAC16_16(sum[3], y[i+ord+1], den[1]);
266
8.73M
      sum[3] = MAC16_16(sum[3], y[i+ord  ], den[2]);
267
8.73M
      y[i+ord+3] = -SROUND16(sum[3],SIG_SHIFT);
268
8.73M
      _y[i+3] = sum[3];
269
8.73M
   }
270
68.9k
   for (;i<N;i++)
271
0
   {
272
0
      opus_val32 sum = _x[i];
273
0
      for (j=0;j<ord;j++)
274
0
         sum -= MULT16_16(rden[j],y[i+j]);
275
0
      y[i+ord] = SROUND16(sum,SIG_SHIFT);
276
0
      _y[i] = sum;
277
0
   }
278
1.72M
   for(i=0;i<ord;i++)
279
1.65M
      mem[i] = _y[N-i-1];
280
68.9k
   RESTORE_STACK;
281
68.9k
#endif
282
68.9k
}
283
284
int _celt_autocorr(
285
                   const opus_val16 *x,   /*  in: [0...n-1] samples x   */
286
                   opus_val32       *ac,  /* out: [0...lag-1] ac values */
287
                   const celt_coef  *window,
288
                   int          overlap,
289
                   int          lag,
290
                   int          n,
291
                   int          arch
292
                  )
293
53.4k
{
294
53.4k
   opus_val32 d;
295
53.4k
   int i, k;
296
53.4k
   int fastN=n-lag;
297
53.4k
   int shift;
298
53.4k
   const opus_val16 *xptr;
299
53.4k
   VARDECL(opus_val16, xx);
300
53.4k
   SAVE_STACK;
301
53.4k
   ALLOC(xx, n, opus_val16);
302
53.4k
   celt_assert(n>0);
303
53.4k
   celt_assert(overlap>=0);
304
53.4k
   if (overlap == 0)
305
18.9k
   {
306
18.9k
      xptr = x;
307
34.5k
   } else {
308
35.3M
      for (i=0;i<n;i++)
309
35.3M
         xx[i] = x[i];
310
4.17M
      for (i=0;i<overlap;i++)
311
4.14M
      {
312
4.14M
         opus_val16 w = COEF2VAL16(window[i]);
313
4.14M
         xx[i] = MULT16_16_Q15(x[i],w);
314
4.14M
         xx[n-i-1] = MULT16_16_Q15(x[n-i-1],w);
315
4.14M
      }
316
34.5k
      xptr = xx;
317
34.5k
   }
318
53.4k
   shift=0;
319
#ifdef FIXED_POINT
320
   {
321
      opus_val32 ac0;
322
      int ac0_shift = celt_ilog2(n + (n>>4));
323
      ac0 = 1+(n<<7);
324
      if (n&1) ac0 += SHR32(MULT16_16(xptr[0],xptr[0]),ac0_shift);
325
      for(i=(n&1);i<n;i+=2)
326
      {
327
         ac0 += SHR32(MULT16_16(xptr[i],xptr[i]),ac0_shift);
328
         ac0 += SHR32(MULT16_16(xptr[i+1],xptr[i+1]),ac0_shift);
329
      }
330
      /* Consider the effect of rounding-to-nearest when scaling the signal. */
331
      ac0 += SHR32(ac0,7);
332
333
      shift = celt_ilog2(ac0)-30+ac0_shift+1;
334
      shift = (shift)/2;
335
      if (shift>0)
336
      {
337
         for(i=0;i<n;i++)
338
            xx[i] = PSHR32(xptr[i], shift);
339
         xptr = xx;
340
      } else
341
         shift = 0;
342
   }
343
#endif
344
53.4k
   celt_pitch_xcorr(xptr, xptr, ac, fastN, lag+1, arch);
345
1.01M
   for (k=0;k<=lag;k++)
346
958k
   {
347
11.5M
      for (i = k+fastN, d = 0; i < n; i++)
348
10.5M
         d = MAC16_16(d, xptr[i], xptr[i-k]);
349
958k
      ac[k] += d;
350
958k
   }
351
#ifdef FIXED_POINT
352
   shift = 2*shift;
353
   if (shift<=0)
354
      ac[0] += SHL32((opus_int32)1, -shift);
355
   if (ac[0] < 268435456)
356
   {
357
      int shift2 = 29 - EC_ILOG(ac[0]);
358
      for (i=0;i<=lag;i++)
359
         ac[i] = SHL32(ac[i], shift2);
360
      shift -= shift2;
361
   } else if (ac[0] >= 536870912)
362
   {
363
      int shift2=1;
364
      if (ac[0] >= 1073741824)
365
         shift2++;
366
      for (i=0;i<=lag;i++)
367
         ac[i] = SHR32(ac[i], shift2);
368
      shift += shift2;
369
   }
370
#endif
371
372
53.4k
   RESTORE_STACK;
373
53.4k
   return shift;
374
53.4k
}