cannam@127
|
1 /*
|
cannam@127
|
2 * Copyright (c) 2003, 2007-14 Matteo Frigo
|
cannam@127
|
3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
|
cannam@127
|
4 *
|
cannam@127
|
5 * This program is free software; you can redistribute it and/or modify
|
cannam@127
|
6 * it under the terms of the GNU General Public License as published by
|
cannam@127
|
7 * the Free Software Foundation; either version 2 of the License, or
|
cannam@127
|
8 * (at your option) any later version.
|
cannam@127
|
9 *
|
cannam@127
|
10 * This program is distributed in the hope that it will be useful,
|
cannam@127
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
cannam@127
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
cannam@127
|
13 * GNU General Public License for more details.
|
cannam@127
|
14 *
|
cannam@127
|
15 * You should have received a copy of the GNU General Public License
|
cannam@127
|
16 * along with this program; if not, write to the Free Software
|
cannam@127
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
cannam@127
|
18 *
|
cannam@127
|
19 */
|
cannam@127
|
20
|
cannam@127
|
21 #include "mpi-rdft2.h"
|
cannam@127
|
22
|
cannam@127
|
23 static void destroy(problem *ego_)
|
cannam@127
|
24 {
|
cannam@127
|
25 problem_mpi_rdft2 *ego = (problem_mpi_rdft2 *) ego_;
|
cannam@127
|
26 XM(dtensor_destroy)(ego->sz);
|
cannam@127
|
27 MPI_Comm_free(&ego->comm);
|
cannam@127
|
28 X(ifree)(ego_);
|
cannam@127
|
29 }
|
cannam@127
|
30
|
cannam@127
|
31 static void hash(const problem *p_, md5 *m)
|
cannam@127
|
32 {
|
cannam@127
|
33 const problem_mpi_rdft2 *p = (const problem_mpi_rdft2 *) p_;
|
cannam@127
|
34 int i;
|
cannam@127
|
35 X(md5puts)(m, "mpi-rdft2");
|
cannam@127
|
36 X(md5int)(m, p->I == p->O);
|
cannam@127
|
37 /* don't include alignment -- may differ between processes
|
cannam@127
|
38 X(md5int)(m, X(ialignment_of)(p->I));
|
cannam@127
|
39 X(md5int)(m, X(ialignment_of)(p->O));
|
cannam@127
|
40 ... note that applicability of MPI plans does not depend
|
cannam@127
|
41 on alignment (although optimality may, in principle). */
|
cannam@127
|
42 XM(dtensor_md5)(m, p->sz);
|
cannam@127
|
43 X(md5INT)(m, p->vn);
|
cannam@127
|
44 X(md5int)(m, p->kind);
|
cannam@127
|
45 X(md5int)(m, p->flags);
|
cannam@127
|
46 MPI_Comm_size(p->comm, &i); X(md5int)(m, i);
|
cannam@127
|
47 A(XM(md5_equal)(*m, p->comm));
|
cannam@127
|
48 }
|
cannam@127
|
49
|
cannam@127
|
50 static void print(const problem *ego_, printer *p)
|
cannam@127
|
51 {
|
cannam@127
|
52 const problem_mpi_rdft2 *ego = (const problem_mpi_rdft2 *) ego_;
|
cannam@127
|
53 int i;
|
cannam@127
|
54 p->print(p, "(mpi-rdft2 %d %d %d ",
|
cannam@127
|
55 ego->I == ego->O,
|
cannam@127
|
56 X(ialignment_of)(ego->I),
|
cannam@127
|
57 X(ialignment_of)(ego->O));
|
cannam@127
|
58 XM(dtensor_print)(ego->sz, p);
|
cannam@127
|
59 p->print(p, " %D %d %d", ego->vn, (int) ego->kind, ego->flags);
|
cannam@127
|
60 MPI_Comm_size(ego->comm, &i); p->print(p, " %d)", i);
|
cannam@127
|
61 }
|
cannam@127
|
62
|
cannam@127
|
63 static void zero(const problem *ego_)
|
cannam@127
|
64 {
|
cannam@127
|
65 const problem_mpi_rdft2 *ego = (const problem_mpi_rdft2 *) ego_;
|
cannam@127
|
66 R *I = ego->I;
|
cannam@127
|
67 dtensor *sz;
|
cannam@127
|
68 INT i, N;
|
cannam@127
|
69 int my_pe;
|
cannam@127
|
70
|
cannam@127
|
71 sz = XM(dtensor_copy)(ego->sz);
|
cannam@127
|
72 sz->dims[sz->rnk - 1].n = sz->dims[sz->rnk - 1].n / 2 + 1;
|
cannam@127
|
73 MPI_Comm_rank(ego->comm, &my_pe);
|
cannam@127
|
74 N = 2 * ego->vn * XM(total_block)(sz, IB, my_pe);
|
cannam@127
|
75 XM(dtensor_destroy)(sz);
|
cannam@127
|
76 for (i = 0; i < N; ++i) I[i] = K(0.0);
|
cannam@127
|
77 }
|
cannam@127
|
78
|
cannam@127
|
79 static const problem_adt padt =
|
cannam@127
|
80 {
|
cannam@127
|
81 PROBLEM_MPI_RDFT2,
|
cannam@127
|
82 hash,
|
cannam@127
|
83 zero,
|
cannam@127
|
84 print,
|
cannam@127
|
85 destroy
|
cannam@127
|
86 };
|
cannam@127
|
87
|
cannam@127
|
88 problem *XM(mkproblem_rdft2)(const dtensor *sz, INT vn,
|
cannam@127
|
89 R *I, R *O,
|
cannam@127
|
90 MPI_Comm comm,
|
cannam@127
|
91 rdft_kind kind,
|
cannam@127
|
92 unsigned flags)
|
cannam@127
|
93 {
|
cannam@127
|
94 problem_mpi_rdft2 *ego =
|
cannam@127
|
95 (problem_mpi_rdft2 *)X(mkproblem)(sizeof(problem_mpi_rdft2), &padt);
|
cannam@127
|
96 int n_pes;
|
cannam@127
|
97
|
cannam@127
|
98 A(XM(dtensor_validp)(sz) && FINITE_RNK(sz->rnk) && sz->rnk > 1);
|
cannam@127
|
99 MPI_Comm_size(comm, &n_pes);
|
cannam@127
|
100 A(vn >= 0);
|
cannam@127
|
101 A(kind == R2HC || kind == HC2R);
|
cannam@127
|
102
|
cannam@127
|
103 /* enforce pointer equality if untainted pointers are equal */
|
cannam@127
|
104 if (UNTAINT(I) == UNTAINT(O))
|
cannam@127
|
105 I = O = JOIN_TAINT(I, O);
|
cannam@127
|
106
|
cannam@127
|
107 ego->sz = XM(dtensor_canonical)(sz, 0);
|
cannam@127
|
108 #ifdef FFTW_DEBUG
|
cannam@127
|
109 ego->sz->dims[sz->rnk - 1].n = sz->dims[sz->rnk - 1].n / 2 + 1;
|
cannam@127
|
110 A(n_pes >= XM(num_blocks_total)(ego->sz, IB)
|
cannam@127
|
111 && n_pes >= XM(num_blocks_total)(ego->sz, OB));
|
cannam@127
|
112 ego->sz->dims[sz->rnk - 1].n = sz->dims[sz->rnk - 1].n;
|
cannam@127
|
113 #endif
|
cannam@127
|
114
|
cannam@127
|
115 ego->vn = vn;
|
cannam@127
|
116 ego->I = I;
|
cannam@127
|
117 ego->O = O;
|
cannam@127
|
118 ego->kind = kind;
|
cannam@127
|
119
|
cannam@127
|
120 /* We only support TRANSPOSED_OUT for r2c and TRANSPOSED_IN for
|
cannam@127
|
121 c2r transforms. */
|
cannam@127
|
122
|
cannam@127
|
123 ego->flags = flags;
|
cannam@127
|
124
|
cannam@127
|
125 MPI_Comm_dup(comm, &ego->comm);
|
cannam@127
|
126
|
cannam@127
|
127 return &(ego->super);
|
cannam@127
|
128 }
|
cannam@127
|
129
|
cannam@127
|
130 problem *XM(mkproblem_rdft2_d)(dtensor *sz, INT vn,
|
cannam@127
|
131 R *I, R *O,
|
cannam@127
|
132 MPI_Comm comm,
|
cannam@127
|
133 rdft_kind kind,
|
cannam@127
|
134 unsigned flags)
|
cannam@127
|
135 {
|
cannam@127
|
136 problem *p = XM(mkproblem_rdft2)(sz, vn, I, O, comm, kind, flags);
|
cannam@127
|
137 XM(dtensor_destroy)(sz);
|
cannam@127
|
138 return p;
|
cannam@127
|
139 }
|