summaryrefslogtreecommitdiff
path: root/src/fftw3/dft/codelets/standard/t1_2.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/fftw3/dft/codelets/standard/t1_2.c')
-rw-r--r--src/fftw3/dft/codelets/standard/t1_2.c75
1 files changed, 0 insertions, 75 deletions
diff --git a/src/fftw3/dft/codelets/standard/t1_2.c b/src/fftw3/dft/codelets/standard/t1_2.c
deleted file mode 100644
index 9213d04..0000000
--- a/src/fftw3/dft/codelets/standard/t1_2.c
+++ /dev/null
@@ -1,75 +0,0 @@
-/*
- * 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
- *
- */
-
-/* This file was automatically generated --- DO NOT EDIT */
-/* Generated on Sat Jul 5 21:29:51 EDT 2003 */
-
-#include "codelet-dft.h"
-
-/* Generated by: /homee/stevenj/cvs/fftw3.0.1/genfft/gen_twiddle -compact -variables 4 -n 2 -name t1_2 -include t.h */
-
-/*
- * This function contains 6 FP additions, 4 FP multiplications,
- * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
- * 9 stack variables, and 8 memory accesses
- */
-/*
- * Generator Id's :
- * $Id: t1_2.c,v 1.1 2008/10/17 06:11:09 scuri Exp $
- * $Id: t1_2.c,v 1.1 2008/10/17 06:11:09 scuri Exp $
- * $Id: t1_2.c,v 1.1 2008/10/17 06:11:09 scuri Exp $
- */
-
-#include "t.h"
-
-static const R *t1_2(R *ri, R *ii, const R *W, stride ios, int m, int dist)
-{
- int i;
- for (i = m; i > 0; i = i - 1, ri = ri + dist, ii = ii + dist, W = W + 2) {
- E T1, T8, T6, T7;
- T1 = ri[0];
- T8 = ii[0];
- {
- E T3, T5, T2, T4;
- T3 = ri[WS(ios, 1)];
- T5 = ii[WS(ios, 1)];
- T2 = W[0];
- T4 = W[1];
- T6 = FMA(T2, T3, T4 * T5);
- T7 = FNMS(T4, T3, T2 * T5);
- }
- ri[WS(ios, 1)] = T1 - T6;
- ii[WS(ios, 1)] = T8 - T7;
- ri[0] = T1 + T6;
- ii[0] = T7 + T8;
- }
- return W;
-}
-
-static const tw_instr twinstr[] = {
- {TW_FULL, 0, 2},
- {TW_NEXT, 1, 0}
-};
-
-static const ct_desc desc = { 2, "t1_2", twinstr, {4, 2, 2, 0}, &GENUS, 0, 0, 0 };
-
-void X(codelet_t1_2) (planner *p) {
- X(kdft_dit_register) (p, t1_2, &desc);
-}