|
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 RDFTs (nothing to do) */
|
|
Chris@42
|
23
|
|
Chris@42
|
24 #include "rdft.h"
|
|
Chris@42
|
25
|
|
Chris@42
|
26 static void apply(const plan *ego_, R *I, R *O)
|
|
Chris@42
|
27 {
|
|
Chris@42
|
28 UNUSED(ego_);
|
|
Chris@42
|
29 UNUSED(I);
|
|
Chris@42
|
30 UNUSED(O);
|
|
Chris@42
|
31 }
|
|
Chris@42
|
32
|
|
Chris@42
|
33 static int applicable(const solver *ego_, const problem *p_)
|
|
Chris@42
|
34 {
|
|
Chris@42
|
35 const problem_rdft *p = (const problem_rdft *) p_;
|
|
Chris@42
|
36 UNUSED(ego_);
|
|
Chris@42
|
37 return 0
|
|
Chris@42
|
38 /* case 1 : -infty vector rank */
|
|
Chris@42
|
39 || (p->vecsz->rnk == RNK_MINFTY)
|
|
Chris@42
|
40
|
|
Chris@42
|
41 /* case 2 : rank-0 in-place rdft */
|
|
Chris@42
|
42 || (1
|
|
Chris@42
|
43 && p->sz->rnk == 0
|
|
Chris@42
|
44 && FINITE_RNK(p->vecsz->rnk)
|
|
Chris@42
|
45 && p->O == p->I
|
|
Chris@42
|
46 && X(tensor_inplace_strides)(p->vecsz)
|
|
Chris@42
|
47 );
|
|
Chris@42
|
48 }
|
|
Chris@42
|
49
|
|
Chris@42
|
50 static void print(const plan *ego, printer *p)
|
|
Chris@42
|
51 {
|
|
Chris@42
|
52 UNUSED(ego);
|
|
Chris@42
|
53 p->print(p, "(rdft-nop)");
|
|
Chris@42
|
54 }
|
|
Chris@42
|
55
|
|
Chris@42
|
56 static plan *mkplan(const solver *ego, const problem *p, planner *plnr)
|
|
Chris@42
|
57 {
|
|
Chris@42
|
58 static const plan_adt padt = {
|
|
Chris@42
|
59 X(rdft_solve), X(null_awake), print, X(plan_null_destroy)
|
|
Chris@42
|
60 };
|
|
Chris@42
|
61 plan_rdft *pln;
|
|
Chris@42
|
62
|
|
Chris@42
|
63 UNUSED(plnr);
|
|
Chris@42
|
64
|
|
Chris@42
|
65 if (!applicable(ego, p))
|
|
Chris@42
|
66 return (plan *) 0;
|
|
Chris@42
|
67 pln = MKPLAN_RDFT(plan_rdft, &padt, apply);
|
|
Chris@42
|
68 X(ops_zero)(&pln->super.ops);
|
|
Chris@42
|
69
|
|
Chris@42
|
70 return &(pln->super);
|
|
Chris@42
|
71 }
|
|
Chris@42
|
72
|
|
Chris@42
|
73 static solver *mksolver(void)
|
|
Chris@42
|
74 {
|
|
Chris@42
|
75 static const solver_adt sadt = { PROBLEM_RDFT, mkplan, 0 };
|
|
Chris@42
|
76 return MKSOLVER(solver, &sadt);
|
|
Chris@42
|
77 }
|
|
Chris@42
|
78
|
|
Chris@42
|
79 void X(rdft_nop_register)(planner *p)
|
|
Chris@42
|
80 {
|
|
Chris@42
|
81 REGISTER_SOLVER(p, mksolver());
|
|
Chris@42
|
82 }
|
