annotate src/fftw-3.3.8/dft/scalar/codelets/t1_2.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 2 -name t1_2 -include dft/scalar/t.h */
Chris@82 29
Chris@82 30 /*
Chris@82 31 * This function contains 6 FP additions, 4 FP multiplications,
Chris@82 32 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
Chris@82 33 * 11 stack variables, 0 constants, and 8 memory accesses
Chris@82 34 */
Chris@82 35 #include "dft/scalar/t.h"
Chris@82 36
Chris@82 37 static void t1_2(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 * 2); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 2, MAKE_VOLATILE_STRIDE(4, rs)) {
Chris@82 42 E T1, Ta, T3, T6, T4, T8, T2, T7, T9, T5;
Chris@82 43 T1 = ri[0];
Chris@82 44 Ta = ii[0];
Chris@82 45 T3 = ri[WS(rs, 1)];
Chris@82 46 T6 = ii[WS(rs, 1)];
Chris@82 47 T2 = W[0];
Chris@82 48 T4 = T2 * T3;
Chris@82 49 T8 = T2 * T6;
Chris@82 50 T5 = W[1];
Chris@82 51 T7 = FMA(T5, T6, T4);
Chris@82 52 T9 = FNMS(T5, T3, T8);
Chris@82 53 ri[WS(rs, 1)] = T1 - T7;
Chris@82 54 ii[WS(rs, 1)] = Ta - T9;
Chris@82 55 ri[0] = T1 + T7;
Chris@82 56 ii[0] = T9 + Ta;
Chris@82 57 }
Chris@82 58 }
Chris@82 59 }
Chris@82 60
Chris@82 61 static const tw_instr twinstr[] = {
Chris@82 62 {TW_FULL, 0, 2},
Chris@82 63 {TW_NEXT, 1, 0}
Chris@82 64 };
Chris@82 65
Chris@82 66 static const ct_desc desc = { 2, "t1_2", twinstr, &GENUS, {4, 2, 2, 0}, 0, 0, 0 };
Chris@82 67
Chris@82 68 void X(codelet_t1_2) (planner *p) {
Chris@82 69 X(kdft_dit_register) (p, t1_2, &desc);
Chris@82 70 }
Chris@82 71 #else
Chris@82 72
Chris@82 73 /* Generated by: ../../../genfft/gen_twiddle.native -compact -variables 4 -pipeline-latency 4 -n 2 -name t1_2 -include dft/scalar/t.h */
Chris@82 74
Chris@82 75 /*
Chris@82 76 * This function contains 6 FP additions, 4 FP multiplications,
Chris@82 77 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
Chris@82 78 * 9 stack variables, 0 constants, and 8 memory accesses
Chris@82 79 */
Chris@82 80 #include "dft/scalar/t.h"
Chris@82 81
Chris@82 82 static void t1_2(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@82 83 {
Chris@82 84 {
Chris@82 85 INT m;
Chris@82 86 for (m = mb, W = W + (mb * 2); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 2, MAKE_VOLATILE_STRIDE(4, rs)) {
Chris@82 87 E T1, T8, T6, T7;
Chris@82 88 T1 = ri[0];
Chris@82 89 T8 = ii[0];
Chris@82 90 {
Chris@82 91 E T3, T5, T2, T4;
Chris@82 92 T3 = ri[WS(rs, 1)];
Chris@82 93 T5 = ii[WS(rs, 1)];
Chris@82 94 T2 = W[0];
Chris@82 95 T4 = W[1];
Chris@82 96 T6 = FMA(T2, T3, T4 * T5);
Chris@82 97 T7 = FNMS(T4, T3, T2 * T5);
Chris@82 98 }
Chris@82 99 ri[WS(rs, 1)] = T1 - T6;
Chris@82 100 ii[WS(rs, 1)] = T8 - T7;
Chris@82 101 ri[0] = T1 + T6;
Chris@82 102 ii[0] = T7 + T8;
Chris@82 103 }
Chris@82 104 }
Chris@82 105 }
Chris@82 106
Chris@82 107 static const tw_instr twinstr[] = {
Chris@82 108 {TW_FULL, 0, 2},
Chris@82 109 {TW_NEXT, 1, 0}
Chris@82 110 };
Chris@82 111
Chris@82 112 static const ct_desc desc = { 2, "t1_2", twinstr, &GENUS, {4, 2, 2, 0}, 0, 0, 0 };
Chris@82 113
Chris@82 114 void X(codelet_t1_2) (planner *p) {
Chris@82 115 X(kdft_dit_register) (p, t1_2, &desc);
Chris@82 116 }
Chris@82 117 #endif