annotate src/fftw-3.3.8/dft/problem.c @ 83:ae30d91d2ffe

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