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: 
cannam@127: #include "dft.h"
cannam@127: #include <stddef.h>
cannam@127: 
cannam@127: static void destroy(problem *ego_)
cannam@127: {
cannam@127:      problem_dft *ego = (problem_dft *) ego_;
cannam@127:      X(tensor_destroy2)(ego->vecsz, ego->sz);
cannam@127:      X(ifree)(ego_);
cannam@127: }
cannam@127: 
cannam@127: static void hash(const problem *p_, md5 *m)
cannam@127: {
cannam@127:      const problem_dft *p = (const problem_dft *) p_;
cannam@127:      X(md5puts)(m, "dft");
cannam@127:      X(md5int)(m, p->ri == p->ro);
cannam@127:      X(md5INT)(m, p->ii - p->ri);
cannam@127:      X(md5INT)(m, p->io - p->ro);
cannam@127:      X(md5int)(m, X(ialignment_of)(p->ri));
cannam@127:      X(md5int)(m, X(ialignment_of)(p->ii));
cannam@127:      X(md5int)(m, X(ialignment_of)(p->ro));
cannam@127:      X(md5int)(m, X(ialignment_of)(p->io));
cannam@127:      X(tensor_md5)(m, p->sz);
cannam@127:      X(tensor_md5)(m, p->vecsz);
cannam@127: }
cannam@127: 
cannam@127: static void print(const problem *ego_, printer *p)
cannam@127: {
cannam@127:      const problem_dft *ego = (const problem_dft *) ego_;
cannam@127:      p->print(p, "(dft %d %d %d %D %D %T %T)", 
cannam@127: 	      ego->ri == ego->ro,
cannam@127: 	      X(ialignment_of)(ego->ri),
cannam@127: 	      X(ialignment_of)(ego->ro),
cannam@127: 	      (INT)(ego->ii - ego->ri), 
cannam@127: 	      (INT)(ego->io - ego->ro),
cannam@127: 	      ego->sz,
cannam@127: 	      ego->vecsz);
cannam@127: }
cannam@127: 
cannam@127: static void zero(const problem *ego_)
cannam@127: {
cannam@127:      const problem_dft *ego = (const problem_dft *) ego_;
cannam@127:      tensor *sz = X(tensor_append)(ego->vecsz, ego->sz);
cannam@127:      X(dft_zerotens)(sz, UNTAINT(ego->ri), UNTAINT(ego->ii));
cannam@127:      X(tensor_destroy)(sz);
cannam@127: }
cannam@127: 
cannam@127: static const problem_adt padt =
cannam@127: {
cannam@127:      PROBLEM_DFT,
cannam@127:      hash,
cannam@127:      zero,
cannam@127:      print,
cannam@127:      destroy
cannam@127: };
cannam@127: 
cannam@127: problem *X(mkproblem_dft)(const tensor *sz, const tensor *vecsz,
cannam@127: 			  R *ri, R *ii, R *ro, R *io)
cannam@127: {
cannam@127:      problem_dft *ego;
cannam@127: 
cannam@127:      /* enforce pointer equality if untainted pointers are equal */
cannam@127:      if (UNTAINT(ri) == UNTAINT(ro))
cannam@127: 	  ri = ro = JOIN_TAINT(ri, ro);
cannam@127:      if (UNTAINT(ii) == UNTAINT(io))
cannam@127: 	  ii = io = JOIN_TAINT(ii, io);
cannam@127: 
cannam@127:      /* more correctness conditions: */
cannam@127:      A(TAINTOF(ri) == TAINTOF(ii));
cannam@127:      A(TAINTOF(ro) == TAINTOF(io));
cannam@127: 
cannam@127:      A(X(tensor_kosherp)(sz));
cannam@127:      A(X(tensor_kosherp)(vecsz));
cannam@127: 
cannam@127:      if (ri == ro || ii == io) {
cannam@127: 	  /* If either real or imag pointers are in place, both must be. */
cannam@127: 	  if (ri != ro || ii != io || !X(tensor_inplace_locations)(sz, vecsz))
cannam@127: 	       return X(mkproblem_unsolvable)();
cannam@127:      }
cannam@127: 
cannam@127:      ego = (problem_dft *)X(mkproblem)(sizeof(problem_dft), &padt);
cannam@127: 
cannam@127:      ego->sz = X(tensor_compress)(sz);
cannam@127:      ego->vecsz = X(tensor_compress_contiguous)(vecsz);
cannam@127:      ego->ri = ri;
cannam@127:      ego->ii = ii;
cannam@127:      ego->ro = ro;
cannam@127:      ego->io = io;
cannam@127: 
cannam@127:      A(FINITE_RNK(ego->sz->rnk));
cannam@127:      return &(ego->super);
cannam@127: }
cannam@127: 
cannam@127: /* Same as X(mkproblem_dft), but also destroy input tensors. */
cannam@127: problem *X(mkproblem_dft_d)(tensor *sz, tensor *vecsz,
cannam@127: 			    R *ri, R *ii, R *ro, R *io)
cannam@127: {
cannam@127:      problem *p = X(mkproblem_dft)(sz, vecsz, ri, ii, ro, io);
cannam@127:      X(tensor_destroy2)(vecsz, sz);
cannam@127:      return p;
cannam@127: }