annotate src/fftw-3.3.3/dft/problem.c @ 73:02caadb7509e

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