annotate src/fftw-3.3.5/dft/scalar/codelets/n1_4.c @ 169:223a55898ab9 tip default

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