Coverage Report

Created: 2025-08-28 07:12

/src/opus/celt/pitch.c
Line
Count
Source (jump to first uncovered line)
1
/* Copyright (c) 2007-2008 CSIRO
2
   Copyright (c) 2007-2009 Xiph.Org Foundation
3
   Written by Jean-Marc Valin */
4
/**
5
   @file pitch.c
6
   @brief Pitch analysis
7
 */
8
9
/*
10
   Redistribution and use in source and binary forms, with or without
11
   modification, are permitted provided that the following conditions
12
   are met:
13
14
   - Redistributions of source code must retain the above copyright
15
   notice, this list of conditions and the following disclaimer.
16
17
   - Redistributions in binary form must reproduce the above copyright
18
   notice, this list of conditions and the following disclaimer in the
19
   documentation and/or other materials provided with the distribution.
20
21
   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22
   ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23
   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24
   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
25
   OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
26
   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
27
   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
28
   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
29
   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
30
   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
31
   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32
*/
33
34
#ifdef HAVE_CONFIG_H
35
#include "config.h"
36
#endif
37
38
#include "pitch.h"
39
#include "os_support.h"
40
#include "modes.h"
41
#include "stack_alloc.h"
42
#include "mathops.h"
43
#include "celt_lpc.h"
44
45
static void find_best_pitch(opus_val32 *xcorr, opus_val16 *y, int len,
46
                            int max_pitch, int *best_pitch
47
#ifdef FIXED_POINT
48
                            , int yshift, opus_val32 maxcorr
49
#endif
50
                            )
51
36.9k
{
52
36.9k
   int i, j;
53
36.9k
   opus_val32 Syy=1;
54
36.9k
   opus_val16 best_num[2];
55
36.9k
   opus_val32 best_den[2];
56
#ifdef FIXED_POINT
57
   int xshift;
58
59
   xshift = celt_ilog2(maxcorr)-14;
60
#endif
61
62
36.9k
   best_num[0] = -1;
63
36.9k
   best_num[1] = -1;
64
36.9k
   best_den[0] = 0;
65
36.9k
   best_den[1] = 0;
66
36.9k
   best_pitch[0] = 0;
67
36.9k
   best_pitch[1] = 1;
68
18.4M
   for (j=0;j<len;j++)
69
18.4M
      Syy = ADD32(Syy, SHR32(MULT16_16(y[j],y[j]), yshift));
70
8.63M
   for (i=0;i<max_pitch;i++)
71
8.59M
   {
72
8.59M
      if (xcorr[i]>0)
73
866k
      {
74
866k
         opus_val16 num;
75
866k
         opus_val32 xcorr16;
76
866k
         xcorr16 = EXTRACT16(VSHR32(xcorr[i], xshift));
77
866k
#ifndef FIXED_POINT
78
         /* Considering the range of xcorr16, this should avoid both underflows
79
            and overflows (inf) when squaring xcorr16 */
80
866k
         xcorr16 *= 1e-12f;
81
866k
#endif
82
866k
         num = MULT16_16_Q15(xcorr16,xcorr16);
83
866k
         if (MULT16_32_Q15(num,best_den[1]) > MULT16_32_Q15(best_num[1],Syy))
84
291k
         {
85
291k
            if (MULT16_32_Q15(num,best_den[0]) > MULT16_32_Q15(best_num[0],Syy))
86
229k
            {
87
229k
               best_num[1] = best_num[0];
88
229k
               best_den[1] = best_den[0];
89
229k
               best_pitch[1] = best_pitch[0];
90
229k
               best_num[0] = num;
91
229k
               best_den[0] = Syy;
92
229k
               best_pitch[0] = i;
93
229k
            } else {
94
61.8k
               best_num[1] = num;
95
61.8k
               best_den[1] = Syy;
96
61.8k
               best_pitch[1] = i;
97
61.8k
            }
98
291k
         }
99
866k
      }
100
8.59M
      Syy += SHR32(MULT16_16(y[i+len],y[i+len]),yshift) - SHR32(MULT16_16(y[i],y[i]),yshift);
101
8.59M
      Syy = MAX32(1, Syy);
102
8.59M
   }
103
36.9k
}
104
105
static void celt_fir5(opus_val16 *x,
106
         const opus_val16 *num,
107
         int N)
