Chris@10: /*
Chris@10:  * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10:  * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10:  *
Chris@10:  * This program is free software; you can redistribute it and/or modify
Chris@10:  * it under the terms of the GNU General Public License as published by
Chris@10:  * the Free Software Foundation; either version 2 of the License, or
Chris@10:  * (at your option) any later version.
Chris@10:  *
Chris@10:  * This program is distributed in the hope that it will be useful,
Chris@10:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@10:  * GNU General Public License for more details.
Chris@10:  *
Chris@10:  * You should have received a copy of the GNU General Public License
Chris@10:  * along with this program; if not, write to the Free Software
Chris@10:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@10:  *
Chris@10:  */
Chris@10: 
Chris@10: #include "api.h"
Chris@10: #include "rdft.h"
Chris@10: 
Chris@10: rdft_kind *X(map_r2r_kind)(int rank, const X(r2r_kind) * kind)
Chris@10: {
Chris@10:      int i;
Chris@10:      rdft_kind *k;
Chris@10: 
Chris@10:      A(FINITE_RNK(rank));
Chris@10:      k = (rdft_kind *) MALLOC(rank * sizeof(rdft_kind), PROBLEMS);
Chris@10:      for (i = 0; i < rank; ++i) {
Chris@10: 	  rdft_kind m;
Chris@10:           switch (kind[i]) {
Chris@10: 	      case FFTW_R2HC: m = R2HC; break;
Chris@10: 	      case FFTW_HC2R: m = HC2R; break;
Chris@10: 	      case FFTW_DHT: m = DHT; break;
Chris@10: 	      case FFTW_REDFT00: m = REDFT00; break;
Chris@10: 	      case FFTW_REDFT01: m = REDFT01; break;
Chris@10: 	      case FFTW_REDFT10: m = REDFT10; break;
Chris@10: 	      case FFTW_REDFT11: m = REDFT11; break;
Chris@10: 	      case FFTW_RODFT00: m = RODFT00; break;
Chris@10: 	      case FFTW_RODFT01: m = RODFT01; break;
Chris@10: 	      case FFTW_RODFT10: m = RODFT10; break;
Chris@10: 	      case FFTW_RODFT11: m = RODFT11; break;
Chris@10: 	      default: m = R2HC; A(0);
Chris@10:           }
Chris@10: 	  k[i] = m;
Chris@10:      }
Chris@10:      return k;
Chris@10: }