|
Chris@42
|
1 /*
|
|
Chris@42
|
2 * Copyright (c) 2003, 2007-14 Matteo Frigo
|
|
Chris@42
|
3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
|
|
Chris@42
|
4 *
|
|
Chris@42
|
5 * This program is free software; you can redistribute it and/or modify
|
|
Chris@42
|
6 * it under the terms of the GNU General Public License as published by
|
|
Chris@42
|
7 * the Free Software Foundation; either version 2 of the License, or
|
|
Chris@42
|
8 * (at your option) any later version.
|
|
Chris@42
|
9 *
|
|
Chris@42
|
10 * This program is distributed in the hope that it will be useful,
|
|
Chris@42
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Chris@42
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
Chris@42
|
13 * GNU General Public License for more details.
|
|
Chris@42
|
14 *
|
|
Chris@42
|
15 * You should have received a copy of the GNU General Public License
|
|
Chris@42
|
16 * along with this program; if not, write to the Free Software
|
|
Chris@42
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
Chris@42
|
18 *
|
|
Chris@42
|
19 */
|
|
Chris@42
|
20
|
|
Chris@42
|
21 /* common routines for Cooley-Tukey algorithms */
|
|
Chris@42
|
22
|
|
Chris@42
|
23 #include "ifftw.h"
|
|
Chris@42
|
24
|
|
Chris@42
|
25 #define POW2P(n) (((n) > 0) && (((n) & ((n) - 1)) == 0))
|
|
Chris@42
|
26
|
|
Chris@42
|
27 /* TRUE if radix-r is ugly for size n */
|
|
Chris@42
|
28 int X(ct_uglyp)(INT min_n, INT v, INT n, INT r)
|
|
Chris@42
|
29 {
|
|
Chris@42
|
30 return (n <= min_n) || (POW2P(n) && (v * (n / r)) <= 4);
|
|
Chris@42
|
31 }
|
