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: #include "api.h" cannam@127: #include "rdft.h" cannam@127: cannam@127: rdft_kind *X(map_r2r_kind)(int rank, const X(r2r_kind) * kind) cannam@127: { cannam@127: int i; cannam@127: rdft_kind *k; cannam@127: cannam@127: A(FINITE_RNK(rank)); cannam@127: k = (rdft_kind *) MALLOC((unsigned)rank * sizeof(rdft_kind), PROBLEMS); cannam@127: for (i = 0; i < rank; ++i) { cannam@127: rdft_kind m; cannam@127: switch (kind[i]) { cannam@127: case FFTW_R2HC: m = R2HC; break; cannam@127: case FFTW_HC2R: m = HC2R; break; cannam@127: case FFTW_DHT: m = DHT; break; cannam@127: case FFTW_REDFT00: m = REDFT00; break; cannam@127: case FFTW_REDFT01: m = REDFT01; break; cannam@127: case FFTW_REDFT10: m = REDFT10; break; cannam@127: case FFTW_REDFT11: m = REDFT11; break; cannam@127: case FFTW_RODFT00: m = RODFT00; break; cannam@127: case FFTW_RODFT01: m = RODFT01; break; cannam@127: case FFTW_RODFT10: m = RODFT10; break; cannam@127: case FFTW_RODFT11: m = RODFT11; break; cannam@127: default: m = R2HC; A(0); cannam@127: } cannam@127: k[i] = m; cannam@127: } cannam@127: return k; cannam@127: }