annotate src/fftw-3.3.5/dft/problem.c @ 58:eab3b14ddc95

Further win32 build updates
author Chris Cannam
date Mon, 09 Jan 2017 13:51:38 +0000
parents 2cd0e3b3e1fd
children
rev   line source
Chris@42 1 /*
Chris@42 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42 4 *
Chris@42 5 * This program is free software; you can redistribute it and/or modify
Chris@42 6 * it under the terms of the GNU General Public License as published by
Chris@42 7 * the Free Software Foundation; either version 2 of the License, or
Chris@42 8 * (at your option) any later version.
Chris@42 9 *
Chris@42 10 * This program is distributed in the hope that it will be useful,
Chris@42 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@42 13 * GNU General Public License for more details.
Chris@42 14 *
Chris@42 15 * You should have received a copy of the GNU General Public License
Chris@42 16 * along with this program; if not, write to the Free Software
Chris@42 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@42 18 *
Chris@42 19 */
Chris@42 20
Chris@42 21
Chris@42 22 #include "dft.h"
Chris@42 23 #include <stddef.h>
Chris@42 24
Chris@42 25 static void destroy(problem *ego_)
Chris@42 26 {
Chris@42 27 problem_dft *ego = (problem_dft *) ego_;
Chris@42 28 X(tensor_destroy2)(ego->vecsz, ego->sz);
Chris@42 29 X(ifree)(ego_);
Chris@42 30 }
Chris@42 31
Chris@42 32 static void hash(const problem *p_, md5 *m)
Chris@42 33 {
Chris@42 34 const problem_dft *p = (const problem_dft *) p_;
Chris@42 35 X(md5puts)(m, "dft");
Chris@42 36 X(md5int)(m, p->ri == p->ro);
Chris@42 37 X(md5INT)(m, p->ii - p->ri);
Chris@42 38 X(md5INT)(m, p->io - p->ro);
Chris@42 39 X(md5int)(m, X(ialignment_of)(p->ri));
Chris@42 40 X(md5int)(m, X(ialignment_of)(p->ii));
Chris@42 41 X(md5int)(m, X(ialignment_of)(p->ro));
Chris@42 42 X(md5int)(m, X(ialignment_of)(p->io));
Chris@42 43 X(tensor_md5)(m, p->sz);
Chris@42 44 X(tensor_md5)(m, p->vecsz);
Chris@42 45 }
Chris@42 46
Chris@42 47 static void print(const problem *ego_, printer *p)
Chris@42 48 {
Chris@42 49 const problem_dft *ego = (const problem_dft *) ego_;
Chris@42 50 p->print(p, "(dft %d %d %d %D %D %T %T)",
Chris@42 51 ego->ri == ego->ro,
Chris@42 52 X(ialignment_of)(ego->ri),
Chris@42 53 X(ialignment_of)(ego->ro),
Chris@42 54 (INT)(ego->ii - ego->ri),
Chris@42 55 (INT)(ego->io - ego->ro),
Chris@42 56 ego->sz,
Chris@42 57 ego->vecsz);
Chris@42 58 }
Chris@42 59
Chris@42 60 static void zero(const problem *ego_)
Chris@42 61 {
Chris@42 62 const problem_dft *ego = (const problem_dft *) ego_;
Chris@42 63 tensor *sz = X(tensor_append)(ego->vecsz, ego->sz);
Chris@42 64 X(dft_zerotens)(sz, UNTAINT(ego->ri), UNTAINT(ego->ii));
Chris@42 65 X(tensor_destroy)(sz);
Chris@42 66 }
Chris@42 67
Chris@42 68 static const problem_adt padt =
Chris@42 69 {
Chris@42 70 PROBLEM_DFT,
Chris@42 71 hash,
Chris@42 72 zero,
Chris@42 73 print,
Chris@42 74 destroy
Chris@42 75 };
Chris@42 76
Chris@42 77 problem *X(mkproblem_dft)(const tensor *sz, const tensor *vecsz,
Chris@42 78 R *ri, R *ii, R *ro, R *io)
Chris@42 79 {
Chris@42 80 problem_dft *ego;
Chris@42 81
Chris@42 82 /* enforce pointer equality if untainted pointers are equal */
Chris@42 83 if (UNTAINT(ri) == UNTAINT(ro))
Chris@42 84 ri = ro = JOIN_TAINT(ri, ro);
Chris@42 85 if (UNTAINT(ii) == UNTAINT(io))
Chris@42 86 ii = io = JOIN_TAINT(ii, io);
Chris@42 87
Chris@42 88 /* more correctness conditions: */
Chris@42 89 A(TAINTOF(ri) == TAINTOF(ii));
Chris@42 90 A(TAINTOF(ro) == TAINTOF(io));
Chris@42 91
Chris@42 92 A(X(tensor_kosherp)(sz));
Chris@42 93 A(X(tensor_kosherp)(vecsz));
Chris@42 94
Chris@42 95 if (ri == ro || ii == io) {
Chris@42 96 /* If either real or imag pointers are in place, both must be. */
Chris@42 97 if (ri != ro || ii != io || !X(tensor_inplace_locations)(sz, vecsz))
Chris@42 98 return X(mkproblem_unsolvable)();
Chris@42 99 }
Chris@42 100
Chris@42 101 ego = (problem_dft *)X(mkproblem)(sizeof(problem_dft), &padt);
Chris@42 102
Chris@42 103 ego->sz = X(tensor_compress)(sz);
Chris@42 104 ego->vecsz = X(tensor_compress_contiguous)(vecsz);
Chris@42 105 ego->ri = ri;
Chris@42 106 ego->ii = ii;
Chris@42 107 ego->ro = ro;
Chris@42 108 ego->io = io;
Chris@42 109
Chris@42 110 A(FINITE_RNK(ego->sz->rnk));
Chris@42 111 return &(ego->super);
Chris@42 112 }
Chris@42 113
Chris@42 114 /* Same as X(mkproblem_dft), but also destroy input tensors. */
Chris@42 115 problem *X(mkproblem_dft_d)(tensor *sz, tensor *vecsz,
Chris@42 116 R *ri, R *ii, R *ro, R *io)
Chris@42 117 {
Chris@42 118 problem *p = X(mkproblem_dft)(sz, vecsz, ri, ii, ro, io);
Chris@42 119 X(tensor_destroy2)(vecsz, sz);
Chris@42 120 return p;
Chris@42 121 }