annotate src/fftw-3.3.3/rdft/scalar/r2cf/r2cf_5.c @ 169:223a55898ab9 tip default

Add null config files
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 02 Mar 2020 14:03:47 +0000
parents 89f5e221ed7b
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:39:45 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_r2cf.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 5 -name r2cf_5 -include r2cf.h */
cannam@95 29
cannam@95 30 /*
cannam@95 31 * This function contains 12 FP additions, 7 FP multiplications,
cannam@95 32 * (or, 7 additions, 2 multiplications, 5 fused multiply/add),
cannam@95 33 * 17 stack variables, 4 constants, and 10 memory accesses
cannam@95 34 */
cannam@95 35 #include "r2cf.h"
cannam@95 36
cannam@95 37 static void r2cf_5(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(KP559016994, +0.559016994374947424102293417182819058860154590);
cannam@95 40 DK(KP250000000, +0.250000000000000000000000000000000000000000000);
cannam@95 41 DK(KP618033988, +0.618033988749894848204586834365638117720309180);
cannam@95 42 DK(KP951056516, +0.951056516295153572116439333379382143405698634);
cannam@95 43 {
cannam@95 44 INT i;
cannam@95 45 for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(20, rs), MAKE_VOLATILE_STRIDE(20, csr), MAKE_VOLATILE_STRIDE(20, csi)) {
cannam@95 46 E T7, T1, T2, T4, T5;
cannam@95 47 T7 = R0[0];
cannam@95 48 T1 = R0[WS(rs, 2)];
cannam@95 49 T2 = R1[0];
cannam@95 50 T4 = R0[WS(rs, 1)];
cannam@95 51 T5 = R1[WS(rs, 1)];
cannam@95 52 {
cannam@95 53 E T3, T8, T6, T9, Tc, Ta, Tb;
cannam@95 54 T3 = T1 - T2;
cannam@95 55 T8 = T2 + T1;
cannam@95 56 T6 = T4 - T5;
cannam@95 57 T9 = T4 + T5;
cannam@95 58 Ci[WS(csi, 2)] = KP951056516 * (FMA(KP618033988, T3, T6));
cannam@95 59 Ci[WS(csi, 1)] = KP951056516 * (FNMS(KP618033988, T6, T3));
cannam@95 60 Tc = T8 - T9;
cannam@95 61 Ta = T8 + T9;
cannam@95 62 Tb = FNMS(KP250000000, Ta, T7);
cannam@95 63 Cr[0] = T7 + Ta;
cannam@95 64 Cr[WS(csr, 2)] = FNMS(KP559016994, Tc, Tb);
cannam@95 65 Cr[WS(csr, 1)] = FMA(KP559016994, Tc, Tb);
cannam@95 66 }
cannam@95 67 }
cannam@95 68 }
cannam@95 69 }
cannam@95 70
cannam@95 71 static const kr2c_desc desc = { 5, "r2cf_5", {7, 2, 5, 0}, &GENUS };
cannam@95 72
cannam@95 73 void X(codelet_r2cf_5) (planner *p) {
cannam@95 74 X(kr2c_register) (p, r2cf_5, &desc);
cannam@95 75 }
cannam@95 76
cannam@95 77 #else /* HAVE_FMA */
cannam@95 78
cannam@95 79 /* Generated by: ../../../genfft/gen_r2cf.native -compact -variables 4 -pipeline-latency 4 -n 5 -name r2cf_5 -include r2cf.h */
cannam@95 80
cannam@95 81 /*
cannam@95 82 * This function contains 12 FP additions, 6 FP multiplications,
cannam@95 83 * (or, 9 additions, 3 multiplications, 3 fused multiply/add),
cannam@95 84 * 17 stack variables, 4 constants, and 10 memory accesses
cannam@95 85 */
cannam@95 86 #include "r2cf.h"
cannam@95 87
cannam@95 88 static void r2cf_5(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
cannam@95 89 {
cannam@95 90 DK(KP250000000, +0.250000000000000000000000000000000000000000000);
cannam@95 91 DK(KP559016994, +0.559016994374947424102293417182819058860154590);
cannam@95 92 DK(KP587785252, +0.587785252292473129168705954639072768597652438);
cannam@95 93 DK(KP951056516, +0.951056516295153572116439333379382143405698634);
cannam@95 94 {
cannam@95 95 INT i;
cannam@95 96 for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(20, rs), MAKE_VOLATILE_STRIDE(20, csr), MAKE_VOLATILE_STRIDE(20, csi)) {
cannam@95 97 E Ta, T7, T8, T3, Tb, T6, T9, Tc;
cannam@95 98 Ta = R0[0];
cannam@95 99 {
cannam@95 100 E T1, T2, T4, T5;
cannam@95 101 T1 = R0[WS(rs, 2)];
cannam@95 102 T2 = R1[0];
cannam@95 103 T7 = T2 + T1;
cannam@95 104 T4 = R0[WS(rs, 1)];
cannam@95 105 T5 = R1[WS(rs, 1)];
cannam@95 106 T8 = T4 + T5;
cannam@95 107 T3 = T1 - T2;
cannam@95 108 Tb = T7 + T8;
cannam@95 109 T6 = T4 - T5;
cannam@95 110 }
cannam@95 111 Ci[WS(csi, 1)] = FNMS(KP587785252, T6, KP951056516 * T3);
cannam@95 112 Cr[0] = Ta + Tb;
cannam@95 113 Ci[WS(csi, 2)] = FMA(KP587785252, T3, KP951056516 * T6);
cannam@95 114 T9 = KP559016994 * (T7 - T8);
cannam@95 115 Tc = FNMS(KP250000000, Tb, Ta);
cannam@95 116 Cr[WS(csr, 1)] = T9 + Tc;
cannam@95 117 Cr[WS(csr, 2)] = Tc - T9;
cannam@95 118 }
cannam@95 119 }
cannam@95 120 }
cannam@95 121
cannam@95 122 static const kr2c_desc desc = { 5, "r2cf_5", {9, 3, 3, 0}, &GENUS };
cannam@95 123
cannam@95 124 void X(codelet_r2cf_5) (planner *p) {
cannam@95 125 X(kr2c_register) (p, r2cf_5, &desc);
cannam@95 126 }
cannam@95 127
cannam@95 128 #endif /* HAVE_FMA */