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
|
/*
* 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"
#include "n1b.h"
#if HAVE_SIMD
static int okp(const kdft_desc *d,
const R *ri, const R *ii, const R *ro, const R *io,
INT is, INT os, INT vl, INT ivs, INT ovs,
const planner *plnr)
{
return (RIGHT_CPU()
&& ALIGNED(ii)
&& ALIGNED(io)
&& !NO_SIMDP(plnr)
&& SIMD_STRIDE_OK(is)
&& SIMD_STRIDE_OK(os)
&& SIMD_VSTRIDE_OK(ivs)
&& SIMD_VSTRIDE_OK(ovs)
&& ri == ii + 1
&& ro == io + 1
&& (vl % VL) == 0
&& (!d->is || (d->is == is))
&& (!d->os || (d->os == os))
&& (!d->ivs || (d->ivs == ivs))
&& (!d->ovs || (d->ovs == ovs))
);
}
const kdft_genus GENUS = { okp, VL };
#endif
|
