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