annotate src/fftw-3.3.5/api/map-r2r-kind.c @ 127:7867fa7e1b6b

Current fftw source
author Chris Cannam <cannam@all-day-breakfast.com>
date Tue, 18 Oct 2016 13:40:26 +0100
parents
children
rev   line source
cannam@127 1 /*
cannam@127 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@127 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@127 4 *
cannam@127 5 * This program is free software; you can redistribute it and/or modify
cannam@127 6 * it under the terms of the GNU General Public License as published by
cannam@127 7 * the Free Software Foundation; either version 2 of the License, or
cannam@127 8 * (at your option) any later version.
cannam@127 9 *
cannam@127 10 * This program is distributed in the hope that it will be useful,
cannam@127 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@127 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
cannam@127 13 * GNU General Public License for more details.
cannam@127 14 *
cannam@127 15 * You should have received a copy of the GNU General Public License
cannam@127 16 * along with this program; if not, write to the Free Software
cannam@127 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
cannam@127 18 *
cannam@127 19 */
cannam@127 20
cannam@127 21 #include "api.h"
cannam@127 22 #include "rdft.h"
cannam@127 23
cannam@127 24 rdft_kind *X(map_r2r_kind)(int rank, const X(r2r_kind) * kind)
cannam@127 25 {
cannam@127 26 int i;
cannam@127 27 rdft_kind *k;
cannam@127 28
cannam@127 29 A(FINITE_RNK(rank));
cannam@127 30 k = (rdft_kind *) MALLOC((unsigned)rank * sizeof(rdft_kind), PROBLEMS);
cannam@127 31 for (i = 0; i < rank; ++i) {
cannam@127 32 rdft_kind m;
cannam@127 33 switch (kind[i]) {
cannam@127 34 case FFTW_R2HC: m = R2HC; break;
cannam@127 35 case FFTW_HC2R: m = HC2R; break;
cannam@127 36 case FFTW_DHT: m = DHT; break;
cannam@127 37 case FFTW_REDFT00: m = REDFT00; break;
cannam@127 38 case FFTW_REDFT01: m = REDFT01; break;
cannam@127 39 case FFTW_REDFT10: m = REDFT10; break;
cannam@127 40 case FFTW_REDFT11: m = REDFT11; break;
cannam@127 41 case FFTW_RODFT00: m = RODFT00; break;
cannam@127 42 case FFTW_RODFT01: m = RODFT01; break;
cannam@127 43 case FFTW_RODFT10: m = RODFT10; break;
cannam@127 44 case FFTW_RODFT11: m = RODFT11; break;
cannam@127 45 default: m = R2HC; A(0);
cannam@127 46 }
cannam@127 47 k[i] = m;
cannam@127 48 }
cannam@127 49 return k;
cannam@127 50 }