108
18.4k
{
109
18.4k
   int i;
110
18.4k
   opus_val16 num0, num1, num2, num3, num4;
111
18.4k
   opus_val32 mem0, mem1, mem2, mem3, mem4;
112
18.4k
   num0=num[0];
113
18.4k
   num1=num[1];
114
18.4k
   num2=num[2];
115
18.4k
   num3=num[3];
116
18.4k
   num4=num[4];
117
18.4k
   mem0=0;
118
18.4k
   mem1=0;
119
18.4k
   mem2=0;
120
18.4k
   mem3=0;
121
18.4k
   mem4=0;
122
18.9M
   for (i=0;i<N;i++)
123
18.9M
   {
124
18.9M
      opus_val32 sum = SHL32(EXTEND32(x[i]), SIG_SHIFT);
125
18.9M
      sum = MAC16_16(sum,num0,mem0);
126
18.9M
      sum = MAC16_16(sum,num1,mem1);
127
18.9M
      sum = MAC16_16(sum,num2,mem2);
128
18.9M
      sum = MAC16_16(sum,num3,mem3);
129
18.9M
      sum = MAC16_16(sum,num4,mem4);
130
18.9M
      mem4 = mem3;
131
18.9M
      mem3 = mem2;
132
18.9M
      mem2 = mem1;
133
18.9M
      mem1 = mem0;
134
18.9M
      mem0 = x[i];
135
18.9M
      x[i] = ROUND16(sum, SIG_SHIFT);
136
18.9M
   }
137
18.4k
}
138
139
140
void pitch_downsample(celt_sig * OPUS_RESTRICT x[], opus_val16 * OPUS_RESTRICT x_lp,
141
      int len, int C, int arch)
142
18.4k
{
143
18.4k
   int i;
144
18.4k
   opus_val32 ac[5];
145
18.4k
   opus_val16 tmp=Q15ONE;
146
18.4k
   opus_val16 lpc[4];
147
18.4k
   opus_val16 lpc2[5];
148
18.4k
   opus_val16 c1 = QCONST16(.8f,15);
149
#ifdef FIXED_POINT
150
   int shift;
151
   opus_val32 maxabs = celt_maxabs32(x[0], len);
152
   if (C==2)
153
   {
154
      opus_val32 maxabs_1 = celt_maxabs32(x[1], len);
155
      maxabs = MAX32(maxabs, maxabs_1);
156
   }
157
   if (maxabs<1)
158
      maxabs=1;
159
   shift = celt_ilog2(maxabs)-10;
160
   if (shift<0)
161
      shift=0;
162
   if (C==2)
163
      shift++;
164
   for (i=1;i<len>>1;i++)
165
      x_lp[i] = SHR32(x[0][(2*i-1)], shift+2) + SHR32(x[0][(2*i+1)], shift+2) + SHR32(x[0][2*i], shift+1);
166
   x_lp[0] = SHR32(x[0][1], shift+2) + SHR32(x[0][0], shift+1);
167
   if (C==2)
168
   {
169
      for (i=1;i<len>>1;i++)
170
         x_lp[i] += SHR32(x[1][(2*i-1)], shift+2) + SHR32(x[1][(2*i+1)], shift+2) + SHR32(x[1][2*i], shift+1);
171
      x_lp[0] += SHR32(x[1][1], shift+2) + SHR32(x[1][0], shift+1);
172
   }
173
#else
174
18.9M
   for (i=1;i<len>>1;i++)
175
18.9M
      x_lp[i] = .25f*x[0][(2*i-1)] + .25f*x[0][(2*i+1)] + .5f*x[0][2*i];
176
18.4k
   x_lp[0] = .25f*x[0][1] + .5f*x[0][0];
177
18.4k
   if (C==2)
178
15.1k
   {
179
15.5M
      for (i=1;i<len>>1;i++)
180
15.5M
         x_lp[i] += .25f*x[1][(2*i-1)] + .25f*x[1][(2*i+1)] + .5f*x[1][2*i];
181
15.1k
      x_lp[0] += .25f*x[1][1] + .5f*x[1][0];
182
15.1k
   }
183
18.4k
#endif
184
18.4k
   _celt_autocorr(x_lp, ac, NULL, 0,
185
18.4k
                  4, len>>1, arch);
186
187
   /* Noise floor -40 dB */
188
#ifdef FIXED_POINT
189
   ac[0] += SHR32(ac[0],13);
190
#else
191
18.4k
   ac[0] *= 1.0001f;
192
18.4k
#endif
193
   /* Lag windowing */
194
92.4k
   for (i=1;i<=4;i++)
195
73.9k
   {
196
      /*ac[i] *= exp(-.5*(2*M_PI*.002*i)*(2*M_PI*.002*i));*/
197
#ifdef FIXED_POINT
198
      ac[i] -= MULT16_32_Q15(2*i*i, ac[i]);
199
#else
200
73.9k
      ac[i] -= ac[i]*(.008f*i)*(.008f*i);
201
73.9k
#endif
202
73.9k
   }
203
204
18.4k
   _celt_lpc(lpc, ac, 4);
205
92.4k
   for (i=0;i<4;i++)
206
73.9k
   {
207
73.9k
      tmp = MULT16_16_Q15(QCONST16(.9f,15), tmp);
208
73.9k
      lpc[i] = MULT16_16_Q15(lpc[i], tmp);
209
73.9k
   }
210
   /* Add a zero */
211
18.4k
   lpc2[0] = lpc[0] + QCONST16(.8f,SIG_SHIFT);
212
18.4k
   lpc2[1] = lpc[1] + MULT16_16_Q15(c1,lpc[0]);
213
18.4k
   lpc2[2] = lpc[2] + MULT16_16_Q15(c1,lpc[1]);
214
18.4k
   lpc2[3] = lpc[3] + MULT16_16_Q15(c1,lpc[2]);
215
18.4k
   lpc2[4] = MULT16_16_Q15(c1,lpc[3]);
216
18.4k
   celt_fir5(x_lp, lpc2, len>>1);
217
18.4k
}
218
219
/* Pure C implementation. */
220
#ifdef FIXED_POINT
221
opus_val32
222
#else
223
void
224
#endif
225
celt_pitch_xcorr_c(const opus_val16 *_x, const opus_val16 *_y,
226
      opus_val32 *xcorr, int len, int max_pitch, int arch)
