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