annotate src/fftw-3.3.3/rdft/scalar/r2cb/r2cb_6.c @ 95:89f5e221ed7b

Add FFTW3
author Chris Cannam <cannam@all-day-breakfast.com>
date Wed, 20 Mar 2013 15:35:50 +0000
parents
children
rev   line source
cannam@95 1 /*
cannam@95 2 * Copyright (c) 2003, 2007-11 Matteo Frigo
cannam@95 3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
cannam@95 4 *
cannam@95 5 * This program is free software; you can redistribute it and/or modify
cannam@95 6 * it under the terms of the GNU General Public License as published by
cannam@95 7 * the Free Software Foundation; either version 2 of the License, or
cannam@95 8 * (at your option) any later version.
cannam@95 9 *
cannam@95 10 * This program is distributed in the hope that it will be useful,
cannam@95 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
cannam@95 13 * GNU General Public License for more details.
cannam@95 14 *
cannam@95 15 * You should have received a copy of the GNU General Public License
cannam@95 16 * along with this program; if not, write to the Free Software
cannam@95 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
cannam@95 18 *
cannam@95 19 */
cannam@95 20
cannam@95 21 /* This file was automatically generated --- DO NOT EDIT */
cannam@95 22 /* Generated on Sun Nov 25 07:41:07 EST 2012 */
cannam@95 23
cannam@95 24 #include "codelet-rdft.h"
cannam@95 25
cannam@95 26 #ifdef HAVE_FMA
cannam@95 27
cannam@95 28 /* Generated by: ../../../genfft/gen_r2cb.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 6 -name r2cb_6 -include r2cb.h */
cannam@95 29
cannam@95 30 /*
cannam@95 31 * This function contains 14 FP additions, 6 FP multiplications,
cannam@95 32 * (or, 8 additions, 0 multiplications, 6 fused multiply/add),
cannam@95 33 * 13 stack variables, 2 constants, and 12 memory accesses
cannam@95 34 */
cannam@95 35 #include "r2cb.h"
cannam@95 36
cannam@95 37 static void r2cb_6(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
cannam@95 38 {
cannam@95 39 DK(KP1_732050807, +1.732050807568877293527446341505872366942805254);
cannam@95 40 DK(KP2_000000000, +2.000000000000000000000000000000000000000000000);
cannam@95 41 {
cannam@95 42 INT i;
cannam@95 43 for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) {
cannam@95 44 E T4, T7, T3, Te, Tc, T5;
cannam@95 45 {
cannam@95 46 E T1, T2, Ta, Tb;
cannam@95 47 T1 = Cr[0];
cannam@95 48 T2 = Cr[WS(csr, 3)];
cannam@95 49 Ta = Ci[WS(csi, 2)];
cannam@95 50 Tb = Ci[WS(csi, 1)];
cannam@95 51 T4 = Cr[WS(csr, 2)];
cannam@95 52 T7 = T1 - T2;
cannam@95 53 T3 = T1 + T2;
cannam@95 54 Te = Ta + Tb;
cannam@95 55 Tc = Ta - Tb;
cannam@95 56 T5 = Cr[WS(csr, 1)];
cannam@95 57 }
cannam@95 58 {
cannam@95 59 E T6, T8, Td, T9;
cannam@95 60 T6 = T4 + T5;
cannam@95 61 T8 = T5 - T4;
cannam@95 62 Td = T7 + T8;
cannam@95 63 R1[WS(rs, 1)] = FNMS(KP2_000000000, T8, T7);
cannam@95 64 T9 = T3 - T6;
cannam@95 65 R0[0] = FMA(KP2_000000000, T6, T3);
cannam@95 66 R1[WS(rs, 2)] = FMA(KP1_732050807, Te, Td);
cannam@95 67 R1[0] = FNMS(KP1_732050807, Te, Td);
cannam@95 68 R0[WS(rs, 1)] = FMA(KP1_732050807, Tc, T9);
cannam@95 69 R0[WS(rs, 2)] = FNMS(KP1_732050807, Tc, T9);
cannam@95 70 }
cannam@95 71 }
cannam@95 72 }
cannam@95 73 }
cannam@95 74
cannam@95 75 static const kr2c_desc desc = { 6, "r2cb_6", {8, 0, 6, 0}, &GENUS };
cannam@95 76
cannam@95 77 void X(codelet_r2cb_6) (planner *p) {
cannam@95 78 X(kr2c_register) (p, r2cb_6, &desc);
cannam@95 79 }
cannam@95 80
cannam@95 81 #else /* HAVE_FMA */
cannam@95 82
cannam@95 83 /* Generated by: ../../../genfft/gen_r2cb.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 6 -name r2cb_6 -include r2cb.h */
cannam@95 84
cannam@95 85 /*
cannam@95 86 * This function contains 14 FP additions, 4 FP multiplications,
cannam@95 87 * (or, 12 additions, 2 multiplications, 2 fused multiply/add),
cannam@95 88 * 17 stack variables, 2 constants, and 12 memory accesses
cannam@95 89 */
cannam@95 90 #include "r2cb.h"
cannam@95 91
cannam@95 92 static void r2cb_6(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
cannam@95 93 {
cannam@95 94 DK(KP2_000000000, +2.000000000000000000000000000000000000000000000);
cannam@95 95 DK(KP1_732050807, +1.732050807568877293527446341505872366942805254);
cannam@95 96 {
cannam@95 97 INT i;
cannam@95 98 for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) {
cannam@95 99 E T3, T7, Tc, Te, T6, T8, T1, T2, T9, Td;
cannam@95 100 T1 = Cr[0];
cannam@95 101 T2 = Cr[WS(csr, 3)];
cannam@95 102 T3 = T1 - T2;
cannam@95 103 T7 = T1 + T2;
cannam@95 104 {
cannam@95 105 E Ta, Tb, T4, T5;
cannam@95 106 Ta = Ci[WS(csi, 2)];
cannam@95 107 Tb = Ci[WS(csi, 1)];
cannam@95 108 Tc = KP1_732050807 * (Ta - Tb);
cannam@95 109 Te = KP1_732050807 * (Ta + Tb);
cannam@95 110 T4 = Cr[WS(csr, 2)];
cannam@95 111 T5 = Cr[WS(csr, 1)];
cannam@95 112 T6 = T4 - T5;
cannam@95 113 T8 = T4 + T5;
cannam@95 114 }
cannam@95 115 R1[WS(rs, 1)] = FMA(KP2_000000000, T6, T3);
cannam@95 116 R0[0] = FMA(KP2_000000000, T8, T7);
cannam@95 117 T9 = T7 - T8;
cannam@95 118 R0[WS(rs, 2)] = T9 - Tc;
cannam@95 119 R0[WS(rs, 1)] = T9 + Tc;
cannam@95 120 Td = T3 - T6;
cannam@95 121 R1[0] = Td - Te;
cannam@95 122 R1[WS(rs, 2)] = Td + Te;
cannam@95 123 }
cannam@95 124 }
cannam@95 125 }
cannam@95 126
cannam@95 127 static const kr2c_desc desc = { 6, "r2cb_6", {12, 2, 2, 0}, &GENUS };
cannam@95 128
cannam@95 129 void X(codelet_r2cb_6) (planner *p) {
cannam@95 130 X(kr2c_register) (p, r2cb_6, &desc);
cannam@95 131 }
cannam@95 132
cannam@95 133 #endif /* HAVE_FMA */