227
0
{
228
229
#if 0 /* This is a simple version of the pitch correlation that should work
230
         well on DSPs like Blackfin and TI C5x/C6x */
231
   int i, j;
232
#ifdef FIXED_POINT
233
   opus_val32 maxcorr=1;
234
#endif
235
#if !defined(OVERRIDE_PITCH_XCORR)
236
   (void)arch;
237
#endif
238
   for (i=0;i<max_pitch;i++)
239
   {
240
      opus_val32 sum = 0;
241
      for (j=0;j<len;j++)
242
         sum = MAC16_16(sum, _x[j], _y[i+j]);
243
      xcorr[i] = sum;
244
#ifdef FIXED_POINT
245
      maxcorr = MAX32(maxcorr, sum);
246
#endif
247
   }
248
#ifdef FIXED_POINT
249
   return maxcorr;
250
#endif
251
252
#else /* Unrolled version of the pitch correlation -- runs faster on x86 and ARM */
253
0
   int i;
254
   /*The EDSP version requires that max_pitch is at least 1, and that _x is
255
      32-bit aligned.
256
     Since it's hard to put asserts in assembly, put them here.*/
257
#ifdef FIXED_POINT
258
   opus_val32 maxcorr=1;
259
#endif
260
0
   celt_assert(max_pitch>0);
261
0
   celt_sig_assert(((size_t)_x&3)==0);
262
0
   for (i=0;i<max_pitch-3;i+=4)
263
0
   {
264
0
      opus_val32 sum[4]={0,0,0,0};
265
#if defined(OPUS_CHECK_ASM) && defined(FIXED_POINT)
266
      {
267
         opus_val32 sum_c[4]={0,0,0,0};
268
         xcorr_kernel_c(_x, _y+i, sum_c, len);
269
#endif
270
0
         xcorr_kernel(_x, _y+i, sum, len, arch);
271
#if defined(OPUS_CHECK_ASM) && defined(FIXED_POINT)
272
         celt_assert(memcmp(sum, sum_c, sizeof(sum)) == 0);
273
      }
274
#endif
275
0
      xcorr[i]=sum[0];
276
0
      xcorr[i+1]=sum[1];
277
0
      xcorr[i+2]=sum[2];
278
0
      xcorr[i+3]=sum[3];
279
#ifdef FIXED_POINT
280
      sum[0] = MAX32(sum[0], sum[1]);
281
      sum[2] = MAX32(sum[2], sum[3]);
282
      sum[0] = MAX32(sum[0], sum[2]);
283
      maxcorr = MAX32(maxcorr, sum[0]);
284
#endif
285
0
   }
286
   /* In case max_pitch isn't a multiple of 4, do non-unrolled version. */
287
0
   for (;i<max_pitch;i++)
288
0
   {
289
0
      opus_val32 sum;
290
0
      sum = celt_inner_prod(_x, _y+i, len, arch);
291
0
      xcorr[i] = sum;
292
#ifdef FIXED_POINT
293
      maxcorr = MAX32(maxcorr, sum);
294
#endif
295
0
   }
296
#ifdef FIXED_POINT
297
   return maxcorr;
298
#endif
299
0
#endif
300
0
}
301
302
void pitch_search(const opus_val16 * OPUS_RESTRICT x_lp, opus_val16 * OPUS_RESTRICT y,
303
                  int len, int max_pitch, int *pitch, int arch)
