Mercurial > hg > sv-dependency-builds

annotate src/fftw-3.3.5/rdft/scalar/r2cf/r2cf_6.c @ 56:af97cad61ff0

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
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:46:03 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_r2cf.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 6 -name r2cf_6 -include r2cf.h */
Chris@42 29
Chris@42 30 /*
Chris@42 31 * This function contains 14 FP additions, 4 FP multiplications,
Chris@42 32 * (or, 12 additions, 2 multiplications, 2 fused multiply/add),
Chris@42 33 * 13 stack variables, 2 constants, and 12 memory accesses
Chris@42 34 */
Chris@42 35 #include "r2cf.h"
Chris@42 36
Chris@42 37 static void r2cf_6(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
Chris@42 38 {
Chris@42 39 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@42 40 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@42 41 {
Chris@42 42 INT i;
Chris@42 43 for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) {
Chris@42 44 E T4, Td, T3, Tc, T9, T5;
Chris@42 45 {
Chris@42 46 E T1, T2, T7, T8;
Chris@42 47 T1 = R0[0];
Chris@42 48 T2 = R1[WS(rs, 1)];
Chris@42 49 T7 = R0[WS(rs, 2)];
Chris@42 50 T8 = R1[0];
Chris@42 51 T4 = R0[WS(rs, 1)];
Chris@42 52 Td = T1 + T2;
Chris@42 53 T3 = T1 - T2;
Chris@42 54 Tc = T7 + T8;
Chris@42 55 T9 = T7 - T8;
Chris@42 56 T5 = R1[WS(rs, 2)];
Chris@42 57 }
Chris@42 58 {
Chris@42 59 E T6, Tb, Te, Ta;
Chris@42 60 T6 = T4 - T5;
Chris@42 61 Tb = T4 + T5;
Chris@42 62 Te = Tb + Tc;
Chris@42 63 Ci[WS(csi, 2)] = KP866025403 * (Tb - Tc);
Chris@42 64 Ta = T6 + T9;
Chris@42 65 Ci[WS(csi, 1)] = KP866025403 * (T9 - T6);
Chris@42 66 Cr[0] = Td + Te;
Chris@42 67 Cr[WS(csr, 2)] = FNMS(KP500000000, Te, Td);
Chris@42 68 Cr[WS(csr, 3)] = T3 + Ta;
Chris@42 69 Cr[WS(csr, 1)] = FNMS(KP500000000, Ta, T3);
Chris@42 70 }
Chris@42 71 }
Chris@42 72 }
Chris@42 73 }
Chris@42 74
Chris@42 75 static const kr2c_desc desc = { 6, "r2cf_6", {12, 2, 2, 0}, &GENUS };
Chris@42 76
Chris@42 77 void X(codelet_r2cf_6) (planner *p) {
Chris@42 78 X(kr2c_register) (p, r2cf_6, &desc);
Chris@42 79 }
Chris@42 80
Chris@42 81 #else /* HAVE_FMA */
Chris@42 82
Chris@42 83 /* Generated by: ../../../genfft/gen_r2cf.native -compact -variables 4 -pipeline-latency 4 -n 6 -name r2cf_6 -include r2cf.h */
Chris@42 84
Chris@42 85 /*
Chris@42 86 * This function contains 14 FP additions, 4 FP multiplications,
Chris@42 87 * (or, 12 additions, 2 multiplications, 2 fused multiply/add),
Chris@42 88 * 17 stack variables, 2 constants, and 12 memory accesses
Chris@42 89 */
Chris@42 90 #include "r2cf.h"
Chris@42 91
Chris@42 92 static void r2cf_6(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
Chris@42 93 {
Chris@42 94 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@42 95 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@42 96 {
Chris@42 97 INT i;
Chris@42 98 for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) {
Chris@42 99 E T3, Td, T9, Tc, T6, Tb, T1, T2, Ta, Te;
Chris@42 100 T1 = R0[0];
Chris@42 101 T2 = R1[WS(rs, 1)];
Chris@42 102 T3 = T1 - T2;
Chris@42 103 Td = T1 + T2;
Chris@42 104 {
Chris@42 105 E T7, T8, T4, T5;
Chris@42 106 T7 = R0[WS(rs, 2)];
Chris@42 107 T8 = R1[0];
Chris@42 108 T9 = T7 - T8;
Chris@42 109 Tc = T7 + T8;
Chris@42 110 T4 = R0[WS(rs, 1)];
Chris@42 111 T5 = R1[WS(rs, 2)];
Chris@42 112 T6 = T4 - T5;
Chris@42 113 Tb = T4 + T5;
Chris@42 114 }
Chris@42 115 Ci[WS(csi, 1)] = KP866025403 * (T9 - T6);
Chris@42 116 Ta = T6 + T9;
Chris@42 117 Cr[WS(csr, 1)] = FNMS(KP500000000, Ta, T3);
Chris@42 118 Cr[WS(csr, 3)] = T3 + Ta;
Chris@42 119 Ci[WS(csi, 2)] = KP866025403 * (Tb - Tc);
Chris@42 120 Te = Tb + Tc;
Chris@42 121 Cr[WS(csr, 2)] = FNMS(KP500000000, Te, Td);
Chris@42 122 Cr[0] = Td + Te;
Chris@42 123 }
Chris@42 124 }
Chris@42 125 }
Chris@42 126
Chris@42 127 static const kr2c_desc desc = { 6, "r2cf_6", {12, 2, 2, 0}, &GENUS };
Chris@42 128
Chris@42 129 void X(codelet_r2cf_6) (planner *p) {
Chris@42 130 X(kr2c_register) (p, r2cf_6, &desc);
Chris@42 131 }
Chris@42 132
Chris@42 133 #endif /* HAVE_FMA */