annotate src/fftw-3.3.5/rdft/scalar/r2cb/r2cb_5.c @ 84:08ae793730bd

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