304
18.4k
{
305
18.4k
   int i, j;
306
18.4k
   int lag;
307
18.4k
   int best_pitch[2]={0,0};
308
18.4k
   VARDECL(opus_val16, x_lp4);
309
18.4k
   VARDECL(opus_val16, y_lp4);
310
18.4k
   VARDECL(opus_val32, xcorr);
311
#ifdef FIXED_POINT
312
   opus_val32 maxcorr;
313
   opus_val32 xmax, ymax;
314
   int shift=0;
315
#endif
316
18.4k
   int offset;
317
318
18.4k
   SAVE_STACK;
319
320
18.4k
   celt_assert(len>0);
321
18.4k
   celt_assert(max_pitch>0);
322
18.4k
   lag = len+max_pitch;
323
324
18.4k
   ALLOC(x_lp4, len>>2, opus_val16);
325
18.4k
   ALLOC(y_lp4, lag>>2, opus_val16);
326
18.4k
   ALLOC(xcorr, max_pitch>>1, opus_val32);
327
328
   /* Downsample by 2 again */
329
6.15M
   for (j=0;j<len>>2;j++)
330
6.13M
      x_lp4[j] = x_lp[2*j];
331
9.01M
   for (j=0;j<lag>>2;j++)
332
9.00M
      y_lp4[j] = y[2*j];
333
334
#ifdef FIXED_POINT
335
   xmax = celt_maxabs16(x_lp4, len>>2);
336
   ymax = celt_maxabs16(y_lp4, lag>>2);
337
   shift = celt_ilog2(MAX32(1, MAX32(xmax, ymax)))-11;
338
   if (shift>0)
339
   {
340
      for (j=0;j<len>>2;j++)
341
         x_lp4[j] = SHR16(x_lp4[j], shift);
342
      for (j=0;j<lag>>2;j++)
343
         y_lp4[j] = SHR16(y_lp4[j], shift);
344
      /* Use double the shift for a MAC */
345
      shift *= 2;
346
   } else {
347
      shift = 0;
348
   }
349
#endif
350
351
   /* Coarse search with 4x decimation */
352
353
#ifdef FIXED_POINT
354
   maxcorr =
355
#endif
356
18.4k
   celt_pitch_xcorr(x_lp4, y_lp4, xcorr, len>>2, max_pitch>>2, arch);
357
358
18.4k
   find_best_pitch(xcorr, y_lp4, len>>2, max_pitch>>2, best_pitch
359
#ifdef FIXED_POINT
360
                   , 0, maxcorr
361
#endif
362
18.4k
                   );
363
364
   /* Finer search with 2x decimation */
365
#ifdef FIXED_POINT
366
   maxcorr=1;
367
#endif
368
5.74M
   for (i=0;i<max_pitch>>1;i++)
369
5.72M
   {
370
5.72M
      opus_val32 sum;
371
5.72M
      xcorr[i] = 0;
372
5.72M
      if (abs(i-2*best_pitch[0])>2 && abs(i-2*best_pitch[1])>2)
373
5.57M
         continue;
374
#ifdef FIXED_POINT
375
      sum = 0;
376
      for (j=0;j<len>>1;j++)
377
         sum += SHR32(MULT16_16(x_lp[j],y[i+j]), shift);
378
#else
379
151k
      sum = celt_inner_prod(x_lp, y+i, len>>1, arch);
380
151k
#endif
381
151k
      xcorr[i] = MAX32(-1, sum);
382
#ifdef FIXED_POINT
383
      maxcorr = MAX32(maxcorr, sum);
384
#endif
385
151k
   }
386
18.4k
   find_best_pitch(xcorr, y, len>>1, max_pitch>>1, best_pitch
387
#ifdef FIXED_POINT
388
                   , shift+1, maxcorr
389
#endif
390
18.4k
                   );
391
392
   /* Refine by pseudo-interpolation */
393
18.4k
   if (best_pitch[0]>0 && best_pitch[0]<(max_pitch>>1)-1)
394
17.0k
   {
395
17.0k
      opus_val32 a, b, c;
396
17.0k
      a = xcorr[best_pitch[0]-1];
397
17.0k
      b = xcorr[best_pitch[0]];
398
17.0k
      c = xcorr[best_pitch[0]+1];
399
17.0k
      if ((c-a) > MULT16_32_Q15(QCONST16(.7f,15),b-a))
400
2.26k
         offset = 1;
401
14.7k
      else if ((a-c) > MULT16_32_Q15(QCONST16(.7f,15),b-c))
402
6.45k
         offset = -1;
403
8.29k
      else
404
8.29k
         offset = 0;
405
17.0k
   } else {
406
1.46k
      offset = 0;
407
1.46k
   }
408
18.4k
   *pitch = 2*best_pitch[0]-offset;
409
410
18.4k
   RESTORE_STACK;
411
18.4k
}
412
413
#ifdef FIXED_POINT
414
static opus_val16 compute_pitch_gain(opus_val32 xy, opus_val32 xx, opus_val32 yy)
415
{
416
   opus_val32 x2y2;
417
   int sx, sy, shift;
418
   opus_val32 g;
419
   opus_val16 den;
420
   if (xy == 0 || xx == 0 || yy == 0)
421
      return 0;
422
   sx = celt_ilog2(xx)-14;
423
   sy = celt_ilog2(yy)-14;
424
   shift = sx + sy;
425
   x2y2 = SHR32(MULT16_16(VSHR32(xx, sx), VSHR32(yy, sy)), 14);
426
   if (shift & 1) {
427
      if (x2y2 < 32768)
428
      {
429
         x2y2 <<= 1;
430
         shift--;
431
      } else {
432
         x2y2 >>= 1;
433
         shift++;
434
      }
435
   }
436
   den = celt_rsqrt_norm(x2y2);
437
   g = MULT16_32_Q15(den, xy);
438
   g = VSHR32(g, (shift>>1)-1);
439
   return EXTRACT16(MAX32(-Q15ONE, MIN32(g, Q15ONE)));
440
}
441
#else
442
static opus_val16 compute_pitch_gain(opus_val32 xy, opus_val32 xx, opus_val32 yy)
443
0
{
444
0
   return xy/celt_sqrt(1+xx*yy);
445
0
}
446
#endif
447
448
static const int second_check[16] = {0, 0, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 3, 2};
449
opus_val16 remove_doubling(opus_val16 *x, int maxperiod, int minperiod,
450
      int N, int *T0_, int prev_period, opus_val16 prev_gain, int arch)
