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 105 106 107 108 109 110 111 112 113 114 115 116 117 118
|
/*
* 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
*
*/
/* This file was automatically generated --- DO NOT EDIT */
/* Generated on Sat Jul 1 14:24:42 EDT 2006 */
#include "codelet-dft.h"
#ifdef HAVE_FMA
/* Generated by: ../../../genfft/gen_notw_c -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name n1fv_3 -include n1f.h */
/*
* This function contains 6 FP additions, 4 FP multiplications,
* (or, 3 additions, 1 multiplications, 3 fused multiply/add),
* 11 stack variables, and 6 memory accesses
*/
/*
* Generator Id's :
* $Id: algsimp.ml,v 1.9 2006-02-12 23:34:12 athena Exp $
* $Id: fft.ml,v 1.4 2006-01-05 03:04:27 stevenj Exp $
* $Id: gen_notw_c.ml,v 1.17 2006-02-12 23:34:12 athena Exp $
*/
#include "n1f.h"
static void n1fv_3(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
{
DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
INT i;
const R *xi;
R *xo;
xi = ri;
xo = ro;
for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(is), MAKE_VOLATILE_STRIDE(os)) {
V T1, T2, T3, T6, T4, T5;
T1 = LD(&(xi[0]), ivs, &(xi[0]));
T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
T3 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
T6 = VMUL(LDK(KP866025403), VSUB(T3, T2));
T4 = VADD(T2, T3);
T5 = VFNMS(LDK(KP500000000), T4, T1);
ST(&(xo[0]), VADD(T1, T4), ovs, &(xo[0]));
ST(&(xo[WS(os, 1)]), VFMAI(T6, T5), ovs, &(xo[WS(os, 1)]));
ST(&(xo[WS(os, 2)]), VFNMSI(T6, T5), ovs, &(xo[0]));
}
}
static const kdft_desc desc = { 3, "n1fv_3", {3, 1, 3, 0}, &GENUS, 0, 0, 0, 0 };
void X(codelet_n1fv_3) (planner *p) {
X(kdft_register) (p, n1fv_3, &desc);
}
#else /* HAVE_FMA */
/* Generated by: ../../../genfft/gen_notw_c -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name n1fv_3 -include n1f.h */
/*
* This function contains 6 FP additions, 2 FP multiplications,
* (or, 5 additions, 1 multiplications, 1 fused multiply/add),
* 11 stack variables, and 6 memory accesses
*/
/*
* Generator Id's :
* $Id: algsimp.ml,v 1.9 2006-02-12 23:34:12 athena Exp $
* $Id: fft.ml,v 1.4 2006-01-05 03:04:27 stevenj Exp $
* $Id: gen_notw_c.ml,v 1.17 2006-02-12 23:34:12 athena Exp $
*/
#include "n1f.h"
static void n1fv_3(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
{
DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
INT i;
const R *xi;
R *xo;
xi = ri;
xo = ro;
for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(is), MAKE_VOLATILE_STRIDE(os)) {
V T1, T4, T6, T2, T3, T5;
T1 = LD(&(xi[0]), ivs, &(xi[0]));
T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
T3 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
T4 = VADD(T2, T3);
T6 = VBYI(VMUL(LDK(KP866025403), VSUB(T3, T2)));
ST(&(xo[0]), VADD(T1, T4), ovs, &(xo[0]));
T5 = VFNMS(LDK(KP500000000), T4, T1);
ST(&(xo[WS(os, 2)]), VSUB(T5, T6), ovs, &(xo[0]));
ST(&(xo[WS(os, 1)]), VADD(T5, T6), ovs, &(xo[WS(os, 1)]));
}
}
static const kdft_desc desc = { 3, "n1fv_3", {5, 1, 1, 0}, &GENUS, 0, 0, 0, 0 };
void X(codelet_n1fv_3) (planner *p) {
X(kdft_register) (p, n1fv_3, &desc);
}
#endif /* HAVE_FMA */
|