annotate src/fftw-3.3.8/rdft/scalar/r2cb/hb_3.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:31 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_hc2hc.native -fma -compact -variables 4 -pipeline-latency 4 -sign 1 -n 3 -dif -name hb_3 -include rdft/scalar/hb.h */
Chris@82 29
Chris@82 30 /*
Chris@82 31 * This function contains 16 FP additions, 14 FP multiplications,
Chris@82 32 * (or, 6 additions, 4 multiplications, 10 fused multiply/add),
Chris@82 33 * 17 stack variables, 2 constants, and 12 memory accesses
Chris@82 34 */
Chris@82 35 #include "rdft/scalar/hb.h"
Chris@82 36
Chris@82 37 static void hb_3(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@82 38 {
Chris@82 39 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@82 40 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@82 41 {
Chris@82 42 INT m;
Chris@82 43 for (m = mb, W = W + ((mb - 1) * 4); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 4, MAKE_VOLATILE_STRIDE(6, rs)) {
Chris@82 44 E T1, T4, T6, Tg, Td, Te, T9, Tf;
Chris@82 45 {
Chris@82 46 E T2, T3, T7, T8;
Chris@82 47 T1 = cr[0];
Chris@82 48 T2 = cr[WS(rs, 1)];
Chris@82 49 T3 = ci[0];
Chris@82 50 T4 = T2 + T3;
Chris@82 51 T6 = FNMS(KP500000000, T4, T1);
Chris@82 52 Tg = T2 - T3;
Chris@82 53 Td = ci[WS(rs, 2)];
Chris@82 54 T7 = ci[WS(rs, 1)];
Chris@82 55 T8 = cr[WS(rs, 2)];
Chris@82 56 Te = T7 - T8;
Chris@82 57 T9 = T7 + T8;
Chris@82 58 Tf = FNMS(KP500000000, Te, Td);
Chris@82 59 }
Chris@82 60 cr[0] = T1 + T4;
Chris@82 61 ci[0] = Td + Te;
Chris@82 62 {
Chris@82 63 E Th, T5, Tb, Tc, Ti, Ta;
Chris@82 64 Th = FMA(KP866025403, Tg, Tf);
Chris@82 65 Ta = FNMS(KP866025403, T9, T6);
Chris@82 66 T5 = W[0];
Chris@82 67 Tb = T5 * Ta;
Chris@82 68 Tc = W[1];
Chris@82 69 Ti = Tc * Ta;
Chris@82 70 cr[WS(rs, 1)] = FNMS(Tc, Th, Tb);
Chris@82 71 ci[WS(rs, 1)] = FMA(T5, Th, Ti);
Chris@82 72 }
Chris@82 73 {
Chris@82 74 E Tn, Tj, Tl, Tm, To, Tk;
Chris@82 75 Tn = FNMS(KP866025403, Tg, Tf);
Chris@82 76 Tk = FMA(KP866025403, T9, T6);
Chris@82 77 Tj = W[2];
Chris@82 78 Tl = Tj * Tk;
Chris@82 79 Tm = W[3];
Chris@82 80 To = Tm * Tk;
Chris@82 81 cr[WS(rs, 2)] = FNMS(Tm, Tn, Tl);
Chris@82 82 ci[WS(rs, 2)] = FMA(Tj, Tn, To);
Chris@82 83 }
Chris@82 84 }
Chris@82 85 }
Chris@82 86 }
Chris@82 87
Chris@82 88 static const tw_instr twinstr[] = {
Chris@82 89 {TW_FULL, 1, 3},
Chris@82 90 {TW_NEXT, 1, 0}
Chris@82 91 };
Chris@82 92
Chris@82 93 static const hc2hc_desc desc = { 3, "hb_3", twinstr, &GENUS, {6, 4, 10, 0} };
Chris@82 94
Chris@82 95 void X(codelet_hb_3) (planner *p) {
Chris@82 96 X(khc2hc_register) (p, hb_3, &desc);
Chris@82 97 }
Chris@82 98 #else
Chris@82 99
Chris@82 100 /* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 3 -dif -name hb_3 -include rdft/scalar/hb.h */
Chris@82 101
Chris@82 102 /*
Chris@82 103 * This function contains 16 FP additions, 12 FP multiplications,
Chris@82 104 * (or, 10 additions, 6 multiplications, 6 fused multiply/add),
Chris@82 105 * 15 stack variables, 2 constants, and 12 memory accesses
Chris@82 106 */
Chris@82 107 #include "rdft/scalar/hb.h"
Chris@82 108
Chris@82 109 static void hb_3(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@82 110 {
Chris@82 111 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@82 112 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@82 113 {
Chris@82 114 INT m;
Chris@82 115 for (m = mb, W = W + ((mb - 1) * 4); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 4, MAKE_VOLATILE_STRIDE(6, rs)) {
Chris@82 116 E T1, T4, Ta, Te, T5, T8, Tb, Tf;
Chris@82 117 {
Chris@82 118 E T2, T3, T6, T7;
Chris@82 119 T1 = cr[0];
Chris@82 120 T2 = cr[WS(rs, 1)];
Chris@82 121 T3 = ci[0];
Chris@82 122 T4 = T2 + T3;
Chris@82 123 Ta = FNMS(KP500000000, T4, T1);
Chris@82 124 Te = KP866025403 * (T2 - T3);
Chris@82 125 T5 = ci[WS(rs, 2)];
Chris@82 126 T6 = ci[WS(rs, 1)];
Chris@82 127 T7 = cr[WS(rs, 2)];
Chris@82 128 T8 = T6 - T7;
Chris@82 129 Tb = KP866025403 * (T6 + T7);
Chris@82 130 Tf = FNMS(KP500000000, T8, T5);
Chris@82 131 }
Chris@82 132 cr[0] = T1 + T4;
Chris@82 133 ci[0] = T5 + T8;
Chris@82 134 {
Chris@82 135 E Tc, Tg, T9, Td;
Chris@82 136 Tc = Ta - Tb;
Chris@82 137 Tg = Te + Tf;
Chris@82 138 T9 = W[0];
Chris@82 139 Td = W[1];
Chris@82 140 cr[WS(rs, 1)] = FNMS(Td, Tg, T9 * Tc);
Chris@82 141 ci[WS(rs, 1)] = FMA(T9, Tg, Td * Tc);
Chris@82 142 }
Chris@82 143 {
Chris@82 144 E Ti, Tk, Th, Tj;
Chris@82 145 Ti = Ta + Tb;
Chris@82 146 Tk = Tf - Te;
Chris@82 147 Th = W[2];
Chris@82 148 Tj = W[3];
Chris@82 149 cr[WS(rs, 2)] = FNMS(Tj, Tk, Th * Ti);
Chris@82 150 ci[WS(rs, 2)] = FMA(Th, Tk, Tj * Ti);
Chris@82 151 }
Chris@82 152 }
Chris@82 153 }
Chris@82 154 }
Chris@82 155
Chris@82 156 static const tw_instr twinstr[] = {
Chris@82 157 {TW_FULL, 1, 3},
Chris@82 158 {TW_NEXT, 1, 0}
Chris@82 159 };
Chris@82 160
Chris@82 161 static const hc2hc_desc desc = { 3, "hb_3", twinstr, &GENUS, {10, 6, 6, 0} };
Chris@82 162
Chris@82 163 void X(codelet_hb_3) (planner *p) {
Chris@82 164 X(khc2hc_register) (p, hb_3, &desc);
Chris@82 165 }
Chris@82 166 #endif