/src/vlc/contrib/contrib-build/faad2/libfaad/cfft.c

Line	Count	Source
1		/*
2		** FAAD2 - Freeware Advanced Audio (AAC) Decoder including SBR decoding
3		** Copyright (C) 2003-2005 M. Bakker, Nero AG, http://www.nero.com
4		**
5		** This program is free software; you can redistribute it and/or modify
6		** it under the terms of the GNU General Public License as published by
7		** the Free Software Foundation; either version 2 of the License, or
8		** (at your option) any later version.
9		**
10		** This program is distributed in the hope that it will be useful,
11		** but WITHOUT ANY WARRANTY; without even the implied warranty of
12		** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13		** GNU General Public License for more details.
14		**
15		** You should have received a copy of the GNU General Public License
16		** along with this program; if not, write to the Free Software
17		** Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
18		**
19		** Any non-GPL usage of this software or parts of this software is strictly
20		** forbidden.
21		**
22		** The "appropriate copyright message" mentioned in section 2c of the GPLv2
23		** must read: "Code from FAAD2 is copyright (c) Nero AG, www.nero.com"
24		**
25		** Commercial non-GPL licensing of this software is possible.
26		** For more info contact Nero AG through Mpeg4AAClicense@nero.com.
27		**
28		** $Id: cfft.c,v 1.35 2007/11/01 12:33:29 menno Exp $
29		**/
30
31		/*
32		* Algorithmically based on Fortran-77 FFTPACK
33		* by Paul N. Swarztrauber(Version 4, 1985).
34		*
35		* Does even sized fft only
36		*/
37
38		/* isign is +1 for backward and -1 for forward transforms */
39
40		#include "common.h"
41		#include "structs.h"
42
43		#include <stdlib.h>
44
45		#include "cfft.h"
46		#include "cfft_tab.h"
47
48
49		/* static function declarations */
50		static void passf2pos(const uint16_t ido, const uint16_t l1, const complex_t *cc,
51		complex_t ch, const complex_t wa);
52		static void passf2neg(const uint16_t ido, const uint16_t l1, const complex_t *cc,
53		complex_t ch, const complex_t wa);
54		static void passf3(const uint16_t ido, const uint16_t l1, const complex_t *cc,
55		complex_t ch, const complex_t wa1, const complex_t *wa2, const int8_t isign);
56		static void passf4pos(const uint16_t ido, const uint16_t l1, const complex_t cc, complex_t ch,
57		const complex_t wa1, const complex_t wa2, const complex_t *wa3);
58		static void passf4neg(const uint16_t ido, const uint16_t l1, const complex_t cc, complex_t ch,
59		const complex_t wa1, const complex_t wa2, const complex_t *wa3);
60		static void passf5(const uint16_t ido, const uint16_t l1, const complex_t cc, complex_t ch,
61		const complex_t wa1, const complex_t wa2, const complex_t *wa3,
62		const complex_t *wa4, const int8_t isign);
63		static void cffti1(uint16_t n, complex_t wa, uint16_t ifac);
64
65
66		/*----------------------------------------------------------------------
67		passf2, passf3, passf4, passf5. Complex FFT passes fwd and bwd.
68		----------------------------------------------------------------------*/
69
70		static void passf2pos(const uint16_t ido, const uint16_t l1, const complex_t *cc,
71		complex_t ch, const complex_t wa)
72	868k	{
73	868k	uint16_t i, k, ah, ac;
74
75	868k	if (ido == 1)
76	0	{
77	0	#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
78		// TODO: remove this code once fuzzer proves it is totally unreahable
79		// For supported frame lengths that have odd number of factor 2 it is
80		// never the last factor; consequently `ido` should never be 1.
81	0	__builtin_trap();
82		/*
83		#endif
84		for (k = 0; k < l1; k++)
85		{
86		ah = 2*k;
87		ac = 4*k;
88
89		RE(ch[ah]) = RE(cc[ac]) + RE(cc[ac+1]);
90		RE(ch[ah+l1]) = RE(cc[ac]) - RE(cc[ac+1]);
91		IM(ch[ah]) = IM(cc[ac]) + IM(cc[ac+1]);
92		IM(ch[ah+l1]) = IM(cc[ac]) - IM(cc[ac+1]);
93		}
94		#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
95		*/
96	0	#endif
97	868k	} else {
98	1.73M	for (k = 0; k < l1; k++)
99	868k	{
100	868k	ah = k*ido;
101	868k	ac = 2kido;
102
103	222M	for (i = 0; i < ido; i++)
104	221M	{
105	221M	complex_t t2;
106
107	221M	RE(ch[ah+i]) = RE(cc[ac+i]) + RE(cc[ac+i+ido]);
108	221M	RE(t2) = RE(cc[ac+i]) - RE(cc[ac+i+ido]);
109
110	221M	IM(ch[ah+i]) = IM(cc[ac+i]) + IM(cc[ac+i+ido]);
111	221M	IM(t2) = IM(cc[ac+i]) - IM(cc[ac+i+ido]);
112
113	221M	#if 1
114	221M	ComplexMult(&IM(ch[ah+i+l1ido]), &RE(ch[ah+i+l1ido]),
115	221M	IM(t2), RE(t2), RE(wa[i]), IM(wa[i]));
116		#else
117		ComplexMult(&RE(ch[ah+i+l1ido]), &IM(ch[ah+i+l1ido]),
118		RE(t2), IM(t2), RE(wa[i]), IM(wa[i]));
119		#endif
120	221M	}
121	868k	}
122	868k	}
123	868k	}
124
125		static void passf2neg(const uint16_t ido, const uint16_t l1, const complex_t *cc,
126		complex_t ch, const complex_t wa)
127	481	{
128	481	uint16_t i, k, ah, ac;
129
130	481	if (ido == 1)
131	0	{
132	0	#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
133		// TODO: remove this code once fuzzer proves it is totally unreahable
134		// For supported frame lengths that have odd number of factor 2 it is
135		// never the last factor; consequently `ido` should never be 1.
136	0	__builtin_trap();
137		/*
138		#endif
139		for (k = 0; k < l1; k++)
140		{
141		ah = 2*k;
142		ac = 4*k;
143
144		RE(ch[ah]) = RE(cc[ac]) + RE(cc[ac+1]);
145		RE(ch[ah+l1]) = RE(cc[ac]) - RE(cc[ac+1]);
146		IM(ch[ah]) = IM(cc[ac]) + IM(cc[ac+1]);
147		IM(ch[ah+l1]) = IM(cc[ac]) - IM(cc[ac+1]);
148		}
149		#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
150		*/
151	0	#endif
152	481	} else {
153	962	for (k = 0; k < l1; k++)
154	481	{
155	481	ah = k*ido;
156	481	ac = 2kido;
157
158	123k	for (i = 0; i < ido; i++)
159	123k	{
160	123k	complex_t t2;
161
162	123k	RE(ch[ah+i]) = RE(cc[ac+i]) + RE(cc[ac+i+ido]);
163	123k	RE(t2) = RE(cc[ac+i]) - RE(cc[ac+i+ido]);
164
165	123k	IM(ch[ah+i]) = IM(cc[ac+i]) + IM(cc[ac+i+ido]);
166	123k	IM(t2) = IM(cc[ac+i]) - IM(cc[ac+i+ido]);
167
168	123k	#if 1
169	123k	ComplexMult(&RE(ch[ah+i+l1ido]), &IM(ch[ah+i+l1ido]),
170	123k	RE(t2), IM(t2), RE(wa[i]), IM(wa[i]));
171		#else
172		ComplexMult(&IM(ch[ah+i+l1ido]), &RE(ch[ah+i+l1ido]),
173		IM(t2), RE(t2), RE(wa[i]), IM(wa[i]));
174		#endif
175	123k	}
176	481	}
177	481	}
178	481	}
179
180
181		static void passf3(const uint16_t ido, const uint16_t l1, const complex_t *cc,
182		complex_t ch, const complex_t wa1, const complex_t *wa2,
183		const int8_t isign)
184	59.6k	{
185	59.6k	static real_t taur = FRAC_CONST(-0.5);
186	59.6k	static real_t taui = FRAC_CONST(0.866025403784439);
187	59.6k	uint16_t i, k, ac, ah;
188	59.6k	complex_t c2, c3, d2, d3, t2;
189
190	59.6k	if (ido == 1)
191	0	{
192	0	#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
193		// TODO: remove this code once fuzzer proves it is totally unreahable
194		// 3 is never the the biggest factor for supported frame lengths;
195		// consequently `ido` should never be 1.
196	0	__builtin_trap();
197		/*
198		#endif
199		if (isign == 1)
200		{
201		for (k = 0; k < l1; k++)
202		{
203		ac = 3*k+1;
204		ah = k;
205
206		RE(t2) = RE(cc[ac]) + RE(cc[ac+1]);
207		IM(t2) = IM(cc[ac]) + IM(cc[ac+1]);
208		RE(c2) = RE(cc[ac-1]) + MUL_F(RE(t2),taur);
209		IM(c2) = IM(cc[ac-1]) + MUL_F(IM(t2),taur);
210
211		RE(ch[ah]) = RE(cc[ac-1]) + RE(t2);
212		IM(ch[ah]) = IM(cc[ac-1]) + IM(t2);
213
214		RE(c3) = MUL_F((RE(cc[ac]) - RE(cc[ac+1])), taui);
215		IM(c3) = MUL_F((IM(cc[ac]) - IM(cc[ac+1])), taui);
216
217		RE(ch[ah+l1]) = RE(c2) - IM(c3);
218		IM(ch[ah+l1]) = IM(c2) + RE(c3);
219		RE(ch[ah+2*l1]) = RE(c2) + IM(c3);
220		IM(ch[ah+2*l1]) = IM(c2) - RE(c3);
221		}
222		} else {
223		for (k = 0; k < l1; k++)
224		{
225		ac = 3*k+1;
226		ah = k;
227
228		RE(t2) = RE(cc[ac]) + RE(cc[ac+1]);
229		IM(t2) = IM(cc[ac]) + IM(cc[ac+1]);
230		RE(c2) = RE(cc[ac-1]) + MUL_F(RE(t2),taur);
231		IM(c2) = IM(cc[ac-1]) + MUL_F(IM(t2),taur);
232
233		RE(ch[ah]) = RE(cc[ac-1]) + RE(t2);
234		IM(ch[ah]) = IM(cc[ac-1]) + IM(t2);
235
236		RE(c3) = MUL_F((RE(cc[ac]) - RE(cc[ac+1])), taui);
237		IM(c3) = MUL_F((IM(cc[ac]) - IM(cc[ac+1])), taui);
238
239		RE(ch[ah+l1]) = RE(c2) + IM(c3);
240		IM(ch[ah+l1]) = IM(c2) - RE(c3);
241		RE(ch[ah+2*l1]) = RE(c2) - IM(c3);
242		IM(ch[ah+2*l1]) = IM(c2) + RE(c3);
243		}
244		}
245		#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
246		*/
247	0	#endif
248	59.6k	} else {
249	59.6k	if (isign == 1)
250	59.6k	{
251	178k	for (k = 0; k < l1; k++)
252	119k	{
253	9.65M	for (i = 0; i < ido; i++)
254	9.53M	{
255	9.53M	ac = i + (3k+1)ido;
256	9.53M	ah = i + k * ido;
257
258	9.53M	RE(t2) = RE(cc[ac]) + RE(cc[ac+ido]);
259	9.53M	RE(c2) = RE(cc[ac-ido]) + MUL_F(RE(t2),taur);
260	9.53M	IM(t2) = IM(cc[ac]) + IM(cc[ac+ido]);
261	9.53M	IM(c2) = IM(cc[ac-ido]) + MUL_F(IM(t2),taur);
262
263	9.53M	RE(ch[ah]) = RE(cc[ac-ido]) + RE(t2);
264	9.53M	IM(ch[ah]) = IM(cc[ac-ido]) + IM(t2);
265
266	9.53M	RE(c3) = MUL_F((RE(cc[ac]) - RE(cc[ac+ido])), taui);
267	9.53M	IM(c3) = MUL_F((IM(cc[ac]) - IM(cc[ac+ido])), taui);
268
269	9.53M	RE(d2) = RE(c2) - IM(c3);
270	9.53M	IM(d3) = IM(c2) - RE(c3);
271	9.53M	RE(d3) = RE(c2) + IM(c3);
272	9.53M	IM(d2) = IM(c2) + RE(c3);
273
274	9.53M	#if 1
275	9.53M	ComplexMult(&IM(ch[ah+l1ido]), &RE(ch[ah+l1ido]),
276	9.53M	IM(d2), RE(d2), RE(wa1[i]), IM(wa1[i]));
277	9.53M	ComplexMult(&IM(ch[ah+2l1ido]), &RE(ch[ah+2l1ido]),
278	9.53M	IM(d3), RE(d3), RE(wa2[i]), IM(wa2[i]));
279		#else
280		ComplexMult(&RE(ch[ah+l1ido]), &IM(ch[ah+l1ido]),
281		RE(d2), IM(d2), RE(wa1[i]), IM(wa1[i]));
282		ComplexMult(&RE(ch[ah+2l1ido]), &IM(ch[ah+2l1ido]),
283		RE(d3), IM(d3), RE(wa2[i]), IM(wa2[i]));
284		#endif
285	9.53M	}
286	119k	}
287	59.6k	} else {
288	3	for (k = 0; k < l1; k++)
289	2	{
290	162	for (i = 0; i < ido; i++)
291	160	{
292	160	ac = i + (3k+1)ido;
293	160	ah = i + k * ido;
294
295	160	RE(t2) = RE(cc[ac]) + RE(cc[ac+ido]);
296	160	RE(c2) = RE(cc[ac-ido]) + MUL_F(RE(t2),taur);
297	160	IM(t2) = IM(cc[ac]) + IM(cc[ac+ido]);
298	160	IM(c2) = IM(cc[ac-ido]) + MUL_F(IM(t2),taur);
299
300	160	RE(ch[ah]) = RE(cc[ac-ido]) + RE(t2);
301	160	IM(ch[ah]) = IM(cc[ac-ido]) + IM(t2);
302
303	160	RE(c3) = MUL_F((RE(cc[ac]) - RE(cc[ac+ido])), taui);
304	160	IM(c3) = MUL_F((IM(cc[ac]) - IM(cc[ac+ido])), taui);
305
306	160	RE(d2) = RE(c2) + IM(c3);
307	160	IM(d3) = IM(c2) + RE(c3);
308	160	RE(d3) = RE(c2) - IM(c3);
309	160	IM(d2) = IM(c2) - RE(c3);
310
311	160	#if 1
312	160	ComplexMult(&RE(ch[ah+l1ido]), &IM(ch[ah+l1ido]),
313	160	RE(d2), IM(d2), RE(wa1[i]), IM(wa1[i]));
314	160	ComplexMult(&RE(ch[ah+2l1ido]), &IM(ch[ah+2l1ido]),
315	160	RE(d3), IM(d3), RE(wa2[i]), IM(wa2[i]));
316		#else
317		ComplexMult(&IM(ch[ah+l1ido]), &RE(ch[ah+l1ido]),
318		IM(d2), RE(d2), RE(wa1[i]), IM(wa1[i]));
319		ComplexMult(&IM(ch[ah+2l1ido]), &RE(ch[ah+2l1ido]),
320		IM(d3), RE(d3), RE(wa2[i]), IM(wa2[i]));
321		#endif
322	160	}
323	2	}
324	1	}
325	59.6k	}
326	59.6k	}
327
328
329		static void passf4pos(const uint16_t ido, const uint16_t l1, const complex_t *cc,
330		complex_t ch, const complex_t wa1, const complex_t *wa2,
331		const complex_t *wa3)
332	3.40M	{
333	3.40M	uint16_t i, k, ac, ah;
334
335	3.40M	if (ido == 1)
336	827k	{
337	104M	for (k = 0; k < l1; k++)
338	103M	{
339	103M	complex_t t1, t2, t3, t4;
340
341	103M	ac = 4*k;
342	103M	ah = k;
343
344	103M	RE(t2) = RE(cc[ac]) + RE(cc[ac+2]);
345	103M	RE(t1) = RE(cc[ac]) - RE(cc[ac+2]);
346	103M	IM(t2) = IM(cc[ac]) + IM(cc[ac+2]);
347	103M	IM(t1) = IM(cc[ac]) - IM(cc[ac+2]);
348	103M	RE(t3) = RE(cc[ac+1]) + RE(cc[ac+3]);
349	103M	IM(t4) = RE(cc[ac+1]) - RE(cc[ac+3]);
350	103M	IM(t3) = IM(cc[ac+3]) + IM(cc[ac+1]);
351	103M	RE(t4) = IM(cc[ac+3]) - IM(cc[ac+1]);
352
353	103M	RE(ch[ah]) = RE(t2) + RE(t3);
354	103M	RE(ch[ah+2*l1]) = RE(t2) - RE(t3);
355
356	103M	IM(ch[ah]) = IM(t2) + IM(t3);
357	103M	IM(ch[ah+2*l1]) = IM(t2) - IM(t3);
358
359	103M	RE(ch[ah+l1]) = RE(t1) + RE(t4);
360	103M	RE(ch[ah+3*l1]) = RE(t1) - RE(t4);
361
362	103M	IM(ch[ah+l1]) = IM(t1) + IM(t4);
363	103M	IM(ch[ah+3*l1]) = IM(t1) - IM(t4);
364	103M	}
365	2.58M	} else {
366	38.4M	for (k = 0; k < l1; k++)
367	35.8M	{
368	35.8M	ac = 4kido;
369	35.8M	ah = k*ido;
370
371	361M	for (i = 0; i < ido; i++)
372	325M	{
373	325M	complex_t c2, c3, c4, t1, t2, t3, t4;
374
375	325M	RE(t2) = RE(cc[ac+i]) + RE(cc[ac+i+2*ido]);
376	325M	RE(t1) = RE(cc[ac+i]) - RE(cc[ac+i+2*ido]);
377	325M	IM(t2) = IM(cc[ac+i]) + IM(cc[ac+i+2*ido]);
378	325M	IM(t1) = IM(cc[ac+i]) - IM(cc[ac+i+2*ido]);
379	325M	RE(t3) = RE(cc[ac+i+ido]) + RE(cc[ac+i+3*ido]);
380	325M	IM(t4) = RE(cc[ac+i+ido]) - RE(cc[ac+i+3*ido]);
381	325M	IM(t3) = IM(cc[ac+i+3*ido]) + IM(cc[ac+i+ido]);
382	325M	RE(t4) = IM(cc[ac+i+3*ido]) - IM(cc[ac+i+ido]);
383
384	325M	RE(c2) = RE(t1) + RE(t4);
385	325M	RE(c4) = RE(t1) - RE(t4);
386
387	325M	IM(c2) = IM(t1) + IM(t4);
388	325M	IM(c4) = IM(t1) - IM(t4);
389
390	325M	RE(ch[ah+i]) = RE(t2) + RE(t3);
391	325M	RE(c3) = RE(t2) - RE(t3);
392
393	325M	IM(ch[ah+i]) = IM(t2) + IM(t3);
394	325M	IM(c3) = IM(t2) - IM(t3);
395
396	325M	#if 1
397	325M	ComplexMult(&IM(ch[ah+i+l1ido]), &RE(ch[ah+i+l1ido]),
398	325M	IM(c2), RE(c2), RE(wa1[i]), IM(wa1[i]));
399	325M	ComplexMult(&IM(ch[ah+i+2l1ido]), &RE(ch[ah+i+2l1ido]),
400	325M	IM(c3), RE(c3), RE(wa2[i]), IM(wa2[i]));
401	325M	ComplexMult(&IM(ch[ah+i+3l1ido]), &RE(ch[ah+i+3l1ido]),
402	325M	IM(c4), RE(c4), RE(wa3[i]), IM(wa3[i]));
403		#else
404		ComplexMult(&RE(ch[ah+i+l1ido]), &IM(ch[ah+i+l1ido]),
405		RE(c2), IM(c2), RE(wa1[i]), IM(wa1[i]));
406		ComplexMult(&RE(ch[ah+i+2l1ido]), &IM(ch[ah+i+2l1ido]),
407		RE(c3), IM(c3), RE(wa2[i]), IM(wa2[i]));
408		ComplexMult(&RE(ch[ah+i+3l1ido]), &IM(ch[ah+i+3l1ido]),
409		RE(c4), IM(c4), RE(wa3[i]), IM(wa3[i]));
410		#endif
411	325M	}
412	35.8M	}
413	2.58M	}
414	3.40M	}
415
416		static void passf4neg(const uint16_t ido, const uint16_t l1, const complex_t *cc,
417		complex_t ch, const complex_t wa1, const complex_t *wa2,
418		const complex_t *wa3)
419	1.92k	{
420	1.92k	uint16_t i, k, ac, ah;
421
422	1.92k	if (ido == 1)
423	480	{
424	61.9k	for (k = 0; k < l1; k++)
425	61.4k	{
426	61.4k	complex_t t1, t2, t3, t4;
427
428	61.4k	ac = 4*k;
429	61.4k	ah = k;
430
431	61.4k	RE(t2) = RE(cc[ac]) + RE(cc[ac+2]);
432	61.4k	RE(t1) = RE(cc[ac]) - RE(cc[ac+2]);
433	61.4k	IM(t2) = IM(cc[ac]) + IM(cc[ac+2]);
434	61.4k	IM(t1) = IM(cc[ac]) - IM(cc[ac+2]);
435	61.4k	RE(t3) = RE(cc[ac+1]) + RE(cc[ac+3]);
436	61.4k	IM(t4) = RE(cc[ac+1]) - RE(cc[ac+3]);
437	61.4k	IM(t3) = IM(cc[ac+3]) + IM(cc[ac+1]);
438	61.4k	RE(t4) = IM(cc[ac+3]) - IM(cc[ac+1]);
439
440	61.4k	RE(ch[ah]) = RE(t2) + RE(t3);
441	61.4k	RE(ch[ah+2*l1]) = RE(t2) - RE(t3);
442
443	61.4k	IM(ch[ah]) = IM(t2) + IM(t3);
444	61.4k	IM(ch[ah+2*l1]) = IM(t2) - IM(t3);
445
446	61.4k	RE(ch[ah+l1]) = RE(t1) - RE(t4);
447	61.4k	RE(ch[ah+3*l1]) = RE(t1) + RE(t4);
448
449	61.4k	IM(ch[ah+l1]) = IM(t1) - IM(t4);
450	61.4k	IM(ch[ah+3*l1]) = IM(t1) + IM(t4);
451	61.4k	}
452	1.44k	} else {
453	21.6k	for (k = 0; k < l1; k++)
454	20.1k	{
455	20.1k	ac = 4kido;
456	20.1k	ah = k*ido;
457
458	204k	for (i = 0; i < ido; i++)
459	184k	{
460	184k	complex_t c2, c3, c4, t1, t2, t3, t4;
461
462	184k	RE(t2) = RE(cc[ac+i]) + RE(cc[ac+i+2*ido]);
463	184k	RE(t1) = RE(cc[ac+i]) - RE(cc[ac+i+2*ido]);
464	184k	IM(t2) = IM(cc[ac+i]) + IM(cc[ac+i+2*ido]);
465	184k	IM(t1) = IM(cc[ac+i]) - IM(cc[ac+i+2*ido]);
466	184k	RE(t3) = RE(cc[ac+i+ido]) + RE(cc[ac+i+3*ido]);
467	184k	IM(t4) = RE(cc[ac+i+ido]) - RE(cc[ac+i+3*ido]);
468	184k	IM(t3) = IM(cc[ac+i+3*ido]) + IM(cc[ac+i+ido]);
469	184k	RE(t4) = IM(cc[ac+i+3*ido]) - IM(cc[ac+i+ido]);
470
471	184k	RE(c2) = RE(t1) - RE(t4);
472	184k	RE(c4) = RE(t1) + RE(t4);
473
474	184k	IM(c2) = IM(t1) - IM(t4);
475	184k	IM(c4) = IM(t1) + IM(t4);
476
477	184k	RE(ch[ah+i]) = RE(t2) + RE(t3);
478	184k	RE(c3) = RE(t2) - RE(t3);
479
480	184k	IM(ch[ah+i]) = IM(t2) + IM(t3);
481	184k	IM(c3) = IM(t2) - IM(t3);
482
483	184k	#if 1
484	184k	ComplexMult(&RE(ch[ah+i+l1ido]), &IM(ch[ah+i+l1ido]),
485	184k	RE(c2), IM(c2), RE(wa1[i]), IM(wa1[i]));
486	184k	ComplexMult(&RE(ch[ah+i+2l1ido]), &IM(ch[ah+i+2l1ido]),
487	184k	RE(c3), IM(c3), RE(wa2[i]), IM(wa2[i]));
488	184k	ComplexMult(&RE(ch[ah+i+3l1ido]), &IM(ch[ah+i+3l1ido]),
489	184k	RE(c4), IM(c4), RE(wa3[i]), IM(wa3[i]));
490		#else
491		ComplexMult(&IM(ch[ah+i+l1ido]), &RE(ch[ah+i+l1ido]),
492		IM(c2), RE(c2), RE(wa1[i]), IM(wa1[i]));
493		ComplexMult(&IM(ch[ah+i+2l1ido]), &RE(ch[ah+i+2l1ido]),
494		IM(c3), RE(c3), RE(wa2[i]), IM(wa2[i]));
495		ComplexMult(&IM(ch[ah+i+3l1ido]), &RE(ch[ah+i+3l1ido]),
496		IM(c4), RE(c4), RE(wa3[i]), IM(wa3[i]));
497		#endif
498	184k	}
499	20.1k	}
500	1.44k	}
501	1.92k	}
502
503		static void passf5(const uint16_t ido, const uint16_t l1, const complex_t *cc,
504		complex_t ch, const complex_t wa1, const complex_t wa2, const complex_t wa3,
505		const complex_t *wa4, const int8_t isign)
506	59.6k	{
507	59.6k	static real_t tr11 = FRAC_CONST(0.309016994374947);
508	59.6k	static real_t ti11 = FRAC_CONST(0.951056516295154);
509	59.6k	static real_t tr12 = FRAC_CONST(-0.809016994374947);
510	59.6k	static real_t ti12 = FRAC_CONST(0.587785252292473);
511	59.6k	uint16_t k, ac, ah;
512	59.6k	complex_t c2, c3, c4, c5, t2, t3, t4, t5;
513	59.6k	(void)wa1;
514	59.6k	(void)wa2;
515	59.6k	(void)wa3;
516	59.6k	(void)wa4;
517
518	59.6k	if (ido == 1)
519	59.6k	{
520	59.6k	if (isign == 1)
521	59.6k	{
522	5.77M	for (k = 0; k < l1; k++)
523	5.71M	{
524	5.71M	ac = 5*k + 1;
525	5.71M	ah = k;
526
527	5.71M	RE(t2) = RE(cc[ac]) + RE(cc[ac+3]);
528	5.71M	IM(t2) = IM(cc[ac]) + IM(cc[ac+3]);
529	5.71M	RE(t3) = RE(cc[ac+1]) + RE(cc[ac+2]);
530	5.71M	IM(t3) = IM(cc[ac+1]) + IM(cc[ac+2]);
531	5.71M	RE(t4) = RE(cc[ac+1]) - RE(cc[ac+2]);
532	5.71M	IM(t4) = IM(cc[ac+1]) - IM(cc[ac+2]);
533	5.71M	RE(t5) = RE(cc[ac]) - RE(cc[ac+3]);
534	5.71M	IM(t5) = IM(cc[ac]) - IM(cc[ac+3]);
535
536	5.71M	RE(ch[ah]) = RE(cc[ac-1]) + RE(t2) + RE(t3);
537	5.71M	IM(ch[ah]) = IM(cc[ac-1]) + IM(t2) + IM(t3);
538
539	5.71M	RE(c2) = RE(cc[ac-1]) + MUL_F(RE(t2),tr11) + MUL_F(RE(t3),tr12);
540	5.71M	IM(c2) = IM(cc[ac-1]) + MUL_F(IM(t2),tr11) + MUL_F(IM(t3),tr12);
541	5.71M	RE(c3) = RE(cc[ac-1]) + MUL_F(RE(t2),tr12) + MUL_F(RE(t3),tr11);
542	5.71M	IM(c3) = IM(cc[ac-1]) + MUL_F(IM(t2),tr12) + MUL_F(IM(t3),tr11);
543
544	5.71M	ComplexMult(&RE(c5), &RE(c4),
545	5.71M	ti11, ti12, RE(t5), RE(t4));
546	5.71M	ComplexMult(&IM(c5), &IM(c4),
547	5.71M	ti11, ti12, IM(t5), IM(t4));
548
549	5.71M	RE(ch[ah+l1]) = RE(c2) - IM(c5);
550	5.71M	IM(ch[ah+l1]) = IM(c2) + RE(c5);
551	5.71M	RE(ch[ah+2*l1]) = RE(c3) - IM(c4);
552	5.71M	IM(ch[ah+2*l1]) = IM(c3) + RE(c4);
553	5.71M	RE(ch[ah+3*l1]) = RE(c3) + IM(c4);
554	5.71M	IM(ch[ah+3*l1]) = IM(c3) - RE(c4);
555	5.71M	RE(ch[ah+4*l1]) = RE(c2) + IM(c5);
556	5.71M	IM(ch[ah+4*l1]) = IM(c2) - RE(c5);
557	5.71M	}
558	59.6k	} else {
559	97	for (k = 0; k < l1; k++)
560	96	{
561	96	ac = 5*k + 1;
562	96	ah = k;
563
564	96	RE(t2) = RE(cc[ac]) + RE(cc[ac+3]);
565	96	IM(t2) = IM(cc[ac]) + IM(cc[ac+3]);
566	96	RE(t3) = RE(cc[ac+1]) + RE(cc[ac+2]);
567	96	IM(t3) = IM(cc[ac+1]) + IM(cc[ac+2]);
568	96	RE(t4) = RE(cc[ac+1]) - RE(cc[ac+2]);
569	96	IM(t4) = IM(cc[ac+1]) - IM(cc[ac+2]);
570	96	RE(t5) = RE(cc[ac]) - RE(cc[ac+3]);
571	96	IM(t5) = IM(cc[ac]) - IM(cc[ac+3]);
572
573	96	RE(ch[ah]) = RE(cc[ac-1]) + RE(t2) + RE(t3);
574	96	IM(ch[ah]) = IM(cc[ac-1]) + IM(t2) + IM(t3);
575
576	96	RE(c2) = RE(cc[ac-1]) + MUL_F(RE(t2),tr11) + MUL_F(RE(t3),tr12);
577	96	IM(c2) = IM(cc[ac-1]) + MUL_F(IM(t2),tr11) + MUL_F(IM(t3),tr12);
578	96	RE(c3) = RE(cc[ac-1]) + MUL_F(RE(t2),tr12) + MUL_F(RE(t3),tr11);
579	96	IM(c3) = IM(cc[ac-1]) + MUL_F(IM(t2),tr12) + MUL_F(IM(t3),tr11);
580
581	96	ComplexMult(&RE(c4), &RE(c5),
582	96	ti12, ti11, RE(t5), RE(t4));
583	96	ComplexMult(&IM(c4), &IM(c5),
584	96	ti12, ti11, IM(t5), IM(t4));
585
586	96	RE(ch[ah+l1]) = RE(c2) + IM(c5);
587	96	IM(ch[ah+l1]) = IM(c2) - RE(c5);
588	96	RE(ch[ah+2*l1]) = RE(c3) + IM(c4);
589	96	IM(ch[ah+2*l1]) = IM(c3) - RE(c4);
590	96	RE(ch[ah+3*l1]) = RE(c3) - IM(c4);
591	96	IM(ch[ah+3*l1]) = IM(c3) + RE(c4);
592	96	RE(ch[ah+4*l1]) = RE(c2) - IM(c5);
593	96	IM(ch[ah+4*l1]) = IM(c2) + RE(c5);
594	96	}
595	1	}
596	59.6k	} else {
597	0	#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
598		// TODO: remove this code once fuzzer proves it is totally unreahable
599		// 5 if the biggest factor and it never repeated for supported frame
600		// lengths; consequently `ido` should always be 1.
601	0	__builtin_trap();
602		/*
603		#else
604		uint16_t i;
605		complex_t d3, d4, d5, d2;
606		#endif
607		if (isign == 1)
608		{
609		for (k = 0; k < l1; k++)
610		{
611		for (i = 0; i < ido; i++)
612		{
613		ac = i + (k5 + 1) ido;
614		ah = i + k * ido;
615
616		RE(t2) = RE(cc[ac]) + RE(cc[ac+3*ido]);
617		IM(t2) = IM(cc[ac]) + IM(cc[ac+3*ido]);
618		RE(t3) = RE(cc[ac+ido]) + RE(cc[ac+2*ido]);
619		IM(t3) = IM(cc[ac+ido]) + IM(cc[ac+2*ido]);
620		RE(t4) = RE(cc[ac+ido]) - RE(cc[ac+2*ido]);
621		IM(t4) = IM(cc[ac+ido]) - IM(cc[ac+2*ido]);
622		RE(t5) = RE(cc[ac]) - RE(cc[ac+3*ido]);
623		IM(t5) = IM(cc[ac]) - IM(cc[ac+3*ido]);
624
625		RE(ch[ah]) = RE(cc[ac-ido]) + RE(t2) + RE(t3);
626		IM(ch[ah]) = IM(cc[ac-ido]) + IM(t2) + IM(t3);
627
628		RE(c2) = RE(cc[ac-ido]) + MUL_F(RE(t2),tr11) + MUL_F(RE(t3),tr12);
629		IM(c2) = IM(cc[ac-ido]) + MUL_F(IM(t2),tr11) + MUL_F(IM(t3),tr12);
630		RE(c3) = RE(cc[ac-ido]) + MUL_F(RE(t2),tr12) + MUL_F(RE(t3),tr11);
631		IM(c3) = IM(cc[ac-ido]) + MUL_F(IM(t2),tr12) + MUL_F(IM(t3),tr11);
632
633		ComplexMult(&RE(c5), &RE(c4),
634		ti11, ti12, RE(t5), RE(t4));
635		ComplexMult(&IM(c5), &IM(c4),
636		ti11, ti12, IM(t5), IM(t4));
637
638		IM(d2) = IM(c2) + RE(c5);
639		IM(d3) = IM(c3) + RE(c4);
640		RE(d4) = RE(c3) + IM(c4);
641		RE(d5) = RE(c2) + IM(c5);
642		RE(d2) = RE(c2) - IM(c5);
643		IM(d5) = IM(c2) - RE(c5);
644		RE(d3) = RE(c3) - IM(c4);
645		IM(d4) = IM(c3) - RE(c4);
646
647		#if 1
648		ComplexMult(&IM(ch[ah+l1ido]), &RE(ch[ah+l1ido]),
649		IM(d2), RE(d2), RE(wa1[i]), IM(wa1[i]));
650		ComplexMult(&IM(ch[ah+2l1ido]), &RE(ch[ah+2l1ido]),
651		IM(d3), RE(d3), RE(wa2[i]), IM(wa2[i]));
652		ComplexMult(&IM(ch[ah+3l1ido]), &RE(ch[ah+3l1ido]),
653		IM(d4), RE(d4), RE(wa3[i]), IM(wa3[i]));
654		ComplexMult(&IM(ch[ah+4l1ido]), &RE(ch[ah+4l1ido]),
655		IM(d5), RE(d5), RE(wa4[i]), IM(wa4[i]));
656		#else
657		ComplexMult(&RE(ch[ah+l1ido]), &IM(ch[ah+l1ido]),
658		RE(d2), IM(d2), RE(wa1[i]), IM(wa1[i]));
659		ComplexMult(&RE(ch[ah+2l1ido]), &IM(ch[ah+2l1ido]),
660		RE(d3), IM(d3), RE(wa2[i]), IM(wa2[i]));
661		ComplexMult(&RE(ch[ah+3l1ido]), &IM(ch[ah+3l1ido]),
662		RE(d4), IM(d4), RE(wa3[i]), IM(wa3[i]));
663		ComplexMult(&RE(ch[ah+4l1ido]), &IM(ch[ah+4l1ido]),
664		RE(d5), IM(d5), RE(wa4[i]), IM(wa4[i]));
665		#endif
666		}
667		}
668		} else {
669		for (k = 0; k < l1; k++)
670		{
671		for (i = 0; i < ido; i++)
672		{
673		ac = i + (k5 + 1) ido;
674		ah = i + k * ido;
675
676		RE(t2) = RE(cc[ac]) + RE(cc[ac+3*ido]);
677		IM(t2) = IM(cc[ac]) + IM(cc[ac+3*ido]);
678		RE(t3) = RE(cc[ac+ido]) + RE(cc[ac+2*ido]);
679		IM(t3) = IM(cc[ac+ido]) + IM(cc[ac+2*ido]);
680		RE(t4) = RE(cc[ac+ido]) - RE(cc[ac+2*ido]);
681		IM(t4) = IM(cc[ac+ido]) - IM(cc[ac+2*ido]);
682		RE(t5) = RE(cc[ac]) - RE(cc[ac+3*ido]);
683		IM(t5) = IM(cc[ac]) - IM(cc[ac+3*ido]);
684
685		RE(ch[ah]) = RE(cc[ac-ido]) + RE(t2) + RE(t3);
686		IM(ch[ah]) = IM(cc[ac-ido]) + IM(t2) + IM(t3);
687
688		RE(c2) = RE(cc[ac-ido]) + MUL_F(RE(t2),tr11) + MUL_F(RE(t3),tr12);
689		IM(c2) = IM(cc[ac-ido]) + MUL_F(IM(t2),tr11) + MUL_F(IM(t3),tr12);
690		RE(c3) = RE(cc[ac-ido]) + MUL_F(RE(t2),tr12) + MUL_F(RE(t3),tr11);
691		IM(c3) = IM(cc[ac-ido]) + MUL_F(IM(t2),tr12) + MUL_F(IM(t3),tr11);
692
693		ComplexMult(&RE(c4), &RE(c5),
694		ti12, ti11, RE(t5), RE(t4));
695		ComplexMult(&IM(c4), &IM(c5),
696		ti12, ti11, IM(t5), IM(t4));
697
698		IM(d2) = IM(c2) - RE(c5);
699		IM(d3) = IM(c3) - RE(c4);
700		RE(d4) = RE(c3) - IM(c4);
701		RE(d5) = RE(c2) - IM(c5);
702		RE(d2) = RE(c2) + IM(c5);
703		IM(d5) = IM(c2) + RE(c5);
704		RE(d3) = RE(c3) + IM(c4);
705		IM(d4) = IM(c3) + RE(c4);
706
707		#if 1
708		ComplexMult(&RE(ch[ah+l1ido]), &IM(ch[ah+l1ido]),
709		RE(d2), IM(d2), RE(wa1[i]), IM(wa1[i]));
710		ComplexMult(&RE(ch[ah+2l1ido]), &IM(ch[ah+2l1ido]),
711		RE(d3), IM(d3), RE(wa2[i]), IM(wa2[i]));
712		ComplexMult(&RE(ch[ah+3l1ido]), &IM(ch[ah+3l1ido]),
713		RE(d4), IM(d4), RE(wa3[i]), IM(wa3[i]));
714		ComplexMult(&RE(ch[ah+4l1ido]), &IM(ch[ah+4l1ido]),
715		RE(d5), IM(d5), RE(wa4[i]), IM(wa4[i]));
716		#else
717		ComplexMult(&IM(ch[ah+l1ido]), &RE(ch[ah+l1ido]),
718		IM(d2), RE(d2), RE(wa1[i]), IM(wa1[i]));
719		ComplexMult(&IM(ch[ah+2l1ido]), &RE(ch[ah+2l1ido]),
720		IM(d3), RE(d3), RE(wa2[i]), IM(wa2[i]));
721		ComplexMult(&IM(ch[ah+3l1ido]), &RE(ch[ah+3l1ido]),
722		IM(d4), RE(d4), RE(wa3[i]), IM(wa3[i]));
723		ComplexMult(&IM(ch[ah+4l1ido]), &RE(ch[ah+4l1ido]),
724		IM(d5), RE(d5), RE(wa4[i]), IM(wa4[i]));
725		#endif
726		}
727		}
728		}
729		#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
730		*/
731	0	#endif
732	0	}
733	59.6k	}
734
735
736		/*----------------------------------------------------------------------
737		cfftf1, cfftf, cfftb, cffti1, cffti. Complex FFTs.
738		----------------------------------------------------------------------*/
739
740		static INLINE void cfftf1pos(uint16_t n, complex_t c, complex_t ch,
741		const uint16_t ifac, const complex_t wa,
742		const int8_t isign)
743	886k	{
744	886k	uint16_t i;
745	886k	uint16_t k1, l1, l2;
746	886k	uint16_t na, nf, ip, iw, ix2, ix3, ix4, ido;
747
748	886k	nf = ifac[1];
749	886k	na = 0;
750	886k	l1 = 1;
751	886k	iw = 0;
752
753	5.28M	for (k1 = 2; k1 <= nf+1; k1++)
754	4.39M	{
755	4.39M	ip = ifac[k1];
756	4.39M	l2 = ip*l1;
757	4.39M	ido = n / l2;
758
759	4.39M	switch (ip)
760	4.39M	{
761	3.40M	case 4:
762	3.40M	ix2 = iw + ido;
763	3.40M	ix3 = ix2 + ido;
764
765	3.40M	if (na == 0)
766	1.71M	passf4pos((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw], &wa[ix2], &wa[ix3]);
767	1.69M	else
768	1.69M	passf4pos((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)ch, c, &wa[iw], &wa[ix2], &wa[ix3]);
769
770	3.40M	na = 1 - na;
771	3.40M	break;
772	868k	case 2:
773	868k	if (na == 0)
774	868k	passf2pos((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw]);
775	0	else
776	0	passf2pos((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)ch, c, &wa[iw]);
777
778	868k	na = 1 - na;
779	868k	break;
780	59.6k	case 3:
781	59.6k	ix2 = iw + ido;
782
783	59.6k	if (na == 0)
784	64	passf3((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw], &wa[ix2], isign);
785	59.5k	else
786	59.5k	passf3((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)ch, c, &wa[iw], &wa[ix2], isign);
787
788	59.6k	na = 1 - na;
789	59.6k	break;
790	59.6k	case 5:
791	59.6k	ix2 = iw + ido;
792	59.6k	ix3 = ix2 + ido;
793	59.6k	ix4 = ix3 + ido;
794
795	59.6k	if (na == 0)
796	59.6k	passf5((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw], &wa[ix2], &wa[ix3], &wa[ix4], isign);
797	0	else
798	0	passf5((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)ch, c, &wa[iw], &wa[ix2], &wa[ix3], &wa[ix4], isign);
799
800	59.6k	na = 1 - na;
801	59.6k	break;
802	4.39M	}
803
804	4.39M	l1 = l2;
805	4.39M	iw += (ip-1) * ido;
806	4.39M	}
807
808	886k	if (na == 0)
809	0	return;
810
811	444M	for (i = 0; i < n; i++)
812	443M	{
813	443M	RE(c[i]) = RE(ch[i]);
814	443M	IM(c[i]) = IM(ch[i]);
815	443M	}
816	886k	}
817
818		static INLINE void cfftf1neg(uint16_t n, complex_t c, complex_t ch,
819		const uint16_t ifac, const complex_t wa,
820		const int8_t isign)
821	481	{
822	481	uint16_t i;
823	481	uint16_t k1, l1, l2;
824	481	uint16_t na, nf, ip, iw, ix2, ix3, ix4, ido;
825
826	481	nf = ifac[1];
827	481	na = 0;
828	481	l1 = 1;
829	481	iw = 0;
830
831	2.88k	for (k1 = 2; k1 <= nf+1; k1++)
832	2.40k	{
833	2.40k	ip = ifac[k1];
834	2.40k	l2 = ip*l1;
835	2.40k	ido = n / l2;
836
837	2.40k	switch (ip)
838	2.40k	{
839	1.92k	case 4:
840	1.92k	ix2 = iw + ido;
841	1.92k	ix3 = ix2 + ido;
842
843	1.92k	if (na == 0)
844	961	passf4neg((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw], &wa[ix2], &wa[ix3]);
845	961	else
846	961	passf4neg((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)ch, c, &wa[iw], &wa[ix2], &wa[ix3]);
847
848	1.92k	na = 1 - na;
849	1.92k	break;
850	481	case 2:
851	481	if (na == 0)
852	481	passf2neg((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw]);
853	0	else
854	0	passf2neg((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)ch, c, &wa[iw]);
855
856	481	na = 1 - na;
857	481	break;
858	1	case 3:
859	1	ix2 = iw + ido;
860
861	1	if (na == 0)
862	0	passf3((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw], &wa[ix2], isign);
863	1	else
864	1	passf3((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)ch, c, &wa[iw], &wa[ix2], isign);
865
866	1	na = 1 - na;
867	1	break;
868	1	case 5:
869	1	ix2 = iw + ido;
870	1	ix3 = ix2 + ido;
871	1	ix4 = ix3 + ido;
872
873	1	if (na == 0)
874	1	passf5((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw], &wa[ix2], &wa[ix3], &wa[ix4], isign);
875	0	else
876	0	passf5((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)ch, c, &wa[iw], &wa[ix2], &wa[ix3], &wa[ix4], isign);
877
878	1	na = 1 - na;
879	1	break;
880	2.40k	}
881
882	2.40k	l1 = l2;
883	2.40k	iw += (ip-1) * ido;
884	2.40k	}
885
886	481	if (na == 0)
887	0	return;
888
889	246k	for (i = 0; i < n; i++)
890	246k	{
891	246k	RE(c[i]) = RE(ch[i]);
892	246k	IM(c[i]) = IM(ch[i]);
893	246k	}
894	481	}
895
896		void cfftf(cfft_info cfft, complex_t c)
897	481	{
898	481	cfftf1neg(cfft->n, c, cfft->work, (const uint16_t)cfft->ifac, (const complex_t)cfft->tab, -1);
899	481	}
900
901		void cfftb(cfft_info cfft, complex_t c)
902	886k	{
903	886k	cfftf1pos(cfft->n, c, cfft->work, (const uint16_t)cfft->ifac, (const complex_t)cfft->tab, +1);
904	886k	}
905
906		static void cffti1(uint16_t n, complex_t wa, uint16_t ifac)
907	40.0k	{
908	40.0k	static uint16_t ntryh[4] = {3, 4, 2, 5};
909	40.0k	#ifndef FIXED_POINT
910	40.0k	real_t arg, argh, argld, fi;
911	40.0k	uint16_t ido, ipm;
912	40.0k	uint16_t i1, k1, l1, l2;
913	40.0k	uint16_t ld, ii, ip;
914	40.0k	#endif
915	40.0k	uint16_t ntry = 0, i, j;
916	40.0k	uint16_t ib;
917	40.0k	uint16_t nf, nl, nq, nr;
918
919	40.0k	nl = n;
920	40.0k	nf = 0;
921	40.0k	j = 0;
922
923	98.4k	startloop:
924	98.4k	j++;
925
926	98.4k	if (j <= 4)
927	98.4k	ntry = ntryh[j-1];
928	0	else
929	0	ntry += 2;
930
931	98.4k	do
932	218k	{
933	218k	nq = nl / ntry;
934	218k	nr = nl - ntry*nq;
935
936	218k	if (nr != 0)
937	58.3k	goto startloop;
938
939	160k	nf++;
940	160k	ifac[nf+1] = ntry;
941	160k	nl = nq;
942
943	160k	if (ntry == 2 && nf != 1)
944	13.3k	{
945	65.7k	for (i = 2; i <= nf; i++)
946	52.4k	{
947	52.4k	ib = nf - i + 2;
948	52.4k	ifac[ib+1] = ifac[ib];
949	52.4k	}
950	13.3k	ifac[2] = 2;
951	13.3k	}
952	160k	} while (nl != 1);
953
954	40.0k	ifac[0] = n;
955	40.0k	ifac[1] = nf;
956
957	40.0k	#ifndef FIXED_POINT
958	40.0k	argh = (real_t)2.0*(real_t)M_PI / (real_t)n;
959	40.0k	i = 0;
960	40.0k	l1 = 1;
961
962	200k	for (k1 = 1; k1 <= nf; k1++)
963	160k	{
964	160k	ip = ifac[k1+1];
965	160k	ld = 0;
966	160k	l2 = l1*ip;
967	160k	ido = n / l2;
968	160k	ipm = ip - 1;
969
970	614k	for (j = 0; j < ipm; j++)
971	453k	{
972	453k	i1 = i;
973	453k	RE(wa[i]) = 1.0;
974	453k	IM(wa[i]) = 0.0;
975	453k	ld += l1;
976	453k	fi = 0;
977	453k	argld = ld*argh;
978
979	11.4M	for (ii = 0; ii < ido; ii++)
980	11.0M	{
981	11.0M	i++;
982	11.0M	fi++;
983	11.0M	arg = fi * argld;
984	11.0M	RE(wa[i]) = (real_t)cos(arg);
985	11.0M	#if 1
986	11.0M	IM(wa[i]) = (real_t)sin(arg);
987		#else
988		IM(wa[i]) = (real_t)-sin(arg);
989		#endif
990	11.0M	}
991
992	453k	if (ip > 5)
993	0	{
994	0	RE(wa[i1]) = RE(wa[i]);
995	0	IM(wa[i1]) = IM(wa[i]);
996	0	}
997	453k	}
998	160k	l1 = l2;
999	160k	}
1000		#else // FIXED_POINT
1001		(void)wa; /* whoa! does it work for FIXED_POINT? */
1002		#endif
1003	40.0k	}
1004
1005		cfft_info *cffti(uint16_t n)
1006	40.0k	{
1007	40.0k	cfft_info cfft = (cfft_info)faad_malloc(sizeof(cfft_info));
1008
1009	40.0k	cfft->n = n;
1010	40.0k	cfft->work = (complex_t)faad_malloc(nsizeof(complex_t));
1011
1012	40.0k	#ifndef FIXED_POINT
1013	40.0k	cfft->tab = (complex_t)faad_malloc(nsizeof(complex_t));
1014
1015	40.0k	cffti1(n, cfft->tab, cfft->ifac);
1016		#else
1017		cffti1(n, NULL, cfft->ifac);
1018
1019		switch (n)
1020		{
1021		case 64: cfft->tab = (complex_t*)cfft_tab_64; break;
1022		case 512: cfft->tab = (complex_t*)cfft_tab_512; break;
1023		#ifdef LD_DEC
1024		case 256: cfft->tab = (complex_t*)cfft_tab_256; break;
1025		#endif
1026
1027		#ifdef ALLOW_SMALL_FRAMELENGTH
1028		case 60: cfft->tab = (complex_t*)cfft_tab_60; break;
1029		case 480: cfft->tab = (complex_t*)cfft_tab_480; break;
1030		#ifdef LD_DEC
1031		case 240: cfft->tab = (complex_t*)cfft_tab_240; break;
1032		#endif
1033		#endif
1034		case 128: cfft->tab = (complex_t*)cfft_tab_128; break;
1035		}
1036		#endif
1037
1038	40.0k	return cfft;
1039	40.0k	}
1040
1041		void cfftu(cfft_info *cfft)
1042	39.8k	{
1043	39.8k	if (cfft->work) faad_free(cfft->work);
1044	39.8k	#ifndef FIXED_POINT
1045	39.8k	if (cfft->tab) faad_free(cfft->tab);
1046	39.8k	#endif
1047
1048	39.8k	if (cfft) faad_free(cfft);
1049	39.8k	}
1050

Coverage Report

Created: 2026-07-12 08:57