annotate src/fftw-3.3.5/rdft/scalar/r2cf/hc2cfdft_2.c @ 83:ae30d91d2ffe

Replace these with versions built using an older toolset (so as to avoid ABI compatibilities when linking on Ubuntu 14.04 for packaging purposes)
author Chris Cannam
date Fri, 07 Feb 2020 11:51:13 +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:48:40 EDT 2016 */
Chris@42 23
Chris@42 24 #include "codelet-rdft.h"
Chris@42 25
Chris@42 26 #ifdef HAVE_FMA
Chris@42 27
Chris@42 28 /* Generated by: ../../../genfft/gen_hc2cdft.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 2 -dit -name hc2cfdft_2 -include hc2cf.h */
Chris@42 29
Chris@42 30 /*
Chris@42 31 * This function contains 10 FP additions, 8 FP multiplications,
Chris@42 32 * (or, 8 additions, 6 multiplications, 2 fused multiply/add),
Chris@42 33 * 12 stack variables, 1 constants, and 8 memory accesses
Chris@42 34 */
Chris@42 35 #include "hc2cf.h"
Chris@42 36
Chris@42 37 static void hc2cfdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42 38 {
Chris@42 39 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@42 40 {
Chris@42 41 INT m;
Chris@42 42 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 2, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@42 43 E T9, Ta, T3, Tc, T7, T4;
Chris@42 44 {
Chris@42 45 E T1, T2, T5, T6;
Chris@42 46 T1 = Ip[0];
Chris@42 47 T2 = Im[0];
Chris@42 48 T5 = Rm[0];
Chris@42 49 T6 = Rp[0];
Chris@42 50 T9 = W[1];
Chris@42 51 Ta = T1 + T2;
Chris@42 52 T3 = T1 - T2;
Chris@42 53 Tc = T6 + T5;
Chris@42 54 T7 = T5 - T6;
Chris@42 55 T4 = W[0];
Chris@42 56 }
Chris@42 57 {
Chris@42 58 E Td, T8, Te, Tb;
Chris@42 59 Td = T9 * T7;
Chris@42 60 T8 = T4 * T7;
Chris@42 61 Te = FMA(T4, Ta, Td);
Chris@42 62 Tb = FNMS(T9, Ta, T8);
Chris@42 63 Rp[0] = KP500000000 * (Tc + Te);
Chris@42 64 Rm[0] = KP500000000 * (Tc - Te);
Chris@42 65 Im[0] = KP500000000 * (Tb - T3);
Chris@42 66 Ip[0] = KP500000000 * (T3 + Tb);
Chris@42 67 }
Chris@42 68 }
Chris@42 69 }
Chris@42 70 }
Chris@42 71
Chris@42 72 static const tw_instr twinstr[] = {
Chris@42 73 {TW_FULL, 1, 2},
Chris@42 74 {TW_NEXT, 1, 0}
Chris@42 75 };
Chris@42 76
Chris@42 77 static const hc2c_desc desc = { 2, "hc2cfdft_2", twinstr, &GENUS, {8, 6, 2, 0} };
Chris@42 78
Chris@42 79 void X(codelet_hc2cfdft_2) (planner *p) {
Chris@42 80 X(khc2c_register) (p, hc2cfdft_2, &desc, HC2C_VIA_DFT);
Chris@42 81 }
Chris@42 82 #else /* HAVE_FMA */
Chris@42 83
Chris@42 84 /* Generated by: ../../../genfft/gen_hc2cdft.native -compact -variables 4 -pipeline-latency 4 -n 2 -dit -name hc2cfdft_2 -include hc2cf.h */
Chris@42 85
Chris@42 86 /*
Chris@42 87 * This function contains 10 FP additions, 8 FP multiplications,
Chris@42 88 * (or, 8 additions, 6 multiplications, 2 fused multiply/add),
Chris@42 89 * 10 stack variables, 1 constants, and 8 memory accesses
Chris@42 90 */
Chris@42 91 #include "hc2cf.h"
Chris@42 92
Chris@42 93 static void hc2cfdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42 94 {
Chris@42 95 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@42 96 {
Chris@42 97 INT m;
Chris@42 98 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 2, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@42 99 E T3, T9, T7, Tb;
Chris@42 100 {
Chris@42 101 E T1, T2, T5, T6;
Chris@42 102 T1 = Ip[0];
Chris@42 103 T2 = Im[0];
Chris@42 104 T3 = T1 - T2;
Chris@42 105 T9 = T1 + T2;
Chris@42 106 T5 = Rm[0];
Chris@42 107 T6 = Rp[0];
Chris@42 108 T7 = T5 - T6;
Chris@42 109 Tb = T6 + T5;
Chris@42 110 }
Chris@42 111 {
Chris@42 112 E Ta, Tc, T4, T8;
Chris@42 113 T4 = W[0];
Chris@42 114 T8 = W[1];
Chris@42 115 Ta = FNMS(T8, T9, T4 * T7);
Chris@42 116 Tc = FMA(T8, T7, T4 * T9);
Chris@42 117 Ip[0] = KP500000000 * (T3 + Ta);
Chris@42 118 Rp[0] = KP500000000 * (Tb + Tc);
Chris@42 119 Im[0] = KP500000000 * (Ta - T3);
Chris@42 120 Rm[0] = KP500000000 * (Tb - Tc);
Chris@42 121 }
Chris@42 122 }
Chris@42 123 }
Chris@42 124 }
Chris@42 125
Chris@42 126 static const tw_instr twinstr[] = {
Chris@42 127 {TW_FULL, 1, 2},
Chris@42 128 {TW_NEXT, 1, 0}
Chris@42 129 };
Chris@42 130
Chris@42 131 static const hc2c_desc desc = { 2, "hc2cfdft_2", twinstr, &GENUS, {8, 6, 2, 0} };
Chris@42 132
Chris@42 133 void X(codelet_hc2cfdft_2) (planner *p) {
Chris@42 134 X(khc2c_register) (p, hc2cfdft_2, &desc, HC2C_VIA_DFT);
Chris@42 135 }
Chris@42 136 #endif /* HAVE_FMA */