annotate src/fftw-3.3.5/rdft/scalar/r2cf/r2cfII_6.c @ 148:b4bfdf10c4b3

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