annotate fft/fftw/fftw-3.3.4/dft/scalar/codelets/n1_4.c @ 40:223f770b5341 kissfft-double tip

Try a double-precision kissfft
author Chris Cannam
date Wed, 07 Sep 2016 10:40:32 +0100
parents 26056e866c29
children
rev   line source
Chris@19 1 /*
Chris@19 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19 4 *
Chris@19 5 * This program is free software; you can redistribute it and/or modify
Chris@19 6 * it under the terms of the GNU General Public License as published by
Chris@19 7 * the Free Software Foundation; either version 2 of the License, or
Chris@19 8 * (at your option) any later version.
Chris@19 9 *
Chris@19 10 * This program is distributed in the hope that it will be useful,
Chris@19 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@19 13 * GNU General Public License for more details.
Chris@19 14 *
Chris@19 15 * You should have received a copy of the GNU General Public License
Chris@19 16 * along with this program; if not, write to the Free Software
Chris@19 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@19 18 *
Chris@19 19 */
Chris@19 20
Chris@19 21 /* This file was automatically generated --- DO NOT EDIT */
Chris@19 22 /* Generated on Tue Mar 4 13:45:48 EST 2014 */
Chris@19 23
Chris@19 24 #include "codelet-dft.h"
Chris@19 25
Chris@19 26 #ifdef HAVE_FMA
Chris@19 27
Chris@19 28 /* Generated by: ../../../genfft/gen_notw.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 4 -name n1_4 -include n.h */
Chris@19 29
Chris@19 30 /*
Chris@19 31 * This function contains 16 FP additions, 0 FP multiplications,
Chris@19 32 * (or, 16 additions, 0 multiplications, 0 fused multiply/add),
Chris@19 33 * 13 stack variables, 0 constants, and 16 memory accesses
Chris@19 34 */
Chris@19 35 #include "n.h"
Chris@19 36
Chris@19 37 static void n1_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@19 38 {
Chris@19 39 {
Chris@19 40 INT i;
Chris@19 41 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(16, is), MAKE_VOLATILE_STRIDE(16, os)) {
Chris@19 42 E T4, Tb, T3, Tf, T9, T5, Tc, Td;
Chris@19 43 {
Chris@19 44 E T1, T2, T7, T8;
Chris@19 45 T1 = ri[0];
Chris@19 46 T2 = ri[WS(is, 2)];
Chris@19 47 T7 = ii[0];
Chris@19 48 T8 = ii[WS(is, 2)];
Chris@19 49 T4 = ri[WS(is, 1)];
Chris@19 50 Tb = T1 - T2;
Chris@19 51 T3 = T1 + T2;
Chris@19 52 Tf = T7 + T8;
Chris@19 53 T9 = T7 - T8;
Chris@19 54 T5 = ri[WS(is, 3)];
Chris@19 55 Tc = ii[WS(is, 1)];
Chris@19 56 Td = ii[WS(is, 3)];
Chris@19 57 }
Chris@19 58 {
Chris@19 59 E T6, Ta, Te, Tg;
Chris@19 60 T6 = T4 + T5;
Chris@19 61 Ta = T4 - T5;
Chris@19 62 Te = Tc - Td;
Chris@19 63 Tg = Tc + Td;
Chris@19 64 io[WS(os, 3)] = Ta + T9;
Chris@19 65 io[WS(os, 1)] = T9 - Ta;
Chris@19 66 ro[0] = T3 + T6;
Chris@19 67 ro[WS(os, 2)] = T3 - T6;
Chris@19 68 io[0] = Tf + Tg;
Chris@19 69 io[WS(os, 2)] = Tf - Tg;
Chris@19 70 ro[WS(os, 3)] = Tb - Te;
Chris@19 71 ro[WS(os, 1)] = Tb + Te;
Chris@19 72 }
Chris@19 73 }
Chris@19 74 }
Chris@19 75 }
Chris@19 76
Chris@19 77 static const kdft_desc desc = { 4, "n1_4", {16, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@19 78
Chris@19 79 void X(codelet_n1_4) (planner *p) {
Chris@19 80 X(kdft_register) (p, n1_4, &desc);
Chris@19 81 }
Chris@19 82
Chris@19 83 #else /* HAVE_FMA */
Chris@19 84
Chris@19 85 /* Generated by: ../../../genfft/gen_notw.native -compact -variables 4 -pipeline-latency 4 -n 4 -name n1_4 -include n.h */
Chris@19 86
Chris@19 87 /*
Chris@19 88 * This function contains 16 FP additions, 0 FP multiplications,
Chris@19 89 * (or, 16 additions, 0 multiplications, 0 fused multiply/add),
Chris@19 90 * 13 stack variables, 0 constants, and 16 memory accesses
Chris@19 91 */
Chris@19 92 #include "n.h"
Chris@19 93
Chris@19 94 static void n1_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@19 95 {
Chris@19 96 {
Chris@19 97 INT i;
Chris@19 98 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(16, is), MAKE_VOLATILE_STRIDE(16, os)) {
Chris@19 99 E T3, Tb, T9, Tf, T6, Ta, Te, Tg;
Chris@19 100 {
Chris@19 101 E T1, T2, T7, T8;
Chris@19 102 T1 = ri[0];
Chris@19 103 T2 = ri[WS(is, 2)];
Chris@19 104 T3 = T1 + T2;
Chris@19 105 Tb = T1 - T2;
Chris@19 106 T7 = ii[0];
Chris@19 107 T8 = ii[WS(is, 2)];
Chris@19 108 T9 = T7 - T8;
Chris@19 109 Tf = T7 + T8;
Chris@19 110 }
Chris@19 111 {
Chris@19 112 E T4, T5, Tc, Td;
Chris@19 113 T4 = ri[WS(is, 1)];
Chris@19 114 T5 = ri[WS(is, 3)];
Chris@19 115 T6 = T4 + T5;
Chris@19 116 Ta = T4 - T5;
Chris@19 117 Tc = ii[WS(is, 1)];
Chris@19 118 Td = ii[WS(is, 3)];
Chris@19 119 Te = Tc - Td;
Chris@19 120 Tg = Tc + Td;
Chris@19 121 }
Chris@19 122 ro[WS(os, 2)] = T3 - T6;
Chris@19 123 io[WS(os, 2)] = Tf - Tg;
Chris@19 124 ro[0] = T3 + T6;
Chris@19 125 io[0] = Tf + Tg;
Chris@19 126 io[WS(os, 1)] = T9 - Ta;
Chris@19 127 ro[WS(os, 1)] = Tb + Te;
Chris@19 128 io[WS(os, 3)] = Ta + T9;
Chris@19 129 ro[WS(os, 3)] = Tb - Te;
Chris@19 130 }
Chris@19 131 }
Chris@19 132 }
Chris@19 133
Chris@19 134 static const kdft_desc desc = { 4, "n1_4", {16, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@19 135
Chris@19 136 void X(codelet_n1_4) (planner *p) {
Chris@19 137 X(kdft_register) (p, n1_4, &desc);
Chris@19 138 }
Chris@19 139
Chris@19 140 #endif /* HAVE_FMA */