Chris@19: /*
Chris@19:  * Copyright (c) 2001 Matteo Frigo
Chris@19:  * Copyright (c) 2001 Massachusetts Institute of Technology
Chris@19:  *
Chris@19:  * This program is free software; you can redistribute it and/or modify
Chris@19:  * it under the terms of the GNU General Public License as published by
Chris@19:  * the Free Software Foundation; either version 2 of the License, or
Chris@19:  * (at your option) any later version.
Chris@19:  *
Chris@19:  * This program is distributed in the hope that it will be useful,
Chris@19:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@19:  * GNU General Public License for more details.
Chris@19:  *
Chris@19:  * You should have received a copy of the GNU General Public License
Chris@19:  * along with this program; if not, write to the Free Software
Chris@19:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@19:  *
Chris@19:  */
Chris@19: 
Chris@19: 
Chris@19: #include "config.h"
Chris@19: #include "bench.h"
Chris@19: #include <stdio.h>
Chris@19: #include <stdlib.h>
Chris@19: #include <string.h>
Chris@19: #include <ctype.h>
Chris@19: 
Chris@19: int always_pad_real = 0; /* by default, only pad in-place case */
Chris@19: 
Chris@19: typedef enum {
Chris@19:      SAME, PADDED, HALFISH
Chris@19: } n_transform;
Chris@19: 
Chris@19: /* funny transformations for last dimension of PROBLEM_REAL */
Chris@19: static int transform_n(int n, n_transform nt)
Chris@19: {
Chris@19:      switch (nt) {
Chris@19: 	 case SAME: return n;
Chris@19: 	 case PADDED: return 2*(n/2+1);
Chris@19: 	 case HALFISH: return (n/2+1);
Chris@19: 	 default: BENCH_ASSERT(0); return 0;
Chris@19:      }
Chris@19: }
Chris@19: 
Chris@19: /* do what I mean */
Chris@19: static bench_tensor *dwim(bench_tensor *t, bench_iodim **last_iodim,
Chris@19: 			  n_transform nti, n_transform nto,
Chris@19: 			  bench_iodim *dt)
Chris@19: {
Chris@19:      int i;
Chris@19:      bench_iodim *d, *d1;
Chris@19: 
Chris@19:      if (!FINITE_RNK(t->rnk) || t->rnk < 1)
Chris@19: 	  return t;
Chris@19: 
Chris@19:      i = t->rnk;
Chris@19:      d1 = *last_iodim;
Chris@19: 
Chris@19:      while (--i >= 0) {
Chris@19: 	  d = t->dims + i;
Chris@19: 	  if (!d->is) 
Chris@19: 	       d->is = d1->is * transform_n(d1->n, d1==dt ? nti : SAME); 
Chris@19: 	  if (!d->os) 
Chris@19: 	       d->os = d1->os * transform_n(d1->n, d1==dt ? nto : SAME); 
Chris@19: 	  d1 = d;
Chris@19:      }
Chris@19: 
Chris@19:      *last_iodim = d1;
Chris@19:      return t;
Chris@19: }
Chris@19: 
Chris@19: static void transpose_tensor(bench_tensor *t)
Chris@19: {
Chris@19:      if (!FINITE_RNK(t->rnk) || t->rnk < 2)
Chris@19:           return;
Chris@19: 
Chris@19:      t->dims[0].os = t->dims[1].os;
Chris@19:      t->dims[1].os = t->dims[0].os * t->dims[0].n;
Chris@19: }
Chris@19: 
Chris@19: static const char *parseint(const char *s, int *n)
Chris@19: {
Chris@19:      int sign = 1;
Chris@19: 
Chris@19:      *n = 0;
Chris@19: 
Chris@19:      if (*s == '-') { 
Chris@19: 	  sign = -1;
Chris@19: 	  ++s;
Chris@19:      } else if (*s == '+') { 
Chris@19: 	  sign = +1; 
Chris@19: 	  ++s; 
Chris@19:      }
Chris@19: 
Chris@19:      BENCH_ASSERT(isdigit(*s));
Chris@19:      while (isdigit(*s)) {
Chris@19: 	  *n = *n * 10 + (*s - '0');
Chris@19: 	  ++s;
Chris@19:      }
Chris@19:      
Chris@19:      *n *= sign;
Chris@19: 
Chris@19:      if (*s == 'k' || *s == 'K') {
Chris@19: 	  *n *= 1024;
Chris@19: 	  ++s;
Chris@19:      }
Chris@19: 
Chris@19:      if (*s == 'm' || *s == 'M') {
Chris@19: 	  *n *= 1024 * 1024;
Chris@19: 	  ++s;
Chris@19:      }
Chris@19: 
Chris@19:      return s;
Chris@19: }
Chris@19: 
Chris@19: struct dimlist { bench_iodim car; r2r_kind_t k; struct dimlist *cdr; };
Chris@19: 
Chris@19: static const char *parsetensor(const char *s, bench_tensor **tp,
Chris@19: 			       r2r_kind_t **k)
Chris@19: {
Chris@19:      struct dimlist *l = 0, *m;
Chris@19:      bench_tensor *t;
Chris@19:      int rnk = 0;
Chris@19: 
Chris@19:  L1:
Chris@19:      m = (struct dimlist *)bench_malloc(sizeof(struct dimlist));
Chris@19:      /* nconc onto l */
Chris@19:      m->cdr = l; l = m;
Chris@19:      ++rnk; 
Chris@19: 
Chris@19:      s = parseint(s, &m->car.n);
Chris@19: 
Chris@19:      if (*s == ':') {
Chris@19: 	  /* read input stride */
Chris@19: 	  ++s;
Chris@19: 	  s = parseint(s, &m->car.is);
Chris@19: 	  if (*s == ':') {
Chris@19: 	       /* read output stride */
Chris@19: 	       ++s;
Chris@19: 	       s = parseint(s, &m->car.os);
Chris@19: 	  } else {
Chris@19: 	       /* default */
Chris@19: 	       m->car.os = m->car.is;
Chris@19: 	  }
Chris@19:      } else {
Chris@19: 	  m->car.is = 0;
Chris@19: 	  m->car.os = 0;
Chris@19:      }
Chris@19: 
Chris@19:      if (*s == 'f' || *s == 'F') {
Chris@19: 	  m->k = R2R_R2HC;
Chris@19: 	  ++s;
Chris@19:      }
Chris@19:      else if (*s == 'b' || *s == 'B') {
Chris@19: 	  m->k = R2R_HC2R;
Chris@19: 	  ++s;
Chris@19:      }
Chris@19:      else if (*s == 'h' || *s == 'H') {
Chris@19: 	  m->k = R2R_DHT;
Chris@19: 	  ++s;
Chris@19:      }
Chris@19:      else if (*s == 'e' || *s == 'E' || *s == 'o' || *s == 'O') {
Chris@19: 	  char c = *(s++);
Chris@19: 	  int ab;
Chris@19: 
Chris@19: 	  s = parseint(s, &ab);
Chris@19: 
Chris@19: 	  if (c == 'e' || c == 'E') {
Chris@19: 	       if (ab == 0)
Chris@19: 		    m->k = R2R_REDFT00;
Chris@19: 	       else if (ab == 1)
Chris@19: 		    m->k = R2R_REDFT01;
Chris@19: 	       else if (ab == 10)
Chris@19: 		    m->k = R2R_REDFT10;
Chris@19: 	       else if (ab == 11)
Chris@19: 		    m->k = R2R_REDFT11;
Chris@19: 	       else
Chris@19: 		    BENCH_ASSERT(0);
Chris@19: 	  }
Chris@19: 	  else {
Chris@19: 	       if (ab == 0)
Chris@19: 		    m->k = R2R_RODFT00;
Chris@19: 	       else if (ab == 1)
Chris@19: 		    m->k = R2R_RODFT01;
Chris@19: 	       else if (ab == 10)
Chris@19: 		    m->k = R2R_RODFT10;
Chris@19: 	       else if (ab == 11)
Chris@19: 		    m->k = R2R_RODFT11;
Chris@19: 	       else
Chris@19: 		    BENCH_ASSERT(0);
Chris@19: 	  }
Chris@19:      }
Chris@19:      else
Chris@19: 	  m->k = R2R_R2HC;
Chris@19: 
Chris@19:      if (*s == 'x' || *s == 'X') {
Chris@19: 	  ++s;
Chris@19: 	  goto L1;
Chris@19:      }
Chris@19:      
Chris@19:      /* now we have a dimlist.  Build bench_tensor, etc. */
Chris@19: 
Chris@19:      if (k && rnk > 0) {
Chris@19: 	  int i;
Chris@19: 	  *k = (r2r_kind_t *) bench_malloc(sizeof(r2r_kind_t) * rnk);
Chris@19: 	  for (m = l, i = rnk - 1; i >= 0; --i, m = m->cdr) {
Chris@19: 	       BENCH_ASSERT(m);
Chris@19: 	       (*k)[i] = m->k;
Chris@19: 	  }
Chris@19:      }
Chris@19: 
Chris@19:      t = mktensor(rnk);
Chris@19:      while (--rnk >= 0) {
Chris@19: 	  bench_iodim *d = t->dims + rnk;
Chris@19: 	  BENCH_ASSERT(l);
Chris@19: 	  m = l; l = m->cdr;
Chris@19: 	  d->n = m->car.n;
Chris@19: 	  d->is = m->car.is;
Chris@19: 	  d->os = m->car.os;
Chris@19: 	  bench_free(m);
Chris@19:      }
Chris@19: 
Chris@19:      *tp = t;
Chris@19:      return s;
Chris@19: }
Chris@19: 
Chris@19: /* parse a problem description, return a problem */
Chris@19: bench_problem *problem_parse(const char *s)
Chris@19: {
Chris@19:      bench_problem *p;
Chris@19:      bench_iodim last_iodim0 = {1,1,1}, *last_iodim = &last_iodim0;
Chris@19:      bench_iodim *sz_last_iodim;
Chris@19:      bench_tensor *sz;
Chris@19:      n_transform nti = SAME, nto = SAME;
Chris@19:      int transpose = 0;
Chris@19: 
Chris@19:      p = (bench_problem *) bench_malloc(sizeof(bench_problem));
Chris@19:      p->kind = PROBLEM_COMPLEX;
Chris@19:      p->k = 0;
Chris@19:      p->sign = -1;
Chris@19:      p->in = p->out = 0;
Chris@19:      p->inphys = p->outphys = 0;
Chris@19:      p->iphyssz = p->ophyssz = 0;
Chris@19:      p->in_place = 0;
Chris@19:      p->destroy_input = 0;
Chris@19:      p->split = 0;
Chris@19:      p->userinfo = 0;
Chris@19:      p->scrambled_in = p->scrambled_out = 0;
Chris@19:      p->sz = p->vecsz = 0;
Chris@19:      p->ini = p->outi = 0;
Chris@19:      p->pstring = (char *) bench_malloc(sizeof(char) * (strlen(s) + 1));
Chris@19:      strcpy(p->pstring, s);
Chris@19: 
Chris@19:  L1:
Chris@19:      switch (tolower(*s)) {
Chris@19: 	 case 'i': p->in_place = 1; ++s; goto L1;
Chris@19: 	 case 'o': p->in_place = 0; ++s; goto L1;
Chris@19: 	 case 'd': p->destroy_input = 1; ++s; goto L1;
Chris@19: 	 case '/': p->split = 1; ++s; goto L1;
Chris@19: 	 case 'f': 
Chris@19: 	 case '-': p->sign = -1; ++s; goto L1;
Chris@19: 	 case 'b': 
Chris@19: 	 case '+': p->sign = 1; ++s; goto L1;
Chris@19: 	 case 'r': p->kind = PROBLEM_REAL; ++s; goto L1;
Chris@19: 	 case 'c': p->kind = PROBLEM_COMPLEX; ++s; goto L1;
Chris@19: 	 case 'k': p->kind = PROBLEM_R2R; ++s; goto L1;
Chris@19: 	 case 't': transpose = 1; ++s; goto L1;
Chris@19: 	      
Chris@19: 	 /* hack for MPI: */
Chris@19: 	 case '[': p->scrambled_in = 1; ++s; goto L1;
Chris@19: 	 case ']': p->scrambled_out = 1; ++s; goto L1;
Chris@19: 
Chris@19: 	 default : ;
Chris@19:      }
Chris@19: 
Chris@19:      s = parsetensor(s, &sz, p->kind == PROBLEM_R2R ? &p->k : 0);
Chris@19: 
Chris@19:      if (p->kind == PROBLEM_REAL) {
Chris@19: 	  if (p->sign < 0) {
Chris@19: 	       nti = p->in_place || always_pad_real ? PADDED : SAME;
Chris@19: 	       nto = HALFISH;
Chris@19: 	  }
Chris@19: 	  else {
Chris@19: 	       nti = HALFISH;
Chris@19: 	       nto = p->in_place || always_pad_real ? PADDED : SAME;
Chris@19: 	  }
Chris@19:      }
Chris@19: 
Chris@19:      sz_last_iodim = sz->dims + sz->rnk - 1;
Chris@19:      if (*s == '*') { /* "external" vector */
Chris@19: 	  ++s;
Chris@19: 	  p->sz = dwim(sz, &last_iodim, nti, nto, sz_last_iodim);
Chris@19: 	  s = parsetensor(s, &sz, 0);
Chris@19: 	  p->vecsz = dwim(sz, &last_iodim, nti, nto, sz_last_iodim);
Chris@19:      } else if (*s == 'v' || *s == 'V') { /* "internal" vector */
Chris@19: 	  bench_tensor *vecsz;
Chris@19: 	  ++s;
Chris@19: 	  s = parsetensor(s, &vecsz, 0);
Chris@19: 	  p->vecsz = dwim(vecsz, &last_iodim, nti, nto, sz_last_iodim);
Chris@19: 	  p->sz = dwim(sz, &last_iodim, nti, nto, sz_last_iodim);
Chris@19:      } else {
Chris@19: 	  p->sz = dwim(sz, &last_iodim, nti, nto, sz_last_iodim);
Chris@19: 	  p->vecsz = mktensor(0);
Chris@19:      }
Chris@19: 
Chris@19:      if (transpose) {
Chris@19: 	  transpose_tensor(p->sz);
Chris@19: 	  transpose_tensor(p->vecsz);
Chris@19:      }
Chris@19: 
Chris@19:      if (!p->in_place)
Chris@19: 	  p->out = ((bench_real *) p->in) + (1 << 20);  /* whatever */
Chris@19: 
Chris@19:      BENCH_ASSERT(p->sz && p->vecsz);
Chris@19:      BENCH_ASSERT(!*s);
Chris@19:      return p;
Chris@19: }
Chris@19: 
Chris@19: void problem_destroy(bench_problem *p)
Chris@19: {
Chris@19:      BENCH_ASSERT(p);
Chris@19:      problem_free(p);
Chris@19:      bench_free0(p->k);
Chris@19:      bench_free0(p->pstring);
Chris@19:      bench_free(p);
Chris@19: }
Chris@19: