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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
|
/*
* Copyright (c) 2003, 2006 Matteo Frigo
* Copyright (c) 2003, 2006 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
*
*/
#include "codelet-dft.h"
#if HAVE_SIMD
#include "simd.h"
static int okp_common(const ct_desc *d,
const R *rio, const R *iio,
INT ios, INT vs, INT m, INT mb, INT me, INT dist,
const planner *plnr)
{
UNUSED(rio);
UNUSED(iio);
return (RIGHT_CPU()
&& !NO_SIMDP(plnr)
&& SIMD_STRIDE_OKA(ios)
&& SIMD_VSTRIDE_OKA(dist)
&& (m % VL) == 0
&& (mb % VL) == 0
&& (me % VL) == 0
&& (!d->s1 || (d->s1 == ios))
&& (!d->s2 || (d->s2 == vs))
&& (!d->dist || (d->dist == dist))
);
}
static int okp_t1f(const ct_desc *d,
const R *rio, const R *iio,
INT ios, INT vs, INT m, INT mb, INT me, INT dist,
const planner *plnr)
{
return okp_common(d, rio, iio, ios, vs, m, mb, me, dist, plnr)
&& iio == rio + 1
&& ALIGNEDA(rio);
}
extern const ct_genus X(dft_t1fsimd_genus);
const ct_genus X(dft_t1fsimd_genus) = { okp_t1f, VL };
static int okp_t1b(const ct_desc *d,
const R *rio, const R *iio,
INT ios, INT vs, INT m, INT mb, INT me, INT dist,
const planner *plnr)
{
return okp_common(d, rio, iio, ios, vs, m, mb, me, dist, plnr)
&& rio == iio + 1
&& ALIGNEDA(iio);
}
extern const ct_genus X(dft_t1bsimd_genus);
const ct_genus X(dft_t1bsimd_genus) = { okp_t1b, VL };
/* use t2* codelets only when n = m*radix is small, because
t2* codelets use ~2n twiddle factors (instead of ~n) */
static int small_enough(const ct_desc *d, INT m)
{
return m * d->radix <= 16384;
}
static int okp_t2f(const ct_desc *d,
const R *rio, const R *iio,
INT ios, INT vs, INT m, INT mb, INT me, INT dist,
const planner *plnr)
{
return okp_t1f(d, rio, iio, ios, vs, m, mb, me, dist, plnr)
&& small_enough(d, m);
}
extern const ct_genus X(dft_t2fsimd_genus);
const ct_genus X(dft_t2fsimd_genus) = { okp_t2f, VL };
static int okp_t2b(const ct_desc *d,
const R *rio, const R *iio,
INT ios, INT vs, INT m, INT mb, INT me, INT dist,
const planner *plnr)
{
return okp_t1b(d, rio, iio, ios, vs, m, mb, me, dist, plnr)
&& small_enough(d, m);
}
extern const ct_genus X(dft_t2bsimd_genus);
const ct_genus X(dft_t2bsimd_genus) = { okp_t2b, VL };
#endif /* HAVE_SIMD */
|
