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
|
/*
* 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
*
*/
#include "codelet-dft.h"
#include "t.h"
static int okp(const ct_desc *d,
const R *rio, const R *iio,
int ios, int vs, int m, int dist, const planner *plnr)
{
UNUSED(rio); UNUSED(iio); UNUSED(m); UNUSED(plnr);
return (1
&& (!d->s1 || (d->s1 == ios))
&& (!d->s2 || (d->s2 == vs))
&& (!d->dist || (d->dist == dist))
);
}
const ct_genus GENUS = { okp, 1 };
|
