Mercurial > hg > sv-dependency-builds

annotate src/fftw-3.3.5/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 2cd0e3b3e1fd
children
rev   line source
Chris@42 1 /*
Chris@42 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42 4 *
Chris@42 5 * This program is free software; you can redistribute it and/or modify
Chris@42 6 * it under the terms of the GNU General Public License as published by
Chris@42 7 * the Free Software Foundation; either version 2 of the License, or
Chris@42 8 * (at your option) any later version.
Chris@42 9 *
Chris@42 10 * This program is distributed in the hope that it will be useful,
Chris@42 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@42 13 * GNU General Public License for more details.
Chris@42 14 *
Chris@42 15 * You should have received a copy of the GNU General Public License
Chris@42 16 * along with this program; if not, write to the Free Software
Chris@42 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@42 18 *
Chris@42 19 */
Chris@42 20
Chris@42 21 /* This file was automatically generated --- DO NOT EDIT */
Chris@42 22 /* Generated on Sat Jul 30 16:35:50 EDT 2016 */
Chris@42 23
Chris@42 24 #include "codelet-dft.h"
Chris@42 25
Chris@42 26 #ifdef HAVE_FMA
Chris@42 27
Chris@42 28 /* Generated by: ../../../genfft/gen_notw.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 2 -name n1_2 -include n.h */
Chris@42 29
Chris@42 30 /*
Chris@42 31 * This function contains 4 FP additions, 0 FP multiplications,
Chris@42 32 * (or, 4 additions, 0 multiplications, 0 fused multiply/add),
Chris@42 33 * 5 stack variables, 0 constants, and 8 memory accesses
Chris@42 34 */
Chris@42 35 #include "n.h"
Chris@42 36
Chris@42 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@42 38 {
Chris@42 39 {
Chris@42 40 INT i;
Chris@42 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@42 42 E T1, T2, T3, T4;
Chris@42 43 T1 = ri[0];
Chris@42 44 T2 = ri[WS(is, 1)];
Chris@42 45 T3 = ii[0];
Chris@42 46 T4 = ii[WS(is, 1)];
Chris@42 47 ro[0] = T1 + T2;
Chris@42 48 ro[WS(os, 1)] = T1 - T2;
Chris@42 49 io[0] = T3 + T4;
Chris@42 50 io[WS(os, 1)] = T3 - T4;
Chris@42 51 }
Chris@42 52 }
Chris@42 53 }
Chris@42 54
Chris@42 55 static const kdft_desc desc = { 2, "n1_2", {4, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@42 56
Chris@42 57 void X(codelet_n1_2) (planner *p) {
Chris@42 58 X(kdft_register) (p, n1_2, &desc);
Chris@42 59 }
Chris@42 60
Chris@42 61 #else /* HAVE_FMA */
Chris@42 62
Chris@42 63 /* Generated by: ../../../genfft/gen_notw.native -compact -variables 4 -pipeline-latency 4 -n 2 -name n1_2 -include n.h */
Chris@42 64
Chris@42 65 /*
Chris@42 66 * This function contains 4 FP additions, 0 FP multiplications,
Chris@42 67 * (or, 4 additions, 0 multiplications, 0 fused multiply/add),
Chris@42 68 * 5 stack variables, 0 constants, and 8 memory accesses
Chris@42 69 */
Chris@42 70 #include "n.h"
Chris@42 71
Chris@42 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@42 73 {
Chris@42 74 {
Chris@42 75 INT i;
Chris@42 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@42 77 E T1, T2, T3, T4;
Chris@42 78 T1 = ri[0];
Chris@42 79 T2 = ri[WS(is, 1)];
Chris@42 80 ro[WS(os, 1)] = T1 - T2;
Chris@42 81 ro[0] = T1 + T2;
Chris@42 82 T3 = ii[0];
Chris@42 83 T4 = ii[WS(is, 1)];
Chris@42 84 io[WS(os, 1)] = T3 - T4;
Chris@42 85 io[0] = T3 + T4;
Chris@42 86 }
Chris@42 87 }
Chris@42 88 }
Chris@42 89
Chris@42 90 static const kdft_desc desc = { 2, "n1_2", {4, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@42 91
Chris@42 92 void X(codelet_n1_2) (planner *p) {
Chris@42 93 X(kdft_register) (p, n1_2, &desc);
Chris@42 94 }
Chris@42 95
Chris@42 96 #endif /* HAVE_FMA */