Chris@10: /*
Chris@10:  * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10:  * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10:  *
Chris@10:  * This program is free software; you can redistribute it and/or modify
Chris@10:  * it under the terms of the GNU General Public License as published by
Chris@10:  * the Free Software Foundation; either version 2 of the License, or
Chris@10:  * (at your option) any later version.
Chris@10:  *
Chris@10:  * This program is distributed in the hope that it will be useful,
Chris@10:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@10:  * GNU General Public License for more details.
Chris@10:  *
Chris@10:  * You should have received a copy of the GNU General Public License
Chris@10:  * along with this program; if not, write to the Free Software
Chris@10:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@10:  *
Chris@10:  */
Chris@10: 
Chris@10: /* This file was automatically generated --- DO NOT EDIT */
Chris@10: /* Generated on Sun Nov 25 07:36:17 EST 2012 */
Chris@10: 
Chris@10: #include "codelet-dft.h"
Chris@10: 
Chris@10: #ifdef HAVE_FMA
Chris@10: 
Chris@10: /* Generated by: ../../../genfft/gen_twidsq.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -reload-twiddle -dif -n 2 -name q1_2 -include q.h */
Chris@10: 
Chris@10: /*
Chris@10:  * This function contains 12 FP additions, 8 FP multiplications,
Chris@10:  * (or, 8 additions, 4 multiplications, 4 fused multiply/add),
Chris@10:  * 21 stack variables, 0 constants, and 16 memory accesses
Chris@10:  */
Chris@10: #include "q.h"
Chris@10: 
Chris@10: static void q1_2(R *rio, R *iio, const R *W, stride rs, stride vs, INT mb, INT me, INT ms)
Chris@10: {
Chris@10:      {
Chris@10: 	  INT m;
Chris@10: 	  for (m = mb, W = W + (mb * 2); m < me; m = m + 1, rio = rio + ms, iio = iio + ms, W = W + 2, MAKE_VOLATILE_STRIDE(4, rs), MAKE_VOLATILE_STRIDE(0, vs)) {
Chris@10: 	       E T9, T6, T5;
Chris@10: 	       {
Chris@10: 		    E T1, T2, T7, T8, Tb, T4, Tc, Th, Ti, Te, Tj, Td, Tg;
Chris@10: 		    T1 = rio[0];
Chris@10: 		    T2 = rio[WS(rs, 1)];
Chris@10: 		    T7 = iio[0];
Chris@10: 		    T8 = iio[WS(rs, 1)];
Chris@10: 		    Tb = rio[WS(vs, 1)];
Chris@10: 		    T4 = T1 - T2;
Chris@10: 		    Tc = rio[WS(vs, 1) + WS(rs, 1)];
Chris@10: 		    T9 = T7 - T8;
Chris@10: 		    Th = iio[WS(vs, 1)];
Chris@10: 		    Ti = iio[WS(vs, 1) + WS(rs, 1)];
Chris@10: 		    Te = Tb - Tc;
Chris@10: 		    rio[0] = T1 + T2;
Chris@10: 		    iio[0] = T7 + T8;
Chris@10: 		    Tj = Th - Ti;
Chris@10: 		    rio[WS(rs, 1)] = Tb + Tc;
Chris@10: 		    iio[WS(rs, 1)] = Th + Ti;
Chris@10: 		    Td = W[0];
Chris@10: 		    Tg = W[1];
Chris@10: 		    {
Chris@10: 			 E T3, Tk, Tf, Ta;
Chris@10: 			 T3 = W[0];
Chris@10: 			 T6 = W[1];
Chris@10: 			 Tk = Td * Tj;
Chris@10: 			 Tf = Td * Te;
Chris@10: 			 Ta = T3 * T9;
Chris@10: 			 T5 = T3 * T4;
Chris@10: 			 iio[WS(vs, 1) + WS(rs, 1)] = FNMS(Tg, Te, Tk);
Chris@10: 			 rio[WS(vs, 1) + WS(rs, 1)] = FMA(Tg, Tj, Tf);
Chris@10: 			 iio[WS(vs, 1)] = FNMS(T6, T4, Ta);
Chris@10: 		    }
Chris@10: 	       }
Chris@10: 	       rio[WS(vs, 1)] = FMA(T6, T9, T5);
Chris@10: 	  }
Chris@10:      }
Chris@10: }
Chris@10: 
Chris@10: static const tw_instr twinstr[] = {
Chris@10:      {TW_FULL, 0, 2},
Chris@10:      {TW_NEXT, 1, 0}
Chris@10: };
Chris@10: 
Chris@10: static const ct_desc desc = { 2, "q1_2", twinstr, &GENUS, {8, 4, 4, 0}, 0, 0, 0 };
Chris@10: 
Chris@10: void X(codelet_q1_2) (planner *p) {
Chris@10:      X(kdft_difsq_register) (p, q1_2, &desc);
Chris@10: }
Chris@10: #else				/* HAVE_FMA */
Chris@10: 
Chris@10: /* Generated by: ../../../genfft/gen_twidsq.native -compact -variables 4 -pipeline-latency 4 -reload-twiddle -dif -n 2 -name q1_2 -include q.h */
Chris@10: 
Chris@10: /*
Chris@10:  * This function contains 12 FP additions, 8 FP multiplications,
Chris@10:  * (or, 8 additions, 4 multiplications, 4 fused multiply/add),
Chris@10:  * 17 stack variables, 0 constants, and 16 memory accesses
Chris@10:  */
Chris@10: #include "q.h"
Chris@10: 
Chris@10: static void q1_2(R *rio, R *iio, const R *W, stride rs, stride vs, INT mb, INT me, INT ms)
Chris@10: {
Chris@10:      {
Chris@10: 	  INT m;
Chris@10: 	  for (m = mb, W = W + (mb * 2); m < me; m = m + 1, rio = rio + ms, iio = iio + ms, W = W + 2, MAKE_VOLATILE_STRIDE(4, rs), MAKE_VOLATILE_STRIDE(0, vs)) {
Chris@10: 	       E T1, T2, T4, T6, T7, T8, T9, Ta, Tc, Te, Tf, Tg;
Chris@10: 	       T1 = rio[0];
Chris@10: 	       T2 = rio[WS(rs, 1)];
Chris@10: 	       T4 = T1 - T2;
Chris@10: 	       T6 = iio[0];
Chris@10: 	       T7 = iio[WS(rs, 1)];
Chris@10: 	       T8 = T6 - T7;
Chris@10: 	       T9 = rio[WS(vs, 1)];
Chris@10: 	       Ta = rio[WS(vs, 1) + WS(rs, 1)];
Chris@10: 	       Tc = T9 - Ta;
Chris@10: 	       Te = iio[WS(vs, 1)];
Chris@10: 	       Tf = iio[WS(vs, 1) + WS(rs, 1)];
Chris@10: 	       Tg = Te - Tf;
Chris@10: 	       rio[0] = T1 + T2;
Chris@10: 	       iio[0] = T6 + T7;
Chris@10: 	       rio[WS(rs, 1)] = T9 + Ta;
Chris@10: 	       iio[WS(rs, 1)] = Te + Tf;
Chris@10: 	       {
Chris@10: 		    E Tb, Td, T3, T5;
Chris@10: 		    Tb = W[0];
Chris@10: 		    Td = W[1];
Chris@10: 		    rio[WS(vs, 1) + WS(rs, 1)] = FMA(Tb, Tc, Td * Tg);
Chris@10: 		    iio[WS(vs, 1) + WS(rs, 1)] = FNMS(Td, Tc, Tb * Tg);
Chris@10: 		    T3 = W[0];
Chris@10: 		    T5 = W[1];
Chris@10: 		    rio[WS(vs, 1)] = FMA(T3, T4, T5 * T8);
Chris@10: 		    iio[WS(vs, 1)] = FNMS(T5, T4, T3 * T8);
Chris@10: 	       }
Chris@10: 	  }
Chris@10:      }
Chris@10: }
Chris@10: 
Chris@10: static const tw_instr twinstr[] = {
Chris@10:      {TW_FULL, 0, 2},
Chris@10:      {TW_NEXT, 1, 0}
Chris@10: };
Chris@10: 
Chris@10: static const ct_desc desc = { 2, "q1_2", twinstr, &GENUS, {8, 4, 4, 0}, 0, 0, 0 };
Chris@10: 
Chris@10: void X(codelet_q1_2) (planner *p) {
Chris@10:      X(kdft_difsq_register) (p, q1_2, &desc);
Chris@10: }
Chris@10: #endif				/* HAVE_FMA */