annotate src/fftw-3.3.3/dft/problem.c @ 169:223a55898ab9 tip default

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