annotate src/fftw-3.3.8/dft/scalar/codelets/t1_4.c @ 84:08ae793730bd

Add null config files
author Chris Cannam
date Mon, 02 Mar 2020 14:03:47 +0000
parents d0c2a83c1364
children
rev   line source
Chris@82 1 /*
Chris@82 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@82 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@82 4 *
Chris@82 5 * This program is free software; you can redistribute it and/or modify
Chris@82 6 * it under the terms of the GNU General Public License as published by
Chris@82 7 * the Free Software Foundation; either version 2 of the License, or
Chris@82 8 * (at your option) any later version.
Chris@82 9 *
Chris@82 10 * This program is distributed in the hope that it will be useful,
Chris@82 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@82 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@82 13 * GNU General Public License for more details.
Chris@82 14 *
Chris@82 15 * You should have received a copy of the GNU General Public License
Chris@82 16 * along with this program; if not, write to the Free Software
Chris@82 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@82 18 *
Chris@82 19 */
Chris@82 20
Chris@82 21 /* This file was automatically generated --- DO NOT EDIT */
Chris@82 22 /* Generated on Thu May 24 08:04:12 EDT 2018 */
Chris@82 23
Chris@82 24 #include "dft/codelet-dft.h"
Chris@82 25
Chris@82 26 #if defined(ARCH_PREFERS_FMA) || defined(ISA_EXTENSION_PREFERS_FMA)
Chris@82 27
Chris@82 28 /* Generated by: ../../../genfft/gen_twiddle.native -fma -compact -variables 4 -pipeline-latency 4 -n 4 -name t1_4 -include dft/scalar/t.h */
Chris@82 29
Chris@82 30 /*
Chris@82 31 * This function contains 22 FP additions, 12 FP multiplications,
Chris@82 32 * (or, 16 additions, 6 multiplications, 6 fused multiply/add),
Chris@82 33 * 15 stack variables, 0 constants, and 16 memory accesses
Chris@82 34 */
Chris@82 35 #include "dft/scalar/t.h"
Chris@82 36
Chris@82 37 static void t1_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@82 38 {
Chris@82 39 {
Chris@82 40 INT m;
Chris@82 41 for (m = mb, W = W + (mb * 6); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 6, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@82 42 E T1, Tv, T7, Tu, Te, To, Tk, Tq;
Chris@82 43 T1 = ri[0];
Chris@82 44 Tv = ii[0];
Chris@82 45 {
Chris@82 46 E T3, T6, T4, Tt, T2, T5;
Chris@82 47 T3 = ri[WS(rs, 2)];
Chris@82 48 T6 = ii[WS(rs, 2)];
Chris@82 49 T2 = W[2];
Chris@82 50 T4 = T2 * T3;
Chris@82 51 Tt = T2 * T6;
Chris@82 52 T5 = W[3];
Chris@82 53 T7 = FMA(T5, T6, T4);
Chris@82 54 Tu = FNMS(T5, T3, Tt);
Chris@82 55 }
Chris@82 56 {
Chris@82 57 E Ta, Td, Tb, Tn, T9, Tc;
Chris@82 58 Ta = ri[WS(rs, 1)];
Chris@82 59 Td = ii[WS(rs, 1)];
Chris@82 60 T9 = W[0];
Chris@82 61 Tb = T9 * Ta;
Chris@82 62 Tn = T9 * Td;
Chris@82 63 Tc = W[1];
Chris@82 64 Te = FMA(Tc, Td, Tb);
Chris@82 65 To = FNMS(Tc, Ta, Tn);
Chris@82 66 }
Chris@82 67 {
Chris@82 68 E Tg, Tj, Th, Tp, Tf, Ti;
Chris@82 69 Tg = ri[WS(rs, 3)];
Chris@82 70 Tj = ii[WS(rs, 3)];
Chris@82 71 Tf = W[4];
Chris@82 72 Th = Tf * Tg;
Chris@82 73 Tp = Tf * Tj;
Chris@82 74 Ti = W[5];
Chris@82 75 Tk = FMA(Ti, Tj, Th);
Chris@82 76 Tq = FNMS(Ti, Tg, Tp);
Chris@82 77 }
Chris@82 78 {
Chris@82 79 E T8, Tl, Ts, Tw;
Chris@82 80 T8 = T1 + T7;
Chris@82 81 Tl = Te + Tk;
Chris@82 82 ri[WS(rs, 2)] = T8 - Tl;
Chris@82 83 ri[0] = T8 + Tl;
Chris@82 84 Ts = To + Tq;
Chris@82 85 Tw = Tu + Tv;
Chris@82 86 ii[0] = Ts + Tw;
Chris@82 87 ii[WS(rs, 2)] = Tw - Ts;
Chris@82 88 }
Chris@82 89 {
Chris@82 90 E Tm, Tr, Tx, Ty;
Chris@82 91 Tm = T1 - T7;
Chris@82 92 Tr = To - Tq;
Chris@82 93 ri[WS(rs, 3)] = Tm - Tr;
Chris@82 94 ri[WS(rs, 1)] = Tm + Tr;
Chris@82 95 Tx = Tv - Tu;
Chris@82 96 Ty = Te - Tk;
Chris@82 97 ii[WS(rs, 1)] = Tx - Ty;
Chris@82 98 ii[WS(rs, 3)] = Ty + Tx;
Chris@82 99 }
Chris@82 100 }
Chris@82 101 }
Chris@82 102 }
Chris@82 103
Chris@82 104 static const tw_instr twinstr[] = {
Chris@82 105 {TW_FULL, 0, 4},
Chris@82 106 {TW_NEXT, 1, 0}
Chris@82 107 };
Chris@82 108
Chris@82 109 static const ct_desc desc = { 4, "t1_4", twinstr, &GENUS, {16, 6, 6, 0}, 0, 0, 0 };
Chris@82 110
Chris@82 111 void X(codelet_t1_4) (planner *p) {
Chris@82 112 X(kdft_dit_register) (p, t1_4, &desc);
Chris@82 113 }
Chris@82 114 #else
Chris@82 115
Chris@82 116 /* Generated by: ../../../genfft/gen_twiddle.native -compact -variables 4 -pipeline-latency 4 -n 4 -name t1_4 -include dft/scalar/t.h */
Chris@82 117
Chris@82 118 /*
Chris@82 119 * This function contains 22 FP additions, 12 FP multiplications,
Chris@82 120 * (or, 16 additions, 6 multiplications, 6 fused multiply/add),
Chris@82 121 * 13 stack variables, 0 constants, and 16 memory accesses
Chris@82 122 */
Chris@82 123 #include "dft/scalar/t.h"
Chris@82 124
Chris@82 125 static void t1_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@82 126 {
Chris@82 127 {
Chris@82 128 INT m;
Chris@82 129 for (m = mb, W = W + (mb * 6); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 6, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@82 130 E T1, Tp, T6, To, Tc, Tk, Th, Tl;
Chris@82 131 T1 = ri[0];
Chris@82 132 Tp = ii[0];
Chris@82 133 {
Chris@82 134 E T3, T5, T2, T4;
Chris@82 135 T3 = ri[WS(rs, 2)];
Chris@82 136 T5 = ii[WS(rs, 2)];
Chris@82 137 T2 = W[2];
Chris@82 138 T4 = W[3];
Chris@82 139 T6 = FMA(T2, T3, T4 * T5);
Chris@82 140 To = FNMS(T4, T3, T2 * T5);
Chris@82 141 }
Chris@82 142 {
Chris@82 143 E T9, Tb, T8, Ta;
Chris@82 144 T9 = ri[WS(rs, 1)];
Chris@82 145 Tb = ii[WS(rs, 1)];
Chris@82 146 T8 = W[0];
Chris@82 147 Ta = W[1];
Chris@82 148 Tc = FMA(T8, T9, Ta * Tb);
Chris@82 149 Tk = FNMS(Ta, T9, T8 * Tb);
Chris@82 150 }
Chris@82 151 {
Chris@82 152 E Te, Tg, Td, Tf;
Chris@82 153 Te = ri[WS(rs, 3)];
Chris@82 154 Tg = ii[WS(rs, 3)];
Chris@82 155 Td = W[4];
Chris@82 156 Tf = W[5];
Chris@82 157 Th = FMA(Td, Te, Tf * Tg);
Chris@82 158 Tl = FNMS(Tf, Te, Td * Tg);
Chris@82 159 }
Chris@82 160 {
Chris@82 161 E T7, Ti, Tn, Tq;
Chris@82 162 T7 = T1 + T6;
Chris@82 163 Ti = Tc + Th;
Chris@82 164 ri[WS(rs, 2)] = T7 - Ti;
Chris@82 165 ri[0] = T7 + Ti;
Chris@82 166 Tn = Tk + Tl;
Chris@82 167 Tq = To + Tp;
Chris@82 168 ii[0] = Tn + Tq;
Chris@82 169 ii[WS(rs, 2)] = Tq - Tn;
Chris@82 170 }
Chris@82 171 {
Chris@82 172 E Tj, Tm, Tr, Ts;
Chris@82 173 Tj = T1 - T6;
Chris@82 174 Tm = Tk - Tl;
Chris@82 175 ri[WS(rs, 3)] = Tj - Tm;
Chris@82 176 ri[WS(rs, 1)] = Tj + Tm;
Chris@82 177 Tr = Tp - To;
Chris@82 178 Ts = Tc - Th;
Chris@82 179 ii[WS(rs, 1)] = Tr - Ts;
Chris@82 180 ii[WS(rs, 3)] = Ts + Tr;
Chris@82 181 }
Chris@82 182 }
Chris@82 183 }
Chris@82 184 }
Chris@82 185
Chris@82 186 static const tw_instr twinstr[] = {
Chris@82 187 {TW_FULL, 0, 4},
Chris@82 188 {TW_NEXT, 1, 0}
Chris@82 189 };
Chris@82 190
Chris@82 191 static const ct_desc desc = { 4, "t1_4", twinstr, &GENUS, {16, 6, 6, 0}, 0, 0, 0 };
Chris@82 192
Chris@82 193 void X(codelet_t1_4) (planner *p) {
Chris@82 194 X(kdft_dit_register) (p, t1_4, &desc);
Chris@82 195 }
Chris@82 196 #endif