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