451
0
{
452
0
   int k, i, T, T0;
453
0
   opus_val16 g, g0;
454
0
   opus_val16 pg;
455
0
   opus_val32 xy,xx,yy,xy2;
456
0
   opus_val32 xcorr[3];
457
0
   opus_val32 best_xy, best_yy;
458
0
   int offset;
459
0
   int minperiod0;
460
0
   VARDECL(opus_val32, yy_lookup);
461
0
   SAVE_STACK;
462
463
0
   minperiod0 = minperiod;
464
0
   maxperiod /= 2;
465
0
   minperiod /= 2;
466
0
   *T0_ /= 2;
467
0
   prev_period /= 2;
468
0
   N /= 2;
469
0
   x += maxperiod;
470
0
   if (*T0_>=maxperiod)
471
0
      *T0_=maxperiod-1;
472
473
0
   T = T0 = *T0_;
474
0
   ALLOC(yy_lookup, maxperiod+1, opus_val32);
475
0
   dual_inner_prod(x, x, x-T0, N, &xx, &xy, arch);
476
0
   yy_lookup[0] = xx;
477
0
   yy=xx;
478
0
   for (i=1;i<=maxperiod;i++)
479
0
   {
480
0
      yy = yy+MULT16_16(x[-i],x[-i])-MULT16_16(x[N-i],x[N-i]);
481
0
      yy_lookup[i] = MAX32(0, yy);
482
0
   }
483
0
   yy = yy_lookup[T0];
484
0
   best_xy = xy;
485
0
   best_yy = yy;
486
0
   g = g0 = compute_pitch_gain(xy, xx, yy);
487
   /* Look for any pitch at T/k */
488
0
   for (k=2;k<=15;k++)
489
0
   {
490
0
      int T1, T1b;
491
0
      opus_val16 g1;
492
0
      opus_val16 cont=0;
493
0
      opus_val16 thresh;
494
0
      T1 = celt_udiv(2*T0+k, 2*k);
495
0
      if (T1 < minperiod)
496
0
         break;
497
      /* Look for another strong correlation at T1b */
498
0
      if (k==2)
499
0
      {
500
0
         if (T1+T0>maxperiod)
501
0
            T1b = T0;
502
0
         else
503
0
            T1b = T0+T1;
504
0
      } else
505
0
      {
506
0
         T1b = celt_udiv(2*second_check[k]*T0+k, 2*k);
507
0
      }
508
0
      dual_inner_prod(x, &x[-T1], &x[-T1b], N, &xy, &xy2, arch);
509
0
      xy = HALF32(xy + xy2);
510
0
      yy = HALF32(yy_lookup[T1] + yy_lookup[T1b]);
511
0
      g1 = compute_pitch_gain(xy, xx, yy);
512
0
      if (abs(T1-prev_period)<=1)
513
0
         cont = prev_gain;
514
0
      else if (abs(T1-prev_period)<=2 && 5*k*k < T0)
515
0
         cont = HALF16(prev_gain);
516
0
      else
517
0
         cont = 0;
518
0
      thresh = MAX16(QCONST16(.3f,15), MULT16_16_Q15(QCONST16(.7f,15),g0)-cont);
519
      /* Bias against very high pitch (very short period) to avoid false-positives
520
         due to short-term correlation */
521
0
      if (T1<3*minperiod)
522
0
         thresh = MAX16(QCONST16(.4f,15), MULT16_16_Q15(QCONST16(.85f,15),g0)-cont);
523
0
      else if (T1<2*minperiod)
524
0
         thresh = MAX16(QCONST16(.5f,15), MULT16_16_Q15(QCONST16(.9f,15),g0)-cont);
525
0
      if (g1 > thresh)
526
0
      {
527
0
         best_xy = xy;
528
0
         best_yy = yy;
529
0
         T = T1;
530
0
         g = g1;
531
0
      }
532
0
   }
533
0
   best_xy = MAX32(0, best_xy);
534
0
   if (best_yy <= best_xy)
535
0
      pg = Q15ONE;
536
0
   else
537
0
      pg = SHR32(frac_div32(best_xy,best_yy+1),16);
538
539
0
   for (k=0;k<3;k++)
540
0
      xcorr[k] = celt_inner_prod(x, x-(T+k-1), N, arch);
541
0
   if ((xcorr[2]-xcorr[0]) > MULT16_32_Q15(QCONST16(.7f,15),xcorr[1]-xcorr[0]))
542
0
      offset = 1;
543
0
   else if ((xcorr[0]-xcorr[2]) > MULT16_32_Q15(QCONST16(.7f,15),xcorr[1]-xcorr[2]))
544
0
      offset = -1;
545
0
   else
546
0
      offset = 0;
547
0
   if (pg > g)
548
0
      pg = g;
549
0
   *T0_ = 2*T+offset;
550
551
0
   if (*T0_<minperiod0)
552
0
      *T0_=minperiod0;
553
0
   RESTORE_STACK;
554
0
   return pg;
555
0
}