annotate src/fftw-3.3.5/dft/scalar/codelets/t2_4.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 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:36:42 EDT 2016 */
cannam@127 23
cannam@127 24 #include "codelet-dft.h"
cannam@127 25
cannam@127 26 #ifdef HAVE_FMA
cannam@127 27
cannam@127 28 /* Generated by: ../../../genfft/gen_twiddle.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -twiddle-log3 -precompute-twiddles -n 4 -name t2_4 -include t.h */
cannam@127 29
cannam@127 30 /*
cannam@127 31 * This function contains 24 FP additions, 16 FP multiplications,
cannam@127 32 * (or, 16 additions, 8 multiplications, 8 fused multiply/add),
cannam@127 33 * 33 stack variables, 0 constants, and 16 memory accesses
cannam@127 34 */
cannam@127 35 #include "t.h"
cannam@127 36
cannam@127 37 static void t2_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
cannam@127 38 {
cannam@127 39 {
cannam@127 40 INT m;
cannam@127 41 for (m = mb, W = W + (mb * 4); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 4, MAKE_VOLATILE_STRIDE(8, rs)) {
cannam@127 42 E Ti, Tq, To, Te, Ty, Tz, Tm, Ts;
cannam@127 43 {
cannam@127 44 E T2, T6, T3, T5;
cannam@127 45 T2 = W[0];
cannam@127 46 T6 = W[3];
cannam@127 47 T3 = W[2];
cannam@127 48 T5 = W[1];
cannam@127 49 {
cannam@127 50 E T1, Tx, Td, Tw, Tj, Tl, Ta, T4, Tk, Tr;
cannam@127 51 T1 = ri[0];
cannam@127 52 Ta = T2 * T6;
cannam@127 53 T4 = T2 * T3;
cannam@127 54 Tx = ii[0];
cannam@127 55 {
cannam@127 56 E T8, Tb, T7, Tc;
cannam@127 57 T8 = ri[WS(rs, 2)];
cannam@127 58 Tb = FNMS(T5, T3, Ta);
cannam@127 59 T7 = FMA(T5, T6, T4);
cannam@127 60 Tc = ii[WS(rs, 2)];
cannam@127 61 {
cannam@127 62 E Tf, Th, T9, Tv, Tg, Tp;
cannam@127 63 Tf = ri[WS(rs, 1)];
cannam@127 64 Th = ii[WS(rs, 1)];
cannam@127 65 T9 = T7 * T8;
cannam@127 66 Tv = T7 * Tc;
cannam@127 67 Tg = T2 * Tf;
cannam@127 68 Tp = T2 * Th;
cannam@127 69 Td = FMA(Tb, Tc, T9);
cannam@127 70 Tw = FNMS(Tb, T8, Tv);
cannam@127 71 Ti = FMA(T5, Th, Tg);
cannam@127 72 Tq = FNMS(T5, Tf, Tp);
cannam@127 73 }
cannam@127 74 Tj = ri[WS(rs, 3)];
cannam@127 75 Tl = ii[WS(rs, 3)];
cannam@127 76 }
cannam@127 77 To = T1 - Td;
cannam@127 78 Te = T1 + Td;
cannam@127 79 Ty = Tw + Tx;
cannam@127 80 Tz = Tx - Tw;
cannam@127 81 Tk = T3 * Tj;
cannam@127 82 Tr = T3 * Tl;
cannam@127 83 Tm = FMA(T6, Tl, Tk);
cannam@127 84 Ts = FNMS(T6, Tj, Tr);
cannam@127 85 }
cannam@127 86 }
cannam@127 87 {
cannam@127 88 E Tn, TA, Tu, Tt;
cannam@127 89 Tn = Ti + Tm;
cannam@127 90 TA = Ti - Tm;
cannam@127 91 Tu = Tq + Ts;
cannam@127 92 Tt = Tq - Ts;
cannam@127 93 ii[WS(rs, 3)] = TA + Tz;
cannam@127 94 ii[WS(rs, 1)] = Tz - TA;
cannam@127 95 ri[0] = Te + Tn;
cannam@127 96 ri[WS(rs, 2)] = Te - Tn;
cannam@127 97 ri[WS(rs, 1)] = To + Tt;
cannam@127 98 ri[WS(rs, 3)] = To - Tt;
cannam@127 99 ii[WS(rs, 2)] = Ty - Tu;
cannam@127 100 ii[0] = Tu + Ty;
cannam@127 101 }
cannam@127 102 }
cannam@127 103 }
cannam@127 104 }
cannam@127 105
cannam@127 106 static const tw_instr twinstr[] = {
cannam@127 107 {TW_CEXP, 0, 1},
cannam@127 108 {TW_CEXP, 0, 3},
cannam@127 109 {TW_NEXT, 1, 0}
cannam@127 110 };
cannam@127 111
cannam@127 112 static const ct_desc desc = { 4, "t2_4", twinstr, &GENUS, {16, 8, 8, 0}, 0, 0, 0 };
cannam@127 113
cannam@127 114 void X(codelet_t2_4) (planner *p) {
cannam@127 115 X(kdft_dit_register) (p, t2_4, &desc);
cannam@127 116 }
cannam@127 117 #else /* HAVE_FMA */
cannam@127 118
cannam@127 119 /* Generated by: ../../../genfft/gen_twiddle.native -compact -variables 4 -pipeline-latency 4 -twiddle-log3 -precompute-twiddles -n 4 -name t2_4 -include t.h */
cannam@127 120
cannam@127 121 /*
cannam@127 122 * This function contains 24 FP additions, 16 FP multiplications,
cannam@127 123 * (or, 16 additions, 8 multiplications, 8 fused multiply/add),
cannam@127 124 * 21 stack variables, 0 constants, and 16 memory accesses
cannam@127 125 */
cannam@127 126 #include "t.h"
cannam@127 127
cannam@127 128 static void t2_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
cannam@127 129 {
cannam@127 130 {
cannam@127 131 INT m;
cannam@127 132 for (m = mb, W = W + (mb * 4); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 4, MAKE_VOLATILE_STRIDE(8, rs)) {
cannam@127 133 E T2, T4, T3, T5, T6, T8;
cannam@127 134 T2 = W[0];
cannam@127 135 T4 = W[1];
cannam@127 136 T3 = W[2];
cannam@127 137 T5 = W[3];
cannam@127 138 T6 = FMA(T2, T3, T4 * T5);
cannam@127 139 T8 = FNMS(T4, T3, T2 * T5);
cannam@127 140 {
cannam@127 141 E T1, Tp, Ta, To, Te, Tk, Th, Tl, T7, T9;
cannam@127 142 T1 = ri[0];
cannam@127 143 Tp = ii[0];
cannam@127 144 T7 = ri[WS(rs, 2)];
cannam@127 145 T9 = ii[WS(rs, 2)];
cannam@127 146 Ta = FMA(T6, T7, T8 * T9);
cannam@127 147 To = FNMS(T8, T7, T6 * T9);
cannam@127 148 {
cannam@127 149 E Tc, Td, Tf, Tg;
cannam@127 150 Tc = ri[WS(rs, 1)];
cannam@127 151 Td = ii[WS(rs, 1)];
cannam@127 152 Te = FMA(T2, Tc, T4 * Td);
cannam@127 153 Tk = FNMS(T4, Tc, T2 * Td);
cannam@127 154 Tf = ri[WS(rs, 3)];
cannam@127 155 Tg = ii[WS(rs, 3)];
cannam@127 156 Th = FMA(T3, Tf, T5 * Tg);
cannam@127 157 Tl = FNMS(T5, Tf, T3 * Tg);
cannam@127 158 }
cannam@127 159 {
cannam@127 160 E Tb, Ti, Tn, Tq;
cannam@127 161 Tb = T1 + Ta;
cannam@127 162 Ti = Te + Th;
cannam@127 163 ri[WS(rs, 2)] = Tb - Ti;
cannam@127 164 ri[0] = Tb + Ti;
cannam@127 165 Tn = Tk + Tl;
cannam@127 166 Tq = To + Tp;
cannam@127 167 ii[0] = Tn + Tq;
cannam@127 168 ii[WS(rs, 2)] = Tq - Tn;
cannam@127 169 }
cannam@127 170 {
cannam@127 171 E Tj, Tm, Tr, Ts;
cannam@127 172 Tj = T1 - Ta;
cannam@127 173 Tm = Tk - Tl;
cannam@127 174 ri[WS(rs, 3)] = Tj - Tm;
cannam@127 175 ri[WS(rs, 1)] = Tj + Tm;
cannam@127 176 Tr = Tp - To;
cannam@127 177 Ts = Te - Th;
cannam@127 178 ii[WS(rs, 1)] = Tr - Ts;
cannam@127 179 ii[WS(rs, 3)] = Ts + Tr;
cannam@127 180 }
cannam@127 181 }
cannam@127 182 }
cannam@127 183 }
cannam@127 184 }
cannam@127 185
cannam@127 186 static const tw_instr twinstr[] = {
cannam@127 187 {TW_CEXP, 0, 1},
cannam@127 188 {TW_CEXP, 0, 3},
cannam@127 189 {TW_NEXT, 1, 0}
cannam@127 190 };
cannam@127 191
cannam@127 192 static const ct_desc desc = { 4, "t2_4", twinstr, &GENUS, {16, 8, 8, 0}, 0, 0, 0 };
cannam@127 193
cannam@127 194 void X(codelet_t2_4) (planner *p) {
cannam@127 195 X(kdft_dit_register) (p, t2_4, &desc);
cannam@127 196 }
cannam@127 197 #endif /* HAVE_FMA */