annotate src/fftw-3.3.3/dft/scalar/codelets/n1_2.c @ 23:619f715526df sv_v2.1

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