annotate src/fftw-3.3.5/rdft/scalar/r2cb/hb_4.c @ 56:af97cad61ff0

Add updated build of PortAudio for OSX
author Chris Cannam <cannam@all-day-breakfast.com>
date Tue, 03 Jan 2017 15:10:52 +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:49: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_hc2hc.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 4 -dif -name hb_4 -include hb.h */
Chris@42 29
Chris@42 30 /*
Chris@42 31 * This function contains 22 FP additions, 12 FP multiplications,
Chris@42 32 * (or, 16 additions, 6 multiplications, 6 fused multiply/add),
Chris@42 33 * 27 stack variables, 0 constants, and 16 memory accesses
Chris@42 34 */
Chris@42 35 #include "hb.h"
Chris@42 36
Chris@42 37 static void hb_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42 38 {
Chris@42 39 {
Chris@42 40 INT m;
Chris@42 41 for (m = mb, W = W + ((mb - 1) * 6); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 6, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@42 42 E T8, Th, Ta, T7, Ti, T9;
Chris@42 43 {
Chris@42 44 E Td, Tg, T3, T6, Tu, Tm, Tx, Tr;
Chris@42 45 {
Chris@42 46 E Tq, Tl, T4, T5, Tk, Tp;
Chris@42 47 {
Chris@42 48 E Tb, Tc, Te, Tf, T1, T2;
Chris@42 49 Tb = ci[WS(rs, 3)];
Chris@42 50 Tc = cr[WS(rs, 2)];
Chris@42 51 Te = ci[WS(rs, 2)];
Chris@42 52 Tf = cr[WS(rs, 3)];
Chris@42 53 T1 = cr[0];
Chris@42 54 Tq = Tb + Tc;
Chris@42 55 Td = Tb - Tc;
Chris@42 56 T2 = ci[WS(rs, 1)];
Chris@42 57 Tl = Te + Tf;
Chris@42 58 Tg = Te - Tf;
Chris@42 59 T4 = cr[WS(rs, 1)];
Chris@42 60 T5 = ci[0];
Chris@42 61 T3 = T1 + T2;
Chris@42 62 Tk = T1 - T2;
Chris@42 63 }
Chris@42 64 Tp = T4 - T5;
Chris@42 65 T6 = T4 + T5;
Chris@42 66 Tu = Tk + Tl;
Chris@42 67 Tm = Tk - Tl;
Chris@42 68 Tx = Tq - Tp;
Chris@42 69 Tr = Tp + Tq;
Chris@42 70 T8 = T3 - T6;
Chris@42 71 }
Chris@42 72 cr[0] = T3 + T6;
Chris@42 73 {
Chris@42 74 E Tj, To, Tw, Tv;
Chris@42 75 Tj = W[0];
Chris@42 76 ci[0] = Td + Tg;
Chris@42 77 To = W[1];
Chris@42 78 {
Chris@42 79 E Tt, Ts, Tn, Ty;
Chris@42 80 Tt = W[4];
Chris@42 81 Ts = Tj * Tr;
Chris@42 82 Tn = Tj * Tm;
Chris@42 83 Tw = W[5];
Chris@42 84 Ty = Tt * Tx;
Chris@42 85 Tv = Tt * Tu;
Chris@42 86 ci[WS(rs, 1)] = FMA(To, Tm, Ts);
Chris@42 87 cr[WS(rs, 1)] = FNMS(To, Tr, Tn);
Chris@42 88 ci[WS(rs, 3)] = FMA(Tw, Tu, Ty);
Chris@42 89 }
Chris@42 90 cr[WS(rs, 3)] = FNMS(Tw, Tx, Tv);
Chris@42 91 Th = Td - Tg;
Chris@42 92 Ta = W[3];
Chris@42 93 T7 = W[2];
Chris@42 94 }
Chris@42 95 }
Chris@42 96 Ti = Ta * T8;
Chris@42 97 T9 = T7 * T8;
Chris@42 98 ci[WS(rs, 2)] = FMA(T7, Th, Ti);
Chris@42 99 cr[WS(rs, 2)] = FNMS(Ta, Th, T9);
Chris@42 100 }
Chris@42 101 }
Chris@42 102 }
Chris@42 103
Chris@42 104 static const tw_instr twinstr[] = {
Chris@42 105 {TW_FULL, 1, 4},
Chris@42 106 {TW_NEXT, 1, 0}
Chris@42 107 };
Chris@42 108
Chris@42 109 static const hc2hc_desc desc = { 4, "hb_4", twinstr, &GENUS, {16, 6, 6, 0} };
Chris@42 110
Chris@42 111 void X(codelet_hb_4) (planner *p) {
Chris@42 112 X(khc2hc_register) (p, hb_4, &desc);
Chris@42 113 }
Chris@42 114 #else /* HAVE_FMA */
Chris@42 115
Chris@42 116 /* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 4 -dif -name hb_4 -include hb.h */
Chris@42 117
Chris@42 118 /*
Chris@42 119 * This function contains 22 FP additions, 12 FP multiplications,
Chris@42 120 * (or, 16 additions, 6 multiplications, 6 fused multiply/add),
Chris@42 121 * 13 stack variables, 0 constants, and 16 memory accesses
Chris@42 122 */
Chris@42 123 #include "hb.h"
Chris@42 124
Chris@42 125 static void hb_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42 126 {
Chris@42 127 {
Chris@42 128 INT m;
Chris@42 129 for (m = mb, W = W + ((mb - 1) * 6); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 6, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@42 130 E T3, Ti, T6, Tm, Tc, Tn, Tf, Tj;
Chris@42 131 {
Chris@42 132 E T1, T2, T4, T5;
Chris@42 133 T1 = cr[0];
Chris@42 134 T2 = ci[WS(rs, 1)];
Chris@42 135 T3 = T1 + T2;
Chris@42 136 Ti = T1 - T2;
Chris@42 137 T4 = cr[WS(rs, 1)];
Chris@42 138 T5 = ci[0];
Chris@42 139 T6 = T4 + T5;
Chris@42 140 Tm = T4 - T5;
Chris@42 141 }
Chris@42 142 {
Chris@42 143 E Ta, Tb, Td, Te;
Chris@42 144 Ta = ci[WS(rs, 3)];
Chris@42 145 Tb = cr[WS(rs, 2)];
Chris@42 146 Tc = Ta - Tb;
Chris@42 147 Tn = Ta + Tb;
Chris@42 148 Td = ci[WS(rs, 2)];
Chris@42 149 Te = cr[WS(rs, 3)];
Chris@42 150 Tf = Td - Te;
Chris@42 151 Tj = Td + Te;
Chris@42 152 }
Chris@42 153 cr[0] = T3 + T6;
Chris@42 154 ci[0] = Tc + Tf;
Chris@42 155 {
Chris@42 156 E T8, Tg, T7, T9;
Chris@42 157 T8 = T3 - T6;
Chris@42 158 Tg = Tc - Tf;
Chris@42 159 T7 = W[2];
Chris@42 160 T9 = W[3];
Chris@42 161 cr[WS(rs, 2)] = FNMS(T9, Tg, T7 * T8);
Chris@42 162 ci[WS(rs, 2)] = FMA(T9, T8, T7 * Tg);
Chris@42 163 }
Chris@42 164 {
Chris@42 165 E Tk, To, Th, Tl;
Chris@42 166 Tk = Ti - Tj;
Chris@42 167 To = Tm + Tn;
Chris@42 168 Th = W[0];
Chris@42 169 Tl = W[1];
Chris@42 170 cr[WS(rs, 1)] = FNMS(Tl, To, Th * Tk);
Chris@42 171 ci[WS(rs, 1)] = FMA(Th, To, Tl * Tk);
Chris@42 172 }
Chris@42 173 {
Chris@42 174 E Tq, Ts, Tp, Tr;
Chris@42 175 Tq = Ti + Tj;
Chris@42 176 Ts = Tn - Tm;
Chris@42 177 Tp = W[4];
Chris@42 178 Tr = W[5];
Chris@42 179 cr[WS(rs, 3)] = FNMS(Tr, Ts, Tp * Tq);
Chris@42 180 ci[WS(rs, 3)] = FMA(Tp, Ts, Tr * Tq);
Chris@42 181 }
Chris@42 182 }
Chris@42 183 }
Chris@42 184 }
Chris@42 185
Chris@42 186 static const tw_instr twinstr[] = {
Chris@42 187 {TW_FULL, 1, 4},
Chris@42 188 {TW_NEXT, 1, 0}
Chris@42 189 };
Chris@42 190
Chris@42 191 static const hc2hc_desc desc = { 4, "hb_4", twinstr, &GENUS, {16, 6, 6, 0} };
Chris@42 192
Chris@42 193 void X(codelet_hb_4) (planner *p) {
Chris@42 194 X(khc2hc_register) (p, hb_4, &desc);
Chris@42 195 }
Chris@42 196 #endif /* HAVE_FMA */