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