Mercurial > hg > sv-dependency-builds

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

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
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:10 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_notw.native -fma -compact -variables 4 -pipeline-latency 4 -n 2 -name n1_2 -include dft/scalar/n.h */
Chris@82 29
Chris@82 30 /*
Chris@82 31 * This function contains 4 FP additions, 0 FP multiplications,
Chris@82 32 * (or, 4 additions, 0 multiplications, 0 fused multiply/add),
Chris@82 33 * 5 stack variables, 0 constants, and 8 memory accesses
Chris@82 34 */
Chris@82 35 #include "dft/scalar/n.h"
Chris@82 36
Chris@82 37 static void n1_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@82 38 {
Chris@82 39 {
Chris@82 40 INT i;
Chris@82 41 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(8, is), MAKE_VOLATILE_STRIDE(8, os)) {
Chris@82 42 E T1, T2, T3, T4;
Chris@82 43 T1 = ri[0];
Chris@82 44 T2 = ri[WS(is, 1)];
Chris@82 45 ro[WS(os, 1)] = T1 - T2;
Chris@82 46 ro[0] = T1 + T2;
Chris@82 47 T3 = ii[0];
Chris@82 48 T4 = ii[WS(is, 1)];
Chris@82 49 io[WS(os, 1)] = T3 - T4;
Chris@82 50 io[0] = T3 + T4;
Chris@82 51 }
Chris@82 52 }
Chris@82 53 }
Chris@82 54
Chris@82 55 static const kdft_desc desc = { 2, "n1_2", {4, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@82 56
Chris@82 57 void X(codelet_n1_2) (planner *p) {
Chris@82 58 X(kdft_register) (p, n1_2, &desc);
Chris@82 59 }
Chris@82 60
Chris@82 61 #else
Chris@82 62
Chris@82 63 /* Generated by: ../../../genfft/gen_notw.native -compact -variables 4 -pipeline-latency 4 -n 2 -name n1_2 -include dft/scalar/n.h */
Chris@82 64
Chris@82 65 /*
Chris@82 66 * This function contains 4 FP additions, 0 FP multiplications,
Chris@82 67 * (or, 4 additions, 0 multiplications, 0 fused multiply/add),
Chris@82 68 * 5 stack variables, 0 constants, and 8 memory accesses
Chris@82 69 */
Chris@82 70 #include "dft/scalar/n.h"
Chris@82 71
Chris@82 72 static void n1_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@82 73 {
Chris@82 74 {
Chris@82 75 INT i;
Chris@82 76 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(8, is), MAKE_VOLATILE_STRIDE(8, os)) {
Chris@82 77 E T1, T2, T3, T4;
Chris@82 78 T1 = ri[0];
Chris@82 79 T2 = ri[WS(is, 1)];
Chris@82 80 ro[WS(os, 1)] = T1 - T2;
Chris@82 81 ro[0] = T1 + T2;
Chris@82 82 T3 = ii[0];
Chris@82 83 T4 = ii[WS(is, 1)];
Chris@82 84 io[WS(os, 1)] = T3 - T4;
Chris@82 85 io[0] = T3 + T4;
Chris@82 86 }
Chris@82 87 }
Chris@82 88 }
Chris@82 89
Chris@82 90 static const kdft_desc desc = { 2, "n1_2", {4, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@82 91
Chris@82 92 void X(codelet_n1_2) (planner *p) {
Chris@82 93 X(kdft_register) (p, n1_2, &desc);
Chris@82 94 }
Chris@82 95
Chris@82 96 #endif