annotate src/fftw-3.3.8/rdft/scalar/r2cb/hc2cbdft_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 d0c2a83c1364
children
rev   line source
Chris@82 1 /*
Chris@82 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@82 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@82 4 *
Chris@82 5 * This program is free software; you can redistribute it and/or modify
Chris@82 6 * it under the terms of the GNU General Public License as published by
Chris@82 7 * the Free Software Foundation; either version 2 of the License, or
Chris@82 8 * (at your option) any later version.
Chris@82 9 *
Chris@82 10 * This program is distributed in the hope that it will be useful,
Chris@82 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@82 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@82 13 * GNU General Public License for more details.
Chris@82 14 *
Chris@82 15 * You should have received a copy of the GNU General Public License
Chris@82 16 * along with this program; if not, write to the Free Software
Chris@82 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@82 18 *
Chris@82 19 */
Chris@82 20
Chris@82 21 /* This file was automatically generated --- DO NOT EDIT */
Chris@82 22 /* Generated on Thu May 24 08:07:57 EDT 2018 */
Chris@82 23
Chris@82 24 #include "rdft/codelet-rdft.h"
Chris@82 25
Chris@82 26 #if defined(ARCH_PREFERS_FMA) || defined(ISA_EXTENSION_PREFERS_FMA)
Chris@82 27
Chris@82 28 /* Generated by: ../../../genfft/gen_hc2cdft.native -fma -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -dif -name hc2cbdft_2 -include rdft/scalar/hc2cb.h */
Chris@82 29
Chris@82 30 /*
Chris@82 31 * This function contains 10 FP additions, 4 FP multiplications,
Chris@82 32 * (or, 8 additions, 2 multiplications, 2 fused multiply/add),
Chris@82 33 * 15 stack variables, 0 constants, and 8 memory accesses
Chris@82 34 */
Chris@82 35 #include "rdft/scalar/hc2cb.h"
Chris@82 36
Chris@82 37 static void hc2cbdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@82 38 {
Chris@82 39 {
Chris@82 40 INT m;
Chris@82 41 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@82 42 E T3, Ta, Tc, T9, Td, T4, T8, Tb, Te;
Chris@82 43 {
Chris@82 44 E T1, T2, T5, T6, T7;
Chris@82 45 T1 = Ip[0];
Chris@82 46 T2 = Im[0];
Chris@82 47 T3 = T1 - T2;
Chris@82 48 Ta = T1 + T2;
Chris@82 49 T5 = Rp[0];
Chris@82 50 T6 = Rm[0];
Chris@82 51 T7 = T5 - T6;
Chris@82 52 Tc = T5 + T6;
Chris@82 53 T9 = W[1];
Chris@82 54 Td = T9 * T7;
Chris@82 55 T4 = W[0];
Chris@82 56 T8 = T4 * T7;
Chris@82 57 }
Chris@82 58 Tb = FNMS(T9, Ta, T8);
Chris@82 59 Ip[0] = T3 + Tb;
Chris@82 60 Im[0] = Tb - T3;
Chris@82 61 Te = FMA(T4, Ta, Td);
Chris@82 62 Rp[0] = Tc - Te;
Chris@82 63 Rm[0] = Tc + Te;
Chris@82 64 }
Chris@82 65 }
Chris@82 66 }
Chris@82 67
Chris@82 68 static const tw_instr twinstr[] = {
Chris@82 69 {TW_FULL, 1, 2},
Chris@82 70 {TW_NEXT, 1, 0}
Chris@82 71 };
Chris@82 72
Chris@82 73 static const hc2c_desc desc = { 2, "hc2cbdft_2", twinstr, &GENUS, {8, 2, 2, 0} };
Chris@82 74
Chris@82 75 void X(codelet_hc2cbdft_2) (planner *p) {
Chris@82 76 X(khc2c_register) (p, hc2cbdft_2, &desc, HC2C_VIA_DFT);
Chris@82 77 }
Chris@82 78 #else
Chris@82 79
Chris@82 80 /* Generated by: ../../../genfft/gen_hc2cdft.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -dif -name hc2cbdft_2 -include rdft/scalar/hc2cb.h */
Chris@82 81
Chris@82 82 /*
Chris@82 83 * This function contains 10 FP additions, 4 FP multiplications,
Chris@82 84 * (or, 8 additions, 2 multiplications, 2 fused multiply/add),
Chris@82 85 * 9 stack variables, 0 constants, and 8 memory accesses
Chris@82 86 */
Chris@82 87 #include "rdft/scalar/hc2cb.h"
Chris@82 88
Chris@82 89 static void hc2cbdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@82 90 {
Chris@82 91 {
Chris@82 92 INT m;
Chris@82 93 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@82 94 E T3, T9, T7, Tb;
Chris@82 95 {
Chris@82 96 E T1, T2, T5, T6;
Chris@82 97 T1 = Ip[0];
Chris@82 98 T2 = Im[0];
Chris@82 99 T3 = T1 - T2;
Chris@82 100 T9 = T1 + T2;
Chris@82 101 T5 = Rp[0];
Chris@82 102 T6 = Rm[0];
Chris@82 103 T7 = T5 - T6;
Chris@82 104 Tb = T5 + T6;
Chris@82 105 }
Chris@82 106 {
Chris@82 107 E Ta, Tc, T4, T8;
Chris@82 108 T4 = W[0];
Chris@82 109 T8 = W[1];
Chris@82 110 Ta = FNMS(T8, T9, T4 * T7);
Chris@82 111 Tc = FMA(T8, T7, T4 * T9);
Chris@82 112 Ip[0] = T3 + Ta;
Chris@82 113 Rp[0] = Tb - Tc;
Chris@82 114 Im[0] = Ta - T3;
Chris@82 115 Rm[0] = Tb + Tc;
Chris@82 116 }
Chris@82 117 }
Chris@82 118 }
Chris@82 119 }
Chris@82 120
Chris@82 121 static const tw_instr twinstr[] = {
Chris@82 122 {TW_FULL, 1, 2},
Chris@82 123 {TW_NEXT, 1, 0}
Chris@82 124 };
Chris@82 125
Chris@82 126 static const hc2c_desc desc = { 2, "hc2cbdft_2", twinstr, &GENUS, {8, 2, 2, 0} };
Chris@82 127
Chris@82 128 void X(codelet_hc2cbdft_2) (planner *p) {
Chris@82 129 X(khc2c_register) (p, hc2cbdft_2, &desc, HC2C_VIA_DFT);
Chris@82 130 }
Chris@82 131 #endif