annotate src/fftw-3.3.8/dft/scalar/codelets/t1_3.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 3 -name t1_3 -include dft/scalar/t.h */
Chris@82 29
Chris@82 30 /*
Chris@82 31 * This function contains 16 FP additions, 14 FP multiplications,
Chris@82 32 * (or, 6 additions, 4 multiplications, 10 fused multiply/add),
Chris@82 33 * 15 stack variables, 2 constants, and 12 memory accesses
Chris@82 34 */
Chris@82 35 #include "dft/scalar/t.h"
Chris@82 36
Chris@82 37 static void t1_3(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@82 38 {
Chris@82 39 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@82 40 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@82 41 {
Chris@82 42 INT m;
Chris@82 43 for (m = mb, W = W + (mb * 4); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 4, MAKE_VOLATILE_STRIDE(6, rs)) {
Chris@82 44 E T1, Tm, T7, Th, Td, Tj;
Chris@82 45 T1 = ri[0];
Chris@82 46 Tm = ii[0];
Chris@82 47 {
Chris@82 48 E T3, T6, T4, Tg, T2, T5;
Chris@82 49 T3 = ri[WS(rs, 1)];
Chris@82 50 T6 = ii[WS(rs, 1)];
Chris@82 51 T2 = W[0];
Chris@82 52 T4 = T2 * T3;
Chris@82 53 Tg = T2 * T6;
Chris@82 54 T5 = W[1];
Chris@82 55 T7 = FMA(T5, T6, T4);
Chris@82 56 Th = FNMS(T5, T3, Tg);
Chris@82 57 }
Chris@82 58 {
Chris@82 59 E T9, Tc, Ta, Ti, T8, Tb;
Chris@82 60 T9 = ri[WS(rs, 2)];
Chris@82 61 Tc = ii[WS(rs, 2)];
Chris@82 62 T8 = W[2];
Chris@82 63 Ta = T8 * T9;
Chris@82 64 Ti = T8 * Tc;
Chris@82 65 Tb = W[3];
Chris@82 66 Td = FMA(Tb, Tc, Ta);
Chris@82 67 Tj = FNMS(Tb, T9, Ti);
Chris@82 68 }
Chris@82 69 {
Chris@82 70 E Tk, Te, Tf, To, Tl, Tn;
Chris@82 71 Tk = Th - Tj;
Chris@82 72 Te = T7 + Td;
Chris@82 73 Tf = FNMS(KP500000000, Te, T1);
Chris@82 74 ri[0] = T1 + Te;
Chris@82 75 ri[WS(rs, 1)] = FMA(KP866025403, Tk, Tf);
Chris@82 76 ri[WS(rs, 2)] = FNMS(KP866025403, Tk, Tf);
Chris@82 77 To = Td - T7;
Chris@82 78 Tl = Th + Tj;
Chris@82 79 Tn = FNMS(KP500000000, Tl, Tm);
Chris@82 80 ii[0] = Tl + Tm;
Chris@82 81 ii[WS(rs, 2)] = FNMS(KP866025403, To, Tn);
Chris@82 82 ii[WS(rs, 1)] = FMA(KP866025403, To, Tn);
Chris@82 83 }
Chris@82 84 }
Chris@82 85 }
Chris@82 86 }
Chris@82 87
Chris@82 88 static const tw_instr twinstr[] = {
Chris@82 89 {TW_FULL, 0, 3},
Chris@82 90 {TW_NEXT, 1, 0}
Chris@82 91 };
Chris@82 92
Chris@82 93 static const ct_desc desc = { 3, "t1_3", twinstr, &GENUS, {6, 4, 10, 0}, 0, 0, 0 };
Chris@82 94
Chris@82 95 void X(codelet_t1_3) (planner *p) {
Chris@82 96 X(kdft_dit_register) (p, t1_3, &desc);
Chris@82 97 }
Chris@82 98 #else
Chris@82 99
Chris@82 100 /* Generated by: ../../../genfft/gen_twiddle.native -compact -variables 4 -pipeline-latency 4 -n 3 -name t1_3 -include dft/scalar/t.h */
Chris@82 101
Chris@82 102 /*
Chris@82 103 * This function contains 16 FP additions, 12 FP multiplications,
Chris@82 104 * (or, 10 additions, 6 multiplications, 6 fused multiply/add),
Chris@82 105 * 15 stack variables, 2 constants, and 12 memory accesses
Chris@82 106 */
Chris@82 107 #include "dft/scalar/t.h"
Chris@82 108
Chris@82 109 static void t1_3(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@82 110 {
Chris@82 111 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@82 112 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@82 113 {
Chris@82 114 INT m;
Chris@82 115 for (m = mb, W = W + (mb * 4); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 4, MAKE_VOLATILE_STRIDE(6, rs)) {
Chris@82 116 E T1, Ti, T6, Te, Tb, Tf, Tc, Th;
Chris@82 117 T1 = ri[0];
Chris@82 118 Ti = ii[0];
Chris@82 119 {
Chris@82 120 E T3, T5, T2, T4;
Chris@82 121 T3 = ri[WS(rs, 1)];
Chris@82 122 T5 = ii[WS(rs, 1)];
Chris@82 123 T2 = W[0];
Chris@82 124 T4 = W[1];
Chris@82 125 T6 = FMA(T2, T3, T4 * T5);
Chris@82 126 Te = FNMS(T4, T3, T2 * T5);
Chris@82 127 }
Chris@82 128 {
Chris@82 129 E T8, Ta, T7, T9;
Chris@82 130 T8 = ri[WS(rs, 2)];
Chris@82 131 Ta = ii[WS(rs, 2)];
Chris@82 132 T7 = W[2];
Chris@82 133 T9 = W[3];
Chris@82 134 Tb = FMA(T7, T8, T9 * Ta);
Chris@82 135 Tf = FNMS(T9, T8, T7 * Ta);
Chris@82 136 }
Chris@82 137 Tc = T6 + Tb;
Chris@82 138 Th = Te + Tf;
Chris@82 139 ri[0] = T1 + Tc;
Chris@82 140 ii[0] = Th + Ti;
Chris@82 141 {
Chris@82 142 E Td, Tg, Tj, Tk;
Chris@82 143 Td = FNMS(KP500000000, Tc, T1);
Chris@82 144 Tg = KP866025403 * (Te - Tf);
Chris@82 145 ri[WS(rs, 2)] = Td - Tg;
Chris@82 146 ri[WS(rs, 1)] = Td + Tg;
Chris@82 147 Tj = KP866025403 * (Tb - T6);
Chris@82 148 Tk = FNMS(KP500000000, Th, Ti);
Chris@82 149 ii[WS(rs, 1)] = Tj + Tk;
Chris@82 150 ii[WS(rs, 2)] = Tk - Tj;
Chris@82 151 }
Chris@82 152 }
Chris@82 153 }
Chris@82 154 }
Chris@82 155
Chris@82 156 static const tw_instr twinstr[] = {
Chris@82 157 {TW_FULL, 0, 3},
Chris@82 158 {TW_NEXT, 1, 0}
Chris@82 159 };
Chris@82 160
Chris@82 161 static const ct_desc desc = { 3, "t1_3", twinstr, &GENUS, {10, 6, 6, 0}, 0, 0, 0 };
Chris@82 162
Chris@82 163 void X(codelet_t1_3) (planner *p) {
Chris@82 164 X(kdft_dit_register) (p, t1_3, &desc);
Chris@82 165 }
Chris@82 166 #endif