/* * Copyright (c) 2003, 2007-8 Matteo Frigo * Copyright (c) 2003, 2007-8 Massachusetts Institute of Technology * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA * *//* This file was automatically generated --- DO NOT EDIT *//* Generated on Sat Nov 15 20:43:58 EST 2008 */#include "codelet-dft.h"#ifdef HAVE_FMA/* Generated by: ../../../genfft/gen_notw_c -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -sign 1 -n 2 -name n1bv_2 -include n1b.h *//* * This function contains 2 FP additions, 0 FP multiplications, * (or, 2 additions, 0 multiplications, 0 fused multiply/add), * 5 stack variables, 0 constants, and 4 memory accesses */#include "n1b.h"static void n1bv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs){     INT i;     const R *xi;     R *xo;     xi = ii;     xo = io;     for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(is), MAKE_VOLATILE_STRIDE(os)) {	  V T1, T2;	  T1 = LD(&(xi[0]), ivs, &(xi[0]));	  T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));	  ST(&(xo[0]), VADD(T1, T2), ovs, &(xo[0]));	  ST(&(xo[WS(os, 1)]), VSUB(T1, T2), ovs, &(xo[WS(os, 1)]));     }}static const kdft_desc desc = { 2, "n1bv_2", {2, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };void X(codelet_n1bv_2) (planner *p) {     X(kdft_register) (p, n1bv_2, &desc);}#else				/* HAVE_FMA *//* Generated by: ../../../genfft/gen_notw_c -simd -compact -variables 4 -pipeline-latency 8 -sign 1 -n 2 -name n1bv_2 -include n1b.h *//* * This function contains 2 FP additions, 0 FP multiplications, * (or, 2 additions, 0 multiplications, 0 fused multiply/add), * 5 stack variables, 0 constants, and 4 memory accesses */#include "n1b.h"static void n1bv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs){     INT i;     const R *xi;     R *xo;     xi = ii;     xo = io;     for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(is), MAKE_VOLATILE_STRIDE(os)) {	  V T1, T2;	  T1 = LD(&(xi[0]), ivs, &(xi[0]));	  T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));	  ST(&(xo[WS(os, 1)]), VSUB(T1, T2), ovs, &(xo[WS(os, 1)]));	  ST(&(xo[0]), VADD(T1, T2), ovs, &(xo[0]));     }}static const kdft_desc desc = { 2, "n1bv_2", {2, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };void X(codelet_n1bv_2) (planner *p) {     X(kdft_register) (p, n1bv_2, &desc);}#endif				/* HAVE_FMA */