annotate src/fftw-3.3.5/rdft/scalar/r2cf/hf_2.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:46:14 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 -n 2 -dit -name hf_2 -include hf.h */
Chris@42 29
Chris@42 30 /*
Chris@42 31 * This function contains 6 FP additions, 4 FP multiplications,
Chris@42 32 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
Chris@42 33 * 11 stack variables, 0 constants, and 8 memory accesses
Chris@42 34 */
Chris@42 35 #include "hf.h"
Chris@42 36
Chris@42 37 static void hf_2(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) * 2); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 2, MAKE_VOLATILE_STRIDE(4, rs)) {
Chris@42 42 E T1, Ta, T3, T6, T2, T5;
Chris@42 43 T1 = cr[0];
Chris@42 44 Ta = ci[0];
Chris@42 45 T3 = cr[WS(rs, 1)];
Chris@42 46 T6 = ci[WS(rs, 1)];
Chris@42 47 T2 = W[0];
Chris@42 48 T5 = W[1];
Chris@42 49 {
Chris@42 50 E T8, T4, T9, T7;
Chris@42 51 T8 = T2 * T6;
Chris@42 52 T4 = T2 * T3;
Chris@42 53 T9 = FNMS(T5, T3, T8);
Chris@42 54 T7 = FMA(T5, T6, T4);
Chris@42 55 ci[WS(rs, 1)] = T9 + Ta;
Chris@42 56 cr[WS(rs, 1)] = T9 - Ta;
Chris@42 57 cr[0] = T1 + T7;
Chris@42 58 ci[0] = T1 - T7;
Chris@42 59 }
Chris@42 60 }
Chris@42 61 }
Chris@42 62 }
Chris@42 63
Chris@42 64 static const tw_instr twinstr[] = {
Chris@42 65 {TW_FULL, 1, 2},
Chris@42 66 {TW_NEXT, 1, 0}
Chris@42 67 };
Chris@42 68
Chris@42 69 static const hc2hc_desc desc = { 2, "hf_2", twinstr, &GENUS, {4, 2, 2, 0} };
Chris@42 70
Chris@42 71 void X(codelet_hf_2) (planner *p) {
Chris@42 72 X(khc2hc_register) (p, hf_2, &desc);
Chris@42 73 }
Chris@42 74 #else /* HAVE_FMA */
Chris@42 75
Chris@42 76 /* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -n 2 -dit -name hf_2 -include hf.h */
Chris@42 77
Chris@42 78 /*
Chris@42 79 * This function contains 6 FP additions, 4 FP multiplications,
Chris@42 80 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
Chris@42 81 * 9 stack variables, 0 constants, and 8 memory accesses
Chris@42 82 */
Chris@42 83 #include "hf.h"
Chris@42 84
Chris@42 85 static void hf_2(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42 86 {
Chris@42 87 {
Chris@42 88 INT m;
Chris@42 89 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 2, MAKE_VOLATILE_STRIDE(4, rs)) {
Chris@42 90 E T1, T8, T6, T7;
Chris@42 91 T1 = cr[0];
Chris@42 92 T8 = ci[0];
Chris@42 93 {
Chris@42 94 E T3, T5, T2, T4;
Chris@42 95 T3 = cr[WS(rs, 1)];
Chris@42 96 T5 = ci[WS(rs, 1)];
Chris@42 97 T2 = W[0];
Chris@42 98 T4 = W[1];
Chris@42 99 T6 = FMA(T2, T3, T4 * T5);
Chris@42 100 T7 = FNMS(T4, T3, T2 * T5);
Chris@42 101 }
Chris@42 102 ci[0] = T1 - T6;
Chris@42 103 cr[0] = T1 + T6;
Chris@42 104 cr[WS(rs, 1)] = T7 - T8;
Chris@42 105 ci[WS(rs, 1)] = T7 + T8;
Chris@42 106 }
Chris@42 107 }
Chris@42 108 }
Chris@42 109
Chris@42 110 static const tw_instr twinstr[] = {
Chris@42 111 {TW_FULL, 1, 2},
Chris@42 112 {TW_NEXT, 1, 0}
Chris@42 113 };
Chris@42 114
Chris@42 115 static const hc2hc_desc desc = { 2, "hf_2", twinstr, &GENUS, {4, 2, 2, 0} };
Chris@42 116
Chris@42 117 void X(codelet_hf_2) (planner *p) {
Chris@42 118 X(khc2hc_register) (p, hf_2, &desc);
Chris@42 119 }
Chris@42 120 #endif /* HAVE_FMA */