|
Chris@42
|
1 /*
|
|
Chris@42
|
2 * Copyright (c) 2003, 2007-14 Matteo Frigo
|
|
Chris@42
|
3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
|
|
Chris@42
|
4 *
|
|
Chris@42
|
5 * This program is free software; you can redistribute it and/or modify
|
|
Chris@42
|
6 * it under the terms of the GNU General Public License as published by
|
|
Chris@42
|
7 * the Free Software Foundation; either version 2 of the License, or
|
|
Chris@42
|
8 * (at your option) any later version.
|
|
Chris@42
|
9 *
|
|
Chris@42
|
10 * This program is distributed in the hope that it will be useful,
|
|
Chris@42
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Chris@42
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
Chris@42
|
13 * GNU General Public License for more details.
|
|
Chris@42
|
14 *
|
|
Chris@42
|
15 * You should have received a copy of the GNU General Public License
|
|
Chris@42
|
16 * along with this program; if not, write to the Free Software
|
|
Chris@42
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
Chris@42
|
18 *
|
|
Chris@42
|
19 */
|
|
Chris@42
|
20
|
|
Chris@42
|
21
|
|
Chris@42
|
22 /* plans for vrank -infty RDFT2s (nothing to do), as well as in-place
|
|
Chris@42
|
23 rank-0 HC2R. Note that in-place rank-0 R2HC is *not* a no-op, because
|
|
Chris@42
|
24 we have to set the imaginary parts of the output to zero. */
|
|
Chris@42
|
25
|
|
Chris@42
|
26 #include "rdft.h"
|
|
Chris@42
|
27
|
|
Chris@42
|
28 static void apply(const plan *ego_, R *r0, R *r1, R *cr, R *ci)
|
|
Chris@42
|
29 {
|
|
Chris@42
|
30 UNUSED(ego_);
|
|
Chris@42
|
31 UNUSED(r0);
|
|
Chris@42
|
32 UNUSED(r1);
|
|
Chris@42
|
33 UNUSED(cr);
|
|
Chris@42
|
34 UNUSED(ci);
|
|
Chris@42
|
35 }
|
|
Chris@42
|
36
|
|
Chris@42
|
37 static int applicable(const solver *ego_, const problem *p_)
|
|
Chris@42
|
38 {
|
|
Chris@42
|
39 const problem_rdft2 *p = (const problem_rdft2 *) p_;
|
|
Chris@42
|
40 UNUSED(ego_);
|
|
Chris@42
|
41
|
|
Chris@42
|
42 return(0
|
|
Chris@42
|
43 /* case 1 : -infty vector rank */
|
|
Chris@42
|
44 || (p->vecsz->rnk == RNK_MINFTY)
|
|
Chris@42
|
45
|
|
Chris@42
|
46 /* case 2 : rank-0 in-place rdft, except that
|
|
Chris@42
|
47 R2HC is not a no-op because it sets the imaginary
|
|
Chris@42
|
48 part to 0 */
|
|
Chris@42
|
49 || (1
|
|
Chris@42
|
50 && p->kind != R2HC
|
|
Chris@42
|
51 && p->sz->rnk == 0
|
|
Chris@42
|
52 && FINITE_RNK(p->vecsz->rnk)
|
|
Chris@42
|
53 && (p->r0 == p->cr)
|
|
Chris@42
|
54 && X(rdft2_inplace_strides)(p, RNK_MINFTY)
|
|
Chris@42
|
55 ));
|
|
Chris@42
|
56 }
|
|
Chris@42
|
57
|
|
Chris@42
|
58 static void print(const plan *ego, printer *p)
|
|
Chris@42
|
59 {
|
|
Chris@42
|
60 UNUSED(ego);
|
|
Chris@42
|
61 p->print(p, "(rdft2-nop)");
|
|
Chris@42
|
62 }
|
|
Chris@42
|
63
|
|
Chris@42
|
64 static plan *mkplan(const solver *ego, const problem *p, planner *plnr)
|
|
Chris@42
|
65 {
|
|
Chris@42
|
66 static const plan_adt padt = {
|
|
Chris@42
|
67 X(rdft2_solve), X(null_awake), print, X(plan_null_destroy)
|
|
Chris@42
|
68 };
|
|
Chris@42
|
69 plan_rdft2 *pln;
|
|
Chris@42
|
70
|
|
Chris@42
|
71 UNUSED(plnr);
|
|
Chris@42
|
72
|
|
Chris@42
|
73 if (!applicable(ego, p))
|
|
Chris@42
|
74 return (plan *) 0;
|
|
Chris@42
|
75 pln = MKPLAN_RDFT2(plan_rdft2, &padt, apply);
|
|
Chris@42
|
76 X(ops_zero)(&pln->super.ops);
|
|
Chris@42
|
77
|
|
Chris@42
|
78 return &(pln->super);
|
|
Chris@42
|
79 }
|
|
Chris@42
|
80
|
|
Chris@42
|
81 static solver *mksolver(void)
|
|
Chris@42
|
82 {
|
|
Chris@42
|
83 static const solver_adt sadt = { PROBLEM_RDFT2, mkplan, 0 };
|
|
Chris@42
|
84 return MKSOLVER(solver, &sadt);
|
|
Chris@42
|
85 }
|
|
Chris@42
|
86
|
|
Chris@42
|
87 void X(rdft2_nop_register)(planner *p)
|
|
Chris@42
|
88 {
|
|
Chris@42
|
89 REGISTER_SOLVER(p, mksolver());
|
|
Chris@42
|
90 }
|
