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
89
90
|
/*
* 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: nop2.c,v 1.1 2008/10/17 06:11:29 scuri Exp $ */
/* plans for vrank -infty RDFT2s (nothing to do), as well as in-place
rank-0 HC2R. Note that in-place rank-0 R2HC is *not* a no-op, because
we have to set the imaginary parts of the output to zero. */
#include "rdft.h"
static void apply(const plan *ego_, R *r, R *rio, R *iio)
{
UNUSED(ego_);
UNUSED(r);
UNUSED(rio);
UNUSED(iio);
}
static int applicable(const solver *ego_, const problem *p_)
{
UNUSED(ego_);
if (RDFT2P(p_)) {
const problem_rdft2 *p = (const problem_rdft2 *) p_;
return(0
/* case 1 : -infty vector rank */
|| (p->vecsz->rnk == RNK_MINFTY)
/* case 2 : rank-0 in-place HC2R rdft */
|| (1
&& p->kind == HC2R
&& p->sz->rnk == 0
&& FINITE_RNK(p->vecsz->rnk)
&& (p->r == p->rio || p->r == p->iio)
&& X(rdft2_inplace_strides)(p, RNK_MINFTY)
));
}
return 0;
}
static void print(const plan *ego, printer *p)
{
UNUSED(ego);
p->print(p, "(rdft2-nop)");
}
static plan *mkplan(const solver *ego, const problem *p, planner *plnr)
{
static const plan_adt padt = {
X(rdft2_solve), X(null_awake), print, X(plan_null_destroy)
};
plan_rdft2 *pln;
UNUSED(plnr);
if (!applicable(ego, p))
return (plan *) 0;
pln = MKPLAN_RDFT2(plan_rdft2, &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(rdft2_nop_register)(planner *p)
{
REGISTER_SOLVER(p, mksolver());
}
|
