1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
/*
* Copyright (c) 2003 Matteo Frigo
* Copyright (c) 2003 Massachusetts Institute of Technology
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
/* $Id: nop.c,v 1.1 2008/10/17 06:11:08 scuri Exp $ */
/* plans for vrank -infty DFTs (nothing to do) */
#include "dft.h"
static void apply(const plan *ego_, R *ri, R *ii, R *ro, R *io)
{
UNUSED(ego_);
UNUSED(ri);
UNUSED(ii);
UNUSED(ro);
UNUSED(io);
}
static int applicable(const solver *ego_, const problem *p_)
{
UNUSED(ego_);
if (DFTP(p_)) {
const problem_dft *p = (const problem_dft *) p_;
return 0
/* case 1 : -infty vector rank */
|| (!FINITE_RNK(p->vecsz->rnk))
/* case 2 : rank-0 in-place dft */
|| (1
&& p->sz->rnk == 0
&& FINITE_RNK(p->vecsz->rnk)
&& p->ro == p->ri
&& X(tensor_inplace_strides)(p->vecsz)
);
}
return 0;
}
static void print(const plan *ego, printer *p)
{
UNUSED(ego);
p->print(p, "(dft-nop)");
}
static plan *mkplan(const solver *ego, const problem *p, planner *plnr)
{
static const plan_adt padt = {
X(dft_solve), X(null_awake), print, X(plan_null_destroy)
};
plan_dft *pln;
UNUSED(plnr);
if (!applicable(ego, p))
return (plan *) 0;
pln = MKPLAN_DFT(plan_dft, &padt, apply);
X(ops_zero)(&pln->super.ops);
return &(pln->super);
}
static solver *mksolver(void)
{
static const solver_adt sadt = { mkplan };
return MKSOLVER(solver, &sadt);
}
void X(dft_nop_register)(planner *p)
{
REGISTER_SOLVER(p, mksolver());
}
|
