/proc/self/cwd/libfaad/cfft.c

Line	Count	Source (jump to first uncovered line)
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	257k	{
73	257k	uint16_t i, k, ah, ac;
74
75	257k	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	257k	} else {
98	514k	for (k = 0; k < l1; k++)
99	257k	{
100	257k	ah = k*ido;
101	257k	ac = 2kido;
102
103	65.6M	for (i = 0; i < ido; i++)
104	65.3M	{
105	65.3M	complex_t t2;
106
107	65.3M	RE(ch[ah+i]) = RE(cc[ac+i]) + RE(cc[ac+i+ido]);
108	65.3M	RE(t2) = RE(cc[ac+i]) - RE(cc[ac+i+ido]);
109
110	65.3M	IM(ch[ah+i]) = IM(cc[ac+i]) + IM(cc[ac+i+ido]);
111	65.3M	IM(t2) = IM(cc[ac+i]) - IM(cc[ac+i+ido]);
112
113	65.3M	#if 1
114	65.3M	ComplexMult(&IM(ch[ah+i+l1ido]), &RE(ch[ah+i+l1ido]),
115	65.3M	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	65.3M	}
121	257k	}
122	257k	}
123	257k	}
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	6.85k	{
128	6.85k	uint16_t i, k, ah, ac;
129
130	6.85k	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	6.85k	} else {
153	13.7k	for (k = 0; k < l1; k++)
154	6.85k	{
155	6.85k	ah = k*ido;
156	6.85k	ac = 2kido;
157
158	1.70M	for (i = 0; i < ido; i++)
159	1.69M	{
160	1.69M	complex_t t2;
161
162	1.69M	RE(ch[ah+i]) = RE(cc[ac+i]) + RE(cc[ac+i+ido]);
163	1.69M	RE(t2) = RE(cc[ac+i]) - RE(cc[ac+i+ido]);
164
165	1.69M	IM(ch[ah+i]) = IM(cc[ac+i]) + IM(cc[ac+i+ido]);
166	1.69M	IM(t2) = IM(cc[ac+i]) - IM(cc[ac+i+ido]);
167
168	1.69M	#if 1
169	1.69M	ComplexMult(&RE(ch[ah+i+l1ido]), &IM(ch[ah+i+l1ido]),
170	1.69M	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	1.69M	}
176	6.85k	}
177	6.85k	}
178	6.85k	}
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.5k	{
185	59.5k	static real_t taur = FRAC_CONST(-0.5);
186	59.5k	static real_t taui = FRAC_CONST(0.866025403784439);
187	59.5k	uint16_t i, k, ac, ah;
188	59.5k	complex_t c2, c3, d2, d3, t2;
189
190	59.5k	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.5k	} else {
249	59.5k	if (isign == 1)
250	55.9k	{
251	143k	for (k = 0; k < l1; k++)
252	87.3k	{
253	5.66M	for (i = 0; i < ido; i++)
254	5.58M	{
255	5.58M	ac = i + (3k+1)ido;
256	5.58M	ah = i + k * ido;
257
258	5.58M	RE(t2) = RE(cc[ac]) + RE(cc[ac+ido]);
259	5.58M	RE(c2) = RE(cc[ac-ido]) + MUL_F(RE(t2),taur);
260	5.58M	IM(t2) = IM(cc[ac]) + IM(cc[ac+ido]);
261	5.58M	IM(c2) = IM(cc[ac-ido]) + MUL_F(IM(t2),taur);
262
263	5.58M	RE(ch[ah]) = RE(cc[ac-ido]) + RE(t2);
264	5.58M	IM(ch[ah]) = IM(cc[ac-ido]) + IM(t2);
265
266	5.58M	RE(c3) = MUL_F((RE(cc[ac]) - RE(cc[ac+ido])), taui);
267	5.58M	IM(c3) = MUL_F((IM(cc[ac]) - IM(cc[ac+ido])), taui);
268
269	5.58M	RE(d2) = RE(c2) - IM(c3);
270	5.58M	IM(d3) = IM(c2) - RE(c3);
271	5.58M	RE(d3) = RE(c2) + IM(c3);
272	5.58M	IM(d2) = IM(c2) + RE(c3);
273
274	5.58M	#if 1
275	5.58M	ComplexMult(&IM(ch[ah+l1ido]), &RE(ch[ah+l1ido]),
276	5.58M	IM(d2), RE(d2), RE(wa1[i]), IM(wa1[i]));
277	5.58M	ComplexMult(&IM(ch[ah+2l1ido]), &RE(ch[ah+2l1ido]),
278	5.58M	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	5.58M	}
286	87.3k	}
287	55.9k	} else {
288	10.6k	for (k = 0; k < l1; k++)
289	7.07k	{
290	573k	for (i = 0; i < ido; i++)
291	566k	{
292	566k	ac = i + (3k+1)ido;
293	566k	ah = i + k * ido;
294
295	566k	RE(t2) = RE(cc[ac]) + RE(cc[ac+ido]);
296	566k	RE(c2) = RE(cc[ac-ido]) + MUL_F(RE(t2),taur);
297	566k	IM(t2) = IM(cc[ac]) + IM(cc[ac+ido]);
298	566k	IM(c2) = IM(cc[ac-ido]) + MUL_F(IM(t2),taur);
299
300	566k	RE(ch[ah]) = RE(cc[ac-ido]) + RE(t2);
301	566k	IM(ch[ah]) = IM(cc[ac-ido]) + IM(t2);
302
303	566k	RE(c3) = MUL_F((RE(cc[ac]) - RE(cc[ac+ido])), taui);
304	566k	IM(c3) = MUL_F((IM(cc[ac]) - IM(cc[ac+ido])), taui);
305
306	566k	RE(d2) = RE(c2) + IM(c3);
307	566k	IM(d3) = IM(c2) + RE(c3);
308	566k	RE(d3) = RE(c2) - IM(c3);
309	566k	IM(d2) = IM(c2) - RE(c3);
310
311	566k	#if 1
312	566k	ComplexMult(&RE(ch[ah+l1ido]), &IM(ch[ah+l1ido]),
313	566k	RE(d2), IM(d2), RE(wa1[i]), IM(wa1[i]));
314	566k	ComplexMult(&RE(ch[ah+2l1ido]), &IM(ch[ah+2l1ido]),
315	566k	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	566k	}
323	7.07k	}
324	3.56k	}
325	59.5k	}
326	59.5k	}
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	1.32M	{
333	1.32M	uint16_t i, k, ac, ah;
334
335	1.32M	if (ido == 1)
336	336k	{
337	31.0M	for (k = 0; k < l1; k++)
338	30.7M	{
339	30.7M	complex_t t1, t2, t3, t4;
340
341	30.7M	ac = 4*k;
342	30.7M	ah = k;
343
344	30.7M	RE(t2) = RE(cc[ac]) + RE(cc[ac+2]);
345	30.7M	RE(t1) = RE(cc[ac]) - RE(cc[ac+2]);
346	30.7M	IM(t2) = IM(cc[ac]) + IM(cc[ac+2]);
347	30.7M	IM(t1) = IM(cc[ac]) - IM(cc[ac+2]);
348	30.7M	RE(t3) = RE(cc[ac+1]) + RE(cc[ac+3]);
349	30.7M	IM(t4) = RE(cc[ac+1]) - RE(cc[ac+3]);
350	30.7M	IM(t3) = IM(cc[ac+3]) + IM(cc[ac+1]);
351	30.7M	RE(t4) = IM(cc[ac+3]) - IM(cc[ac+1]);
352
353	30.7M	RE(ch[ah]) = RE(t2) + RE(t3);
354	30.7M	RE(ch[ah+2*l1]) = RE(t2) - RE(t3);
355
356	30.7M	IM(ch[ah]) = IM(t2) + IM(t3);
357	30.7M	IM(ch[ah+2*l1]) = IM(t2) - IM(t3);
358
359	30.7M	RE(ch[ah+l1]) = RE(t1) + RE(t4);
360	30.7M	RE(ch[ah+3*l1]) = RE(t1) - RE(t4);
361
362	30.7M	IM(ch[ah+l1]) = IM(t1) + IM(t4);
363	30.7M	IM(ch[ah+3*l1]) = IM(t1) - IM(t4);
364	30.7M	}
365	989k	} else {
366	12.0M	for (k = 0; k < l1; k++)
367	11.0M	{
368	11.0M	ac = 4kido;
369	11.0M	ah = k*ido;
370
371	109M	for (i = 0; i < ido; i++)
372	98.4M	{
373	98.4M	complex_t c2, c3, c4, t1, t2, t3, t4;
374
375	98.4M	RE(t2) = RE(cc[ac+i]) + RE(cc[ac+i+2*ido]);
376	98.4M	RE(t1) = RE(cc[ac+i]) - RE(cc[ac+i+2*ido]);
377	98.4M	IM(t2) = IM(cc[ac+i]) + IM(cc[ac+i+2*ido]);
378	98.4M	IM(t1) = IM(cc[ac+i]) - IM(cc[ac+i+2*ido]);
379	98.4M	RE(t3) = RE(cc[ac+i+ido]) + RE(cc[ac+i+3*ido]);
380	98.4M	IM(t4) = RE(cc[ac+i+ido]) - RE(cc[ac+i+3*ido]);
381	98.4M	IM(t3) = IM(cc[ac+i+3*ido]) + IM(cc[ac+i+ido]);
382	98.4M	RE(t4) = IM(cc[ac+i+3*ido]) - IM(cc[ac+i+ido]);
383
384	98.4M	RE(c2) = RE(t1) + RE(t4);
385	98.4M	RE(c4) = RE(t1) - RE(t4);
386
387	98.4M	IM(c2) = IM(t1) + IM(t4);
388	98.4M	IM(c4) = IM(t1) - IM(t4);
389
390	98.4M	RE(ch[ah+i]) = RE(t2) + RE(t3);
391	98.4M	RE(c3) = RE(t2) - RE(t3);
392
393	98.4M	IM(ch[ah+i]) = IM(t2) + IM(t3);
394	98.4M	IM(c3) = IM(t2) - IM(t3);
395
396	98.4M	#if 1
397	98.4M	ComplexMult(&IM(ch[ah+i+l1ido]), &RE(ch[ah+i+l1ido]),
398	98.4M	IM(c2), RE(c2), RE(wa1[i]), IM(wa1[i]));
399	98.4M	ComplexMult(&IM(ch[ah+i+2l1ido]), &RE(ch[ah+i+2l1ido]),
400	98.4M	IM(c3), RE(c3), RE(wa2[i]), IM(wa2[i]));
401	98.4M	ComplexMult(&IM(ch[ah+i+3l1ido]), &RE(ch[ah+i+3l1ido]),
402	98.4M	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	98.4M	}
412	11.0M	}
413	989k	}
414	1.32M	}
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	20.8k	{
420	20.8k	uint16_t i, k, ac, ah;
421
422	20.8k	if (ido == 1)
423	3.43k	{
424	437k	for (k = 0; k < l1; k++)
425	433k	{
426	433k	complex_t t1, t2, t3, t4;
427
428	433k	ac = 4*k;
429	433k	ah = k;
430
431	433k	RE(t2) = RE(cc[ac]) + RE(cc[ac+2]);
432	433k	RE(t1) = RE(cc[ac]) - RE(cc[ac+2]);
433	433k	IM(t2) = IM(cc[ac]) + IM(cc[ac+2]);
434	433k	IM(t1) = IM(cc[ac]) - IM(cc[ac+2]);
435	433k	RE(t3) = RE(cc[ac+1]) + RE(cc[ac+3]);
436	433k	IM(t4) = RE(cc[ac+1]) - RE(cc[ac+3]);
437	433k	IM(t3) = IM(cc[ac+3]) + IM(cc[ac+1]);
438	433k	RE(t4) = IM(cc[ac+3]) - IM(cc[ac+1]);
439
440	433k	RE(ch[ah]) = RE(t2) + RE(t3);
441	433k	RE(ch[ah+2*l1]) = RE(t2) - RE(t3);
442
443	433k	IM(ch[ah]) = IM(t2) + IM(t3);
444	433k	IM(ch[ah+2*l1]) = IM(t2) - IM(t3);
445
446	433k	RE(ch[ah+l1]) = RE(t1) - RE(t4);
447	433k	RE(ch[ah+3*l1]) = RE(t1) + RE(t4);
448
449	433k	IM(ch[ah+l1]) = IM(t1) - IM(t4);
450	433k	IM(ch[ah+3*l1]) = IM(t1) + IM(t4);
451	433k	}
452	17.4k	} else {
453	265k	for (k = 0; k < l1; k++)
454	248k	{
455	248k	ac = 4kido;
456	248k	ah = k*ido;
457
458	2.39M	for (i = 0; i < ido; i++)
459	2.15M	{
460	2.15M	complex_t c2, c3, c4, t1, t2, t3, t4;
461
462	2.15M	RE(t2) = RE(cc[ac+i]) + RE(cc[ac+i+2*ido]);
463	2.15M	RE(t1) = RE(cc[ac+i]) - RE(cc[ac+i+2*ido]);
464	2.15M	IM(t2) = IM(cc[ac+i]) + IM(cc[ac+i+2*ido]);
465	2.15M	IM(t1) = IM(cc[ac+i]) - IM(cc[ac+i+2*ido]);
466	2.15M	RE(t3) = RE(cc[ac+i+ido]) + RE(cc[ac+i+3*ido]);
467	2.15M	IM(t4) = RE(cc[ac+i+ido]) - RE(cc[ac+i+3*ido]);
468	2.15M	IM(t3) = IM(cc[ac+i+3*ido]) + IM(cc[ac+i+ido]);
469	2.15M	RE(t4) = IM(cc[ac+i+3*ido]) - IM(cc[ac+i+ido]);
470
471	2.15M	RE(c2) = RE(t1) - RE(t4);
472	2.15M	RE(c4) = RE(t1) + RE(t4);
473
474	2.15M	IM(c2) = IM(t1) - IM(t4);
475	2.15M	IM(c4) = IM(t1) + IM(t4);
476
477	2.15M	RE(ch[ah+i]) = RE(t2) + RE(t3);
478	2.15M	RE(c3) = RE(t2) - RE(t3);
479
480	2.15M	IM(ch[ah+i]) = IM(t2) + IM(t3);
481	2.15M	IM(c3) = IM(t2) - IM(t3);
482
483	2.15M	#if 1
484	2.15M	ComplexMult(&RE(ch[ah+i+l1ido]), &IM(ch[ah+i+l1ido]),
485	2.15M	RE(c2), IM(c2), RE(wa1[i]), IM(wa1[i]));
486	2.15M	ComplexMult(&RE(ch[ah+i+2l1ido]), &IM(ch[ah+i+2l1ido]),
487	2.15M	RE(c3), IM(c3), RE(wa2[i]), IM(wa2[i]));
488	2.15M	ComplexMult(&RE(ch[ah+i+3l1ido]), &IM(ch[ah+i+3l1ido]),
489	2.15M	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	2.15M	}
499	248k	}
500	17.4k	}
501	20.8k	}
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.5k	{
507	59.5k	static real_t tr11 = FRAC_CONST(0.309016994374947);
508	59.5k	static real_t ti11 = FRAC_CONST(0.951056516295154);
509	59.5k	static real_t tr12 = FRAC_CONST(-0.809016994374947);
510	59.5k	static real_t ti12 = FRAC_CONST(0.587785252292473);
511	59.5k	uint16_t k, ac, ah;
512	59.5k	complex_t c2, c3, c4, c5, t2, t3, t4, t5;
513	59.5k	(void)wa1;
514	59.5k	(void)wa2;
515	59.5k	(void)wa3;
516	59.5k	(void)wa4;
517
518	59.5k	if (ido == 1)
519	59.5k	{
520	59.5k	if (isign == 1)
521	55.9k	{
522	3.40M	for (k = 0; k < l1; k++)
523	3.34M	{
524	3.34M	ac = 5*k + 1;
525	3.34M	ah = k;
526
527	3.34M	RE(t2) = RE(cc[ac]) + RE(cc[ac+3]);
528	3.34M	IM(t2) = IM(cc[ac]) + IM(cc[ac+3]);
529	3.34M	RE(t3) = RE(cc[ac+1]) + RE(cc[ac+2]);
530	3.34M	IM(t3) = IM(cc[ac+1]) + IM(cc[ac+2]);
531	3.34M	RE(t4) = RE(cc[ac+1]) - RE(cc[ac+2]);
532	3.34M	IM(t4) = IM(cc[ac+1]) - IM(cc[ac+2]);
533	3.34M	RE(t5) = RE(cc[ac]) - RE(cc[ac+3]);
534	3.34M	IM(t5) = IM(cc[ac]) - IM(cc[ac+3]);
535
536	3.34M	RE(ch[ah]) = RE(cc[ac-1]) + RE(t2) + RE(t3);
537	3.34M	IM(ch[ah]) = IM(cc[ac-1]) + IM(t2) + IM(t3);
538
539	3.34M	RE(c2) = RE(cc[ac-1]) + MUL_F(RE(t2),tr11) + MUL_F(RE(t3),tr12);
540	3.34M	IM(c2) = IM(cc[ac-1]) + MUL_F(IM(t2),tr11) + MUL_F(IM(t3),tr12);
541	3.34M	RE(c3) = RE(cc[ac-1]) + MUL_F(RE(t2),tr12) + MUL_F(RE(t3),tr11);
542	3.34M	IM(c3) = IM(cc[ac-1]) + MUL_F(IM(t2),tr12) + MUL_F(IM(t3),tr11);
543
544	3.34M	ComplexMult(&RE(c5), &RE(c4),
545	3.34M	ti11, ti12, RE(t5), RE(t4));
546	3.34M	ComplexMult(&IM(c5), &IM(c4),
547	3.34M	ti11, ti12, IM(t5), IM(t4));
548
549	3.34M	RE(ch[ah+l1]) = RE(c2) - IM(c5);
550	3.34M	IM(ch[ah+l1]) = IM(c2) + RE(c5);
551	3.34M	RE(ch[ah+2*l1]) = RE(c3) - IM(c4);
552	3.34M	IM(ch[ah+2*l1]) = IM(c3) + RE(c4);
553	3.34M	RE(ch[ah+3*l1]) = RE(c3) + IM(c4);
554	3.34M	IM(ch[ah+3*l1]) = IM(c3) - RE(c4);
555	3.34M	RE(ch[ah+4*l1]) = RE(c2) + IM(c5);
556	3.34M	IM(ch[ah+4*l1]) = IM(c2) - RE(c5);
557	3.34M	}
558	55.9k	} else {
559	343k	for (k = 0; k < l1; k++)
560	339k	{
561	339k	ac = 5*k + 1;
562	339k	ah = k;
563
564	339k	RE(t2) = RE(cc[ac]) + RE(cc[ac+3]);
565	339k	IM(t2) = IM(cc[ac]) + IM(cc[ac+3]);
566	339k	RE(t3) = RE(cc[ac+1]) + RE(cc[ac+2]);
567	339k	IM(t3) = IM(cc[ac+1]) + IM(cc[ac+2]);
568	339k	RE(t4) = RE(cc[ac+1]) - RE(cc[ac+2]);
569	339k	IM(t4) = IM(cc[ac+1]) - IM(cc[ac+2]);
570	339k	RE(t5) = RE(cc[ac]) - RE(cc[ac+3]);
571	339k	IM(t5) = IM(cc[ac]) - IM(cc[ac+3]);
572
573	339k	RE(ch[ah]) = RE(cc[ac-1]) + RE(t2) + RE(t3);
574	339k	IM(ch[ah]) = IM(cc[ac-1]) + IM(t2) + IM(t3);
575
576	339k	RE(c2) = RE(cc[ac-1]) + MUL_F(RE(t2),tr11) + MUL_F(RE(t3),tr12);
577	339k	IM(c2) = IM(cc[ac-1]) + MUL_F(IM(t2),tr11) + MUL_F(IM(t3),tr12);
578	339k	RE(c3) = RE(cc[ac-1]) + MUL_F(RE(t2),tr12) + MUL_F(RE(t3),tr11);
579	339k	IM(c3) = IM(cc[ac-1]) + MUL_F(IM(t2),tr12) + MUL_F(IM(t3),tr11);
580
581	339k	ComplexMult(&RE(c4), &RE(c5),
582	339k	ti12, ti11, RE(t5), RE(t4));
583	339k	ComplexMult(&IM(c4), &IM(c5),
584	339k	ti12, ti11, IM(t5), IM(t4));
585
586	339k	RE(ch[ah+l1]) = RE(c2) + IM(c5);
587	339k	IM(ch[ah+l1]) = IM(c2) - RE(c5);
588	339k	RE(ch[ah+2*l1]) = RE(c3) + IM(c4);
589	339k	IM(ch[ah+2*l1]) = IM(c3) - RE(c4);
590	339k	RE(ch[ah+3*l1]) = RE(c3) - IM(c4);
591	339k	IM(ch[ah+3*l1]) = IM(c3) + RE(c4);
592	339k	RE(ch[ah+4*l1]) = RE(c2) - IM(c5);
593	339k	IM(ch[ah+4*l1]) = IM(c2) + RE(c5);
594	339k	}
595	3.56k	}
596	59.5k	} 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.5k	}
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	392k	{
744	392k	uint16_t i;
745	392k	uint16_t k1, l1, l2;
746	392k	uint16_t na, nf, ip, iw, ix2, ix3, ix4, ido;
747
748	392k	nf = ifac[1];
749	392k	na = 0;
750	392k	l1 = 1;
751	392k	iw = 0;
752
753	2.08M	for (k1 = 2; k1 <= nf+1; k1++)
754	1.69M	{
755	1.69M	ip = ifac[k1];
756	1.69M	l2 = ip*l1;
757	1.69M	ido = n / l2;
758
759	1.69M	switch (ip)
760	1.69M	{
761	1.32M	case 4:
762	1.32M	ix2 = iw + ido;
763	1.32M	ix3 = ix2 + ido;
764
765	1.32M	if (na == 0)
766	706k	passf4pos((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw], &wa[ix2], &wa[ix3]);
767	619k	else
768	619k	passf4pos((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)ch, c, &wa[iw], &wa[ix2], &wa[ix3]);
769
770	1.32M	na = 1 - na;
771	1.32M	break;
772	257k	case 2:
773	257k	if (na == 0)
774	257k	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	257k	na = 1 - na;
779	257k	break;
780	55.9k	case 3:
781	55.9k	ix2 = iw + ido;
782
783	55.9k	if (na == 0)
784	24.5k	passf3((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw], &wa[ix2], isign);
785	31.4k	else
786	31.4k	passf3((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)ch, c, &wa[iw], &wa[ix2], isign);
787
788	55.9k	na = 1 - na;
789	55.9k	break;
790	55.9k	case 5:
791	55.9k	ix2 = iw + ido;
792	55.9k	ix3 = ix2 + ido;
793	55.9k	ix4 = ix3 + ido;
794
795	55.9k	if (na == 0)
796	54.9k	passf5((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw], &wa[ix2], &wa[ix3], &wa[ix4], isign);
797	1.06k	else
798	1.06k	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	55.9k	na = 1 - na;
801	55.9k	break;
802	1.69M	}
803
804	1.69M	l1 = l2;
805	1.69M	iw += (ip-1) * ido;
806	1.69M	}
807
808	392k	if (na == 0)
809	1.98k	return;
810
811	139M	for (i = 0; i < n; i++)
812	139M	{
813	139M	RE(c[i]) = RE(ch[i]);
814	139M	IM(c[i]) = IM(ch[i]);
815	139M	}
816	390k	}
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	6.99k	{
822	6.99k	uint16_t i;
823	6.99k	uint16_t k1, l1, l2;
824	6.99k	uint16_t na, nf, ip, iw, ix2, ix3, ix4, ido;
825
826	6.99k	nf = ifac[1];
827	6.99k	na = 0;
828	6.99k	l1 = 1;
829	6.99k	iw = 0;
830
831	41.8k	for (k1 = 2; k1 <= nf+1; k1++)
832	34.8k	{
833	34.8k	ip = ifac[k1];
834	34.8k	l2 = ip*l1;
835	34.8k	ido = n / l2;
836
837	34.8k	switch (ip)
838	34.8k	{
839	20.8k	case 4:
840	20.8k	ix2 = iw + ido;
841	20.8k	ix3 = ix2 + ido;
842
843	20.8k	if (na == 0)
844	10.4k	passf4neg((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw], &wa[ix2], &wa[ix3]);
845	10.4k	else
846	10.4k	passf4neg((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)ch, c, &wa[iw], &wa[ix2], &wa[ix3]);
847
848	20.8k	na = 1 - na;
849	20.8k	break;
850	6.85k	case 2:
851	6.85k	if (na == 0)
852	6.85k	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	6.85k	na = 1 - na;
857	6.85k	break;
858	3.56k	case 3:
859	3.56k	ix2 = iw + ido;
860
861	3.56k	if (na == 0)
862	45	passf3((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw], &wa[ix2], isign);
863	3.51k	else
864	3.51k	passf3((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)ch, c, &wa[iw], &wa[ix2], isign);
865
866	3.56k	na = 1 - na;
867	3.56k	break;
868	3.56k	case 5:
869	3.56k	ix2 = iw + ido;
870	3.56k	ix3 = ix2 + ido;
871	3.56k	ix4 = ix3 + ido;
872
873	3.56k	if (na == 0)
874	3.51k	passf5((const uint16_t)ido, (const uint16_t)l1, (const complex_t*)c, ch, &wa[iw], &wa[ix2], &wa[ix3], &wa[ix4], isign);
875	45	else
876	45	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	3.56k	na = 1 - na;
879	3.56k	break;
880	34.8k	}
881
882	34.8k	l1 = l2;
883	34.8k	iw += (ip-1) * ido;
884	34.8k	}
885
886	6.99k	if (na == 0)
887	139	return;
888
889	3.40M	for (i = 0; i < n; i++)
890	3.39M	{
891	3.39M	RE(c[i]) = RE(ch[i]);
892	3.39M	IM(c[i]) = IM(ch[i]);
893	3.39M	}
894	6.85k	}
895
896		void cfftf(cfft_info cfft, complex_t c)
897	6.99k	{
898	6.99k	cfftf1neg(cfft->n, c, cfft->work, (const uint16_t)cfft->ifac, (const complex_t)cfft->tab, -1);
899	6.99k	}
900
901		void cfftb(cfft_info cfft, complex_t c)
902	392k	{
903	392k	cfftf1pos(cfft->n, c, cfft->work, (const uint16_t)cfft->ifac, (const complex_t)cfft->tab, +1);
904	392k	}
905
906		static void cffti1(uint16_t n, complex_t wa, uint16_t ifac)
907	27.8k	{
908	27.8k	static uint16_t ntryh[4] = {3, 4, 2, 5};
909		#ifndef FIXED_POINT
910		real_t arg, argh, argld, fi;
911		uint16_t ido, ipm;
912		uint16_t i1, k1, l1, l2;
913		uint16_t ld, ii, ip;
914		#endif
915	27.8k	uint16_t ntry = 0, i, j;
916	27.8k	uint16_t ib;
917	27.8k	uint16_t nf, nl, nq, nr;
918
919	27.8k	nl = n;
920	27.8k	nf = 0;
921	27.8k	j = 0;
922
923	73.0k	startloop:
924	73.0k	j++;
925
926	73.0k	if (j <= 4)
927	73.0k	ntry = ntryh[j-1];
928	0	else
929	0	ntry += 2;
930
931	73.0k	do
932	156k	{
933	156k	nq = nl / ntry;
934	156k	nr = nl - ntry*nq;
935
936	156k	if (nr != 0)
937	45.2k	goto startloop;
938
939	111k	nf++;
940	111k	ifac[nf+1] = ntry;
941	111k	nl = nq;
942
943	111k	if (ntry == 2 && nf != 1)
944	9.26k	{
945	44.6k	for (i = 2; i <= nf; i++)
946	35.4k	{
947	35.4k	ib = nf - i + 2;
948	35.4k	ifac[ib+1] = ifac[ib];
949	35.4k	}
950	9.26k	ifac[2] = 2;
951	9.26k	}
952	111k	} while (nl != 1);
953
954	27.8k	ifac[0] = n;
955	27.8k	ifac[1] = nf;
956
957		#ifndef FIXED_POINT
958		argh = (real_t)2.0*(real_t)M_PI / (real_t)n;
959		i = 0;
960		l1 = 1;
961
962		for (k1 = 1; k1 <= nf; k1++)
963		{
964		ip = ifac[k1+1];
965		ld = 0;
966		l2 = l1*ip;
967		ido = n / l2;
968		ipm = ip - 1;
969
970		for (j = 0; j < ipm; j++)
971		{
972		i1 = i;
973		RE(wa[i]) = 1.0;
974		IM(wa[i]) = 0.0;
975		ld += l1;
976		fi = 0;
977		argld = ld*argh;
978
979		for (ii = 0; ii < ido; ii++)
980		{
981		i++;
982		fi++;
983		arg = fi * argld;
984		RE(wa[i]) = (real_t)cos(arg);
985		#if 1
986		IM(wa[i]) = (real_t)sin(arg);
987		#else
988		IM(wa[i]) = (real_t)-sin(arg);
989		#endif
990		}
991
992		if (ip > 5)
993		{
994		RE(wa[i1]) = RE(wa[i]);
995		IM(wa[i1]) = IM(wa[i]);
996		}
997		}
998		l1 = l2;
999		}
1000		#else // FIXED_POINT
1001	27.8k	(void)wa; /* whoa! does it work for FIXED_POINT? */
1002	27.8k	#endif
1003	27.8k	}
1004
1005		cfft_info *cffti(uint16_t n)
1006	27.8k	{
1007	27.8k	cfft_info cfft = (cfft_info)faad_malloc(sizeof(cfft_info));
1008
1009	27.8k	cfft->n = n;
1010	27.8k	cfft->work = (complex_t)faad_malloc(nsizeof(complex_t));
1011
1012		#ifndef FIXED_POINT
1013		cfft->tab = (complex_t)faad_malloc(nsizeof(complex_t));
1014
1015		cffti1(n, cfft->tab, cfft->ifac);
1016		#else
1017	27.8k	cffti1(n, NULL, cfft->ifac);
1018
1019	27.8k	switch (n)
1020	27.8k	{
1021	7.63k	case 64: cfft->tab = (complex_t*)cfft_tab_64; break;
1022	7.63k	case 512: cfft->tab = (complex_t*)cfft_tab_512; break;
1023	0	#ifdef LD_DEC
1024	7.63k	case 256: cfft->tab = (complex_t*)cfft_tab_256; break;
1025	0	#endif
1026
1027	0	#ifdef ALLOW_SMALL_FRAMELENGTH
1028	1.63k	case 60: cfft->tab = (complex_t*)cfft_tab_60; break;
1029	1.63k	case 480: cfft->tab = (complex_t*)cfft_tab_480; break;
1030	0	#ifdef LD_DEC
1031	1.63k	case 240: cfft->tab = (complex_t*)cfft_tab_240; break;
1032	0	#endif
1033	0	#endif
1034	0	case 128: cfft->tab = (complex_t*)cfft_tab_128; break;
1035	27.8k	}
1036	27.8k	#endif
1037
1038	27.8k	return cfft;
1039	27.8k	}
1040
1041		void cfftu(cfft_info *cfft)
1042	27.8k	{
1043	27.8k	if (cfft->work) faad_free(cfft->work);
1044		#ifndef FIXED_POINT
1045		if (cfft->tab) faad_free(cfft->tab);
1046		#endif
1047
1048	27.8k	if (cfft) faad_free(cfft);
1049	27.8k	}
1050

Coverage Report

Created: 2025-07-23 06:30