Coverage Report

Created: 2026-08-31 06:46

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/aac/libFDK/src/dct.cpp
Line
Count
Source
1
/* -----------------------------------------------------------------------------
2
Software License for The Fraunhofer FDK AAC Codec Library for Android
3
4
© Copyright  1995 - 2020 Fraunhofer-Gesellschaft zur Förderung der angewandten
5
Forschung e.V. All rights reserved.
6
7
 1.    INTRODUCTION
8
The Fraunhofer FDK AAC Codec Library for Android ("FDK AAC Codec") is software
9
that implements the MPEG Advanced Audio Coding ("AAC") encoding and decoding
10
scheme for digital audio. This FDK AAC Codec software is intended to be used on
11
a wide variety of Android devices.
12
13
AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient
14
general perceptual audio codecs. AAC-ELD is considered the best-performing
15
full-bandwidth communications codec by independent studies and is widely
16
deployed. AAC has been standardized by ISO and IEC as part of the MPEG
17
specifications.
18
19
Patent licenses for necessary patent claims for the FDK AAC Codec (including
20
those of Fraunhofer) may be obtained through Via Licensing
21
(www.vialicensing.com) or through the respective patent owners individually for
22
the purpose of encoding or decoding bit streams in products that are compliant
23
with the ISO/IEC MPEG audio standards. Please note that most manufacturers of
24
Android devices already license these patent claims through Via Licensing or
25
directly from the patent owners, and therefore FDK AAC Codec software may
26
already be covered under those patent licenses when it is used for those
27
licensed purposes only.
28
29
Commercially-licensed AAC software libraries, including floating-point versions
30
with enhanced sound quality, are also available from Fraunhofer. Users are
31
encouraged to check the Fraunhofer website for additional applications
32
information and documentation.
33
34
2.    COPYRIGHT LICENSE
35
36
Redistribution and use in source and binary forms, with or without modification,
37
are permitted without payment of copyright license fees provided that you
38
satisfy the following conditions:
39
40
You must retain the complete text of this software license in redistributions of
41
the FDK AAC Codec or your modifications thereto in source code form.
42
43
You must retain the complete text of this software license in the documentation
44
and/or other materials provided with redistributions of the FDK AAC Codec or
45
your modifications thereto in binary form. You must make available free of
46
charge copies of the complete source code of the FDK AAC Codec and your
47
modifications thereto to recipients of copies in binary form.
48
49
The name of Fraunhofer may not be used to endorse or promote products derived
50
from this library without prior written permission.
51
52
You may not charge copyright license fees for anyone to use, copy or distribute
53
the FDK AAC Codec software or your modifications thereto.
54
55
Your modified versions of the FDK AAC Codec must carry prominent notices stating
56
that you changed the software and the date of any change. For modified versions
57
of the FDK AAC Codec, the term "Fraunhofer FDK AAC Codec Library for Android"
58
must be replaced by the term "Third-Party Modified Version of the Fraunhofer FDK
59
AAC Codec Library for Android."
60
61
3.    NO PATENT LICENSE
62
63
NO EXPRESS OR IMPLIED LICENSES TO ANY PATENT CLAIMS, including without
64
limitation the patents of Fraunhofer, ARE GRANTED BY THIS SOFTWARE LICENSE.
65
Fraunhofer provides no warranty of patent non-infringement with respect to this
66
software.
67
68
You may use this FDK AAC Codec software or modifications thereto only for
69
purposes that are authorized by appropriate patent licenses.
70
71
4.    DISCLAIMER
72
73
This FDK AAC Codec software is provided by Fraunhofer on behalf of the copyright
74
holders and contributors "AS IS" and WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES,
75
including but not limited to the implied warranties of merchantability and
76
fitness for a particular purpose. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
77
CONTRIBUTORS BE LIABLE for any direct, indirect, incidental, special, exemplary,
78
or consequential damages, including but not limited to procurement of substitute
79
goods or services; loss of use, data, or profits, or business interruption,
80
however caused and on any theory of liability, whether in contract, strict
81
liability, or tort (including negligence), arising in any way out of the use of
82
this software, even if advised of the possibility of such damage.
83
84
5.    CONTACT INFORMATION
85
86
Fraunhofer Institute for Integrated Circuits IIS
87
Attention: Audio and Multimedia Departments - FDK AAC LL
88
Am Wolfsmantel 33
89
91058 Erlangen, Germany
90
91
www.iis.fraunhofer.de/amm
92
amm-info@iis.fraunhofer.de
93
----------------------------------------------------------------------------- */
94
95
/******************* Library for basic calculation routines ********************
96
97
   Author(s):
98
99
   Description:
100
101
*******************************************************************************/
102
103
/*!
104
  \file   dct.cpp
105
  \brief  DCT Implementations
106
  Library functions to calculate standard DCTs. This will most likely be
107
  replaced by hand-optimized functions for the specific target processor.
108
109
  Three different implementations of the dct type II and the dct type III
110
  transforms are provided.
111
112
  By default implementations which are based on a single, standard complex
113
  FFT-kernel are used (dctII_f() and dctIII_f()). These are specifically helpful
114
  in cases where optimized FFT libraries are already available. The FFT used in
115
  these implementation is FFT rad2 from FDK_tools.
116
117
  Of course, one might also use DCT-libraries should they be available. The DCT
118
  and DST type IV implementations are only available in a version based on a
119
  complex FFT kernel.
120
*/
121
122
#include "dct.h"
123
124
#include "FDK_tools_rom.h"
125
#include "fft.h"
126
127
void dct_getTables(const FIXP_WTP **ptwiddle, const FIXP_STP **sin_twiddle,
128
71.1M
                   int *sin_step, int length) {
129
71.1M
  const FIXP_WTP *twiddle;
130
71.1M
  int ld2_length;
131
132
  /* Get ld2 of length - 2 + 1
133
      -2: because first table entry is window of size 4
134
      +1: because we already include +1 because of ceil(log2(length)) */
135
71.1M
  ld2_length = DFRACT_BITS - 1 - fNormz((FIXP_DBL)length) - 1;
136
137
  /* Extract sort of "eigenvalue" (the 4 left most bits) of length. */
138
71.1M
  switch ((length) >> (ld2_length - 1)) {
139
55.0M
    case 0x4: /* radix 2 */
140
55.0M
      *sin_twiddle = SineTable1024;
141
55.0M
      *sin_step = 1 << (10 - ld2_length);
142
55.0M
      twiddle = windowSlopes[0][0][ld2_length - 1];
143
55.0M
      break;
144
364k
    case 0x7: /* 10 ms */
145
364k
      *sin_twiddle = SineTable480;
146
364k
      *sin_step = 1 << (8 - ld2_length);
147
364k
      twiddle = windowSlopes[0][1][ld2_length];
148
364k
      break;
149
15.4M
    case 0x6: /* 3/4 of radix 2 */
150
15.4M
      *sin_twiddle = SineTable384;
151
15.4M
      *sin_step = 1 << (8 - ld2_length);
152
15.4M
      twiddle = windowSlopes[0][2][ld2_length];
153
15.4M
      break;
154
234k
    case 0x5: /* 5/16 of radix 2*/
155
234k
      *sin_twiddle = SineTable80;
156
234k
      *sin_step = 1 << (6 - ld2_length);
157
234k
      twiddle = windowSlopes[0][3][ld2_length];
158
234k
      break;
159
0
    default:
160
0
      *sin_twiddle = NULL;
161
0
      *sin_step = 0;
162
0
      twiddle = NULL;
163
0
      break;
164
71.1M
  }
165
166
71.1M
  if (ptwiddle != NULL) {
167
63.7M
    FDK_ASSERT(twiddle != NULL);
168
63.7M
    *ptwiddle = twiddle;
169
63.7M
  }
170
171
71.1M
  FDK_ASSERT(*sin_step > 0);
172
71.1M
}
173
174
#if !defined(FUNCTION_dct_III)
175
void dct_III(FIXP_DBL *pDat, /*!< pointer to input/output */
176
             FIXP_DBL *tmp,  /*!< pointer to temporal working buffer */
177
             int L,          /*!< lenght of transform */
178
1.00M
             int *pDat_e) {
179
1.00M
  const FIXP_WTP *sin_twiddle;
180
1.00M
  int i;
181
1.00M
  FIXP_DBL xr, accu1, accu2;
182
1.00M
  int inc, index;
183
1.00M
  int M = L >> 1;
184
185
1.00M
  FDK_ASSERT(L % 4 == 0);
186
1.00M
  dct_getTables(NULL, &sin_twiddle, &inc, L);
187
1.00M
  inc >>= 1;
188
189
1.00M
  FIXP_DBL *pTmp_0 = &tmp[2];
190
1.00M
  FIXP_DBL *pTmp_1 = &tmp[(M - 1) * 2];
191
192
1.00M
  index = 4 * inc;
193
194
  /* This loop performs multiplication for index i (i*inc) */
195
8.07M
  for (i = 1; i<M>> 1; i++, pTmp_0 += 2, pTmp_1 -= 2) {
196
7.06M
    FIXP_DBL accu3, accu4, accu5, accu6;
197
198
7.06M
    cplxMultDiv2(&accu2, &accu1, pDat[L - i], pDat[i], sin_twiddle[i * inc]);
199
7.06M
    cplxMultDiv2(&accu4, &accu3, pDat[M + i], pDat[M - i],
200
7.06M
                 sin_twiddle[(M - i) * inc]);
201
7.06M
    accu3 >>= 1;
202
7.06M
    accu4 >>= 1;
203
204
    /* This method is better for ARM926, that uses operand2 shifted right by 1
205
     * always */
206
7.06M
    if (2 * i < (M / 2)) {
207
3.02M
      cplxMultDiv2(&accu6, &accu5, (accu3 - (accu1 >> 1)),
208
3.02M
                   ((accu2 >> 1) + accu4), sin_twiddle[index]);
209
4.03M
    } else {
210
4.03M
      cplxMultDiv2(&accu6, &accu5, ((accu2 >> 1) + accu4),
211
4.03M
                   (accu3 - (accu1 >> 1)), sin_twiddle[index]);
212
4.03M
      accu6 = -accu6;
213
4.03M
    }
214
7.06M
    xr = (accu1 >> 1) + accu3;
215
7.06M
    pTmp_0[0] = (xr >> 1) - accu5;
216
7.06M
    pTmp_1[0] = (xr >> 1) + accu5;
217
218
7.06M
    xr = (accu2 >> 1) - accu4;
219
7.06M
    pTmp_0[1] = (xr >> 1) - accu6;
220
7.06M
    pTmp_1[1] = -((xr >> 1) + accu6);
221
222
    /* Create index helper variables for (4*i)*inc indexed equivalent values of
223
     * short tables. */
224
7.06M
    if (2 * i < ((M / 2) - 1)) {
225
3.02M
      index += 4 * inc;
226
4.03M
    } else if (2 * i >= ((M / 2))) {
227
4.03M
      index -= 4 * inc;
228
4.03M
    }
229
7.06M
  }
230
231
1.00M
  xr = fMultDiv2(pDat[M], sin_twiddle[M * inc].v.re); /* cos((PI/(2*L))*M); */
232
1.00M
  tmp[0] = ((pDat[0] >> 1) + xr) >> 1;
233
1.00M
  tmp[1] = ((pDat[0] >> 1) - xr) >> 1;
234
235
1.00M
  cplxMultDiv2(&accu2, &accu1, pDat[L - (M / 2)], pDat[M / 2],
236
1.00M
               sin_twiddle[M * inc / 2]);
237
1.00M
  tmp[M] = accu1 >> 1;
238
1.00M
  tmp[M + 1] = accu2 >> 1;
239
240
  /* dit_fft expects 1 bit scaled input values */
241
1.00M
  fft(M, tmp, pDat_e);
242
243
  /* ARM926: 12 cycles per 2-iteration, no overhead code by compiler */
244
1.00M
  pTmp_1 = &tmp[L];
245
9.07M
  for (i = M >> 1; i--;) {
246
8.07M
    FIXP_DBL tmp1, tmp2, tmp3, tmp4;
247
8.07M
    tmp1 = *tmp++;
248
8.07M
    tmp2 = *tmp++;
249
8.07M
    tmp3 = *--pTmp_1;
250
8.07M
    tmp4 = *--pTmp_1;
251
8.07M
    *pDat++ = tmp1;
252
8.07M
    *pDat++ = tmp3;
253
8.07M
    *pDat++ = tmp2;
254
8.07M
    *pDat++ = tmp4;
255
8.07M
  }
256
257
1.00M
  *pDat_e += 2;
258
1.00M
}
259
260
void dst_III(FIXP_DBL *pDat, /*!< pointer to input/output */
261
             FIXP_DBL *tmp,  /*!< pointer to temporal working buffer */
262
             int L,          /*!< lenght of transform */
263
0
             int *pDat_e) {
264
0
  int L2 = L >> 1;
265
0
  int i;
266
0
  FIXP_DBL t;
267
268
  /* note: DCT III is reused here, direct DST III implementation might be more
269
   * efficient */
270
271
  /* mirror input */
272
0
  for (i = 0; i < L2; i++) {
273
0
    t = pDat[i];
274
0
    pDat[i] = pDat[L - 1 - i];
275
0
    pDat[L - 1 - i] = t;
276
0
  }
277
278
  /* DCT-III */
279
0
  dct_III(pDat, tmp, L, pDat_e);
280
281
  /* flip signs at odd indices */
282
0
  for (i = 1; i < L; i += 2) pDat[i] = -pDat[i];
283
0
}
284
285
#endif
286
287
#if !defined(FUNCTION_dct_II)
288
void dct_II(
289
    FIXP_DBL *pDat, /*!< pointer to input/output */
290
    FIXP_DBL *tmp,  /*!< pointer to temporal working buffer */
291
    int L, /*!< lenght of transform (has to be a multiple of 8 (or 4 in case
292
              DCT_II_L_MULTIPLE_OF_4_SUPPORT is defined) */
293
6.30M
    int *pDat_e) {
294
6.30M
  const FIXP_WTP *sin_twiddle;
295
6.30M
  FIXP_DBL accu1, accu2;
296
6.30M
  FIXP_DBL *pTmp_0, *pTmp_1;
297
298
6.30M
  int i;
299
6.30M
  int inc, index = 0;
300
6.30M
  int M = L >> 1;
301
302
6.30M
  FDK_ASSERT(L % 4 == 0);
303
6.30M
  dct_getTables(NULL, &sin_twiddle, &inc, L);
304
6.30M
  inc >>= 1;
305
306
6.30M
  {
307
72.3M
    for (i = 0; i < M; i++) {
308
66.0M
      tmp[i] = pDat[2 * i] >> 2;
309
66.0M
      tmp[L - 1 - i] = pDat[2 * i + 1] >> 2;
310
66.0M
    }
311
6.30M
  }
312
313
6.30M
  fft(M, tmp, pDat_e);
314
315
6.30M
  pTmp_0 = &tmp[2];
316
6.30M
  pTmp_1 = &tmp[(M - 1) * 2];
317
318
6.30M
  index = inc * 4;
319
320
33.0M
  for (i = 1; i<M>> 1; i++, pTmp_0 += 2, pTmp_1 -= 2) {
321
26.7M
    FIXP_DBL a1, a2;
322
26.7M
    FIXP_DBL accu3, accu4;
323
324
26.7M
    a1 = ((pTmp_0[1] >> 1) + (pTmp_1[1] >> 1));
325
26.7M
    a2 = ((pTmp_1[0] >> 1) - (pTmp_0[0] >> 1));
326
327
26.7M
    if (2 * i < (M / 2)) {
328
11.8M
      cplxMultDiv2(&accu1, &accu2, a2, a1, sin_twiddle[index]);
329
14.8M
    } else {
330
14.8M
      cplxMultDiv2(&accu1, &accu2, a1, a2, sin_twiddle[index]);
331
14.8M
      accu1 = -accu1;
332
14.8M
    }
333
26.7M
    accu1 <<= 1;
334
26.7M
    accu2 <<= 1;
335
336
26.7M
    a1 = ((pTmp_0[0] >> 1) + (pTmp_1[0] >> 1));
337
26.7M
    a2 = ((pTmp_0[1] >> 1) - (pTmp_1[1] >> 1));
338
339
26.7M
    cplxMult(&accu3, &accu4, (accu1 + a2), (a1 + accu2), sin_twiddle[i * inc]);
340
26.7M
    pDat[L - i] = -accu3;
341
26.7M
    pDat[i] = accu4;
342
343
26.7M
    cplxMult(&accu3, &accu4, (accu1 - a2), (a1 - accu2),
344
26.7M
             sin_twiddle[(M - i) * inc]);
345
26.7M
    pDat[M + i] = -accu3;
346
26.7M
    pDat[M - i] = accu4;
347
348
    /* Create index helper variables for (4*i)*inc indexed equivalent values of
349
     * short tables. */
350
26.7M
    if (2 * i < ((M / 2) - 1)) {
351
8.54M
      index += 4 * inc;
352
18.1M
    } else if (2 * i >= ((M / 2))) {
353
14.8M
      index -= 4 * inc;
354
14.8M
    }
355
26.7M
  }
356
357
6.30M
  cplxMult(&accu1, &accu2, tmp[M], tmp[M + 1], sin_twiddle[(M / 2) * inc]);
358
6.30M
  pDat[L - (M / 2)] = accu2;
359
6.30M
  pDat[M / 2] = accu1;
360
361
6.30M
  pDat[0] = tmp[0] + tmp[1];
362
6.30M
  pDat[M] = fMult(tmp[0] - tmp[1],
363
6.30M
                  sin_twiddle[M * inc].v.re); /* cos((PI/(2*L))*M); */
364
365
6.30M
  *pDat_e += 2;
366
6.30M
}
367
#endif
368
369
#if !defined(FUNCTION_dct_IV)
370
371
34.5M
void dct_IV(FIXP_DBL *pDat, int L, int *pDat_e) {
372
34.5M
  int sin_step = 0;
373
34.5M
  int M = L >> 1;
374
375
34.5M
  const FIXP_WTP *twiddle;
376
34.5M
  const FIXP_STP *sin_twiddle;
377
378
34.5M
  FDK_ASSERT(L >= 4);
379
380
34.5M
  FDK_ASSERT(L >= 4);
381
382
34.5M
  dct_getTables(&twiddle, &sin_twiddle, &sin_step, L);
383
384
34.5M
  {
385
34.5M
    FIXP_DBL *RESTRICT pDat_0 = &pDat[0];
386
34.5M
    FIXP_DBL *RESTRICT pDat_1 = &pDat[L - 2];
387
34.5M
    int i;
388
389
    /* 29 cycles on ARM926 */
390
516M
    for (i = 0; i < M - 1; i += 2, pDat_0 += 2, pDat_1 -= 2) {
391
481M
      FIXP_DBL accu1, accu2, accu3, accu4;
392
393
481M
      accu1 = pDat_1[1];
394
481M
      accu2 = pDat_0[0];
395
481M
      accu3 = pDat_0[1];
396
481M
      accu4 = pDat_1[0];
397
398
481M
      cplxMultDiv2(&accu1, &accu2, accu1, accu2, twiddle[i]);
399
481M
      cplxMultDiv2(&accu3, &accu4, accu4, accu3, twiddle[i + 1]);
400
401
481M
      pDat_0[0] = accu2 >> 1;
402
481M
      pDat_0[1] = accu1 >> 1;
403
481M
      pDat_1[0] = accu4 >> 1;
404
481M
      pDat_1[1] = -(accu3 >> 1);
405
481M
    }
406
34.5M
    if (M & 1) {
407
0
      FIXP_DBL accu1, accu2;
408
409
0
      accu1 = pDat_1[1];
410
0
      accu2 = pDat_0[0];
411
412
0
      cplxMultDiv2(&accu1, &accu2, accu1, accu2, twiddle[i]);
413
414
0
      pDat_0[0] = accu2 >> 1;
415
0
      pDat_0[1] = accu1 >> 1;
416
0
    }
417
34.5M
  }
418
419
34.5M
  fft(M, pDat, pDat_e);
420
421
34.5M
  {
422
34.5M
    FIXP_DBL *RESTRICT pDat_0 = &pDat[0];
423
34.5M
    FIXP_DBL *RESTRICT pDat_1 = &pDat[L - 2];
424
34.5M
    FIXP_DBL accu1, accu2, accu3, accu4;
425
34.5M
    int idx, i;
426
427
    /* Sin and Cos values are 0.0f and 1.0f */
428
34.5M
    accu1 = pDat_1[0];
429
34.5M
    accu2 = pDat_1[1];
430
431
34.5M
    pDat_1[1] = -pDat_0[1];
432
433
    /* 28 cycles for ARM926 */
434
481M
    for (idx = sin_step, i = 1; i<(M + 1)>> 1; i++, idx += sin_step) {
435
446M
      FIXP_STP twd = sin_twiddle[idx];
436
446M
      cplxMult(&accu3, &accu4, accu1, accu2, twd);
437
446M
      pDat_0[1] = accu3;
438
446M
      pDat_1[0] = accu4;
439
440
446M
      pDat_0 += 2;
441
446M
      pDat_1 -= 2;
442
443
446M
      cplxMult(&accu3, &accu4, pDat_0[1], pDat_0[0], twd);
444
445
446M
      accu1 = pDat_1[0];
446
446M
      accu2 = pDat_1[1];
447
448
446M
      pDat_1[1] = -accu3;
449
446M
      pDat_0[0] = accu4;
450
446M
    }
451
452
34.5M
    if ((M & 1) == 0) {
453
      /* Last Sin and Cos value pair are the same */
454
34.5M
      accu1 = fMult(accu1, WTC(0x5a82799a));
455
34.5M
      accu2 = fMult(accu2, WTC(0x5a82799a));
456
457
34.5M
      pDat_1[0] = accu1 + accu2;
458
34.5M
      pDat_0[1] = accu1 - accu2;
459
34.5M
    }
460
34.5M
  }
461
462
  /* Add twiddeling scale. */
463
34.5M
  *pDat_e += 2;
464
34.5M
}
465
#endif /* defined (FUNCTION_dct_IV) */
466
467
#if !defined(FUNCTION_dst_IV)
468
29.2M
void dst_IV(FIXP_DBL *pDat, int L, int *pDat_e) {
469
29.2M
  int sin_step = 0;
470
29.2M
  int M = L >> 1;
471
472
29.2M
  const FIXP_WTP *twiddle;
473
29.2M
  const FIXP_STP *sin_twiddle;
474
475
29.2M
  FDK_ASSERT(L >= 4);
476
477
29.2M
  FDK_ASSERT(L >= 4);
478
479
29.2M
  dct_getTables(&twiddle, &sin_twiddle, &sin_step, L);
480
481
29.2M
  {
482
29.2M
    FIXP_DBL *RESTRICT pDat_0 = &pDat[0];
483
29.2M
    FIXP_DBL *RESTRICT pDat_1 = &pDat[L - 2];
484
29.2M
    int i;
485
486
    /* 34 cycles on ARM926 */
487
355M
    for (i = 0; i < M - 1; i += 2, pDat_0 += 2, pDat_1 -= 2) {
488
326M
      FIXP_DBL accu1, accu2, accu3, accu4;
489
490
326M
      accu1 = pDat_1[1] >> 1;
491
326M
      accu2 = -(pDat_0[0] >> 1);
492
326M
      accu3 = pDat_0[1] >> 1;
493
326M
      accu4 = -(pDat_1[0] >> 1);
494
495
326M
      cplxMultDiv2(&accu1, &accu2, accu1, accu2, twiddle[i]);
496
326M
      cplxMultDiv2(&accu3, &accu4, accu4, accu3, twiddle[i + 1]);
497
498
326M
      pDat_0[0] = accu2;
499
326M
      pDat_0[1] = accu1;
500
326M
      pDat_1[0] = accu4;
501
326M
      pDat_1[1] = -accu3;
502
326M
    }
503
29.2M
    if (M & 1) {
504
0
      FIXP_DBL accu1, accu2;
505
506
0
      accu1 = pDat_1[1];
507
0
      accu2 = -pDat_0[0];
508
509
0
      cplxMultDiv2(&accu1, &accu2, accu1, accu2, twiddle[i]);
510
511
0
      pDat_0[0] = accu2 >> 1;
512
0
      pDat_0[1] = accu1 >> 1;
513
0
    }
514
29.2M
  }
515
516
29.2M
  fft(M, pDat, pDat_e);
517
518
29.2M
  {
519
29.2M
    FIXP_DBL *RESTRICT pDat_0;
520
29.2M
    FIXP_DBL *RESTRICT pDat_1;
521
29.2M
    FIXP_DBL accu1, accu2, accu3, accu4;
522
29.2M
    int idx, i;
523
524
29.2M
    pDat_0 = &pDat[0];
525
29.2M
    pDat_1 = &pDat[L - 2];
526
527
    /* Sin and Cos values are 0.0f and 1.0f */
528
29.2M
    accu1 = pDat_1[0];
529
29.2M
    accu2 = pDat_1[1];
530
531
29.2M
    pDat_1[1] = -pDat_0[0];
532
29.2M
    pDat_0[0] = pDat_0[1];
533
534
326M
    for (idx = sin_step, i = 1; i<(M + 1)>> 1; i++, idx += sin_step) {
535
297M
      FIXP_STP twd = sin_twiddle[idx];
536
537
297M
      cplxMult(&accu3, &accu4, accu1, accu2, twd);
538
297M
      pDat_1[0] = -accu3;
539
297M
      pDat_0[1] = -accu4;
540
541
297M
      pDat_0 += 2;
542
297M
      pDat_1 -= 2;
543
544
297M
      cplxMult(&accu3, &accu4, pDat_0[1], pDat_0[0], twd);
545
546
297M
      accu1 = pDat_1[0];
547
297M
      accu2 = pDat_1[1];
548
549
297M
      pDat_0[0] = accu3;
550
297M
      pDat_1[1] = -accu4;
551
297M
    }
552
553
29.2M
    if ((M & 1) == 0) {
554
      /* Last Sin and Cos value pair are the same */
555
29.2M
      accu1 = fMult(accu1, WTC(0x5a82799a));
556
29.2M
      accu2 = fMult(accu2, WTC(0x5a82799a));
557
558
29.2M
      pDat_0[1] = -accu1 - accu2;
559
29.2M
      pDat_1[0] = accu2 - accu1;
560
29.2M
    }
561
29.2M
  }
562
563
  /* Add twiddeling scale. */
564
29.2M
  *pDat_e += 2;
565
29.2M
}
566
#endif /* !defined(FUNCTION_dst_IV) */